ppxscal/embedding_network huggingface dataset:
Increasing application performance in virtual environments through run-time inference and adaptation
Authors: A. I. Sundararaj, Ashish Gupta, P. A. Dinda
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

Virtual machine distributed computing greatly simplifies the use of widespread computing resources by lowering the level of abstraction, benefiting both resource providers and users. Towards that end our Virtuoso middleware closely emulates the existing process of buying, configuring and using physical machines. Virtuoso's VNET component is a simple and efficient layer two virtual network tool that makes these virtual machines (VMs) appear to be physically connected to the home network of the user while simultaneously supporting arbitrary topologies and routing among them. Virtuoso's VTTIF component continually infers the communication behavior of the application running in a collection of VMs. The combination of overlays like VNET and inference frameworks like VTTIF has great potential to increase the performance, with no user or developer involvement, of existing, unmodified applications by adapting their virtual environments to the underlying computing infrastructure to best suit the applications. We show here how to use the continually inferred application topology and traffic to dynamically control three mechanisms of adaptation, VM migration, overlay topology, and forwarding to significantly increase the performance of two classes of applications, bulk synchronous parallel applications and transactional Web e-commerce applications.
Model-based clustering for longitudinal data
Authors: Rolando De la Cruz-Mesía, Fernando A. Quintana, Guillermo Marshall
Venue: Computational Statistics Data Analysis (2008)

A model-based clustering method is proposed for clustering individuals on the basis of measurements taken over time. Data variability is taken into account through non-linear hierarchical models leading to a mixture of hierarchical models. We study both frequentist and Bayesian estimation procedures. From a classical viewpoint, we discuss maximum likelihood estimation of this family of models through the EM algorithm. From a Bayesian standpoint, we develop appropriate Markov chain Monte Carlo (MCMC) sampling schemes for the exploration of target posterior distribution of parameters. The methods are illustrated with the identification of hormone trajectories that are likely to lead to adverse pregnancy outcomes in a group of pregnant women.
Adding Gestures to Ordinary Mouse Use: a New Input Modality for Improved Human-Computer Interaction
Authors: Luca Lombardi, Marco Porta
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

Although the way we interact with computers is substantially the same since twenty years --based on keyboard, mouse and window metaphor-- machine perception could be usefully exploited to enhance the human- computer communication process. In this paper, we present a vision-based user interface where plain, static hand gestures performed nearby the mouse are interpreted as specific input commands. Our tests demonstrate that this new input modality does not interfere with ordinary mouse use and can speed up task execution, while not requiring too much attention from the user.
Experiment of Phase Unwrapping Algorithm in Interferometric Synthetic Aperture Sonar
Authors: Jun Yun, Zhi-nong Zou, Jin-song Tang, Ai-qing Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Two-dimensional (2-D) phase unwrapping, which defined as the estimation of unambiguous phase data from a 2-D array known only modulo 2ð radian, is a key technique in the Interferometric Synthetic Aperture Sonar (InSAS). Unfortunately there are no a set of approaches of final word on phase unwrapping especially in the real dates. Recently, an InSAS prototype is developed and the lake trials were fulfilled. The phase unwrapping algorithms in the InSAS system were analyzed and their advantages and limitation were also studied with the results of data of Lake Trail. The results we derived from the lake trail will make foundation for further research.
Optimal fuzzy regulator
Authors: M. S. Ahmed, U. L. Bhatti, F. M. Al-Sunni, M. El-Shafei
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

The conventional design of fuzzy logic controller uses human intuition and experience, which rarely constitutes an optimal design. In this paper, a systematic design procedure is presented to realize the optimal fuzzy logic regulator. The proposed scheme minimizes a suitable criterion function employing the steepest descent method. The recently proposed Block Partial Derivative (BPD) is used to facilitate the gradient computation.
Fluid heuristics, Lyapunov bounds and efficient importance sampling for a heavy-tailed G/G/1 queue
Authors: J. Blanchet, P. Glynn, J. C. Liu
Venue: Queueing Systems: Theory and Applications (2007)

