Abstract: Embodiments of the invention provide systems and methods to implement an object memory fabric. Object memory modules may include object storage storing memory objects, memory object meta-data, and a memory module object directory. Each memory object and/or memory object portion may be created natively within the object memory module and may be a managed at a memory layer. The memory module object directory may index all memory objects and/or portions within the object memory module. A hierarchy of object routers may communicatively couple the object memory modules. Each object router may maintain an object cache state for the memory objects and/or portions contained in object memory modules below the object router in the hierarchy. The hierarchy, based on the object cache state, may behave in aggregate as a single object directory communicatively coupled to all object memory modules and to process requests based on the object cache state.

Abstract: An apparatus in one embodiment comprises a multi-tier storage system having at least a front-end storage tier and a back-end storage tier. The storage system comprises a software-defined storage controller configured to implement the front-end storage tier as a unified memory cluster accessible to respective processors of a plurality of compute nodes. The software-defined storage controller is implemented using at least one processing device comprising a processor coupled to a memory. The unified memory cluster in some embodiments comprises portions of respective memories of at least a subset of the compute nodes. The portions of respective memories of at least a subset of the compute nodes may comprise, for example, respective flash memories of those compute nodes, or respective dynamic random access memories of those compute nodes. Other illustrative embodiments include systems, methods and processor-readable storage media.

Abstract: Provided are a computer program product, system, and method for managing multiple locks for data set members in a data set index. The data set index has leaf nodes and internal nodes. In response to determining that a current lock is set at a locked node that prevents a grant to a requested lock, a determination is made as to whether there are different first and second descendant nodes from the locked node at a same level of the tree data structure linked to the requested data set member and the locked data set member, respectively. If so, the requested lock for the requested data set member is set at the first descendant node, the current lock is moved to the second descendant node for the locked data set member and the requested lock is granted.

Abstract: An apparatus in one embodiment comprises a plurality of compute nodes each having a processor coupled to a memory. The apparatus further comprises a storage system configured for communication with the compute nodes over at least one network, with the storage system comprising a software-defined storage controller configured to implement an in-memory database accessible as a unified memory cluster to respective processors of the compute nodes. The in-memory database comprises portions of respective memories of the compute nodes. The in-memory database may be expanded, for example, using an additional portion of the memory of one of the compute nodes, responsive to an overflow event associated with the memory of another one of the compute nodes. The compute nodes may illustratively comprise respective analysis nodes that run respective applications configured to utilize analytics functionality of the in-memory database.

Abstract: A first request may be received to update a first set of values. The first set of values may be stored at a first location within a first data page of a database. The first location may be read-only. In response to the receiving of the first request, a first set of records may be inserted into a second data page. The first set of records may include the update of the first set of values. In response to the inserting, a forward pointer may be stored in the first data page that points to the first set of records on the second data page. One or more committed values may be identified on the second data page. In response to the identifying, the one or more committed values may be merged from the second data page to a third data page.

Abstract: Techniques are disclosed for integration, provisioning and management of entities and processes in a computing system such as, by way of example only, business entities and business processes. In particular, techniques are disclosed for ontology based resource provisioning and management for services. For example, such an ontology based approach can be utilized in conjunction with a business support system which may be employed in conjunction with a cloud computing environment.

Abstract: A first request may be received to update a first set of values. The first set of values may be stored at a first location within a first data page of a database. The first location may be read-only. In response to the receiving of the first request, a first set of records may be inserted into a second data page. The first set of records may include the update of the first set of values. In response to the inserting, a forward pointer may be stored in the first data page that points to the first set of records on the second data page. One or more committed values may be identified on the second data page. In response to the identifying, the one or more committed values may be merged from the second data page to a third data page.

Abstract: An entry insertion apparatus (2000) inserts an entry into a node (3000) having a plurality of partial areas (3020) in which W (W being a positive integer equal to or greater than 2) or less entries are stored. Each entry can be searched for using an SIMD instruction to execute the same processing for the W entries in parallel. The entry insertion apparatus (2000) includes an insertion unit (2020) that inserts a new entry into the partial area (3020) in which the number of stored entries is 1 or more and less than W among the plurality of partial areas (3020), and a sorting unit (2040) that sorts the entries stored in the partial area (3020) when the number of entries stored in the partial area (3020) into which the new entry has been inserted is W.

