ppxscal/embedding_network huggingface dataset:
Petri nets with clocks for the analytical validation of business process
Authors: Gabriel Vilallonga, Daniel Riesco, Germán Montejano, Roberto Uzal
Venue: Practicing software engineering in the 21st century (2003)

This chapter introduces a theoretical frame for the Process Definition (PD) validation in Workflow or in those processes with temporal restrictions. The Interface 1 of Workflow makes the PD of the Work Flow Reference Model. This interface combined with Petri Nets with Clocks (PNwC) allows the formalization and verification of systems, based on the Petri Net theory and the extension. This extension allows the specification of temporal requirements via clocks specification, using temporal invariants for the places and temporal conditions in the transitions.In this chapter we present a technique to validate the Process Definition (PD) by means of PNwC. The algorithm for the analysis of a PNwC allows correction of errors in the modeling of the time variable. The algorithm generates information about temporal unreachable states and process deadlocks with temporal blocks. Also, it corrects activities invariants and transitions conditions.
A Fast Numerical Method for the Black--Scholes Equation of American Options
Authors: Houde Han, Xiaonan Wu
Venue: SIAM Journal on Numerical Analysis (2003)

This paper introduces a fast numerical method for computing American option pricing problems governed by the Black--Scholes equation. The treatment of the free boundary is based on some properties of the solution of the Black--Scholes equation. An artificial boundary condition is also used at the other end of the domain. The finite difference method is used to solve the resulting problem. Computational results are given for some American call option problems. The results show that the new treatment is very efficient and gives better accuracy than the normal finite difference method.
Modeling and Designing Processes in E-Commerce Applications
Authors: Hans Albrecht Schmid, Gustavo Rossi
Venue: IEEE Internet Computing (2004)

State-of-the-art Web applications embody hypermedia-based navigation as well as business processes. However, all mature Web application design methods focus on hypermedia-based navigation and neglect business processes treating them as a kind of navigation. The consequences are design problems, usability problems and erroneous results of business process execution. As a remedy, the modeling and design of Web applications needs to acknowledge that business processes are different from navigation. Therefore, we introduce business processes as first class citizens in the modeling and design of Web applications, and describe their characteristics. As a concrete example, we extend the Object-Oriented Hypermedia Design Method (OOHDM) by processes so that it allows a clear specification and easy design of Web applications embodying business processes.
Probabilistic recognition of human faces from video
Authors: Shaohua Zhou, Volker Krueger, Rama Chellappa
Venue: Computer Vision and Image Understanding (2003)

Recognition of human faces using a gallery of still or video images and a probe set of videos is systematically investigated using a probabilistic framework. In still-to-video recognition, where the gallery consists of still images, a time series state space model is proposed to fuse temporal information in a probe video, which simultaneously characterizes the kinematics and identity using a motion vector and an identity variable, respectively. The joint posterior distribution of the motion vector and the identity variable is estimated at each time instant and then propagated to the next time instant, Marginalization over the motion vector yields a robust estimate of the posterior distribution of the identity variable. A computationally efficient sequential importance sampling (SIS) algorithm is developed to estimate the posterior distribution. Empirical results demonstrate that, due to the propagation of the identity variable over time, a degeneracy in posterior probability of the identity variable is achieved to give improved recognition. The gallery is generalized to videos in order to realize video-to-video recognition. An exemplar-based learning strategy is adopted to automatically select video representatives from the gallery, serving as mixture centers in an updated likelihood measure. The SIS algorithm is applied to approximate the posterior distribution of the motion vector, the identity variable, and the exemplar index, whose marginal distribution of the identity variable produces the recognition result. The model formulation is very general and it allows a variety of image representations and transformations. Experimental results using images/videos collected at UMD, NIST/USF, and CMU with pose/illumination variations illustrate the effectiveness of this approach for both still-to-video and video-to-video scenarios with appropriate model choices.
Synthesis of integer multipliers in sum of pseudoproducts form
Authors: Valentina Ciriani, Fabrizio Luccio, Linda Pagli
Venue: Integration, the VLSI Journal (2003)

We discuss the realization of two standard multiplier structures in a three-level form based on EXOR, called sum of pseudoproducts (SPP for short). SPP extends the classical two-level sum of products form (SOP). Our study focuses on the minimization of the number of gates and levels of the circuits needed to construct Wallace-type multipliers, and a 54 × 54-bit multiplier. The basic building blocks explicitly studied are the 4 × 4 parallel multiply module, and the family of carry-save adders Ci, with i input lines, that compose the Wallace trees. We show that the ratio of the number of gates of Ci in SPP over SOP decreases exponentially with i, being very small even for small values of i (ratio > 0.2 for i = 9). The evaluation of power, speed, and chip area with three different standard tools also shows the interest of the proposed approach.
Large vocabulary sign language recognition based on hierarchical decision trees
Authors: Gaolin Fang, Wen Gao, Debin Zhao
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

