ppxscal/embedding_network huggingface dataset:
Implementation of schooling based on technologies for communication and information in the subject Physics II
Authors: Olivia Vivas Vejar
Venue: Proceedings of the 8th WSEAS international conference on Distance learning and web engineering (2008)

This research carried out with undergraduate students in engineering, sought to present a methodology as an alternative to access that subject, while producing a rise in the level of knowledge within the Bloom's Taxonomy. We studied student achievement, the perception of students and teachers to teaching performance, the use of media and the development of instruction. This study involves 68 students and 9 teachers. Students formed two sections, the Control Group (CG) with 64.71% of them and the Experimental Group (EG) with 35.59% of students. The first received instruction under the traditional methodology and the second by using technological means blended learning methodology. Initially the author applied two questionnaires, one aimed at both groups of students to teachers and other recorded demographics and academic perception with respect to development of the subject, the methodology and the teaching performance. Subsequently, the pretest was applied to both groups on the topics developed during the investigation. Finally, it was established that it is feasible within the university study, implement some methodological strategy incorporating technological tools, expanding coverage, for organizing this mentoring to enable two-way communication and multidirectional student-teacher, encouraging the use of technology in the process Learning Physics II, generating active learning environments, where the main protagonist is a student.
Identifying exogenous drivers and evolutionary stages in FLOSS projects
Authors: Karl Beecher, Andrea Capiluppi, Cornelia Boldyreff
Venue: Journal of Systems and Software (2009)

The success of a Free/Libre/Open Source Software (FLOSS) project has been evaluated in the past through the number of commits made to its configuration management system, number of developers and number of users. Most studies, based on a popular FLOSS repository (SourceForge), have concluded that the vast majority of projects are failures. This study's empirical results confirm and expand conclusions from an earlier and more limited work. Not only do projects from different repositories display different process and product characteristics, but a more general pattern can be observed. Projects may be considered as early inceptors in highly visible repositories, or as established projects within desktop-wide projects, or finally as structured parts of FLOSS distributions. These three possibilities are formalized into a framework of transitions between repositories. The framework developed here provides a wider context in which results from FLOSS repository mining can be more effectively presented. Researchers can draw different conclusions based on the overall characteristics studied about an Open Source software project's potential for success, depending on the repository that they mine. These results also provide guidance to OSS developers when choosing where to host their project and how to distribute it to maximize its evolutionary success.
Geometric Approach to Measure-Based Metric in Image Segmentation
Authors: Vladimir Kluzner, Gershon Wolansky, Yehoshua Y. Zeevi
Venue: Journal of Mathematical Imaging and Vision (2009)

The Mumford-Shah functional and related algorithms for image segmentation involve a tradeoff between a two-dimensional image structure and one-dimensional parametric curves (contours) that surround objects or distinct regions in the image.We propose an alternative functional that is independent of parameterization; it is a geometric functional given in terms of the surfaces representing the data and image in the feature space. The Γ-convergence technique is combined with the minimal surfaces theory to yield a global generalization of the Mumford-Shah segmentation function.
Public Safety Communication Using Commercial Cellular Technology
Authors: Rolf Blom, Peter de Bruin, Jesper Eman, Mats Folke, Hans Hannu, Mats Näslund, Marika Stålnacke, Per Synnergren
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

We propose a concept for public safety communication realized with IMS (IP Multimedia Subsystem), the cellular standards of 3GPP and packet switched transmission. Basing the solution on mainstream cellular technology leverages the economy of scale of today's commercial networks and enables migration of technical solutions and applications. Important requirements of the Public Safety sector are group communication, low latency, high capacity, security, reliability and interoperability for voice and broadband data services. Our analysis shows that the concept has the technology potential to meet these public safety requirements.
An active anycast approach to improve roaming mobile IPv6 client performance in multi-server environment
Authors: Kee-Lin Neoh, Hong-Tat Ewe
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Mobile IPv6 enables mobile clients to retain its network connections while roaming into foreign networks. However, in a multi-server environment whereby multiple mirror servers are located at different IP networks providing the same service, a mobile client consuming a service from a particular server continues consuming the service from the same server after roaming into foreign network, ignoring the existence of other mirror servers that may give higher throughput based on mobile client's latest network location. In this paper, we propose an active anycast-based server selection model that enables roaming mobile client to detect and access a mirror server that gives better performance based on the mobile client's latest network location. Two schemes are proposed for such performance enhancement, namely: Best Performance Scheme (BPS), and Acceptable Performance Scheme (APS). In BPS, mobile client re-initiates the server selection process whenever it roams into a foreign network. In APS, mobile client re-initiates the server selection process only if the throughput of the current server drops to a dissatisfactory level. Simulation is performed to evaluate the proposed schemes and its results are presented and discussed.
Haptic wind
Authors: Andrei Sherstyuk
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

