This report describes a new methodology for the optimal placement of decoupling capacitors on the printed circuit board (PCB). This method searches the optimal position of decoupling capacitor so that the impedance characteristics at the power supply is minimized in the specified frequency range. In this method, the PCB is modeled by the PEEC method to handle the 3-dimensional structures and Krylov-subspace technique is applied to obtain efficiently the impedance characteristics in the frequency domain.

In this paper, a discrete-time convergence theorem for continuous-state Hopfield networks with self-interaction neurons is proposed. This theorem differs from the previous work by Wang in that the original updating rule is maintained while the network is still guaranteed to monotonically decrease to a stable state. The relationship between the parameters in a typical class of energy functions is also investigated, and consequently a "guided trial-and-error" technique is proposed to determine the parameter values. The third problem discussed in this paper is the post-processing of outputs, which turns out to be rather important even though it never attracts enough attention. The effectiveness of all the theorems and post-processing methods proposed in this paper is demonstrated by a large number of computer simulations on the assignment problem and the N-queen problem of different sizes.

The number of computer break-ins from the outside of an organization has increased with the rapid growth of the Internet. Since many intruders from the outside of an organization employ stepping stones, it is difficult to trace back where the real origin of the attack is. Some research projects have proposed tracing methods for DoS attacks and detecting method of stepping stones. It is still difficult to locate the origin of an attack that uses stepping stones. We have developed IDA (Intrusion Detection Agent system), which has an intrusion tracing mechanism in a LAN environment. In this paper, we improve the tracing mechanism so that it can trace back stepping stones attack in the Internet. In our method, the information about tracing stepping stone is collected from hosts in a LAN effectively, and the information is made available at the public information server. A pursuer of stepping stone attack can trace back the intrusion based on the information available at the public information server on an intrusion route.

