Abstract: Methods, systems and articles of manufacture for query building with selectability of aggregation operations and grouping. Abstract queries are composed on the basis of a data abstraction model abstractly describing data in the database. The abstract queries may include result criterions and aggregation operations to be performed with respect to the result criterions for generating aggregation information. An object is generated containing query entities and allowing a user to selectively (i) generate a first executable query corresponding to the abstract query inclusive of the aggregation operation and aggregation logic; and (ii) generate a second executable query corresponding to the abstract query exclusive of the aggregation operation and aggregation logic.

Abstract: The present invention relates to a system and methodology to facilitate automated retrieval and classification of information. A system and associated methods are provided that facilitate generation of code and/or documents. The system includes a component that receives data relating to at least one of a user's request for desired code functionality and one or more desired documents. A mapping component correlates parsed subsets of the data to specific functional objects respectively located remote from the user, wherein a generator employs the functional objects to form at least one of the desired code and the documents.

Abstract: A method prioritizes search results provided to a client according to client satisfaction with previous search results. The method tracks client activity with respect to the previous search results, determines individual client satisfaction for each item according to the tracked client activity, and provides one or more of the items determined to have a high client satisfaction. A user interface provides prioritized search results to a client according to client satisfaction with a previous search similar to the current search. The user interface comprises an item display of at least one item determined to have a high client satisfaction level and at least one item not determined to have a high client satisfaction level.

Abstract: Systems and methods for collaborative searching are described. In an embodiment of the present invention, a database stores previously executed queries and corresponding results. An application server compares an entered query with the previously executed queries. If the application server finds a query that is substantially similar to the entered query, the application server returns the results corresponding to the previously executed query. If no substantially similar result is found, the query is executed against one or more data sources. When results are returned, an embodiment provides the user with the ability to rate them. The ratings are used to determine the similarity of various queries.

Abstract: Disclosed herein is a method for comparing documents. The method includes the steps of: determining a plurality of similarity measures; and determining an overall similarity measure for the plurality of documents, based on the plurality of similarity measures. In one embodiment, the similarity measures are chosen from the group of similarity measures consisting of semantic and reference similarity measures. When comparing documents from the chemical, biochemical or pharmaceutical domains, the determination of the similarity utilizes a determination of structural similarity of the chemical formulas described in the plurality of documents.

Abstract: The version management method according to the present invention by a computer system comprises a repository server 2 and a user terminal 1. The repository server 2 executes a procedure that the file to be updated within the user repository 26 are updated by the user terminal 1, a procedure that the files to be updated within the user repository 26 are updated so as to write the files to be updated on the system repository 22, and a procedure that the file to be updated within the system repository 22 are read by the arbitrary user terminal 1.

Abstract: Server device 60 stores contract identification information with UIM (Universal Identity Module) identification information for identifying a UIM 20 issued in accordance with a subscription contract between a subscriber and a communication carrier for services provided by the communication carrier, the contract identification information identifying the subscription contract. The UIM 20 stores UIM identification information. After receiving the UIM identification information from the mobile station 30, which obtained the UIM identification information from UIM 20, server device 60 transmits the contract identification information corresponding to the UIM identification information to the mobile station 30. Then the contract identification information is stored in UIM 20. Consequently, the present invention allows a communication apparatus to distinguish a user who attempts to use the communication apparatus.

Abstract: A method is disclosed for communicating with multiple data stores. The present invention includes a control module that communicates with a plurality of data stores. The control module is in communication with a connection module. The connection module communicates with a first association module that is in communication with a first data store. The control module communicates with the first data store through the connection module and the first association module. In addition, the first association module communicates with a second association module. The second association module communicates with a second data store. The control module also communicates with the second data store through the connection module, the first association module, and the second association module.

Abstract: To provide a database which has plural log storage areas, and eliminates the sort in the restoration process by means of the application of logs, thereby carrying out the restoration quickly. A management server allocates DB servers to a corresponding one of plural data storage areas so as to access the corresponding one. The DB servers store data to the allocated data storage areas. When the data is referenced or updated, a log representing a data change history is stored in preset log areas for each data server. When the management server transmits a notification to change the data storage areas, area remapping logs are stored in log areas.

