ppxscal/embedding_network huggingface dataset:
Full immersive virtual environment CAVETM in chemistry education
Authors: Maria Limniou, David Roberts, Nikos Papadopoulos
Venue: Computers Education (2008)

By comparing two-dimensional (2D) chemical animations designed for computer's desktop with three-dimensional (3D) chemical animations designed for the full immersive virtual reality environment CAVE^T^M we studied how virtual reality environments could raise student's interest and motivation for learning. By using the 3ds max^T^M, we can visualize the chemical phenomena easily and quickly without knowing any special computer language and export the application to files which are compatible with the CAVE^T^M (Object or OpenGL files). After the participation in 3D animations at the CAVE^T^M students comprehended the molecules' structure and their changes during a chemical reaction better than during the 2D animations on the computer's desktop, as the limitations of human vision had been overcome. Furthermore, the students were enthusiastic, as they had the feeling that they were inside the chemical reactions and they were facing the 3D molecules as if they were real objects front of them.
Experiments with Analogy-X for Software Cost Estimation
Authors: Jacky Keung, Barbara Kitchenham
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

We developed a novel method called Analogy-X to provide statistical inference procedures for analogy-based software effort estimation. Analogy-X is a method to statistically evaluate the relationship between useful project features and target features such as effort to be estimated, which ensures the dataset used is relevant to the prediction problem, and project features are selected based on their statistical contribution to the target variables. We hypothesize that this method can be (1) easily applied to a much larger dataset, and (2) also it can be used for incorporating joint effort and duration estimation into analogy, which was not previously possible with conventional analogy estimation. To test these two hypotheses, we conducted two experiments using different datasets. Our results show that Analogy-X is able to deal with ultra large datasets effectively and provides useful statistics to assess the quality of the dataset. In addition, our results show that feature selection for duration estimation differs from feature selection for joint-effort duration estimation. We conclude Analogy-X allows users to assess the best procedure for estimating duration given their specific requirements and dataset.
Determinant of mixed matrices: the analog notion of convex geometry notion of volume of mixed bodies
Authors: Poramate Pranayanuntana, Patcharin Hemchote
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

We discuss the use of the Aleksandrov inequality for matrices. This inequality is a matrix version of the Aleksandrov-Fenchel inequality of convexity theory. The Aleksandrov-Fenchel inequality can be used to derive a number of other useful inequalities, among them the Minkowski inequality. By applying the Aleksandrov inequality to mixed determinants and determinants of mixed matrices, we obtain some important results analogous to those in convex geometry.
An Improved Fisheye Zoom Algorithm for Visualizing and Editing Hierarchical Models
Authors: Tobias Reinhard, Silvio Meier, Martin Glinz
Venue: Proceedings of the Second International Workshop on Requirements Engineering Visualization (2007)

Hierarchical decomposition is an important means for organizing and understanding large requirements and design models. Fisheye zoom visualization is an attractive means for viewing, navigating and editing such hierarchical models, because local detail and its surrounding global context can be displayed in a single view. However, existing fisheye view approaches have deficiencies in terms of layout stability when model nodes are zoomed-in and zoomed-out. Furthermore, most of them do not support model editing (moving, adding and deleting nodes) well. In this paper, we present an improved fisheye zoom algorithm which supports viewing and manipulating hierarchical models. Our algorithm solves the problem of having a user-editable layout which is nevertheless stable under multiple zooming operations. Furthermore, it supports multiple focal points, and runs in real-time.
Agent clustering based on semantic negotiation
Authors: Salvatore Garruzzo, Domenico Rosaci
Venue: ACM Transactions on Autonomous and Adaptive Systems (TAAS) (2008)

Forming groups of agents is an important task in many agent-based applications, for example when determining a coalition of buyers in an e-commerce community or organizing different Web services in a Web services' composition. A key issue in this context is that of generating groups of agents such that the communication among agents of the same group is not subjected to comprehension problems. To this purpose, several approaches have been proposed in the past in order to form groups of agents based on some similarity measures among agents. Such similarity measures are mainly based on lexical and/or structural similarities among agent ontologies. However, the necessity of taking into account a semantic component of the similarity value arises, for example by considering the context in which a term is used in an agent ontology. Therefore we propose a clustering technique based on the HISENE semantic negotiation protocol, using a similarity value that has lexical, structural and semantic components. Moreover, we introduce a suitable multiagent architecture that allows computing agent similarities by means of an efficient distributed approach.
Investigating test-and-fix processes of incremental development using hybrid process simulation
Authors: He Zhang, Ross Jeffery, Liming Zhu
Venue: Proceedings of the 6th international workshop on Software quality (2008)

