US8775344B2 - Determining and validating provenance data in data stream processing system - Google Patents

Determining and validating provenance data in data stream processing system Download PDF

Info

Publication number
US8775344B2
US8775344B2 US12/125,219 US12521908A US8775344B2 US 8775344 B2 US8775344 B2 US 8775344B2 US 12521908 A US12521908 A US 12521908A US 8775344 B2 US8775344 B2 US 8775344B2
Authority
US
United States
Prior art keywords
elements
intervals
processing
data
input
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active, expires
Application number
US12/125,219
Other languages
English (en)
Other versions
US20090292818A1 (en
Inventor
Marion Lee Blount
II John Sidney Davis
Maria Rene Ebling
Archan Misra
Daby Mousse Sow
Min Wang
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
National Research Foundation Of Korea Nrf
International Business Machines Corp
Original Assignee
International Business Machines Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by International Business Machines Corp filed Critical International Business Machines Corp
Priority to US12/125,219 priority Critical patent/US8775344B2/en
Assigned to INTERNATIONAL BUSINESS MACHINES CORPORATION, INSTITUTE FOR INFORMATION TECHNOLOGY ADVANCEMENT reassignment INTERNATIONAL BUSINESS MACHINES CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: EBLING, MARIA RENE, MISRA, ARCHAN, BLOUNT, MARION LEE, SOW, DABY MOUSSE, WANG, MIN, DAVIS, JOHN SIDNEY, II
Priority to KR1020080105820A priority patent/KR101006116B1/ko
Publication of US20090292818A1 publication Critical patent/US20090292818A1/en
Application granted granted Critical
Publication of US8775344B2 publication Critical patent/US8775344B2/en
Assigned to NATIONAL IT INDUSTRY PROMOTION AGENCY (NIPA) reassignment NATIONAL IT INDUSTRY PROMOTION AGENCY (NIPA) COMPREHENSIVE ASSIGNMENT Assignors: KOREA EVALUATION INSTITUTE OF INDUSTRIAL TECHNOLOGY (KEIT)
Assigned to KOREA EVALUATION INSTITUTE OF INDUSTRIAL TECHNOLOGY (KEIT) reassignment KOREA EVALUATION INSTITUTE OF INDUSTRIAL TECHNOLOGY (KEIT) MERGER (SEE DOCUMENT FOR DETAILS). Assignors: INSTITUTE FOR INFORMATION TECHNOLOGY ADVANCEMENT (IITA)
Assigned to KOREA (KEIT) reassignment KOREA (KEIT) MERGER (SEE DOCUMENT FOR DETAILS). Assignors: INSTITUTE FOR INFORMATION TECHNOLOGY ADVANCEMENT (IITA)
Assigned to NATIONAL RESEARCH FOUNDATION OF KOREA (NRF) reassignment NATIONAL RESEARCH FOUNDATION OF KOREA (NRF) COMPREHENSIVE ASSIGNMENT Assignors: NATIONAL IT INDUSTRY PROMOTION AGENCY (NIPA)
Active legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00—Pattern recognition
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2218/00—Aspects of pattern recognition specially adapted for signal processing
    • G—PHYSICS
    • G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16H—HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA
    • G16H50/00—ICT specially adapted for medical diagnosis, medical simulation or medical data mining; ICT specially adapted for detecting, monitoring or modelling epidemics or pandemics
    • G16H50/20—ICT specially adapted for medical diagnosis, medical simulation or medical data mining; ICT specially adapted for detecting, monitoring or modelling epidemics or pandemics for computer-aided diagnosis, e.g. based on medical expert systems

Definitions

  • the present invention relates to data stream processing systems and, more particularly, to techniques for determining and validating provenance data in such data stream processing systems.
  • Example applications are video surveillance applications ingesting many video feeds to detect potential security breaches.
  • Another example is continuous health monitoring where patients are surrounded with sensors emitting stream data into a stream processing infrastructure that analyzes the data to identify and report medically significant events to medical professionals.
  • provenance it is meant the origins and justification for the generation of events by the system. For instance, if a medical system suggests that a patient requires a drug dosage change, based on its analysis, the provenance of such an event would inform the medical professionals of the procedure and all the data points used for the generation of that alert.
  • Principles of the invention provide techniques for determining and validating provenance data in such data stream processing systems
  • a method for processing data associated with a data stream received by a data stream processing system comprises the following steps. Input data elements and output data elements associated with at least one processing element of the plurality of processing elements are obtained. One or more intervals are computed for the processing element using data representing observations of associations between input elements and output elements of the processing element, wherein, for a given one of the intervals, one or more particular input elements contained within the given interval are determined to have contributed to a particular output element.
  • a method for processing data associated with a data stream received by a data stream processing system comprises the following steps. Input data elements and output data elements associated with at least one processing element of the plurality of processing elements are obtained. One or more intervals are specified for the processing element wherein, for a given one of the intervals, one or more particular input elements contained within the given interval are believed to have contributed to a particular output element. The one or more specified intervals are validated by computing one or more intervals for the processing element using data representing observations of associations between input elements and output elements of the processing element, and comparing the one or more specified intervals and the one or more computed intervals.
  • inventive techniques are able to determine dependencies between input data elements and output data elements for one or more processing elements in the data stream processing system. That is, dependency equations may be determined allowing the system to identify which input stream elements were used in the generation of a given output stream element.
  • FIG. 1 illustrates a graph of analysis components, according to an embodiment of the invention.
  • FIG. 2 illustrates a data format, according to an embodiment of the invention.
  • FIG. 3 illustrates a method for dominant component analysis, according to an embodiment of the invention.
  • FIG. 4 illustrates a method for input-output dependency equation generation, according to an embodiment of the invention.
  • FIG. 5 illustrates a method for validating a provenance model, according to an embodiment of the invention.
  • FIG. 6 illustrates a provenance system, according to an embodiment of the invention.
  • FIG. 7 illustrates a computer system in accordance with which one or more components/steps of the techniques of the invention may be implemented, according to an embodiment of the invention.
  • provenance data is meta-information that documents the origin or source data, generally where that data was derived from other data through, for example, complex, multi-layered analysis.
  • the illustrative real-world, practical application of principles of the invention is the domain of healthcare.
  • a stream processing infrastructure that takes, as input, streams of medical information such as streams of electroencephalogram (EEG) or electrocardiogram (ECG) data as well as blood pressure, weight, or even glucometer readings.
  • EEG electroencephalogram
  • ECG electrocardiogram
  • the stream processing infrastructure would apply analytic algorithms to these data streams and identify significant medical events that warrant further attention from a doctor or other medical professional.
  • the medical professional who receives the alert generated by the stream processing system may issue a provenance query related to the alert, where the provenance query is a request to show or reveal the stream data items and the stream processing nodes that contributed to the generation of the alert.
  • the provenance query is a request to show or reveal the stream data items and the stream processing nodes that contributed to the generation of the alert.
  • illustrative principles of the invention provide automated generation of dependency equations in a stream provenance system.
  • a Provenance Dependency Deriver (PDD) component that is added to the stream processing system and that observes, for any given stream processing component, the sequence of input data elements (belonging to one or more distinct streams) and the corresponding sequence of output data elements.
  • the job of the PDD is to treat the processing component as a black box and simply learn, on the basis of the observed data, the time-windows of input data that seem to empirically affect the generation of a corresponding output data element.
  • a main goal of the PDD component is to establish a time-invariant temporal dependency function.
  • the PDD component establishes a relationship of the form:
  • L j is the number of distinct disjoint ‘time intervals’ which define the values of S j on which e i (t) depends, and start jk and end jk define the boundaries of these intervals.
  • time-invariant refers to the fact that the terms start jk and end jk are themselves independent of t; as a consequence, the dependence of a derived event to other input data elements can be expressed succinctly and completely independently of the specific timestamp or ID (identifier) of each sample.
  • ID identifier
  • a main goal here is to try to infer the values of the terms start jk and end jk .
  • the temporal dependency model can be simplified to the specification of a single (per-stream) interval term ⁇ j (for each input stream S j ), such that the dependency is purely on the most recent window of input events:
  • ⁇ j represents the past “time-window” associated with input stream S j .
  • a first illustrative approach is applicable to processing components that are known to perform ‘linear’ (i.e., affine) transformations of the input data using principal component analysis or the Karhunen-Loeve transform [see Digital Pictures Representation, Compression and Standards (Applications of Communications Theory), Arun N. Netravali, Barry G. Haskell, Plenum Press, 1995, the disclosure of which is incorporated herein].
  • Another illustrative approach is to model our components with linear systems and perform impulse response or frequency response tests to estimate a transfer function. From this transfer function, the input-output dependencies can be obtained.
  • Another illustrative approach uses information theoretic constructs to measure input output correlations and infer input output dependencies. This approach makes no assumptions on the components and applies to the general class of linear and non-linear transformations. It involves the use of empirical joint probability distribution functions and the computation of information-theoretic concepts, such as entropy and mutual information. For example, we can start by computing a sequence of conditional entropies between the output Y and increasingly longer input sequences X(.).
  • H(Y(t)) H(Y(t)
  • One key aspect of the invention is the use of the PDD based dependency functions to perform validation of externally specified dependencies.
  • the system may compare the empirically derived dependency values with the values externally (e.g., manually) specified for a stream processing component and note the extent of divergence. If the degree of divergence is high, this may be an indicator of either an incorrectly specified dependency function or some faulty operation of the actual processing logic in the stream processing component. In many situations, such automatic identification of potential faults or anomalies can prove invaluable as a tool for validation or early fault detection.
  • the techniques of the invention can also be applied to learn or infer some alternate models of dependency, assuming of course, that the ‘model’ of dependency is externally provided.
  • the dependency is declared to be in terms of the ‘number of past elements’ and not in terms of time windows, then the inventive approach can be applied here as well.
  • the method described above can either be applied offline (to a set of stored input and output streams) or online.
  • principles of the invention provide for the PDD to access a set of stored input and output streams (over an appropriately defined history) and use this set as a ‘learning sequence’ to derive the dependencies.
  • the PDD can continually observe the incoming input elements and the generated output elements, and then incrementally construct a larger empirical matrix, and thus continually derive more-refined estimates of the dependency values as the empirical matrix evolves.
  • the method described so far is blind—it tries to ascertain the empirical dependencies using all samples of input and output elements, potentially increasing the time window until the dependency function (e.g., the conditional entropy) is observed to remain steady (below a specified threshold) or the resulting entropy is small enough.
  • the dependency function e.g., the conditional entropy
  • principles of the invention can also be combined with additional prior specifications that refine the selected set of input elements that are used in the empirical derivation process.
  • the processing component may have some external specifications (e.g., indicating that it only utilizes heart rate readings taken on Monday mornings or blood pressure readings taken while in the gym); the PDD can apply such externally-specified filters to first reduce the vector space of input data elements that may be potentially associated with an output element. The subsequent technique of determining the appropriate minimal set of input elements remains the same.
  • an equivalence class may be defined to a set of output values (a subset of the range of output values) such that all members of this set have an identical or similar dependence function over their corresponding input elements.
  • a situation arises, for example, if the output from a processing component is dependent on the past 100 values if the output value is greater than 40, but dependent on the past 1000 samples if the output is less than 40.
  • Such segmentation of the window of dependency can be done either blindly (without any prior segmentation of the output range) or with the help of prior specifications on the output segments (in which case, principles of the invention can still be used to determine if multiple segments can be combined into one equivalence class).
  • Such segmentation helps to further refine the provenance dependency—instead of defining a broad window of dependence for all output values, the method described above can potentially associate a more restricted and accurate window of dependence for certain ranges of output values.
  • forming as many elements as possible into one equivalence class also reduces the storage space needed to store the derived provenance dependency functions.
  • a simple embodiment of this approach would be to first partition the output space into an appropriate set of partitions, and assign the empirically observed output elements into their corresponding partitions.
  • the statistical analysis techniques described above can then be applied on each partition of data independently to derive its temporal or sequence-based dependence. If the derived dependence for multiple partitions turns out to be identical (or within a specified tolerance, such as the length of the time window ⁇ being within +/ ⁇ 2 of each other), then the partitions may be replaced by one equivalent partition, with one corresponding combined dependency function.
  • systems and methods for supporting multi-user collaborative software development environments will now be discussed in greater detail with reference to the exemplary figures in which the same reference numbers denote the same or similar elements. It is to be understood that the systems and methods described herein in accordance with the present invention may be implemented in various forms of hardware, software, firmware, special purpose processors, or a combination thereof. In particular, in one exemplary embodiment, systems and methods of the invention are implemented in software comprising program instructions that are tangibly embodied on one or more program storage devices (e.g., hard disk, magnetic floppy disk, RAM, CD ROM, DVD, ROM and flash memory), and executable by any device or machine comprising suitable architecture.
  • program storage devices e.g., hard disk, magnetic floppy disk, RAM, CD ROM, DVD, ROM and flash memory
  • FIG. 1 shows a graph of analysis components.
  • This graph has eight processing elements (PE): 100 , 110 , 120 , 130 , 140 , 150 , 160 , and 170 .
  • the processing elements are connected via communication paths represented by the directional arrows connecting them.
  • the processing element passes the resultant output to the next processing element according to the connections in the graph.
  • We can illustratively describe the subject of the invention as the problem of learning, at each processing element, dependency equations that allow the system to identify which input stream elements were used in the generation of a given output stream element. As shown in FIG.
  • data streams arriving on the ports 111 , 121 , 131 , 132 , 141 , 142 , 152 , 153 , 161 , 162 , 171 , and 172 are input to respective processing elements and elements are output by the respective processing elements on the corresponding output ports 101 , 112 , 113 , 122 , 123 , 133 , 134 , 143 , 151 , 163 , 164 , and 173 .
  • FIG. 1 it may be observed that the data elements arriving at ports 111 , 121 and 132 are identical, corresponding to the data elements generated by the output port 101 .
  • FIG. 6 depicts an illustrative architecture for the system.
  • Data sources 605 generate events and provide these events for display in an analysis graph 610 of processing elements.
  • the events may be generated by the Probe Generator 615 , which is specifically generating input events that help in the more accurate or more exhaustive derivation of the dependency windows.
  • the persistency of all streams of events flowing in the graph is performed by a storage manager 620 into a data store 625 .
  • empirical probability distributions are estimated.
  • the empirical distribution estimator 630 accesses the data store 620 to estimate these distributions.
  • These distributions are used by the dominant component analysis module 635 to identify the position in the input streams of the component that is mainly responsible for the generation of the output. It is inside the dominant component analysis module 635 that conditional entropies and mutual information estimates are computed from empirical probability distributions to identify dominant components in the input. These dominant components are the parts of the input that are mostly responsible for the value of the output for a given processing element.
  • the I-O (input-output) Dependency Equation Generator 640 generates I-O dependency equations and stores them in the provenance store 645 .
  • the Provenance Dependency Deriver 642 is in essence composed of the Dominant Component Analysis module 635 and the I-O Dependency Equation Generator 640 . These dependency equations can also be used by the provenance model validator 650 to validate the compliance of provenance I-O dependency assertions made by application developers at the Integrated Development Environment 655 .
  • FIG. 3 depicts a preferred embodiment for the method used to perform the dominant component analysis of module 635 .
  • This analysis starts ( 310 ) with a preparation of the data ( 312 ) in an empirical matrix, in the format shown in FIG. 2 .
  • streams are vectorized, into vectors 215 , 220 , 225 , 230 , 235 of size M.
  • a set of variables are initialized ( 315 ) for the dominant component analysis.
  • the set F of features of interest is set. Its cardinality (initially M) is stored in the variable K.
  • step 325 the X t-i with the lowest conditional entropy H(Y t
  • step 335 a conditional mutual information I cond is computed by taking the difference between pH and H(Y t
  • FIG. 4 shows a flow chart of a preferred embodiment for the computation taking place inside the I-O Dependency Equation Generator 640 .
  • the computation starts ( 410 ) with a generation ( 415 ) of a binary mask vector Xmask from the dominant terms computed by the dominant component analysis module 635 .
  • Xmask is a binary vector of size M, with elements Xmask[i] equal to one if the term at position i in X is dominant. Conversely, Xmask[i] is equal to zero if the term at position i in X is not dominant.
  • the next step ( 420 ) initializes variables needed for the rest of the computation.
  • the next step reads the value of Xmask[k] ( 425 ). We then test the value of Xmask[k] and compare it with s ( 430 ). If Xmask[k] is not equal to s, we append “j*(NOT Xmask[k]),” to the output string ( 435 ), and set ( 440 ) j to 0, s to Xmask[k]. (NOT Xmask[k]) refers to the binary inversion of the Xmask[k] bit. The computation then executes step 450 . If Xmask[k] is equal to s, j is incremented by 1 ( 445 ) and the computation then executes step 450 .
  • step 450 k is incremented by 1.
  • the next steps check if we have read all the elements of Xmask ( 455 ). This is done by checking if k is less or equal to M. If the answer is true, we have more elements to process and the computation loops back to step 425 . If the answer is no, the next step is to use the output, which is a run length encoding of Xmask, and translate it into an I-O dependency equation ( 460 ), before storing it ( 462 ) in the provenance store. The computation ends in step 465 .
  • FIG. 5 shows a technique proposed for the computation taking place inside the provenance model validator ( 650 in FIG. 6 ).
  • the computation starts ( 510 ) by reading learned I-O dependency equations for a given processing element ( 520 ), followed by a read of developer specified I-O dependency equations.
  • the next step evaluates differences between what the system has evaluated and what the developer has specified. If the difference is greater than epsilon ( 550 ), according to an arbitrary distance metric, a non-compliance alert is issued ( 570 ). This alert might be consumed by an administrator. Otherwise, if the distance is less or equal to epsilon, we record a compliance message ( 550 ).
  • FIG. 7 illustrates a computer system in accordance with which one or more components/steps of the techniques of the invention may be implemented. It is to be further understood that the individual components/steps may be implemented on one such computer system or on more than one such computer system.
  • the individual computer systems and/or devices may be connected via a suitable network, e.g., the Internet or World Wide Web.
  • the system may be realized via private or local networks. In any case, the invention is not limited to any particular network.
  • FIG. 7 may represent one or more servers or one or more other processing devices capable of providing all or portions of the functions described herein.
  • FIG. 7 may represent a mainframe computer system.
  • the computer system may generally include a processor 705 , memory 710 , input/output (I/O) devices 715 , and network interface 720 , coupled via a computer bus 725 or alternate connection arrangement.
  • processor as used herein is intended to include any processing device, such as, for example, one that includes a CPU and/or other processing circuitry. It is also to be understood that the term “processor” may refer to more than one processing device and that various elements associated with a processing device may be shared by other processing devices.
  • memory as used herein is intended to include memory associated with a processor or CPU, such as, for example, RAM, ROM, a fixed memory device (e.g., hard disk drive), a removable memory device (e.g., diskette), flash memory, etc.
  • the memory may be considered a computer readable storage medium.
  • input/output devices or “I/O devices” as used herein is intended to include, for example, one or more input devices (e.g., keyboard, mouse, etc.) for entering data to the processing unit, and/or one or more output devices (e.g., display, etc.) for presenting results associated with the processing unit.
  • input devices e.g., keyboard, mouse, etc.
  • output devices e.g., display, etc.
  • network interface as used herein is intended to include, for example, one or more transceivers to permit the computer system to communicate with another computer system via an appropriate communications protocol.
  • software components including instructions or code for performing the methodologies described herein may be stored in one or more of the associated memory devices (e.g., ROM, fixed or removable memory) and, when ready to be utilized, loaded in part or in whole (e.g., into RAM) and executed by a CPU.
  • ROM read-only memory
  • RAM random access memory
US12/125,219 2008-05-22 2008-05-22 Determining and validating provenance data in data stream processing system Active 2031-11-27 US8775344B2 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US12/125,219 US8775344B2 (en) 2008-05-22 2008-05-22 Determining and validating provenance data in data stream processing system
KR1020080105820A KR101006116B1 (ko) 2008-05-22 2008-10-28 데이터 스트림 처리 시스템에서 출처 데이터를 결정하고 확인하는 방법 및 장치

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US12/125,219 US8775344B2 (en) 2008-05-22 2008-05-22 Determining and validating provenance data in data stream processing system

Publications (2)

Publication Number Publication Date
US20090292818A1 US20090292818A1 (en) 2009-11-26
US8775344B2 true US8775344B2 (en) 2014-07-08

Family

ID=41342893

Family Applications (1)

Application Number Title Priority Date Filing Date
US12/125,219 Active 2031-11-27 US8775344B2 (en) 2008-05-22 2008-05-22 Determining and validating provenance data in data stream processing system

Country Status (2)

Country Link
US (1) US8775344B2 (ko)
KR (1) KR101006116B1 (ko)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160224632A1 (en) * 2015-02-02 2016-08-04 Microsoft Corporation Stream processing in search data pipelines
US9946522B1 (en) 2016-12-16 2018-04-17 International Business Machines Corporation Generating code for real-time stream processing

Families Citing this family (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9053437B2 (en) * 2008-11-06 2015-06-09 International Business Machines Corporation Extracting enterprise information through analysis of provenance data
US20100114628A1 (en) * 2008-11-06 2010-05-06 Adler Sharon C Validating Compliance in Enterprise Operations Based on Provenance Data
US8229775B2 (en) 2008-11-06 2012-07-24 International Business Machines Corporation Processing of provenance data for automatic discovery of enterprise process information
US8281141B2 (en) * 2009-03-24 2012-10-02 Lockheed Martin Corporation Method and apparatus for monitoring and analyzing degree of trust and information assurance attributes information in a data providence architecture workflow
DE102010022791B4 (de) * 2010-06-04 2015-08-06 Siemens Aktiengesellschaft Verfahren zur dreidimensionalen Darstellung einer bewegten Struktur durch ein Rotationsangiographie-Verfahren
KR101672500B1 (ko) * 2010-08-12 2016-11-03 삼성전자주식회사 시공간 구조 기반의 확률 그래프 모델 학습 장치 및 방법
US8468120B2 (en) * 2010-08-24 2013-06-18 International Business Machines Corporation Systems and methods for tracking and reporting provenance of data used in a massively distributed analytics cloud
US8423575B1 (en) 2011-09-29 2013-04-16 International Business Machines Corporation Presenting information from heterogeneous and distributed data sources with real time updates
US20130166767A1 (en) * 2011-11-23 2013-06-27 General Electric Company Systems and methods for rapid image delivery and monitoring
US8893292B2 (en) * 2012-11-14 2014-11-18 Mitsubishi Electric Research Laboratories, Inc. Privacy preserving statistical analysis for distributed databases
US20150317449A1 (en) * 2013-01-24 2015-11-05 Kantrack Llc Medication Delivery System
WO2015024603A1 (en) * 2013-08-23 2015-02-26 Nec Europe Ltd. Method and system for authenticating a data stream
US20150066713A1 (en) * 2013-09-04 2015-03-05 Capital One Financial Corporation Entropic link filter for automatic network generation
US9547547B2 (en) 2014-11-28 2017-01-17 Software Ag Systems and/or methods for handling erroneous events in complex event processing (CEP) applications
US9508157B2 (en) 2014-12-12 2016-11-29 Siemens Medical Solutions Usa, Inc. Reconstruction of aneurysm wall motion
US10803074B2 (en) * 2015-08-10 2020-10-13 Hewlett Packard Entperprise Development LP Evaluating system behaviour
US20170193371A1 (en) * 2015-12-31 2017-07-06 Cisco Technology, Inc. Predictive analytics with stream database

Citations (27)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0852440A2 (en) * 1997-01-07 1998-07-08 Fujitsu Limited Network data transmission systems
US6131091A (en) 1998-05-14 2000-10-10 Intel Corporation System and method for high-performance data evaluation
US20030076784A1 (en) 2001-10-24 2003-04-24 Zarlink Semiconductor V.N. Inc. Methods of performance estimation in provisioning delay intolerant data services
US20030084179A1 (en) 2001-10-30 2003-05-01 Kime Gregory C. Automated content source validation for streaming data
US20030126276A1 (en) 2002-01-02 2003-07-03 Kime Gregory C. Automated content integrity validation for streaming data
US6594773B1 (en) 1999-11-12 2003-07-15 Microsoft Corporation Adaptive control of streaming data in a graph
US6658477B1 (en) 1999-05-12 2003-12-02 Microsoft Corporation Improving the control of streaming data through multiple processing modules
US6725287B1 (en) 2000-11-09 2004-04-20 Elity Systems, Inc. Method and system for capturing streaming data by an actionable information engine
US6748440B1 (en) 1999-05-12 2004-06-08 Microsoft Corporation Flow of streaming data through multiple processing modules
US20040117037A1 (en) 2002-09-18 2004-06-17 Netezza Corporation Asymmetric streaming record data processor method and apparatus
US20050010510A1 (en) * 2001-07-31 2005-01-13 American Express Travel Related Services Company, Inc. Portfolio reconciler module for providing financial planning and advice
US20050185578A1 (en) 2004-02-25 2005-08-25 Microsoft Corporation Methods and systems for streaming data
US6983286B1 (en) 2002-05-10 2006-01-03 Oracle International Corporation Method and apparatus for accessing data as it existed at a previous point in time
US20060004802A1 (en) 2004-05-07 2006-01-05 Mark Phillips Apparatus and method for providing streaming data
US7010538B1 (en) 2003-03-15 2006-03-07 Damian Black Method for distributed RDSMS
US20060126713A1 (en) 2004-12-10 2006-06-15 Microsoft Corporation System and process for performing an exponentially weighted moving average on streaming data to establish a moving average bit rate
US20060149849A1 (en) 2005-01-03 2006-07-06 Gilad Raz System for parameterized processing of streaming data
US20060197766A1 (en) 2005-03-07 2006-09-07 Digital Fuel Technologies, Inc. System for interpretation of streaming data filters
US20060288045A1 (en) 2005-06-16 2006-12-21 Digital Fuel Technologies, Inc. Method for aggregate operations on streaming data
US20070043565A1 (en) 2005-08-22 2007-02-22 Aggarwal Charu C Systems and methods for providing real-time classification of continuous data streatms
US7194000B2 (en) 2002-06-21 2007-03-20 Telefonaktiebolaget L.M. Ericsson Methods and systems for provision of streaming data services in an internet protocol network
US20070088957A1 (en) * 2005-07-27 2007-04-19 Dc Ip, Llc Verifying provenance data associated with digital content
US7240065B2 (en) 2004-05-27 2007-07-03 Oracle International Corporation Providing mappings between logical time values and real time values
US7246157B2 (en) 1999-09-10 2007-07-17 Transurety, Llc Systems and methods for underwriting coverage for data transmissions
US7251660B2 (en) 2004-06-10 2007-07-31 Oracle International Corporation Providing mappings between logical time values and real time values in a multinode system
US20080201381A1 (en) * 2007-02-16 2008-08-21 Aditya Abhay Desai Method and system for increasing data reliability using source characteristics
US7680797B1 (en) 2003-07-25 2010-03-16 Verizon Data Services Llc Methods and systems for providing a data access layer

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030126273A1 (en) * 2002-01-03 2003-07-03 Goulet Mary E. Prefix-based systems, methods and access tools for accessing information on the internet

Patent Citations (28)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0852440A2 (en) * 1997-01-07 1998-07-08 Fujitsu Limited Network data transmission systems
US6131091A (en) 1998-05-14 2000-10-10 Intel Corporation System and method for high-performance data evaluation
US7222182B2 (en) 1999-05-12 2007-05-22 Microsoft Corporation Flow of streaming data through multiple processing modules
US6658477B1 (en) 1999-05-12 2003-12-02 Microsoft Corporation Improving the control of streaming data through multiple processing modules
US6748440B1 (en) 1999-05-12 2004-06-08 Microsoft Corporation Flow of streaming data through multiple processing modules
US7246157B2 (en) 1999-09-10 2007-07-17 Transurety, Llc Systems and methods for underwriting coverage for data transmissions
US6594773B1 (en) 1999-11-12 2003-07-15 Microsoft Corporation Adaptive control of streaming data in a graph
US6725287B1 (en) 2000-11-09 2004-04-20 Elity Systems, Inc. Method and system for capturing streaming data by an actionable information engine
US20050010510A1 (en) * 2001-07-31 2005-01-13 American Express Travel Related Services Company, Inc. Portfolio reconciler module for providing financial planning and advice
US20030076784A1 (en) 2001-10-24 2003-04-24 Zarlink Semiconductor V.N. Inc. Methods of performance estimation in provisioning delay intolerant data services
US20030084179A1 (en) 2001-10-30 2003-05-01 Kime Gregory C. Automated content source validation for streaming data
US20030126276A1 (en) 2002-01-02 2003-07-03 Kime Gregory C. Automated content integrity validation for streaming data
US6983286B1 (en) 2002-05-10 2006-01-03 Oracle International Corporation Method and apparatus for accessing data as it existed at a previous point in time
US7194000B2 (en) 2002-06-21 2007-03-20 Telefonaktiebolaget L.M. Ericsson Methods and systems for provision of streaming data services in an internet protocol network
US20040117037A1 (en) 2002-09-18 2004-06-17 Netezza Corporation Asymmetric streaming record data processor method and apparatus
US7010538B1 (en) 2003-03-15 2006-03-07 Damian Black Method for distributed RDSMS
US7680797B1 (en) 2003-07-25 2010-03-16 Verizon Data Services Llc Methods and systems for providing a data access layer
US20050185578A1 (en) 2004-02-25 2005-08-25 Microsoft Corporation Methods and systems for streaming data
US20060004802A1 (en) 2004-05-07 2006-01-05 Mark Phillips Apparatus and method for providing streaming data
US7240065B2 (en) 2004-05-27 2007-07-03 Oracle International Corporation Providing mappings between logical time values and real time values
US7251660B2 (en) 2004-06-10 2007-07-31 Oracle International Corporation Providing mappings between logical time values and real time values in a multinode system
US20060126713A1 (en) 2004-12-10 2006-06-15 Microsoft Corporation System and process for performing an exponentially weighted moving average on streaming data to establish a moving average bit rate
US20060149849A1 (en) 2005-01-03 2006-07-06 Gilad Raz System for parameterized processing of streaming data
US20060197766A1 (en) 2005-03-07 2006-09-07 Digital Fuel Technologies, Inc. System for interpretation of streaming data filters
US20060288045A1 (en) 2005-06-16 2006-12-21 Digital Fuel Technologies, Inc. Method for aggregate operations on streaming data
US20070088957A1 (en) * 2005-07-27 2007-04-19 Dc Ip, Llc Verifying provenance data associated with digital content
US20070043565A1 (en) 2005-08-22 2007-02-22 Aggarwal Charu C Systems and methods for providing real-time classification of continuous data streatms
US20080201381A1 (en) * 2007-02-16 2008-08-21 Aditya Abhay Desai Method and system for increasing data reliability using source characteristics

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
C. E. Shannon, "A Mathematical Theory of Communication," Bell System Technical Journal, Jul. and Oct. 1948, pp. 1-55 , vol. 27.
L. Moreau et al., "The Provenance of Electronic Data," Communications of the ACM, Apr. 2008, pp. 52-58, vol. 51, No. 4.
M. Blount et al., "A Time-and-Value Centric Provenance Model and Architecture for Medical Event Streams," International Conference on Mobile Systems, Application and Services, Proceedings of the 1st ACM SIGMOBILE International Workshop on Systems and Networking Support for Healthcare and Assisted Living Environments, Jun. 11, 2007, pp. 95-100.
N.N. Vijayakumar et al., "Tracking Stream Provenance in Complex Event Processing Systems for Workflow-Driven Computing," Second International Workshop on Event-driven Architecture, Processing, and Systems (EDA-PS'07), in conjunction with VLDB'07, Sep. 2007, 8 pages,Vienna, Austria.
R. Lempel et al., "Predictive Caching and Prefetching of Query Results in Search Engines," WWW '03 Proceedings of the 12th International Conference on World Wide Web, pp. 19-28, May 2003, Budapest, Hungary.

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160224632A1 (en) * 2015-02-02 2016-08-04 Microsoft Corporation Stream processing in search data pipelines
US10628423B2 (en) * 2015-02-02 2020-04-21 Microsoft Technology Licensing, Llc Stream processing in search data pipelines
US9946522B1 (en) 2016-12-16 2018-04-17 International Business Machines Corporation Generating code for real-time stream processing
US9983858B1 (en) 2016-12-16 2018-05-29 International Business Machines Corporation Generating code for real-time stream processing
US10241762B2 (en) 2016-12-16 2019-03-26 International Business Machines Corporation Generating code for real-time stream processing

Also Published As

Publication number Publication date
KR20090122104A (ko) 2009-11-26
US20090292818A1 (en) 2009-11-26
KR101006116B1 (ko) 2011-01-07

Similar Documents

Publication Publication Date Title
US8775344B2 (en) Determining and validating provenance data in data stream processing system
EP3355547B1 (en) Method and system for learning representations of network flow traffic
Hébert-Dufresne et al. Beyond R 0: heterogeneity in secondary infections and probabilistic epidemic forecasting
US20210120027A1 (en) Anomaly alert system for cyber threat detection
Hompes et al. Discovering deviating cases and process variants using trace clustering
Lakshmanan et al. Investigating clinical care pathways correlated with outcomes
US20170262353A1 (en) Event correlation
US20200336507A1 (en) Generative attack instrumentation for penetration testing
Rodrigues et al. Modeling and verification for probabilistic properties in software product lines
US10365945B2 (en) Clustering based process deviation detection
Quilbeuf et al. A logic for the statistical model checking of dynamic software architectures
EP3001329A1 (en) Method, controller, program and data storage system for performing reconciliation processing
Queiroz et al. A probabilistic model to predict the survivability of SCADA systems
US20210329026A1 (en) Reconstructing missing complex networks against adversarial interventions
Archetti et al. Federated survival forests
Larson et al. Data-driven prediction and origin identification of epidemics in population networks
Basak et al. DPPT: A differential privacy preservation technique for cyber–physical system
Yeh et al. Scale-dependent intrinsic entropies of complex time series
Khan et al. Context-based irregular activity detection in event logs for forensic investigations: An itemset mining approach
Kulessa et al. Revisiting non-specific syndromic surveillance
Wang et al. Petri net‐based deviation detection between a process model with loop semantics and event logs
Bharathi Vulnerability Detection in Cyber-Physical System Using Machine Learning
Girijakumari Sreekantan Nair et al. A precise sensor fault detection technique using statistical techniques for wireless body area networks
US20220385635A1 (en) Combined machine learning and formal techniques for network traffic analysis
US20240073012A1 (en) Method and system for generating cryptographic keys associated with biological extraction data

Legal Events

Date Code Title Description
AS Assignment

Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BLOUNT, MARION LEE;DAVIS, JOHN SIDNEY, II;EBLING, MARIA RENE;AND OTHERS;REEL/FRAME:021206/0007;SIGNING DATES FROM 20080527 TO 20080611

Owner name: INSTITUTE FOR INFORMATION TECHNOLOGY ADVANCEMENT,

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BLOUNT, MARION LEE;DAVIS, JOHN SIDNEY, II;EBLING, MARIA RENE;AND OTHERS;REEL/FRAME:021206/0007;SIGNING DATES FROM 20080527 TO 20080611

Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BLOUNT, MARION LEE;DAVIS, JOHN SIDNEY, II;EBLING, MARIA RENE;AND OTHERS;SIGNING DATES FROM 20080527 TO 20080611;REEL/FRAME:021206/0007

Owner name: INSTITUTE FOR INFORMATION TECHNOLOGY ADVANCEMENT,

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BLOUNT, MARION LEE;DAVIS, JOHN SIDNEY, II;EBLING, MARIA RENE;AND OTHERS;SIGNING DATES FROM 20080527 TO 20080611;REEL/FRAME:021206/0007

STCF Information on status: patent grant

Free format text: PATENTED CASE

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 4TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1551)

Year of fee payment: 4

AS Assignment

Owner name: KOREA (KEIT), KOREA, REPUBLIC OF

Free format text: MERGER;ASSIGNOR:INSTITUTE FOR INFORMATION TECHNOLOGY ADVANCEMENT (IITA);REEL/FRAME:053287/0347

Effective date: 20090403

Owner name: KOREA EVALUATION INSTITUTE OF INDUSTRIAL TECHNOLOGY (KEIT), KOREA, REPUBLIC OF

Free format text: MERGER;ASSIGNOR:INSTITUTE FOR INFORMATION TECHNOLOGY ADVANCEMENT (IITA);REEL/FRAME:053287/0816

Effective date: 20090403

Owner name: NATIONAL IT INDUSTRY PROMOTION AGENCY (NIPA), KOREA, REPUBLIC OF

Free format text: COMPREHENSIVE ASSIGNMENT;ASSIGNOR:KOREA EVALUATION INSTITUTE OF INDUSTRIAL TECHNOLOGY (KEIT);REEL/FRAME:053482/0374

Effective date: 20140601

AS Assignment

Owner name: NATIONAL RESEARCH FOUNDATION OF KOREA (NRF), KOREA, REPUBLIC OF

Free format text: COMPREHENSIVE ASSIGNMENT;ASSIGNOR:NATIONAL IT INDUSTRY PROMOTION AGENCY (NIPA);REEL/FRAME:053771/0149

Effective date: 20190107

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 8TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1552); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 8