搜索结果：wired

Deep joint source-channel coding (DJSCC) has emerged as a robust alternative to traditional separate coding for communications through wireless channels. Existing DJSCC approaches focus primarily on point-to-point wireless communication scenarios, while neglecting end-to-end communication efficiency in hybrid wireless-wired networks such as 5G and 6G communication systems. Considerable redundancy in DJSCC symbols against wireless channels becomes inefficient for long-distance wired transmission. Furthermore, DJSCC symbols must adapt to the varying transmission rate of the wired network to avoid congestion. In this paper, we propose a novel framework designed for efficient wired transmission of DJSCC symbols within hybrid wireless-wired networks, namely Rate-Controllable Wired Adaptor (RCWA). RCWA achieves redundancy-aware coding for DJSCC symbols to improve transmission efficiency, which removes considerable redundancy present in DJSCC symbols for wireless channels and encodes only source-relevant information into bits. Moreover, we leverage the Lagrangian multiplier method to achieve controllable and continuous variable-rate coding, which can encode given features into expected ra

We derive a scaling limit in law for the cover time of a simple random walk on a lattice version of a scaled-up planar domain with wired boundary conditions. The limiting distribution is that of a Gumbel Random Variable shifted randomly by an independent quantity which is equal to the full mass of a variant of the critical Liouville Quantum Gravity Measure on the same domain. We also derive a limit in law for the scaled location of the vertex visited last by the walk. Here the limit turns out to be precisely the critical Liouville Measure, normalized by its total mass. Both limits hold jointly with the limiting joint law explicitly described. These results resolve well known open problems in the field, in the case of wired boundary conditions. The proof is based on comparison with the extremal landscape of the discrete Gaussian Free Field, and in particular a version there-of obtained by conditioning the average value of the field to be zero.

We consider a continuous time simple random walk on a subset of the square lattice with wired boundary conditions: the walk transitions at unit edge rate on the graph obtained from the lattice closure of the subset by contracting the boundary into one vertex. We study the cover time of such walk, namely the time it takes for the walk to visit all vertices in the graph. Taking a sequence of subsets obtained as scaled lattice versions of a nice planar domain, we show that the square root of the cover time normalized by the size of the subset, is tight around $\frac{1}{\sqrtπ} \log N - \frac{1}{4 \sqrtπ} \log \log N$, where $N$ is the scale parameter. This proves an analog, for the wired case, of a conjecture by Bramson and Zeitouni from 2009. The proof is based on comparison with the extremal landscape of the discrete Gaussian free field.

This paper implies Bluetooth technology, which is put into effect to alter extant, wired into wireless Programmable Logic Controller (PLC). Here two Bluetooth devices are employed as a transceiver to transmit and receives the input signal to contrive wireless PLC. The main advantage of PLC is to control the output according to the status of input. In Bluetooth technology, the handshaking between the two Bluetooth modules takes place, which is interfaced with a microcontroller board (Arduino board) and then to PLC such that field devices can be controlled without wire.

With the launch of the Wide-Field Infrared Survey Explorer (WISE), a new era of detecting planetary debris around white dwarfs has begun with the WISE InfraRed Excesses around Degenerates (WIRED) Survey. The WIRED Survey will be sensitive to substellar objects and dusty debris around white dwarfs out to distances exceeding 100 pc, well beyond the completeness level of local WDs and covering a large fraction of known WDs detected with the SDSS DR4 white dwarf catalogue. In this paper we report an initial result of the WIRED survey, the detection of the heavily polluted hydrogen white dwarf (spectral type DAZ) GALEX J193156.8+011745 at 3.35 and 4.6 \micron. We find that the excess is consistent with either a narrow dusty ring with an inner radius of 29 $R_{\rm WD}$, outer radius of 40 $R_{\rm WD}$, and a face-on inclination, or a disk with an inclination of 70$^\circ$, an inner radius of 23 $R_{\rm WD}$, and an outer radius of 80 $R_{\rm WD}$. We also report initial optical spectroscopic monitoring of several metal lines present in the photosphere and find no variability in the line strengths or radial velocities of the lines. We rule out all but planetary mass companions to GALEX193

