ppxscal/embedding_network huggingface dataset:
Distributed algorithm for change detection in satellite images for Grid Environments
Authors: Florin Pop, Claudiu Gruia, Valentin Cristea
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

This paper presents a solution for real-time satellite image processing. The focus is on the detection of changes in MODIS images. We present a distributed algorithm for change detection which is based on extracting relevant parameters from MODIS spectral bands. The algorithm detects the changes between two images of the same geographical area at different time moments. The algorithm, able to run in a Grid system, is scalable, fault-tolerant. We present the experimental results of this algorithm considering three spectral bands and different input images. We also propose a method to integrate applications based on this algorithm into the MedioGRID architecture.
Cost effective digital filter design for concurrent test
Authors: I. Bayraktaroglu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Invariant-based concurrent test schemes can provide economical solutions to the problem of concurrent testing of digital filters. Design methodologies for digital filters ensuring concurrent testability are outlined. Experimental results confirm through fault simulation 100% fault coverage within area cost comparable to that of DfT for off-line test and with error detection latency well below human response times.
Scaled generalized Bernstein polynomials and containment regions for the zeros of polynomials
Authors: Hansjörg Linden
Venue: Journal of Computational and Applied Mathematics (2007)

Let P"n(x)=@?"k"="0^n@b"kb"k","n(x;@a,@b),@b"n-@b, a generalized scaled Bernstein polynomial. Extending a result of Winkler [A resultant matrix for scaled Bernstein polynomials, Linear Algebra Appl. 319 (2000) 179-191] a companion matrix for P"n is given. The application of some matrix methods to this companion matrix yields regions for the zeros of P"n.
Reducing the cost of IT operations: is automation always the answer?
Authors: Aaron B. Brown, Joseph L. Hellerstein
Venue: Proceedings of the 10th conference on Hot Topics in Operating Systems - Volume 10 (2005)

The high cost of IT operations has led to an intense focus on the automation of processes for IT service delivery. We take the heretical position that automation does not necessarily reduce the cost of operations since: (1) additional effort is required to deploy and maintain the automation infrastructure; (2) using the automation infrastructure requires the development of structured inputs that have up-front costs for design, implementation, and testing that are not required for a manual process; and (3) detecting and recovering from errors in an automated process is considerably more complicated than for a manual process. Our studies of several data centers suggest that the up-front costs mentioned in (2) are of particular concern since many processes have a limited lifetime (e.g., 25% of the packages constructed for software distribution were installed on fewer than 15 servers). We describe a process-based methodology for analyzing the benefits and costs of automation, and hence for determining if automation will indeed reduce the cost of IT operations. Our analysis provides a quantitative framework that captures several traditional rules of thumb: that automating a process is beneficial if the process has a sufficiently long lifetime, if it is relatively easy to automate (i.e., can readily be generalized from a manual process), and if there is a large cost reduction (or leverage) provided by each automated execution of the process compared to a manual invocation.
Detecting performance anomalies in global applications
Authors: Terence Kelly
Venue: Proceedings of the 2nd conference on Real, Large Distributed Systems - Volume 2 (2005)

Understanding real, large distributed systems can be as difficult and important as building them. Complex modern applications that span geographic and organizational boundaries confound performance analysis in challenging new ways. These systems clearly demand new analytic methods, but we are wary of approaches that suffer from the same problems as the systems themselves (e.g., complexity and opacity). This paper shows how to obtain valuable insight into the performance of globally-distributed applications without abstruse techniques or detailed application knowledge: Simple queueing-theoretic observations together with standard optimization methods yield remarkably accurate performance models. The models can be used for performance anomaly detection, i.e., distinguishing performance faults from mere overload. This distinction can in turn suggest both performance debugging tools and remedial measures. Extensive empirical results from three production systems serving real customers--two of which are globally distributed and span administrative domains-- demonstrate that our method yields accurate performance models of diverse applications. Our method furthermore flagged as anomalous an episode of a real performance bug in one of the three systems.
Measuring similarity between semantic business process models
Authors: Marc Ehrig, Agnes Koschmider, Andreas Oberweis
Venue: Proceedings of the fourth Asia-Pacific conference on Comceptual modelling - Volume 67 (2007)

A business process may be modeled in different ways by different modelers even when utilizing the same modeling language. An appropriate method for solving ambiguity issues in process models caused by the use of synonyms, homonyms or different abstraction levels for process element names is the use of ontology-based descriptions of process models. So-called semantic business process models promise to support business process interoperability and interconnectivity. But, for (semi-) automatic process interoperability and interconnectivity two problems need to be solved. How can similar terms for process element names be automatically discovered and how can semantic business process composition be facilitated. In this paper we will present solutions for these problems based upon an OWL DL-based description of Petri nets.
New results of almost periodic solutions for recurrent neural networks
Authors: Bingwen Liu, Lihong Huang
Venue: Journal of Computational and Applied Mathematics (2007)

