ppxscal/embedding_network huggingface dataset:
Niobe: A practical replication protocol
Authors: John Maccormick, Chandramohan A. Thekkath, Marcus Jager, Kristof Roomp, Lidong Zhou, Ryan Peterson
Venue: ACM Transactions on Storage (TOS) (2008)

The task of consistently and reliably replicating data is fundamental in distributed systems, and numerous existing protocols are able to achieve such replication efficiently. When called on to build a large-scale enterprise storage system with built-in replication, we were therefore surprised to discover that no existing protocols met our requirements. As a result, we designed and deployed a new replication protocol called Niobe. Niobe is in the primary-backup family of protocols, and shares many similarities with other protocols in this family. But we believe Niobe is significantly more practical for large-scale enterprise storage than previously published protocols. In particular, Niobe is simple, flexible, has rigorously proven yet simply stated consistency guarantees, and exhibits excellent performance. Niobe has been deployed as the backend for a commercial Internet service; its consistency properties have been proved formally from first principles, and further verified using the TLA &plus; specification language. We describe the protocol itself, the system built to deploy it, and some of our experiences in doing so.
Towards Scheduling Virtual Machines Based On Direct User Input
Authors: Bin Lin, Peter A. Dinda
Venue: Proceedings of the 2nd International Workshop on Virtualization Technology in Distributed Computing (2006)

We propose a new approach to scheduling virtual machines (VMs) on a provider CPU that is unique in that is based around the use of direct user input. In our system, a user's VM is scheduled as a periodic real-time task. The user can instantaneously manipulate his VM's schedule using a joystick. An on-screen display illustrates the current schedule's cost and indicates when the user's desired schedule is impossible due to the schedules of other VMs or resource constraints. We report on a user study of our prototype system that reveals that even a naive user is capable of using the interface to our system to find a schedule that balances cost and the comfort of his VM. Good schedules are user- and application-dependent to a large extent, illustrating the benefits of user involvement.
Flexecution as a Paradigm for Replanning, Part 1
Authors: Gary Klein
Venue: IEEE Intelligent Systems (2007)

This is the first of two essays about planning and execution with ill-defined and conflicting goals. Intelligent-systems researchers have wrestled with the difficulties posed by ill-defined goals, and one objective of these essays is to disseminate their insights to planners and project managers who don't appreciate these difficulties. A second objective is to encourage computer scientists to expand their efforts regarding mixed-initiative systems to support planning and execution with ill-defined goals.
A distributed content independent method for spam detection
Authors: Alex Brodsky, Dmitry Brodsky
Venue: Proceedings of the first conference on First Workshop on Hot Topics in Understanding Botnets (2007)

The amount of spam has skyrocketed in the recent past. Traditionally, spam was sent by single source mass mailers (spammers), making it relatively easy to screen out through the use of blacklists. Recently spammers started using botnets to send out the spam, rendering the blacklists ineffective. Although, content-based spam filters provide temporary relief, this is a never-ending cat-and-mouse game between spammers and filter developers. We propose a distributed, content independent, spam classification system that is specifically aimed at botnet generated spam and can be used in combination with existing spam classifiers. Our proposed system uses source identification in combination with a peer-to-peer based distributed database to identify e-mails that are likely to have originated from botnets. The system is distributed in order to provide a robust defense against denial-of-service attacks from the very same botnets. Lastly, our system is specifically designed to be used within the existing e-mail infrastructure. It does not require special hardware, changes to the underlying protocols, or changes to the mail transfer agents.
Medium-term horizon volatility forecasting: A comparative study
Authors: Richard Hawkes, Paresh Date
Venue: Applied Stochastic Models in Business and Industry (2007)

In this paper, volatility is estimated and then forecast using unobserved components-realized volatility (UC-RV) models as well as constant volatility and GARCH models. With the objective of forecasting medium-term horizon volatility, various prediction methods are employed: multi-period prediction, variable sampling intervals and scaling. The optimality of these methods is compared in terms of their forecasting performance. To this end, several UC-RV models are presented and then calibrated using the Kalman filter. Validation is based on the standard errors on the parameter estimates and a comparison with other models employed in the literature such as constant volatility and GARCH models. Although we have volatility forecasting for the computation of Value-at-Risk in mind the methodology presented has wider applications. This investigation into practical volatility forecasting complements the substantial body of work on realized volatility-based modelling in business. Copyright &copy; 2007 John Wiley & Sons, Ltd.
De novo peptide sequencing using ion peak intensity and amino acid cleavage intensity ratio
Authors: Mitsuhiro Kanazawa, Hisae Anyoji, Atsushi Ogiwara, Umpei Nagashima
Venue: Bioinformatics (2007)

