Search

Caching is an efficient way to reduce network traffic congestion during peak hours by storing some content at the users' local caches. For the shared-link network with end-user-caches, Maddah-Ali and Niesen proposed a two-phase coded caching strategy. In practice, users may communicate with the server through intermediate relays. This paper studies the tradeoff between the memory size $M$ and the network load $R$ for networks where a server with $N$ files is connected to $H$ relays (without caches), which in turn are connected to $K$ users equipped with caches of $M$ files. When each user is connected to a different subset of $r$ relays, i.e., $K = \binom{H}{r}$, the system is referred to as a {\it combination network with end-user-caches}. In this work, converse bounds are derived for the practically motivated case of {\it uncoded} cache contents, that is, bits of the various files are directly pushed into the user caches without any coding. In this case, once the cache contents and the user demands are known, the problem reduces to a general index coding problem.This paper shows that relying on a well-known "acyclic index coding converse bound" results in converse bounds that are not tight for combination networks with end-user-caches. A novel converse bound that leverages the network topology is proposed, which is the tightest converse bound known to date. As a result of independent interest, an inequality that generalizes the well-known sub-modularity of entropy is derived. Several novel caching schemes are proposed, based on the Maddah-Ali and Niesen cache placement. The proposed schemes are proved: (i) to be (order) optimal for some $(N,M,H,r)$ parameters regimes under the constraint of uncoded cache placement, and (ii) to outperform the state-of-the-art schemes in numerical evaluations., 22 pages, 3 figures; accepted by IEEE TIT

Auxetic structures have become one of the most studied types of cellular structure in recent years, thanks to their highly specific mechanical properties. Most microstructures are designed with homogeneous properties in their main axes; however, in this research, we propose an innovative asymmetric 3D auxetic structure based on a 2D configuration of cells drawn from the literature. The new auxetic cell is designed by topology analysis using classical Timoshenko beam theory. To validate the design, samples were constructed by fused filament fabrication with ABSplus, and tested under quasi-static compression to determine Young's modulus in the three orthogonal directions. The experimental results show good agreement with the topological analysis and reveal that the proposed cell can transmit a different mechanical behavior to the macrostructure in its three orthogonal directions.

In this research, the Stewart-Cazacu micromechanics coupled damage model is extended and validated adding nucleation and coalescence models as new damage mechanisms. The Ti–6Al–4V titanium alloy is chosen as a suitable hcp ductile material to be modeled using this extended damage law. The characterization of the damage evolution in this alloy is addressed throughout a quasi-static experimental campaign. Damage characterization relies on in situ X-ray tomography data and scanning electron microscopy imaging technique. The validation procedure consists in the implementation into the finite element research software Lagamine of ULiège and in the comparison of numerical predictions and experimental results. Load–displacement curves and damage-related state variables at fracture configuration from smooth and notched bar specimens submitted to tensile tests are analyzed. The nucleation and coalescence model extensions as well as an accurate elastoplastic and damage material parameter identification for Ti–6Al–4V samples are essential features to reach a validated model. The prediction capabilities exhibited for large strains are in good agreement with experimental results, while the near-fracture strains can still be improved.

The establishment of new collaborations among scientists fertilizes the scientific environment, fostering novel discoveries. Understanding the dynamics driving the development of scientific collaborations is thus crucial to characterize the structure and evolution of science. In this work, we leverage the information included in publication records and reconstruct a categorical multiplex networks to improve the prediction of new scientific collaborations. Specifically, we merge different bibliographic sources to quantify the prediction potential of scientific credit, represented by citations, and common interests, measured by the usage of common keywords. We compare several link prediction algorithms based on different dyadic and triadic interactions among scientists, including a recently proposed metric that fully exploits the multiplex representation of scientific networks. Our work paves the way for a deeper understanding of the dynamics driving scientific collaborations, and validates a new algorithm that can be readily applied to link prediction in systems represented as multiplex networks.

This paper investigates the problem of characterizing the capacity of Half-Duplex (HD) line networks , where a source node communicates to a destination node through a multi-hop path of $N$ relays. If the relays operate in Full-Duplex (FD), it is well known that the capacity of the line network equals the minimum among the point-to-point link capacities in the path. In contrast, this paper considers a different case where the relays operate in HD. In the first part of the paper, it is shown that the approximate capacity (optimal up to a constant additive gap that only depends on the number of nodes in the network) of an HD $N$ -relay line network equals half the minimum of the harmonic means of the point-to-point link capacities of each two consecutive links in the path. It is then proved that the $N+1$ listen/transmit states (out of the $2^{N}$ possible ones) sufficient to characterize the approximate capacity can be found in linear time. In the second part of the paper, it is shown that the problem of finding the path that has the largest HD approximate capacity in a network that can be represented as a graph is NP-hard. However, if the number of cycles in the network is polynomial in the number of nodes, then a polynomial-time algorithm can indeed be designed.

This paper considers the problem of code design for a channel where communications and radar systems coexist, modeled as having both Additive White Gaussian Noise (AWGN) and Additive Radar Interference (ARI). The issue of how to adapt or re-design convolutional codes (decoded by the Viterbi algorithm) and LDPC codes (decoded by the sum-product algorithm and optimized by using the EXIT chart method) to effectively handle the overall non-Gaussian ARI noise is investigated. A decoding metric is derived from the non-Gaussian ARI channel transition probability as a function of the Signal-to-Noise Ratio (SNR) and Interference-to-Noise Ratio (INR). Two design methodologies are benchmarked against a baseline "unaltered legacy system", where a code designed for AWGN-only noise, but used on the non-Gaussian ARI channel, is decoded by using the AWGN-only metric (i.e., as if INR is zero). The methodologies are: M1) codes designed for AWGN-only noise, but decoded with the new metric that accounts for both SNR and INR; and M2) codes optimized for the overall non-Gaussian ARI channel. Both methodologies give better average Bit Error Rate (BER) in the high INR regime compared to the baseline. In the low INR regime, both methodologies perform as the baseline since in this case the radar interference is weak. Interestingly, the performance improvement of M2 over M1 is minimal. In practice, this implies that specifications in terms of channel error correcting codes for commercially available wireless systems need not be changed, and that it suffices to use an appropriate INR-based decoding metric in order to effectively cope with the ARI.

Finding the underlying probability distributions of a set of observed sequences under the constraint that each sequence is generated i.i.d by a distinct distribution is considered. The number of distributions, and hence the number of observed sequences, are let to grow with the observation blocklength $n$. Asymptotically matching upper and lower bounds on the probability of error are derived., Under Submission

Full range constant strain rate tests are required for accurately characterizing initial yield point, strength differential effect and direct identification of constitutive laws describing the plastic behavior of materials. These tests require the use of a closed-loop control in order to achieve the constant strain rate, however this feature is not available in many laboratories. A method for full range constant strain rate with testing machines that can be configured for user-defined displacements of the cross head prior to testing is presented here. Tests performed at a constant die speed include a variable strain rate response for the specimen involved. Significant deformation rate variation occurs between the elastic and plastic range with consequences for initial yield point identification. To overcome this drawback, appropriate user-defined displacements can be computed and applied, allowing for both tensile and compression tests to be performed at a constant strain rate. The method is validated using a compression test of Ti6Al4V alloy at room temperature, as well as a 3D digital image correlation (DIC) system exhibiting a constant strain rate value equal to 10−3 s−1, for both elastic and plastic ranges. A non-negligible inhomogeneous strain field was measured on the surface of the compression specimen using DIC and was corroborated by numerical modeling. Results identified the source of the non-homogeneous strain field, thereby proposing a quantitative indicator of plastic anisotropy. The initial yield stress and strain hardening rates of the alloy at several temperatures were obtained with both testing method, conventional constant cross-head speed, and the constant strain rate; these were then used to determine the influence of the small strain rate variations on the mechanical response of Ti6Al4V alloy.

