Abstract: An information management device has a provision condition storage unit in which, for each sensor, provision condition information of sensing data generated by a sensor is registered in association with identification information of the sensor, a use condition storage unit in which, for each application that requires use of the sensing data, use condition information of the sensing data required by an application is registered in association with an address of a transmission destination of the sensing data, a sensing data acquisition unit that acquires through communication the sensing data generated by the sensor registered in the provision condition storage unit, and a specification unit that specifies the provision condition information matched with the use condition information by searching the provision condition storage unit for each piece of the use condition information registered in the use condition storage unit.

Abstract: Method allowing a mailing system to frank in advance and manage a large number of rate tables stored in the mailing system, and in particular providing the possibility to frank mail in advance using a new future rate table and to come back later to franking with today's date and using a previous rate table, and including the main steps: provision of a control module, which can store more than two rate tables in a non-volatile memory accessible by the control module, provision of a volatile memory which can store the active rate table that is currently used by the mailing system for franking mail pieces, selection by the control module of the active rate table amongst the rate tables stored in a non-volatile memory when the mailing system is powered on and loading of this active rate table by the control module in volatile memory, initiation by the control module of the change of the active rate table triggered by determined events, selection by the control module of a new rate table based on the franking date

Abstract: Techniques are discussed for performing a demand reset in a wireless meter reading environment, in a manner such that demand data may not be lost. In response to receiving a command from a mobile device of a requester, a meter may store demand value(s) in a log, reset register(s) that store the demand value(s) and wirelessly provide the demand value(s) to the mobile device of the requester. Due to the lack of reliability associated with wireless communications between the meter and a requestor, the requestor may not actually receive the demand value(s). Upon receiving a subsequent command for the demand value(s), the meter may determine that the command is a replay, and provide the demand value(s) without resetting the register(s). Techniques are also discussed for generating the commands, securing the commands, and providing the commands to mobile devices in route packages.

Abstract: A management system, a smart meter, a server, an operation method and a management method are provided. The management system includes a remote server and at least one smart meter. The smart meter is coupled to the remote server via a communication network. The smart meter measures electrical energy of at least one power line to obtain at least one batch of electricity data. The smart meter detects whether the loading event occurs. If the loading event occurs, the smart meter performs data compression on the electricity data obtained during an event period corresponding to the loading event to obtain compressed data, and uploads the compressed data to the remote server. The remote server performs data decompression on the compressed data to obtain decompressed data. The remote server performs load identification according to the decompressed data.

Abstract: Systems and methods for constructing a neural model, wherein the system and method comprises analyzing neuropsychological data to obtain the model and modeling functional plasticity.

Abstract: A computer program making use of an expert system, novel user interface, a knowledge repository, and a relational database to automate the creation and customization of new computer programs and/or electronic system designs.

Abstract: A computer implemented method, computerized apparatus and computer program product for inconsistency detection between structured and non-structured data. The method comprising: automatically determining, by a computer, inconsistencies between fields in electronics records, the fields comprise at least a structured field and a non-structured field, the fields are designed to be able to include overlapping information in structured and non-structured form; and indicating, by the computer, to a user potential inconsistencies. Optionally, the indication uses a visual cue when displaying the electronic record to the user, wherein the visual cue indicates the fields which are determined to comprise inconsistent content.

Abstract: A method and apparatus for deriving diagnostic data about a technical system utilizing learning metrics gained by at least one data driven learning process while generating and updating soft sensor models of said technical system.

Abstract: A technique includes receiving a submission classified by a plurality of human classifiers. Based at least in part on a classification model for the plurality of human classifiers and classification decisions made by the human classifiers, the submission is classified.

Abstract: An optimization in machine learning is achieved using Newton's algorithm together with an efficient technique for solving linear equations, such as the method of conjugate residuals. The techniques of the present invention are applicable to learning language models, predicting classes of objects from images and videos, and classifying financial transactions for prevention of fraud. Other uses include determining a function from a sequence of words to a relevant web page for a search engine, or to inverting arbitrary output values of an analyzed system into an internally running simulation.

