Researchers have proposed numerous approaches to providing Quality-of-Service (QoS) across the Internet. The IETF has proposed two reservation approaches: hop-by-hop bandwidth reservation (IntServ); and per-hop behaviour bandwidth reservation (DiffServ). An edge router generates traffic, accepts per-flow reservation and classifies them into predetermined service class; while a core router ensures different QoS guarantees for each service class. We propose an Edge-to-Edge Quality-of-Service Domain in which packet trains with the same service requirements aggregated using packet deadline at edge router. The properties of a packet train like Inter-Packet Departure Time, Inter-flow Departure Time and accumulated packet delay are embedded and used by our quantum-based scheduler and QoS packet forwarding scheme in core routers. Thus, we are able to extract per-queue and per-flow information. Each queue is reconstructed at core router with packets having an expected departure time that is relative to the ingress router. Useful functions like instantaneous service rate and fine granular dropping scheme can be derived with a combination of embedded information and relative virtual clock technique. The encapsulation of our packet train information converges mathematically. Through simulations, we show that our architecture can provide delay and rate guarantees and minimise jitter for QoS-sensitive flows that requires LR-coupled or LR-decoupled reservations.

Multi-context FPGAs allow very quick reconfiguration by storing multiple configuration data at the same time. While testing for FPGAs with single-context memories has already been studied by many researchers, testing for multi-context FPGAs has not been proposed yet. This paper presents an architecture of testable multi-context FPGAs. In the proposed multi-context FPGA, configuration data stored in a context can be copied into another context. This paper also shows testing of the proposed multi-context FPGA. The proposed testing uses the testing for the traditional FPGAs with single-context. The testing is capable of detecting single stuck-at faults and single open faults which affect normal operations. The number of test configurations for the proposed testing is at most two more than that for the testing of FPGAs with single-context memories. The area overhead of the proposed architecture is 7% and 4% of the area of a multi-context FPGA without the proposed architecture when the number of contexts in a configuration memory is 8 and 16, respectively.

The performance of the vehicular communication links used for Intelligent Transport Systems is investigated. Intervehicle communication (IVC) and combined vehicular communication implemented by IVC and additional communication media are studied and their performance is explicitly described. Through numerical studies, it is shown that performance varies according to parameter values such as the mean space headway, the speed of the vehicles, and the penetration ratio of the IVC device. To achieve a given level of performance, I propose (i) a design of the information delivery delay of additional communication media and (ii) a method determining the appropriate delay.

In this letter, we propose a combined scheme of minimum mean square error (MMSE) detection and successive interference cancellation (SIC) for multiuser space-time block coded orthogonal frequency division multiplexing (STBC-OFDM) systems. With the same complexity order, the proposed scheme provides significant bit error rate (BER) performance improvement over the linear MMSE multiuser detector.

A probe-fed U-shaped cross-sectional antenna with tuning stubs on a U-shaped ground plane is proposed for wideband applications. The bottom of the antenna is etched to form tuning stubs for impedance matching. The simulated results of return loss, co- and cross-polarized patterns are presented and compared with the measured ones. Characteristics of a constructed antenna prototype at the operating frequency show that the antenna has an impedance bandwidth (2:1 VSWR) of 37.44% and average gain level of 8.5 dBi. Good radiation characteristics of the proposed antenna have been obtained that is the cross-polarization level and front-to-back ratio in both E- and H-planes across the large bandwidth are better than 22 dB and 12 dB, respectively.

Magnetoencephalography (MEG) is a method to measure a magnetic field generated by electrical neural activity in a brain, and it plays increasingly important role in clinical diagnoses and neurophysiological studies. However, in MEG analysis, the estimation of the brain activity, of the electric current density distribution in a brain which is represented by current dipoles, is problematic. A spatial filter and subsequent reconstruction of the current density distribution estimated by the spatial filter (spatial filtered reconstruction: SFR) are proposed. The spatial filter is designed to be used without prior or temporal information. The proposed spatial filter ensures that it concentrates the current distribution around the activated sources in the conductor. The current distribution estimated by the spatial filter is reconstructed by multiple linear regression. Redundant current dipoles are eliminated, and the current distribution is optimized in the sense of the Mallows Cp statistic. Numerical studies are demonstrated and show successful estimation by SFR in multiple-dipole cases. In single-dipole cases with SNRs of 101 and more, the location of the true dipole was successfully estimated for about 80% of the simulations. The reconstruction with multiple linear regression corrected the location of the maximum current density estimated by the proposed spatial filtering. The dipole on the correct position contributes to more than 70% of the total dipoles in the estimated current distribution in those cases. These results show that the current distribution is effectively localized by SFR. We also investigate the differences among SFR, the LCMV (linearly constrained minimum variance) beamformer and the SAM (synthetic aperture magnetometry), the representatives of spatial filters in MEG analyses. It is indicated that spatial resolution is improved by avoiding dependence on temporal information.

