ppxscal/embedding_network huggingface dataset:
HBA: Distributed Metadata Management for Large Cluster-Based Storage Systems
Authors: Yifeng Zhu, Hong Jiang, Jun Wang, Feng Xian
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

An efficient and distributed scheme for file mapping or file lookup is critical in decentralizing metadata management within a group of metadata servers. This paper presents a novel technique called HBA (Hierarchical Bloom filter Arrays) to map filenames to the metadata servers holding their metadata. Two levels of probabilistic arrays, namely, Bloom filter arrays, with different level of accuracies, are used on each metadata server. One array, with lower accuracy and representing the distribution of the entire metadata, trades accuracy for significantly reduced memory overhead, while the other array, with higher accuracy, caches partial distribution information and exploits the temporal locality of file access patterns. Both arrays are replicated to all metadata servers to support fast local lookups. We evaluate HBA through extensive trace-driven simulations and an implementation in Linux. Simulation results show our HBA design to be highly effective and efficient in improving performance and scalability of file systems in clusters with 1,000 to 10,000 nodes (or super-clusters) and with the amount of data in the Peta-byte scale or higher. Our implementation indicates that HBA can reduce metadata operation time of a single-metadata-server architecture by a factor of up to 43.9 when the system is configured with 16 metadata servers.
A Proactive Non-Cooperative Game-Theoretic Framework for Data Replication in Data Grids
Authors: Ali H. Elghirani, Riky Subrata, Albert Y. Zomaya
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Data grids and its cost effective nature has taken on a new level of interest in recent years; amalgamation of different providers results in increased capacity as well as lower energy costs. As a result, there are efforts worldwide to design more efficient data replication algorithms. Such replication algorithm for grids is further complicated by the fact that the different sites in a grid system are likely to have different ownerships with their own self interest and priorities. As such, any replication algorithm that simply aims to minimize total job delays are likely to fail in grids. Further, a grid differs from traditional high performance computing systems in the heterogeneity of the communication links that connect the different nodes together. In this paper, we propose a distributed, non-cooperative game theoretic approach to the data replication problem in grids. Our proposed replication scheme directly takes into account the self interest and priorities of the different providers in a grid, and maximizes the utility of each provider individually. Experiments were conducted to show the applicability of the proposed approaches. One advantage of our scheme is the relatively low overhead and robust performance against inaccuracies in performance prediction information.
ECIR 2008 Workshop on Efficiency Issues on Information Retrieval
Authors: Roi Blanco, Fabrizio Silvestri
Venue: ACM SIGIR Forum (2008)

The goal of EIIR 2008, the first Workshop on Efficiency Issues in Information Retrieval, was to shed light on efficiency-related issues of modern high-scale information retrieval (IR), e.g., Web, distributed technologies, peer to peer architectures and also new IR environments such as desktop search, enterprise/expert search, mobile devices, etc. In addition, the workshop aimed at fostering collaboration between different research groups in this area.
Towards the Development of XML Benchmark for XML Updates
Authors: Binh Viet Phan, Eric Pardede
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Many XML Benchmarks have been proposed to study strengths and weaknesses of any given XML database system. All existing benchmarks can be applied to evaluate data retrieval queries, but cannot be used to evaluate update performance of XML database systems. Therefore, this paper will propose criteria to evaluate the abilities to update XML documents of XML database systems. These criteria will be realized by a data set and corresponding queries that are applied to benchmark XML updates. Finally, the competence of the proposal will be examined by using a case study.
On the Detectability of Scan Chain Internal Faults An Industrial Case Study
Authors: Fan Yang, Sreejit Chakravarty, Narendra Devta-Prasanna, Sudhakar M. Reddy, Irith Pomeranz
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

Scan chains contain approximately 50% of the logic transistors in large industrial designs. Yet, faults in the scan cells are not directly targeted by scan tests and assumed detected by flush tests. Reported results of targeting the scan cell internal faults using checking sequences show such tests to be about 4.5 times longer than scan stuck-at test sets and require a sequential test generator, even for full scan circuits. We present the first step in developing an alternative test methodology for scan cell internal faults. Fault detection capability of existing tests (flush tests, stuck-at tests and transition delay fault tests) are quantified. Existing tests are shown to have similar coverage as checking sequences. A new flush test, viz. half-speed flush test, is defined. This new test is shown to add 2.3% and 8.8% to the stuck-at and stuck-on fault coverage, respectively.
Efficient Indexing and Storage Algorithm for Visual Databases
Authors: Mark Smith, Alireza Khotanzad
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

