ppxscal/embedding_network huggingface dataset:
Shall We Explain? Augmenting Learning from Intelligent Tutoring Systems and Peer Collaboration
Authors: Robert G. Hausmann, Brett Sande, Kurt Vanlehn
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

Learning outcomes from intelligent tutoring systems (ITSs) tend to be quite strong, usually in the neighborhood of one standard deviation. However, most ITS designers use the learning outcomes from expert human tutoring as the gold standard (i.e., two standard deviations). What can be done, with the current state of the art, to increase learning from an ITS? One method is to modify the learning situation by asking students to use the ITS in pairs. To enhance performance, we drew upon the beneficial effects of structured peer collaboration. The results suggest that the intervention was successful. Pairs of students solved more problems and requested fewer bottom-out hints than individuals. To test the possibility that the effect was due to the best partner in the group directing the problem solving, a nominal groups analysis was conducted. A nominal group is a statistical pairing of the non-interacting individuals' performance. The results from the nominal groups replicated the same pattern of results, but with a reduced magnitude. This suggests that the best member may have contributed to some of the overall success of the pair, but does not completely explain their performance.
Decision-theoretic specification of credal networks: A unified language for uncertain modeling with sets of Bayesian networks
Authors: Alessandro Antonucci, Marco Zaffalon
Venue: International Journal of Approximate Reasoning (2008)

Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Credal nets appear to be powerful means to represent and deal with many important and challenging problems in uncertain reasoning. We give examples to show that some of these problems can only be modeled by credal nets called non-separately specified. These, however, are still missing a graphical representation language and updating algorithms. The situation is quite the opposite with separately specified credal nets, which have been the subject of much study and algorithmic development. This paper gives two major contributions. First, it delivers a new graphical language to formulate any type of credal network, both separately and non-separately specified. Second, it shows that any non-separately specified net represented with the new language can be easily transformed into an equivalent separately specified net, defined over a larger domain. This result opens up a number of new outlooks and concrete outcomes: first of all, it immediately enables the existing algorithms for separately specified credal nets to be applied to non-separately specified ones. We explore this possibility for the 2U algorithm: an algorithm for exact updating of singly connected credal nets, which is extended by our results to a class of non-separately specified models. We also consider the problem of inference on Bayesian networks, when the reason that prevents some of the variables from being observed is unknown. The problem is first reformulated in the new graphical language, and then mapped into an equivalent problem on a separately specified net. This provides a first algorithmic approach to this kind of inference, which is also proved to be NP-hard by similar transformations based on our formalism.
Thematic Segment Retrieval Revisited
Authors: Sylvain Lamprier, Tassadit Amghar, Bernard Levrat, Frédéric Saubion
Venue: Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications (2008)

Documents, especially long ones, may contain very diverse passages related to different topics. Passages Retrieval approaches have shown that, in most cases, there is a great potential benefit in considering these passages independently when computing the similarity of a document with a user's query. Experiments have been realized in order to identify the kinds of passage which are the best suited for such a process. Contrarily to what could have been expected, working with thematic segments, which are likely to represent only one topic each, has led to greatly lower effectiveness results than the use of arbitrary sequences of words. In this paper, we show that this paradoxical observation is mainly due to biases induced by the great length diversity of the thematic passages. Therefore, we propose here to cope with these biases by using a more powerful text length normalization technique. Experiments show that, when length biases are laid aside, the use of thematic passages is better suited than arbitrary sequences of words to retrieve relevant informations as response to a user's query.
Organizing Structured Deep Web by Clustering Query Interfaces Link Graph
Authors: Pengpeng Zhao, Li Huang, Wei Fang, Zhiming Cui
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

There are a lot of pages on internet that are generated dynamically by the back-end database and the traditional searching engines can't reach these pages, which are called Deep Web. These sources are structured and provide structured query interfaces and results. Organizing structured Deep Web sources by their domain can let users browse these valuable resources and is one of the critical steps toward the large-scale Deep Web information integration. We propose a new strategy that automatically and accurately classifies Deep Web sources based on the form link graph, which can be easily constructed from web forms, and apply Fuzzy partition technique which is proved to be better suited for the features of Deep Web. Experiments using real Deep Web data show that our approach provides an effective and scalable solution for organizing Deep Web sources.
Efficient Adaptive Algorithms for Transposing Small and Large Matrices on Symmetric Multiprocessors
Authors: Rami Al Na'mneh, W. David Pan, Seong-Moo Yoo
Venue: Informatica (2006)

