ppxscal/embedding_network huggingface dataset:
Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data
Authors: Xiang Lian, Lei Chen
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2009)

Reverse nearest neighbor (RNN) search is very crucial in many real applications. In particular, given a database and a query object, an RNN query retrieves all the data objects in the database that have the query object as their nearest neighbors. Often, due to limitation of measurement devices, environmental disturbance, or characteristics of applications (for example, monitoring moving objects), data obtained from the real world are uncertain (imprecise). Therefore, previous approaches proposed for answering an RNN query over exact (precise) database cannot be directly applied to the uncertain scenario. In this paper, we re-define the RNN query in the context of uncertain databases, namely probabilistic reverse nearest neighbor (PRNN) query, which obtains data objects with probabilities of being RNNs greater than or equal to a user-specified threshold. Since the retrieval of a PRNN query requires accessing all the objects in the database, which is quite costly, we also propose an effective pruning method, called geometric pruning (GP), that significantly reduces the PRNN search space yet without introducing any false dismissals. Furthermore, we present an efficient PRNN query procedure that seamlessly integrates our pruning method. Extensive experiments have demonstrated the efficiency and effectiveness of our proposed GP-based PRNN query processing approach, under various experimental settings.
Tutorial series on brain-inspired computing: part 6: geometrical structure of boosting algorithm
Authors: Takafumi Kanamori, Takashi Takenouchi, Noboru Murata
Venue: New Generation Computing (2007)

In this article, several boosting methods are discussed, which are notable implementations of the ensemble learning. Starting from the firstly introduced "boosting by filter" which is an embodiment of the proverb "Two heads are better than one", more advanced versions of boosting methods "AdaBoost" and "U-Boost" are introduced. A geometrical structure and some statistical properties such as consistency and robustness of boosting algorithms are discussed, and then simulation studies are presented for confirming discussed behaviors of algorithms.
A high performance agent based modelling framework on graphics card hardware with CUDA
Authors: Paul Richmond, Simon Coakley, Daniela M. Romano
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

We present an efficient implementation of a high performance parallel framework for Agent Based Modelling (ABM), exploiting the parallel architecture of the Graphics Processing Unit (GPU). It provides a mapping between formal agent specifications, with C based scripting, and optimised NVIDIA Compute Unified Device Architecture (CUDA) code. The mapping of agent data structures and agent communication is described, and our work is evaluated through a number of simple interacting agent examples. In contrast with an alternative, single machine CPU implementation, a speedup of up to 250 times is reported.
Conceptual Conflict by Design: Dealing with Students' Learning Impasses in Multi-user Multi-agent Virtual Worlds
Authors: Yam San Chee, Yi Liu
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

This paper describes current work directed at dealing with students' learning impasses that can arise when they are unable to make further learning progress while interacting in a 3D virtual world. This kind of situation may occur when group members do not possess the requisite knowledge needed to bootstrap themselves out of their predicament or when all group members mistakenly believe that their incorrect conceptual understanding of a science phenomenon is correct. The work reported here takes place in C--VISions, a socialized collaborative learning environment. To deal with such learning impasses, we have developed multiple embodied pedagogical agents and introduced them into the C--VISions environment. The agents are used to trigger experientially grounded cognitive dissonance between students and thereby to induce conceptual conflict that requires resolution. We describe the design and implementation of our agents which take on different functional roles and are programmed to aid students in the conflict resolution process. A description of multi agent-user interaction is provided to demonstrate how the agents enact their roles when students encounter a learning impasse.
Emotions and Learning with AutoTutor
Authors: Arthur Graesser, Patrick Chipman, Brandon King, Bethany McDaniel, Sidney D'Mello
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

The relationship between emotions and learning was investigated by tracking the emotions that college students experienced while learning about computer literacy with AutoTutor. AutoTutor is an animated pedagogical agent that holds a conversation in natural language, with spoken contributions by the learner. Thirty students completed a multiple-choice pre-test, a 35-minute training session, and a multiple-choice post-test. The students reviewed the tutorial interaction and were stopped at strategically sampled points for emotion judgments. They judged what emotions they experienced on the basis of the dialogue history and their facial expressions. The emotions they judged were boredom, flow (engagement), frustration, confusion, delight, surprise, and neutral. A multiple regression analysis revealed that post-test scores were significantly predicted by pre-test scores and confusion, but not by any of the other emotions.
A reconfigurable framework for experimental analysis of single and multi hop WLANs
Authors: Paolo Dini, Marc Portoles-Comeras, Oriol Font-Bach, Manuel Requena-Esteso, Josep Mangues-Bafalluy
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

