Search results for "design."
showing 10 items of 5715 documents
An optimized mass storage FFT for vector computers
1995
Abstract The performance of a segmented FFT algorithm which allows the out-of-core computation of the Fourier transform of a very large mass storage data array is presented. The code is particularly optimized for vector computers. Tests performed mainly on a CONVEX C210 vector computer showed that, for very long transforms, tuning of the main parameters involved leads to computation speed and global efficiency better than for FFTs performed in-core. The use of tunable parameters allows optimization of the algorithm on machines with different configurations.
Cell Association With Load Balancing in Nonuniform Heterogeneous Cellular Networks: Coverage Probability and Rate Analysis
2017
To meet the ever-growing traffic demand and address the cell capacity shortage problem, associating end users to various tiers of cells in a multitier cellular network appears to be a promising approach. In this paper, we consider a nonuniform heterogeneous cellular network (NuHCN) and propose a cell association scheme that selectively mutes certain small-cell base stations (BSs) and covers end users by cell range extension (via cell biasing) for achieving load balancing. The envisaged NuHCN is comprised of two tiers of BSs, i.e., macro- and small-cell BSs, deployed according to three independent homogeneous Poisson point processes for BSs and end users, respectively. Accordingly, the avail…
Analyzing the performance of a cluster-based architecture for immersive visualization systems
2008
Cluster computing has become an essential issue for designing immersive visualization systems. This paradigm employs scalable clusters of commodity computers with much lower costs than would be possible with the high-end, shared memory computers that have been traditionally used for virtual reality purposes. This change in the design of virtual reality systems has caused some development environments oriented toward shared memory computing to require modifications to their internal architectures in order to support cluster computing. This is the case of VR Juggler, which is considered one of the most important virtual reality application development frameworks based on open source code. Thi…
Dual-model approach for safety-critical embedded systems
2020
Abstract The paper presents the design of digital controllers based on two models: the Petri net model, and the UML state machine. These two approaches differ in many aspects of design flow, such as conceptual modelling, and analysis and synthesis. Each of these approaches can be used individually to design an efficient logic controller, and such solutions are well-known, but their interoperability can contribute to a much better understanding of logic controller design and validation. This is especially important in the case of safety- or life-critical embedded systems, and apart from this, a dual-model controller design can make up redundant system increasing its reliability.
An efficient distributed algorithm for generating and updating multicast trees
2006
As group applications are becoming widespread, efficient network utilization becomes a growing concern. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in networks) is prohibitively expensive. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem, allowing the construction of effective distribution trees using a coordination protocol among the network nodes. Furthermore, we propose a novel distribut…
Collusion Constrained Equilibrium
2018
First published: 01 February 2018 This is an open access article licensed under the Creative Commons Attribution-NonCommercial License 4.0 (http://econtheory.org) We study collusion within groups in noncooperative games. The primitives are the preferences of the players, their assignment to nonoverlapping groups, and the goals of the groups. Our notion of collusion is that a group coordinates the play of its members among different incentive compatible plans to best achieve its goals. Unfortunately, equilibria that meet this requirement need not exist. We instead introduce the weaker notion of collusion constrained equilibrium. This allows groups to put positive probability on alternatives …
Non-cooperative power allocation game with imperfect sensing information for cognitive radio
2012
In this paper, we consider a sensing-based spectrum sharing scenario and present an efficient decentralized algorithm to maximize the total throughput of the cognitive radio users by optimizing jointly both the detection operation and the power allocation, taking into account the influence of the sensing accuracy. This optimization problem can be formulated as a distributed non-cooperative power allocation game, which can be solved by using an alternating direction optimization method. The transmit power budget of the cognitive radio users and the constraint related to the rate-loss of the primary user due to the interference are considered in the scheme. Finally, we use variational inequal…
Modular Strategies for Recursive Game Graphs
2006
AbstractMany problems in formal verification and program analysis can be formalized as computing winning strategies for two-player games on graphs. In this paper, we focus on solving games in recursive game graphs which can model the control flow in sequential programs with recursive procedure calls. While such games can be viewed as the pushdown games studied in the literature, the natural notion of winning in our framework requires the strategies to be modular with only local memory; that is, resolution of choices within a module does not depend on the context in which the module is invoked, but only on the history within the current invocation of the module. While reachability in (global…
Automatic construction of test sets: Theoretical approach
2005
We consider the problem of automatic construction of complete test set (CTS) from program text. The completeness criterion adopted is C1, i.e., it is necessary to execute all feasible branches of program at least once on the tests of CTS. A simple programming language is introduced with the property that the values used in conditional statements are not arithmetically deformed. For this language the CTS problem is proved to be algorithmically solvable and CTS construction algorithm is obtained. Some generalizations of this language containing counters, stacks or arrays are considered where the CTS problem remains solvable. In conclusion the applications of the obtained results to CTS constr…
The Gantry-Tau parallel kinematic machine-kinematic and elastodynamic design optimisation
2011
Pubished version of an article in the journal: Meccanica. Also available from the publisher at: http://dx.doi.org/10.1007/s11012-010-9394-9 One of the main advantages of the Gantry-Tau machine is a large accessible workspace/footprint ratio compared to many other parallel machines. The optimal kinematic, elastostatic and elastodynamic design parameters of the machine are still difficult to calculate and this paper introduces an optimisation scheme based on the geometric and functional dependencies to define the workspace and first resonance frequency. This method assumes that each link and universal joint can be described by a mass-spring-damper model and calculates the transfer function fr…