ppxscal/embedding_network huggingface dataset:
Computer-Aided Design and Test for Digital Microfluidics
Authors: Fei Su, Jun Zeng
Venue: IEEE Design Test (2007)

As the second-generation architecture of microfluidics-based biochips, digital microfluidics provides a flexible, scalable, and high-defect-tolerant system architecture. It enables programmability such that general-purpose biochemical analyses can be carried out in a manner similar to traditional benchtop protocols. As more bioassays are executed concurrently on digital microfluidics platforms, system integration and design complexity are expected to increase dramatically. This article provides an overview of several key issues in the modeling, simulation, synthesis, testing, and runtime reconfiguration of digital microfluidics, and presents an integrated, top-down CAD and test methodology. This methodology is expected to facilitate the integration of digital microfluidics with microelectronic components in next-generation SoCs.
Security Ontologies: Improving Quantitative Risk Analysis
Authors: Andreas Ekelhart, Stefan Fenz, Markus Klemen, Edgar Weippl
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

IT-security has become a much diversified field and small and medium sized enterprises (SMEs), in particular, do not have the financial ability to implement a holistic IT-security approach. We thus propose a security ontology, to provide a solid base for an applicable and holistic IT-security approach for SMEs, enabling low-cost risk management and threat analysis. Based on the taxonomy of computer security and dependability by Landwehr [1], a heavy-weight ontology can be used to organize and systematically structure knowledge on threats, safeguards, and assets. Using this ontology, each threat scenario can be simulated with a different protection profile as to evaluate the effectiveness and the cost/benefit ratio of individual safeguards.
Shadow of the Standford Bunny: Analysing Visual Models of Landscape Data Using Delaunay TIN
Authors: N. Sang, C. Gold, D. Miller
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

Treaties such as the European Landscape Convention, are increasingly requiring an "objective" view of "landscape quality' to determine where planning controls and special protections should apply. Although the technology exists to visualize landscapes for manual interpretation, planning processes remain dependent on cartographic views for the summarized information needed to objectively compare different sites. This paper presents a method for automatically analyzing data in perspective view, with an example application to "landscape quality' assessment.
A novel multiple-searching genetic algorithm for multimedia multicast routing
Authors: Chun-Wei Tsai, Cheng-Fa Tsai, Chi-Ping Chen
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

A novel efficient multiple-searching genetic algorithm (MSGA) is presented for constructing minimum-cost multicast trees with delay constraints. In order to have computers successfully become consumer electronics for multimedia multicast communication applications, we propose a novel multimedia multicast routing approach for the large-scale network. According to our simulation results, the computation cost of our proposed method can reduce much more than the other existing GAs.
Privacy-Preserving Data Mining Systems
Authors: Nan Zhang, Wei Zhao
Venue: Computer (2007)

Although successful in many applications, data mining poses special concerns for private data. An integrated architecture takes a systemic view of the problem, implementing established protocols for data collection, inference control, and information sharing.
The Future of Software Performance Engineering
Authors: Murray Woodside, Greg Franks, Dorina C. Petriu
Venue: 2007 Future of Software Engineering (2007)

Performance is a pervasive quality of software systems; everything affects it, from the software itself to all underlying layers, such as operating system, middleware, hardware, communication networks, etc. Software Performance Engineering encompasses efforts to describe and improve performance, with two distinct approaches: an early-cycle predictive modelbased approach, and a late-cycle measurement-based approach. Current progress and future trends within these two approaches are described, with a tendency (and a need) for them to converge, in order to cover the entire development cycle.
Neural Network Based Effort Estimation Using Class Points for OO Systems
Authors: S. Kanmani, J. Kathiravan, S. Senthil Kumar, M. Shanmugam
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Class points have been accepted to estimate the size of Object Oriented (OO) products and to directly predict the effort, cost and duration of the software projects. Most estimation models in use or proposed in the literature are based on regression techniques. In this paper, we attempt on using neural networks to estimate the development effort of OO systems using class points. The estimation model uses class points as the independent variable and development effort as the dependent variable. The results show that the estimation accuracy is higher in neural networks compared to the regression model. This experiment is carried out using the data set used in the literature.
Splicing UNIX into a genome mapping laboratory
Authors: Lincoln Stein, Andre Marquis, Ert Dredge, Mary Pat Reeve, Mark Daly, Steve Rozen, Nathan Goodman
Venue: Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1 (1994)