This paper presents a reconfigurable framework used to analyze the performance of different technologies in WLAN environments. This framework incorporates state-of-art experimentation tools into a single control paradigm that allows an easy reconfiguration and repetition of experimentation trials. The paper describes the main features of the testbed together with some of the technical solutions adopted. Also, an illustrative experimentation case is described, step-by-step, to show the performance of this tool. Specifically this experimentation case studies the performance of VoIP applications across different wireless scenarios. It reveals some patterns of the behaviour of this type of applications that would be difficult to observe in other more specific experimentation platforms.
Dynamic composition of web applications in human-centered processes
Authors: Gerardo Canfora, Massimiliano Di Penta, Pierpaolo Lombardi, Maria Luisa Villani
Venue: Proceedings of the 2009 ICSE Workshop on Principles of Engineering Service Oriented Systems (2009)

Dynamic binding has been recently applied with success to composite services. However, many business processes are human-centered, that is, tasks may be performed by humans other than software, and so these processes require a high interaction between users and web applications. Inspired from previous work in service dynamic binding and information propagation in web application mashups, this paper proposes an approach to enable, through proxy portlets, dynamic binding between human-centered processes and web applications or web services, also enabling the propagation of information-e.g., form parameters and operation outputs-between different activities.
Concepts in Computing, 1st edition
Authors: Kenneth Hoganson
Venue:  (2007)

Concepts in Computing provides a clear, concise introduction to the fundamentals of computer science. The author generates excitement, curiosity, and enthusiasm in students and leaves them with a desire to learn more about the fascinating world of computing. The text identifies the important relationship between computing and the disciplines of engineering and mathematics. It focuses on the three important areas of Software/Programming/Design, Computer Systems/Architecture, and Theoretical Foundations. It is clear that students learn faster, and retain and integrate knowledge more efficiently, if they see how each subject area connects with, and is interdependent upon others. Concepts in Computing sets a solid foundation for introductory students and is a useful companion to those entering introductory programming courses. 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
Garbage Collector Scheduling in Dynamic, Multiprocessor Real-Time Systems
Authors: Hyeonjoong Cho, Binoy Ravindran, Chewoo Na
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

We consider garbage collection (GC) in dynamic, multiprocessor real-time systems. We consider the time-based, concurrent GC approach and focus on real-time scheduling to obtain mutator timing assurances, despite memory allocation and garbage collection. We present a scheduling algorithm called GCMUA. The algorithm considers mutator activities that are subject to time/utility function time constraints, stochastic execution-time and memory demands, and overloads. We establish that GCMUA probabilistically lower bounds each mutator activity's accrued utility, lower bounds the system-wide total accrued utility, and upper bounds the timing assurances' sensitivity to variations in mutator execution-time and memory demand estimates. Our simulation experiments validate our analytical results and confirm GCMUA's effectiveness.
Analysis of Two Neural Networks in the Intelligent Faults Diagnosis of Metallurgic Fan Machinery
Authors: Jiangang Yi, Peng Zeng
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

With the aim to study the faults diagnosis ability of the BPNN and the RBFNN, many experiments are done to test the learning ability, the diagnosis ability and the anti-noise ability. The analysis shows the RBFNN has better learning ability and anti-noise ability than the BPNN. However, in the process of concurrent faults diagnosis, both have bad recognition rate. A realistic application verifies the single neural network can not used for metallurgic fan machinery faults diagnosis.
Designing electronic use policies to enhance employee perceptions of fairness and to reduce cyberloafing: An empirical test of justice theory
Authors: Christine A. Henle, Gary Kohut, Rosemary Booth
Venue: Computers in Human Behavior (2009)

Organizations are attempting to curtail cyberloafing or employee use of company Internet and email systems for non-work purposes by implementing electronic use policies, but their design is based on anecdotal support instead of theory or empirical research. Using procedural justice theory, we propose policies containing signed versus implied consent, for cause versus periodic monitoring, zero tolerance or progressive discipline versus managerial discretion in disciplinary procedures, and appeals to peers or management versus no appeals will improve employee perceptions of policy fairness and thus, decrease cyberloafing. Results from two experiments and a field study found that zero tolerance, progressive discipline, and appeal processes were related to higher perceptions of policy fairness while periodic monitoring was related to less cyberloafing.
XML keyword query refinement
Authors: Jiaheng Lu, Zhifeng Bao, Tok Wang Ling, Xiaofeng Meng
Venue: Proceedings of the First International Workshop on Keyword Search on Structured Data (2009)

