Abstract: A network incident summarization and visualization tool presents a summarized or filtered rendering of an analysis or narrative of a collection of events gathered from a stream of incident reports. A graph structure stores entities and relationships between network entities in a graph form based on temporal correspondence between different incidents. An evaluation of the entities and the relationships implements a scoring methodology that identifies the most significant incidents based on the entities and component groups of entities associated by a sequence of relationships. The scoring methodology provides a normalized score that is filtered based on a threshold that removes entities having little to no correspondence or effect. The resulting filtered rendering defines a graph of entities and relationships ordered by type and significance such that the most important aspects of the rendered narrative are apparent.

Abstract: An automated fault injection testing and analysis approach drives fault injection into a processor driven instruction sequence to quantify and define susceptibility to external fault injections for manipulating instruction execution and control flow of a set of computer instructions. A fault injection such as a voltage or electromagnetic pulse directed at predetermined locations on a processor (Central Processing Unit, or CPU) alters a result of a processor instruction to change values or execution paths. One or more quantified injections define an injection chain that causes a predictable or repeatable deviant result from an expected execution path through the code executed by the processor. Based on accumulation of fault injections and results, a repeatable injection chain and probability identifies an external action taken on a processing device to cause unexpected results that differ from an expected execution of a program or set of computer instructions.

Abstract: An extractive summarization model provides extraction and classification of research assertions, or claims, made by a documented body of research such as a scientific paper or article. Modern electronic publication and dissemination allows tremendous capability for researching and scrutinizing previous documented efforts for further research and study. Accordingly, a substantial volume of material is easily obtained in response to research efforts. The extractive summarization model provides a summarization of this scientific literature by identifying and classifying asserted claims made by a particular research document. Researchers may quickly identify relevant documents based on the extracted claims asserted by the document, facilitating substantive review.

Abstract: A deployment of radiologic beacons detect radiation levels for emitted radiation around a particular geographic area such as a town, city or campus environment. In a deployment of beacons for detecting and gathering radiological gamma-ray spectral data, each beacon periodically generates a set of values indicative of radiation at a particular energy level, and assembles a vector of the set of values ordered according to increasing energy levels. Each of the beacons transmits the vector as a stream or periodic sequence of data to a common aggregation location. Each beacon encodes the data according to a compression mechanism based on a Poisson distribution of the spectral data. A running average of the values for each energy level is maintained for the sequence of vectors, and encoding/decoding mechanisms are selected based on the average value to be encoded.

Abstract: A network disruption detection engine gathers and stores network routing path update messages that routinely modify routing tables used by internet routers for transporting message traffic between a source and a destination. Routing path messages continually maintain a network transport infrastructure both for intranets used for particular entities such as corporations, and internet traffic between arbitrary source and destination nodes. Major disruptions or outages typically result in an increase in routing path messages, typically focused on a particular set, region or network entity where the disruption occurred, as other routing entities seek to avoid the troubled region. Analysis of this sudden activity of routing messages and extracting message content about the network region they seek to avoid allows identification and queries of a widespread network outage.

Abstract: A machine learning approach for evaluating the replicability of research receives a scholarly paper or publication about a research effort, and applies learning models and natural language processing (NLP) to identify replicability of the asserted results. Rule based and machine learning approaches employ models based on preexisting research papers having defined replicability, and compares language features, research parameters and factual assertions extracted from a research paper for evaluation. A pipeline of evaluations and feature extraction analyzes the content of the research paper and renders a prediction value that the described research can be repeated with similar results.

Abstract: The present teaching relates to method, system, medium, and implementations for unfragmented information management. A live information construct (LIC) represents a component for unfragmented management of information associated with the component. The LIC comprises a document space, a control space, and a work space. The document space includes documents representing a plurality aspects of the component in an unfragmented manner. The control space includes control configurations, each of which defines some communication channels used by a party to manage relevant information in the document space with limitations to be imposed on the at least one communication channel. The work space provides embedded tools accessible to a party for managing the relevant information in the LIC via the at least one communication channel within the confine of the limitations.