The ability of three plasticity models to predict the mechanical behavior of Ti6Al4V until fracture is presented. The first model is the orthotropic yield criterion CPB06 developed by Cazacu et al. (Int J Plast 22:1171–1194, 2006) with a distortional hardening, allowing for the description of material anisotropy and the strength differential effect. The second model is the anisotropic Hill’48 yield criterion with distortional hardening, describing the material anisotropy with quadratic functions but is unable to model the strength differential effect. Finally, the third model is the classical Hill’48 yield locus with isotropic hardening. Distortional hardening is modeled through five yield surfaces associated with five levels of plastic work. Each model is validated by comparing the finite element predictions with experimental results, such as the load and displacement field histories of specimens subjected to different stress triaxiality values. Tensile tests are performed on round bars with a V-notch, a through-hole, and two different radial notches; compression tests are performed on elliptical cross-section samples. The numerical results show that none of the models can perfectly predict both the measured load and the sample shape used for validation. However, the CPB06 yield criterion with distortional hardening minimizes the global error of the model predictions. The results provide a quantification of the influence of mechanical features such as hardening phenomenon, plastic anisotropy, and tension–compression asymmetry. The impact of these features on the prediction of the post-necking deformation behavior of the Ti6Al4V alloy is explored.

Coded caching is a promising technique to smooth out network traffic by storing part of the library content at the users' local caches. The seminal work on coded caching for single file retrieval by Maddah-Ali and Niesen (MAN) showed the existence of a global caching gain that scales with the total memory in the system, in addition to the known local caching gain in uncoded systems. This paper formulates a novel cache-aided matrix multiplication retrieval problem, relevant for data analytics and machine learning applications. In the considered problem, each cache-aided user requests the product of two matrices from the library. A structure-agnostic solution is to treat each possible matrix product as an independent file and use the MAN coded caching scheme for single file retrieval. This paper proposes two structure-aware schemes, which partition each matrix in the library by either rows or columns and let a subset of users cache some sub-matrices, that improve on the structure-agnostic scheme. For the case where the library matrices are "fat" matrices, the structure-aware row-partition scheme is shown to be order optimal under some constraint., 41 pages, 5 figures, submitted to Transactions on Information Theory

Summary We challenged four big brown bats to maneuver through abrupt turns in narrow corridors surrounded by dense acoustic clutter. We quantified bats' performance, sonar beam focus, and sensory acquisition rate. Performance was excellent in straight corridors, with sonar beam aim deviating less than 5° from the corridor midline. Bats anticipated an upcoming abrupt turn to the right or left by slowing flight speed and shifting beam aim to “look” proactively into one side of the corridor to identify the new flightpath. All bats mastered the right turn, but two bats consistently failed the left turn. Bats increased their sensory acquisition rate when confronting abrupt turns in both successful and failed flights. Limitations on biosonar performance reflected failures to switch beam aim and to modify a learned spatial map, rather than failures to update acquisition rate., Graphical abstract, Highlights • Echolocating bats use sonar to identify flightpaths through dense, cluttered scenes • Bats learn new flightpaths by switching beam aim before encountering obstacles • Bats see their environment in depth, Biological Sciences; Zoology; Animals; Ethology

The global demand for products manufactured with carbon fibers (CFs) has increased in recent years; however, the waste generated at the end of the product lifetime has also increased. In this research, the impact of the addition of carbon nanotubes (CNTs) on the interlaminated resistance of recycled carbon fibers (RCFs) was studied. In this work, a recycling process of the composite material was applied via thermolysis to obtain the CFs, followed by the growth of CNTs on their surface using the Poptube technique. The recycling temperature were 500 °C and 700 °C; and ferrocene and polypyrrole were used to grow CNTs on CFs surface. CNTs were verified by Raman spectroscopy and scanning electron microscopy (SEM). Finally, to determine the interlaminar resistance, a double cantilever beam (DCB) test was performed. The results indicate that with Poptube technique, CNTs can be grown on RCFs using both impregnations. Thermolysis recycling process at 500 °C allowed CFs without resin residues and without visible damage. The DCB tests showed a decrease in the fracture resistance in mode I loading of 34.9% for the polypyrrole samples and 29.3% for the ferrocene samples compared with the virgin carbon fibers (VCFs) samples with a resistance of 1052.5 J/m2.

This article focuses on a systematic study of a Ti-6Al-4V alloy in order to extensively characterize the main mechanical properties at the macro-, micro- and submicrometric length scale under different stress fields. Hardness, elastic modulus, true stress&ndash, strain curves and strain-hardening exponent are correlated with the intrinsic properties of the &alpha, and &beta, phases that constitute this alloy. A systematic characterization process followed, considering the anisotropic effect on both orthogonal crystallographic directions, as well as determining the intrinsic properties for the &alpha, phase. An analytical relationship was established between the flow stress determined under different stress fields, testing geometries and length scales, highlighting that it is possible to estimate flow stress under compression and/or tensile loading from the composite hardness value obtained by instrumented nanoindentation testing.

Maddah-Ali and Niesen (MAN) in 2014 showed that coded caching in single bottleneck-link broadcast networks allows serving an arbitrarily large number of cache-equipped users with a total link load (bits per unit time) that does not scale with the number of users. Since then, the general topic of coded caching has generated enormous interest both from the information theoretic and (network) coding theoretic viewpoint, and from the viewpoint of applications. Building on the MAN work, this paper considers a particular network topology referred to as cache-aided Fog Radio Access Network (Fog-RAN), that includes a Macro-cell Base Station (MBS) co-located with the content server, several cache-equipped Small-cell Base Stations (SBSs), and many users without caches. Some users are served directly by the MBS broadcast downlink, while other users are served by the SBSs. The SBSs can also exchange data via rounds of direct communication via a side channel, referred to as "sidelink". For this novel Fog-RAN model, the fundamental tradeoff among (a) the amount of cache memory at the SBSs, (b) the load on the downlink (from MBS to directly served users and SBSs), and (c) the aggregate load on the sidelink is studied, under the standard worst-case demand scenario. Several existing results are recovered as special cases of this network model and byproduct results of independent interest are given. Finally, the role of topology-aware versus topology-agnostic caching is discussed., 53 pages, 6 figures, submitted to Transactions on Information Theory

Coded Caching, proposed by Maddah-Ali and Niesen (MAN), has the potential to reduce network traffic by pre-storing content in the users&rsquo, local memories when the network is underutilized and transmitting coded multicast messages that simultaneously benefit many users at once during peak-hour times. This paper considers the linear function retrieval version of the original coded caching setting, where users are interested in retrieving a number of linear combinations of the data points stored at the server, as opposed to a single file. This extends the scope of the authors&rsquo, past work that only considered the class of linear functions that operate element-wise over the files. On observing that the existing cache-aided scalar linear function retrieval scheme does not work in the proposed setting, this paper designs a novel coded caching scheme that outperforms uncoded caching schemes that either use unicast transmissions or let each user recover all files in the library.

