ppxscal/embedding_network huggingface dataset:
Hybrid Greedy/Face Routing for Ad-Hoc Sensor Network
Authors: J. Li, L. Gewali, H. Selvaraj, V. Muthukumar
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

Constructing a route connecting a source node to a destination node is one of the central problems in sensor networks and mobile computing. In this paper we consider the application of a data structure called ExtDCEL that can be very effective in implementing several location-based routing algorithms that include face routing, greedy most forward routing, and hybrid routing. The ExtDCEL data structure is very convenient for representing unit disk graphs as well as planar components. Many network properties can be computed locally when the graph is represented in ExtDCEL. In particular, we show how the popular hybrid greedy face routing algorithm can be implemented efficiently by using ExtDCEL.
Complexity of convex optimization using geometry-based measures and a reference point
Authors: Robert M. Freund
Venue: Mathematical Programming: Series A and B (2004)

Our concern lies in solving the following convex optimization problem: where P is a closed convex subset of the n-dimensional vector space X. We bound the complexity of computing an almost-optimal solution of GP in terms of natural geometry-based measures of the feasible region and the level-set of almost-optimal solutions, relative to a given reference point xr that might be close to the feasible region and / or the almost-optimal level set. This contrasts with other complexity bounds for convex optimization that rely on data-based condition numbers or algebraic measures, and that do not take into account any a priori reference point information.
FARMER: finding interesting rule groups in microarray datasets
Authors: Gao Cong, Anthony K. H. Tung, Xin Xu, Feng Pan, Jiong Yang
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Microarray datasets typically contain large number of columns but small number of rows. Association rules have been proved to be useful in analyzing such datasets. However, most existing association rule mining algorithms are unable to efficiently handle datasets with large number of columns. Moreover, the number of association rules generated from such datasets is enormous due to the large number of possible column combinations.In this paper, we describe a new algorithm called FARMER that is specially designed to discover association rules from microarray datasets. Instead of finding individual association rules, FARMER finds interesting rule groups which are essentially a set of rules that are generated from the same set of rows. Unlike conventional rule mining algorithms, FARMER searches for interesting rules in the row enumeration space and exploits all user-specified constraints including minimum support, confidence and chi-square to support efficient pruning. Several experiments on real bioinformatics datasets show that FARMER is orders of magnitude faster than previous association rule mining algorithms.
On the Evaluation of SEU Sensitiveness in SRAM-Based FPGAs
Authors: P. Bernardi, M. Sonza Reorda, L. Sterpone, M. Violante
Venue: Proceedings of the International On-Line Testing Symposium, 10th IEEE (2004)

The growing adoption of SRAM-based FieldProgrammable Gate Arrays (FPGAs) in safety-criticalapplications demands for efficient methodologies forevaluating their reliability. Single Event Upsets (SEUs)affecting the configuration memory of SRAM-basedFPGAs are a major concern, since they can permanentlyaffect the function implemented by the device. Weexploited a fault-injection environment developed at ourinstitution to analyze the impact of such faults on SRAM-basedFPGAs when fault tolerant design techniques areadopted. The experimental results allow quantitativeevaluations of the effects of these faults, and show that thesensitivity of the TMR design technique mainly dependson the characteristics of the adopted TMR architecture interms of placing and routing.
GridSpeed: A Web-based Grid Portal Generation Server
Authors: Toyotaro Suzumura, Satoshi Matsuoka, Hidemoto Nakada, Henri Casanova
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

