ppxscal/embedding_network huggingface dataset:
Improving software maintenance attitudes
Authors: Paul C. Tinnirello
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

Attitudes towards maintenance have been an overlooked source of problems in the software maintenance process. In the past, there has been little recognition of the significance of how attitudes affect the performance of maintenance functions. Investigation into the origin of these attitudes has led the author to formulate feasible solutions that foster productive attitudes through the educational and professional work environments.
A Heuristic Approach to the Passive Detection of Reno-Like TCP Flows
Authors: Miguel Rodríguez-Pérez, Manuel Fernández-Veiga, Sergio Herrería-Alonso, Cándido López-García
Venue: Network Control and Optimization: Second Euro-NF Workshop, NET-COOP 2008 Paris, France, September 8-10, 2008. Revised Selected Papers (2009)

Traditional TCP-Reno like congestion control protocols exhibit poor performance when deployed in fast or very large network paths. Delay based congestion avoidance mechanisms (DCA), like FAST-TCP, get much higher performance, in the same circumstances. However, when mixed with TCP-Reno or alike traffic they are unable to attain their fair share of bandwidth. In this paper we present a new mechanism that can indirectly detect the present of non DCA-friendly traffic that can be used by new DCA algorithms to auto-tune themselves with more aggressive parameters to achieve their fair share.
Bayesian estimation and variable selection for single index models
Authors: Hai-Bin Wang
Venue: Computational Statistics Data Analysis (2009)

We develop a fully Bayesian method to analyze the single index models, including variable selection, the index vector estimation and the link function fitting with free-knot splines. The proposed method is implemented by means of the reversible jump Markov chain Monte Carlo technique. We treat the marginal posterior of all the unknown quantities except the spline coefficients and error variance as the target distribution to reduce the dimension of the parameters and to obtain a rapid algorithm. We design a new random walk Metropolis sampler to sample from the conditional posterior distribution of the index vector. The proposed method is verified by simulation studies, and is applied to analyze two real data sets.
On inferring regional AS topologies
Authors: Yohei Kuga, Kenjiro Cho, Osamu Nakamura
Venue: Proceedings of the 4th Asian Conference on Internet Engineering (2008)

