Abstract: A system and method for automating the performance of substitute fulfillment to assign a replacement worker to substitute for a worker during a temporary absence, performing placement of floating workers, tracking absences and entitlements of workers, notifying interested parties regarding unexpected events and daily announcements, and bidding for temporary workers. Substitute fulfillment, contact, absence, entitlement and notification data is stored centrally in a database on a server at a common site for multiple organizations employing the substitute fulfillment or notification system. When a worker absence is indicated, the system searches the database to obtain a list of potential replacements for the absent worker and tracks the worker's absences and entitlements. The system contacts potential replacements until one is found or until the list is exhausted. The system generates suitable reports and notifies organization personnel of any activity.

Abstract: Systems and methods for protecting transaction information stored in a database of a gaming network. To accomplish this, a transaction signature is generated each time the user completes a transaction on a gaming machine. The transaction signature is generated using transaction information from a particular transaction. The transaction signature and transaction information are stored together in a network database. Upon subsequent access to the transaction information in the database, the transaction signature for the transaction information is recalculated based on the transaction information at that time. The new transaction signature is then compared to the transaction signature previously stored. Any differences between the two transaction signatures may be used to signal unauthorized alteration in the database transaction information.

Abstract: A method and apparatus for authorizing a transaction between a consumer and a merchant over a network where the anonymity of the consumer with respect to the merchant is maintained while still validating the authenticity of the consumer prior to completing the transaction. The method includes registering consumer payment information at a payment server and launching a charge slip application including securely transferring unique transaction information for display to the consumer. The consumer digitally signs the charge slip and encrypts the charge slip and consumer digital signature with a payment server key. The merchant digitally signs the encrypted charge slip data. The payment server authenticates the consumer, the merchant and the transaction details at the payment server and requests authorization of the transaction from a card processor. Upon approval, the payment server returns an approval and shipping information for the consumer to the merchant so that the transaction can be completed.

Abstract: The present invention provides a method and system for representing fuzzy information, and performing fuzzy logic and control operations on that information, using a quantum system. According to one embodiment fuzzy logic and control operations are performed on a quantum computer. The present invention extends quantum information processing beyond purely Boolean-logical information processing, by providing a quantum mechanical method for representing fuzzy information and realizing fuzzy logic and control.

Abstract: The invention provides an arrangement optimization problem processing apparatus for arranging a plurality of nodes in an optimum condition in a two- or more-dimensional space, by which an optimum arrangement of a plurality of nodes can be determined at a high speed even where a node arrangement optimization problem having a large problem scale is to be processed. The arrangement optimization problem processing apparatus includes a hyper node formation section for grouping the plurality of nodes to form a plurality of hyper nodes each formed from a set of nodes, a hyper node arrangement section for executing an optimization problem solution algorithm to determine solutions to a problem of arrangement of the plurality of hyper nodes formed by the hyper node formation section in the generation space and arranging the plurality of hyper nodes in the generation space based on one of the determined solutions.

Abstract: An autonomous system comprises an agent, constituting the behavioural identity of a robot, and a supporting device that is a physical installation which can implement the agent. The agent has a state which has a controlling influence on, and changes during, system operation. The agent's state is distinguishable from, and isolatable from, the permanent parts of the supporting device. The supporting device comprises hardware, software components for operating the hardware, software components for maintaining the agent environment and non-changing parts of the agent implementation, and software components for reading/writing the isolable agent state. An extraction module can extract the agent state and transform it into a representation for transmission across a network. An inserting module can insert a received agent state into the supporting device so as to embody a received agent on that supporting device.

Abstract: An improved binary search tree (BST) balancing facility balances BSTs by copying pointers to the nodes of a BST into a pointer list in accordance with a sequential order of respective data values of the nodes. The balancing facility then builds a balanced BST based on a first index to a first pointer of the pointer list and a second index to a last pointer of the pointer list. In an illustrative embodiment, the balanced BST is built by identifying a central pointer at a midpoint of the pointer list, a left range of pointers before the midpoint, and a right range of pointers after the midpoint. The central pointer is then interpreted as a pointer to a root node, and a balanced left subtree of the root node and a balanced right subtree of the root node are built based on the left range of pointers and the right range of pointers, respectively.

