ppxscal/embedding_network huggingface dataset:
Preference-Based Uncertain Data Integration
Authors: Matteo Magnani, Danilo Montesi
Venue: Proceedings of the 16th international conference on Knowledge Engineering: Practice and Patterns (2008)

In this paper we present a novel uncertainty-enabled approach to data integration. Uncertainty is a natural by-product of many automatic data integration processes. In our approach we keep it up to the integrated database, and use it to improve query answering. Our method is based on the concept of preference: we show how preferences can be interpreted and manipulated to produce a global uncertain data source, and discuss the complexity of ranking query results on the integrated database.
Foreground Detection Using the Choquet Integral
Authors: F. El Baf, T. Bouwmans, B. Vachon
Venue: Proceedings of the 2008 Ninth International Workshop on Image Analysis for Multimedia Interactive Services (2008)

Foreground Detection is a key step in background subtraction problem. This approach consists in the detection of moving objects from static cameras through a classification process of pixels as foreground or background. The presence of some critical situations i.e noise, illumination changes and structural background changes produces an uncertainty in the classification of image pixels which can generate false detections. In this context, we propose a fuzzy approach using the Choquet integral to avoid the uncertainty in the classification. The experiments on different video datasets have been realized by testing different color space and by fusing color and texture features. The proposed method is characterized through robustness against illumination changes, shadows and little background changes, and it is validated with the experimental results.
Planet-in-a-Bottle: A Numerical Fluid-Laboratory System
Authors: Chris Hill, Bradley C. Kuszmaul, Charles E. Leiserson, John Marshall
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Humanity's understanding of the Earth's weather and climate depends critically on accurate forecasting and state-estimation technology. It is not clear how to build an effective dynamic data-driven application system (DDDAS) in which computer models of the planet and observations of the actual conditions interact, however. We are designing and building a laboratory-scale dynamic data-driven application system (DDDAS), called Planet-in-a-Bottle, as a practical and inexpensive step toward a planet-scale DDDAS for weather forecasting and climate model. The Planet-in-a-Bottle DDDAS consists of two interacting parts: a fluid lab experiment and a numerical simulator. The system employs data assimilation in which actual observations are fed into the simulator to keep the models on track with reality, and employs sensitivity-driven observations in which the simulator targets the real-time deployment of sensors to particular geographical regions and times for maximal effect, and refines the mesh to better predict the future course of the fluid experiment. In addition, the feedback loop between targeting of both the observational system and mesh refinement will be mediated, if desired, by human control.
Multilayer stacking technology using wafer-to-wafer stacked method
Authors: Nobuaki Miyakawa, Eiri Hashimoto, Takanori Maebashi, Natsuo Nakamura, Yutaka Sacho, Shigeto Nakayama, Shinjiro Toyoda
Venue: ACM Journal on Emerging Technologies in Computing Systems (JETC) (2008)

We have developed a new three-dimensional stacking technology using the wafer-to-wafer stacked method. Electrical conductivity between each wafer is almost 100&percnt; and contact resistance is less than 0.7&Omega; between a through-silicon via (TSV) and a microbump. We have also created a prototype of a three-layer stacking device using our technology, where each wafer for the stacking is fabricated by using 0.18um CMOS technology based on 8-inch wafers. The device is operated by two times the frequency of the multichip module (MCM) device case using a two-dimensional device with identical functions and minimally different power consumption. The yields obtained from the results comprising all functional tests are over 60&percnt;.
Line Drawing Interpretation, 1 edition
Authors: Martin Cooper
Venue:  (2008)

The computer interpretation of line drawings is a classic problem in AI and has inspired the development of some fundamental AI tools. This novel approach to drawing interpretation combines new constraints with recent advances in soft constraint programming, Based on the authors considerable research experience, this book contains state-of-the-art reviews of work in drawing interpretation and discrete optimisation and is not just restricted to drawings of polyhedral objects, but also covers complex curved objects. The book will become a standard reference in the field with its coverage of many theoretical results with formal proofs, and is written in an accessible style making it attractive to any one intrigued by optical illusions and impossible or ambiguous figures, including computer scientists, mathematicians, cognitive scientists and psychologists.
Computer-Assisted Paper Wrapping with Visualization
Authors: Kenta Matsushima, Hiroshi Shimanuki, Toyohide Watanabe
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

