ppxscal/embedding_network huggingface dataset:
Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks
Authors: Hagit Attiya, Alex Kogan, Jennifer L. Welch
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

This paper presents two algorithms for the local mutual exclusion problem, an extension of the dining philosophers problem for mobile ad hoc networks. A solution to this problem allows nodes that are currently geographically close to obtain exclusive access to a resource. The algorithms exhibit different tradeoffs between response time and failure locality (the size of the neighborhood adversely affected by a node crash). The first algorithm has two variations, one of which has response time that depends very weakly on the number of nodes in the entire system and is polynomial in the maximum number of neighboring nodes; the failure locality, although not optimal, is small and grows very slowly with system size. The second algorithm has optimal failure locality and response time that is quadratic in the number of nodes. A pleasing aspect of this algorithm is that, when run in a system with no node movement, it has linear response time, improving on previous results for static algorithms with optimal failure locality.
DEM in 3D Simulation of Influencing Factors of Deformation Properties and p-y Curves of a Laterally Loaded Pile
Authors: Xiao Zhao-Ran, Wang Junlin
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Based on structural similarity principles, a scale model of a laterally loaded pile was established to numerically simulate and study the problem of lateral soil-pile interaction by distinct element method in 3 dimensions. Level displacements of the pile and soil resistance around the pile related to the factors of the pile's diameter, the pile's rigidities and soil properties. According to the above distinction classification method, the factors of the pile's diameter, the pile's material rigidities and internal frictional coefficient of soil around the pile were analyzed in detail to find different quantity influences on the mechanics characters of horizontal displacements of the pile and the p-y curve.
Improvements to the Tableau Prover PITP
Authors: Alessandro Avellone, Guido Fiorino, Ugo Moscato
Venue: Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods (2007)

In this paper we discuss the new version of PITP, a procedure to decide propositional intuitionistic logic, which turns out at the moment to be the best propositional prover on ILTP. The changes in the strategy and implementation make the new version of PITP faster and capable of deciding more formulas than the previous one. We give a short account both of the old optimizations and the changes in the strategy with respect to the previous version. We use ILTP library and random generated formulas to compare the implementation described in this paper to the other provers (including our old version of PITP).
Foundations of 3D Graphics Programming: Using JOGL and Java3D, 2nd edition
Authors: Jim X. Chen, Chunyang Chen
Venue:  (2008)

"A good, concise computer graphics textbook covering 3D concepts, essential fundamentals theory, and easy-to-follow OpenGL practical programming in Java." Dr. Jack Bresenham, Retired IBM Senior Technical Staff Member Increasingly in the realms of science and industry, computer graphics is an area of critical importance and utility. And within the graphics community, the demand for producing exceptional 3D graphics in particular is almost a given. This thoroughly updated and enhanced second edition of Foundations of 3D Graphics Programming is an innovative shortcut to graphics theory and programming using JOGL, a new vehicle of 3D graphics programming in Java. This revised edition of the successful, reader-friendly text covers all graphics basics and several advanced topics, as well as some basic concepts in Java programming for those who currently are C/C++ programmers. Specifically, it provides all the core aspects of OpenGL programming in Java using JOGL, along with concisely presented computer graphics theories. In addition, it uses a top-down approach to lead the reader into programming and applications up-front. The content about theory provides a high-level understanding of all basic graphics, and of using JOGL instead of implementing a graphics system. Explanations are integrated with the sample programs, which are specifically designed for learning and accompanying this book. Topics and Features: Presents 2 new chapters covering vertex shading, pixel shading and parallel processing, and Cg programming [NEW] Introduces a shortcut to 3D graphics theory, and serves as a concise guide to both theory and programming Contains additional new material, such as a look at advanced effects in Cg programming [NEW] Covers JOGL, a new vehicle of 3D graphics programming in Java, with extensive and complete examples Incorporates numerous practical examples and exercises Provides a new appendix for Basic Mathematics for 3D Graphics [NEW] Introduces and describes Java3D, a shortcut to high-level 3D graphics APIs in Java, with detailed example programs Provides readers with comprehensive samples in JOGL and Java3D Offers a supplementary website with updates, sample programs, figures, and useful weblinks and instructions for setting up the OpenGL programming environment Written by a leader in 3D graphics, virtual experience, and statistical data visualization, this text/reference is a comprehensive, yet concise volume intended for scientists and engineers who understand Java programming. Moreover, it is a good reference for C/C++ graphics programmers interested in learning Java and JOGL. Accessible for an interdisciplinary readership, this book requires only basic knowledge of vector analysis and programming, and as such is highly suitable for classroom use. Key Topics Geometric Transformation Lighting and Shading Blending and Texture Mapping Curved Models Programming in Java 3D Animation and Simulation Vertex Shading and Parallel Processing Cg Programming
Joint Compression and Classification for Textures in the Wavelet and Ridgelet Domain
Authors: M. S. Joshi, R. R. Manthalkar, Y. V. Joshi
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Image Compression is a widely addressed research area. Many compression standards are in place. There are many methods for image classification. But the joint compression and classification is a new research area wherein the classification is attempted in the compressed domain. The joint compression and classification (JCC) is explored in wavelet domain by some researchers. But it is not yet explored in Ridgelet domain. This paper discusses the performance of JCC for Wavelet and Ridgelet domain for Texture images. The experimentation is done with objective analysis and subjective analysis. Objective analysis is performed using the Compression metrics-RMSE, PSNR and classification metric- CCR. Subjective analysis is performed using Human Visual Perception. It is found that the Ridgelet Transform gives less Mean Squared Error (MSE) and is better for Joint Compression and Classification of Texture images. Extensive experimentation has been carried out to arrive at the conclusion.
Face Recognition Based on Wavelet Transform Weighted Modular PCA
Authors: Minghua Zhao, Peng Li, Zhifang Liu
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

