ppxscal/embedding_network huggingface dataset:
Ambient occlusion fields
Authors: Janne Kontkanen, Samuli Laine
Venue: Proceedings of the 2005 symposium on Interactive 3D graphics and games (2005)

We present a novel real-time technique for computing inter-object ambient occlusion. For each occluding object, we precompute a field in the surrounding space that encodes an approximation of the occlusion caused by the object. This volumetric information is then used at run-time in a fragment program for quickly determining the shadow cast on the receiving objects. According to our results, both the computational and storage requirements are low enough for the technique to be directly applicable to computer games running on the current graphics hardware.
An algorithm for localizing branch points of pulmonary vessels for nonrigid registration of the lungs
Authors: Hidenori Shikata, Zhiming Yin, Yongsup Park, Hiroko Kitaoka, Yoshinobu Sato, Takeshi Johkou, Hironobu Nakamura, Shinichi Tamura
Venue: Systems and Computers in Japan (2004)

Analyzing three-dimensional image data based on time series plays an important role in analyzing the functions of human organs that function with periodic changes in their shapes. Our final goal is to analyze the breathing movement of the lungs by nonrigid registration of the volume data between different time phases with vascular branch points spanning the lungs as characteristic points and obtaining positional vectors of each point. This paper presents a method for accurately detecting the locations of the branch points using graph representations of the blood vessels as an essential technique for such analyses. The method proposed obtains graph representations of an object using a method previously published, obtains approximately a product set region by taking each branch as a cylinder by local distance transforms in the neighborhood of a branching point obtained from the graph representations, and takes the centroid of this region as the branching point. The accuracy and reproducibility of determination of the position of a branch point are very important for nonrigid registration using the branch points. The authors have shown the efficacy of the proposed method by constructing a model simulating a blood vessel system by combining the cylinders, evaluating the accuracy using the differences from the axial intersection points of the cylinders constituting the branch as a measure. The authors have confirmed experimentally that the proposed method detects a branch point at a branch point position defined without being significantly influenced by conditions of rotations etc. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(3): 24&ndash;36, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10478
Specification and formal verification of security requirements
Authors: Isaac Agudo, Javier Lopez
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

With the grown of internet and distributed applications, security requirements are going inherent to the software development process. Each time one communicates with some other one there are relevant security risk that must be taken in account. This is what is happening in the new soft-ware applications using client/server architecture. We propose including security requirements at the top level of development process, together with functional requirements because they are much related. With this information we are able to extract all communication protocols that are involved in our application and their associated security goals. This is the input to a verification phase in which we look for security flaws. The last step, and the more useful (and the not yet finished) is to use this information to modify our initial specification at the top level of the development process
VPDS: Virtual Home Region Based Distributed Position Service in Mobile Ad Hoc Networks
Authors: Xiaoxin Wu
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Position-based ad hoc routing algorithms have proved to have decent performance in delivery ratio andend-to-end delay. Position service is essential for such algorithms. In this paper, a distributed position service system, named VDPS, is proposed and evaluated. In the system, each node has a virtual home region (VHR), which is a geographic area. Nodes residing in a nodeýs VHR will act as its position servers. A node updates its position to the servers, through which other nodes can obtain its position. To reduce the overhead on position management and simplify the operation, in VDPS, a VHR is divided into subregions. A region-based broadcast is used for position update, and a sequential searching is used for position retrieving. Different mechanisms for improving system robustness have been proposed. Mathematical models are built for analyzing system robustness and control overhead. Illustrated results show that VDPS can maintain a high system robustness at a relatively low control overhead.
Computing Molecular Potential Energy Surface with DIET
Authors: Emmanuel Jeannot, Gerald Monard
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

New developments in the field of theoretical chemistry require the computation of numerousMolecular Potential Energy Surfaces (PESs) to generate adequate quantum force field parameters. Because workstations alone cannot ful-fill the requirements of these modern chemical advances, we present in this paper how we have tackled this problem using several up-to-date computer science technology such as grid-computingmiddleware, molecular databases, script interfacing, etc. An example on the optimization of semiempirical parameters for water shows the potential power of our approach and the benefit theoretical chemistry can gain with it.
Improved Face and Hand Tracking for Sign Language Recognition
Authors: N. Soontranon, S. Aramvith, T. H. Chalidabhongse
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