Abstract: A method training a randomized decision tree through multiple iterations, each is based on: a) Receiving multiple data samples that include data subsets, each data subset corresponds to an attribute. b) Distributing the data subsets to slave processing units after sorting the data samples in consecutive ascending order by updating a first index that identifies trajectories of the training data samples through the tree nodes of the previous tree level. c) Simultaneously processing the data subsets to identify split functions for each tree node with respect to each data subset and updating a second index that identifies the trajectories of the training data samples through the tree node of the current tree level. d) Collecting the split functions from the slave processing units and constructing the current tree level by selecting a preferred split function for each tree node of the current tree level.

Abstract: The invention provides a display interface in a social networking system that enables the presentation of information related to a user in a timeline or map view. The system accesses information about a user of a social networking system, including both data about the user and social network activities related to the user. The system then selects one or more of these pieces of data and/or activities from a certain time period and gathers them into timeline units based on their relatedness and their relevance to users. These timeline units are ranked by relevance to the user, and are used to generate a timeline or map view for the user containing visual representations of the timeline units organized by location or time. The timeline or map view is then provided to other users of the social networking system that wish to view information about the user.

Abstract: A neuristor-based reservoir computing device includes support circuitry formed in a complimentary metal oxide semiconductor (CMOS) layer, input nodes connected to the support circuitry and output nodes connected to the support circuitry. Thin film neuristor nodes are disposed over the CMOS layer with a first portion of the neuristor nodes connected to the input nodes and a second portion of the neuristor nodes connected to the output nodes. Interconnections between the neuristor nodes form a reservoir accepting input signals from the input nodes and outputting signals on the output nodes. A method for forming a neuristor-based reservoir computing device is also provided.

Abstract: Embodiments of the invention relate to a function-level simulator for modeling a neurosynaptic chip. One embodiment comprises simulating a neural network using an object-oriented framework including a plurality of object-oriented classes. Each class corresponds to a component of a neural network. Running a simulation model of the neural network includes instantiating multiple simulation objects from the classes. Each simulation object is an instance of one of the classes.

Abstract: A utility that can be embedded within a system or application, or run as a stand-alone utility, provides a method for identifying causal relationships for one or more events. For instance, if an anomaly is occurring for a subset of events in a series of events, certain information about potential causes can be collected in conjunction with the series of events and, the information can be analyzed to determine if there is a cause and affect relationship leading to the occurrence of the anomalies.

Abstract: System (300) and methods (400, 600) for providing a Cognitive Network (“CN”). The methods involve: partially solving Multi-Objective Optimization Algorithms (“MOOAs”) for Protocol Stack Layers (“PSLs”) using initialization parameters generated based on project requirements (572); and monitoring the convergence behaviors of MOOAs (584) to identify when solutions (106) thereof start to converge toward Pareto-Optimal solutions (104). In response to said identification, a convergence of a solution trajectory for at least one MOOA is “biased” so that compatible non-dominated solutions are generated at PSLs. A Pareto Front (100) for each PSL is determined by generating remaining solutions for MOOAs. The Pareto Fronts are analyzed in aggregate to develop Best Overall Network Solutions (“BONSs”). BONSs are ranked according to a pre-defined criteria. A Top Ranked Solution (“TRS”) is identified for BONSs that complies with current regulatory/project policies.

Abstract: System and methods for providing a cognitive network (200). Initialization parameters for distributed Multi-Objective Optimization (“MOO”) algorithms are generated based on project requirements. A Pareto Front (100) is determined for each protocol stack layer by solving the distributed MOO algorithms using the initialization parameters. The Pareto Fronts are analyzed in aggregate to develop best overall network solutions. The best overall network solutions are then ranked according to a pre-defined criteria. A top ranked solution is identified for the best overall network solutions that comply with current regulatory and project/mission policies. Subsequently, operations are performed to compute configuration parameters for protocols of the protocol stack layers that enable implementation of the top ranked solution within the cognitive network. Network resources of the protocol stack layers are then configured in accordance with the configuration parameters.