Software process modeling has become an essential technique for managing, investigating and improving software development processes. In this area, hybrid process simulation modeling attracts an increasing research attention. This paper presents a new hybrid software process model to investigate the test-and-fix process of incremental development. Its novelty comes from its flexible model structure that focuses on the particular portion of software process by using different modeling techniques on separate but interconnected phases in incremental development. Simulation results conclude that this model can support the investigation of portions of incremental development life cycle at different granularity levels simultaneously. It also allows the tradeoff analysis and optimization of test-and-fix process, while avoids the limitation caused by incomplete process detail of other phases.
Electroactive Polymers for Robotic Applications: Artificial Muscles and Sensors, 1 edition
Authors: Kwang J. Kim, Satoshi Tadokoro
Venue:  (2007)

Electroactive polymers (EAPs) respond to electrical stimulation with large deformations. They are dynamic actuators which have attracted attention from an interdisciplinary audience of engineers and scientists. An enabling EAP technology is emerging which attempts to imitate the properties of natural muscle and which, as a result, can perform a unique function in a variety of biologically-inspired robotics applications. Electroactive Polymers for Robotics Applications covers the fundamental properties, modelling and demonstration of EAPs in robotic applications, focusing particularly on artificial muscles and sensors. Ionic PolymerMetal Composite Actuators and Dielectric Elastomers are discussed within the book with chapters on their properties and their uses in robotics applications. With its concentration on devices based on EAPs and their uses, Electroactive Polymers for Robotics Applications will be of interest to researchers working within this field as well as to postgraduate students studying robotics or smart materials and structures. Practitioners working in the mechanical, electrical and materials industries will also find this book of value.
New Frontiers of Microcontroller Education: Introducing SiLabs ToolStick University Daughter Card
Authors: Gourab Sen Gupta, Chew Moi Tin
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

Educational support available is an important criterion for selecting a microcontroller for teaching embedded programming in an under graduate university course. The paper presents and discusses two things - first the criteria employed to choose a microcontroller that has been used as the base for teaching the undergraduate course on Design for Computer & Communication Systems at Massey University, New Zealand and second the design and development of an 'expansion board' which can be used in conjunction with the microcontroller development board to do meaningful experiments. The expansion board has many peripheral resources. Silicon Labs Inc, USA has amalgamated the microcontroller development board and the 'expansion board' to create a versatile University daughter card which is detailed in the paper. Software implementation of instruments and displays, such as oscilloscope and LCD, has eliminated the need to use bench top lab instruments. The introduction of the Silabs University Daughter card has helped to substantially increase the standard and completion rates of final year projects.
A smoothing algorithm for time slicing DVB-H video transmission with bandwidth constraints
Authors: Pietro Camarda, Giovanni Tommaso Carone, Domenico Striccoli
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

DVB-H transmission is assuming an ever growing importance for multimedia data delivery to hand-held terminals of reduced size and limited battery capacities. To minimize terminals power consumption, DVB-H systems adopt a time sliced transmission in bursts. In such a context, in this paper a new smoothing algorithm, the Smoothing Algorithm of the Burst (SAB), suitable for the transmission of multimedia streams with high bit rate variability, has been proposed and analyzed. Such an algorithm takes into account receiving buffer size, burst size and available bandwidth variability to reschedule data transmission, with the target to minimize the percentage of loss due to bandwidth and buffer limitations. Numerical results obtained by simulation show the improved performance of SAB compared with the usual unsmoothed data transmission in bursts. SAB can thus be utilized to transmit video streams with higher bit rate and better quality than actually considered in DVB-H systems.
A network approach for specially structured linear programs arising in 0-1 quadratic optimization
Authors: Warren P. Adams, Paul T. Hadavas
Venue: Discrete Applied Mathematics (2008)

Reformulation techniques are commonly used to transform 0-1 quadratic problems into equivalent, mixed 0-1 linear programs. A classical strategy is to replace each quadratic term with a continuous variable and to enforce, for each such product, four linear inequalities that ensure the continuous variable equals the associated product. By employing a transformation of variables, we show how such inequalities give rise to a network structure, so that the continuous relaxations can be readily solved. This work unifies and extends related results for the vertex packing problem and relatives, and roof duality.
Challenges of MPI over IPv6
Authors: Adrian Knoth, Christian Kauhaus, Dietmar Fey, Lars Schneidenbach, Bettina Schnor
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