In this paper recurrent neural networks with time-varying delays and continuously distributed delays are considered. Without assuming the global Lipschitz conditions of activation functions, some sufficient conditions for the existence and local exponential stability of the almost periodic solutions are established, which are new and complement previously known results.
Middleware Support for Aperiodic Tasks in Distributed Real-Time Systems
Authors: Yuanfang Zhang, Chenyang Lu, Christopher Gill, Patrick Lardieri, Gautam Thaker
Venue: Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium (2007)

Many mission-critical distributed real-time applications must handle aperiodic tasks with end-to-end deadlines. However, existing middleware (e.g., RT-CORBA) lacks schedulability analysis and run-time enforcement mechanisms needed to give online real-time guarantees for aperiodic tasks. The primary contribution of this work is the design, implementation, and performance evaluation of the first realization of deferrable server and admission control mechanisms for aperiodic tasks in middleware. Empirical results on a KURT-Linux testbed demonstrate the efficiency and effectiveness of our deferrable server and admission control mechanisms in TAO's federated event service.
On the Link Excess Life in Mobile Wireless Networks
Authors: A. Nayebi, A. Khosravi, H. Sarbazi-Azad
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

In this paper, one of the most important parameters in performance evaluation and protocol design of wireless networks, Link Excess Life (LEL), is investigated. An analytical model for LEL is proposed and evaluated. Evaluation of the proposed model leads to the first closed form expression for the excess life PDF. The closed form expression affords ease of further evaluations, e.g., an interesting result is that the average excess life is infinite for the proposed model. The effect of relative velocity distribution on the link excess life PDF is also investigated. The superposition property of LEL is mentioned and used to explore a systematic method for evaluation of the effect of stationary or pausing nodes on link excess life as well as a general method to approximate the link excess life PDF for various relative velocity distributions. Moreover, the effect of the buffer zone on the link excess life PDF in topology control is also investigated analytically. A simulation framework is developed and extensive simulations are performed to validate the results.
View-Dependent Rendering of Virtual Plane Models
Authors: Bin Sheng, Enhua Wu
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

In this paper, we propose a hybrid representation of point-based models captured from calibrated depth images, through which the realtime rendering for the image-based models can be achieved. Our method starts from classification of input pixels of the input images into two categories, indicating the planar and non-planar surfaces respectively. For the planar surfaces, normal texture-mapping is applied. For the pixels corresponding to the nonplanar surfaces, we propose a method for obtaining some textured planes, called virtual planes, to represent the visual appearance of the nonplanar surfaces. A reconstructed virtual plane is a textured and partially transparent plane into which the input images are mapped using perspective projection. The RANSAC method is used to find the position of the textured planes, and optic flow measures are used to determine their textures. For other pixels corresponding to the non-planar surfaces with rich geometrical details, we use the point primitive to reconstruct the surface, where the redundant pixels are removed again through sampling rate comparison. Under this hybrid reconstruction, polygon texture mapping and point-based rendering are combined to produce the novel views, to take full advantages of the acceleration power of graphics hardware.
A Library for Secure Multi-threaded Information Flow in Haskell
Authors: Ta-chung Tsai, Alejandro Russo, John Hughes
Venue: Proceedings of the 20th IEEE Computer Security Foundations Symposium (2007)

Li and Zdancewic have recently proposed an approach to provide information-flow security via a library rather than producing a new language from the scratch. They have shown how to implement such a library in Haskell by using arrow combinators. However, their approach only works with computations that have no side-effects. In fact, they leave as an open question how their library, and the mechanisms in it, need to be modified to consider these kind of effects. Another absent feature in the library is support for multithreaded programs. Information-flow in multi-threaded programs still remains as a challenge, and no support for that has been implemented yet. It is not surprising, then, that the two main stream compilers that provide information-flow security, Jif and FlowCaml, lack support for multithreading. Following ideas taken from literature, this paper presents an extension to Li and Zdancewic's library that provides information-flow security in presence of reference manipulation and multithreaded programs. Moreover, an onlineshopping case study has been implemented to evaluate the proposed techniques. The case study reveals that exploiting concurrency to leak secrets is feasible and dangerous in practice and how our extension helps avoiding that. To the best of our knowledge, this is the first implemented tool to guarantee information-flow security in concurrent programs and the first implementation of a case study that involves concurrency and information-flow policies.
Defragmenting DHT-based Distributed File Systems
Authors: Jeffrey Pang, Phillip B. Gibbons, Michael Kaminsky, Srinivasan Seshan, Haifeng Yu
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