Abstract: System and methods for providing a cognitive network (300). The methods involve generating Initialization Parameters (“IPs”) for a first Multi-Objective Optimization (“MOO”) algorithm based on project requirements; determining a first Pareto Front (“PF”) for a first Protocol Stack Layer (“PSL”) of a protocol stack by solving the first MOO algorithm using IPS (450, 550); initialize or constrain a second MOO algorithm using the first PF (100); determining a second PF for a second PSL succeeding the first PSL using the second MOO algorithm; analyzing the first and second PFs to develop Best Overall Network Solutions (“BONSs”); ranking the BONSs according to a pre-defined criteria; identifying a top ranked solution for BONSs that complies with current regulatory and project policies; computing configuration parameters for protocols of PSLs that enable implementation of the top ranked solution within the cognitive network; and dynamically re-configuring network resources of PSLs using the configuration parameters.

Abstract: Methods, systems, computer-readable media, and apparatuses for providing dynamic incident response using advanced analytics are presented. In some embodiments, a computing device may determine that an incident has occurred. The computing device then may load a predefined response template that includes parameters for responding to the incident. Subsequently, the computing device may utilize a big data platform to identify one or more potential responders for the incident based on the predefined response template. In some additional embodiments, the computing device also may contact the identified potential responders and subsequently monitor communications by the identified potential responders that are responsive to the contact. The computing device may also update historical interaction data based on the monitoring, and this historical interaction data may be used to subsequently determine the likelihood that at least one potential responder will respond to a future incident.

Abstract: Predictive monitoring of objects in a distributed network system providing cloud services is disclosed. In one embodiment, the methods and systems observing one or more update messages sent and received among components of the distributed network system, the update messages comprising information associated with a state of an object on the distributed network system, determine the state of the object in response to the one or more update messages, and reference a predictive object state model to predict occurrence of an artifact in response to the state of the object. Advantageously, the present embodiments provide advanced warning of potential failures in a distributed network systems, which may enable a system administrator or dynamic process to resolve the failure before it ever occurs. Additional benefits and advantages of the present embodiments will become evident in the following description.

Abstract: An apparatus for deriving a consultation result communicating with an interlocutor apparatus on the basis of Resource Description Framework (RDF) triples is provided. It includes a user decision making information management unit, an input sentence analysis unit, a consultation unit configured to collect a set of RDF triples concerning the keyword of the input sentence from the RDF triple repository, to send the keyword of the input sentence, a set of RDF triples converted from the input sentence and a set of RDF triples concerning the keyword of the input sentence to an interlocutor apparatus, to create a set of final consultation triples by checking and modifying some consultation triples received from the interlocutor apparatus, and a consultation result output unit configured to create a consultation sentence from the final consultation triples.

Abstract: With respect to the model selection issue of a mixture model, the present invention performs high-speed model selection under an appropriate standard regarding the number of model candidates which exponentially increases as the number and the types to be mixed increase.

Abstract: A composite DFA for multiple regular expressions or other rules may be generated in a two-step process—first compiling single rule DFAs, then performing subset construction on those DFAs to generate the composite DFA, with subset information retained. A new batch of one or more rules may be added by another subset construction from the old composite DFA and new single rule DFAs, with subset information for the new composite DFA compressed into sets of states from old and new single rule DFAs. A batch of one or more rules is deleted by deleting references to single rule DFA states from composite DFA subsets, deleting composite DFA states with empty subsets and merging composite DFA states with identical subsets. Rules are changed by deleting the old versions and then adding the new versions.

