ppxscal/embedding_network huggingface dataset:
SAGE-LITE: An Intelligent Light-Weight Multi-agent System
Authors: Sana Farooq, Aqsa Bajwa, Sana Khalique, Obaid Malik, Hiroki Suguri, Hafiz Farooq Ahmad, Arshad Ali
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

The contemporary expansion of software platform for handheld devices, such as J2ME, has broadened application perspectives in this area. It is becoming more and more popular around the globe. Escalation in the use of lightweight devices and PDA s leads us to create a solid base for future nomadic applications, positioned in a changing environment. Intelligent agents are the program that carry out task on behalf of the user and apply some degree of intelligence to the task by interacting with other agents. The intelligence may be pretty minimal but often will include some degree of learning from past experience. SAGE-Lite is a lightweight context aware multi-agent system which senses the capabilities of the light-weight devices and reacts accordingly. It enhances the capabilities of existing system-SAGE and makes it compatible with a vast variety of currently available lightweight devices through its intelligent agents. When agents supporting nomadic users are developed, optimization of agent communication for wireless environment is one of the key issues. This paper addresses the issues of wireless environment and gives the detailed design of context-aware light-weight multi-agent system. The system has the ability to sense the capabilities of the devices in the given context and react accordingly. As the system is based on the latest FIPA specifications, agent uses the FIPA-ACL for communication and bit-efficient protocol for encoding and decoding of ACL message.
State of the Art and Practice of OpenSource Component Integration
Authors: Janne Merilinna, Mari Matinlassi
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

The open source software (OSS) development approach has become a remarkable option to consider for cost-efficient, high quality software development. Utilizing OSS as part of an in-house software application requires the software company to take the role of a component integrator. In addition, integrating OSS as part of in-house software has a few differences compared to integrating closed source software and in-house software, such as access to source code and the fact that OSS evolves differently than closed source software. This paper describes the current state of the art and practice of open source integration techniques. The main observations are that the lack of documentation and heterogeneity of platforms are problems that neither the state of the art or practice could solve. In addition, although literature provides techniques and methods for predicting and solving both architecture and component level integration problems, these were not used in practice. Instead, companies relied on experience and rules of thumb.
Generating Optimal Test Set for Neighbor Factors Combinatorial Testing
Authors: Nie Changhai, Xu Baowen, Wang Ziyuan, Shi Liang
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

Combinatorial testing is a specification-based testing method, which can detect the faults triggered by interaction of factors. For one kind of software in which the interactions only exist between neighbor factors, this paper proposes the concept of neighbor factors combinatorial testing, presents the covering array generation algorithms for neighbor factors pair-wise (N=2) coverage, neighbor factors N-way (N\geqslant2) coverage and variable strength neighbor factors coverage, and proves that the covering arrays generated by these three algorithms are optimal. Finally we analyze an application scenario, which shows that this approach is very practical.
A Dissociation between the Representation of Tool-use Skills and Hand Dominance: Insights from Left- and Right-handed Callosotomy Patients
Authors: Scott H. Frey, Margaret G. Funnell, Valerie E. Gerry, Michael S. Gazzaniga
Venue: Journal of Cognitive Neuroscience (2005)

The overwhelming majority of evidence indicates that the left cerebral hemisphere of right-handed humans is dominant both for manual control and the representation of acquired skills, including tool use. It is, however, unclear whether these functions involve common or dissociable mechanisms. Here we demonstrate that the disconnected left hemispheres of both right- and left-handed split-brain patients are specialized for representing acquired tool-use skills. When required to pantomime actions associated with familiar tools (Experiment 2), both patients show a right-hand (left hemisphere) advantage in response to tool names, pictures, and actual objects. Accuracy decreases as stimuli become increasingly symbolic when using the left hand (right hemisphere). Tested in isolation with lateralized pictures (Experiment 3), each patient's left hemisphere demonstrates a significant advantage over the right hemisphere for pantomiming tool-use actions with the contralateral hand. The fact that this asymmetry occurs even in a left-handed patient suggests that the left hemisphere specialization for representing praxis skills can be dissociated from mechanisms involved in hand dominance located in the right hemisphere. This effect is not attributable to differences at the conceptual level, as the left and right hemispheres are equally and highly competent at associating tools with observed pantomimes (Experiment 4).
Adapting the Hypermedia Structure in a Generic Multimedia Adaptation Framework
Authors: Sebastien Laborie, Jerome Euzenat
Venue: Proceedings of the First International Workshop on Semantic Media Adaptation and Personalization (2006)