DANSE (Dynamically Adaptive Networking Service Environment) is a new architecture for adaptive network service systems. In this paper, a framework for context-aware service construction based on DANSE architecture is presented. In DANSE, any hardware, software, information, and services that are available on a network are treated as network resources. DANSE coordinates the construction of an end user's service based on the user's requests and situation or context (i.e., user's location, schedule, co-workers, etc.). To provide users with satisfactory services, it monitors user context continuously and searches for network resources that are convenient for a target user. Moreover, it detects changes in user context and invokes service construction if needed. If the desired service is not available, alternative services are automatically constructed. With those capabilities, DANSE enables ubiquitous provision of services any time, anywhere.

In content-based image retrieval (CBIR), the content of an image can be expressed in terms of different features such as color, texture, shape, or text annotations. Retrieval methods based on these features can be varied depending on how the feature values are combined. Many of the existing approaches assume linear relationships between different features, and also require users to assign weights to features for themselves. Other nonlinear approaches have mostly concentrated on indexing technique. While the linearly combining approach establishes the basis of CBIR, the usefulness of such systems is limited due to the lack of the capability to represent high-level concepts using low-level features and human perception subjectivity. In this paper, we introduce a Neural Network-based Image Retrieval (NNIR) system, a human-computer interaction approach to CBIR using the Radial Basis Function (RBF) network. The proposed approach allows the user to select an initial query image and incrementally search target images via relevance feedback. The experimental results show that the proposed approach has the superior retrieval performance over the existing linearly combining approach, the rank-based method, and the BackPropagation-based method.

Bidirectional reflection distribution functions (BRDFs) of commercially pure titanium sheets with three different kinds of surface morphology were measured. Those experimental BRDFs were analyzed by using Phong's reflection model. Topographic measurements of the specimens' surfaces were performed with using a stylus-method. An explicit microfacet model based on topographic data was proposed. With using the explicit microfacet model and geometrical optics the calculated BRDFs were obtained and then compared with the experimental BRDFs. Both of them were in a good agreement. Through this comparison physical meanings of Phong's reflection model were discussed. We concluded that with using the explicit microfacet model it will be possible to calculate the BRDF of the materials' surface in arbitrary illumination conditions and that this modeling will be useful to develop new aesthetic surface appearance in material industries, computer graphics, architectural design and surface science.

Reactive sputtering of a metallic target in DC planar magnetron discharge shows a drastic mode transition between metallic and oxide modes. To describe the experimental results quantitatively, a new reactive sputtering model including the secondary electron emission coefficient of a target has been developed. The model is based on a simple reactive gas balance model proposed by Berg et al., and can quantitatively describe experimental results such as the oxygen flow rate dependence of deposition rate and discharge, observed for MgO sputter-deposition.

In this paper, we present a new signal frequency estimation method based on the sinusoidal additive synthesis model. In the proposed method, frequencies in both the signal and noise are estimated with several delay times by using an expanded linear prediction (LP) method, and assuming that the signal is stationary and noise is unstationary in short record length. Frequencies in the signal are extracted according to their dependence on different delays. The frequency estimation can be accomplished with short record length even in the case where the number of frequency components in the signal is unknown. And it is capable of estimating the frequencies of a signal in the presence of noise. Furthermore, the proposed method estimates the parameters with less computation and high estimation accuracy. Simulation results are provided to confirm the effectiveness of the proposed method. The comparison of estimation accuracy between the proposed method and the analysis by synthesis (ABS) method is shown with the corresponding Cramer-Rao lower bound. And the frequency resolution of this method is also shown.

A distributed network management system (NMS) is urgently needed to manage large number of network managed objects (MOs) such as public network MOs. The ATM Forum has proposed the M4-interface to achieve just such a distributed NMS. However, the basis of the M4-interface is not adequate in terms of flexible distribution, because its main unit of distribution is location. To improve the granularity of the distribution, we have defined the route as a further unit of distribution. We also describe new MOs that provide for a distribution based on routes. A more detailed distribution is then possible than with a distribution purely based on location. In addition, we propose a new CMIP Action to move MOs from one sub-NMS (SubNMS) to another while the system is running. Using this Action, we can achieve a more flexible distribution in terms of network problems and load.

In this paper, we consider the subchannel detection problem in forward links for the multicarrier DS-CDMA system when some different subchannel allocation policies are used. An optimal subchannel decision algorithm is proposed based on the maximum-likelihood (ML) criterion. Theoretical analysis and simulation results are presented. Furthermore, we discuss the parameter selection problem on the length of the training sequences in the subchannel allocation scheme in [8],[12] by using the proposed ML detection algorithm. The results show that the subchannel allocation scheme in [8],[12] is feasible since only a few symbols overhead is required.

Reversible variable length codes (RVLCs), which make instantaneous decoding possible in both forward and backward directions, are exploited to code data stream in noisy enviroments. Because there is no redundancy in code words of RVLCs, RVLCs are suitable for very low bit-rate video coding. Golomb-Rice code, one of variable length code for infinite number of symbols, is widely used to encode exponentially distributed non-negative integers. We propose a reversible variable length code by modifying Golomb-Rice code, which is called parity check reversible Golomb-Rice code and abbreviated to P-RGR code. P-RGR code has the same code length distribution as GR code but can detect one-bit error in any arbitrary position of the code stream. The sets of P-RGR code words in both directions are identical so that they can be constructed by nearly the same algorithm. Furthermore, this paper also gives a general construction method for all instantaneously decodable RGR codes.

This paper presents a new framework for synthesizing look-up table (LUT) networks. Some of the existing LUT network synthesis methods are based on one or two functional (Boolean) decompositions. Our method also uses functional decompositions, but we try to use various decomposition methods, which include algebraic decompositions. Therefore, this method can be thought of as a general framework for synthesizing LUT networks by integrating various decomposition methods. We use a cost database file which is a unique characteristic in our method. We also present comparisons between our method and some well-known LUT network synthesis methods, and evaluate the final results after placement and routing. Although our method is rather heuristic in nature, the experimental results are encouraging.

In this paper we propose a MIN (Multistage Interconnection Network) whose performance in the faulty case degrades as gracefully as possible. We focus on a two-dilated baseline network as a sort of MIN. The link connection pattern in our MIN is determined so that all the available paths established between an input terminal and an output terminal via an identical input of a SE (Switching Element) in some stage will never pass through an identical SE in the next stage. Extra links are useful in improving the performance of the MIN and do not complicate the routing scheme. There is no difference between our MIN and others constructed from a baseline network with regard to numbers of links and cross points in all SEs. The theoretical computation and simulation-based study show that our MIN is superior to others in performance, especially in robustness against concentrated SE faults in an identical stage.

This paper describes a new architecture-based microprocessor, a dynamically programmable parallel processor (DPPP), that consists of large numbers of simplified ALUs (sALU) as processing blocks. All sALUs are interconnected via a code division multiple-access bus interface that provides complete routing flexibility by establishing connections virtually through code-matching instead of physical wires. This feature is utilized further to achieve high parallelism and fault tolerance. High fault tolerance is realized without the limitations of conventional fabrication-based techniques nor providing spare elements. Another feature of the DPPP is its simple programmability, as it can be configured by compiling numerical formula input using the provided user auto-program interface. A prototype chip based on the proposed architecture has been implemented on a 4.5 mm 4.5 mm chip using 0.6 µm CMOS process.

The optical structure of a conventional backlight illumination system used for transmissive LCD of a mobile terminal is investigated. A structured LGP based on the total internal reflection is designed and fabricated. The LGP is characterized by optical micro-deflectors (MD) and micro-reflectors (MR). The guided light inside the LGP is reflected on the MR elements and directed toward the MD elements. The coming light ray is refracted on the MD element and as a result the ray is deflected on the LGP. The emergent light on the LGP has a wide zenith angle due to the LGP surface normal. A prism sheet whose function is based on the total internal reflection is set on the LGP. The emanated light from the LGP is reflected on the surface of the prism structure and redirected toward the surface normal. The illumination cone of the novel backlight is limited to horizontal range of 17 degrees and vertical range of 11 degrees. The illumination cone on the novel structure can be shaped by optical designs of the MD and MR elements. The peak brightness on the novel backlight structure is 1.44 times that of the conventional one. In this backlight structure, only one TIR prism sheet is used and a thickness reduction of about 250 µm is achieved.

Today software piracy is a major concern to electronic commerce since a digitized product such as software is vulnerable to redistribution and unauthorized use. This paper presents an enhanced electronic software distribution and software protection model. Authentication scheme of the proposed model is based on zero-knowledge (ZK) proof which requires limited computation. The proposed model considers post installation security using authentication agent. It prevents software piracy and illegal copy. It also provides secure and efficient software live-update mechanism based on traitor tracing scheme. Even if software or personal key is copied illegally, a merchant can trace back to its original owner from the electronic license and personal key. The proposed model provides security and reasonable performance and safety.

Our aim is to develop an intuitive and effective sound retrieval method for non-expert users. Such a retrieval method should be developed to accommodate a human's perceptual features. We therefore first conducted an experiment to clarify how people represent sound. A participant listens to one sound stimulus and then conveys the sound to a partner. The results indicated that people used mostly verbal description categorized in three groups: the sound itself, the sound's situation, and the sound's impression. Based on these results, we propose three types of keywords: onomatopoeia, sound source, and adjective, which are typical keywords of the above three groups of sound description, for sound retrieval. This retrieval method was implemented for a sound database. Our method can increase the varieties of sounds able to be retrieved and allow users to intuitively search sounds because users can retrieve sounds by using keywords that are most natural to them.

An advanced spare-connection scheme for K-out-of-N redundancy is proposed for constructing fault-tolerant ring- or toroidal mesh-connected processing-node arrays able to enhance emulation of binary hypercubes by using bypass networks. With this scheme, a component redundancy configuration for a base array with a fixed number of primary nodes, such as that for 8-node ring or 32-node toroidal mesh, can be constructed by using bypass links with a segmented bus structure to selectively connect the primary nodes to a spare node in parallel. These bypass links are allocated to the primary nodes by graph-node coloring with a minimum inter-node distance of three in order to use the bypass links as the hypercube connections as well as to attain strong fault tolerance for reconfiguring the base array with the primary network topology. An extended redundancy configuration for a large fault-tolerant array can be constructed by connecting the component configurations by using external switches of a hub type provided at the bus nodes of the bypass links. This configuration has a network topology of the parallel star-connections of sub-hypercubes whose diameter is smaller than that of the regular hypercube.

A VLIW (Very Long Instruction Word) architecture with a new code compaction method has been proposed. For a 3D-geometry processor, we consider two types of 2-issue VLIW architectures, the floating-point execution accelerating VLIW (FP-VLIW) and the data-move enhancing VLIW (MV-VLIW) architectures, as expansions of a Single-Streaming Single Instruction, Multiple Data (SS-SIMD) architecture. To solve the code bloat problem which is common to VLIW architectures, the proposed method makes it possible to compact original codes into the VLIW codes by software tools and decompact the VLIW codes by a simple hardware decompactor composed of an instruction swap circuit on a chip. Speeds and code densities of the two VLIWs with the code compaction are compared to the SS-SIMD with the same instruction set and the same building blocks. The FP-VLIW shows the fastest speed performance in the evaluation results of the viewperf CDRS-03 benchmark programs. It is 36% faster than the SS-SIMD used as reference. The proposed compaction method keeps the 95% code density of the SS-SIMD. One test program shows that the code density of the MV-VLIW is higher than that of the SS-SIMD. This result demonstrates that the merit of compacting nops can be greater than the VLIW penalty. The FP-VLIW architecture with the code compaction achieves 1.36 times the speed performance without significant code-density deterioration.

A multiport representation of the step junction of two circular dielectric waveguides of different size is given. Continuous spectral modes of the circular dielectric waveguide are discretized at a terminal plane by means of expressing their mode amplitudes in the form of infinite series of orthonormal Gaussian Laguerre function. Applying the mode matching technique, a multiport representation of the step junction is derived. Numerical examples are given where the results are tested for the conservation of power. Also the numerical results are compared with those from Marcuse's approximate methods.