Abstract: Cost factors are utilized and may be estimated to determine split points in a DFA-NFA hybrid. The cost factors may comprise NFA start states, DFA backup factor, DFA-NFA token frequency, DFA steps to match, and NFA states to match. Other cost factors may be used as necessary. The cost factors are multiplied by tunable coefficients and summed. NFA states at minimum cost points are determined for entrance states in the NFA. A DFA is compiled from the entrance paths to the entrance states. NFA states and transitions needed only to reach entrance states may be deleted and all remaining NFA states are made available for execution by the NFA engine. An NFA representation of an NFA is examined by bounded depth-first recursion from each start state.

Abstract: A computer system and method for performing predictive analytics on telematics data regarding an entity. The computer system having a memory configured to store instructions and a processor disposed in communication with the memory. The processor upon execution of the instructions is configured to receive telematics data regarding an entity and analyze the received telematics data to identify a pattern of behavior. A behavioral conclusion and/or meaning is then determined for the entity based on analysis of the received telematics data.

Abstract: Identification of a content item and identification of a user are received. A mixed collaborative filtering-content analysis model is used to determine a predicted probability of interest of the user in the content item. The predicted probability of interest of the user in the content item is output.

Abstract: Techniques for facilitating and accelerating log data processing by splitting data streams are disclosed herein. The front-end clusters generate large amount of log data in real time and transfer the log data to an aggregating cluster. The aggregating cluster is designed to aggregate incoming log data streams from different front-end servers and clusters. The aggregating cluster further splits the log data into a plurality of data streams so that the data streams are sent to a receiving application in parallel. In one embodiment, the log data are randomly split to ensure the log data are evenly distributed in the split data streams. In another embodiment, the application that receives the split data streams determines how to split the log data.

Abstract: Preferred embodiments of the invention provide systems and methods for improving the speed and efficiency of a data warehouse. The invention enables the loading of data from different data sources into a common data warehouse structure. Preferred embodiments include an ETL process is modified to perform a joined indexing operation which reduces the number of lookup requests required. Further embodiments contemplate a date dimension and hierarchical data structure which improve operation speed.

Abstract: According to one aspect of the invention, for a database statement that specifies evaluating reporting window functions, a computation-pushdown execution strategy may be used for the database statement. The computation-pushdown execution plan includes producer operators and consolidation operators. Each producer operator computes a respective partial aggregation for each reporting window function based on a subset of rows, and broadcasts the respective partial aggregation. Each consolidation operator fully aggregates all partial aggregations broadcasted from the producer operators. Alternatively, an extended-data-distribution-key execution plan may be used. Each producer operator sends rows based on hash keys to sort operators for computing partial aggregations for at least one reporting window function based on a subset of rows. Each consolidation operator receives and fully aggregates all partial aggregations broadcasted from the sort operators.

Abstract: The present disclosure provides techniques for chargeback of IT resources. Resource change data may be stored until the data is accessed by a chargeback system. The chargeback system may access the resource change data daily and may convert the resource change data to daily resource usage and cost data. The resource usage and cost data may be stored in a chargeback database and the daily usage and cost data may be reported.

Abstract: A method for managing an electronic document (ED) concurrently accessed by multiple editors includes receiving a first chunk size for the ED, partitioning the ED into chunks, and receiving, from an editor, a selection of a first chunk, where the first chunk is of the first chunk size. The method further includes locking the first chunk in response to determining that the first chunk is available for editing, sending, to the first editor, a first message indicating that the first chunk has been locked, and sending, to a second editor, a second message indicating that the first chunk has been locked.

Abstract: An apparatus for providing mashup services searches a database for a mashup service corresponding to a request for a mashup service when the request is received from a user device, generates a mashup service optimized for the user device using a service block capable of executing a workflow corresponding to the mashup service and the runtime library of the user device if, as a result of the search, a mashup service corresponding to the request is not stored in the database, and provides the generated mashup service to the user device.

