During a disaster, users will not be able to communicate with their families and friends using mobile terminals, e.g., smartphones, in many cases due to failures of base stations and backhaul of cellular networks. Even when cellular networks normally operate without failure, they will become seriously congested due to dramatically increased traffic demand. To solve these problems, device-to-device (D2D) communications, in which mobile terminals directly communicate without cellular networks, have been investigated. Multi-hop D2D communication using multiple mobile terminals as relay nodes will be effective in maintaining connectivity during a disaster. It is preferable to estimate the success probability of multi-hop D2D communication by using a simple method that offers optimal parameter control, e.g., the ratio of mobile terminals using D2D communications and the maximum hop length. Moreover, when evaluating the reachability of multi-hop D2D communication, we need to consider the evacuation behavior during a disaster because success probability depends on the geographical distribution of mobile terminals. Therefore, in this paper, we derive a formula for estimating the success probability of multi-hop D2D communication in a simple manner and analyze its reachability using a multi-agent simulation that reproduces the evacuation behavior expected during an earthquake in Tokyo Shinjuku Ward.

A new method for adaptive digital beamforming technique with compressed sensing (CS) for sparse receiving arrays with gain/phase uncertainties is presented. Because of the sparsity of the arriving signals, CS theory can be adopted to sample and recover receiving signals with less data. But due to the existence of the gain/phase uncertainties, the sparse representation of the signal is not optimal. In order to eliminating the influence of the gain/phase uncertainties to the sparse representation, most present study focus on calibrating the gain/phase uncertainties first. To overcome the effect of the gain/phase uncertainties, a new dictionary optimization method based on the total least squares (TLS) algorithm is proposed in this paper. We transfer the array signal receiving model with the gain/phase uncertainties into an EIV model, treating the gain/phase uncertainties effect as an additive error matrix. The method we proposed in this paper reconstructs the data by estimating the sparse coefficients using CS signal reconstruction algorithm and using TLS method toupdate error matrix with gain/phase uncertainties. Simulation results show that the sparse regularized total least squares algorithm can recover the receiving signals better with the effect of gain/phase uncertainties. Then adaptive digital beamforming algorithms are adopted to form antenna beam using the recovered data.

As the capabilities and costs of Artificial Intelligence (AI) and of sensors (IoT) continue to improve, the concept of a “control system” can evolve beyond the operation of a discrete technical system based on numerical information and enter the realm of large-scale systems with both technical and social characteristics based on both numerical and unstructured information. This evolution has particular significance for applying the principles of Autonomous Decentralised Systems (ADS) [1]. This article considers the possible roles for ADS in complex technical and social systems extending up to global scales.

This paper presents the characteristics of path loss produced by traffic sign blockage. Multi frequency bands including high frequency bands up to 40 GHz are analyzed on the basis of measurement results in urban microcell environments. It is shown that the measured path loss increases compared to free space path loss even on a straight line-of-sight road, and that the excess attenuation is caused by the blockage effects of traffic signs. It is also shown that the measurement area affected by the blockage becomes small as frequency increases. The blocking object occupies the same area for all frequencies, but it takes up a larger portion of the Fresnel Zone as frequency increases. Therefore, if blockage occurs, the excess loss in high frequency bands becomes larger than in low frequency bands. In addition, the validity of two blockage path loss models is verified on the basis of measurement results. The first is the 3GPP blockage model and the second is the proposed blockage model, which is an expanded version of the basic diffraction model in ITU-R P.526. It is shown that these blockage models can predict the path loss increased by the traffic sign blockage and that their root mean square error can be improved compared to that of the 3GPP two slope model and a free space path loss model. The 3GPP blockage model is found to be more accurate for 26.4 and 37.1GHz, while the proposed model is more accurate for 0.8, 2.2, and 4.7GHz. The results show the blockage path loss due to traffic signs is clarified in a wide frequency range, and it is verified that the 3GPP blockage model and the proposed blockage model can accurately predict the blockage path loss.