This paper proposes an approach to support a wrapping process from an object and a piece of wrapping papers by the computer animation method. The combinational information about an object and a piece of wrapping papers generates possibly multiple feasible wrapping processes. Therefore, we first argue the state of paper wrapping which represents each stage in the wrapping process, and then assume that sequences of ordered states, called state space, construct the wrapping process successively. Second, the folding operations called wrap-folding are defined. These operations generate multiple wrapping processes on a state space which are physically feasible. Third, an algorithm of searching effective wrapping processes which satisfy demand of user is described. Finally, we give some experimental results to make the practical efficacy of proposed method clear. With the processing flow, we describe a computer assisted paper wrapping proto-type system.
E-voting in Europe: Divergent democratic practice
Authors: Jörgen Svensson, Ronald Leenes
Venue: Information Polity (2003)

Recent technological developments have opened up the possibility of electronic voting and this clearly provides some opportunities and threats. On the one hand, the new technology may help to make voting more cost effective and more convenient for the voter and may even increase voter turnout. On the other, e-voting may introduce new risks and affect electoral values, such as the secrecy of the vote and the place of voting as an observable institution in modern democracies. At present various countries and different electoral systems are confronted with these opportunities and threats and the question is what will happen. Will the new technology, with its international standards and its seemingly objective opportunities and threats determine the development and lead to a convergence in voting practices which optimise the benefits? Or, will decisions concerning the application of ICT in the voting process vary as a result of differences in social context and varying democratic institutions? In this paper we claim that, based on social theory regarding technology adoption, different countries may very well differ in their attitudes and actual decisions regarding e-voting. When we look at the current developments in 13 Western-European countries, this claim is supported. Decision-making concerning the introduction of e-Voting in these rather similar countries is clearly structured by diverging democratic institution and as a result e-voting developments actually differ.
Review of applied combinatorics on words
Authors: M. Lothaire
Venue: ACM SIGACT News (2008)

Text manipulations play an important part in various kinds of computations. The subject of text manipulations, is a well developed subject in computer science. The book deals with algorithms, and theoretical properties of texts. Most of algorithms are expressed in pseudo code. They are accompanied by their proofs of correctness, and complexity analysis. Some of them are explained with discussions containing examples, and diagrams. The stress is on combinatorial properties. The book is a part of a series on encyclopedia of mathematics.
Problems as Solutions
Authors: Peter Schuster
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

If a continuous function on a complete metric space has approximate roots and in a uniform manner at most one root, then it actually has a root. We validate this heuristic principle in Bishop---style constructive mathematics without countable choice, following Richman's way of defining the completion of a metric space as the set of all locations.MSC (2000): Primary 03F60; Secondary 03E25, 26E40, 54E50.
On the Unprovable Security of 2-Key XCBC
Authors: Peng Wang, Dengguo Feng, Wenling Wu, Liting Zhang
Venue: Proceedings of the 13th Australasian conference on Information Security and Privacy (2008)

There has been extensive research focusing on improving CBC-MAC to operate on variable length messages with less keys and less blockcipher invocations. After Black and Rogaway's XCBC, Moriai and Imai proposed 2-Key XCBC, which replaced the third key of XCBC with its first key. Moriai and Imai "proved" that 2-Key XCBC is secure if the underling blockcipher is a pseudorandom permutation (PRP). Our research shows that it is not the case. The security of 2-Key XCBC can not be proved under the solo assumption of PRP, even if it is a RPR-RK secure against some related-key attack. We construct a special PRP (PRP-RK) to show that the main lemma in [14] is not true and 2-Key XCBC using this PRP (PRP-RK) is totally insecure.
New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru
Authors: Eli Biham
Venue: Fast Software Encryption: 15th International Workshop, FSE 2008, Lausanne, Switzerland, February 10-13, 2008, Revised Selected Papers (2008)

In 1989---1990, two new hash functions were presented, Snefru and MD4. Snefru was soon broken by the newly introduced differential cryptanalysis, while MD4 remained unbroken for several more years. As a result, newer functions based on MD4, e.g., MD5 and SHA-1, became the de-facto and international standards. Following recent techniques of differential cryptanalysis for hash function, today we know that MD4 is even weaker than Snefru. In this paper we apply recent differential cryptanalysis techniques to Snefru, and devise new techniques that improve the attacks on Snefru further, including using generic attacks with differential cryptanalysis, and using virtual messages with second preimage attacks for finding preimages. Our results reduce the memory requirements of prior attacks to a negligible memory, and present a preimage of 2-pass Snefru. Finally, some observations on the padding schemes of Snefru and MD4 are discussed.
Data partitioning via high dimensional model representation by using paralel computing
Authors: Engin Kanal, Metin Demiralp
Venue: Proceedings of the 1st WSEAS International Conference on Multivariate Analysis and its Application in Science and Engineering (2008)

