ppxscal/embedding_network huggingface dataset:
Materialized views in probabilistic databases: for information exchange and query optimization
Authors: Christopher Ré, Dan Suciu
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Views over probabilistic data contain correlations between tuples, and the current approach is to capture these correlations using explicit lineage. In this paper we propose an alternative approach to materializing probabilistic views, by giving conditions under which a view can be represented by a block-independent disjoint (BID) table. Not all views can be represented as BID tables and so we propose a novel partial representation that can represent all views but may not define a unique probability distribution. We then give conditions on when a query's value on a partial representation will be uniquely defined. We apply our theory to two applications: query processing using views and information exchange using views. In query processing on probabilistic data, we can ignore the lineage and use materialized views to more efficiently answer queries. By contrast, if the view has explicit lineage, the query evaluation must reprocess the lineage to compute the query resulting in dramatically slower execution. The second application is information exchange when we do not wish to disclose the entire lineage, which otherwise may result in shipping the entire database. The paper contains several theoretical results that completely solve the problem of deciding whether a conjunctive view can be represented as a BID and whether a query on a partial representation is uniquely determined. We validate our approach experimentally showing that representable views exist in real and synthetic workloads and show over three magnitudes of improvement in query processing versus a lineage based approach.
Platform Design for Software Product Lines of Data-intensive Systems
Authors: Gernot Schmoelzer, Christian Kreiner, Michael Thonhauser
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

Software product line engineering promises rapid, feature oriented development of similar products in a particular domain by reusing core artifacts. Commonalities and variabilities of individual products are obtained by domain analysis and described in feature models. According to the feature model, reusable core assets or artifacts need to be designed and implemented to be assembled in particular products. In this paper we present a platform supporting product line development of data-intensive systems, based on the concepts of component based and model-driven development. Data-intensive systems are ofen built in several layers (e.g. database, business logic, user interface), so we have applied the methodology of product line engineering to each layer to find artifacts, describe their characteristics and dependencies. Mappings are defined between features and artifacts in order to assemble dflerent products from these reusable artifacts. Model-based strategies to tackle cross-cutting of variabilities - arising especially from data model variabilities - are presented.
Creating science and technology information databases for developing and sustaining sub-Saharan Africa's indigenous knowledge
Authors: Williams Ezinwa Nwagwu
Venue: Journal of Information Science (2007)

In this article, indigenous knowledge is defined as holistic of all forms of knowledge emanating from an indigenous community. The critical relevance of local science and technology information (STI) databases in the development and sustainability of Africa's indigenous knowledge is discussed. It is advocated that local African STI databases should be considered required development infrastructures because they will provide information resources that are more adequate for national planning and management than their international counterparts. Furthermore, the various stakeholders and their roles are identified and the policy environment of STI databases in Africa examined. Constraints notwithstanding, local databases for African STI resources are envisaged to enhance global distribution and sharing of Africa's indigenous knowledge.
An On-Line Algorithm for the Location of Cross Point Faults in Programmable Logic Arrays
Authors: K. S. Ramanatha
Venue: IEEE Transactions on Computers (1983)

An on-line algorithm is developed for the location of single cross point faults in a PLA (FPLA). The main feature of the algorithm is the determination of a fault set corresponding to the response obtained for a failed test. For the apparently small number of faults in this set, all other tests are generated and a fault table is formed. Subsequently, an adaptive procedure is used to diagnose the fault. Functional equivalence test is carried out to determine the actual fault class if the adaptive testing results in a set of faults with identical tests. The large amount of computation time and storage required in the determination, a priori, of all the fault equivalence classes or in the construction of a fault dictionary are not needed here. A brief study of functional equivalence among the cross point faults is also made.
A computational system to select candidate genes for complex human traits
Authors: Kyle J. Gaulton, Karen L. Mohlke, Todd J. Vision
Venue: Bioinformatics (2007)

Motivation: Identification of the genetic variation underlying complex traits is challenging. The wealth of information publicly available about the biology of complex traits and the function of individual genes permits the development of informatics-assisted methods for the selection of candidate genes for these traits. Results: We have developed a computational system named CAESAR that ranks all annotated human genes as candidates for a complex trait by using ontologies to semantically map natural language descriptions of the trait with a variety of gene-centric information sources. In a test of its effectiveness, CAESAR successfully selected 7 out of 18 (39%) complex human trait susceptibility genes within the top 2% of ranked candidates genome-wide, a subset that represents roughly 1% of genes in the human genome and provides sufficient enrichment for an association study of several hundred human genes. This approach can be applied to any well-documented mono-or multi-factorial trait in any organism for which an annotated gene set exists. Availability: CAESAR scripts and test data can be downloaded from http://visionlab.bio.unc.edu/caesar/ Contact: kgaulton@email.unc.edu
The File Mover: high-performance data transfer for the grid: Research Articles
Authors: Cosimo Anglano, Massimo Canonico
Venue: Concurrency and Computation: Practice Experience (2008)

