ppxscal/embedding_network huggingface dataset:
Hardware/Software Co-Simulation for Last Level Cache Exploration
Authors: Tao Wang, Qigang Wang, Dong Liu, Michael Liao, Kevin Wang, Lu Cao, Li Zhao, Ravi Iyer, Ramesh Illikkal, Liang Wang, John Du
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

Larger last level caches are being considered for bridging the performance gap between the processors and the memory subsystem. It requires much longer simulation time to exercise the whole cache and get accurate evaluation results. In this paper, we motivate the need for a trace-driven hardware/software co-simulation approach to solve this problem. We describe the components of the hardware/software co-simulation: (a) a hardware approach for FSB (Front Side Bus) cycle accurate long trace extraction and (b) a software simulation infrastructure to simulate arbitrary length of traces limited only by the storage system. We compare this hardware/software co-simulation approach to previous approaches (software-only and hardware FPGA-cache simulation) and articulate why our proposed approach is more flexible, more repeatable and sufficiently fast for last-level cache exploration. Evaluation results based on our hardware/software co-simulation infrastructure shows that our approach provides accurate results and shows the importance of timing information in accurate trace-driven simulations. We also demonstrate that it is not adequate to use short traces to get accurate results. Instead, the whole trace for the whole lifecycle of the workload, or at least a long trace (~ 5 minutes) should be used to capture the real behavior of the workloads.
Acceptable intrusiveness of online help in mobile devices
Authors: Ohad Inbar, Talia Lavie, Joachim Meyer
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

The aim of this study was to examine how users perceive help on a mobile device with respect to the presentation format and the severity of the scenario the user encounters. We examined how 92 participants responded to four different formats of help offered for five different scenarios varying in their severity level using static images displayed in a web browser. The intrusiveness of the help format and the severity of the scenario affected participants' interest in receiving help. In certain conditions it may be helpful to suggest help, in particular when users do not know how to ask for it but show interest in receiving it when offered.
The Method of Pavement Image Splicing Based on SIFT Algorithm
Authors: Hou Xiang-dan, Dong Yong-feng, Guo Hai-jiao, Yang Xin
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

According to the characteristic of pavement image, a new splicing method for pavement image based on scale invariant feature transformwas proposed. The SIFT algorithm is used to detect the feature points, FCM clustering is used to find the most similitude cluster relative to the number of feature point, and match the feature descriptors in the cluster ,then the false feature points pair is rejected by RANSAC algorithm. Finally the correct match feature point's pair is used to realize image splicing in order to display the panoramic images of pavement images. There is a great reference value for improving the system of pavement image Automatic detection.
Visualizing Local-Area Networks and Checksums Using Bevy
Authors: Xuejun Yang, Hong Wang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

The hardware and architecture solution to model checking is defined not only by the refinement of suffix trees, but also by the private need for object-oriented languages. Given the current status of low-energy theory, futurists obviously desire the exploration of linked lists, which embodies the practical principles of software engineering. In this position paper, we consider how replication can be applied to the appropriate unification of B-trees and online algorithms. We validated that SCSI disks and fiber-optic cables are largely incompatible. The analysis of Moore's Law is more technical than ever, and Bevy helps cyber informaticians do just that.
Learning to coordinate controllers-reinforcement learning on a control basis
Authors: Manfred Huber, Roderic A. Grupen
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

Autonomous robot systems operating in an uncertain environment have to be reactive and adaptive in order to cope with changing environment conditions and task requirements. To achieve this, the hybrid control architecture presented in this paper uses reinforcement learning on top of a Discrete Event Dynamic System (DEDS) framework to learn to supervise a set of basis controllers in order to achieve a given task. The use of an abstract system model in the automatically derived supervisor reduces the complexity of the learning problem. In addition, safety constraints may be imposed a priori, such that the system learns on-line in a single trial without the need for an outside teacher. To demonstrate the applicability of the approach, the architecture is used to learn a turning gait on a four legged robot platform.
Intelligent Expression-Based Character Agent Systems
Authors: Steve Dipaola
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

By using parameterization techniques which model artistic, living or cognitive systems it is becoming possible to create new types of behavior and expression character systems. These techniques are allowing virtual agent creators to incorporate models of expression, emotion, behavior and even human creativity into their work. Additionally, rather than simply using realism as a goal, is it becoming possible to computationally model knowledge from other expression-based sources including artists, musicians and designers, to go beyond communication to creative expression.
Flip Bifurcation of a Class of Discrete-time Neural Networks
Authors: Rong Yu, Xiaoliang Zhou
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

