ppxscal/embedding_network huggingface dataset:
Lattice-Based Precedence of Moderate Lock Modes on Objects
Authors: Yosuke Sugiyama, Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Objects are concurrently manipulated through method issued by multiple transactions in object-based systems. Objects are locked in modes of the methods. Lock modes are defined based on the conflicting relation of method. We define a partially ordered relation on lock modes showing which modes are stronger than others. We newly propose a moderate locking (ML) protocol where an object is initially locked in a weaker mode than a mode intrinsic to the method and the lock mode isfinally escalated to the method mode. The weaker the initial mode is, the higher concurrency is obtained but the more frequently deadlocks occur. The ML protocol is evaluated in terms of throughput and number of deadlocked transactions compared with the pessimistic and optimistic protocols.
Parameterization of triangle meshes over quadrilateral domains
Authors: Ioana Boier-Martin, Holly Rushmeier, Jingyi Jin
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

We present a method for parameterizing irregularly triangulated input models over polyhedral domains with quadrilateral faces. A combination of center-based clustering techniques is used to generate a partition of the model into regions suitable for remeshing. Several issues are addressed: the size and shape of the regions, their positioning with respect to features of the input geometry, and the amount of distortion introduced by approximating each region with a coarse polygon. Region boundaries are used to define a coarse polygonal mesh which is quadrangulated to obtain a parameterization domain. Constraints can be optionally imposed to enforce a strict correspondence between input and output features. We use the parameterization for multiresolution Catmull-Clark remeshing and we illustrate two applications that take advantage of the resulting representation: interactive model editing and texture mapping.
Non-Designer's Type Book, The (2nd Edition) (Non-Designer's)
Authors: Robin Williams
Venue:  (2005)

Seven years is a long time in any industry, but when it comes to the worlds of design and technology (and particularly the point at which the two merge), it's an eternity! No wonder, then, that you (and about a million other readers!) have been eagerly awaiting this latest update to Robin Williams' enormously popular Non-Designer's series. In these pages, Robin defines the principles that govern type as well as the logic behind them so that you learn not just what looks best but why on your way to creating effective print and Web pages. Each short chapter in this thoroughly updated guide (which includes new coverage of typography in Adobe InDesign and Mac OS X) explores a different type secret or technique, including understanding legibility and readability; tailoring typeface to a particular project; mastering pull quotes and captions; working with spacing, punctuation marks, special characters, fonts, and justification; and more. The nonplatform- and nonsoftware-specific approach and Robin's lively, engaging style make this a must-have for any designer's bookshelf!
JCIT hosts Israel's first major computer chess tournament
Authors: Monroe M. Newborn
Venue: Issue 69 (January 1980) (1980)

At the invitation of the organizers of the Jerusalem Conference on Information Technology and the Israel Chess Association, six chess programs and their programmers gathered in Jerusalem on August 6-8 for a special three round computer chess tournament. The event was won by Tom Truscott's DUCHESS who upset David Slate and Larry Atkin's World Champion program, CHESS 4.6. CHESS 4.6 tied for second place with CHAOS. Also participating were OSTRICH (Canada) TELL (Switzerland) and BS '66 '76 (Netherlands).
Parallel Particle-In-Cell Simulation of Colliding Beams in High Energy Accelerators
Authors: Ji Qiang, Miguel A. Furman, Robert D. Ryne
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

In this paper we present a self-consistent simulation model of colliding beams in high energy accelerators. The model, which is based on a particle-in-cell method, uses a new developed shifted-Green function algorithm for the efficient calculation of the beam-beam interaction. The model uses transfer maps to treat the external focusing elements and a stochastic map to treat radiation damping and quantum excitation of the beams. In the parallel implementation we studied various strategies to deal with the particular nature of the colliding beam system - a system in which there can be significant particle movement between beam-beam collisions. We chose a particle-field decomposition approach instead of the conventional domain decomposition or particle decomposition approach. The particle-field approach leads to good load balance, reduced communication cost, and shows the best scalability on an IBM SP3 among the three parallel implementations we studied. A performance test of the beam-beam model on a Cray T3E, IBM SP3, and a PC cluster is presented. As an application, we studied the effect of long-range collisions on antiproton lifetime in the Fermilab Tevatron.
Flow Past a Stationary and Moving Cylinder: DNS at Re=10,000
Authors: Suchuan Dong, Didier Lucor, George Em Karniadakis
Venue: Proceedings of the 2004 Users Group Conference (2004)