Abstract: The embodiments herein provide a method and system for automating the document control business process in an organization particularly the ones that are participating in infrastructure and/or large projects. The automatic method and system fetches information and data from the different data sources such as E-mails or web-applications and/or other data sources. The quality checks are performed as per the expected standards to validate the completeness of information to fetch the information as contained inside the documents received to perform the various actions associated with the received information such as further processing, acknowledgement, record updates etc. The business logic and rules are applied on the information to create automatically the business deliverables as reports, document transmittal notes, and acknowledgement notes etc., that are expected from a well-functioning document control center in an organization.

Abstract: The present disclosure concerns computing systems of financial institutions and computing systems that interact and support functions of financial institutions, including the exchange of documents between two users of the system. When implemented as a computer the computer provides access for a user to a document. The computer receives from a sending party document data and a user identifier and determines a document identifier and the receiving financial institution. The computer then sends to a receiving financial institution the document identifier and the user identifier causing the receiving financial institution to display information related to the document identifier to the user such that the user can request the document. The computer then receives from the receiving financial institution a request from the user for the document. The computer determines a document reference and a document storage provider and provides access to the document.

Abstract: Techniques and mechanisms described herein facilitate the performance of duplicate data block instruction identification. According to various embodiments, a data block update operation message may be received at a communications interface in a secondary storage node. The secondary storage node may be configured to store secondary data mirroring primary data stored on a primary storage node. The primary data and the secondary data may each include a respective plurality of data blocks. The data block update operation message may include a data block update instruction for updating a designated one of the plurality of secondary storage node data blocks. The data block update operation message may include a primary storage node data block sequence number designating an update operation status. When it is determined that the data block update instruction is not a duplicate, the data block update instruction may be performed.

Abstract: Methods and systems for synchronizing network configuration state tables between an operating system kernel and an attached ASIC switch device are disclosed. An instruction to update a target network configuration state table in either an operating system kernel or an attached ASIC switch device is received. Data from the target network configuration state table and data from a corresponding network configuration state table are retrieved. Values of data in the two tables are compared and an instruction is sent to update the target network configuration state table with one or more values from the corresponding network configuration state table.

Abstract: Embodiments relate to a method and computer program product for generating a composite simulated model. A method includes receiving a specification request for generating a set of target time-series data from a set of source time-series data and obtaining specification information relating to the set of source time-series data, obtaining specification information relating to the set of target time-series data, and obtaining the source time-series data. The method also includes comparing the source and target specification information to determine if the set of source time-series data are time-aligned with the set of target time-series data and converting the set of source time-series data to the set of target time-series data upon determination that time alignment is needed.

Abstract: An aspect of synchronization of time between simulation models includes receiving a specification request for generating a set of target time-series data using a set of source time-series data, obtaining specification information relating to the set of source time-series data, obtaining specification information relating to the set of target time-series data and obtaining the source time-series data; comparing the source specification information and the target specification information to determine if the set of source time-series data are time-aligned with the set of target time-series data, and converting the set of source time-series data to the set of target time-series data upon determination that time alignment is needed.

Abstract: Improved techniques and apparatus for managing data between a host device (e.g., host computer) and a media device are disclosed. The data being managed can, for example, pertain to media data for media assets. The managing of the media data thus can involve transfer of media assets between the host device and the media device. In one embodiment, the transfer of media assets between a host device and a media device can be referred to as synchronization.

Abstract: A method for resolving the synchronization of identity data from a central database server to distributed database servers is provided. The method involves synchronizing identity data to central and distributed database servers based on identity data types associated with a factory. The method first includes assigning by a configuration manager identity data types to factories which manufacture devices that will need identity data. Next an Identity Data (ID) Loader receives a file containing the identity data, and the ID Loader loads the identity data to a central database server and creates a file history record indicating a record of the file loaded. Next, a Factory Synchronizer Loader (FSL) is triggered to create and execute jobs to load identity data, configuration data or other data. Finally, the identity data is synchronized between the central data base with the remote database servers in a location of the factory.