Abstract: Systems and methods described herein utilize supervised machine learning to generate a figure-of-speech prediction model for classify content words in a running text as either being figurative (e.g., as a metaphor, simile, etc.) or non-figurative (i.e., literal). The prediction model may extract and analyze any number of features in making its prediction, including a topic model feature, unigram feature, part-of-speech feature, concreteness feature, concreteness difference feature, literal context feature, non-literal context feature, and off-topic feature, each of which are described in detail herein. Since uses of figure of speech in writings may signal content sophistication, the figure-of-speech prediction model allows scoring engines to further take into consideration a text's use of figure of speech when generating a score.

Abstract: Implementing a Bloom filter index as a hierarchical data structure. Bloom filters are received and their bit vectors are decomposed into successive bit sequences. For each bit sequence except the last one, memory for at least storing a pointer to a memory location on the next level is allocated on the level corresponding to the bit sequence. The pointer storage is labeled by the value of the next bit sequence. A pointer to the allocated memory is stored in the pointer storage on the previous level that was labeled by the binary value of the current bit sequence. For the last bit sequence, memory for storing Bloom filters is allocated on the last level. A pointer to the allocated memory is stored in the pointer storage on the second-to-last level that was labeled by the value of the last bit sequence. The Bloom filter is stored in the allocated memory.

Abstract: In one implementation, a system for network tool synchronization includes a methodology engine to receive a data methodology of an enterprise architecture tool from the enterprise architecture tool. In addition, the system includes a functionality engine to analyze deployment diagrams of an orchestration tool to determine a functionality of the orchestration tool. In addition, the system includes an architecture engine to select information from the enterprise architecture tool based on the functionality of the orchestration tool. In addition, the system includes an information engine to export the selected information to the orchestration tool.

Abstract: A map of a facility is provided. Dispatch instructions for dispatching a mobile device from a starting location to the facility at a destination within a geographical area are received, and a current location of the mobile device is detected as the mobile device moves from the starting location towards the destination. The map of the facility is received based on the dispatch instructions and the current location of the mobile device, and the map of the facility is provided.

Abstract: A method, a system and a computer program product for storing one or more volume attributes in a database. The system receives one or more volume attributes which are associated with one or more volumes within a storage system. One or more search terms are assigned to the volume attributes. The one or more volumes and one or more volume attributes are dynamically associated with a location of the one or more volumes. The system assigns the one or more search terms, the one or more volume attributes, and the location of the one or more volumes to the database. The database is stored at a local database and/or an external database. When one or more of the volume attributes are identified during an inquisition for the one or more volumes, the volumes are dynamically retrieved from one or more of the local database and/or an external database.

Abstract: The present disclosure proposes a new model engineering method and system that permits the creation of application systems without the need of program development. The system allows organizations to search for high performance development teams and methods, and develop high quality solutions. The present disclosure covers the three central areas of systems engineering: (1) a method for creating models which represent reality in a standardized way; (2) a procedure for transforming models into computable artifacts, that is, computer systems that behave as specified in the model; and (3) a collaborative method based in knowledge representations.

Abstract: A method, apparatus, and computer program product are disclosed to generate elementary string sets for unit testing regular expressions. In the context of a method, a regular expression is received. The method also creates a deterministic finite automaton based on the regular expression. In addition, the method generates an elementary string set using the deterministic finite automaton. The elementary string is generated to test software that uses the regular expression.

Abstract: Techniques are disclosed for integration, provisioning and management of entities and processes in a computing system such as, by way of example only, business entities and business processes. In particular, techniques are disclosed for implementing an extensible support system for multiple service offerings. For example, such a support system can be a business support system which may be employed in conjunction with a cloud computing environment.

Abstract: Hierarchical data objects are indexed using an index referred to herein as a hierarchy-value index. A hierarchy-value index has, as index keys, tokens (tag name, a word in node string value) that are extracted from hierarchical data objects. Each token is mapped to the locations that correspond to the data for the token in hierarchical data objects. A token can represent a non-leaf node, such as an XML element or a JSON field. A location can be a region covering and subsuming child nodes. For a token that represents a non-leaf node, a location to which the token is mapped contains the location of any token corresponding to a descendant node of the non-leaf node. Thus, token containment based on the locations of tokens within a hierarchical data object may be used to determine containment relationships between nodes in a hierarchical data object.