Abstract: A method and apparatus for organizing data pertaining to audiovisual content are described. According to one embodiment, an exemplary method for organizing data pertaining to audiovisual content includes defining at least one descriptive list for a descriptive portion of the data pertaining to audiovisual content, defining at least one accessing list for an accessing portion of the data pertaining to audiovisual content, and generating a matrix that connects the accessing list to the descriptive list.

Abstract: A concept-based indexing and search system indexes collections of documents with ontology-based predicate structures through automated and/or human-assisted methods. The system extracts the concepts behind user queries to return only those documents that match those concepts. The concept based search and retrieval system comprehends the intent behind a query from a user, and returns results matching that intent. The system can perform off-line searches for unanswered user queries and notify the user when a match is found.

Abstract: A database processing system for analyzing a query issued to a database to generate a corresponding execution procedure for performing database processing in accordance therewith. A plurality of columns for storing data each constituted by a set of instances and conditions concerning the instances constituting the plurality of columns are entered. A query is inputted which contains a predicate for evaluating whether a set of instances which meet the designated conditions and which can be identified with the same subscript exists among the sets of instances stored in the plurality of columns. In response to the query, a decision is made as to whether or not an index has been generated for one or plural columns specified in the query predicate. When the index is generated, the index is accessed to acquire an identifier of table data which is “true” for a predicate.

Abstract: A method and apparatus are provided for managing changes to a directory of electronic documents. A custom directory is created and stored based on the contents of a master directory. The master directory comprises a taxonomy of categories. A plurality of electronic documents are classified in one or more of the categories. One or more mappings defines how the documents of categories of the master directory map to categories of the custom directory. Mappings may express merges or splits of categories. One or more judgements may be created and stored in the custom directory in association with documents in the categories of the custom directory. Each judgement expresses whether a document is in or not in a category, or locked out of all categories. Modifications to the master directory are automatically propagated to the custom directory, according to the mapping, but without overriding the judgements in the custom directory.

Abstract: Computer-implemented methods are described for, first, characterizing a specific category of information content—pornography, for example—and then accurately identifying instances of that category of content within a real-time media stream, such as a web page, e-mail or other digital dataset. This content-recognition technology enables a new class of highly scalable applications to manage such content, including filtering, classifying, prioritizing, tracking etc. An illustrative application of the invention is a software product for use in conjunction with web-browser client software for screening access to web pages that contain pornography or other potentially harmful or offensive content.

Abstract: Novel data structures, methods and apparatus for finding a full match between a search pattern and a pattern stored in a leaf of the search tree. A key is input, a hash function is performed on the key, a direct table (DT) is accessed, and a tree is walked through pattern search control blocks (PSCBs) until reaching a leaf. The search mechanism uses a set of data structures that can be located in a few registers and regular memory, and then used to build a Patricia tree structure that can be manipulated by a relatively simple hardware macro. Both keys and corresponding information needed for retrieval are stored in the Patricia tree structure. The hash function provides an n→n mapping of the bits of the key to the bits of the hash key. The data structure that is used to store the hash key and the related information in the tree is called a leaf. Each leaf corresponds to a single key that matches exactly with the input key. The leaf contains the key as well as additional information.

Abstract: A data mining system uncovers patterns, associations, anomalies and other statistically significant structures in data. Data files are read and displayed. Objects in the data files are identified. Relevant features for the objects are extracted. Patterns among the objects are recognized based upon the features. Data from the Faint Images of the Radio Sky at Twenty Centimeters (FIRST) sky survey was used to search for bent doubles. This test was conducted on data from the Very Large Array in New Mexico which seeks to locate a special type of quasar (radio-emitting stellar object) called bent doubles. The FIRST survey has generated more than 32,000 images of the sky to date. Each image is 7.1 megabytes, yielding more than 100 gigabytes of image data in the entire data set.

