Although software-attack detection via dynamic taint analysis (DTA) supports high coverage of program execution, it prohibitively degrades the performance of the monitored program. This letter explores the possibility of collaborative dynamic taint analysis among members of an application community (AC): instead of full monitoring for every request at every instance of the AC, each member uses DTA for some fraction of the incoming requests, thereby loosening the burden of heavyweight monitoring. Our experimental results using a test AC based on the Apache web server show that speedy detection of worm outbreaks is feasible with application communities of medium size (i.e., 250-500).

By use of the shadow theory developed recently, this paper deals with the transverse electric (TE) wave diffraction by a perfectly conductive periodic array of rectangular grooves. A set of equations for scattering factors and mode factors are derived and solved numerically. In terms of the scattering factors, diffraction amplitudes and diffraction efficiencies are calculated and shown in figures. It is demonstrated that diffraction efficiencies become discontinuous at an incident wave number where the incident wave is switched from a propagating wave to an evanescent one, whereas scattering factors and diffraction amplitudes are continuous even at such an incident wave number.

This paper proposes a scan design for delay fault testability of dual circuits. In normal operation mode, each proposed scan flip flop operates as a master-slave flip flop. In test mode, the proposed scan design performs scan operation using two scan paths, namely master scan path and slave scan path. The master scan path consists of master latches and the slave scan path consists of slave latches. In the proposed scan design, arbitrary two-patterns can be set to flip flops of dual circuits. Therefore, it achieves complete fault coverage for robust and non-robust testable delay fault testing. It requires no extra latch unlike enhanced scan design. Thus the area overhead is low. The evaluation shows the test application time of the proposed scan design is 58.0% of that of the enhanced scan design, and the area overhead of the proposed scan design is 13.0% lower than that of the enhanced scan design. In addition, in testing of single circuits, it achieves complete fault coverage of robust and non-robust testable delay fault testing. It requires smaller test data volume than the enhanced scan design in testing of single circuits.

MPLS-based path technology shows promise as a means of realizing reliable IP networks. Real-time services such as VoIP and video-conference supplied through a multi-domain MPLS network must be able to guarantee end-to-end QoS of the inter-domain paths. Thus, it is important to allocate an appropriate QoS class to the inter-domain paths in each domain traversed by the inter-domain paths. Because each domain has its own policy for QoS class allocation, it is necessary to adaptively allocate the optimum QoS class based on estimation of the QoS class allocation policies in other domains. This paper proposes two kinds of adaptive QoS class allocation schemes, assuming that the arriving inter-domain path requests include the number of downstream domains traversed by the inter-domain paths and the remaining QoS value toward the destination nodes. First, a measurement-based scheme, based on measurement of the loss rates of inter-domain paths in the downstream domains, is proposed. This scheme estimates the QoS class allocation policies in the downstream domains, using the measured loss rates of path requests. Second, a state-dependent type scheme, based on measurement of the arrival rates of path requests in addition to the loss rates of paths in the downstream domains, is also proposed. This scheme allows an appropriate QoS class to be allocated according to the domain state. This paper proposes an application of the Markov decision theory to the modeling of state-dependent type scheme. The performances of the proposed schemes are evaluated and compared with those of the other less complicated non-adaptive schemes using a computer simulation. The results of the comparison reveal that the proposed schemes can adaptively increase the number of inter-domain paths accommodated in the considered domain, even when the QoS class allocation policies change in the other domains and the arrival pattern of path requests varies in the considered domain.

We deal with LTI nonminimum phase (NMP) systems which are difficult to control with conventional methods because of their inherent characteristics of undershoot. In such systems, reducing the undesirable undershoot phenomenon makes the response time of the systems much longer. Moreover, it is impossible to control the magnitude of undershoot in a direct way and to predict the response time. In this paper, we propose a novel two sliding mode control scheme which is capable of stably determining the magnitude of undershoot and thus the response time of NMP systems a priori. To do this, we introduce two sliding lines which are in charge of control in turn. One is used to stabilize the system and achieve asymptotic regulation eventually like the conventional sliding mode methods and the other to stably control the magnitude of undershoot from the beginning of control until the state meets the first sliding line. This control scheme will be proved to have an asymptotic regulation property. The computer simulation shows that the proposed control scheme is very effective and suitable for controlling the NMP systems compared with the conventional ones.

A method is proposed for estimating code and carrier phase parameters of GNSS reflected signals in low SNR (signal-to-noise ratio) environments. Simulation results show that the multipath impact on code and carrier with 0.022 C/A chips delay can be estimated in 0 dB SNR in the condition of 46 MHz sampling rate.

