Search results

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

In this paper, we analyze the potentials of a four-phase 14-GHz CMOS voltage-controlled oscillator, tailored to a sub-harmonic receiver, for signal processing at Ka-band. When mild phase accuracies between in-phase and quadrature down-converted signals are required, the four-phase oscillator displays roughly the same phase noise figure-of-merit as quadrature oscillator counterparts. However, the o

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

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

To link aesthetics to traffic safety, the field of environmental psychology was consid-ered. A new model of driving behaviour was developed, based on Lewin’s (1951) equation, B = f (P,E) and by employing Küllers’ (1991) model of the basic emotional process. The employed model B = f (R(Road), U(Users), A(Task), P(Person)), states that driving behaviour (B) is related to the physical environment (R)

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

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

Pathloss is typically modeled using a log-distance power law with a large-scale fading term that is log-normal. However, the received signal is affected by the dynamic range and noise floor of the measurement system used to sound the channel, which can cause measurement samples to be truncated or censored. If the information about the censored samples are not included in the estimation method, as

In large software organizations with a product line development approach a selective testing of product variants is necessary in order to keep pace with the decreased development time for new products, enabled by the systematic reuse. The close relationship between products in product line indicates an option to reduce the testing effort due to redundancy. In many cases test selection is performed

A Multi-band CMOS front-end was designed and fabricated in a 0.13μm CMOS process. The front-end employs a common-gate low noise amplifier (LNA) with capacitive cross coupling (CCC) technique and a double balanced mixer. The band selection is performed by switching capacitors in and out of the LNA load, changing the resonance frequencies ranging from 2.5GHz to 4.5GHz in 16 different frequency bands

Background: The fix-cache approach to regression test selection was proposed to identify the most fault-prone files and corresponding test cases through analysis of fixed defect reports. Aim: The study aims at evaluating the efficiency of this approach, compared to the previous regression test selection strategy in a major corporation, developing embedded systems. Method: We launched a post-hoc