Abstract: Described is a system for extracting multi-scale hierarchical clustering on customer observables (COs) data in a vehicle. The system selects a parameter for a set of incident data of COs data. Simplicial complexes are generated from the COs data based on the selected parameter. Face networks are generated from the simplicial complexes. For each face network, a set of connected components is extracted. Each connected component is transformed to a cluster of related COs, resulting in a first extracted relation between COs. The first extracted relation is used to automatically generate an alert at a client device when a second extracted relation different from the first extracted relation results from the transformation.

Abstract: Managing data in a file system with a verification engine that may obtain a user identifier associated with a user, an object identifier, and a target object. The verification engine may determine target identities associated with two or more file system protocols based on the user identifier. The verification engine may determine permission entries associated with the two or more file system protocols associated and the target object. The verification engine may employ the target identities and the permission entries to directly verify access rights to the target object for the user. Accordingly, the verification engine may provide a report that includes the target identities, the permission entries, or the access rights.

Abstract: According to an example, in a method for managing storage of data from an input table, a projection definition that includes an expression to be executed on data contained in a column of the input table may be accessed. The expression on the data contained in the column of the input table may be executed to obtain results data, which may be stored in an expression projection, in which the expression projection includes a column that provides physical storage for the results data. The results data may be stored in the expression projection, segmented, and encoded. In addition, the expression projection may be stored in a node.

Abstract: In some embodiments, an apparatus includes a memory having an instance of a distributed shared memory and a processor operatively coupled to the memory. The processor is configured to instantiate a first instance of a front-end application and receive, at the first instance of the front-end application, and input signal associated with a state of the first instance of the front-end application. The processor is configured to insert a value into a field data structure defined in the instance of the distributed shared memory and associated with an event source configured through a second instance of the distributed shared memory. The processor is configured to generate an event object indicative of the value inserted into the field data structure and send a signal to update the second instance of the front-end application.

Abstract: Disclosure includes system, method and architecture for selecting supplemental digital content using visual appearance. Digital content that is visually similar, or dissimilar, to digital content requested by a user can he identified and provided for presentation with the requested content. The additional digital content is visually congruent, or visually incongruent, with content requested by a user, such that the additional content is similar, or dissimilar, to the requested content from a visual standpoint. In a presentation of the requested content, the presentation position of each additional content item relative to the presentation position of each requested content can be identified using visual congruence, or visual incongruence.

Abstract: A data handling system enables the unsupervised creation of an information extraction dictionary by expanding upon a word or phrase included within an expansion query. Prior to receiving the expansion query, the data handling system performs an unsupervised learning of an information corpus which includes text to assign a corpus vector to each word and phrase of the text. After the expansion query, the data handling system compares the expansion query to the corpus vectors. The data handling system ranks the corpus vectors by similarity to the expansion query and provides a ranked list of words or phrases associated with the ranked corpus vectors. The ranked list may be subsequently utilized as the information extraction dictionary.

Abstract: A system for performance testing of scalability implementations and testing of stability in blockchain database implementations. The testing system comprises a cluster of private blockchain nodes instantiated on a network and a control console that allows the user to set the number of nodes in the network and the number of clients for testing of a particular blockchain implementation. Performance metrics are established and tested. The test system allows for staged testing using generated databases, wallets, and accounts starting with simple 5-node networks, expanding to larger networks, then testing with decreased block validation times, continuing to testing using alternative, faster trust schemes, then testing implementation on divided blockchains, and finally testing on shared blockchains.

Abstract: The present disclosure provides a novel approach for creating and referencing arrays as implemented in a spreadsheet application. Aspects of the present disclosure include, but are not limited to: referencing arrays, creating dynamic arrays, collapsing values of an array into a single cell, spilling values of an array to a table, referencing one or more values in collapsed arrays, visually indicating no spill errors while maintaining calculation capabilities thereon, and implicit intersection of data.

Abstract: A method for manufacturing a workpiece including a first metallic component and a second metallic component, the method comprising: welding the first metallic component to the second metallic component; performing passivation measurements on the workpiece at a plurality of spaced apart locations; creating a record of the passivation measurements on a server arrangement; making the record created in the server arrangement available to a purchaser of the workpiece.

Abstract: The information providing system includes the communication unit, the content database, the search unit and the map information generation unit. The communication unit acquires place information indicating a place. The content database stores place information indicating a place and specifying information specifying an expression part where an expression related to the place appears in content in association with each other. The search unit acquires the specifying information stored in association with the place information indicating a place within a specified range from the place indicated by the place information acquired by the communication unit from the content database. The map information generation unit outputs the specifying information acquired by the search unit.

Abstract: A computerized query optimization methodology, computer program product, and electronic device for intelligently optimizing the lookup of graphed data in a data store or distributed across a plurality of databases is disclosed. The method defines an initial metafuture including a plurality of attributes starting with initial data references to determine a starting list of data reference dependencies with respect to metafuture construction functions. In response to a query, a processor initiates a recursive graph traversal of nodes in a graph starting with the initial metafuture as a root node. At each step of the graph traversal, if the metafuture contains an answer, then the process traverses the graph laterally. If there are no further siblings, then the processor initiates a vertical traversal.