We develop a strongly efficient rare-event simulation algorithm for computing the tail of the steady-state waiting time in a single server queue with regularly varying service times. Our algorithm is based on a state-dependent importance sampling strategy that is constructed so as to be straightforward to implement. The construction of the algorithm and its asymptotic optimality rely on a Lyapunov-type inequality that is used to bound the second moment of the estimator. The solution to the Lyapunov inequality is constructed using fluid heuristics. Our approach takes advantage of the regenerative ratio formula for the steady-state distribution--and does not use the first passage time representation that is particular to the delay in the G/G/1 queue. Hence, the strategy has the potential to be applied in more general queueing models.
Reconstruction of Erasure Correcting Codes for Dependable Distributed Storage System without Spare Disks
Authors: Haruhiko Kaneko, Eiji Fujiwara
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

Demand is increasing for large-scale dependable storage systems for use in data-intensive servers, such as database and multimedia servers. Conventional dependable disk arrays utilize erasure correcting code to recover lost data stored on failed disks, and require two types of redundant disks: check disks to store check bits, and spare disks to replace failed disks. To reduce the number of redundant disks, this paper proposes a distributed storage system that does not require spare disks. Specifically, the proposed system replaces a failed disk with a check disk rather than with a spare disk. Erasure correction capability of the system gradually degrades with accumulation of failed disks. This paper proposes a reconstruction method for the parity-check matrix of low-density triple-erasure correcting code. Evaluation of the mean time to data loss (MTTDL) shows that, for a storage system with 120 information disks, the proposed storage system with 21 check disks gives an MTTDL of 7.9 × 104 years, while a conventional system with 26 redundant disks gives an MTTDL of 5.8 × 101 years, where the mean time to failure of each disk is 0.5 × 106 years and the maintenance interval of each system is 5,376 hours (i.e., 32 weeks).
Stechkin-Marchaud-type inequalities with Jacobi weights for Bernstein operators
Authors: Jianjun Wang, Yinchuan Xue, Fengjun Li
Venue: Journal of Applied Mathematics and Computing (2007)

Using the modulus of smoothness ωϕλ2(f, t)ω, Stechkin-March-and-Type inequalities with Jacobi weights of Bernstein Operators is established.
Incentive-Driven P2P Anonymity System: A Game-Theoretic Approach
Authors: Souvik Ray, Giora Slutzki, Zhao Zhang
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Anonymous communication systems built on P2P infrastructures using anonymity forwarders are frequently affected by the churn problem, i.e. frequent joins and leaves of nodes. The problem unavoidably affects the quality of provided anonymity: The availability of anonymity forwarders will be decreased, which reduces the anonymity set; and the frequency of path reformation will increase, which increases the chance of successful intersection attacks. We propose an incentive-based P2P mechanism as an approach to providing reliable anonymity forwarding. It uses incentives to induce the peer nodes to provide anonymity forwarding as reliable service and to make stable and distributed forwarding decisions to minimize the frequency of path reformations. To support incentive, a payment system has been designed which meet the anonymity requirement and can handle typical scenarios of cheating and malicious attacks. To make sound forwarding decisions, we use game theory to carefully design the forwarding strategies used by the peer nodes. We have used event-driven simulations to evaluate the quality of anonymity provided by the mechanism under high churn and with the presence of malicious nodes. The results show that the quality of anonymity is maintained in those scenarios.
Efficient and optimal block matching for motion estimation
Authors: Stefano Mattoccia, Federico Tombari, Luigi Di Stefano, Marco Pignoloni
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

This paper proposes a novel technique for performing fast block matching for motion estimation which is optimal, meaning it yields the same results as a full-search investigation. The proposed technique derives from an approach previously proposed [10] for template matching and it is based on the deployment of a succession of lower bounding functions of the matching metric. Hence, an algorithm is outlined which efficiently exploits these bounding functions in order to rapidly determine non-matching block candidates, thus reducing the overall computational burden. Experimental results show that, compared to the brute-force approach, the proposed technique allows for notable reductions in terms of number of operations and computation times.
Computing in Science & Engineering 2007 Annual Index, Volume 9
Venue: Computing in Science and Engineering (2007)

Computing in Science & Engineering's 2007 annual index includes a complete author index and a list of all articles and departments published this year. The PDF file is free, and all titles link to their IEEE Computer Society Digital Library abstracts. CiSE subscribers can also access the HTML file, which includes internal links for coauthors.
Schema-based scheduling of event processors and buffer minimization for queries on structured data streams
Authors: Christoph Koch, Stefanie Scherzinger, Nicole Schweikardt, Bernhard Stegmaier
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

