In this paper, we present a class of combinatorial-logical classifiers called test feature classifiers. These are polynomial functions that can be used as pattern classifiers of binary-valued feature vectors. The method is based on so-called tests, sets of features, which are sufficient to distinguish patterns from different classes of training samples. Based on the concept of test we propose a new distance-based test feature classifiers. To test the performance of the classifiers, we apply them to a well-known phoneme database and to a textual region location problem where we propose a new effective textual region searching system that can locate textual regions in a complex background. Experimental results show that the proposed classifiers yield a high recognition rate than conventional ones, have a high ability of generalization, and suggest that they can be used in a variety of pattern recognition applications.

This paper proposes an intelligent image interpolation method based on Cubic Hermite procedure for improving digital images. Image interpolation has been used to create high-resolution effects in digitized image data, providing sharpness in high frequency image data and smoothness in low frequency image data. Most interpolation techniques proposed in the past are centered on determining pixel values using the relationship between neighboring points. As one of the more prevalent interpolation techniques, Cubic Hermite procedure attains the interpolation with a 3rd order polynomial fit using derivatives of points and adaptive smoothness parameters. Cubic Hermite features many forms of a curved shape, which effectively reduce the problems inherent in interpolations. This paper focuses on a method that intelligently determines the derivatives and adaptive smoothness parameters to effectively contain the interpolation error, achieving significantly improved images. Derivatives are determined by taking a weighted sum of the neighboring points whose weighting function decreases as the intensity difference of neighboring points increases. Smoothness parameter is obtained by training an exemplar image to fit into the Cubic Hermite function such that the interpolation error is minimized at each interpolating point. The simulations indicate that the proposed method achieves improved image results over that of conventional methods in terms of error and image quality performance.

We present an architecture of a VOD system employing proxy servers. The proposed VOD system provides efficient and reliable VOD services and solves the problems caused by traditional VOD systems of centralized, hierarchical or distributed architecture. The proxy servers are placed between video servers and user systems. The proxy server is a small size video server that has not only caching function but also intelligence such as VCR-like video stream control or navigation of other proxy/video servers to search for a selected video program. Using a VOD system of the proposed architecture, the VOD services can be provided to more users because it reduces the workload of video servers and network traffic. We provide the performance model of the system. Service availability is also analyzed. The proposed architecture shows better performance and availability than the traditional VOD architectures.

This paper presents an object-oriented model to handle the temporal relationship for all of the multimedia objects at the presentation platform. Synchronization of the composite media objects is achieved by ensuring that all objects presented in the upcoming "manageable" period must be ready for execution. To this end, the nature of overlays is first investigated for various types of objects. Critical overlaps which are crucial in synchronization are also defined. The objective of synchronization is to ensure that the media objects can be initiated precisely at the critical point of the corresponding critical overlap. The concept of manageable presentation interval is introduced and the irreducible media group is defined. The resource scheduling of each presentation group for media object pre-fetch time versus buffer occupancy is also examined. Accordingly, a new model called group cascade object composition Petri-net (GCOCPN) is proposed and an algorithm to implement this temporal synchronization scheme is presented.

In this paper, we analytically study the effects of overlap and overlay structure on the quality of service (QoS) of Low Earth-Orbital Satellite (LEOS) communication systems. We consider two-layered overlay of cells and intentional overlap of neighboring small cells. In order to measure the QoS, the probabilities of rejection of a newly arrived call (blocking) and forced termination due to failure of a handover (call dropping) are derived. In addition to these measures, the largest traffic intensity which guarantees the required blocking and dropping probabilities is also used.

This paper focuses on introducing a highly efficient data structure that effectively captures the multipath phenomenon needed for accurate propagation modeling and fast propagation prediction. We propose a new object representation procedure called circular representation (CR) of microwave masking objects such as buildings, to improve over the conventional vector representation (VR) form in fast ray tracing. The proposed CR encapsulates a building with a circle represented by a center point and radius. In this configuration, the CR essentially functions as the basic building block for higher geometric structures, enhancing the efficiency more than when VR is used alone. Only one CR is needed to represent one building while several wall vectors are required in VR. As a result, a significant computational reduction can be achieved in ray tracing by the proposed method. Our aim is to show CR as a solution to achieving efficiency in data structuring for effective propagation prediction modeling. We show that the computational load is reduced by the proposed method. Further reduction is shown attainable using the hierarchical structure of CR in a deterministic propagation model, undergoing ray tracing. The simulation results indicate that the proposed CR scheme reduces the computational load proportionally to the number of potential scattering objects while its hierarchical structure achieves about 50% of computational load reduction in the hierarchical octree structure.