Abstract: An interactive search system for use primarily with a global computer network, e.g., the Internet, using geographic locations of advertising media to obtain a supply of product-related information for presentation to a user. A computing means may be used to access an implementing server containing a geo-coded database linking product and manufacturer information to geographic locations of advertising media relating to such product and manufacturer. Location data relating to a billboard or signage, whether located indoors or outdoors, can be entered into the computer through manual input of data relating to the city, state or zip code of the billboard. Alternatively, the location of the advertising media can be obtained by a location determination unit, such as a global positioning system (GPS) receiver. In a preferred embodiment, the computing means and location determination units are incorporated into a single device which accesses the implementing server though a two-way wireless communication link.

Abstract: A method of distributing research data from a common database to a user of the common database is provided. Data concerning research results and data upon which the research results are based are stored in a local database and are linked to each other. Data concerning research results and data upon which the research results are based are selectively extracted from the local database to the common database. Research data are then selected by a user of the common database from the extracted data concerning research results and from the data upon which the extracted data are based and the selected research data are distributed to the user.

Abstract: An equipment management system structured by a monitoring apparatus to monitor equipment of a facility being monitored and retrieve operation data, a database apparatus in which the operation data retrieved by the monitoring apparatus is recorded, and a database client apparatus to send and receive information to and from the database apparatus via a network, display the data recorded in the database apparatus, and enter data. The database apparatus records maintenance reference values for the equipment of the facility being monitored and the monitoring apparatus or database client apparatus outputs a display or printout prompting an execution of maintenance work when the operation data is in excess of or close to the maintenance reference values.

Abstract: A data retrieval system is described. The system includes a data server, at least one data retrieval client, a co-presence server and at elast one downloadable co-presence client. The data server retrieves at least one data object from among a plurality of data objects stored in a data repository. The data retrieval client requests at least one data object from the data server. The co-presence server includes a virtual place generator which generates one virtual place per data object retrieved from the data server and an associator which associates each virtual place with its data object once its data object is accessed. The downloadable co-presence client is operative with the data retrieval client and communicates with the co-presence server. Each co-presence client includes an object associator which associates a data object received from the co-presence server with one of the at least one virtual places in the co-presence server.

Abstract: A method and improved data structure for attaching information to words in a trie of nodes. Each node of a trie includes a single tag bit which is interpreted according to information specified in a header of the trie. The information may specify that a node may be tagged with multiple tags, whereby if the tag bit is set in a given node, the node further includes a bitmask indicating which one or ones of the tags apply to that node. A value mask may be provided in the header indicating which of the tags (if any) have values associated therewith, whereby information representative of the value such as the value itself or a pointer thereto is stored in each node tagged with at least one tag having an associated value. Partial enumeration of tagged nodes may be provided by storing a count of the number of tagged words under a node, wherein if a trie has multiple tags, each tag may be selectively and separately enumerated as specified in header information.

Abstract: Method for partitioning a database containing a plurality of documents into desired and undesired type documents, the plurality of documents containing text and/or links to and from other documents in the database, including: providing a source document of the desired type, the source document including a collection of seed documents linked to more similar documents of the desired type than to dissimilar documents of the undesired type; providing a sink document for providing access to the database, the sink document being generic and representative of the database; identifying a cut-set of links which is the smallest set of links such that removing them from the database completely disconnects the source document and its linked documents from the sink document and its linked documents into first and second subsets of documents, respectively; and defining the first subset of documents as desired type documents and the remaining documents as undesired type documents.

Abstract: Disclosed herein is a method for implementing a memory and a memory arrangement. The memory is implemented as a directory structure including a tree-shaped hierarchy having nodes at several different hierarchy levels. The directory structure employs width-compressed nodes in which, non-nil pointers and a bit pattern having one bit for each element, are physically stored. The physical storage location in the node is determined on the basis of the bit pattern. A search table is provided in which numbers of bits having the value 1 are stored in different combinations of a word whose total number of bits is a predetermined portion of the number of bits in the bit pattern.

Abstract: A device for managing data relating to entities which may or may not be known beforehand comprises a central processing unit which, supplied with a suitable program code, is capable of receiving and storing the data in the form of status messages relating to one or more entities. The data is stored in a dynamic structure which for each entity provides space for a unique identification and for a first collection of references to possible subordinate entities and a second collection of references to superior entities. The structure is herein set up such that a status message relating to any entity is likewise valid for each subordinate entity associated with the relevant entity by means of its first collection.