A novel approach pertaining to the fast and efficient retrieval and storage of video sequences utilizing MPEG-1/2 motion vectors is presented in this paper. A clip first must be segmented into consistent video segments based on the basic editing effects –cuts, dissolves, and wipes. All Group of Pictures (GOPs) are then extracted from the clip and decomposed further into I-Frames and P-Frames (B Frames are disregarded). The initial frame of the sequence is manually segmented into objects, and the selected objects are automatically tracked through the entire sequence using MPEG-1/2 motion vectors. Features pertaining to the edge histogram are extracted from each tracked object (I/P Frames only) and then maintained with the associated frame. An example image or video clip is then presented to the system and the 5 best matching images are retrieved. Results are shown for the standard video sequences such as Foreman, Tennis, etc.
Towards autonomous SLA management using a proxy-like approach
Authors: Bastian Koller, Lutz Schubert
Venue: Multiagent and Grid Systems (2007)

This document presents an architecture for autonomous quality of service (QoS) management using a proxy-like approach. Service Level Agreements, as presented here, can be exploited to define certain QoS parameters that a service is to maintain during its interaction with a specific customer. As such, they provide a means of defining electronic contracts. Within this paper, a way is presented to autonomously manage such forms of contracts. Since this requires an accordingly designed framework, the relevant objectives that have to be respected in this context have been analysed. Most of these requirements are explicitly put forward by service providers, respectively customers and cover issues that such a framework ideally should support. On this basis, an architecture for a management system has been developed. The main innovation of this framework consists in the introduction of a third-party "proxy" that allows for easy, "plug'n'play" management of SLAs. Using the architecture, an implementation guideline has been sketched that will provide some insight into how such a system may be set up and reused. The proxy-like approach presented here has been critically analysed and possible improvements for further development and research in this area have been identified.
From testing to anti-product development
Authors: Markus Warken
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2008)

The requirements for testing in large software projects drastically changed in recent years. The reasons for this mainly come from evolving development processes, demanding early stabilisations of complete software loads, early handover to subsequent steps, high software release quality, and in particular flexible adaptations to changing roadmaps. This study is an experience report from industrial testing in the field of telecommunications software and based on a speech given by the author at the Testing and Test Control Notation version 3 (TTCN-3) User Conference in Berlin 2006. It advocates to consider modern testing rather as the development of an anti-product that is to be developed in parallel to the product. This anti-product is itself a complex software system. Following this approach has a significant impact on the testing in these large software projects mentioned and leads to a number of consequences for the development of test systems and the structure of test teams. In this study, the role and virtues of TTCN-3 as programming language for anti-products as well as for defining the test system structure are investigated. Dealing with large embedded software systems that have several concurrent parts and additionally obey soft real-time requirements, similar constraints also hold for the test system. The virtues of parallel testing/software development life cycles as it becomes mandatory in following modern development processes are presented, and it is shown how TTCN-3 turned out in our experience to be a language particularly well suited for this purpose because of its advanced structured programming concepts derived from strong typing, template concepts and parametrizations of templates.
Newton's method for fractional combinatorial optimization
Authors: T. Radzik
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors considers Newton's method for the linear fractional combinatorial optimization. He proves a strongly polynomial bound on the number of iterations for the general case. He considers the maximum mean-weight cut problem, which is a special case of the linear fractional combinatorial optimization. This problem is closely related to the parametric flow problem and the flow problem when the maximum arc cost is being minimised. He proves that Newton's method runs in O(m) iterations for the maximum mean-weight cut problem. One iteration is dominated by the maximum flow computation. This gives the best known strongly polynomial bound of O(m/sup 2/n) for all three problems mentioned.
Blind Counter Automata on &omega;-Words
Authors: Henning Fernau, Ralf Stiebe
Venue: Fundamenta Informaticae (2008)

This paper generalizes the concept of blind multicounter languages to infinite words. We introduce two different acceptance modes of blind multicounter machines on &omega;-words, called synchrononous and asynchronous acceptance. These acceptance modes are compared with each other and with families of &omega;-languages of the form L = &cup;$_{1&les;i&les;k}$U$_i$V$^&omega;_i$, where U$_i$, V$_i$ are finitary blind multicounter languages.
Minimum resource zero knowledge proofs
Authors: J. Kilian, S. Micali
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

