This paper proposes a novel one-way hash function that can serve as a tool in achieving authenticity and data integrity. The one-way hash function can be viewed as a representative of a family of fast dedicated one-way hash functions whose construction is based on linear cellular automata over GF(a). The design and analysis of security of the function is accomplished by the use of very recently published results on cellular automata and their applications in cryptography. The analysis indicates that the one-way hash function is secure against all known attacks. A promising property of the proposed one-way hash function is that it is especially suitable for compact and fast implementation.

This paper proposes the first provably secure multi-signature schemes under the random oracle model. The security of our schemes can be proven in the sense of concrete security in Ref. [13]. The proposed schemes are efficient if the random oracle is replaced by practical hash functions. The essential techniques in our proof of security are the optimal reduction from breaking the corresponding identification to breaking signatures (ID Reduction Technique), and the hierarchical heavy row lemmas used in the concrete reduction from solving the primitive problem to breaking the identification scheme.

This paper proposes two numerical methods to solve the optimal problem of contrast enhancement in the cross-pol and co-pol channels. For the cross-pol channel case, the contrast (power ratio) is expressed in a homogeneous form, which leads the polarimetric contrast optimization to a distinctive eigenvalue problem. For the co-pol channel case, this paper proposes a cross iterative method for optimization, based on the formula used in the matched-pol channel. Both these numerical methods can be proved as convergent algorithms, and they are effective for obtaining the optimum polarization state. Besides, one of the proposed methods is applied to solve the optimal problem of contrast enhancement for the time-independent targets case. To verify the proposed methods, this paper provides two numerical examples. The results of calculation are completely identical with other authors', showing the validity of the proposed methods.

In this paper, we propose two methods of digital watermark for image signals based on the wavelet transform. We classify wavelet coefficients as insignificant or significant by using zerotree which is defined in the embedded zerotree wavelet (EZW) algorithm . In the first method, information data are embedded as watermark in the location of insignificant coefficients. In the second method, information data can be embedded by thresholding and modifying significant coefficients at the coarser scales in perceptually important spectral components of image signals. Information data are detected by using the position of zerotree's root and the threshold value after the wavelet decomposition of an image in which data hide. It is shown from the numerical experiments that the proposed methods can extract the watermark from images that have degraded through several common signal and geometric processing procedures.

In this paper, we present a priority scheduling algorithm at ATM switches with multi-class output buffers in which the service rate of each class buffer is dynamically adjusted. The service rate is computed periodically by a control scheme. We derive the design formulas of the control scheme to ensure that each class buffer occupancy converges to its desired operating point related to QoS requirement. Moreover, through dynamic service rate control in the proposed scheduling algorithm, the available channel capacity can be estimated exactly. It may be used for rate control of ABR traffic and call admission control of the other real-time traffic (CBR, VBR, etc. ).

We present a receiver structure with joint blind equalization, carrier recovery, and timing recovery. The blind equalizer employs a decomposition transversal filtering technique which can reduce the complexity of convolution to about a half. We analyze the performance surface of the equalizer cost function and show that the global minima correspond to perfect equalization. We also derive proper initial tap settings of the equalizer for convergence to the global minima. We describe the timing recovery and the carrier recovery methods employed. And we describe a startup sequence to bring the receiver into full operation. The adaptation algorithms for equalization, carrier recovery, and timing recovery are relatively independent, resulting in good operational stability of the overall receiver. Some simulation results for cable-modem type of transmission are presented.

Detecting security flaws is important in order to keep the database secure. A security flaw in object-oriented databases means that a user can infer the result of an unpermitted method only from permitted methods. Although a database management system enforces access control by an authorization, security flaws can occur under the authorization. The main aim of this paper is to show an efficient decision algorithm for detecting a security flaw under a given authorization. This problem is solvable in polynomial time in practical cases by reducing it to the congruence closure problem. This paper also mentions the problem of finding a maximal subset of a given authorization under which no security flaw exists.

We consider an algorithm for finding all solutions in order to clarify all the stable equilibrium points of a hysteresis neural network. The algorithm includes sign test, linear programming test and a novel subroutine that divides the solution domain efficiently. Using the hysteresis network, we synthesize an associative memory whose cross connection parameters are trinalized. Applying the algorithm to the case where 10 desired memories are stored into 77 cells network, we have clarified all the solutions. Especially, we have confirmed that no spurious memory exists as the trinalization is suitable.

