Abstract: An approach is provided for providing end-to-end security in multi-level distributed computations. A distributed computation security platform determines one or more signatures associated with one or more computation closures of at least one functional flow. The distributed computation security platform also processes and/or facilitates a processing of the one or more signatures to generate at least one supersignature. The distributed computation security platform further determines to associate the at least one supersignature with the at least one functional flow.

Abstract: An approach is provided for providing energy optimization in multi-level distributed computations. A distributed computation energy optimization platform determines energy availability information associated with at least one level of a computational architecture executing at least portion of one computation closure. The distributed computation energy optimization platform also determines energy consumption information associated with the at least portion of one computation closure. The distributed computation energy optimization platform further processes and/or facilitates a processing of the energy availability information, the energy consumption information, or a combination thereof to determine whether to migrate the at least portion of one computation closure to at least one other level of the computational architecture.

Abstract: An approach is provided for providing multi-level distributed computations. A distributed computation manager receives at least one request to migrate at least one computation closure within a computational architecture, the computational architecture comprising a plurality of architectural levels including, at least in part, a device level, an infrastructure level, and a cloud computing level. The distributed computation manager also determines to select at least one of the architectural levels based, at least in part, on a determination of whether the network infrastructure level can support the at least one computation closure. The distributed computation manager further determines to migrate the at least one computation closure to the selected at least one of the architectural levels.

Abstract: An approach is provided for providing input suggestions. An input generating platform causes, at least in part, presentation of a user interface element including at least one input field. The input generating platform also determines at least one field type associated with the at least one input field. The input generating platform further identifies at least one information store, context store, or a combination thereof based, at least in part, on the at least one field type. The input generating platform also determines to migrate one or more computations for generating one or more suggestions, one or more default values, or a combination thereof for populating the at least one input field, generating the user interface element, or a combination thereof to the at least one information store, context store, or a combination thereof.

Abstract: An approach is provided for providing load balancing in multi-level distributed computations. A distributed computation control platform determines closure capability data associated with respective levels of a computational architecture, wherein the respective levels include, at least in part, a device level, an infrastructure level, and a cloud computing level. The distributed computation control platform also determines functional flow information of the respective levels, one or more nodes of the respective levels, or a combination thereof with respect to at least one set of one or more computation closures. The distributed computation control platform further determines to cause, at least in part, processing at least the closure capability data, the functional flow information, or a combination thereof to determine: (a) a distribution of the one or more computation closures among the respective levels, (b) the one or more nodes, or (c) a combination thereof.

Abstract: 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.

Abstract: An approach is provided for providing persistent computations. A persistent computation manager determines at least one non-volatile memory space of a device. The persistent computation manager also determines at least one other non-volatile memory space of at least one other device. The persistent computation manager further determines to form a persistent memory address space based, at least in part, on the at least one non-volatile memory space and the at least one other non-volatile memory space.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: An approach is provided for construction and aggregation of distributed computations. A distributed computation construction infrastructure identifies an execution context bound to a user context at a device, the execution context corresponding to one or more processes executing at the device. The distributed computation construction infrastructure further causes, at least in part, decomposition of the execution context into one or more closure primitives and respective process states, wherein the one or more closure primitives represent computation closures of the one or more processes. The distributed computation construction infrastructure also causes, at least in part, serialization of the one or more closure primitives, the process states, or a combination thereof.

Abstract: An approach is provided for binding user interface elements and granular reflective processing. An information management infrastructure determines to detect an event, from a first device, for specifying one or more user interface elements for transfer to a second device. The information management infrastructure further identifies one or more processes bound to the user interface elements. The information management infrastructure also determines at least one of a user context, an execution context within the user context, and one or more other execution contexts for the processes, wherein the one or more other execution contexts are from at least one of the user context and one or more other user contexts. The information management infrastructure further causes, at least in part, serialization of at least one of the user context, the execution context, and the one or more other execution contexts.

Abstract: An approach is provided for applying execution context criteria for secure execution context sharing. A criterion application retrieves an execution context of a device. The criterion application determines one or more context criteria associated with the execution context. The context criteria include state information associated with the execution context. The criterion application encrypts the execution context using the one or more context criteria as a public key of an identity-based encryption.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.