Several resources relating to zero-knowledge protocols are considered. They are the number of envelopes used in the protocol, the number of oblivious transfer protocols executed during the protocol, and the total amount of communication required by the protocol. It is shown that after a preprocessing stage consisting of O(k) executions of oblivious transfer, any polynomial number of NP-theorems of any polysize can be proved noninteractively and in zero knowledge, on the basis of the existence of any one-way function, so that the probability of accepting a false theorem is less than 1/2/sup k/.
Interval Based X-Masking for Scan Compression Architectures
Authors: Anshuman Chandra, Rohit Kapur
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Test stimulus and response compaction (Scan Compression) in scan is increasingly becoming an integral part of today’s design-for-test (DFT) methodology for achieving high quality test at lower costs. Current generation integrated circuit’s (ICs) are very complex designs that produce a large number of unknown values (Xs) during response capture in scan testing. Response compaction techniques have been shown to be very effective in dealing with any distribution of the Xs while not compromising on the test coverage. However, as the number of scan in pins reduce, the X-tolerance capability of these techniques degrades rapidly. In this paper we discuss interval based response compaction scheme for scan compression architectures. We present an analysis to show that very high X-tolerance can be achieved with a small number of scan-in pins and with no loss of test coverage. We also show that this eventually translates into higher compression ratio and lower test data volume.
CBERS-02 Remote Sensing Data Mining Using Decision Tree Algorithm
Authors: Xingping Wen, Guangdao Hu, Xiaofeng Yang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

In recent years, decision tree algorithms have been successfully used for land cover classification from remote sensing data. In this paper, CART (classification and regression trees) and C5.0 decision tree algorithms were used to CBERS-02 remote sensing data. Firstly, the remote sensing data was transformed using the Principal Component Analysis (PCA) and multiple-band algorithm. Then, the training data was collected from the combining total 20 processed bands. Finally, the decision tree was constructed by CART and C5.0 algorithm respectively. Comparing two results, the most important variables are clearly band3,4, band1,4 and band2,4. The depth of the CART tree is only two with the relative high accuracy. The classification outcome was calculated by CART tree. In order to validate the classification accuracy of CART tree, the Confusion Matrices was generated by the ground truth data collected using visual interpretation and the field survey and the kappa coefficient is 0.95.
Brief paper: On the Lyapunov-based adaptive control redesign for a class of nonlinear sampled-data systems
Authors: Romain Postoyan, Tarek Ahmed-Ali, Laurent Burlion, Françoise Lamnabhi-Lagarrigue
Venue: Automatica (Journal of IFAC) (2008)

Stabilization of the exact discrete-time models of a class of nonlinear sampled-data systems, with an unknown parameter, is addressed. Given a Lyapunov-based continuous-time adaptive controller that ensures some stability properties for the closed-loop system, a sufficient condition for the design of high order discrete-time controllers is given. The stability analysis is carried out considering the truncated Fliess series of the Lyapunov difference equation. Due to the appearance of power terms of the unknown parameter, the problem is reparameterized in a convex-like form and an estimation law for the new unknown parameter is derived with no need of overparametrization or projection techniques. Then, assuming appropriate conditions hold, high order controllers can be designed. The boundedness of the extended state vector is ensured under some conditions, for a sufficiently small sampling period. It is shown how increasing the controller order can improve system performance.
Optimal shakedown design of bar systems: Strength, stiffness and stability constraints
Authors: J. Atkočinas, D. Merkevičit, A. Venskus
Venue: Computers and Structures (2008)

Using the concept of a variable repeated load and shakedown theory, a unified technique is proposed for formulating mathematical models for the optimization of frame- and truss-like structures under different loads. Strength, stiffness and stability (for trusses only) constraints are included in non-linear mathematical models of structure volume minimization and load optimization problems. Even though the load is prescribed within certain limits, the mathematical models allow the variational bounds of the displacement (the stiffness of the structure depends on them) to be evaluated in the deformed state. Numerical example concerning calculation of frame structure is presented. The results are valid for small displacements.
How crystals that sense and respond to their environments could evolve
Authors: Rebecca Schulman, Erik Winfree
Venue: Natural Computing: an international journal (2008)

An enduring mystery in biology is how a physical entity simple enough to have arisen spontaneously could have evolved into the complex life seen on Earth today. Cairns-Smith has proposed that life might have originated in clays which stored genomes consisting of an arrangement of crystal monomers that was replicated during growth. While a clay genome is simple enough to have conceivably arisen spontaneously, it is not obvious how it might have produced more complex forms as a result of evolution. Here, we examine this possibility in the tile assembly model, a generalized model of crystal growth that has been used to study the self-assembly of DNA tiles. We describe hypothetical crystals for which evolution of complex crystal sequences is driven by the scarceness of resources required for growth. We show how, under certain circumstances, crystal growth that performs computation can predict which resources are abundant. In such cases, crystals executing programs that make these predictions most accurately will grow fastest. Since crystals can perform universal computation, the complexity of computation that can be used to optimize growth is unbounded. To the extent that lessons derived from the tile assembly model might be applicable to mineral crystals, our results suggest that resource scarcity could conceivably have provided the evolutionary pressures necessary to produce complex clay genomes that sense and respond to changes in their environment.
A multi-modal method based on the competitors of FVC2004 and on palm data combined with tokenised random numbers
Authors: Loris Nanni, Alessandra Lumini
Venue: Pattern Recognition Letters (2008)