Abstract: A method for obtaining a balanced digital tree structure. The digital tree structure including a first vertical oriented digital tree structure that is susceptible to unbalanced structure of blocks due to modify transactions. The first digital tree including blocks, each, accommodating a plurality of nodes and links originating from the nodes. The method includes the step of constructing few vertical oriented digital tree structure levels. The tress are arranged such that from blocks of a tree in a given level, it is possible to access horizontally all the blocks of the next level, according to a common key value of the accessed block, whereby a balanced horizontal oriented digital tree structure is obtained.

Abstract: This invention is a scaleable system to perform exact matching or similarity matching between a large store of reference temporal media sequences and a query target temporal media sequence. The system is not limited to finding exact matching media segments but also can find media segments that are similar. One kind of similarity between media segments is the similarity between a long commercial and a short commercial, where the short commercial is formed by sub-segments of the longer commercial. Another kind of similarity of two media segment is when they depict three-dimensional actions that are similar and imaged from similar viewpoints. Given a reference media segment, a multitude of features are computed in a consistent way from either predetermined or media content-dependent key intervals. These features are stored in segment index tables along with identifiers of the corresponding reference media segments.

Abstract: A method and system for sharing a catalog in a multiprocessor system is disclosed. The multiprocessor system includes a plurality of host systems. The method and system comprises storing a copy of an entire volume data record of the catalog in a processor. Thereafter, the method and system comprises reading sharing information of the catalog from the processor to the appropriate host system when the appropriate host system needs access to the catalog. For example, in a S/390 parallel processor system an enhanced catalog sharing system (ECS) is utilized in conjunction with the catalogs. In this type of system, a copy of the entire data VSAM volume record (VVR) for an ECS-active catalog is stored in a coupling facility processor. This processor is accessed using components of the S/390 product. When an ECS-active host system needs access to an ECS-active catalog, the sharing information is read in from the coupling facility processor instead of a DASD volume.

Abstract: A file management system is capable of storing the data with a higher usability (reliability) and a higher performance by structuring files for arranging in redundancy the data on a plurality of disk devices, and utilizing characteristics of a file management program (file system) recognizing a mutual relationship between sets of data stored in the plurality of disk devices. The file management system includes a plurality of disk devices 51, 52, 53 and 54, managed in the form of a disk pool, of which at least two disk devices are dynamically selected from the disk pool, for constituting a plurality of files for storing in redundancy any one set of data of user data and meta data for managing how the user data are used, and a file system 1, constituting a part of an operating system 3 of a host computer 2, for managing the plurality of disk devices as the disk pool and managing en bloc the files, based on the meta data.

Abstract: An improved backup system for computer networks provides simplified operation, reduced utilization of computer system resources, and increased recovery potential in the events of information loss. At each backup time interval, the computer system sends all files created or modified since the time stamp to the backup system. The file stream flowing from the computer system to the backup system contains metadata at the boundaries of each file. Once all files are received from the computer system, the backup system produces a new full backup tape by merging the present backup tape with the newly received files, replacing each file on the presently existing tape that was modified with the newer version of that file. The resulting backup tape contains substantially the same set of files that would result from a full backup, or, if desired, a higher level backup.

Abstract: A method for enhancing a commercial transaction via a communications network includes maintaining synchronized updates to databases at different business entities to facilitate accurate transactions between the business entities. A change in configuration data stored in a first configuration database is detected in accordance with a real-time detection procedure. Revision data is transmitted to a second configuration database within a maximum time interval after detection of the change in the configuration data. A second configuration database is updated in accordance with the revision data, such that the configuration data of the first configuration database mirrors configuration data of the second configuration database with respect to at least one commercial transaction.

Abstract: A recording and/or reproducing apparatus for recording and/or reproducing data to and/or from a recording medium having a data area in which data are stored and a management data area in which management data for managing these data are stored. The apparatus according to the invention has a selecting circuit, a reading circuit, and a transfer circuit. The selecting circuit selects, in accordance with a user operation, group management data to be stored in the recording medium. The group management data are stored in the management data area and manage, as a data group, plural data stored in the data area. The reading circuit reads the selected group management data and the data group managed thereby. The transfer circuit transfers the read group management data and the read data group managed thereby to an external device.