In this paper, we develop face and hand tracking for sign language recognition system. The system is divided into two stages; the initial and tracking stages. In initial stage, we use the skin feature to localize face and hands of signer. The ellipse model on CbCr space is constructed and used to detect skin color. After the skin regions have been segmented, face and hand blobs are defined by using size and facial feature with the assumption that the movement of face is less than that of hands in this signing scenario. In tracking stage, the motion estimation is applied only hand blobs, in which first and second derivative are used to compute the position of prediction of hands. We observed that there are errors in the value of tracking position between two consecutive frames in which velocity has changed abruptly. To improve the tracking performance, our proposed algorithm compensates the error of tracking position by using adaptive search area to re-compute the hand blobs. Simulation results indicate our proposed algorithm can track face and hand with greater precision with negligible computational complexity increase.
Design and Implementation of an Extensible and Modifiable Refactoring Tool
Authors: Katsuhisa Maruyama, Shinichiro Yamamoto
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

Refactoring is an essential and useful practice in developing and maintaining object-oriented software since it improves the design of existing code without changing its external behavior. Therefore, several refactoring tools tend to be integrated into contemporary IDEs. However, these tools represent source code as an abstract syntax tree (AST) and thus their implementations are hard to extend and modify. This paper presents Jrbx, a refactoring tool that uses a fine-grained XML representation of source code and supports stylized manipulations of the representation. Moreover, Jrbx aggressively exploits control flow graphs (CFGs) and program dependence graphs (PDGs) for both precondition checking and change creation. The use of the XML, CFG, and PDG representations makes the implementation of Jrbx more understandable and reusable, and thus facilitates tool developers creating new refactorings and modifying existing ones.
Comparison of heuristics for flowtime minimisation in permutation flowshops
Authors: Jose M. Framinan, Rainer Leisten, Rafael Ruiz-Usano
Venue: Computers and Operations Research (2005)

In this paper, we address the problem of sequencing jobs in a permutation flow shop with the objective of minimising the sum of completion times or flowtime. This objective is considered to be relevant and meaningful for today's dynamic production environment, and therefore it has attracted the attention of researchers during the last years. As a result, a number of different types of heuristics have recently been developed, each one claiming to be the best for the problem. However, some of these heuristics have been independently developed and only partial comparisons among them exist. Consequently, there are no conclusive results on their relative performance. Besides, some of these types of heuristics are of a different nature and could be combined in order to obtain composite heuristics. In this paper, we first classify and conduct an extensive comparison among the existing heuristics. Secondly, based on the results of the experiments, we suggest two new composite heuristics for the problem. The subsequent computational experience shows these two heuristics to be efficient for the problem under consideration.
Apple Training Series: GarageBand 2 (Apple Training)
Authors: Mary Plummer
Venue:  (2005)