In 2006, Tanaka has proposed an efficient variant of Maurer-Yacobi's identity-based non-interactive key sharing scheme. In Tanaka's scheme, the computational complexity to generate each user's secret information is much smaller than that of Maurer-Yacobi's scheme. Tanaka's original key sharing scheme does not provide completeness, and so Tanaka has corrected the original scheme to provide completeness. In this paper, we show that Tanaka's corrected key sharing scheme is not secure against collusion attacks. That is, two users can collaborate to factorize a system modulus with their secret information and thus break the key sharing scheme.

This letter proposes a mismatch insensitive switched-capacitor multiply-by-four (4X) amplifier using the voltage addition scheme. The proposed circuit provides 2-times faster speed and about half of silicon area when compared with the cascade of conventional 2X amplifiers. Monte-Carlo simulation results show about 15% gain accuracy improvement over the cascaded 2X- amplifiers.

This paper proposes an efficient self-organizing map algorithm based on reference point and filters. A strategy called Reference Point SOM (RPSOM) is proposed to improve SOM execution time by means of filtering with two thresholds T1 and T2. We use one threshold, T1, to define the search boundary parameter used to search for the Best-Matching Unit (BMU) with respect to input vectors. The other threshold, T2, is used as the search boundary within which the BMU finds its neighbors. The proposed algorithm reduces the time complexity from O(n2) to O(n) in finding the initial neurons as compared to the algorithm proposed by Su et al. [16] . The RPSOM dramatically reduces the time complexity, especially in the computation of large data set. From the experimental results, we find that it is better to construct a good initial map and then to use the unsupervised learning to make small subsequent adjustments.

As the multimedia contents market continues its rapid expansion, the amount of image contents used in mobile phone services, digital libraries, and catalog service is increasing remarkably. In spite of this rapid growth, users experience high levels of frustration when searching for the desired image. Even though new images are profitable to the service providers, traditional collaborative filtering methods cannot recommend them. To solve this problem, in this paper, we propose feature-based collaborative filtering (FBCF) method to reflect the user's most recent preference by representing his purchase sequence in the visual feature space. The proposed approach represents the images that have been purchased in the past as the feature clusters in the multi-dimensional feature space and then selects neighbors by using an inter-cluster distance function between their feature clusters. Various experiments using real image data demonstrate that the proposed approach provides a higher quality recommendation and better performance than do typical collaborative filtering and content-based filtering techniques.

We propose an asymmetric fragile watermarking technique that uses a number theoretic transform (NTT). Signature data is extracted from a watermarked image by determining correlation functions that are computed using the NTT. The effectiveness of the proposed method is evaluated by simulated detection of altering.

In this paper, we present a recently developed pattern search method called Genetic Pattern Search algorithm (GPSA) for the global optimization of cost function subject to simple bounds. GPSA is a combined global optimization method using genetic algorithm (GA) and Digital Pattern Search (DPS) method, which has the digital structure represented by binary strings and guarantees convergence to stationary points from arbitrary starting points. The performance of GPSA is validated through extensive numerical experiments on a number of well known functions and on robot walking application. The optimization results confirm that GPSA is a robust and efficient global optimization method.

As a method to realize a high-speed communication in the home network, the power-line communication (PLC) technique is known. A problem of PLC is that leakage radiation interferes with existing systems. When OFDM is used in a PLC system, the leakage radiation is not sufficiently reduced, even if the subcarriers corresponding to the frequency-band of the existing system are never used, because the signal is not strictly band-limited. To solve this problem, each subcarrier must be band-limited. In this paper, we apply the OQAM based multi-carrier transmission (OQAM-MCT) to a high-speed PLC system, where each subcarrier is individually band-limited. We also propose a pilot-symbol sequence suitable for frequency offset estimation, symbol-timing detection and channel estimation in the OQAM-MCT system. In this method, the pilot signal-sequence consists of a repeated series of the same data symbol. With this method, the pilot sequence approximately becomes equivalent to OFDM sequence and therefore existing pilot-assisted methods for OFDM are also applicable to OQAM-MCT system. Computer simulation results show that the OQAM-MCT system achieves both good transmission rate performance and low out-of-band radiation in PLC channels. It is also shown that the proposed pilot-sequence improves frequency offset estimation, symbol-timing detection and channel estimation performance as compared with the case of using pseudo-noise sequence.

