Sharif Digital Repository

In this paper we use the Output Statistics of Random Binning (ORSB) framework to extend the noisy network coding of Lim et al. to include an eavesdropper  

This paper introduces a new and ubiquitous framework for establishing achievability results in network information theory problems. The framework uses random binning arguments and is based on a duality between channel and source coding problems. Furthermore, the framework uses pmf approximation arguments instead of counting and typicality. This allows for proving coordination and strong secrecy problems, where certain statistical conditions on the distribution of random variables need to be satisfied. These statistical conditions include independence between messages and eavesdropper's observations in secrecy problems and closeness to a certain distribution (usually, i.i.d. distribution) in... 

Non-recursive and explicit expressions for calculating the number of ways to distribute n indistinguishable balls into m distinguishable bins with different capacities have been derived. Similar expression for the special case where bins have the same capacity was previously reported in the literature. Theses expressions can be used to study network graphs with grid structures. In this line, we have derived some topological properties of meshes, furnishing some expressions to calculate the surface area and volume of radial spheres in the mesh network. © 2003 IEEE  

In this paper the Output Statistics of Random Binning (OSRB) framework is used to prove a new inner bound for the problem of secure channel simulation. Our results subsume some recent results on the secure function computation. We also provide an achievability result for the problem of simultaneously simulating a channel and creating a shared secret key. A special case of this result generalizes the lower bound of Gohari and Anantharam on the source model to include constraints on the rates of the public discussion  

In this paper, we study the problem of coordinating two nodes which can only exchange information via a relay at limited rates. The nodes are allowed to do a two-round interactive two-way communication with the relay, after which they should be able to generate i.i.d. copies of two random variables with a given joint distribution within a vanishing total variation distance. We prove inner and outer bounds on the coordination capacity region for this problem. Our inner bound is proved using the technique of "output statistics of random binning" that has recently been developed by Yassaee, et al  

Packing problems arise in a wide variety of application areas. The basic problem is that of determining an efficient arrangement of different objects in a region without any overlap and with minimal wasted gap between shapes. This paper presents a novel population based approach for optimizing arrangement of irregular shapes. In this approach, each shape is coded as an agent and the agents' reproductions and grouping policies results in arrangements of the objects in positions with least wasted area between them. The approach is implemented in an application for cutting sheets and test results on several problems from literature are presented. COPYRIGHT © ENFORMATIKA  

In this paper we develop a finite blocklength version of the Output Statistics of Random Binning (OSRB) framework. This framework is shown to be optimal in the point-to-point case. New second order regions for broadcast channel and wiretap channel with strong secrecy criterion are derived  

Context. Photometric monitoring of the variability of brown dwarfs can provide useful information about the structure of clouds in their cold atmospheres.The brown-dwarf binary system Luhman 16AB is an interesting target for such a study, because its components stand at the L/T transition and show high levels of variability. Luhman 16AB is also the third closest system to the solar system, which allows precise astrometric investigations with ground-based facilities. Aims. The aim of the work is to estimate the rotation period and study the astrometric motion of both components. Methods. We have monitored Luhman 16AB over a period of two years with the lucky-imaging camera mounted on the... 

Based on previous studies, empirical distribution of the bacterial burst size varies even in a population of isogenic bacteria. Since bacteriophage progenies increase linearly with time, it is the lysis time variation that results in the bacterial burst size variations. Here, the burst size variation is computationally modeled by considering the lysis time decisions as a game. Each player in the game is a bacteriophage that has initially infected and lysed its host bacterium. Also, the payoff of each burst size strategy is the average number of bacteria that are solely infected by the bacteriophage progenies after lysis. For calculating the payoffs, a new version of ball and bin model with... 

In this paper, we study the problem of channel simulation via interactive communication, known as the coordination capacity, in a two-terminal network. We assume that two terminals observe i.i.d. copies of two random variables and would like to generate i.i.d. copies of two other random variables jointly distributed with the observed random variables. The terminals are provided with two-way communication links, and shared common randomness, all at limited rates. Two special cases of this problem are the interactive function computation studied by Ma and Ishwar, and the tradeoff curve between one-way communication and shared randomness studied by Cuff. The latter work had inspired Gohari and... 

In this paper we study the sum modulo two problem proposed by Körner and Marton. In this source coding problem, two transmitters who observe binary sources X and Y, send messages of limited rate to a receiver whose goal is to compute the sum modulo of X and Y. This problem has been solved for the two special cases of independent and symmetric sources. In both of these cases, the rate pair (H(X|Y), H(Y|X)) is achievable. The best known outer bound for this problem is a conventional cut-set bound, and the best known inner bound is derived by Ahlswede and Han using a combination of Slepian-Wolf and Körner-Marton's coding schemes. In this paper, we propose a new outer bound which is strictly... 