Existing DHT-based file systems use consistent hashing to assign file blocks to random machines. As a result, a user task accessing an entire file or multiple files needs to retrieve blocks from many different machines. This paper demonstrates that significant availability and performance gains can be achieved if, instead, users are able to retrieve all the data needed for a given task from only a few DHT nodes. We explore the design and implications of such a "defragmented" DHT-based distributed file system, called D2, that also maintains important DHT properties like storage load balance. We show using real-world file system traces that a simple key encoding scheme is sufficient to maintain good defragmentation for most user tasks. Using both simulation and an actual 1,000 node deployment, we show that D2 increases availability by over an order of magnitude and improves user-perceived latency by 30" 100% compared to a traditional design.
Design and fabrication of a magnetic bi-stable electromagnetic MEMS relay
Authors: Shi Fu, Guifu Ding, Hong Wang, Zhuoqing Yang, Jianzhi Feng
Venue: Microelectronics Journal (2007)

This paper describes the principles, design, fabrication and performance of a new type of electromagnetic bistable MEMS relay. The microdevice is operated by a wiggling microactuator, which is symmetrically assembled with two integrated planar windings and one permanent rotor in the form of sandwich with coaxial sustained gaps between each other. The micromachined rotor moves to-and-fro around the axis and operates the joined brush to open or close external circuit. This hybrid MEMS relay has been provided with fast response and latching function owing to the special design. The response time is about 0.3ms and the maximum load current is 2A.
Mining Negative and Positive Influence Rules Using Kullback-Leibler Divergence
Authors: Leila Nemmiche Alachaher, Sylvie Guillaume
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

This paper describes a new method for mining negative and positive quantitative influence rules based on a coordination between a statistical dissimilarity measure (Kullback Leibler divergence) and contingency tables. This coordination identifies the significant positive and negative correlations and enables pertinent influence rules extraction.
Stress characterization of electroplated gold layers for low temperature surface micromachining
Authors: B. Margesin, A. Bagolini, V. Guarnieri, F. Giacomozzi, A. Faes, R. Pal, M. Decarli
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

In this work, the stress of electroplated gold films has been analyzed versus plating current density and bath temperature. Two different plating solutions have been adopted, one being based on cyanide-gold salt, the other on sulfite-gold. Gold surface quality was investigated in the experimented range of plating temperature and current density, in order to control the limit conditions for plating: surface roughness and non-uniformity appear whenever deposition parameters are brought to the limit (typically below 2 mA/cm/sup 2/ and above 5 mA/cm/sup 2/). Plated gold stress measurement was carried out by wafer curvature comparison, before and after deposition, using Stoney's formula for thin films/sup 1,2/. A current density range between 1.5 and 6 mA/cm/sup 2/ and temperature range between 50 and 70/spl deg/C was investigated. Stress analysis was also carried out on a Cr-Au multilayer, which actually is the structural layer employed for gold microstructures: the multilayer consists of a chromium adhesion layer, a PVD gold seed layer and a plated gold layer, with thickness respectively 10 nm, 150 nm and 1500 nm. A range of stress was obtained, varying from tensile to compressive: cyanide bath yielded stress from -30 MPa to about 0 MPa, and sulfite bath showed stress between -90 MPa and 110 MPa. Stress variation induced by thermal treatments after deposition was also investigated, by examining the effect of photoresist sacrificial etching on the internal stress of chromium-gold structural layers: the final stress was about 180 MPa tensile for all samples, regardless the as-deposited stress, with a variation ranging from about 80 MPa to more than 200 MPa.
Best Practices for Writing and Managing Performance, Reliability, and Availability Requirements
Authors: Andre B. Bondi
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

Functional requirements refer to how a piece of a system functions or what it does given specific inputs. Nonfunctional requirements (NFRs) refer to such business and engineering needs as performance, reliability, availability, stability, usability, compatibility with interfaces, and security. They are crucial inputs for architects and system designers when performing such tasks as specifying information flows, defining deployment scenarios, choosing software platforms, sizing system configurations, determining required levels of redundancy, and identifying system measurement instrumentation. NFRs that have been clearly and succinctly written contribute to the success of a project by reducing the time required to understand them and to devise and implement procedures for ensuring and verifying that they have been met. By contrast, poorly written NFRs can lead to confusion among developers and architects, resulting in much wasted time, or to the failure and cancellation of a project, especially if the delivered system crashes often or runs too slowly.
The learning mechanism of the Interactive Multimedia Intelligent Tutoring System (IMITS)
Authors: B. P. Butz
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The Interactive Multimedia Intelligent Tutoring System (IMITS) project is a feasibility study that integrates interactive multimedia with expert system technology. It is a test bed to show that these two complementary technologies may be combined successfully to form a framework useful for any educational material. It combines several commercially available packages and establishes dynamic communications among these packages. This paper describes one aspect of IMITS, the learning mechanism that is controlled by the expert system and that attempts to assist the student learn the material and concepts presented. 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
Computers in second language (l2) composition classrooms
Authors: Lisa J. Mcclure
Venue:  (2006)