In this paper, a class of discrete-time system modeling a network with two neurons is considered. Its flip bifurcations (also called period-doubling bifurcations for map) are demonstrated by deriving the equation describing the flow on the center manifold. In particular, the explicit formulae for determining the direction and the stability of flip bifurcations are obtained. The theoretical analysis is verified by center manifold.
H8 filtering of Discrete-time Systems with Time-invariant Delay: Delay-independent Case
Authors: Shengqi Sun, Liang Dong, Cuijuan An
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

This paper is concerned with the problems of H∞ filtering for discrete-time systems with time-invariant delay. By introducing an slack variable with an particular structure, linear matrix inequality (LMI) condition is derived to solve the filter design problem. A numerical example is given to illustrate the effectiveness of the proposed methods.
Arc-Consistency Checking with Bilevel Constraints: An Optimization
Authors: Aline Deruyver, Yann Hodé
Venue: Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition (2009)

Arc-consistency checking has been adapted to be able to interpret over-segmented image. This adaptation lead to the arc-consistency algorithm with bilevel constraints. In this paper we propose an optimization of this algorithm. This new way to solve arc-consistency checking with bilevel constraints gives the possibility to parallelize the algorithm. Some experiments shows the efficiency of this approach.
Discriminative model selection for belief net structures
Authors: Yuhong Guo, Russ Greiner
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

Bayesian belief nets (BNs) are often used for classification tasks, typically to return the most likely class label for a specified instance. Many BN-Iearners, however, attempt to find the BN that maximizes a different objective function - viz., likelihood, rather than classification accuracy - typically by first using some model selection criterion to identify an appropriate graphical structure, then finding good parameters for that structure. This paper considers a number of possible criteria for selecting the best structure, both generative (i.e., based on likelihood; BIC, BDe) and discriminative (i.e., Conditional BIC (CBIC), resubstitution Classification Error (CE) and Bias2+Variance (BV)). We empirically compare these criteria against a variety of different "correct BN structures", both real-world and synthetic, over a range of complexities. We also explore different ways to set the parameters, dealing with two issues: (1) Should we seek the parameters that maximize likelihood versus the ones that maximize conditional likelihood? (2) Should we use (i) the entire training sample first to learn the best parameters and then to evaluate the models, versus (ii) only a partition for parameter estimation and another partition for evaluation (cross-validation)? Our results show that the discriminative BV model selection criterion is one of the best measures for identifying the optimal structure, while the discriminative CBIC performs poorly; that we should use the parameters that maximize likelihood; and that it is typically better to use cross-validation here.
Algorithm Design Using Traversals of the Covering Relation
Authors: Andrew Burrow
Venue: Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies (2009)

Where posets are used to represent taxonomies, concept lattices, or information ordered databases there is a need to engineer algorithms that search, update, and transform posets. This paper demonstrates an approach to designing such algorithms. It presents a picture of covering relation traversals that characterises these in terms of up-set and down-set expressions involving union, intersection, and difference. It then provides a detailed analysis of three types of covering relation traversal. The approach is demonstrated by describing a suite of derived algorithms. The intention is to express a manner of decomposing mathematical problems into poset traversals, and to provide context to the selection a particular traversal algorithm. This line of work has previously been pursued by [1]. However, the success and influence of Formal Concept Analysis [2] has shifted the emphasis from posets to lattices, and from algorithms that operate on the graph of the partial order to the formal context. This paper contributes a methodology for the renewed investigation of poset algorithms, with the potential to lead to improvements in algorithms such as the online completion to a lattice.
Dense Two-Frame Stereo Correspondence by Self-organizing Neural Network
Authors: Marco Vanetti, Ignazio Gallo, Elisabetta Binaghi
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

This work aims at defining an extension of a competitive method for matching correspondences in stereoscopic image analysis. The method we extended was proposed by Venkatesh, Y.V. et al where the authors extend a Self-Organizing Map by changing the neural weights updating phase in order to solve the correspondence problem within a two-frame area matching approach and producing dense disparity maps. In the present paper we have extended the method mentioned by adding some details that lead to better results. Experimental studies were conducted to evaluate and compare the solution proposed.
A Method for Consistent Design of User Interaction with Multifunction Devices
Authors: Dong San Kim, Wan Chul Yoon
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