Functional connectivity in human brain can be represented as a network using electroencephalography (EEG) signals. Network representation of EEG time series can be an efficient vehicle to understand the underlying mechanisms of brain function. Brain functional networks whose nodes are brain regions and edges correspond to functional links between them are characterized by neurobiologically meaningful graph theory metrics. This study investigates the degree to which graph theory metrics are sex dependent. To this end, EEGs from 24 healthy female subjects and 21 healthy male subjects were recorded in eyes-closed resting state conditions. The connectivity matrices were extracted using... 

The authors propose a new technique to model the arriving energy's knowledge (AEK) in the energy harvesting (EH) communication systems. They consider a batteryless EH transmitter with the AEK non-causally provided to it. They show that the capacity of the authors' model in general case, that is, discrete memoryless channel, can be derived through a binning scheme. This resembles a Gelfand-Pinsker type capacity formula which intuitively is the result of treating the energy as a channel state. Moreover, they investigate two especial cases of binary and Gaussian channels with the EH transmitters. In the binary symmetric channel with EH transmitter (BSCEH), their coding scheme leads to achieve... 

The present paper reports the spectroscopic investigations on the complexation of Cu(II) with two macrocyclic ligands bonded to [60]Fullerene (L1 and L2) measured in N-methylpyrrolidone (NMP) as solvent. On the basis of UV–vis-NIR spectroscopy applying Jobs method of continuous variation, typical 1:1 stoichiometries were established for the complexes of Cu(II) with L1, and L2. DFT calculations suggested that superior HOMO distributions spread over the nitrogen-donor (as well as somehow oxygen- donor in L2) groups of L1 and L2 macrocycles were the key factor for the observed Kb value enhancement. Thermodynamic stabilities for these complexes have also been determined employing... 

The secrecy problem in the state-dependent cognitive interference channel is considered in this paper. In our model, there are a primary and a secondary (cognitive) transmitter–receiver pairs, in which the cognitive transmitter has the message of the primary one as side information. In addition, the channel is affected by two channel state sequences, which are known at the cognitive transmitter and the corresponding receiver, separately. The cognitive transmitter should cooperate with the primary one, and it wishes to keep its message secure at the primary receiver. The achievable equivocation-rate regions for this channel are derived using two approaches: the binning scheme coding and... 

A sampling and switching method for a binary weighted digital-to-analogue converter (DAC) in successive approximation register (SAR) analogue-to-digital converters (ADCs) is presented. This sampling method is proposed to reduce the switching energy. Thanks to the proposed switching method, only one reference voltage (Vcm = 1/2 Vref) is required which helps to improve the precision of the DAC along with energy reduction compared with those methods that use more than one reference voltage. The switching energy and area of the DAC reduce by 97.66% and 50% compared with the conventional binary weighted DAC  

Based on the optimal control theory, the present study proposes a novel approach to derive a cooperative guidance law for two pursuers with an arbitrary-order linear dynamics against one zero-lag evader with random step maneuver. This approach is intended to minimize the mean value of the resultant control effort taken over a set of possible evader maneuvers which is modeled as a step function, the parameters of which are unknown. Since the resultant control effort is the minimum effort among the pursuers, we encounter the nonlinear "min" function in the performance index. By introducing binary parameters, it is changed to a linear function including binary parameters and continuous... 

In the binary majority voting problem, each node initially chooses between two alternative choices. The goal is to design a distributed algorithm that informs nodes which choice is in majority. In this study, the authors formulate this problem as a hypothesis testing problem and propose fixed-size and sequential solutions using classical and Bayesian approaches. In the sequential version, the proposed mechanism enables nodes to test which choice is in majority, successively in time. Hence, termination of the algorithm is embedded within it, contrary to the existing approaches which require a monitoring algorithm to indicate the termination. This property makes the algorithm more efficient in... 

A facile hydrothermal method and subsequent electroactivation have been developed to fabricate three-dimensional (3D) CuO nanosheet arrays on the copper foil substrate, which can be used directly as a binder-free electrode for supercapacitor applications. Under optimum conditions, by using this facile method, a high capacitance of 125 mF/cm2 at a current density of 0.3 mA/cm2 is obtained. The prepared supercapacitor showed a good rate capability (46.4% capacitance retention, when the current density is increased to more than 30 times) and an excellent cyclability (more than 88% capacitance retention after 3000 cycles). © 2017 Elsevier B.V  

In this paper, we study the problem of simulating a discrete memoryless channel (DMC) from another DMC under an average-case and an exact model. We present several achievability and infeasibility results, with tight characterizations in special cases. In particular, for the exact model, we fully characterize when a binary symmetric channel can be simulated from a binary erasure channel when there is no shared randomness. We also provide infeasibility and achievability results for the simulation of a binary channel from another binary channel in the case of no shared randomness. To do this, we use the properties of Rényi capacity of a given order. We also introduce a notion of 'channel...