We conduct direct numerical simulations with 300 million degrees of freedom of turbulentflows past a stationary and a forced oscillating rigid cylinder at the Reynolds number Re=10,000. This one-order of magnitude increase in Reynolds number (compared to previous DNS) is accomplished by employing a multilevel-type parallel algorithm within the spectral element framework. Comparisons with the available experimental data show that the simulation has captured the flow quantities, mean, and rms statistics of the cylinder wake correctly. We also examine the effect of the randomness in the inflow on the vortex formation at a lower Reynolds number. We demonstrate that noisy inflows cause a vortex shedding-modeswitching in the cylinder wake.
The design and implementation of Grid database services in OGSA-DAI: Research Articles
Authors: Mario Antonioletti, Malcolm Atkinson, Rob Baxter, Andrew Borley, Neil P. Chue Hong, Brian Collins, Neil Hardman, Alastair C. Hume, Alan Knox, Mike Jackson, Amy Krause, Simon Laws, James Magowan, Norman W. Paton, Dave Pearson, Tom Sugden, Paul Watson, Martin Westhead
Venue: Concurrency and Computation: Practice Experience (2005)

Initially, Grid technologies were principally associated with supercomputer centres and large-scale scientific applications in physics and astronomy. They are now increasingly seen as being relevant to many areas of e-Science and e-Business. The emergence of the Open Grid Services Architecture (OGSA), to complement the ongoing activity on Web Services standards, promises to provide a service-based platform that can meet the needs of both business and scientific applications. Early Grid applications focused principally on the storage, replication and movement of file-based data. Now the need for the full integration of database technologies with Grid middleware is widely recognized. Not only do many Grid applications already use databases for managing metadata, but increasingly many are associated with large databases of domain-specific information (e.g. biological or astronomical data). This paper describes the design and implementation of OGSA-DAI, a service-based architecture for database access over the Grid. The approach involves the design of Grid Data Services that allow consumers to discover the properties of structured data stores and to access their contents. The initial focus has been on support for access to Relational and XML data, but the overall architecture has been designed to be extensible to accommodate different storage paradigms. The paper describes and motivates the design decisions that have been taken, and illustrates how the approach supports a range of application scenarios. The OGSA-DAI software is freely available from . Copyright &copy; 2005 John Wiley & Sons, Ltd.
Application Steering in a Collaborative Environment
Authors: John Brooke, Thomas Eickermann, Uwe Woessner
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

In this showcase we will present live running simulations which are integrated into the Access Grid in a variety of different ways. An example of this is the use of vnc to distribute a desktop on which the simulation is being displayed. Another example is the redirection of the visualization into vic to make 3D animations available over the Access Grid. Other examples that will be explored are the use of SGI's OpenGL VizServer to direct the output of a graphics supercomputer located on the Grid to the AG locations. We will also utilize the ability of the next generation AG software to directly link with visualization toolkits such as vtk, AVS/Express, or COVISE as an integrated part of the Virtual Venue as this functionality has developed by the time of the SC2003 demonstrations. We also demonstrate steering in a collaborative setting using a steering service which is fully compliant with OGSI and with the proposed OGSA architecture. This can be integrated with current Grid middleware (e.g. GT2 and UNICORE) using a specially developed Perl hosting environment, OGSI:Lite.
A general model of hybrid data dissemination
Authors: Hao-Ping Hung, Ming-Syan Chen
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Hybrid data dissemination, which combines the push-based (i.e., broadcast) and pull-based (i.e., on-demand) data delivery, is the most common technique to deliver information in a mobile computing system. Most of the prior works in hibrid dissemination are based on the assumption that each delivered data item is of the same size. However, in the modern communication environment in which various information is delivered, the conventional dissemination schemes suffer from the efficiency issues. In this paper, we consider a general model of hybrid data dissemination, in which each data item is allowed to have an arbitrary size. The analytical model MGBC (Model of General Broadcast Channels) and MGOD (Model of General On-demand Channels) are first proposed to describe the broadcast and on-demand channels, respectively. In addition, the scheme GDS (General Dissemination Scheme) is adopted to perform the channel allocation and the data classification. Experimental results show that the proposed approach gives a near-optimal solution in achieving the minimun access time in the general dissemination environment.
Tipster shogun system (joint GE-CMU): MUC-4 test results and analysis
Authors: George Krupka, Paul Jacobs, Michael Mauldin, Todd Kaufmann, Ira Sider
Venue: Proceedings of the 4th conference on Message understanding (1992)

This paper reports on the joint GE-CMU Tipster SHOGUN customization effort for MUC-4, and analyzes the results of the TST3 and TST4 runs in comparison with the GE system.
Reach: dynamic textile patterns for communication and social expression
Authors: Margot Jacobs, Linda Worbin
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

