ppxscal/embedding_network huggingface dataset:
Semantic metadata driven data analysis
Authors: Sharad Mehrotra
Venue:  (2007)

With the growing availability of diverse and complex data to a wide range of users through the Web, two major information access challenges are becoming increasingly important. The first one is enabling powerful querying, exploratory and analytical operations on unstructured or minimally structured (extracted) data beyond keyword search. The second one is enabling flexible and navigational operations on structured data containing complex relationships. This thesis explores and demonstrates the role semantic metadata plays in addressing both of these challenges. First we consider the problem of developing analytical operators for unstructured data such as text and other media collections. Advances in information extraction and metadata annotation techniques are making it possible to automatically annotate such data with various kinds of taxonomies. Presently, these taxonomies are used just for navigation. We develop several, well-founded analytical operators and algorithms that exploit such taxonomies for novel data summarization and comparative analysis. We then consider the problem of exploring structured datasets that include complex semantic relationships. Presently, the use of semantic metadata to explore structured data is limited to OLAP dimension hierarchies which require a well-crafted data representation. We leverage the approach of multi-faceted (dynamic) navigation used for document collections to develop novel techniques and algorithms for exploration of data that contains complex semantic relationships. We then turn to the problem of efficient query processing on minimally structured data where semantic metadata is uniformly represented along with the data as a semantic graph. We specifically focus on the efficient execution of exact and inexact graph pattern queries on such data. For exact match queries, we develop a complete query algebra that addresses open problems with regard to efficient graph extraction, grouping and aggregation. For inexact match queries, we develop a ranking algorithm that systematically combines both partial structural matches and semantic similarities in order to return semantically-ranked results.
On the Optimal Robot Routing Problem in Wireless Sensor Networks
Authors: Bo Yuan, Maria Orlowska, Shazia Sadiq
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Given a set of sparsely distributed sensors in the Euclidean plane, a mobile robot is required to visit all sensors to download the data and finally return to its base. The effective range of each sensor is specified by a disk and the robot must at least reach the boundary to start communication. The primary goal of optimization in this scenario is to minimize the traveling distance by the robot. This problem can be regarded as a special case of the Traveling Salesman Problem with Neighborhoods (TSPN), which is known to be NP-hard. In this paper, we present a novel TSPN algorithm for this class of TSPN, which can yield significantly improved results compared to the latest approximation algorithm.
Byte-Wise CRC Calculations
Authors: Aram Perez
Venue: IEEE Micro (1983)

A cyclic redundancy code can be calculated on bytes instead of bits. One byte-oriented method reduces calculation time by a factor of almost four.
Spoken Versus Typed Human and Computer Dialogue Tutoring
Authors: Diane J. Litman, Carolyn P. Rosé, Kate Forbes-Riley, Kurt Vanlehn, Dumisizwe Bhembe, Scott Silliman
Venue: International Journal of Artificial Intelligence in Education (2006)

While human tutors typically interact with students using spoken dialogue, most computer dialogue tutors are text-based. We have conducted two experiments comparing typed and spoken tutoring dialogues, one in a human-human scenario, and another in a human-computer scenario. In both experiments, we compared spoken versus typed tutoring for learning gains and time on task, and also measured the correlations of learning gains with dialogue features. Our main results are that changing the modality from text to speech caused changes in the learning gains, time and superficial dialogue characteristics of human tutoring, but for computer tutoring it made less difference.
A User Interface Transmission System for Public Robots
Authors: Jihwan Park, Taehoun Song, Soonmook Jung, Keyho Kwon, Jaewook Jeon
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

This paper discusses the development of a control system for public robots. When a user requests a user interface for a public robot, the public robot sends this robot's user interface to the user's PDA, and then the robot can be efficiently controlled from this user interface on the PDA. This control system is highly efficient because one high performance robot can serve many users. This paper's purpose is not to present another method for one person to control one robot. Instead, when the user needs any service, the user connects to a p2p server and requests the service, and then the robot server will connect the user to the robot that supports the service.
Exact sequences for the homology of the matching complex
Authors: Jakob Jonsson
Venue: Journal of Combinatorial Theory Series A (2008)

