ppxscal/embedding_network huggingface dataset:
Learning Bayesian Networks from Incomplete Data Based on EMI Method
Authors: Fengzhan Tian, Hongwei Zhang, Yuchang Lu
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Currently, there are few efficient methods in practice forlearning Bayesian networks from incomplete data, whichaffects their use in real world data mining applications.This paper presents a general-duty method that estimatesthe (Conditional) Mutual Information directly from incompletedatasets, EMI. EMI starts by computing the intervalestimates of a joint probability of a variable set, which areobtained from the possible completions of the incompletedataset. And then computes a point estimate via a convexcombination of the extreme points, with weights dependingon the assumed pattern of missing data. Finally, based onthese point estimates, EMI gets the estimated (conditional)Mutual Information. This paper also applies EMI to the dependencyanalysis based learning algorithm by J. Cheng soas to efficiently learn BNs with incomplete data. The experimentalresults on Asia and Alarm networks show that EMIbased algorithm is much more efficient than two search&scoring based algorithms, SEM and EM-EA algorithms. Interms of accuracy, EMI based algorithm is more accuratethan SEM algorithm, and comparable with EM-EA algorithm.
Fast Secure Processor for Inhibiting Software Piracy and Tampering
Authors: Jun Yang, Youtao Zhang, Lan Gao
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

Due to the widespread software piracy and virus attacks,significant efforts have been made to improve security forcomputer systems. For stand-alone computers, a key observationis that other than the processor, any component isvulnerable to security attacks. Recently, an execution onlymemory (XOM) architecture has been proposed to supportcopy and tamper resistant software [18, 17, 13]. In this design,the program and data are stored in encrypted formatoutside the CPU boundary. The decryption is carried afterthey are fetched from memory, and before they are used bythe CPU. As a result, the lengthened critical path causes aserious performance degradation.In this paper, we present an innovative technique inwhich the cryptography computation is shifted off from thememory access critical path. We propose to use a differentencryption scheme, namely "one-time pad" encryption, toproduce the instructions and data ciphertext. With someadditional on-chip storage, cryptography computations arecarried in parallel with memory accesses, minimizing performancepenalty. We performed experiments to study thetrade-off between storage size and performance penalty.Our technique improves the execution speed of the XOMarchitecture by 34.7% at maximum.
Freshness-driven adaptive caching for dynamic content web sites
Authors: Wen-Syan Li, Oliver Po, Wang-Pin Hsiung, K. Selçuk Candan, Divyakant Agrawal
Venue: Data Knowledge Engineering (2003)

Both response time and content freshness are essential to e-commerce applications on the Web. One option to achieve good response time is to build a high performance Web site by deploying the state of art IT infrastructures with large network and server capacities. With such a system architecture, freshness of the content delivered is limited by the network latency since when users receive the contents, the contents may have changed at the server. With the wide availability of content delivery networks, many e-commerce Web applications utilize edge cache servers to cache and deliver dynamic contents at locations much closer to users, avoiding network latency. By caching a large number of dynamic content pages in the edge cache servers, response time can be reduced, benefiting from higher cache hit rates. However, this is achieved at the expense of higher invalidation cost. On the other hand, a higher invalidation cost leads to a longer invalidation cycle (time to perform invalidation check on the pages in caches) at the expense of freshness of cached dynamic content. In this paper, we propose a freshness-driven adaptive dynamic content caching technique, which monitors response time and invalidation cycle length and dynamically adjusts caching policies. We have implemented the proposed technique within NEC's Cache Portal Web acceleration solution. We have conducted experiments to evaluate effectiveness of the proposed freshness-driven adaptive dynamic content caching technique. The experimental results show that the proposed technique consistently maintains the best content freshness to users. The experimental results also show that even a Web site with dynamic content caching enabled can further benefit from deployment of our solution with improvement of its content freshness up to 10 times especially during heavy user request traffic and long network latency delay.
Evaluation of pausible clocking for interfacing high speed IP cores in GALS Framework
Authors: Joycee Mekie, Supratik Chakraborty, Dinesh K. Sharma
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Pausible clocking schemes have been proposed by GALSarchitects as a promising mechanism for reliable data transferbetween synchronous modules fed by low-speed independentclocks. In this paper, we argue that existingschemes are not well-suited for interfacing high-speed IPcores with large clock-distribution tree delay and high communicationrates. We propose an alternative interface circuitdesign for such IP cores that works with partial handshakebetween communicating modules and minimizes theperformance penalty of the sender and receiver. Our circuit,unlike pausible clocking, has a small probability of failure.
Media Choice for Complex and Knowledge-Intensive Processes
Authors: Roman M. Wong, Cretson Dalmadge
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