In this work we present an energy efficient leader election protocol for anonymous radio network populated with n mobile stations. Previously, Nakano and Olariu have presented a leader election protocol that terminates, with probability exceeding 1- (f ≥ 1), in log log n+o(log log n)+O(log f) time slots [14]. As the above protocol works under the assumption that every station has the ability to transmit and monitor the channel at the same time, it requires every station to be equipped with two transceivers. This assumption, however, is unrealistic for most mobile stations due to constraints in cost, size, and energy dissipation. Our main contribution is to show that it is possible to elect a leader in an anonymous radio network where each station is equipped with a single transceiver. Quite surprisingly, although every station has only one transceiver, our leader election protocol still runs, with probability exceeding 1- (f ≥ 1), in log log n+o(log log n)+O(log f) time slots. Moreover, our leader election protocol needs only expected O(n) total awake time slots, while Nakano and Olariu's protocol needs expected O(nlog log n) total awake time slots. Since every leader election protocol needs at least Ω(n) awake time slots, our leader election protocol is optimal in terms of the expected awake time slots.

This paper proposes a Weil descent attack against elliptic curve cryptosystems over quartic extension fields. The scenario of the attack is as follows: First, one reduces a DLP on a Weierstrass form over the quartic extention of a finite field k to a DLP on a special form, called Scholten form, over the same field. Second, one reduces the DLP on the Scholten form to a DLP on a genus two hyperelliptic curve over the quadratic extension of k. Then, one reduces the DLP on the hyperelliptic curve to one on a Cab model over k. Finally, one obtains the discrete-log of original DLP by applying the Gaudry method to the DLP on the Cab model. In order to carry out the scenario, this paper shows that many of elliptic curve discrete-log problems over quartic extension fields of odd characteristics are reduced to genus two hyperelliptic curve discrete-log problems over quadratic extension fields, and that almost all of the genus two hyperelliptic curve discrete-log problems over quadratic extension fields of odd characteristics come under Weil descent attack. This means that many of elliptic curve cryptosystems over quartic extension fields of odd characteristics can be attacked uniformly.

We discuss the problem of finding a dominant sequence for sending input data items from a low-end client to a server for computational intensive tasks under the realistic assumption of unpredictable communication behavior. Under this assumption, the client has to send the input data items using a specified sequence to maximize the number of computations performed by the server at any time. The sequence-finding problem is NP-hard for the general case. In this paper, we address three fundamental and useful applications: the product of two polynomials, matrices multiplication and Fast Fourier Transform. We show that the sequence-finding problems of the three applications can be solved optimally in linear time. However, we also show counter examples to rule out any possibility of finding a dominant sequence for sparse cases of the three applications. Finally, a simulation is conducted to show the usefulness of our method.

In this paper, a 2-D iteratively reweighted least squares lattice algorithm, which is robust to the outliers, is introduced and is applied to defect detection problem in textured images. First, the philosophy of using different optimization functions that results in weighted least squares solution in the theory of 1-D robust regression is extended to 2-D. Then a new algorithm is derived which combines 2-D robust regression concepts with the 2-D recursive least squares lattice algorithm. With this approach, whatever the probability distribution of the prediction error may be, small weights are assigned to the outliers so that the least squares algorithm will be less sensitive to the outliers. Implementation of the proposed iteratively reweighted least squares lattice algorithm to the problem of defect detection in textured images is then considered. The performance evaluation, in terms of defect detection rate, demonstrates the importance of the proposed algorithm in reducing the effect of the outliers that generally correspond to false alarms in classification of textures as defective or nondefective.

In this letter, we discussed some properties of characteristic generators for a finite Abelian group code, proved that any two characteristic generators can not start (end) at the same position and have the same order of the starting (ending) components simultaneously, and that the number of all characteristic generators can be directly computed from the group code itself. These properties are exactly the generalization of the corresponding trellis properties of a linear code over a field.

A 2-bit operational metal/silicon-oxide-nitride-oxide-silicon (MONOS/SONOS) nonvolatile memory using an asymmetric double-gate (ASDG) MOSFET was studied to double flash memory density. The 2-bit programming and erasing was performed by Fowler-Nordheim (FN) tunneling in a NAND array architecture using individually controlled gates. A threshold voltage shift of programmed states for the 2-bit operation was investigated with the aid of a SILVACO® simulator in both sides of the gate by changing gate workfunctions and tunneling oxide thicknesses. In this paper, the scalability of the device down to 30 nm was demonstrated by numerical simulation. Additionally, guidelines of the 2-bit ASDG nonvolatile memory (NVM) structure and operational conditions were proposed for "program," "read," and "erase."

