The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
PHP is the dominant server-side scripting language used to implement dynamic web content. Just-in-time compilation, as implemented in Facebook's state-of-the-art HipHopVM, helps mitigate the poor performance of PHP, but substantial overheads remain, especially for realistic, large-scale PHP applications. This paper analyzes such applications and shows that there is little opportunity for conventional...
Inverse classification is the process of manipulating an instance such that it is more likely to conform to a specific class. Past methods that address such a problem have shortcomings. Greedy methods make changes that are overly radical, often relying on data that is strictly discrete. Other methods rely on certain data points, the presence of which cannot be guaranteed. In this paper we propose...
Post-database searching is a key procedure for peptide spectrum matches (PSMs) in protein identification with mass spectrometry-based strategies. Although many machine learning-based approaches have been developed to improve the accuracy of peptide identification, the challenge remains for improvement due to the poor quality of data samples. CRanker has shown its effectiveness and efficiency in terms...
Bayesian optimization (BO) has recently emerged as a powerful and flexible tool for hyper-parameter tuning and more generally for the efficient global optimization of expensive black-box functions. Systems implementing BO has successfully solved difficult problems in automatic design choices and machine learning hyper-parameters tunings. Many recent advances in the methodologies and theories underlying...
With the ever increasing volume of video content, efficient and effective video summarization (VS) techniques are urgently demanded to manage the large amount of video data. Recent developments on sparse representation based approaches have demonstrated promising results for VS. While most existing approaches treat each frame independently, in this paper, the block-sparsity, which means the keyframes...
In this study, improved antlion optimization algo-rithm (IALO) is presented. The antlion optimization algorithm (ALO) is an heuristic optimization algorithm based on modeling random walks of ants and hunting ants by antlions. The random walk model of ALO and the IALO revealed by improvements in the selection method have been tested with benchmark functions with different characteristics from the literature...
The solution of difficult problems can be realized in shorter time with heuristic algorithms. There are many heuristic algorithms. In this study, artificial bee colony (ABC), biogeography based optimization (BBO), cuckoo bird search algorithm (CSO), differential evolution (DE), imperialist competitive algorithm (ICA) and particle swarm algorithm (PSO) have been chosen due to reasons such as the widespread...
In this study, crabs mating optimization (CRAB) algorithm that is one of the heuristic algorithms, has been developed and a monogamous crab mating optimization (MCO) algorithm has been proposed. In development, the main goal is to develop an algorithm that runs faster than the CRAB algorithm, to ensure obtaining good results like the CRAB algorithm. The developed MCO algorithm is compared with the...
In this study, the effect of distributions of solution candidates on the problem space in the meta-heuristic search process and the performance of algorithms has been investigated. For this purpose, solution candidates have been created with random and gauss (normal) distributions. Search performance is measured separately for both types of distribution of algorithms. The performances of the algorithms...
In a closely coupled heterogeneous computing system the work is shared amongst all available computing resources. One challenge is to find an optimal division of work between the two or more very different kinds of processing units, each with their own optimal settings. We show that through the use of statistical techniques, a systematic search of the parameter space can be conducted. These techniques...
Classifiers trained on given databases perform poorly when tested on data acquired in different settings. This is explained in domain adaptation through a shift among distributions of the source and target domains. Attempts to align them have traditionally resulted in works reducing the domain shift by introducing appropriate loss terms, measuring the discrepancies between source and target distributions,...
To reduce the false positives of static analysis, many tools collect path constraints and integrate SMT solvers to filter unreachable execution paths. However, the accumulated calling and computing of SMT solvers are time and resource consuming. This paper presents TsmartLW, an alternate static analysis tool in which we implement a path constraint solving engine to speed up reachability determination...
This study presents a new sine and cosine (S&C) optimization algorithm using a novel position update approach. In the proposed algorithm, the position update procedure for each search agent is determined by two coefficients, namely the exploration rate and the exploitation rate. These coefficients are updated in each run of the algorithm and provide an appropriate balance between the exploration...
Designing and optimizing computer systems require deep understanding of the underlying system. Historically many important observations that led to the development of essential hardware and software optimizations were driven by empirical studies of program behavior. In this paper we report an interesting property of dynamic program execution by viewing it as a changing (or social) network. In a program...
Dynamic programming languages are becoming increasingly popular, and this motivates the need for just-in-time (JIT) compilation to close the productivity/performance gap. Unfortunately, developing custom JIT-optimizing virtual machines (VMs) requires significant effort. Recent work has shown the promiseofmeta-JITframeworks, which abstract the language definition from the VM internals. Meta-JITs can...
This paper introduces a new initialization method of individuals for genetic algorithm (GA) in portfolio optimization problems. In our approach, first a set of assets, variables, composing the portfolio is selected, and then combination of real-valued weights of the portfolio is optimized by GA. In the asset selection, a pairwise asset selection which is an iterative greedy scheme based on the bordered...
Multithread programming tools become popular for exploitation of high performance processing with the dissemination of multicore processors. In this context, it is also popular to exploit compiler optimization to improve the performance at execution time. In this work, we evaluate the performance achieved by the use of flags -O1, -O2, and -O3 of two C compilers (GCC and ICC) associated with five different...
The set-based concept approach has been suggested as a means to simultaneously explore different design concepts, which are meaningful sub-sets of the entire set of solutions. Previous efforts concerning the suggested approach focused on either revealing the global front (s-Pareto front), of all the concepts, or on finding the concepts' fronts, within a relaxation zone. In contrast, here the aim is...
Quantum-behaved particle swarm optimization (QPSO) is a novel variant of particle swarm optimization (PSO), inspired by quantum mechanics. Compared with traditional PSO, the QPSO algorithm guarantees global convergence and has less number of controlling parameters. However, QPSO is likely to get trapped into a local optimum because of using a single search strategy. This paper proposes a cooperative...
Although numerous loop optimization techniques have been designed and deployed in commercial compilers in the past, virtually no common experimental infrastructure nor repository exists to help the compiler community evaluate the effectiveness of these techniques. This paper describes a repository, LORE, that maintains a large number of C language for loop nests extracted from popular benchmarks,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.