ppxscal/embedding_network huggingface dataset:
Pushing around the Locus of Selection: Evidence for the Flexible-selection Hypothesis
Authors: Edward K. Vogel, Geoffrey F. Woodman, Steven J. Luck
Venue: Journal of Cognitive Neuroscience (2005)

Attention operates at an early stage in some experimental paradigms and at a late stage in others, which suggests that the locus of selection is flexible. The present study was designed to determine whether the locus of selection can vary flexibly within a single experimental paradigm as a function of relatively modest variations in stimulus and task parameters. In the first experiment, a new method for assessing the locus of selection was developed. Specifically, attention can influence perceptual encoding only if it is directed to the target before a perceptual representation of the target has been formed, whereas attention can influence postperceptual processes even if attention is cued after perception is complete. Event-related potentials were used to confirm the validity of this method. The subsequent experiments used cueing tasks in which subjects were required to perceive and remember a set of objects, and the difficulty of the perception and memory components of the task were varied. When the task overloaded perception but not working memory, attention influenced the formation of perceptual representations but not the storage of these representations in memory; when the task overloaded working memory but not perception, attention influenced the transfer of perceptual representations into memory but not the formation of the perceptual representations. Thus, attention operates to select relevant information at whatever stage or stages of processing are overloaded by a particular stimulus&ndash;task combination.
Comment on "A new two-term relation for the 3F2 hypergeometric function of unit argument"
Authors: M. Milgram
Venue: Journal of Computational and Applied Mathematics (2006)

It is pointed out that Exton's "new two-term relation for the 3F2 hypergeometric function of unit argument" is actually well-known, and that the "new" summation formula obtained from it, is incorrect.
SVM learning of IP address structure for latency prediction
Authors: Robert Beverly, Karen Sollins, Arthur Berger
Venue: Proceedings of the 2006 SIGCOMM workshop on Mining network data (2006)

We examine the ability to exploit the hierarchical structure of Internet addresses in order to endow network agents with predictive capabilities. Specifically, we consider Support Vector Machines (SVMs) for prediction of round-trip latency to random network destinations the agent has not previously interacted with. We use kernel functions to transform the structured, yet fragmented and discontinuous, IP address space into a feature space amenable to SVMs. Our SVM approach is accurate, fast, suitable to on-line learning and generalizes well. SVM regression on a large, randomly collected data set of 30,000 Internet latencies yields a mean prediction error of 25ms using only 20% of the samples for training. Our results are promising for equipping end-nodes with intelligence for service selection, user-directed routing, resource scheduling and network inference. Finally, feature selection analysis finds that the eight most significant IP address bits provide surprisingly strong discriminative power.
Parallel Web Service Composition in MoSCoE: A Choreography-Based Approach
Authors: Jyotishman Pathak, Samik Basu, Robyn Lutz, Vasant Honavar
Venue: Proceedings of the European Conference on Web Services (2006)

We present a goal-driven approach to model a choreographer for realizing composite Web services. In this framework, the users start with an abstract, and possibly incomplete functional specification of a desired goal service. This specification is used to compose a choreographer that allows communication between the client and the set of available component services, and is functionally equivalent to the goal service. However, if such a composition cannot be realized, the proposed approach identifies the cause(s) for the failure of composition. This information can be used by the user to minimally reformulate the goal to reduce the 'gap' between the desired functionality. The process can be iterated until a feasible composition is realized or the user decides to abort. The approach ensures that (i) a choreographer, if one is produced by our composition algorithm, in fact realizes the user-specified goal functionality; and (ii) the algorithm is guaranteed to find a composition that meets the user needs as captured in the goal specifications (whenever such a composition exists).
Expressing Learning Scenarios with Computer Independent Models
Authors: Emmanuelle Villiot-Leclercq, Jean-Pierre David, Anne Lejeune
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Our research focuses on methodologies and models for helping teachers to become designers of their own educational scenarios in e-learning contexts. In this article, we propose a Computer Independent Model based on three formalisms for describing a scenario initially expressed as an informal text. The aim of this contribution is to provide teachers with appropriate tools that will later facilitate the translation of a learning scenario into a complete specification in view of its implementation on a learning platform.
Naive Bayes Web Page Classification with HTML Mark-Up Enrichment
Authors: Victor Fresno Fernandez, Raquel Martinez Unanue, Soto Montalvo Herranz, Arantza Casillas Rubio
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