Motivation: Peptide-sequencing methods by mass spectrum use the following two approaches: database searching and de novo sequencing. The database-searching approach is convenient; however, in cases wherein the corresponding sequences are not included in the databases, the exact identification is difficult. On the other hand, in the case of de novo sequencing, no preliminary information is necessary; however, continuous amino acid sequence peaks and the differentiation of these peaks are required. It is, however, very difficult to obtain and differentiate the peaks of all amino acids by using an actual spectrum. We propose a novel de novo sequencing approach using not only mass-to-charge ratio but also ion peak intensity and amino acid cleavage intensity ratio (CIR). Results: Our method compensates for any undetectable amino acid peak intervals by estimating the amino acid set and the probability of peak expression based on amino acid CIR. It provides more accurate identification of sequences than the existing methods, by which it is usually difficult to sequence. Contact: kanazawa@reifycs.com
An information theoretic rule for sample size adaptation in particle filtering
Authors: Oswald Lanz
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

To become robust, a tracking algorithm must be able to support uncertainty and ambiguity often inherently present in the data in form of occlusion and clutter. This comes usually at the price of more demanding computations. Sampling methods, such as the popular particle filter, accommodate this capability and provide a means of controlling the computational trade-off by adapting their resolution. This paper presents a method for adapting resolution on-the-fly to current demands. The key idea is to select the number of samples necessary to populate the high probability regions with a predefined density. The scheme then allocates more particles when uncertainty is high while saving resources otherwise. The resulting tracker propagates compact while consistent representations and enables for reliable real time operation otherwise compromised.
Neural Approach for Speed Estimation in Induction Motors
Authors: Alessandro Goedtel, Ivan N. Silva, Paulo J. A. Serni, Claudionor F. Nascimento
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

The use of sensorless technologies is an increasing tendency on industrial drives for electrical machines. The estimation of electrical and mechanical parameters involved with the electrical machine control is used very frequently in order to avoid measurement of all variables involved in this process. The cost reduction may also be considered in industrial drives, besides the increasing robustness of the system, as an advantage of the use of sensorless technologies. This work proposes the use of artificial neural networks to estimate one of the most important variables in the induction motor control schemes: the speed. Simulation and experimental results are presented to validate the proposed approach.
An explicit quasi-interpolation scheme based on C 1 quartic splines on type-1 triangulations
Authors: Tatyana Sorokina, Frank Zeilfelder
Venue: Computer Aided Geometric Design (2008)

We describe a new scheme based on quartic C^1-splines on type-1 triangulations approximating regularly distributed data. The quasi-interpolating splines are directly determined by setting the Bernstein-Bezier coefficients of the splines to appropriate combinations of the given data values. Each polynomial piece of the approximating spline is immediately available from local portions of the data, without using prescribed derivatives at any point of the domain. Moreover, the operator interpolates the given data values at all the vertices of the underlying triangulation. Since the Bernstein-Bezier coefficients of the splines are computed directly, an intermediate step making use of certain locally supported splines spanning the space is not needed. We prove that the splines yield nearly-optimal approximation order for smooth functions. The order is known to be best possible for these spaces. Numerical tests confirm the theoretical behavior and show that the approach leads to functional surfaces of high visual quality.
Cardiomorphologies: An Inner Journey through Art
Authors: George Poonkhin Khut
Venue: IEEE MultiMedia (2007)

George Khut took an experience-centered approach in Cardiomorphologies, an interactive artwork exploring how subjectivity is a physiologically embodied phenomenon. He offers ways to think about how collaborations—between artists, programmers, researchers, and the audience—shape the experience of interactive art.
A Comparison of Grid Computing systems and Globus by the application of auditing
Authors: Saeed Parsa, Najmeh Torabian
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Doing changes and adding new requirement to existing software systems, turns their primary architecture and force a huge expenditure. It is time and cost consummating. Today for preventing this problem, the method of reengineering is used. One of most known and common kind of reengineering is comparing current architecture with primary architecture or another known suitable sample. The described method in this paper is comparing Globus software architecture with implemented systems under Grid. This comparison first reveals the developed software systems weaknesses and then explains incorrect usage of Globus pieces. Finally using the offered implemented sample in this paper, success level of reverse engineering to find problems in developed systems is identified and the offered method will be tested as well.
Test of independence for generalized Farlie-Gumbel-Morgenstern distributions
Authors: Bilgehan Güven, Samual Kotz
Venue: Journal of Computational and Applied Mathematics (2008)