The multiplication of execution contexts for multimedia documents requires the adaptation of document specifications. We proposed a semantic approach for multimedia document adaptation. This paper extends this framework to the hypermedia dimension of multimedia documents, i.e., hypermedia links between multimedia objects. By considering hypermedia links as particular objects of the document, it is possible to adapt the hypermedia dimension with other dimensions like the temporal one. However, due to the hypermedia structure, several specifications have to be considered. Thus, to preserve our adaptation framework, we propose a first straightforward strategy that consists of adapting all specifications generated by the hypermedia structure. However, we show that this one has several drawbacks, e.g., its high computational costs. Hence, we propose to adapt document specifications step by step according to the user interactions.
Correspondence-Free Determination of the Affine Fundamental Matrix
Authors: Stefan Lehmann, Andrew P. Bradley, I. Vaughan L. Clarkson, John Williams, Peter J. Kootsookos
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

Fundamental matrix estimation is a central problem in computer vision and forms the basis of tasks such as stereo imaging and structure from motion. Existing algorithms typically analyze the relative geometries of matched feature points identified in both projected views. Automated feature matching is itself a challenging problem. Results typically have a large number of false matches. Traditional fundamental matrix estimation methods are very sensitive to matching errors, which led naturally to the application of robust statistical estimation techniques to the problem. In this work, an entirely novel approach is proposed to the fundamental matrix estimation problem. Instead of analyzing the geometry of matched feature points, the problem is recast in the frequency domain through the use of Integral Projection, showing how this is a reasonable model for orthographic cameras. The problem now reduces to one of identifying matching lines in the frequency domain which, most importantly, requires no feature matching or correspondence information. Experimental results on both real and synthetic data are presented that demonstrate the algorithm is a practical technique for fundamental matrix estimation. The behavior of the proposed algorithm is additionally characterized with respect to input noise, feature counts, and other parameters of interest.
A flocking based algorithm for document clustering analysis
Authors: Xiaohui Cui, Jinzhu Gao, Thomas E. Potok
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2006)

Social animals or insects in nature often exhibit a form of emergent collective behavior known as flocking. In this paper, we present a novel Flocking based approach for document clustering analysis. Our Flocking clustering algorithm uses stochastic and heuristic principles discovered from observing bird flocks or fish schools. Unlike other partition clustering algorithm such as K-means, the Flocking based algorithm does not require initial partitional seeds. The algorithm generates a clustering of a given set of data through the embedding of the high-dimensional data items on a two-dimensional grid for easy clustering result retrieval and visualization. Inspired by the self-organized behavior of bird flocks, we represent each document object with a flock boid. The simple local rules followed by each flock boid result in the entire document flock generating complex global behaviors, which eventually result in a clustering of the documents. We evaluate the efficiency of our algorithm with both a synthetic dataset and a real document collection that includes 100 news articles collected from the Internet. Our results show that the Flocking clustering algorithm achieves better performance compared to the K- means and the Ant clustering algorithm for real document clustering.
Transformation model estimation of image registration via least square support vector machines
Authors: DaiQiang Peng, Jian Liu, JinWen Tian, Sheng Zheng
Venue: Pattern Recognition Letters (2006)

This paper describes a new approach to the determination of a mapping function from given coordinates of control points based on least square support vector machines (LS-SVM). An interesting property of this approach is that it constitutes a practical implementation of the structural risk minimization (SRM) principle that aims at minimizing a bound on the generalization error of a model, rather than minimizing the mean square error over control points. Computer simulation results indicate that this new approach can remove geometric deformation and adapt to correct the errors induced by inaccuracy location of control points.
Patterns of Bimanual Interference Reveal Movement Encoding within a Radial Egocentric Reference Frame
Authors: Stephan P. Swinnen, Natalia Dounskaia, Jacques Duysens
Venue: Journal of Cognitive Neuroscience (2002)