In text and web page classification, Bayesian prior probabilities are usually based on term frequencies, term counts within a page and among all the pages. However, new approaches in web page representation use HTML mark-up information to find the term relevance in a web page. This paper presents a Na¨ýve Bayes web page classification system for these approaches.
Detecting MAC Layer Back-off Timer Violations in Mobile Ad Hoc Networks
Authors: Venkata Nishanth Lolla, Lap Kong Law, Srikanth V. Krishnamurthy, Chinya Ravishankar, Dharmaiah Manjunath
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

In IEEE 802.11 based ad hoc networks, by simply manipulating the back-off timers and/or wait times prior to transmission, malicious nodes can cause a drastically reduced allocation of bandwidth to well-behaved nodes. This can result in causing bandwidth starvation and hence, a denial of service to legitimate nodes. We propose a combination of deterministic and statistical methods that facilitate detection of such misbehavior. With our approach, each of the nodes is made aware of the pseudo-random sequences that dictate the back-off times of all its one-hop neighbors. A blatant violation of the timer is thus, immediately detected. In certain cases, a node may be unable to monitor the activities of its neighbor and therefore deterministically ascertain if the neighbor is misbehaving. To cope with such cases, we propose a statistical inference method, wherein based on an auto-regressive moving average (ARMA) of observations of the system state, a node is able to estimate if its neighbor is indulging in misbehavior. Simulation results show that with our methods, it is possible to detect a malicious node with a probability close to one. Furthermore, the probability of false alarms is lower than 1%.
Semi-supervised time series classification
Authors: Li Wei, Eamonn Keogh
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

The problem of time series classification has attracted great interest in the last decade. However current research assumes the existence of large amounts of labeled training data. In reality, such data may be very difficult or expensive to obtain. For example, it may require the time and expertise of cardiologists, space launch technicians, or other domain specialists. As in many other domains, there are often copious amounts of unlabeled data available. For example, the PhysioBank archive contains gigabytes of ECG data. In this work we propose a semi-supervised technique for building time series classifiers. While such algorithms are well known in text domains, we will show that special considerations must be made to make them both efficient and effective for the time series domain. We evaluate our work with a comprehensive set of experiments on diverse data sources including electrocardiograms, handwritten documents, and video datasets. The experimental results demonstrate that our approach requires only a handful of labeled examples to construct accurate classifiers.
A possible model of benzimidazole binding to β-tubulin disclosed by invoking an inter-domain movement
Authors: Mark W. Robinson, Neil McFerran, Alan Trudgett, Liz Hoey, Ian Fairweather
Venue: Journal of Molecular Graphics (2004)

Although it is well established that benzimidazole (BZMs) compounds exert their therapeutic effects through binding to helminth β tubulin and thus disrupting microtubule-based processes in the parasites, the precise location of the benzimidazole-binding site on the β-tubulin molecule has yet to be determined. In the present study, we have used previous experimental data as cues to help identify this site. Firstly, benzimidazole resistance has been correlated with a phenylalanine-to-tyrosine substitution at position 200 of Haemonchus contortus β-tubulin isotype-I. Secondly, site-directed mutagenesis studies, using fungi, have shown that other residues in this region of the protein can influence the interaction of benzimidazoles with β-tubulin. However, the atomic structure of the αβ-tubulin dimer shows that residue 200 and the other implicated residues are buried within the protein. This poses the question: how might benzimidazoles interact with these apparently inaccessible residues? In the present study, we present a mechanism by which those residues generally believed to interact with benzimidazoles may become accessible to the drugs. Furthermore, by docking albendazole-sulphoxide into a modelled H. contortus β-tubulin molecule we offer a structural explanation for how the mutation conferring benzimidazole resistance in nematodes may act, as well as a possible explanation for the species-specificity of benzimidazole anthelmintics.
InterJoin: Exploiting Indexes and Materialized Views in XPath Evaluation
Authors: Derek Phillips, Ning Zhang, Ihab F. Ilyas, M. Tamer Ozsu
Venue: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (2006)

