ppxscal/embedding_network huggingface dataset:
Implementation of recursive search algorithms in reconfigurable hardware
Authors: Iouliia Skliarova
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

By adapting to computations that are not so well supported by general-purpose processors, reconfigurable systems achieve significant increases in performance. A great deal of research effort in this area is aimed at accelerating the solution of combinatorial optimization problems. However, hardware description languages (such as VHDL) as well as system-level specification languages (such as Handel-C) that are usually employed for specifying the required functionality of reconfigurable systems do not provide a direct support for recursion. In this paper a method allowing recursive algorithms to be easily described in Handel-C and implemented in an FPGA (field-programmable gate array) is proposed. The recursive search algorithm for the knapsack problem is considered as an example. The required hardware support is provided by a recursive hierarchical finite state machine model.
Perception Strategies in Modal-Redistributed Interaction
Authors: Toni Pakkanen, Roope Raisamo
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Computer interfaces provide information to users mostly graphically. This method of presentation is not suitable for the visually impaired or for users in situations where interaction is limited, like in mobile context. One possibility to present information to these kinds of users would be using melodic sounds and haptic feedback to replace graphical information. We describe a new method to redistribute graphical information to melodic sounds and haptic cues with a stick interface. We discuss the impact of this redistribution to user behavior in simple shape recognition tasks. Appropriateness of redistribution is evaluated and design recommendations given based on user behavior in modal-redistributed interaction.
An intelligent tutor for high school algebra problems: Oregon State University
Authors: W. S. Bregar, A. M. Farley
Venue: Issue 79 (January 1982) (1982)

This is an ongoing research project whose goal is to build a system for tutoring students to interpret and solve high school algebra level word problems. Until now, the major emphasis has been on the development of a model of problem solving based on protocols between tutors and students. Our model currently consists of four sets of production rules which account for strategies, computations on problem entities, algebraic manipulations, and semantics of the problem statement.
Resource-Aware Distributed Stream Management Using Dynamic Overlays
Authors: Vibhore Kumar, Brian F. Cooper, Zhongtang Cai, Greg Eisenhauer, Karsten Schwan
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

We consider distributed applications that continuously stream data across the network, where data needs to be aggregated and processed to produce a 'useful' stream of updates. Centralized approaches to performing data aggregation suffer from high communication overheads, lack of scalability, and unpredictably high processing workloads at central servers. This paper describes a scalable and efficient solution to distributed stream management based on (1) resource-awareness, which is middleware-level knowledge of underlying network and processing resources, (2) overlay-based in-network data aggregation, and (3) high-level programming constructs to describe data-flow graphs for composing useful streams. Technical contributions include a novel algorithm based on resource-aware network partitioning to support dynamic deployment of dataflow graph components across the network, where efficiency of the deployed overlay is maintained by making use of partition-level resource-awareness. Contributions also include efficient middleware-based support for component deployment, utilizing runtime code generation rather than interpretation techniques, thereby addressing both high performance and resource-constrained applications. Finally, simulation experiments and benchmarks attained with actual operational data corroborate this paper's claims.
Comparing Classification Metrics for Labeling Segmented Remote Sensing Images
Authors: Philippe Maillard, David A. Clausi
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Image segmentation and labelling are the two conceptual operations in image classification. As the remote sensing community uses more powerful segmentation procedures with spatial constraint, new possibilities can be explored for labelling. Instead of assigning a label to a single observation (pixel), whole segments of image are labelled at once implying the use of multivariate samples rather than pixel vectors. This approach to image classification also offers new possibilities for using a priori information about the classes such as existing maps or object signature libraries. The present paper addresses the two issues. First a labelling scheme is presented that gathers evidence about the classes from incomplete a priori information using a "cognitive reasoning" approach. Then, five different metrics are compared for the label assignment and are combined through a voting scheme. The results show that very different results can be obtained depending on the metric chosen. The metric combination through voting, being a suboptimal approach does not necessarily provide the best results but could be a safe alternative to choosing only one metric.
Modelling the Information-Seeking Behaviour of Programmers - An Empirical Approach
Authors: Michael P. O'Brien, Jim Buckley
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

