ppxscal/embedding_network huggingface dataset:
Pre-RTL formal verification: an intel experience
Authors: Robert Beers
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

During the recent development of a next-generation Intel processor, the project's formal verification team verified a new coherence protocol and portions of its RTL implementation against the protocol's specification within project deadlines. Typically, FV teams apply formal property verification (FPV) after RTL is coded and, though it continues to be an effective complement to pre-silicon validation, this late application prevents it from keeping pace with the continual complexity increases in hardware designs. Our discussion centers around how applying FV early in the development cycle of this processor enabled continual verification as the design progressed, culminating with the targeted RTL verification. We also present the languages and methodologies used, the reasons behind the choices, and where improvements can be made.
Colored graphs without colorful cycles
Authors: Richard N. Ball, Ale&#x0161; Pultr, Petr Vojt&#x011b;chovsk&#x00fd;
Venue: Combinatorica (2007)

A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that a colored graph lacks colorful cycles iff it is Gallai, i.e., lacks colorful triangles. We then show that, under the operation mon &#x2261; m + n &#x2212; 2, the omitted lengths of colorful cycles in a colored graph form a monoid isomorphic to a submonoid of the natural numbers which contains all integers past some point. We prove that several but not all such monoids are realized. We then characterize exact Gallai graphs, i.e., graphs in which every triangle has edges of exactly two colors. We show that these are precisely the graphs which can be iteratively built up from three simple colored graphs, having 2, 4, and 5 vertices, respectively. We then characterize in two different ways the monochromes, i.e., the connected components of maximal monochromatic subgraphs, of exact Gallai graphs. The first characterization is in terms of their reduced form, a notion which hinges on the important idea of a full homomorphism. The second characterization is by means of a homomorphism duality.
Transmission and Reflection Diffraction Tomography in Breast Imaging
Authors: Francesco Simonetti, Lianjie Huang, Neb Duric
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Commercial medical ultrasound scanners produce images of human tissue by interpreting the information carried by echoes reflected from structures contained inside it. In this paper, a new generation of toroidal ultrasound arrays is used to measure both the signals reflected and transmitted through the tissue. It is shown that transmission measurements encode complete information about the gross structure of the tissue and lead to images that are superiorto those obtained form reflection measurements alone. Experimental results are provided for a gel phantom and a human breast in vivo.
LiveSync++: enhancements of an interaction metaphor
Authors: Peter Kohlmann, Stefan Bruckner, Armin Kanitsar, M. Eduard Gröller
Venue: Proceedings of graphics interface 2008 (2008)

The LiveSync interaction metaphor allows an efficient and nonintrusive integration of 2D and 3D visualizations in medical workstations. This is achieved by synchronizing the 2D slice view with the volumetric view. The synchronization is initiated by a simple picking on a structure of interest in the slice view. In this paper we present substantial enhancements of the existing concept to improve its usability. First, an efficient parametrization for the derived parameters is presented, which allows hierarchical refinement of the search space for good views. Second, the extraction of the feature of interest is performed in a way, which is adapting to the volumetric extent of the feature. The properties of the extracted features are utilized to adjust a predefined transfer function in a feature-enhancing manner. Third, a new interaction mode is presented, which allows the integration of more knowledge about the user-intended visualization, without increasing the interaction effort. Finally, a new clipping technique is integrated, which guarantees an unoccluded view on the structure of interest while keeping important contextual information.
A Three Dimensional Combinative Lifting Algorithm for Wavelet Transform Using 9/7 Filter
Authors: Lu Dai, Li Zhang, Xiaolin Zhao
Venue: Proceedings of the Data Compression Conference (2008)

For efficient storage and transmission of volumetric data, compression algorithms are imperative. Three dimensional discrete wavelet transform (3D-DWT) shows its advantages in the volumetric data compression for its perfect reconstruction and its lack of blocking artifact. In this paper, a novel three dimensional combinational lifting algorithm (3D-CLA) using 9/7 filter that calculates the 3D-DWT directly is proposed. The algorithm achieves one level decomposition through five stages, which have similar and regular structure. The algorithm can be implemented in-place for efficient use of memory, and can save more than 44% of the total number of multiplication than conventional approaches
Adaptive community-based multimedia data retrieval in a distributed environment
Authors: Wei Chen, Jing Chen, Qing Li
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

