Abstract: A method includes determining, by a conversion tool, at least one specific data associated with an interface of a service of a first application, the determining comprising retrieving metadata associated with the service of the first application, the metadata describing the specific data; and automatically generating, by the conversion tool, a data context for use in requesting the service from the first application, the data context comprising at least one data field for storing the at least one specific data associated with the interface of the service.

Abstract: A search device is provided that extracts and stores field data from document data and displays a search result in a two-dimensional coordinate system whose axes are freely chosen by a user. The search device has a data input unit for inputting input data to the search device, a field extraction unit for extracting field data from the input data, a data storage unit for storing the field data and the input data associated with the field data, a search word input unit for inputting a search word, a search processing unit for searching the field data in the data storage unit based on the inputted search word and for retrieving the input data associated with the found field data, and a display unit for displaying an icon, representing the input data found by the search processing unit, at a position in a coordinate system.

Abstract: Techniques are provided through which “suspicious” web pages may be identified automatically. A “suspicious” web page possesses characteristics that indicate some manipulation to artificially inflate the position of the web page within ranked search results. Web pages may be represented as nodes within a graph. Links between web pages may be represented as directed edges between the nodes. “Snapshots” of the current state of a network of interlinked web pages may be automatically generated at different times. In the time interval between snapshots, the state of the network may change. By comparing an earlier snapshot to a later snapshot, such changes can be identified. Extreme changes, which are deemed to vary significantly from the normal range of expected changes, can be detected automatically. Web pages relative to which these extreme changes have occurred may be marked as suspicious web pages which may merit further investigation or action.

Abstract: A communication management system includes a terminal which has a peer to peer connection to communicate with a node conducting peer to peer communication, a content detector which, when the terminal receives from the node a content of which distribution should be controlled, detects identification information of the content, and a communication control apparatus which refers to the detected identification information to control transmission of the content of which distribution should be controlled.

Abstract: A computing device includes a processing unit, and a system memory connected to the processing unit. The system memory includes instructions that, when executed by the processing unit, cause the processing unit to create: a demographic identification module that retrieves demographic profile information associated with a user and identifies a relevant demographic category based on the demographic profile information; a population search module that categorizes search information from other users within the relevant demographic category as the other users search for information, the search information including search terms used by the other users and destination content reviewed by the other users; and a search result module that filters a search query from the user by applying the categorized search information for the relevant demographic category and presents filtered search results to the user.

Abstract: Methods and computing devices enable users to identify documents using a hash value mapped to a word mnemonic for easy recall and comparison. A hash algorithm may be applied a document to generate a distinguishing hash value. The hash value is mapped to a plurality of words to form the mnemonic. To obtain the words, the hash value may be mapped to word indices used to identify particular words in word lists. Word lists may include a list of nouns, a list of verbs, and a list of adverbs or adjectives, so that the resulting three word mnemonics are memorable. More word lists may be used to map hash values to four-, five- or more word mnemonics. The number-to-mnemonic mapping methods may be used to map large numbers, such as account numbers, telephone numbers, etc. into mnemonics which are easier for people to remember and compare.

Abstract: An exemplary method and/or exemplary embodiment of the present invention provides a system and method for bridging an asset over a multi-tiered network. Generally, communications can be maintained between executable assets residing on different network nodes by bridging the execution context of the two nodes. In an embodiment, a mapping layer can be generated for assets that have run-time dependencies; the mapping layer uses a distribution system to bridge the execution context of a first environment with that of a second environment. The asset executing in the first environment can access another resource located in the second environment, even though the asset does not have local access to the resource in the second environment. A fault is detected when at least one asset deployed on a local node attempts to access at least one resource on a remote node through an application programming interface. The fault is then handled appropriately.

Abstract: Systems, methods and computer program products are provided for creating a new annotation for a data source. According to the method for creating a new annotation, a data source version identifier is generated based on a current version of the data source, and text of the annotation is received. A new annotation record is added to an annotation data store, with the new annotation record including the data source version identifier that was generated and the text of the annotation. In one embodiment, the new annotation record further includes point information indicating coordinates of at least one part of the current version of the data source that the annotation is meant to annotate.

Abstract: Methods, systems, and computer-readable media provide for generating a report indicating job availability. According to embodiments, a method for generating a report indicating job availability is provided. According to the method, a selected assignment group is displayed. A number of status messages received by a technician in the selected assignment group is displayed. The status messages indicate that no jobs are available for the technician. An amount of lost time associated with the technician in the selected assignment group is determined. The lost time includes a difference between a time at which the technician received one of the status messages and a time at which the technician is dispatched to a next job. The amount of lost time associated with the technician in the selected assignment group is displayed.

Abstract: A method and system for managing data can be used to provide a comprehensive solution to retaining electronic data within an enterprise. Data may come from backup tapes or a network. Email files may be separated from other files on the backup tape. Data from the email files may be extracted and fed to a collective database. The other files (from the file backup tapes) and data from the network are processed by a de-duplication engine to remove duplicates of the content while keeping metadata from each copy of the content. The content and metadata are forwarded to the collective database. Filters or other rules may be applied to the collective database to identify compliant or targeted data. Many different operations can then be performed on the compliant and targeted data.

Abstract: Front end preprocessing includes an augmentation function that augments the query with additional query terms that have an associated weighting value. The terms include identifying characters so that they are recognizable as being added by the augmentation module, but are treated as any other query term by all processing components. The terms are selected based on user context, preferences, and likely intent and the confidence levels are used when ranking results.