Now that you can record eight simultaneous tracks with it, GarageBand 2 really does turn your Mac into a full-featured recording studio. To start taking advantage of it immediately, you (and your band-mates) need this Apple-certified guide from composer and master trainer Mary Plummer (who's also an Apple Certified Trainer). Through 20 hours of step-by-step lessons coupled with ample visual aids and loads of real-world tips, this book/DVD combo offers a complete, self-paced course in all aspects of GarageBand 2. You'll learn everything from mastering the interface and basic recording techniques to the secrets of arranging songs, editing and mixing tracks, adding effects, and distributing your GarageBand files. This thoroughly updated guide includes extensive coverage of all the new features of GarageBand 2, including multitrack recording, built-in real-time music notation, and smart recording features.
A Complete Classification for Pairs of Real Analytic Curves in the Complex Plane with Tangential Intersection
Authors: Patrick Ahern, Xianghong Gong
Venue: Journal of Dynamical and Control Systems (2005)

We study the group structure of centralizers of a holomorphic mapping that is tangent to the identity. We give a complete classification for pairs of real analytic curves intersecting tangentially via the Ecalle--Voronin theory. We also classify pairs of one-dimensional holomorphic involutions that have a high-order tangency, real analytic mappings on the real line, and exceptional non-Abelian subgroups of Cerveau and Moussu. Consequently, we prove the existence of holomorphic mappings z ¿ z + O(2) that are reversible by a formal antiholomorphic mapping, but not by any (convergent) antiholomorphic one. We also prove the existence of local real analytic mappings on the real line that are not equivalent with respect to any local real analytic diffeomorphism and yet whose complexifications are holomorphically equivalent.
Infinite serie of extreme Delaunay polytopes
Authors: Mathieu Dutour
Venue: European Journal of Combinatorics (2005)

A Delaunay polytope P is said to be extreme if the only (up to isometries) affine bijective transformations f of Rn, for which f(P) is again a Delaunay polytope, are the homotheties. This notion was introduced in (Sets, Graphs and Numbers, Budapest (Hungary) (1991); Colloquia Mathematica Societatis János Bolyai 60 (1992) 157); also some examples in dimension 1, 6, 7, 15, 16, 22, 23 were constructed and it was proved there, that in dimension less than 6 there are no extreme Delaunay polytopes, except the segment. In this note, for every n ≥ 6 we build an extreme Delaunay polytope E Dn of dimension n.
Balios: the engine for Bayesian logic programs
Authors: Kristian Kersting, Uwe Dick
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

Inductive Logic Programming (ILP) [4] combines techniques from machine learning with the representation of logic programming. It aims at inducing logical clauses, i.e, general rules from specific observations and background knowledge. Because of focusing on logical clauses, traditional ILP systems do not model uncertainty explicitly. On the other hand, state-of-the-art probabilistic models such as Bayesian networks (BN) [5], hidden Markov models, and stochastic context-free grammars have a rigid structure and therefore have problems representing a variable number of objects and relations among these objects. Recently, various relational extensions of traditional probabilistic models have been proposed, see [1] for an overview. The newly emerging field of stochastic relational learning (SRL) studies learning such rich probabilistic models.
PostgreSQL (2nd Edition)
Authors: Korry Douglas
Venue:  (2005)

The second edition of the best-selling PostgreSQL has been updated to completely cover new features and capabilities of the 8.0 version of PostgreSQL. You will be lead through the internals of the powerful PostgreSQL open source database chapter, offering an easy-to-read, code-based approach that makes it easy to understand how each feature is implemented, how to best use each feature, and how to get more performance from database applications. This definitive guide to building, programming and administering the powerful PostgreSQL open-source database system will help you harness one of the most widely used open source, enterprise-level database systems.
A New Distance for High Level RNA Secondary Structure Comparison
Authors: Julien Allali, Marie-France Sagot
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2005)

We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two new operations, called node fusion and edge fusion, besides the tree edit operations of deletion, insertion, and relabeling classically used in the literature. This allows us to address some serious limitations of the more traditional tree edit operations when the trees represent RNAs and what is searched for is a common structural core of two RNAs. Although the algorithm complexity has an exponential term, this term depends only on the number of successive fusions that may be applied to a same node, not on the total number of fusions. The algorithm remains therefore efficient in practice and is used for illustrative purposes on ribosomal as well as on other types of RNAs.
GalaTex: a conformant implementation of the XQuery full-text language
Authors: Emiran Curtmola, Sihem Amer-Yahia, Philip Brown, Mary Fernández
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

We describe GalaTex, the first complete implementation of XQuery Full-Text, a W3C specification that extends XPath 2.0 and XQuery 1.0 with full-text search. XQuery Full-Text provides composable full-text search primitives such as keyword search, Boolean queries, and keyword-distance predicates. GalaTex is intended to serve as a reference implementation for XQuery Full-Text and as a platform for addressing new research problems such as scoring full-text query results, optimizing XML queries over both structure and text, and evaluating top-k queries on scored results. GalaTex is an all-XQuery implementation initially focused on completeness and conformance rather than on efficiency. We describe its implementation on top of Galax, a complete XQuery implementation.
Presentation system of still picture teaching material using the implant-JPEG
Authors: Nobuyoshi Yonezawa, Hitoshi Sasaki, Zenju Otsuki, Masahiro Ukigai, Youzou Miyadera, Takashi Okunuki, Shoji Yoshihara, Takateru Kamei
Venue: Systems and Computers in Japan (2004)

