ppxscal/embedding_network huggingface dataset:
Human factors and qualitative pedagogical evaluation of a mobile augmented reality system for science education used by learners with physical disabilities
Authors: Theodoros N. Arvanitis, Argeroula Petrou, James F. Knight, Stavros Savas, Sofoklis Sotiriou, Michael Gargalakos, Elpida Gialouri
Venue: Personal and Ubiquitous Computing (2009)

Technology-enhanced learning, employing novel forms of content representation and education service delivery by enhancing the visual perception of the real environment of the user, is favoured by proponents of educational inclusion for learners with physical disabilities. Such an augmented reality computer-mediated learning system has been developed as part of an EU funded research project, namely the CONNECT project. The CONNECT project brings together schools and science centres, and produces novel information and communication technologies based on augmented reality (AR) and web-based streaming and communication, in order to support learning in a variety of settings. The CONNECT AR interactive learning environment can assist users to better contextualize and reinforce their learning in school and in other settings where people learn (i.e. science centres and home). The CONNECT concept and associated technologies encourage users to visit science centres and perform experiments that are not possible in school. They can also build on these experiences back at school and at home with visual augmentations that they are communicated through web-based streaming technology. This paper particularly focuses on a user-centred evaluation approach of human factors and pedagogical aspects of the CONNECT system, as applied to a special needs user group. The main focus of the paper is on highlighting the human factors issues and challenges, in terms of wearability and technology acceptance, while elaborating on some qualitative aspects of the pedagogical effectiveness of the instructional medium that AR technology offers for this group of learners.
A Novel Local Interconnect Architecture for Variable Grain Logic Cell
Authors: Kazuki Inoue, Motoki Amagasaki, Masahiro Iida, Toshinori Sueyoshi
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

Depending on the granularity of the basic logic cell, reconfigurable devices are classified into two types; fine-grain and coarse-grain devices. In general, each type has its own advantages; therefore, it is difficult to achieve high implementation efficiency in any applications. In this study, we propose a variable grain logic cell (VGLC) architecture. Its key feature is variable granularity which helps create a balance between these two types of device. In this paper, we propose a local interconnect structure, which is a crossbar switch circuit, for the VGLC. In order to discuss the trade-off between the number of circuit resources and flexibility, we proposed different structures and evaluated them. The results showed that a less flexible structure has almost the same effects as a more flexible structure.
A transformational language for mutant description
Authors: Adenilso Simão, José Carlos Maldonado, Roberto da Silva Bigonha
Venue: Computer Languages, Systems and Structures (2009)

Mutation testing has been used to assess the quality of test case suites by analyzing the ability in distinguishing the artifact under testing from a set of alternative artifacts, the so-called mutants. The mutants are generated from the artifact under testing by applying a set of mutant operators, which produce artifacts with simple syntactical differences. The mutant operators are usually based on typical errors that occur during the software development and can be related to a fault model. In this paper, we propose a language-named MuDeL (MUtant DEfinition Language)-for the definition of mutant operators, aiming not only at automating the mutant generation, but also at providing precision and formality to the operator definition. The proposed language is based on concepts from transformational and logical programming paradigms, as well as from context-free grammar theory. Denotational semantics formal framework is employed to define the semantics of the MuDeL language. We also describe a system-named mudelgen-developed to support the use of this language. An executable representation of the denotational semantics of the language is used to check the correctness of the implementation of mudelgen. At the very end, a mutant generator module is produced, which can be incorporated into a specific mutant tool/environment.
Analogizing Hutton's quasi-uniformities for complete lattices and extending Shi's quasi-uniformities to closed set lattices
Authors: Wei Yao, Ling-Xia Lu
Venue: Fuzzy Sets and Systems (2009)

This paper gives analogies of Hutton's quasi-uniformities for complete lattices and extensions of Shi's pointwise quasi-uniformities to closed set lattices. CL"G"O"H denotes the category of all complete lattices with generalized order homomorphisms as morphisms and CSL the category of all closed set lattices. HQUnif and SPQUnif denote the categories of Hutton quasi-uniform spaces on complete lattices and Shi pointwise quasi-uniform spaces on closed set lattices, respectively. We prove that both HQUnif and SPQUnif are fibre-complete topological categories over CL"G"O"H and CSL with respect to the expected forgetful functors, respectively. Also, a mistake in W. Kotze [Uniform spaces, in: U. Hohle, S.E. Rodabaugh (Eds.), Mathematics of Fuzzy Sets: Logic, Topology, and Measure Theory, The Handbooks of Fuzzy Sets Series, Vol. 3, Kluwer Academic Publishers, Boston, Dordrecht, London, 1999, pp. 553-580] is pointed out.
Declarative Network Verification
Authors: Anduo Wang, Prithwish Basu, Boon Thau Loo, Oleg Sokolsky
Venue: Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages (2009)

