ppxscal/embedding_network huggingface dataset:
Generating multi-sensor precipitation estimates over radar gap areas
Authors: Shayesteh E. Mahani, Reza Khanbilvardi
Venue: WSEAS TRANSACTIONS on SYSTEMS (2009)

Generating a multi-sensor precipitation product over radar gap area is the objective of the present study. A merging approach is developed to improve Satellite-based Precipitation Estimates (SPE) by merging with ground-based Radar Rainfall (RR) estimates because remote satellites are the only source that can collect information from areas where are inaccessible by ground-based radar and/or rain gauge networks. The merging algorithm is capable of extending radar information from pixels with available RR to their neighboring pixels with no radar information by merging RR with SPE, which is, usually, available for all pixels. SPE is combined with RR using the weighting-based approach of Successive Correction Method (SCM) after local bias correction of SPE with respect to RR. High resolution satellite infrared-based rainfall estimates from the NESDIS Hydro Estimator algorithm (HE), at hourly 4 km × 4 km basis, is selected to be merged with radar-based NEXRAD Stage IV rainfall measurements to generate rainfall product for the radar gap areas. To be able to validate the generated rainfall against NEXRAD, different size areas with available radar rainfall are selected as radar gap regions. The developed merging technique is evaluated for several study cases in summer 2003 and 2004. The results show that generated rainfall for the radar gap areas are more correlated with RR (average 0.67) than original HE with RR (average 0.36) and the RMSE between merged and radar rainfall (average 2.8 mm) is less than the RMSE between satellite and radar rainfall (average 4.48 mm). And also, the pattern and intensity of the generated rainfall for radar gap area became more similar to the pattern and value of RR. In addition, the enhancement of the generated rainfall with respect to RR is more significant for high rainfall amounts.
Long period grating glucose sensor based on sol-gel entrapment technique
Authors: Y. F. Zhang, C. C. Chan, J. Sun, L. T. Zheng, H. L. Ho, X. Y. Dong, L. Y. Shao
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Sol-gel entrapment technique is proposed for glucose oxidase immobilization in long period grating glucose sensor. Two glucose oxidase essays were prepared. The sensitivity of 39.8mM/nm was achieved for the fabricated glucose biosensors.
Applying lean principles to improve organization's decisional process
Authors: Rodica Rohan, Gheorghe Sindila
Venue: Proceedings of the 7th conference on Data networks, communications, computers (2008)

The enhancement of the organization's decisional potential, which has benefic effects on the results level can be obtained by applying Lean principles, which lead to the elimination of loss generating activities from within the value stream of the decisional process.
Multiresolution Wavelet Transform and Supervised Learning for Content-Based Image Retrieval
Authors: C. Brambilla, A. Della Ventura, I. Gagliardi, R. Schettini
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

We focus here on the definition of an effective strategy that allows the user to pose a visual query and retrieve a set of images from a database that satisfy his criteria of pictorial similarity without requiring any semantic expression of them. The strategy exploits multi-resolution wavelet transform to effectively describe image content. The salient features of the images are coded in signatures of predefined lengths which are compared in the retrieval phase by applying a similarity measure the system has pre-learned, using a regression model for ordinal responses, from a learning set of "very similar", "rather-similar", "not-very-similar", and "different" pairs of images. Some experimental results demonstrating the effectiveness of this approach are reported.
Create Art and Cartoons in Photoshop Elements 4
Authors: Chris Madden
Venue:  (2007)

A manual on how to use Photoshop Elements 4 to draw cartoons or paint pictures. The book employs a unique grading system, with the contents split into four categories (based on importance and complexity) identified by shaded strips down the side of the page. This allows the reader to concentrate on the parts of the book that are relevant, and avoids the need to wade through pages of information that is either too complicated or too basic. The book includes a step-by-step 'quick start' section - a guide through the fundamental, no frills techniques necessary to draw and paint in Elements. This is a hands-on section introducing specific features for creating finished artwork, with no technical knowledge required. Later chapters elaborate on the different aspects of the program, starting with those most useful to the drawing and painting processes, such as brushes and layers, followed by chapters on more esoteric subjects such as how to embellish work using special effects. Finally, there are chapters on how to import images, such as pencil drawings and photographs, and on how to output your work once it's finished, either by printing it out or by using it in emails or on the web.
Sharing analysis of arrays, collections, and recursive structures
Authors: Mark Marron, Mario Méndez-Lojo, Manuel Hermenegildo, Darko Stefanovic, Deepak Kapur
Venue: Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (2008)

