M-spotty byte error control codes are very effective for correcting/detecting errors in semiconductor memory systems that employ recent high-density RAM chips with wide I/O data (e.g., 8, 16, or 32 bits). In this case, the width of the I/O data is one byte. A spotty byte error is defined as random t-bit errors within a byte of length b bits, where 1 ≤ t ≤ b. Then, an error is called an m-spotty byte error if at least one spotty byte error is present in a byte. M-spotty byte error control codes are characterized by the m-spotty distance, which includes the Hamming distance as a special case for t = 1 or t = b. The MacWilliams identity provides the relationship between the weight distribution of a code and that of its dual code. The present paper presents the MacWilliams identity for the m-spotty weight enumerator of m-spotty byte error control codes. In addition, the present paper clarifies that the indicated identity includes the MacWilliams identity for the Hamming weight enumerator as a special case.

This letter investigates the space-time block codes from quasi-orthogonal design as a tradeoff between high transmission rate and low decoding complexity. By studying the role orthogonality plays in space-time block codes, upper bound of transmission rate and lower bound of decoding complexity for quasi-orthogonal design are claimed. From this point of view, novel algorithms are developed to construct specific quasi-orthogonal designs achieving these bounds.

This paper proposes closed form solutions to the L2-sensitivity minimization subject to L2-scaling constraints for second-order state-space digital filters with real poles. We consider two cases of second-order digital filters: distinct real poles and multiple real poles. The proposed approach reduces the constrained optimization problem to an unconstrained optimization problem by appropriate variable transformation. We can express the L2-sensitivity by a simple linear combination of exponential functions and formulate the L2-sensitivity minimization problem by a simple polynomial equation. As a result, L2-sensitivity is expressed in closed form, and its minimization subject to L2-scaling constraints is achieved without iterative calculations.

The number of threats on the Internet is rapidly increasing, and anomaly detection has become of increasing importance. High-speed backbone traffic is particularly degraded, but their analysis is a complicated task due to the amount of data, the lack of payload data, the asymmetric routing and the use of sampling techniques. Most anomaly detection schemes focus on the statistical properties of network traffic and highlight anomalous traffic through their singularities. In this paper, we concentrate on unusual traffic distributions, which are easily identifiable in temporal-spatial space (e.g., time/address or port). We present an anomaly detection method that uses a pattern recognition technique to identify anomalies in pictures representing traffic. The main advantage of this method is its ability to detect attacks involving mice flows. We evaluate the parameter set and the effectiveness of this approach by analyzing six years of Internet traffic collected from a trans-Pacific link. We show several examples of detected anomalies and compare our results with those of two other methods. The comparison indicates that the only anomalies detected by the pattern-recognition-based method are mainly malicious traffic with a few packets.

In this paper, we obtain some refinement of representation theorems for context-free languages by using Dyck languages, insertion systems, strictly locally testable languages, and morphisms. For instance, we improved the Chomsky-Schützenberger representation theorem and show that each context-free language L can be represented in the form L=h(D ∪ R), where D is a Dyck language, R is a strictly 3-testable language, and h is a morphism. A similar representation for context-free languages can be obtained, using insertion systems of weight (3,0) and strictly 4-testable languages.

This paper proposes an improved method of reversible data hiding with increased capacity. The conventional method determines whether to embed a data bit in an image block according to the statistics of pixels in that block. Some images have pixel statistics that are inadequate for data hiding, and seldom or never have data embedded in them. The proposed method modulates the statistics invertibility to overcome such disadvantages, and is also able to improve the quality of the image containing the hidden data using block-adaptive modulation. Simulationresults show the effectiveness of the proposed method.

Recently some attempts have been made in the literature to give simple proofs of Jury test for real polynomials. This letter presents a similar result for complex polynomials. A simple proof of Jury test for complex polynomials is provided based on the Rouche's Theorem and a single-parameter characterization of Schur stability property for complex polynomials.

In this paper, we address the following problems: Given a sequence A of n real numbers, and four parameters I,J,X and Y with I≤ J and X≤ Y, find the longest (or shortest) subsequence of A such that its length is between I and J and its sum is between X and Y. We present an online and an offline algorithm for the problems, both run in O(nlog n) time, which are optimal.