The minimum distance of a linear code C is a useful metric property for estimating the error correction upper bound of C and the maximum likelihood decoding of a linear code C is also of practical importance and of theoretical interest. These problems are known to be NP-hard to approximate within any constant relative error to the optimum. As a problem related to the above, we consider the maximization problem MAX-WEIGHT: Given a generator matrix of a linear code C, find a codeword c C with its weight as close to the maximum weight of C as possible. It is shown that MAX-WEIGHT PTAS unless P=NP, however, no nontrivial approximation upper and lower bounds are known. In this paper, we investigate the complexity of MAX-WEIGHT to make the approximation upper and lower bounds more precise, and show that (1) MAX-WEIGHT is APX-complete; (2) MAX-WEIGHT is approximable within relative error 1/2 to the optimum; (3) MAX-WEIGHT is not approximable within relative error 1/10 to the optimum unless P=NP.

This work presents a scalable and high performance prediction protocol for optical networks. In the proposed protocol, we develop a mathematical model to maintain the stability of a network system by prediction based on the traffic temporal locality property. All the critical factors, including transceiver tuning time, propagation delay, and processing time for dealing with control packets, are considered in the proposed prediction protocol. Furthermore, our protocol can resolve the bottlenecks attributed to control signaling and electronics processing. The performance evaluation reveals that the proposed scheme can yield the higher bandwidth efficiency and incur a lower packet delay than those of the TDM and conventional reservation schemes. Also, the proposed protocol can flexibly support any scaled network system such as MANs or LANs.

Higher order delta-sigma (ΔΣ) modulator with one bit quantizer is known as one of the easiest method to gain a high resolution A/D converter without the need of accurately matched components. However, stability of higher order ΔΣ modulator is still a problem during the design and implementation process. Stabilizing higher order modulator requires the proper choice of integrator gains. In this paper, a new approach on ΔΣ modulator stability analysis which based on the system auto-correlation function is proposed, and equation of NTF power integration is derived out. The specification of equation related to input signal amplitude and output quantization level is discussed. Combining with system control theory, the stability of higher order modulator (2nd and 3rd order) is evaluated. Matlab simulation confirm the proposed method. It offers an evaluation method for the choice of the in-loop integrator gains which ensure the modulator operates under the stable status, and is able to be used for designing stable higher order ΔΣ analog-to-digital converters.

We consider the problem of finding a minimum weight k-connected spanning subgraph of a given edge-weighted graph G for k=3. The problem is known to be NP-hard for k 2, and there are an O(n2m) time 3-approximation algorithm due to Nutov and Penn and an O(n8) time 2-approximation algorithm due to Dinitz and Nutov, where n and m are the numbers of vertices and edges in G, respectively. In this paper, we present a 7/3-approximation algorithm which runs in O(n2m) time.

This paper proposes a reference model of CAD system generation, and describes its prototype implementation. The problems encountered in using CAD systems in industry involve complicated data handling and unsatisfied demands for domain knowledge because of the lack of a way of extracting and adopting it in the system. In the example domain of architecture, the authors have already defined domain-specific BDL (Building Design Language) for architecture experts to describe modelers of architectural structure in CAD systems by themselves. Moreover, the authors have developed a CAD system generator based on BDL descriptions. However, the different domain-specific languages required for individual domains create difficulty in developing various CAD system generators. The proposed reference model solves this problem by applying a common intermediate language based on the object model. Moreover, the model allows the creation of an integrated CAD system which contains multiple domains required by a field of industry. Its prototype implementation demonstrates its feasibility.

This letter analyses the convergence behaviour of the transform domain least mean square (TDLMS) adaptive filtering algorithm which is based on a well known interpretation of the variable stepsize algorithm. With this interpretation, the analysis is considerably simplified. The time varying stepsize is implemented by the modified power estimator to redistribute the spread power after transformation. The main contribution of this letter is the statistical performance analysis in terms of mean and mean squared error of the weight error vector and the decorrelation property of the TDLMS is presented by the lower and upper bound of eigenvalue spread ratio. The theoretical analysis results are validated by Monte Carlo simulation.

The problem we consider in this paper is whether the Menezes-Okamoto-Vanstone (MOV) reduction for attacking elliptic curve cryptosystems can be realized for genera elliptic curves. In realizing the MOV reduction, the base field Fq is extended so that the reduction to the discrete logarithm problem in a finite field is possible. Recent results by Balasubramanian and Koblitz suggest that, if l q-1, such a minimum extension degree is the minimum k such that l|qk-1, which is equivalent to the condition under which the Frey-Ruck (FR) reduction can be applied, where l is the order of the group in the elliptic curve discrete logarithm problem. Our point is that the problem of finding an l-torsion point required in evaluating the Weil pairing should be considered as well from an algorithmic point of view. In this paper, we actually propose a method which leads to a solution of the problem. In addition, our contribution allows us to draw the conclusion that the MOV reduction is indeed as powerful as the FR reduction under l q-1 not only from the viewpoint of the minimum extension degrees but also from that of the effectiveness of algorithms.

Laser diodes in the (Al, Ga, In) N system are attractive for many applications. Due to the wurtzite crystal structure, cleaved facets are not easily produced. We have investigated distributed feedback (DFB) laser diodes employing embedded dielectric gratings with the grating located above the active region. The dielectric gratings are incorporated via epitaxial lateral overgrowth. The DFB laser diodes had reduced threshold current densities over the etched cavity devices, with a minimum of 15 kA/cm2. The spectral emission width was considerably reduced for the DFB devices. Voltages for the DFB devices were high due to the presence of the Si3N4 grating within the p-type material.