In the research project 'Reach', we investigate the potential for new forms of communication and expression to be incorporated dynamically and interactively into the things to be worn everyday. Through a series of iterative prototypes, we have explored both dynamic textile materials and the interactive behaviours of clothing and accessories, which change pattern through direct physical interaction as well as through sensing context. We have developed a series of working prototypes, where dynamic textile patterns are incorporated into wearable items to reflect and make visible social and contextual behaviours, such as person-to-person communication, proximity and local weather conditions. Ultimately, we aim to develop a new dynamic language of wearable expression integrating aesthetics, pattern and computation into everyday artifacts with increased personal and cultural meaning.
Extraction and quantitative analysis of aneurysmal aorta for aiding endovascular stent grafting
Authors: Hiroshi Imamura, Naozo Sugimoto, Shigeru Eiho, Shin-Ichi Urayama, Katsuya Ueno, Kanji Inoue
Venue: Systems and Computers in Japan (2004)

In performing interventions including stent grafting, the suitability for stent grafting must be checked and the devices to be used must be designed preoperatively. For these purposes, the three-dimensional shapes of the blood vessels in lesions or the paths of device placement must be measured accurately and quickly. In this paper, a method for measuring the aortal shape from CT angiogram (CTA) and for detecting lesions from the shape characteristics of these is presented. Specifically, this method extracts the blood flow area of the aorta by using a three-dimensional edge-preserving smoothing filter and a region growing method. Extracted blood vessels are classified by using their anatomical characteristics. After initial setting of the medial axis in a blood vessel, it determines the aneurysmal area based on the diameter of the blood vessel and modifies the medial axis. In addition, it detects lesions such as thrombi and calcifications near the blood flow borderline. Application of the method to 30 clinical cases has confirmed that the proposed method is effective in obtaining the shape of blood vessels. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(3): 58&ndash;67, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10223
Permutation Groups with a Cyclic Regular Subgroup and Arc Transitive Circulants
Authors: Cai Heng Li
Venue: Journal of Algebraic Combinatorics: An International Journal (2005)

A description is given of finite permutation groups containing a cyclic regular subgroup. It is then applied to derive a classification of arc transitive circulants, completing the work dating from 1970's. It is shown that a connected arc transitive circulant ¿ of order n is one of the following: a complete graph Kn, a lexicographic product $\Sigma [{\bar K}_b]$ , a deleted lexicographic product $\Sigma [{\bar K}_b] - b\Sigma$ , where ¿ is a smaller arc transitive circulant, or ¿ is a normal circulant, that is, Auta¿ has a normal cyclic regular subgroup. The description of this class of permutation groups is also used to describe the class of rotary Cayley maps in subsequent work.
Experimenting SnakeT: A hierarchical clustering engine for web-page snippets
Authors: Paolo Ferragina, Antonio Gullì
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

Current search engines return a ranked list of web pages represented by page excerpts called the web snippets. The ranking is computed according to some relevance criterium that takes into account textual and hyperlink information about the web pages (see e.g. [1]). This approach is very well-known and a lot of research is pushing towards the design of better and faster ranking criteria. However, it is nowadays equally known that a flat list of results limits the retrieval of precise answers because of many factors. First, the relevance of the query results is a subjective and time-varying concept that strictly depends on the context in which the user is formulating the query. Second, the ever growing web is enlarging the number and heterogeneity of candidate query answers. Third, the web users have limited patience so that they usually just look at the top ten results. The net outcome of this scenario is that the retrieval of the correct answer by a standard user is getting more and more diffcult, if not impossible.
Proceedings of the twenty-first annual symposium on Computational geometry
Venue: Annual Symposium on Computational Geometry (2005)