In this work, we propose a multi-modal method that combines the scores of selected fingerprint matchers with the score obtained by a palm authenticator where the palm features are combined with pseudo-random numbers. We use a random subspace of AdaBoost.M1 to combine the scores of the best fingerprint matchers automatically selected among the competitors of FVC2004, and we study the performance when a different number of competitors are involved in the fusion. Moreover a deep study is carried out to design a hybrid system based on the combination of palm image features and a personal key. In conclusion, the aim of this work is to design a multi-modal biometric system and to analyze the benefits and the limits of fusion approaches in order to boost the performance of hybrid system in the worst testing hypothesis when an ''impostor'' steal the personal key of the user A before he tries to authenticate as A. The experimental results reported in this paper confirm that using a multi-modal ensemble of matchers it is possible to overcome some of the limitations of each single matcher leading to a considerable performance improvement.
Design and improvement a high speed and low power 8/9 frequency divider with TSPC dynamic logic
Authors: Ali Rahnemaei, Farnood Khoshnevis, Alireza Mohammadnia, Adel Akbarimajd
Venue: Proceedings of the 9th International Conference on Circuits (2005)

A low power and high speed 8/9 CMOS programmable dynamic frequency divider has been designed. It contains a control bit by which can obtain 1/9 and 1/8 input frequency in output. In spite of the variations in size and structure of circuit, the 53% improvement in power dissipation has been achieved. Power dissipation about 1.6 mw in a 2.78 GHz Frequency Rate, 2.5 volt power supply circuit is verified by HSPISE simulation.
Integrated use of SRM, Landsat ETM+ data and 3D perspective views to identify the tectonic geomorphology of Dehradun valley, India
Authors: A. K. Singh, B. Parkash, P. R. Choudhury
Venue: International Journal of Remote Sensing (2007)

The present study aims to develop an integrated shaded relief model (SRM), remote sensing image and three-dimensional (3D) perspective view based approach for delineating tectonic geomorphology of the Dehradun Intermontane valley, India. SRM created from digital elevation model (DEM) actually represents the information of the bare ground surface without any surface cover such as vegetation and landuse. Under user-specified positions of the sun, this was useful in enhancing the lineaments. This, coupled with Landsat ETM+ data and 3D perspective views has proven to be a very good tool for the identification of geological features. In a hilly terrain, like the present area, having dense forest cover, many places are inaccessible and geological field mapping is quite difficult. This approach successfully identified tectonic geomorphological features like faults, alluvial fans and terraces in the present area. Comparison of the identified faults and geomorphic features with published work and field checks reveals that this method of mapping can reduce the time and effort required in fieldwork to a large extent.
An architecture to easily produce adventure and movie games for the mobile scenario
Authors: Marco Furini
Venue: Computers in Entertainment (CIE) (2008)

Simple and easy-to-play casual games are flooding the mobile gaming market and are best-sellers on the mobile game charts of several cellphone network operators. Most of the titles are mobile versions of videogames developed in the '80s and '90s, which were also very simple and easy-to-play. In this article we focus on adventure and movie games, a genre simple, easy-to-play, and very popular in the past. We propose a software architecture to easily produce full-motion adventure games for the mobile scenario, and thus potentially transform any modern cellphone into an adventure game console. The games are portable and protected against un-authorized usage. The feasibility of our approach is shown through a prototype player and an evaluation that shows the suitability of the proposed approach for the mobile scenario. The simplicity of our approach along with the ubiquity of modern cell-phones may bring new life to adventure games, which can also become an exciting genre for the current mobile gaming scenario.
An approach to estimating work effort for enterprise systems software projects
Authors: J. Choi, S. Ashokkumar, S. Sircar
Venue: Enterprise Information Systems (2007)

A major factor in the decision to develop enterprise software applications is the size of the project, which determines the amount of work necessary, which in turn will give decision makers some idea about the time required and the estimated cost. Two of the major approaches for such estimation-the Use Case Points (UCP) and COSMIC-FFP methods-are compared in this paper. The accuracy and reliability of each method are evaluated through the measurement of 50 use case studies. These were collected from the Customer Relationship Management systems development project of a major enterprise service institution. The results show that the UCP method is more accurate and reliable than the COSMIC-FFP in determining work effort.