The Whitehead Institute/MIT Center for Genome Research is responsible for a number of large genome mapping efforts, the scale of which create problems of data and workflow management that dictate reliance on computer support. Two years ago, when we started to design the informatics support for the laboratory, we realized that the fluid and ever-changing nature of the experimental protocols precluded any effort to create a single monolithic piece of software. Instead we designed a system that relied on multiple distributed data analysis and processing tools knit together by a centralized database. The obvious choice of operating systems was UNIX. In order to make this choice palatable to the laboratory biologists--who rightly consider it their job to do experiments rather than to interact with computers, and who have come to expect all software to be as intuitive and responsive as the Apple Macintoshes on their desks--we designed a system that runs automatically and essentially invisibly. Whenever it is necessary for the informatics system to interact with a member of the laboratory we have carefully chosen a user interface paradigm that best balances the user's expectations against the system's capabilities. When possible we have chosen to adapt familiar software to our user interface needs rather than to write user interfaces from scratch. We've managed to hide the power of UNIX behind the innocuous personal computer-based front ends our users know and love, using techniques that should be applicable in other environments as well.
A statistical array processing approach for elastic wavefield data
Authors: G. S. Wagner
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Three-component seismic array data provide a multidimensional, spatially and temporally unaliased sampling of the seismic wavefield and the potential for a nearly comprehensive decomposition and characterization of the observed wavefield based on its frequency, wavenumber, and polarization characteristics. In this paper I outline a statistical array processing approach for three-component seismic array data that allows us to exploit and fully utilize the abundance of information provided by these unique data. My approach entails a succession of principal component analysis, factor analysis, and principal component analysis. The initial principal component analysis is conducted in an effort to separate the coherent and random components of the wavefield into orthogonal subspaces. The ensuing factor analysis allows us to isolate superimposed signals and estimate their frequency-wavenumber characteristics. The final principal component analysis provides estimates of the signals' polarization characteristics. This adaptive formulation provides high-resolution estimates of the signals' frequency, wavenumber, and polarization characteristics.
Dense Surface from Infrared Stereo
Authors: Kiana Hajebi, John S. Zelek
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

Discerning depth from IR stereopsis is difficult because in general IR imagery does not contain sufficient features for left-right correspondence. We investigate the production of sparse disparity maps from un-calibrated infrared stereo images and argue that a dense depth field may not be attained directly from IR stereo images, but perhaps a sparse depth field may be obtained that can be interpolated to produce a dense depth field. In our proposed technique the sparse disparity map is produced by matching the stable features, extracted from the phase congruency model. A set of Log-Gabor wavelet coefficients is used to analyze and describe the extracted features for matching. The resulted sparse disparity map is then refined by triangular and epipolar geometrical constraints. In densifying the sparse disparity map, a watershed transformation is performed on the discontinuity map of the reference image to divide the image into several segments and finally the surface of each segment is reconstructed independently by fitting a thin-plate spline to its known disparities. Experiments on a set of IR stereo pairs lend credibility to the robustness of our IR stereo matching and surface reconstruction technique.
Fuzzy differential equations and the extension principle
Authors: M. T. Mizukoshi, L. C. Barros, Y. Chalco-Cano, H. Román-Flores, R. C. Bassanezi
Venue: Information Sciences: an International Journal (2007)

We study the Cauchy problem for differential equations, considering its parameters and/or initial conditions given by fuzzy sets. These fuzzy differential equations are approached in two different ways: (a) by using a family of differential inclusions; and (b) the Zadeh extension principle for the solution of the model. We conclude that the solutions of the Cauchy problem obtained by both are the same. We also provide some illustrative examples.
Numerical Simulation of Fire Smoke Flow Properties in Large Space
Authors: Xiangyun Liu, Xiaoyin Zhang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

A simulation of hot smoke layer development in a large space building fire has been made. The distributions of temperature, velocity, and smoke concentration at a place of the large space building can be obtained by simulating. With the simulation results, the whole or local fire safety property in the large space building can be evaluated and emergency saving scheme can be scientifically made. Results show that ceiling temperature reaches to the highest value of 366K, when the time is 16 seconds. The soot depth increases quickly within 10 seconds, and almost keeps constant with time exceeds 100 second.
Speech coding and phoneme classification using MATLAB and NeuralWorks
Authors: B. A. St. George
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Applications involving speech coding and phonetic classification are introduced as educational tools for reinforcing signal processing concepts learned in senior level communication classes at the US Naval Academy. These applications utilize the software packages MATLAB and NeuralWorks and are used to explore the concepts of impulse sampling, Fourier transforms, data windowing, and homomorphic filtering.
PLS Path modelling: computation of latent variables with the estimation mode B
Authors: Mohamed Hanafi
Venue: Computational Statistics (2007)

