ppxscal/embedding_network huggingface dataset:
A low-voltage bandgap reference source based on the current-mode technique
Authors: Juan José Carrillo, Elkim Roa, José Vieira, Wilhelmus Van Noije
Venue: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes (2009)

A low-voltage bandgap reference source design in CMOS AMS 0.35&mu;m is presented. For establishing a voltage reference of less than 1V, the current-mode technique is used. The current consumption of the proposed design is 84&mu;A; the supply voltage is 1.2V, and presents a small die area of 0.015mm2. The average measurement results are: temperature coefficient of 114ppm/&deg;C between [-25&deg;C to 100&deg;C], output voltage of 718mV and line regulation of 1.7mV/V.
A Cross-Layer Solution for Multi-hop Wireless Network
Authors: Shi Yuhe, Xu Jie
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

Multi-hop wireless network MAC protocols typically sacrifice packet latency to achieve energy efficiency. Such delays may well increase due to routing protocol operation. For this reason it is imperative that we attempt to quantify the end-to-end delay and energy consumption when jointly using MAC and routing protocols. In order to coordinate the subproblems, cross-layer feedback mechanism is established to ensure different layer interactions. The simulations are conducted to validate the efficiency of the proposed policy.
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies
Authors: Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

This paper presents three results on the power of two-prover one-round interactive proof systems based on oracularization under the existence of prior entanglement between dishonest provers. It is proved that the two-prover one-round interactive proof system for PSPACE by Cai, Condon, and Lipton [JCSS 48:183-193, 1994] still achieves exponentially small soundness error in the existence of prior entanglement between dishonest provers (and more strongly, even if dishonest provers are allowed to use arbitrary no-signaling strategies). It follows that, unless the polynomial-time hierarchy collapses to the second level, two-prover systems are still advantageous to single-prover systems even when only malicious provers can use quantum information. It is also shown that a "dummy" question may be helpful when constructing an entanglement-resistant multi-prover system via oracularization. This affirmatively settles a question posed by Kempe et al. [FOCS 2008, pp. 447-456] and every language in NEXP is proved to have a two-prover one-round interactive proof system even against entangled provers, albeit with exponentially small gap between completeness and soundness. In other words, it is NP-hard to approximate within an inverse-polynomial the value of a classical two-prover one-round game against entangled provers. Finally, both for the above proof system for NEXP and for the quantum two-prover one-round proof system for NEXP proposed by Kempe et al., it is proved that exponentially small completeness-soundness gaps are best achievable unless soundness analysis uses the structure of the underlying system with unentangled provers.
Asynchronous Distance Education Forum - Brainstorming vs. Snowballing: A Case Study for Teaching in Programming Didactics
Authors: Kiriakos Patriarcheas, Michalis Xenos
Venue: Proceedings of the 8th International Conference on Advances in Web Based Learning (2009)

Asynchronous discussion fora all the more become part of the educational process of distance education. The goal of this research is the study of the educational techniques of Brainstorming and Snowballing to their utilisation in the frame of a distance education forum, both as far as participation and creation of learning environment and also educational effectiveness are concerned. This research refers to computer teachers' training on didactics of programming within the framework of educational micro-worlds. As it is deduced from the data analysis and the study of the messages higher participation and improvement of critical thinking are noted when Brainstorming technique is used, while fairly less time is spent and less off-topic interventions are made when Snowballing technique is used. Meanwhile, Brainstorming is found to be more advantageous than Snowballing concerning the effectiveness both in primary level (trained teachers) and in secondary level of adaptation and knowledge impartment to the students (results of their students).
Bringing Web 2.0 to the Old Web: A Platform for Parasitic Applications
Authors: Florian Alt, Albrecht Schmidt, Richard Atterer, Paul Holleis
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

It is possible to create interactive, responsive web applications that allow user-generated contributions. However, the relevant technologies have to be explicitly deployed by the authors of the web pages. In this work we present the concept of parasitic and symbiotic web applications which can be deployed on arbitrary web pages by means of a proxy-based application platform. Such applications are capable of inserting, editing and deleting the content of web pages. We use an HTTP proxy in order to insert JavaScript code on each web page that is delivered from the web server to the browser. Additionally we use a database server hosting user-generated scripts as well as high-level APIs allowing for implementing customized web applications. Our approach is capable of cooperating with existing web pages by using shared standards (e.g. formatting of the structure on DOM level) and common APIs but also allows for user-generated (parasitic) applications on arbitrary web pages without the need for cooperation by the page owner.
Dynamic Routing Strategies Based on Local Topological Information of Scale-free Network
Authors: Wei Shi, Zheng Zhao
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

