Abstract: A system for reconciling object for a configuration management databases employs statistical rules to reduce the amount of manual identification required by conventional reconciliation techniques. As users manually identify matches between source and target datasets, statistical rules are developed based on the criteria used for matching. Those statistical rules are then used for future matching. A threshold value is adjusted as the statistical rules are used, incrementing the threshold value when the rule successfully matches source and target objects. If the threshold value exceeds a predetermined acceptance value, the system may automatically accept a match made by a statistical rule. Otherwise, suggestions of possibly applicable rules may be presented to a user, who may use the suggested rules to match objects, causing adjustment of the threshold value associated with the suggested rules used.

Abstract: According to one general aspect, a method may include establishing a short-range wireless communication between a user device and a point-of-interest (POI) device, wherein the POI device is associated with a POI data structure that represents a physical POI. The method may include receiving a request to perform a POI action in regards to the physical POI. The method may include causing the POI action to be performed.

Abstract: According to one general aspect, a method may include storing, in a memory device, a plurality of floor maps, each floor map indicating the structural layout of a respective predefined physical location. The method may include storing, in a memory device, a plurality of point-of-interest (POI) data structures. Each POI data structure may include a physical location of an associated POI. The method may include receiving a floor map request from a client computing device, wherein the floor map request includes a requested location. The method may include based upon the location included by the floor map request, selecting a selected floor map and a selected subset of the plurality of POI data structures. The method may include transmitting, to the client computing device, a response to the floor map request based upon the selected floor map and the selected POI data structures.

Abstract: According to one general aspect, a method may include receiving a floor map indicating the structural layout of a predefined physical location. The method may also include receiving a point-of-interest (POI) data structure representing a POI and POI metadata associated with the POI. The method may include generating an annotated floor map, based upon the floor map and including a POI indicator, wherein the POI indicator is placed on the floor map at the location of an associated POI and indicates both the type of the associated POI and at least part of the status of the associated POI. The method may include displaying, via a display interface, at least a portion of the annotated floor map.

Abstract: A bit stream analyzer may detect a bitstream representing a streamed content file that is being streamed from a streaming server to a client over a network connection. An encoding rate extractor may determine an encoding rate of the bitstream, and a bit rate extractor may determine a transfer bit rate at which the bitstream is being streamed. A pause calculator may determine a minimum wait time experienced at the client during which playback of the streamed content file is paused, based on the encoding rate and the transfer bit rate.

Abstract: An IMS DEDB database restructure operation creates an empty offline DEDB having the desired structure. The offline database is populated with data from a source (online) database while keeping the source database online (i.e., available for access and update operations). Updates to the source database made during this process are selectively processed in parallel with the offline DEDB load operation. When the contents of the offline database is substantially the same as the source or online database, the source database is taken offline, final updates to the offline database are applied whereafter the offline database is brought online, thereby replacing the source database. It is significant to note that updates occurring to the source or online DEDB are applied to the offline DEDB.

Abstract: According to one general aspect, a method may include receiving a data query request that includes one or more search parameters to be searched for within a plurality of files that are stored according to a hierarchical organizational structure, wherein each file includes at least one data record. The method may include scanning a plurality of files to determine if one or more files match a sub portion of the search parameters. The method may further include parsing the candidate files to determine which, if any, records included by the respective candidate files meet the search parameters. The method may include generating, by one or more result analyzers, query results from the resultant data. The method may also include streaming, to the user device, the query results as at least one query result becomes available and to start streaming before the query requests have been fully generated.

Abstract: According to one general aspect, a method may include receiving, via a first network tap point included by a first network segment, a first portion of network communication data between a client computing device and a server computing device. The method may include receiving, via a second network tap point included by a second network segment, a second portion of network communication data between the client computing device and the server computing device. The method may include attempting to correlate each sub-portion of the first portion of network communication data to corresponding sub-portion of the second portion of network communication data. The method may also include analyzing the correlated network communication sub-portions to generate at least one set of metrics regarding the performance of the network communication between the client computing device and server computing device.

Abstract: Processes and integrations include a method for managing a business process application development lifecycle. The method includes initiating, in a planning stage, requirements for an application based on adding new features to the application or a new application, implementing, in a development stage, a service process node (SPN) as a business process, and managing, in an operations stage, software code representing the application in a production environment. The SPN is configured to encapsulate at least one business service object and generate an interface configured to expose internal processes of the at least one business service object.

Abstract: Elastic packaging of application configuration may include selecting at least one configurable attribute from an application model hierarchy, generating at least one formula for the selected at least one configurable attribute, the at least one formula including interface parameters, and tag the generated at least one formula with the selected at least one configurable attribute in an application deployment package, the application deployment package including an application to be deployed on a cloud computer.