GridSpeed is a grid portal hosting server that automatically generates and publishes a customized web interface to the grid for applications, with minimal effort required from the user. Users need only to specify information regarding their application using simple GridSpeed web forms. With GridSpeed, users need not make any modifications to their applications nor write any glue code to publish the application on the web, not requiring any knowledge of Perl, JSP (Java Server Pages) or Java Servlets. Moreover, the portal generated by GridSpeed provides an application frontend as well as a set of fundamental portal services such as an information service, monitoring service, data management, single sign-on, and so forth. GridSpeed publishes a set of portals as Grid services themselves generated by the system that is sharable, searchable, and accessible from others interested in using the application. This feature facilitates the reuse of application portals for specific application domains, as well as increases the number of available Grid applications accessible on the web. This paper describes an overview and architecture of the GridSpeed system, and evaluates the system for two real-world scientific applications: BLAST and MCell.
Trayectorias: A new model for online task-based learning
Authors: Cristina Ros I Solé, Raquel Mardomingo
Venue: ReCALL (2004)

This paper discusses a framework for designing online tasks that capitalizes on the possibilities that the Internet and the Web offer for language learning. To present such a framework, we draw from constructivist theories (Brooks and Brooks, 1993) and their application to educational technology (Newby, Stepich, Lehman and Russell, 1996; Jonassen, Mayes and McAleese, 1993); second language learning and learning autonomy (Benson and Voller, 1997); and distance education (Race, 1989; White, 1999). On the one hand our model balances the requirements of the need for control and learning autonomy by the independent language learner; and on the other, the possibilities that online task-based learning offer for new reading processes by taking into account new literacy models (Schetzer and Warschauer, 2000), and the effect that the new media have on students&rsquo; knowledge construction and understanding of texts. We explain how this model works in the design of reading tasks within the specific distance learning context of the Open University, UK. Trayectorias is a tool that consists of an open problem-solving Web-quest and provides students with &lsquo;scaffolding&rsquo; that guides their navigation around the Web whilst modelling learning approaches and new learning paradigms triggered by the medium. We then discuss a small-scale trial with a cohort of students (n = 23). This trial had a double purpose: (a) to evaluate to what extent the writing task fulfilled the investigators&rsquo; intentions; and (b) to obtain some information about the students&rsquo; perceptions of the task.
Another look at software design methodology
Authors: M. M. Lehman, V. Stenning, W. M. Turski
Venue: ACM SIGSOFT Software Engineering Notes (1984)

Software design - from 'topmost' specification down to final implementation - is viewed as a chain of uniform steps, each step being a transformation between two linguistic levels. A canonical form of the step is discussed and it is argued that all rational design activities are expressible as a combination of canonical steps. The role of backtracking in software design is explained and a mechanism for introducing changes, both indigeneous and exogeneous, is proposed, again entirely by a combination of canonical steps. The main tenet of the 'canonical step approach' is that a design step contains a degree of unconstrained, creative invention and a calculable part which is the actual transformation effected.
Screening of obstructive sleep apnea based on statistical signal characterization of Hilbert transform of RRI data
Authors: Bader Al Ghunaimi, Abdulnasir Hossen, Mohammed O. Hassan
Venue: Technology and Health Care (2004)

A new technique of time-domain analysis for screening of Obstructive Sleep Apnea (OSA) using R-R interval (RRI) data is investigated. This method is based on the Statistical Signal Characterization (SSC) of the analytical signal that is generated using Hilbert transformation of the RRI data. The four SSC parameters: amplitude mean, period mean, amplitude deviation and period deviation, and their maximum and minimum values are found over a 5-minutes sliding window for both the instantaneous amplitudes and the instantaneous frequencies derived from the analytical signal of the RRI data. Data used in this work are drawn from both MIT database as well as from the Sleep Laboratory at Sultan Qaboos University (SQU) hospital. Threshold values used in the identification of OSA from normal subjects are selected using the Receiver Operating Characteristics (ROC) curves. The new technique classifies correctly 29/30 of MIT Trial data, 27/30 of MIT challenge data, and 30/30 of SQU data.
Study to Secure Reliability of Measurement Data through Application of Game Theory
Authors: Sang-Pok Ko, Hak-Kyung Sung, Kyung-Whan Lee
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