Building on work by Bouc and by Shareshian and Wachs, we provide a toolbox of long exact sequences for the reduced simplicial homology of the matching complex M"n, which is the simplicial complex of matchings in the complete graph K"n. Combining these sequences in different ways, we prove several results about the 3-torsion part of the homology of M"n. First, we demonstrate that there is nonvanishing 3-torsion in H@?"d(M"n;Z) whenever @n"n=2. Second, we prove that H@?"d(M"n;Z) is a nontrivial 3-group whenever @n"n==0, we show that there is a polynomial f"k(r) of degree 3k such that the dimension of H@?"k"-"1"+"r(M"2"k"+"1"+"3"r;Z"3), viewed as a vector space over Z"3, is at most f"k(r) for all r>=k+2.
Metamodel Syntactic Sheets: An Approach for Defining Textual Concrete Syntaxes
Authors: Javier Espinazo-Pagán, Marcos Menárguez, Jesús García-Molina
Venue: Proceedings of the 4th European conference on Model Driven Architecture: Foundations and Applications (2008)

The development process of Domain Specific Languages (DSL) can be tackled from different technical spaces such as XML, Grammarware or Model Driven Engineering (MDE). In the case of using MDE, the definition of a concrete syntax for a textual DSL requires commonly building a bridge between this technical space and Grammarware. Several bridging approaches have been recently proposed in which the existing coupling between concrete and abstract syntaxes causes information duplication in the development process of DSLs. Moreover, reusability of concrete syntaxes has received no attention in these approaches.In this paper we present the MSS (Metamodel Syntactic Sheets) approach for defining textual concrete syntaxes. MSS is intended to promote the reuse of textual concrete syntaxes and to avoid information duplication. In MSS, metamodels are annotated with syntactic properties and a propagation mechanism reduces the number of annotations required as well as the coupling between concrete and abstract syntaxes. Textual concrete syntaxes can be reused by annotating syntactically the metamodeling language. This reuse makes possible to share syntactic idioms (textual conventions) among different DSLs.
The RETMA support of the 1950 computer conference: a progress report
Authors: Thomas H. Briggs
Venue: Papers and discussions presented at the Dec. 8-10, 1953, eastern joint AIEE-IRE computer conference: information processing systems---reliability and requirements (1953)

In attending the numerous technical conventions and symposia that are held each year, we listen to many learned papers. Problems important to our daily work are thoroughly discussed. Generally we return home with ideas that will forward our own engineering investigations. But we often find the problems discussed are larger than the individual or organization can handle. With mounting technical complexity, these problems are more frequently encountered.
Epilogue
Venue: IEEE Annals of the History of Computing (1983)

The editor comments on the SAGE legacy, and its influence on subsequent generations of digital computers and digital computing in general. 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
Simulating Dynamic Speech Behaviour for Virtual Agents in Emotional Situations
Authors: Artemy Kotov
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

In this article we demonstrate the application of a linguistic model of d/r-scripts to simulate the speech behaviour of artificial agents in virtual emotional situations. We apply the model to animate speech behaviour of a virtual agent for a term of about 10-30 seconds. This behaviour can be controlled by short emotional states, expressed in communication - microstates. 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
Minimizing makespan for multi-spindle head machines with a mobile table
Authors: Olga Guschinskaya, Alexandre Dolgui, Nikolai Guschinsky, Genrikh Levin
Venue: Computers and Operations Research (2009)

This paper presents a novel application of operational research techniques in Manufacturing. This concerns scheduling of multi-spindle head machines with a mobile table to minimize the makespan. We show that this problem can be formulated as scheduling for a single max-batch processing machine with inclusion, exclusion and precedence constraints between jobs. What makes this study unique from others in literature is that the batch processing time can exceed that of the longest job in the batch. The job compatibility and the batch time depend on the batch content, i.e. which jobs constitute the batch. This problem is transformed into finding the constrained shortest path in a specially constructed digraph. Dominance properties are developed to decrease the digraph's size. An industrial example is presented to illustrate the effectiveness of the proposed techniques.
Brief Announcement: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots
Authors: Roberto Baldoni, François Bonnet, Alessia Milani, Michel Raynal
Venue: Proceedings of the 22nd international symposium on Distributed Computing (2008)

Graph exploration by robots. The graph exploration problem consists in making one or several mobile entities visit each vertex of a connected graph. The mobile entities are sometimes called agents or robots (in the following we use the word "robot"). The exploration is perpetual if the robots have to revisit forever each vertex of the graph. Perpetual exploration is required when robots have to move to gather continuously evolving information or to look for dynamic resources (resources whose location changes with time). If nodes and edges have unique labels, the exploration is relatively easy to achieve.
Modeling Incompressible Fluids by Means of the SPH Method: Surface Tension and Viscosity
Authors: Pawe Wróblewski, Krzysztof Boryczko, Mariusz Kope
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

