ppxscal/embedding_network huggingface dataset:
ns-2 vs. OPNET: a comparative study of the IEEE 802.11e technology on MANET environments
Authors: P. Pablo Garrido, Manuel P. Malumbres, Carlos T. Calafate
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

In this work we present the results of a comparative study between two well-known network simulators: ns-2 and OP-NET Modeler. In particular, we focus on a performance evaluation of the IEEE 802.11e technology on Mobile Ad-hoc Networks (MANETs) in both stationary and mobile scenarios. The paper describes the tested scenarios in detail, and discusses simulation results obtained with OPNET Modeler, comparing them with those obtained with ns-2. The performance of IEEE 802.11e in the presence of legacy IEEE 802.11 stations is also analyzed. Due to the significant differences between both simulators, we enumerate those changes required so as to make results obtained via both simulators comparable. The results that have been reached support the conclusion that the behavior of both simulators is quite similar in general.
Free tree-featured graph indexing and query processing
Authors: Jeffrey Xu Yu
Venue:  (2007)

Scalable structural pattern mining and graph database management tools become increasingly crucial to applications with complex data in domains ranging from software engineering to computational biology. Due to their high complexity, it is often difficult, if not impossible, for human beings to manually analyze any reasonably large collection of graphs. In this dissertation, we investigate two fundamental problems in large scale graph databases: Given a graph database what are the hidden free tree patterns and how can we find them? And how can we index graphs based on free tree patterns and perform similarity search in large graph databases? In this dissertation, we develop frequent free tree mining systems, F3TM and CFFTree, to systematically discover the complete set of (closed) frequent free trees from a graph database. Graph indexing, another problem addressed in this dissertation, is of special interest both in academia and in industrial applications. The solutions, (Tree+&Delta; ) and SimTree, propose a free tree featured index, which is built on frequent free tree patterns discovered through a structural mining process. This mining-based indexing methodology leads to the development of a compact but effective graph index structure that is orders of magnitude smaller in size but an order of magnitude faster in performance than traditional approaches. The developed concepts, theories, and systems hence increase our understanding of data mining principles in structural pattern discovery, interpretation and search. The formulation of a general free tree featured graph information system through this study could provide fundamental supports to graph-intensive applications.
Music Cognition: Learning, Perception, Expectations
Authors: Barbara Tillmann
Venue: Computer Music Modeling and Retrieval. Sense of Sounds: 4th International Symposium, CMMR 2007, Copenhagen, Denmark, August 27-31, 2007. Revised Papers (2008)

Research in music cognition domain has shown that non musician listeners have implicit knowledge about the Western tonal musical system. This knowledge, acquired by mere exposure to music in everyday life, influences perception of musical structures and allows developing expectations for future incoming events. Musical expectations play a role for musical expressivity and influence event processing: Expected events are processed faster and more accurately than less-expected events and this influence extends to the processing of simultaneously presented visual information. Studying implicit learning of auditory material in the laboratory allows us to further understand this cognitive capacity (i.e., at the origin of tonal acculturation) and its potential application to the learning of new musical systems and new musical expectations. In addition to behavioral studies on cognitive processes in and around music perception, computational models allow simulating learning, representation and perception of music for non musician listeners. 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
Co-allocation with Communication Considerations in Multi-cluster Systems
Authors: John Ngubiri, Mario Vliet
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Processor co-allocation can be of performance benefit. This is because breaking jobs into components reduces overall cluster fragmentation. However, the slower inter-cluster communication links increase job execution times. This leads to performance deterioration which can make co-allocation unviable. We use intra-cluster to inter-cluster communication speed ratio and job communication intensity to model the job execution time penalty due to co-allocation. We then study viability of co-allocation in selected job and system based instances. We also study performance variation with selected job stream parameters. We observe that co-allocation is viable so long as the execution time penalty caused is relatively low. We also observe that the negative performance effect due to co-allocation is felt by the entire job stream rather than only the (few) co-allocated jobs. Finally, we observe that for every value of communication time penalty, there is a job size s *, where if all jobs whose size is greater than s * are co-allocated, we get the best performance.
Structure analysis and property improvements of the computer-simulated fullerene-based ultralow-k dielectrics
Authors: K. Zagorodniy, H. Hermann, M. Taut, G. Seifert, E. Zschech
Venue: Microelectronic Engineering (2008)

