ppxscal/embedding_network huggingface dataset:
Adder and Multiplier Design in Quantum-Dot Cellular Automata
Authors: Heumpil Cho, Earl E. Swartzlander,  Jr.
Venue: IEEE Transactions on Computers (2009)

Quantum-dot cellular automata (QCA) is an emerging nanotechnology, with the potential for faster speed, smaller size, and lower power consumption than transistor-based technology. Quantum-dot cellular automata has a simple cell as the basic element. The cell is used as a building block to construct gates and wires. Previously, adder designs based on conventional designs were examined for implementation with QCA technology. That work demonstrated that the design trade-offs are very different in QCA. This paper utilizes the unique QCA characteristics to design a carry flow adder that is fast and efficient. Simulations indicate very attractive performance (i.e., complexity, area, and delay). This paper also explores the design of serial parallel multipliers. A serial parallel multiplier is designed and simulated with several different operand sizes.
Asymptotic enumeration of constellations and related families of maps on orientable surfaces
Authors: Guillaume Chapuy
Venue: Combinatorics, Probability and Computing (2009)

We perform the asymptotic enumeration of two classes of rooted maps on orientable surfaces: m-hypermaps and m-constellations. For m = 2 they correspond respectively to maps with even face degrees and bipartite maps. We obtain explicit asymptotic formulas for the number of such maps with any finite set of allowed face degrees. Our proofs combine a bijective approach, generating series techniques related to lattice walks, and elementary algebraic graph theory. A special case of our results implies former conjectures of Z. Gao.
Retrieving relationships from declarative files
Authors: Ciera Jaspan, Jonathan Aldrich
Venue: Proceedings of the Workshop on Relationships and Associations in Object-Oriented Languages (2009)

Software frameworks frequently require developers to interact with them using both OO-based languages and declarative files. The frameworks also require that these declarative files are consistent with the OO code, but it is currently difficult to check this in a generic way. Relationships have shown to be useful for checking constraints within OO code, and as a declarative file is essentially a static list of relationships, they may also be useful for checking constraints within declarative files. However, retrieving relationships from these files has many potential problems. In this paper, we show why it would be useful to retrieve relationships from declarative files, and we explore the hurdles that a solution will have to overcome.
Describing Knowledge Architectures
Authors: Enn Tyugu
Venue: Proceeding of the 2006 conference on Information Modelling and Knowledge Bases XVII (2006)

A conceptual framework for specifying knowledge architectures is represented. Knowledge architecture is considered independently of its implementation; abstraction of knowledge system as an interpreted free deductive system is used for analysis of knowledge-based systems. Visual notation for knowledge modules and their connections is introduced and used in analysis of known knowledge based tools.
Statistical Strength of a Hybrid Cryptosystem on 2-D Cellular Automata with Nonaffine Rotations
Authors: Marian Srebrny, Piotr Such
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

In this paper we present some basic evaluation of quality of the multicore (or multiagent) cryptosystem 2DCARotate according to the statistical tests suite recommended by the US National Institute of Standards and Technology (NIST), as well as to a new test by the grade analysis method which has recently been developed at the Institute of Computer Science of the Polish Academy of Sciences. The paper reports some results of these tests for our 2DCARotate based on a nonaffine Boolean function of rotation combined with three cellular automata (viewed as systems of many agents interacting upon neighborhood environment), in comparison with 3DES and AES-Rijndael which are currently the world's best symmetric ciphers. Against such competition our cipher fares surprisingly well.
The complex software network evolution of Java Development Kits: topological properties and design principles
Authors: Mingjiang Shi, Xiang Li, Xiaofan Wang
Venue: International Journal of Systems, Control and Communications (2009)

We study evolving topological properties of a typical example of complex software networks, the family of Java networks constructed from Java Development Kits (JDKs). In Java networks, a node is a software entity (class or interface) and there is an edge connecting two nodes if they have some syntactical relationships. After analysing a variety of topological characteristics, we conclude that the family of Java networks is in the category of small-world and scale-free networks owning a disassortative hierarchical structure, whose evolving properties are investigated as well. The topological properties are linked with software design principles and software practices. Through the study, some insights have been shed into the evolution of complex software networks.
Maximum likelihood estimation of the flow size distribution tail index from sampled packet data
Authors: Patrick Loiseau, Paulo Gonçalves, Stéphane Girard, Florence Forbes, Pascale Vicat-Blanc Primet
Venue: Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems (2009)