Matrix transpose in parallel systems typically involves costly all-to-all communications. In this paper, we provide a comparative characterization of various efficient algorithms for transposing small and large matrices using the popular symmetric multiprocessors (SMP) architecture, which carries a relatively low communication cost due to its large aggregate bandwidth and low-latency inter-process communication. We conduct analysis on the cost of data sending / receiving and the memory requirement of these matrix-transpose algorithms. We then propose an adaptive algorithm that can minimize the overhead of the matrix transpose operations given the parameters such as the data size, number of processors, start-up time, and the effective communication bandwidth.
QoS and Authentication Experiences in a Residential Environment Within a Broadband Access Framework
Authors: Iván Vidal, Francisco Valera, Jaime García, Arturo Azcorra, Vitor Pinto, Vitor Ribeiro
Venue: Proceedings of the 5th international conference on Wired/Wireless Internet Communications (2007)

It is sometimes believed that a "broadband access" network, providing ample transmission capacity to residential environments, is enough so as to allow a flawless delivery of advanced services. However, the provisioning of a combination of multiple services with guaranteed quality up to the end-user terminal requires a carefully designed architecture incorporating the appropriated Quality of Service (QoS) concepts throughout the data path. And this path includes the Residential Gateway (RGW) as the last hop towards the home network. This paper describes the different experiences performed with the RGW prototype developed within the framework of the European IST research project MUSE. Special emphasis will be made on the QoS capabilities of the RGW as well as on authentication and auto-configuration features.
Addressing Workload Variability in Architectural Simulations
Authors: Alaa R. Alameldeen, David A. Wood
Venue: IEEE Micro (2003)

The inherent variability of multithreaded commercial workloads can lead to incorrect results in architectural simulation studies. Random perturbations and statistical methods help computer architects draw valid conclusions.
Hybrid Evolution of Heterogeneous Neural Networks
Authors: Zdeněk Buk, Miroslav Šnorek
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

In this paper we are describing experiments and results of applications of the continual evolution algorithm to construction and optimization of recurrent neural networks with heterogeneous units. Our algorithm is a hybrid genetic algorithm with sequential individuals replacement, varibale population size and age-based probability control functions. Short introduction to main idea of the algorithm is given. We describe some new features implemented into the algorithm, the encoding of individuals, crossover, and mutation operators. The behavior of population during an evolutionary process is studied on atificial benchmark data sets. Results of the experiments confirm the theoretical properties of the algorithm.
Biomedical Text Mining Using a Grid Computing Approach
Authors: Marcello Castellano, Giuseppe Mastronardi, Giacinto Decataldo, Luca Pisciotta, Gianfranco Tarricone, Lucia Cariello, Vitoantonio Bevilacqua
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Extracting useful information from a very large amount of biomedical texts is an important and difficult activity in biomedicine field. Data to be examined are generally unstructured and the available computational resources do not still provide adequate mechanisms for retrieving and analyse very large amount of contents. In this paper we present a rule-based system for Text Mining process applied in biomedical textual documents. This application requires a strongly use of the computational resource to perform intensive operations. We propose a grid computing approach to improve application performance.
Reduced models for solving particle beams and plasma physics problems
Authors: Franck Assous
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

In recent years, modelling and solving numerically problems which couple charged particle to electro-magnetic fields has given rise to challenging mathematical and scientific computing developments. In the industry, a variety of examples can be thought of, such as the ion or electron injectors for particle accelerators, the free electron lasers, the hyperfrequency devices, the vulnerability of spatial devices to particle flows, etc. In this paper, we are concerned with the construction of numerical methods required for solving particle beams and plasma physics applications. The main lines of this paper will treat about the analysis and the development of the reduced models. We present two situations in which this strategy can be applied. Numerical results illustrate the possibilites of the approach.
On the predictability and security of user choice in passwords
Authors: Julie Thorpe
Venue:  (2008)