A new algorithm named wavelet transform weighted modular PCA is proposed for face recognition. Firstly, the training images and the testing image are preprocessed with wavelet transform and the LL band and the LH/HL average band are divided into sub-images with the same size. Secondly, the prospective classify contribution of each sub-model of the two bands are computed. Thirdly, each sub-image of the two bands of the testing image is projected to its corresponding subspace and the confidence values with each image are obtained. Finally, the two confidence values with each image are added with a weight and the total confidence value is obtained to classify the testing image. Experimental results show that the recognition rate of the proposed algorithm is about 4%-6% superior to traditional methods.
A User Behavior Based Trust Model for Mobile Applications
Authors: Zheng Yan, Valtteri Niemi, Yan Dong, Guoliang Yu
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

A mobile application is a software package that can be installed and executed in a mobile device. Which mobile application is more trustworthy for a user to purchase or install becomes a crucial issue that impacts its final success. This paper proposes a trust model based on users' behaviors, which assists the evaluation and management of the mobile application's trust with user friendliness. We achieve our model through exploratory factor analysis, reliability analysis and correlation analysis based on the data collected from a questionnaire survey. It is indicated that a user's trust behavior is a multidimensional construct composed of four aspects: usage behavior, reflection behavior, correlation behavior and management behavior. Particularly, the practical significance of our work towards usable trust management, the limitations of current empirical study and future work are also discussed.
d-IRA: A Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata
Authors: Sumit Kumar Jha
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

This paper presents the design of a novel distributed algorithm d-IRA for the reachability analysis of linear hybrid automata. Recent work on iterative relaxation abstraction (IRA) is leveraged to distribute the reachability problem among multiple computational nodes in a non-redundant manner by performing careful infeasibility analysis of linear programs corresponding to spurious counterexamples. The d-IRA algorithm is resistant to failure of multiple computational nodes. The experimental results provide promising evidence for the possible successful application of this technique.
Drawing Preconditions of Operation Contracts from Conceptual Schemas
Authors: Dolors Costal, Cristina Gómez, Anna Queralt, Ernest Teniente
Venue: Proceedings of the 20th international conference on Advanced Information Systems Engineering (2008)

Conceptual schemas include the definition of integrity constraints which must be satisfied in each state of the Information Base. Integrity constraints have a considerable impact on the specification of operations since operations should preserve the Information Base consistency. In this paper, we present an approach that automatically generates the preconditions that basic operations must include to ensure that a set of predefined integrity constraints is satisfied after their execution. Our approach is independent of the conceptual modelling language used. We also describe a prototype tool that implements our proposal for UML conceptual schemas.
Learning How to Play Hex
Authors: Kenneth Kahl, Stefan Edelkamp, Lars Hildebrand
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