Analysis of AS-level topologies is an effective way to understand the Internet structure and its development. An AS topology represents logical connection relationships of networks, and thus, is independent of geographic locations of connections. However, the actual Internet topologies are constructed with geographical and physical limitations. In the meantime the global Internet topology is shifting from a U.S. centered star topology to a more distributed topology interconnecting regional hub ASes. Therefore, regional topology views would provide new insights to understanding changes in the Internet structures. Our goal is to understand differences and similarities amongst Internet structures in regional views such as from Europe and from Asia. We examine inference method for regional AS topologies, and compare the resulting regional AS topologies. Our inference technique extracts AS boundaries in traceroute data collected from multiple vantage points. Then, we illustrate the resulting regional AS topologies using AS Core Maps in order to identify the degree structure and AS locations in each regional view. We show that the distributions of AS out-degrees similarly follow power-law but Tier-1 ASes play different roles in regions. We also identify limitations such as the lack of vantage points in Africa and Oceania in the current data sets.
An On-the-fly Tableau-based Decision Procedure for PDL-satisfiability
Authors: Pietro Abate, Rajeev Goré, Florian Widmann
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We present a tableau-based algorithm for deciding satisfiability for propositional dynamic logic (PDL) which builds a finite rooted tree with ancestor loops and passes extra information from children to parents to separate good loops from bad loops during backtracking. It is easy to implement, with potential for parallelisation, because it constructs a pseudo-model ''on the fly'' by exploring each tableau branch independently. But its worst-case behaviour is 2EXPTIME rather than EXPTIME. A prototype implementation in the TWB (http://twb.rsise.anu.edu.au) is available.
Charge-coupled devices for memory applications
Authors: Gilbert F. Amelio
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

Since the invention of charge-coupled devices (CCD) in late 1969, the potential of the charge-coupling concept for digital memory has been recognized. Applications to image sensing and signal processing requirements have, however, preceded the application of CCD to memory. This occurred because relatively simple charge-coupled devices offered new performance potentials for image sensing and signal processing. Nonetheless, the basic shift-register nature of CCD implies that its greatest opportunity for widespread application lies in the highly competitive area of high density semiconductor memory. Today, sophisticated CCD memory components are emerging.
Dynamic server allocation in a real-life deployable communications architecture for networked games
Authors: Peter Quax, Jeroen Dierckx, Bart Cornelissen, Gert Vansichem, Wim Lamotte
Venue: Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games (2008)

Several propositions have been made in the last few years on what the optimal type of network architecture should be for networked games. Solutions range from pure peer-to-peer architectures to the classic client/server architecture with server allocation based on a fixed spatial subdivision scheme. In this paper, we elaborate on the design of ALVICNG, an extensible client/server architecture which allows for dynamic allocation of server capacity, combined with extensive means for player activity management and moderation. The framework has been designed in such a way that practical network issues such as NAT traversal are minimized. This is achieved by introducing an extra layer in the architecture, consisting of several proxy servers that channel the messages sent over the network. Besides a theoretical discussion, we will also go into the design of the simulation setup. By using this type of setup, we are able to provide actual figures that demonstrate the viability of the proposed solution.
Fast smartphones forensic analysis results through mobile internal acquisition tool and forensic farm
Authors: Rosamaria Berte, Fabio Dellutri, Antonio Grillo, Alessandro Lentini, Gianluigi Me, Vittorio Ottaviani
Venue: International Journal of Electronic Security and Digital Forensics (2009)

Market penetration of smartphones and the enriched capabilities of new devices lead to the storage of lot of data in their internal memory, providing a silent witness of digital crimes and private facts as well. This article proposes a new methodology and a tool for data acquisition by using the removable memory cards (e.g. SD, mini SD, MMC, etc.) to execute in crime scene situ. The presented methodology relies on a forensic farm where Symbian and Windows Mobile devices file system images, acquired via the tool and sent through the forensic operator mobile device, are automatically processed by a piece of software, in order to provide quick and standard results. The purpose of this quick (and general, not ad-hoc) response is to provide essential investigative information to the crime scene operator in the lowest time, in order to collect further evidences, related to the content of the sized smartphone.
A computer-based system of speech-training aids for the deaf: a progress report
Authors: R. S. Nickerson, D. N. Kalikow, K. N. Stevens
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

This paper is a progress report on an effort to develop a computer-based system of speech-training aids for the deaf. The project was begun with the assumption that an attempt to design such a system would probably fail, and that a more promising approach would be to attempt to evolve one through use. Accordingly, a system incorporating some of the capabilities that it was thought would be useful for speech training was developed, and installed at the Clarke School for the Deaf where it is now being used on an experimental basis in a remedial speech-training program. The expectation was that the capabilities of the system would be modified and extended as attempts to use it provided insights concerning what features it should have. To ensure that such insights do in fact guide the system's evolution, developers and users are engaged in a continuing dialogue concerning the desirability and feasibility of specific modifications and extensions, both in the training procedures that are used in conjunction with the system and in the characteristics of the system itself.
Computational Statistical Mechanics, 1 edition
Authors: William G. Hoover
Venue:  (1991)

Hardbound. Computational Statistical Mechanics describes the use of fast computers to simulate the equilibrium and nonequilibrium properties of gases, liquids, and solids at, and away from equilibrium. The underlying theory is developed from basic principles and illustrated by applying it to the simplest possible examples. Thermodynamics, based on the ideal gas thermometer, is related to Gibb's statistical mechanics through the use of Nos-Hoover heat reservoirs. These reservoirs use integral feedback to control temperature. The same approach is carried through to the simulation and analysis of nonequilibrium mass, momentum, and energy flows. Such a unified approach makes possible consistent mechanical definitions of temperature, stress, and heat flux which lead to a microscopic demonstration of the Second Law of Thermodynamics directly from mechanics. The intimate connection linking Lyapunov-unstable microscopic motions to macroscopic
An Expanded Lateral Interactive Clonal Selection Algorithm and Its Application
Authors: Shangce Gao, Hongwei Dai, Jianchen Zhang, Zheng Tang
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Based on the clonal selection principle proposed by Burnet, in the immune response process there is no crossover of genetic material between members of the repertoire, i.e., there is no knowledge communication during different elite pools in the previous clonal selection models. As a result, the search performance of these models is ineffective. To solve this problem, inspired by the concept of the idiotypic network theory, an expanded lateral interactive clonal selection algorithm (LICS) is put forward. In LICS, an antibody is matured not only through the somatic hypermutation and the receptor editing from the B cell, but also through the stimuli from other antibodies. The stimuli is realized by memorizing some common gene segment on the idiotypes, based on which a lateral interactive receptor editing operator is also introduced. Then, LICS is applied to several benchmark instances of the traveling salesman problem. Simulation results show the efficiency and robustness of LICS when compared to other traditional algorithms.
SurfaceWare: dynamic tagging for Microsoft Surface
Authors: Paul H. Dietz, Benjamin D. Eidelson
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

Microsoft Surface is distinguished among commercial multi-touch systems by its ability to interact with tagged objects. In this work, we examine a new class of tagged objects where the tag is dynamic---it changes in response to some sensed variable. As an example, a drinking glass is described which can sense when a refill should be offered. The glass is completely passive, containing no electronic components or moving parts, and works with an unmodified Microsoft Surface.
An Extended Algorithm to Enhance the Performance of the Gridbus Broker with Data Restoring Technique
Authors: Abu Awal Md. Shoeb, Altaf Hussain, Md. Abu Naser Bikas, Md. Khalad Hasan
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

There are various types of Grids have been developed to support different types of Applications. The Gridbus broker that mainly focused on Data Grid mediates access to distributed resources by discovering suitable data and computational resources, job monitoring, accessing local or remote data sources during job execution, collecting and presenting results. In this paper, we present an enhanced version of Grid Service Broker scheduling on Global Data Grids with job restoration point. In the present version of scheduling algorithm, if any job associated with an application becomes failed during its runtime then the scheduling algorithm just marked the job as failed and reset. But it does not keep any track of the percentage of the work has already been done by the job. In Contrast, our proposed enhanced algorithm utilizes a restore point to store the proportion of task completed by an executor. In case of failure, it starts the job from that restored point rather than its initial point. From the experimental result, we have found that our proposed algorithm increases the performance of the present scheduling algorithm.
Using Abelian Varieties to Improve Pairing-Based Cryptography
Authors: K. Rubin, A. Silverberg
Venue: Journal of Cryptology (2009)

We show that supersingular Abelian varieties can be used to obtain higher MOV security per bit, in all characteristics, than supersingular elliptic curves. We give a point compression/decompression algorithm for primitive subgroups associated with elliptic curves that gives shorter signatures, ciphertexts, or keys for the same security while using the arithmetic on supersingular elliptic curves. We determine precisely which embedding degrees are possible for simple supersingular Abelian varieties over finite fields and define some invariants that are better measures of cryptographic security than the embedding degree. We construct examples of good supersingular Abelian varieties to use in pairing-based cryptography.
Semi-physical Simulation Research of the Antenna Acquiring and Tracking System without Turn Tables
Authors: Zhai Kun, Baoyin Hexi, Qu Xi
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Simulation is an important step during the design of control systems. Based on the series tools of MATLAB\Simulink\xPC, the real-time simulation environment is constructed. By adopting the mixed modeling measures that comprise Simulink, Stateflow and S-function, models for satellite attitude dynamics, all sensors and actuators, control logics of the antenna and etc are all built successfully, then the modes selecting, scheduling and interfaces communication are realized effectively. The tracking and data relay satellite (TDRS) simulator is designed. It simplifies the experiment system. The turn table is eliminated and the experiment system can also reflect the effect of the attitude movement acting on the antenna pointing by using the TDRS simulator. The experiment results indicate that the experiment system can verify the antenna acquiring and tracking processes and is beneficial to the design of the user satellite’s antenna pointing control system for engineers.
A comprehensive strategy for contention management in software transactional memory
Authors: Michael F. Spear, Luke Dalessandro, Virendra J. Marathe, Michael L. Scott
Venue: ACM SIGPLAN Notices (2009)

In Software Transactional Memory (STM), contention management refers to the mechanisms used to ensure forward progress--to avoid livelock and starvation, and to promote throughput and fairness. Unfortunately, most past approaches to contention management were designed for obstruction-free STM frameworks, and impose significant constant-time overheads. Priority-based approaches in particular typically require that reads be visible to all transactions, an expensive property that is not easy to support in most STM systems. In this paper we present a comprehensive strategy for contention management via fair resolution of conflicts in an STM with invisible reads. Our strategy depends on (1) lazy acquisition of ownership, (2) extendable timestamps, and (3) an efficient way to capture both priority and conflicts. We introduce two mechanisms--one using Bloom filters, the other using visible read bits--that implement point (3). These mechanisms unify the notions of conflict resolution, inevitability, and transaction retry. They are orthogonal to the rest of the contention management strategy, and could be used in a wide variety of hardware and software TM systems. Experimental evaluation demonstrates that the overhead of the mechanisms is low, particularly when conflicts are rare, and that our strategy as a whole provides good throughput and fairness, including livelock and starvation freedom, even for challenging workloads.
Structured Topology for Trust in P2P Network
Authors: Biao Cai, Zhishu Li, Die Fu, Liangyin Cheng, Sida Luo
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Study of trust in P2P network now is focus on how to effectively against various malicious behaviors such as providing fake or misleading feedback about other peers and the management of the trust in a P2P environment. But the scotoma of portability that trust peer can join (leave) a certain P2P network at anytime and anywhere is seldom discussed. In this paper, a structured topology for trust management in portable P2P network based on DHT (discrete hash table) is proposed. In which includes trust management strategies and peer operations on certain DHT circle. Effectiveness and practicality of the proposed structured topology have been showed in simulation experiments at the end.
The Associative PDA 2.0: A Prototype of an Innovative Mobile System for Personal Information Management
Authors: Eileen Falke
Venue:  (2008)

Personal Information Management (PIM) deals with information that is relevant to its owner and hiseveryday life, e.g. addresses, emails, or all kindsof personal documents. Since most PIM activitieshappen in transit, mobile support is indispensable. There do exist many mobile systems to support PIM,but without any adequate solution yet. The majorcause is the lack of an appropriate underlyinginformation structure: common hierarchicalstructures are inefficient in terms of informationretrieval, which, however, constitutes an importanttask in PIM. This work addresses this and more problems. It describes a system based on anassociative network of information instead of a conventional hierarchical file system: all personal information is connected with further information, representing a semantically meaningful coherency. Information can either be associated manually or generated fully automatically from context information, such as date/time, location, and people present at a location. This book describes the development process including a long-time evaluation. It addresses all developers and designers who place value on user-friendly software.
Can i borrow your phone?: understanding concerns when sharing mobile phones
Authors: Amy K. Karlson, A.J. Bernheim Brush, Stuart Schechter
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Mobile phones are becoming increasingly personalized in terms of the data they store and the types of services they provide. At the same time, field studies have reported that there are a variety of situations in which it is natural for people to share their phones with others. However, most mobile phones support a binary security model that offers all-or-nothing access to the phone. We interviewed 12 smartphone users to explore how security and data privacy concerns affected their willingness to share their mobile phones. The diversity of guest user categorizations and associated security constraints expressed by the participants suggests the need for a security model richer than today's binary model.
Robust method to extract electrical microwave packages models
Authors: C. Pérez-vega, J. M. Zamanillo, A. Mediavilla, B. Cobo
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

This paper shows an, accurate-straightforward electrical small signal modeling technique for radifrequency and microwave packaged devices, developed by our group. This method called DICOMPAK can be used for ceramic packaged devices and for low cost plastic encapsulated devices. The technique employs analytically derived expressions and it is based on analysis of the measured scattering parameters over an adequate frequency range. Very good agreement between measured and simulated scattering parameters for different ceramic and plastic packaged devices from several foundries is shown.
Distributed scheduling of resources on interconnection networks
Authors: Benjamin W. Wah, Anthony Hicks
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

In this paper, we have studied the distributed scheduling of resources on interconnection networks. The resource scheduling problem is different from the conventional address mapping problem on interconnection networks because a request is not directed towards a particular destination address but to any one of a pool of destination addresses for free resources. To design an algorithm with the minimum transfer of control signals, priority is associated with the scheduling of multiple requests. This is illustrated by the distributed cross-bar switch which has one signal line in each direction of a switch node. For complete asynchronous operation, more signal lines are needed. This is illustrated by the distributed Omega and binary n-cube networks. Each exchange box in the network operates independently to resolve conflicts. The performance of the distributed scheduling algorithm for the Omega and cube networks is compared against the optimal centralized scheduling algorithm which has about 1% average blocking probability. The performance degradation is less than 20% in all cases. The theory of the design can be applied to other interconnection networks.
A Keyword Extraction Method Based on Lexical Chains
Authors: Xiao-Yu Jiang
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

A lexical-chain-based keywords extraction method from Chinese texts is proposed in this paper, and an algorithm for constructing lexical chains based on HowNet knowledge database is given in the method, lexical chains are firstly constructing by calculating he semantic similarity between terms, then keywords are extracted according to the lexical chain's intensity, the terms' entropy and position. Unknown word recognition and semantic information between terms are considered in this method, which can significantly improve the effectiveness of keywords extraction. The preliminary experimental results show that the method gets better performance than other methods both in accurate-matching test and approximate-matching test.