In the context of network traffic analysis, we address the problem of estimating the tail index of flow (or more generally of any group) size distribution from the observation of a sampled population of packets (individuals). We give an exhaustive bibliography of the existing methods and show the relations between them. The main contribution of this work is then to propose a new method to estimate the tail index from sampled data, based on the resolution of the maximum likelihood problem. To assess the performance of our method, we present a full performance evaluation based on numerical simulations, and also on a real traffic trace corresponding to internet traffic recently acquired.
Action Research on Construction of Basic Courses Chief Teachers Pedagogical Model Based on School Network
Authors: QiaoZhi Liu, LiMing Chen, ZhaoDe Zhou
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

In order to resolve the deficiency of quality teachers in university, this paper is intent to propose a widely-used basic courses chief teachers pedagogical model. By means of action research, we provide an evaluation and reflection of the proposed pedagogical model from three dimensions.
Preparing scientists for scalable software development
Authors: Valerie Maxville
Venue: Proceedings of the 2009 ICSE Workshop on Software Engineering for Computational Science and Engineering (2009)

Software development projects have always struggled to find the balance between domain knowledge and software engineering skills and experience. In computational science, this situation is in the extreme, requiring highly specific domain knowledge paired with skills in tuning parallel programs for optimal performance on specific hardware. These projects often take place in very small teams, or by an individual researcher, who must embody both the scientist and the software engineer. Through observation of a range of computational science projects, and the implementation of rigorous software engineering methods in larger projects, we can reflect on where to bring some of the formality of software engineering into computational science. As part of the iVEC Education Program we provide training to eResearchers, which provides an opportunity to prepare scientists for software projects. By infusing the training program with Software Engineering principles, we can provide best practice essentials to the scientists whose code may eventually need to be scaled to multiple processors, platforms, sites, users and developers. By promoting easily adopted, high-return techniques, we hope to develop a culture where quality is intrinsic, reuse is maximised and effort can be focussed on innovative, robust science.
Finding Case Law on a European Scale --Current Practice and Future Work
Authors: Marc van Opijnen
Venue: Proceeding of the 2008 conference on Legal Knowledge and Information Systems: JURIX 2008: The Twenty-First Annual Conference (2008)

There is a growing awareness that the national judge plays a vital role in the European legal system, as is illustrated by the emergence of various initiatives for the cross-border access of national (EU-related) case law. Because these and various national systems all use their own identifiers, findability and citability are seriously hampered. This paper assesses current developments and tries to define a solution for remaining problems. A European Case Law Identifier and a central index are fundamental elements in this solution.
Esquemas de participaci&oacute;n mixtos
Authors: M. D. María Elena Carbajal Franco
Venue: Proceedings of the 10th Annual International Conference on Digital Government Research: Social Networks: Making Connections between Citizens, Data and Government (2009)

En el documento se describen las experiencias que se han tenido durante la implementaci&oacute;n y funcionamiento de los medios interactivos en el Portal electr&oacute;nico del Poder Ejecutivo del Gobierno del Estado de M&eacute;xico. Se centra en el caso de estudio del "Proyecto SEDAGRO" que involucr&oacute; diversos medios tanto tradicionales como electr&oacute;nicos.
Decision support systems: improving performance with object oriented implementation
Authors: Bâ Adela, Diaconita Vlad, Lungu Ion, Velicanu Manole
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

The development cycle of a decision support system involves many resources, time and high cost and above all, the database schema used in the system is built only for some specific tasks. So, a relational database schema or a data warehouse prototype cannot be easily mapped and reused in multiple DSS projects. In this paper we propose an object-oriented (OO) approach and an OO database schema to accomplish the DSS implementation which require a multidimensional modeling at the conceptual level using fundamental concepts of OO (class, attribute, method, object, polymorphism, inheritance, hierarchy) to represent all multidimensional properties of a data warehouse, at both the structural and dynamic levels.
Corporate dynamic transparency: the new ICT-driven ethics?
Authors: Antonino Vaccaro, Peter Madsen
Venue: Ethics and Information Technology (2009)