Precise modeling of the program heap is fundamental for understanding the behavior of a program, and is thus of significant interest for many optimization applications. One of the fundamental properties of the heap that can be used in a range of optimization techniques is the sharing relationships between the elements in an array or collection. If an analysis can determine that the memory locations pointed to by different entries of an array (or collection) are disjoint, then in many cases loops that traverse the array can be vectorized or transformed into a thread-parallel version. This paper introduces several novel sharing properties over the concrete heap and corresponding abstractions to represent them. In conjunction with an existing shape analysis technique, these abstractions allow us to precisely resolve the sharing relations in a wide range of heap structures (arrays, collections, recursive data structures, composite heap structures) in a computationally efficient manner. The effectiveness of the approach is evaluated on a set of challenge problems from the JOlden and SPECjvm98 suites. Sharing information obtained from the analysis is used to achieve substantial thread-level parallel speedups.
The Virtual Scylla: an exploration of &#x201c;serious games&#x201d;, artificial life and simulation complexity
Authors: Robert Stone, David White, Robert Guest, Benjamin Francis
Venue: Virtual Reality (2009)

This paper addresses the integration of artificial life simulations with interactive games-based technologies and describes how the results are being exploited not only for scientific visualisation and education, but also for fundamental research into simulation complexity, focusing on the behavioural representation of species in fragile or long-vanished landscapes and ecosystems. Earlier research is described that supported the development of a virtual recreation of a submerged Mesolithic river valley, discovered during petrochemical surveys of the Southern Basin of the North Sea. Using pollen sample records and vegetation predictions from previous studies, a new alife &#x201c;engine&#x201d; was developed that simulated the interaction between &#x201c;artificialised&#x201d; vegetation and environmental factors, thus helping researchers to postulate pre-glacial melting migratory and settlement patterns of ancient civilisations from continental Europe to the British Isles. More recently, and to take advantage of the existence of a more accessible and living ecosystem, work has been conducted in collaboration with the UK&#x2019;s National Marine Aquarium, this time focusing on the Scylla Artificial Reef&#x2014;a Royal Navy frigate scuttled off the coast of Cornwall in South West England. The resulting &#x201c;serious games&#x201d;-based test beds are now providing the foundation for scientific investigations into how models and simulations of marine ecologies behave under different measures of complexity. The exploitation of the artificial life and underwater rendering efforts in others areas, including education and naval training, are also described.
Online analysis of time series by the Qn estimator
Authors: Robin Nunkesser, Roland Fried, Karen Schettlinger, Ursula Gather
Venue: Computational Statistics Data Analysis (2009)

A fast update algorithm for online calculation of the Q"n scale estimator is presented. This algorithm allows robust analysis of high-frequency time series in real time. It provides reliable estimates of a time-varying volatility even if many large outliers are present and it offers good efficiency in the case of clean Gaussian data.
Formal specification and analysis of hardware systems in timed Chi
Authors: Ka Lok Man
Venue: Nordic Journal of Computing (2007)

Timed Chi (χ) is a timed process algebra, designed for modelling, simulation, verification and real-time control. Its application domain consists of large and complex manufacturing systems. The straightforward syntax and semantics is also highly suited to architects, engineers and researchers from the hardware design community. Since timed Chi is a well-developed algebraic theory from the field of process algebras with timing, we have the idea that timed Chi is also well-suited for addressing various aspects of hardware systems (discrete-time systems by nature). To show that timed Chi is useful for formal specification and analysis of hardware systems and our idea is correct, we illustrate the use of timed Chi with some benchmark examples of hardware systems: a multiplexer (MUX), a D flip-flop, an asynchronous arbiter and a simple arbiter (with assertion).
Mining Large Networks with Subgraph Counting
Authors: Ilaria Bordino, Debora Donato, Aristides Gionis, Stefano Leonardi
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

The problem of mining frequent patterns in networks has many applications, including analysis of complex networks, clustering of graphs, finding communities in social networks, and indexing of graphical and biological databases. Despite this wealth of applications, the current state of the art lacks algorithmic tools for counting the number of subgraphs contained in a large network. In this paper we develop data-stream algorithms that approximate the number of all subgraphs of three and four vertices in directed and undirected networks. We use the frequency of occurrence of all subgraphs to prove their significance in order to characterize different kinds of networks: we achieve very good precision in clustering networks with similar structure. The significance of our method is supported by the fact that such high precision cannot be achieved when performing clustering based on simpler topological properties, such as degree, assortativity, and eigenvector distributions. We have also tested our techniques using swap randomization.
Clouder: a flexible large scale decentralized object store: architecture overview
Authors: Ricardo Vilaça, Rui Oliveira
Venue: Proceedings of the Third Workshop on Dependable Distributed Data Management (2009)

