Results 261 to 270 of about 29,845,221 (313)
Some of the next articles are maybe not open access.
SPIE Proceedings, 2013
And for the extended finite state machine (EFSM) data dependence relationship path, two main methods are widely used, but they still have room for improvement. This paper takes into consideration the strengths and weakness of the two methods, gives the mathematical description of the path dependence, improves the selection of path marks, and through ...
Shenghui Shi, Qunxiong Zhu
openaire +1 more source
And for the extended finite state machine (EFSM) data dependence relationship path, two main methods are widely used, but they still have room for improvement. This paper takes into consideration the strengths and weakness of the two methods, gives the mathematical description of the path dependence, improves the selection of path marks, and through ...
Shenghui Shi, Qunxiong Zhu
openaire +1 more source
Proceedings of the 10th workshop on ACM SIGOPS European workshop: beyond the PC - EW10, 2002
If you can't make your data dependable, then you can't make your computing dependable, either. The good news is that the list of data protection techniques is long, and growing. The bad news is that the choices they offer are getting more complicated: how many copies of data to keep? whether to use full or partial redundancy?
Kimberly Keeton, John Wilkes
openaire +2 more sources
If you can't make your data dependable, then you can't make your computing dependable, either. The good news is that the list of data protection techniques is long, and growing. The bad news is that the choices they offer are getting more complicated: how many copies of data to keep? whether to use full or partial redundancy?
Kimberly Keeton, John Wilkes
openaire +2 more sources
On data dependencies in dataspaces
2011 IEEE 27th International Conference on Data Engineering, 2011To study data dependencies over heterogeneous data in dataspaces, we define a general dependency form, namely comparable dependencies (CDs), which specifies constraints on comparable attributes. It covers the semantics of a broad class of dependencies in databases, including functional dependencies (FDs), metric functional dependencies (MFDs), and ...
Shaoxu Song, Lei Chen 0002, Philip S. Yu
openaire +2 more sources
Conversion of control dependence to data dependence
Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '83, 1983Program analysis methods, especially those which support automatic vectorization, are based on the concept of interstatement dependence where a dependence holds between two statements when one of the statements computes values needed by the other. Powerful program transformation systems that convert sequential programs to a form more suitable for ...
John R. Allen +3 more
openaire +1 more source
A Proof Procedure for Data Dependencies
Journal of the ACM, 1984A class of dependencies, tuple and equality generating dependencies, is defined, and the chase process is generalized to deal with these dependencies. For total dependencies the chase is an exponential time decision procedure for the implication problem, and in some restricted cases it can be modified to run in polynomial time.
Catriel Beeri, Moshe Y. Vardi
openaire +1 more source
Fragmentation in Presence of Data Dependencies
IEEE Transactions on Dependable and Secure Computing, 2014Fragmentation has been recently proposed as a promising approach to protect the confidentiality of sensitive associations whenever data need to undergo external release or storage. By splitting attributes among different fragments, fragmentation guarantees confidentiality of the associations among these attributes under the assumption that such ...
Sabrina De Capitani di Vimercati +5 more
openaire +4 more sources
Fuzzy data dependencies and implication of fuzzy data dependencies
Fuzzy Sets and Systems, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Contexts and Data Dependencies: A Synthesis
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1983Two data-organization devices that have come out of AI re-search are data pools (``contexts'') and data dependencies. The latter are more flexible than the former, and have supplanted them. Data pools offer certain advantages of efficiency, however, so it is worth trying to make the two mechanisms compatible.
openaire +2 more sources
Effectiveness of data dependence analysis
International Journal of Parallel Programming, 1995Data dependence testing is the basic step in detecting loop level parallelism in numerical programs. The problem is undecidable in the general case. Therefore, work has been concentrated on a simplified problem, affine memory disambiguation. In this simpler domain, array references and loops bounds are assumed to be linear integer functions of loop ...
Dror E. Maydan +2 more
openaire +1 more source
Testing implications of data dependencies
Proceedings of the 1979 ACM SIGMOD international conference on Management of data - SIGMOD '79, 1979Presented is a computation method—the chase —for testing implication of data dependencies by a set of data dependencies. The chase operates on tableaux similar to those of Aho, Sagiv, and Ullman. The chase includes previous tableau computation methods as special cases.
David Maier 0001 +2 more
openaire +2 more sources