The term "corporate transparency" is frequently used in scholarly discussions of business ethics and corporate social responsibility (CSR); however, it remains a volatile and imprecise term, often defined incompletely as "information disclosure" accomplished through standardized reporting. Based on the results of empirical studies of organizational behaviors, this paper identifies a new set of managerial practices based on the use of information and communication technologies (ICT) and particularly Internet-based tools. These practices are resulting in what can be termed "dynamic transparency." ICT allows for an informational environment characterized by two-way exchange between corporations and their stakeholders, which fosters a more collaborative marketplace. It is proposed that such dynamic information sharing, conducted by means of ICT, drives organizations to display greater openness and accountability, and more transparent operations, which benefit both the corporations and their constituents. One of the most important outcomes that will accrue to consumers and other individuals is the "right to know," especially about corporate strategies and activities that might directly affect their quality of life. This paper demonstrates that dynamic transparency is more desirable and more effective than the more common "static transparency" where firms' information disclosure is one-way, usually in response to government regulation. We present three ethical arguments to justify the implementation by business firms of dynamic transparency and demonstrate that their doing so is related to CSR and to augment and complement stakeholder engagement and dialogue. The paper concludes with a summary of the possible limits to and the problems involved in the implementation of dynamic transparency for corporations, and suggests some strategies to counter them.
Developing a Text Support Tool for English Language Learners
Authors: Jill Burstein, Jane Shore, John Sabatini, Yong-Won Lee, Matthew Ventura
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

K-12 teachers often need to develop text adaptations of authentic classroom texts as a way to provide reading-level appropriate materials to English language learners in their classrooms. Adaptations are done by hand, and include practices such as, writing text summaries, substituting appropriate vocabulary, and offering native language support. In light of the labor-intensiveness involved in the manual creation of text adaptations, we have implemented the Automated Text Adaptation Tool (ATA v.1.0). This tool uses natural language processing (NLP) capabilities to automatically generate text adaptations that are similar to teacher-created adaptations. We have also conducted a qualitative teacher pilot with 12 middle school teachers who teach English language learners. We present a discussion of the tool and pilot.
Multiplicative Noise Cleaning via a Variational Method Involving Curvelet Coefficients
Authors: Sylvain Durand, Jalal Fadili, Mila Nikolova
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

Classical ways to denoise images contaminated with multiplicative noise (e.g. speckle noise) are filtering, statistical (Bayesian) methods, variational methods and methods that convert the multiplicative noise into additive noise (using a logarithmic function) in order to apply a shrinkage estimation for the log-image data and transform back the result using an exponential function.We propose a new method that involves several stages: we apply a reasonable under-optimal hard-thresholding on the curvelet transform of the log-image; the latter is restored using a specialized hybrid variational method combining an ¿1 data-fitting to the thresholded coefficients and a Total Variation regularization (TV) in the image domain; the restored image is an exponential of the obtained minimizer, weighted so that the mean of the original image is preserved. The minimization stage is realized using a properly adapted fast Douglas-Rachford splitting. The existence of a minimizer of our specialized criterion and the convergence of the minimization scheme are proved. The obtained numerical results outperform the main alternative methods.
MLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions
Authors: Rahul Malik, Sangkyum Kim, Xin Jin, Chandrasekar Ramachandran, Jiawei Han, Indranil Gupta, Klara Nahrstedt
Venue: Proceedings of the 21st International Conference on Scientific and Statistical Database Management (2009)

High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collections, time-series data, sensor data and scientific databases. Because of the curse of dimensionality, it is already known that well-known data structures like kd-tree, R-tree, and M-tree suffer in their performance over high-dimensional data space which is inferior to a brute-force approach linear scan. In this paper, we focus on an approximate nearest neighbor search for two different types of queries: r-Range search and k-NN search. Adapting a novel concept of a ring structure, we define a new index structure MLR-Index (Multi-Layer Ring-based Index) in a metric space and propose time and space efficient algorithms with high accuracy. Evaluations through comprehensive experiments comparing with the best-known high-dimensional indexing method LSH show that our approach is faster for a similar accuracy, and shows higher accuracy for a similar response time than LSH.
Complex analytic neron models for degenerating abelian varieties over higher dimensional parameter spaces
Authors: Phillip Griffiths
Venue:  (2008)

Given a principally polarized variation of Hodge structure of weight 1 with unipotent local monodromies on the complement of a simple normal crossing divisor, we construct an analytic fiber space of complex Lie groups whose sheaf of holomorphic sections is the sheaf of admissible normal functions in the sense of M. Green, P. Griffiths and M. Saito. The general fibers of this space are principally polarized Abelian varieties, and the special fibers are complex Lie groups which have countably many components, each of which is a semi-Abelian variety.
Mathematics of Evolution and Phylogeny
Authors: Olivier Gascuel
Venue:  (2007)

