We propose simple but efficient encapsulation architecture. In the architecture, clients can better decode Extensible Markup Language (XML) based service information for TV contents with schema digest. Our experimental results show the superiority of the proposed architecture by comparing the compression ratios and decoding times of the proposed architecture and the existing architectures.

In this paper, we analyze the rollback traffic in polar-orbit satellite networks that use the snapshot routing algorithm. The concept of diamond rollback links and polar rollback links are presented for the first time, and the numbers of diamond and polar rollback links in polar-orbit satellite networks are concisely formulated. Simulations are performed based on the Iridium and Teledesic system in NS2, and the results finally confirm our analysis. With this work, we can not only simplify the rollback loops avoidance scheme, but also provide guidance for future satellite network routing optimization and topology design.

This paper proposed patient friendly capsule endoscopy (CE) for not only screening but also treatment. Two different types of CEs with an Internet utility were investigated. The first type used magnetic navigation in the stomach and colon for screening. Magnetic navigation enabled the capsule to explore the whole of the gastrointestinal tract with less risk of missing lesions and complete the screening within the battery life. The system's design was patiently friendly as it allowed the subjects to leave the hospital after the capsule had been navigated in the stomach. The second investigated two different therapeutic robotic endoscopes. Both prototypes were driven by DC motors and controlled remotely via the internet. In addition, they were equipped with therapeutic tools and each prototype's ability with the tools was assessed. The investigation showed it was possible to remotely control both prototypes and operate therapeutic tools via the Internet. The investigation identified areas for improvement, such as size, connection speed, security of data, and the holding the capsule's position during treatment, In conclusion, both methods have the potential to make capsule endoscopy a very patient friendly procedure that can be carried out anywhere.

In a proxy re-encryption (PRE) scheme, a delegator gives a re-encryption key to a semi-trusted proxy, then the proxy can transform the delegator's ciphertexts into one that can be decrypted by a delegatee who is appointed by the delegator. The proxy cannot, however, learn anything about the encrypted messages. At CCS 2007, Canetti and Hohenberger left an interesting open problem of how to design a PRE scheme that is simultaneously unidirectional and multi-hop. This is a rather interesting problem since in some applications we may need this feature, such as in the scenario of email forwarding, a delegatee wants forward his emails that received from the delegator to another delegatee. In this work we design an unidirectional and multi-hop PRE scheme by using multilinear maps. A shortcoming of our scheme is that its security relies on some rather strong assumptions in the setting of multilinear groups.

How to reduce communication complexity is a common important issue to design cryptographic protocols. This paper focuses on authenticated key exchange (AKE). Several AKE schemes have been studied, which satisfy strong security such as exposure-resilience in the standard model (StdM). However, there is a large gap on communication costs between schemes in the StdM and in the random oracle model. In this paper, we show a generic construction that is significantly compact (i.e., small communication cost) and secure in the StdM. We follow an existing generic construction from key encapsulated mechanism (KEM). Our main technique is to use a bounded chosen-ciphertext secure KEM instead of an ordinary chosen-ciphertext secure KEM. The communication cost can be reduced to half by this technique, and we achieve the most compact AKE scheme in the StdM. Moreover, our construction has instantiations under wider classes of hardness assumptions (e.g., subset-sum problems and multi-variate quadratic systems) than existing constructions. This work pioneers the first meaningful application of bounded chosen-ciphertext secure KEM.

Braille fonts allow us to easily make braille labels on capsule paper. For legibility, fonts should be printed at optimum sizes. To find the optimum sizes for Japanese braille fonts, we conducted an experiment in which a Japanese braille font was printed at various sizes on capsule paper and read and rated by young braille users. The results show that braille printed at 17 and 18 point sizes were read faster and evaluated higher than those printed at smaller or bigger sizes.

A new artificial fish swarm algorithm (AFSA) for solving the multiple knapsack problem (MKP) is introduced in this paper. In the proposed AFSA, artificial fish (AF) individuals are only allowed to search the region near constraint boundaries of the problem to be solved. For this purpose, several behaviors to be performed by AF individuals, including escaping behavior, randomly moving behavior, preying behavior and following behavior, were specially designed. Exhaustive experiments were implemented in order to investigate the proposed AFSA's performance. The results demonstrated the proposed AFSA has the ability of finding high-quality solutions with very fast speed, as compared with some other versions of AFSA based on different constraint-handling methods. This study is also meaningful for solving other constrained problems.

