Abstract: In the field of computer-based data processing, data sorting is an important issue. Among various sorting methods, Quick Sort is generally used. However, there is a problem that using Quick Sort makes sort time longer if the data to be sorted is already partially or fully in order. The invention solves the above-mentioned problem and makes the complexity of the sorting lower than or at least equal to that of Quick Sort. Thus, it provides a faster sorting method than Quick Sort does.

Abstract: A system ranks results. The system may receive a list of links. The system may identify a source with which each of the links is associated and rank the list of links based at least in part on a quality of the identified sources.

Abstract: Various example embodiments are disclosed. According to one example embodiment, a method may include storing a plurality of database records, storing a value associated with each database record, receiving a request to sort the database records, sorting the database records, and sending a response message.

Abstract: A system for identifying one or more events, each event being characterized by information relating to one or more parameters, the system comprising a means for holding or accessing a table having a plurality of columns and rows, each of one or more columns representing one of the parameters, each of one or more of the rows comprising an identification of one or more of the events for each of the parameters in relation to which information characterizes the one or more of the event(s), pertaining information provided in the pertaining column, means for identifying one or more events characterized by one or more predetermined values and/or intervals of one or more predetermined parameters by identifying one or more rows in which the information of the column(s) representing the predetermined parameter(s) corresponds to the predetermined value(s)/interval(s) and identifying the one or more events from the identification in the identified row(s).

Abstract: Methods and apparatus permit displaying items of datasets resulting from executing queries on a database in an order specified by a hierarchy. The hierarchy has a number of categories arranged in an order. Each item is associated with one of the categories. The items in a dataset can be ordered by determining which category each item belongs to and looking up the ordinal position of that category in the hierarchy. A list of categories represented in the dataset may be provided. Items may be classified in two or more hierarchies. A user may be permitted to select one of the hierarchies according to which the items should be sorted. The criteria used to classify the items may be different from the criteria used to query the database to obtain the dataset.

Abstract: In one embodiment, services are not loaded if they are not needed by the user and if no services needed by the user are dependent upon them. In one embodiment, server services are represented as nodes in a graph data structure. Connections between the nodes indicate dependencies between the server services. The graph is sorted to create an ordered list of services which can be used to startup the services. In another embodiment a server services manager reads license files and user inputs and marks the ordered list of services to indicate which services are to startup.

Abstract: A computer program product and computer system for in-place sorting sequences of binary bits stored contiguously in an array within a memory device of the computer system prior to sorting. Each sequence includes contiguous fields of bits. The algorithm is executed by a processor of the computer system. The in-place sorting executes program code at each node of a linked execution structure. Each node includes a segment of the array. The program code is executed in a hierarchical sequence with respect to the nodes. Executing program code at each node includes: dividing the segment of the node into groups of sequences based on a mask field having a mask width, wherein each group has a unique mask value of the mask field; and in-place rearranging the sequences in the segment, wherein the rearranging results in each group including only those sequences having the unique mask value of the group.

Abstract: Systems and methods for merging data sets are provided herein.

Abstract: A distributed search architecture utilizing multiple processing cores to search multiple files containing time-correlated and logically/semantically interdependent sequential data. A supervisory processing core may provide coordination of the search where multiple slave processing cores each search one or more data files containing time-correlated and logically/semantically interdependent sequential data. Results of the searches performed by the slave processing cores may be provided to the supervisory processing core for consolidation, further analysis and/or presentation.

Abstract: A system for managing construction projects includes a database, a component interface, a state interface, and a database interface. The component interface is operative to receive component identifiers identifying components of a construction project. The state interface is operative to receive state indicators, each state indicator indicating a particular state (e.g., ordered, in transit, installed, inspected, etc.) associated with one of the components. The database interface is operative to store the component identifiers and the associated state indicators in the database. A method of managing construction projects is also described.

Abstract: The present invention relates to a method of cataloguing a data structure and also preferably a method of searching through such as data structure to detect the presence of search patterns within the data structure. The catalogusing method of the present invention employs the formation of a catalogue data structure which is used to associate data items (transformed from data elements present within the data collection) with storage addresses. This catalogue data structure may be sorted to facilitate searching through same. Such searches may be completed through the formation of a plurality of search quries from a received search pattern sequence where the results of running these search queries may then be subsequently considered in conjunction with a search pattern sequence detection process.

Abstract: Systems, methods, and computer readable media to provide a multimedia timeline are disclosed. A first data object is added to a first multimedia timeline. The first multimedia timeline corresponds to a first life event. A first date reference for the first data object is received. The first data object is associated with the first multimedia timeline at a position based on the first date reference.

Abstract: A communication method is disclosed as including the steps of (a) associating sensor with an object; (b) associating a mobile phone or personal digital assistant with a secure token capable of communication contactlessly with the sensor; (c) setting a number of rules of possible allowable ways of interaction between the object and the mobile pone; (d) the sensor obtaining information relating to the object; (e) the secure token initiating and establishing information contactless communication with the sensor and receiving from the sensor the information obtained by the sensor; and (f) the secure token issuing an output on the basis of the rules of possible or allowable ways of interaction and the information received from the sensor.

Abstract: A method for providing chronologic information that is generated by placing one or more pieces of related information according to information about elapsed time is provided. The method includes the steps of obtaining, by an obtaining unit, (i) basic information associating pieces of the related information with the information about time indicating positions on the chronologic information and (ii) information indicating a display form of the chronologic information; and providing, by a control unit, the chronologic information to a user by displaying the chronologic information in a display unit based on the information indicating a display form of the chronologic information by using the basic information.

Abstract: This invention has as its object to easily verify alterations etc. of files stored in a folder. To achieve this object, an information processing method of this invention is a method of applying hash processing to files stored in a folder, which includes a designation step of designating a folder; a first generation step (steps S601 and S602) of generating hash data for each of files included in the folder designated in the designation step; a second generation step (steps S603 to S609) of generating one multiplexed hash data by repeating multiplexing each of the hash data generated in the first generation step in turn according to a predetermined order; and a step (step S610) of storing the multiplexed hash data in association with the folder designated in the designation step.

Abstract: A multi-organizational information management system provides for full lifecycle tracking of business activities of a complex mix of governmental entities and business organizations by maintaining a secure database of data entities or records to track such activities. The system provides for secure sharing of information among the governments and organizations by controlling access to data entities based on organizational membership and assigned role of system users. The system provides flexible structural relationships among the various data entities. A graphic, web-based user interface of the system enables efficient access to the data entities for entry and update of specific data.

Abstract: Provided is a method, system, and program for accessing calendar information of users in a database for presentation by a personal information manager. Scheduled event records for users are maintained within the database. Further maintained in the database is information on a current location of wireless devices of users in the database, wherein one user is associated with each wireless device. Scheduled event records and the current location of a wireless device for a shadowed user are provided from the database to a device operated by a shadower user in the database.