We have explored the use of two different iron-based porous materials for arsenic uptake from neutral pH aqueous solutions. Both materials are reminiscent of a material known as MIL-100(Fe), a Metal Organic Framework (MOF) built upon the coordination of Fe(III) ions with trimesate organic linkers (benzene tricarboxylic acid). Aside from the proverbial high surface area with extended microporosity/mesoporosity, the presence of Fe(III) centers offers the possibility of specific strong interactions with arsenic, therefore making it appealing for its use in detection and purification technologies. Our approach tackles the characterization of the system from both physical and chemical perspectives. We report equilibrium isotherms and time dependent arsenic uptake for the determination of adsorption capacity and kinetics; and also, by means of synchrotron-based X-ray absorption techniques, we probe possible changes in coordination environments and oxidation states of Fe and As in the porous network occurring upon adsorption at high and low loadings. The results presented bring further insight on the nature and diversity of adsorption sites present and confirm the suitability of the proposed adsorbents for the intended use., Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas

Agriculture overexploits water resources in many regions, as water stress metrics highlight. Tracing back the causes of water overuses and separately accounting for soil water, surface water and groundwater resources is an open challenge to monitor the sustainability of agricultural water use. We introduce the “water debt repayment time” indicator, measuring the time required to replenish water resources used for annual crop production. This indicator disentangles source‐ and crop‐specific water overuses at a high spatial resolution. Globally, we find that wheat and rice production critically overuses groundwater resources and cotton production overuses both surface water and groundwater. Locally, unsustainable production is found over the Sabarmati Basin and in the Chao Phraya Basin, where the repayment time exceeds 5 years in many cultivated areas. Critical overuses are also found over the High Plain and Indo‐Gangetic Plains, where the repayment times reach 50 years. Unsustainable irrigation is often a consequence of growing crops during local dry seasons.

The fading broadcast channel (BC) with additive white Gaussian noise (AWGN) channel, channel output feedback (COF) and channel state information (CSI) is considered. Perfect CSI is available at the receivers, and unit delayed CSI along with COF at the transmitter. Under the assumption of memoryless fading, a posterior matching scheme that incorporates the additional CSI feedback into the coding scheme is presented. With COF, the achievable rates depend on the joint distribution of the fading process. Numerical examples show that the capacity region of two-user fading AWGN-BC is enlarged by COF. The coding scheme is however suboptimal since some parts of the achievable rate region are outperformed by superposition coding without COF.

This paper considers cache-aided device-to-device (D2D) networks where a trusted server helps to preserve the privacy of the users’ demands. Specifically, the trusted server collects the users’ demands before the delivery phase and sends a query to each user, who then broadcasts multicast packets according to this query. Recently the Authors proposed a D2D private caching scheme that was shown to be order optimal except for the very low memory size regime, where the optimality was proved by comparing to a converse bound without privacy constraint. The main contribution of this paper is a novel converse bound for the studied model where users may collude (i.e., some users share cache contents and demanded files, and yet cannot infer what files the remaining users have demanded) and under the placement phase is uncoded. To the best of the Author’s knowledge, such a general bound is the first that genuinely accounts for the demand privacy constraint. The novel converse bound not only allows to show that the known achievable scheme is order optimal in all cache size regimes (while the existing converse bounds cannot show it), but also has the potential to be used in other variants of demand private caching.

This paper introduces a modeling framework for the analysis of real and virtual water flows at national scale. The framework has two components: (1) a national water model that simulates agricultural, industrial and municipal water uses, and available water and land resources; and (2) an international virtual water trade model that captures national virtual water exports and imports related to trade in crops and animal products. This National Water, Food & Trade (NWFT) modeling framework is applied to Egypt, a water-poor country and the world's largest importer of wheat. Egypt's food and water gaps and the country's food (virtual water) imports are estimated over a baseline period (1986–2013) and projected up to 2050 based on four scenarios. Egypt's food and water gaps are growing rapidly as a result of steep population growth and limited water resources. The NWFT modeling framework shows the nexus of the population dynamics, water uses for different sectors, and their compounding effects on Egypt's food gap and water self-sufficiency. The sensitivity analysis reveals that for solving Egypt's water and food problem non-water-based solutions like educational, health, and awareness programs aimed at lowering population growth will be an essential addition to the traditional water resources development solution. Both the national and the global models project similar trends of Egypt's food gap. The NWFT modeling framework can be easily adapted to other nations and regions., Graphical abstract Unlabelled Image, Highlights • Virtual water trade should be considered when managing national water resources. • Non-water based solutions can remediate water problems in water-scarce countries. • Egypt's water and food gaps are projected to aggressively widen in the future. • Both the global and national models projected similar patterns of Egypt's imports. • NWFT modeling framework can be easily applied to any country in the world.

Increasing demands for spectrum have necessitated the coexistence of communications and radar systems within the same band. This paper investigates how an unaltered radar system affects the performance of a communications receiver. For a single-carrier communications system, it is shown that a low power radar signal can be treated as Gaussian noise while a strong radar signal can be subtracted off the received signal, but in doing so one of the two signal dimensions is lost. Complex-valued constellation design problems are next proposed, with the goal of either minimizing the error rate under a power constraint, or maximizing the transmission rate under both error rate and power constraints. Numerically, the designed constellation is shaped as a concentric hexagon for weak radar interference while it morphs into an uneven pulse amplitude modulation for strong interference. A multi-carrier orthogonal frequency division multiplexing communications system is lastly considered. Due to the radar interference, the received signal becomes correlated over time and across carriers. To reduce the complexity of the optimal receiver, several suboptimal decoders are analyzed, among which the one that discards the correlations between subcarriers is numerically found to perform close to the optimal one.

Multilayers incorporated with stimuli-responsive substances by means of layer-by-layer (LbL) self-assembly are much attractive due to the advantages of stimuli-responsiveness and potential applications in different fields. In this study, pyrenemethyl acrylate (PA) was synthesized, and was copolymerized with acrylic acid (AA) to obtain the amphiphilic and photodegradable P(PA-co-AA) polymers with a PA:AA molar ratio of 1.3:3, and an average molecular weight of 6.9 kDa and polydispersity index of 1.04. They formed micelles spontaneously when dispersed in aqueous solution with a size of 27.5 nm in a dry state and 136.6 nm in a wet state. The micelles were readily decomposed to form aggregates as a result of the cleavage of the pyrenemethyl ester bonds under UV-irradiation. UV-responsive micelles-containing multilayers were prepared by LbL self-assembly of the UV-responsive micelles and polyallylamine hydrochloride (PAH). UV-irradiation of the multilayers resulted in the decomposition of micelles, leading to larger surface roughness, and enhanced swelling ratio and wettability of the multilayers. In vitro culture of A549 and HepG2 cells showed significantly better adhesion at 4 h on the UV-illuminated multilayers, whereas the cell proliferation was not affected until 5 d. Fil: Zhang, Haolan. Zhejiang University; China Fil: Wang, Danyu. Zhejiang University; China Fil: Lin, Xue. Zhejiang University; China Fil: Politakos, Nikolaos. Centro de Investigación Cooperativa en Biomateriales; España Fil: Tuninetti, Jimena Soledad. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Centro de Investigación Cooperativa en Biomateriales; España Fil: Moya, Sergio Enrique. Centro de Investigación Cooperativa en Biomateriales; España Fil: Gao, Changyou. Zhejiang University; China