The multivariate functions become plague of plethora when the number of their arguments increases to high values as much as 2 digits numbers, because of the limitations of today's computers. Instead of computer programming directly, the mathematically efficient multivariate function representations must be developed before attempting computer programming. One of those methods is "High Dimensional Model Representation (HDMR)" Even when these types of methods are applied on the multivariate functions, the solution cost of the modified problem after the application of the method is still complicated for a stand-alone computer. In that case, the parallel programming helps us. Our main goal of this work is to modify the method for parallel computing.
Extending the functionality of RTP/RTCP implementation in network simulator (NS-2) to support TCP friendly congestion control
Authors: Christos Bouras, Apostolos Gkamas, Georgios Kioumourtzis
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

In this paper, we present a modification of the ns2 code for the RTP/RTCP protocols. The legacy RTP/RTCP code in ns2 has not yet been validated but it provides a framework of the protocol's specification for experimental use. We have modified the code by adding all the RTP/RTCP protocol's attributes that are defined in RFC 3550 and related to QoS metrics. We have also implemented additional algorithms and functions in order to enhance our modified code with TCP friendly bandwidth share behavior. Our protocol, named RTPUP ("UP" stands for the University of Patras), is offered as a package and is fully documented so that it can be used for simulations and research within the ns2 simulation environment.
Case-Based Reasoning for Invoice Analysis and Recognition
Authors: Hatem Hamza, Yolande Belaïd, Abdel Belaïd
Venue: Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2007)

This paper introduces the approach CBRDIA (Case-based Reasoning for Document Invoice Analysis) which uses the principles of case-based reasoning to analyze, recognize and interpret invoices. Two CBR cycles are performed sequentially in CBRDIA. The first one consists in checking whether a similar document has already been processed, which makes the interpretation of the current one easy. The second cycle works if the first one fails. It processes the document by analyzing and interpreting its structuring elements (adresses, amounts, tables, etc) one by one. The CBR cycles allow processing documents from both knonwn or unknown classes. Applied on 923 invoices, CBRDIA reaches a recognition rate of 85,22% for documents of known classes and 74,90% for documents of unknown classes.
Simulating Trust Overlay in P2P Networks
Authors: Yan Zhang, Wei Wang, Shunying Lü
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Though research on the overlay network has progressed at a steady pace, its promise has yet to be realized. One major difficulty is that, by its very nature, the overlay networks is a large, uncensored system to which anyone may contribute. This raises the question of how much dependability to give each information source. Traditional overlay network simulators provide accurate low-level models of the network hardware and protocols, but none of them deal with the issue of trust and reliability in the large scale overlay networks. We tackle this problem by employing a trust overlay simulator, which offer a viable solution to simulate trustworthy behavior in overlay networks. With this simulator, we can examine varies kinds of trust and reputation mechanisms in a large scale overlay environment.
Document Clustering Using Incremental and Pairwise Approaches
Authors: Tien Tran, Richi Nayak, Peter Bruza
Venue: Focused Access to XML Documents: 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007 Dagstuhl Castle, Germany, December 17-19, 2007. Selected Papers (2008)

This paper presents the experiments and results of a clustering approach for clustering of the large Wikipedia dataset in the INEX 2007 Document Mining Challenge. The clustering approach employed makes use of an incremental clustering method and a pairwise clustering method. The approach enables us to perform the clustering task on a large dataset by first reducing the dimension of the dataset to an undefined number of clusters using the incremental method. The lower-dimension dataset is then clustered to a required number of clusters using the pairwise method. In this way, clustering of the large number of documents is performed successfully and the accuracy of the clustering solution is achieved.
Web Accessible and Mobile: The Relationship between Mobile Web Best Practices and Web Content Accessibility Guidelines
Authors: Alan Chuter
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Online services are increasingly important in everyday life and services are increasingly delivered using mobile devices. Accessibility for people with disabilities is a priority and often an obligation. Mobile access is a business priority and sometimes mandatory. While much effort has been dedicated to accessibility, many providers must now also provide inclusive access from mobile devices. This can dramatically increase development, deployment and maintenance costs. This paper introduces recent work in the W3C's Mobile Web Initiative and Web Accessibility Initiative on the overlap and synergies between these aspects. 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
Reduction of vibrations transmitted to human body by cabin antivibrating insulation in case of mobile technological equipment
Authors: Aurelia Mihalcea
Venue: Proceedings of the 9th WSEAS International Conference on Acoustics & Music: Theory & Applications (2008)

