ppxscal/embedding_network huggingface dataset:
Optimized Scheduling for Data Aggregation in Wireless Sensor Networks
Authors: Fei Hu, Xiaojun Cao, Carter May
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

The most important issue in Wireless Sensor Networks is energy consumption. To this end, many networking schemes attempt to minimize the amount of data transmitted by using data aggregation. This trades off data freshness for a savings in energy, because reports from sensor nodes that arrive at an aggregating node may have to be held there for some period of time before being reported so that additional reports may reach the aggregator from slower nodes. We propose to use an intelligent timer and some high-level knowledge of the network to implement an efficient aggregation timing control protocol. Our protocol aims to dynamically change the data aggregation period according to the aggregation quality. A request from the data sink will include the maximum latency for a certain number of reports. If this number of reports can be returned in less time than the maximum, then the maximum time will not be reached. If, however, the specified number of responses can be returned in anywhere between zero-time (instantaneous) and the maximum latency, the timing scheme will find the minimum aggregation period that satisfies the sink's request.
Music education technology for older elementary school aged children: "playing around with mini Amadeus Jr."
Authors: Steve Altieri, Meghan Bruce, Chris Lindo, Tim Miller
Venue: Journal of Computing Sciences in Colleges (2005)

Music education is essential to forming a well-rounded student. With this important concept in mind, our goal for this project was to produce an interactive tool for students and give them an opportunity to "play around with music." Free reign of a musical instrument is often the best way for children to develop cognitive skills essential for other facets in the classroom. Our "keyboard" will allow students, ideally in Grades 3 through 6, to compose and read introductory music with the chance to hear different instruments. Children during this time need exposure to music. In addition, children of this age group will have enough of an understanding of basic computing to enjoy this program. The program must be functionally sound and simple enough for all levels of included students to develop an appreciation for the program. Our program incorporates all of these aspects and goes beyond them.
A Scheme for Testing Privacy State in Pervasive Sensor Networks
Authors: Yingpeng Sang, Hong Shen
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

More and more sensor networks will be deployed in the place where people are living, studying, and working. These sensor networks bring us the convenience of accessing information anytime and anywhere, whereas put our voice, motion, or even body temperature under surveillance. Under the circumstances of pervasively deployed sensor networks, people will have a dynamic concern about their privacy. At the same time, sensors will become invisible or should be hidden due to the privacy of themselves. This paper discusses privacy issues in pervasive sensor networks and proposes a general scheme for people in the environment of pervasive sensor networks, so that they can be aware of whether they should be alert on their privacy activities. Based on the protocol of secure two-party point-inclusion problem, the scheme has the characteristics of generality and confidentiality.
UNDERUTILIZATION OF ARCHIVAL FACILITIES IN A UNIX ENVIRONMENT: A RESOURCE ALLOCATION PROBLEM
Authors: M. Elliott Familant
Venue: ACM SIGCHI Bulletin (1991)

Ideally, information should be distributed among storage devices according to how frequently it is accessed. Rarely accessed information should be stored on the cheapest (and slowest) devices, frequently accessed data should be store on the fastest (and more expensive) devices.
An environment for collaborative content acquisition and editing by coordinated ubiquitous devices
Authors: Yutaka Kidawara, Tomoyuki Uchiyama, Katsumi Tanaka
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Digital content is not only stored by servers on the Internet, but also on various embedded devices belonging to ubiquitous networks. In this paper, we propose a content processing mechanism for use in an environment enabling collaborative acquisition of embedded digital content in real-world situations. We have developed a network management device that makes it possible to acquire embedded content using coordinated ubiquitous devices. The management device actively configures a network that includes content-providing devices and browsing devices to permit sharing of various items with digital content. We also developed a Functional web mechanism for processing embedded web content in the real-world without a keyboard. This mechanism adds various functions to conventional web content. These functions are activated by messages from a Field in a content processing device. We construct a practical prototype system, which is simple enough for children to use, that we called the "Virtual Insect Catcher". Through a test with 48 children, we demonstrated that this system can be used to acquire embedded web content, retrieve related content from the Internet, and then create new web content. We will also describe the proposed mechanism and the system testing.
Bayesian analysis of binary sequences
Authors: David C. Torney
Venue: Journal of Computational and Applied Mathematics (2005)

This manuscript details Bayesian methodology for "learning by example", with binary n-sequences encoding the objects under consideration. Priors prove influential; conformable priors are described. Laplace approximation of Bayes integrals yields posterior likelihoods for all n-sequences. This involves the optimization of a definite function over a convex domain--efficiently effectuated by the sequential application of the quadratic program.
Almost disjoint families of 3-term arithmetic progressions
Authors: Hayri Ardal, Tom C. Brown, Peter A. B. Pleasants
Venue: Journal of Combinatorial Theory Series A (2005)