We propose a cooperative cognitive radio network (CCRN) with secondary users (SUs) employing two simultaneous transmit and receive (STAR) antennas. In the proposed framework of full-duplex (FD) multiple-input-multiple-output (MIMO) CCRN, the region of achievable rate is expanded via FD communication among SUs enabled by the STAR antennas adopted for the SUs. The link capacity of the proposed framework is analyzed theoretically. It is shown through numerical analysis that the proposed FD MIMO-CCRN framework can provide a considerable performance gain over the conventional frameworks of CCRN and MIMO-CCRN.

A composite system consists of many subsystems, which have interconnections with other subsystems. For such a system, in general, we utilize decentralized control, where each subsystem is controlled by a local controller. On the other hand, event-triggered control is one of useful approaches to reduce the amount of communications between a controller and a plant. In the event-triggered control, an event triggering mechanism (ETM) monitors the information of the plant, and determines the time to transmit the data. In this paper, we propose a design of ETMs for the decentralized event-triggered control of nonlinear composite systems using an M-matrix. We consider the composite system where there is an ETM for each subsystem, and ETMs monitor local states of the corresponding subsystems. Each ETM is designed so that the composite system is stabilized. Moreover, we deal with the case of linear systems. Finally, we perform simulation to show that the proposed triggering rules are useful for decentralized control.

We propose a weighted subtask controller and sufficient conditions for boundedness of the controller both velocity and acceleration domain. Prior to designing the subtask controller, a task controller is designed for global asymptotic stability of task space error and subtask error. Although the subtask error converges to zero by the task controller, the boundedness of the subtask controller is also important, therefore its boundedness conditions are presented. The weighted pseudo inverse is introduced to relax the constraints of the null-space of Jacobian. Using the pseudo inverse, we design subtask controller and propose sufficient conditions for boundedness of the auxiliary signal to show the existence of the inverse kinematic solution. The results of experiments using 7-DOF WAM show the effectiveness of the proposed controller.

Generalized Minimum Distance (GMD) decoding is a well-known soft-decision decoding for linear codes. Previous research on GMD decoding focused mainly on unquantized AWGN channels with BPSK signaling for binary linear codes. In this paper, a study on the design of a 4-level uniform quantizer for GMD decoding is given. In addition, an extended version of a GMD decoding algorithm for a 4-level quantizer is proposed, and the effectiveness of the proposed decoding is shown by simulation.

Accurate pedestrian navigation remains a challenge in urban environments. GNSS receiver behaves poorly because the reflection and blockage of the GNSS signals by buildings or other obstacles. Integration of GNSS positioning and Pedestrian Dead Reckoning (PDR) could provide a more smooth navigation trajectory. However, the integration system cannot present the satisfied performance if GNSS positioning has large error. This situation often happens in the urban scenario. This paper focuses on improving the accuracy of the pedestrian navigation in urban environment using a proposed altitude map aided GNSS positioning method. Firstly, we use consistency check algorithm, which is similar to receiver autonomous integrity monitoring (RAIM) fault detection, to distinguish healthy and multipath contaminated measurements. Afterwards, the erroneous signals are corrected with the help of an altitude map. We called the proposed method altitude map aided GNSS. After correcting the erroneous satellite signals, the positioning mean error could be reduced from 17 meters to 12 meters. Usually, good performance for integration system needs accurately calculated GNSS accuracy value. However, the conventional GNSS accuracy calculation is not reliable in urban canyon. In this paper, the altitude map is also utilized to calculate the GNSS localization accuracy in order to indicate the reliability of the estimated position solution. The altitude map aided GNSS and accuracy are used in the integration with PDR system in order to provide more accurate and continuous positioning results. With the help of the proposed GNSS accuracy, the integration system could achieve 6.5 meters horizontal positioning accuracy in urban environment.