The adaptations of the SPH method for simulating incompressible fluids which focuse on two features: the surface tension and artificial viscosity, are presented in this article. The background and principles of the SPH method are explained and its application to incompressible fluids simulations is discussed. The methodology and implementation of artificial viscosity in the SPH method are presented. The modification for surface tension simulation, which relies on incorporating additional forces into the model, as well as the methodology are suggested. Also, the new equations for artificial viscosity are presented, which are able to simulate a flow of non-newtonian fluids. The results obtained with the method are presented and discussed.
Expressive Face Animation Synthesis Based on Dynamic Mapping Method
Authors: Panrong Yin, Liyue Zhao, Lixing Huang, Jianhua Tao
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

In the paper, we present a framework of speech driven face animation system with expressions. It systematically addresses audio-visual data acquisition, expressive trajectory analysis and audio-visual mapping. Based on this framework, we learn the correlation between neutral facial deformation and expressive facial deformation with Gaussian Mixture Model (GMM). A hierarchical structure is proposed to map the acoustic parameters to lip FAPs. Then the synthesized neutral FAP streams will be extended with expressive variations according to the prosody of the input speech. The quantitative evaluation of the experimental result is encouraging and the synthesized face shows a realistic quality.
Detection of Gene Expressions in Microarrays by Applying Iteratively Elastic Neural Net
Authors: Máx Chacón, Marcos Lévano, Héctor Allende, Hans Nowak
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

DNA analysis by microarrays is a powerful tool that allows replication of the RNA of hundreds of thousands of genes at the same time, generating a large amount of data in multidimensional space that must be analyzed using informatics tools. Various clustering techniques have been applied to analyze the microarrays, but they do not offer a systematic form of analysis. This paper proposes the use of Gorban's Elastic Neural Net in an iterative way to find patterns of expressed genes. The new method proposed (Iterative Elastic Neural Net, IENN) has been evaluated with up-regulated genes of the Escherichia Coli bacterium and is compared with the Self-Organizing Maps (SOM) technique frequently used in this kind of analysis. The results show that the proposed method finds 86.7% of the up-regulated genes, compared to 65.2% of genes found by the SOM. A comparative analysis of Receiver Operating Characteristic (ROC) with SOM shows that the proposed method is 11.5% more effective.
Ad Hoc Distributed Simulation of Surface Transportation Systems
Authors: R. M. Fujimoto, R. Guensler, M. Hunter, K. Schwan, H. -K. Kim, B. Seshasayee, J. Sirichoke, W. Suh
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Current research in applying the Dynamic Data Driven Application Systems (DDDAS) concept to monitor and manage surface transportation systems in day-to-day and emergency scenarios is described. This work is focused in four, tightly coupled areas. First, a novel approach to predicting future system states termed ad hoc distributed simulations has been developed and is under investigation. Second, on-line simulation models that can incorporate real-time data and perform rollback operations for optimistic ad hoc distributed simulations are being developed and configured with data corresponding to the Atlanta metropolitan area. Third, research in the analysis of real-time data is being used to define approaches for transportation system data collection that can drive distributed on-line simulations. Finally, research in data dissemination approaches is examining effective means to distribute information in mobile distributed systems to support the ad hoc distributed simulation concept.
Knowing What the Peer Knows: The Differential Effect of Knowledge Awareness on Collaborative Learning Performance of Asymmetric Pairs
Authors: Mirweis Sangin, Gaëlle Molinari, Marc-Antoine Nüssli, Pierre Dillenbourg
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

In an empirical study, we provided (or not) pairs of students working in a remote collaborative learning situation with a knowledge awareness tool that provided learner A with learner B's level of knowledge measured through a pre-test. We analyzed the effect of the knowledge awareness tool on asymmetric pairs with regards to the prior-knowledge. Post-hoc analysis on the pairs' knowledge level showed that the knowledge awareness tool mainly affects the learning performances of asymmetric pairs. Further analysis on the learners' level showed that the knowledge awareness tool mainly affects the collaborative learning gain of the more-knowledgeable peers of asymmetric pairs. The results are discussed in light of socio-cognitive processes such as audience design and perspective taking.
An Architecture and Framework for Agent-Based Web Applications
Authors: Alexander Pokahr, Lars Braubach
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