Recently, many corporations have applied CMM, SPICE or other software process maturity models to developing software products. These models are recommended to change from qualitative process management to quantitative management as they reach a certain level of maturity. Quantitative process management is possible only when reliable data exist. If quantitative process management are conducted when data's reliability are not ensured, adverse effects can be caused by the false management activities. That is why so many methods have been studied to analyze reliability of collected data. Most of them, however, are analysis methods for already collected data. Therefore, if the analysis finds that the existing data are not reliable, the data should be abandoned and new data be collected again, causing need to consume much time and effort. Therefore, as a way to secure reliability of data to be used for quantitative process management when they are input in the first place, this paper suggests a method applying the second level meta game of non-cooperative, bimatrix games to collecting data for quantitative measurement.
Adaptation Mechanism for Three Dimensional Content within the MPEG-21 Framework
Authors: HyungSeok Kim, Chris Joslin, Thomas Di Giacomo, Stephane Garchery, Nadia Magnenat-Thalmann
Venue: Proceedings of the Computer Graphics International (2004)

The goal of the research is creation of anadaptation mechanism for the delivery of three-dimensionalcontent. The adaptation of content, forvarious network and terminal capabilities - as well asfor different user preferences, is a key feature thatneeds to be investigated. Current state-of-the artresearch of the adaptation shows promising results forspecific purpose and limited types of content but still itis not well adoptable for the massive heterogeneousenvironments. In this research, we present a methodfor transmitting adapted thee-dimensional contents tomultiple target devices. This paper presents sometheoretical and practical methods for adapting three-dimensionalcontents, which includes shapes andanimation. We also discuss practical details to theintegration of our methods into MPEG-21 and MPEG-4 architectures.
Well balanced finite volume methods for nearly hydrostatic flows
Authors: N. Botta, R. Klein, S. Langenberg, S. Lützenkirchen
Venue: Journal of Computational Physics (2004)

In numerical approximations of nearly hydrostatic flows, a proper representation of the dominant hydrostatic balance is of crucial importance: unbalanced truncation errors can induce unacceptable spurious motions, e.g., in dynamical cores of models for numerical weather prediction (NWP) in particular near steep topography. In this paper we develop a new strategy for the construction of discretizations that are "well-balanced" with respect to dominant hydrostatics. The classical idea of formulating the momentum balance in terms of deviations of pressure from a balanced background distribution is realized here through local, time dependent hydrostatic reconstructions. Balanced discretizations of the pressure gradient and of the gravitation source term are achieved through a "discrete Archimedes' buoyancy principle". This strategy is applied to extend an explicit standard finite volume Godunov-type scheme for compressible flows with minimal modifications. The resulting method has the following features: (i) It inherits its conservation properties from the underlying base scheme. (ii) It is exactly balanced, even on curvilinear grids, for a large class of near-hydrostatic flows. (iii) It solves the full compressible flow equations without reference to a background state that is defined for an entire vertical column of air. (iv) It is robust with respect to details of the implementation. such as the choice of slope limiting functions, or the particularities of boundary condition discretizations.
The Eidolons of Edna
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 2 - Volume 146 (2003)

In Victorian England an old woman living alone in her house is at her wits end. An unconventional exorcist arrives to help, swiftly ridding her of the poltergeists with unfortunate results. Copyright held by creator. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A refreshing approach to an academic seminar course
Authors: Noa Ragonis
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

This paper describes a creative approach for the computer science (CS) academic seminar course. The seminar goal is to gain integration between the curriculums learnt topics, thus clarifying and enriching CS students' conceptual maps.
Evaluating the XP Customer Model and Design by Contract
Authors: Ralph-Johan Back, Piia Hirkman, Luka Milovanov
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