We have recently proposed new ultralow-k dielectric materials using a theoretical approach called molecular design. This approach requires the application of complementary theoretical methods to describe the complex problems. The methods include classical, continuum theoretical, and quantum-chemical approximations. The advantage of the present approach is that various possible candidates for ultralow-k dielectrics can be tested theoretically without performing expensive and time-consuming experiments. In this study, we analyze the way to connect linker molecules to the node molecules, in order to improve mechanical and dielectric properties of generated ultralow-k structures. Two different types of bonding linker molecules to the cage C"6"0 molecule with the >C?CC?CH"2?CH"2?C
The Algebraic Counterpart of the Wagner Hierarchy
Authors: Jérémie Cabessa, Jacques Duparc
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

The algebraic study of formal languages shows that ¿-rational languages are exactly the sets recognizable by finite ¿-semigroups. Within this framework, we provide a construction of the algebraic counterpart of the Wagner hierarchy. We adopt a hierarchical game approach, by translating the Wadge theory from the ¿-rational language to the ¿-semigroup context.More precisely, we first define a reduction relation on finite pointed ¿-semigroups by means of a Wadge-like infinite two-player game. The collection of these algebraic structures ordered by this reduction is then proven to be isomorphic to the Wagner hierarchy, namely a decidable and well-founded partial ordering of width 2 and height ¿ ¿ .
An Object Model Based Repository for Biological Pathways Using XML Database Technology
Authors: Keyuan Jiang
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

With the availability of a growing collection of biological pathway datasets, there is an increasing need for an efficient repository with the powerful search capability to facility large scaled analyses of biological pathway. A novel data store was designed based upon the BioPAX object models, and implemented with the emerging XML database technology. Our approach significantly reduces the system complexity while maintaining powerful search functionalities.
Incorporating user utility into sponsored-search auctions
Authors: Yagil Engel, David Maxwell Chickering
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

We study principled methods for incorporating user utility into the selection of sponsored search ads. We describe variations of the GSP allocation/pricing mechanism that accommodate these user utility functions, we provide interesting and useful parallels of some of the theoretical properties from the traditional GSP mechanisms in the new GSP variations, and we present simulation results that exemplify the use of the ranking system.
Correlating Text and Images: Concept and Evaluation
Authors: Timo Götzelmann, Pere-Pau Vázquez, Knut Hartmann, Andreas Nürnberger, Thomas Strothotte
Venue: Proceedings of the 8th international symposium on Smart Graphics (2007)

This paper presents the concept and an evaluation of a novel approach to support students to understand complex spatial relations and to learn unknown terms of a domain-specific terminology with coordinated textual descriptions and illustrations. Our approach transforms user interactions into queries to an information retrieval system. By selecting text segments or by adjusting the view to interesting domain objects, learners can request additional contextual information. Therefore, the system uses pre-computed multi-level representations of the content of explanatory text and of views on 3D models to suggest textual descriptions or views on 3D objects that might support the current learning task.Our experimental application is evaluated by a user study that analyzes (i) similarity measures that are used by the information retrieval system to coordinate the content of descriptive texts and computer-generated illustrations and (ii) the impact of the individual components of these measures. Our study revealed that the retrieved results match the preferences of the users. Furthermore, the statistical analysis suggests a rough value to cut-off retrieval results according to their relevancy.
Automatic Classification of Expressiveness in Speech: A Multi-corpus Study
Authors: Mohammad Shami, Werner Verhelst
Venue: Speaker Classification II: Selected Projects (2007)

We present a study on the automatic classification of expressiveness in speech using four databases that belong to two distinct groups: the first group of two databases contains adult speech directed to infants, while the second group contains adult speech directed to adults. We performed experiments with two approaches for feature extraction, the approach developed for Sony's robotic dog AIBO (AIBO) and a segment based approach (SBA), and three machine learning algorithms for training the classifiers. In mono corpus experiments, the classifiers were trained and tested on each database individually. The results show that AIBO and SBA are competitive on the four databases considered, although the AIBO approach works better with long utterances whereas the SBA seems to be better suited for classification of short utterances. When training was performed on one database and testing on another database of the same group, little generalization across the databases happened because emotions with the same label occupy different regions of the feature space for the different databases. Fortunately, when the databases are merged, classification results are comparable to within-database experiments, indicating that the existing approaches for the classification of emotions in speech are efficient enough to handle larger amounts of training data without any reduction in classification accuracy, which should lead to classifiers that are more robust to varying styles of expressiveness in speech.
To Undeaf Their Ears: The Spoken Word in a Multimedia World
Authors: Jerry Goldman
Venue: IEEE MultiMedia (2003)