In this paper we present a theoretical framework that focuses on examining the implications of the process characteristics of complexity and knowledge intensity on the media quality of communication. Communication quality is defined along the dimensions of interactiveness, richness, and precision. Using this three-dimensional construct of communication quality, we provide a classification schema for the common media types. This schema classifies media choices into eight groups of unique communication quality. The threedimensional frameworkprovides managers with an analytical tool to make decisions regarding the choice of media choice based on the communication quality needs of the processes. Our thesis is that managers should develop a communication infrastructure that is capable of providing appropriate communication supports to the various processes. In organizations where media choice decision making and process set up have followed a different pathway, the communication quality supported by the already installed communication technologies may differ that required by the process setup within the organizations. The framework presented in this paper can be used by managers as a diagnostic tool to identify the process-communication misfits for correctional measures.
Superposition with completely built-in Abelian groups
Authors: Guillem Godoy, Robert Nieuwenhuis
Venue: Journal of Symbolic Computation (2004)

A new technique is presented for superposition with first-order clauses with built-in Abelian groups (AG). Compared with previous approaches, it is simpler, and AG-unification is used instead of the computationally more expensive unification modulo associativity and commutativity. Furthermore, no inferences with the AG axioms or abstraction rules are needed; in this sense this is the first approach where AG is completely built in.
Interfacial nanofabrication strategies in development of new functional nanomaterials and planar supramolecular nanostructures for nanoelectronics and nanotechnology
Authors: G. B. Khomutov, V. V. Kislov, M. N. Antipina, R. V. Gainutdinov, S. P. Gubin, A. Yu. Obydenov, S. A. Pavlov, A. A. Rakhnyanskaya, A. N. Sergeev-Cherenkov, E. S. Soldatov, D. B. Suyatin, A. L. Tolstikhina, A. S. Trifonov, T. V. Yurova
Venue: Microelectronic Engineering (2003)

Clusters, nanoparticles, nanowires, long molecules as nanotubes and polynucleotides, and functional supramolecular nanostructures are currently considered as potential building blocks for nanotechnology and nanoelectronic devices and circuits, and development and introduction of new methods to control effectively their structure, composition and nanoscale organization are necessary. Here we describe a number of new nanofabrication methods which are based on the monolayer techniques, biomimetic principles, interfacial reactions and interactions. The methods allowed to produce new stable reproducible planar one-dimensional and two-dimensional arrays of ligand-stabilized nanoclusters and nanoparticles on solid substrates, ultrathin polymeric nanoscale-ordered mono- and multilayer quasi-crystalline and nanocomposite films, planar polymeric complex films with integrated DNA and inorganic building blocks as semiconductor and iron oxide nanoparticle quasi-linear arrays and nanowires. Transmission electron microscopy, STM and AFM techniques were used to characterize the fabricated nanostructures. Effects related to discrete electron tunneling were observed in the monolayers of nanoclusters and small gold nanoparticles at room temperature using STM.
Web site synthesis based on computational logic
Authors: João M. B. Cavalcanti, David Robertson
Venue: Knowledge and Information Systems (2003)

Web site design and maintenance has become a challenging problem due to the increase in volume and complexity of information presented in this way. Much attention has been given to the deployment of Web sites but little thought has been given to methods for their design and maintenance. Web site applications can also benefit from systematic approaches to development that make design more methodical and maintenance less time consuming. One way to tackle this problem is via automated synthesis, automatically deriving a Web site from a high-level application description. Computational logic is well suited to this problem because of its support of a uniform view of data and computation, allowing reasoning with both specification and program via meta-programming.
Automated complexity analysis of Nuprl extracted programs
Authors: Ralph Benzinger
Venue: Journal of Functional Programming (2001)

This paper describes the Automated Complexity Analysis Prototype (ACAp) system for automated complexity analysis of functional programs synthesized with the Nuprl proof development system. We define a simple abstract cost model for NUPRL's term language based on the current call-by-name evaluator. The framework uses abstract functions and abstract lists to facilitate reasoning about primitive recursive programs with first-order functions, lazy lists and a subclass of higher-order functions. The ACAp system automatically derives upper bounds on the time complexity of NUPRL extracts relative to a given profiling semantics. Analysis proceeds by abstract interpretation of the extract, where symbolic evaluation rules extend standard evaluation to terms with free variables. Symbolic evaluation of recursive programs generates systems of multi-variable difference equations, which are solved using the MATHEMATICA computer algebra system. The use of the system is exemplified by analyzing a proof extract that computes the maximum segment sum of a list and a functional program that determines the minimum of a list via sorting. For both results, we compare call-by-name to call-by-value evaluation.
Dynamic Test Allocation Model for Software Reliability
Authors: Shereef Abu Al-Maati, Kamel Rekab
Venue: Proceedings of the Third International Conference on Quality Software (2003)

