ppxscal/embedding_network huggingface dataset:
Edge disjoint Hamilton cycles in graphs
Authors: Guojun Li
Venue: Journal of Graph Theory (2000)

Let G be a graph of order n and k&ge; 0 an integer. It is conjectured in [8] that if for any two vertices u and v of a 2(k + 1)-connected graph G,d G (u,v) = 2 implies that max{d(u;G), d(v;G)}&ge; (n-2) + 2k, then G has k + 1 edge disjoint Hamilton cycles. This conjecture is true for k = 0, 1 (see cf. [3] and [8]). It will be proved in this paper that the conjecture is true for every integer k&ge;0. &copy; 2000 John Wiley Sons, Inc. J Graph Theory 35: 820, 2000
Optimization of a thin film deposition process using a dynamic model extracted from molecular simulations
Authors: Cihan Oguz, Martha A. Gallivan
Venue: Automatica (Journal of IFAC) (2008)

This study presents and demonstrates an algorithm for computing a dynamic model for a thin film deposition process. The proposed algorithm is used on high dimensional Kinetic Monte Carlo (KMC) simulations and consists of applying principal component analysis (PCA) for reducing the state dimension, a self organizing map (SOM) for grouping similar surface configurations and simple cell mapping (SCM) for identifying the transitions between different surface configuration groups. The error associated with this model reduction approach is characterized by running more than 1000 test simulations with highly dynamic and random input profiles. The global error, which is the normalized Euclidean distance between the simulated and predicted states, is found to be less than 1% on average relative to the test simulation results. This indicates that our reduced order dynamic model, which was developed using a rather small simulation set, was able to accurately predict the evolution of the film microstructure for much larger simulation sets and a wide range of process conditions. Minimization of the deposition time to reach a desired film structure has also been achieved using this model. Hence, our study showed that the proposed algorithm is useful for extracting dynamic models from high dimensional and noisy molecular simulation data.
A Learning Content Adaptation Tool with Templates for Different Handhelds
Authors: Hsuan-Pu Chang, Jason C. Hung, Chun-Chia Wang, Meng-Ting Weng, Timothy K. Shih, Chen-Yu Lee
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

A large number of excellent digital learning materials have been created and distributed for e-learning. These contents are mostly designed for reading on regular PCs that have big screens, powerful computing, large storage and wide bandwidth compared to handheld devices. Therefore, a lot of studies about automatic content adaptation have been done and are proposed to overcome the drawbacks of browsing regular content with handheld devices such as pocket PCs and smartphones. But we argue that the total automatic adaptation algorithm designed by an engineer to transform Web Page presentation is still appropriate to be applied on educational content. We believe the quality of the result can not be assured and supervised by educators, and educational essence may be damaged during the real time adaptation process. This paper proposes a content adaptation tool that provides different adaptation templates to help the author automatically and efficiently reproduce high-quality learning content for specific handhelds. Furthermore, the author will not only be able to preview the adaptation result before publishing the course but also be able to adjust the template parameters manually to affect the process if they are not satisfied with the current result.
Reducibility and completeness in multi-party private computations
Authors: E. Kushilevitz
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We define the notions of reducibility and completeness in multi-party private computations. Let g be an n-argument function. We say that a function f is reducible to g if n honest-but-curious players can compute the function f n-privately, given a black-box for g (for which they secretly give inputs and get the result of operating g on these inputs). We say that g is complete (for multi-party private computations) if every function f is reducible to g. In this paper, we characterize the complete Boolean functions: we show that a Boolean function g is complete if and only if g itself cannot be computed n-privately (when there is no black-box available). Namely, for Boolean functions, the notions of completeness and n-privacy are complementary. This characterization gives a huge collection of complete functions (any non-private Boolean function!) compared to very few examples given (implicitly) in previous work. On the other hand, for non-Boolean functions, we show that these two notions are not complementary. Our results can be viewed as a generalization (for multi-party protocols and for (n/spl ges/2)-argument functions) of the two-party case, where it was known that Oblivious Transfer protocol (and its variants) are complete.
Eigen-solving via reduction to DPR1 matrices
Authors: V. Y. Pan, B. Murphy, R. E. Rosholt, Y. Tang, X. Wang, A. Zheng
Venue: Computers Mathematics with Applications (2008)