The exploration in many scientific disciplines (e.g. High-Energy Physics, Climate Modeling, and Life Sciences) involves the production and the analysis of massive data collections, whose archival, retrieval, and analysis require the coordinated usage of high-capacity computing, network, and storage resources. To obtain satisfactory performance, these applications require the availability of a high-performance, reliable data transfer mechanisms, able to minimize the data transfer time that often dominates their execution time. In this paper we present the File Mover, an efficient data transfer system specifically tailored to the needs of data-intensive applications, that exploits the overlay networks paradigm to provide superior performance with respect to conventional file transfer systems. An extensive experimental evaluation, carried out by means of a proof-of-concept implementation of the File Mover for a variety of network scenarios, shows the ability of the File Mover to outperform alternative data transfer systems. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Discrete-Time Cellular Neural Networks in FPGA
Authors: J. Javier Martinez-Alvarez, F. Javier Toledo-Moreo, J. Manuel Ferrandez-Vicente
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

This paper describes a novel architecture for the hardware implementation of non-linear multi-layer cellular neural networks. This makes it feasible to design CNNs with millions of neurons accommodated in low price FPGA devices, being able to process standard video in real time.
Fourier methods for testing multivariate independence
Authors: Simos G. Meintanis, George Iliopoulos
Venue: Computational Statistics Data Analysis (2008)

Recently a power study of some popular tests for bivariate independence based on ranks has been conducted. An alternative class of tests appropriate for testing not only bivariate, but also multivariate independence is developed, and their small-sample performance is studied. The test statistics employ the familiar equation between the joint characteristic function and the product of component characteristic functions, and may be written in a closed form convenient for computer implementation. Simulations on a distribution-free version of the new test statistic show that the proposed method compares well to standard methods of testing independence via the empirical distribution function. The methods are applied to multivariate observations incorporating data from several major stock-market indices. Issues pertaining to the theoretical properties of the new test are also addressed.
Applying IoC and AOP to the Architecture of Reflective Middleware
Authors: Ke Ju, Jiang Bo
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

The traditional middleware is unable in flexible and the auto-adaptability aspect to be satisfied. This paper has discussed a kind of Reflective Middleware architecture based on IoC and AOP, which uses JMX to implement the microkernel-bus to manage the component. By contrasting and analyzing several common containers, Spring framework is used in the design of architecture, because of providing IoC container and AOP framework, which makes the architecture have the better flexibility and auto-adaptability.
A Research on Information Spillover Effects in Initial Public Offerings
Authors: Jao-Hong Cheng, Huei-Ping Chen, Sun-Far Chang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

The underwriters and listed companies have been growing up rapidly in recent years, and the whole offer size has become full-scaled. However, foreign scholars found that pioneer companies have many uncertainties in Initial Public Offerings (IPOs) due to there isn't any information about offer price and proceeds to refer. When companies want to decide the appropriate offer price and proceeds, they have to spend a lot of time and money on information gathering. If there existed information spillover, and the information would be acquired from the other companies which had finished IPOs. Therefore, we try to research whether there existed information spillover in Taiwan IPOs market. By empirical results, there exist positive information spillover in offer price and listing price revision. For underwriters, underwriter rank is based on underwriter reputation, and the underwriters which have better rank usually couldn't get the high initial return.
A New Solution to Coherence Problems in Multicache Systems
Authors: L. M. Censier
Venue: IEEE Transactions on Computers (1978)

A memory hierarchy has coherence problems as soon as one of its levels is split in several independent units which are not equally accessible from faster levels or processors. The classical solution to these problems, as found for instance in multiprocessor, multicache systems, is to restore a degree of interdependence between such units through a set of high speed interconnecting buses. This solution is not entirely satisfactory, as it tends to reduce the throughput of the memory hierarchy and to increase its cost.
On the use of a high-level fault model to analyze logical consequence of properties
Authors: S. Brait, F. Fummi, G. Pravadelli
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