Abstract: A data updating apparatus updates a plurality of pieces of data that constitutes a file in a storage medium. The storage medium stores (a) first and second FATs which indicate data storage locations and data sequences and (b) file indexes which each correspond to a file and associate a file name with a storage location of a top piece of data of a file. In the data updating apparatus, an updating unit updates the first FAT, the corresponding file index, and the second FAT in the stated order in updating of the file; a temporary index generating unit generates a temporary index including a storage location of the corresponding file index and new contents of the corresponding file index, and writes it into the storage medium before the first FAT updating; and a temporary index deleting unit deletes the temporary index from the storage medium after the second FAT updating.

Abstract: A method and apparatus for determining a byte select vector for a crossbar shifter include processing that begins by storing data in a first set of byte locations and in a second set of byte locations. Typically, a data operand is written into the first and a shift value is written into the second set of byte locations. The processing continues by obtaining a shift amount value for the data. The processing then continues by determining, for each byte multiplexor of a set of byte multiplexors associated with a corresponding output byte, whether a wrapped condition will occur based on the shift amount for the data. When the wrap condition occurs, a wrap shift amount is determined based on a mode of shifting. The processing then continues by generating a byte select vector for the set of byte multiplexors based on the wrap shift amount and the shift amount.

Abstract: A method and apparatus performing rotate operations using cascaded multiplexers provides a scalable rotator circuit having a sub-field rotate capability that requires no additional interconnects at the sub-field endpoints. The rotator performs bit field swap operations at each stage of a series of cascaded multiplexers. The bit field size increases monotonically from a single bit to half of the rotator operand size. The control logic selects swap operations for each individual bit field at each stage, in order to arrange a desired rotated output vector.

Abstract: There is provided a filtering circuit whose circuit scale is small and which is suitable for a digital data string in which data of luminance signals Y and color-difference signals Cb and Cr are regularly inserted or multiplexed. The digital filtering circuit comprises a delay line composed of a plurality of D flip-flops which is operative with frequency of the data string in which the luminance signals Y and the color-difference signals Cb and Cr are regularly inserted or multiplexed a plurality of multipliers for multiplying a plurality of taps of the delay line by respective coefficients and an adder for adding outputs of said multipliers, wherein the taps connected to the multipliers is switched by selectors. It allows one digital filtering circuit to be used for processing the signals Y, Cb and Cr in a time division manner to realize the digital filtering circuit which uses less multipliers and adders and whose circuit scale is small.

Abstract: In an adaptive type signal estimator, an estimation signal storage unit outputs the first sample signal to which nonlinear distortion is added. A convolution arithmetic unit adds linear distortion to the first sample signal and outputs the second sample signal. A coefficient corrector receives the first sample signal, reception signal, and the determination signal, and corrects the second sample signal. The coefficient corrector obtains a difference signal based on a replica generated from the reception signal and first sample signal and a delayed reception signal obtained by delaying the reception signal by a predetermined period of time, obtains a product signal by multiplying the difference signal by a convergence factor, updates an impulse response value by using the product signal, and outputs the updated impulse response value to the convolution arithmetic unit.

Abstract: A one-dimensional (1D) Inverse Discrete Cosine Transform (IDCT) is applied to an input two-dimensional (2D) transform block along the axis to be modified. Since the one-dimensional IDCT is not performed on the other axis, each block is left in a one-dimensional transform space (called hybrid space). For a shift (merge), the appropriate “m” elements are picked up from one block and the “8−m” elements are picked up from the other block and are used as input to the one-dimensional forward DCT (FDCT) along that same axis. For two-dimensional shifts or merges, the results of the first one-dimensional IDCT and FDCT can be stored with extra precision to be used as input to a second one-dimensional IDCT and FDCT along the other axis. The execution time worst case conditions are approximately constant for all shift/merger amounts. Taking advantage of fast paths can improve the execution times for typical blocks.