Highly effective polynomial root-finders have been recently designed based on eigen-solving for DPR1 (that is diagonal + rank-one) matrices. We extend these algorithms to eigen-solving for the general matrix by reducing the problem to the case of the DPR1 input via intermediate transition to a TPR1 (that is triangular + rank-one) matrix. Our transforms use substantially fewer arithmetic operations than the QR classical algorithms but employ non-unitary similarity transforms of a TPR1 matrix, whose representation tends to be numerically unstable. We, however, operate with TPR1 matrices implicitly, as with the inverses of Hessenberg matrices. In this way our transform of an input matrix into a similar DPR1 matrix partly avoids numerical stability problems and still substantially decreases arithmetic cost versus the QR algorithm.
Brief paper: On the observability of discrete-time dynamic systems - A geometric approach
Authors: Karl Rieger, Kurt Schlacher, Johann Holl
Venue: Automatica (Journal of IFAC) (2008)

A coordinate-free description for dynamic systems described by explicit (nonlinear) difference equations in one independent variable via a differential geometric framework is presented. Based on this covariant approach suitable geometric objects for discrete-time dynamics are introduced. Especially, the observability along a trajectory is discussed and transformations to normal forms are derived. In addition, the obtained (local) observability criteria can be checked by computer algebra algorithms. Some examples illustrate the proposed approach.
A Hybrid Token-CDMA MAC Protocol for Wireless Ad Hoc Networks
Authors: I-Sheng Liu, Fambirai Takawira, Hong-Jun Xu
Venue: IEEE Transactions on Mobile Computing (2008)

Token passing medium access control (MAC) protocols are gaining interest amongst wireless ad hoc network researchers as they provide unrivalled advantages over the existing IEEE 802.11 standards. This paper introduces a hybrid Token-CDMA MAC protocol that is based on a token passing scheme with the incorporation of code division multiple access (CDMA). With its unique CDMA feature, the proposed MAC is able to support multiple, simultaneous transmissions. The proposed protocol provides both Quality of Service (QoS) and high network resource utilization, while ensuring the stability of the network. This paper examines the performance of the proposed MAC scheme by simulation, and compares its performance against that of other MAC protocols that have appeared in the literature. Simulation results demonstrate that our proposed MAC scheme is effective in decreasing the packet delay and significantly shortens the length of the queue. The input traffic model used in the simulation is a two-state Markov Modulated Poisson Process (MMPP). The data rate QoS is enforced by implementing a modified leaky bucket mechanism in the proposed MAC scheme. The simulation also takes into account channel link errors caused by the wireless link by implementing a multi-layered Gilbert-Elliot model.
Tools for MDA Software Development: Evaluation Criteria and Set of Desirable Features
Authors: Tihomir Calic, Sergiu Dascalu, Dwight Egbert
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Model Driven Architecture (MDA) is a new approach to software development that moves standard code-centric software development to model-centric software development. The basic idea is to specify system functionality with a platform independent model and then translate this model into platform specific model(s) and fully executable source code. MDA provides interoperability capabilities between different technologies, simplifies the work of software engineers, reduces software development costs, and supports adaptation to rapid changes in technology. Based on the development of a software application, a Glossary Management Tool, this paper proposes an evaluation framework for MDA tools and outlines with a set of software requirements the “portrait” of an ideal MDA tool.
Design and implementation of visual feedback for an active tracking
Authors: Tomasz Zabinski, Tomasz Grygiel, Bogdan Kwolek
Venue: Machine Graphics Vision International Journal (2006)

Active visual tracking is used to direct the attention of the camera to an object and maintain it in the camera's field of view. A steered camera is used to decrease relative motion of the target in the image plane. This leads to better performance of the mean-shift based tracking algorithm, which requires the object tracked in the current and the previous frame to overlap. A classical PID controller and a nonlinear fuzzy controller have been tested in steering the camera head.
A novel approach for assisting teachers in analyzing student web-searching behaviors
Authors: Gwo-Jen Hwang, Pei-Shan Tsai, Chin-Chung Tsai, Judy C. R. Tseng
Venue: Computers Education (2008)