Dislocation properties in InGaN/GaN Quantum Wells and GaN grown on bulk GaN and sapphire substrates by metalorganic chemical vapor deposition (MOCVD) were characterized using cathodoluminescnece (CL), transmission electron microscopy (TEM), atomic force microscopy (AFM) and photoluminescence (PL). It was clearly demonstrated that dislocations act as nonradiative recombination centers in both n-type (undoped and Si-doped) GaN and InGaN layers. Furthermore the very short-minority carrier diffusion length was a key parameter to explain the high light emission efficiency in GaN-based light emitting diodes (LEDs) prepared on sapphire substrates. On the other side band-tail states were detected in the heteroepitaxial InGaN layers only by temperature dependence PL measurement. Additionally InGaN phase separation, which consists of few micron domains, has been produced under growth conditions which favors the spiral growth. These results indicate that the dislocations in the InGaN layers act as triggering centers for the InGaN phase separation which cause both a compositional fluctuation and the formation of few micron phase separated domains. The homoepitaxial InGaN layers showed however quite normal behaviors for all characterizations.

We consider the performance of hyperelliptic curve cryptosystems over the fields Fp vs. F2n. We analyze the complexity of the group law of the jacobians JC(Fp) and JC(F2n) and compare their performance taking into consideration the effectiveness of the word size (32-bit or 64-bit) of the applied CPU (Alpha and Pentium) on the arithmetic of the definition field. Our experimental results show that JC(F2n) is faster than JC(Fp) on an Alpha, whereas JC(Fp) is faster than JC(F2n) on a Pentium. Moreover, we investigate the algorithm of the jacobian and the definition-field arithmetic to clarify our results from a practical point of view, with theoretical analysis.

A new elliptic curve scalar multiplication algorithm is proposed. The algorithm offers about twice the throughput of some conventional OEF-base algorithms because it combines the Frobenius map with the table reference method based on base-φ expansion. Furthermore, since this algorithm suits conventional computational units such as 16, 32 and 64 bits, its base field Fpm is expected to enhance elliptic curve operation efficiency more than Fq (q is a prime) or F2n.

Formal description techniques (FDTs) such as VDM, Z, LOTOS, etc are powerful to develop safety-critical systems since they have strict semantics and mathematical reasoning basis. However, they have no methods or guides how to construct specifications unlike specification and design methods such as Object-Oriented Modeling and Technique (OMT), and that makes it difficult for practitioners to compose formal specifications. One of the solutions is to connect formal description techniques with some existing methods. This paper discusses a technique how to integrate FDTs with specification and design methods such as OMT so that we can have new methods to support writing formal specifications. The integration mechanism is based on transformation rules of specification documents produced following methods into the descriptions written in formal description techniques. The transformation rules specify the correspondences on two meta models; of methods and of formal description techniques, and are described as graph rewriting rules. As an example, we pick up OMT as a method and LOTOS as a FDT and define the transformation rule on their meta models.

This paper proposes and evaluates a character or symbol code system called EPICS for multilingual information processing. EPICS integrates a variable-length coding system using 16-bit units and a smart virtual machine. EPICS enhances the interchangeability of data. The variable-length coding system provides a huge code space. This huge space can include not only standardized code sets but also non-standardized codes of ancient symbols and user-specific symbols. The smart virtual machine executes inputs as instructions and is dynamically customizable. It allows us to define and modify instructions during runtime and provides us with customization facilities. Customization facilities can be used to specify a sorting order and normalization. Customization also makes it possible for an information producer (sender) to express his intentions or annotations in data and for an information consumer (receiver) to process the data depending on his needs. Moreover, customization enables one to send compressed data and decompression program fragments incrementally and efficiently without predefined decompression algorithms.

There are many public key cryptosystems that require random inputs to encrypt messages and their security is always discussed assuming that random objects are ideally generated. Since cryptosystems run on computers, it is quite natural that these random objects are computationally generated. One theoretical solution is the use of pseudorandom generators in the Yao's sense. Informally saying, the pseudorandom generators are polynomial-time algorithms whose outputs are computationally indistinguishable from the uniform distribution. Since if we use the Yao's generators then it takes much more time to generate pseudorandom objects than to encrypt messages in public key cryptosystems, we relax the conditions of pseudorandom generators to fit public key cryptosystems and give a minimal requirement for pseudorandom generators within public key cryptosystems. As an example, we discuss the security of the ElGamal cryptosystem with some well-known generators (e. g. , the linear congruential generator). We also propose a new pseudorandom number generator, for random inputs to the ElGamal cryptosystem, that satisfies the minimal requirement. The newly proposed generator is based on the linear congruential generator. We show some evidence that the ElGamal cryptosystem with the proposed generator is secure.