Filtyp
Air-to-air refueling is a vital technique for extending the range and endurance of manned or unmanned aircraft, with over 1000 refueling procedures flown per day in military operations. The hardware used for air-to-air refueling needs to be tailored to the specific aircraft and airspeeds involved, performing markedly different for permutations of tanker and receiver craft. Extensive flight testing
Optimization problems with rank constraints appear in many diverse fields such as control, machine learning, and image analysis. Since the rank constraint is nonconvex, these problems are often approximately solved via convex relaxations. Nuclear norm regularization is the prevailing convexifying technique for dealing with these types of problem. This paper introduces a family of low-rank inducing
Despite the creativity of the scientific community and the funding agencies, the underlying model of computation behind IoT, WSN, cloud, edge, fog, and mist is fundamentally the same; Computational nodes which are dynamically interconnected to form a system in where both processing capacity and connectivity may vary over time. On top of such a system, we consider applications that need packets to
Given a weighted directed graph where some arcs can fail while others are reliable, we aim to compute a shortest pair of failure-disjoint paths. If a reliable arc is used by both paths, its cost is counted only once. We present a polynomial time algorithm to solve the problem.
To be able to connect wirelessly to the internet is nowadays a part of everyday life and the number of wireless devices accessing wireless networks worldwide are increasing rapidly. However, with the increasing number of wireless devices and applications and the amount available bandwidth, spectrum shortage is an issue. A promising way to increase the amount of available spectrum is to utilize fre
We derive the interarrival distribution of a workload input process which is a variation of the infinite source Poisson process for packet traffic. It accounts for long-range dependence and self-similarity exhibited by real traces in the Internet. The packet generation process is compound Poisson over each session which has a heavy tailed distribution. Considering the dependence induced by the wor
Maturity models are widely used in process improvement. The users of a maturity model should be confident that the weak points of the assessed processes can be found, and that the most valuable changes are introduced. Therefore, the evaluation of maturity models is an important activity. In this paper, a mapping study of the literature on the evaluation of maturity models is presented. Two databas
In this study, the authors investigate the resistance of Boolean functions against fast algebraic attacks and deduce a bound between fast algebraic immunity and higher-order non-linearity (it is the first time that a bound between these two cryptographic criteria is given). The authors then show that the fast algebraic immunity of the following two classes of Boolean functions is not good: (a) The
Abstract in Undetermined[Context and motivation] There is considerable flexibility in requirements specifications (both functional and non-functional), as well as in the features of available OSS components. This allows a collaborative matching and negotiation process between stakeholders such as: customers, software contractors and OSS communities, regarding desired requirements versus available
Lightpath reconfiguration is a networking task that can be performed in order to improve resource utilization. The lightpath reconfiguration problem becomes nontrivial when a new set of lightpaths requires the release of resources previously seized by the (working) lightpaths currently in place, but, in order to ensure continuity of the traffic flow, the working lightpaths cannot be torn down befo
We present a stopping condition to the duality based distributed optimization algorithm presented in [1] when used in a distributed model predictive control (DMPC) context. To enable distributed implementation, the optimization problem has neither terminal constraints nor terminal cost that has become standard in model predictive control (MPC). The developed stopping condition guarantees a prespec
We consider hardware-oriented message authentication, more specifically universal hash functions. We propose a new type of constructions that appear promising. These constructions are based on the framework of universal hash functions, Toeplitz matrices and epsilon-biased sample spaces. Some new theoretical results in this area are derived. The new constructions come at the price of not being able
The introduction of Vehicular ad-hoc Networks (VANETs) leads to the possibility to re-evaluate many traditional functions and views of road traffic networks. The ability for vehicles and infrastructure to commu- nicate and collaborate will enable many novel solutions for problems as diverse as collision avoidance and traffic management with the view of re- ducing traffic congestion, increasing the
The demand for more efficient ciphers is a likely to sharpen with new generation of products and applications. Previous cipher designs typically focused on optimizing only one of the two parameters - hardware size or speed, for a given security level. In this paper, we present a methodology for designing a class of stream ciphers which takes into account both parameters simultaneously. We combine
System-theoretical methods are already used for the control of computing systems, but much more can be done exploiting said methods for their design. This requires to express in control-theoretical terms desires and specifications that originate in the computer science do- main, which may not be immediate. It also requires to accept that part of the addressed system be modified, which may pose som
In the paper we consider a flow problem closely related to path diversity protection in communication networks. Given a weighted directed graph where some arcs are subject to failures while others are resilient, we aim at computing a shortest pair of failure-disjoint paths. If a resilient arc is used by both paths, its cost is counted only once. We present an original polynomial-time algorithm for
This paper studies the potential of spatial multiplexing for measured 60 GHz radio channels by estimating the number of eigenchannels. It is well-known that the number of available eigenchannels is dependent on a propagation channel condition as well as antenna array conguration. We evaluate a spatial degrees- of-freedom (SDoF) metric that depends on the propagation conditions and the antenna aper
