ppxscal/embedding_network huggingface dataset:
Perfect Matchings Versus Odd Cuts
Authors: Zolt&#x00e1;n Szigeti
Venue: Combinatorica (2002)

We give a simple proof for an important result of Edmonds, Lov&#x00e1;sz and Pulleyblank, stating that a brick has no non-trivial tight cuts. Our proof relies on some results on almost critical graphs. The introduction of these graphs is the second aim of the present paper.
A Fast Algorithm for Subspace Clustering by Pattern Similarity
Authors: Haixun Wang, Fang Chu, Wei Fan, Philip S. Yu, Jian Pei
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

Unlike traditional clustering methods that focus ongrouping objects with similar values on a set of dimensions,clustering by pattern similarity finds objects thatexhibit a coherent pattern of rise and fall in subspaces.Pattern-based clustering extends the concept of traditional clustering and bene ts a wide range of applications, including large scale scientific data analysis, targetmarketing, web usage analysis, etc. However, state-of-the-art pattern-based clustering methods (e.g., the pCluster algorithm) can only handle datasets of thousands ofrecords, which makes them inappropriate for many real-life applications. Furthermore, besides the huge data volume, many data sets are also characterized by their sequentiality, for instance, customer purchase records andnetwork event logs are usually modeled as data sequences.Hence, it becomes important to enable pattern-based clustering methods i) to handle large datasets, and ii) to discover pattern similarity embedded in data sequences.In this paper, we present a novel algorithm that offersthis capability. Experimental results from both real lifeand synthetic datasets prove its effectiveness and efficiency.
Rotational Effect on ROI's for Accurate Lumen Quantification in Bifurcated MR Plaque Volumes
Authors: Jasjit Suri, Vasanth Pappu, Olivier Salvado, Baowei Fei, Shaoxiong Zhang, Jonathan Lewin, Jeffrey Duerk, David Wilson
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

This paper presents a use of geometric-based method integated with classifier for lumenwall estimation using MR plaque volumes.The following are the new things the readerswill observe when it comes to plaque imaging.(a) Application of three different sets ofclassifiers (Fuzzy, Markovian and Graph-based) for lumen region classification in plaqueMR volumes.These classifiers are used in multi-resolution framework.(b) Usage of rule-based region merging applied to the sub-classes of lumen region.(c) Rotational effect onregion of interest in arterial bifurcation zoens for accurate lumen region identification andboundary estimation.We have used our diagnostic system with three different classifying methods on actualpatient data.We measure performance of the system by computing the mean distance errorwith respect to boundaries traced manually by human experts.Overall, the system consistsof 22,500 boundary points.The in-plane pixel resolution is 0.25 millimeters.Using Markovian classifier method, the average error was 0.61 pixels; using Fuzzy classifier method, the average error was 0.62 pixels; using Graph-based classifier method, the average error was 0.74 pixels.All these methods lead to error less than 0.185 mm.We also validated our system by simulating the lumen images with additive Gaussian perturbations.This system works on a Linux platform and is written in C++.
Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach
Authors: André Baresel, David Binkley, Mark Harman, Bogdan Korel
Venue: ACM SIGSOFT Software Engineering Notes (2004)

Evolutionary testing is an effective technique for automatically generating good quality test data. However, for structural testing, the technique degenerates to random testing in the presence of flag variables, which also present problems for other automated test data generation techniques. Previous work on the flag problem does not address flags assigned in loops.This paper introduces a testability transformation that transforms programs with loop--assigned flags so that existing genetic approaches can be successfully applied. It then presents empirical data demonstrating the effectiveness of the transformation. Untransformed, the genetic algorithm flounders and is unable to find a solution. Two transformations are considered. The first allows the search to find a solution. The second reduces the time taken by an order of magnitude and, more importantly, reduces the slope of the cost increase; thus, greatly increasing the complexity of the problem to which the genetic algorithm can be applied. The paper also presents a second empirical study showing that loop--assigned flags are prevalent in real world code. They account for just under 11% of all flags.
Representation of Fuzzy Knowledge in Relational Databases
Authors: Jose Galindo, Angelica Urrutia, Mario Piattini
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

In this article we present how to implement fuzzy databases based on the relational model. This approach includes many fuzzy attribute types, which can express the most of fuzzy knowledge types. These fuzzy attribute types include imprecise attributes, fuzzy attributes associated to one or more attributes or with an independent meaning. In order to represent such fuzzy information we must study two aspects of fuzzy information: how to represent fuzzy data and how to represent fuzzy metaknowledge data. This second information is very important and it must be considered in any fuzzy database. This article studies the fuzzy metaknowledge data for any fuzzy attribute and how to represent both in a relational database.
LITO - A Logic For Indeterminate Temporal Objects
Authors: Ed Porto Bezerra, Ulrich Schiel, Bernardo Lula,  Jr.
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

