symbolic exploration of program points. It thus combines the ability of random search to reach deep program states quickly together with the ability of concolic testing to explore states in a neighborhood exhaustively. We have implemented our algorithm on top of CUTE and applied it to obtain better branch

Abstract—A Gaussian interference channel (IC) with a relay is considered. The relay is assumed to operate over an orthogonal band with respect to the underlying IC, and the overall system is referred to as IC with an out-of-band relay (IC-OBR). The system can be seen as operating over two parallel interferencelimited channels: The first is a standard Gaussian IC and the second is a Gaussian relay channel characterized by two sources and destinations communicating through the relay without direct links. We refer to the second parallel channel as OBR Channel (OBRC). The main aim of this work is to identify conditions under which optimal operation, in terms of the capacity region of the IC-OBR, entails either signal relaying and/or interference forwarding by the relay, with either a separable or non-separable use of the two parallel channels, IC and OBRC. Here “separable ” refers to transmission of independent information over the two constituent channels. For a basic model in which the OBRC consists of four orthogonal channels from sources to relay and from relay to destinations (IC-OBR Type-I), a condition is identified under which signal relaying and separable operation is optimal. This condition entails the presence of a relay-to-destinations capacity bottleneck on the OBRC and holds irrespective of the IC. When this condition is not satisfied, various scenarios, which depend on the IC channel gains, are identified in which interference forwarding and non-separable operation are necessary to achieve optimal performance. In these scenarios, the system exploits the “excess capacity ” on the OBRC via interference forwarding to drive the IC-OBR system in specific interference regimes (strong or mixed). The analysis is then turned to a more complex IC-OBR, in which the OBRC consists of only two orthogonal channels, one from sources to relay and one from relay to destinations (IC-OBR Type-II). For this channel, some capacity resuls are derived that parallel the conclusions for IC-OBR Type-I and point to the additional analytical challenges. I.

-tation steps. Evaluated on five open source libraries, the generat-ed parameterized unit tests are (a) more expressive, characterizing general rather than concrete behavior; (b) need fewer computation steps, making them easier to understand; and (c) achieve a higher coverage than regular unit tests.

, understanding by personality the individuation of social relationships in speci c brains, in interaction with the brain's biological features. Power is founded upon the ability to exercise violence. Historically, it is the monopoly of physical violence, embodied in the state, which has been the main

nite-context sources from fractal

1.1 Private and Public Key Cryptography..................... 5

Abstract not found

mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where the group elements are data structures in a computer. Matrices are unnecessarily large structures, and part of this thesis is concerned with small and efficient representations of a large class of Coxeter groups (including most Coxeter groups that anyone ever payed any attention to.) The main contents of the thesis can be summarized as follows. • We prove that for all Coxeter graphs constructed from an n-path of unlabelled edges by adding a new labelled edge and a new vertex (sometimes two new edges and vertices), there is a permutational representation of the corresponding group. Group elements correspond to integer n-sequences and the nodes in the path generate all n! permutations. The extra node has a more complicated action, adding a certain quantity to some of the numbers.

This paper presents the first theoretical results showing that stable identification of overcomplete µ-coherent dictionaries Φ ∈ Rd×K is locally possible from training signals with sparsity levels S up to the order O(µ−2) and signal to noise ratios up to O( d). In particular the dictionary

Abstract—Physical-layer network coding (PLNC) allows two remote terminals to exchange information in two time slots via a half-duplex relay. In this paper, we consider PLNC in underwater acoustic (UWA) two-way relay networks, with particular attention on the recovery of the network-coded codeword at the relay. Considering multiple paths in UWA channels with large delay spreads and temporal variations, orthogonal-frequency divisionmultiplexing (OFDM) is used as an underlying modulation. Distinct from existing works which mainly focus on the flat-fading channel and the non-iterative PLNC decoding, we investigate three iterative receivers at the relay in doubly-selective UWA channels. To estimate the network-coded codeword, the three receivers respectively adopt i) a conventional decoding scheme to recover the codewords from two terminals independently; ii) a decoding scheme to recover the network-coded codeword