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.
This paper examines the tracking property of nonlinear delayed multi-agent systems with impulsive effects. The strengths and locations of the stabilizing impulses, as well as the number of the controlled nodes are all assumed to be time-varying. Some sufficient criteria are established such that the considered system can exponentially track the dynamical reference state based on the given impulsive...
Multimedia data, nowadays, needs high levels of security as it is widely transferred over various networks. One of the newly-invented and most attracting safety-raising strategies is the chaos-based cryptography. This paper examines the competence of an algorithm for image encryption that uses a double-chaotic logistic map equation. The algorithm produces two sequence keys (K1 & K2) in two phases...
The paper presents the results of design space explorations for the implementation of the Smith-Waterman (S-W) algorithm performing DNA and protein sequences alignment. Both design explorations studies and FPGA implementations are obtained by developing a dynamic dataflow program implementing the algorithm and by direct high-level synthesis (HLS) to FPGA HDL. The main feature of the obtained implementation...
Maximal Clique and Maximum Clique are two related and famous computational problems known to be intractable in the most general case. We propose a formulation of the Maximal Clique problem as a Boolean Satisfaction problem. The constraints are then mapped to a Constraint Logic Programming representation. The resulting representation can be input to a Constraint Logic Programming system that can be...
To the optical mechanical complexes of tracking and positioning, strict requirements are produced on the dynamics and permissible errors under such conditions as external and internal nonstationary disturbances, as well as presence of elastic deformations in the links of the driven mechanism. In modern systems, adaptive control algorithms have proven themselves as complementary to the main control...
For odd integers p ≥ 1 (and p = ∞), we show that the Closest Vector Problem in the ℓp norm (CVP_p) over rank n lattices cannot be solved in 2^(1-≥) n time for any constant ≥ 0 unless the Strong Exponential Time Hypothesis (SETH) fails. We then extend this result to almost all values of p ≥ 1, not including the even integers. This comes...
Energy consumption and efficiency of electrical drives became an increasingly important issue. This issue encourages many researchers to develop new control techniques to reduce the energy consumption in electrical drives. Some of those techniques are more effective than others; some of them could save energy but will affect the response of the drive. DB-DTFC control has the fastest possible response,...
With the technology improvements, managing a large amount of multimedia objects such as audio, video, picture or a combination of these has become possible. Multimedia data needs more real time storage and high data transfer than traditional textual and numeric data. In addition to these requirements, significant amount of computation is demanded for multimedia applications to serve many users at...
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 order to shorten the response times of aperiodic tasks in mixed task sets in real-time systems, this paper proposes an adaptive total bandwidth server (ATBS) algorithm based on aperiodic tasks with varying executing times. This method of reducing response times of aperiodic execution by using predictive execution times instead of worst-case execution times for deadline calculations in the total...
When configuring a delay tolerant network (DTN), there are many aspects that need to be taken into consideration for an effective and efficient network. One aspect is a buffer management strategy. Buffer strategies are used to determine which packets need to be forwarded or dropped. This paper will focus on the variety of buffer management strategies available, providing a comprehensive survey and...
In this paper, we propose a novel method based on Dijkstra algorithm for parking lot to find an optimal route and solve the difficulties in finding parking spaces and traffic congestion nowadays. Firstly, by means of the traditional Dijkstra algorithm, which is a common way to solve the shortest path problem, we combine it with the impedance function model to obtain the dynamic time of the route....
Restricted Boltzmann Machines (RBMs) have received special attention in the last decade due to their outstanding results in number of applications, such as face and human motion recognition, and collaborative filtering, among others. However, one of the main concerns about RBMs is related to the number of hidden units, which is application-dependent. Infinite RBM (iRBM) was proposed as an alternative...
the optimization algorithm plays an important role in solving the complex problems, and many complex problems can be modeled as a combinatorial optimization problem. The multi-dimensional knapsack problem is a kind of typical combinatorial optimization problem. The pollination algorithm is a kind of natural heuristic algorithm proposed in recent years, which has the characteristics of few parameter...
In view of the limitation of single-load AGV's low throughput in modern express logistics warehouse, a dynamic unlock algorithm is proposed in this paper. Dynamic unlock algorithm is used for multi-AGV scheduling problem. In order to measure system's throughput, a map environment was constructed and evaluated to compute the total complete time (TCT) and total waiting-for-start time (TWT). The final...
Considering to the problem of requiring and consuming a lot of storage units by collecting the real time data in the CNC machines, an improved Swinging Door Trending (SDT) compression algorithm has been proposed to compress the massive data. Its tolerance can be adjusted dynamically according to the trend of the fluctuations of the data. In addition, Multi-models optimization method was used for function...
A significant issue associated with the use of video see-through head-mounted displays (VST-HMD) for augmented reality is the presence of latency between real-world images and the images displayed to the HMD. For a static scene, this latency provides no real problem, however for dynamic scenes, which arise when the HMD user moves their head, when real-world objects move, or a combination of the two,...
Software change histories are results of incremental updates made by developers. As a side-effect of the software development process, version history is a surprisingly useful source of information for understanding, maintaining and reusing software. However, traditional commit-based sequential organization of version histories lacks semantic structure and thus are insufficient for many development...
The full behavior of software-intensive systems of systems (SoS) emerges during operation only. Runtime monitoring approaches have thus been proposed to detect deviations from the expected behavior. They commonly rely on temporal logic or domain-specific languages to formally define requirements, which are then checked by analyzing the stream of monitored events and event data. Some approaches also...
Sequence comparison is a fundamental task in computational biology, traditionally dominated by alignment-based methods such as the Smith-Waterman and Needleman-Wunsch algorithms, or by alignment based heuristics such as BLAST, the ubiquitous Basic Local Alignment Search Tool. For more than a decade researchers have examined a range of alignment-free alternatives to these approaches, citing concerns...
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.