The major difficulty for large vocabulary sign language or gesture recognition lies in the huge search space due to a variety of recognized classes. How to reduce the recognition time without loss of accuracy is a challenge issue. In this paper, a hierarchical decision tree is first presented for large vocabulary sign language recognition based on the divide-and-conquer principle. As each sign feature has the different importance to gestures, the corresponding classifiers are proposed for the hierarchical decision to gesture attributes. One- or two- handed classifier with little computational cost is first used to eliminate many impossible candidates. The subsequent hand shape classifier is performed on the possible candidate space. SOFM/HMM classifier is employed to get the final results at the last non-leaf nodes that only include few candidates. Experimental results on a large vocabulary of 5113-signs show that the proposed method drastically reduces the recognition time by 11 times and also improves the recognition rate about 0.95% over single SOFM/HMM.
Developing a web authoring tool that promotes accessibility in children's designs
Authors: Lorna Gibson, Fay Newall, Peter Gregor
Venue: Proceedings of the 2003 conference on Interaction design and children (2003)

This paper describes the development, with full involvement by children, of a web development tool which reflects truly how children view the World Wide Web. The tool was designed in such a way that it promoted the understanding and implementation of accessibility principles to the users.
The more things change, the more (and less) they stay the same
Authors: Bhaskar Chakravorti
Venue: Ubiquity (2003)

Bhaskar Chakravorti tells how the network hinders, then helps market innovation
Supporting database access in the Hermes programming language
Authors: P. Å. Larsont, Qiang Zhut, Frank Pellow
Venue: Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research (1991)

The work reported in this paper is part of a project aimed at designing and prototyping an application development environment that allows easy development of platform-independent distributed applications. The main goals of the database subproject are to investigate methods for (1) providing (SQL) database access and (2) supporting transaction management within a distributed programming environment based on the paradigm of communicating sequential processes. This paper looks at how SQL database access can be provided in Hermes, a new language for distributed programming based on this paradigm. The paper compares the characteristics of Hermes and SQL tables, discusses potential ways of supporting database access in Hermes, and then defines an embedding of SQL in Hermes. Some implementation aspects are also discussed.
Convergence of the ghost fluid method for elliptic equations with interfaces
Authors: Xu-Dong Liu, Thomas C. Sideris
Venue: Mathematics of Computation (2003)

This paper proves the convergence of the ghost fluid method for second order elliptic partial differential equations with interfacial jumps. A weak formulation of the problem is first presented, which then yields the existence and uniqueness of a solution to the problem by classical methods. It is shown that the application of the ghost fluid method by Fedkiw, Kang, and Liu to this problem can be obtained in a natural way through discretization of the weak formulation. An abstract framework is given for proving the convergence of finite difference methods derived from a weak problem, and as a consequence, the ghost fluid method is proved to be convergent.
Foreword
Authors: Eric Goubault
Venue: Mathematical Structures in Computer Science (2000)