We obtain upper and lower bounds for the size of a largest family of 3-term arithmetic progressions contained in [0, n - 1], no two of which intersect in more than one point. Such a family consists of just under a half of all of the 3-term arithmetic progressions contained in [0, n - 1].
Identification of a core set of genes that signifies pathways underlying cardiac hypertrophy: Research Articles
Authors: Claes C. Strøm, Mogens Kruhøffer, Steen Knudsen, Frank Stensgaard-Hansen, Thomas E. N. Jonassen, Torben F. Ørntoft, Stig Haunsø, Søren P. Sheikh
Venue: Comparative and Functional Genomics (2004)

Although the molecular signals underlying cardiac hypertrophy have been the subject of intense investigation, the extent of common and distinct gene regulation between different forms of cardiac hypertrophy remains unclear. We hypothesized that a general and comparative analysis of hypertrophic gene expression, using microarray technology in multiple models of cardiac hypertrophy, including aortic banding, myocardial infarction, an arteriovenous shunt and pharmacologically induced hypertrophy, would uncover networks of conserved hypertrophy-specific genes and identify novel genes involved in hypertrophic signalling. From gene expression analyses (8740 probe sets, n = 46) of rat ventricular RNA, we identified a core set of 139 genes with consistent differential expression in all hypertrophy models as compared to their controls, including 78 genes not previously associated with hypertrophy and 61 genes whose altered expression had previously been reported. We identified a single common gene program underlying hypertrophic remodelling, regardless of how the hypertrophy was induced. These genes constitute the molecular basis for the existence of one main form of cardiac hypertrophy and may be useful for prediction of a common therapeutic approach. Supplementary material for this article can be found at: Copyright &copy; 2004 John Wiley & Sons, Ltd.
CFD in Support of Wind Tunnel Testing for Aircraft/Weapons Integration
Authors: William L. Sickles
Venue: Proceedings of the 2004 Users Group Conference (2004)

Integrating data and computations using AEDC semiempirical and CFD techniques has provided vital support for integrating weapons with the Joint Strike Fighter (JSF) and the Joint Unmanned Combat Air System (J-UCAS). The techniques and the processes used are described. Computational results were obtained using HPC assets, and when possible, the results were validated against wind tunnel data. The success of these validations has led to high confidence in the computational results and also to the use of computational results to provide data outside the tunnel operating envelope. This has led in turn to the elimination of tests and saved the two programs millions of dollars. In summary, the subject computations: 1) provided information for pretest planning; 2) corrected errors in wind tunnel data reduction and results; and 3) obtained results for configurations that could not be obtained in the wind tunnel because of physical limitations of the support systems as well as limitations of the tunnel operating envelope. Computations and analysis performed for the two programs have demonstrated that the Integrated Test and Evaluation process does reduce cost and risk. 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
Impact of Page Size on Communication Performance
Authors: Xiaocheng Zhou, Zhigang Huo, Ninghui Sun, Yingchao Zhou
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 9 - Volume 10 (2005)

In this paper, the impact of page size on the communication performance is studied. In the interconnection communication of cluster system, the address translation table (ATT), which is located in the memory of the network interface card (NIC) and can in a way be seen as the translation look-aside buffer (TLB) used by the NIC processor, is usually used to translate virtual address to physical address by NIC. The page size of operating system not only affects the compulsory and capacity miss rate, but also the hit time and the miss penalty of ATT in some implementations. With a large page size, we can get lower ATT miss rate, shorter hit time and miss penalty to improve the communication performance. To test the impact of the page size, a Linux module based on AMD Opteron¿ processor is implemented to allocate both normal pages and super pages and the address translation mechanism in Myrinet GM is also extended to support either normal pages or super pages. With super pages, the latency of Ping-pong test can be reduced 4.3 us and the bandwidth can improve 55.3 MB/s in some case. The Linpack test results of 11 TFLOPS Dawning 4000A show that the Linpack efficiency can be increased from 0.66% to 2.86% for different number of processors.
Data Cache Prefetching Using a Global History Buffer
Authors: Kyle J. Nesbit, James E. Smith
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