A new wearable haptic system is proposed for interactive immersive Virtual Reality (VR) installations. The core of the system is a common cooling CPU fan attached to a user hand, tracked in 3D, and operated from a host computer. The proposed system is suitable for entertainment applications where immersed VR users interact with fuzzy, cloud-like or jelly-like objects, producing soft and gentle tactile sensations upon contact with user hands.
Cluestr: mobile social networking for enhanced group communication
Authors: Reto Grob, Michael Kuhn, Roger Wattenhofer, Martin Wirz
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

Recent technological advances foster the spreading of social software in the mobile domain. Hence, future usage patterns of mobile devices will involve more group interaction. While collaboration using mobile devices is an active area of research, only limited attention has been paid to the efficient initiation of group communication from mobile terminals. In this paper we present a community-aware mechanism that allows to efficiently select contacts in order to address them as a group. We have integrated the proposed method into a proof-of-concept application, and present preliminary experiments that demonstrate the accuracy of the approach and show significant time savings in the group initialization process.
Common Computer Abbreviations: Computers and Internet Abbreviations Reference Guide for Everyone
Authors: B.S.E.E.,  M.S.E.E.,  John S. DeSousa
Venue:  (2008)

Stroke-Survivor's Pathway of Success! COMMON COMPUTER ABBREVIATIONS Up-to-Date Reference Guide to Abbreviations in Computers and Internet By: John S. DeSousa, B.S.E.E.,M.S.E.E. (Stroke-Survivor)This book has been written with non-technical individuals in mind, and every effort has been made to collect the most frequently used abbreviations. In first part of this book, few hundreds of pages are dedicated to listings of abbreviations used in Computers and Internet. In second part ten useful appendices are given as: 1. Appendix A: Electrical information to operate a computer or laptop. 2. Appendix B: SI electrical characteristic symbols. 3. Appendix C: Scietific usage of Greek Alphabet. 4. Appendix D: Decimal prefixes used in computers. 5. Appendix E: Latin and Roman numerical symbols. 6. Appendix F: "Smiley Faces" in E-mail and Newsgroup. 7. Appendix G:"Country Code E-mail" to locate origin of an E-mail. 8. Appendix H: A guide to metric measurement conversion. 9. Appendix I: US spelled words versus International English. 10.Appendix J: Inspiring and motivation words.
SoftSig: Software-Exposed Hardware Signatures for Code Analysis and Optimization
Authors: James Tuck, Wonsun Ahn, Josep Torrellas, Luis Ceze
Venue: IEEE Micro (2009)

Many code analysis techniques for optimization, debugging, and parallelization must perform runtime disambiguation of address sets. Hardware signatures support such operations efficiently and with low complexity. SoftSig exposes hardware signatures to software through instructions that control which addresses to collect and which to disambiguate against. The Memoise algorithm demonstrates SoftSig's versatility by detecting and eliminating redundant function calls. DOI of original article is available at http://doi.acm.org/10.1145/1346281.1346300
Research on personalization E-learning system based on agent technology
Authors: Zhen Liu, Yuying Liu
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

Adaptive e-learning system, deal with appropriate personalization and adaptation techniques in order to maximize the effectiveness of learning. Customer preference and personality are going to be more and more important to e-learning. This paper first hopes to explain the grid agent e-learning model, whose main actions including registry, directory and discovery. Through these actions, the manager's agent will find out the suitable learning services. Secondly, to implement the adaptability of the Grid agent model, the method of Artificial Psychology and how to realize adaptive personalized e-learning by this method so that are the student's agent can employ the learning material matched to their own personality type are also emphasized. The experiment data also supported our assumption that the learners may perform better if they use our adaptive grid agent model.
High Speed CPU Simulation Using LTU Dynamic Binary Translation
Authors: Daniel Jones, Nigel Topham
Venue: Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers (2008)

In order to increase the speed of dynamic binary translation based simulators we consider the translation of large translation units consisting of multiple blocks. In contrast to other simulators, which translate hot blocks or pages, the techniques presented in this paper profile the target program's execution path at runtime. The identification of hot paths ensures that only executed code is translated whilst at the same time offering greater scope for optimization. Mean performance figures for the functional simulation of EEMBC benchmarks show the new simulation techniques to be at least 63% faster than basic block based dynamic binary translation.
(Query) History Teaches Everything, Including the Future
Authors: Fabrizio Silvestri, Ranieri Baraglia, Claudio Lucchese, Salvatore Orlando, Raffaele Perego
Venue: Proceedings of the 2008 Latin American Web Conference (2008)