Abstract: A method for updating a data record of a database to cancel a deployment of a computer workstation. A status of the deployment is changed from a starting status to a deployed status via intermediate statuses and then the deployment is canceled. From a decision tree stored in the database, a list of identifiers that identifies an ordered list of software routines is generated. An Email message is created that includes a selectable object and a hidden field. The list of identifiers is inserted into the hidden field. The email message is sent to a user. The user's selection of the selectable object is received. The list of identifiers is obtained from the hidden field and the software routines are received from the database. The software routines are executed in their order to update the status from deployed to the starting status via updates to the intermediate statuses.

Abstract: Methods that identify data that is related to and associated with data that has been selected from a multidimensional database. The overwhelming amount of data in a multidimensional database that may be viewed by a user, such as a data analyst, is reduced to the selected and associated data by use of index data and related index data, according to the present invention. The views of selected data and related data may be highlighted and formatted for presentation to the user. Further, irrelevant data is filtered out and not presented to the user. Existing systems have not been able to efficiently and adequately identify data that is related to and associated with selected data in a multidimensional database.

Abstract: An aid server (AS) comprises a processing module (PM) which stores a user identifier (UID) and an identifier (SID) of a stage of an application of the virtual office type, said identifiers being retrieved from a request sent by the terminal and designating an action need by the user. The request (REQt) is sent to a respective application implemented in at least one server (VOSi) which executes the needed action and develops an answer sent to the aid server. A suggestion module (AM) analyzes lists of previously needed user actions to suggest a list of actions which are associated with stage identifiers. A graphics module (GM) incorporates an aid including the suggested actions list into the answer (ANSt) which is sent to the user terminal in order that the user shall select another action from the list of suggested actions.

Abstract: Described are systems and techniques for losslessly restarting subsystems in a distributed file system. By partitioning functionality and logging appropriately across the kernel and user-level boundaries on a client, the user-level subsystem may be made losslessly restartable. In particular, a map assisted state transfer may include receiving one or more state updates, marshaling one or more active data-structures into a marshaled shadow, applying the received state updates to the marshaled shadow and re-instantiating the active data-structures by unmarshaling the marshaled shadow.

Abstract: Embodiments provide for select indexing, which uses an array to simultaneously construct output sets for instructions that operate on input nodesets with common axes. During evaluation of a message against an instruction tree, when a branching node with a large “splay” is iterated over, rather than iterating over an input nodeset with a common axis once per branch, the select indexing described herein iterates over the nodeset once in total. More specifically, the select index data structure includes an array of empty node sets for instructions that both, branch from a branching node, and evaluate input nodes that share a common axis. Identifiers for the input nodeset are compared to indices within the select index, and matches for the input nodes are added to the corresponding nodeset for the appropriate instruction. The results of the evaluation may then be passed to the branches of the select instructions for further processing.

Abstract: A computer-readable medium comprises data structure for providing information about levels of similarity between pairs of N documents. The data structure comprises a plurality of entries of similarity values representing levels of similarity for a plurality of pairs of the documents. Each of the similarity values represents a level of similarity of one document of a given pair relative to the other document of the given pair. The similarity value of each entry is greater than a threshold similarity value that is greater than zero. The plurality of similarity-value entries are fewer than N2?N in number if the similarity values are asymmetric with regard to document pairing, and the plurality of similarity-value entries are fewer than N 2 - N 2 in number if the similarity values are symmetric with regard to document pairing. A method and apparatus for generating the data structure are described.

Abstract: A method, system and computer-usable medium for attributing memory usage are presented. The method includes the steps of creating an object graph of a portion of a memory heap, wherein the object graph includes nodes that represent objects and associated properties of the objects, and wherein the object graph includes connectors that represent relationships between the objects in the memory heap; observing nodes in one or more subgraphs of the object graph, wherein the nodes represent objects that are selected for observation by a pre-determined criteria; searching for characteristic node properties of nodes that are sampled, from the subgraph, for observation; searching for characteristic topological properties of the subgraph that sampled nodes participate in; and applying a set of pre-determined domain-specific pattern matching filters to the node characteristic properties and the topological characteristic properties to attribute memory usage to a proper software component in a system.