In this paper we describe one of the series of experiments with Extreme Programming, carried out as a summer project. The focus in this experiment was to try out the XP customer model and Design by Contract. The experiment indicates that the Extreme Programming emphasis on having an on-site customer available during the project improves the communication between customers and the programming team, and markedly decreases the number of false features and feature misses. It also indicates that the systematic use of Design by Contract leads to a low post-release defect rate for the software system built.
Using RDF for Policy Specification and Enforcement
Authors: Barbara Carminati, Elena Ferrari, Bhavani Thuraisingham
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Security issues for the Resource Description Framework (RDF) [RDF] are today crucial due to the key role played by RDF for the semantic web [LEE01]. However, despite its importance, RDF security is still a novel area and very little work has been done so far. In this paper, we make a first step in this direction by proposing an approach for using RDF for policy specification and enforcement.
Inverse eigenproblem for centrosymmetric and centroskew matrices and their approximation
Authors: Zheng-Jian Bai, Raymond H. Chan
Venue: Theoretical Computer Science (2004)

In this paper, we first give the solvability condition for the following inverse eigenproblem (IEP): given a set of vectors {Xi}i=1m in Cn and a set of complex numbers {λi}i=1m, find a centrosymmetric or centroskew matrix C in Rn × n such that {Xi}i-1m and {λi}i-1m are the eigenvectors and eigenvalues of C, respectively. We then consider the best approximation problem for the IEPs that are solvable. More precisely, given an arbitrary matrix B in Rn × n, we find the matrix C which is the solution to the IEP and is closest to B in the Frobenius norm. We show that the best approximation is unique and derive an expression for it.
Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem
Authors: Michelangelo Grigni, J. Schulman, Monica Vazirani, Umesh Vazirani
Venue: Combinatorica (2004)

We provide positive and negative results concerning the &#x201c;standard method&#x201d; of identifying a hidden subgroup of a nonabelian group using a quantum computer.
Energy Optimization of Distributed Embedded Processors by Combined Data Compression and Functional Partitioning
Authors: Jinfeng Liu, Pai H. Chou
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Transmitting compressed data can reduce inter-processor communicationtraffic and create new opportunities for DVS (dynamicvoltage scaling) in distributed embedded systems. However, datacompression alone may not be effective unless coordinated withfunctional partitioning. This paper presents a dynamic programmingtechnique that combines compression and functional partitioningto minimize energy on multiple voltage-scalable processorsrunning pipelined data-regular applications under performance constraints.Our algorithm computes the optimal functional partitioning,CPU speed for each node, and their respective compression ratios.We validate the algorithm's effectiveness on a real distributedembedded system running an image processing algorithm.
Complexity of approximation algorithms for combinatorial problems: a survey
Authors: Georgii Gens, Evgenii Levner
Venue: ACM SIGACT News (1980)

In this survey we examine recent results on the complexity of approximation algorithms which have appeared in Russian.
Reduction of Sizes of Multi-Valued Decision Diagrams by Copy Properties
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

Copy Decision Diagrams (CDDs) are an approach to thereduction of sizes of Multi-Terminal Binary Decision Diagrams(MTBDDs) by using the copy properties of discretefunctions. Functions having different types of copy propertiescan be ef.ciently represented by CDDs. Illustrativeexamples are Walsh and Reed-Muller functions as well asdifferent binary codes.In this paper we consider an extension of this idea toMulti-valued Decision Diagrams (MDDs). We proposeCopy MDDs (CMDD) as a modi.cation of MDDs that exploitscopy properties of functions besides properties alreadyused in reduction of MDDs. Experimental resultsshow reduction capabilities of CMDDs.
The impact of Internet use on the other side of the digital divide
Authors: Linda A. Jackson, Alexander von Eye, Gretchen Barbatsis, Frank Biocca, Hiram E. Fitzgerald, Yong Zhao
Venue: Communications of the ACM (2004)

Exploring factors influencing the social impact of Internet use.
Fast inversion of triangular Toeplitz matrices
Authors: Fu-Rong Lin, Wai-Ki Ching, Michael K. Ng
Venue: Theoretical Computer Science (2004)