Existing works in XML keyword search have addressed the problem of finding matching results of a query. However, user input queries always contain irrelevant or mismatched terms, spelling errors etc, which causes the search results to be either empty or not meaningful. In this paper, we introduce the problem of XML keyword query refinement, and propose a set of effective and efficient solutions. Finally, extensive experiments show the efficiency and effectiveness of our approach.
Design and application of adaptive delay sequential elements
Authors: Kambiz Rahimi, Chris Diorio
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2006)

Lower operating voltages and faster clock frequencies in advanced fabrication processes increase the circuit delay sensitivity to voltage, temperature, and process variations and modeling approximations. Uncorrelated delay variations along data and clock paths cause timing violations. In this paper, we propose a method for correcting timing violations by in-circuit tuning of clock latencies after fabrication. We introduce adaptive delay sequential elements (ADSEs) that use charge storage on pMOS floating gates to tune the clock latencies of timing critical flip-flops. ADSEs facilitate in-circuit optimization of clock latencies under varying operating conditions. ADSE tuned clock latencies are nonvolatile and can be repeatedly adjusted after fabrication using only electrical signals. We present examples of implicit and explicit pulsed ADSEs and their tuning operations. Our experiments with fabricated prototypes show that ADSEs can tune their clock latencies with picosecond resolution over one-half of the clock period. Our experiments also show that ADSE sensitivities to supply voltage, temperature, noise, and transistor mismatch are comparable to nonadaptive sequential elements. We present experimental data that show ADSE tuned delays change only 15% after ten years at 125°C. We propose a method for selective tuning of embedded ADSEs and demonstrate its application in a fabricated prototype. ADSEs can selectively replace timing-critical flip-flops of a circuit with negligible area impact.
On the Ontological Nature of Syntactic Categories in Categorial Grammar
Authors: Rani Nelken
Venue: Languages: From Formal to Natural: Essays Dedicated to Nissim Francez on the Occasion of His 65th Birthday (2009)

We address the ontological nature of syntactic categories in categorial grammar. Should we interpret categories as being a model of some actual grammatical reality, or are they merely part of an empirical model, one that attempts to capture the range of data, but without making any ontological commitments. This distinction, which is not often made, is important for determining the goals of formal grammar research. We evaluate this question within the context of a particular grammatical phenomenon, the modeling of premodifier ordering. We compare the categorial grammar treatment of this phenomenon with empirical statistical approaches to the same problem. We show that the whereas both models are equally empirically adequate, the statistical model is more generalizable and learnable, and thus advantageous as a realistic model.
The Illusion of Being Deterministic --- Application-Level Considerations on Delay in 3G HSPA Networks
Authors: Joachim Fabini, Wolfgang Karner, Lukas Wallentin, Thomas Baumgartner
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

The delay experienced by mobile applications in HSPA networks depends to a large extent on highly dynamical global context like, e.g., cell load or algorithms and thresholds governing radio resource scheduling, and on local context like, e.g., user-generated load or load history. These complex uncertainty factors are outside of an application's sphere of influence and result in applications perceiving HSPA link behavior as non-deterministic and non-reproducible.This paper analyzes accurate round-trip and one-way delay measurement results for three public HSPA networks to demonstrate the high degree of network non-determinism which mobile applications are likely to encounter in practice, particularly significant payload-dependence and halved delay on slightly increased user-generated link load. We argue that current HSPA radio link schedulers, relying on instantaneous user load as decision criterion for channel capacity allocation, neglect real-time application requirements. Cross-layer optimization is one solution which enables deterministic scheduler decisions based on application requirements.
Self-organizing fault-tolerant topology control in large-scale three-dimensional wireless networks
Authors: Yu Wang, Lijuan Cao, Teresa A. Dahlberg, Fan Li, Xinghua Shi
Venue: ACM Transactions on Autonomous and Adaptive Systems (TAAS) (2009)