In Hex two players try to connect opposing sides by placing pieces onto a rhombus-shaped board of hexagons. The game has a high strategic complexity and the number of possible board positions is larger than in Chess. There are already some Hex programs of recognizable strength, but which still play on a level below very strong human players. One of their major weaknesses is the time for evaluating a board.In this work we apply machine learning for the computer player to improve his play by generating an fast evaluation function and lookup procedure for pattern endgame databases. The data structures used are neural networks for the evaluation of a position and limited branching trees to determine if a position can be classified as won or lost.
Study of the Evolution of an Agile Project Featuring a Web Application Using Software Metrics
Authors: Giulio Concas, Marco Francesco, Michele Marchesi, Roberta Quaresima, Sandro Pinna
Venue: Proceedings of the 9th international conference on Product-Focused Software Process Improvement (2008)

We present an agile process used for the development of a Web application written in Java, devised by choosing a set of proven agile practices taken by existing popular agile methodologies. During the project, we regularly measured the software using Chidamber and Kemerer object-oriented metrics suite, and other metrics. The application development evolved through phases, characterized by a different level of adoption of some key agile practices --- such as pair programming, test-based development and refactoring. The evolution of the OO metrics of the system, and their behavior related to the agile practices adoption level is presented and discussed, showing that soft ware quality, as measured using standard OO metrics, looks directly related to agile practices adoption.
Application of Agent-Based System for Bioprocess Description and Process Improvement
Authors: Ying Gao, Katie Kipling, Jarka Glassey, Mark Willis, Gary Montague, Yuhong Zhou, Nigel Titchener-Hooker
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

An agent-based system framework is developed to provide a flexible environment for analysing bioprocesses based on a whole process understanding. In this system, agent components cooperate with each other in performing their tasks. These include the description of the whole process behaviour, evaluating process operating conditions, monitoring of the operating processes, predicting critical process performance, and providing decision support when coping with process deviations. In all cases the function of the system is to ensure an efficient manufacturing process and to maintain the product quality. The implementation of the agent-based approach is illustrated via a process monitoring scenario.
Automatic Classification and Transcription of Telephone Speech in Radio Broadcast Data
Authors: Alberto Abad, Hugo Meinedo, João Neto
Venue: Proceedings of the 8th international conference on Computational Processing of the Portuguese Language (2008)

Automatic transcription of telephone speech involves additional challenges compared to wideband data processing, mainly due to channel limitations and to particular characteristics of conversational telephone speech. While in TV speech recognition applications, such as automatic transcription of broadcast news, the presence of telephone data is nearly insignificant (less than 1 %), in most radio broadcast stations the presence of telephone speech grows significantly. Thus, transcription of telephone speech data deserves special attention in radio broadcast applications. In this work, we describe our initial efforts to tackle this particular problem. First, a telephone channel classifier is proposed to automatically detect telephone segments. Then, some strategies for increasing robustness of the automatic transcription system are investigated.
Availability and Fairness Support for Storage QoS Guarantee
Authors: Peng Gang, Tzi-cker Chiueh
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Multi-dimensional storage virtualization (MDSV) technology allows multiple virtual disks, each with a distinct combination of capacity, latency and bandwidth requirements, to be multiplexed on a physical disk storage system with performance isolation. This paper presents novel design and implementation techniques that solve the availability guarantee and fairness assurance problems in multi-dimensional storage virtualization. First, we show that a measurement-based admission control algorithm can reduce the effective resource requirement of a virtual disk with availability guarantee by accurately estimating its resource needs without prior knowledge of its input workload characteristics. Moreover, to accurately factor disk access overhead into real-time disk request scheduling algorithm, we propose a virtual disk switching overhead extraction and distribution algorithm that can derive the intrinsic disk access overhead associated with each virtual disk so as to achieve perfect performance isolation. Finally, we develop an adaptive server time leap-forward algorithm to effectively address the short-term unfairness problem of virtual clock-based disk scheduler, the only known proportional-share scheduler that is based on wall-clock time and thus enables disk utilization efficiency optimization while delivering disk QoS guarantees.
A Comparative Visualization System for the Proximity of Genes on Whole Genome Scale
Authors: Chi-Young Cho, DoHoon Lee, Hwan-Gue Cho
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Recently, increasing numbers of sense-antisense transcripts and overlapping genes have been identified in a variety of eukaryotic organisms using large-scale genome analysis. Many overlapping genes and sense-antisense transcripts have been indented in the genomes of eukaryotic, some of which have been reported to have functional roles, but their evolutionary rigin is not clearly understood. We systematically analyzed all overlapping genes and senseantisense transcripts in the eukaryotic genomes. In particular, careful comparisons were made for the othologous genes that are overlapped and sense-antisense transcripts in the various species. So we developed a evolutionary visualization tool EVOG (Evolution Visualizer for Overlapped Genes) to visualize and analyze overlapped regions from the UCSC annotation data. This tool is simple and easy to control parameters for finding overlapped genes and sense-antisense transcripts in whole genomes. In experiment we tested our system to reveal the evolutionary relation on a few related gene family. EvoG has successfully illustrated these relationship. EvoG was implemented for the component-ware design principle, which enables other people to adopt some functions easily to develop their own gene-related visualization system.
Efficient Query Processing for Tracing RFID Tags by Reordering Location Identifiers
Authors: Sungwoo Ahn, Bonghee Hong
Venue: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2008)