Given a pair of absolutely continuous random variables (X,Y) distributed as the generalized Farlie-Gumbel-Morgenstern (GFGM) distribution, we develop a test for testing the hypothesis: X and Y are independent vs. the alternative; X and Y are positively (negatively) quadrant dependent above a preassigned degree of dependence. The proposed test maximizes the minimum power over the alternative hypothesis. Also it possesses a monotone increasing power with respect to the dependence parameter of the GFGM distribution. An asymptotic distribution of the test statistic and an approximate test power are also studied.
A New Invertible Data Hiding In Compressed Videos or Images
Authors: Yueyun Shang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

In this paper, a new improved adaptive invertible information hiding method for MPEG video is proposed. Hidden data can be extracted without original signal and the original MPEG video data can be recovered if needed. Data embedding is controlled by a special pseudo-random key mechanism. The proposed algorithm can be implemented with low complexity and low visual distortion for covert communication applications. Experimental results show that the algorithm can survive appropriate MPEG recompression and has low visibility.
Characteristic Preserving Binarization for Fingerprint Image
Authors: Lei Guo, Da-hai Chen, Hai Li, Jiang Chang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper presents a new method for binarizing fingerprint image while preserving image characteristics. Firstly, a band-stop filter method is adopted to remove the noises in high frequency. At the same time, a simply-thresholded original image is passed to Gaussian low pass filter, and outlines of fingerprint region are get by applying region growing method to the filtered image. Then, background in band-pass image is filled with outlines of the fingerprint region. After these procedures, background intensity is close to zero, thus fixed threshold one is used for binarization. Our experiment results demonstrate that bandstop method can eliminate noises effectively in the fingerprint images. And binarization in outline of fingerprint can solve the problem of disturbance of the background. Segmenting foreground from background helps select threshold and keep the characteristics of fingerprint.
A 90-dBΩ 10-Gb/s optical receiver analog front-end in a 0.18-µm CMOS technology
Authors: Wei-Zen Chen, Da-Shin Lin
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

A 10-Gb/s 90-dBΩ optical receiver analog front-end (AFE), including a transimpedance amplifier (TIA), an automatic gain control circuit, and a postamplifier (PA), is fabricated using a 0.18-µm CMOS technology. In contrast with a conventional limiting amplifier architecture, the PA is consisted of a voltage amplifier followed by a slicer. By means of the TIA and the PA codesign, the receiver front-end provides a -3-dB bandwidth of 7.86 GHz and a gain bandwidth product (GBW) of 248.5 THz-Ω. The tiny photocurrent received by the AFE is amplified to a differential voltage swing of 900 mVpp when driving 50-Ω output loads. The measured input sensitivity of the optical receiver is -13 dBm at a bit-error rate of 10-12 with a 231-1 pseudorandom test pattern. The optical receiver AFE dissipates a total power of 199 mW from a 1.8-V supply, among which 35 mW is consumed by the output buffer. The chip size is 1300 µm × 1796 µm.
Adding a Human Perspective to Enterprise Architectures
Authors: Zacarias M., Caetano A., Magalhaes R., Pinto H.S., Tribolet J.
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Enterprise modeling, commonly supported by Enterprise Architecture frameworks, has proved to be an effective communication tool that facilitates the development of applications aligned with the business. These modeling frameworks are concerned with organization's design rather than its actual implementation. We argue that modeling the actual implementation of organizations can be a valuable communication tool not only for systems development but also for organizational analysts, managers and workers. However, this kind of usage requires the inclusion of a human perspective in current enterprise architectures. In this paper, we propose to extend the CEO enterprise architecture with a human view based on a conceptual model consistent with contemporary paradigms of organizational science. The proposal is illustrated with examples drawn from a case study.
Overhead Storage Considerations and a Multilinear Method for Data File Compression
Authors: T. Y. Young
Venue: IEEE Transactions on Software Engineering (1980)

The paper is concerned with the reduction of overhead storage, i.e., the stored compression/decompression (C/D) table, in field-level data file compression. A large C/D table can occupy a lage fraction of maim memory space during compression and decompression, and may cause excessve page swapping in virtual memory systems. A two-stage approach is studied, including the reuired additional C/D table decompression time. It appears that the approach has limitations and is not completely satisfactory.
Margin Trees for High-dimensional Classification
Authors: Robert Tibshirani, Trevor Hastie
Venue: The Journal of Machine Learning Research (2007)

