This paper considers the recovery problem of distributed compressed sensing (DCS), where J (J≥2) signals all have sparse common component and sparse innovation components. The decoder attempts to jointly recover each component based on {Mj} random noisy measurements (j=1,…,J) with the prior information on the support probabilities, i.e., the probabilities that the entries in each component are nonzero. We give both the sufficient and necessary conditions on the total number of measurements $sum olimits_{j = 1}^J M_j$ that is needed to recover the support set of each component perfectly. The results show that when the number of signal J increases, the required average number of measurements $sum olimits_{j = 1}^J M_j/J$ decreases. Furthermore, we propose an extension of one existing algorithm for DCS to exploit the prior information, and simulations verify its improved performance.

The United Nations (UN) reports that the global population reached 7 billion in 2011, and today, it stands at about 7.3 billion. This dramatic increase has been driven largely by the extension of people's lifetime. The urban population has been also increasing, which causes a lot of issues for cities, such as congestion and increased demand for resources, including energy, water, sanitation, education, and healthcare services. A smart city has been expected a lot to solve those issues. The concept of a smart city is not new. Due to the progress of information and communication technology (ICT), including the Internet of Things (IoT) and big data (BD), the concept of a smart city has been being realized in various aspects. This paper introduces the concept and definition of a smart city. Then it explains the ambient intelligence that supports a smart city. Moreover, it introduces several key components of a smart city.

Authors previously studied the degradation of electrical contacts under the condition of various external micro-oscillations. They also developed a micro-sliding mechanism (MSM2), which causes micro-sliding and is driven by a piezoelectric actuator and elastic hinges. Using the mechanism, experimental results were obtained on the minimal sliding amplitude (MSA) required to make the electrical resistance fluctuate under various conditions. In this paper, to develop a more realistic model of input waveform than the previous one, Ts/2 is set as the rising or falling time, Tc as the flat time, and τ/2 as the duration in a sliding period T (0.25 s) of the input waveform. Using the Duhamel's integral method and an optimization method, the physical parameters of natural angular frequency ω0 (12000 s-1), damping ratio ζ (0.05), and rising and falling time Ts (1.3 or 1.2 ms) are obtained. Using the parameters and the MSA, the total acceleration of the input TA (=f(t)) and the displacement of the output x(t) are also obtained using the Fourier series expansion method. The waveforms x(t) and the experimental results are similar to each other. If the effective mass m, which is defined as that of the movable parts in the MSM2, is 0.1 kg, each total force TF (=2mTA) is estimated from TA and m. By the TF, the cases for 0.3 N/pin as frictional force or in impulsive as input waveform are more serious than the others. It is essential for the safety and the confidence of electrical contacts to evaluate the input waveform and the frictional force. The ringing waveforms of the output displacements x(t) are calculated at smaller values of Ts (1.0, 0.5, and 0.0 ms) than the above values (1.3 or 1.2 ms). When Ts is slightly changed from 1.3 or 1.2 ms to 1.0 ms, the ringing amplitude is doubled. For the degradation of electrical contacts, it is essential that Ts is reduced in a rectangular and impulsive input. Finally, a very simple wear model comprising three stages (I, II, and III) is introduced in this paper. Because Ts is much shorter in a rectangular or impulsive input than in a sinusoidal input, it is considered that the former more easily causes wear than the latter owing to a larger frictional force. Taking the adhesive wear in Stages I and III into consideration, the wear is expected to be more severe in the case of small damped oscillations owing to the ringing phenomenon.

This paper presents a new hole-filling method that uses extrapolated spatio-temporal background information to obtain a synthesized free-view. A new background codebook for extracting reliable temporal background information is introduced. In addition, the paper addresses estimating spatial local background to distinguish background and foreground regions so that spatial background information can be extrapolated. Background holes are filled by combining spatial and temporal background information. Finally, exemplar-based inpainting is applied to fill in the remaining holes using a new priority function. The experimental results demonstrated that satisfactory synthesized views can be obtained using the proposed algorithm.

Communications satellites have been the primary mission from the early period of Japanese space development and their on-board communication equipment are the core devices to realize satellite communications systems. The technologies for this equipment have been developed to meet the requirements of high capacity and high functionality under the severe satellite-imposed constraints. This paper summarizes progress in on-board communication equipment technologies developed and verified by using Engineering Test Satellites and commercial satellites in Japan and describes their prospects.