PLS Path modelling has several interesting advantages compared to other existing approaches traditionally used for structural modelling. However, the lack of convergence properties of the existing iterative procedures for the computation of the latent variables, has always been considered as a major drawback. The convergence is stated only in practice. The present paper shows that when the estimation mode B is chosen for all blocks, the iterative procedure for the computation of latent variables proposed by Wold (in Encyclopaedia of statistical sciences, vol 6. Wiley, New York, pp. 581---591, 1985) is monotonically convergent.
Positivity and Stability of the dLV Algorithm for Computing Matrix Singular Values
Authors: Masashi Iwasaki, Yoshimasa Nakamura
Venue: Proceedings of the Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2007)

The discrete Lotka-Volterra algorithm for computing matrix singular values is considered. Positivity and boundedness of a parameter and variables are shown to guarantee a numerical stability of the algorithm. Orthogonal polynomials and integable systems play a key role.
pDomus: a prototype for Cluster-oriented Distributed Hash Tables
Authors: Jose Rufino, Albano Alves, Jose Exposto, Antonio Pina
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

The Domus architecture for Distributed Hash Tables (DHTs) is specially designed to support the concurrent deployment of multiple and heterogeneous DHTs, in a dynamic shared-all cluster environment. The execution model is compatible with the simultaneous access of several distributed/ parallel client applications to the same or different running DHTs. Support to distributed routing and storage is dynamically configurable per node, as a function of applications requirements, node base resources and the overall cluster communication, memory and storage usage. pDomus is a prototype of Domus that creates an environment where to evaluate the model embedded concepts and planned features. In this paper, we present a series of experiments conduced to obtain figures of merit i) for the performance of basic dictionary operations, and ii) for the storage overhead resulting from several storage technologies. We also formulate a ranking formula that takes into account access patterns of clients to DHTs, to objectively select the most adequate storage technology, as a valuable metric for a wide range of application scenarios. Finally, we also evaluate client applications and services scalability, for a select dictionary operation. Results of the overall evaluation are promising and a motivation for further work.
Analyzing Enterprise Architecture in National Governments: The Cases of Denmark and the Netherlands
Authors: Marijn Janssen, Kristian Hjort-Madsen
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

National enterprise architectures (NEA) promise to fill the gap between policy and implementation. NEAs are embedded within an institutional environment consisting of active players capable of responding strategically and innovatively to architectural initiatives, which might complicate NEA adoption. In this paper we analyze the efforts of two European national governments in developing enterprise architecture. Grounded in institutional theory and practice we develop an analytical framework and use this framework to analyze the efforts of two countries, Denmark and the Netherlands. Our framework and analysis draws the attention to the need to take a broader perspective on enterprise architecture, especially governance aspects determine the adoption and diffusion of NEA.
Polynomial flow-cut gaps and hardness of directed cut problems
Authors: Julia Chuzhoy, Sanjeev Khanna
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We study the multicut and the sparsest cut problems in directed graphs. In the multicut problem, we are a given an n-vertex graphG along with k source-sink pairs, and the goal is to find the minimum cardinality subset of edges whose removal separates all source-sink pairs. The sparsest cut problem has the same input, but the goal is to find a subset of edges to delete so as to minimize the ratio of deleted edges to the number of source-sink pairs that are separated by this deletion. The natural linear programming relaxation for multicut corresponds, by LP-duality, to the well-studied maximum (fractional) multicommodity flow problem, whilethe natural LP-relaxation for sparsest cut corresponds to maximum concurrent flow. Therefore, the integrality gap of the linear programming relaxation for multicut/sparsest cut is also the flow-cut gap: the maximum ratio, achievable for any graph,between the maximum flow value and the minimum cost solution for the corresponding cut problem. Starting with the celebrated max flow-mincut theorem of Ford and Fulkerson, flow-cut gaps have played acentral role in combinatorial optimization. For many NP-hard network optimization problems, the best known approximation guarantee corresponds to our understanding of the appropriate flow-cut gap. Our first result is that the flow-cut gap between maximum multicommodity flow and minimum multicut is ~Ω (n1/7) in directed graphs. We show a similar result for the gap between maximum concurrent flow and sparsest cutin directed graphs. These results improve upon a long-standing lowerbound of Ω(log n) for both types of flow-cut gaps. We notice that these polynomially large flow-cut gaps are in a sharp contrastto the undirected setting where both these flow-cut gaps are knownto be Θ(log n). Our second result is that both directed multicut and sparsest cut are hard to approximate to within a factor of 2Ω(log1-εn) for any constant ε>0,unless NP ⊆ ZPP. This improves upon the recent Ω(log n / log log n)-hardness result for these problems. We also showthat existence of PCP's for NP with perfect completeness, polynomially small soundness, and constant number of queries would imply a polynomial factor hardness of approximation for both these problems. All our results hold for directed acyclic graphs.
Broadcasting in (n,k)-Arrangement Graph Based on an Optimal Spanning Tree
Authors: Jingli Li, Yonghong Xiang, Manli Chen, Yongheng Zhou
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools for some important communication problems such as broadcasting and personalized communications. When it refers to communications, it always involves two costs. Specifically, sending a packet of b bytes along a link takes Ts + bTc time, where Ts is the time to initialize (or start-up) the communication link and Tc is the latency to transmit a byte. To optimize these costs, a spanning tree is constructed to solve one-to-all broadcasting problem in an (n, k)-arrangement graph. Since the spanning tree has an optimal height, our algorithm achieves optimal start-up cost O(D(An, k ))Ts and transmission cost O(\frac{m} {{k(n - k)}}Tc)under the all-port model, and optimal transmission cost O(mTc) under the one-port model.
Should internet service providers fear peer-assisted content distribution?
Authors: Thomas Karagiannis, Pablo Rodriguez, Konstantina Papagiannaki
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

