Defining a protocol for commit consensus problem in distributed database transactions is not an easy task because we have to think about a fault tolerant system. In this paper, I present a fault tolerant and simple me...
详细信息
The paper describes the energy consumption from the battery based on the current measurements for various cases, i.e., speed (PWL adjustment) and loads. The main purpose of the research is to have additional and relia...
详细信息
In this paper we focus on class imbalance issue which often leads to sub-optimal performance of classifiers. Despite many attempts to solve this problem, there is still a need to look for better ones, which can overco...
详细信息
This study presents a broad selection of methods and techniques for data transfers, starting with the TCP/IP protocol, its main enhancements, new non TCP protocols, and the class of applications and libraries able to ...
详细信息
The concept of Digital Business Ecosystem becomes an important aspect of everyday economy and technologies in this area are becoming a reality considering that results from European Join Collaborative Research Project...
详细信息
key phase in the design process of software for distributed systems is the allocation of the software components to the available hardware. A problem arises when a software/hardware mismatch occurs. This paper present...
详细信息
key phase in the design process of software for distributed systems is the allocation of the software components to the available hardware. A problem arises when a software/hardware mismatch occurs. This paper presents a solution to that problem by introducing a technique that guarantees efficient allocation of predefined scheduled object-oriented software components to the available hardware based on genetic algorithm. The allocation is to be made dynamically in a system with a predefined schedule. We thus modified the parameters of the genetic search technique to allow converging to the best solution in a relatively short time to be suitable for the dynamicity of the allocation. The performance of the allocation technique is evaluated in terms of the time cost (CPU clock pulses for more generality) required for the GA search to converge to the optimal allocation structure of the software components. The results obtained by the proposed technique are compared against the results from the branch-and-bound search technique. The experimental results indicate the effectiveness of the proposed technique in reaching the optimal allocation in considerable time, showing that it requires much less time than branch-and-bound.
Pneumonia is one of the top causes of death in Romania and early detection of this disease improves the recovery chances and shortens the length of hospitalization. In this work, we develop a solution for automatic pn...
详细信息
This book covers all the relevant dictionary learning algorithms, presenting them in full detail and showing their distinct characteristics while also revealing the similarities. It gives implementation tricks that ar...
详细信息
ISBN:
(数字)9783319786742
ISBN:
(纸本)9783319786735;9783030087616
This book covers all the relevant dictionary learning algorithms, presenting them in full detail and showing their distinct characteristics while also revealing the similarities. It gives implementation tricks that are often ignored but that are crucial for a successful program. Besides MOD, K-SVD, and other standard algorithms, it provides the significant dictionary learning problem variations, such as regularization, incoherence enforcing, finding an economical size, or learning adapted to specific problems like classification. Several types of dictionary structures are treated, including shift invariant; orthogonal blocks or factored dictionaries; and separable dictionaries for multidimensional signals. Nonlinear extensions such as kernel dictionary learning can also be found in the book. The discussion of all these dictionary types and algorithms is enriched with a thorough numerical comparison on several classic problems, thus showing the strengths and weaknesses of each algorithm. A few selected applications, related to classification, denoising and compression, complete the view on the capabilities of the presented dictionary learning algorithms. The book isaccompanied by code for all algorithms and for reproducing most tables and figures. Presents all relevant dictionary learning algorithms - for the standard problem and its main variations - in detail and ready for implementation;Covers all dictionary structures that are meaningful in applications; Examines the numerical properties of the algorithms and shows how to choose the appropriate dictionary learning algorithm.
In this paper, a method of calculating the occupancy of a shelf will be presented. A vision pillar composed of two RGB cameras and two ToF depth cameras will be used to scan a shelf and determine the percentage of emp...
详细信息
This paper shows the impact of the atomic capabilities concept to include control-oriented knowledge of linear control systems in the decisions making structure of physical agents. These agents operate in a real envir...
详细信息
暂无评论