Abstract: A decibel level adjustment device that calculates an output signal that is a d decibel multiple of an input signal comprises a plurality of shift circuits, a shift amount control circuit, and adders. The shift circuits shift an input signal by exactly a designated number of bits in a designated direction. The shift amount control circuit receives the value of d as a decibel control value, and in accordance with this decibel control value, generates and outputs control signals that indicate the number of bits to shift and the shift direction of each shift circuit. The adder adds the outputs of the shift circuits.

Abstract: A pipelined linear array of processor elements (PEs) for performing matrix computations in an efficient manner. The linear array generally includes a head PE and a set of regular PEs, the head PE being a functional superset of the regular PE, with interconnections between nearest neighbor PEs in the array and a feedback path from a non-neighbor regular PE back to the head PE. Each PE includes arithmetic circuitry for performing multiply, combine and accumulate operations, and a register file for storing inputs and outputs of the arithmetic circuitry. The head PE further includes a non-linear function generator. Each PE is pipelined such that the latency for an arithmetic operation to complete is a multiple of the period with which new operations can be initiated. A Very Large Instruction Word (VLIW) program or other type of program may be used to control the array. The array is particularly efficient at performing complex matrix operations, such as, e.g.

Abstract: In a counter readout control apparatus comprising a plurality of counters, in which an upper-order counter performs a counting operation upon receiving a carry from a lower-order counter, this apparatus further comprising, a first means for resetting each flag storing memory in which a carry of each counter, with an exception of an uppermost-order counter, is stored (Step S21), a second means for sequentially reading out the plurality of counters from an upper-order counter to a lower-order counter (Step S22 to S25), a third means for, after reading each counter value by means of the second means, testing as to whether the carry is set or not in the flag storing memory (Step S26 to S29), and a fourth means for, in the case in which the carry is set in the flag storing memory, resetting the flag storing memory having the carry (Step S27A, S28A, S29A) and performing a re-read operation only of counters having an order higher than an order of a counter which has been changed due to a reception of the carry (Step

Abstract: A system for learning and applying a task and data parallel strategy to an application that includes at least one task for processing an input data stream to produce an output data stream includes the following components. A controller measuring an execution of the application to generate an action space representing a task and data parallel strategy. A run-time system applying the action space to implement the task and data parallel strategy.

Abstract: Instead of a conventional task scheduler in which tasks having a high priority are preferentially scheduled, so that the execution of tasks with very low priorities is blocked, a “fair scheduler” is proposed in which each task (TA to TE) is assigned a counter (CNT) and a threshold value (THD), with the threshold value specifying a maximum number of execute cycles within which the task need not be executed immediately, and the counter counting those execute cycles within which the task is not executed. At the beginning of each execute cycle, a test is made to determine whether one of the counters exceeds the associated threshold value. If that is the case, one (TD) of the corresponding tasks (TC, TD) is selected by a selection criterion and executed, and its counter is reset. The counters assigned to the remaining tasks are incremented by one, and the execute cycle is repeated if it is found that at least one more of the tasks (TC) is waiting to be processed.

Abstract: In a multi-processor system in which a plurality of threads to be simultaneously executed at a plurality of processors are stored as one thread set at a context area one-to-one corresponding to a thread set provided in a context save area on a main storage, the method of enabling a plurality of processors to start execution of threads simultaneously, in which exclusive arbitration is conducted during exception processing so as to temporarily allow only one processor among the plurality of processors constituting the multi-processor system to obtain kernel scheduler execution authority, and a processor obtaining kernel scheduler execution authority selects a thread set to be executed next and controls such that a plurality of threads in the selected thread set are executed simultaneously at a plurality of processors including its own processor.

Abstract: Execution of a program's instructions in a simultaneous multithreaded processor is halted while the program is waiting for one or more events to occur by first arming an event monitor upon an arm instruction, that is, identifying to the event monitor one or more events to be monitored, such as a modification to a value or state of an identified memory location or group of locations, and setting a watch flag to indicate enable the event monitor. Upon execution of a quiesce request instruction, the program quiesces if the watch flag is set, and a timer is started. Upon observation by the event monitor of an identified event, or upon expiration of the timer, the watch flag is cleared and execution of the program resumes.

Abstract: A system and method for remote control including a control system having a memory and a CPU for sending and receiving control information and instructions at a first location, a software application for manipulating the control information sent and received by the control system resident in the memory, a remote computer system having a CPU and memory at a second location communicating over a communication path with the control system at the first location and one desktop bound software application for manipulating the control information sent and received by the control system accessed by the remote computer system over the at least one communication path resident in the memory of the remote computer system. In variations, the control information includes alarm data, runtime data and historical data.

Abstract: A communication system includes a plurality of desktop controller agents receiving goal commands and invoking a process to achieve the goals. A plurality of resource agents each in communication with an associate device receives and stores goals from a desktop controller agent and operates the associated device in response to goals received from the desktop controller agent. A network interconnects all of the agents and carries goals between the agents. Communications folders for the user agents are maintained and include a log of communications made using devices associated with a respective desktop controller agent. Attachments can be selected to accompany communications made using the devices.

Abstract: A method and apparatus can improve the performance of a server and clients by storing commands sent to the server until a command is received that fills the capacity of the apparatus to store the commands or that will cause the server to provide information beyond acknowledgment of or completion of the command. The commands are then set to the server software for execution. The server then processes as a group the commands stored, returning a single response, and eliminating the overhead that could have been incurred in providing multiple responses or processing the commands separately.

Abstract: A method and apparatus for enabling any of a variety of devices to communicate with each other over a common or universal protocol. In general, a client device and a server device communicate with each other over a communications link utilizes the common protocol. Initially, once a communications link is established, the server device identifies itself to the client device by sending a tag line message over the communications link. Upon receiving the tag line message, the client then determines that the server is capable of using the common protocol. The client device may then initiate several requests including a service request, a type request or a use request. If the client device initiates a service request, the client simple uses the common protocol to request the service. In response to receiving the service request, the server device performs the requested service and provides a confirmation to the client device.

Abstract: A work area detection unit detects the work area in which a user is interested and a user viewpoint calculation unit extracts viewpoint information from the work area. In a dynamic communication group generation unit, the current viewpoint information of each user is accumulated in a user viewpoint information storage unit, a group generation unit generates the group information based on the similarity to the accumulated viewpoint information every time the viewing information is accumulated. In a dynamic communication session control unit, a group information storage unit accumulates the group information, a communication session generation unit generates the environment to assure the communication for all members of each group based on the group information and a communication session deletion unit deletes the group information of the group of only one member.

Abstract: A network linking together one or more servers and a plurality of network terminals which function on a basic software set downloaded from a server and are uses for remotely operating the application software stored in the servers, configured so that a switch-off command can be sent from a server to all network terminal simultaneously and each of said network terminals, and, in response to the switch-off command, checks whether the basic software set being used on the network terminal requires disconnection from the corresponding server prior to switch-off in order to prevent problems caused by switch-off and then switches off the power after disconnection if the basic software set requires disconnection, or otherwise switches off the power immediately without disconnection.

Abstract: A failover algorithm implemented in software, without any failover-specific hardware, that allows servers in a cluster to determine whether a primary or secondary controller is active without requiring communication between the primary and secondary controllers. A server cluster includes several servers coupled to two servers, which are designated as a primary controller and a secondary controller. While the server cluster is operational, either the primary controller or the secondary controller will be actively controlling the cluster. Software running on the servers of the cluster, on the primary controller, and on the secondary controller, cooperates to ensure that each server will properly identify which controller is active at any particular time, including, but not limited to, upon starting up the server cluster, upon adding one or more servers to a cluster that is already operation, and upon failure of an active controller, a server, or a link between an active controller and a server.

Abstract: A remote DMA (RDMA) shim protocol laid atop an existing network data transfer protocol but logically underneath higher level disk and file access protocols specifies the portion of a data packet to be transferred directly into a separate area of memory such as an application layer memory buffer. This RDMA protocol identifies the area of memory into which the data should be delivered, a data ID, data start, data length or end, and flag bits. Option fields added to (or already present in) the transport protocol describe the RDMA transfer. On reception of a packet specifying RDMA, the receiving device delivers the data directly into the correct memory location using the RDMA description data. In some embodiments of the present invention, the RDMA shim protocol is implemented with TCP options specifically introduced to enable RDMA and thus reduce the overhead of transferring and receiving data with a TCP-based protocol such as NFS or HTTP.