The construction of web applications is a complex task as different kinds of technologies need to be integrated. To ease the task of developing web applications many different web frameworks have been conceived. These frameworks aim at providing support for recurring and tedious development tasks and address complexity by separating the basic concerns of applications. Most of the currently available web frameworks adhere to the widely accepted Model 2 design pattern that targets a clean separation of model, view and controller parts of an application in the sense of the model view controller (MVC) pattern. In this paper it is shown how the basic Model 2 archiecture can be adapted for enabling its usage in combination with business logic realized with agent technology. Besides the architecture itself additionally its realization within the Jadex Webbridge framework is sketched.
Cryptanalysis of Nonrepudiable Threshold Proxy Signature Schemes with Known Signers
Authors: Shin-Jia Hwang, Chiu-Chin Chen
Venue: Informatica (2003)

Sun's nonrepudiation threshold proxy signature scheme is not secure against the collusion attack. In order to guard against the attack, Hwang et al. proposed another threshold proxy signature scheme. However, a new attack is proposed to work on both Hwang et al.'s and Sun's schemes. By executing this attack, one proxy signer and the original signer can forge any valid proxy signature. Therefore, both Hwang et al.'s scheme and Sun's scheme were insecure.
Discrete Duality and Its Applications to Reasoning with Incomplete Information
Authors: Ewa Orłowska, Ingrid Rewitzky
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

We present general principles of establishing a duality between a class of algebras and a class of relational systems such that topology is not involved. We show how such a discrete duality contributes to proving completeness of logical systems and to correspondence theory. Next, we outline applications of discrete dualities to analysis of data in information systems with incomplete information in the rough set-style, and in contexts of formal concept analysis.
Distributed Access Control For XML Document Centric Collaborations
Authors: Mohammad Ashiqur Rahaman, Yves Roudier, Andreas Schaad
Venue: Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference (2008)

This paper introduces a distributed and fine grained access control mechanism based on encryption for XML document centric collaborative applications. This mechanism also makes it possible to simultaneously protect the confidentiality of a document and to verify its authenticity and integrity, as well to trace its updates. The enforcement of access control is distributed to participants and does not rely on a central authority. Novel aspects of the proposed framework include the adoption of a decentralized key management scheme to support the client-based enforcement of the access control policy.This scheme is driven by the expression of access patterns of interest of the participants over document parts to determine the keys required. A lazy rekeying protocol is also defined to accommodate the delegation of access control decisions that in particular reduces rekeying latency when faced with the addition and removal of participants.
Content-based analysis, streaming, and retrieval of instructional videos
Authors: Tiecheng Liu
Venue:  (2007)

With the advance of video capturing devices, storage technologies, and the emergence of internet, E-learning is becoming an increasingly important form of education. However, the instructional videos that record the teaching content and activities in classrooms are not being fully exploited. As the instructional videos are captured under circumstances far from the professional scripting and editing rules, existing approaches on video analysis, streaming, and retrieval are not applicable to this video domain. In this thesis, we develop methods and systems to make instructional videos more accessible and more helpful. In-depth research has been conducted on the following three topics: (a) content extraction and summarization of visual content in instructional videos; (b) content-adaptive streaming of instructional videos over wireless networks; (c) content-based searching and retrieval of instructional videos. We first develop a robust algorithm to extract the content from chalkboard videos frames. This algorithm addresses the image noise, non-uniformity of the board regions, camera movements, occlusions, and other challenges in the instructional videos that re recorded in real classrooms. Then, using the extracted text and figures es as the middle level features, we develop algorithms to retrieve a set of key frames that contain most of the content in an instructional video. We develop a system framework for content-adaptive streaming of instructional videos over wireless networks. We first develop real-time content analysis and dynamic compression methods to adjust instructional video quality without the need of offline transcoding. Then, we provide an adaptive video transmission scheme which provides scalable video streams based on network conditions, instructional video content, and the preferences of clients. Assuming that the visual content in the instructional videos can be detected and recognized, we develop a content-based retrieval model that measures the semantic relevance between a query and an instructional video. For relevance feedback purposes, we propose a partial ordering of the retrieved items by the user. We further develop algorithms that optimize the system parameters in response to user's partial order feedback.
Automating Interactive Protocol Verification
Authors: Lassaad Cheikhrouhou, Andreas Nonnengart, Werner Stephan, Frank Koob, Georg Rock
Venue: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence (2008)

Showing the absence of security hazards in cryptographic protocols is of major interest in the area of protocol security analysis. Standard model checking techniques - despite their advantages of being both fast and automatic - serve as mere debuggers that allow the user at best to detect security risks if they exist at all. In general they are not able to guarantee that all such potential hazards can be found, though. A full verification usually involves induction and therefore can hardly be fully automatic. Therefore the definition and application of suitable heuristics has turned out to become a central necessity. This paper describes how we attack this problem with the help of the Verification Support Environment (VSE) and how we nevertheless arrive at a high degree of automation.