Abstract: Described is a system and mechanism by which a client computer may issue a conventional request for a resource on the Web. A response to that request is annotated with information indicating that metadata is available for the resource. Specifically, a special tag or instruction may be included in the response document that indicates the existence and location of a discovery document containing metadata about the resource. The client computer may then retrieve the metadata from the location identified in the response. Those skilled in the art will appreciate that the present invention enables a lightweight mechanism for discovering metadata about a resource without a need for extensive reprogramming of the resource or the addition of other resources specifically to indicate that metadata may exist for the resource.

Abstract: A system and method of generating an ordered search list via a search engine by determining various account balances to determine where a search listing will appear, if at all, in a search results list. If a web site advertiser's account is below a threshold, the search listing associated with the advertiser will not appear in the search list. Various balances may be used. Some of the balances may be closer to real-time balances and others may be more accurate, for example by removing certain event charges that were later determined to be non-chargeable. By using and monitoring the various account balances, the search engine prevents over-delivery of advertising through search result listings and possible over-billing of the advertisers.

Abstract: A system includes a microprocessor and an integrated circuit, which has interface, logic, and storage circuits for accelerating database search functions. The storage circuit includes table memory and operational plane memory, each location of which may be simultaneously coupled in parallel to a unique location in table memory. A method includes the steps of inputting unsorted entries and performing a first hash function, which sorts the entries into tables. The method also includes storing the sorted tables in table memory, inputting a search key, and performing a second hash function on the search key. The second hash function outputs a table identifier representing the table in which the search key will likely be found. The method further includes simultaneously transferring the table represented by the table identifier in parallel from table memory to operational plane memory and performing a search function on that table using the search key.

Abstract: This invention provides methods apparatus and data structures useful for mining databases for frequent items. The invention uses a frequent pattern tree to represent the contents of a database in a manner which is conducive to data mining. The frequent pattern tree tends to be smaller than the original database. A frequent pattern tree can be mined recursively. The frequent pattern tree and associated methods and apparatus of this invention is relatively fast, efficient and scalable and can be used to mine both long and short frequent patterns.

Abstract: The present invention provides a method of and apparatus for controlling internet browsing and computer readable medium storing a computer program carrying out the method of the present invention. The present invention provides a database storing worthwhile keywords. When a worthwhile keyword is included in contents or information from the Internet, a user is allowed to browse such contents or information even if a forbidden keyword is included.

Abstract: A system and method for enabling data exchanges between various data processing systems, including disparate systems, is described. In one exemplary embodiment, the present invention can include a message bus disposed between a set of data source recognizers and a set of content recognizers. In this embodiment, the data source recognizers are configured (1) to monitor for incoming/received data originating from an associated data provider such as a trading partner; (2) to extract the received data from a data handler, such as a web server; and (3) post the received data to the message bus. Once the data has been posted to the message bus, the individual content recognizers inspect the data and, if appropriate, pull the data from the message bus for subsequent processing.

Abstract: This invention relates to a system for utilizing audible, visual and textual data with multimedia forms of presenting information for real-time interactive use by multiple users in different remote environments. The system of the present invention is used for receiving, accessing, processing, storing, retrieving, transmitting and utilizing audible, visual and textual data that provides real-time interactive knowledge management, preferably over the Internet, in support of activities conducted simultaneously by multiple users in different remote locations utilizing alternative combinable multimedia digital data forms of presenting the information to simplify and maximize human understanding.

Abstract: The present disclosure describes a system and method for a call control system for managing a video network. The call control system includes a master gatekeeper that is able to associate with and manage multiple video network elements, including circuit switched video network elements and packet switched video network elements. The call control system also includes a call control database and a connection engine. The call control database stores registration and status information related to associated network elements. The connection engine analyzes conference call requests and determines the appropriate connection required for the associated network element.

Abstract: A system and method for dispatching emergency services personnel and equipment are provided. The system includes a central server, a dispatcher terminal and a plurality of mobile data terminals (MDTs) associated with the emergency services personnel and equipment. The central server processes incoming calls for emergency services and outgoing messages from the dispatcher terminal. Based upon the dispatching message for the incoming call, the central server automatically queries a plurality of databases in accordance with a predetermined set of rules for information relevant to the emergency and the dispatched personnel and equipment. Based upon the information received, the central server automatically transmits appropriate messages and warnings to the MDTs traveling to the site of the emergency and queries the databases further using further predetermined rules. Additional messages and warnings are transmitted to the MDTs based upon the further information received.

