ppxscal/embedding_network huggingface dataset:
Retransmission Strategies for Wireless Connections with Resource-Limited Devices
Authors: Lavy Libman
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

Protocols designed to provide error-free communications over lossy links commonly employ the idea of sliding windows, which is based on the Go-Back-N automatic repeat request (ARQ) scheme. Unless the packet error rate is extremely small, this scheme is known to perform poorly in connections with high bandwidth and round-trip delay. The methods typically used to address this drawback, such as selective repeat (SR) feedback and forward error correction (FEC), carry a cost in terms of memory requirements (e.g. buffers for out-of-order packets), implementation complexity, and extra computation time, and therefore energy consumption. While this is not a major consideration in traditional wired networks, it implies that such methods are unsuitable for certain applications involving wireless devices with severe resource limitations, e.g. in sensor networks. In this work, we focus on low-key bufferless receivers, incapable of accepting out-of-order packets or decoding FEC codes; consequently, the only possible way to increase the throughput efficiency above that of the Go-Back-N scheme is by advance packet retransmission. We carry out a detailed study of the fundamental performance bounds achieveable by advance retransmission strategies, show that schemes based on a fixed number of packet repetitions are suboptimal, and describe a novel heuristic approach, called Maximum Expected Advance First, which is shown to be asymptotically optimal and attain a significant throughput gain over Go-Back-N, without requiring any enhancements or additional resources at the receiver.
Can it be as effective? Distance versus blended learning in a web-based EAP programme
Authors: Mihye Harker, Dmitra Koutsantoni
Venue: ReCALL (2005)

This paper discusses the effectiveness of a web-based learning programme of English for Academic Purposes (EAP) for British students from ethnic minority backgrounds. Original web-based materials for English for Academic Purposes (EAP) were developed and 43 student volunteers participated in two different modes of learning during the 9-week long programme: through blended learning and at a distance. The study attempts to investigate which mode of delivery is more effective in terms of student retention, achievement levels and satisfaction with the programme. The study found that the blended learning mode was much more effective in student retention in this non-credit bearing programme, whilst students&rsquo; achievement levels were similar in both groups. In addition, formative and summative feedback from the students suggests that most students in both groups were satisfied with this web-based EAP programme.
The evolutionary computation approach to motif discovery in biological sequences
Authors: Michael A. Lones, Andy M. Tyrrell
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Finding motifs &mdash; patterns of conserved residues &mdash; within nucleotide and protein sequences is a key part of understanding function and regulation within biological systems. This paper presents a review of current approaches to motif discovery, both evolutionary computation based and otherwise, and a speculative look at the advantages of the evolutionary computation approach and where it might lead us in the future. Particular attention is given to the problem of characterising regulatory DNA motifs and the value of expressive representations for providing accurate classification.
Series resistance calculation for Ag contacts on single crystal layered p-SnS and p-SnSe compound semiconductors in the wide temperature range
Authors: S. Karadeniz, N. Tugluoglu, M. Şahin, H. Şafak
Venue: Microelectronic Engineering (2005)

This paper summarizes the first results of characteristics parameters obtained from current-voltage (I-V) measurements for Ag/p-SnS and Ag/p-SnSe structure. The reverse and forward bias current-voltage characteristics of Ag Schottky contacts on a Bridgman-Stockbarger grown p-SnS and p-SnSe layered semiconducting material have been measured at various temperatures. We have tried to determine contact properties such as apparent barrier heights @F"B"0, ideality factor n and series resistance R"s. The apparent barrier height and ideality factor calculated by using thermionic emission theory were found to be strongly temperature dependent. Evaluating forward I-V data reveals a decrease at the apparent barrier height, but an increase at the ideality factor with decrease in temperature. It is shown that the values of R"s estimated from Cheung's method were strongly temperature dependent and decreased with increasing temperature. It has been found that both contacts are of Schottky type.
Corporate Portal as Security Backbone
Authors: Uwe Maurer
Venue: Proceedings of the First IEEE International Workshop on Critical Infrastructure Protection (2005)

Network topologies found in audits and reviews are not capable to fulfil the needs of security and flexiblity. Specialized networks and protection systems increase the complexity and reduce the overall security. Central corporate portals can be used as IT-security backbones. Constructing the corporate portals with reverse-proxy technology and with internal firewalls will secure, that no connection to sensible data or central systems will be possible without the central control. Not only the IT-security will benefit, also the flexibility increases and the costs for operating and support will decrease. The author will present a praxisrelevant approach and some ideas about the migration.
A short presentation of the SIMULA programming language
Authors: Jacob Palme
Venue: ACM SIGSIM Simulation Digest (1974)

