| Patent application number | Description | Published |
|---|
| 20090029699 | APPARATUS, METHOD AND COMPUTER PROGRAM PRODUCT FOR PROVIDING A PERCEIVABLE PHYSICAL INDICATION OF SERVICE AVAILABILITY - An apparatus, method and computer program product are provided for directing a device to emit a perceivable physical indication (e.g., noise, light, vibration, smell, etc.), in order to indicate to a user that the device provides a particular service of interest to the user. A user may request a list of the instances of a service (e.g., printer service, audio service, display service, etc.) available within a certain area. Upon receipt of the list of instances of a particular service, the user may select respective instances one by one such that the device on which each instance is executed emits a perceivable physical indication. This physical indication enables the user to determine where the device is located and how it is situated, information which the user can use to determine which device, or instance of the service, he or she should select. | 01-29-2009 |
| 20090254513 | METHOD, APPARATUS AND COMPUTER PROGRAM PRODUCT FOR PERFORMING A QUERY USING A DECISION DIAGRAM - A method, apparatus and computer program product are provided for performing a query using a decision diagram. In this regard, in response to receiving a query instruction a compression value for a query result decision diagram can be determined. A compression value for a compressed query result set may also be determined. A compression ratio can be determined between the compression value for the query result decision diagram and the compression value for a compressed query result set. A query result decision diagram may be generated based on the query instruction and a relationship between the compression ratio and a threshold ratio. The query result decision diagram may also be transmitted based upon a relationship between the compression ratio and a threshold ratio. | 10-08-2009 |
| 20090292716 | APPARATUS, METHOD AND COMPUTER PROGRAM PRODUCT FOR PROCESSING RESOURCE DESCRIPTION FRAMEWORK STATEMENTS - A method is provided that includes receiving a first triple including a subject, predicate and object, where the object is of a literal-type. For the first triple, then, the method includes identifying a subtype of the object; semantically marking the object with the identified subtype, including generating second and third triples; and storing the second and third triples in a triple store. In this regard, the second triple includes the subject and predicate of the first RDF triple as the subject and predicate thereof, and the third RDF triple includes the object of the first RDF triple or a representation of the object of the first RDF triple as the object thereof. | 11-26-2009 |
| 20100054242 | Method, apparatus and computer program to generate a unique node identifier - A method includes receiving a request for a node identifier, the request including a first information element. In response, the method further includes generating a unique node identifier that includes a plurality of second information elements and the first information element; and responding to the request with the generated unique node identifier. Also disclosed are apparatus for performing the method, as well as a computer program embodied on a computer-readable media for executing the method. | 03-04-2010 |
| 20100142402 | Method, Apparatus and Computer Program Product for Determining A Master Module in a Dynamic Distributed Device Environment - An apparatus for determining a master module in a dynamic distributed device environment may include a processor. The processor may be configured to calculate a connectivity stability factor for a module. The module may be included on a device configured to be connected to a distributed device network. The distributed device network may be defined as a network where devices leave or enter the network at any time, such as a smart space. The processor of the apparatus may also be configured to weigh the connectivity stability factor of the module against neighboring connectivity stability factors associated with neighboring modules, and assign a role of master module to the module based on a determination that the connectivity stability factor of the module describes a more stable module than the connectivity stability factors of the neighboring modules. Associated methods and computer program products may also be provided. | 06-10-2010 |
| 20100169345 | METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FOR DETERMINING DATA SIGNATURES IN A DYNAMIC DISTRIBUTED DEVICE NETWORK - An apparatus for determining data signatures in a dynamic distributed device network may include a processor. The processor may be configured to receive a first query and generate a local partial closure of the data identified by the first query. The processor may be further configured to synthesize a data signature of the local partial closure. In this regard, the data signature may be an irreducible polynomial expression and the data signature may be orthogonal to remote data signatures generated from remote partial closures. Further, the processor may be configured to store the data signature in an information store within a dynamic distributed device network. Associated methods and computer program products may also be provided. | 07-01-2010 |
| 20100169346 | METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FOR POLYNOMIAL-BASED DATA TRANSFORMATION AND UTILIZATION - An apparatus for polynomial based data transformation may include a processor. The processor may be configured to identify data that is relevant to a set of one or more queries and generate an information source vector that indicates information sources associated with the data. The processor may also be configured to generate a cyclotomic polynomial based on the information source vector and factor the cyclotomic polynomial to generate a plurality of orthogonal data signatures. Associated methods and computer program products may also be provided. | 07-01-2010 |
| 20110029985 | METHOD AND APPARATUS FOR COORDINATING RESOURCE ACCESS - An approach is provided for coordination resource access. A resource access coordinating application determines the conflict condition among a plurality of queries from a respective plurality of applications for access to an identical resource in an information space. The resource access coordinating application then orders the queries based on one or more characteristics (e.g., read, write, update, delete, read-only, read-update, write-update, write-add, write-add, etc.) of the queries irrespective of the applications. Thereafter, the resource access coordinating application selects one of the queries based on the order. | 02-03-2011 |
| 20110072003 | METHOD AND APPARATUS FOR CREATING AND UTILIZING INFORMATION SIGNATURES - An approach is provided for efficiently searching information in an information space utilizing information signatures. A signature application receives queries over information sources. The signature application, for each of the queries, generates a polynomial by defining the each query against the information sources as input parameters in polynomial form. The signature application provides irreducible polynomials over a finite field of a degree of orthogonality by factoring polynomials generated from the queries. The signature application adjusts the degree of orthogonality of the irreducible polynomials to provide adjusted irreducible polynomials, each of which is a signature and corresponds to a signature fragment, such that the signature fragments have overlapping portions. The signature application causes at least in part storage of the signatures or the signature fragments in a signature domain over an information space. | 03-24-2011 |
| 20110078104 | METHOD AND APPARATUS OF CONSTRAINT VERIFICATION IN DISTRIBUTED INFORMATION SPACES - An approach is provided for verification of information consistency in distributed information spaces using binary decision diagrams. A binary decision diagram construction platform constructs an augmented binary decision diagram for the information based on the logical rules defined in an ontology and transmit the diagram to the server managing information sharing. The server uses the type constraints and the cardinality constrains encoded in the diagram to verify consistency of information in information spaces. Therefore, even if the managing server has no access to the ontology, information consistency constraints can be transmitted to the server over the communication network in the form of binary decision diagrams and the information consistency can be verified locally without having to transmit the whole information space over the network to be verified in a remote location. | 03-31-2011 |
| 20110078166 | METHOD AND APPARATUS FOR CREATING AND UTILIZING INFORMATION REPRESENTATION OF QUERIES - An approach is provided for creating and utilizing information representation of queries. A query application receives a query. The query application expresses the query as a resource description framework graph. The query application causes at least in part storage of the query resource description framework graph. | 03-31-2011 |
| 20110125881 | METHOD AND APPARATUS FOR OPTIMIZING DISTRIBUTION OF INFORMATION AND QUERIES IN INFORMATION SPACES - An approach is provided for managing symmetric and asymmetric communication among information spaces with respect to their distributed nature. An information space is composed of semantic information brokers that handle internal processes of the information space. One or more of the semantic information brokers compute a stability factor corresponding to each of a plurality of semantic information brokers in an information space. The one or more semantic information brokers then select one or more of the plurality of semantic information brokers as a master semantic information broker based on the computed stability factors. The one or more master semantic information brokers manage communication among the plurality of semantic information brokers. | 05-26-2011 |
| 20110145303 | METHOD AND APPARATUS FOR RECYCLING INFORMATION FRAGMENTS IN INFORMATION SPACES - An approach is provided for recycling information fragments in information spaces. An information management system detects a plurality of information management processes occurring in an information space. The information management processes retrieve one or more information fragments from the information space. The information management system then determines a sequence of states for each of the plurality of information management processes over a period of time and calculates a state trajectory from each of the sequence of states. The calculated state trajectories are used to predict a finite set of possible future states. The information management system uses the prediction to determine which of the one or more information fragments are recyclable and preserves the recyclable information fragments for responding to a subsequent request directed to the information space. | 06-16-2011 |
| 20110161285 | METHOD AND APPARATUS FOR PROVIDING AUTOMATIC CONTROLLED VALUE EXPANSION OF INFORMATION - An approach is provided for automatic controlled value expansion of information. A value expansion controller detects a request at a device to perform an information operation on a set of data elements of an information space, wherein the request identifies the set by a name and the information operation applies to each data element within the set. The value expansion controller intercepts the request based on the detection and determines the location of the data elements within a communication network based on the name. The value expansion controller retrieves the data elements from the location and populates an expansion table with the retrieved data elements, wherein the expansion table is correlated to the set. The value expansion controller performs the information operation on each data element in the expansion table and causes transmission of one or more results of the information operation to the device. | 06-30-2011 |