We consider the classification problem to construct a classifier c:{0,1}n{0,1} from a given set of examples (training set), which (approximately) realizes the hidden oracle y:{0,1}n{0,1} describing the phenomenon under consideration. For this problem, a number of approaches are already known in computational learning theory; e.g., decision trees, support vector machines (SVM), and iteratively composed features (ICF). The last one, ICF, was proposed in our previous work (Haraguchi et al., (2004)). A feature, composed of a nonempty subset S of other features (including the original data attributes), is a Boolean function fS:{0,1}S{0,1} and is constructed according to the proposed rule. The ICF algorithm iterates generation and selection processes of features, and finally adopts one of the generated features as the classifier, where the generation process may be considered as embodying the idea of boosting, since new features are generated from the available features. In this paper, we generalize a feature to an extended Boolean function fS:{0,1,*}S{0,1,*} to allow partial knowledge, where * denotes the state of uncertainty. We then propose the algorithm ICF* to generate such generalized features. The selection process of ICF* is also different from that of ICF, in that features are selected so as to cover the entire training set. Our computational experiments indicate that ICF* is better than ICF in terms of both classification performance and computation time. Also, it is competitive with other representative learning algorithms such as decision trees and SVM.

The first refreshable anonymous token scheme proposed in [1] enables one to provide services in such a way that each of its users is allowed to enjoy only a fixed number of services at the same time. In this paper, we show that the scheme in [1] is insecure and propose a provably secure refreshable partial anonymous token scheme which is a generalization of the previous scheme. The new scheme has an additional ability to control the anonymity level of users. We also propose a formal model and security requirements of the new scheme.

In this letter, multi user detection process in Code Division Multiple Access (CDMA) is performed by fuzzy inference system (FIS) and the bit error rate (BER) performance was compared with the single user bound, the matched filter receiver and neural network receiver. The BER performance of the matched filter receiver degrades as the number of the active users and the power level differences among the users increase. The neural network receiver needs the training process. Optimal receiver that has the best BER performance is too complex for practical application. The BER performance near the optimal case was obtained with the proposed receiver. The proposed receiver uses the FIS without training process and it has lower time complexity than the optimal receiver.

Let H be a graph with a designated vertex s, where edges are weighted by nonnegative reals. Splitting edges e={u,s} and e'={s,v} at s is an operation that reduces the weight of each of e and e' by a real δ>0 while increasing the weight of edge {u,v} by δ. It is known that all edges incident to s can be split off while preserving the edge-connectivity of H and that such a complete splitting is used to solve many connectivity problems. In this paper, we give an O(mn+n2log n) time algorithm for finding a complete splitting in a graph with n vertices and m edges.

Recently with the high expectation of voice over WLAN service, to support fast inter-AP security transition in WLAN Access Point (AP) is one of the most actively investigating issues. It is also very important problem to minimize inter-AP security transition (IAPST) latency, while maintaining constantly the secure association from old AP when a station transits to new AP. With this background, this paper presents a novel association control mechanism whose objective pursues to minimize IAPST latency time and to take countermeasures against attacks of rogue transition station. Experiment shows that the proposed scheme outperforms the legacy AP over 70% with regard to the transition latency.

The perfect matched layer (PML) is formulated for the use in the constrained interpolation profile (CIP) method. Numerical results are presented to examine the performance of the proposed formulation of the PML in the case of two-dimensional TM wave. The results show that the proposed methods suppress the reflection effectively in comparison with the natural absorbing boundary condition of the CIP method. We have two methods to formulate the PML, and it is shown that the both methods have equal characteristics.

To perform a comparative study, we experimented on two differential epitaxial structures, the conventional metamorphic high-electron-mobility-transistor (MHEMT) using the InAlAs/InGaAs/InAlAs structure and the InP-composite-channel MHEMT adopting the InAlAs/InGaAs/InP structure. Compared with the conventional MHEMT, the InP-composite-channel MHEMT shows improved breakdown performance; more than approximately 3.8 V. This increased breakdown voltage can be explained by the lower impact ionization coefficient of the InP-composite-channel MHEMT than that of the conventional MHEMT. The InP-composite-channel MHEMT also shows improved Radio Frequency characteristics of S21 gain of approximately 4.35 dB at 50 GHz, and a cutoff frequency (fT) and a maximum frequency of oscillation (fmax) of approximately 124 GHz and 240 GHz, respectively, were obtained. These are due to decreases in go and gm.

This paper deals with graph colouring games, an example of pseudo-telepathy, in which two players can convince a verifier that a graph G is c-colourable where c is less than the chromatic number of the graph. They win the game if they convince the verifier. It is known that the players cannot win if they share only classical information, but they can win in some cases by sharing entanglement. The smallest known graph where the players win in the quantum setting, but not in the classical setting, was found by Galliard, Tapp and Wolf and has 32,768 vertices. It is a connected component of the Hadamard graph GN with N=c=16. Their protocol applies only to Hadamard graphs where N is a power of 2. We propose a protocol that applies to all Hadamard graphs. Combined with a result of Frankl, this shows that the players can win on any induced subgraph of G12 having 1609 vertices, with c=12. Moreover combined with a result of Godsil and Newman, our result shows that all Hadamard graphs GN (N ≥ 12) and c=N yield pseudo-telepathy games.