We introduce an extension of the XQuery language, FluX, that supports event-based query processing and the conscious handling of main memory buffers. Purely event-based queries of this language can be executed on streaming XML data in a very direct way. We then develop an algorithm that allows to efficiently rewrite XQueries into the event-based FluX language. This algorithm uses order constraints from a DTD to schedule event handlers and to thus minimize the amount of buffering required for evaluating a query. We discuss the various technical aspects of query optimization and query evaluation within our framework. This is complemented with an experimental evaluation of our approach.
A Multi-view Approach to Semi-supervised Document Classification with Incremental Naïve Bayes
Authors: Ping Gu, Qingsheng Zhu, Cheng Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Many semi-supervised learning algorithms only consider the distribution of words frequency, ignoring the semantic and syntactic information underlying the documents. In this paper, we present a new multi-view approach for semi-supervised document classification by incorporating both semantic and syntactic information. For this purpose, a co-training style algorithm Co-features is proposed, in active querying, we assign a weight to each sample according to its uncertainty factor, the most informative samples are selected and labeled by other "teachers". In contrast to batch training mode, an incremental Naïve Bayes update method is realized, which allow more efficient classifier training even with large pool of unlabeled data. Experimental results show that our algorithm works successfully on Reuters-21578 and WebKB, and is superior to Co-testing in the learning efficiency.
An evaluation scheme of adaptive configuration techniques
Authors: Huoping Chen, Salim Hariri
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

In this paper, we present a set of metrics (scalability, adaptability, overhead, latency, complexity, and effectiveness) to evaluate dynamic configuration techniques. We have applied these metrics to two real systems: remote management system and dynamic security configuration of networked systems. The evaluation results show that our approach can efficiently and dynamically manage system resources and network security with little overhead.
Patterns and Words, Logic and Narrative: What can we expect of a visual language?
Authors: Colin Ware
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

Current theories of perception and language can help answer the question, "What can we expect of a visual language?" There are fundamental differences between visual and linguistic forms of expression. Linguistic forms of expression are characterized by the use of a rich set of socially invented arbitrary symbols as well as a form of logic exemplified by the "ifs', "ands' and "buts' of natural language. The grammar of visual representation is quite different having to do with pattern relationships such as "connected', "inside', "outside', or "part of'. These derive from our visual processing mechanism developed through interaction with the visual environment. This means that certain kinds of logic are best left to verbal or written language whereas structural relationships are best conveyed visually.
Tabular placement of relational data on MEMS-based storage devices
Authors: Hailing Yu, Divyakant Agrawal, Amr El Abbadi
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Due to the advances in semiconductor manufacturing, the gap between main memory and secondary storage is constantly increasing. This becomes a significant performance bottleneck for Database Management Systems, which rely on secondary storage heavily to store large datasets. Recent advances in nanotechnology have led to the invention of alternative means for persistent storage. In particular, MicroElectroMechanical Systems (MEMS) based storage technology has emerged as the leading candidate for next generation storage systems. In order to integrate MEMS-based storage into conventional computing platform, new techniques are needed for I/O scheduling and data placement. In the context of relational data, it has been observed that access to relations needs to be enabled in both row-wise as well as in columnwise fashions. In this paper, we exploit the physical characteristics of MEMS-based storage devices to develop a data placement scheme for relational data that enables retrieval in both row-wise and column-wise manner. We demonstrate that this data layout not only improves I/O utilization, but results in better cache performance.
An operational amplifier model for evaluating test strategies at behavioural level
Authors: Eduardo Romero, Gabriela Peretti, Carlos Marqués
Venue: Microelectronics Journal (2007)

This paper proposes a new operational amplifier model for evaluating test strategies at behavioural level. Major modifications on a previously reported model for improving its performance and for allowing reliable fault simulations are presented here. The new model presents a set of very appealing characteristics for behavioural-level fault injection and simulation. The matching between the behavioural-level model and a transistor-level one is evaluated for validating the model. We suggest the use of the model early in the design process, when the schematic of the circuit is not available for the test engineer and only the specifications are given. The model is also useful for evaluating different test alternatives for commercial operational amplifiers or standard cells designed by others vendors. The paper addresses two application examples and shows the usefulness of the model for evaluating test strategies when only the specifications of the circuit are available.
Leak-Mending and Recruitment of Incomplete Points Data In 3D Reconstruction Based on Genetic Algorithm
Authors: Cheng Xiaomin, Wang Junchuan, Wang Qiaoguan
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