In order to obtain a suitable model of the universe of discourse of some information systems, it is important to allow the description of imprecise objects with temporal indeterminacy. These objects are called indeterminate temporal objects. This paper presents a formalism, called LITO (Logic of Indeterminate Temporal Objects), for the representation, querying and modification of such objects.
Model Checking Action- and State-Labelled Markov Chains
Authors: Christel Baier, Lucia Cloth, Boudewijn Haverkort, Matthias Kuntz, Markus Siegle
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

In this paper we introduce the logic asCSL, an extensionof continuous stochastic logic (CSL), which provides powerfulmeans to characterise execution paths of action- andstate-labelled Markov chains. In asCSL, path propertiesare characterised by regular expressions over actions andstate-formulas. Thus, the executability of a path not onlydepends on the available actions but also on the validityof certain state formulas in intermediate states. Our mainresult is that the model checking problem for asCSL canbe reduced to CSL model checking on a modified Markovchain, which is obtained through a product automaton construction.We provide a case study of a scalable cellularphone system which shows how the logic asCSL and themodel checking procedure can be applied in practice.
SRN: An Extended Petri-Net-Based Workflow Model for Web Service Composition
Authors: Yu Tang, Luo Chen, Kai-Tao He, Ning Jing
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

The emergence of Web services has led to moreinterest into Web service composition, which is anactive area of research. The formidable problem ofefficient and effective composition of existing Webservices is the subject of much current attention. Thestudy of workflow model is one of the most importantparts and a key layer of Web service composition. Theexisting approaches have difficulties in modelingdynamic and complex service composition process, sowe propose a novel workflow model namedService/Resource Net (SRN) for Web servicecomposition, which is an extended Petri-net-basedmodel with some new elements, such as time, resourcetaxonomy, condition, etc. To establish formal conceptsystem of Web service taxonomy in SRN, we presentWeb service semigroup based on group theory.Moreover, meta-service is proposed based on thedefinition of generating element in cyclic monoid. Asthe supplement of traditional analysis methods of basicPetri net, some new methods based on graph theoryare presented for SRN analyzing and evaluating. Forsystem and methodology validation purpose, SRN isapplied to a case study in our research project.
Does Your Result Checker Really Check?
Authors: Lan Guo, Supratik Mukhopadhyay, Bojan Cukic
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

A result checker is a program that checks the outputof the computation of the observed program for correctness. Introduced originally by Blum, the result checkingparadigm has provided a powerful platform assuring thereliability of software. However, constructing result checkers for most problems requires not only significant domain knowledge but also ingenuity and can be error prone. Inthis paper we present our experience in validating resultcheckers using formal methods. We have conducted severalcase studies in validating result checkers from the commercial LEDA system for combinatorial and geometric computing. In one of our case studies, we detected a logical errorin a result checker for a program computing max flow of a graph.
Coordinating production planning in cellular manufacturing environment using Tabu search
Authors: Mingyuan Chen, Dong Cao
Venue: Computers and Industrial Engineering (2004)

In this paper, an integrated model for production planning in cellular manufacturing (CM) systems is proposed. The model considers general CM features such as quadratic terms for inter-cell material handling and decisions for manufacturing cell construction. In addition, the solution of the model will provide production planning decisions such as times to start part processing and levels of finished part inventory. The model is then transformed to equivalent simpler models and is solved by Tabu search based procedure. Results from testing numerical examples show encouraging behaviors of the developed model and algorithm.
The implementation and evaluation of a virtual haptic back
Authors: L. Holland, L. Williams,  II, R. Conatser,  Jr., N. Howell, L. Cade
Venue: Virtual Reality (2004)