Abstract: The present invention is directed to systems and methods for improved prefetching. The present invention reduces the processing time and associated costs of prefetching by incorporating a number of techniques for efficiently searching a node structure. Such techniques eliminate redundant traversal of nodes. Additionally, such techniques do not require locking the node structure to prevent concurrent updates. Furthermore, such techniques may exploit known key ordering information to optimize a search.

Abstract: An image distributing system for distributing an image in which a certain objected character is caught, having a camera system capturing images in which a person who is the objected character is caught; a signal transmitter connecting to the camera system; an image database connecting with the signal transmitter and storing a plurality of image data transmitted by the signal transmitter; a character information database for storing character information for identifying the person caught in the image as the objected character; and an image collecting unit, identifying a person caught in the image, data of which is stored in the image database, as the objected character, and collecting image data in which the objected character is caught.

Abstract: Techniques for recalling details regarding past events include identifying information from encountered remote devices, and storing the received identifying information in a proximity log database. An entry (e.g., a phonebook or calendar entry) stored by a personal information management application is accessed, and a query is generated from parameters provided by a personal information management application. Based on this query, the method searches the proximity log database; and receives a result from the proximity log database as a response to the query. The result identifies a past remote device encounter. Heuristics may be employed to infer data from the result.

Abstract: There is provided an invention in which a buffer size and a data buffering size before a reproduction start can be determined according to a transfer rate of data and a network protocol used. In metadata of a moving image, a dynamic range of a data amount in a buffer is described, and the buffer size and the data buffering size before the reproduction start of the metadata are determined by this dynamic range.

Abstract: A data query system including a first storage medium including a data schema having a data schema query language associated therewith, a second storage medium including an ontology model including classes and properties, the ontology model having an ontology query language associated therewith, wherein constructs of the database schema are mapped to corresponding classes, properties or compositions of properties of the ontology model, and an ontology query processor generating a query expressed in the data schema query language corresponding to a specified query expressed in the ontology query language. A method is also described and claimed.

Abstract: A system and method in a data processing system for recovering data in a file system. A request to modify a data block in the file system is detected. In response to detecting the request to modify the data block, metadata describing the data block in the file system is written in a log. In response to detecting an error during the writing of the metadata, an error counter is incremented. Finally, in response to a request to recover the data in the file system, the metadata is read only if the error counter is less than or equal to a predetermined value.

Abstract: A database recovery method including a computer and a storage system, in which: the storage system includes a disk drive for storing data; the disk drive includes a data volume, a snapshot volume, a database log for storing an update log, and an update journal for storing update information of the data volume; a recovery point for indicating an end point of a range to which the update journal is to be applied and a starting point of a range to which the database log is to be applied is recorded to recover the data volume; and when the database is to be recovered, the update journal is applied to the snapshot volume up to the recovery point, the snapshot volume after the update is switched to the data volume, and the database log after the recovery point is applied to the data volume that is set by switching.

Abstract: A mechanism for querying a label-aware index in the context of versioning is provided. The key of the label-aware index is a composite key and includes a unique label identifier, corresponding to a specific label, and the key of the original index, which key itself may be a composite key. The label-aware index may be implemented as an index-organized table. The label-aware index is organized on disk first by the label identifier and then by the original index key so that queries of versions of resources within a particular label are as efficient as queries on an index of an unversioned repository with the same number of resources.

Abstract: A method for performing data backup operations may involve copying data to be archived from a source system and copying file properties from the source system. The file properties may include archiving properties for at least one data file among the copied data. The data file may then be archived in accordance with the archiving properties. The copied data may be copied from a first host onto a second host. The file properties may also be copied from the first host onto the second host. The file properties may be stored as file attributes or metadata on the source system and may be copied to an archiving server along with the file. Additionally, a method for performing off-host processing of data may involve copying data to be processed from a source system, copying processing instructions from the source system and processing the copied data according to the copied processing instructions.