XML has become the standard for data exchange for a wide variety of applications, particularly in the scientific community. In order to efficiently process queries on XML representations of scientific data, we require specialized techniques for evaluating XPath expressions. Exploiting materialized views in query processing significantly enhances query processing performance. We propose a novel view definition that allows for intermediate (structural) join results to be stored and reused in XML query evaluation. Unlike current XML view proposals, our views do not require navigation in the original document or path-based pattern matching. Hence, they are evaluated significantly faster and are easily costed as part of a query plan. In general, current structural joins can not exploit views efficiently when the view definition is not a prefix (or a suffix) of the XPath query. To increase the applicability of our proposed view definition, we propose a novel physical structural join operator called InterJoin. The InterJoin operator allows for joining interleaving XPath expressions, e.g., joining //A//C with //B to evaluate //A//B//C. InterJoin allows for more join alternatives in XML query plans. We propose several physical implementations for InterJoin, including a technique to exploit spatial indexes on the inputs. We give analytic cost models for the implementations so they can be costed in an existing XML query optimizer. Experiments on real and synthetic XML data show significant speed-ups of up to 200% using InterJoin, and speed-ups of up to 400% using our materialized views.
Requirements on the Use of Goal-Directed Imitation for Self-Adaptation
Authors: Marcel Hiel, Hans Weigand
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Imitation is a powerful mechanism in human society, and has proven its usefulness in machine learning. This paper describes the notion of goal-directed imitation and its possible role in realizing self-adaptive systems. The conditions for its application are analyzed. We illustrate the working of imitation in self-adaptation by means of a small example.
Relational databases and homogeneity in logics with counting
Authors: José María Turull Torres
Venue: Acta Cybernetica (2006)

We define a new hierarchy in the class of computable queries to relational databases, in terms of the preservation of equality of theories in fragments of first order logic with bounded number of variables with the addition of counting quantiflers (Ck). We prove that the hierarchy is strict, and it turns out that it is orthogonal to the TIME-SPACE hierarchy defined with respect to the Turing machine complexity. We introduce a model of computation of queries to characterize the different layers of our hierarchy which is based on the reflective relational machine of S. Abiteboul, C. Papadimitriou, and V. Vianu. In our model the databases are represented by their Ck theories. Then we define and study several properties of databases related to homogeneity in Ck getting various results on the change in the computation power of the introduced machine, when working on classes of databases with such properties. We study the relation between our hierarchy and a similar one which we defined in a previous work, in terms of the preservation of equality of theories in fragments of first order logic with bounded number of variables, but without counting quantifiers (FOk). Finally, we give a characterization of the layers of the two hierarchies in terms of the infinitary logics C∞ωk and L∞ωk, respectively.
Active Feedback Vibration Suppression of a Flexible Steel Cantilever Beam Using Smart Materials
Authors: Juntao Fei, Yunmei Fang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Considerable attentions have been devoted recently to active vibration control using intelligent materials as actuators. This paper presents results on active control schemes for vibration suppression of flexible steel cantilever beam with bonded piezoelectric actuators. The PZT patches are surface-bonded near the fixed end of flexible steel cantilever beam. Active vibration control methods such as strain rate feedback control (SRF) and positive position feedback control (PPF) are investigated and implemented using xPC Target real-time system. Experimental results demonstrate that the SRF control and PPF control achieve effective vibration suppression results of steel cantilever beam.
Adaptive Inner-Loop Rover Control
Authors: Nilesh Kulkarni, Corey Ippolito, Kalmanje Krishnakumar, Khalid M. Al-Ali
Venue: Proceedings of the 2nd IEEE International Conference on Space Mission Challenges for Information Technology (2006)

Adaptive control technology is developed for the inner-loop speed and steering control of the MAX Rover. MAX, a CMU developed Rover, is a compact low-cost 4-wheel drive, 4-wheel steer (double Ackerman), with high-clearance agile durable chassis. It is outfitted with sensors and electronics that make it ideally suited for supporting research relevant to intelligent tele-operation, and as a low-cost autonomous robotic test bed and appliance. The control design consists of a feedback linearization based controller with a proportional-integral (PI) feedback that is augmented by an online adaptive neural network. The adaptation law has guaranteed stability properties for safe operation. The control design is retrofit in nature so that it fits below the outer-loop path planning algorithms. Successful hardware implementation of the controller is illustrated for several scenarios consisting of actuator failures and modeling errors in the nominal design.
Human-computer interaction closes the digital divide: a multicultural, intergenerational ICT case study
Authors: Elspeth McKay
Venue: Proceedings of the 2005 South East Asia Regional Computer Science Confederation (SEARCC) Conference - Volume 46 (2005)

Ethnic and racial tensions are aggravated by social inequities. The media unwittingly feeds this dilema. Look at how often we are directed to the internet for further information. While exploring the internet may be easier for some computer users, others demonstrate a complete avoidance for this type of knowledge exchange. Misunderstandings that occur between cultural communities may be exacerbated by the digital divide through lack of access, for whatever reason, causing a meaningful gap in cultural differences, and henceforth leading to serious communication breakdowns. This paper argues for more research on measuring the effectiveness of increased opportunities for Web-mediated cross-cultural/intergenerational knowledge sharing that is designed to overcome the ever widening digital divide.
A programming-by-demonstration tool for retargeting instructional systems
Authors: Steven Ritter, Stephen B. Blessing
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