The ability to store and retrieve sound marked a milestone for civilization. To be sure, texts and scores are storage devices, but they provide only the bare elements of the sounds we hear. Audio recordings (wax cylinders, reel to reel, cassettes, minidiscs, CDs) preserve our cultural heritage in the form it was created the sounds themselves—whether the source is voice, instrument, or ambient sound. It's hardly worth observing that ready access to recordings has transformed the musical experience as well as the musical tradition. As the medium by which we capture sound evolves, so have the methods of distribution. It's difficult to adequately capture in a metaphor the effects of music file sharing over peer-to-peer networks. Yet for all the power contained in the listening experience and shared by tens of millions of music lovers, we haven't yet made full use of spoken word resources nor shared them widely. What we are missing is a culture that recognizes the superiority of the spoken word in contrast to its next of kin: the transcript.
R-CAST-MED: Applying Intelligent Agents to Support Emergency Medical Decision-Making Teams
Authors: Shizhuo Zhu, Joanna Abraham, Sharoda A. Paul, Madhu Reddy, John Yen, Mark Pfaff, Christopher Deflitch
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

Decision-making is a crucial aspect of emergency response during mass casualty incidents (MCIs). MCIs require rapid decisions to be taken by geographically-dispersed teams in an environment characterized by insufficient information, ineffective collaboration and inadequate resources. Despite the increasing adoption of decision support systems in healthcare, there is limited evidence of their value in large-scale disasters. We conducted focus groups with emergency medical services and emergency department personnel who revealed that one of the main challenges in emergency response during MCIs is information management. Therefore, to alleviate the issues arising from ineffective information management, we propose R-CAST-MED, an intelligent agent architecture built on Recognition-Primed Decision-making (RPD) and Shared Mental Models (SMMs). A simulation of R-CAST-MED showed that this tool enabled efficient information management by identifying relevant information, inferring missing information and sharing information with other agents, which led to effective collaboration and coordination of tasks across teams.
Efficient Traitor Tracing from Collusion Secure Codes
Authors: Olivier Billet, Duong Hieu Phan
Venue: Proceedings of the 3rd international conference on Information Theoretic Security (2008)

In this paper, we describe a new traitor tracing scheme which relies on Tardos' collusion secure codes to achieve constant size ciphertexts. Our scheme is also equipped with a black-box tracing procedure against pirates that are allowed to decrypt with some (possibly high) error rate while keeping the decoders of the lowest possible size when using collusion secure codes, namely of size proportional to the length of Tardos' code.
Semantic Representation and Querying of caBIG Data Services
Authors: E. Patrick Shironoshita, Ray M. Bradley, Yves R. Jean-Mary, Thomas J. Taylor, Michael T. Ryan, Mansur R. Kabuka
Venue: Proceedings of the 5th international workshop on Data Integration in the Life Sciences (2008)

A computational grid infrastructure for biomedical research, called caGrid, is under development by the National Cancer Institute (NCI) as part of the cancer Biomedical Informatics Grid (caBIG) Initiative. In this paper we present a model that enables users to query an integrated view of caBIG data services at a conceptual semantic level. The model is based on semCDI, a formulation to generate an ontology view of caBIG semantics and pose queries against this view using the SPARQL query language complemented with Horn rules. We present here a mechanism to process these queries algebraically using our semQA query algebra extension for SPARQL, in order to create sub-expressions for each data service. We then show how resulting graphs from these sub-expressions are then merged using Horn rules.
A Hybrid Region Weighting Approach for Relevance Feedback in Region-Based Image Search on the Web
Authors: Deok-Hwan Kim, Jae-Won Song, Ju-Hong Lee
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

In this paper, a new hybrid weighting method, which learns region importance from the region size and the spatial location of regions in an image, is introduced to re-weight regions optimally and improve the performance of the region-based search system on the Web. Relevant images marked by an user may exhibit very different visual characteristics so that they may be scattered in several clusters in the feature space, since there exists the semantic gap between the low level feature and the high level semantics in user's mind. Our main goal is to find semantically related clusters and their weights to narrow down this semantic gap. To do this, The hybrid region weighting method, which refines the weights of region-clusters through relevance feedback, determines the importance of regions according to the region size and spatial location information of regions in an image. Experimental results demonstrate the efficiency and the effectiveness of the proposed weighting method in comparison with the area percentage method and the region frequency weighted by inverse image frequency method, respectively.
Simultaneous Calculation of DFT and IDFT of Real Two-Dimensional Sequences and Its Application in Digital Image Watermark
Authors: Andong Fan, Qi Sun
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

