Autonomic Self‐Repairing Glassy Materials

A new process that enables glassy materials to self‐repair from mechanical damage is presented in this paper. Contrary to intrinsic self‐healing, which involves overheating to enable crack healing by glass softening, this process is based on an extrinsic effect produced by vanadium boride (VB) particles dispersed within the glass matrix. Self‐repair is obtained through the oxidation of VB particles, and thus without the need to increase the operating temperature. The VB healing agent is selected for its capacity to oxidize at a lower temperature than the softening point of the glass. Thermogravimetric analyses indeed show that VB oxidation is rapid and occurs below the glass transition temperature. Solid‐state nuclear magnetic resonance spectroscopy indicates that VB is oxidized into V₂O₅ and B₂O₃, which enable the local formation of glass. The autonomic self‐healing effect is demonstrated by an in situ experiment visualized using an environmental scanning electron microscope. It is shown that a crack could be healed by the VB oxidation products.     

Feature‐Based Relation Classification Using Quantified Relatedness Information

Feature selection is very important for feature‐based relation classification tasks. While most of the existing works on feature selection rely on linguistic information acquired using parsers, this letter proposes new features, including probabilistic and semantic relatedness features, to manifest the relatedness between patterns and certain relation types in an explicit way. The impact of each feature set is evaluated using both a chisquare estimator and a performance evaluation. The experiments show that the impact of relatedness features is superior to existing well‐known linguistic features, and the contribution of relatedness features cannot be substituted using other normally used linguistic feature sets.     

Ultra‐small Form‐Factor Helix on Pad‐Type Stage‐Bypass WCDMA Tx Power Amplifier Using a Chip‐Stacking Technique and a Multilayer Substrate

A fully integrated small form‐factor HBT power amplifier (PA) was developed for UMTS Tx applications. For practical use, the PA was implemented with a well configured bottom dimension, and a CMOS control IC was added to enable/disable the HBT PA. By using helix‐on‐pad integrated passive device output matching, a chip‐stacking technique in the assembly of the CMOS IC, and embedding of the bulky inductive lines in a multilayer substrate, the module size was greatly reduced to 2 mm × 2.2 mm. A stage‐bypass technique was used to enhance the efficiency of the PA. The PA showed a low idle current of about 20 mA and a PAE of about15% at an output power of 16 dBm, while showing good linearity over the entire operating power range.     

Design of 24 GHz Radar with Subspace‐Based Digital Beam Forming for ACC Stop‐and‐Go System

For an adaptive cruise control (ACC) stop‐and‐go system in automotive applications, three radar sensors are needed because two 24 GHz short range radars are used for object detection in an adjacent lane, and one 77 GHz long‐range radar is used for object detection in the center lane. In this letter, we propose a single sensor‐based 24 GHz radar with a detection capability of up to 150 m and ±30° for an ACC stop‐and‐go system. The developed radar is highly integrated with a high gain patch antenna, four channel receivers with GaAs RF ICs, and back‐end processing board with subspace based digital beam forming algorithm.     

Cross‐Layer Resource Allocation Scheme for WLANs with Multipacket Reception

Tailored for wireless local area networks, the present paper proposes a cross‐layer resource allocation scheme for multiple‐input multiple‐output orthogonal frequency‐division multiplexing systems. Our cross‐layer resource allocation scheme consists of three stages. Firstly, the condition of sharing the subchannel by more than one user is studied. Secondly, the subchannel allocation policy which depends on the data packets’ lengths and the admissible combination of users per subchannel is proposed. Finally, the bits and corresponding power are allocated to users based on a greedy algorithm and the data packets’ lengths. The analysis and simulation results demonstrate that our proposed scheme not only achieves significant improvement in system throughput and average packet delay compared with conventional schemes but also has low computational complexity.     

Improving Memory Efficiency of Dynamic Memory Allocators for Real‐Time Embedded Systems

Dynamic memory allocators for real‐time embedded systems need to fulfill three fundamental requirements: bounded worst‐case execution time, fast average execution time, and minimal fragmentation. Since embedded systems generally run continuously during their whole lifetime, fragmentation is one of the most important factors in designing the memory allocator. This paper focuses on minimizing fragmentation while other requirements are still satisfied. To minimize fragmentation, a part of a memory region is segregated by the proposed budgeting method that exploits the memory profile of the given application. The budgeting method can be applied for any existing memory allocators. Experimental results show that the memory efficiency of allocators can be improved by up to 18.85% by using the budgeting method. Its worst‐case execution time is analyzed to be bounded.     

Fine‐Grained FSMD Power Gating Considering Power Overhead

As a fine‐grained power gating method for achieving greater power savings, our approach takes advantage of the finite state machine with a datapath (FSMD) characteristic which shows sequential idleness among subcircuits. In an FSMD‐based power gating, while only an active subcircuit is expected to be turned on, more subcircuits should be activated due to the power overhead. To reduce the number of missed opportunities for power savings, we deactivated some of the turned‐on subcircuits by slowing the FSMD down and predicting its behavior. Our microprocessor experiments showed that the power savings are close to the upper bound.     

Fault Attack on a Point Blinding Countermeasure of Pairing Algorithms

Recently, Page and Vercauteren proposed a fault attack on pairing algorithms and two countermeasures against such an attack. The countermeasure uses either a random scalar or a random point to blind the input points. To defeat the countermeasure using a random point, we utilize the point addition formula on an elliptic curve. As a result, we successfully defeat the countermeasure using a random point.     

Efficient Generation of Scalable Transport Stream for High Quality Service in T‐DMB

We introduce an advanced terrestrial digital multimedia broadcasting (AT‐DMB) system that overcomes the limitation of data transmission rates of T‐DMB by doubling it with the same frequency bandwidth. In this letter, we propose an efficient algorithm which generates a scalable transport stream in AT‐DMB by multiplexing certain types of elementary streams encoded using scalable video coding and an MPEG‐surround audio coder for high‐quality multimedia services.