This letter addresses how to set SIR targets higher than normally required, in order to mitigate the effect of signal-to-interference ratio (SIR) measurement error included in power control steps. We find that scaling up the SIR targets by 1 dB is conformable to resisting SIR measurement error for code division multiple access (CDMA) mobile systems.

Extremely small aperture radial line slot antennas (RLSAs) are analyzed by method of moments. At first, the analysis model of cylindrical waveguide in terms of rectangular cavity modes is confirmed for a RLSA with a spiral slot arrangement. The overall VSWR as well as rotational symmetry of the actual structure of RLSAs is predicted for the first time and is confirmed experimentally. Secondly, the minimum diameter of the concentric array RLSA is estimated for which the conventional analysis model of a rectangular waveguide is valid for the design of matching slot pairs at the shorted periphery of the radial waveguide. It is found that the curvature and cylindrical short wall at aperture periphery must be considered in the design and analysis of small RLSAs with the gain lower than about 25 dBi.

This paper proposes a new framework of managing virtual spaces based on spatial databases as an extension of VRML-based systems. The framework is suitable for treating continuous virtual spaces and for managing the quality of service (QoS) of the virtual spaces depending on user's operations and situations of computer resources. Levels of detail (LoD) of 3D objects is the most important rule for rendering scenes dynamically while managing the QoS. This paper describes a method of managing the QoS depending on the LoD in the form of spatial queries. An advantage of the framework is that spatial databases can incrementally construct virtual spaces in clients using differential descriptions based on VRML, that is, DVRML, proposed in this paper. Dynamic spatial data such as avatar's movement and real-time multimedia data such as videos should be shared by all participants in a virtual space in real time. Our framework can also handle dynamic spatial data by means of real-time updating of some spatial objects in spatial databases as well as static spatial data. We developed some experimental applications based on the framework in order to prove that it is feasible for networked virtual spaces with video components.

To provide users with database-like query interfaces on HTML data, several systems have been developed to extract structures from HTML pages. Among them, tree-like structures and path expressions are the most popular modeling and navigating tools, respectively. Although path expressions are straightforward in representing top-down search patterns, they provide very limited help in representing bottom-up and in-breadth search patterns. In this paper, a lattice model is proposed to store Web data. The model provides an integrated mechanism to store text, linking information, HTML hierarchy, and sequence order of HTML data. By incorporating lattice operators with comprehension syntax, we show that the query language can represent top-down, bottom-up, and in-breadth searching patterns with uniform operators. It will be also shown that lattice comprehensions can represent all operators of path expressions, except Kleen closure.

The paper investigates several approaches for designing and implementing integration environments. Such an environment is developed for the purpose to allow cooperative interactions between distributed and heterogeneous systems. A possible approach to achieve system integration is to use the warehousing technology which engenders the development of data warehousing environments. These environments are information repositories that are available for queries and analysis. In order to manage efficiently a data warehouse, software agents enhanced with mobility mechanisms are introduced. A software agent is an autonomous entity having the abilities to collaborate with each other and to answer users' needs. Furthermore, to perform their operations software agents can migrate off their hosts and roam the network to gather relevant information. This research is part of the SAMDW project which aims at developing a new generation of data warehouses.

Internet users have become well acquainted with the World Wide Web (WWW) system, and WWW has become the most significant service on the Internet. In the near future, the importance of large scale hypermedia database systems based on WWW technologies is expected to continue to increace. The present study focuses on the issue of managing hyperlink integrity constraints on WWW like hypermedia database systems. After formally defining path existence constraint definitions(PEDs) using intuitive examples, we apply the notion of PEDs to represent hyperlink integrity constraints. Intuitively, a PED can be used to represent the following integrity constraint. If a reference path exists in a given database, then another corresponding reference path must also exist. An outline of a prototype hypermedia database system, AYATORI, which is based on the proposed model and under development, is also mentioned.