The Message Passing Interface (MPI) is the most widely used message passing library for parallel applications on compute clusters. Here, we present our experiences in developing an IPv6 enabled MPI version for both most popular implementations, the MPICH2 and the Open MPI implementations. Further, we discuss how these IPv6 enabled MPI implementations can be used within multi-cluster and Grid topologies.
Undirected connectivity in O(log/sup 1.5/n) space
Authors: N. Nisan
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors present a deterministic algorithm for the connectivity problem on undirected graphs that runs in O(log/sup 1.5/n) space. Thus, the recursive doubling technique of Savich (1970) which requires Theta (log/sup 2/n) space is not optimal for this problem.
The Pros and Cons of Strengthening Intellectual Property Protection: Technological Protection Measures and Section 1201 of the United States Copyright Act
Authors: Jane C. Ginsburg
Venue: Information and Communications Technology Law (2007)

The announcement in late November 2006 of the Copyright Office's triennial rulemaking to identify 'classes of works' exempt from the §1201(a)(1) prohibition on circumvention of a technological measure controlling access to copyrighted works in part occasions this assessment of the judicial and administrative construction of this chapter of the 1998 Digital Millennium Copyright Act. The current Rulemaking appears more innovative than its predecessors, particularly in defining the exempted 'class of works' by reference to the characteristics of the works' users. Copyright owner overreaching or misuse may also underlie the relative vigor of this Rulemaking: if producers of devices or providers of services seek to leverage into de facto monopolies over utilitarian articles, the protection of access controls on computer programs that in turn control the function of these objects, then the courts and the Librarian of Congress through the Copyright Office will need to exercise countervailing vigilance in interpreting the statute. Fortunately, §1201 is not so hermetically drafted as to resist all attempts to introduce flexibility; this article suggests some approaches to offset overly literalist statutory construction. Notably, the emergence of fair use as a limiting norm of extra-copyright application, as evidenced in the Trademark Dilution Revision Act 2006, suggests that judges may yet devise ways of reconciling broader intellectual property rights with principles of free expression. Those who interpret the statute should nonetheless bear in mind the many new business models that Congress foresaw and that digital rights management measures (some of them author-empowering) have in fact enabled, lest insecurity dampen the prospects for these models' development.
A Generic Approach to Access Network Modeling for Next Generation Network Applications
Authors: Joachim Fabini, Peter Reichl, Alexander Poropatich
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

Quality of Service impairments in wireless and wired access networks for IP-based Next Generation Networks (NGNs) differ fundamentally from the ones which we typically encounter in core networks. Examples include but are not limited to high delay, low bandwidth, and high jitter. Even though most NGN architectures claim to be access-agnostic, applications deployed on NGNs have requirements which may not be met by specific access technologies. This raises the need to test NGN application prototypes on user acceptance for a huge number of possible access technology combinations. Unfortunately, tests relying on real access network implementations are expensive and time-consuming while simulation at physical or logical link layer are subject to complex parameter configuration.In this paper we present a distinct approach which bases onthe sound theoretical background of the IETF IP PerformanceMetric (IPPM) framework. We argue that careful analysis ofperformance metrics in existing public access networks cancapture access network properties which are sufficiently accurate to model "typical access links at IP-layer level using either emulation or simulation.We propose a three-step model which starts with metric andmethodology selection, continues with parameter acquisition by means of measurements in existing access networks, and ends with emulation or simulation of this access network. The goal of our process is to provide NGN application developers with means to automatically test their applications from the very beginning on the compatibility with various access network technologies, covering both, signaling and data streaming aspects of access networks. We illustrate the procedure using performance measurement results of a public UMTS Release 5 network and UMTS access network emulation by an extended Open-Source Delay Emulator.
Scalable networked virtual environments using unstructured overlays
Authors: Sandeep K. Singhal
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

Large-scale Networked Virtual Environments (NVEs) are used to enable rich interactive experiences such as multiplayer games, military and industrial training, and collaborative engineering systems. In these applications, hosts must exchange data updates to maintain a consistent view of the virtual environment. In large-scale environments, the volume of data places a heavy load on the networking and computational resources available to each host. To improve scalability, systems have employed a variety of techniques, including data subscription, data segmentation, and multicast. In this paper, we describe a communication architecture for Networked Virtual Environments that takes advantage of unstructured peer-to-peer (P2P) overlay networks for message distribution. The overlay network design provides scalability while supporting easy deployment over today&#x2019;s Internet. The approach, when combined with data segmentation and data subscription, enables Internet deployment of large-scale NVEs.
Clock offset estimation using collaborative one-way transit time
Authors: Edmar Mota-Garcia, Rogelio Hasimoto-Beltran
Venue: ACM SIGMETRICS Performance Evaluation Review (2008)