A virtual haptic back (VHB) model has been developed by a cross-disciplinary team of researchers at Ohio University. Haptics give the human the sense of touch and force from virtual computer models. The objective is to create a tool for medical and related education whereby students can train in the difficult art of palpation using virtual reality before approaching human subjects. Palpation is the art of medical diagnosis through the sense of touch. Haptic anatomy could be a key area in the future of medical school training; our goal is to add science to the art of palpation to improve osteopathic, physical therapy and massage therapy training for students and practitioners. Modelling of the VHB took place in two steps. First, Cartesian back data was collected via the Metrecom Skeletal Analysis System (SAS) digitiser. The back of a prone human subject was digitised, giving an array of three-dimensional points. Several methods were considered to smooth out the back data. Spline fitting with matched first and second derivates was the chosen method. Once an acceptable graphical model was created, haptic feedback was added using the PHANToM haptic interface, allowing the human user to explore and feel the virtual back. Experienced and novice palpators formally evaluated the VHB to give us feedback for improvements. In addition, four Doctors of Osteopathy informally interacted with our model and gave verbal feedback. Our experts all suggested modelling underlying muscles and skeletal structure in addition to the skin layer for more realism. Once this is accomplished we will further program somatic dysfunction of various types in the VHB for students to diagnose. This article contributes to the state of the art in virtual haptic anatomy. While other research groups are working in this area, our work is the first specifically aimed towards osteopathic medicine, physical therapy, and massage therapy students and practitioners.
The Princeton Shape Benchmark
Venue: Proceedings of the Shape Modeling International 2004 (2004)

In recent years, many shape representations and geometricalgorithms have been proposed for matching 3D shapes.Usually, each algorithm is tested on a different (small)database of 3D models, and thus no direct comparison isavailable for competing methods.In this paper, we describe the Princeton Shape Benchmark(PSB), a publicly available database of polygonalmodels collected from the World Wide Web and a suite oftools for comparing shape matching and classification algorithms.One feature of the benchmark is that it providesmultiple semantic labels for each 3D model. For instance, itincludes one classification of the 3D models based on function,another that considers function and form, and othersbased on how the object was constructed (e.g., man-madeversus natural objects).We find that experiments with these classifications canexpose different properties of shape-based retrieval algorithms.For example, out of 12 shape descriptors tested,Extended Gaussian Images [13] performed best for distinguishingman-made from natural objects, while they performedamong the worst for distinguishing specific objecttypes. Based on experiments with several different shapedescriptors, we conclude that no single descriptor is bestfor all classifications, and thus the main contribution of thispaper is to provide a framework to determine the conditionsunder which each descriptor performs best.
Integrating Policy-based Access Management and Adaptive Traffic Engineering for QoS Deployment
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

In this paper, we describe our experiences of designinga platform that integrates distributed policy-based accesscontrol and trust management technologies with a developedQoS-aware network management platform. The maingoal of this study is to demonstrate how the application ofpolicy-based decision processes can help to deploy the platformin a scalable way offering adaptive services with enrichingfeatures such as flexible rule-based service definitionsand roaming.
Atomic writes for data integrity and consistency in shared storage devices for clusters
Authors: Michael Okun, Amnon Barak
Venue: Future Generation Computer Systems (2004)

With the recent trend to use storage area networks in distributed and cluster systems there is a need to improve the integrity and consistency guarantees of stored data in the presence of node or network failures. Currently, the main method for preserving data integrity and consistency is by logging techniques, e.g. journaling. This paper presents a new general method for preserving data consistency by Atomic multi-block Writes. The Atomic Writes method guarantees that either all the blocks in a write operation are written or no blocks are written at all. Its main advantage is that it does not require a recovery phase after a failure. The Atomic Writes method should be implemented in both the operating system and the storage system levels. It is easy to use and to implement. We present the method, its implementation and an example of its use for handling meta-data consistency in an existing file system that supports shared storage.
A Novel Signed Higher-Radix Full-Adder Algorithm and Implementation with Current-Mode Multi-Valued Logic Circuits
Authors: Turgay Temel, Avni Morgul, Nizamettin Aydin
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

A higher-radix algebra for full-addition of two numbers is described and realised by combining multi-valued logic min, max, literal and cyclic operators in terms disjoint terms. The latter operator is designed by using a current-mode threshold circuit while the other operator is realised by only voltage-mode switching circuits. The threshold circuit employed allows for much higher radices compared to architetures employing voltage-mode binary logic switching circuits as well as better mismatch properties compared to previous threshold circuits. Due to disjoint terms involved, multi-valued logic min and max operators can be replaced with ordinary ordinary transmission operation and addtion, respectively. Resultant a single-digit, radix-8 full-adder and its 3-bit counterpart voltage-mode circuits are realised and compared. The algorithm is also exploited for a multi-digit case and its HSPice simulation results are presented.
On the Achromatic Index of * for a Prime q
Authors: Mirko Hor&#x0148;&#x00e1;k, &#x0160;tefan P&#x010d;ola, Mariusz Wo&#x017a;niak
Venue: Graphs and Combinatorics (2004)

