The quality of codebook is very important in visual image classification. In order to boost the classification performance, a scheme of codebook generation for scene image recognition based on parallel key SIFT analysis (PKSA) is presented in this paper. The method iteratively applies classical k-means clustering algorithm and similarity analysis to evaluate key SIFT descriptors (KSDs) from the input images, and generates the codebook by a relaxed k-means algorithm according to the set of KSDs. With the purpose of evaluating the performance of the PKSA scheme, the image feature vector is calculated by sparse code with Spatial Pyramid Matching (ScSPM) after the codebook is constructed. The PKSA-based ScSPM method is tested and compared on three public scene image datasets. The experimental results show the proposed scheme of PKSA can significantly save computational time and enhance categorization rate.

Electroencephalography (EEG) and magnetoencephalography (MEG) measure the brain signal from spatially-distributed electrodes. In order to detect event-related synchronization and desynchronization (ERS/ERD), which are utilized for brain-computer/machine interfaces (BCI/BMI), spatial filtering techniques are often used. Common spatial potential (CSP) filtering and its extensions which are the spatial filtering methods have been widely used for BCIs. CSP transforms brain signals that have a spatial and temporal index into vectors via a covariance representation. However, the variance-covariance structure is essentially different from the vector space, and not all the information can be transformed into an element of the vector structure. Grassmannian embedding methods, therefore, have been proposed to utilize the variance-covariance structure of variational patterns. In this paper, we propose a metric learning method to classify the brain signal utilizing the covariance structure. We embed the brain signal in the extended Grassmann manifold, and classify it on the manifold using the proposed metric. Due to this embedding, the pattern structure is fully utilized for the classification. We conducted an experiment using an open benchmark dataset and found that the proposed method exhibited a better performance than CSP and its extensions.

Sequence diagrams are often used in the modular design of softwares. In this paper, we propose a method to verify correctness of sequence diagrams. With this method, using the process algebra CSP, concurrent systems can be synthesized from a number of sequence diagrams. We define new CSP operators for the synthesis of sequence diagrams. We also report on a tool implementing our synthesis method and demonstrate how the tool analyzes sequence diagrams.

A method for flexibly allocating and reallocating optical access network (OAN) resources, including fibers and equipment, using the constraint satisfaction problem (CSP) is described. OAN resource allocation during service delivery provisioning involves various input conditions and allocation sequences, so an OAN resource allocation method has to support various workflow patterns. Furthermore, exception processing, such as reallocating OAN resources once they are allocated, is inevitable, especially during the spread of service using optical fiber and during the deployment of an optical access network. However, it is almost impossible to describe all workflow patterns including exception processes. Improving the efficiency of these exception processes, as well as that of the typical processes, is important for reducing the service delivery time. Describing all these patterns and process flows increases development cost. The CSP can be used to search for solutions without having to fix the process sequence and input conditions beforehand. We have formulated the conditions for OAN resource allocation and reallocation as a CSP. Use of this method makes it possible to handle various allocation workflow patterns including exception processes. Evaluation of the solution search time demonstrated its feasibility.

This paper describes a new talker direction estimation method for front-end processing to capture distant-talking speech by using a microphone array. The proposed method consists of two algorithms: One is a TDOA (Time Delay Of Arrival) estimation algorithm based on a weighted CSP (Cross-power Spectrum Phase) analysis with an average speech spectrum and CSP coefficient subtraction. The other is a talker direction estimation algorithm based on ML (Maximum Likelihood) estimation in a time sequence of the estimated TDOAs. To evaluate the effectiveness of the proposed method, talker direction estimation experiments were carried out in an actual office room. The results confirmed that the talker direction estimation performance of the proposed method is superior to that of the conventional methods in both diffused- and directional-noise environments.

Authentication server based security protocols are mainly used for enhancing security of wireless networks. In this paper, we specify RADIUS security protocol in wireless networks with Casper and CSP, and then verify their security properties such as secrecy and authentication using FDR. We also show that RADIUS protocol is vulnerable to the man-in-the-middle attack. In addition, we discuss its security weakness and potential countermeasures related with RADIUS. Finally, we fix it and propose a modified RADIUS protocol against the man-in-the-middle attack.