A new electromagnetic coupling structure has been proposed for a millimeter wave DR-VCO. The structure consists of a microstrip substrate placed on a planar type dielectric resonator and provides a strongly confined electromagnetic field and a high Q. The resonator used in this structure is a TE010 mode dielectric resonator composed of a dielectric substrate and electrodes on both sides of the substrate. Each electrode has a circular hollow patch. A microstrip circuit substrate with an aperture on the ground electrode is stacked on the resonator. The resonator is magnetically coupled to the transmission line through the aperture. The coupling structure has advantages as follows: (a) The electromagnetic field is strongly confined at the hollow patch, and (b) unloaded Q reduction is only 18% under a strong coupling. When the structure is used as a resonant circuit for a DR-VCO, the circuit can be small because the transmission lines to be isolated from the resonator are able to be placed near the resonator. Both a large loaded Q and a large reflection coefficient of a resonant circuit are obtained with the structure. Fabricated DR-VCO has following performances. The oscillation center frequency is 30. 242 GHz and the frequency tuning range is 91 MHz when the control voltage varies 2 to 10 V. An output power of more than 7.3 dBm and a C/N of 90 dBc/Hz at 100 kHz offset are obtained at the frequency range.

We propose and experimentally confirm two approaches to improve the sensitivity of the H-type piezoelectric crystal gyroscope of LiTaO3. One is to adjust the resonant frequencies of the fz mode through additional mass control; the other is to change the driving mode from fx mode to fz mode, while the driving frequency is the resonant frequency of the fx mode. The sensitivity of the unit driving voltage is almost the same, but the threshold driving voltage level may increase more than 1,000 times, because it is far from the mechanical resonance. The high sensitivity of 0.11 pC (deg/sec) was obtained at a driving voltage of 30 Vpp.

The distributions of a spectral intensity of the breaking arc between silver contacts in DC 45-66 V/2.5-5.0 A circuits have been measured using a high-speed color video. As a result, a cathode brightening spot, which has a high spectral intensity, exists near the cathode surface. The cathode brightening spot expands with the increase of the contact gap, but its length expands until about 18µm. When the contact gap spreads over about 180 µm, a dark positive column appears and grows between the cathode brightening spot and the anode surface. The higher the interrupted current is, the larger the diameter of the cathode brightening spot will be. The maximum diameter of cathode brightening spot is 500 µm under these experiments.

This paper presents results of subjective assessment of the media synchronization quality in the virtual-time rendering (VTR) media synchronization algorithm. For the assessment, stored voice and video streams were transmitted as two separate transport streams from a source to a destination on various traffic conditions in an experimental system. At the destination, they were output after synchronization control. We subjectively assessed the quality of media synchronization in a systematic way. This paper examines the effects of the difference between methods of recovery from asynchrony on the media synchronization quality. The paper also clarifies the relationships between the subjective and objective performance measures. Furthermore, it examines the effect of the difference in scene between media streams and that of the modification of the target output time on the media synchronization quality.

Let f be a one-to-one encryption function. Given f(m) and a string K, can we efficiently determine whether m contains K as a substring or not? We investigate the computational complexity of this problem, and show that it is equivalent to not only computing f-1 but also counting the number of K contained as substrings in m. Thus it is not determined in polynomial-time if f is in fact one-way.

In a DC 50 V/3.3 A circuit, the spatial distributions of the spectral intensities of breaking arcs near the cathode for silver contacts were measured on the contact surfaces of three different shapes: flat and spherical (1 mm radius and 2 mm radius) and the arc temperature and the metal-vapor quantity were calculated from the spectral intensities. The influence of the contact shape on the arc temperature and the metal-vapor quantity were also examined, as well as the arc tracks on the contact surfaces and the gain and loss of the contacts. Findings show the distributions of spectral intensities are non-symmetrical from the beginning to the extinction of the breaking arc for the flat contact: However, they are symmetrical in the latter half of the breaking in spite of the number of breaking arcs and the shape of contact surface for the spherical contact. The relationship between the area of the arc tracks on the cathode and the shape of contact surface is the same as the relationship between the existent areas of measured spectra and the shape of the contact surface. For the spherical contacts, the arc temperature and the metal-vapor quantity are affected a little by the radius of the curved of contact surface and the number of breaking arcs. However, the longer the arc duration, the higher the metal-vapor quantity is in the latter period of the breaking arc. For the flat contacts, the metal-vapor quantity is lower than those for the spherical contacts. The gain and loss of the contacts are less and the arc duration is shorter for the flat contact than for the spherical contact.