The achromatic index of a graph G is the maximum number of colours that can be assigned to edges of G in such a way that the colouring is proper and any two colours meet on two adjacent edges. To compute the achromatic index of complete graphs seems to be a very difficult task. Indeed, that knowledge would yield all odd projective plane orders. The aim of the paper is to establish a nontrivial lower bound of the achromatic index of * for a prime q&#x2265;7.
The Minimum Area of Convex Lattice n-Gons
Authors: Imre B&#x00e1;r&#x00e1;ny, Norihide Tokushige
Venue: Combinatorica (2004)

Let A(n) be the minimum area of convex lattice n-gons. We prove that lim A(n)/n3 exists. Our computations suggest that the value of the limit is very close to 0.0185067....
Web-published Data Searching System for GRID Environment
Authors: Sangkeon Lee, Seogchan Hwang, Jaeyoung Choi, Hyeongwoo Park
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

If a Grid system is connected to a database and uses data in the database, it is required to develop a data manipulation module, which handles data and its indices in the database, and install it in the GRID system.If there is a search system, which can directly manipulate data in a database on a web, and if it is possible to integrate it with a GRID system as a single resource, the resulting system would be very effective, easy to develop and use, and very adaptable to changes of the database structure. In this paper, we present a searching system, which connects web-published databases with GRID systems.By using the system, developers could save developing time by integrating data in a database on GRID environments.
Building and Evaluating Non-Obvious User Profiles for Visitors of Web Sites
Authors: Naveed Mushtaq, Peter Werner, Karsten Tolle, Roberto Zicari
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

Building profiles of registered users of a web site, as in case of a portal, is of importance if it goes beyond collecting the obvious information the user is willing to give at the time of registration. The starting point of this work is the assumption that a community of users is registered on a web site and that for each user a profile is built. Such a profile contains two parts of data: one obvious, given directly by the user and one less obvious, inferred by the userýs behavior during his visits on the site. This paper presents ideas on how to build a user profile based on non-obvious information and takes into account various factors influencing in its development. Special emphases are paid on feedback mechanism and several methods of measuring its results.
The future is wild
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 2 - Volume 146 (2003)

A thirteen part series for Animal Planet USA. The 422 team of animators, compositors. desianers and producers worked with John Adams television to bring the series to life over the 18 month production schedule. Copyright held by creator.
Management Technologies of the MIAKO.NET" Public Wireless Internet Service
Authors: Kenji Fujikawa, Takaaki Komura, Yasuo Okabe
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

We have been serving public wireless Internet access MIAKO.NET in Kyoto based on IEEE802.11b wireless LANtechnology. MIAKO.Net provides mobile Internet accesswith a fixed IP address and high-level security. MIAKO.NETis quite unique in its volunteerism. It is managed by annon-profit organization and supported by citizens in Kyoto.Thanks to these volunteer activities, users can enjoy full serviceof MIAKO.NET without any fee. This paper describesthe basic policy of MIAKO.NET and the design and operationalissues of the network.
Self-Deadlocks in Disparate Scientific Data Management Systems
Authors: Fragkiskos Pentaris, Yannis Ioannidis
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

In large statistical and scientific data management environments,where mediation architectures are used to integratedisparate and autonomous systems, a new problem - self-deadlock - may cause global transaction failures. In this short paper we briefly examine the reasons causing thisproblem and identify some algorithms for resolving it.
The characteristic ideal of a finite, connected, regular graph
Authors: Josep M. Brunat, Antonio Montes
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

Let Φ(x,y)∈ &Copf;[x,y] be a symmetric polynomial of partial degree d. The graph G(Φ) is defined by taking &Copf; as set of vertices and the points of &Vopf; (Φ(x,y)) as edges. We study the following problem: given a finite, connected, d-regular graph H, find the polynomials Φ(x,y) such that G(Φ) has some connected component isomorphic to H and, in this case, if G(Φ) has (almost) all components isomorphic to H. The problem is solved by associating to H a characteristic ideal which offers a new perspective to the conjecture formulated in a previous paper, and allows to reduce its scope. In the second part, we determine the characteristic ideal for cycles of lengths ≤ 5 and for complete graphs of order ≤ 6. This results provide new evidence for the conjecture.
Introductory paper
Authors: Jaco van de Pol
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2004)

This section is based on selected papers from the 6th and 7th ERCIM workshops on Formal Methods in Industrial Critical Systems. These papers either extend the state of the art in model checking and automatic test generation or they address the methodology for applying tools based on formal methods. Also, some important experiences are reported from industrial cases in which formal methods have been applied.