Filetype
We consider the problem of assessing structural stability of biochemical reaction networks with monotone reaction rates, namely of establishing if all the networks with a certain structure are stable regardless of specific parameter values. We investigate stability by absorbing the network equations in a linear differential inclusion and seeking for a polyhedral Lyapunov function proper to the con
This paper focuses on the regulation of RNA production for in vitro synthetic gene networks. We consider the problem of matching the production rate of several RNA species concurrently transcribed to form RNA complexes. We design regulatory feedback loops based on two schemes: negative auto-regulation (which can minimize the potentially harmful amount of molecules not used to form products) and cr
In this paper we consider a set of dynamically decoupled systems interconnected by control agents. We can visualize this architecture as a graph where subsystems are associated to nodes and control agents are associated to arcs. The interconnection between subsystems is determined by their input matrix. The decisions of each control agent can directly affect only the nodes connected by the corresp
This paper addresses set invariance properties for linear time-delay systems. More precisely, the first goal of the article is to review known necessary and/or sufficient conditions for the existence of invariant sets with respect to dynamical systems described by linear discrete time-delay difference equations (dDDEs). Secondly, we address the construction of invariant sets in the original state
A Keyless Signing Infrastructure (KSI) provides users with a means to timestamp documents on a per-second basis. The KSI consists of a global infrastructure with several server layers and by using Merkle hash trees, the root hash can be used to verify the integrity and timestamp of a document. Regular publication of root hashes, e.g., once per month, allows a document to be verified without suppor
Transfusion-related acute lung injury (TRALI) is a syndrome of respiratory distress triggered by blood transfusions and is the leading cause of transfusion-related mortality. TRALI has primarily been attributed to passive infusion of HLA and/or human neutrophil antigen antibodies present in transfused blood products, and predisposing factors such as inflammation are known to be important for TRALI
We consider the problem of designing distinguishers and nonrandomness detectors for stream ciphers using the maximum degree monomial test. We construct an improved algorithm to determine the subset of key and IV-bits used in the test. The algorithm is generic, and can be applied to any stream cipher. In addition to this, the algorithm is highly tweakable, and can be adapted depending on the desire
Background. Search and selection of primary studies in Systematic Literature Reviews (SLR) is labour intensive, and hard to replicate and update. Aims. We explore a machine learning approach to support semi-automated search and selection in SLRs to address these weaknesses. Method. We 1) train a classi er on an initial set of papers, 2) extend this set of papers by automated search and snowballing
Abundant data is the key to successful machine learning. However, supervised learning requires annotated data that are often hard to obtain. In a classification task with limited resources, Active Learning (AL) promises to guide annotators to examples that bring the most value for a classifier. AL can be successfully combined with self-training, i.e., extending a training set with the unlabelled e
Operating systems code is often developed according to principles like simplicity, low overhead, and low memory footprint. Schedulers are no exceptions. A scheduler is usually developed with flexibility in mind, and this restricts the ability to provide real-time guarantees. Moreover, even when schedulers can provide real-time guarantees, it is unlikely that these guarantees are properly quantifie
Scheduling library for efficient scheduling of time intervals and merging of schedules.
Random wireless network scenario generator.
Context: Uncertainty is an unavoidable issue in software engineering and an important area of investigation. This paper studies the impact of uncertainty on total duration (i.e., make-span) for implementing all features in operational release planning. Objective: The uncertainty factors under investigation are: (1) the number of new features arriving during release construction, (2) the estimated
Abstract in UndeterminedThe MPEG Reconfigurable Video Codingworking group is developing a new library-based pro-cess for building the reference codecs of future MPEGstandards, which is based on dataflow and uses an actorlanguage called Cal. The paper presents a code genera-tor producing RTL targeting FPGAs for Cal, outlinesits structure, and demonstrates its performance on anMPEG-4 Simple Profile
Achieving QoS-based broadband wireless access means a lot for the people living in the information age. WiMAX has evolved now into a stage that we can say it can meet this demand. From among the various fields to study in this domain, call admission and scheduling are the strongest tools in our hand to ensure QoS. On the other side, exploiting mesh topology is a good technique to increase the netw
SimSWE is a library of components for modeling and simulation of software engineering processes. It consists of a generic, implementation independent description of the components and a reference implementation using the MATLAB® / Simulink® environment. By providing ready-to-use building blocks for typical functionality, the library should facilitate and ease the use of simulation to analyze softw
The assumption of wide-sense-stationarity (WSS) and uncorrelated scattering (US) of wireless propagation channels is widespread for the design and analysis of wireless propagation channels. However, the assumption is only valid within a limited range. In this paper, we investigate the extension of this range not only in time (WSS), but also in frequency (US), for measured vehicular propagation cha
Ensembles of (J,K)-regular low-density parity-check convolutional (LDPCC) codes are known to be asymptotically good, in the sense that the minimum free distance grows linearly with the constraint length. In this paper, we use a protograph-based analysis of terminated LDPCC codes to obtain an upper bound on the free distance growth rate of ensembles of periodically time-varying LDPCC codes. This bo