This paper firstly discusses some properties of two-dimensional discrete Fourier transform (DFT), and then by exploiting a single two-dimensional DFT, several new direct formulas of simultaneous calculation of the DFT of a real two-dimensional sequence and the inverse DFT (IDFT) of the DFT-transformed real two-dimensional sequence are proposed. Furthermore, this paper applied the new formulas to digital image watermark embedding algorithm, and got a very good experimental result.
Reconfiguring Circuits Around Defects in Self-Timed Cellular Automata
Authors: Tadashi Kunieda, Teijiro Isokawa, Ferdinand Peper, Ayumu Saitoh, Naotake Kamiura, Nobuyuki Matsui
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

For the realization of nanocomputers it will be important to have built-in defect-tolerance, which is the ability to overcome the unreliability caused by defective components. This paper explores defect-tolerance for nanocomputers based on Self-Timed Cellular Automata--an asynchronously timed CA of which the functionality can be expressed through a small number of transition rules. The proposed method assumes that defects are coped with in an initial phase by detecting and isolating them in cellular space from non-defective cells. The phase after this--the main topic of this paper--includes a scheme to efficiently lay out circuits on the cellular space in areas that are not affected by defects. The scheme is self-contained, i.e., it is carried out through the transition rules defined for the CA and does not require external circuitry.
Bridging the Gap between ITS and eLearning: Towards Learning Knowledge Objects
Authors: Amal Zouaq, Roger Nkambou, Claude Frasson
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

This paper presents an ontology-based approach for the dynamic generation of learning knowledge objects (LKO). These objects have the particularity of implementing AIED techniques and they exhibit characteristics hitherto reserved for intelligent tutoring systems (ITS): they are knowledge-based, adapted to a learner model and they are composed dynamically according to a learning need and a particular instructional theory. Additionally, the paper tackles the issue of using eLearning resources by ITS and shows how this could be realized. Finally, the paper also demonstrates how LKOs are deployed and evaluates briefly the results of the proposed approach.
Minimum-Size Bases of Association Rules
Authors: José L. Balcázar
Venue: Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I (2008)

We focus on confidence-bounded association rules; we model a rather practical situation in which the confidence threshold is fixed by the user, as usually happens in applications. Within this model, we study notions of redundancy among association rules from a fundamental perspective: we discuss several existing alternative definitions and provide new characterizations and relationships between them. We show that these alternatives correspond actually to just two variants, which differ in the special treatment of full-confidence implications. For each of these two notions of redundancy, we show how to construct complete bases of absolutely minimum size.
Pro SQL Server 2008 Relational Database Design and Implementation
Authors: Louis Davidson, Kevin Kline, Scott Klein, Kurt Windisch
Venue: Pro (2008)

Learn effective and scalable database design techniques in a SQL Server environment. Pro SQL Server 2008 Relational Database Design and Implementation covers everything from design logic that business users will understand all the way to the physical implementation of the design in a SQL Server database. Grounded in best practices and a solid understanding of the underlying theory, authors Louis Davidson, Kevin Kline, Scott Klein, and Kurt Windisch show how to get it right in SQL Server database design and lay a solid groundwork for the future use of valuable business data. Solid foundation in best practices and relational theory Maximize SQL Server features to enhance security, performance, scalability Thorough treatment from conceptual design to an effective, physical implementation What youll learn Develop conceptual models of client data using interviews and client documentation. Normalize data models to enhance scalability and the long term use of valuable data. Translate conceptual models into highperforming SQL Server databases. Secure and protect the integrity of data as part of meeting regulatory requirements. Take full advantage of new SQL Server features such as the spatial datatype, XML support, transparent data encryption, and more. Create effective indexing to speed query performance. Who is this book for? Pro SQL Server 2008 Relational Database Design and Implementation is designed for programmers of all types who want to use SQL Server 2008 to store data. Rookie database programmers will find a complete course on the fundamentals of database design that includes conceptual designs and physical implementation. Seasoned veterans will find many tips and tricks for implementing database systems that will be well worth the time invested in reading this book. About the Apress Pro Series The Apress Pro series books are practical, professional tutorials to keep you on and moving up the professional ladder. You have gotten the job, now you need to hone your skills in these tough competitive times. The Apress Pro series expands your skills and expertise in exactly the areas you need. Master the content of a Pro book, and you will always be able to get the job done in a professional development project. Written by experts in their field, Pro series books from Apress give you the hardwon solutions to problems you will face in your professional programming career.