Abstract: A storage system includes a backup source storage, a backup destination storage, and a control device. The backup destination storage includes a first processor. The control device includes a second processor. The second processor is configured to acquire change history information on a history of changing data stored in the backup source storage. The second processor is configured to transfer the acquired change history information and differential data corresponding to the change history information to the backup destination storage. The first processor is configured to create, on basis of the change history information, a change list that indicates locations at which the data stored in the backup source storage is changed.

Abstract: Systems and methods of using delta partitions for backup and restore are disclosed. An example method may include after a full backup, separating change information from static information. The method may also include concentrating the change information in a delta partition prior to a differential backup. The method may also include incrementally backing up only the delta partition during the differential backup.

Abstract: Systems and methods of reducing backup bandwidth by remembering downloads to a computing device. An example method may include remembering information for a download to a computing device. The method may also include backing up the computing device to a different system. The information remembered for the download is used to provide a backup of the computing device without copying some of the downloaded data present on the computing device from the computing device.

Abstract: According to one embodiment, a data storage device generates a full backup image or an incremental backup image as a backup image depending on whether the backup is of a first generation. The generated backup image is transferred to a backup storage device. A full backup generation unit of the backup storage device executes a merge process of merging an incremental backup image with a full backup image in order of generation. A reverse incremental backup acquisition unit of the backup storage device acquires, in order of generation, a reverse incremental backup image used to restore the full backup image not subjected the merge process from the full backup image subjected to the merge process.

Abstract: A technique includes generating a checkpoint for an application that is executing on a plurality of nodes of a distributed computing system. Forming the checkpoint includes selectively regulating communication of data from the plurality of nodes to a storage subsystem based at least in part on a replication of the data among the nodes.

Abstract: The present invention provides the function of dynamically switching the allocation of snapshot data in a pool according to the use status of the pool. More specifically, the present invention provides the function of dynamically switching a storage mode to be applied to the pool from a storage mode in which the snapshot data is aggregated in a specific pool volume to a storage mode in which the snapshot data is distributed to plural pool volumes, or from the storage mode in which the snapshot data is distributed to the plural pool volumes to the storage mode in which the snapshot data is aggregated in the specific pool volume, according to the use status of the pool.

Abstract: Described herein are a system and method for remote mirroring/copying data and metadata sets from a local node to a remote node that reduces the number of metadata sets that are mirrored. In some embodiments, the local node may coalesce metadata sets into metadata chains, each metadata chain comprising a grouping of two or more metadata sets. In some instances, a “representative” metadata set of a metadata chain may be selected for sending to the remote node for storing, wherein the other metadata sets of the metadata chain are not sent to the remote node. In these embodiments, the selected metadata set may represent all the metadata sets in the chain and be the only metadata set in the chain that is transmitted and stored to the remote node. As such, the network congestion between the local and remote nodes may be reduced.

Abstract: A technique includes receiving a request to restore a state of a file system. The request defines a rollback period, which extends from a restoration time that is specified by the request to a time at which the request was made. The technique includes reconstructing a state of the file system in response to a query using a preserved snapshot of the file system. The reconstruction including reconstructing the state at an arbitrary query time based at least in part on a dynamically inheritable attribute of an entity stored on the file system and the rollback period.

Abstract: A method, computer program product, and computer system for assigning an action to execute on content based upon, at least in part, an occurrence of a statistical event. Statistics associated with a corresponding portion of the content published on one or more websites is received. The occurrence of the statistical event with respect to the corresponding portion of the content is determined based upon, at least in part, receiving the statistics. The action on the content is executed based upon, at least in part, determining the occurrence of the statistical event with respect to the corresponding portion of the content.

Abstract: A method implemented on a node, the method comprising receiving a key according to a sub-index of the key, wherein the sub-index identifies the node, and wherein the key corresponds to a data segment of a file, determining whether the data segment is stored in a data storage system according to whether the key appears in a hash table.