In ProvSec 2014, Wang and Tanaka proposed a transformation which converts weakly existentially unforgeable (wEUF) signature schemes into strongly existentially unforgeable (sEUF) ones in the bounded leakage model. To obtain the construction, they combined leakage resilient (LR) chameleon hash functions with the Generalised Boneh-Shen-Waters (GBSW) transformation proposed by Steinfeld, Pieprzyk, and Wang. However, their transformation cannot be used in a more realistic model called continual leakage model since secret keys of LR chameleon hash functions cannot be updated. In this paper, we propose a transformation which can convert wEUF signature schemes into sEUF ones in the continual leakage model. To achieve our goal, we give a new definition of continuous leakage resilient (CLR) chameleon hash function and construct it based on the CLR signature scheme proposed by Malkin, Teranishi, Vahlis, and Yung. Although our CLR chameleon hash functions satisfy the property of strong collision-resistance, due to the existence of the updating algorithm, an adversary may find the kind of collisions such that messages are the same but randomizers are different. Hence, we cannot combine our chameleon hash functions with the GBSW transformation directly, or the sEUF security of the transformed signature schemes cannot be achieved. To solve this problem, we improve the original GBSW transformation by making use of the Groth-Sahai proof system and then combine it with CLR chameleon hash functions.

Asymmetric bilinear maps using Type-3 pairings are known to be advantageous in several points (e.g., the speed and the size of a group element) to symmetric bilinear maps using Type-1 pairings. Kremer and Mazaré introduce a symbolic model to analyze protocols based on bilinear maps, and show that the symbolic model is computationally sound. However, their model only covers symmetric bilinear maps. In this paper, we propose a new symbolic model to capture asymmetric bilinear maps. Our model allows us to analyze security of various protocols based on asymmetric bilinear maps (e.g., Joux's tripartite key exchange, and Scott's client-server ID-based key exchange). Also, we show computational soundness of our symbolic model under the decisional bilinear Diffie-Hellman assumption.

As a result of large-scale and complicated of ICT (Information and Communication Technology), the technologies of operations and management of ICT infrastructure and systems are changing to adopt the variation and diversity of usage and communication characteristics. In retrospect, operations and management technologies cover widely from the support of telecommunications operations and remote monitoring for maintaining network equipments, to an integrated network management framework for configuration, monitoring, testing and controls. Recently, the spread of network virtualization technologies enable agility, integrity, and resilience to ICT services. Operations and management technologies will be more important in future, for the support of integrated management of ICT infrastructure including computing resource, and automation of service operations. In this paper, we review research activities of the Technical Committee on Information and Communications Management (ICM) with discussions of individual research category. We then describe the state-of-the-art topics and future directions in the area of ICM.

Recent research on the assessment of low probability of interception (LPI) radar waveforms is mainly based on limiting spectral properties of Wigner matrices. As the dimension of actual operating data is constrained by the sampling frequency, it is very urgent and necessary to research the finite theory of Wigner matrices. This paper derives a closed-form expression of the spectral cumulative distribution function (CDF) for Wigner matrices of finite sizes. The expression does not involve any derivatives and integrals, and therefore can be easily computed. Then we apply it to quantifying the LPI performance of radar waveforms, and the Kullback-Leibler divergence (KLD) is also used in the process of quantification. Simulation results show that the proposed LPI metric which considers the finite sample size and signal-to-noise ratio is more effective and practical.