In this paper, we first propose a traffic model based on scale-free network to investigate the connections between the topology of a network and the routing strategies work on it. Then, we put forward a topology function with a tunable exponential parameter to represent the static part of local routing strategies. In order to make routing algorithms still work well even when the network falls into a congested state, we add the dynamic ingredient into them so that packets could avoid those congesting nodes when traffic jam occurs. In order to maximize the throughput of the network, we investigate the performance of a class of routing strategies that based on degree of nodes and put forward a new class of dynamic local routing strategies based on probabilistic betweenness of nodes. Experimental results show that the new class of algorithms work well even when the traffic of the network is very heavy.
The GOD model
Authors: Alfio Massimiliano Gliozzo
Venue: Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Posters & Demonstrations (2006)

GOD (General Ontology Discovery) is an unsupervised system to extract semantic relations among domain specific entities and concepts from texts. Operationally, it acts as a search engine returning a set of true predicates regarding the query instead of the usual ranked list of relevant documents. Our approach relies on two basic assumptions: (i) paradigmatic relations can be established only among terms in the same Semantic Domain an (ii) they can be inferred from texts by analyzing the Subject-Verb-Object patterns where two domain specific terms co-occur. A qualitative analysis of the system output shows that GOD provide true, informative and meaningful relations in a very efficient way.
Detection of Arterial Calcification in Mammograms by Random Walks
Authors: Jie-Zhi Cheng, Elodia B. Cole, Etta D. Pisano, Dinggang Shen
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

A fully automatic algorithm is developed for breast arterial calcification extraction in mammograms. This algorithm is implemented in two major steps: a random-walk based tracking step and a compiling and linking step. With given seeds from detected calcification points, the tracking algorithm traverses the vesselness map by exploring the uncertainties of three tracking factors, i.e., traversing direction, jumping distance, and vesselness value, to generate all possible sampling paths. The compiling and linking algorithm further organizes and groups all sampling paths into calcified vessel tracts. The experimental results show that the performance of the proposed automatic calcification extraction algorithm is statistically close to that obtained by manual delineations.
Seeking Quality through User-Goal Monitoring
Authors: William N. Robinson
Venue: IEEE Software (2009)

Software quality is determined by the processes of its evolution, which are guided by changing requirements. Users drive many requirements changes. Users perceive software quality as a fit between their goals and software's functionality. The better the quality, the more likely the user will be satisfied with the software. When the quality is bad, developers must meet user needs or face a diminishing demand for their software. Understanding and monitoring user requirements is central to the continuous process of seeking software quality. An automated user-goal monitoring technique can guide software evolution toward higher quality.
Prediction of Reservior Runoff Using RBF Neural Network-Grey System United Model
Authors: Juan Zhang, Changjun Zhu
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

At present, classic methods are used to predict reservoir runoff, but the result is not ideal. Due to the shortages of neural network and grey system, in this paper, a grey neural network model is set up based on grey and neural network theory. The data got from the GM (1,4) on the factors affecting the reservoir runoff is used as the input of the neural network and the origin data of reservoir runoff are used as the output of neural network which was trained to get the optimal structure of neural network. The results show that the model had highly fitting and predicting precision advantages than other model had. The case study shows that the model is quite accurate in prediction reservoir runoff, which has some project referential value.
Physical Fidelity: Exploring the Importance of Physicality on Physical-Digital Conceptual Prototyping
Authors: Joanna Hare, Steve Gill, Gareth Loudon, Devina Ramduny-Ellis, Alan Dix
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

The physicality of digital-physical devices is an essential part of our interaction and understanding of information appliances. This paper draws on the findings of an empirical study investigating the effect of physical fidelity on a series of user trials. Three prototypes of a single design intent were built, the standard of their construction dictated by the time imposed on the designer. In choosing this constraint, the authors present the argument that the most important driver in decisions that dictate fidelity levels is the available and/or necessary time required for making a prototype in order to generate information of the right quality. This paper presents the empirical and qualitative results of the trials, which suggest that there is little effect of fidelity on user performance, but the user's ability to give constructive feedback on the design was influenced by the nature of the prototypes.
A New Eigenmode Construction Method for MIMO-OFDM Systems
Authors: Liu Jiancai
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