SIMULA is an advanced programming language comparable in power to PL/I or Algol 68. SIMULA is an extension of Algol 60 and contains amost the whole of Algol 60 as a subset. In addition to this, the language contains features for list structures, text processing, direct access i/o, formatted i/o, quasiparallel processes (coroutines) and discrete event simulations.
Optimal Filtering Techniques for Analytical Streamflow Forecasting
Authors: Vinay Kantamneni, Dan Simon, Stuart Schwartz
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

This paper describes the development of a streamflow forecasting model based on the Sacramento Soil Moisture Accounting Model and applies optimal filtering techniques to sequentially update watershed-scale soil moisture state values, to improve streamflow predictions. In general hydrology is the study of the waters of the earth, especially with relation to the effects of precipitation and evaporation upon the occurrence and character of water in streams, lakes and water on or below the land surface. The Sacramento model is a hydrologic simulation model developed by the National Weaterer service, and used throughout the nation for operational streamflow forecasting. Here optimal filtering techniques are used in order to predict hydrological variables. An H-infinity filter is used to update daily estimates of the water content in model states representing watershed-scale soil moisture storage. Updated soil moisture storages are then used to predict daily streamflow. The output from the estimator is then compared with the model output without state updating.
A QoS-based GFAM Scheduling Approach for Manufacturing Grid
Authors: Liu Lilan, Yu Tao, He Yuan
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In order to resolve resource scheduling problem in Manufacturing Grid (MG) to handle dynamic changes in the availability of manufacturing resources and user requirements, and to provide scalable, controllable, measurable, and easily enforceable policies for the management of manufacturing resources, we propose a QoS (Quality of Service)-based scheduling system - Manufacturing Grid Resource Scheduler (MGRS). In MGRS, we make some necessary definitions, such as the QoS-based manufacturing task/sub-task, QoSbased manufacturing resource, and then deduce the Resource-Task Matching (RTM) matrix for resource scheduling. Based on these definitions and deductions, this paper sets up the Group decision-making Fuzzy Analytic hierarchy process Model (GFAM), with resources' QoS attributes as the evaluation criteria, and the Fuzzy Analytic Hierarchy Process (FAHP) and Group Decision-Making (GDM) as the arithmetic basis. The goal of the GFAM is to select a most suitable resource from the authorized resource lists to match each submitted task with the better QoS performance, such as the higher user satisfaction, product quality and service, as well as the lower failure rate, time-to-market, and cost, etc. Furthermore, the GFAM model is applied in MG, and the results show that it is a very useful solution for resource scheduling during the process of products manufacturing.
A Search Algorithm for a Class of Optimal Finite-Precision Controller Realization Problems with Saddle Points
Authors: Jun Wu, Sheng Chen, Gang Li, Jian Chu
Venue: SIAM Journal on Control and Optimization (2005)

With game theory, we review the optimal digital controller realization problems that maximize a finite word length (FWL) closed-loop stability measure. For a large class of these optimal FWL controller realization problems which have saddle points, a minimax-based search algorithm is derived for finding a global optimal solution. The algorithm consists of two stages. In the first stage, the closed form of a transformation set is constructed which contains global optimal solutions. In the second stage, a subgradient approach searches this transformation set to obtain a global optimal solution. This algorithm does not suffer from the usual drawbacks associated with using direct numerical optimization methods to tackle these FWL realization problems. Furthermore, for a small class of optimal FWL controller realization problems which have no saddle point, the proposed algorithm also provides useful information to help solve them.
On the Effect of Stuck-at Faults on Delay-insensitive Nanoscale Circuits
Authors: J. Di, P. K. Lala, D. Vasudevan
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

Nanocomputing system design has been attracting attention in recent years. Regular structure and reliable timing control are the two requirements to implement nanoscale circuits. A cellular array has highly regular structure. The cells are adjacent to each other and are able to process signals based on simple transition rules. In delay-insensitive circuits the delay on a signal path does not affect circuit behavior. The combination of delayinsensitive circuits and cellular arrays make it feasible to implement silicon-based nanoscale circuits. However, little work has been done on the test of such circuits. This paper provides a complete analysis of the effect of stuck-at faults in delay-insensitive circuits on cellular arrays.
Verification of an Off-Line Checker for Priority Queues
Authors: Hans De Nivelle, Ruzica Piskac
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

We formally verify the result checker for priority queues that is implemented in LEDA. We have developed a method, based on the notion of implementation, which links abstract specifications to concrete implementations. The method allows non-determinism in the abstract specifications that the concrete implementations have to fill in. We have formally verified that, if the checker has not reported an error up to a certain moment, then the structure it checks has behaved like a priority queue up to that moment. For the verification, we have used the first-order theorem prover Saturate.
Using a low-memory factored representation to data mine large data sets
Authors: Daniel Boley
Venue:  (2005)