This paper studies inner and outer bounds on the degrees of freedom (DoF) region of the multi-antenna two-user Gaussian interference channel with an instantaneous relay (IR) or relay without delay. It is assumed that the two transmitters and the two receivers have $\mathop {\mathrm {\mathsf {M}}}\nolimits$ antennas, while the IR receives through $\mathop {\mathrm {\mathsf {N_{r}}}}\nolimits$ antennas and transmits through $\mathop {\mathrm {\mathsf {N_{t}}}}\nolimits$ antennas. In the proposed achievable scheme, which generalizes a known one for the case $\mathop {\mathrm {\mathsf {M}}}\nolimits = \mathop {\mathrm {\mathsf {N_{r}}}}\nolimits = \mathop {\mathrm {\mathsf {N_{t}}}}\nolimits$ to any $(\mathop {\mathrm {\mathsf {M}}}\nolimits, \mathop {\mathrm {\mathsf {N_{r}}}}\nolimits, \mathop {\mathrm {\mathsf {N_{t}}}}\nolimits)$ , the IR performs memoryless linear operations on its received signal so as to neutralize interference at the receivers, and the beamforming matrices used by the IR and the transmitters are jointly designed. This joint design strictly outperforms known achievable schemes. Two outer bounds are derived. An information theoretic outer bound is obtained by giving the receivers or the IR genie side information, so that the DoF region of the resulting enhanced channel is known; this converse is valid for any type of processing at the IR and shows the optimality of the proposed achievable scheme for some $(\mathop {\mathrm {\mathsf {M}}}\nolimits, \mathop {\mathrm {\mathsf {N_{r}}}}\nolimits, \mathop {\mathrm {\mathsf {N_{t}}}}\nolimits)$ . A linear processing outer bound is obtained when the IR is restricted to performs linear operations, without any memoryless restriction, on its received signal and shows the optimality of the proposed achievable scheme among all linear processing schemes at the IR. As a result of independent interest, the DoF region of the classical multi-antenna two-user Gaussian interference channel without relay when the channel matrices can have any structure is also derived, which generalized available DoF region results that were derived under certain assumptions on the structure of the channel matrices.

Caching is an efficient way to reduce network traffic congestion during peak hours, by storing some content at the user's local cache memory, even without knowledge of user's later demands. Maddah-Ali and Niesen proposed a two-phase (placement phase and delivery phase) coded caching strategy for broadcast channels with cache-aided users. This paper investigates the same model under the constraint that content is placed uncoded within the caches, that is, when bits of the files are simply copied within the caches. When the cache contents are uncoded and the users' demands are revealed, the caching problem can be connected to an index coding problem. This paper focuses on deriving fundamental performance limits for the caching problem by using tools for the index coding problem that were either known or are newly developed in this work. First, a converse bound for the caching problem under the constraint of uncoded cache placement is proposed based on the "acyclic index coding converse bound". This converse bound is proved to be achievable by the Maddah-Ali and Niesen's scheme when the number of files is not less than the number of users, and by a newly derived index coding achievable scheme otherwise. The proposed index coding achievable scheme is based on distributed source coding and strictly improves on the widely used "composite (index) coding" achievable bound and its improvements, and is of independent interest. An important consequence of the findings of this paper is that advancements on the coded caching problem posed by Maddah-Ali and Niesen are thus only possible by considering strategies with coded placement phase. A recent work by Yu et al. has however shown that coded cache placement can at most half the network load compared to the results presented in this paper., Comment: 15 pages, 5 figures, to appear in IEEE Transactions on Information Theory, the journal version of arXiv:1511.02256, arXiv:1601.06383, and arXiv:1702.07265

This paper studies a variant of the Pliable Index CODing (PICOD) problem, i.e., an index coding problem where a user can be satisfied by decoding any message that is not in its side information set, where communication is decentralized, i.e., it occurs among users rather than by the central server, and secure, i.e., each user is allowed to decode only one message outside its side information set and must not be able to collect any information about any other message that is not its decoded one. Given the difficulty of the general version of this problem, this paper focuses on the case where the side information sets are `$s$~circular shifts', namely, user $u$'s side information set is the set of messages indexed by $\{u, u+1, \ldots, u+s-1\}$ for some fixed $s$ and where the indices are intended modulo the cardinality of the message set. This particular setting has been studied in the `decentralized non-secure' and in the `centralized secure' settings, thus allows one to quantify the cost of decentralized communication under security constraints on the number of transmissions. Interestingly, the decentralized vs the centralized secure setting incurs a multiplicative gap of approximately~three. This is in contrast to the cases without security constraint, where the multiplicative gap is known to be at most two., 6 pages, 1 figure, submitted to ISIT 2020

This paper studies the Layered Packet Erasure Broadcast Channel (LPE-BC) with Channel Output Feedback (COF), which is a high-SNR approximation of the fading Gaussian BC, proposed by Tse and Yates in 2012 for the case without COF. This model is also a multi-layer generalization of the Binary Erasure Channel (BEC). In a past work, the Authors derived inner and outer bounds to the rate region (set of achievable rates with backlogged arrivals) of the LPE-BC with COF; here, the arrival region (set of exogenous arrival rates for which packet arrival queues are stable) for the same model is analyzed. For the case of K=2 users and Q$\geq 1$ layers, the known achievable rate region and the derived arrival region coincide; both strategically employ a network-coding based retransmission protocol. For the case of Q = 2 layers, sufficient conditions are given for the achievable arrival region to coincide with the known converse rate region, thus showing that in those cases the optimal rate and arrival regions coincide.

This paper considers a novel cache-aided Fog Radio Access Network (Fog-RAN) architecture including a Macro-cell Base Station (MBS), several Small-cell Base Stations (SBSs), and users. Some users, not in the reach of any SBS, are directly served by the MBS, while the other users are "offloaded" and receive information only from the SBSs through high throughput links. In order to alleviate the load in the wireless front-haul links between the MBS and the SBSs, caching is employed at the SBSs. The MBS sends coded packets to the SBSs and to the directly served users via wireless multicast transmission on a common downlink channel, modeled as an error-free shared link of fixed capacity. Subsequently, the SBSs communicate among one another in a Device-to-Device (D2D) fashion so as each SBS obtains enough information to decode the files demanded by its connected users. The access links between SBSs and users are assumed to operate at a sufficiently high rate such that they are not the system bottleneck. For this novel Fog-RAN model, the memory-loads tradeoff for the worst-case demands is investigated. The main contributions of this paper are: (i) a novel symmetric inter-file coded cache placement scheme, (ii) a novel D2D delivery scheme to handle the inter-SBS communication phase, that is order optimal when each SBS serves the same number of users, and (iii) a novel asymmetric cache placement with file subpacketization dependent on the network structure, which is exactly optimal in some memory size regimes.