It is well-known that traditional text-based passwords are weak due to predictable patterns in user choice. In response, other knowledge-based authentication schemes such as graphical passwords have been proposed, motivated in part by our remarkably better memory for pictures over words. We hypothesize that these schemes, when allowing users free choice of their password, will suffer from similar weaknesses. We examine and generalize existing methods for attacking knowledge-based schemes, and apply these methods to two representative, previously unanalyzed, graphical password schemes: the "Draw-A-Secret" scheme of Jermyn et al. (1999), and the "Pass-Points" scheme of Weidenbeck et al. (2005). We validate our hypothesis using data collected from our own user studies, and from user studies by others, providing the first attacks and effective security analyses for these two schemes. Our results naturally lead to a set of recommendations that may help improve the effective security of these particular schemes. In light of these attacks, we propose a novel idea for user authentication we call "pass-thoughts", which may prove to have some unique properties to defend against various attacks (but we do not prove this herein). We end with a discussion of other considerations for user authentication schemes, a comparative analysis of existing schemes, and a discussion to put the results of this thesis in context.
BioFlow: A Web-Based Declarative Workflow Language for Life Sciences
Authors: Hasan Jamil, Bilal El-Hajj-Diab
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

Scientific workflows in Life Sciences are usually complex, and use many online databases, analysis tools, publication repositories and customized computation intensive desktop software in a coherent manner to respond to investigative queries. These investigative queries are generally ad hoc, ill-formed, and often, used only once to test a single hypothesis. In such cases, developing customized workflows becomes a major undertaking, rendering the effort truly expensive, prohibitive and resource intensive. Such high development costs often act as deterrents to many interesting queries and promising on-time scientific discoveries. In this paper, we introduce a new query language that combines workflow features for scientific applications, called BioFlow, that exploits many recent developments in internet communication, databases, wrapper and mediator technologies, ontology, and data integration. BioFlow is a declarative language that abstracts these features to help hide most procedural aspects of mediation, data integration, communication protocols, data extraction and workflow details. We will demonstrate that fairly complex workflows can be effortlessly and declaratively expressed in BioFlow in an ad hoc fashion at minimal costs. We also report a prototype implementation of BioFlow in Windows VB .NET that includes most of its powerful and representative features as proof of feasibility of our proposal.
Agent communication in ubiquitous computing: the Ubismart approach
Authors: Jurriaan van Diggelen, Robbert-Jan Beun, Rogier M. van Eijk, Peter J. Werkhoven
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

This paper studies the use of agent communication in ubiquitous computing. This application domain allows us to investigate the efficient handling of large quantities of information in agent-based systems. We will present an approach to dynamically set up a communication network between agents which aims to minimize the communication load. The approach is based on a formal ontological notion of informativeness, on quantitative measures such as information gain and on the proper use of interaction mechanisms such as Publish/Subscribe. We also present experimental results which have been obtained using our prototyping tool called Ubismart.
SEMAP: Improving Multipath Security Based on Attacking Point in Ad Hoc Networks
Authors: Zhengxin Lu, Chen Huang, Furong Wang, Chunming Rong
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

In hostile Ad hoc network, the possibility of being attacked or attacking others can't be avoided. Most current intrusion detection systems and secure routing protocols only focus on concrete attacking behaviors while neglecting the underlying attacking threat. So it's inevitable to choose malicious nodes during routing establishment. To construct a secure multipath route, we present SEMAP, a secure enhancement mechanism based on Attacking Point (AP) which converts the possibility of security threat to a concrete metric. AP is a description of security status of a node. AP of a node can be easily extended to that of link, path and path set, which provides an important reference in route selection. Our design can exclude the nodes that will be the objects of adversaries from the network before actual routing process. Simulation results show that SEMAP provides an effective security enhancement without compromising the efficiency of original routing protocol.
Efficiently Building the Gated Single Assignment Form in Codes with Pointers in Modern Optimizing Compilers
Authors: Manuel Arenaz, Pedro Amoedo, Juan Touriño
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Understanding program behavior is at the foundation of program optimization. Techniques for automatic recognition of program constructs characterize the behavior of code fragments, providing compilers with valuable information to guide code optimizations. The XARK compiler framework provides a complete, robust and extensible solution to the automatic recognition problem that was shown to be effective to characterize the behavior of Fortran77 applications. Our goal is to migrate XARK to the GNU GCC compiler in order to widen its scope of application to program constructs (e.g., pointers, objects) supported by other programming languages (e.g., Fortran90/95, C/C++, Java). The first step towards this goal is the translation of the GCC intermediate representation into the Gated Single Assignment (GSA) form, an extension of Static Single Assignment (SSA) that captures data/control dependences and reaching definition information for scalar and array variables. This paper presents a simple and fast GSA construction algorithm that takes advantage of the infrastructure for building the SSA form available in modern optimizing compilers. An implementation on top of the GIMPLE-SSA intermediate representation of GCC is described and evaluated in terms of memory consumption and execution time using the UTDSP, Perfect Club and SPEC CPU2000 benchmark suites.
An Evaluation Study of the Effectiveness of Modeling NASA Swarm-Based Exploration Missions with ASSL
Authors: Mike Hinchey, Emil Vassev
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