Although previous research has demonstrated the benefits of applying the Internet facilities to the learning process, problems with this strategy have also been identified. One of the major difficulties is owing to the lack of an online learning environment that can record the learning portfolio of using the Internet facilities in education, such that the teacher can analyze and evaluate the learning performance of students, and hence the teaching strategies can be adjusted accordingly. In this paper, we propose a web-search learning environment, called Meta-Analyzer, which is able to assist the teachers in analyzing student learning behaviors of using search engines for problem solving. Two-hundred and twenty students and 54 teachers contributed to the trial of the system. The results have shown that the novel approach is able to gain a better understanding about students' learning processes and searching strategies in technology-enhanced environments, as well as to assist the teachers to acquire more about the learning status of students, and hence more constructive suggestions can be given accordingly.
On the chance accuracies of large collections of classifiers
Authors: Mark Palatucci, Andrew Carlson
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We provide a theoretical analysis of the chance accuracies of large collections of classifiers. We show that on problems with small numbers of examples, some classifier can perform well by random chance, and we derive a theorem to explicitly calculate this accuracy. We use this theorem to provide a principled feature selection criterion for sparse, high-dimensional problems. We evaluate this method on microarray and fMRI datasets and show that it performs very close to the optimal accuracy obtained from an oracle. We also show that on the fMRI dataset this technique chooses relevant features successfully while another state-of-the-art method, the False Discovery Rate (FDR), completely fails at standard significance levels.
Designing and assessing an intelligent e-tool for deaf children
Authors: Rosella Gennari, Ornella Mich
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

LODE is a logic-based web tool for Italian deaf children who have problems in the comprehension of narratives in a verbal language; namely, it aims at stimulating global reasoning on written e-stories. Presently, LODE deals with global temporal reasoning; temporal reasoning problems are encoded as constraint satisfaction problems that can be solved by a constraint reasoner. The focus of this paper is the intelligent user interface of LODE; after characterizing the intended end users of LODE, this paper focuses on critical issues faced in the design and assessment of the interface of our e-tool. A preliminary assessment and an evaluation plan of LODE conclude our paper.
Web data management
Authors: Raghu Ramakrishnan
Venue: Proceedings of the nineteenth conference on Australasian database - Volume 75 (2008)

The Web is no longer a static repository of documents; it is a dynamic repository of information that connects people with their passions, and on a more prosaic note, the applications they use in their personal and professional lives. How is the Web evolving as an information source, and how does this affect the future of information discovery? What are the implications of the rapid growth of social networks? How does the emergence of the Web as a delivery channel for services affect the future of software? Technically, these trends have given rise to a new wave of challenges, and led to vigorous research on a number of fronts ranging from social network analysis, information extraction and community information management, massively distributed storage and computing platforms, and placed a premium on hosted service architectures. In this talk, I will discuss these issues and outline some of the solutions that are beginning to emerge. 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
A Space and Time Requirements Logic for Sensor Networks
Authors: Rachel Cardell-Oliver, Mark Reynolds, Mark Kranz
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

User requirements for sensor network applications can be expressed as spatial and temporal constraints on the events observed by sensor network nodes. In this paper a novel logic is introduced for expressing such sensor network requirements. The bi-modal requirements logic is based on timed propositional temporal logic and a one-hop spatial modal logic. The logic is used for expressing sensor network requirements, called spatial-temporal situations. In order to detect the occurrence of spatial-temporal situations in a sensor network, we also propose implementation protocols that run on sensor nodes, filtering events and searching for required properties. The feasibility of spatial-temporal situations and situation detection for sensor network programming is illustrated by two examples: a temporal situation for recognising the occurrence of an explosion, and a spatial situation for detecting contours in a sensor node field.
The complexity of the pigeonhole principle
Authors: M. Ajtai
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

The pigeonhole principle for n is the statement that there is no one-to-one function between a set of size n and a set of size n-1. This statement can be formulated as an unlimited-fan-in constant depth polynomial-size Boolean formula PHP/sub n/ in n(n-1) variables, PHP/sub n/ can be proved in the propositional calculus; that is, a sequence of Boolean formulas can be given so that each one is either an axiom of the propositional calculus or a consequence of some of the previous ones according to an inference rule of the propositional calculus, the last one being PHP/sub n/. The main result is that the pigeonhole principle cannot be proved in this way if the size of the proof (the total number or symbols of the formulas in the sequence) is polynomial in n and each formula is constant-depth (unlimited-fan-in), polynomial size and contains only the variables of PHP/sub n/.
Vignettes of Sweden's Computer Graphics History
Authors: Thomas Larsson
Venue: IEEE Annals of the History of Computing (2008)

This article recounts selected historical events in the computer graphics field in Sweden, ranging from hardware construction to human-computer interaction. Particularly noteworthy are the industrial developments of semigraphical interfaces for improved man-machine communication, and the patented invention of a color graphics system by Håkan Lans, which gave rise to several court cases.
Proxy home agents for route optimization in HAP networks
Authors: Roman Novak
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