To enable the vision of precision medicine, evidence-based medicine is the key element. Understanding the natural history of complex diseases like brain aneurysm and particularly investigating the evidences of its rupture risk factors relies on the existence of semantic-enabled data preparation technology to conduct clinical trials, survival analysis and outcome prediction. For personalized medicine in the field of neurological diseases, it is very important that multiple health organizations coordinate and cooperate to conduct evidence based observational studies. Without the means of automating the process of privacy and semantic-enabled data preparation to conduct observational studies at intra-organizational level would require months to manually prepare the data. Therefore, this paper proposes a semantic and privacy enabled, multi-party data preparation architecture and a four-tiered semantic similarity algorithm. Evaluation shows that proposed algorithm achieves a precision of 79%, high recall at 83% and F-measure of 81%.

To clarify radio propagation characteristics and the mechanism for vehicle-to-vehicle communications in urban areas, this study presents a PML implementation using approximation in the high-frequency band as an elemental technology. We evaluated the PML absorption performance and clarified that the proposed method is applicable to large-scale analyses.

The locally one-dimensional finite-difference time-domain (FDTD) method in cylindrical coordinates is extended to a frequency-dependent version. The fundamental scheme is utilized to perform matrix-operator-free formulations in the right-hand sides. For the analysis of surface plasmon polaritons propagating along a plasmonic grating, the computation time is significantly reduced to less than 10%, compared with the explicit cylindrical FDTD method.

We prove generalization error bounds of classes of low-rank matrices with some norm constraints for collaborative filtering tasks. Our bounds are tighter, compared to known bounds using rank or the related quantity only, by taking the additional L1 and L∞ constraints into account. Also, we show that our bounds on the Rademacher complexity of the classes are optimal.

Recently, Hof et al. extended the type-2 Duman and Salehi (DS2) bound to generalized decoding, which was introduced by Forney, with decision criterion FR. From this bound, they derived two significant bounds. One is the Shulman-Feder bound for generalized decoding (GD) with the binary-input output-symmetric channel. The other is an upper bound for an ensemble of linear block codes, by applying the average complete weight distribution directly to the DS2 bound for GD. For the Shulman-Feder bound for GD, the authors derived a condition under which an upper bound is minimized at an intermediate step and show that this condition yields a new bound which is tighter than Hof et al.'s bound. In this paper, we first extend this result for non-binary linear block codes used over a class of symmetric channels called the regular channel. Next, we derive a new tighter bound for an ensemble of linear block codes, which is based on the average weight distribution.

Both placing responsibility of message sending on every IoT object and obfuscating the object's location from other objects are essential to realize a secure and privacy-preserved communication service. Two or more short-lived link identifiers (or pseudonyms) authorized by a trustable authority are often used in related studies, instead of a persistent or long-term use link identifier (i.e. vendor assigned MAC address). However, related studies have limitations in terms of frequently changing pseudonyms to enhance location privacy because the cryptographic algorithms used in them fixedly couple object's identifiers with its security keys. To overcome those limitations, we present a new pseudonym and key management scheme that enables dynamic coupling of pseudonym and key pairs without incurring any adverse impacts. Furthermore, we propose two lightweight pseudonym allocation protocols to effectively reduce the volume of message carrying the allocation parameters. Through qualitative analyses, we verify that the proposed scheme is more scalable than related approaches as it can efficiently allocate enough number of pseudonym/key pairs by reducing the control message overhead by more than 90%.

This paper considers a multi-user large-scale multiple-input multiple-output (MIMO) system with single cell working in full-duplex mode. Maximum ratio combining/maximum ratio transmission (MRC/MRT) is applied to maximize the output signal to noise ratio (SNR) of the receiver. Then we deduce the asymptotic uplink and downlink sum rate in full-duplex mode by using the large number theorem, also giving the comparison of traditional half-duplex and full-duplex. Besides, we analyze the influence of Doppler shift on the performance of the system. Finally, the change of the system performance on the user velocity is illustrated.