We assess the effectiveness of using the Autonomic System Specification Language (ASSL) to model ANTS (Autonomous Nano-Technology Swarm), a NASA concept swarm-based exploration mission. In this study, we draw upon our preliminary results of modeling some of the autonomic features of ANTS, to discuss and evaluate the advantages and shortcomings of this approach. Moreover, this paper, which documents the results of that study, identifies challenges and aspects of ANTS that cannot be modeled with ASSL. Therefore, an important contribution of this study is a critical analysis of ASSL as a specification language designed specifically for autonomic systems.
An Ajax-Based Terminology System for E-Learning 2.0
Authors: Xinchun Cui, Haiqing Wang, Zaihui Cao
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

This paper presents the design, implementation and evaluation of a terminology system, which is an e-learning 2.0 community aiming to provide users timely and resultful help when they encounter a new term in their e-learning. It consists of term display module, term add module, term modify module and term query module. By introducing Ajax technology, it outgoes other terminology systems by better interaction, higher efficiency and prompt revisability.
Power Control in WLANs for Optimization of Social Fairness
Authors: Vaggelis G. Douros, Pantelis A. Frangoudis, Konstantinos Katsaros, George C. Polyzos
Venue: Proceedings of the 2008 Panhellenic Conference on Informatics (2008)

Wide deployment of Wireless Local Area Networks (WLANs), especially in modern densely-populated metropolitan areas, constitutes a leap towards ubiquitous wireless network access. This is largely attributable to their low installation and operational cost and mainly their operation in unlicensed bands. Together with the clear benefits of increased WLAN coverage though, new challenges have emerged; dense WLAN deployments lead to significant interference among neighbor networks, making its mitigation a matter of crucial importance for their performance. To this end, transmission power control is a natural choice to limit interference. In this paper, we propose and evaluate two algorithms (FirstMax and BestMax) for WLAN Access Points (APs) to cooperatively control their transmission power levels, leading to more fair and more efficient spectrum usage. Simulations demonstrate that the proposed algorithms (and especially BestMax) are far more profitable and fair choices than transmitting at the maximum feasible power. Consequently, an optimization of the social fairness can be achieved.
Effects of Varied Human Movement Control on Task Performance and Feeling of Telepresence
Authors: Helena Pongrac, Angelika Peer, Berthold Färber, Martin Buss
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

In a telemanipulation system a human operator controls a remotely located teleoperator by a human system interface. In this work the effects of varied human movement control on task performance and feeling of telepresence by using such systems are analyzed. While it is well known that humans are able to coordinate and integrate multiple degrees of freedom the focus of this work is on how humans utilize rotational degrees of freedom provided by a human system interface. For the analysis a telemanipulation experiment with varying freed degrees of freedom has been conducted. The results indicate that rotational movements are performed intuitively by the human operator without considering the efficiency of task performance.
A New Denoising Approach for Sound Signals Based on Non-negative Sparse Coding of Power Spectra
Authors: Li Shang, Fengwen Cao, Jinfeng Zhang
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

In this paper, a novel sound denoising approach based on a statistical model of the power spectrogram of a sound signal is proposed by using an extended non-negative sparse coding (NNSC) algorithm for power spectra. This approach is self-adaptive to the statistic property of spectrograms of sounds. The basic idea for denoising is to exploit a shrinkage function to reduce noises in spectrogram patches. Experimental results show that our approach is indeed effective and efficient in spectrogram denoising. Compared with other denoising methods, the simulation results show that the NNSC shrinkage technique is indeed effective and efficient.