Abstract: Herein disclosed a relay server comprising: protocol conversion means for receiving an input data signal in an input-side protocol transmitted by an output entity, converting the input data signal in the input-side communications protocol into an output data signal in an output-side communications protocol applicable to an input entity, and transmitting the output data signal in the output-side communications protocol to the input entity; and control means for receiving terminal protocol information indicative of the output-side communications protocol applicable to the input entity from the input entity and controlling the protocol conversion means in response to the terminal protocol information, thereby making it possible for an output entity and an input entity to receive and transmit data signals between them regardless of whether the output entity and the input entity share the same communications protocol or not.

Abstract: A system for managing a distributed database of electronic data files is provided. The subject distributed database management system (10) generally includes at least one host platform (100) disposed at a first site, at least one storage facility (200) disposed at a second site remote from the first site, and one or more user platforms (300) disposed at third sites remote from the first and second sites. The storage facility (200) and each user platform (300) are computer network coupled to the host platform (100) for communication therewith. The storage facility (200) retrievably stores a plurality of electronic data files for generating graphic images. The host platform (100) is configured to automatically control access by user platforms (300) to the electronic data files. The host platform (100) maintains a system index table containing for each of the stored electronic data files at least one file record of identifying attributes corresponding thereto.

Abstract: A management server device in a contents providing system can communicate with a user terminal through a communication network. The management server device includes a play-list creation device which creates a play list of contents based on user input to the user terminal, a storage device which stores the created play list in relation to a user, and a transmission device which acquires a play list from the storage device according to a request from the user terminal.

Abstract: A system for transferring information between a user interface and a database over a global information network such as the Internet is provided. A plurality of user interfaces are located on a plurality of user computers. In this regard, the user interfaces are preferably implemented on a browser using a mark up language such as HTML. The database is a relational database residing on a second computer, and is accessed by the user interface via a global information network such as the Internet. The relational database is accessed through four intermediate processing layers: an interaction layer, an application layer, a business object layer, and an information model layer, each located on a second computer, with the information model layer logically adjacent to the database, and the interaction layer logically adjacent to the user interface operating on the browser. The information model layer maintains a first relational tree of the information in the relational database.

Abstract: A dimensionality reduction method of generating a reduced dimension matrix data set Dnew of dimension m×k from an original matrix data set D of dimension m×k wherein n>k. The method selects a subset of k columns from a set of n columns in the original data set D where the m rows correspond to observations Ri where i=1, . . . , m and the n columns correspond to attributes Aj where j=1, . . . , n and dij is the data value associated with observation Ri and attribute Aj. The data values in the reduced data set Dnew for each of the selected k attributes is identical to the data values of the corresponding attributes in the original data set.

Abstract: A wireless data processing device 2 stores partially completed versions of a file needed to replace a current version of a file used by that target device 2. When a device storing a more up-to-date version of the file than the current complete version stored by the target device 2 moves into range, downloading of that new version either completely, or resuming from a previously reached point, is initiated. When the in-range device has more than one version of the file that could be downloaded, the version selected for initial download may be the one which will take least time to complete.

Abstract: The present invention concerns a resource locator which may be used to identify both an initial image, and an edited version of the initial image as well as the operations which can be applied to the initial image yields the edited image. The resource locator may further be used to generate an access key, and when a resource request is made using the resource locator, the access key may be used to validate the request.

Abstract: The present invention is directed to a system for managing environmental audit information which includes receiving environmental audit information, accessing a predetermined set of environmental audit protocols, associating the audit information with at least one of the environmental audit protocols to form at least one environmental audit record, and storing the environmental audit record. The system of the present invention may also restrict access to the audit record, such that a quality assurance reviewer may review said audit record and may designate the status of that review, but may not modify the contents of the audit record.