As interaction between human and computer continues to develop to the most natural form possible, it becomes increasingly urgent to incorporate emotion in the equation. This paper describes a step toward extending the research on emotion recognition to Indonesian. The field continues to develop, yet exploration of the subject in Indonesian is still lacking. In particular, this paper highlights two contributions: (1) the construction of the first emotional audio-visual database in Indonesian, and (2) the first multimodal emotion recognizer in Indonesian, built from the aforementioned corpus. In constructing the corpus, we aim at natural emotions that are corresponding to real life occurrences. However, the collection of emotional corpora is notably labor intensive and expensive. To diminish the cost, we collect the emotional data from television programs recordings, eliminating the need of an elaborate recording set up and experienced participants. In particular, we choose television talk shows due to its natural conversational content, yielding spontaneous emotion occurrences. To cover a broad range of emotions, we collected three episodes in different genres: politics, humanity, and entertainment. In this paper, we report points of analysis of the data and annotations. The acquisition of the emotion corpus serves as a foundation in further research on emotion. Subsequently, in the experiment, we employ the support vector machine (SVM) algorithm to model the emotions in the collected data. We perform multimodal emotion recognition utilizing the predictions of three modalities: acoustic, semantic, and visual. When compared to the unimodal result, in the multimodal feature combination, we attain identical accuracy for the arousal at 92.6%, and a significant improvement for the valence classification task at 93.8%. We hope to continue this work and move towards a finer-grain, more precise quantification of emotion.

In recent years, with the rapid development of the Internet and cloud computing, an enormous amount of information is exchanged on various social networking services. In order to handle and maintain such a mountain of information properly by limited resources in the network, it is very important to comprehend the dynamics for propagation of information or activity on the social network. One of many indices used by social network analysis which investigates the network structure is “node centrality”. A common characteristic of conventional node centralities is that it depends on the topological structure of network and the value of node centrality does not change unless the topology changes. The network dynamics is generated by interaction between users whose strength is asymmetric in general. Network structure reflecting the asymmetric interaction between users is modeled by a directed graph, and it is described by an asymmetric matrix in matrix-based network model. In this paper, we showed an oscillation model for describing dynamics on networks generated from a certain kind of asymmetric interaction between nodes by using a symmetric matrix. Moreover, we propose a new extended index of well-known two node centralities based on the oscillation model. In addition, we show that the proposed index can describe various aspect of node centrality that considers not only the topological structure of the network, but also asymmetry of links, the distribution of source node of activity, and temporal evolution of activity propagation by properly assigning the weight of each link. The proposed model is regarded as the fundamental framework for different node centralities.

This paper argues that a layered approach is more suitable for Information Centric Networking (ICN) than a narrow-waist approach and proposes an ICN mechanism called ZINK. In ZINK, a location-independent content name is resolved to a list of node IDs of content servers in the application layer and a node ID is mapped to a node locator in the network layer, which results in scalable locator-based routing. An ID/Locator split approach in the network layer can efficiently support client/serever mobility. Efficient content transfer is achieved by using sophisticated functions in the transport layer such as multipath transfer for bandwidth aggregation or fault tolerance. Existing well-tuned congestion control in the transport layer achieves fairness not only among ICN flows but also among ICN flows and other flows. A proof-of concept prototype of ZINK is implemented on an IPv6 stack. Evaluation results show that the time for content finding is practical, efficient content transfer is possible by using multipath transfer, and the mobility support mechanism is scalable as shown in a nationwide experiment environment in Japan.

In this paper we report the convergence acceleration effect of the extended node patch preconditioner for the iterative full-wave electromagnetic finite element method with more than ten million degrees of freedom. The preconditioner, which is categorized into the multiplicative Schwarz scheme, effectively works with conventional numerical iterative matrix solving methods on a parallel computer. We examined the convergence properties of the preconditioner combined with the COCG, COCR and GMRES algorithms for the analysis domain encompassed by absorbing boundary conditions (ABC) such as perfectly matched layers (PML). In those analyses the properties of the convergence are investigated numerically by sweeping frequency range and the number of PMLs. Memory-efficient nature of the preconditioner is numerically confirmed through the experiments and upper bounds of the required memory size are theoretically proved. Finally it is demonstrated that this extended node patch preconditioner with GMRES algorithm works well with the problems up to one hundred million degrees of freedom.