University of Electro-Communications

About: University of Electro-Communications is a education organization based out in Tokyo, Japan. It is known for research contribution in the topics: Laser & Robot. The organization has 8041 authors who have published 16950 publications receiving 235832 citations. The organization is also known as: UEC & Denki-Tsūshin Daigaku.

Route partitioning scheme for elastic optical networks with hitless defragmentation

Abstract: Hitless defragmentation has been introduced as an approach to limit the spectrum fragmentation in elastic optical networks without traffic disruption. It facilitates the accommodation of new requests by creating large spectrum blocks as it moves active lightpaths (retuning) to fill in gaps left in the spectrum by expired ones. Nevertheless, hitless defragmentation witnesses limitations for gradual retuning with the conventionally used first-fit allocation. The first-fit allocation stacks all lightpaths to the lower end of the spectrum. This leads to a large number of lightpaths that need to be retuned and are subject to interfering with each other's retuning. This paper proposes a route partitioning scheme for hitless defragmentation in order to increase the admissible traffic in elastic optical networks. The proposed scheme uses route partitioning with the first-last fit allocation to increase the possibilities of lightpath retuning by avoiding the retuning interference among lightpaths. The first-last fit allocation is used to set a bipartition with one partition allocated with the first fit and the second with the last fit. Lightpaths that are allocated on different partitions cannot interfere with each other. Thus, the route partitioning avoids interference among lightpaths when retuning. We define the route partitioning problem as an optimization problem to minimize the total interference. We then introduce an integer linear programming problem (ILP) that yields an optimal routing and partitioning. We prove that the route partitioning problem is non-deterministic polynomial-time hard (NP-hard). We present a heuristic algorithm for large networks, where the ILP used to represent the route partitioning is not tractable. The simulation results show that the proposed route partitioning scheme using the first-last fit outperforms the conventional first-fit allocation for hitless defragmentation in term of allowable traffic.

An olfactory recognition model based on spatio-temporal encoding of odor quality in the olfactory bulb

Abstract: In order to study the problem how the olfactory neural system processes the odorant molecular information for constructing the olfactory image of each object, we present a dynamic model of the olfactory bulb constructed on the basis of well-established experimental and theoretical results. The information relevant to a single odor, i.e. its constituent odorant molecules and their mixing ratios, are encoded into a spatio-temporal pattern of neural activity in the olfactory bulb, where the activity pattern corresponds to a limit cycle attractor in the mitral cell network. The spatio-temporal pattern consists of a temporal sequence of spatial firing patterns: each constituent molecule is encoded into a single spatial pattern, and the order of magnitude of the mixing ratio is encoded into the temporal sequence. The formation of a limit cycle attractor under the application of a novel odor is carried out based on the intensity-to-time-delay encoding scheme. The dynamic state of the olfactory bulb, which has learned many odors, becomes a randomly itinerant state in which the current firing state of the bulb itinerates randomly among limit cycle attractors corresponding to the learned odors. The recognition of an odor is generated by the dynamic transition in the network from the randomly itinerant state to a limit cycle attractor state relevant to the odor, where the transition is induced by the short-term synaptic changes made according to the Hebbian rule under the application of the odor stimulus.

Performance Improvement of Iterative Multiuser Detection for Large Sparsely Spread CDMA Systems by Spatial Coupling

Abstract: Kudekar et al. proved that the belief-propagation (BP) performance for low-density parity check codes can be boosted up to the maximum a posteriori (MAP) performance by spatial coupling. In this paper, spatial coupling is applied to sparsely spread code-division multiple-access systems to improve the performance of iterative multiuser detection based on BP. Two iterative receivers based on BP are considered: 1) one receiver is based on exact BP and 2) the other on an approximate BP with Gaussian approximation. The performance of the two BP receivers is evaluated via density evolution (DE) in the dense limit after taking the large-system limit, in which the number of users and the spreading factor tend to infinity while their ratio is kept constant. The two BP receivers are shown to achieve the same performance as each other in these limits. Furthermore, taking a continuum limit for the obtained DE equations implies that the performance of the two BP receivers can be improved up to the performance achieved by the symbol-wise MAP detection, called individually optimal detection, via spatial coupling. Numerical simulations show that spatial coupling can provide a significant improvement in bit-error rate for finite-sized systems especially in the region of high system loads.

Thermodynamic properties of methane/water interface predicted by molecular dynamics simulations.

Abstract: Molecular dynamics simulations have been performed to examine the thermodynamic properties of methane/water interface using two different water models, the TIP4P/2005 and SPC/E, and two sets of combining rules. The density profiles, interfacial tensions, surface excesses, surface pressures, and coexisting densities are calculated over a wide range of pressure conditions. The TIP4P/2005 water model was used, with an optimized combining rule between water and methane fit to the solubility, to provide good predictions of interfacial properties. The use of the infinite dilution approximation to calculate the surface excesses from the interfacial tensions is examined comparing the surface pressures obtained by different approaches. It is shown that both the change of methane solubilities in pressure and position of maximum methane density profile at the interface are independent of pressure up to about 2 MPa. We have also calculated the adsorption enthalpies and entropies to describe the temperature dependency of the adsorption.