An L-2L through-line de-embedding method has been verified up to millimeter wave frequency. The parasitics of the pad can be modeled from the L-2L through-line. Measurement results of the transmission lines and transistors can be de-embedded by subtracting the parasitic matrix of the pad. Therefore, the de-embedding patterns, which is used for modeling active and passive devices, decrease greatly and the chip area also decreases. A one-stage amplifier is firstly implemented for helping verifying the de-embedding results. After that a four-stage 60 GHz amplifier has been fabricated in CMOS 65 nm process. Experimental results show that the four-stage amplifier realizes an input matching better than -10.5 dB and an output matching better than -13 dB at 61 GHz. A small signal power gain of 16.4 dB and a 1 dB output compression point of 4.6 dBm are obtained with a DC current consumption of 128 mA from a 1.2 V power supply. The chip size is 1.5 mm 0.85 mm.

We present our proposed designs of optical access architecture based on WDM technology toward new-generation networks for two types of topologies: Single-star (SS) and passive-double-star (PDS). We adopt the concept of WDM-direct which links multiple wavelengths to each optical network unit (ONU). Our proposed architecture based on WDM-direct can achieve more than 10 Gbps access per ONU. Moreover, our architecture can provide not only conventional bandwidth-shared services but also bandwidth-guaranteed services requiring more than 10 Gbps bandwidth by establishing end-to-end lightpaths directly to each ONU, and thus meet high requirements of QoS in new-generation networks. Firstly, we show our proposed designs of SS-type architecture, and experimentally demonstrate the system. We confirm that the optical line terminal (OLT) successfully switches between packet/lightpath data transmissions for each ONU. In addition, we measure and evaluate optical power loss in upstream/downstream transmissions between the OLT and ONUs. Secondly, we show our proposed designs of PDS-type architecture, and theoretically analyze and evaluate the bit-rate capacity of the system.

Recently, the marginalized particle filter (MPF) has been applied to blind symbol detection problems over selective fading channels. The MPF can ease the computational burden of the standard particle filter (PF) while offering better estimates compared with the standard PF. In this paper, we investigate the application of the blind MPF detector to more realistic situations where the systems suffer from analog imperfections which are non-linear signal distortion due to the inaccurate analog circuits in wireless devices. By reformulating the system model using the widely linear representation and employing the auxiliary variable resampling (AVR) technique for estimation of the imperfections, the blind MPF detector is successfully modified to cope with the analog imperfections. The effectiveness of the proposed MPF detector is demonstrated via computer simulations.

This paper proposes a voltage-to-current converter with nested feedback loop configuration to achieve high loop gain without reducing the bandwidth. Simulation results using 0.18-µm CMOS process parameters show that the proposed circuit has a good linearity performance. The simulated bandwidth is 350 MHz. The THD improvement of the proposed circuit is more than 60 dB compared to the one of a common gate circuit under a same total current consumption of 10.4 mA.

We propose an optical switch control procedure for the Active Optical Access System (AOAS). Optical switches are used in AOAS instead of optical splitters in PON. In the proposed procedure, an OLT determines the switching schedules of optical switches on OSW (Optical Switching Unit) which is installed between OLT and ONU, and informs the OSW of them with a switch control frame preceding of data frame transmission. Then the switch controller on OSW controls the optical switches based on the switching schedules. We developed the prototype systems of OSW, OLT, and ONU. We implemented the optical switch control function with logic circuits on the prototype systems. We demonstrate the proposed procedure works effectively with logic circuits. We also evaluate the 10 Gps optical signal transmission between OLT and ONU. We demonstrate the receiver sensibility on OLT and ONU achieves the distance of 40 km for optical signals transmission with FEC (Forward Error Correction). These receivers are applicable for both AOAS and 10G-EPON.

To detect the natural clusters for irregularly shaped data distribution is a difficult task in pattern recognition. In this study, we propose an efficient clustering algorithm for irregularly shaped clusters based on the advantages of spectral clustering and Affinity Propagation (AP) algorithm. We give a new similarity measure based on neighborhood dispersion analysis. The proposed algorithm is a simple but effective method. The experimental results on several data sets show that the algorithm can detect the natural clusters of input data sets, and the clustering results agree well with that of human judgment.