Abstract: A method for assessing a regular expression for vulnerability to ReDoS attacks includes receiving a regular expression for evaluating a string defined by ordered set of characters from an alphanumeric input device, and evaluating the regular expression for determining if a parsing operation of the string according to the regular expression results in a disproportionate resource consumption. The evaluation determines if the resource consumption constitutes a Regular expression Denial of Service (ReDOS) attack by providing a vulnerability indication of a single valid attack string, rather than attempting to find all possible attack strings. The valid attack string is defined by an input string for which evaluation based on the regular expression would result in disproportionate resource consumption.

Abstract: A non-monetary incentive model defines a Distributed Consensus Protocol (DCP) for a blockchain based on a proof-of-play mining approach. The non-monetary incentive model employs a gamification approach where mining efforts are recorded responsive to achievement in a gaming environment, rather than the proof-of-work or proof-of-stake approaches commonly used for blockchain valuation. The incentive model draws on a participant volition in attaining or improving a gaming achievement. The approach records gaming moves or actions undertaken by a participant playing the game, based on a seed used to instantiate the game. Upon attaining a predetermined minimum score, and at a predefined difficulty, the gaming effort is deemed to warrant a new block in the blockchain.

Abstract: One example method of operation may include identifying event block allocations of one or more of data memory and data storage allocations, assigning indicators to the event block allocations based one or more determined statuses associated with the event block allocations, populating a display interface with the event block allocations and the indicators, performing a trace event of the event block allocations, identifying a target event block allocation among the event block allocations, and creating a notification identifying an allocation violation based on the identified target event block allocation.

Abstract: A biometric attribution approach identifies a keyboard actor based on timing between entered keystrokes. Patterns tend to emerge in a timing interval between keystrokes entered by an actor. The keystroke patterns of an actor are analyzed to compute a signature exhibited by the actor. Gathered or intercepted keystroke patterns of an unknown actor are compared to identify a likelihood that typing sessions emanated from a common actor. Keystroke activity of a purported suspect actor can be compared to a database or model of keystroke attributes for determining if the keystroke activity emanated from the same actor as other keystroke sequences. Keystroke patterns rely only on the timing between keystrokes, as key data and upstroke information need not be gathered since the comparisons reply only on keystroke timing deltas.

Abstract: An approach for gathering, encoding and transmitting histogram data mitigates the need for transmission resources by compressing the gathered data in a lossless, stateless manner for transmission. A generally sparse data set benefits from an encoding mechanism based on a bit plane arrangement of the raw data. The approach organizes bit planes in a sequential manner, and then encodes values based on intervals of non-zero bit positions. By traversing a sequential string based on the bit plane, each “run” of zeroes tends to produce relatively small values, easing encoding burdens, but also accommodated larger values when necessary. A selective encoding technique invokes different encoding processes based on the magnitude of the interval, to allow use of an encoding that stores each respective value in the fewest bits. Different encoding techniques are applied based on ranges of the interval magnitude, or zero run.

Abstract: A method for assessing a regular expression for vulnerability to ReDoS attacks includes receiving a regular expression for evaluating a string defined by ordered set of characters from an alphanumeric input device, and evaluating the regular expression for determining if a parsing operation of the string according to the regular expression results in a disproportionate resource consumption. The evaluation determines if the resource consumption constitutes a Regular expression Denial of Service (ReDoS) attack by providing a vulnerability indication of a single valid attack string, rather than attempting to find all possible attack strings. The valid attack string is defined by an input string for which evaluation based on the regular expression would result in disproportionate resource consumption.