The Pliable Index CODing (PICOD) problem is a variant of the Index Coding (IC) problem, where the desired messages by the users, who are equipped with message side information, is part of the optimization. This paper studies the PICOD problem where users are subject to a privacy constraint. In particular, the following spacial class of private PICODs is investigated: 1) the side information structure is circular, and 2) each user can decode one and only one message. The first condition is a special case of the "circular-arc network topology hypergraph" class of PICOD studied in [Liu and D. Tuninetti, "Tight information theoretic converse results for some pliable index coding problems," ITW, 2018], for which an optimal solution was given without the privacy constraint. The second condition was first studied in [S. Sasi and B. S. Rajan, "On pliable index coding," arXiv:1901.05809] and was motivated by the need to keep content privacy is some distribution networks. This paper proposes both converse and achievable bounds. The proposed achievable scheme not only strictly outperforms the one in [S. Sasi and B. S. Rajan, "On pliable index coding," arXiv:1901.05809] for some values of the system parameters, but it is also information theoretically optimal in some settings. For the remaining cases, the proposed linear code is shown to require at most one more transmission than the converse bound derived by restricting the sender to only use linear codes., 6 pages. Submitted to ITW 2019. Eq. 4 changed for a constraint on individual messages in v3

We used poly-(3-sulfopropylmethacrylate) brushes as macromolecular 3D primers to promote heterogeneous nucleation and growth of archetypal ZIF-8 MOF thin films. The enhancement can be understood in terms of a high preconcentration of Zn2+ ions in the polymer brush; this leads to a rapid increase of nucleation sites in the primer., Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas

This paper presents a practical feasibility study of a novel two-phase three-part-message strategy for half-duplex relaying, which features superposition coding and interference-aware cancellation decoding. Aiming to analyze the performance of the proposed scheme in the non-asymptotic regime, this paper evaluates the spectral efficiency with finite block-length and discrete constellation signaling and compares it with the theoretical performance of Gaussian codes with asymptotically large block-lengths. The performance evaluation is carried out on an LTE simulation test bench. During each transmission phase, the modulation and coding scheme is adapted to the channel link qualities to enhance the overall spectral efficiency. A single-antenna source and relay, and a multi-antenna destination are assumed. The static Gaussian and two frequency selective channel models are considered for the proposed scheme. A spectral efficiency comparison with a baseline scheme (non-cooperative two-hop transmission, i.e., the source-destination link is absent) and with the point-to-point transmission strategy (no relay) is presented. The results confirm that physical-layer cooperation and multi-antennas are critical for performance enhancement in heterogeneous networks. Moreover, they show that physical layer cooperation advantages are within practical reach with existing LTE coded-modulation and interference-mitigation techniques, which are prevalent in modern user-equipment.

This paper considers the end-to-end mean squared error distortion in reconstructing a memoryless proper-complex Gaussian source transmitted over a set of parallel block-fading Gaussian noise channels, where the fading gains are modeled as correlated Rayleigh distributed random variables with different average powers, thus resulting in asymmetric average received signal noise ratios (SNRs). The distortion exponent (i.e., how fast the average distortion decays to zero as the average received SNR increases) of several coding strategies based on separate source and channel coding is characterized. The definition of distortion exponent commonly used in the literature for SNR-symmetric channels is generalized to the case of SNR-asymmetric channels. It is shown that fading correlation degrades the achievable mean squared error distortion, but does not affect the distortion exponent in the analyzed achievable schemes. The logarithm of the determinant of the fading correlation matrix is found to be a proxy for measuring the performance degradation due to correlation as compared with the case of independent fading. The proposed framework allows one to study any number of correlated parallel channels, contrary to the most of the literature that restricts attention to two channels only, with the same received SNR and with independent fading. In particular, a scheme based on the multiple description coding with more than two descriptions is analyzed; it is shown that determining the distortion exponent in this setting reduces to solving a linear program, which can be done numerically very efficiently. The proposed methodology relies on combining the ideas from linear innovation sequences and properties of determinant of sub-matrices. Interestingly, it is found that SNR-asymmetry is beneficial for multiple description coding when the total average received SNR in decibel is held constant. Even in the SNR-symmetric case, asymmetry in the compression rates is shown to lead to a larger distortion exponent than symmetric rates.

This paper studies networks with N half-duplex relays assisting the communication between a source and a destination. In ISIT'12 Brahma, \"{O}zg\"{u}r and Fragouli conjectured that in Gaussian half-duplex diamond networks (i.e., without a direct link between the source and the destination, and with N non-interfering relays) an approximately optimal relay scheduling policy (i.e., achieving the cut-set upper bound to within a constant gap) has at most N+1 active states (i.e., at most N+1 out of the $2^N$ possible relay listen-transmit states have a strictly positive probability). Such relay scheduling policies were referred to as simple. In ITW'13 we conjectured that simple approximately optimal relay scheduling policies exist for any Gaussian half-duplex multi-relay network irrespectively of the topology. This paper formally proves this more general version of the conjecture and shows it holds beyond Gaussian noise networks. In particular, for any memoryless half-duplex N-relay network with independent noises and for which independent inputs are approximately optimal in the cut-set upper bound, an approximately optimal simple relay scheduling policy exists. A convergent iterative polynomial-time algorithm, which alternates between minimizing a submodular function and maximizing a linear program, is proposed to find the approximately optimal simple relay schedule. As an example, for N-relay Gaussian networks with independent noises, where each node in equipped with multiple antennas and where each antenna can be configured to listen or transmit irrespectively of the others, the existence of an approximately optimal simple relay scheduling policy with at most N+1 active states is proved. Through a line-network example it is also shown that independently switching the antennas at each relay can provide a strictly larger multiplexing gain compared to using the antennas for the same purpose., Comment: This paper is an extension of arXiv:1410.7174. Submitted to IEEE Transactions on Information Theory

Signal outage, due to shadowing and blockage, is expected to be the main bottleneck in millimeter wave (mmWave) networks. Moreover, the anticipated dense deployment of base stations in mmWave networks is expected to increase the interference from strong line-of-sight base stations too, thus further increasing the probability of outage. To address the issue of reducing outage, this paper explores the possibility of base station co-operation in the downlink of mmWave heterogenous networks. The main focus of this work is showing that, in a stochastic geometry framework that incorporates blockage, co-operation from randomly located base stations decreases the probability of outage/increases the coverage probability. Coverage probabilities are derived accounting for: blockage, different fading distributions on the direct links (but always Rayleigh fading on the interference links), antenna directionality, and different tiers. Numerical results suggest that coverage with base station co-operation in dense mmWave systems (i.e., with high average number of base stations per square meter), without small scale fading on the direct communications links, and with any probability of signal blockage, considerably exceeds coverage without co-operation. In contrast, a small increase in coverage is reported when mmWave networks are less dense, have a high probability of signal blockage and the direct communications links are affected by Rayleigh fading.

Nickel-based alloys are often selected for manufacturing components operating in extreme conditions such as high-temperature thermo-mechanical cyclic loadings because of their good corrosion and high temperature resistance. This is, for instance, the case for solar receivers where the material undergoes daily cycles going from ambient temperature to approximately 700 °C. To predict the material behavior under this type of complex loadings, advanced numerical models – such as Chaboche-type models – are required. In addition to the model, a complete representation of the temperature dependency of the material is essential for both numerical stability and physical accuracy of the model, which is obtained with parameters assuring a certain continuity over the studied range of temperature. To this end, a new formulation for the temperature dependency of material parameters in Chaboche-type models is proposed for the Alloy 230 under both anisothermal and isothermal cyclic loadings.

