Quality requirements are scattered over a requirements specification, thus it is hard to measure and trace such quality requirements to validate the specification against stakeholders' needs. We proposed a technique called "spectrum analysis for quality requirements" which enabled analysts to sort a requirements specification to measure and track quality requirements in the specification. In the same way as a spectrum in optics, a quality spectrum of a specification shows a quantitative feature of the specification with respect to quality. Therefore, we can compare a specification of a system to another one with respect to quality. As a result, we can validate such a specification because we can check whether the specification has common quality features and know its specific features against specifications of existing similar systems. However, our first spectrum analysis for quality requirements required a lot of effort and knowledge of a problem domain and it was hard to reuse such knowledge to reduce the effort. We thus introduce domain knowledge called term-characteristic map (TCM) to reuse the knowledge for our quality spectrum analysis. Through several experiments, we evaluate our spectrum analysis, and main finding are as follows. First, we confirmed specifications of similar systems have similar quality spectra. Second, results of spectrum analysis using TCM are objective, i.e., different analysts can generate almost the same spectra when they analyze the same specification.

The purpose of this study is to show a class of near shift-invariant and orientation-selective transform based on even-stacked cosine-modulated filter banks (ECFBs) which originally have been proposed by Lin and Vaidyanathan. It is well-known that ECFBs can be designed by the modulation of just one prototype filter and guarantee the linear phase property. We extend this class to delay-less oversampled ECFB and show two additional attractive features; high directional selectivity and near shift-invariant property. In this paper, these properties are verified by theoretical analysis and demonstrations.

In wireless networks, sleep mode based power saving mechanisms can reduce the energy consumption at the expense of additional packet delay. This letter analyzes its packet queueing delay and wireless terminals' energy efficiency. Based on the analysis, optimal sleep window size can be derived to optimize terminal energy efficiency with delay constraint.

Wireless mesh networks have been extensively studied as expandable, flexible, and inexpensive access networks to the Internet. This paper focuses on one composed of multiple access points (APs) connected through multihop wireless communications mainly by the wireless distribution system (WDS). For scalability, the proper partition of APs into multiple WDS clusters is essential, because the number of APs in one cluster is limited due to the increasing radio interference and control packets. In this paper, we formulate this WDS clustering problem and prove the NP-completeness of its decision version through reduction from a known NP-complete problem. Then, we propose its heuristic algorithm, using a greedy method and a variable depth search method, to satisfy the complex constraints while optimizing the cost function. We verify the effectiveness of our algorithm through extensive simulations, where the results confirm its superiority to the existing algorithm in terms of throughput.

We have been studying a superconducting quantum-computing system where superconducting qubits are controlled and read out by rapid single-flux- quantum (RSFQ) circuits. In this study, we designed and fabricated an RSFQ microwave chopper, which turns on and off an externally applied microwave to control qubit states with the time resolution of sub-nanosecond. The chopper is implemented in a microwave module and mounted in a dilution refrigerator. We tested the microwave chopper at 4.2 K. The amplitude of the output microwave was approximately 100 µV which is much larger than that of previously designed chopper. We also confirmed that the irradiation time can be controlled by RSFQ control circuits.

A novel signal transition detector design using as few as 8 transistors is presented. The proposed design cleverly exploits the property of a specific internal state transition to mitigate the voltage degradation problem by employing only one extra transistor. It is thus capable of supporting level intact output signals and eliminating DC power consumption in the trailing buffer. The proposed design, featuring low circuit complexity and low power consumption, is considered useful for applications in self-timed circuits. Simulation results show that, when compared with other pass transistor logic based counterpart designs, as much as 46% savings in power and 28% in area can be achieved by the proposed design.

Superconducting Quantum Interference Devices (SQUIDs) are known to be the most sensitive magnetometers, used in a wide range of applications like biomagnetism, geomagnetism, Non Destructive Evaluation (NDE), metrology or fundamental science. For all these applications, the SQUID sensor is used in analog mode and associated with a carefully designed room-temperature control and/or feedback electronics. Nevertheless, the use of SQUID sensors in digital mode is of high interest for several applications due to their quantum accuracy associated to high linearity, and their potentially very high slew rate and dynamic range. The concept and performances of a low-Tc digital magnetometer based on Single-Flux-Quantum (SFQ) logic, fabricated at the FLUXONICS Foundry located at IPHT Jena, Germany, are given after a presentation of the context of development of superconductive digital magnetometers. The sensitivity, limited to one magnetic single flux quantum, and a dynamic range of 76 dB, that corresponds to an upper limit of the magnetic field amplitude higher than 5 µT, have been measured along with overnight stability. The dynamic range of about 2800 magnetic flux quanta Φ0 has been experimentally observed with an external magnetic field. First signatures of magnetic fields have been observed simultaneously with the ones of analog SQUIDs in the low noise environment of the Laboratoire Souterrain a Bas Bruit (LSBB) located in Rustrel, Provence, France.

