Search results for "Computer network"
showing 10 items of 1634 documents
Shaded-Mask Filtering for Extended Depth-of-Field Microscopy
2013
This paper proposes a new spatial filtering approach for increasing the depth-of-field (DOF) of imaging systems, which is very useful for obtaining sharp images for a wide range of axial positions of the object. Many different techniques have been reported to increase the depth of field. However the main advantage in our method is its simplicity, since we propose the use of purely absorbing beam-shaping elements, which allows a high focal depth with a minimum modification of the optical architecture. In the filter design, we have used the analogy between the axial behavior of a system with spherical aberration and the transverse impulse response of a 1D defocused system. This allowed us the…
CUDA-enabled Sparse Matrix–Vector Multiplication on GPUs using atomic operations
2013
We propose the Sliced Coordinate Format (SCOO) for Sparse Matrix-Vector Multiplication on GPUs.An associated CUDA implementation which takes advantage of atomic operations is presented.We propose partitioning methods to transform a given sparse matrix into SCOO format.An efficient Dual-GPU implementation which overlaps computation and communication is described.Extensive performance comparisons of SCOO compared to other formats on GPUs and CPUs are provided. Existing formats for Sparse Matrix-Vector Multiplication (SpMV) on the GPU are outperforming their corresponding implementations on multi-core CPUs. In this paper, we present a new format called Sliced COO (SCOO) and an efficient CUDA i…
Finding near-perfect parameters for hardware and code optimizations with automatic multi-objective design space explorations
2012
Summary In the design process of computer systems or processor architectures, typically many different parameters are exposed to configure, tune, and optimize every component of a system. For evaluations and before production, it is desirable to know the best setting for all parameters. Processing speed is no longer the only objective that needs to be optimized; power consumption, area, and so on have become very important. Thus, the best configurations have to be found in respect to multiple objectives. In this article, we use a multi-objective design space exploration tool called Framework for Automatic Design Space Exploration (FADSE) to automatically find near-optimal configurations in …
First Experiences on an Accurate SPH Method on GPUs
2017
It is well known that the standard formulation of the Smoothed Particle Hydrodynamics is usually poor when scattered data distribution is considered or when the approximation near the boundary occurs. Moreover, the method is computational demanding when a high number of data sites and evaluation points are employed. In this paper an enhanced version of the method is proposed improving the accuracy and the efficiency by using a HPC environment. Our implementation exploits the processing power of GPUs for the basic computational kernel resolution. The performance gain demonstrates the method to be accurate and suitable to deal with large sets of data.
Finite-time stability analysis and stabilization for linear discrete-time system with time-varying delay
2014
Abstract The problem of finite-time stability for linear discrete-time systems with time-varying delay is studied in this paper. In order to deal with the time delay, the original system is firstly transformed into two interconnected subsystems. By constructing a delay-dependent Lyapunov–Krasovskii functional and using a two-term approximation of the time-varying delay, sufficient conditions of finite-time stability are derived and expressed in terms of linear matrix inequalities (LMIs). The derived stability conditions can be applied into analyzing the finite-time stability and deriving the maximally tolerable delay. Compared with the existing results on finite-time stability, the derived …
VLPZ: The Vehicular Location Privacy Zone
2016
International audience; One of the key challenges in the success of vehicular ad hoc networks (VANETs) is to consider the location privacy of drivers. Although, the pseudonym changing approach is suggested by standardization development organizations such as IEEE and ETSI, the development of an effective pseudonym changing strategy is still an open issue. The existing pseudonym changing strategies are either not effective to protect against the pseudonyms linking attacks or can have a negative impact on the VANETs’ applications. To address these issues, this paper proposes a new pseudonym changing strategy based on the Vehicular Location Privacy Zone (VLPZ), which is a roadside infrastructu…
A Network Formation Game Approach to Study BitTorrent Tit-for-Tat
2007
The Tit-for-Tat strategy implemented in BitTorrent (BT) clients is generally considered robust to selfish behaviours. The authors of [1] support this belief studying how Tit-for-Tat can affect selfish peers who are able to set their upload bandwidth. They show that there is a "good" Nash Equilibrium at which each peer uploads at the maximum rate. In this paper we consider a different game where BT clients can change the number of connections to open in order to improve their performance. We study this game using the analytical framework of network formation games [2]. In particular we characterize the set of pairwise stable networks the peers can form and how the peers can dynamically reach…
Inversion of matrix pencils for generalized systems
1993
Abstract This paper clarifies the nature of the Leverrier-Faddeev algorithm for generalized and state-space systems. It presents useful diagrams for recursive computation of the coefficients of the characteristic polynomial and the coefficient matrices of the adjoint matrix for various matrix pencils. A simplified case covers recursive equations and diagrams for inversion of the second-order matrix pencil (Es2 + A1s + A0) where E may be singular. The appendix provides two examples of mechanical and heat exchange systems which can be described by the generalized models.
Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments
2013
This article studies the vehicle routing problem with trailers and transshipments VRPTT, a practically relevant, but challenging, generalization of the classical vehicle routing problem. The article makes three contributions: i Building on a nontrivial network representation, two mixed-integer programming formulations for the VRPTT are proposed. ii Based on these formulations, five different branch-and-cut algorithms are developed and implemented. iii The computational behavior of the algorithms is analyzed in an extensive computational study, using a large number of test instances designed to resemble real-world VRPTTs.Copyright © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 631, 119-133 20…
A service-oriented routing scheme with load balancing in wireless mesh networks
2008
Wireless mesh networks will play an important role in the next-generation wireless communication systems as it can provide wide coverage and scalable broadband Internet access services. However, congestion in such networks may lead to throughput degradation, packet loss and longer transmission delay. Therefore, routing and traffic forwarding schemes which are aware of the congestion status of a wireless network can efficiently improve network performance. In this paper, we propose a new congestion-aware routing scheme which may direct different paths for different services types, according to network congestion status. The goal of this routing scheme is to use traffic load metric for choosi…