Abstract: The invention relates generally to archiving data items in an information store. More particularly, the invention provides a computerized method for identifying, in a first information store, a first data item satisfying retention criteria; copying the first data item to a second information store; creating, in the first information store, a second data item containing a subset of the data of the first data item selected based on the data type of the first data item; and replacing the first data item, in the first information store, with the second data item.

Abstract: In a network system in which clients and file servers are connected by networks and a client makes access to a file stored in a disk storage device of a file server via the networks, accessibility to a file of a file server distant from the client tends to be deteriorated. In order to resolve the problem, the file server having the file searches for an appropriate file server in the proximity of the client and transfers the file to the appropriate file server (migration target server). Thereafter, the client makes access to the migration target server for the file.

Abstract: A software program (12) is configured to initiate, process, and terminate user sessions (22, 26). A resource deallocation module (50) is linked to the software program (12) to deallocate allocated external resources of each object of a user session responsive to an impending termination of said user session. An automatic memory management module (40) is invoked by the software program with respect to said user session subsequent to the deallocation performed by the resource deallocation module (50) and prior to the termination of said user session.

Abstract: A compact set of garbage collection tables takes advantage of the redundancies often inherent in live pointer information: multiple call sites in a call stack often share common live pointer information. A call site table lists call site identifiers associated with call stack locations having pointers to heap-allocated data. An associated indirection table (i.e., a descriptor reference table) provides a reference (e.g., an index or a pointer) into a descriptor table, which stores unique descriptors of the call stack locations of interest. The aggregate memory space used by the three tables (i.e., the call site table, the indirection table, and the descriptor table) is typically less than the memory space used by the monolithic live pointer information table.

Abstract: A portable hand-held device for producing output values, such as body mass index calculations, has a hand-holdable housing that includes a memory unit storing a pre-defined non-linear algorithm. A processing unit located in the housing applies the algorithm to input values selected by an input means on the housing, and produces output values via an output means on the housing. The range of selectable input values is pre-defined and is assignable to variables for applying the algorithm. Advertising indicia may be imprinted on the housing, and the housing may be attached to external devices. Optionally, a timing unit, such as a countdown timer, may be included.

Abstract: A random number sequence output apparatus (101) includes a sequence acceptance unit (102) for accepting input of a numerical sequence, an initial value setting unit (103) for accepting an initial value and causing a storage unit (104) to store this, an output unit (105) for outputting a new value stored in the storage unit (104), a calculation unit (106) for applying a predetermined rational map stored in he storage unit (104) each time the output unit (105) outputs a value and further applying a predetermined calculation unit to the value and value extracted from the numerical sequence accepted by the sequence acceptance unit (102), and an updating unit (104) to store the value of the result of calculation performed by the calculation unit (106), thereby performing updating.

Abstract: Method and apparatus for generating random numbers are disclosed. In one aspect, a method for generating random numbers for use in a wireless communication device provides for generating random numbers, gathering a sample of the generated random numbers, and computing at least one metric, such as mean value, standard deviation, and/or entropy. The method further provides for comparing the metric with a corresponding reference value and adjusting the metric based on a result of said comparison so that the generated random numbers achieve a desired distribution. In another aspect, an apparatus for generating random numbers includes an analog noise generator and hardware components for generating random numbers and feedback values to adjust the random numbers. The apparatus further includes a processor capable of executing instructions to carry out control algorithms for adjusting the random numbers.

Abstract: A look-up table outputs an initial value, an inclination of a straight line and a correction value in response to an entry-of a high-order bit string of an operand. An offset circuit calculates an offset of the low-order bit string. A correction circuit outputs the initial value obtained by adding the correction value to at least one of the initial value and the inclination when the correction is necessary. A multiplier calculates a product of the inclination and the offset. An adder calculates the sum of the initial value and the product.