The solution adopted for the cabin insulation in case of mobile equipment subjected to vibrations transmitted by the engine and the actuation system as well as by the dislevelments of the runway is presented. Thus, the paper is focused on the dynamic models having different geometric, mass and elastic configurations representing the base for the transmitted vibration evaluation. In this context, the measures necessary to reduce vibrations transmitted to human body being inside the cabin of mobile construction equipment are pointed out.
A Novel Global Convergence Algorithm: Bee Collecting Pollen Algorithm
Authors: Xueyan Lu, Yongquan Zhou
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Inspired by the behavior of the honeybees' collecting pollen, Bee Collecting Pollen Algorithm (BCPA) is proposed in this paper. This is a novel global convergence searching algorithm. It simulates the behavior of the honeybees' collecting pollen and describes the swarm intelligent. The experiment for TSP shows that the improve algorithm is more efficient.
Heuristics-Based Strategies for Resolving Context Inconsistencies in Pervasive Computing Applications
Authors: Chang Xu, S. C. Cheung, W. K. Chan, Chunyang Ye
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Context-awareness allows pervasive applications to adapt to changeable computing environments. Contexts, the pieces of information that capture the characteristics of environments, are often error-prone and inconsistent due to noises. Various strategies have been proposed to enable automatic context inconsistency resolution. They are formulated on different assumptions that may not hold in practice. This causes applications to be less context-aware to different extents. In this paper, we investigate such impacts and propose our new resolution strategy. We conducted experiments to compare our work with major existing strategies. The results showed that our strategy is both effective in resolving context inconsistencies and promising in its support of applications using contexts.
Building Data-Intensive Grid Applications with Globus Toolkit --- An Evaluation Based on Web Crawling
Authors: Andreas Walter, Klemens Böhm, Stephan Schosser
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

Nowadays, there is a trend to create resource-consuming applications without building heavy computer centers, but to use resources on computer systems distributed over the internet. Grid middleware is a framework to access these resources. The concern of this paper is the evaluation of a specific grid middleware, namely Globus Toolkit, for data-intensive applications. As a test case, we have designed and implemented a service-based distributed web crawler on top of this middleware: A web crawler is a complex application consisting of many nodes. It imposes significantly higher demands on grid middleware regarding administrative flexibility compared to grid applications that allocate computing power of grid nodes. We have observed that some components of Globus Toolkit are flexible enough to provide the control functionality necessary for a web crawler, while others are not. For these other components, we propose possible extensions. Since we expect the combination of those characteristics to occur with many other grid applications as well, our study is of broader interest, beyond web crawling.
cAnt-Miner: An Ant Colony Classification Algorithm to Cope with Continuous Attributes
Authors: Fernando E. Otero, Alex A. Freitas, Colin G. Johnson
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

This paper presents an extension to Ant-Miner, named cAnt-Miner (Ant-Miner coping with continuous attributes), which incorporates an entropy-based discretization method in order to cope with continuous attributes during the rule construction process. By having the ability to create discrete intervals for continuous attributes "on-the-fly", cAnt-Miner does not requires a discretization method in a preprocessing step, as Ant-Miner requires. cAnt-Miner has been compared against Ant-Miner in eight public domain datasets with respect to predictive accuracy and simplicity of the discovered rules. Empirical results show that creating discrete intervals during the rule construction process facilitates the discovery of more accurate and significantly simpler classification rules.
A knowledge-based tool for multi-agent domain engineering
Authors: Rosario Girardi, Adriana Leite
Venue: Knowledge-Based Systems (2008)

Ontologies provide an unambiguous terminology that can be shared by all involved in a software development process. They can also be as generic as needed allowing its reuse and easy extension. These features turn ontologies useful for representing the knowledge of software engineering techniques and methodologies, and an appropriate abstraction mechanism for the specification of high-level reusable software artifacts like domain models, frameworks and software patterns. This work describes ONTOMADEM, a conceptualization of MADEM (''multi-agent domain engineering methodology''), a software development methodology for multi-agent domain Engineering. The ontology is used as a knowledge-based tool for capturing and representing the products of a multi-agent domain engineering process, created through the instantiation of its hierarchy of classes.
Denial of Sleeping: Performance Analysis and Counteracting Strategy
Authors: Vladimir Shakhov, Hyunseung Choo
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

Denial of Sleeping is a novel type of potential attacks in wireless network. The object of the attack is a sensor node's power supply. To make sensors inexpensive so that they can be economically deployed in large numbers, they generally have very limited battery capability. Thus, a lifetime of a sensor is degraded under Denial of Sleeping attack. In this paper a mathematical model for performance evaluation of the attack is offered. Counteracting against the intrusion is discussed.