The eigenmode decomposition of spatial channel is the preconditions of adaptive power allocations in the present MIMO-OFDM systems. These eigenmodes are generally obtained by the singular value decompositions of the channel matrix at every carrier. However, the decomposition in this way ignored the effects of space-time codes on system performance and it has great complexity for the case with a large number of carriers. A new eigenmode decomposition is proposed to integrate the space time codes in system models, which could be conducted simultaneously by many carriers with simple implementation. Numerical results show that the new eigenmode decomposition is more robust than the classical approaches.
Secure Broadcast in Wireless Sensor Networks
Authors: Qian Yu, Chang N. Zhang
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

In this paper we present a secure broadcast scheme for wireless sensor networks. The proposed scheme provides data confidentiality, data authentication, data integrity, and data freshness with low overhead and simple operation. Since it allows delayed and lost packets, the secure broadcast is supported. Furthermore, it eliminates the requirement of frequent key renewal to overcome a special limitation of the stream ciphers. Due to the simplicity, efficiency, and security, the proposed scheme is a competitive solution to provide secure broadcast in wireless sensor networks.
Analysing Dependability Case Arguments Using Quality Models
Authors: Michaela Huhn, Axel Zechner
Venue: Proceedings of the 28th International Conference on Computer Safety, Reliability, and Security (2009)

The Goal Structuring Notation (GSN)[1] facilitates a clear presentation of the argument structure in dependability cases for dependable systems. However, assessment of an argument structure with respect to validity, sufficiency and consistency of argumentation and the provided evidence still strongly depends on individual, tacit expert knowledge. We propose a 2-phase analysis method for argument structures:Firstly, syntactic completeness, consistency, and proper instantiation of argument patterns are examined using a UML profile for GSN and OCL constraints. For the second phase, we propose 2-dimensional quality models to assist the expert in explicitly judging on the conclusiveness of argumentation. A quality model explicitly represents the impact of facts on design activities and software-system's properties relevant for dependability. The impact value aggregates state-of-the-art knowledge and standard's recommendations. Missing, negative or conflicting impact indicates impairment of the argument either by revealing a gap in the line of arguments or incompatibilities or opposing principles between decisions or techniques in the process. We show first steps towards the integration of the analysis into model-based tool supported development.
Universal Access to the Internet Web Pages for Users with Special Needs
Authors: Pavel Ocenasek
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

This paper presents a system that provides access to the web pages for internet users with special needs. The first part introduces the accessibility of common web sites. The second part follows with the system concept that is based on regular expression translator. The final part concludes with the practical results of web pages translation.
Causes of Simultaneous Keystrokes in Children and Adults
Authors: Akiyo Kano, Janet C. Read
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

Simultaneously pressing two keys on a keyboard (Zero Time keystrokes) is a unique typing occurrence. To understand the cause of Zero Time keystrokes, typing data were collected from young children and undergraduate computing students. The results show that, in both students and children, the most frequent cause of Zero Time keystrokes were errors in aiming for the intended key, resulting in the intended and an adjacent key being pressed together. The second most frequent errors were Transposition Errors, which were errors in the ordering of the intended two letters.
Perpetual learning for non-cooperative multiple agents
Authors: Luke Dickens
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

This paper examines, by argument, the dynamics of sequences of behavioural choices made, when non-cooperative restricted-memory agents learn in partially observable stochastic games. These sequences of combined agent strategies (joint-policies) can be thought of as a walk through the space of all possible joint-policies. We argue that this walk, while containing random elements, is also driven by each agent's drive to improve their current situation at each point, and posit a learning pressure field across policy space to represent this drive. Different learning choices may skew this learning pressure, and affect the simultaneous joint learning of multiple agents.
An intelligent travel book management system
Authors: Han-Bin Chang, Hsuan-Pu Chang, Hui-Huang Hsu, Louis R. Chao, Timothy K. Shih
Venue: International Journal of Ad Hoc and Ubiquitous Computing (2009)

Travelling is a common activity for pleasures nowadays. With the development of transportation, visitors can easily make tours anywhere. They often use various digital devices such as video cameras to capture images during journeys. Due to the convenience of internet, more and more users make travel notes and share experience to other users via web pages. In this paper, an intelligent travel book management system is proposed to help users to easily handle multimedia information captured in a journey and repackage them for further usage. Internet technologies like agent and mobile computing are used for implementing such framework.
A Combined Decimal and Binary Floating-Point Multiplier
Authors: Charles Tsen, Sonia Gonzalez-Navarro, Michael Schulte, Brian Hickmann, Katherine Compton
Venue: Proceedings of the 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors (2009)