This letter proposes a fast IP address lookup algorithm based on search space reduction. Prefixes are classified into three types according to the nesting relationship and a large forwarding table is partitioned into multiple small trees. As a result, the search space is reduced. The results of analyses and experiments show that the proposed method offers higher lookup and updating speeds along with reduced memory requirements.

Thinking process development diagram is a graphical expression from which readers can easily find not only the hierarchy of a given problem but the relationship between the problem and the solution. Although that has been developed as an idea creation support tool in the field of mechanical design, we referred to the restricted version as clamshell diagram to attempt to apply to other fields. In this paper we propose the framework for drawing the diagram of the SQL statement. The basic idea is to supply the hierarchical code fragments of a given SQL statement in the left side of the diagram and to put the meaning written in a natural language in the right. To verify the usefulness of the diagram expression, we actually drew several clamshell diagrams. For three SQL statements that are derived from the same specification, the resulting diagrams enable us to understand the difference visually.

Finding a kernel mapping function for support vector machines (SVMs) is a key step towards construction of a high-performanced SVM-based classifier. While some recent methods exploited an evolutional approach to construct a suitable multifunction kernel, most of them searched randomly and diversely. In this paper, the concept of a family of identical-structured kernel trees is proposed to enable exploration of structure space using genetic programming whereas to pursue investigation of parameter space on a certain tree using evolution strategy. To control balance between structure and parameter search towards an optimal kernel, simulated annealing is introduced. By experiments on a number of benchmark datasets in the UCI and text classification collection, the proposed method is shown to be able to find a better optimal solution than other search methods, including grid search and gradient search.

Ray tracing is one of the most popular techniques for generating photo-realistic images. Extensive research and development work has made interactive static scene rendering realistic. This paper deals with interactive dynamic scene rendering in which not only the eye point but also the objects in the scene change their 3D locations every frame. In order to realize interactive dynamic scene rendering, RTRPS (Ray Tracing based on Ray Plane and Bounding Sphere), which utilizes the coherency in rays, objects, and grouped-rays, is introduced. RTRPS uses bounding spheres as the spatial data structure which utilizes the coherency in objects. By using bounding spheres, RTRPS can ignore the rotation of moving objects within a sphere, and shorten the update time between frames. RTRPS utilizes the coherency in rays by merging rays into a ray-plane, assuming that the secondary rays and shadow rays are shot through an aligned grid. Since a pair of ray-planes shares an original ray, the intersection for the ray can be completed using the coherency in the ray-planes. Because of the three kinds of coherency, RTRPS can significantly reduce the number of intersection tests for ray tracing. Further acceleration techniques for ray-plane-sphere and ray-triangle intersection are also presented. A parallel projection technique converts a 3D vector inner product operation into a 2D operation and reduces the number of floating point operations. Techniques based on frustum culling and binary-tree structured ray-planes optimize the order of intersection tests between ray-planes and a sphere, resulting in 50% to 90% reduction of intersection tests. Two ray-triangle intersection techniques are also introduced, which are effective when a large number of rays are packed into a ray-plane. Our performance evaluations indicate that RTRPS gives 13 to 392 times speed up in comparison with a ray tracing algorithm without organized rays and spheres. We found out that RTRPS also provides competitive performance even if only primary rays are used.

In this paper, we propose a novel target acoustic signal detection approach which is based on non-negative matrix factorization (NMF). Target basis vectors are trained from the target signal database through NMF, and input vectors are projected onto the subspace spanned by these target basis vectors. By analyzing the distribution of time-varying normalized projection error, the optimal threshold can be calculated to detect the target signal intervals during the entire input signal. Experimental results show that the proposed algorithm can detect the target signal successfully under various signal environments.

In this paper, we address the on-demand end-to-end optical network construction problem for grid applications in new generation large-scale multi-domain wavelength switched optical networks (WSON). According to users' requests for high-performance distributed computing, groups of dedicated end-to-end lightpaths among geographically distributed grid resources can be established dynamically forming multiple-lightpath optical networks for grid applications, namely, optical grid network (OGN). To facilitate the automated OGN construction, we introduce an optical grid network infrastructure providing an integrated and self-contained OGN service to grid users with totally distributed control. In this infrastructure, for easy construction, especially in a large-scale multi-domain WSON environment, we propose an overlay approach to construct OGNs in a peer-to-peer fashion, which conceals the communication architecture of the underlying heterogeneous optical networks. In particular, we propose an adaptive construction mechanism that can develop the OGN flexibly by adapting to the dynamically changed optical network circumstance. To enable users to take the advantage of the end-to-end lightpaths of WSON directly, a wavelength-oriented end-host configuration scheme is proposed. Experimental results on a developed prototype and an optical-fibre test-bed network successfully validate the proposal.