Abstract: A method and system for time sharing N consecutive half-band decimating-by-2-filters using a single filter. Aspects of the method may comprise selecting a latched input signal and filtering, via a single decimating filter, the selected latched input signal to generate a first output signal. The method may also comprise latching the fed back portion of the first output signal. This latched signal may also be filtered by the single decimating filter to generate at least a second decimated output signal. A final output signal may be generated by latching at least one of the first output signal and the second decimated output signal. The final output signal may be latched utilizing at least one of a plurality of clocking signals.

Abstract: Presented herein is a system and apparatus for accelerating arithmetic decoding of encoded data. In one embodiment, there is presented a symbol interpreter for decoding CABAC coded data. The symbol interpreter comprises a first memory, a CABAC decoding loop, and a syntax assembler. The first memory receives a bitstream comprising the CABAC coded data at a channel rate. The CABAC decoding loop decodes the CABAC symbols at the channel rate, and comprises an arithmetic decoder for generating binary symbols from the CABAC coded data at the channel rate. The syntax assembler decodes the binary symbols at a consumption rate.

Abstract: A Fourier transformation algorithm implementation in which accommodation is provided for the output attenuation occurring when an input signal falls intermediate two terms of the transformation output series in its frequency. Corrected Fourier transformation terms, achieved by combining the magnitudes of attenuated Fourier transformation terms generated by the input signal at Fourier transformation frequencies distant to the input signal frequency, in either a vectorial or a scalar combination, are substituted for an attenuated Fourier transformation term according to the invention. Noise correction of the substitute Fourier transformation terms is also provided. The invention is disclosed through use of a global position system signal example that is subjected to a double Fourier transformation filtering process to enhance the incoming signal to noise ratio. Normally occurring 3.9 decibel attenuations in each Fourier transformation step are reduced to about 0.9 decibel each through use of the invention.

Abstract: Bias plays an important role in factor analysis and is often implicitly made use of, for example, to constrain solutions to factors that conform to physical reality. However, when components are collinear, a large range of solutions may exist that satisfy the basic constraints and fit the data equally well. In such cases, the introduction of mathematical bias through the application of constraints may select solutions that are less than optimal. The biased alternating least squares algorithm of the present invention can offset mathematical bias introduced by constraints in the standard alternating least squares analysis to achieve factor solutions that are most consistent with physical reality. In addition, these methods can be used to explicitly exploit bias to provide alternative views and provide additional insights into spectral data sets.

Abstract: In a circuit which adds a partial product {?(Aj*B)*2^j (j=0, . . . , m?1)} to a provisional remainder u by using a value of inferior m bits (m is an integer not less than 2) of a number to be multiplied A and a multiplier factor B, there is provided a multiplication remainder calculator which shifts inferior m bits of a provisional remainder u by continuously connecting m stages of processing circuits which perform addition of a modulus N and one-bit shift, and calculates a Montgomery product of the number to be multiplied A and the multiplier factor B by repeating this processing, wherein a multiple number of the multiplier factor can be calculated by inhibiting one-bit shift of the processing circuits.

Abstract: Described is a programmable logic device (PLD) with columns of DSP slices that can be cascaded to create DSP circuits of varying size and complexity. Each DSP slice includes a plurality of operand input ports and a slice output port, all of which are programmably connected to general routing and logic resources. The operand ports receive operands for processing, and a slice output port conveys processed results. Each slice additionally includes a feedback port connected to the respective slice output port, to support accumulate functions in this embodiment, and a cascade input port connected to the output port of an upstream slice to support cascading.

Abstract: A system and method for network communication, comprising a device coupled between a computer and a network to receive from the computer a Transport Control Protocol (TCP) connection, the device receiving from the network at least one packet associated with the TCP connection and processing a TCP header for the at least one packet, the computer having a memory storing instructions to pass the TCP connection to the device in first and second commands, the first command signaling an intent to transfer of the TCP connection, the second command responsive to an indication from the device that the device is prepared to receive the TCP connection.

Abstract: A method and system for providing enhanced intelligent agents that are moveable by a user from a browser application to a desktop. In specific embodiments, agents provide advanced interactive graphics and communications back to a server.