In this paper, we present our initial design and implementation of a declarative network verifier (DNV). DNV utilizes theorem proving, a well established verification technique where logic-based axioms that automatically capture network semantics are generated, and a user-driven proof process is used to establish network correctness properties. DNV takes as input declarative networking specifications written in the Network Datalog (NDlog) query language, and maps that automatically into logical axioms that can be directly used in existing theorem provers to validate protocol correctness. DNV is a significant improvement compared to existing use case of theorem proving which typically require several man-months to construct the system specifications. Moreover, NDlog, a high-level specification, whose semantics are precisely compiled into DNV without loss, can be directly executed as implementations, hence bridging specifications, verification, and implementation. To validate the use of DNV, we present case studies using DNV in conjunction with the PVS theorem prover to verify routing protocols, including eventual properties of protocols in dynamic settings.
High Speed Serdes Devices and Applications, 1st edition
Authors: David R. Stauffer, Jeanne Trinko Mechler, Michael Sorna, Kent Dramstad, Clarence R. Ogilvie, Amanullah Mohammad, James Rockrohr
Venue:  (2008)

The material provides the reader with an understanding of the features and functions typically found on HSS devices. It explains how these HSS devices are used in protocol applications and the analysis which must be performed to use such HSS devices. The book is an assimilation of various topics with a focus on what chip designers need to understand in order to design chips using HSS cores. The reader is first introduced to the basic concepts and the resulting features and functions typical of HSS devices. HSS devices are used in the context of a protocol application. The reader is then introduced to the basic concepts used by protocols, and overviews are provided for several protocol standards in which HSS devices are commonly used. Additional chapters describe the features, functions, and considerations associated with designing and analyzing a reference clock distribution network, as well as testing HSS hardware, analyzing signal integrity, and analyzing power consumption. Finally, any HSS core is not complete without a set of design kit models to facilitate integration within the chip design, and special topics uniquely related to design kits for HSS cores are discussed in the final chapter.
VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
Authors: Pedro Martins, Mauricio C. de Souza
Venue: Computers and Operations Research (2009)

Given an undirected graph with weights associated with its edges, the min-degree constrained minimum spanning tree (md-MST) problem consists in finding a minimum spanning tree of the given graph, imposing minimum degree constraints in all nodes except the leaves. This problem was recently proposed in Almeida et al. [Min-degree constrained minimum spanning tree problem: Complexity, proprieties and formulations. Operations Research Center, University of Lisbon, Working-paper no. 6; 2006], where its theoretical complexity was characterized and showed to be NP-hard. The present paper discusses variable neighborhood search (VNS) metaheuristics addressing the md-MST. A so-called enhanced version of a second order (ESO) repetitive technique is also considered, in order to guide the search in both shaking and improvement phases of the VNS method. A Kruskal based greedy heuristic adapted to the md-MST is also presented, being used within the ESO framework. VNS randomized methodologies are also discussed. These are the first heuristics to the md-MST ever proposed in the literature. Computational experiments are conducted on instances adapted from benchmark ones used in the context of the well-known degree constraint minimum spanning tree problem. These experiments have shown that randomized VNS methods enclosing an ESO algorithm can produce very interesting results. In particular, that a simpler VNS randomized methodology might be taken into account when very high dimensional instances are under consideration.
Monte Carlo sampling of Wigner functions and surface hopping quantum dynamics
Authors: Susanna Kube, Caroline Lasser, Marcus Weber
Venue: Journal of Computational Physics (2009)

The article addresses the achievable accuracy for a Monte Carlo sampling of Wigner functions in combination with a surface hopping algorithm for non-adiabatic quantum dynamics. The approximation of Wigner functions is realized by an adaption of the Metropolis algorithm for real-valued functions with disconnected support. The integration, which is necessary for computing values of the Wigner function, uses importance sampling with a Gaussian weight function. The numerical experiments agree with theoretical considerations and show an error of 2-3%.
Fly: a tool to author planar presentations
Authors: Leonhard Lichtschlag, Thorsten Karrer, Jan Borchers
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Modern presentation software is still built around interaction metaphors adapted from traditional slide projectors. We provide an analysis of the problems in this application genre that presentation authors face and present Fly, a presentation tool that is based on the idea of planar information structures. Inspired by the natural human thought processes of data chunking, association, and spatial memory, Fly explores authoring of presentation documents. Evaluation of a paper prototype showed that the planar UI is easily grasped by users, and leads to presentations more closely resembling the information structure of the original content, thus providing better authoring support than the slide metaphor. Our software prototype confirmed these results, and outperformed PowerPoint in a second study for tasks such as prototyping presentations and generating meaningful overviews. Users reported that this interface helped them better to express their concepts, and expressed significant preference for Fly over the traditional slide model.
The Open Knowledge Society: A Computer Science and Information Systems Manifesto First World Summit on the Knowledge Society, WSKS 2008, Athens, Greece, ... in Computer and Information Science), 1st edition
Authors: Miltiadis D. Lytras, John M. Carroll, Ernesto Damiani, Robert D. Tennyson, David Avison, Gottfried Vossen, Patricia Ordez de Pablos
Venue:  (2008)