BSA-capped gold nanoclusters are promising theragnostic systems that can be excited to render both fluorescence emission and reactive oxygen species. Although their synthesis and photoluminescence properties are already well described, more accurate information about their use as photosensitizers is required in order to advance towards health applications. In this work, we have obtained BSA-capped gold nanoclusters and characterized their photophysics by different techniques. Singlet oxygen production was detected upon irradiation, which was enough to produce toxicity on two cell lines. Remarkably, an internal energy transfer, probably due to the presence of smaller nanoclusters and the contribution of oxidized residues of BSA in the system, caused fluorescence emission near 640 nm after excitation in the UV range. Additionally, the system was capable of penetrating human skin beyond the stratum corneum, which enhances the potential of these nanoclusters as bifunctional photodynamic therapy effectors and biomarkers with application in a diversity of skin diseases. In the absence of radiation, BSA-capped gold nanoclusters did not cause toxicity in vitro, while their toxic effect on an in vivo model as zebrafish was determined. Fil: Lillo, Rolando Cristian Rodrigo. Universidad Nacional de San Martin. Instituto de Nanosistemas; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas; Argentina Fil: Calienni, Maria Natalia. Universidad Nacional de Quilmes. Departamento de Ciencia y Tecnología; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto Multidisciplinario de Biología Celular. Grupo Vinculado al IMBICE - Grupo de Biología Estructural y Biotecnología - Universidad Nacional de Quilmes - GBEyB | Provincia de Buenos Aires. Gobernación. Comisión de Investigaciones Científicas. Instituto Multidisciplinario de Biología Celular. Grupo Vinculado al IMBICE - Grupo de Biología Estructural y Biotecnología - Universidad Nacional de Quilmes - GBEyB | Universidad Nacional de La Plata. Instituto Multidisciplinario de Biología Celular. Grupo Vinculado al IMBICE - Grupo de Biología Estructural y Biotecnología - Universidad Nacional de Quilmes - GBEyB; Argentina Fil: Rivas Aiello, Maria Belen. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas; Argentina Fil: Prieto, Maria Jimena. Universidad Nacional de Quilmes. Departamento de Ciencia y Tecnología; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto Multidisciplinario de Biología Celular. Grupo Vinculado al IMBICE - Grupo de Biología Estructural y Biotecnología - Universidad Nacional de Quilmes - GBEyB | Provincia de Buenos Aires. Gobernación. Comisión de Investigaciones Científicas. Instituto Multidisciplinario de Biología Celular. Grupo Vinculado al IMBICE - Grupo de Biología Estructural y Biotecnología - Universidad Nacional de Quilmes - GBEyB | Universidad Nacional de La Plata. Instituto Multidisciplinario de Biología Celular. Grupo Vinculado al IMBICE - Grupo de Biología Estructural y Biotecnología - Universidad Nacional de Quilmes - GBEyB; Argentina Fil: Rodriguez, Damian. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas; Argentina Fil: Tuninetti, Jimena Soledad. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas; Argentina Fil: Toledo, Pamela Ludmila. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto Multidisciplinario de Biología Celular. Grupo Vinculado al IMBICE - Grupo de Biología Estructural y Biotecnología - Universidad Nacional de Quilmes - GBEyB | Provincia de Buenos Aires. Gobernación. Comisión de Investigaciones Científicas. Instituto Multidisciplinario de Biología Celular. Grupo Vinculado al IMBICE - Grupo de Biología Estructural y Biotecnología - Universidad Nacional de Quilmes - GBEyB | Universidad Nacional de La Plata. Instituto Multidisciplinario de Biología Celular. Grupo Vinculado al IMBICE - Grupo de Biología Estructural y Biotecnología - Universidad Nacional de Quilmes - GBEyB; Argentina Fil: Alonso, Silvia del Valle. Universidad Nacional de Quilmes. Departamento de Ciencia y Tecnología; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto Multidisciplinario de Biología Celular. Grupo Vinculado al IMBICE - Grupo de Biología Estructural y Biotecnología - Universidad Nacional de Quilmes - GBEyB | Provincia de Buenos Aires. Gobernación. Comisión de Investigaciones Científicas. Instituto Multidisciplinario de Biología Celular. Grupo Vinculado al IMBICE - Grupo de Biología Estructural y Biotecnología - Universidad Nacional de Quilmes - GBEyB | Universidad Nacional de La Plata. Instituto Multidisciplinario de Biología Celular. Grupo Vinculado al IMBICE - Grupo de Biología Estructural y Biotecnología - Universidad Nacional de Quilmes - GBEyB; Argentina Fil: Moya, Sergio Enrique. Centro de Investigación Cooperativa en Biomateriales; España. Centro de Investigación Cooperativa en Biomateriales; España Fil: Gonzalez, Monica Cristina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas; Argentina Fil: Martinetti Montanari, Jorge Anibal. Universidad Nacional de Quilmes. Departamento de Ciencia y Tecnología; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto Multidisciplinario de Biología Celular. Grupo Vinculado al IMBICE - Grupo de Biología Estructural y Biotecnología - Universidad Nacional de Quilmes - GBEyB | Provincia de Buenos Aires. Gobernación. Comisión de Investigaciones Científicas. Instituto Multidisciplinario de Biología Celular. Grupo Vinculado al IMBICE - Grupo de Biología Estructural y Biotecnología - Universidad Nacional de Quilmes - GBEyB | Universidad Nacional de La Plata. Instituto Multidisciplinario de Biología Celular. Grupo Vinculado al IMBICE - Grupo de Biología Estructural y Biotecnología - Universidad Nacional de Quilmes - GBEyB; Argentina Fil: Soler Illia, Galo Juan de Avila Arturo. Universidad Nacional de San Martin. Instituto de Nanosistemas; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina

This paper studies the fundamental limits of the shared-link coded caching problem with correlated files, where a server with a library of $N$ files communicates with $K$ users who can locally cache $M$ files. Given an integer $r \in [N]$, correlation is modeled as follows: each r-subset of files contains a unique common block. The tradeoff between the cache size and the average transmitted load is considered. First, a converse bound under the constraint of uncoded cache placement (i.e., each user directly stores a subset of the library bits) is derived. Then, a caching scheme for the case where every user demands a distinct file (possible for $N \geq K$) is shown to be optimal under the constraint of uncoded cache placement. This caching scheme is further proved to be decodable and optimal under the constraint of uncoded cache placement when (i) $KrM \leq 2N$ or $KrM \geq (K - 1)N $or $r \in \{1,2,N- 1,N\}$ for every demand type (i.e., when the demanded file are not necessarily distinct), and (ii) when the number of distinct demanded files is no larger than four. Finally, a two-phase delivery scheme based on interference alignment is shown to be optimal to within a factor of 2 under the constraint of uncoded cache placement for every possible demands. As a by-product, the proposed interference alignment scheme is shown to reduce the (worst-case or average) load of state-of-the-art schemes for the coded caching problem where the users can request multiple files., A short version of this paper was presented at the 2019 IEEE International Symposium on Information Theory