The Public Key Infrastructure (PKI) technology is very important to support the electronic commerce and digital communications on existing networks. The Online Certificate Status Protocol (OCSP) is the standard protocol for retrieving certificate revocation information in the PKI. To minimize the damages caused by OCSP responder's private key exposure, a distributed OCSP composed of multiple responders is needed. This paper presents a new distributed OCSP with a single public key by using key-insulated signature scheme. In proposed distributed OCSP, each responder has the different private key, but corresponding public key remains fixed. Therefore the user simply obtains and stores one certificate, and can verify any responses by using a single public key.

The Transduction Method is a powerful way to design logic circuits, utilizing already existing circuits. A set of permissible functions (SPF) plays an essential role in such circuit transformation/reduction, and is computed at each point (connection or gate output). Currently, two types of SPFs have been used: the maximum SPFs (MSPFs) and compatible SPFs (CSPFs). At each point, the MSPF is literally the set of all PF's, and CSPF is a subset of the MSPF. When CSPFs are calculated, priorities are first assigned to all gates in the circuit. Based on the priorities, it is decided which subset is to be selected as the CSPF. The quality of the results depends on the priorities. In this paper, the concept of super-sets of permissible functions (SSPFs) is introduced to reduce the effect of the priorities that CSPFs depend on. In order to loosen the dependency, each SSPF is computed to contain CSPFs which are candidates to be selected. The experimental results show that the SSPF-based Transduction Method has intermediate reduction capability and takes an intermediate computation time between the MSPF-based and CSPF-based ones. The capability and the time are considered as an acceptably good trade-off. In addition, without any transformations, since SSPFs are the maximum super-set, SSPFs are applicable for analyzing the maximum performance of the CSPF-based transformation, for comparison with the MSPF-based one. Theoretically, the number of connectable gate pairs detected by the MSPFs is 100%. According to the experimental results obtained using SSPFs, on average, 99% are detectable by SSPFs and 1% are detectable only by using the MSPFs. The results show that by using CSPFs, 72% of connectable gate pairs are detectable with any priority assignment and 99% (SSPFs capability) are detectable on average even when the best priorities are assigned. According to the experimental results of CSPF calculation with five priorities, 82% to 93% are practically detectable on average. This is the first quantitative analysis realized by SSPFs which compares the CSPF-based and MSPF-based Transduction Methods with respect to the coverage of PF's.

We developed a new millimeter-wave plastic chip size package (CSP) to operate up to 100 GHz by using a thin-film substrate. It has a flip-chip distributed amplifier with inverted microstrip lines and the amplifier has a bandwidth of beyond 110 GHz. The transmission line on the substrate consists of grounded coplanar waveguides that yield low insertion loss and high isolation characteristics in coupled lines even in mold resin in comparison with conventional microstrip lines. The CSP amplifier achieved a gain of 7.8 dB, a 3-dB bandwidth of 97 GHz, and operated up to 100 GHz. To the best of our knowledge, this value is the highest operating frequency reported to date for a distributed amplifier sealed in a plastic CSP. We also investigated the transmission characteristics of lead-free solder bumps through experiments by assemblying CSPs on printed circuit boards and modeling them so that we could design the packages accurately.

The packaging hierarchy is not fixed structure. It can be changed depending on the packaging technology itself, and the number of hierarchy levels tends to decrease. In LSI-package technology including package-to-board interconnections, there were two evolutionary changes. The first evolution was from PTH to SMT, and the second evolution was from "Peripheral connections" to "Area-array connections. " These evolutions have been caused by ICs integration and application products requirements. Now, the third evolution appears to be in progress, which is from SCP to MCP or SIP. Although SoC has many remarkable features, it has been not applied for many systems contrary to expectations, and its limitations or issues have become clear. SIP is the answer for above SoC's issues. MCP can be considered to be primitive SIP. The purpose of MCP is making up the technology gap between SMT and SoC to address the issues. The targets of SIP are mainly the next two items. (1) Overcoming the interconnection crisis of SoC. (2) Opening new application fields in electronics. In order to achieve those targets, several consortiums in the world are doing research and developing core technologies.

The three-dimensional chip-stacked CSP, which started with a flash/SRAM combination memory for cellular phones, was the forerunner from which 3D system packages realize full-scale capability. In the future, 3D package technology will act as a savior in achieving greater shrink of silicon processes--whose limits have come into sight. As SIP, it will surpass SOC, and, as the core technology of electronic equipment for our high-speed digital network society, it is expected to lead the way into the first period of the 21st century. Today, we are seeing the signs of this transition.