Abstract: According to an example implementation, a computer-readable storage medium, computer-implemented method and a system are provided to detect a plurality of computer events, determine an event severity for each event, select a set of the events having a highest severity of the plurality of events, determine an event category for each event in the set of events, display an event management console including an entry for each event of the set of events, each entry in the event management console including at least an event description and an event severity indicator that indicates event severity, and wherein the displayed event management console also includes one or more evocations for each event category of the set of events, each evocation providing a suggested course of action to address events of the event category.

Abstract: According to one general aspect, a method may include establishing a network tap point near, in a network topology sense, an intranet/internet access point device. The network tap point may provide a substantially non-intrusive means of viewing network communication through the intranet/internet access point. The method may include monitoring, via the network tap point, at least partially encrypted network communication between a client computing device that is within the intranet and server computing device that is within the internet. The method may also include analyzing the monitored at least partially encrypted network communication to generate at least one set of metrics regarding the performance of the network communication between the client computing device and server computing device.

Abstract: Methods and systems enable a database reorganization to occur without a database outage. In one aspect, the method includes pausing transactions directed to the database, keeping a logical view of the database online. The method may also include taking individual partitions offline, changing the names of datasets associated with the individual partitions in a database schema, and bringing the partitions online, all while the logical view of the database remains online. The database schema may be changed to reflect the name of datasets associated with a shadow copy of the database that has been reorganized.

Abstract: A generic discovery methodology collects data pertaining to components of a computer network using various discovery technologies. From the collected data, the methodology identifies, filters and analyzes information related to inter-component communications. Using the communication and application information, the methodology determines reliable relationships for those components having sufficient information available. To qualify more components, the methodology implements a decision service to generate hypothetical relationships between components that are known and components that are unqualified or unknown. The hypothetical relationships are presented to a user for selection, and each hypothetical relationship is preferably associated with an indication of its reliability.

Abstract: A technique is disclosed that avoids index page splits when inserting large numbers of rows into a table of a relational database. Keys in index pages are moved to successive index pages to make room to insert keys on the original index page. Where no room is available on successive pages, a new index page is created to hold moved keys. The result is typically a smaller chain of index pages with better locality than using the conventional insertion technique of splitting index pages.

Abstract: In a computer-displayed graph, indications of multiple attributes or states of an object represented by a node of the graph are displayed using a spotlight, in which attributes of the spotlight correspond to attributes of the object represented by the node. The attributes of the spotlight each correspond to an attribute of the object and may include the color, brightness, and size of the spotlight. The spotlight may be positioned with the node, including overlaying the spotlight on the node and positioning the spotlight relative to the node.

Abstract: Systems, methods and computer readable media for centrally managed impersonation are described. Examples include a system having a central server and a remote shell daemon running on a remote machine, wherein a trust relationship is established between the central server and the remote shell daemon. Examples also include a method wherein a user sends the management system a request to act upon a remote machine. The management system determines whether the user is authenticated for the requested action. Upon authentication, the management system identifies an impersonation policy based on user profile and the remote machine. The management system connects to the remote machine, impersonates an elevated privilege account if required, and executes the user action on the remote machine.

Abstract: A resource monitoring method may include determining, at a first monitoring node, a load level for each monitoring node of a plurality of monitoring nodes including the first monitoring node and a second monitoring node based on a namespace associated with the first monitoring node. The namespace may include an overlay namespace and a local namespace. The local namespace may identify objects being monitored by the first monitoring node. The overlay namespace may include local viewpoints for other monitoring nodes of the plurality of monitoring nodes including the second monitoring node. Each local viewpoint may identify one or more objects that are monitored by a respective other monitoring node. The method may further include prohibiting the first monitoring node from instituting a new object creation request if the load level of the second monitoring node is lower than the load level of the first monitoring node.

Abstract: A copy utility creates a copy of source database objects that is transactionally consistent to a consistent point-in-time, and a recovery utility applies log records to the consistent copy to make a resulting image that is updated as of an identified point-in-time (i.e., the current time or a point-in-time after the copy was made). To effectively recover and apply the logs so that no previously in-flight transactions are lost, the copy utility registers a starting point indicating a point-in-time for logs to be applied to the copy and also registers a smallest lock size used to block access to target data when the copy was made. The recovery utility bases its recovery operations using the registered starting point and the smallest lock size when applying log records to the copy so as not to lose any previously in-flight transactions.

Abstract: Disclosed are methods and systems to provide for using database triggers to maintain a relational persistence of the transitive closure and path structure of an object hierarchy in the form of an object hierarchy bridge table. In one embodiment, database triggers fire when objects or relationships are added or deleted from the hierarchy. Based on the additions and deletions, a delta can be calculated and applied to an object hierarchy bridge table and the graph transitive closure and path structure can be dynamically built and maintained as corresponding changes to the graph occur. Later, more efficient access and retrieval of a graph transitive closure and path structure can be retrieved without necessarily having to perform recursion to calculate the graph transitive closure and path at request time.