Abstract: One embodiment of the invention includes a computer interface system. The system comprises a user interface screen configured to display visual content and an input system configured to detect a presence of an input object within a threshold distance along a normal axis of the user interface screen. The system further comprises a graphical controller configured to magnify a portion of the visual content that is located at an approximate location of a base of the normal axis on the user interface screen.

Abstract: Techniques are disclosed for integration, provisioning and management of entities and processes in a computing system such as, by way of example only, business entities and business processes. In particular, techniques are disclosed for ontology based resource provisioning and management for services. For example, such an ontology based approach can be utilized in conjunction with a business support system which may be employed in conjunction with a cloud computing environment.

Abstract: A data classification method which classifies a plurality of data into a plurality of classification items based on a feature quantity included in the data, the method includes calculating, by a processor, an appearance probabilities in which training data including the feature quantity appears in the classification items in a distribution of the data, generating, by the processor, a rule having the feature quantity and a weighting of the feature quantity based on a plurality of the training data having the feature quantity based on the appearance probabilities; and classifying, by the processor, the plurality of data according to the rule.

Abstract: Various embodiments relate to a system and related method for scanning active instances of an application within a system. Unique identifiers in the form of fingerprints, tags, or metadata can be associated with a target application. A manager can then scan the process tables and file system directories of the servers within the system to find active processes and stored files that include the unique identifier. In some embodiments, the manager scans the active processes while they are running to search for the unique ID within the process' command line structure. In some embodiments, the manager also finds processes or files that do not have the unique identifier, but were previously associated with the unique identifier. The manager can then report the server and application information to user. Such information can include which of the one or more servers has the target application as an active process.

Abstract: A method for detecting abnormal subsequences in data sequence includes constructing a hierarchical data structure of a target subsequence, each node in a bottommost layer of the data structure storing corresponding data of the target subsequence, and each node in a layer above the bottommost layer storing values based on data stored in corresponding nodes in a lower layer next to the layer above the bottommost layer; determining a second number of neighbors of the target subsequence based on the data structure of the target subsequence and of the first number of reference subsequences constructed in advance, the second number of neighbors having minimum Euclidean distances from the target subsequence; determining a third number of neighbors of each reference subsequence in the second number of reference subsequences, which have minimum Euclidean distances from each reference subsequence and determining whether the target subsequence is an abnormal subsequence.

Abstract: A method for detecting abnormal subsequences in data sequence includes constructing a hierarchical data structure of a target subsequence, each node in a bottommost layer of the data structure storing corresponding data of the target subsequence, and each node in a layer above the bottommost layer storing values based on data stored in corresponding nodes in a lower layer next to the layer above the bottommost layer; determining a second number of neighbors of the target subsequence based on the data structure of the target subsequence and of the first number of reference subsequences constructed in advance, the second number of neighbors having minimum Euclidean distances from the target subsequence; determining a third number of neighbors of each reference subsequence in the second number of reference subsequences, which have minimum Euclidean distances from each reference subsequence and determining whether the target subsequence is an abnormal subsequence.

Abstract: The invention relates to a computer system and a corresponding method and a corresponding computer-readable medium. The computer system is suitable for determining the result of a join. Based on the access pattern of an application, the computer system infers that a particular subjoin is empty. The computer system then excludes the inferred-empty subjoin when performing the join, performing a more efficient and faster database join operation.

Abstract: Disclosed are methods and apparatuses for viewing hierarchical data. One disclosed approach provides a method and system for viewing and navigating through hierarchical data while maintaining a hierarchical context that allows for the user to traverse up and down the hierarchy.

Abstract: A system to enable restoration of a tree structure based on serialized data, and extraction of partial data that includes information of the tree structure from original data. A searching part identifies sequence elements of serialized data using a searching process. An essential element string identifying part identifies a sequence element string (essential element string) that includes the searched sequence elements. A rear section identifying part identifies a sequence element string that includes sequence elements located after the essential element string and is required to form a subtree that includes nodes corresponding to all the sequence elements of the essential element string. A front section identifying part identifies a sequence element string that includes sequence elements located before the essential element string and is required to form a subtree that includes nodes corresponding to all the sequence elements of the essential element string.