As a with-carry analog (based on modular arithmetic) of the usual Walsh-Hadamard transform (WHT), arithmetic Walsh transform (AWT) has been used to obtain analogs of some properties of Boolean functions which are important in the design and analysis of cryptosystems. The existence of nonzero linear structure of Boolean functions is an important criterion to measure the weakness of these functions in their cryptographic applications. In this paper, we find more analogs of linear structures of Boolean functions from AWT. For some classes of n-variable Boolean functions f, we find necessary and sufficient conditions for the existence of an invariant linear structure and a complementary linear structure 1n of f. We abstract out a sectionally linear relationship between AWT and WHT of n-variable balanced Boolean functions f with linear structure 1n. This result show that AWT can characterize cryptographic properties of these functions as long as WHT can. In addition, for a diagonal Boolean function f, a recent result by Carlet and Klapper says that the AWT of f can be expressed in terms of the AWT of a diagonal Boolean function of algebraic degree at most 3 in a larger number of variables. We provide for the result a complete and more modular proof which works for both even and odd weights (of the parameter c in the Corollary 19 by Carlet and Klapper (DCC 73(2): 299-318, 2014).

Accurate optic disc localization and segmentation are two main steps when designing automated screening systems for diabetic retinopathy. In this paper, a novel optic disc detection approach based on saliency object detection and modified local intensity clustering model is proposed. It consists of two stages: in the first stage, the saliency detection technique is introduced to the enhanced retinal image with the aim of locating the optic disc. In the second stage, the optic disc boundary is extracted by the modified Local Intensity Clustering (LIC) model with oval-shaped constrain. The performance of our proposed approach is tested on the public DIARETDB1 database. Compared to the state-of-the-art approaches, the experimental results show the advantages and effectiveness of the proposed approach.

In this paper, we propose a method for removing block noise which appears in JPEG (Joint Photographic Experts Group) encoded images. We iteratively perform the 3D wiener filtering and correction of the coefficients. In the wiener filtering, we perform the block matching for each patch in order to get the patches which have high similarities to the reference patch. After wiener filtering, the collected patches are returned to the places where they were and aggregated. We compare the performance of the proposed method to some conventional methods, and show that the proposed method has an excellent performance.

This paper presents a system for the automatic generation of Galois-field (GF) arithmetic circuits, named the GF Arithmetic Module Generator (GF-AMG). The proposed system employs a graph-based circuit description called the GF Arithmetic Circuit Graph (GF-ACG). First, we present an extension of the GF-ACG to handle GF(pm) (p≥3) arithmetic circuits, which can be efficiently implemented by multiple-valued logic circuits in addition to the conventional binary circuits. We then show the validity of the generation system through the experimental design of GF(pm) multipliers for different p-values. In addition, we evaluate the performance of three types of GF(2m) multipliers and typical GF(pm) multipliers (p≥3) empirically generated by our system. We confirm from the results that the proposed system can generate a variety of GF parallel multipliers, including practical multipliers over GF(pm) having extension degrees greater than 128.

This paper presents some results of an experimental trial for the 5th generation (5G) wireless communication systems using 28GHz band. In order to tackle rapidly increasing traffic for 2020 and beyond, new radio access networks for the 5G mobile communication systems will introduce the use of higher frequency bands such as spectra higher than 10GHz to achieve higher capacity and super high bit rate transmission of several tens of Gbps. The target of this experimental trial is to evaluate the feasibility of using the 28GHz band with super-wide bandwidth of 800MHz for 5G wireless communication systems. To compensate large path-loss in higher frequency, the beamforming (BF) based on Massive multiple-input multiple-output (MIMO) is one of promising techniques and can be combined with spatial multiplexing of multiple data streams to achieve much higher capacity. In addition, to support the mobility of mobile station (MS), beam tracking technique is important. In this trial, we first conduct a basic experiment of single-stream transmission by using prototype system with base station (BS) having 96-element antenna and MS having 8-element antenna to evaluate the effectiveness of joint transmitter/receiver BF in 28GHz band in terms of coverage, impact of path loss, shadowing loss and penetration loss under indoor, outdoor and outdoor-to-indoor (O-to-I) environments. We show that by using 28 GHz band with BF based on Massive MIMO, higher throughput near 1.2Gbps can be achieved at many points in the indoor environment. It is also shown that the throughput of over 1Gbps can be achieved at points around 200m distant from BS in outdoor line-of-site (LOS) environment. Secondly, to evaluate the effectiveness of spatial multiplexing and beam tracking under more realistic environment, we also conduct the outdoor experiment of BF combined with 2-stream spatial multiplexing in high mobility environment with MS speed of up to 60km/h by using smartphone-shape MS antenna. We also show that maximum throughput of 3.77Gbps can be achieved with MS speed of 60km/h by using BF with 2-stream multiplexing and beam tracking.

The Möbius cube is a variant of the hypercube. Its advantage is that it can connect the same number of nodes as a hypercube but with almost half the diameter of the hypercube. We propose an algorithm to solve the node-to-node disjoint paths problem in n-Möbius cubes in polynomial-order time of n. We provide a proof of correctness of the algorithm and estimate that the time complexity is O(n2) and the maximum path length is 3n-5.

Inter-switch networks for HPC systems and data-centers can be improved by applying random shortcut topologies with a reduced number of hops. With minimal routing in such networks; however, deadlock-freedom is not guaranteed. Multiple Virtual Channels (VCs) are efficiently used to avoid this problem. However, previous works do not provide good trade-offs between the number of required VCs and the time and memory complexities of an algorithm. In this work, a novel and fast algorithm, named ACRO, is proposed to endorse the arbitrary routing functions with deadlock-freedom, as well as consuming a small number of VCs. A heuristic approach to reduce VCs is achieved with a hash table, which improves the scalability of the algorithm compared with our previous work. Moreover, experimental results show that ACRO can reduce the average number of VCs by up to 63% when compared with a conventional algorithm that has the same time complexity. Furthermore, ACRO reduces the time complexity by a factor of O(|N|⋅log|N|), when compared with another conventional algorithm that requires almost the same number of VCs.

This paper expands Bartlett's bisection theorem. The theory of modal S-parameters and their circuit representation is constructed from a group-theoretic perspective. Criteria for the division of a circuit at a fixed node whose state is distinguished by the irreducible representation of its stabilizer subgroup are obtained, after being inductively introduced using simple circuits as examples. Because these criteria use only circuit symmetry and do not require human judgment, the distinction is reliable and implementable in a computer. With this knowledge, the entire circuit can be characterized by a finite combination of smaller circuits. Reducing the complexity of symmetric circuits contributes to improved insights into their characterization, and to savings of time and effort in calculations when applied to large-scale circuits. A three-phase filter and a branch-line coupler are analyzed as application examples of circuit and electromagnetic field analysis, respectively.

The use of flash memory based storage devices is rapidly increasing, and user demands for high performance are also constantly increasing. The performance of the flash storage device is greatly influenced by cleaning operations of Flash Translation Layer (FTL). Various studies have been conducted to lower the cost of cleaning operations. However, there are limits to achieve sufficient performance improvement of flash storages without help of a host system, with only limited information in storage devices. Recently, SCSI, eMMC, and UFS standards provide an interface for sending semantic information from a host system to a storage device. In this paper, we analyze effects of semantic information on performance and lifetime of flash storage devices. We evaluate performance and lifetime improvement through SA-FTL (Semantic Aware Flash Translation Layer), which can take advantage of semantic information in storage devices. Experiments show that SA-FTL improves performance and lifetime of flash based storages by up to 30 and 35%, respectively, compared to a simple page-level FTL.

This paper presents a capacitor-loaded 4x4 planar loop array for three-dimensional near-field beamforming of magnetic resonance wireless power transfer (WPT). This planar loop array provides three important functions: beamforming, selective power transfer, and the ability to work alignment free with the receiver. These functions are realized by adjusting the capacitance of each loop. The optimal capacitance of each loop that corresponds to the three functions can be found using a genetic algorithm (GA); the three functions were verified by comparing simulations and measurements at a frequency of 6.78MHz. Finally, the beamforming mechanism of a near-field loop array was investigated using the relationship between the current magnitude and the resonance frequency of each loop, resulting in the findings that the magnitude and the resonance frequency are correlated. This focused current of the specified loop creates a strong magnetic field in front of that loop, resulting in near-field beamforming.

We consider fixed-to-variable length coding with a regular cost function by allowing the error probability up to any constantε. We first derive finite-length upper and lower bounds on the average codeword cost, which are used to derive general formulas of two kinds of minimum achievable rates. For a fixed-to-variable length code, we call the set of source sequences that can be decoded without error the dominant set of source sequences. For any two regular cost functions, it is revealed that the dominant set of source sequences for a code attaining the minimum achievable rate under a cost function is also the dominant set for a code attaining the minimum achievable rate under the other cost function. We also give general formulas of the second-order minimum achievable rates.