In this paper, we present numerical upper bounds on the sizes of constrained codes with a prescribed minimum distance. We accomplish this by extending Delsarte's linear program (LP) (Delsarte (1973)) to the settin...
详细信息
A key objective in the management of modern computer systems consists in minimizing the electrical energy consumed by processing resources while satisfying certain target performance criteria. In this paper, we consid...
详细信息
ISBN:
(纸本)9781665455800
A key objective in the management of modern computer systems consists in minimizing the electrical energy consumed by processing resources while satisfying certain target performance criteria. In this paper, we consider the execution of a single task with unknown size on top of a service system that offers a limited number of processing speeds, say N, and investigate the problem of finding a speed profile that minimizes the resulting energy consumption subject to a deadline constraint. Existing works mainly investigated this problem when speed profiles are continuous functions. In contrast, the novelty of our work is to consider discontinuous speed profiles, i.e., a case that arises naturally when the underlying computational platform offers a finite number of speeds. In our main result, we show that the computation of an optimal speed profile boils down to solving a convex optimization problem. Under mild assumptions, for such convex optimization we prove some structural results that yield the formulation of an extremely efficient solution algorithm. Specifically, we show that the optimal speed profile can be computed by solving O(log N) one-dimensional equations. Our results hold when the task size follows a known probability distribution function and the set of available speeds, if listed in increasing order, forms a sublinear concave sequence.
Slow-feature analysis (SFA) seeks to extract the most slowly varying components of dynamic systems. However, the original definition of SFA implies a linear relationship of system states between adjacent time instants...
详细信息
ISBN:
(数字)9781665471749
ISBN:
(纸本)9781665471749
Slow-feature analysis (SFA) seeks to extract the most slowly varying components of dynamic systems. However, the original definition of SFA implies a linear relationship of system states between adjacent time instants. In this paper, a new approach to SFA, which is called ***, is defined, based on which the mutual-information-based SFA (MI-based SFA) is proposed. The optimisation problem can be solved by joint diagonalisation of the mutual-information (MI) matrices. The MI matrices are approximated by quantities related to Renyi entropy that can be calculated using the kernel trick. The case studies show MI-based SFA is better for slow feature extraction, especially for nonlinear systems. This allows a better soft sensor to be developed.
Cloud computing market has been growing with its largest over the last two years. Many businesses and education systems moved to the Cloud to support remote work and learning respectively during the COVID time. As dat...
详细信息
Hardware Transactional Memory (HTM) offers the opportunity to ease parallel programming. However, driven by hardware limitations, commercial implementations eschew the complexity involved in early sophisticated propos...
详细信息
Developing real-time systems applications requires programming paradigms that can handle the specification of concurrent activities and timing constraints, and controlling execution on a particular platform. The incre...
详细信息
ISBN:
(数字)9798350388633
ISBN:
(纸本)9798350388640
Developing real-time systems applications requires programming paradigms that can handle the specification of concurrent activities and timing constraints, and controlling execution on a particular platform. The increasing need for high-performance, and the use of fine-grained parallel execution, makes this an even more challenging task. This paper explores the state-of-the-art and challenges in real-time parallel application development, focusing on two research directions: one from the high-performance domain (using OpenMP) and another from the real-time and critical systems field (based on Ada). The paper reviews the features of each approach and highlights remaining open issues.
Since the dawn of industrial robots, the teach pendant has been the main platform for man-machine communication at the shop floor. Manufacturers have traditionally seen industrial robots as tools for mass production, ...
详细信息
ISBN:
(纸本)9781665445405
Since the dawn of industrial robots, the teach pendant has been the main platform for man-machine communication at the shop floor. Manufacturers have traditionally seen industrial robots as tools for mass production, with limited need for reprogramming and human interaction. Meanwhile scientists have identified an extended potential of industrial robots in small batch manufacturing systems. However to achieve profitable small batch manufacturing more flexible human robot interaction methods than the teach pendant is required. In some cases, flexibility also requires that the control system is independent of the physical distance between the robot and its operator. This paper present a system-independent remote control interface for industrial robots based on Industry 4.0 cloud computing technology, with minimal requirements at the client device. Furthermore, the general solution can be easily scaled up to multiple robot control and the solution invites to and enables equipment sharing between organizations.
In the long experience of integrated territorial planning (ITP) implemented in Calabria, with the Leader Community Initiative, the Territorial Pacts and the Regional Operational programming of the Structural Funds, th...
详细信息
We describe a new multi-agent distributed stock exchange simulation environment (DSXE), built to model the global network of contemporary financial markets. DSXE is an advance on existing state-of-the-art simulation p...
详细信息
Recent work demonstrated that using Koopman surrogate models to falsify black-box models against signal temporal logic specifications is highly effective. However, the bottleneck of this approach arises from the mixed...
详细信息
ISBN:
(纸本)9783031787492;9783031787508
Recent work demonstrated that using Koopman surrogate models to falsify black-box models against signal temporal logic specifications is highly effective. However, the bottleneck of this approach arises from the mixed-integer linear program optimization used to synthesize the falsifying trajectory. The complexity of mixed-integer linear programming can be prohibitive, increasing exponentially with the number of binary variables. In this work, we introduce a new weighted robustness encoding that eliminates the need for binary variables. We also propose a new weighting scheme for Koopman operator linearization that aims to compensate for inaccuracies in the learned model. We evaluate our approach using a set of benchmarks from the ARCH falsification competition. Our weighting methods significantly improve computational efficiency and reduce the number of simulations needed to find falsifying traces.
暂无评论