Over the last decade, feature creep and the convergence of multiple devices have increased the complexity of both design and use. One way to reduce the complexity of a device without sacrificing its features is to design the UI consistently. However, designing consistent user interface of a multifunction device often becomes a formidable task, especially when the logical interaction is concerned. This paper presents a systematic method for consistent design of user interaction, called CUID (Consistent User Interaction Design), and validates its usefulness through a case study. CUID, focusing on ensuring consistency of logical interaction rather than physical or visual interfaces, employs a constraint-based interactive approach. It strives for consistency as the main goal, but also considers efficiency and safety of use. CUID will reduce the cognitive complexity of the task of interaction design to help produce devices that are easier to learn and use.
Ontology For Supporting Context Aware Applications For The Intelligent Hospital Ward
Authors: P. Kataria, A. Macfie, R. Juric, K. Madani
Venue: Journal of Integrated Design Process Science (2008)

We have designed and implemented a Context-aware ONTOlogical (C-ONTO) schema for pervasive computing environments in hospitals. The schema contains semantics for situation awareness, which has been drawn from sensor-derived information about patients, called local contexts; changes to these contexts, and users involved in, and actions taken as a result of, these context changes. We have modeled and implemented situation awareness in C-ONTO through the transitive relationship between its ontological classes.
Supporting feedback and assessment of digital ink answers to in-class exercises
Authors: Kimberle Koile, Kevin Chevalier, Michel Rbeiz, Adam Rogal, David Singer, Jordan Sorensen, Amanda Smith, Kah Seng Tay, Kenneth Wu
Venue: Proceedings of the 19th national conference on Innovative applications of artificial intelligence - Volume 2 (2007)

Effective teaching involves treating the presentation of new material and the assessment of students' mastery of this material as part of a seamless and continuous feedback cycle. We have developed a computer system, called Classroom Learning Partner (CLP), that supports this methodology, and we have used it in teaching an introductory computer science course at MIT over the past year. Through evaluation of controlled classroom experiments. we have demonstrated that this approach reaches students who would have otherwise been left behind, and that it leads to greater attentiveness in class. greater student satisfaction, and better interactions between the instructor and student. The current CLP system consists of a network of Tablet PCs. and software for posing questions to students, interpreting their handwritten answers, and aggregating those answers into equivalence classes, each of which represents a particular level of understanding or misconception of the material. The current system supports a useful set of recognizers for specific types of answers, and employs AI techniques in the knowledge representation and reasoning necessary to support interpretation and aggregation of digital ink answers.
Middleware for Ambient Intelligence Environments: Reviewing Requirements and Communication Technologies
Authors: Yannis Georgalis, Dimitris Grammenos, Constantine Stephanidis
Venue: Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments (2009)

Ambient Intelligence is an emerging research field that aims to make many of the everyday activities of people easier and more efficient. This new paradigm gives rise to opportunities for novel, more efficient interactions with computing systems. At a technical level, the vision of Ambient Intelligence is realized by the seamless confluence of diverse computing platforms. In this context, a software framework (middleware) is essential to enable heterogeneous computing systems to interoperate. In this paper we first consider the basic requirements of a middleware that can effectively support the construction of Ambient Intelligence environments. Subsequently, we present a brief survey of existing, general-purpose middleware systems and evaluate them in terms of their suitability for serving as the low-level communication platform of an Ambient Intelligence middleware. Finally, we argue that an Object-Oriented middleware such as the Common Request Broker Architecture (CORBA) is most suited for basing a middleware for Ambient Intelligence environments.
Members of Random Closed Sets
Authors: David Diamondstone, Bjørn Kjos-Hanssen
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

The members of Martin-Löf random closed sets under a distribution studied by Barmpalias et al. are exactly the infinite paths through Martin-Löf random Galton-Watson trees with survival parameter $\frac{2}{3}$. To be such a member, a sufficient condition is to have effective Hausdorff dimension strictly greater than $\gamma=\log_2 \frac{3}{2}$, and a necessary condition is to have effective Hausdorff dimension greater than or equal to ¿.
Propagating knapsack constraints in sublinear time
Authors: Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal Van Hentenryck
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