The current exponential growth of data calls for massive-scale capabilities of storage and processing. Such large volumes of data tend to disallow their centralized storage and processing making extensive and flexible data partitioning unavoidable. This is being acknowledged by several major Internet players embracing the Cloud computing model and offering first generation remote storage services with simple processing capabilities. In this position paper we present preliminary ideas for the architecture of a flexible, efficient and dependable fully decentralized object store able to manage very large sets of variable size objects and to coordinate in place processing. Our target are local area large computing facilities composed of tens of thousands of nodes under the same administrative domain. The system should be capable of leveraging massive replication of data to balance read scalability and fault tolerance.
Bioinformatics: A Concept-Based Introduction, 1st edition
Authors: Venkatarajan Mathura, Pandjassarame Kangueane
Venue:  (2008)

Bioinformatics is an evolving field that is gaining popularity due to genomics, proteomics and other high-throughput biological methods. The function of bioinformatic scientists includes biological data storage, retrieval and in silico analysis of the results from large-scale experiments. This requires a grasp of knowledge mining algorithms, a thorough understanding of biological knowledge base, and the logical relationship of entities that describe a process or the system. Bioinformatics researchers are required to be trained in multidisciplinary fields of biology, mathematics and computer science. Currently the requirements are satisfied by ad hoc researchers who have specific skills in biology or mathematics/computer science. But the learning curve is steep and the time required to communicate using domain specific terms is becoming a major bottle neck in scientific productivity. This workbook provides hands-on experience which has been lacking for qualified bioinformatics researchers.
DHV: A Code Consistency Maintenance Protocol for Multi-hop Wireless Sensor Networks
Authors: Thanh Dang, Nirupama Bulusu, Wu-Chi Feng, Seungweon Park
Venue: Proceedings of the 6th European Conference on Wireless Sensor Networks (2009)

Ensuring that every sensor node has the same code version is challenging in dynamic, unreliable multi-hop sensor networks. When nodes have different code versions, the network may not behave as intended, wasting time and energy. We propose and evaluate DHV, an efficient code consistency maintenance protocol to ensure that every node in a network will eventually have the same code. DHV is based on the simple observation that if two code versions are different, their corresponding version numbers often differ in only a few least significant bits of their binary representation. DHV allows nodes to carefully select and transmit only necessary bit level information to detect a newer code version in the network. DHV can detect and identify version differences in O(1) messages and latency compared to the logarithmic scale of current protocols. Simulations and experiments on a real MicaZ testbed show that DHV reduces the number of messages by 50%, converges in half the time, and reduces the number of bits transmitted by 40-60% compared to DIP, the state-of-the-art protocol.
Attaching UI enhancements to websites with end users
Authors: Michael Toomim, Steven M. Drucker, Mira Dontcheva, Ali Rahimi, Blake Thomson, James A. Landay
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We present reform, a step toward write-once apply-anywhere user interface enhancements. The reform system envisions roles for both programmers and end users in enhancing existing websites to support new goals. First, a programmer authors a traditional mashup or browser extension, but they do not write a web scraper. Instead they use reform, which allows novice end users to attach the enhancement to their favorite sites with a scraping by-example interface. reform makes enhancements easier to program while also carrying the benefit that end users can apply the enhancements to any number of new websites. We present reform's architecture, user interface, interactive by-example extraction algorithm for novices, and evaluation, along with five example reform enabled enhancements.
Missing Data Analysis: A Kernel-Based Multi-Imputation Approach
Authors: Shichao Zhang, Zhi Jin, Xiaofeng Zhu, Jilian Zhang
Venue: Transactions on Computational Science III (2009)

Many missing data analysis techniques are of single-imputation. However, single-imputation cannot provide valid standard errors and confidence intervals, since it ignores the uncertainty implicit in the fact that the imputed values are not the actual values. Filling in each missing value with a set of plausible values is called multi-imputation. In this paper we propose a kernel-based stochastic non-parametric multi-imputation method under MAR (Missing at Random) and MCAR (Missing Completely at Random) missing mechanisms in nonparametric regression settings. Furthermore, we present a kernel-based stochastic semi-parametric multi-imputation method while we have some priori knowledge about the dataset with missing. Our algorithms are designed specifically with the aim of optimizing the confidence-interval and the relative efficiency. The proposed technique is evaluated by experimentations, using simulation data and real data, and the results demonstrate that our method performs much better than the NORM method, and is promising.
A conversational decision support system for resource allocation without explicit objective function
Authors: Fumihiko Mori, Hiroshi Tsuji, Takashi Sato
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

