Abstract: A method and apparatus for optimizing access to a contextual network are described. The apparatus has a registration manager module, a configuration manager module, an access manager module, and an access optimizer module. The registration manager module registers business applications operating in the contextual network of a server with registration data having a set of parameters to define the business applications. The configuration manager module determines initial configuration settings for the business applications to identify parts of the contextual network relevant to the business applications. The access manager module provides the business applications with access to contextual network data based on distances between nodes in a contextual network graph of the contextual network data. The access optimizer module collects measurements of the access of the business applications to the contextual network data, and computes future optimal configuration settings for the business applications.

Abstract: Communication between an integrated device and a mobile application client on a mobile personal communication device involves a command generated using a mobile application client implemented by non-managed code. The command is received by an operating system, is socket based and conforms with a standard network communications protocol. The command is forwarded to an intermediate module implemented by code executed on the mobile personal communication device and configured for socket based communication according to the standard network communications protocol. After receiving the command, the intermediate module generates a command communication, for receipt by the peripheral device, according to a protocol specific to the peripheral device. The command communication instructing the peripheral device to perform an operation corresponding to the command. The operation is performed using the peripheral device upon receiving the command communication.

Abstract: In an embodiment, a method of computer program compilation is presented. In this method, a compiler for a first programming language is provided. In one example, the first programming language allows a data assignment to depend on a result of a previous data assignment. Source code including a first portion written in the first programming language and a second portion written in a second programming language is accessed, with the second portion representing a data transformation from a first data structure accessible in the first portion to a second data structure accessible in the first portion. In one example, the second programming language prevents a data assignment that depends on a result of a previous data assignment. The source code is compiled using the compiler to generate executable code to be executed by an engine for the first programming language, which includes an interpretation engine to interpret the second portion.

Abstract: There are provided a method, a system and an initiator server for a secure execution of workflow tasks of a workflow to be executed according to a given execution pattern in a distributed workflow management system within a decentralized network system with a plurality of servers (b0, b1, . . . , bn) including at least an initiator server and at least a number of groups of servers of the plurality of servers. Each group satisfies a policy (poli) of a vertex, and thus, knows a corresponding policy key pair including a policy private key (SKpoli) and a policy public key (PKpoli), respectively. Each vertex denotes a set of workflow tasks to be executed in accord with the execution pattern and is assigned a vertex key pair including a vertex private key and a vertex public key.

Abstract: An in-memory computing system for conducting on-line transaction processing and on-line analytical processing includes system tables in main memory to store runtime information. A statistics services can access the runtime information using script procedures stored in the main memory to collect monitoring data and generate historical data and other system performance metrics while maintaining the runtime data and generated data in the main memory.

Abstract: Embodiments provide ideal security, order-preserving encryption (OPE) of data of average complexity, thereby allowing processing of the encrypted data (e.g. at a database server in response to received queries). Particular embodiments achieve high encryption efficiency by processing plaintext in the order preserved by an existing compression dictionary already available to a database. Encryption is based upon use of a binary search tree of n nodes, to construct an order-preserving encryption scheme having ?(n) complexity and even O(n), in the average case. A probability of computationally intensive updating (which renders conventional OPE impractical for ideal security) is substantially reduced by leveraging the demonstrated tendency of a height of the binary search tree to be tightly centered around O(log n). An embodiment utilizing such an encryption scheme is described in the context of a column-store, in-memory database architecture comprising n elements.

Abstract: Embodiments relate to processing encrypted data, and in particular to identifying an appropriate layer of encryption useful for processing a query. Such identification (also known as the onion selection problem) is achieved utilizing an adjustable onion encryption procedure. Based upon defined requirements of policy configuration, alternative resolution, and conflict resolution, the adjustable onion encryption procedure entails translating a query comprising an expression in a database language (e.g. SQL) into an equivalent query on encrypted data. The onion may be configured in almost arbitrary ways directing the onion selection. An execution function introduces an execution split to allow local (e.g. client-side) query fulfillment that may otherwise not be possible in a secure manner on the server-side. A searchable encryption function may also be employed, and embodiments accommodate aggregation via homomorphic encryption. Embodiments may be implemented as an in-memory column store database system.

Abstract: A semantic phrase suggestion engine that provides term and sentence suggestions based on context-specific user groups. Knowledge domains within a semantic network may be automatically derived from user software applications, and each term within the knowledge domain includes meta-data about the terms, e.g., term type and an importance indicator. The indicators may be defined within the context of specific user groups and relate to how many times that group has used the term (e.g., in documents, emails, etc.) The semantic phrase suggestion engine may also include spelling conditions and grammar conditions, which can then provide phrase suggestions according to the conditions and importance indicators, specific to a user group.

Abstract: The disclosure generally describes computer-implemented methods, software, and systems for creating and using two-tier mobile applications. A computer-implemented method includes identifying at least a portion of a database to be associated with a mobile application, retrieving a set of metadata associated with the at least a portion of the identified database, automatically generating a set of mobile application source code for directly accessing the at least a portion of the database based on the set of retrieved metadata, and compiling the set of mobile application source code into a distributable mobile application, the distributable mobile application configured to directly access the identified database associated with the mobile application.