The ever increasing demand of large scale multimedia applications has made the development of effective multimedia database systems an important direction of research. Distributed architecture is widely used in this setting due to the large volume of data involved. This introduces a new challenge to adaptive multimedia data retrieval. Several issues have to be considered such as how trust can be propagated in an autonomous environment, and how to aggregate the results from individual databases and work out an overall ranking. In this paper, we propose a multimedia data retrieval method in a heterogeneous distributed database system. An agent reputation model that is based on social network analysis methods is employed for handling trust in the heterogeneous environment. An adaptive data retrieval method is utilized for an automated querying process based on the reputation model. Sub-group analysis is conducted for better support of collaborative ranking and community-based search. Experiment results show good performance of the proposed method.
A New Trust Model Based on Social Characteristic and Reputation Mechanism for the Semantic Web
Authors: Xue Wang, Fan Zhang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

A serious problem on the WWW is finding reliable information. Not everything found on the Web is true and the Semantic Web does not change that in any way. The problem will be even more crucial for the Semantic Web, where agents will be integrating and using information from multiple sources. Statements published on the Semantic Web have to be seen as claims rather than as facts, and there should be a way to decide which among many possibly inconsistent sources is most reliable. In this work, we propose a trust model for the Semantic Web. The proposed model is inspired by the use trust in human society. Trust is a type of social knowledge and encodes evaluations about which agents can be taken as reliable sources of information or services. Our proposed model allows agents to decide which among different sources of information to trust and thus act rationally on the semantic web.
Exact and efficient evaluation of the InCircle predicate for parametric ellipses and smooth convex objects
Authors: Ioannis Z. Emiris, George M. Tzoumas
Venue: Computer-Aided Design (2008)

We study the Voronoi diagram, under the Euclidean metric, of a set of ellipses, given in parametric representation. The article concentrates on the InCircle predicate, which is the hardest to compute, and describes an exact and complete solution. It consists of a customized subdivision-based method that achieves quadratic convergence, leading to a real-time implementation for non-degenerate inputs. Degenerate cases are handled using exact algebraic computation. We conclude with experiments showing that most instances run in less than 0.1 s, on a 2.6 GHz Pentium-4, whereas degenerate cases may take up to 13 s. Our approach readily generalizes to smooth convex objects.
Don't have a stemmer?: be un+concern+ed
Authors: Paul McNamee, Charles Nicholas, James Mayfield
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

The choice of indexing terms used to represent documents crucially determines how e ective subsequent retrieval will be. IR systems commonly use rule-based stemmers to normalize surface word forms to combat the problem of not finding documents that contain words related to query terms by inflectional or derivational morphology. But such stemmers are not available in all languages. In this paper we explore the effectiveness of unsupervised morphological segmentation as an alternative to stemming using test sets in thirteen European languages. We find that unsupervised segmentation is significantly better than unnormalized words, in several cases by more than 20%. However, rule-based stemming, if available, is better in low complexity languages. We also compare these methods to the use of character n-grams, finding that on average n-grams yield the best performance.
Gaussian process product models for nonparametric nonstationarity
Authors: Ryan Prescott Adams, Oliver Stegle
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Stationarity is often an unrealistic prior assumption for Gaussian process regression. One solution is to predefine an explicit nonstationary covariance function, but such covariance functions can be difficult to specify and require detailed prior knowledge of the nonstationarity. We propose the Gaussian process product model (GPPM) which models data as the pointwise product of two latent Gaussian processes to nonparametrically infer nonstationary variations of amplitude. This approach differs from other nonparametric approaches to covariance function inference in that it operates on the outputs rather than the inputs, resulting in a significant reduction in computational cost and required data for inference. We present an approximate inference scheme using Expectation Propagation. This variational approximation yields convenient GP hyperparameter selection and compact approximate predictive distributions.
Non-oscillatory central-upwind scheme for hyperbolic conservation laws
Authors: Yousef Hashem Zahran
Venue: International Journal of Computational Fluid Dynamics (2007)

We introduce a new fourth order, semi-discrete, central-upwind scheme for solving systems of hyperbolic conservation laws. The scheme is a combination of a fourth order non-oscillatory reconstruction, a semi-discrete central-upwind numerical flux and the third order TVD Runge-Kutta method. Numerical results suggest that the new scheme achieves a uniformly high order accuracy for smooth solutions and produces non-oscillatory profiles for discontinuities. This is especially so for long time evolution problems. The scheme combines the simplicity of the central schemes and accuracy of the upwind schemes. The advantages of the new scheme will be fully realized when solving various examples.
Extraction of protein interaction data: a comparative analysis of methods in use
Authors: Hena Jose, Thangavel Vadivukarasi, Jyothi Devakumar
Venue: EURASIP Journal on Bioinformatics and Systems Biology (2007)