As education incorporated technology into classroom pedagogy, second language writing instruction experimented with computers in the teaching of writing in English as a second language. Though abundant, the research has yet to address second language students' perception of the use of computers in the writing instruction. This descriptive study examines the views of 15 students who took Linguistics 101, a first semester composition course for second language learners, at Southern Illinois University Carbondale. Data was collected through pre- and post-diagnostic essays, surveys, and interviews. At the beginning of the Fall 2006 semester, students did not show much interest in the presence or use of computers in the writing classroom; at the end of the academic term, students not only had a positive attitude toward computers, but also were able to perceive that the computer could benefit learners in the process of becoming better writers. Furthermore, the study presents pedagogical practices that can be used in the classroom to enhance the use of computers in the teaching of writing in the second language. Chapter One introduces the research problem and the rationale for this type of study. Chapter Two provides a historical background of the writing instruction and research in English as a second language as well as an overview of the impact computers have had on the teaching of L2 writing. Chapter Three describes the methodology of the study. Chapters Four and Five respectively provide the results and analysis of the study. Chapter Six addresses the limitations and conclusions of this study plus offers recommendation for future research. The appendices provide copies of the materials used to collect data, of students' pre- and post-diagnostic essays, the scoring rubrics, and a collection of activities for the computer classroom.
Performance evaluation of InfiniBand with PCI Express
Authors: Jiuxing Liu, A. Mamidala, A. Vishnu, D. K. Panda
Venue: Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium (2004)

We present an initial performance evaluation of InfiniBand HCAs (host channel adapters) from Mellanox with PCI Express interfaces. We compare the performance with HCAs using PCI-X interfaces. Our results show that InfiniBand HCAs with PCI Express can achieve significant performance benefits. Compared with HCAs using 64 bit/133 MHz PCI-X interfaces, they can achieve 20%-30% lower latency for small messages. The small message latency achieved with PCI Express is around 3.8 /spl mu/s, compared with the 5.0 /spl mu/s with PCI-X. For large messages, HCAs with PCI Express using a single port can deliver unidirectional bandwidth up to 968 MB/s and bidirectional bandwidth up to 1916 MB/s, which are, respectively, 1.24 and 2.02 times the peak bandwidths achieved by HCAs with PCI-X. When both the ports of the HCAs are activated, HCAs with PCI Express can deliver a peak unidirectional bandwidth of 1486 MB/s and aggregate bidirectional bandwidth up to 2729 MB/s, which are 1.93 and 2.88 times the peak bandwidths obtained using HCAs with PCI-X. PCI Express also improves performance at the MPI level. A latency of 4.6 /spl mu/s with PCI Express is achieved for small messages. And for large messages, unidirectional bandwidth of 1497 MB/s and bidirectional bandwidth of 2724 MB/s are observed.
Efficient topic-based unsupervised name disambiguation
Authors: Yang Song, Jian Huang, Isaac G. Councill, Jia Li, C. Lee Giles
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Name ambiguity is a special case of identity uncertainty where one person can be referenced by multiple name variations in different situations or even share the same name with other people. In this paper, we focus on the problem of disambiguating person names within web pages and scientific documents. We present an efficient and effective two-stage approach to disambiguate names. In the first stage, two novel topic-based models are proposed by extending two hierarchical Bayesian text models, namely Probabilistic Latent Semantic Analysis (PLSA) and Latent Dirichlet Allocation (LDA). Our models explicitly introduce a new variable for persons and learn the distribution of topics with regard to persons and words. After learning an initial model, the topic distributions are treated as feature sets and names are disambiguated by leveraging a hierarchical agglomerative clustering method. Experiments on web data and scientific documents from CiteSeer indicate that our approach consistently outperforms other unsupervised learning methods such as spectral clustering and DBSCAN clustering and could be extended to other research fields. We empirically addressed the issue of scalability by disambiguating authors in over 750,000 papers from the entire CiteSeer dataset.