Topology control protocol aims to efficiently adjust the network topology of wireless networks in a self-adaptive fashion to improve the performance and scalability of networks. This is especially essential to large-scale multihop wireless networks (e.g., wireless sensor networks). Fault-tolerant topology control has been studied recently. In order to achieve both sparseness (i.e., the number of links is linear with the number of nodes) and fault tolerance (i.e., can survive certain level of node/link failures), different geometric topologies were proposed and used as the underlying network topologies for wireless networks. However, most of the existing topology control algorithms can only be applied to two-dimensional (2D) networks where all nodes are distributed in a 2D plane. In practice, wireless networks may be deployed in three-dimensional (3D) space, such as under water wireless sensor networks in ocean or mobile ad hoc networks among space shuttles in space. This article seeks to investigate self-organizing fault-tolerant topology control protocols for large-scale 3D wireless networks. Our new protocols not only guarantee k-connectivity of the network, but also ensure the bounded node degree and constant power stretch factor even under k&minus;1 node failures. All of our proposed protocols are localized algorithms, which only use one-hop neighbor information and constant messages with small time complexity. Thus, it is easy to update the topology efficiently and self-adaptively for large-scale dynamic networks. Our simulation confirms our theoretical proofs for all proposed 3D topologies.
Use of technology as a solution to the problems faced in literacy education by the teachers of the hearing impaired: ISITEK project
Authors: Umit Girgin, Ahmet Naci Coklar, A. Askim Kurt, H. Ferhan Odabasi
Venue: Proceedings of the international conference on Computational and information science 2009 (2009)

Special education aims to view the society as a whole, and offer the individuals the opportunity to live on an equal basis in the society by correcting the deficiencies. The sound need of hearing impaired individuals can be met with different elements by using technology in the education of the hearing impaired, which is a kind of special education. In this study, a project proposal (ISITEK) which helps the teachers of the hearing impaired to solve the problems they face in teaching literacy with computer and internet technologies, and involves the participation of experts from different disciplines is described.
Autonomous Units to Model Interacting Sequential and Parallel Processes
Authors: Karsten Hölscher, Hans-Jörg Kreowski, Sabine Kuske
Venue: Fundamenta Informaticae (2009)

In this paper, we introduce the notion of a community of autonomous units as a rulebased and graph-transformational device to model processes that run interactively but independently of each other in a common environment. The main components of an autonomous unit are a set of rules, a control condition, and a goal. Every autonomous unit transforms graphs by applying its rules so that the control condition is satisfied. If the goal is reached the resulting transformation process is successful. A community contains a set of autonomous units, an initial environment specification, and an overall goal. In every transformation process of a community the autonomous units interact via their common environment. As an example, the game Ludo is modeled as a community of self-controlled players who interact on a common board. The emphasis of the presented approach is laid on the study of the formal semantics of a community as a whole and of each of its member units separately. In particular, a sequential as well as a parallel semantics is introduced, and communities with parallel semantics are compared with Petri nets, cellular automata, and multiagent systems.
Towards a hardware fault-injection testbed to support reproducible resiliency experiments
Authors: Ron Sass, Rahul R. Sharma, Nathan DeBardeleben
Venue: Proceedings of the 2009 workshop on Resiliency in high performance (2009)

As the largest computers in world continue to scale up, significant new problems emerge. Due to a number of different sources, hard and soft failures cause correctness failures and performance degradation in high component count machines that simply do not occur is smaller scale machines. This presents a serious problem to researchers interested in studying and countering the effects because effects are not reproducible smaller scale testbeds. The Reconfigurable Computing Cluster project is primarily interested in the feasibility of scaling a network of Platform FPGAs to a PetaFLOP. In this architecture, the FPGAs are basic compute node (not an accelerator to a microprocessor). Each FPGA node has a processor, bus, memory controller, network adapter, etc. configured into its programmable logic and runs a patched mainline Linux kernel. The cluster runs Open MPI and virtually any MPI application can be compiled and run. Since the hardware of the nodes are easily reconfigured, it was realized that this architecture offers an ideal platform for performing fault injections and Heisenberg-free monitoring of parallel programs. This work-in-progress demonstrates the addition of a "bus cycle stealer." It is a small piece of hardware that can be programmed to wake up periodically and execute a variable number bus transactions. The effect on performance (single node and 16 node systems) are reported.
CCNA: Cisco Certified Network Associate Fast Pass, 3rd edition
Authors: Todd Lammle
Venue:  (2007)

Organized by exam objectives, this is a focused, concise review guide that works hand-in-hand with any learning tool, including the Sybex CCNA: Cisco Certified Network Associate Study Guide, 6th and Deluxe editions. The book will consist of four high-level chapters, each mapping to the four main Domains of the exam skill-set. The book will drill down into the specifics of the exam, covering the following: *Designing Cisco internetworks *Developing an access list *Evaluating TCP/IP communication *Configuring routers and switches *Configuring IP addresses, subnet masks, and gateway addresses *Performing LAN, VLAN, and WAN troubleshooting *Understanding rules for packet control The interactive CD contains two bonus exams, handy flashcard questions, and a searchable PDF of a Glossary of Terms.