Constraints on interlimb coordination have been studied intensively in past years with a primary focus on temporal features. The present study addressed spatial constraints or the degree of directional interference as a function of different line combinations between the upper limbs as well as the modulation of this interference as a result of different board orientations within the performer's workspace. This paradigm was used to address a prominent theme in motor neuroscience, namely whether (bimanual) movements are encoded within an allocentric reference frame (pattern of interference invariant with respect to extrinsic space) or within an egocentric reference frame (pattern of interference invariant relative to the center of the performer's action space, i.e., intrinsic). The observed patterns of interference revealed that movements are primarily encoded within a radial egocentric reference frame in which the performer is the center of action space. The present psychophysical findings converge with primate single-cell recording studies in which the direction has been identified as a primary movement parameter that is encoded in various brain regions, thereby constituting a principal determinant of bilateral interference.
A Visualization Model for Web Sitemaps
Authors: Quang Vinh Nguyen, Mao Lin Huang, Kang Zhang, I-Ling Yen
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

This paper describes a space-efficient visualization model that automatically crawls through a website and visualizes its sitemap. This model can be used especially for displaying and navigating a very large website in a two-dimensional (2D) plane and/or a three-dimensional (3D) space. The 2D visualization employs EncCon layout algorithm to effectively visualize a very large number of pages and relations at once in which it utilizes the space to display more information. This technique also employs a focus+context navigation method to enable the exploration of large sites. Animation is provided to preserve the user's mental map while exploring the website hierarchy. The 3D visualization extends the 2D EncCon layout algorithm to a three-dimensional space which aims to provide a more realistic look and feel of the information.
Integration study of prospective hazards models for the enhancement of a virtual range simulation model
Authors: Serge N. Sala-Diakanda, Luis Rabelo, Sergio A. Rosales, Luis F. Robledo, Jose A. Sepúlveda, Jeppie Compton
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper describes our progresses toward enhancing a Virtual Range (VR) for space launch modeling capability. The VR discussed in this paper is a range safety simulation environment. It is capable of determining the expectation of casualties (Ec) resulting from the toxic effects of gas dispersion caused by a failed space launch and subsequent explosion (accidental or instructed) of a spacecraft (the Space Shuttle in this instance) shortly after liftoff. In addition to the above, we are currently rendering the VR capable of also determining the Ec resulting from falling debris and blast overpressure propagation, which are the others two major hazards resulting from a spacecraft explosion. We also investigate two data fusion approaches to estimate the Ec resulting from the combined effects of the three hazards mentioned above, as their effects may not necessarily be independent of each other.
DynaQ - Dynamic Queries for Electronic Document Management
Authors: Stefan Agne, Christian Reuschling, Andreas Dengel
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

In this paper, we present DynaQ, our prototypical inquiry system to explore the personal information space that supports the user with the help of the searching paradigm Orienteering, achieved by using dynamic queries. Orienteering is typically characterized by relatively small steps following one after another. In contrast to searching through keywords, Orienteering offers several advantages: reduction of cognitive load, sensitivity of the environment, and a better understanding of the results. Dynamic Queries enables the user to specify search queries in a dynamic way to get immediate feedback on changes inside data sets that fulfill the query criteria.
Verblunsky coefficients with Coulomb-type decay
Authors: David Damanik
Venue: Journal of Approximation Theory (2006)

We show that probability measures on the unit circle associated with Verblunsky coefficients obeying a Coulomb-type decay estimate have no singular continuous component.
Shape Recognition and Retrieval Using String of Symbols
Authors: Mohammad Reza Daliri, Vincent Torre
Venue: Proceedings of the 5th International Conference on Machine Learning and Applications (2006)

In this paper we present two algorithms for shape recognition. Both algorithms map the contour of the shape to be recognized into a string of symbols. The first algorithm is based on supervised learning using string kernels as often used for text categorization and classification. The second algorithm is very weakly supervised and is based on the Procrustes analysis and on the Edit distance used for computing the similarity between strings of symbols. The second algorithm correctly recognizes 98.29 % of shapes from the MPEG-7 database, i.e. better than any previous algorithms. The second algorithm is able also to retrieve similar shapes from a database.
Throughput scalability of wireless hybrid networks over a random geometric graph
Authors: Ulas C. Kozat, Leandros Tassiulas
Venue: Wireless Networks (2005)