Information seeking has been recognised as a core subtask in software maintenance. This paper reviews, merges, and adapts existing information seeking models for different domains to propose a non-linear information-seeking model for programmers involved in software maintenance. Talk-aloud data from two empirical studies of industrial programmers carrying out real software maintenance tasks is presented, to illustrate and validate (in part) this model.
Statistical relationships between downloads and citations at the level of individual documents within a single journal: Book Reviews
Authors: Henk F. Moed
Venue: Journal of the American Society for Information Science and Technology (2005)

Statistical relationships between downloads from ScienceDirect of documents in Elsevier's electronic journal Tetrahedron Letters and citations to these documents recorded in journals processed by the Institute for Scientific Information&sol;Thomson Scientific for the Science Citation Index (SCI) are examined. A synchronous approach revealed that downloads and citations show different patterns of obsolescence of the used materials. The former can be adequately described by a model consisting of the sum of two negative exponential functions, representing an ephemeral and a residual factor, whereas the decline phase of the latter conforms to a simple exponential function with a decay constant statistically similar to that of the downloads residual factor. A diachronous approach showed that, as a cohort of documents grows older, its download distribution becomes more and more skewed, and more statistically similar to its citation distribution. A method is proposed to estimate the effect of citations upon downloads using obsolescence patterns. It was found that during the first 3 months after an article is cited, its number of downloads increased 25&percnt; compared to what one would expect this number to be if the article had not been cited. Moreover, more downloads of citing documents led to more downloads of the cited article through the citation. An analysis of 1,190 papers in the journal during a time interval of 2 years after publication date revealed that there is about one citation for every 100 downloads. A Spearman rank correlation coefficient of 0.22 was found between the number of times an article was downloaded and its citation rate recorded in the SCI. When initial downloads&mdash;defined as downloads made during the first 3 months after publication&mdash;were discarded, the correlation raised to 0.35. However, both outcomes measure the joint effect of downloads upon citation and that of citation upon downloads. Correlating initial downloads to later citation counts, the correlation coefficient drops to 0.11. Findings suggest that initial downloads and citations relate to distinct phases in the process of collecting and processing relevant scientific information that eventually leads to the publication of a journal article. &copy; 2005 Wiley Periodicals, Inc.
Process issues in course projects
Authors: Wilson P. Paula Filho
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Defined software engineering process help teaching and guiding software engineering courses projects. However, using them raises several issues related to process and course features. Architecture issues relate to matching process and course lifecycle models. Size issues address project scope and extent. Support issues deal with student and instructor materials and tools.
Media Access Mechanisms for Integrated Services in Wireless Networks
Authors: Sheng-Tzong Cheng, Ming-Hung Tao, Mingzoo Wu
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

In the paper, we propose a media access framework for supporting integrated service including the real-time service, the controlled load service, and the best effort service in wireless networks. Three medium access mechanisms, the "Multi-classes fair scheduling", the "Single-class fair scheduling + DCF", and the "Single-class fair scheduling + DCF with threshold for controlled load service" are proposed in the paper to manage the traffic within a piconet. Moreover, a measurement based admission control algorithm is proposed to guarantee the QoS requirements for the requests. We compare the performance of the proposed access mechanisms by conducting simulations. The simulation results show that the "Multi-classes fair scheduling" mechanism is the best choice for the networks occupied by the real-time service; the "Single-class fair scheduling + DCF with threshold for controlled service" mechanism is the best for controlled service in general case.
A Low Voltage 14-Bit Self-Calibrated CMOS DAC with Enhanced Dynamic Linearity
Authors: S. Saeedi, S. Mehrmanesh, M. Atarodi
Venue: Analog Integrated Circuits and Signal Processing (2005)

A 1-V CMOS current steering digital to analog converter with enhanced static and dynamic linearity is presented. The 14-bit static linearity is achieved by a background analog self calibration technique which is suitable for low voltage applications and does not require error measurement and correction circuits. To improve dynamic linearity at high frequencies, a track/attenuate output stage is used at the DAC output. Integral and differential nonlinearities of the proposed DAC corresponding to 14-bit specification are less than 0.35 and 0.25 LSB, respectively. The DAC is functional up to 400MS/s with SFDR better than 71 dB in the Nyquist band. The circuit has been designed and simulated in a standard 0.18 u CMOS technology.
The summer 1968 in London and Zagreb: starting or end point for computer art?
Authors: Christoph Klütsch
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

