Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
This paper studies one particular aspect of providing communication security: firewall technology. This article provides a security framework in the form of packet filtering model within the firewall technology system and its components can be designed and evaluated. This paper introduces a reference model based on packet filtering firewall technology. All components are governed by a centralized...
In the present study a simple and efficient approach is proposed to enhance the performance of Differential Evolution algorithm, while maintaining its basic structure, for solving continuous global optimization problems. The proposed variant named cooperative DE or CDE is based on utilizing all the individuals of the population. The proposed variant is tested on a set of 15 unconstrained benchmark...
The performance gap between the processor and the memory speeds has been increasing. Whereas processor speeds have improved by 60% annually, secondary storage speed has only improved by 10% annually. Although there have been many efficient techniques studied to minimize the speed gap, it still remains a bottleneck in various commercial implementations. Since secondary memory technologies are much...
The N-Queens problem has been studied for over a century. The N-Queens problem may be solved using a variety of methods including backtracking algorithms and mathematical equations such as magic squares. We propose a more efficient approach to the most used technique, backtracking, by removing the threatened cells in order to decrease the number of trial and error steps.
In today's world renewable energy sources (like PV, wind etc) has become one of the most promising source of energy for our generation because of its positive effect on environment. One of the main aspects that has to be taken care of is the stability of the system when subjected to various fault conditions. This paper presents the design of PI controller for a PV connected micro grid where the stability...
Imperialistic competitive algorithm (ICA) is a recently developed meta-heuristic technique that has been successfully implemented for solving various complex optimization problems. Like other meta-heuristic techniques, performance of ICA predominantly depends on the selection of control parameters. However, optimal setting of control parameter for ICA is problem specific. In this paper, a study of...
Three-dimensional stacked memory is considered to be one of the innovative elements for the next-generation computing system, for it provides high bandwidth and energy efficiency. Particularly, packet routing ability of Hybrid Memory Cubes (HMCs) enables new interconnects for the memories, giving flexibility to its topological design space. Since memory-processor communication is latency-sensitive,...
Three-dimensional stacked memory is considered to be one of the innovative elements for the next-generation computing system, for it provides high bandwidth and energy efficiency. Particularly, packet routing ability of Hybrid Memory Cubes (HMCs) enables new interconnects for the memories, giving flexibility to its topological design space. Since memory-processor communication is latency-sensitive,...
Dataflow computing is proved to be promising in high-performance computing. However, traditional dataflow architectures are general-purpose and not efficient enough when dealing with typical scientific applications due to low utilization of function units. In this paper, we propose an optimization of dataflow architectures for scientific applications. The optimization introduces a request for operands...
Under the 10th Malaysia Plan, National Defense University of Malaysia (NDUM) has developed a new naval architecture laboratory to suit the requirement as a niche and boutique university for new knowledge and competencies in defense related disciplines. This paper describes the optimal specification and design of a wave test flume in a confined space. The wave maker was specified with the constraints...
As the benefits of CMOS feature size scaling (Moore and Dennard) are coming to an end, there is an emerging need to re-architect computing systems from the ground up. Will quantum and neuro-inspired computers outperform conventional architectures? Will heterogeneous system architectures become mainstream? What will future memories look like? In this evening session, a group of experts will share their...
Resistive memories have gained high research attention for enabling design of in-memory computing circuits and systems. We propose for the first time an automatic compilation methodology suited to a recently proposed computer architecture solely based on resistive memory arrays. Our approach uses Majority-Inverter Graphs (MIGs) to manage the computational operations. In order to obtain a performance...
Quantum annealing device has shown a great potential in solving discrete problems that are theoretically and empirically hard. Boolean Satisfiability (SAT) problem, determining if there is an assignment of variables that satisfies a given Boolean function, is the first proven NP-complete problem widely used in various domains. Here, we present a novel mapping of the SAT problem to the quadratic unconstrained...
A typical network topological design problem is to determine link connections and their capacity to achieve high performance, low initial and operational costs, and high reliability under the given traffic and link length data between nodes. Because of the difficulties of this problem, approximate solutions such as probabilistic searches have long been studied. However, the real-world network topologies...
Monoculture induced threats such as "pass the hash" attacks can spread more easily through a system of similar components. Introducing a few different and more robust components in the system has the potential to mitigate such situations. In this paper, we propose a constrained resource allocation optimization framework exploring the binary decision diagram (BDD) and mixed integer linear...
Although there are many studies on large-scale unconstrained optimization (e.g., with 100 to 1000 variables) and small-scale constrained optimization (e.g., with 10 to 30 variables) using nature-inspired algorithms (e.g., evolutionary algorithms and swarm intelligence algorithms), no publicly available nature-inspired algorithm is developed for large-scale constrained optimization. In this paper,...
Exhaustive testing of all possible combinations of input parameter values of a large system is impossible. Here, pairwise testing technique is often chosen owing to its effectiveness for bug detection. For pairwise testing, test cases are designed to cover all possible pair combinations of input parameter values at least once. In this paper, we investigate the adoption of Migrating Birds Optimization...
Sequential experimental design for computer experiments is frequently used to construct surrogate regression models of complex blackbox simulators when evaluations are expensive. The same methodology can be used to train classifiers of labeled data which is expensive to obtain. For certain problems classification can be a more appropriate method to obtain a solution with fewer samples.
This paper investigates the suitability of the Particle Swarm Optimization (PSO) and the Differential Evolution (DE) algorithms in solving expensive optimization problems. Eight PSO variants, and eight DE variants are experimentally compared among each other. The Comparing Continuous Optimizers (COCO) methodology was adopted in comparing these variants on the noiseless BBOB test bed. Based on the...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.