A new structure for implementing data cache prefetching is proposed and analyzed via simulation. The structure is based on a Global History Buffer that holds the most recent miss addresses in FIFO order. Linked lists within this global history buffer connect addresses that have some common property, e.g. they were all generated by the same load instruction. The Global History Buffer can be used for implementing a number of previously proposed prefetch methods, as well as new ones. Prefetching with the Global History Buffer has two significant advantages over conventional table prefetching methods. First, the use of a FIFO history buffer can improve the accuracy of correlation prefetching by eliminating stale data from the table. Second, the Global History Buffer contains a more complete (and intact) picture of cache miss history, creating opportunities to design more effective prefetching methods. Global History Buffer prefetching can increase correlation prefetching performance by 20% and cut its memory traffic by 90%. Furthermore, the Global History Buffer can make correlations within a loadýs address stream, which can increase stride prefetching performance by 6%. Collectively, the Global History Buffer prefetching methods perform as well or better than the conventional prefetching methods studied on 14 of 15 benchmarks.
How to spread adversarial nodes?: rotate!
Authors: Christian Scheideler
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

In this paper we study the problem of how to keep a dynamic system of nodes well-mixed even under adversarial behavior. This problem is very important in the context of distributed systems.More specifically, we consider the following game: There are n white pebbles and ε n black pebbles for some fixed constant ε < 1. Initially, all of the white pebbles are laid down in a ring, and the adversary has all of the black pebbles in its bag. In each round, the adversary can look at the entire ring and can select to add a black pebble to the ring (if its bag is not empty) or to take any black pebble from the ring and put it back into its bag (i.e. we consider adaptive adversaries). However, the adversary cannot place a black pebble into any position it likes. This is handled by a join strategy to be specified by the system. The goal is to find an oblivious join strategy, i.e. a strategy that cannot distinguish between the white and black pebbles in the ring, that integrates the black pebbles into this ring and may do some further rearrangements so that for a polynomial number of rounds the adversary will not manage to include its black pebbles into the ring so that there is a sequence of s=Θ(log n) consecutive pebbles in which at least half of the pebbles are black. If this is achieved by the join strategy, it wins. Otherwise, the adversary wins.Of course, the brute-force strategy of rearranging all of the pebbles in the ring at random after each insertion of a black pebble will achieve the stated goal, with high probability, but this would be a very expensive strategy. The challenge is to find a join strategy that needs as little randomness and as few rearrangements as possible in order to win with high probability. In this paper, we present and analyze a very simple strategy called k-rotation that chooses k-1 existing positions uniformly at random in the ring, creates a new position uniformly at random in the ring, and then rotates the new pebble and the k-1 old pebbles along these positions. Interestingly, even if the adversary has just $s$ pebbles, it can still win for k=2. But the k-rotation rule wins with high probability for k=3 as long as ε<2/3, demonstrating that there is a sharp threshold for keeping pebbles in a sufficiently perturbed state.
Extrapolation theory: new results and applications
Authors: G. E. Karadzhov, M. Milman
Venue: Journal of Approximation Theory (2005)

Extending earlier work by Jawerth and Milman, we develop in detail Σ(p)and Δ(p) methods of extrapolation. As an application we prove general forms of Yano's extrapolation theorem. Applications to logarithmic Sobolev inequalities, integrability of maps of finite distortion and logarithmic Sobolev spaces are given.
Designing the design phase of critical care devices: a cognitive approach
Authors: Sameer Malhotra, Archana Laxmisan, Alla Keselman, Jiajie Zhang, Vimla L. Patel
Venue: Journal of Biomedical Informatics (2005)

In this study, we show how medical devices used for patient care can be made safer if various cognitive factors involved in patient management are taken into consideration during the design phase. The objective of this paper is to describe a methodology for obtaining insights into patient safety features--derived from investigations of institutional decision making--that could be incorporated into medical devices by their designers. The design cycle of a product, be it a medical device, software, or any kind of equipment, is similar in concept, and course. Through a series of steps we obtained information related to medical errors and patient safety. These were then utilized to customize the generic device design cycle in ways that would improve the production of critical care devices. First, we provided individuals with different levels of expertise in the clinical, administrative, and engineering domains of a large hospital setting with hypothetical clinical scenarios, each of which described a medical error event involving health professionals and medical devices. Then, we asked our subjects to "think-aloud" as they read through each scenario. Using a set of questions as probes, we then asked our subjects to identify key errors and attribute them to various players. We recorded and transcribed the responses and conducted a cognitive task analysis of each scenario to identify different entities as "constant," "partially modifiable," or "modifiable." We compared our subjects' responses to the results of the task analysis and then mapped them to the modifiable entities. Lastly, we coded the relationships of these entities to the errors in medical devices. We propose that the incorporation of these modifiable entities into the device design cycle could improve the device end product for better patient safety management.
Computational tools for Brassica&ndash;Arabidopsis comparative genomics: Conference Papers
Authors: Paul Beckett, Ian Bancroft, Martin Trick
Venue: Comparative and Functional Genomics (2005)