The Exhibition Cybernetic Serendipity (London 1968) is often considered to be the first major exhibition of computer art. Nearly forgotten, is an exhibition in Zagreb that also took place in August 1968 connected to an international Colloquy "Computers and Visual Research. Zagreb August 3-4, 1968". Both dealt in a systematically different way with the possibilities of computer art. While the show in London tried to give a wide range of possibilities, the 'visual researchers' in Zagreb bridged computer art with social and political implications, as well as with new philosophical and aesthetical theories on Information aesthetics. For a further scientific analysis of the first phase of graphical computer art, a deeper look into the events in Zagreb will be indispensable.
In the mixxx: novel digital DJ interfaces
Authors: Tue Haste Andersen
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

We present an interactive system, Mixxx, for live DJ'ing using digital sound files. The design of the system is approached from two directions: Through Contextual Design using contextual interviews and video recordings and Open Source development where feedback and ideas are generated by developers and users from the open source community. Our contextual interviews show that DJs use a significant amount of their time on tracking and synchronizing songs using the traditional setup with turntables or CD players. By making beat information an integrated part of our DJ software Mixxx, synchronization is done automatically and DJs can use more time to attend other parts of the mix. We provide an intuitive interface for mixing with beat information that allows the same level of flexibility as with the traditional setup but facilitates new creative ways of mixing.
A Zonal JPEG
Authors: Cheng-Hsiung Hsieh
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

In this paper, a simple approach is proposed to improve the performance of JPEG. In the proposed approach, the coding scheme is identical to the JPEG except only a fixed number of coefficients are coded for each image block. Consequently, it is totally compatible with the JPEG and is termed as zonal JPEG. Simulation results indicate that the proposed zonal JPEG is able to trade little PSNR with significant bit rate reduction when compared with thee JPEG.
Bundling Information Goods of Decreasing Value
Authors: Xianjun Geng, Maxwell B. Stinchcombe, Andrew B. Whinston
Venue: Management Science (2005)

Consumers' average value for information goods, websites, weather forecasts, music, and news declines with the number consumed. This paper provides simple guidelines to optimal bundling marketing strategies in this case. If consumers' values do not decrease too quickly, we show that bundling is approximately optimal. If consumers' values to subsequent goods decrease quickly, we show by example that one should expect bundling to be suboptimal.
Compiling data-parallel programs for clusters of SMPs: Research Articles
Authors: Siegfried Benkner, Thomas Brandes
Venue: Concurrency and Computation: Practice Experience (2004)

Clusters of shared-memory multiprocessors (SMPs) have become the most promising parallel computing platforms for scientific computing. However, SMP clusters significantly increase the complexity of user application development when using the low-level application programming interfaces MPI and OpenMP, forcing users to deal with both distributed-memory and shared-memory parallelization details. In this paper we present extensions of High Performance Fortran (HPF) for SMP clusters which enable the compiler to adopt a hybrid parallelization strategy, efficiently combining distributed-memory with shared-memory parallelism. By means of a small set of new language features, the hierarchical structure of SMP clusters may be specified. This information is utilized by the compiler to derive inter-node data mappings for controlling distributed-memory parallelization across the nodes of a cluster and intra-node data mappings for extracting shared-memory parallelism within nodes. Additional mechanisms are proposed for specifying inter- and intra-node data mappings explicitly, for controlling specific shared-memory parallelization issues and for integrating OpenMP routines in HPF applications. The proposed features have been realized within the ADAPTOR and VFC compilers. The parallelization strategy for clusters of SMPs adopted by these compilers is discussed as well as a hybrid-parallel execution model based on a combination of MPI and OpenMP. Experimental results indicate the effectiveness of the proposed features. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Verifying safety policies with size properties and alias controls
Authors: Wei-Ngan Chin, Siau-Cheng Khoo, Shengchao Qin, Corneliu Popeea, Huu Hai Nguyen
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Many software properties can be analysed through a relational size analysis on each function's inputs and outputs. Such relational analysis (through a form of dependent typing) has been successfully applied to declarative programs, and to restricted imperative programs; but it has been elusive for object-based programs. The main challenge is that objects may mutate and they may be aliased. In this paper, we show how safety policies of programs can be analysed by tracking size properties of objects and be enforced by objects' invariants and the preconditions of methods. We propose several new ideas to allow both mutability and sharing of objects, whilst aiming for precision in our analysis. We introduce the concept of size-immutability to facilitate sharing, and also a set of alias controls to track unaliased objects whose size properties may change. We formalise our results through a set of advanced type checking rules for an object-based imperative language. We re-affirm the utility of the proposed type system by showing how a variety of software properties can be automatically verified according to size-inspired safety policies.
On binary ⊕-NFAs and succinct descriptions of regular languages
Authors: Lynette van Zijl
Venue: Theoretical Computer Science (2004)