In this paper, we describe the first hardware design of a combined binary and decimal floating-point multiplier, based on specifications in the IEEE 754-2008 Floating-point Standard. The multiplier design operates on either (1) 64-bit binary encoded decimal floating-point (DFP) numbers or (2) 64-bit binary floating-point (BFP) numbers. It returns properly rounded results for the rounding modes specified in IEEE 754-2008. The design shares the following hardware resources between the two floating-point datatypes: a 54-bit by 54-bit binary multiplier, portions of the operand encoding/decoding, a 54-bit right shifter, exponent calculation logic, and rounding logic. Our synthesis results show that hardware sharing is feasible and has a reasonable impact on area, latency, and delay.The combined BFP and DFP multiplier occupies only 58% of the total area that would be required by separate BFP and DFP units. Furthermore, the critical path delay of a combined multiplier has a negligible increase over a standalone DFP multiplier, without increasing the number of cycles to perform eitherBFP or DFP multiplication.
Enhanced Multiple-Shift Scheme for Rapid Code Acquisition in Optical CDMA Systems
Authors: Dahae Chong, Taeung Yoon, Youngyoon Lee, Chonghan Song, Myungsoo Lee, Seokho Yoon
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

In this paper, we propose a novel code acquisition scheme called enhanced multiple-shift (EMS) for optical code division multiple access (CDMA) systems. By using multiple thresholds, the proposed EMS scheme provides a shorter mean acquisition time (MAT) than that of the conventional mutiple-shift (MS) scheme. The simulation results demonstrate that the MAT of EMS scheme is shorter than that of MS scheme in both single-user and multi-user environments.
Detection of multiple deformable objects using PCA-SIFT
Authors: Stefan Zickler, Alexei Efros
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

In this paper, we address the problem of identifying and localizing multiple instances of highly deformable objects in real-time video data. We present an approach which uses PCA-SIFT (Scale Invariant Feature Transform) in combination with a clustered voting scheme to achieve detection and localization of multiple objects while providing robustness against rapid shape deformation, partial occlusion, and perspective changes. We test our approach in two highly deformable robot domains and evaluate Its performance using ROC (Receiver Operating Characteristic) statistics.
Population-based simulated annealing for traveling tournaments
Authors: Pascal Van Hentenryck, Yannis Vergados
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

This paper reconsiders the travelling tournament problem, a complex sport-scheduling application which has attracted significant interest recently. It proposes a population-based simulated annealing algorithm With both itensification and diversitication. The algorithm is organized as a series of simulated annealing waves, each wave being followed by a macro-intensification. The diversification is obtained through the concept of elite runs that opportunistically survive waves. A parallel implementation of the algorithm on a cluster of workstations exhibits remarkable results. It improves the best known solutions on all considered benchmarks, sometimes reduces the optimality gap by about 60%, and produces novel best solutions on instances that had been stable for several years.
The Factor Structure of the System Usability Scale
Authors: James R. Lewis, Jeff Sauro
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

Since its introduction in 1986, the 10-item System Usability Scale (SUS) has been assumed to be unidimensional. Factor analysis of two independent SUS data sets reveals that the SUS actually has two factors --- Usable (8 items) and Learnable (2 items --- specifically, Items 4 and 10). These new scales have reasonable reliability (coefficient alpha of .91 and .70, respectively). They correlate highly with the overall SUS (r = .985 and .784, respectively) and correlate significantly with one another (r = .664), but at a low enough level to use as separate scales. A sensitivity analysis using data from 19 tests had a significant Test by Scale interaction, providing additional evidence of the differential utility of the new scales. Practitioners can continue to use the current SUS as is, but, at no extra cost, can also take advantage of these new scales to extract additional information from their SUS data. The data support the use of "awkward" rather than "cumbersome" in Item 8.
Formal Verification of Exact Computations Using Newton's Method
Authors: Nicolas Julien, Ioana Paşca
Venue: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics (2009)

We are interested in the verification of Newton's method. We use a formalization of the convergence and stability of the method done with the axiomatic real numbers of Coq's Standard Library in order to validate the computation with Newton's method done with a library of exact real arithmetic based on co-inductive streams. The contribution of this work is twofold. Firstly, based on Newton's method, we design and prove correct an algorithm on streams for computing the root of a real function in a lazy manner. Secondly, we prove that rounding at each step in Newton's method still yields a convergent process with an accurate correlation between the precision of the input and that of the result. An algorithm including rounding turns out to be much more efficient.