Abstract: Methods and systems of monitoring events occurring in a computer system are provided. An event monitoring instruction including a condition is parsed, the event monitoring instruction expressed using syntax defined in source code, the parsing resulting in an event channel to monitor and the condition. Then execution of an application is paused. The event channel is monitored until an event occurs on the event channel. Then an event handler for the event is run in response to the event occurring on the event channel. The condition is evaluated to determine whether the condition is satisfied. Execution of the application is resumed in response to the condition being satisfied.

Abstract: Methods and apparatus, including computer program products, are provided for implementing a cooperative model between an application and a database. In one aspect, there is provided a computer-implemented method. The method may include receiving from an application a command to perform an operation at a database; accessing metadata representative of the application; configuring, based on at least the metadata, a result of the operation; and sending the configured result to shared memory accessible by the application. Related apparatus, systems, methods, and articles are also described.

Abstract: A business object model, which reflects data that is used during a given business transaction, is utilized to generate interfaces. This business object model facilitates commercial transactions by providing consistent interfaces that are suitable for use across industries, across businesses, and across different departments within a business during a business transaction. In some operations, software creates, updates, or otherwise processes information related to a financial instrument impairment attribute values analytical result business object.

Abstract: A method is provided to manage program code that runs in a computer system comprising: producing a management information structure that identifies a managed system within the computer system; producing a master object definition information structure that provides a mapping between master objects and corresponding managed code objects that run in the computer system; and requesting extraction of information from the managed system identified by the master information structure that relates to managed code objects that the object definition information structure maps to master objects.

Abstract: In one embodiment, a view in a graphical user interface includes a selection area that includes identifiers associated with a plurality of attributes, each of the attributes having a plurality of possible values. The area further includes one or more graphical tools to define filter criteria based at least in part on selected ones of the plurality of possible values of one or more of the attributes. The area further includes one or more switch controls each being associated with a respective one of the one or more of the attributes and indicating presentation criteria including: whether selected ones of the possible values of the respective attribute are to be shown in a report, and a dimension of the report in which to space the selected ones of the possible values from one another if the selected ones of the possible values are to be shown in the report.

Abstract: The disclosure generally describes computer-implemented methods, software, and systems for allowing provisioning of open data protocol (OData) services on top of a generic interaction layer (GenIL). One computer-implemented method includes receiving an OData-compliant request for data, determining a GenIL data provider to receive the OData-compliant request for data, determining the memory location of the data, requesting the data from the determined memory location, receiving the requested data from the determined memory location, converting, using at least one computer, the received data into an OData-compliant format, rendering an OData-compliant response, and transmitting the OData-compliant response.

Abstract: A dynamically updated virtual keyboard may be presented on a touchscreen of a user device by detecting a first hand position on the touchscreen. A virtual keyboard may then be displayed on the touchscreen, the virtual keyboard based on the first hand position. Characteristics of the virtual keyboard, such as size, position, orientation, and selection of the keys can also vary based on the first hand position and on other input features.

Abstract: Described herein is a descriptive framework to facilitate large scale demand responsive transit. In accordance with one aspect of the framework, one or more trip requests from one or more commuter devices are received. A trip request indicates at least one start location and at least one end location. In addition, vehicle information is received from one or more available vehicles. The vehicle information indicates at least one current location of a vehicle. An adaptive route for the vehicle may be planned based on the one or more trip requests and the vehicle information. Update information of the adaptive route may be communicated to the vehicle and the one or more commuter devices.

Abstract: A system may include reception, from a planning application, of a spreadsheet including a plurality of values, presentation of the plurality of values, reception of a first instruction to change a first value of the plurality of values to a second value, presentation, in response to the instruction, of a visual indication in association with the second value, the visual indication indicating that the second value is a fixed value, reception of a second instruction to refresh the spreadsheet, and in response to the second instruction, determination of one or more of the plurality of values of the spreadsheet, each of the determined one or more of the plurality of values presented in association with a visual indication indicating that the value is a fixed value, and transmission of the determined one or more of the plurality of values and a request to refresh the spreadsheet to the planning application.

Abstract: Embodiments provide ideal security, order-preserving encryption (OPE) of data of average complexity, thereby allowing processing of the encrypted data (e.g. at a database server in response to received queries). Particular embodiments achieve high encryption efficiency by processing plaintext in the order preserved by an existing compression dictionary already available to a database. Encryption is based upon use of a binary search tree of n nodes, to construct an order-preserving encryption scheme having ?(n) complexity and even O(n), in the average case. A probability of computationally intensive updating (which renders conventional OPE impractical for ideal security) is substantially reduced by leveraging the demonstrated tendency of a height of the binary search tree to be tightly centered around O(log n). An embodiment utilizing such an encryption scheme is described in the context of a column-store, in-memory database architecture comprising n elements.

Abstract: A system and method to manage networked resources from a central management node. The management node is exposed to a common web services interface for a plurality of managed nodes having different system stacks. The management node and the managed nodes employ a schema to encode arbitrary data corresponding to management requests and responses into web services messages.