Transmission control protocol (TCP) congestion control is one of the key techniques to improve network performance. TCP congestion control algorithm identification (TCP identification) can be used to significantly improve network efficiency. Existing TCP identification methods can only be applied to limited number of TCP congestion control algorithms and focus on wired networks. In this paper, we proposed a machine learning based passive TCP identification method for wired and wireless networks. After comparing among three typical machine learning models, we concluded that the 4-layers Long Short Term Memory (LSTM) model achieves the best identification accuracy. Our approach achieves better than 98% accuracy in wired and wireless networks and works for newly proposed TCP congestion control algorithms.

We study the spectral and diffusive properties of the wired minimal spanning forest (WMSF) on the Poisson-weighted infinite tree (PWIT). Let $M$ be the tree containing the root in the WMSF on the PWIT and $(Y_n)_{n\geq0}$ be a simple random walk on $M$ starting from the root. We show that almost surely $M$ has $\mathbb{P}[Y_{2n}=Y_0]=n^{-3/4+o(1)}$ and $\mathrm{dist}(Y_0,Y_n)=n^{1/4+o(1)}$ with high probability. That is, the spectral dimension of $M$ is $\frac{3}{2}$ and its typical displacement exponent is $\frac{1}{4}$, almost surely. These confirm Addario-Berry's predictions in arXiv:1301.1667.

The provision of both wireless and wired services in the optical access domain will be an important function for future passive optical networks (PON). With the emergence of 5th generation (5G) mobile communications, a move toward a dense deployment of small cell antenna sites, in conjunction with a cloud radio access network (C-RAN) architecture, is foreseen. This type of network architecture greatly increases the requirement for high capacity mobile fronthaul and backhaul links. An efficient way of achieving such connectivity is to make use of wavelength division multiplexed (WDM) PON infrastructure where wireless and wired services may be converged for distribution. In this work, for the first time, the convergence of 5G wireless candidate waveforms with a single-carrier wired signal is demonstrated in a PON. Three bands of universally filtered orthogonal frequency division multiplexing (UF-OFDM) and generalized frequency division multiplexing (GFDM), are transmitted at an intermediate frequency in conjunction with a digital 10Gb/s pulse amplitude modulation (PAM) signal in the downlink direction. Orthogonal frequency division multiplexing (OFDM) is also evaluated as a benchmark

In this paper, we propose a new end-to-end system for wired nano-communication networks using a self-assembled polymer. The self-assembly of a polymer creates a channel between the transmitter and the receiver in the form of a conductive nanowire that uses electrons as carriers of information. We derive the channel's analytical model and its master equation to study the dynamic process of the polymer self-assembly. We validate the analytical model with numerical and Monte-Carlo simulations. Then, we approximate the master equation by a one-dimensional Fokker-Planck equation and we solve this equation analytically and numerically. We formulate the expressions of the polymer elongation rate, its diffusion coefficient and the nullcline to study the distribution and the stability of the self-assembled nanowire. This study shows promising results for realizing stable polymer-based wired nanonetworks that can achieve high throughput.

Neural networks for image recognition have evolved through extensive manual design from simple chain-like models to structures with multiple wiring paths. The success of ResNets and DenseNets is due in large part to their innovative wiring plans. Now, neural architecture search (NAS) studies are exploring the joint optimization of wiring and operation types, however, the space of possible wirings is constrained and still driven by manual design despite being searched. In this paper, we explore a more diverse set of connectivity patterns through the lens of randomly wired neural networks. To do this, we first define the concept of a stochastic network generator that encapsulates the entire network generation process. Encapsulation provides a unified view of NAS and randomly wired networks. Then, we use three classical random graph models to generate randomly wired graphs for networks. The results are surprising: several variants of these random generators yield network instances that have competitive accuracy on the ImageNet benchmark. These results suggest that new efforts focusing on designing better network generators may lead to new breakthroughs by exploring less constrained se