Abstract: Data processing includes accessing a product category tree, the product category tree comprising a plurality of hierarchical levels. A leaf category level of the plurality of hierarchical levels comprises a leaf category node. The leaf category node includes product information. The product information comprises a plurality of product attribute parameters. The plurality of product attribute parameters comprises standard product information. Data processing further includes selecting, among the plurality of product attribute parameters that correspond to the leaf category node, a representative product attribute parameter that is representative of the product information; and partitioning standard product information of the leaf category node to obtain a plurality of sets using the representative product attribute parameter, wherein each of the plurality of sets includes at least some of the standard product information.

Abstract: A method and apparatus relate to recognizing anchored patterns from an input stream. Patterns from a plurality of given patterns are marked as anchored patterns. An anchored state tree for the anchored patterns of the plurality of given patterns is built, including nodes representing a state of the anchored state tree. For each node of the anchored state tree, a failure value equivalent to a node representing a state in an unanchored state tree representing unanchored patterns of the plurality of given patterns is determined.

Abstract: A parsing method and system. The method includes generating an n-gram model of a domain and computing a tf-idf frequency associated with n-grams of the n-gram model. A list including a frequently occurring group of n-grams based on the tf-idf frequency is generated. The frequently occurring group of n-grams is transmitted to a deep parser component and a deep parse output from the deep parser component is generated. The deep parse output is stored within a cache and a processor verifies if a specified text word sequence of the deep parse output is available in the cache.

Abstract: A method includes receiving streaming data to be processed by a plurality of processing elements comprising one or more stream operators. Time metadata may be added to a parent tuple at a first stream operator. A first time metric may be determined for a first child tuple of the parent tuple at a second stream operator. The first time metric may be determined, at least in part, from the time metadata. The second stream operator may receive the first child tuple from the first stream operator. The method may include transmitting a second child tuple of the parent tuple from the second stream operator to a third stream operator if the time metric is inside a time limit. In addition, the method may include ending processing of the first child tuple if the time metric is outside of the time limit.

Abstract: A method of automatically identifying and extracting distributed online resources may include locating in a website a candidate entry list page. The method may also include verifying the candidate entry list page as an entry list page using repeated pattern discovery. The method may also include segmenting the entry list page into a plurality of entry items. The method may also include extracting from the plurality of entry items a plurality of candidate target pages. The method may also include verifying at least some of the candidate target pages as target pages including analyzing a visual structure and presentation of the candidate target pages. The method may also include extracting metadata from the target pages. The method may also include organizing the target pages and/or the metadata in one or more databases.

Abstract: Methods, machines, and stored instructions are provided for determining hierarchical paths to nodes based on stored information about the nodes. A node analyzer analyzes a hierarchy to create mappings that represent the hierarchy. The mappings may include a “parent mapping” that maps selected-level nodes to parent nodes of the selected-level nodes, and a “path mapping” that maps a plurality of nodes other than the selected-level nodes to a plurality of paths, within the hierarchy, to the plurality of nodes. A path module then determines path(s) to specified node(s) at least in part by mapping the specified node(s) to particular parent node(s) of the specified node(s) using the parent mapping. The path module also maps the particular parent node(s) to particular path(s) using the path mapping. The information from the path and parent mappings may be assembled to form path(s) within the hierarchy to the specified node(s).

Abstract: A tree building system that accesses data from a social networking site and, in some embodiments, other data sites having information that may pertain to the relationships between users of the social networking site. A rules engine within the system implements logic for analyzing the data from the social networking site. The system provides a candidate list of possible relatives for selection by a user and solicits information from the user through the use of guided questions.

Abstract: A system and method of operating a filesystem for managing filesystem objects is disclosed. The filesystem objects are characterized by metadata parameters included in a global directory object arranged in a plurality of global directory object (GDO) pages. Responsive to receiving a request for creating a new filesystem object, a parent key is obtained. The parent key is indicative of an identifier of a direct parent directory requested for hosting the new filesystem object. A target page that corresponds to the parent key is located within the plurality of GDO pages. The target page further includes a direct parent directory metadata record associated with the direct parent key and includes metadata parameters related to the direct parent directory. An object key is created as corresponding to the same target page, thereby enabling accommodation of an object metadata record, related to the new filesystem object, on the target page.