In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a network architecture allows ad hoc nodes to communicate with each other by purely using the remaining ad hoc nodes as their relays. In addition, ad hoc nodes can also utilize the existing infrastructure fully or partially by reaching any access point (or gateway) of the infrastructure network in a single or multi-hop fashion. Using the same tools as in [9], we show that the per source node capacity of Θ(W/log(N)) can be achieved in a random network scenario with the following assumptions: (i) The number of ad hoc nodes per access point is bounded above, (ii) each wireless node, including the access points, is able to transmit at W bits/sec using a fixed transmission range, and (iii) N ad hoc nodes, excluding the access points, constitute a connected topology graph. This is a significant improvement over the capacity of random ad hoc networks with no infrastructure support which is found as Θ(W/√Nlog(N)) in [9]. We also show that even when less stringent requirements are imposed on topology connectivity, a per source node capacity figure that is arbitrarily close to Θ(1) cannot be obtained. Nevertheless, under these weak conditions, we can further improve per node throughput significantly. We also provide a limited extension on our results when the number of ad hoc nodes per access point is not bounded.
Error criteria analysis and robust data fusion
Authors: Xing Li, Weiru Fang, Qi Tian
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

Except the well-known least mean square error criterion which results in the arithmetic mean operation and the mean absolute value criterion which results in the median operation, other nonlinear operations have not been extensively studied in terms of error criteria in the existing literature. In this paper, the error criteria of the harmonic mean, geometric mean, as well as some other nonlinear operations have been derived. Both simulation and experimental data presented in this paper indicate that these nonlinear operations are more robust than that of the linear arithmetic mean. Therefore, the error criteria analysis method can be used as a general guide line for designing the most appropriate operations for the robust fusion problems.
ISAMadapt: abstractions and tools for designing general-purpose pervasive applications: Experiences with Auto-adaptive and Reconfigurable Systems
Authors: I. Augustin, A. C. Yamin, L. C. da Silva, R. A. Real, G. Frainer, C. F. R. Geyer
Venue: Software&mdash;Practice Experience (2006)

The concept of pervasiveness provides the future of computing with an attractive perspective. However, software support for physical and logical mobility raises a set of new requirements and challenges for software production, creating demand for new types of applications, the so-called pervasive applications, which express follow-me semantics. The core of these challenges is a dynamic operating environment, which originates with the users' movement in different terminals and locations, and determines different execution contexts. For this envision to become a reality, developers must build applications that constantly adapt to a highly dynamic computing environment. Research works in pervasive computing have already addressed important issues, but they do not approach the problem of how to program general-purpose pervasive systems. Pervasive applications are distributed, mobile, adaptive and consider context as a first-order concept. To make the developers' task easier, we have introduced the software architecture called ISAM, which provides an integrated environment aimed at building pervasive applications composed of a development environment and an execution middleware. As part of our study within the ISAM project, we have been investigating how context-awareness can be expressed at the programming language level with a basis on four main abstractions: context, adapters, adaptation commands, and adaptive behavior management policies. This paper introduces such abstractions, and presents some development and management tools anchored on an example application, which is under development. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Latency and Energy Efficient MAC (LEEMAC) Protocol for Event Critical Applications in WSNs
Authors: Syed Waqar Hussain, Tashfeen Khan, S. M. H. Zaidi
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

Wireless sensor networks are appealing to researchers due to their wide range of application potential in areas such as target detection and tracking, environmental monitoring, industrial process monitoring, and tactical systems. However, lower sensing ranges result in dense networks, which bring the necessity to achieve an efficient medium access protocol subject to power constraints. Various MAC protocols with different objectives were proposed for wireless sensor networks. The paper focused mainly on latency issue for event critical applications. In this paper, we propose LEEMAC, a Latency and Energy Efficient MAC Protocol which is an improvement of DMAC protocol in a sense that it gives us better latency and a slight improvement in energy efficiency than by DMAC which was designed and optimized for data gathering trees where data is collected from all the source nodes to the sink node. The paper first outlines the sensor network properties that are crucial for the design of MAC layer protocols. Then, we discussed briefly DMAC protocol with respect to the enhancements brought in LEEMAC. Then data modeling results are shown to compare the latency and energy for DMAC and LEEMAC protocols. Finally, we point out open research issues on MAC layer design.
Group Work and Role Rotation using a Learning Management System in a Japanese Computer Science University
Authors: John Brine, Deborah Turk
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

A learning management system (LMS) was implemented in six second-year technical reading classes in a Japanese computer science university. The LMS was used to organise and manage small groups of students. The small group structure and role rotation was intended to recreate a learning context familiar to Japanese students from previous public education. Thus we attempted to implement an LMS consistent with cultural learning practices. The function of the LMS and difficulties with the software are described. Recognition of the cultural learning practices in the design and implementation of learning management systems is intended to meet student needs and improve usability.