Logical consequence between properties is generally examined by using theorem proving, which may require a large amount of time and space resources. This paper proposes a faster approach, which analyzes logical consequences by observing the property capability of revealing high-level faults. We consider a set of properties defined to check the correctness of a design (DUV) with respect to the specification. The paper proves that if there is only one property that distinguishes between a faulty and a fault-free behavior of the DUV, and then it cannot be a logical consequence of the remaining properties. It is shown that the reverse implication of such a theorem depends on the selected high-level fault model. According to these theoretical results, the paper proposes a method to analyze logical consequence of properties based on high-level fault simulation and theorem proving.
A Case Study on Testing Activites for KT-OSS Maintenance
Authors: Dae-Woo Kim, Hyun-Min Lim, Sang-Kon Lee
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

This paper describes the testing activities for the maintenance of the KT-OSS (Korea Telecom Operations Support System). Since the KT-OSS is a large software, it is essential to continuously perform maintenance activities such as the addition of new services from business departments and new functions requested by users and operators, performance improvement of existing functions, correction of the errors found during operation of the system, and so on. To ensure the successful maintenance of the KT-OSS without any effect on the existing functions and performance, we performed various tests related to functionality, efficiency and others before the added and modified parts were applied to the KT-OSS. In this paper, we show the maintenance process, the various tests related to it, the test organization, and the test environment for controlling the quality of the KT-OSS maintenance. Through these testing activities, we were able to successfully maintain the KT-OSS.
Latency Minimization for Synchronous Data Flow Graphs
Authors: A. H. Ghamarian, S. Stuijk, T. Basten, M. C. W. Geilen, B. D. Theelen
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Synchronous Data Flow Graphs (SDFGs) are a very useful means for modeling and analyzing streaming applications. Some performance indicators, such as throughput, have been studied before. Although throughput is a very useful performance indicator for concurrent real-time applications, another important metric is latency. Especially for applications such as video conferencing, telephony and games, latency beyond a certain limit cannot be tolerated. This paper proposes an algorithm to determine the minimal achievable latency, providing an execution scheme for executing an SDFG with this latency. In addition, a heuristic is proposed for optimizing latency under a throughput constraint. Experimental results show that latency computations are efficient despite the theoretical complexity of the problem. Substantial latency improvements are obtained, of 24-54% on average for a synthetic benchmark of 900 models, and up to 37% for a benchmark of six real DSP and multimedia models. The heuristic for minimizing latency under a throughput constraint gives optimal latency and throughput results under a constraint of maximal throughput for all DSP and multimedia models, and for over 95% of the synthetic models.
Model-based Edge Tracking for Segmentation of Low Contrast Images
Authors: Christopher Hudy, Jonathan Campbell, John Slater
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

Segmentation is a significant preliminary step for many image-based object recognition activities. Microscopy images often present segmentation problems, namely low contrast (the objects are translucent) and occlusions. Fortunately, translucency provides some possibility of solving the occlusion problem; edge-based methods can be used to tackle the low contrast (translucency) problem, but the edges are noisy and edge tracking must be used. In occluded regions edges can be very faint and noise and conflicting edges can confuse even edge tracking: an edge contour containing gaps may result. This poster presents work on a gap filling algorithm that uses model-based prediction to augment noisy edge data.
ChemXSeer: a digital library and data repository for chemical kinetics
Authors: Prasenjit Mitra, C. Lee Giles, Bingjun Sun, Ying Liu
Venue: Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience (2007)

In this paper, we describe the ChemXSeer system that hosts data and scholarly articles related to chemical kinetics. Domain scientists have different needs that are not served by general search engines. ChemXSeer enables chemists (and others) to search for chemical formulae. As part of the project, we have designed TableSeer that extracts data from PDF documents and enters them into a database. Scientists also submit the raw data obtained as results of their experiments to the data repository. Metadata is associated with the data and can be searched. A mediated system allows searching across data and documents using the same search query interface using keyword queries.
A High-Throughput Low-Power AES Cipher for Network Applications
Authors: Shin-Yi Lin
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

We propose a full-featured high-throughput low-power AES cipher which is suitable for widespread network applications. Different modes of operation are implemented, i.e., the ECB, CBC, CTR and CCM modes. Our cipher utilizes a cost-efficient two-stage pipeline for the CCM mode by a single datapath. With the design-for-test circuitry, the maximum throughput is 4.27 Gbps using a 0.13mum CMOS technology with a 333MHz clock rate. The hardware cost is 86.2K gates with the power of 40.9mW.
Connecting neurons to a mobile robot: an in vitro bidirectional neural interface
Authors: A. Novellino, P. D'Angelo, L. Cozzi, M. Chiappalone, V. Sanguineti, S. Martinoia
Venue: Computational Intelligence and Neuroscience (2007)