&lsquo;Geometry and Concurrency&rsquo; is not (yet) a well-established domain of research, but consists rather of a collection of seemingly related techniques, algorithms and formalizations, coming from different application areas, and accumulated over a long period of time. There is currently a certain amount of effort being made to unify these, following the workshop &lsquo;New Connections between Computer Science and Mathematics&rsquo; held at the Newton Institute in Cambridge, England in November 1995 (and sponsored by HP&sol;BRIMS). More recently, the first workshop on the same subject was held in Aalborg, Denmark (see http://www.math.auc.dk/~raussen/admin/workshop/workshop.html) where the articles of this issue, among others, were first sketched.As a starter, and to put in context the papers by Lisbeth Fajstrup, Philippe Gaucher, Maurice Herlihy, Vaughan Pratt, Sergio Rajsbaum and Martin Raussen that appear later in this issue, I have written a brief historical note, or survey, which follows and naturally completes this foreword.Last and not least, I must express my gratitude to Giuseppe Longo, who gave me the opportunity to act as a guest editor for this special issue, and who very kindly helped me through the many different steps that editing necessitates. My very warm thanks also go to the authors who did a very nice job, in a relatively short time. Finally, I wish to thank the referees of this issue, who found &lsquo;bugs&rsquo; that I would not have found, and who suggested very useful improvements to the authors. The referees were Nir Shavit, Stefan Sokolowski, Christophe Tabacznyj, Jean Goubault-Larrecq, Arnaud Venet, Ian Mackie (who helped me with the survey article), Ronnie Brown and Tim Porter, as well as some of the authors who cross-checked other authors' articles, Philippe Gaucher, Martin Raussen and Lisbeth Fajstrup.
Multiclass text categorization for automated survey coding
Authors: Daniela Giorgetti, Fabrizio Sebastiani
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Survey coding is the task of assigning a symbolic code from a predefined set of such codes to the answer given in response to an open-ended question in a questionnaire (aka survey). We formulate the problem of automated survey coding as a text categorization problem, i.e. as the problem of learning, by means of supervised machine learning techniques, a model of the association between answers and codes from a training set of pre-coded answers, and applying the resulting model to the classification of new answers. In this paper we experiment with two different learning techniques, one based on na&iuml;millve Bayesian classification and the other one based on multiclass support vector machines, and test the resulting framework on a corpus of social surveys. The results we have obtained significantly outperform the results achieved by previous automated survey coding approaches.
Pikapika &ndash; the collaborative composition of an interactive sonic character
Authors: Tomie Hahn, Curtis Bahn
Venue: Organised Sound (2002)

Pikapika is a collaborative solo performance by Bahn and Hahn that presents a simple model of composition, choreography and collaboration in an interactive context. The piece offers the possibility of a new kind of interactive theatre/costume design &ndash;an interactive sonic character. This essay is a case study of a design process for interactive performance. While we include some details of our specific interface, these are primarily employed as examples to suggest our principles for creating personal, idiosyncratic interactive systems. Our collaboration integrates elemental sound and movement relationships with an awareness of the embodied cultural knowledge of the performer and with a specific sensing scheme to capture her particular gestural vocabulary. The combination of individual &lsquo;atoms&rsquo; of movement and sound leads to a complexity that must be practised until they can be performed with ease as an embodied interaction. We find the process of collaboration and its articulation as a dynamic interactive structure fascinating and enduring beyond the specific technologies employed. The terms meta-composition, composed instrument and composed character are used to describe the interactive structure of the piece.
Perturbing B&#x00E9;zier coefficients for best constrained degree reduction in the L2-norm
Authors: Jianmin Zheng, Guozhao Wang
Venue: Graphical Models (2003)

This paper first shows how the Bézier coefficients of a given degree n polynomial are perturbed so that it can be reduced to a degree m (> n) polynomial with the constraint that continuity of a prescribed order is preserved at the two endpoints. The perturbation vector, which consists of the perturbation coefficients, is determined by minimizing a weighted Euclidean norm. The optimal degree n - 1 approximation polynomial is explicitly given in Bézier form. Next the paper proves that the problem of finding a best L2-approximation over the interval [0, 1] for constrained degree reduction is equivalent to that of finding a minimum perturbation vector in a certain weighted Euclidean norm. The relevant weights are derived. This result is applied to computing the optimal constrained degree reduction of parametric Bézier curves in the L2-norm.
Deconstructing the Pioneer's Advantage: Examining Vintage Effects and Consumer Valuations of Quality and Variety
Authors: Jonathan D. Bohlmann, Peter N. Golder, Debanjan Mitra
Venue: Management Science (2002)

Several studies have demonstrated an order-of-entry effect on market share, suggesting that pioneers outperform later entrants. However, other research has pointed out the limitations of these studies and found evidence that many pioneers fail or have low market share. Given this background, the purpose of this research is to understand the conditions under which pioneers are more likely and also less likely to have an advantage. We propose a game-theoretic model that includes important sources of pioneer advantages as well as disadvantages. Specifically, we incorporate a pioneer advantage due to preemption in markets with heterogeneous tastes. In addition, we incorporate a potential pioneer disadvantage due to technology vintage effects, where later entrants utilizing improved technology can have lower costs and higher quality. The model allows us to evaluate the extent of vintage effects necessary to overcome a pioneer's advantage. Key relationships are found between the magnitude of the pioneer advantage or disadvantage and consumer valuations of product attributes (e.g., variety and quality). We empirically validate the model with vintage effect data in 36 product categories, and measures of consumer valuations of product variety and quality for 12 of these 36 categories. The results show that pioneers do better in product categories wherevariety is more important and worse in categories where productquality is more important. Pioneers in categories with high vintage effects are shown to have lower market shares and higher failure rates. Similar results appear when analyzing persistence of market leadership over time, further validating our model's major implications. We also present two case studies that illustrate key elements of the model.
Forward engineering and UML: from UML static models to Eiffel code
Authors: Liliana Favre, Liliana Martinez, Claudia Pereira
Venue: UML and the unified process (2003)

This chapter describes a reuse-based rigorous process to transform UML static models to object-oriented code. The bases of this approach are the GSBL00 algebraic language to cope with concepts of UML static models and the SpRelm model for defining structured collections of reusable components. We have defined a mapping between UML static models and GSBL00. The emphasis in this chapter is given to the last steps in the road from UML to code. EiffelTM is the language of choice in which we chose to demonstrate the feasibility of our approach. We analyze how to transform GSBL00 specifications into code. In particular, we show how to translate different kinds of UML associations to Eiffel. Also, we describe how to construct assertions from GSBL00 specifications. All of the proposed transformations can be automated; they allow traceability and can be integrated into the iterative and incremental software development processes supported by the existing UML CASE tools.
Interactive multimedia messaging service platform
Authors: Shen Jun, Yan Rong, Sun Pei, Song Song
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

An interactive multimedia messaging service platform and two demos are described in this paper.
GUI Ripping: Reverse Engineering of Graphical User Interfaces for Testing
Authors: Atif Memon, Ishan Banerjee, Adithya Nagarajan
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

Graphical user interfaces (GUIs) are important parts oftoday's software and their correct execution is required toensure the correctness of the overall software. A populartechnique to detect defects in GUIs is to test them by executingtest cases and checking the execution results. Testcases may either be created manually or generated automaticallyfrom a model of the GUI. While manual testingis unacceptably slow for many applications, our experiencewith GUI testing has shown that creating a model that canbe used for automated test case generation is difficult.We describe a new approach to reverse engineer a modelrepresented as structures called a GUI forest, event-flowgraphs and an integration tree directly from the executableGUI. We describe "GUI Ripping", a dynamic process inwhich the software's GUI is automatically "traversed" byopening all its windows and extracting all their widgets(GUI objects), properties, and values. The extracted informationis then verified by the test designer and used to automaticallygenerate test cases. We present algorithms for theripping process and describe their implementation in a toolsuite that operates on Java and Microsoft Windows' GUIs.We present results of case studies which show that ourapproach requires very little human intervention and is especiallyuseful for regression testing of software that is modifiedfrequently. We have successfully used the "GUI Ripper"in several large experiments and have made it availableas a downloadable tool.
Class-Based Decompressor Design for Compressed Instruction Memory in Embedded Processors
Authors: Shlomo Weiss, Shay Beren
Venue: IEEE Transactions on Computers (2003)

We introduce a new PLA-based decoder architecture for random-access runtime decompression of compressed instruction memory in embedded systems. The compression method employs class-based coding. The symbol codebook used for decompression is fully programmable; thus, good compression may be achieved by adapting the codebook to the symbol frequency statistics of the target binary program. We show that this new class-based decoder architecture can be extended to provide high throughput decompression.
Instruction Replication for Clustered Microarchitectures
Authors: Alex Aletà, Josep M. Codina, Antonio González, David Kaeli
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

This work presents a new compilation technique that usesinstruction replication in order to reduce the number ofcommunications executed on a clusteredmicroarchitecture. For such architectures, the need tocommunicate values between clusters can result in asignificant performance loss. Inter-clustercommunications can be reduced by selectively replicatingan appropriate set of instructions. However, instructionreplication must be done carefully since it may alsodegrade performance due to the increased contention itcan place on processor resources. The proposed schemeis built on top of a previously proposed state-of-the-artmodulo scheduling algorithm that effectively reducescommunications. Results show that the number ofcommunications can decrease using replication, whichresults in significant speed-ups. IPC is increased by 25%on average for a 4-cluster microarchitecture and by asmuch as 70% for selected programs.
Anonymous authentication scheme for XML security standard with Refreshable Tokens
Authors: Rie Shigetomi, Akira Otsuka, Hideki Imai
Venue: Proceedings of the 2003 ACM workshop on XML security (2003)

Anonymity is a highly desired feature in Internet transactions. On the other hand, unconditional anonymity may contain some traps. For instance, it may cause irresponsible, or even criminal, use of the Internet. Thus, it would be desirable to have revocable anonymity in our internet applications. In this work, we suggest an anonymous authentication scheme for WS-Security. Our scheme assures the user's anonymity but the server can check, and even reject without unveiling the user's identification the user's right for accessing a specific service. The main tools which we use to achieve our rejectable anonymous protocols are "Refreshable Tokens". Our scheme does not require any active trusted third party in contrast to previous works in the literature. However, in situations where the identity of a user suspect of malicious act is required, the server could be easily to deny the user's service.
Optimized Disjunctive Association Rules via Sampling
Authors: J. Elble, C. Heeren, L. Pitt
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

The problem of finding optimized support associationrules for a single numerical attribute, where the optimizedregion is a union of k disjoint intervals from the range ofthe attribute, is investigated. The first polynomial timealgorithm for the problem of finding such a region maximizingsupport and meeting a minimum cumulative confidencethreshold is given. Because the algorithm is notpractical, an ostensibly easier, more constrained versionof the problem is considered. Experiments demonstratethat the best extant algorithm for the constrained versionhas significant performance degradation on both a syntheticmodel of patterned data and on real world data sets.Running the algorithm on a small random sample is proposedas a means of obtaining near optimal results withhigh probability. Theoretical bounds on sufficient samplesize to achieve a given performance level are proved, andrapid convergence on synthetic and real-world data is validatedexperimentally.