Abstract: A mesh network of interconnected wireless nodes in which each node independently manages a wireless connection to one or more other wireless nodes for transporting data, and stochastically refreshes and maintains internode connections in the wireless mesh network. A network overlay orchestrator in each node periodically validates the connections to other nodes in the mesh network based on a current topology of connected nodes to ensure the efficiency of current connections. Connection logic replaces, if a connection validation fails, the failed connection with a newly established connection from a set of available neighbor nodes, and replaces, if none of the current connections fail validation, a stochastically selected connection with a newly established connection from the set of available neighbor nodes for promoting perturbation in the current internode connections.

Abstract: A network disruption detection engine gathers and stores network routing path update messages that routinely modify routing tables used by internet routers for transporting message traffic between a source and a destination. Routing path messages continually maintain a network transport infrastructure both for intranets used for particular entities such as corporations, and internet traffic between arbitrary source and destination nodes. Major disruptions or outages typically result in an increase in routing path messages, typically focused on a particular set, region or network entity where the disruption occurred, as other routing entities seek to avoid the troubled region. Analysis of this sudden activity of routing messages and extracting message content about the network region they seek to avoid allows identification and queries of a widespread network outage.

Abstract: A shared memory system for providing unidirectional communication across a security threshold defined by producer and consumer of a message at different security levels. A unidirectional shared memory element is accessible for read and write access by the message producer (sender), and the consumer (receiver) has only read access. Transmission logic ensures atomic receipt of the message if it is received, as the receiver cannot issue an acknowledgement to the sender as in conventional electronic interfaces. An arrangement of indices and counters allows asynchronous operation by the sender and receiver, as messages may queue up in the shared memory if the producer exceeds the consumer. In the event of a failure, anomaly, or resource overrun, it is known that messages that were received were received in entirety; in other words, atomicity is preserved.

Abstract: One example method of operation may include creating a force approximation of a number of nodes in a defined space at an initial time (t0), the force approximation being based on a data realization simulation model of an n-body simulation, where n is an integer greater than one. The method may also include determining initial displacement changes of one or more of the nodes within the defined space has occurred in the force approximation, summing the initial displacement changes of the one or more of the nodes to create a summed total displacement, creating an initial displacement threshold (Td) based on the summed total displacement.

Abstract: An automated fault injection testing and analysis approach drives fault injection into a processor driven instruction sequence to quantify and define susceptibility to external fault injections for manipulating instruction execution and control flow of a set of computer instructions. A fault injection such as a voltage or electromagnetic pulse directed at predetermined locations on a processor (Central Processing Unit, or CPU) alters a result of a processor instruction to change values or execution paths. One or more quantified injections define an injection chain that causes a predictable or repeatable deviant result from an expected execution path through the code executed by the processor. Based on accumulation of fault injections and results, a repeatable injection chain and probability identifies an external action taken on a processing device to cause unexpected results that differ from an expected execution of a program or set of computer instructions.

Abstract: A non-monetary incentive model defines a Distributed Consensus Protocol (DCP) for a blockchain based on a proof-of-play mining approach. The non-monetary incentive model employs a gamification approach where mining efforts are recorded responsive to achievement in a gaming environment, rather than the proof-of-work or proof-of-stake approaches commonly used for blockchain valuation. The incentive model draws on a participant volition in attaining or improving a gaming achievement. The approach records gaming moves or actions undertaken by a participant playing the game, based on a seed used to instantiate the game. Upon attaining a predetermined minimum score, and at a predefined difficulty, the gaming effort is deemed to warrant a new block in the blockchain.

Abstract: A mesh network of interconnected wireless nodes in which each node independently manages a wireless connection to one or more other wireless nodes for transporting data, and stochastically refreshes and maintains internode connections in the wireless mesh network. A network overlay orchestrator in each node periodically validates the connections to other nodes in the mesh network based on a current topology of connected nodes to ensure the efficiency of current connections. Connection logic replaces, if a connection validation fails, the failed connection with a newly established connection from a set of available neighbor nodes, and replaces, if none of the current connections fail validation, a stochastically selected connection with a newly established connection from the set of available neighbor nodes for promoting perturbation in the current internode connections.