Proxy Home Agent (PHA) functionality is proposed for platform nodes in High Altitude Platform (HAP) networks. The solution enables more efficient backhaul link utilization due to path optimization capabilities in an environment with mobile routers. The existing route optimization function of Mobile IP (MIP) cannot solve this problem, while Hierarchical MIP based route optimization does not map well on the HAP network architecture. Optimal inter-platform routes may be achieved even when mobility management for mobile routers does not include support for route optimization. The solution can be rewarding in network architectures where access network is separated from global network through bottleneck links and the majority of users accessing the network are mobile routers.
Can VoD streaming service co-exist with other services on a VM-based virtualized computing platform?
Authors: Ying Song, Hui Wang, Yaqiong Li, Yuzhong Sun, Yu Zeng
Venue: Proceedings of the 2007 Asian technology information program's (ATIP's) 3rd workshop on High performance computing in China: solution approaches to impediments for high performance computing (2007)

Trend towards providing heterogeneous services concurrently by ISPs and low utilization of servers make it necessary to consolidate various services computing into a single platform. In such a shared environment, meeting application-level QoS goals and avoiding interaction among services become challenges as each application consumes different amount of resource and requires different QoS. Video-on-demand (VoD) has been identified as an important application among multimedia services. In this paper, we study a case of interaction among services concurrently running on a virtualized computing environment. The contributions of this paper are follows. 1) We design a novel capability service computing framework for service computing consolidation (CSCF) to study the interaction among concurrent services in a VM-Based Virtualized Computing Environment; 2) A dynamic and lazy memory flowing algorithm (DLMFaVM) among VMs is proposed to partially fulfill this computing model by resource flowing; 3) We also develop a virtualized computing platform to study the possibility of service computing consolidation; 4) We analyze the interaction among VoD service and other typical enterprise services in our capability service computing environment and draw a conclusion that the VoD streaming service co-existing with other services on a VM-based virtualized computing platform is a trend for ISPs. But it presents some challenges for the designers of service soft and the designers of service computing platform.
A faster closure algorithm for pattern matching in partial-order event data
Authors: Matthew Nichols, David Taylor
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

When working with large sets of partial-order event data, typically collected by monitoring a distributed application, it is often desirable to search for specific patterns of events within this data. When performing such a search, we must be able to identify temporal relationships between complex sets of events. Searching for hierarchically-specified event patterns requires that a convex-closure algorithm be applied to the partial matches at each stage in the computation and the performance of such a closure algorithm can strongly influence the overall speed of pattern matching. In this paper, we propose improvements to an existing closure algorithm that significantly improve its efficiency, and also briefly discuss other possible approaches for improving performance.
A nearest neighbor approach for automated transporter prediction and categorization from protein sequences
Authors: Haiquan Li, Xinbin Dai, Xuechun Zhao
Venue: Bioinformatics (2008)

Motivation: Membrane transport proteins play a crucial role in the import and export of ions, small molecules or macromolecules across biological membranes. Currently, there are a limited number of published computational tools which enable the systematic discovery and categorization of transporters prior to costly experimental validation. To approach this problem, we utilized a nearest neighbor method which seamlessly integrates homologous search and topological analysis into a machine-learning framework. Results: Our approach satisfactorily distinguished 484 transporter families in the Transporter Classification Database, a curated and representative database for transporters. A five-fold cross-validation on the database achieved a positive classification rate of 72.3% on average. Furthermore, this method successfully detected transporters in seven model and four non-model organisms, ranging from archaean to mammalian species. A preliminary literature-based validation has cross-validated 65.8% of our predictions on the 11 organisms, including 55.9% of our predictions overlapping with 83.6% of the predicted transporters in TransportDB. Availability and Supplementary information: http://bioinfo.noble.org/manuscript-support/transporter/ Contact: pzhao@noble.org
A machine learning approach for intelligent tutoring systems
Authors: Hussian F. Sindi
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

The combination of artificial intelligence (AI) technology and education results in different products of intelligent educational software for all tasks and domains. With AI methods new generation of intelligent tutoring systems (ITS) and intelligent authoring tools can be created. Machine Learning Techniques provide a variety of methodologies and theories about reasoning, inference and learning. Hypotheses derived from AI theories can inform curriculum, pedagogy, and potential roles for computers in education. Machine learning based ITSs can adjust its tutorial to the student's knowledge, experience, strengths, and weaknesses. It may even be able to carry on a natural language dialogue. In addition, automatic generation of exercises and tests is an important feature of ITS. ITSs are complex to build, complex to maintain and face the knowledge-acquisition difficulty. This paper presents an overview of the machine learning techniques in intelligent tutoring systems. Also, the paper presents a proposed architecture of ITS based on case based reasoning paradigm. Additionally the work has been implemented in the prototype in biology domain.