A flat stick-shaped whip antenna was developed for Japanese commercial portable telephones. It provides a high gain even though it is short and retractable. It is an open-sleeve type antenna. i.e., the inductance-loaded dipoleantenna element parallels a twin-lead type feeder. It suppresses the currents on the radio housing even at short antenna lengths. Moreover, it is easy to achieve two resonant characteristies and able to construct retractable type. A relatively high gain is gotten even when the antenna is in a retracted state. This antenna has a suitable configuration for commercial portable telephones. This paper first calculates, the current suppression of the housing on a principal model of this antenna, i.e., without a twin-lead feeder. The second analysis determines the effects of the twin-lead feeder and the dielectric coat on the antenna. Next,the two resonant technique and the configuration for the retractable-type antenna describes. In addition, the return loss and radiation pattern for the trial model were measured. The return loss shows that the two resonant characteristics and the bandwidths of the high and low resonant frequencies are 2.2% and 1.5%(VSWR2), respectively. For when the antenna is extended, radiation patterns are nearly the same as for the case of the 1/2 wavelength dipole antenna, and the antenna efficiencies are -1.6 dB at 820 MHz and -1.1 dB at 950 MHz. Other hand, for the retracted state, they are destroyed by the housing currents, but the efficiency is relatively high of -1.8 dB at 950 MHz. In these experiments, it is clear that the antenna achieves high performances.

Fundamental microwave key devices used in achieving compact mobile/portable telephones (raidio units) are discussed. The historical development flow of the systems and radio units are introduced, with respect to the 800-/900-MHz and 1.5-GHz Japanese cellular radio systems. The design concept of the developed radio units is briefly described. Tehnical requirements for RF circuits are reviewed and the developed key devices are practically applied to the circuits. Key factors in the requirements are also shown. Finally. future trends fro the key devices are surveyed from the stand point of achieving a smaller and more light weight pocket radio unit.

Table-form document structure analysis is an important problem in the document processing domain. This paper presents a new method called Box-Driven Reasoning (BDR) to robustly analyze the structure of table-form documents that include touching characters and broken lines. Real documents are copied repeatedly and overlaid with printed data, resulting in characters that touch cells and lines that are broken. Most previous methods employ a line-oriented approach, but touching characters and broken lines make the procedure fail at an early stage. BDR deals with regions directly in contrast with other previous methods and a reduced resolution image is introduced to supplement information deteriorated by noise. Experimental tests show that BDR reliably recognizes cells and strings in document images with touching characters and broken lines.

In this paper, a new algorithm for selection of candidates for handwritten character recognition is presented. Since we adopt the concept of the marginal radius to examine the confidence of candidates, the evaluation function is required to describe the pattern distribution correctly. For this reason, we propose Simplified Mahalanobis distance and observe its behavior by simulation. In the proposed algorithm, first, for each character, two types of feature regions (multi-dimensional one and one-dimensional one) are estimated from training samples statistically. Then, by referring to the feature regions, candidates are selected and verified. Using two types of feature regions is a principal characteristic of our method. If parameters are estimated accurately, the multi-dimensional feature region is extremely effective for character recognition. But generally, estimation errors in parameters occur, especially with a small number of sample patterns. Although the recognition ability of one-dimensional feature region is not so high, it can express the distribution comparatively precisely in one-dimensional space. By combining these feature regions, they will work concurrently to overcome the defects of each other. The effectiveness of the method is shown with the results of experiments.

An extended configuration of a stepped impedance comb-line filter is presented. The parallel stripline sections of stepped impedance resonators are coupled electromagnetically and a coupling capacitor is introduced. The creation of an attenuation pole near the passband was detailed. A design procedure for the two-pole extended filter is derived from an analysis using even-and odd-mode impedances. Experimental filters were constructed by ceramic lamination technique. They exhibited excellent performances suitable for portable telephones.

Recently, a number of concurrency control algorithms have been proposed for multidatabase system (MDBS) concurrency control methods (CCMs) and the most challenging issue of them has been a concern about how to ensure global serializability (GSR). In this paper, we examine two concurrency control algorithms of MDBS through simulation approach: optimistic ticket method (OTM) and global ticket method (GTM). In historical note, OTM is known to be the first practical solution, since this approach ensures GSR by way of automatically resolving indirect conflicts among global transactions without making any restrictions on local CCMs. However, OTM is expected to yield poor performance since it enforces all global transactions to take a local ticket which causes direct conflicts between them. In GTM, the global transaction manager in an MDBS assigns a global ticket to global transactions rather than accessing a local ticket as in OTM. Our experimental results showed that GTM outperforms OTM in cases that short timeout values are given. However, in case that the timeout value relatively becomes long, our results demonstrated that OTM outperforms GTM.