The leak-mending of mass points data and the recruitment of incomplete points data have great impact on the 3D reconstruction. In this paper, we report an approach to the analysis and reconstruction of 3D scanning points data based on the genetic algorithm to explore the optimum value of recruiting data by controlling the normal vector of the triangle surface, in which the deskpoint could be cleared by boundary analysis of the points data. The leak-mending and recruitment of incomplete points data would be processed by taking the variable of normal vector as the objective function and keeping the smoothness of curved surface. The effectivity of this approach to the points data processing has been confirmed by the results of experimental samples.
A service-centric approach to access control and monitoring based on distributed trust
Authors: Jimmy McGibney, Dmitri Botvich
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

A service-oriented approach to dynamic refinement of security enforcement is described in this paper. This is based on a closed loop feedback system where live distributed trust measures are used to adapt access control settings in a changing threat environment. A general trust overlay architecture and model are presented. Some specific application scenarios are discussed, in particular spam filtering and distributed intrusion detection in mobile ad hoc networks. It is shown using simulations of some specific scenarios that this dynamic system is robust and has the potential to enhance security and access control efficiency.
Corrupted Region Restoration Using Second Order Tensors and Segmentation
Authors: Jonghyun Park, Nguyen Trung Kien, Hyesuk Kim, Gueesang Lee
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

In this paper, we address the problem of restoration efficiently and effectively, by formulating as one of surface inference from a sparse and noisy point set in a 3D space. Given a set of noisy data correspondence in corrupted images, our method extracts good matches and rejects noises. The methodology is unconventional, since, unlike most other methods optimizing certain scalar, objective functions, our approach does not involve initialization or any iterative search in the parameter space. Therefore, it is free of the problem of local optima or poor convergence. Subject to the general restoration of natural images, we detect corrupted region and noises by a novel computation scheme, 3D tensor voting, which is an instance of the more general tensor voting. In essence, the input set of matches is first transformed into a sparse 3D point set. Dense, 3D tensor kernels are then used to vote for the most salient surface that captures all inliers inherent in the input. Lastly, density estimation for center modes detection and separated clustering algorithm is performed later for segmentation of values according to color components in the restored image. The experimental results show that proposed approach is efficient and robust in terms of restoring and segmenting corrupted color images.
TODD: Test-Oriented Development and Debugging
Authors: Oliver Dagenais, Dwight Deugo
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

The benefits of Test-Driven Development (TDD) can be appealing to many seeking to reduce the amount of time spent on a software project, but not all projects can implement the TDD methodology fully. A technique similar to TDD -- test oriented development -- is introduced and a prototype software implementation in the form of an Eclipse plug-in is presented to support the adoption of this more pragmatic approach by developers to help them write high quality software.
Brief paper: Stabilization of some fractional delay systems of neutral type
Authors: Catherine Bonnet, Jonathan R. Partington
Venue: Automatica (Journal of IFAC) (2007)

In this note, we give new stability tests which enable one to fully characterize the H"~-stability of systems with transfer function G(s)=r(s)p(s)+q(s)e^-^s^h, where h>0 and p,q,r are real polynomials in the variable s^@m for 0"~p(s)/q(s)|>1.
The Research on the Application of Text Clustering and Natural Language Understanding in Automatic Abstracting
Authors: Qinglin Guo, Cunbin Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Qinglin Guo1, Cunbin Li2 1. School of Computer Science and Technology, North China Electric Power University, Beijing, 102206, China 2. School of Business Administration, North China Electric Power University, Beijing, 102206, China qlguo88@sohu.com Abstract A method of realization of Automatic Abstracting based on Text Clustering and Natural Language Understanding is brought forward, aimed at overcoming shortages of some current methods. The method makes use of text Clustering and can realize Automatic Abstracting of multi- documents. The algorithm of twice Word Segmentation based on the Title and First- Sentences in Paragraphs is brought forward. Its precision and recall is above 95%. For a specific domain on plastics, an Automatic Abstracting system named TCAAS is implemented. The precision and recall of multi- document's Automatic Abstracting is above 75%. And experiments do prove that it is feasible to use the method to develop a domain Automatic Abstracting System, which is valuable for further study in more depth.