Although intelligent learning environments have proven to be successful instructional tools, they have seen little commercial success. Part of the problem has been the difficulty of authoring them, even using authoring tools specialized to the task. We argue that the authoring task can be redefined for environments based on the "plug-in" instructional architecture described by Ritter and Koedinger (1995). In systems using that architecture, specialized authoring tools can be developed for each component of the architecture, greatly simplifying both the authoring process and the task of creating authoring tools. We describe an authoring tool directed at creating the "translator" portion of such an architecture. This authoring tool uses programming by demonstration to allow a non-programmer to re-use existing tutoring agents with new interface tools.
Research of Chaos Encryption Algorithm Based on Logistic Mapping
Authors: Jinhong Luo, Haiyi Shi
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

With the development of network technique and the increasing frequency of information exchange, the research of information security technique is getting more and more important. As a special nonlinear phenomenon, chaos has many properties worthy to be applied. Chaos cryptogram has a considerable advantage in the encryption of multimedia information. Basing on the character that most information on the Internet today is transmitted in the form of stream and transferred from the initial crunode to other crunodes in the form of one dimension data in the sequence of plain message ,we propose to adjust the corresponding sequence of key encryption and plain message to improve anti-decryption greatly and shows its merits and demerits by analyzing this arithmetic.
Learning science by participating in design: a case where multiple design subgoals interfere with systematic progress
Authors: Eli M. Silk, Christian D. Schunn
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Two contrasting teams were analyzed qualitatively in a science unit in which students collaborate in teams to learn science concepts through a design project. The unit was focused on learning concepts of electricity by designing an electronic alarm system. The difference in the success of one of the teams to learn the science content can be attributed to their ability to focus systematic efforts on exploring one lower-level design goal at a time.
The impact of the display type and content to a game adaptation
Authors: Jari Takatalo, Jukka Häkkinen, Jeppe Komulainen, Heikki Särkelä, Göte Nyman
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

This study examines the impact of the display type (form) and content (game) to the PC-game adaptation. An ordinary tabletop display (cathode ray tube; CRT) and a near-eye display (NED) suitable for mobile gaming are compared in two different driving games. A measurement model based on a large dataset (n=2182) is applied to study psychological aspects of the game adaptation. This model integrates two constructs considered important for the game adaptation: involvement and presence. The results show that the content affected the subjective sense of presence. However, the form did not have an effect on the presence. These results indicate that NED's are capable of supporting similar adaptation to the game worlds as compared to CRT's. However, the results also weakly indicate that playing with a CRT increases the evaluations of interaction. The study shows the advantages of using multidimensional measures in studying a rich human-computer interaction.
Are GSM Phones THE Solution for Localization?
Authors: Alex Varshavsky
Venue: Proceedings of the Seventh IEEE Workshop on Mobile Computing Systems & Applications (2006)

In this paper, we argue that localization solution based on cellular phone technology, specifically GSM phones, is a sufficient and attractive option in terms of coverage and accuracy for a wide range of indoor, outdoor, and placebased location-aware applications. We present preliminary results that indicate that GSM-based localization systems have the potential to detect the places that people visit in their everyday lives, and can achieve median localization accuracies of 5 and 75 meters for indoor and outdoor environments, respectively.
Service Monitoring and Management on Multicore Platforms
Authors: Kwei-Jay Lin, Shih-Wei Liao
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

With the trend of platformization and the advent of multicore processors, we need to extend the traditional resource modeling in Service-Oriented Infrastructure to enable a better adoption of platform-level features such as multicores. For service processes that are run on multiple servers, each on a multicore architecture, an end-to-end approach should be used to ensure a consistent QoS from all service components. In this paper, we propose an end-to-end QoS management architecture for coordinating the performances of service components. Our research considers modern performance enhancing technologies, namely, multicore and virtualization, and proposes an angel thread mechanism to manage service QoS. We also study scheduling approaches for the architecture.
Semantic Annotation of Software Components
Authors: Peter Graubmann, Mikhail Roshchin
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

The aim of this contribution is to present concepts and to propose techniques and a methodical support for automated software composition using "rich" semantic descriptions of components and services which we call annotations. Our approach is based upon a Component Description Reference Model for which both, semantic description patterns and inference mechanisms are defined. They offer variability in expressiveness, reasoning power and the required analysis depth for the identification of component properties and qualities. The approach comprises two major concepts -Logic-on-Demand and the Triple Semantic Model. They both turn out to be essential for the entire modelling process and, in particular for the automated reasoning techniques based on semantic annotations.