We develop an efficient incremental version of an existing cost-based filtering algorithm for the knapsack constraint. On a universe of n elements, m invocations of the algorithm require a total of O(n log n+mk log(n/k)) time, where k ≤ n depends on the specific knapsack instance. We show that the expected value of k is significantly smaller than n on several interesting input distributions, hence while keeping the same worst-case complexity, on expectation the new algorithm is faster than the previously best method which runs in amortized linear time. After a theoretical study, we introduce heuristic enhancements and demonstrate the new algorithm's performance experimentally.
A Vision-Based Control and Interaction Framework for a Legged Underwater Robot
Authors: Junaed Sattar, Gregory Dudek
Venue: Proceedings of the 2009 Canadian Conference on Computer and Robot Vision (2009)

We present a vision-based control and interaction framework for mobile robots, and describe its implementation in a legged amphibious robot. The control scheme enables the robot to navigate, follow targets of interest, and interact with human operators. The visual framework presented in this paper enables deployment of the vehicle in underwater environments along with a human scuba diver as the operator, without requiring any external tethered control. We present the current implementation of this framework in our particular family of underwater robots, with a focus on the underlying software and hardware infrastructure. We look at the practical issues pertaining to system implementation as it applies to our framework, from choice of operating systems to communication bus design. While our system has been effectively used in both open-ocean andclosed-water environments, we perform some quantitative measurements with an effort to analyze the responsiveness and robustness of the complete architecture.
Summarization for Internet News Based on Clustering Algorithm
Authors: Hui Yu
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

For the explosion of information in the World Wide Web, this paper proposed a new method of summarization for Internet news based on clustering algorithm. It used google search engine to extract relevant documents, and mixed query sentence into sentences set which segmented from relevant document set, then this paper adopted effective cluster algorithm to cluster all the sentences. In the period of summary generation, the summary sentences were extracted by turns from the clusters which query sentence in. Experimental result shows that the proposed summarization method can improve the performance of summary, clustering algorithm is effective.
VOILA: efficient feature-value acquisition for classification
Authors: Mustafa Bilgic, Lise Getoor
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

We address the problem of efficient feature-value acquisition for classification in domains in which there are varying costs associated with both feature acquisition and misclassification. The objective is to minimize the sum of the information acquisition cost and misclassification cost. Any decision theoretic strategy tackling this problem needs to compute value of information for sets of features. Having calculated this information, different acquisition strategies are possible (acquiring one feature at time, acquiring features in sets, etc.). However, because the value of information calculation for arbitrary subsets of features is computationally intractable, most traditional approaches have been greedy, computing values of features one at a time. We make the problem of value of information calculation tractable in practice by introducing a novel data structure called the Value of Information Lattice (VOILA). VOILA exploits dependencies between missing features and makes sharing of information value computations between different feature subsets possible. To the best of our knowledge, performance differences between greedy acquisition, acquiring features in sets, and a mixed strategy have not been investigated empirically in the past, due to inherit intractability of the problem. With the help of VOILA, we are able to evaluate these strategies on five real world datasets under various cost assumptions. We show that VOILA reduces computation time dramatically. We also show that the mixed strategy outperforms both greedy acquisition and acquisition in sets.
Gem #62: C++ constructors and Ada 2005
Authors: Javier Miranda, Arnaud Charlet
Venue: ACM SIGAda Ada Letters (2009)

In the previous Gem, we explored how to interface and make simple use of C++ constructors on the Ada side. In this Gem, we detail more advanced constructs related to Ada 2005 and C++ constructors.
Semantic Information Processing for Multi-party Interaction
Authors: Tilman Becker
Venue: Proceedings of the 12th International Conference on Text, Speech and Dialogue (2009)

We present ongoing research efforts using semantic representations and processing, combined with machine learning approaches to structure, understand, summarize etc. the multimodal information available from multi-party meeting recordings.
GA Optimization the Medicine Logistics Distribution Routing
Authors: Jin Zhang, Teng Fei, Wei Li, Yanqin Li
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

The cost function of medicine logistics distribution routing was constructed. Genetic algorithm possesses the ability to solve multi-object problem. Genetic algorithm was utilized to optimize the constraint cost function. Simulation result shows that the genetic algorithm possesses the better optimization quantity and effect in the medicine logistics distribution routing.
Understanding the Impact of Rail Automation
Authors: Sarah Sharples, Nora Balfe, David Golightly, Laura Millen
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

Over the past ten a number of studies have been conducted to understand the way in which rail signalling operations are completed. This paper reviews some of the themes that have emerged from this body of work and considers two principal questions --- firstly, how should we apply human factors methods to develop our understanding of the impact of automation and secondly, how can we link the data we have collected from the rail work to theoretical concepts that will help us to design future automation systems?