Atmospheric radio ducts can trap VHF/UHF radio waves and propagate them over long distances. 284.4625 MHz Japanese radio wave signal measurements show that the radio waves are propagated to Korea coastal regions when ground temperatures exceed 10C. This paper discusses the reasons for the existence of this critical temperature threshold.

Human detection has witnessed significant development in recent years. The introduction of cascade structure and integral histogram has greatly improved detection speed. But real-time detection is still only possible for sparse scan of 320 240 sized images. In this work, we propose a matrix-based structure to reorganize the computation structure of window-scanning detection algorithms, as well as a new pre-processing method called Hierarchical HOG Matrices (HHM) in place of integral histogram. Our speed-up scheme can process 320 240 sized images by dense scan (≈ 12000 windows per image) at the speed of about 30 fps, while maintaining accuracy comparable to the original HOG + cascade method.

Due to the low complexity and cost characteristics of ultra-wideband (UWB) systems, a weighted acquisition algorithm based on energy detection is proposed in this paper. This method is divided into two steps to acquire the direct path (DP) component. Firstly, weighted energy detection is applied to determine which energy block the DP lies in by generalized likelihood ratio test (GLRT). A sub-optimal weighted vector is obtained, by which the closed form of detection performance is proposed. In the second step, the precise position of DP within the detected energy block is obtained by the statistical characteristics of the channel energy distributions. Key parameters that affect acquisition performance are studied by analytical and numerical methods. Simulations and experiments are carried out for performance and complexity comparison with traditional ones. The results show that weighted acquisition achieves better performance under relative low complexity conditions.

This paper suggests utterance verification system using state-level log-likelihood ratio with frame and state selection. We use hidden Markov models for speech recognition and utterance verification as acoustic models and anti-phone models. The hidden Markov models have three states and each state represents different characteristics of a phone. Thus we propose an algorithm to compute state-level log-likelihood ratio and give weights on states for obtaining more reliable confidence measure of recognized phones. Additionally, we propose a frame selection algorithm to compute confidence measure on frames including proper speech in the input speech. In general, phone segmentation information obtained from speaker-independent speech recognition system is not accurate because triphone-based acoustic models are difficult to effectively train for covering diverse pronunciation and coarticulation effect. So, it is more difficult to find the right matched states when obtaining state segmentation information. A state selection algorithm is suggested for finding valid states. The proposed method using state-level log-likelihood ratio with frame and state selection shows that the relative reduction in equal error rate is 18.1% compared to the baseline system using simple phone-level log-likelihood ratios.

An improved soft-input soft-output (SISO) minimum mean-squared error (MMSE) detection method is proposed for joint coding and precoding OFDM systems under imperfect channel estimation. Compared with the traditional mismatched detection which uses the channel estimate as its exact value, the signal model of the proposed detector is more accurate and the influence of channel estimation error (CEE) can be effectively mitigated. Simulations indicate that the proposed scheme can improve the bit error rate (BER) performance with fewer pilot symbols.

This paper considers the use of an antenna selection mechanism to reduce the cost of multiple analog transmit/receive chains in multiple-input multiple-output (MIMO) systems. With the optimal antenna selection scheme, radio-frequency chains can optimally connect with the best subset of transmitter and/or receiver antennas. However, the optimal antenna selection algorithm requires an exhaustive search of all possible combinations to find the optimum subset at the transmitter and/or receiver, thus resulting in high complexity. In order to reduce the computational load while still maximizing channel capacity, we introduce the simulated annealing (SA) method, an effective algorithm that solves various combinatorial optimization problems, to search the optimal subset. The simulation results show that the performance of the proposed SA method provides almost the same channel capacity as that of the optimal exhaustive search algorithm while maintaining low complexity.

The bit error rate (BER) performance of multicode multi-carrier code division multiple access (MC-CDMA) severely degrades due to the inter-code interference (ICI) in a strong frequency-selective channel. Recently a spreading code group construction method was proposed for MC-CDMA. The Walsh-Hadmard (WH) codes are divided into a number of code groups such that the code orthogonality can be maintained within each group even in a strong frequency-selective channel; any code pair taken from different groups is not orthogonal. The number of spreading codes in each group is determined by the maximum time delay difference of the channel. In this paper, we point out that the number of codes in each group is determined by the distribution of time delay differences among the propagation paths of the channel, not the maximum time delay difference. Based on that observation, we show that more orthogonal spreading codes can exist in each code group. The conditional BER is derived taking into account the interference from other code groups and the achievable downlink BER performance using the proposed spreading code group construction is numerically evaluated in a frequency-selective Rayleigh fading channel.