Abstract: Instructions are generated to manipulate target objects and relationships in a relational database when a source object having a one-to-many relationship of privately owned type with the target objects is manipulated. To generate instructions, mapping meta-data is used which contains information as to how object classes of the object model map to tables in the database and how relationships map to foreign keys.

Abstract: A technique for determination of an exception in multi-dimensional data is provided. The method determines an expected value for a set of cells of the multi-dimensional data by means of an ANOVA based method. A residual for each cell of the set of cells is then determined. Scaling of the residuals is then carried out, and the scaled residuals are then compared with a threshold value for determination of the exception.

Abstract: A method, apparatus, software and data structure is disclosed for more efficient access times for linear operations in a hash table, including finding the nearest logical record. A plurality of actual data records and a plurality of marker data records are inserted in a hash table using a hash function. The actual data records and marker data records have a logical ordering specified by a key and are threaded into the hash table to allow linear access by walking the hash table. The logical ordering of the actual data records and marker records is lost upon entry into the hash table, and the keys of the marker data records are distributed at known positions throughout the range of the keys of the actual data records. If when hashing a given key no record exists in the database for the given key, one of the keys for the marker data records are hashed to locate the associated marker data record in the hash table.

Abstract: The present invention provides a method that allows a developer to add complex dependency logic to an existing database without having to modify the underlying structure of the database. One embodiment of the present invention provides a way to flexibly handle record state transitions by using an event model. The event model is a set of one or more items called an event. Each event in the event model has an associated event type and contains dependency logic that interrelates the events in the event model with one another. Each event represents a set of actions that are optionally contingent upon a condition. The actions and conditions that comprise an event are determine when the event is created. Each event may have a different set of actions and conditions. This enables an event to represent a number of different things. An event can represent anything it is defined to represent.

Abstract: A family of Java interfaces defines methods to provide common information about a property, such as data type and editing capabilities. The interfaces identify the methods used to get generic metadata. Implementers may extend these classes, as needed, to provide the metadata for their specific properties. The common metadata description interface of the present invention allows multiple metadata sources to be used interchangeably within the same software product without the software code being specifically written for each metadata source.

Abstract: Provided is a method, system, and program for maintaining workflow related information. At least one table is provided in a database storing workflow related data. A plurality of methods are provided, wherein each method specifies an operation to perform on the workflow related data in the at least one table, and wherein each method is associated with one stored procedure call. One stored procedure is provided in the database for each stored procedure call and corresponding method, wherein the stored procedure includes a plurality of database statements to perform the method operation. One stored procedure is executed in the database to perform the corresponding method operation on workflow related data in one table.

Abstract: A retrieval system generates a retrieval query for batch reading of related objects when a source object is read from the database. The related objects include nested objects and/or many-to-many relationship objects. It generates a single retrieval query for each type in each level of nested objects using its parent query. Also it generates a retrieval query to retrieve a collection of target objects having many-to-many relationships with a collection of source objects.

Abstract: An improved method and system for high speed logging and trending of data. Logging of data may include: receiving data; and storing the data, and an index to the data, in a shared memory location coupled to a database. Trending of data may include: retrieving requested data from the shared memory location using the index of the requested data, and displaying the retrieved data. User configurable frequencies may be provided for various actions on the data. The data may be measurement data, including a stream of data comprising a plurality of entries. The logging and trending may be: (1) performed substantially concurrently; (2) implemented using shared memory templates. The database may reside on a first computer system, and the logging and trending may be performed on the first computer system or on a second computer system coupled to the first computer system via a network.

Abstract: A file which is virtually combined multiple files (a virtual combination file) is displayed as a thumbnail S. The part ‘A’ indicates the number of files that are virtually combined and the number of the file currently being displayed as a thumbnail S. The user can change the file that is displayed as a thumbnail S by operating the part ‘A’. The part ‘B’ indicates the number of files that are related to and grouped with the file being displayed as a thumbnail S and the number of the file currently being displayed as a thumbnail S. The user can easily keep track of the files that are virtually combined and the files that are registered as belonging to the same group as any of these files.

Abstract: A method for selecting a data set to be synchronized from databases of a data system, in which system metadata illustrating the relationships between data units of the data system are stored for the selection of the data set to be synchronized. The metadata comprises at least information on the relevance between the data units. When a first data set is to be synchronized, metadata associated with at least one initial data unit of the first data set is retrieved. Next, a second data set, which according to at least one metadata element comprises a data unit of maximum relevance to the initial data unit, is selected for synchronization.