Recently, peer-to-peer (P2P) networks have emerged as an attractive solution to enable large-scale content distribution without requiring major infrastructure investments. While such P2P solutions appear highly beneficial for content providers and end-users, there seems to be a growing concern among Internet Service Providers (ISPs) that now need to support the distribution cost. In this work, we explore the potential impact of future P2P file delivery mechanisms as seen from three different perspectives: i) the content provider, ii) the ISPs, and iii) individual content consumers. Using a diverse set of measurements including Bit-Torrent tracker logs and payload packet traces collected at the edge of a 20,000 user access network, we quantify the impact of peer-assisted file delivery on end-user experience and resource consumption. We further compare it with the performance expected from traditional distribution mechanisms based on large server farms and Content Distribution Networks (CDNs). While existing P2P content distribution solutions may provide significant benefits for content providers and end-consumers in terms of cost and performance, our results demonstrate that they have an adverse impact on ISPs' costs by shifting the associated capacity requirements from the content providers and CDNs to the ISPs themselves. Further, we highlight how simple "locality-aware" P2P delivery solutions can significantly alleviate the induced cost at the ISPs, while providing an overall performance that approximates that of a perfect world-wide caching infrastructure.
INVICON: A Toolkit for Knowledge-Based Control of Vision Systems
Authors: Olena Borzenko, Yves Lesperance, Michael Jenkin
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

To perform as desired in a dynamic environment a vision system must adapt to a variety of operating conditions by selecting vision modules, tuning their parameters, and controlling image acquisition. Knowledge-based (KB) controller-agents that reason over explicitly represented knowledge and interact with their environment can be used for this task; however, the lack of a unifyingmethodology and development tools makes KB controllers difficult to create, maintain, and reuse. This paper presents the INVICON toolkit, based on the IndiGolog agent programming language with elements from control theory. It provides a basic methodology, a vision module declaration template, a suite of control components, and support tools for KB controller development. We have evaluated INVICON in two case studies that involved controlling vision-based pose estimation systems. The case studies show that INVICON reduces the effort needed to build KB controllers for challenging domains and improves their flexibility and robustness.
A dependence tree model of phone correlation
Authors: O. Ronen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper introduces a new statistical model for acoustic observations in speech recognition. The model represents intra-utterance phone correlation and can be viewed as a probabilistic model of an utterance or a speaker. The phone correlation is modeled by a dependence tree, using the mutual information between pairs of phones as a measure of correlation. The experiments presented focus on robust tree topology design and on robust estimation for a given topology. With appropriate design algorithms, the dependence trees are shown to provide a better model for independent test data than an independent phone model.