One of the key properties of intelligent behaviors is the capability to learn and adapt to changing environmental conditions. These features are the result of the continuous and intense interaction of the brain with the external world, mediated by the body. For this reason "embodiment" represents an innovative and very suitable experimental paradigm when studying the neural processes underlying learning new behaviors and adapting to unpredicted situations. To this purpose, we developed a novel bidirectional neural interface. We interconnected in vitro neurons, extracted from rat embryos and plated on a microelectrode array (MEA), to external devices, thus allowing real-time closed-loop interaction. The novelty of this experimental approach entails the necessity to explore different computational schemes and experimental hypotheses. In this paper, we present an open, scalable architecture, which allows fast prototyping of different modules and where coding and decoding schemes and different experimental configurations can be tested. This hybrid system can be used for studying the computational properties and information coding in biological neuronal networks with far-reaching implications for the future development of advanced neuroprostheses.
Enabling collaboration in high performance computing
Authors: Marjorie Darrah, Frances Van Scoy, Patrick Plunkett
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

The West Virginia Cluster Computing Grid (WVCCG) Project is focused on enabling, enhancing, and supporting high performance computing-based research and education throughout the state of West Virginia. The goal of this National Science Foundation funded project is to provide educators and researchers access to moderate-cost computational resources. This goal was met by deploying production quality cluster computing resources at five small state colleges and universities, which in the future will connect to larger resources at a research university and a non-profit research organization. These resources allow the colleges to integrate high performance computing into their curriculum and become a part of a larger research community. This paper discusses the challenges and triumphs of such a project and details the educational and research initiatives undertaken by this group. The partners in this effort are the West Virginia High Technology Consortium Foundation, West Virginia University, Fairmont State University, Alderson-Broaddus College, Wheeling Jesuit University, Davis and Elkins College, and West Virginia State College.
Optimum Test Set for Bridging Fault Detection in Reversible Circuits
Authors: Hafizur Rahaman, Dipak K. Kole Dipak K. Kole, Debesh K. Das, Bhargab B. Bhattacharya
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Testing of bridging faults in a reversible circuit is investigated in this paper. The intra-level single bridging fault model is considered here, i.e. any single pair of lines, both lying at the same level of the circuit, may be assumed to have been logically shorted in order to model a defect. For an (n · n) reversible circuit with d levels realized with simple Toffoli gates, the time complexity of the test generation procedure is O(nd2 log2n). A test set of cardinality O(d log2n) is found to be sufficient for testing all such detectable faults. A minimal test set can also be easily derived by using the concept of test equivalence.
Designing Software for Ease of Extension and Contraction
Authors: D. L. Parnas
Venue: IEEE Transactions on Software Engineering (1979)

Designing software to be extensible and easily contracted is discussed as a special case of design for change. A number of ways that extension and contraction problems manifest themselves in current software are explained. Four steps in the design of software that is more flexible are then discussed. The most critical step is the design of a software structure called the " uses" relation. Some criteria for design decisions are given and illustrated using a small example. It is shown that the identification of minimal subsets and minimal extensions can lead to software that can be tailored to the needs of a broad variety of users.
The Need for Language Advances
Authors: A. S. Liddle
Venue: Computer (1975)

We have heard a lot said in the past few days about some very advanced techniques and ideas relating to better ways of developing software. While I would not take anything away from what has been said, I would like to point out that there are some very serious practical problems in getting the great majority of practitioners in the industry to use and benefit from SP. If the people that I deal with are representative of the industry in general, there are a lot of engineers and programmers who do not yet have an appreciation of SP. If we do not consolidate the gains that are possible in the use of advanced languages and language facilities, we may lose the potential benefits of SP. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Application of Grid Task Scheduling Algorithm RR to Medium-Grained Evolution Strategies
Authors: Yoshiyuki Matsumura, Masashi Oiso, Masaki Matsuda, Noriyuki Fujimoto, Kenichi Hagihara, Kazuhiro Ohkura, Jeremy Wyatt, Xin Yao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

A computational method for implementation of Evolution Strategies (ES) in Grid computing environments is discussed. In this paper, list scheduling with Round-robin order Replication (RR) is adopted to reduce waiting times due to synchronization in Medium-grained ES. Our results show that the replication in RR can reduce the synchronous waiting time in comparison with Work Queue (WQ) methods.