We propose a method for the classification of more than two classes, from high-dimensional features. Our approach is to build a binary decision tree in a top-down manner, using the optimal margin classifier at each split. We implement an exact greedy algorithm for this task, and compare its performance to less greedy procedures based on clustering of the matrix of pairwise margins. We compare the performance of the "margin tree" to the closely related "all-pairs" (one versus one) support vector machine, and nearest centroids on a number of cancer microarray data sets. We also develop a simple method for feature selection. We find that the margin tree has accuracy that is competitive with other methods and offers additional interpretability in its putative grouping of the classes.
XMLTemplate: framework that minimizes the number of software components
Authors: Lukman Ab Rahim, Shakirah Mohd Taib, Ainol R. Shazi
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Extensible Markup Language (XML) is a technology that has been widely used in many areas. This paper proposes a framework that uses XML document to minimize the number of components used in a Web-based application. This decrease in component number is achieved by replacing subclasses with XML document that contains the user interface information which helps create the user interface. The proposed method is applied on a Lecturer's Publication Monitoring System (LPMS) project and a comparison between the framework and normal implementation is done based on this project.
Computation of minimal counterexamples by using black box techniques and symbolic methods
Authors: Tobias Nopper, Christoph Scholl, Bernd Becker
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Computing counterexamples is a crucial task for error diagnosis and debugging of sequential systems. If an implementation does not fulfill its specification, counterexamples are used to explain the error effect to the designer. In order to be understood by the designer, counterexamples should be simple, i.e. they should be as general as possible and assign values to a minimal number of input signals. Here we use the concept of Black Boxes --- parts of the design with unknown behavior --- to mask out components for counterexample computation. By doing so, the resulting counterexample will argue about a reduced number of components in the system to facilitate the task of understanding and correcting the error. We introduce the notion of 'uniform counterexamples' to provide an exact formalization of simplified counterexamples arguing only about components which were not masked out. Our computation of counterexamples is based on symbolic methods using AIGs (And-Inverter-Graphs). Experimental results using a VLIW processor as a case study clearly demonstrate our capability of providing simplified counterexamples.
Selection of the Order of Autoregressive Models for Host Load Prediction in Grid
Authors: Jiuyuan Huo, Liqun Liu, Li Liu, Yi Yang, Lian Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

For the heterogeneous and dynamic nature of Grid environments, the ability to accurately and timely predict future capabilities of resources is very important. Autoregressive models are appropriate and much less expensive for predicting host load, but Autoregressive modeling includes a model identification procedure, that is, it is necessary to choose the order that best describes the host load variety. In this paper four of suggested criteria to determine the optimal order of AR models have been evaluated: The Final Prediction Error (FPE), Akaike's Information Criterion (AIC), Minimum Description Length (MDL) and the Bayesian Information Criterion (BIC). We evaluated these criteria on four of long, fine grain load traces from a variety of real machines, and our experimental results demonstrate that BIC criteria has the best determination of the optimal order than others and the optimal orders of AR models should be different in heterogeneous machines for load prediction.
A Dynamic Quota-Based Peer Selection Strategy in BitTorrent
Authors: Kun Huang, Li'e Wang, Dafang Zhang, Yongwei Liu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

BitTorrent employs a static quota-based peer selection strategy to fixedly allocate upload quotas for the Tit-For-Tat (TFT) choke algorithm and Optimistic Unchoke (OU) algorithm, which would incur a paradox of supply and demand between upload peers and request peers, where many request peers stay in the starvation state while many upload quotas stay in the idleness state. We propose a dynamic quota-based peer selection strategy, where request peers are classified by the principle of investment return and according to dynamic changed numbers of different request peers an upload peer adaptively allocates upload quotas for the TFT and OU algorithms. Simulation experiment shows that our dynamic quota allocation scheme can eliminate the paradox of supply and demand, increase the resource utility ratio of upload peers, and decrease the file download time, at the cost of uploading more a few file blocks for each upload peer.
Picture Query Languages for Pictorial Data-Base Systems
Authors: N. S. Chang
Venue: Computer (1981)

Integrated pictorial data-base systems need pictorial query languages to enhance their effectiveness. The tabular structures of QPE, IQ, and others are easy to understand and access.
Optimal bus sequencing for escape routing in dense PCBs
Authors: Hui Kong, Tan Yan, Martin D. F. Wong, Muhammet Mustafa Ozdal
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

The PCB routing problem has become so difficult that no commercial CAD software can provide an automatic solution for high-end boards. Existing algorithms for escape routing, an important step in PCB routing, are net-centric. Directly applying these algorithms will result in mixing nets of different buses together. But in practice, it is preferred to bundle together nets in a bus. Thus the bus-centric escape routing problem can be naturally divided into two subproblems: (1) finding a subset of buses that can be routed on the same layer without net mixings and crossings, which we refer to as the bus sequencing problem, and (2) finding the escape routing solutions for each chosen bus, which can be solved by a net-centric escape router. In this paper, we solve the bus sequencing problem. We introduce a new optimization problem called the Longest Common Interval Sequence (LCIS) problem and model the bus sequencing problem as an LCIS problem. By using dynamic programming and balanced search tree data structure, we present an LCIS algorithm which can find an optimal solution in O(n log n) time. We also show that O(n log n) is a lower-bound for this problem and thus the time complexity of our algorithm is also the best possible.