This book considers evolution at different scales: sequences, genes, gene families, organelles, genomes and species. The focus is on the mathematical and computational tools and concepts, which form an essential basis of evolutionary studies, indicate their limitations, and give them orientation. Recent years have witnessed rapid progress in the mathematics of evolution and phylogeny, with models and methods becoming more realistic, powerful, and complex. Aimed at graduates and researchers in phylogenetics, mathematicians, computer scientists and biologists, and including chapters by leading scientists: A. Bergeron, D. Bertrand, D. Bryant, R. Desper, O. Elemento, N. El-Mabrouk, N. Galtier, O. Gascuel, M. Hendy, S. Holmes, K. Huber, A. Meade, J. Mixtacki, B. Moret, E. Mossel, V. Moulton, M. Pagel, M.-A. Poursat, D. Sankoff, M. Steel, J. Stoye, J. Tang, L.-S. Wang, T. Warnow, Z. Yang, this book of contributed chapters explains the basis and covers the recent results in this highly topical area.
Power-delay optimization in VLSI microprocessors by wire spacing
Authors: Konstantin Moiseev, Avinoam Kolodny, Shmuel Wimer
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2009)

The problem of optimal space allocation among interconnect wires in a VLSI layout, in order to minimize the switching power consumption and the average signal delay, is addressed in this article. We define a Weighted Power-Delay Sum (WPDS) objective function and derive necessary and sufficient conditions for the existence of optimal interwire space allocation, based on the notion of capacitance density. At the optimum, every wire must be in equilibrium of its line-to-line weighted capacitance density on its two opposite sides, and the WPDS of the whole circuit is minimal if and only if capacitance density is uniformly distributed across the entire layout. This condition is shown to be equivalent to all paths of the layout cross-capacitance graph having the same length and all cuts having the same flow. An implementation which has been used in the design of a recent commercial high-end microprocessor and yielded 17&percnt; power reduction and 9&percnt; delay reduction in top-level interconnects is presented.
A Coalitional Game Model for Heat Diffusion Based Incentive Routing and Forwarding Scheme
Authors: Xiaoqi Li, Wujie Zheng, Michael R. Lyu
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

We propose an incentive routing and forwarding scheme that integrates a reputation system into a monetary payment mechanism to encourage nodes cooperation in wireless ad hoc networks. For the first time in the literature, we build our reputation system based on a heat diffusion model. The heat diffusion model provides us a way of combining the direct and indirect reputation together and propagating the reputation from locally to globally. Further, we model and analyze our incentive scheme using a coalitional game, which is not the usual non-cooperative game like others. We further prove that under a proper condition this game has a non-empty stable core. From the evaluation we can see that the cumulative utility of nodes increases when nodes stay in the core.
Tuning the Feature Space for Content-Based Music Retrieval
Authors: Aleksandar Kovačević, Branko Milosavljević, Zora Konjović
Venue: Proceeding of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium (2006)

This paper presents a tunable content-based music retrieval (CBMR) system suitable for retrieval of music audio clips. Audio clips are represented as extracted feature vectors. The CBMR system is expert-tunable by altering the feature space. The feature space is tuned according to the expert-specified similarity criteria expressed in terms of clusters of similar audio clips. The tuning process utilizes our genetic algorithm that optimizes cluster compactness. The R-tree index for efficient retrieval of audio clips is based on the clustering of feature vectors. For each cluster a minimal bounding rectangle (MBR) is formed, thus providing objects for indexing. Inserting new nodes into the R-tree is efficiently conducted because of the chosen Quadratic Split algorithm. Our CBMR system implements the point query and the n-nearest neighbors query with the O(log n) time complexity. The paper includes experimental results in measuring retrieval performance in terms of precision and recall. Significant improvement in retrieval performance over the untuned feature space is reported.
ICCD: Interactive Continuous Collision Detection between Deformable Models Using Connectivity-Based Culling
Authors: Min Tang, Sean Curtis, Sung-Eui Yoon, Dinesh Manocha
Venue: IEEE Transactions on Visualization and Computer Graphics (2009)

We present an interactive algorithm for continuous collision detection between deformable models. We introduce multiple techniques to improve the culling efficiency and the overall performance of continuous collision detection. First, we present a novel formulation for continuous normal cones and use these normal cones to efficiently cull large regions of the mesh as part of self-collision tests. Second, we introduce the concept of “procedural representative triangles” to remove all redundant elementary tests between nonadjacent triangles. Finally, we exploit the mesh connectivity and introduce the concept of “orphan sets” to eliminate redundant elementary tests between adjacent triangle primitives. In practice, we can reduce the number of elementary tests by two orders of magnitude. These culling techniques have been combined with bounding volume hierarchies and can result in one order of magnitude performance improvement as compared to prior collision detection algorithms for deformable models. We highlight the performance of our algorithm on several benchmarks, including cloth simulations, N-body simulations, and breaking objects.