This paper introduces the ${\it decentralized}$ Pliable Index CODing (PICOD) problem: a variant of the Index Coding (IC) problem, where a central transmitter serves ${\it pliable}$ users with message side information; here, pliable refers to the fact that a user is satisfied by decoding ${\it any}$ $t$ messages that are not in its side information set. In the decentralized PICOD, a central transmitter with knowledge of all messages is not present, and instead users share among themselves massages that can only depend on their local side information set. This paper characterizes the capacity of two classes of decentralized complete--$S$ PICOD$(t)$ problems with $m$ messages (where the set $S\subset[m]$ contains the sizes of the side information sets, and the number of users is $n=\sum_{s\in S}\binom{m}{s}$, with no two users having the same side information set): (i) the consecutive case: $S=[s_\min:s_\max]$ for some $0 \leq s_\min\leq s_\max \leq m-t$, and (ii) the complement-consecutive case: $S=[0:m-t]\backslash[s_\min:s_\max]$, for some $0 < s_\min\leq s_\max < m-t$. Interestingly, the optimal code-length for the decentralized PICOD in those cases is the same as for the classical (centralized) PICOD counterpart, except when the problem is no longer pliable, that is, it reduces to an IC problem where every user needs to decode all messages not in its side information set. Although the optimal code-length may be the same in both centralized and decentralized settings, the actual optimal codes are not. For the decentralized PICOD, sparse Maximum Distance Separable (MDS) codes and vector linear index codes are used (as opposed to scalar linear codes)., 5 pages. To be presented at ISIT 2019

Pliable Index CODing (PICOD) is a variant of the Index Coding (IC) problem in which a user is satisfied whenever it can successfully decode any one message that is not in its side information set, as opposed to a fixed pre-determined message. The complete-S PICOD with m messages, for $S\subseteq [0:m-1]$, has $n = \sum_{s\in S}\left({l}m\\s\right)$ users with distinct side information sets. Past work on PICOD provided tight converse results when either the sender is constrained to use linear codes, or for some special classes of complete$-S$ PICOD. This paper provides a tight information theoretic converse result (i.e., no restriction to linear codes) for the so-called “consecutive complete–S” PICOD, where the set S satisfies $S = [s_{\min}\:\ s_{\max}]$ for some $0\leq s_{\min} \leq s_{\max} \leq m-1$. This result extends existing converse results and shows that linear codes have the smallest possible code length given by $ \min(m-s_{\min},\ 1+s_{\max})$. The central contribution is a novel proof technique rooted in combinatorics. The main idea is to consider all the messages a user can eventually successfully decode, in addition to its own desired message. This allows us to circumvent the necessity of essentially considering all possible assignments of desired messages for the users. The keystone of the proof is to show that, for the case of $S= \{s\}$ and $m=2s+1,$ there exists at least one user who can decode $s+1$ messages. From this, the extension to the “consecutive complete–S” PICOD follows.

This paper studies the Pliable Index CODing problem (PICOD), which models content-type distribution networks. In the PICOD$(t)$ problem there are $m$ messages, $n$ users and each user has a distinct message side information set, as in the classical Index Coding problem (IC). Differently from IC, where each user has a pre-specified set of messages to decode, in the PICOD$(t)$ a user is "pliable" and is satisfied if it can decode any $t$ messages that are not in its side information set. The goal is to find a code with the shortest length that satisfies all the users. This flexibility in determining the desired message sets makes the PICOD$(t)$ behave quite differently compared to the IC, and its analysis challenging. This paper mainly focuses on the \emph{complete--$S$} PICOD$(t)$ with $m$ messages, where the set $S\subset[m]$ contains the sizes of the side information sets, and the number of users is $n=\sum_{s\in S}\binom{m}{s}$, with no two users having the same side information set. Capacity results are shown for: (i) the \emph{consecutive} complete--$S$ PICOD$(t)$, where $S=[s_{\min}:s_{\max}]$ for some $0 \leq s_{\min} \leq s_{\max} \leq m-t$, and (ii) the \emph{complement-consecutive} complete--$S$ PICOD$(t)$, where $S=[0:m-t]\backslash[s_{\min}:s_{\max}]$, for some $0 < s_{\min} \leq s_{\max} < m-t$. The novel converse proof is inspired by combinatorial design techniques and the key insight is to consider all messages that a user can eventually decode successfully, even those in excess of the $t$ required ones. This allows one to circumvent the need to consider all possible desired message set assignments at the users in order to find the one that leads to the shortest code length. In addition, tight converse results are also shown for those PICOD$(1)$ with circular-arc network topology hypergraph., 38 pages, 4 figures, submitted to IEEE Transactions on Information Theory

Data shuffling of training data among different computing nodes (workers) has been identified as a core element to improve the statistical performance of modern large scale machine learning algorithms. Data shuffling is often considered one of the most significant bottlenecks in such systems due to the heavy communication load. Under a master-worker architecture (where a master has access to the entire dataset and only communications between the master and workers is allowed) coding has been recently proved to considerably reduce the communication load. This work considers a different communication paradigm referred to as distributed data shuffling, where workers, connected by a shared link, are allowed to communicate with one another while no communication between the master and workers is allowed. Under the constraint of uncoded cache placement, first a general coded distributed data shuffling scheme is proposed, which achieves the optimal communication load within a factor two; then, an improved scheme achieving the exact optimality for either large memory size or at most four workers in the system.

Data shuffling of training data among different computing nodes (workers) has been identified as a core element to improve the statistical performance of modern large-scale machine learning algorithms. Data shuffling is often considered as one of the most significant bottlenecks in such systems due to the heavy communication load. Under a master-worker architecture (where a master has access to the entire dataset and only communication between the master and the workers is allowed) coding has been recently proved to considerably reduce the communication load. This work considers a different communication paradigm referred to as decentralized data shuffling, where workers are allowed to communicate with one another via a shared link. The decentralized data shuffling problem has two phases: workers communicate with each other during the data shuffling phase, and then workers update their stored content during the storage phase. The main challenge is to derive novel converse bounds and achievable schemes for decentralized data shuffling by considering the asymmetry of the workers' storages (i.e., workers are constrained to store different files in their storages based on the problem setting), in order to characterize the fundamental limits of this problem. For the case of uncoded storage (i.e., each worker directly stores a subset of bits of the dataset), this paper proposes converse and achievable bounds (based on distributed interference alignment and distributed clique-covering strategies) that are within a factor of 3/2 of one another. The proposed schemes are also exactly optimal under the constraint of uncoded storage for either large storage size or at most four workers in the system., 22 pages, 5 figures, to appear in IEEE Transactions on Information Theory

Chemical modification of metal organic framework (MOF) nanocrystal colloids was used to endow them with chemical affinity for gold substrates. Modified nanocrystals were then used as building blocks for rapid and selective self-assembly of porous films. Cysteamine (Cys, 2-aminoetanethiol) was chosen as both chemical modulator and functionalizing agent of Zeolite Imidazolate Framework-8 (ZIF-8) MOF nanocrystals. Important parameters such as the impact of the modulator on the range of nanocrystals stability, size, polydispersity, morphology, and crystalline structure were assessed via both, small and wide angle x-ray scattering (SAXS and WAXS). Cysteamine modified ZIF-8 nanocrystals were assembled into films over conductive Au substrates and film growth was followed in-situ with Quartz Crystal Microbalance (QCM). Thiol moieties exposed out of the ZIF-8 surface after cysteamine modification, results in the formation of thiol bonds with Au conductive substrates as shown via Cyclic Voltammetry experiments. The strategy here presented allows for the synthesis of pre-designed building blocks for MOF films on metal surfaces. Fil: Segovia, Gustavo Manuel. Universidad Nacional de San Martín; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas; Argentina Fil: Tuninetti, Jimena Soledad. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas; Argentina Fil: Moya, Sergio. Centro de Investigación Cooperativa en Biomateriales; España Fil: Picco, Agustin Silvio. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas; Argentina. Centro Nacional de Pesquisa Em Energia E Materiais; Brasil Fil: Ceolin, Marcelo Raul. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas; Argentina Fil: Azzaroni, Omar. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas; Argentina Fil: Rafti, Matias. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas; Argentina