We prove that every component of the wired uniform spanning forest (WUSF) is one-ended almost surely in every transient reversible random graph, removing the bounded degree hypothesis required by earlier results. We deduce that every component of the WUSF is one-ended almost surely in every supercritical Galton-Watson tree, answering a question of Benjamini, Lyons, Peres and Schramm. Our proof introduces and exploits a family of Markov chains under which the oriented WUSF is stationary, which we call the wired cycle-breaking dynamics.

Exploring the climate impacts of various anthropogenic emissions scenarios is key to making informed decisions for climate change mitigation and adaptation. State-of-the-art Earth system models can provide detailed insight into these impacts, but have a large associated computational cost on a per-scenario basis. This large computational burden has driven recent interest in developing cheap machine learning models for the task of climate model emulation. In this manuscript, we explore the efficacy of randomly wired neural networks for this task. We describe how they can be constructed and compare them to their standard feedforward counterparts using the ClimateBench dataset. Specifically, we replace the serially connected dense layers in multilayer perceptrons, convolutional neural networks, and convolutional long short-term memory networks with randomly wired dense layers and assess the impact on model performance for models with 1 million and 10 million parameters. We find that models with less complex architectures see the greatest performance improvement with the addition of random wiring (up to 30.4% for multilayer perceptrons). Furthermore, out of 24 different model architect

Creating multi-view wire art (MVWA), a static 3D sculpture with diverse interpretations from different viewpoints, is a complex task even for skilled artists. In response, we present DreamWire, an AI system enabling everyone to craft MVWA easily. Users express their vision through text prompts or scribbles, freeing them from intricate 3D wire organisation. Our approach synergises 3D Bézier curves, Prim's algorithm, and knowledge distillation from diffusion models or their variants (e.g., ControlNet). This blend enables the system to represent 3D wire art, ensuring spatial continuity and overcoming data scarcity. Extensive evaluation and analysis are conducted to shed insight on the inner workings of the proposed system, including the trade-off between connectivity and visual aesthetics.

We study rotor walk, a deterministic counterpart of the simple random walk, on infinite transient graphs. We show that the final rotor configuration of the rotor walk follows the law of the wired uniform spanning forest oriented toward infinity (OWUSF) measure when the initial rotor configuration is sampled from OWUSF. This result holds for all graphs for which each tree in the wired spanning forest has one single end almost surely. This answers a question posed in a previous work of the author (Chan 2018).

The knowledge of the topology of a wired network is often of fundamental importance. For instance, in the context of Power Line Communications (PLC) networks it is helpful to implement data routing strategies, while in power distribution networks and Smart Micro Grids (SMG) it is required for grid monitoring and for power flow management. In this paper, we use the transmission line theory to shed new light and to show how the topological properties of a wired network can be found exploiting admittance measurements at the nodes. An analytic proof is reported to show that the derivation of the topology can be done in complex networks under certain assumptions. We also analyze the effect of the network background noise on admittance measurements. In this respect, we propose a topology derivation algorithm that works in the presence of noise. We finally analyze the performance of the algorithm using values that are typical of power line distribution networks.

Wireless networks are becoming extremely pervasive while traffic demand is ever increasing. In order to cope with the forecast increase in traffic volume for the upcoming years, as well as the number of connected devices, new technologies, practices and spectrum rearrangements are required. In this context, a key question arises: how to provide extensive backhaul connectivity and capacity for pervasive ultra dense networks? The answer is rather complex, if feasible. To shed some light into this issue we overview potential technologies, either wired or wireless, and identify technical challenges. Moreover, we evaluate an illustrative scenario of a ultra-dense network that operates with hybrid wired-wireless backhaul. We assume multiple radio access technologies at small and macro base stations (BSs), and we discuss optimal traffic splitting and routing solutions for different topologies and traffic profiles.