Abstract: Various embodiments relate to a system and related method for retrieving configuration information of a computer network. Unique identifiers in the form of fingerprints, tags, or metadata can be associated with a target application. A manager can scan process tables and file system directories of servers within the system to find processes and files that include the unique identifier. The manager can save the server and application information in a configuration database that can subsequently be searched. Such information can include which of the one or more servers has the target application as an active process.

Abstract: A context-based graphical database system for storing a data structure comprises an entity node that stores an identifier of an entity. A data node stores non-contextual entity data about the entity. At least one context node is linked to the data node. The at least one context node provides context to the non-contextual entity data in the data node to create contextual entity data. A pointer from the entity node to the data node returns a data node identifier to the entity node to link the contextual entity data to the entity.

Abstract: Improved sorting techniques are provided that perform a parallel sort using a ranged, partitioned key-value store in a high performance computing (HPC) environment. A plurality of input data files comprising unsorted key-value data in a partitioned key-value store are sorted. The partitioned key-value store comprises a range server for each of a plurality of ranges. Each input data file has an associated reader thread. Each reader thread reads the unsorted key-value data in the corresponding input data file and performs a local sort of the unsorted key-value data to generate sorted key-value data. A plurality of sorted, ranged subsets of each of the sorted key-value data are generated based on the plurality of ranges. Each sorted, ranged subset corresponds to a given one of the ranges and is provided to one of the range servers corresponding to the range of the sorted, ranged subset. Each range server sorts the received sorted, ranged subsets and provides a sorted range.

Abstract: A method for scheduling a backup of digital data includes determining whether a backup has previously been performed within a predetermined period. It is then determined whether a connection to a backup server is available. It is then decided whether to initiate a backup of digital data within a present time slot based at least in part on a randomly generated value when it is determined that a backup has not previously been performed within the predetermined period and it is determined that a connection to the backup server is available. The digital data is backed up to the backup server when it is decided that the data backup is to be initiated.

Abstract: Approaches enable image content (e.g., still or video content) to be displayed in such a way that the image content will appear, to a viewer, to include portions with different locations in physical space, with the relative positioning of those portions being determined at least in part upon a current relative position and/or orientation of the viewer with respect to the device, as well as changes in that relative position and/or orientation. For example, image content can be grouped or otherwise contained or assigned to different planes, levels, or other such groupings of content. The planes of content can enable image content included within those planes to be displayed to provide a viewer with an appearance or view of the content that appears to be positioned and/or displayed in 3D space. As that viewing angle changes, the content can be re-rendered or otherwise updated to display the image content from a perspective that reflects the change in viewing angle.

Abstract: Technologies are generally provided for progressive key value store switchover by evaluating a maturity of a migrated data store and allowing piecewise switching of substructure area query servicing from an origin data store to a destination data store. In some examples, abstractions of origin and destination tree structures may be compared to each other in order to generate an evaluation metric at substantially reduced performance evaluation load. The evaluation metric may target performance sampling while assuring a desired performance level with localized query servicing switchover. Piecewise data transfer may also be optionally enabled such that overall storage can be similar to the storage of a single data store copy while reducing an impact on existing data store services.

Abstract: A system of portable and flexible deployment of dedicated and virtual servers comprises a plurality of geographically-dispersed data centers comprising a plurality of dedicated servers, a plurality of hosts operable to host a plurality of virtual servers, a management workstation operable to capture dedicated and virtual server images, an image repository operable to store the captured server images, and an intra-data center networking infrastructure enabling communication within the data center. An integrated management system is operable to control and manage deployment of server images to dedicated and virtual servers located in a user-specified data center, and an inter-data center networking infrastructure enables communication between the plurality of data centers.

Abstract: This invention concerns a method for a computer system, a computer system and a computer readable medium. The computer system stores electronic objects being defined by metadata. The method comprises at least retrieving objects based on metadata of the metadata of the object.

