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.
During the last years, there has been a growing interest in systems related to the location of objects into three-dimensional environments and virtual reality applications. These systems, based on high-performance video-processing, have a big computational load, specially on image analysis phases. This work presents the process of HW-SW co-design and implementation of a positioning system. A methodology...
Solid State Drives (SSDs) have become popular for mobile devices and PCs nowadays due to their advantages compared with conventional hard disk drives. However, they suffer from endurance problems. An effective approach to increase the endurance of an SSD is to improve the management algorithm of the RAM buffer, a cache-like structure inside the SSD. There are several previous studies of RAM buffer...
This paper presents implementation and analysis of the VPN software router which is based on Quagga and strongSwan open-source software tools. We validated functionalities of strongSwan and Quagga in realistic environment which include scenarios with link failures. Also, we measured and analyzed performance of encryption and hash algorithms supported by strongSwan software, in order to advise optimal...
SAT is one of the most important basic problems of many areas of computer science and control science. SAT solvers are software or hardware to solve an SAT instance. In this paper, an instance-specified SAT solver was developed with FPGA, which implements the DPLL algorithm with our innovative random variable selection. Moreover, we also introduced an innovative tool-chain of our SAT solver, which...
Software updates often introduce new bugs to existing code bases. Prior regression testing tools focus mainly on test case selection and prioritization whereas symbolic execution tools only handle code changes in sequential software. In this paper, we propose the first incremental symbolic execution method for concurrent software to generate new tests by exploring only the executions affected by code...
Combinatorial testing aims at covering the interactions of parameters in a system under test, while some combinations may be forbidden by given constraints (forbidden tuples). In this paper, we illustrate that such forbidden tuples correspond to unsatisfiable cores, a widely understood notion in the SAT solving community. Based on this observation, we propose a technique to detect forbidden tuples...
Code reviews are an essential part of quality assurance in Free, Libre, and Open Source Software (FLOSS) projects. However, finding a suitable reviewer can be difficult, and delayed or forgotten reviews are the consequence. Automating reviewer selection with suitable algorithms can mitigate this problem. We compare empirically six algorithms based on modification expertise and two algorithms based...
In this paper, we propose a low complexity algorithm to separate collided RFID signals. By carefully analyzing the collided signals when two tags with the same bit durations respond to a reader simultaneously, we observed that the individual amplitudes of each tag appear in pairs and the two tags' information bits are different, and regular RFID signals with larger amplitudes appear if the two tags'...
We present a new fault localization algorithm, called Vautrin, built on an approximation of causality based on call graphs. The approximation of causality is done using software mutants. The key idea is that if a mutant is killed by a test, certain call graph edges within a path between the mutation point and the failing test are likely causal. We evaluate our approach on the fault localization benchmark...
This is well known that IoT needs intelligent search engines to manage big data processing. We have been developing such issues with novel algorithms. CAM (Contents Addressable Memory) conducts high speed searching with high power consumption which is not productive. The LUT (Look Up Table) algorithm with certain software is one type of method that is utilized to save power and commonly found in today...
Property directed reachability (PDR) has been introduced as a very efficient verification method for synchronous hardware circuits which is based on induction rather than fixpoint computation. The method incrementally refines a sequence of clause sets that over-approximate the states that are reachable in finitely many steps. Even being valid, safety properties may not be provable by induction due...
Recently, there has been the arise of latency-sensitive IoT applications, e.g., in the field of telemedicine or Industrial Internet. Such applications have stringent latency requirements. The entire end-to-end latency between two devices is composed of several individual latencies: the software latency of the application, the software latency in the networking stack, the hardware latency on wire,...
The problem of software fault-tolerance is described. The fault-tolerance problem is considered as hardware faults and software errors. The software errors classification is proposed. Authors describe the computational process as treelike directed graph. Errors are bringing in the realisation of the algorithm at the stage of programming. It is cause forming “real” algorithm instead of its “theoretical”...
We describe a security visualization tool for finding algorithmic complexity attacks in Java bytecode. Our tool, which we call J-Viz, visualizes connected directed graphs derived from Java bytecode according to a canonical node ordering, which we call the sibling-first recursive (SFR) numbering. The particular graphs we consider are derived from applying Shiver's k-CFA framework to Java bytecode,...
The paper presents a method based on moving target technology for protecting software components of distributed systems. Practical implementation of this method is a code diversifier, which adds intermediary functions and inserts transformation of key variables into the program code. Theoretical analysis of the method presented here demonstrated its effectiveness even when an adversary had access...
Modern computing systems are hybrid in nature and employ various processing technologies that range from specific-to general-purpose processors. In co-design environments, specific-purpose processors, also known as hardware, work to support software implementations under general-purpose systems to create high-performance computers. Algorithms and computationally intensive tasks are partitioned among...
Method of data segmentation and transferring via disjoint ways for providing secure connections between nodes in computer network. This method purposed as tool for reduce the chance of information interception.
This paper presents the use of ZYNQ-7000 All Programmable SoC for flexible object recognition applications targeted for indoor mapping and localization. The architecture of the system is designed to provide the necessary infrastructure to support hardware software partitioning. Vivado HLS OpenCV libraries are used to synthesize the hardware for accelerating parts of the algorithms. Idea of identifying...
The biometric encryption system is a significant addition in the areas of privacy, security and convenience among its users. The intent of this research is to propose an RSA based biometric encryption system which can be realized on field programmable gate arrays (FPGAs) using hardware-software co-design methods. Due to the high number of hackers that stand to profit from sub-par security methods,...
We present a case study of feature location in industry. We study two off-the-shelf feature location algorithms for use as input to a software cost estimator. The feature location algorithms that we studied map program requirements to one or more function points. The cost estimator product, which is the industrial context in which we study feature location, transforms the list of function points into...
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.