This paper presents a conversational multiobjective decision support system. The system is called RAINBOW: Resource Allocation in Business Operation under Uncertain Worth. Our focus in the design and development of RAINBOW is placed on the loosely structured decision situation where the objective functions are given only implicitly and, as such, should be approximated by the decision maker as the decision making process proceeds.
The Price of Malice in Linear Congestion Games
Authors: Aaron Roth
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We study the price of malice in linear congestion games using the technique of no-regret analysis in the presence of Byzantine players. Our assumptions about the behavior both of rational players, and of malicious players are strictly weaker than have been previously used to study the price of malice. Rather than assuming that rational players route their flow according to a Nash equilibrium, we assume only that they play so as to have no regret. Rather than assuming that malicious players myopically seek to maximize the social cost of the game, we study Byzantine players about whom we make no assumptions, who may be seeking to optimize any utility function, and who may engage in an arbitrary degree of counter-speculation. Because our assumptions are strictly weaker than in previous work, the bounds we prove on two measures of the price of malice hold also for the quantities studied by Babaioff et al. [2] and Moscibroda et al. [15] We prove tight bounds both for the special case of parallel link routing games, and for general congestion games.
CRE Loaded 6.2 Training Manual
Authors: Kerry Watson
Venue:  (2007)

If you need to quickly learn how to set up and operate an online business... especially if you have no prior experience with websites or ecommerce... YOU NEED THIS BOOK. The CRE Loaded Training Manual makes learning the "language" of ecommerce easy and fun. Each chapter corresponds to a chapter in the CRE Loaded User Manual, giving insight and background into the material.
A compiler-directed data prefetching scheme for chip multiprocessors
Authors: Seung Woo Son, Mahmut Kandemir, Mustafa Karakoy, Dhruva Chakrabarti
Venue: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming (2009)

Data prefetching has been widely used in the past as a technique for hiding memory access latencies. However, data prefetching in multi-threaded applications running on chip multiprocessors (CMPs) can be problematic when multiple cores compete for a shared on-chip cache (L2 or L3). In this paper, we (i) quantify the impact of conventional data prefetching on shared caches in CMPs. The experimental data collected using multi-threaded applications indicates that, while data prefetching improves performance in small number of cores, its benefits reduce significantly as the number of cores is increased, that is, it is not scalable; (ii) identify harmful prefetches as one of the main contributors for degraded performance with a large number of cores; and (iii) propose and evaluate a compiler-directed data prefetching scheme for shared on-chip cache based CMPs. The proposed scheme first identifies program phases using static compiler analysis, and then divides the threads into groups within each phase and assigns a customized prefetcher thread (helper thread) to each group of threads. This helps to reduce the total number of prefetches issued, prefetch overheads, and negative interactions on the shared cache space due to data prefetches, and more importantly, makes compiler-directed prefetching a scalable optimization for CMPs. Our experiments with the applications from the SPEC OMP benchmark suite indicate that the proposed scheme improves overall parallel execution latency by 18.3% over the no-prefetch case and 6.4% over the conventional data prefetching scheme (where each core prefetches its data independently), on average, when 12 cores are used. The corresponding average performance improvements with 24 cores are 16.4% (over the no-prefetch case) and 11.7% (over the conventional prefetching case). We also demonstrate that the proposed scheme is robust under a wide range of values of our major simulation parameters, and the improvements it achieves come very close to those that can be achieved using an optimal scheme.
Adaptive progress indicator for long running SQL queries
Authors: Mario Milicevic, Krunoslav Zubrinic, Ivona Zakarija
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Percent-done progress indicators are a technique for graphically showing how much of a long task has been completed. In the database environment such information is especially important during the long-running query execution. The proposed method constructs (during the learning phase) adaptive progress indicator model analyzing influence of averaged system state (represented with attributes describing CPU, memory and disk subsystem activity) on the query response time. Experimental evaluation shows that adaptive progress indicators can enhance users' experience and productivity.
Visualising and physicalising the intangible product: "What happened to that bloke who designed the marble answer machine?"
Authors: Durrell Bishop
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

Designers in early 1980s were experimenting with "What should an electronic product look like?". Yet we still live in a time where it is difficult to use many electronic products. Are physical designers decoratively wallpapering over the functions? I have worked, taught and experimented in design but still remain curious about how to best visualise and physicalise the intangible product. 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