This paper proposes a topic-independent method for automatically scoring essay content. Unlike conventional topic-dependent methods, it predicts the human-assigned score of a given essay without training essays written to the same topic as the target essay. To achieve this, this paper introduces a new measure called MIDF that measures how important and relevant a word is in a given essay. The proposed method predicts the score relying on the distribution of MIDF. Surprisingly, experiments show that the proposed method achieves an accuracy of 0.848 and performs as well as or even better than conventional topic-dependent methods.

In this letter, we learned overcomplete filters to model rich priors of nature images. Our approach extends the Gaussian Scale Mixture Fields of Experts (GSM FOE), which is a fast approximate model based on Fields of Experts (FOE). In these previous image prior model, the overcomplete case is not considered because of the heavy computation. We introduce the assumption of quasi-orthogonality to the GSM FOE, which allows us to learn overcomplete filters of nature images fast and efficiently. Simulations show these obtained overcomplete filters have properties similar with those of Fields of Experts', and denoising experiments also show the superiority of our model.

A band-pass bilateral filter is an improved variant of a bilateral filter that does not have low-pass characteristics but has band-pass characteristics. Unfortunately, its computation time is relatively large since all pixels are subjected to Gaussian calculation. To solve this problem, we pay attention to a nonlinear filter called ε-filter and propose an advanced ε-filter labeled band-pass ε-filter. As ε-filter has low-pass characteristics due to spatial filtering, it does not enhance the image contrast. On the other hand, band-pass ε-filter does not have low-pass characteristics but has band-pass characteristics to enhance the image contrast around edges unlike ε-filter. The filter works not only as a noise reduction filter but also as an edge detection filter depending on the filter setting. Due to its simple design, the calculation cost is relatively small compared to the band-pass bilateral filter. To show the effectiveness of the proposed method, we report the results of some comparison experiments on the filter characteristics and computational cost.

Precoding techniques can be introduced into relay systems due to the similarity between relay systems and traditional multi-input-multi-output (MIMO) systems. A channel state information feedback scheme is firstly presented for the MIMO relay system in this letter, where the zero-forcing relaying protocol is proposed to be used so that the information of the equivalent channel and the relaying noise can be compressed into two coefficients. With the proposed feedback scheme, the distributed precoding is presented to be applied through two continuous transmitted vectors of the source node while the co-channel interference cancellation equalizer is used in the destination node. The system outage probability can be improved with the precoding in the source node. Furthermore, various spatial data rates can be conveniently supported by the proposed distributed spatial-temporal precoding method.

Partial plasma polymerization for coexistence of hydrophobic/hydrophilic area in several ten micrometer size is the typical technique for protein patterning. A hydrophobic hexamethyldisiloxane plasma-polymerized film (HMDS PPF) was deposited on a glass substrate and this surface was partially modified by subsequent nitrogen plasma treatment (hydrophilic surface, HMDS-N PPF) with a patterned shadow mask. An antibody protein (F(ab')2 fragment of anti-human immunoglobulin G) was selectively adsorbed onto the HMDS-N area and was not adsorbed onto the HMDS area. Distinct 8080 µm2 square spots surrounded by a non-protein adsorbed 80 µm-wide grid were observed. Then, when the protein modified by fullerene was used, the reversible patterning was obtained. This indicated that the modification by fullerene changed the hydrophilic nature of F(ab')2 protein to hydrophobic one, as a result, the modified protein was selectively adsorbed onto hydrophobic area.

A novel method to efficiently synthesize hardware from a large behavioral description in behavioral synthesis is proposed. For a program with functions executable in parallel, this proposed method determines a behavioral partitioning which simultaneously minimizes the overall datapath area and the complexity of the controller while maximizing performance of a synthesized circuit by fully exploiting function-level parallelism of a behavioral description. This method is formulated as an integer programming problem. Experimental results demonstrate that this method leads to a shift of the explorable design space so that superior solutions which could not be explored by earlier work are included, showing the effectiveness of our proposed method.