We prove a new lower bound for the number of distinct languages accepted by binary symmetric difference automata (⊕-NFAs), and compare that to Domaratzki's results (J. Automata Languages Combin. 7(4) (2002) 469) for (traditional) binary nondeterministic finite automata (NFAs). We also show that there are certain regular languages which are accepted by succinct ⊕-NFAs, but for which no succinct traditional NFA exists.
Critical points of the distance to an epsilon-sampling of a surface and flow-complex-based surface reconstruction
Authors: Tamal K. Dey, Joachim Giesen, Edgar A. Ramos, Bardia Sadri
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

The distance function to surfaces in three dimensions plays a key role in many geometric modeling applications such as medial axis approximations, surface reconstructions, offset computations, feature extractions and others. In most cases, the distance function induced by the surface is approximated by a discrete distance function induced by a discrete sample of the surface. The critical points of the distance function determine the topology of the set inducing the function. However, no earlier theoretical result has linked the critical points of the distance to a sampling of geometric structures to their topological properties. We provide this link by showing that the critical points of the distance function induced by a discrete sample of a surface either lie very close to the surface or near its medial axis and this closeness is quantified with the sampling density. Based on this result, we provide a new flow-complex-based surface reconstruction algorithm that, given a tight ε-sampling of a surface, approximates the surface geometrically, both in Hausdorff distance and normals, and captures its topology.
Using instruction block signatures to counter code injection attacks
Authors: Milena Milenković, Aleksandar Milenković, Emil Jovanov
Venue: ACM SIGARCH Computer Architecture News (2005)

With more computing platforms connected to the Internet each day, computer system security has become a critical issue. One of the major security problems is execution of malicious injected code. In this paper we propose new processor extensions that allow execution of trusted instructions only. The proposed extensions verify instruction block signatures in run-time. Signatures are generated during a trusted installation process, using a multiple input signature register (MISR), and stored in an encrypted form. The coefficients of the MISR and the key used for signature encryption are based on a hidden processor key. Signature verification is done in the background, concurrently with program execution, thus reducing negative impact on performance. The preliminary results indicate that the proposed processor extensions will prevent execution of any unauthorized code at a relatively small increase in system complexity and execution time.
Technical stability of solutions of nonlinear differential equations of controlled vertical motion of an elastic body for a given measure
Authors: K. S. Matviychuk
Venue: Automation and Remote Control (2005)

Sufficient conditions for the technical stability for a given measure of nonlinear dynamic states of a long elastic flying system for its controlled vertical motion are derived. The influence of changes in sectional area, transversal deformations, and vibrations of flying vehicles are taken into account. The technical stability criteria depend on the main parameters of the control process and lateral load increment due to distortion of the longitudinal axis of the system and aerodynamical forces in vertical flight.
Integrating Remote Health Actors to an e-Health Intuitive Cooperation Platform Development
Authors: Xavier Urtubey, Fernando Uminsky, Marcelo Petrich, Randy Zadra, Pablo Felgaer, Pablo Orezzoli, Carlos Munante
Venue: Proceedings of the IDEAS Workshop on Medical Information Systems: The Digital Hospital (2004)

The "Agenda for the Connectivity in the Americas" defines health as an area of greatest importance to society; simultaneously ICT are seen by mayor telehealth players as means and tools for human health development. It is then extremely important not only to give access to connectivity to isolated areas, but also to integrate local health actors in each project. This integration is planed in all E-Link Americas Health Project's development steps: from evaluation of the user's needs, coordination of the activities and results evaluation. This paper describes the effort to start simultaneously Telehealth Pilot Project in four Central American countries in isolated areas and the development, with local leaders decisive participation, of a e-Health cooperative platform's prototype based on the health needs study's results. These actions merged in a workshop which aimed to the complete integration of local players in the prototype development as well in the Pilot's first phase's planning.