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.
Decentralized and hierarchical microgrid control strategies have lain the groundwork for shaping the future smart grid. Such control approaches require the cooperation between microgrid operators in control centers, intelligent microcontrollers, and remote terminal units via secure and reliable communication networks. In order to enhance the security and complement the work of network intrusion detection...
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...
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...
A hybrid sampling technique is proposed by combining Complementary Fuzzy Support Vector Machine (CMTFSVM) and Synthetic Minority Oversampling Technique (SMOTE) for handling the imbalanced classification problem. The proposed technique uses an optimised membership function to enhance the classification performance and it is compared with three different classifiers. The experiments consisted of four...
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...
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...
The bare bones particle swarm optimization (BBPSO) is a population-based algorithm. The BBPSO is famous for easy coding and fast applying. A Gaussian distribution is used to control the behavior of the particles. However, every particle learning from a same particle may cause the premature convergence. To solve this problem, a new hierarchical bare bones particle swarm optimization algorithm is proposed...
Floating-point computations produce approximate results, possibly leading to inaccuracy and reproducibility problems. Existing work addresses two issues: first, the design of high precision floating-point representations; second, the study of methods to trade off accuracy and performance of CPU applications. However, a comprehensive study of the tradeoffs between accuracy and performance on modern...
While Markov Random Fields (MRFs) are widely used in computer vision, they present a quite challenging inference problem. MRF inference can be accelerated by preprocessing techniques like Dead End Elimination (DEE) [8] or QPBO-based approaches [18, 24, 25] which compute the optimal labeling of a subset of variables. These techniques are guaranteed to never wrongly label a variable but they often leave...
Object-to-camera motion produces a variety of apparent motion patterns that significantly affect performance of short-term visual trackers. Despite being crucial for designing robust trackers, their influence is poorly explored in standard benchmarks due to weakly defined, biased and overlapping attribute annotations. In this paper we propose to go beyond pre-recorded benchmarks with post-hoc annotations...
Fast yield ramping in a new technology to meet aggressive time-to-market deadlines requires a comprehensive design and fabrication methodology for silicon test structures that systematically explores and validates the technology. Prior work proposed a novel logic characterization vehicle (LCV), along with an implementation flow that produces a test chip that ensures logic demographics that resemble...
Dividing a dataset into disjoint groups of homogeneous structure, known as data clustering, constitutes an important problem of data analysis. It can be solved with broad range of methods employing statistical approaches or heuristic procedures. The latter often include mechanisms known from nature as they are known to serve as useful components of effective optimizers. The paper investigates the...
We evaluate the on-node interference caused when co-locating traditional high-performance computing applications with a big-data application. Using kernel benchmarks from the NPB suite and a state-of-art graph analytics code, we explore different process placements and effects they have on application performance. Our results show that the most memory intensive HPC application (MG) experienced the...
The GraphBLAS C specification provisional release 1.0 is complete. To manage the scope of the project, we had to defer important functionality to a future version of the specification. For example, we are well aware that many algorithms benefit from an inspector-executor execution strategy. We also know that users would benefit from a number of standard predefined semirings as well as more general...
In this paper, a particle swarm optimization method with a new strategy for inertia weight has been considered. The author abandoned the commonly used linear inertia weight and proposed a new dynamic inertia weight based on fitness of the particles. The new weight is a function of the best and the worst fitness of the particles. The considered NIWPSO algorithm was tested on a set of benchmark functions...
In this study, the convergence speed and fitness function accuracy have been compared with the original algorithm by developing on the Stochastic Fractal Search (SFS) algorithm. Seven classical mathematical benchmark functions used in testing the optimization algorithms in the literature were used in comparison process. In the original SFS algorithm, the Gaussian walk function is used to find new...
With NVIDA Tegra Jetson X1 and Pascal P100 GPUs, NVIDIA introduced hardware-based computation on FP16 numbers also called half-precision arithmetic. In this talk, we will introduce the steps required to build a viable benchmark for this new arithmetic format. This will include the connections to established IEEE floating point standards and existing HPC benchmarks. The discussion will focus on performance...
Nowadays, the attraction of the optimization techniques based on artificial intelligence has increased the due to obtaining the its successful results on the difficult optimization problems in various areas. The artificial bee colony (ABC) algorithm based on swarm intelligence and the differential evolution (DE) algorithm improved by inspiring the natural biological evolution mechanism is the most...
Particle Swarm Optimization (PSO) is fast and popular algorithm to find the optimum value of non-linear and multi-dimensional function. However, it often easily trapped into local optima because the particles move closer to the best particle quickly. This paper purposes a new algorithm called Multi-Group Particle Swarm Optimization with Random Redistribution (MGRR-PSO) that tried to solve the weakness...
Public rescue service system design is determined by deployment of limited number of service centers at positions from a given set of possible locations. The robust service system design is usually performed so that the design complies with specified scenarios by minimizing the maximal value of the objective functions corresponding to the particular scenarios. As the set of detrimental scenarios is...
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.