The conventional covariance matrix technique based subspace methods, such as the 2-D Capon algorithm and computationally efficient ESPRIT-type algorithms, are invalid with a single snapshot in a bistatic MIMO radar. A novel matrix pencil method is proposed for the direction of departures (DODs) and direction of arrivals estimation (DOAs) estimation. The proposed method constructs an enhanced matrix from the direct sampled data, and then utilizes the matrix pencil approach to estimate DOAs and DODs, which are paired automatically. The proposed method is able to provide favorable and unambiguous angle estimation performance with a single snapshot. Simulation results are presented to verify the effectiveness of the proposed method.

In this letter, we propose an improvement on a knapsack probabilistic encryption scheme [B. Wang, Q. Wu, Y. Hu, Information Sciences 177 (2007)], which was shown vulnerable to attacks due to Youssef [A.M. Youssef, Information Sciences 179 (2009)] and Lee [M.S. Lee, Information Sciences 222 (2013)], respectively. The modified encryption scheme is secure against Youssef's and Lee's attacks only at the costs of slightly compromising the efficiency of the original proposal.

Checkpoint-rollback recovery, which is a universal method for restoring distributed systems after faults, requires a sophisticated snapshot algorithm especially if the systems are large-scale, since repeatedly taking global snapshots of the whole system requires unacceptable communication cost. As a sophisticated snapshot algorithm, a partial snapshot algorithm has been introduced that takes a snapshot of a subsystem consisting only of the nodes that are communication-related to the initiator instead of a global snapshot of the whole system. In this paper, we modify the previous partial snapshot algorithm to create a new one that can take a partial snapshot more efficiently, especially when multiple nodes concurrently initiate the algorithm. Experiments show that the proposed algorithm greatly reduces the amount of communication needed for taking partial snapshots.

Amplitude phase shift keying (APSK) constellation with Gray mapping was proposed recently. Inspired by the simplified soft demapping for regular Gray-QAM, a simplified soft demapping algorithm for Gray-APSK is proposed in this paper. Compared with conventional soft demapping schemes, its complexity is greatly reduced with only a little SNR loss, which is validated by the complexity analysis and FPGA compilation results.

This paper presents comprehensive comparisons of the achievable throughput between the 32-/64-ary amplitude and phase shift keying (APSK) and cross 32QAM/square 64QAM schemes based on mutual information (MI) considering the peak-to-average power ratio (PAPR) of the modulated signal. As a PAPR criterion, we use a cubic metric (CM) that directly corresponds to the transmission back-off of a power amplifier. In the analysis, we present the best ring ratio for the 32 or 64APSK scheme from the viewpoint of minimizing the required received signal-to-noise power ratio (SNR) considering the CM that achieves the peak throughput, i.e., maximum error-free transmission rate. We show that the required received SNR considering the CM at the peak throughput is minimized with the number of rings of M = 3 and 4 for 32-ary APSK and 64-asry APSK, respectively. Then, we show with the best ring ratios that the (4, 12, 16) 32APSK scheme with M = 3 achieves a lower required received SNR considering the CM compared to that for the cross 32QAM scheme. Similarly, we show that the (4, 12, 20, 28) 64APSK scheme with M = 4 achieves almost the same required received SNR considering the CM as that for the square 64QAM scheme.

A low complexity log-likelihood ratio (LLR) calculation for high-order amplitude phase shift keying (APSK) signals is proposed. Using proper constellation partitioning together with a look-up table, the number of terms for the comparison of Euclidean distances can be significantly reduced. Compared with the log-sum LLR approximation, the proposed method reduces the computational complexity by more than 65% and 75% for 16-APSK and 32-APSK signals, respectively, with very small bit error rate performance degradation.

Current collapse of AlGaN/GaN heterostructure field-effect transistors (HFETs) formed on qualified epitaxial layers on Si substrates was successfully suppressed using graded field-plate (FP) structures. To improve the reproducibility of the FP structure manufacturing process, a simple process for linearly graded SiO2 profile formation was developed. An HFET with a graded FP structure exhibited a significant decrease in an on-resistance increase ratio of 1.16 even after application of a drain bias of 600 V.