This paper addresses the problem of using the Location IDentifier (LID) as the domain value of the index for trajectories of RFID tags and proposes the solution for solving this problem. The query performance for tracing tags depends upon the distribution of tag trajectories in the data space. We investigate a more efficient representation of tag trajectories by means of ordering the set of values in a 3-dimensional domain. Our analysis shows that the order of LIDs makes a greater contribution to the efficiency of query processing, compared with other domain values. However, there is no rule of assigning an LID to the RFID location in order to process queries efficiently. To solve this problem, we propose a new LID proximity function to rearrange an arbitrary order of LIDs. This function enables logically adjacent tag trajectories, which are accessed simultaneously, to be stored in close proximity on the disk. To determine the optimal sequence of LIDs in the domain, we also propose a reordering scheme of LIDs. Our experiments show that the proposed reordering scheme improves the performance of queries, compared with the previous method of assigning LIDs.
A note on the query complexity of the Condorcet winner problem
Authors: Ariel D. Procaccia
Venue: Information Processing Letters (2008)

Given an unknown tournament over {1,...,n}, we show that the query complexity of the question ''Is there a vertex with outdegree n-1?'' (known as a Condorcet winner in social choice theory) is exactly 2n-@?log(n)@?-2. This stands in stark contrast to the evasiveness of this property in general digraphs.
Pure Pointer Programs with Iteration
Authors: Martin Hofmann, Ulrich Schöpp
Venue: Proceedings of the 22nd international workshop on Computer Science Logic (2008)

Many logspace algorithms are naturally described as programs that operate on a structured input (e.g. a graph), that store in memory only a constant number of pointers (e.g. to graph nodes) and that do not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation.In this paper we introduce a formal class purple of pure pointer programs and study them on locally ordered graphs. Existing classes of pointer algorithms, such as Jumping Automata on Graphs (jags) or Deterministic Transitive Closure (dtc) logic, often exclude simple programs. purple subsumes these classes and allows for a natural representation of many graph algorithms that access the input graph by a constant number of pure pointers. It does so by providing a primitive for iterating an algorithm over all nodes of the input graph in an unspecified order.Since pointers are given as an abstract data type rather than as binary digits we expect that logarithmic-size worktapes cannot be encoded using pointers as is done, e.g. in totally-ordered dtc logic. We show that this is indeed the case by proving that the property "the number of nodes is a power of two," which is in logspace, is not representable in purple.
Locally Adaptive Statistical Procedures for the Integrative Analysis on Genomic and Transcriptional Data
Authors: Mattia Zampieri, Ingrid Cifola, Dario Basso, Roberta Spinelli, Luca Beltrame, Clelia Peano, Cristina Battaglia, Silvio Bicciato
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

The systematic integration of expression profiles and other types of gene information, such as copy number, chromosomal localization, and sequence characteristics, still represents a challenge in the genomic arena. In particular, the integrative analysis of genomic and transcriptional data in context of the physical location of genes in a genome appears promising in detecting chromosomal regions with structural and transcriptional imbalances often characterizing cancer.A computational framework based on locally adaptive statistical procedures (Global Smoothing Copy Number, GLSCN, and Locally Adaptive Statistical Procedure, LAP), which incorporate genomic and transcriptional data with structural information for the identification of imbalanced chromosomal regions, is described. Both GLSCN and LAP accounts for variations in the distance between genes and in gene density by smoothing standard statistics on gene position before testing the significance of copy number and gene expression signals. The application of GLSCN and LAP to the integrative analysis of a human metastatic clear cell renal carcinoma cell line (Caki-1) allowed identifying chromosomal regions that are directly involved in known chromosomal aberrations characteristic of tumors.