The authors developed a presentation system for still image teaching materials, which enables various image information embedded in still images on the World Wide Web to be displayed while synchronizing that information with audio explanations and also enables other related image information to be referenced interactively. This paper presents an overview of the presentation system and reports on a creation tool for still image teaching materials, which supports the creation of still image teaching materials to be used in the presentation system. The presentation system's viewer, which is provided to enable the user to accurately understand the image information, has functions not only for changing the display of the image that was pointed to so that the indicated image can be differentiated from other images but also for displaying explanatory text for the image and displaying additional information such as information for other related images. In addition, the system's search function enables the user to find a high-level concept to which the image information belongs and easily retrieve other picture information having the same high-level concept. The presentation data can be easily maintained and managed by putting together and distributing the information for the still image and each partial still image in an implant-JPEG format file called a capsule. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(14): 96&ndash;105, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10042
Predictor models in software engineering (PROMISE)
Authors: Jelber Sayyad Shirabad, Tim Menzies
Venue: Proceedings of the 27th international conference on Software engineering (2005)

No abstract available
Making XML document markup international
Authors: Yijun Yu, Jianguo Lu, John Mylopoulos, Weiwei Sun, Jing-Hao Xue, Erik H. D'Hollander
Venue: Software&mdash;Practice Experience (2005)

In name and in practice, the World-Wide Web (hereafter Web) is used around the World beyond English-speaking areas. This creates a tremendous need to internationalize standard terminology used in the technologies that make the Web possible. Existing efforts on XML internationalization (i18n) and localization (i10n) have focused on the content of XML documents instead of the terms used in markup (annotations) such as elements and attributes. The SGML standard ISO 8879 supports the use of Unicode (ISO 10646) throughout a document, including markups. However, most elements and attributes of XML documents are still defined in English, thereby limiting their use among non-English speakers. This paper presents an XSLT-based method that can completely localize the markup of XML documents into different natural languages. We also describe how the proposed technique can be applied to translation problems in programming (e.g. C and Java) or documentation (e.g. LATEX or other formatting languages) so that a program or a document can be converted to and from an XML format.
An optimization based approach for cross-layer design in wireless communication networks
Authors: Ness Shroff, Xiaojun Lin
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

In this talk we study the issue of cross-layer design for rate control in multihop wireless networks. We have developed an optimal cross-layered rate control scheme that jointly computes both the rate allocation and the stabilizing schedule that controls the resources at the underlying layers. However, the scheduling component in this optimal cross-layered rate control scheme has to solve a complex global optimization problem at each time, and is hence too computationally expensive for online implementation. Thus, we study the impact on the performance of cross-layer rate control if the network can only use an imperfect (and potentially distributed) scheduling component that is easier to implement. We study scenarios with both fixed number of users as well as when the number of users change due to arrivals and departures in the system. In each case, we establish desirable results on the performance bounds of cross-layered rate control with imperfect scheduling. Our cross-layered approach provides provably better performance bounds when compared with a layered approach (that does not design rate control and scheduling together). The insights drawn from our analyses also enable us to design a fully distributed cross-layered rate control and scheduling algorithm under a restrictive interference model.
Configuration Management for Designs of Software Systems
Authors: Tien N. Nguyen, Ethan V. Munson, John T. Boyland, Cheng Thao
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Configuration management systems are traditionally concerned only with source code. However, in large-scale projects, capturing the evolution of design artifacts is crucial to the success of the software products. This paper presents a novel tool to provide version control and configuration management supports for design artifacts as well as specifications and documentations produced during a software life cycle. The tool is distinguished itself from existing ones by its ability to manage the evolution of the semantic relationships between design objects and implementation source code. This paper also describes the use of that tool in the Software Concordance integrated development environment to manage the evolution of software projects.
Approximation algorithms for combinatorial auctions with complement-free bidders
Authors: Shahar Dobzinski, Noam Nisan, Michael Schapira
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in the number of items $m$ and in the number of bidders n, even though the "input size" is exponential in m. The first algorithm provides an O(log m) approximation. The second algorithm provides an O(√ m) approximation in the weaker model of value oracles. This algorithm is also incentive compatible. The third algorithm provides an improved 2-approximation for the more restricted case of "XOS bidders", a class which strictly contains submodular bidders. We also prove lower bounds on the possible approximations achievable for these classes of bidders. These bounds are not tight and we leave the gaps as open problems.