We propose a new collaborative clock offset estimation scheme between two nodes in the Internet using independent one-way offset estimations. Our proposal (different than current schemes in the literature) is intended to provide a fast and accurate clock offset estimation in approximately [Round-Trip Time (RTT)+40]ms. The scheme sends a group of 5 probes in the the forward and reverse paths, and models the One-way Transit Time (OTT) by a Gamma distribution (with parameters adapted to actual path condition) to estimate the minimum distribution value (or long-term minimum OTT value). End nodes exchange their corresponding minimum distribution values to get an improved final clock offset estimate, which takes into account the network path asymmetries. We show that our scheme provides a faster clock offset estimation with lower RMSE and superior stability than NTP and current NTP-like state of the art methodologies in the literature.
The Use of Device Simulation in Development of USB Storage Devices
Authors: R. Brian Anderson, Mike Borowczak, Philip A. Wilsey
Venue: Proceedings of the 41st Annual Simulation Symposium (anss-41 2008) (2008)

The modeling and analysis of a USB storage device with a novel protection mechanism is described. The USB storage device contains an active monitoring subsystem that decodes and analyzes an encoded request stream has been developed by Clifton Labs. However, before moving to fabrication, there are several design parameters that need to be explored and better understood. In this manuscript we review our experiences in the modeling and analysis of our USB device using the Microsoft Windows Driver's kit. Initially we began this project with limited experience with the USB bus protocol and with no prior experience with the Microsoft device driver tools. In this paper we describe our work modeling and analyzing the new USB storage device and describe our the problems and complications we encountered using these modeling and analysis tools.
Terrorism Root Cause Analysis Based on Subjective Game Model
Authors: Liu Dehai
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Currently, international terrorism is overrunning allover the word that's induced by the very complex factors such as economic poverty, international political conflict, religion and national contradiction, culture and value difference between Western and Eastern. Game theory provides a suitable tool for the various conflict and cooperative problems, but under the basic hypothesis of fixed exterior environment, traditional game and evolutionary game theories are difficult to analyze the terrorism root in the dynamic complex environment. The paper uses subjective game model to analyze the terrorism root and generating condition in the changing environment, there are including the sensitive degree about the North-South gap under the background of economic globalizations, the economy and social developing foreground in depressed area, the responsive projects for the global poverty among the developing countries and developed countries.
Efficient QoS Implementation for MPLS VPN
Authors: Mohamed El Hachimi, Marc-Andre Breton, Maria Bennani
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Multi-protocol Layer Switching (MPLS) VPNs are ideal solution for medium and large enterprises that currently deploy site-to-site VPN services. MPLS provides sophisticated traffic engineering capabilities that, coupled with IP QoS, enable multiple classes of service so business critical applications are treated with higher priority than less important applications and "best effort" services. The popularity of MPLS VPNs as an alternative to private WANs introduces a number of considerations with regard to QoS. In this paper we propose an efficient QoS scheme for MPLs VPN services to meet user peak demand. In this scheme, customers are guaranteed a minimal service; however, they can exceed their contracted bandwidth and then they are charged for their out of profile traffics.
Query evaluation and optimization in the semantic web
Authors: Edna Ruckhaus, Eduardo Ruiz, MarÍa-esther Vidal
Venue: Theory and Practice of Logic Programming (2008)

We address the problem of answering Web ontology queries efficiently. An ontology is formalized as a deductive ontology base (DOB), a deductive database that comprises the ontology's inference axioms and facts. A cost-based query optimization technique for DOB is presented. A hybrid cost model is proposed to estimate the cost and cardinality of basic and inferred facts. Cardinality and cost of inferred facts are estimated using an adaptive sampling technique, while techniques of traditional relational cost models are used for estimating the cost of basic facts and conjunctive ontology queries. Finally, we implement a dynamic-programming optimization algorithm to identify query evaluation plans that minimize the number of intermediate inferred facts. We modeled a subset of the Web ontology language Lite as a DOB and performed an experimental study to analyze the predictive capacity of our cost model and the benefits of the query optimization technique. Our study has been conducted over synthetic and real-world Web ontology language ontologies and shows that the techniques are accurate and improve query performance.