Abstract: A storage where one NAS server makes snapshot management information including global paths of snapshots based on snapshot identifiers and global paths of file systems corresponding to the snapshots, so that global paths of both the file systems and snapshots are configured on the same global namespace simultaneously, with a directory configuration of the snapshots being the same in configuration layout as a directory configuration of the file systems; the one NAS server informs other NAS servers of the snapshot management information; memory in each of the NAS servers stores the snapshot management information; the snapshot management information includes the snapshot identifier, local path and global path for each of snapshots obtained by each NAS server at each point in time; and the computer obtains the snapshot management information from at least one of the NAS servers and displays at least a part of the snapshot management information.

Abstract: According to some embodiments, a system and method for a parallel join of relational data tables may be provided by calculating, by a plurality of concurrently executing execution threads, hash values for join columns of a first input table and a second input table; storing the calculated hash values in a set of disjoint thread-local hash maps for each of the first input table and the second input table; merging the set of thread-local hash maps of the first input table, by a second plurality of execution threads operating concurrently, to produce a set of merged hash maps; comparing each entry of the merged hash maps to each entry of the set of thread-local hash maps for the second input table to determine whether there is a match, according to a join type; and generating an output table including matches as determined by the comparing.

Abstract: An image transmission apparatus is high in convenience, operability and reliability when newly registering a transmission destination to an address book. The apparatus obtains a list of destination names corresponding to recipients who have registered a recipient setting designating a transmission method; receives from a user a selection of whether to follow the recipient setting; receives from the user (a) if a selection to not follow the recipient setting has been received, a destination name and a transmission method to correspond thereto, and (b) if a selection to follow the recipient setting has been received, a selection of a destination name from the list; in the case of (a), registers the destination name and the transmission method in association as a candidate for the destination; and in the case of (b), registers the selected destination name with an indication that the recipient setting is to be followed, as a candidate.

Abstract: A configuration management system for a storage system including a host computer, a storage device providing a storage area for data processed by the host computer, and a communication network connecting the host computer and the storage device communicatively is disclosed. The configuration management system comprises a system condition table storing a system condition, a storage configuration table storing storage configuration information, a performance table storing a performance condition indicating a storage performance. searching the system condition table is searched using the required system condition and the performance table is searched using the required performance condition. If the storage system satisfying the required conditions fails to be extracted, content of the required system condition is changed and searching of the system condition table and the performance table is carried out.

Abstract: In one aspect, a method, includes changing a production site from a first node to a second node, recording a point in time, Pi, of the production site fail over from the first node to the second node and replicating data from the second node to a third node. The replicating includes determining a latest common point in time, Px, that metadata changes were received between the second node and the third node, adding metadata changes between the time, Px, and a latest point in time that metadata was received at the third node to a delta marking stream on the third node, determining an earliest time, PL, between the time, Pi, and the time, Px, and adding metadata changes from the time, PL, to the latest point in time that metadata was received at the second node to a delta marking stream on the second node.

Abstract: A method and system to process a data search request. The system includes a query controller module to receive the data search request that includes constraints; a reduced constraint builder module to formulate a plurality of search definitions that are formulated to exclude at least one constraint; and a search engine to perform searches of a data source to generate search results and to utilize the search results to calculate counts of data items that respectively correspond to the search definitions. The query controller module communicates the counts of data items and the corresponding search definitions to a client machine. Each of the search definitions is formulated to include a constraint set.

Abstract: A storage system 1 including: a plurality of data storage systems 3000 each including a storage apparatus 5000 providing a data storage area to an external apparatus 1000, and an information processor 4000 controlling data input and output between the external apparatus and the storage apparatus, the storage system comprising; a data attribute information retention part 4420 holding data delete allow/disallow information 4423 and data attribute information 4421 and 4424; a management information retention part 2420 that is a list holding at least one of data attribute information 2421, and data storage location information 2422 of each piece of data; and a data delete control part 4440 receiving a data delete command and controlling a process of deleting the data stored in the storage apparatus based on the command.

Abstract: Provided are methods and systems for distributing an asset to a multi-tiered network node. A pending notice is received from a distribution server. If the notice indicates that at least one asset is pending, i.e., awaiting deployment, an asset descriptor manifest is received from the distribution server. The asset descriptor manifest, which is stored in a memory on a node, identifies at least one asset to be deployed to the node and includes an offset associated with the asset identifier. A fragment, associated with the asset, is received and stored in the memory. The offset associated with the asset is marked with the end of the fragment and a second fragment, beginning at the offset, is received. Additional fragments are received, and the offset updated, until the entire asset is deployed to the node. Alternately, the entire asset or multiple assets are received in the first fragment.

Abstract: Techniques for building a web site with database components include a web site building appliance having a processor, a computer readable medium, and a special purpose operating system. The computer-readable medium carries a web site wizard including a template and instructions. The template holds data indicating a first arrangement of components associated with a first type of web site. The instructions configure the processor for presenting a user with a series of one or more user interfaces including controls for modifying the first arrangement of components. The instructions also configure the processor for receiving input from the user in response to user interaction with the controls indicating a modified arrangement. The instructions further configure the processor for building the web site automatically in response to the input from the user. The web site is based on the modified arrangement.