Several natural language processing tools, both commercial and freely available, are used to extract protein interactions from publications. Methods used by these tools include pattern matching to dynamic programming with individual recall and precision rates. A methodical survey of these tools, keeping in mind the minimum interaction information a researcher would need, in comparison to manual analysis has not been carried out. We compared data generated using some of the selected NLP tools with manually curated protein interaction data (PathArt and IMaps) to comparatively determine the recall and precision rate. The rates were found to be lower than the published scores when a normalized definition for interaction is considered. Each data point captured wrongly or not picked up by the tool was analyzed. Our evaluation brings forth critical failures of NLP tools and provides pointers for the development of an ideal NLP tool.
Robust Simulation for Decisional Problems Applied for Drug Testing
Authors: Remus Câmpean
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

This paper is inspired from specific situations for the early phases of drugs testing. The particularity of the problem consists in the small dimension of the analyzed samples. For this reason, there is a presumption that the small dimension of samples affects the result of ANOVA statistical tests, when multiples groups have to be compared. Six dermatological treatments are tested on groups of ten patients each to test their effect on particular affections. In order to observe a difference between treatments an ANOVA technique is applied. The result suggests that no statistically significant difference can be observed between the six drugs. For objective reasons, despite the result of ANOVA, a hierarchy between drug’s variants must be established taking into account the general effect on the observed affections. The statistical inferential problem is converted into a decisional problem with weighted criteria of evaluation. The general decisional situation in which a set of alternatives are evaluated from the point of view of a set of criteria of evaluation is modeled and simulated. Then, the model is applied for the pharmaceutical problem. The robustness of the method of weighting the criteria of evaluation is studied using the empirical influence curve. Applying this method of ranking, one of the six creams is recommended as optimal with respect to all criteria of evaluation. The advantage of such an approach is that an inferential deadlock, due to the small number of data, can be surpassed. Computer implementations are made using Matlab.
An O(n/sup 1+/spl epsiv// log b) algorithm for the complex roots problem
Authors: C. A. Neff
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

Given a univariate polynomial f(z) of degree n with complex coefficients, whose real and imaginary parts can be expressed as a ratio of two integers less than 2/sup m/ in magnitude, the root problem is to find all the roots of f(z) up to specified precision 2/sup -/spl mu//. Assuming the arithmetic model for computation, we provide, for any /spl epsiv/>0, an algorithm which has complexity O(n/sup 1+/spl epsiv// log b), where b=m+/spl mu/. This improves on the previous best known algorithm for the problem which has complexity O(n/sup 2/ log b). We claim it that it follows from the fact that we can bound the precision required in all the arithmetic computations, that the complexity of our algorithm in the Boolean model of computation is O(n/sup 2+/spl epsiv//(n+b) log/sup 2/ b log log b).
Quantum circuit complexity
Authors: A. Chi-Chih Yao
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

We propose a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any function computable in polynomial time by a quantum Turing machine has a polynomial-size quantum circuit. This result also enables us to construct a universal quantum computer which can simulate, with a polynomial factor slowdown, a broader class of quantum machines than that considered by E. Bernstein and U. Vazirani (1993), thus answering an open question raised by them. We also develop a theory of quantum communication complexity, and use it as a tool to prove that the majority function does not have a linear-size quantum formula.
Church Website Design: A step by step approach
Authors: Timothy Fish
Venue:  (2007)

Website development is by no means difficult or there wouldn't be so many websites available, but for the church minister or webmaster who is trying to develop a church website there is the question of where to begin. For those who already have a website there is the question of what can be done to make it better. Timothy Fish provides a path through the maze of web technology. By following this path a church can have a website that is functional, inexpensive and easy to maintain. There are many books available that describe how to use web technology, but this book focuses on the details of designing and developing a church website. The reader will come to an understanding of the church's need for a website, the things that should go into the website, how to implement the website and what to do when it is done. If you are looking for one book to tell you what you need to know about developing a church website, this is that book.
Verification of evolving software via component substitutability analysis
Authors: Sagar Chaki, Edmund Clarke, Natasha Sharygina, Nishant Sinha
Venue: Formal Methods in System Design (2008)

This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniques for checking correctness of software upgrades: (1) a technique based on simultaneous use of over-and under-approximations obtained via existential and universal abstractions; (2) a dynamic assume-guarantee reasoning algorithm--previously generated component assumptions are reused and altered on-the-fly to prove or disprove the global safety properties on the updated system. When upgrades are found to be non-substitutable, our solution generates constructive feedback to developers showing how to improve the components. The substitutability approach has been implemented and validated in the ComFoRT reasoning framework, and we report encouraging results on an industrial benchmark.
Self-improving algorithms for delaunay triangulations
Authors: Kenneth L. Clarkson, C. Seshadhri
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, unknown, and arbitrary distribution. The first phase of our algorithm builds data structures that store relevant information about the input distribution. The second phase uses these data structures to efficiently compute the Delaunay triangulation of the input. The running time of our algorithm matches the information-theoretic lower bound for the given input distribution, implying that if the input distribution has low entropy, then our algorithm beats the standard Ω(n log n) bound for computing Delaunay triangulations. Our algorithm and analysis use a variety of techniques: ε-nets for disks, entropy-optimal point-location data structures, linear-time splitting of Delaunay triangulations, and information-theoretic arguments.
Optimal hierarchical decompositions for congestion minimization in networks
Authors: Harald Räcke
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

Hierarchical graph decompositions play an important role in the design of approximation and online algorithms for graph problems. This is mainly due to the fact that the results concerning the approximation of metric spaces by tree metrics (e.g. [10,11,14,16]) depend on hierarchical graph decompositions. In this line of work a probability distribution over tree graphs is constructed from a given input graph, in such a way that the tree distances closely resemble the distances in the original graph. This allows it, to solve many problems with a distance-based cost function on trees, and then transfer the tree solution to general undirected graphs with only a logarithmic loss in the performance guarantee. The results about oblivious routing [30,22] in general undirected graphs are based on hierarchical decompositions of a different type in the sense that they are aiming to approximate the bottlenecks in the network (instead of the point-to-point distances). We call such decompositions cut-based decompositions. It has been shown that they also can be used to design approximation and online algorithms for a wide variety of different problems, but at the current state of the art the performance guarantee goes down by an O(log2n log log n)-factor when making the transition from tree networks to general graphs. In this paper we show how to construct cut-based decompositions that only result in a logarithmic loss in performance, which is asymptotically optimal. Remarkably, one major ingredient of our proof is a distance-based decomposition scheme due to Fakcharoenphol, Rao and Talwar [16]. This shows an interesting relationship between these seemingly different decomposition techniques. The main applications of the new decomposition are an optimal O(log n)-competitive algorithm for oblivious routing in general undirected graphs, and an O(log n)-approximation for Minimum Bisection, which improves the O(log1.5n) approximation by Feige and Krauthgamer [17].
Filter for data transmission using 4B3T coding
Authors: Jiri Misurec, Vaclav Zeman
Venue: Proceedings of the 4th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision (2004)

In the design of analogue filters for the pre-processing of digital signals the filter parameters need to be chosen with respect to the spectral components of the signal being filtered. An incorrect choice can lead to a faulty processing or evaluation of the original signal. The paper points out the connection between the choice of cut-off frequency and the shape of the spectrum of processed signal. The design of a new type of filter for data transmission with 4B3T coding is shown. A computer simulation of the chosen filter is performed and the filter spectra prior and subsequent to filtering are compared.
Predictive thread-to-core assignment on a heterogeneous multi-core processor
Authors: Tyler Sondag, Viswanath Krishnamurthy, Hridesh Rajan
Venue: Proceedings of the 4th workshop on Programming languages and operating systems (2007)

As multi-core processors are becoming common, vendors are starting to explore trade offs between the die size and the number of cores on a die, leading to heterogeneity among cores on a single chip. For efficient utilization of these processors, application threads must be assigned to cores such that the resource needs of a thread closely matches resource availability at the assigned core. Current methods of thread-to-core assignment often require an application's execution trace to determine its runtime properties. These traces are obtained by running the application on some representative input. A problem is that developing these representative input sets is time consuming, and requires expertise that the user of a general-purpose processor may not have. We propose an approach for automatic thread-to-core assignment for heterogeneous multicore processors to address this problem. The key insight behind our approach is simple - if two phases of a program are similar, then the data obtained by dynamic monitoring of one phase can be used to make scheduling decisions about other similar phases. The technical underpinnings of our approach include: a preliminary static analysis-based approach for determining similarity among program sections, and a thread-to-core assignment algorithm that utilizes the statically generated information as well as execution information obtained from monitoring a small fraction of the program to make scheduling decisions.