This letter proposes a pulse width modulated (PWM) control method which can stabilize chaotic orbits onto unstable fixed points and unstable periodic orbits. Some numerical experiments using the Lorenz equation show that chaotic orbits can be stabilized by the PWM control method. Furthermore, we investigate the stability in the neighborhood of an unstable fixed point and discuss the stability condition of the PWM control method.

In an adaptive load balancing, the location policy to determine a destination node for transferring tasks can be classified into three categories: dynamic selection, random selection, and state polling. The dynamic selection immediately determines a destination node by exploiting the state information broadcasted from other nodes. It not only requires the overheads of collecting the state information, but may cause an unpredictable behavior unless the state information is accurate. Also, it may not guarantee even load distribution. The random selection determines a destination node at random. The state polling determines a destination node by polling other nodes. It may cause some problems such as useless polling, unachievable load balancing, and system instability. A new Sender-initiated Adaptive LOad balancing scheme (SALO) is presented to remedy the above problems. It determines a destination node by exploiting the predictable state knowledge and by polling the destination node. It can determine a good destination with minimal useless polling and guarantee even load distribution. Also, it has an efficient mechanism and good data structure to collect the state information simply. An analytic model is developed to compare with other well known schemes. The validity of the model is checked with an event-driven simulation. With the model and the simulation result, it is shown that SALO yields a significant improvement over other schemes, especially at high system loads.

This paper proposes a new method to design an optimal pipelined instructions set processor for ASIP development using a formal HW/SW codesign methodology. First, a HW/SW partioning algorithm for selecting an optimal pipelined architecture is outlined. Then, an adaptive detabase approach is presented that enables to enhance the optimality of the design through very accurate estimation of the performance of a pipelined ASIP in the HW/SW partitioning process. The experimental results show that the proposed method is effective and efficient.

A detabase system that provides step-by-step guidance for LSI failure analysts has been developed. This system has three main functions: database, navigator, and chip tracking. The datebase stores failure analysis information such as analysis method and failure mechanisms including image data. It also stores conditions and results of each analysis step and decisions to proceeds to the next analysis step. With 2000 failure analysis cases, data retrieval takes 6.6 seconds, a table containing 20 photos is presented in 6.5 seconds, and a different set of data can be displayed in 0.6 seconds. The navigator displays a standard analysis procedure illustrated in flow charts.The chip tracking shows where the particular chip is and what analysis it is undergoing, which is useful for the situation where many chips are simultaneously analyzed. Thus, this system has good enough functions of analysis procedure management and performance of quick data access to make failure analysis easier and more successful.

Recently applications of Hilbert curves are studied in the area of image processing, image compression, computer hologram, etc. We have proposed a fast Hilbert scanning algorithm using lookup tables in N dimensional space. However, this scan is different from the one of previously proposed scanning algorithms. Making the lookup tables is a problem for the generation of several Hilbert scans. In this note, we describe a method of making lookup tables from a given Hilbert scan which is obtained by other scanning methods.

The power distribance appeared at a typical electric power system, which can be modeled by a simplified distributed circuit, is discussed. The electric power and the point where its power is injected are then estimated to suppress the power distrbance.

In this study, we discuss a discrete-time cellular neural network (DTCNN) and its applications including convergence property and stability. Two theorems about the convergence condition of nonreciprocal non-uniform DTCNNs are described, which cover those of reciprocal one as a special case. Thus, it can be applied to wide classes of image processings, such as associative memories, multiple visual patterns recognition and others. Our DTCNN realized by the software simulation can largely reduce the computational time compared to the continuous-time CNN.

A new approach is presented for recovering the 3-D shape from shading image. Photometric Stereo Method (PSM) is generally based on the direct illumination. PSM in this paper is modified with the indirect diffuse illumination method (IDIM), and then applied to hybrid reflectance model which consists of two components; the Lambertian reflectance and the specular reflectance. Under the hybrid reflectance model and the indirect diffuse illumination circumstances, the 3-D shape of objects can be recovered from the surface normal vector extracted from the surface roughness, the surface reflectance ratio, and the intensity value of a pixel. This method is rapid because of using the reference table, simplifies the restriction condition about the reflectance function in prior studies without any loss in performance, and can be applied to various types of surfaces by defining general reflectance function.