We propose a generic conversion from a key encapsulation mechanism (KEM) to an identification (ID) scheme. The conversion derives the security for ID schemes against concurrent man-in-the-middle (cMiM) attacks from the security for KEMs against adaptive chosen ciphertext attacks on one-wayness (one-way-CCA2). Then, regarding the derivation as a design principle of ID schemes, we develop a series of concrete one-way-CCA2 secure KEMs. We start with El Gamal KEM and prove it secure against non-adaptive chosen ciphertext attacks on one-wayness (one-way-CCA1) in the standard model. Then, we apply a tag framework with the algebraic trick of Boneh and Boyen to make it one-way-CCA2 secure based on the Gap-CDH assumption. Next, we apply the CHK transformation or a target collision resistant hash function to exit the tag framework. And finally, as it is better to rely on the CDH assumption rather than the Gap-CDH assumption, we apply the Twin DH technique of Cash, Kiltz and Shoup. The application is not “black box” and we do it by making the Twin DH technique compatible with the algebraic trick. The ID schemes obtained from our KEMs show the highest performance in both computational amount and message length compared with previously known ID schemes secure against concurrent man-in-the-middle attacks.

We propose a novel modular network called the Self-Evolving Modular Network (SEEM). The SEEM has a modular network architecture with a graph structure and these following advantages: (1) new modules are added incrementally to allow the network to adapt in a self-organizing manner, and (2) graph's paths are formed based on the relationships between the models represented by modules. The SEEM is expected to be applicable to evolving functions of an autonomous robot in a self-organizing manner through interaction with the robot's environment and categorizing large-scale information. This paper presents the architecture and an algorithm for the SEEM. Moreover, performance characteristic and effectiveness of the network are shown by simulations using cubic functions and a set of 3D-objects.

The subset sum problem, which is often called as the knapsack problem, is known as an NP-hard problem, and there are several cryptosystems based on the problem. Assuming an oracle for shortest vector problem of lattice, the low-density attack algorithm by Lagarias and Odlyzko and its variants solve the subset sum problem efficiently, when the “density” of the given problem is smaller than some threshold. When we define the density in the context of knapsack-type cryptosystems, weights are usually assumed to be chosen uniformly at random from the same interval. In this paper, we focus on general subset sum problems, where this assumption may not hold. We assume that weights are chosen from different intervals, and make analysis of the effect on the success probability of above algorithms both theoretically and experimentally. Possible application of our result in the context of knapsack cryptosystems is the security analysis when we reduce the data size of public keys.

Let T be a text of length n and P be a pattern of length m, both strings over a fixed finite alphabet. The Pattern Matching with Swaps problem is to find all occurrences of P in T if adjacent pattern characters can be swapped. In the Approximate Pattern Matching problem with Swaps, one seeks for every text location with a swapped match of P, the number of swaps necessary to obtain a match at the location. In this paper we provide the first off-line solution for the swap matching problem and the approximate pattern matching problem with swaps. We present a new data-structure called a Swap-transforming Tree. And we give a precise upper-bond of the number of the swapped versions of a pattern. By using the swap-transforming tree, we can solve both problems in time O(λmlog2 n) on an O(nHk) bits indexing data structure. Here λ is a constant. Our solution is more effective when the pattern is short.

This paper proposes an adaptive algorithm for adaptive arrays that minimizes the bit error rate (BER) of the array output signals in radio communication systems with the use of multilevel modulation signals. In particular, amplitude phase shift keying (APSK) is used as one type of multilevel modulations in this paper. Simultaneous non-linear equations that are satisfied by the optimum weight vector of the proposed algorithm are derived and used for theoretical analyze of the performance of the adaptive array based on the proposed algorithm. As a result of the theoretical analysis, it can be shown that the proposed adaptive array improves the carrier to interference ratio of the array output signal without taking advantage of the nulls. Furthermore, it is confirmed that the result of the theoretical analysis agrees with that of computer simulation. When the number of the received antenna is less than that of the received signals, the adaptive array based on the proposed algorithm is verified to achieve much better performance then that based on the least mean square (LMS) algorithm.

Hayabusa returned to Earth on June 13, 2010, becoming the world's first explorer to complete a round-trip voyage to an asteroid. After being released from the spacecraft, the sample return capsule landed in the Woomera Prohibited Area in the desert of South Australia. The capsule recovery team from JAXA found the capsule within 1 h of its landing. The beacon tracking system that was developed by JAXA played an important role in the tracking and discovery of the sample return capsule. The system has flexibility regarding the landing position of the capsule, because it does not rely on primary radar. In this paper, we describe the beacon tracking system and evaluate the system by discussing the results of preliminary examination and of operation on the day of re-entry.