Abstract: There is disclosed a program development system, a method for developing programs and a storage medium storing programs for development of programs by which the reduction in development periods of a program to be incorporated into a real time control system and the improvement of qualities are realized. A program development system comprises a state transition storing section to store a state transition matrix, a processing time storing section to store processing time required for an action described in each cell in the state transition matrix, and a simulator to obtain processing time required for a simulation of operations of a system by accumulating events inputted sequentially and time information corresponding to a cell specified sequentially by a state inputted as an initial state or a state subsequent to transition described in each cell.
Abstract: Prefix searches for directing internet data packets are performed in a prefix search integrated circuit. The integrated circuit includes an array of search engines, each of which accesses a prefix search tree data structure to process a prefix search. An SDRAM is dedicated to each search engine, and SDRAMs share address and control pins to plural search engines on the IC chip. Internal nodes of the tree data structure are duplicated across banks of the SDRALMs to increase bandwidth, and leaf nodes are stored across the SDRAM banks to reduce storage requirements. Within each search engine, data stored in a data register from an SDRAM is compared to a prefix search key stored in a key register. Based on that comparison, an address is calculated to access further tree structure data from the SDRAM. Packet descriptors containing search keys are forwarded to the search engines from an input queue and the search results are forwarded to an output queue, the same packet order being maintained in the two queues.
Type:
Grant
Filed:
August 26, 1998
Date of Patent:
August 6, 2002
Assignee:
Avici Systems
Inventors:
Gregory M. Waters, Larry R. Dennison, Philip P. Carvey, William J. Dally, William F. Mann
Abstract: Apparatus, and an associated method selects an adaptive switching threshold level responsive to a constrained optimization scheme. The switching level is selected by an LRI function forming a portion of a transmitting station, such as a base transceiver station operable in a cellular communication system. The switching threshold level is utilized in the selection by an adaptive modulator of a modulation parameter by which data transmitted by the transmitting station is encoded or modulated.
Abstract: Control of a robotic mechanism comprising both active and passive joints is accomplished, where the motion of one or more of the passive joints is constrained by one or more constraints imposed on the mechanism by the environment, the mechanical construction of the mechanism, or the nature of the task such as a surgical robot holding a surgical instrument inserted into a patient through a natural or man-made orifice. The control incrementally moves the mechanism in a series of successive movements from its actual position to its desired or target position. The effect of moving each individual joint of the mechanism is characterized by Cartesian displacement of the target and a Jacobian is constructed mapping between infinitesimal joint displacements of the target to be extended to include both passive and active joints. Thus, hybrid robots containing both active and passive joints can be effectively controlled.
Type:
Grant
Filed:
December 28, 2000
Date of Patent:
May 21, 2002
Assignee:
International Business Machines Corporation
Abstract: A multi-pass algorithm identifies duplicative information and correlates higher confidence and/or selected primary information in distributed databases. One embodiment determines a bounded area based at least in part on location information and/or location tolerances for a location-dependent attribute and comparing the bounded areas to previously indexed location information using a multi-pass algorithm to identify duplicative information. The algorithm may also use textual tolerances, confidence levels, and other factors to determine what information is to be correlated with the option of elevating the correlated information to a higher level database.
Abstract: A computer-implemented molecular dynamics-based process simulates a distribution of ions implanted in a semiconductor substrate. The properties of the semiconductor substrate and ion dose to be simulated are first initialized, including an initial set of splitting depths that contain an equal number of virtual ions implanted in each substrate volume determined by the splitting depths. A first ion with selected velocity is input onto an impact position of the substrate that defines a first domain for the first ion during a first timestep, where the first domain includes only those atoms of the substrate that exert a force on the ion. A first position and velocity of the first ion is determined after the first timestep and a second domain of the first ion is formed at the first position. The first ion is split into first and second virtual ions if the first ion has passed through a splitting interval. The process then follows each virtual ion until all of the virtual ions have come to rest.
Type:
Grant
Filed:
October 29, 1999
Date of Patent:
April 2, 2002
Assignee:
The Regents of the University of California
Abstract: A method for operating a computer to determine the electrical characteristics of a passive planar structure. The method starts by defining a first mesh on the structure. The first mesh divides the structure into polygons. A surface current is defined in the structure as a first weighted sum of a first set of basis functions. The weights of the first basis functions in the first weighted sum are calculated by solving Maxwell's equations. The mesh is then refined by dividing each polygon into a plurality of sub-polygons. The surface current in the sub-polygons is defined as a second weighted sum of a second set of basis functions. The second set of basis functions includes the first set of basis functions and a plurality of extension basis functions representing the additional degrees of freedom introduced by the refined mesh.
Abstract: A method for engineering management and planning for the design of a wireless communications network in three-dimensions (3-D) combines computerized organization, database fusion, and radio frequency (RF) site-specific planning models. The method enables a designer to keep track of wireless system performance throughout the process of pre-bid design, installation and maintenance of a wireless system. Using a database of information that defines the desired environment, predictions of antenna coverage, system coverage and interference, and other wireless system performance criteria, such as frame error rate and network throughput, can be made. Watch points are created to ensure, in real time, that any modifications to the design of the wireless system do not degrade the performance of the system with respect to the watch point locations.
Type:
Grant
Filed:
May 26, 1999
Date of Patent:
November 13, 2001
Assignee:
Wireless Valley Communications, Inc.
Inventors:
Theodore S. Rappaport, Roger R. Skidmore
Abstract: An apparatus and method are provided to calculate the strength of an electromagnetic field radiated from an electric device according to a moment method, wherein the moment method is based on integral equations derived from electromagnetic equations. The apparatus and method include a setting unit to interactively set a name of a two-wire cable arranged in the electric device and coordinates of the two-wire cable at a cable inlet, a cable outlet, and way points in the electric device, the way points being prepared as and when required to bend the two-wire cable between the cable inlet and the cable outlet. Further, the apparatus and method include library unit corresponding to cable names, respectively, and storing attributes of a corresponding cable comprising of the name, type, characteristic impedance, and structural data of the two-wire cable.
Abstract: A simulation method and a simulation apparatus suppress a parabolic increase in depth angle calculation time to a linear increase at most with respect to an increase in the number of depth angle calculation points on a surface string that represents a processing surface to be simulated. The simulation method and apparatus are applicable to a deposition process that deposits metal such as aluminum on a semiconductor substrate in a vacuum with the use of physical adsorption. The simulation method and apparatus are effective, in particular, to quickly calculate depth angles on a two-dimensional shape to a processing surface to which the deposition process is applied. The depth angles are angles in which particles fly toward the processing surface during the deposition process. The simulation method and apparatus trace a surface string representing the processing surface from the origin to the terminal thereof and find depth angles at all points on the surface string.
Abstract: A distribution of the concentration of initial point-defects which generate in an ion implanting process is obtained with an ion implanting simulator. As a local function of the distribution, the distribution of the intensity of absorption of point-defects is obtained. A term of absorption of point-defects obtained from the distribution of the intensity is included in a diffusion equation. With the resultant diffusion equation, the diffusion simulation is performed. Thus the simulation using the diffusion equation may be extended to two or three dimension and cope with various ion implanting conditions.
Abstract: A simulation apparatus for simulating the current flowing through elements of an electronic apparatus using the moment method based on reaction matching and able to achieve high speed simulation processing, comprising a segmenting means for segmenting the electronic apparatus to be analyzed into elements, a calculating means for calculating a mutual impedance between segmented elements of the electronic apparatus, assuming that a triangle function current flows through the monopoles, by using an approximation equation of the mutual impedance between monopoles, expressed by a polynomial of the power of k, derived by exp(-jkr) which is approximated by multiplication of exp(-jkr.sub.0) and a Taylor expansion of exp[-jk(r-r.sub.0)] (where j is an imaginary number, k is a wave number, r is the distance between monopoles, and r.sub.
Abstract: A method and apparatus wherein category classes which express information content categories are defined based on object-oriented programming. The information items that are to be collected for each category are set as properties, and an information acquisition method or information process and treatment method is described for each property. After a request input from a user has been converted into a request input format the system can understand, the request input is classified into category classes, searching is performed, and the information items the system outputs are displayed using the properties of the classes to which the request input belongs. Information searching and collection is accomplished on the basis of the contents described by said methods, and the information is output as comprehensive information in accordance with the request input of the user.
Abstract: A method of fast clipping, despite of large number of users, can be achieved through analyzing query expressions, storing the number of query terms included in the query expressions in a term number count table, generating a finite automaton for matching the terms occurring in text data with all terms included in the query expressions, generating a user identifier table for storing the identifiers of users in association with the terms included in the query expressions, matching the terms by scanning the text data by the finite automaton, calculating for each user the occurrence count of terms occurring in the text data as substrings coincident with the terms included in the query expressions made to the user identifier table, storing the calculated occurrence count in the term occurrence count region of the table, comparing the calculated term occurrence count of the table with the number of terms included the query expressions, and when a match is found from the comparison, delivering the text data to the u