This paper surveys trends in and prospects for low power LSI circuits technologies for portable terminal equipment, in which low-voltage operation of LSIs will be emphasized because this equipment will be battery-powered. Since this brings about serious operation speed degradation of LSIs, however, it will become more and more important how to operate them faster under low-supply voltage. We propose two new circuit techniques that make it possible to operate LSIs at high speed even when the supply voltage is very low (1-2 V corresponding to one or two battery cells). The new low-voltage RF LSI circuit technique, developed using silicon bipolar technology and using a novel current-folded mixer architecture for the modulator, result in a highly linear modulator that operates at 2 V. Its power consumption is less than 2/3 that of previously reported ICs. And for a low voltage baseband LSI we propose the multi-threshold CMOS (MTCMOS) technique, which uses two sets of threshold-voltage levels so that the LSI can operate at high speed when driven by a 1-V power supply. The multi-threshold CMOS architecture enabled us to create LSIs that operate faster than conventional CMOS circuits using high-threshold-voltage MOSFETs. When operating with a 1-V power supply, our LSIs are three times faster than the conventional ones.

Queries to generate a map from geographic detabases are too large and complex for users to specify all components in it. Thematic parts of the map should be described by users as ad hoc queries. However, background parts of it should be inferred from users' queries corresponding to the thematic parts. Furthermore, it is important for the map systems to lead users' constructing their ad hoc queries and to infer visualization methods applied to the data retrieved by the ad hoc queries. This paper discusses a framework to infer supplemental queries and visualization methods in order to make the retrieval results into a feasible map using geographic domain hierarchical levels, geographic domain thesauruses and existing example queries. The framework allows users to know mismatches of components in queries, inappropriate queries for maps, and deriving candidates for additional components in queries.

Flora is a functional-style language for object and relational algebra. It has been designed for efficient support of advanced database languages combining rules and objects using compilation and optimization. Flora is a strongly typed language based on an OO data model and incorporating support for collection-oriented computational capabilities. In this paper, we describe the design and architecture of the Flora optimizer which is rule-based, yet doing cost-based optimization. The optimizer uniformly captures logical, semantic and implementation knowledge regarding the execution system and the applications by means of assertions. This framework eases extensibility and enables efficient query rewriting.

Our objective is to resolve three types of heterogeneity - data model,database system, and semantic - in heterogeneous databases. The basic framework which we propose for this objective is realized in an autonomous decentralized database system (i.e., an interoperable database system), called Jasmine/M. Users describe their relational or object-oriented data models and schemas locally using the model primitives which Jasmine/M provides as a scripting language. Description using such primitives or scripts constitutes viewports, which have a role to resolve heterogeneity in data models and database systems at local sites. At relational viewports, both relational and object-oriented schemas defined at other sites are translated via scripts and are viewed as relational schemas. Similarly at object-oriented viewports, any schema defined at other sites is viewed object-oriented schemas. Relational and object-oriented views are used to resolve semantic heterogeneity within viewports. This paper describes a step wise approach to resolving the three types of heterogeneity, using scripts, viewports, and views, and its implementation using active objects.

As Object-Oriented Database Systems (OODBS) play an increasingly important role in advanced database systems, OODBS performance becomes a significant issue. It is well known that there is a strong relationship between performance and the concurrency control algorithms employed by the Database Management System (DBMS). Class Granularity Locking (CGL) and Class Hierarchy Granularity Locking (CHGL) are proposed as the concurrency control algorithms for OODBS to minimize the locking overhead. However, their basic characteristics, including the licking overhead and concurrency, have not been extensively investigated and it is not known which one is most appropriate for the general case. In this paper, we construct a simulation model for OODBS and carry out several performance evaluation studies on these two Class-Hierarchy Locking protocols and the Non Class-Hierarchy Locking (NCL) protocol. The NCL protocal is a variation of the conventional two phase locking protocol being applied to OODBS data structures.

In order to make the hyperling generation mechanism not only dynamic but also systematic, we will mainly describe the use of the querying and abstraction facilities in hypertext database systems. Our work focuses on a dynamic, abstract and systematic link generation mechanism. The prototype system named TextLink/Gem is implemented by taking an object-oriented approach, and the notions of anchor objects, query-pair links, polymorphic links and inheritable links, on which the system is based, and their implementations are described in detail.