Abstract: The present invention provides a method for database migration. It migrates a database in one single bulk migration without the loss of any data. It can accomplish bulk migration because it uses a wrapper script, which is a single instruction given at the command line, that automates, in succession, all the scripts required for the migration. Because the present invention migrates the entire database in one bulk, it uses very little system downtime. This is unlike prior art database migration schemes which may use not only a lot of system downtime, but requires the presence of a user during the entire migration. Because the present invention can be customized to work on various database models including production database models, it is an ideal database migration process, which various DBAs can use without the need to either alter their database, or change the procedure for the migration.

Abstract: The invention provides methodology and processes that extract, separate, filter, and/or transform internally generated events deriving from electronic architectures such as server systems. The internally generated events may for example include chassis logs associated with one or more entities within the electronic architecture. The methodology also preferably transforms chassis logs (typically in binary format) to a text string. The text strings define one or more problems of the electronic architecture. The text strings are input to a series of analyzers corresponding to the series of entities within the architecture. The text strings define a problem detail file and a sequence of chassis codes linked to issues (e.g., problems or system health) within the architecture. The invention thus includes methodology to analyze the text strings, and to generate language statements representative of one or more chassis codes.

Abstract: A data document is constructed by attaching a set of child nodes, selected from nodes in an existing data document or a document fragment, at an update location, which is a node in the existing data document or the document fragment that is identified by a navigation path. When the update command is a merge, one or mode nodes (“merge nodes”) in the document fragment are identified as update locations, and the nodes in the existing data document are merged as child nodes of the merge nodes in the document fragment. When the update command is a join, a node (“join node”) in the existing data document is identified as the update location, and an ordered list specifies which nodes in the existing data document and which nodes in the document fragment are to be joined as the set of child nodes for the join node. The join and merge update commands, navigation paths, and document fragments may transmitted as a series of fragment update units to construct the data document.

Abstract: A computer extracts important terms, phrases or sentences from a document that it segments. The computer generates a square sum matrix from the document segments. The computer determines the importance of a given term, phrase or sentence on the basis of eigenvectors and eigenvalues of the matrix. The computer thereby selects the important terms, phrases or sentences related to the central concepts of the document.

Abstract: The invention relates to a method of analyzing a document represented in a markup language comprising the following steps:

Abstract: This invention relates to computer implemented methods for accomodating elements of an information array within the physical constraints of a predetermined two dimensional display space. The maldistribution and wastage of space inherent to matrix format display is sought to be minimized by allocating space based on moderated display space requirement values of larger elements. A measurement of lopsidedness of distribution of larger elements across columns and across rows is used while allocating column widths and row heights. If the display space is inadequate for displaying the array elements in matrix format, then the elements are displayed in Tall/Wall format wherein the row/column alignment of cells, respectively, is not maintained. The information array elements may include text, image or both. Methods such as font size reduction, text abbreviation and image size reduction are used in combination with space allocation methods to fit the array elements into corresponding cells in the display space.

Abstract: The HTML/XML tree synchronization module synchronizes a document with a view or multiple views, after a change has been made to the document. First, the tree synchronization module receives a document change from an application program. An update processor converts the tree data of the document to a character string, and receives document change information from one or more application program interfaces. The update processor utilizes the document change information to update the document tree data character string. The document change information is then sent to one or more application program interfaces to determine the scope and content of the document views. A log generator receives the view change information, and creates record logs for each changed document view. These logs are played by a log player to each view, and each view data tree is updated with the view changes contained in the change logs.

Abstract: Collaboration space object model provides for a place consisting of rooms created by users interacting with a client browser. A skin (i.e., theme) may be used as template for creating places. PlaceBots (i.e., agents) provide for accessing, processing and managing data in a place. HTML may be dragged and dropped into a place, where it is parsed and corresponding place fields created. MS Excel or Word documents may be dragged and dropped into a place, which creates a corresponding form, and users may create new documents using that form. A place type comprising a template of an entire place, or collaboration space, may be used to create new places. Changes made to a place may be reported, subject to security controls, by selecting what's new. Task fields are provided allowing web browser creation of forms for work flow. Place enabled objects are provided for synchronous communications. A quick browse feature provides a simplified format for browser windows based on selection of HTML links.