Maddah-Ali and Niesen's original coded caching scheme for shared-link broadcast networks is now known to be optimal to within a factor two, and has been applied to other types of networks. For practical reasons, this paper considers that a server communicates to cache-aided users through $H$ intermediate relays. In particular, it focuses on combination networks where each of the $K = \binom{H}{r}$ users is connected to a distinct $r$-subsets of relays. By leveraging the symmetric topology of the network, this paper proposes a novel method to general multicast messages and to deliver them to the users. By numerical evaluations, the proposed scheme is shown to reduce the download time compared to the schemes available in the literature. The idea is then extended to decentralized combination networks, more general relay networks, and combination networks with cache-aided relays and users. Also in these cases the proposed scheme outperforms known ones., Comment: 6 pages, 3 figures, accepted in ICC 2018, correct the typo in (6) of the previous version

This paper, motivated by mission-critical and latency- constrained traffic, focuses on delivering different messages to various end-users within hard deadlines on the downlink of a wireless system. A novel deadline outage performance criterion is introduced, which accounts for both the violation of the hard deadline by any of the messages as well as for channel decoding errors due to finite block-length. This formulation allows for the study of scheduling policies under a more refined model of the physical layer channel than is usually assumed in the networking literature. Different scheduling polices under hard deadline constraints are proposed, and the corresponding deadline outage probabilities evaluated. The main result is that, to reduce the deadline outage probability, a scheduling policy should cleverly combine time-sharing and concatenate-and- code.

Spectrum sharing between radar and communications systems, as a means to address spectrum crunch, is an active research area. This paper considers Complex-valued Additive White Gaussian Noise (C-AWGN) communication systems co-existing with pulsed radar systems, and characterizes performance from two angles: 1) the effect of radar interference on a communications system is examined in terms of average error rate, constellation design, and Shannon capacity, and 2) the effect of communications interference on a radar system is examined in terms of the Receiver Operating Characteristic (ROC).

Interfacial supramolecular architectures displaying mesoscale organized components are of fundamental importance for developing materials with novel or optimized properties. Nevertheless, engineering the multilayer assembly of different building blocks onto a surface and exerting control over the internal mesostructure of the resulting film is still a challenging task in materials science. In the present work we demonstrate that the integration of surfactants (as mesogenic agents) into layer-by-layer (LbL) assembled polyelectrolyte multilayers offers a straightforward approach to control the internal film organization at the mesoscale level. The mesostructure of films constituted of hexadecyltrimethylammonium bromide, CTAB, and polyacrylic acid, PAA (of different molecular weights), was characterized as a function of the number of assembled layers. Structural characterization of the multilayered films by grazing-incidence small-angle X-ray scattering (GISAXS), showed the formation of mesostructured composite polyelectrolyte assemblies. Interestingly, the (PAA/CTA)n assemblies prepared with low PAA molecular weight presented different mesostructural regimes which were dependent on the number of assembled layers: a lamellar mesophase for the first bilayers, and a hexagonal circular mesophase for n ≥ 7. This interesting observation was explained in terms of the strong interaction between the substrate and the first layers leading to a particular mesophase. As the film increases its thickness, the prevalence of this strong interaction decreases and the supramolecular architecture exhibits a "bulk" mesophase. Finally, we demonstrated that the molecular weight of the polyelectrolyte has a considerable impact on the meso-organization for the (PAA/CTA)n assemblies. We consider that these studies open a path to new rational methodologies to construct "nanoarchitectured" polyelectrolyte multilayers. Fil: Piccinini, Esteban. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas; Argentina Fil: Tuninetti, Jimena Soledad. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas; Argentina Fil: Irigoyen Otamendi, Joseba. CIC Bioma GUNE. Soft Matter Nanotechnology Group; España Fil: Moya, Sergio Enrique. CIC Bioma GUNE. Soft Matter Nanotechnology Group; España Fil: Ceolin, Marcelo Raul. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas; Argentina Fil: Battaglini, Fernando. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Química, Física de los Materiales, Medioambiente y Energía. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Química, Física de los Materiales, Medioambiente y Energía; Argentina Fil: Azzaroni, Omar. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Instituto de Investigaciones Fisicoquímicas Teóricas y Aplicadas; Argentina

In this paper we elaborate on a question left open in “The impact of constellation cardinality on Gaussian channel capacity” by Yihong Wu and Sergio Verdu at the 48th Annual Allerton Conference on Communication, Control, and Computing. We prove that the optimal constellation, as intuition and numerical results suggest, is symmetric about the origin. We also comment on certain monotonicity properties of the cardinality-constrained capacity.

This paper investigates the fundamental tradeoff between cache size and download time in the (H;r;M;N) combination network, where a server with N files is connected to H relays (without caches) and each of the K:=\binom{H}{r} users (with caches of size M files) is connected to a different subset of r relays. Existing schemes fall within two categories: either use the uncoded symmetric cache placement originally proposed for the shared-link model and design delivery phase dependent on the network topology, or effectively divide the combination network into H independent shared-link networks each serving \binom{H-1}{r-1} users; in either case, the placement phase is independent of network topology. In this paper, a novel strategy is proposed where the coded cache placement is dependent on network topology. The proposed scheme is shown to be information theoretically optimal for large cache size. In addition, when not exactly optimal, the proposed scheme can also outperform existing schemes., 7 pages, 2 figures, submitted to ISIT 2018

The tradeoff between the user's memory size and the worst-case download time in the $(H,r,M,N)$ combination network is studied, where a central server communicates with $K$ users through $H$ immediate relays, and each user has local cache of size $M$ files and is connected to a different subset of $r$ relays. The main contribution of this paper is the design of a coded caching scheme with asymmetric coded placement by leveraging coordination among the relays, which was not exploited in past work. Mathematical analysis and numerical results show that the proposed schemes outperform existing schemes., 5 pages, 2 figures, ITA 2018

This paper considers packet scheduling over a broadcast channel with packet erasures to multiple receivers with different messages (multiple uni-cast) each with possibly different hard deadline constraints. A novel metric is proposed and evaluated: the global deadline outage probability, which gives the probability that the hard communication deadline is not met for at least one of the receivers. The cut-set upper bound is derived and a scheduling policy is proposed to determine which receiver's packets should be sent in each time slot. This policy is shown to be optimal among all scheduling policies, i.e., it achieves all boundary points of cut-set upper bounds when the transmitter knows the erasure patterns for all the receivers ahead of making the scheduling decision. An expression for the global deadline outage probability is obtained for two receivers and is plotted and interpreted for various system parameters. These plots are not Monte-Carlo simulations, and hence the obtained expression may be used in the design of future downlink broadcast networks. Future extensions to per-user deadline outage probabilities as well as to scenarios with causal knowledge of the channel states are briefly discussed.