In any non trivial software system the reliability of thesoftware cannot be determined exactly. Instead, we mustapply statistical methods to create an estimate based on asample of test cases. Our goal is, given a fixed totalnumber of test cases, to determine how to allocate thesetest cases among the partitions of the software so as tominimize the variance incurred by the maximumlikelihood estimator of the overall software reliability.In contrast to fixed sampling models, where theproportion of test cases taken from each partition isdetermined before reliability testing begins, we makeallocation decisions dynamically throughout the testingprocess. We compare the results from the dynamic testallocation model with the optimal sampling model anddemonstrate its strength with respect to the varianceincurred when the overall system reliability is estimatedby its maximum likelihood estimator both theoreticallyand through Monte Carlo simulations.
Gate leakage reduction for scaled devices using transistor stacking
Authors: Saibal Mukhopadhyay, Cassondra Neau, Riza Tamer Cakici, Amit Agarwal, Chris H. Kim, Kaushik Roy
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

In this paper, the effect of gate tunneling current in ultra-thin gate oxide MOS devices of effective length (Leff) of 25 nm ( oxide thickness = 1.1 nm), 50 nm ( oxide thickness = 1.5 nm) and 90 nm( oxide thickness = 2.5 nm) is studied using device simulation. Overall leakage in a stack of transistors is modeled and the opportunities for leakage reduction in the standby mode of operation are explored for scaled technologies. It is shown that, as the contribution of gate leakage relative to the total leakage increases with technology scaling, traditional techniques become ineffective in reducing overall leakage current in a circuit. A novel technique of input vector selection based on the relative contributions of gate and subthreshold leakage to the overall leakage is proposed for reducing total leakage in a circuit. This technique results in 44% savings in total leakage in 50-nm devices compared to the conventional stacking technique.
Improving graphical information system model use with elision and connecting lines
Authors: Jouni Huotari, Kalle Lyytinen, Marketta Niemelä
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2004)

Graphical information system (IS) models are used to specify and design IS from several perspectives. Due to the growing size and complexity of modern information systems, critical design information is often distributed via multiple diagrams. This slows search performance and results in reading errors that later cause omissions and inconsistencies in the final designs. We study the impact of large screens and the two promising visual integration techniques of elision and connecting lines that can decrease the designers' cognitive efforts to read diagrams. We conduct a laboratory experiment using 84 computer science students to investigate the impact of these techniques on the accuracy of the subjects' search and recall with entity-relationship diagrams and data flow diagrams. The search tasks involve both vertical and horizontal searches on a moderately complex IS model that consists of multiple diagrams. We also examine the subjects' spatial visualization abilities as a possible covariant for observed search performance. These visual integration techniques significantly reduced errors in both the search and the recall of diagrams, especially with respect to individuals with low spatial visualization ability.
Broadcast Messaging: Messaging to the Masses
Authors: Frank Jania
Venue: Queue (2003)

“We want this and that. We demand a share in that and most of that. Some of this and - - - - in’ all of that. And their demands will all be changed then, so - - - - in’ stay awake.”1 Comedian Billy Connolly wasn’t talking about messaging when he said this, but I don’t think there is a more appropriate quote for the voracious hunger we have for information as a result of the messaging-enabled, network-connected world that we take for granted every day.
Unique factorisation lifting functors and categories of linearly-controlled processes
Authors: Marta Bunge, Marcelo P. Fiore
Venue: Mathematical Structures in Computer Science (2000)

We consider processes consisting of a category of states varying over a control category as prescribed by a unique factorisation lifting functor. After a brief analysis of the structure of general processes in this setting, we restrict attention to linearly-controlled ones. To this end, we introduce and study a notion of path-linearisable category in which any two paths of morphisms with equal composites can be linearised (or interleaved) in a canonical fashion. Our main result is that categories of linearly-controlled processes (viz., processes controlled by path-linearisable categories) are sheaf models.
Scalable and efficient active service integration
Authors: David Maier
Venue:  (2003)