"History Teaches Everything, Including the Future", wrote Alphonse de Lamartine in the nineteen century. Even if history cannot be really considered a predictive science, historical information can successfully be used in many fields. This paper deals with Web Search Engines and their Query logs, which contain historical information about past usage of such systems. We will present some of the most interesting results obtained in this field by the High Performance Computing Lab in Pisa in collaboration with Research Labs worldwide. The techniques reviewed are mainly focused on enhancing the efficiency of large-scale distributed search systems.
Media device for hand scroll 2008
Authors: Yasuhito Nagahara, Nobuya Suzuki, Keiko Kobayashi
Venue: ACM SIGGRAPH ASIA 2008 artgallery: emerging technologies (2008)

This reproduction of the handscroll of Poems of the Thirty-Six Immortal Poets over Design of Cranes is a rolled up scroll of paper. But the paper is blank. When the media device is engaged, the projected image of the Crane Scroll appears on blank paper.
Deriving parameter characteristics
Authors: Rakesh Shukla
Venue: Proceedings of the 2nd India software engineering conference (2009)

An operational profile is a quantification of the expected use of a software component that is used for generating test cases in statistical testing. Previous work on operational profiles has concentrated on exploring the occurrence of operations and little has been said about operation parameters. The testing is meaningless if values for input parameters are not consistent according to the expected use. This paper presents a method for defining parameter characteristics by deriving constraints on and relationships between operation parameters. The parameter characteristics are then used to support generation of appropriate values for input parameters of operations. The method applies formal concept analysis using the component API to derive relationships between operations and parameters. Then the method uses these relationships, usage data and intended usage assumptions for defining characteristics of parameters. The method is illustrated on two Java classes but can be applied to any software component that is accessed through an API.
Histogram-Based Global Load Balancing in Structured Peer-to-Peer Systems
Authors: Quang Hieu Vu, Beng Chin Ooi, Martin Rinard, Kian-Lee Tan
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

Over the pass few years, peer-to-peer (P2P) systems have rapidly grown in popularity and become a dominant means for sharing resources. In these systems, load balancing is a key challenge because nodes are often heterogeneous. While several load balancing schemes have been proposed in the literature, these solutions are typically ad-hoc, heuristic-based and localized. In this paper, we present a general framework, HiGLOB, for global load balancing in structured P2P systems. Each node in HiGLOB has two key components: (1) A histogram manager maintains a histogram that reflects a global view of the distribution of the load in the system, and (2) A load-balancing manager that redistributes the load whenever the node becomes over or under loaded. We exploit the routing metadata to partition the P2P network into non-overlapping regions corresponding to the histogram buckets. We propose mechanisms to keep the cost of constructing and maintaining the histograms low. We further show that our scheme can control and bound the amount of load imbalance across the system. Finally, we demonstrate the effectiveness of HiGLOB by instantiating it over three existing structured P2P systems: Chord, Skip Graph and BATON. Our experimental results indicate that our approach works well in practice.
Dynamic Connectivity for Axis-Parallel Rectangles
Authors: Peyman Afshani, Timothy M. Chan
Venue: Algorithmica (2009)

In this paper we give a fully dynamic data structure to maintain the connectivity of the intersection graph of n axis-parallel rectangles. The amortized update time (insertion and deletion of rectangles) is and the query time (deciding whether two given rectangles are connected) is O(1). It slightly improves the update time (O(n 0.94)) of the previous method while drastically reducing the query time (near O(n 1/3)). In addition, our method does not use fast matrix multiplication results and supports a wider range of queries.
Non-Rigid 3D SPECT/CT Image Registration: Registration of Myocardial Datasets
Authors: Bjrn Eskofier
Venue:  (2008)

For the clinical diagnosis of myocardial perfusionimages there is a need to register 3D datasetsoriginating from different modalities. CT datasetsprovide good resolution of anatomic structures andare needed for attenuation and scattercorrection during the process of SPECT imagereconstruction. It is mandatory for this process tohave CT and SPECT 3D volumes realigned properly sothat reconstruction algorithms can provide physicianswith valuable data. Several rigid registrationtechniques are implemented in commercial solutions forhospitals. These techniques cannot take into accountany non-rigid deformations, which may occur e.g.because of respiratory motion, the beating of theheart or shifts of the patient. This book shows theuse of integrating anon-rigid registration approach into the process ofreconstructing SPECT datasets of the myocardium. Theresults of the optimization of this process, as well as itsapplication to clinical images are discussed.Besides an overview of related works and patents inthe field of non-rigid image registration, this bookpresents the theoretic background needed tounderstand the concepts and methods behind this kindof registration.
Observability and controllability of systems with limited data rate
Authors: Ge Guo, Xiaoping Liu
Venue: International Journal of Systems Science (2009)