Abstract: Methods and apparatus for arbitrarily extendible information aggregation and display. This functionality is achieved by abstracting the components of the system into individual modules which communicate using a platform-independent, extendible markup language such as extensible markup language (XML). A designer adds support for new information sources or client devices by abstracting and encapsulating messages to and from the information source or client device in a wrapper using a platform-independent, extendible markup language such as XML.

Abstract: A method and system are provided for matching a reference document with a plurality of corpus documents. Semantic content is derived from the reference document according to a hierarchical arrangement of semantic types. For each corpus document, semantic content is also derived from the corpus document according to the hierarchical arrangement of semantic types. A matching score is produced for each corpus document by determining a relatedness between the corpus document and the reference document. This relatedness is derived from the respective semantic contents of the two documents. The corpus documents may be ranked in accordance with the determined matching scores.

Abstract: A technique for implementing in a networked client-server environment, e.g., the Internet, network-distributed advertising in which advertisements are downloaded, from an advertising server to a browser executing at a client computer, in a manner transparent to a user situared at the browser, subsequently displayed, by that browser and on an interstitial basis, in response to a click-stream genererated by the user to move from one web page to the next.

Abstract: A text comparison apparatus computes the occurrence count of text elements, stores those text elements that have an occurrence count of at least a occurrence count threshold for storage in a text element storage unit, uses those text elements that have an occurrence count of at least a occurrence count threshold for similarity calculation to calculate similarity, and calculates discrepancy for those text elements for which the difference of occurrence counts is at least a occurrence count threshold for discrepancy calculation.

Abstract: An apparatus for implementing a game having a deterministic component and a non-deterministic component wherein a player uses the game through at least one player interface unit. Each player interface unit generates a player record indicating player-initiated events. A random number generator provides a series of pseudo-random numbers and a rules library stores indexed rules for one or more games. An interface registry stores mapping records where the mapping records are used to associate the player-initiated events to pre-selected rules in the rules library. A control means is coupled to the player interface to receive the output of the player interface unit, coupled to the interface registry, the rules library, and the random number generator.

Abstract: A system and method for calculating an output value from a plurality of input sample values contributing to the output value in accordance with a respective weight value. A first intermediate value is interpolated for a first offset value from a first plurality of the input sample values and a second intermediate value is interpolated for a second offset value from a second plurality of the input sample values. The offset values are representative of the weight values of the input samples of the respective plurality of the input samples. The first and second intermediate values are combined to produce a resultant value which is subsequently blended with the remaining input sample values of the plurality in accordance with respective scaling values assigned to the resultant value and the remaining input sample values.

Abstract: A delayed adaptive least-mean-square (LMS) filter, which has one filter coefficient per tap and acquires a new data sample each frame, calculates a finite impulse response (FIR) filter output and updates the filter coefficients using an error term based on the FIR filter output calculated during the preceding frame. The calculations for each tap are performed in a single clock cycle. The filter can be implemented using a general purpose, programmable digital signal processor (DSP) architecture having two multiply and accumulate circuits (MACs), with or without an arithmetic logic unit (ALU), and preferably implements its memory buffers as dual-access or dual-port RAM or banked memory.

Abstract: Initialization of an adaptive equalizer is controlled by varying a gain applied to an input signal. The input signal may be an alternate mark inversion signal. The gain is applied to the input signal to form an amplified signal. An autocorrelation value of the amplified signal is calculated. The autocorrelation value is compared to a predetermined constant. The gain is adjusted, based on which of the group consisting of the autocorrelation value and the predetermined constant is greater. The gain application, autocorrelation calculation, comparison and gain adjustment are repeated, until the autocorrelation value is sufficiently close to the predetermined constant to satisfy a convergence criterion. The amplified signal is then filtered.