Recent advances, such as the availability of extensive genome survey sequence (GSS) data and draft physical maps, are radically transforming the means by which we can dissect Brassica genome structure and systematically relate it to the Arabidopsis model. Hitherto, our view of the co-linearities between these closely related genomes had been largely inferred from comparative RFLP data, necessitating substantial interpolation and expert interpretation. Sequencing of the Brassica rapa genome by the Multinational Brassica Genome Project will, however, enable an entirely computational approach to this problem. Meanwhile we have been developing databases and bioinformatics tools to support our work in Brassica comparative genomics, including a recently completed draft physical map of B. rapa integrated with anchor probes derived from the Arabidopsis genome sequence. We are also exploring new ways to display the emerging Brassica&ndash;Arabidopsis sequence homology data. We have mapped all publicly available Brassica sequences in silico to the Arabidopsis TIGR v5 genome sequence and published this in the ATIDB database that uses Generic Genome Browser (GBrowse). This in silico approach potentially identifies all paralogous sequences and so we colour-code the significance of the mappings and offer an integrated, real-time multiple alignment tool to partition them into paralogous groups. The MySQL database driving GBrowse can also be directly interrogated, using the powerful API offered by the Perl Bio::DB::GFF methods, facilitating a wide range of data-mining possibilities. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Extracting Meaningful Curves from Images
Authors: Frédéric Cao, Pablo Musé, Frédéric Sur
Venue: Journal of Mathematical Imaging and Vision (2005)

Since the beginning, Mathematical Morphology has proposed to extract shapesfrom images as connected components of level sets. These methods have proved veryefficient in shape recognition and shape analysis. In this paper, we present an improved method to select the most meaningful level lines (boundaries of level sets) from an image. This extraction can be based on statistical arguments, leading to a parameter free algorithm. It permits to roughly extract all pieces of level lines of an image, that coincide with pieces of edges. By this method, the numberof encoded level lines is reduced by a factor 100, without any loss of shape contents. In contrast to edge detection algorithms or snakes methods, such a level lines selection method delivers accurate shape elements, without user parameter since selection parameters can be computed by the Helmholtz Principle. The paper aims at improving the original method proposed in [10]. We give a mathematicalinterpretation of the model, which explains why some pieces of curve are overdetected. We introduce a multiscale approach that makes the method more robust to noise. A more local algorithm is introduced, taking local contrast variations into account. Finally, we empirically prove that regularity makes detection more robust but does not qualitatively change the results.
Research on planning
Authors: Ann E. Robinson
Venue: Issue 83 (January 1983) (1983)

This section of the newsletter contains a collection of summaries of current research on planning. Although the number of projects described is modest, the variety of topics and institutions represented illustrates a healthy and growing interest in this area. In contrast with early research, much of which dealt with "blocks-world" problems, a significant portion of the research described here is confronting so-called "real-world" problems, such as planning with incomplete information, planning with large numbers of constraints, and planning in a non-cooperative environment. The role of planning in communication is also an important topic. Furthermore, in addition to covering a broad range of topics, the research covers the spectrum from quite theoretical to fairly practical.
Architecture and design considerations in NESPOLE!: a speech translation system for e-commerce applications
Authors: Alon Lavie, Chad Langley, Alex Waibel, Fabio Pianesi, Gianni Lazzari, Paolo Coletti, Loredana Taddei, Franco Balducci
Venue: Proceedings of the first international conference on Human language technology research (2001)

NESPOLE! is a speech-to-speech machine translation research project funded jointly by the European Commission and the US NSF. The main goal of the NESPOLE! project is to advance the state-of-the-art of speech-to-speech translation in a real-world setting of common users involved in e-commerce applications. The project is a collaboration between three European research labs (IRST in Trento Italy, ISL at University of Karlsruhe in Germany, CLIPS at UJF in Grenoble France), a US research group (ISL at Carnegie Mellon in Pittsburgh) and two industrial partners (APT - the Trentino provincial tourism bureau, and Aethra - an Italian tele-communications commercial company). The speech-to-speech translation approach taken by the project builds upon previous work that the research partners conducted within the context of the C-STAR consortium (see http://www.c-star.org). The prototype system developed in NESPOLE! is intended to provide effective multi-lingual speech-to-speech communication between all pairs of four languages (Italian, German, French and English) within broad, but yet restricted domains. The first showcase currently under development is in the domain of tourism and travel information.
Front-end for a RETAIN function
Authors: Melissa Chávez
Venue: Journal of Computing Sciences in Colleges (2004)

IBM is trying to provide their support group with a better user interface in their primary database, RETAIN. This database is used to handle customer-reported problems. 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