Abstract: SAS devices provide an OPEN frame when requesting a connection or path to a device. An initiator connection tag value, preferably a 16-bit value, is included in this OPEN frame by the initiator. The initiator connection tag value is included by the target device when the target device reconnects to the initiator. The initiator can use this smaller value in a table lookup to rapidly and easily identify the target device, without requiring decoding of the 64-bit WWN and without waiting to receive a frame containing a tag from the target and decoding that tag.

Abstract: A method and system architecture to manage system resources in such a way as to provide service time guarantees to various classes of work using the system. In the case that the system resources are not sufficient to provide the specified service time guarantees, a method and system architecture is provided to limit work into the system such that the guarantees are satisfied and the revenue derived from the system is maximized.

Abstract: A method for identifying a registered domain name as auctionable is provided. The registered domain names may be pulled from a database of desired domain names, such as a collection of domain names that one or more interested entities have requested to register using a domain name registration system. Requesting a domain name may be probative of demand for the domain name. Accordingly a domain name receiving a threshold level of interest may be tagged as auctionable. For example, a domain name may be tagged as auctionable when a total number of interested entities is at least equal to a minimum threshold of interested entities. Tagged domain names may be acquired by an escrow agent when a current registration expires and auctioned among interested entities. In addition, the owner of a tagged domain name may be notified to see whether the domain name can be auctioned before expiration.

Abstract: The present invention is a system for ensuring client access to paired and unpaired response messages. In the method, the server detects one or more unpaired message which are stored in a data structure on the server. The data structure may be created when the server is staffed or automatically when the first unpaired message is identified. The method then uses a communications protocol between the client and server which allows the client to request on or more of the stored unpaired messages. The system of the-present invention uses a request module configured to receive a client request and prepare the client request for a response generator. The response generator receives the client request from the request module and generates an appropriate response. Next, an unpaired message module analyzes the response message generated by the response generator and distinguishes a paired message from an unpaired message. Then, the unpaired message module stores paired messages in an unpaired response data structure.

Abstract: A collaborative computer telephony system, comprising a communication network; a plurality of integrated computer telephony devices connected to the network and identified by unique IP addresses, at least two of the integrated computer telephony devices supporting collaboration application programs; an indicator on at least one of the integrated computer telephony devices; and a collaborate control program associated with each of the integrated computer telephony devices for detecting commonly supported ones of the collaboration application programs and in response activating the indicator.

Abstract: Distinctively treating digital communications sent by bulk message senders includes providing a set of bulk sender behavior policies and monitoring compliance by a bulk message sender with the set of policies. Based on compliance by the bulk message sender with the set of policies, digital communications sent by the bulk message sender are distinctively treated.

Abstract: A system, method and computer program product are provided for identifying spoofed emails. According to the method, an email addressed to a recipient in a first network is received, with the email including a plurality of headers, and at least one of the plurality of headers including a sender address. It is determined whether the sender address indicates a mailbox from within the first network, and the sender address is modified if it indicates a mailbox within the first network. The email with the modified sender address is sent to the recipient. In one embodiment, a second email is received that is from the recipient and that is addressed to the modified sender address, the modified sender address is modified so as to return it to its original form, and the second email is sent.

Abstract: By using a support program for a web application server according to the present invention, it is possible to completely control an order of executing processes of a processing flow including a transition of a plurality of screens in a web application by a side of the server, and to describe the processing flow as “one unit of executable program code”. Also, it is possible to record, point by point, respective items or the like of an entry form included in an HTML document to be sent to a client in the server as a form ledger, compare and verify the respective items with the items in the form ledger at the time of receiving input data corresponding to the entry form from the client, and thereby to automatically discard an unauthorized input or the like without depending upon the application program, by using the support program for the web application server.

Abstract: A system enables a service provider to provide real time, on-line help to a web page user. When the web page user initiates a help request, a client agent may automatically provide a service provider with information, about the particular web page that is causing the problem, sufficient to enable the service provider to access the web page. The agent also initiates a chat session between the service provider and the client. In this way, the service provider can see the actual web page that is causing the problem and may communicate through the chat session channel with the user. In one embodiment, a chat session dialog box may overlie the associated web page.