As data sets have continued to grow in size, it has become more difficult to mine them efficiently. A data set may be dynamic, or may be static but very large. The data could be arriving in a stream, such that the total number of data points is finite and unknown or infinite. Many data mining methods require multiple passes over the data, which means that the data must reside in memory to keep costs low. One alternative to mining the original data is to create a representation of the data set which occupies less memory, while permitting the incorporation of new data. To this end, we present the Low-Memory Factored Representation (LMFR). The LMFR is an alternate representation of the data which uses less memory, while maintaining a unique representation for each data point. Since the LMFR provides a general representation of the data, the data mining task does not need to be determined before the LMFR is constructed. For streaming data, the LMFR allows for many more data points to be exposed a given method at once. Furthermore, the LMFR can be re-computed on the fly to lower its memory footprint without re-examining the original data. We demonstrate experimentally that the LMFR can be an efficient replacement for the original data when clustering using Principal Direction Divisive Partitioning (PDDP). This new clustering method, Piecemeal PDDP (PMPDDP), maintains the scalability and quality of a PDDP clustering while extending PDDP to much larger data sets. We demonstrate experimentally that the LMFR can be used for document retrieval. A given LMFR can achieve retrieval accuracy superior to the truncated singular value decomposition of a given rank, while being less expensive to compute and occupying less memory. We also develop an application of the LMFR to streaming data mining, and show experimentally the cost of various techniques which lower the memory footprint of the LMFR. The overall results indicate that the LMFR has many possible applications in general data mining tasks.
Sonically-enhanced widgets: Comments on Brewster and Clarke, ICAD 1997
Authors: Stephen A. Brewster
Venue: ACM Transactions on Applied Perception (TAP) (2005)

This paper presents a review of the research surrounding the paper &ldquo;The Design and Evaluation of a Sonically Enhanced Tool Palette&rdquo; by Brewster and Clarke from ICAD 1997. A historical perspective is given followed by a discussion of how this work has fed into current developments in the area.
An Efficient Search Algorithm of Worst-Case Cache Flush Timings
Authors: Hiroshi Miyamoto, Shinichi Iiyama, Hiroyuki Tomiyama, Hiroaki Takada, Hiroshi Nakashima
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

In recent years, the use of cache memory has been desired in hard real-time systems in order to reduce the memory access time. To enable it, accurate analysis of the worst-case execution time considering cache flushes is necessary since the cache may be flushed by preempting tasks in a multitask environment. This paper proposes a method to find the worst-case timing of cache flushes and demonstrates its effectiveness.
Reducing Instruction Fetch Cost by Packing Instructions into RegisterWindows
Authors: Stephen Hines, Gary Tyson, David Whalley
Venue: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture (2005)

Instruction packing is a combination compiler/ architectural approach that allows for decreased code size, reduced power consumption and improved performance. The packing is obtained by placing frequently occurring instructions into an Instruction Register File (IRF). Multiple IRF entries can then be accessed using special packed instructions. Previous IRF efforts focused on using a single 32-entry register file for the duration of an application. This paper presents software and hardware extensions to the IRF supporting multiple instruction register windows to allow a greater number of relevant instructions to be available for packing in each function. Windows are shared among similar functions to reduce the overall costs involved in such an approach. The results indicate that significant improvements in instruction fetch cost can be obtained by using this simple architectural enhancement. We also show that using an IRF with a loop cache, which is also used to reduce energy consumption, results in much less energy consumption than using either feature in isolation.
A Pipeline for Rapidly Incorporating Real Objects into a Mixed Environment
Authors: Xiyong Wang, Aaron Kotranza, John Quarles, Benjamin Lok, B. Danette Allen
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

A method is presented to rapidly incorporate real objects into virtual environments using laser scanned 3D models with color-based marker tracking. Both the real objects and their geometric models are put into a Mixed Environment (ME). In the ME, users can manipulate the scanned, articulated real objects, such as tools, parts, and physical correlates to complex computer-aided design (CAD) models. Our aim is to allow engineering teams to effectively conduct hands-on assembly design verification. This task would be simulated at a high degree of fidelity, and would benefit from the natural interaction afforded by a ME with many specific real objects.
Haplotype Phasing Using Semidefinite Programming
Authors: Konstantinos Kalpakis, Parag Namjoshi
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

Diploid organisms, such as humans, inherit one copy of each chromosome (haplotype) from each parent. The conflationof inherited haplotypes is called the genotype of the organism. In many disease association studies, the haplo-type data is more informative than the genotype data. Unfortunately, getting haplotype data experimentally is both expensive and difficult. The haplotype inference with pure parsimony (HPP) problem is the problem of finding a minimal set of haplotypes that resolve a given set of genotypes. We provide a Quadratic Integer Programming (QIP) formulation for the HPP problem, and describe an algorithm for the HPP problem based on a semi-definite programming (SDP) relaxation of that QIP program. We compare our approach with existing approaches. Further, we show that the proposed approach is capable of incorporating a variety of additional constraints, such as missing or erroneous genotype data, outliers etc.
An ambient intelligence platform for physical play
Authors: Ron Wakkary, Marek Hatala, Robb Lovell, Milena Droumeva
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