Leakage current for MOSFET in off-state is one of the serious problems in charge-based analog circuits under low power supply. To suppress the leakage current, a method that a slight voltage is applied to source to accomplish reverse bias between source and bulk is proposed. The proposed bias condition, also other bias conditions, is analyzed by injection carrier density in p-n junction and surface carrier concentration in MOS diode in four-terminal MOSFET. Leakage current is modeled by combining the characteristics of p-n junction with MOS diode in MOSFET. The characteristics of MOSFET fabricated with a standard 0.18 µm n-well CMOS technology are measured to investigate the basic principle. Measured leakage current fits to the theoretical leakage current exactly. The proposed slight bias to source terminal in MOSFET is proved most efficient to reduce the leakage current. Based on the proposed source bias condition, MOSFET switches with low leakage current under a single power supply are proposed.

Trust negotiation is an authorizing technique based on digital credentials, in which both a user and a server gradually establish trust in each other by repeatedly exchanging their credentials. A trust negotiation strategy is a function that answers a set of credentials to disclose to the other party, depending on policies and the set of already disclosed credentials. The disclosure tree strategy (DTS), proposed by Yu et al., is one of the strategies that satisfies preferable properties. DTS in a simple implementation requires exponential time and space; however, neither an efficient algorithm nor the lower-bound of its complexity was known. In this paper, we investigate the computational complexity of DTS. We formulate subproblems of DTS as problems on derivation trees of a context-free grammar (CFG), and analyze the computational complexity of the subproblems using the concepts of CFGs. As a result, we show that two subproblems EVL and MSET of DTS are NP-complete and NP-hard, respectively, while both are solvable in polynomial time if we modify EVL not to require non-redundancy and MSET not to answer any subset useless for leading the negotiation to success.

Scalability is one of the most important requirements for secure multicast in a multi-group environment. In this study, we propose a decentralized multi-group key management scheme that allows each multicast group sender to control the access to its group communication independently. Scalability is enhanced by local rekeying and inter-working among different subgroups. The group key secrecy and backward/forward secrecy are also guaranteed.

In this paper, the multi-user multiple-input multiple-output (MU-MIMO) relay channel is investigated, where the source node provides multi-beams to multi-users via a multi-antenna relay node. In this scenario, linear processing matrix at the relay node is designed around block diagonal (BD) scheme to improve the system sum-rate. Compared with the traditional linear processing matrix with zero-forcing (ZF) scheme at the relay node, the proposed matrix based on BD scheme can not only eliminate the multi-user interference to the same extent as the ZF scheme, but also realize optimal power allocation at the relay node. Numerical simulations demonstrate the BD scheme outperforms the ZF scheme and can significantly improve the sum-rate performance.

A graph is an interval graph if and only if each vertex in the graph can be associated with an interval on the real line such that any two vertices are adjacent in the graph exactly when the corresponding intervals have a nonempty intersection. A number of interesting applications for interval graphs have been found in the literature. In order to find structural features common to structural data which can be represented by intervals, this paper proposes new interval graph structured patterns, called linear interval graph patterns, and a polynomial time algorithm for finding a minimally generalized linear interval graph pattern explaining a given finite set of interval graphs.

When a store sells items to customers, the store wishes to determine the prices of the items to maximize its profit. Intuitively, if the store sells the items with low (resp. high) prices, the customers buy more (resp. less) items, which provides less profit to the store. So it would be hard for the store to decide the prices of items. Assume that the store has a set V of n items and there is a set E of m customers who wish to buy those items, and also assume that each item i ∈ V has the production cost di and each customer ej ∈ E has the valuation vj on the bundle ej ⊆ V of items. When the store sells an item i ∈ V at the price ri, the profit for the item i is pi=ri-di. The goal of the store is to decide the price of each item to maximize its total profit. We refer to this maximization problem as the item pricing problem. In most of the previous works, the item pricing problem was considered under the assumption that pi ≥ 0 for each i ∈ V, however, Balcan, et al. [In Proc. of WINE, LNCS 4858, 2007] introduced the notion of "loss-leader," and showed that the seller can get more total profit in the case that pi < 0 is allowed than in the case that pi < 0 is not allowed. In this paper, we derive approximation preserving reductions among several item pricing problems and show that all of them have algorithms with good approximation ratio.

Fuzzy inference has played a significant role in many applications. Although the simplified fuzzy inference method is currently mostly used, the problem is that the number of fuzzy rules becomes very huge and so the setup and adjustment of fuzzy rules become difficult. On the other hand, Yubazaki et al. have proposed a "single input rule modules connected fuzzy inference method" (SIRMs method) whose final output is obtained by summarizing the product of the importance degrees and the inference results from single input fuzzy rule module. Seki et al. have shown that the simplified fuzzy inference method and the SIRMs method are equivalent when the sum of diagonal elements in rules of the simplified fuzzy inference method is equal to that of cross diagonal elements. This paper clarifies the conditions for the infimum and supremum of the fuzzy inference method using the single input type fuzzy inference method, from the view point of fuzzy inference.