Abstract: A digital signal processor DSP for bit-reversal of a large data array of a size has a direct memory access (DMA) controller for performing in-place bit reversal routines on an external memory during a first stage, and a central processing unit (CPU) for swapping small sub-arrays on internal memory in a second stage. The two stage method according to the invention importantly reduces the real-time implementation for sorting large size data arrays on uni-processor DSP platforms, by extensively using the external memory and avoiding a random access to the internal memory. As well, the invention provides for improved dense integration and reduced costs when used in dense wavelength division multiplexing (DWDM) systems.

Abstract: The proposed fast single precision floating point accumulator of the present invention uses base 32 computation in an attempt to completely remove the need for a costly 8-bit subtractor in the exponent path as is commonly found in conventional designs. It also replaces the expensive variable shifter in the mantissa path with a constant shifter which significantly reduces the cost of the present invention relative to earlier floating point accumulators. The variable shifter required for base 2 to base 32 conversion has been moved outside the accumulator loop. This approach allows comparison of the two input exponents using a comparator. The mantissas are shifted by constant amount to bring them into partial alignment. They are then added or the appropriate mantissa is chosen as the result. The input stream to the accumulator does not need to be cumulative.

Abstract: In a method for determining the square root of a long-bit number using a short-bit processor, the long-bit number is assumed to be c×22K+d, where c, d<22k, and its solution is assumed to be (a×2K+b)2. The ‘a’ is determined by using a bisection method to obtain the floor value of the square root of ‘c’. In order to obtained the value of ‘b’, there is derived a successive substitution equation: b[n]=(c−a2)×22k+(d−b[n−1]2)/22(k+1). An initial value is given to ‘b’ to execute the successive substitution equation recursively several times until the equation is convergent.

Abstract: A reciprocal square root for a radix of x is calculated when S[j] represents the partial result obtained after j iterations of calculation, W[j], a residual, and P[j], the product of an operand X and the S[j]. Firstly, appropriate values are set to the initial values S[0], W[0], and P[0]. Secondly, n iterations of calculations from j=0 to n−1 are performed. One calculation includes selecting a reciprocal square root digit qj+1 from the digit set {−a, . . . , −1, 0, 1, . . . , a}, and calculating a recurrence equation of the S[j], i.e., S[j+1]:=S[j]+qj+1r−j−1, a recurrence equation of the W[j], i.e., W[j+1]:=rW[j]−(2P[j]+Xqj+1r−j−1) qj+1, and a recurrence equation of the P[j], i.e.

Abstract: A circuit and method for deriving an adder output bit from adder input bits, a multiplier circuit, a method of multiplying, a microprocessor and digital signal processor (DSP) employing the circuit or the method and a method of selecting weights and thresholds for logic gates. In one embodiment, the circuit includes: (1) first, second and third logic gates that generate intermediate bits based on threshold comparisons of concatenations of ones of the adder input bits and (2) combinatorial logic that generates the adder output bit from the intermediate bits. In one embodiment, the multiplier includes a summer having at least two inputs with corresponding weights, the inputs corresponding to bits of a multiplicand, the weights based on a multiplier, the summer generating a weighted sum of the multiplicand that represents a multiplication of the multiplicand and the multiplier that is a function of the weighted sum.

Abstract: The inventive mechanism encodes the carry in as well as the operand bits for each place in a binary addition of two streams of bits. The carry ins are encoded as Propagate (Pin), Kill (Kin), and Generate (Gin), with respect to the carry in to a block of bits. Only one of the signals would be high at any time, and the other two would be low. The Pin signal for a bit is true where the bit has a carry in that is the same as the carry in to the block of bits, i.e., the carry in to the block is propagated up to the particular bit. The Kin signal for a bit is true where a carry in to the bit is zero regardless of the carry in to the block, i.e., any carry in to the block is killed before it gets to the bit. The Gin signal for a bit is true where the bit has a carry in of one regardless of carry in to the block, i.e., the carry in to the bit is generated within the block. These signals are used in the calculation of the sum of the operand bits.

Abstract: A method and system is disclosed for automated event polling in a network. A server receives a HTTP request for data from a database on the server. A client generates the HTTP request for the data. The server responds to the request by reformatting the data into an XML format. The server then transmits the data in XML format to the client. The client receives the data transmitted from the server in XML format and converts the data in XML format to a format used by the client software.