This paper describes an ambient intelligent prototype known as socio-ec(h)o. socio-ec(h)o explores the design and implementation of a system for sensing and display, user modeling, and interaction models based on a game structure. The game structure includes, word puzzles, levels, body states, goals and game skills. Body states are body movements and positions that players must discover in order to complete a level and in turn represent a learned game skill. The paper provides an overview of background concepts and related research. We describe the prototype and game structure, provide a technical description of the prototype and discuss technical issues related to sensing, reasoning and display. The paper contributes by providing a method for constructing group parameters from individual parameters with real-time motion capture data; and a model for mapping the trajectory of participant's actions in order to determine an intensity level used to manage the experience flow of the game and its representation in audio and visual display. We conclude with a discussion of known and outstanding technical issues, and future research.
Proving Correctness of JavaCard DL Taclets using Bali
Authors: Kerry Trentelman
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

Developed at the University of Karlsruhe, KeY is an augmented commercial CASE tool with specification and deductive verification functionalities. Recently, lightweight, stand-alone tactics or "taclets" have been introduced in order to implement the JavaCard Dynamic Logic (JavaCard DL) sequent calculus within KeY. JavaCard DL captures the semantics of JavaCard, the subset of Java designed to run on smart cards. This paper discusses a case-study into proving taclets sound using the independent Bali formalism of Java in the theorem prover Isabelle/HOL. Rather than taking a foundational approach by embedding the entire JavaCard DL semantics directly into a theorem prover, we instead translate each taclet and prove its soundness via the Bali calculus. We analyse both calculi, prove three pivotal taclets sound, and argue whether the method is useful in proving the correctness of JavaCard programs overall.
Dynamic Delivery of Software Development Curriculum
Authors: Allan Fisher, Jill Fain Lehman
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

"Courseware" may have replaced traditional textbooks as the source of pedagogy in modern classrooms, but the problem of keeping curriculum in sync with changing needs remains. We present one approach to meeting those needs: dynamic curriculum delivery. In this approach, analysis of data from student performance, feedback from teachers, and the ongoing use of expert knowledge from the field keep courseware up to date, relevant, and consistent with the educational goals of the school, teachers, and students, in a variety of educational and cultural contexts.
Searching for clues: Diagnosing IC failures
Authors: Scott Davidson
Venue: IEEE Design Test (2006)

Reviewed in this issue Data Mining and Diagnosing IC Fails, by Leendert M. Huisman (Springer, 2005, ISBN 0-387-24993-1, 250 pp., $129). As ICs grow in size, finding a failure's cause has become more and more difficult. This book describes how statistical methods can help uncover the source of a problem using data provided by IC test. It discusses failures during IC manufacture, rather than at the board or assembly level or in the field. Even though the title does not indicate it, much of this book is devoted to yield enhancement, which makes it far more interesting than if it were completely devoted to traditional diagnosis.
A Low-Power Reconfigurable Analog Filter for UMTS/WLAN Receivers
Authors: Stefano D'Amico, Vito Giannini, Andrea Baschirotto
Venue: Analog Integrated Circuits and Signal Processing (2006)

A low-power analog filter able to be reconfigured in order to be used in UMTS and WLAN applications is reported. The 4th order low-pass continuous-time filter is going to be included in the receiver path of a reconfigurable terminal. The filter is made up by the cascade of two Active-G$_m$-RC low-pass biquadratic cells. The unity-gain-bandwidth of the opamps embedded in the Active-G$_m$-RC cells is comparable to the filter cut-off frequency. Thus, the power consumption of the opamp can be strongly reduced. In addition, the filter can be programmed in order to process UMTS and WLAN signals, while a little area overhead is required since the filter can share capacitors as well as opamps in both operations modes. The cut-off frequency deviation due to the technological spread, aging and temperature variation is adjusted by using a tuning circuit.The full device in a 0.13 ¿$m CMOS technology occupies a 2.8 mm2area.
Extending a scripting language for visual basic forms
Authors: Robert M. Siegfried, Denis Diakoniarakis, Kenneth G. Franqueiro, Amol Jain
Venue: ACM SIGPLAN Notices (2005)

A prototype scripting language was introduced in 2002 to assist the blind in creating forms for Visual Basic programs in a much simpler fashion; currently, creating these forms are particularly difficult for the blind and visually impaired. The language is expanded to include the Visual Basic objects that were omitted from the original grammar for the scripting language. A second prototype of the compiler for the scripting language is now available online. An example and a formal grammar are included.