This volume collects the research papers and the short descriptions of the video/multimedia presentations of the 21st Annual Symposium on Computational Geometry (SoCG'05), held June 8-10, 2005, in Pisa, Italy. In addition, there are two invited talks by Giuseppe di Battista (on clustered planarity) and by Eli Goodman (on double-permutation sequences and geometric transversals). The symposium is sponsored by SIGACT and SIGGRAPH, two Special Interest Groups of the Association for Computing Machinery (ACM).In total, 141 papers were submitted to the conference (2 papers were subsequently withdrawn). The Program Committee undertook an extensive review and selection process, with a distributed effort that included expert input not only from the Program Committee, but also from numerous external reviewers. Almost 600 reviews were written for the selection process, totalling more than a Megabyte of text. We wish to acknowledge the substantial help that we received from external reviewers: Their names are listed on pages viii-ix. The Program Committee met electronically from January 25 to February 14, producing 482 discussion items with more than 190 Kilobytes of text. The 41 papers of this volume were eventually selected for presentation at the symposium.For handling the on-line submission process, we adapted the free version of the CyberChair software of Richard van de Stadt. The Program Committee review, discussion and decision phase was done using the UMIACS Echelon (copyright) software, developed by Yang Wang at the University of Maryland.The papers generally represent preliminary results of ongoing research. It is expected that most papers will eventually appear in a more polished and complete form in refereed journals.In addition to the paper submissions, there were 13 submissions with a total playtime of 64 minutes in response to the Call for Videos and Multimedia, of which 11 were accepted. One of the accepted videos accompanies an accepted paper submission, an option that was encouraged in this year's call for papers. It was not only possible to submit video, but also more interactive forms of multimedia, such as applets and PowerPoint animations. This year, two submissions were Java applets and one submission was a Macromedia Flash presentation; all three were accepted. These proceedings contain a short description of each of the accepted contributions. The web proceedings showcase the video and multimedia submissions; see http://videos.compgeom.org/
A New Approach to Detectability of Discrete-Time Infinite Markov Jump Linear Systems
Authors: Eduardo F. Costa, João B. R. do Val, Marcelo D. Fragoso
Venue: SIAM Journal on Control and Optimization (2005)

This paper deals with detectability for the class of discrete-time Markov jump linear systems (MJLS) with the underlying Markov chain having countably infinite state space. The formulation here relates the convergence of the output with that of the state variables, and due to the rather general setting, a novel point of view toward detectability is required. Our approach introduces invariant subspaces for the autonomous system and exhibits the role that they play. This allows us to show that detectability can be written equivalently in term of two conditions: stability of the autonomous system in a certain invariant space and convergence of general state trajectories to this invariant space under convergence of input and output variables. This, in turn, provides the tools to show that detectability here generalizes uniform observability ideas as well as previous detectability notions for MJLS with finite state Markov chain, and allows us to solve the jump-linear-quadratic control problem. In addition, it is shown for the MJLS with finite Markov state that the second condition is redundant and that detectability retrieves previously well-known concepts in their respective scenarios. Illustrative examples are included.
Need for Incorporating a RuleBased Conventional Object Oriented Systems
Authors: Bhuwan Lodha, K. V. Dinesha, Pavan Kumar
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

System requirements, which define automatic behavior within a domain model, appear variously as business policies, engineering rules, domain laws, constraints, and state transitions. At first glance, such requirements seem easy to implement in the conventional Object Oriented (OO) space, but when looked closely, the most natural way of expressing such behavior is the rule based approach. Given a seamless bridge betweenthe two paradigms, the combination not only provides ease of programming but also conceptual clarity at a higher level. In section one of this paper, we consider the features of logic languages and their advantages in representation of various aforesaid system requirements. In section two, we look at the conventional three tier Object Oriented architecture and its advantage and disadvantages using different examples. We propose an optimum architecture that combines the best of both. We also apply the proposed architecture in the context of building highly configurable systems.
An Efficient Parallel Algorithm to Solve Block-Toeplitz Systems
Authors: P. Alonso, J. M. Badía, A. M. Vidal
Venue: The Journal of Supercomputing (2005)

In this paper, we present an efficient parallel algorithm to solve Toeplitz--block and block--Toeplitz systems in distributed memory multicomputers. This algorithm parallelizes the Generalized Schur Algorithm to obtain the semi-normal equations. Our parallel implementation reduces the communication cost and optimizes the memory access. The experimental analysis on a cluster of personal computers shows the scalability of the implementation. The algorithm is portable because it is based on standard tools and libraries, such as ScaLAPACK and MPI.
Tossing Packets Over the Wall Using Transmit-Only Ethernet Cables
Authors: Jon Meek, Frank Colosimo
Venue: Proceedings of the 17th USENIX conference on System administration (2003)

Solutions for transporting packets from an insecure DMZ into an organization's internal network are described. All of the solutions attempt to prevent the establishment of two-way traffic by physically cutting the transmit wires at the receiving device on the internal network. Because alternate paths to the packet sender could exist, a user-mode packet relay on the internal network is used to accept and re-transmit the packets to the appropriate destination.Applications discussed include relaying of syslog and SNMP trap packets from DMZ systems to receiving hosts on a secure network, and monitoring traffic for IDS and diagnostic purposes using a system conveniently located on the secure internal network.
Viscous Lattices
Authors: Jean Serra
Venue: Journal of Mathematical Imaging and Vision (2005)

Let E be an arbitrary space, and ¿ an extensive dilation of P(E) into itself, with an adjoint erosion ¿. Then, the image ¿[P(E)] of P(E) by ¿ is a complete lattice P where the sup is the union and the inf the opening of the intersection according to ¿ ¿. The lattice L, named viscous, is not distributive, nor complemented. Any dilation ¿ on P(E) admits the same expression in L. However, the erosion in L is the opening according to ¿ ¿ of the erosion in P(E). Given a connection C on P(E) the image of C under ¿ turns out to be a connection C ¿ on L as soon as ¿ ¿ (C)¿eq C. Moreover, the elementary connected openings ¿x of C and ¿¿¿(x) are linked by the relation ¿¿¿(x) = ¿¿x¿. A comprehensive class of connection preverving closings ¿ ¿ is constructed. Two examples, binary and numerical (the latter comes from the heart imaging), prove the relevance of viscous lattices in interpolation and in segmentation problems.