In this paper, we present an approximate inversion method for triangular Toeplitz matrices based on trigonometric polynomial interpolation. To obtain an approximate inverse of high accuracy for a triangular Toeplitz matrix of size n, our algorithm requires two fast Fourier transforms (FFTs) and one fast cosine transform of 2n-vectors. We then revise the approximate method proposed by Bini (SIAM J. Comput. 13 (1984) 268). The complexity of the revised Bini algorithm is two FFTs of 2n-vectors.
Mobile Jabber IM: A Wireless-Based Text Chatting System
Authors: Jerry Gao, Mansi Modak, Satyavathi Dornadula, Simon Shim
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

With the rapid advancement of wireless network technologies, wireless communications and mobile-based information services are changing peopleýs life style. How to provide mobile users with cost-effective wireless information services is becoming a hot topic for wireless vendors. Although there are a number of Internet-based instant messaging solutions, there are no published articles addressing how to develop wireless Internet instant messaging solutions. This paper reports recent research and development efforts in constructing a wireless-based text chatting system, Mobile Jabber IM. It discusses the system architecture, design, and technologies. The paper demonstrates the system application examples and shares the development and implementation experiences.
A new method for extracting EOT for leaky insulators
Authors: F. Chen, N. P. Hoilien, S. A. Campbell
Venue: Microelectronic Engineering (2004)

A three-parameter model is developed and demonstrated for extracting the capacitance and parallel resistance for leaky capacitors. The technique combines dc and ac measurements tn extract these values. The range over which the measurement is valid varies with the device, but is readily determined with a simple measurement. For devices with the highest dc leakage, minority carrier injection into the substrate can substantially increase the measured capacitance. This is not an artifact of the measurement procedure, but a real parasitic effect that increases the gate capacitance.
Piezoelectric thin films formed by MOD on cantilever beams for micro sensors and actuators
Authors: T. Cui, D. Markus, S. Zurn, D. L. Polla
Venue: Microsystem Technologies (2004)

Novel piezoelectric cantilever beams for micro sensors and actuators based on PZT thin films have been batch fabricated by surface micromachining. Lead zirconate titanate (PZT) thin film is formed by metalorganic deposition (MOD) on Pt/Ti/SiO2/Si (1 0 0) substrates and Pt/Ti/LTO/Si3N4 cantilever beams and then annealed at 700 &#x00b0;C in air. The PZT thin film is 0.5 &#x03bc;m thick and has dielectric permittivity of 1698, remanent polarization of 13.66 &#x03bc;C/cm2, and coercive field of 44.5 kV/cm. The influence of deposition temperatures on PZT thin film stress has been investigated. When continuously controlling the deposition temperatures, the stress of the thin film is reduced from 0.313 &#x00d7; 108 to 0.269 &#x00d7; 108 N/m, that is 16.4% decrease. With the total 120 designed devices on 4-inch wafers, the number of functional devices is increased from 82 to 97, that is 12.47%.
Real-Time Terrain Rendering using LodStrips Multiresolution Model
Authors: J. F. Ramos, M. Chover, C. Granell
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Some multiresolution models offer variable resolution capabilities.This property allows us to display areas with different levels of detail on the same mesh.In this paper we present a continuous multiresolution model that allows variable resolution and its application to the real-time rendering of digital terrains.An important characteristic of the model is the use of triangle strips both in the data structure and in the rendering stage.The proposed model extends a previous strip-based multiresolution scheme that implements uniform resolution.
Bacillus Subtilis Protein Interaction Network Analysis
Authors: Olusola C. Idowu, Steven J. Lynden, Malcolm P. Young, Peter Andras
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Identifying functionally important proteins that are essential to the survival of a bacterial cell is of considerable interest in the development of new antimicrobial agents. Recent studies have shown that functionally important components in protein interaction networks may also be structurally important. We studied the protein interaction network of Bacillus subtilis to identify structurally essential proteins. Fifty-four percent of the structurally essential proteins identified by our methods were encoded by functionally essential genes.