Abstract: The present application discloses methods for storing data, methods for querying data, and apparatus thereof. A method for storing data may include receiving a data record to be stored. When the data record includes a timestamp, a numerical value generated at a time point identified by the timestamp, and a first combination of identification-field values that can identify the numerical value, the method may also include obtaining a target numerical value and a target time satisfying user query needs, and a second combination of identification-field values as a query condition by the preprocessing of the data record based on the user query needs. The method may further include storing a storage identity representing the second combination of identification-field values, the target time, and the target numerical value into a second information table correspondingly.

Abstract: A request is received, over a network from a requesting user to sort a plurality of comments relating to online content by a social status of a respective one of a plurality of commenters associated with each of the plurality of comments. The social status of the each of the plurality of commenters is determined using a computing device. The plurality of comments are sorted, using the computing device, by the social status of the respective one of the plurality of commenters associated with each of the plurality of comments. A representation of the sorted comments is transmitted, over the network, to the requesting user. The social status of commenters can reflect, in various embodiments, the status of commenters as favorite commenters of the requesting user, as members of the requesting user's social network, or as a top rated commenters in an online community.

Abstract: The present disclosure relates to method and computing device for classification of web browsing history by classification system. The classification system receives web browsing history from web browser associated with user, where web browsing history comprises details about one or more web pages browsed by user, extracts one or more keywords from each of one or more web pages browsed by user based on trained keyword dataset, determines a plurality of classifications for each of the one or more web pages based on one or more keywords, generates relevancy matrix between one or more keywords of web pages and corresponding plurality of classifications and identifies a classification from plurality of classifications for each of one or more webpages based on relevancy matrix, where snapshot of classification is stored in non-volatile storage unit of web browser. The use of non-volatile storage unit in present disclosure provides no restriction on storage space.

Abstract: Methods and systems for arranging hyperlinks on a graphical user-interface (GUI) of a computerized system include receiving, via the GUI, a user selection to display a plurality of hyperlinks, the hyperlinks corresponding to one or more nodes of a first set. The methods and systems further include determining, by a processor, a rank of each hyperlink in the plurality of hyperlinks. Determining a rank includes constructing a first bipartite graph between the one or more nodes of the first set and one or more nodes of a second set, the first set and the second set being mutually exclusive, wherein edges of the first bipartite graph are weighted according to a first criterium and constructing a second bipartite graph between the one or more nodes of the first set and the one or more nodes of the second set, wherein edges of the second bipartite graph are weighted according to a second criterium, different from the first criterium.

Abstract: Methods and systems for storing a file on a plurality of servers are provided including a number of servers and a maximum number of servers which may fail. A predefined number of byzantine failures and a number of crashes of the servers is contemplated. The file is divided into a plurality of chunks, where the number of chunks is equal to or greater than the number of servers. The chunks of the file are sent to the servers, where at least one chunk is sent to each server. The number of replies from the servers indicating successful storage of the respective chunks are determined. The number of replies matching a terminating condition is checked. A new file is generated.

Abstract: A document classification system is provided. The document classification system analyzes digital document information which is collected to be submitted as evidence in a lawsuit and classifies the digital document information.

Abstract: Embodiments of the present invention provide systems and methods for increasing the efficiency of data conversion in a coprocessor by using the statistical occurrence of data patterns to convert frequently occurring data patterns in one conversion cycle. In one embodiment, a coprocessor system is disclosed containing a converter engine, which includes a parser and a converter, an input buffer, and a result store. The input buffer is configured to transfer a set of source data to the converter engine, which converts the source data from first code format to a second code format, and sends the converted source data to the result store.

Abstract: In embodiments, secure compression algorithms are provided that may be employed as a single operation on raw data to produce compressed and encrypted data. In embodiments, the algorithms described herein may be performed using any type of dictionary based encryption. In one embodiment, upon adding a new prefix to a dictionary table, the dictionary table may be permuted to randomize the entries into the table. The randomization may be based upon a permutation value generated by a deterministic pseudo-random generator and/or pseudo-random function. Other embodiments of randomization may be employed to provide secure compression. For example, instead of permuting the entire table upon adding a prefix, the prefix may be randomly added to the table.

Abstract: Systems and methods are provided herein for multi-pass duplicate identification using sorted neighborhoods. Data comprising a plurality of data records is received. Neighborhood records are generated by merging the plurality of data records with reference records stored in a remote data store. A resource identification field is assigned to each reference record. A pair distance, for each pair of neighborhood records having different resource identification fields, is determined by calculating a standard deviation of distances between each attribute of the pair scaled by a filled pairs quote value. Possible duplicate records are identified by evaluating each pair distance against a threshold, each possible duplicate having grouped attributes. Final duplicate records are identified by matching each group to a key.