We investigate issues in the construction of an Active Service Integration System (ASIS). An ASIS is a mediation system that provides event-based monitoring and integration over data-intensive, networked services. We describe the design and implementation of the Paradox Active Service Integration System, which we have built as part of our dissertation work. Paradox addresses many of the fundamental issues of ASIS construction. Paradox extends database technology and previous work in data integration to handle event-based processing over autonomous, heterogeneous network services in an efficient manner. We suggest capabilities and metadata that services may provide to aid in the active integration process. Efficiency and scalability problems remain in Paradox that must be addressed in a practical system. We describe and evaluate methods for addressing several such problems that are unified by two central themes: inter-task sharing, and the specification and exploitation of increasingly rich service characteristics. Data caching is essential to a scalable and efficient ASIS. We describe how the long-lived nature of ASIS requests can be leveraged to make effective caching decisions. We present a detailed model and framework for effective, cost-based selection of a view cache in an ASIS. ASIS cache selection involves multiple complex tasks: the selection of the view cache, the optimization sub-problems that involve multiple, simultaneously-executing queries (MQO subproblems), and the generation of efficient plans that incorporate and maintain the chosen view cache. The resultant optimization problem is doubly-exponential in complexity. We describe a multi-pronged approach to handling this problem in a tractable manner. We present a description and implementation of Multiplex Query Optimization (MuxQO), a novel method for efficiently handling problems that can be cast as a group of overlapping query optimization problems. We characterize the applicability of MuxQO, and we describe a performance evaluation that demonstrates the effectiveness of MuxQO in handling ASIS view selection. MuxQO handles cache selection, MQO subproblems, and optimal plan generation in an integrated fashion. We describe how a top-down optimizer can be modified to support MuxQO. MuxQO is applicable to a range of problems, including physical database design, multiple query optimization, evaluation of recursive queries, and the physical representation of new data formats and models such as XML. Finally, we describe and evaluate a novel approach to exploiting rich application semantics to improve the efficiency and scalability of an ASIS. In particular, we describe a method for exploiting constraints on information change over time. Our approach can greatly improve the scalability of an ASIS with respect to the frequency of change events at component sources. We argue that application-level semantics are a rich vein to mine in improving the scalability and efficiency of active service integration.
A Nonoverlapping Domain Decomposition Method for Orthogonal Spline Collocation Problems
Authors: Bernard Bialecki, Maksymilian Dryja
Venue: SIAM Journal on Numerical Analysis (2003)

A nonoverlapping domain decomposition approach is used on uniform and matching grids to first define and then to compute the orthogonal spline collocation solution of the Dirichlet boundary value problem for Poisson's equation on an L-shaped region. We prove existence and uniqueness of the collocation solution and derive optimal order Hs-norm error bounds for s=0,1,2$. The collocation solution on two interfaces is computed using the preconditioned conjugate gradient method, and the collocation solution on three squares is computed by a matrix decomposition method that uses fast Fourier transforms. The total cost of the algorithm is O(N2\log N), where the number of unknowns in the collocation solution is O(N2)$.
A reduction-graph model of precedent in legal analysis
Authors: L. Karl Branting
Venue: Artificial Intelligence (2003)

Legal analysis is a task underlying many forms of legal problem solving. In the Anglo-American legal system, legal analysis is based in part on legal precedents, previously decided cases. This paper describes a reduction-graph model of legal precedents that accounts for a key characteristic of legal precedents: a precedent's relevance to subsequent cases is determined by the theory under which the precedent is decided. This paper identifies the implementation requirements for legal analysis using the reduction-graph model of legal precedents and describes GREBE, a program that satisfies these requirements.
A Tutte Polynomial for Coloured Graphs
Authors: Béla Bollobás, Oliver Riordan
Venue: Combinatorics, Probability and Computing (1999)

We define a polynomial W on graphs with colours on the edges, by generalizing the spanning tree expansion of the Tutte polynomial as far as possible: we give necessary and sufficient conditions on the edge weights for this expansion not to depend on the order used. We give a contraction-deletion formula for W analogous to that for the Tutte polynomial, and show that any coloured graph invariant satisfying such a formula can be obtained from W. In particular, we show that generalizations of the Tutte polynomial obtained from its rank generating function formulation, or from a random cluster model, can be obtained from W. Finally, we find the most general conditions under which W gives rise to a link invariant, and give as examples the one-variable Jones polynomial, and an invariant taking values in &Zopf;&#x002F;22&Zopf;.
Real-time monitoring of large scientific simulations
Authors: V. Pascucci, D. E. Laney, R. J. Frank, G. Scorzelli, L. Linsen, B. Hamann, F. Gygi
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

We present a distributed framework that enables real-time streaming and visualization of data generated by large remote simulations. We address issues arising from distributed clientserver environments and guarantee good parallel load balancing. We apply progressive computing techniques and parallel, hierarchical data streaming techniques to reduce the "distance" between the simulation hardware and the systems where the actual visualization and analysis occur. We present a simple and efficient load balancing method that scales to arbitrary simulation sizes and does not introduce additional communication cost. We demonstrate the performance of our system with a molecular dynamics code and show its ability to allow monitoring of all the time-steps of a large simulation with negligible time overhead.