This book, in conjunction with the volume LNAI 5288, constitutes the refereed proceedings of theFirst World Summit, WSKS 2008, held in Athens, Greece, in September 2008. The 95 revised full papers presented were carefully reviewed and selected from 286 submissions. The topics include applications for the human and the society; information systems and information technology; knowledge management and e-learning; libraries, digital culture and electronic tourism; e-business, egovernment and e-banking; politics and policies for the knowledge society; sustainable development for the knowledge society.
Non-Functional Properties and Service Level Agreements in Service-Oriented Computing (NFPSLA-SOC '07) --- Organizers' Workshop Summary
Authors: Flavio Paoli, Andrea Maurino, Ioan Toma, Justin O'Sullivan, Marcel Tilly, Glen Dobson
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

The first workshop on Non-Functional Properties (NFP) and Service Level Agreements (SLA) in Service-Oriented Computing was held on September 17th, 2007 in Vienna, Austria in conjunction with the International Conference on Service Oriented Computing. This workshop aimed to bring together researchers and industry practitioners to foster a greater understanding of how the management of NFP and SLAs can assist businesses utilizing Service-Oriented Architectures (SOA) as well as to investigate the resulting research issues. These issues were felt to be highly relevant due to the increasing popularity of SOA and the fact that whilst the foundations of SOA functionality are now well understood, non-functional properties are not.
Efficient groupwise multiuser detection with iterative soft interference cancellation for multi-rate MC-CDMA
Authors: Yung-Ping Tu, Wen-Hsien Fang, Hoang-Yang Lu
Venue: Computer Communications (2009)

This paper presents an effective multiuser detector (MUD) for the uplink of multi-rate multi-carrier code division multiple access (MC-CDMA) systems. The MUD considered is an iterative receiver which utilizes the soft information to refine the estimation of the interference to enhance the interference cancellation capability. More specifically, users are first classified into separate groups according to their transmission rates. In each iteration, these groups of users are detected sequentially based on a set of group detectors with the removal of multiple access interferences (MAI) group by group, where the estimated interferences in each group, incurred from the users either in the same rate group or in the other rate groups, are refined successively with the assistance of the soft information in the symbol detection process. Moreover, for practical low-complexity implementations, the users in each group are further partitioned into smaller subgroups based on their effective channel correlations and then detected in parallel by a bank of minimum mean-squared error (MMSE) soft detectors to further reduce the computational load. Conducted simulations show that the proposed MUD can effectively suppress the MAI to render superior performance but with reduced computations compared to previous works.
Approximate zero-variance simulation
Authors: Pierre L'Ecuyer, Bruno Tuffin
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Monte Carlo simulation applies to a wide range of estimation problems, but converges rather slowly in general. Variance reduction techniques can lower the estimation error, sometimes by a large factor, but rarely change the convergence rate of the estimation error. This error usually decreases as the inverse square root of the computational effort, as dictated by the central limit theorem. In theory, there exist simulation estimators with zero variance, i.e., that always provide the exact value. The catch is that these estimators are usually much too difficult (or virtually impossible) to implement. However, there are situations, especially in the context of rare-event simulation, where the zero-variance simulation can be approximated well enough to provide huge efficiency gains. Adaptive versions can even yield a faster convergence rate, including exponential convergence in some cases. This paper gives a brief overview of these methods and discuss their practicality.
A Multimedia Personalized Fruition of Figurative Artistic Heritage by a GIS-Based Methodology
Authors: Luciana Bordoni, Attilio Colagrossi
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The creation of a personalized classification of the figurative heritage is examined. The subjectivity and the variability in time are the essential elements for a personalized classification of works of art. The aim is thus to make application available to as many users as possible by creating low-cost, PC application for managing a personal archive of works of art. In this paper we propose a methodology to construct, in a friendly way, a multimedia system that allows users to classify an image according to personal criteria. The methodology we propose makes it possible to build a multimedia GIS-based tool that allows users to create a personalized application. Suggestions about potential applications of the proposed methodology, in particular for didactics and art-lovers, are discussed and some examples are also presented.
Preprocessor of Intrusion Alerts Correlation Based on Ontology
Authors: Wan Li, Shengfeng Tian
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Intrusion detection systems (IDS) often provide a large number and poor quality alerts, which are insufficient to support rapid identification of ongoing attacks or predict an intruder’s next likely goal. Several alert correlation techniques have been proposed to facilitate the analysis of intrusion alerts. However, many works directly upon the alerts, they do not distinguish between alerts and intruders' attack actions. In addition, many works are not grounded on any standard taxonomy, their associated classification schemes are ad hoc and localized. This paper focus on reducing alerts to attack actions with IDMEF and CVE standards in the preprocessor of our intrusion alerts correlation system which is based on ontology. At first, we introduce our intrusion alerts correlation system. Then we present each modules of the preprocessor, they are local preprocessor, IDMEF parser, alert to attack module and attack to ontology module.
An Overview of IPv4 to IPv6 Transition and Security Issues
Authors: Muhammad Rizwan Sabir, Muhammad Abuzar Fahiem, Muhammad Saleem Mian
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Sharing of information and resources among different devices require networking. As networks are expanding day by day, IPv6 is gaining more and more popularity. Different transition mechanisms have been established and yet a lot of research is to be carried out. Network security is another very important area of research and needs special attention in the era of network expansions. In this paper, we have discussed different transition mechanisms from IPv4 to IPv6, and various security issues, as well. We have presented a comprehensive review of various security measures proposed by different researchers.
Completeness Results for Memory Logics
Authors: Carlos Areces, Santiago Figueira, Sergio Mera
Venue: Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science (2009)

Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structures. In this paper we present sound and complete axiomatizations for some members of this family. We analyze the use of nominals to achieve completeness, and present one example in which they can be avoided.
Interactive Lung Segmentation Algorithm for CT Chest Images Based on Live-Wire Model and Snake Model
Authors: Lu Meng, Hong Zhao
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

In this paper, an interactive lung parenchyma segmentation algorithm is put forward with improved Live-Wire model, Snake model and contour interpolation, which takes full advantage of lung contours' slow change in adjacent CT image layers and operators' professional knowledge. Firstly, we manually select key slices of lung parenchyma in serial CT images, then draw the lung's contours in key slices by Live-Wire model, get the lung's contours in other slices by contour interpolation, finally segment lung's accurate contours in all slices by Snake model and manual modification. Experiments showed that this algorithm can segment lung parenchyma in serial CT images quickly and accurately.
Complex dispersion relation of 1D dielectric photonic crystal with thin metallic layers
Authors: A. Alejo-Molina, J. J. Sánchez-Mondragón, D. A. May-Arrioja, D. Romero, J. Escobedo-Alatorre, A. Zamudio-Lara
Venue: Microelectronics Journal (2009)

We have carried out the analytical and numerical analysis of metallic insets embedded in a dielectric photonic crystal (DPC). The corresponding one-dimensional metallo-dielectric photonic crystal (MDPC) is studied in relation to the substratum DPC. We describe the complex MDPC dispersion relation curves and the transmission coefficient at the different propagation regimens trough the finite stack. While in the DPC, the band gap argument corresponds to undefined complex solutions of a real dispersion relation, in a MDPC corresponds to a definite complex solution, function of the metal thickness; and analytic continuation of the dispersion curve on the imaginary K plane. The metal absorption is described by the Drude model, and as a result of the absorption in the inset metallic films, complex Bloch vectors are produced for all frequencies as evanescent waves that differ from the straightforward metal absorption.
Two studies of opportunistic programming: interleaving web foraging, learning, and writing code
Authors: Joel Brandt, Philip J. Guo, Joel Lewenstein, Mira Dontcheva, Scott R. Klemmer
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

This paper investigates the role of online resources in problem solving. We look specifically at how programmers - an exemplar form of knowledge workers - opportunistically interleave Web foraging, learning, and writing code. We describe two studies of how programmers use online resources. The first, conducted in the lab, observed participants' Web use while building an online chat room. We found that programmers leverage online resources with a range of intentions: They engage in just-in-time learning of new skills and approaches, clarify and extend their existing knowledge, and remind themselves of details deemed not worth remembering. The results also suggest that queries for different purposes have different styles and durations. Do programmers' queries "in the wild" have the same range of intentions, or is this result an artifact of the particular lab setting? We analyzed a month of queries to an online programming portal, examining the lexical structure, refinements made, and result pages visited. Here we also saw traits that suggest the Web is being used for learning and reminding. These results contribute to a theory of online resource usage in programming, and suggest opportunities for tools to facilitate online knowledge work.