Abstract: The disclosure relates to of generating a data structure stored in a computer memory for use in performing a search query to determine a separation between nodes in a network of interconnected nodes, wherein the method comprises: selecting a set of landmark nodes from the network; and for at least two of the landmark nodes in the set; generating a path tree for each landmark node that indicates a separation between the landmark node and each of a plurality of nodes; wherein the generating is configured to limit the number of path trees each of said plurality of nodes may appear in to no more than a predetermined number of path trees. A method of processing a data structure is also disclosed.

Abstract: In one embodiment, snapshots and/or clones of storage objects are created and managed by a volume layer of a storage input/output (I/O) stack executing on one or more nodes of a cluster. Illustratively, the snapshots and clones may be represented as independent volumes, and embodied as respective read-only copies (snapshots) and read-write copies (clones) of a parent volume. Volume metadata is illustratively organized as one or more multi-level dense tree metadata structures, wherein each level of the dense tree metadata structure (dense tree) includes volume metadata entries for storing the metadata. Each snapshot/clone may be derived from a dense tree of the parent volume (parent dense tree). Portions of the parent dense tree may be shared with the snapshot/clone.

Abstract: A system for providing a customized library platform of informational elements, each pertaining to one or more of information technology disciplines, includes a database of informational elements, and first computer-implemented user interfaces usable to provide the customization and a second user interface usable to view the customized library platform. The IT disciplines span design, analysis, modeling and management across a wide spectrum of IT functions and includes levels of detail and viewpoints that accommodate multiple roles across IT, from very senior executives to low level engineers and programmers. The knowledge base allows organizations to model their knowledge relationships to fit their structures, processes and guidelines, by using a provided framework as a starting point. The intelligent knowledge base emphasizes specific practices that enhance the linkage of business to IT, which is a widely recognized gap across IT creating massive waste and inefficiency.

Abstract: Various techniques for providing a Web Service interface to an order management system are disclosed. In one embodiment, a Web Service interface receives a hierarchical property set, which includes properties being input to an order management system. The Web Service interface accesses mapping information, which associates a variable in a flat property set with a hierarchical property set path. The Web Service interface uses the mapping information to convert the hierarchical property set to the flat property set, based upon the mapping information, and then causes the order management system to process the flat property set. The Web Service interface can also use the same mapping information to convert a flat property set generated by the order management system into a hierarchical property set.

Abstract: A document management apparatus, which converts management of documents managed using a folder tree to management using search folders, newly defines attributes of documents included in respective hierarchies of the folder tree as a conversion source. To each document which belongs to the folder tree, a name of a folder in an upper hierarchy, which stores that document, is assigned as an attribute value of the defined attribute. Each folder which configures the folder tree is converted into a search folder which can search for documents assigned with the attribute values using the name of that folder as a search condition.

Abstract: An object logical node achieved by a distributed data management device includes a storage unit for storing object node identifiers each uniquely assigned to a plurality of logical nodes, a storage unit for storing at least one of a plurality of partial data units, a link table for storing link information between the object logical node and a link destination logical node, a storage unit for storing a value range boundary value with respect to each attribute corresponding to the partial data unit, and a storage unit for storing a tree structure data unit with respect to each attribute including a plurality of tree nodes each indicating a value range for identifying the logical node storing the partial data unit corresponding to an access request, the tree structure data unit including a root tree node including at least one entry formed with a pointer pointing to a child tree node associated with the link destination logical node and a value indicating a value range for selecting the pointer.

Abstract: Embodiments of articles, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed herein including, for example, an apparatus that includes a computing platform to transform between a tree and a condensed array of numerals.

Abstract: A fully web-enabled software system for building, editing, evaluating, rendering, navigating and storing an integrated repository of debate in which schematic representations of individual debates are bound together to form an over-arching repository of debate by a multiplicity of user-specified semantic cross-relationships that allow the emergence of clusters of related debates. The system is comprised of: A Application software that allows system users to build and edit debate maps made up of discrete elements representing entities such as issues or questions, claims, positions, and simple and compound arguments, scenarios and debate protagonists in accordance with a set of constraints herein termed a map grammar that ensure that such maps are constructed in accordance with sound argumentation principles, and in which the set of all such maps are stored in a single, unified data structure.