Some fundamental properties of observability and controllability are studied for linear discrete-time systems in a bandwidth-limited communication network environment shared by a number of sensors and actuators and a remote controller. The concepts of finite time set-observability and set-controllability are introduced for such systems. Sufficient and necessary conditions on quantisation level for set-observability and set-controllability are derived. Especially, the admissible data rates of the communication network are obtained that are sufficient and necessary for the system to be finite time set-observable or finite time set-controllable. In addition, less conservative sufficient and necessary rates based on quantisation level of system states are given too.
UML-AOF: a profile for modeling aspect-oriented frameworks
Authors: José Uetanabara Júnior, Valter Vieira Camargo, Christina Von Flach Chavez
Venue: Proceedings of the 13th workshop on Aspect-oriented modeling (2009)

The design model of an application that was developed with support of frameworks involves both the framework and the application design. This results in complex architectures represented by design models that are difficult to understand; because there are many framework characteristics which are not evident when plain UML is used. The same problem occurs with Aspect-Oriented Frameworks (AOF). In AOF-based development there are units which deserve attention from different developers -- application engineers and framework engineers. Besides, there are a number of architectural characteristics in AOFs which do not appear in Object-Oriented Frameworks. So, in order to make these specific characteristics clearer in the models we propose UML-AOF, an UML profile for designing AOFs. UML-AOF was created based on an existing UML profile for aspect-oriented programming and takes into consideration some AspectJ idioms, patterns and also stereotypes from a profile for object-oriented frameworks called UML-F. UML-AOF was evaluated by means of its application in the design of a persistence and security AOF. We observe that UML-AOF makes some specific AOF architectural characteristics clearer in design models, improving the understandability of the architecture as well as the behavior.
On step sizes, stochastic shortest paths, and survival probabilities in reinforcement learning
Authors: Abhijit Gosavi
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Reinforcement Learning (RL) is a simulation-based technique useful in solving Markov decision processes if their transition probabilities are not easily obtainable or if the problems have a very large number of states. We present an empirical study of (i) the effect of step-sizes (learning rules) in the convergence of RL algorithms, (ii) stochastic shortest paths in solving average reward problems via RL, and (iii) the notion of survival probabilities (downside risk) in RL. We also study the impact of step sizes when function approximation is combined with RL. Our experiments yield some interesting insights that will be useful in practice when RL algorithms are implemented within simulators.
Layered Models Top-Down Querying of Normal Logic Programs
Authors: Luís Moniz Pereira, Alexandre Miguel Pinto
Venue: Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages (2009)

For practical applications, the use of top-down query-driven proof-procedures is essential for an efficient use and computation of answers using Logic Programs as knowledge bases. Additionally, abductive reasoning on demand is intrinsically a top-down search method. A query-solving engine is thus highly desirable.The current standard 2-valued semantics for Normal Logic Programs (NLPs), the Stable Models (SMs) semantics, does not allow for top-down query-solving because it does not enjoy the relevance property -- and moreover, it does not guarantee the existence of a model for every NLP. To overcome these current limitations we introduce here a new 2-valued semantics for NLPs--the Layered Models semantics -- which conservatively extends the SMs, enjoys relevance and guarantees model existence among other useful properties. Moreover, for existential query answering there is no need to compute total models, but just the partial models that sustain the answer to the query, or one might simply know a model one exists without producing it; relevance ensures these can be extended to total models.A first implementation of a query-solving engine based on this new semantics is presented and described here. It uses the XSB-Prolog engine and its XASP interface to Smodels, thereby providing a useful tool built as a hybrid of the two systems and taking advantage of the best of each.Conclusions and further work end the paper.
Shape of Elastic Strings in Euclidean Space
Authors: Washington Mio, John C. Bowers, Xiuwen Liu
Venue: International Journal of Computer Vision (2009)

We construct a 1-parameter family of geodesic shape metrics on a space of closed parametric curves in Euclidean space of any dimension. The curves are modeled on homogeneous elastic strings whose elasticity properties are described in terms of their tension and rigidity coefficients. As we change the elasticity properties, we obtain the various elastic models. The metrics are invariant under reparametrizations of the curves and induce metrics on shape space. Analysis of the geometry of the space of elastic strings and path spaces of elastic curves enables us to develop a computational model and algorithms for the estimation of geodesics and geodesic distances based on energy minimization. We also investigate a curve registration procedure that is employed in the estimation of shape distances and can be used as a general method for matching the geometric features of a family of curves. Several examples of geodesics are given and experiments are carried out to demonstrate the discriminative quality of the elastic metrics.