ppxscal/embedding_network huggingface dataset:
Business Process Illustration: Supporting Experience-Grounded Validation of New Business Processes by Subject Matter Experts
Authors: Markus Stolze
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

In this experience report we present Business Process Illustration, a technique supporting experience-grounded validation of new business processes by subject matter experts. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Dialogue Mechanism for Public Argumentation Using Conversation Policies
Authors: Yuqing Tang, Simon Parsons
Venue: Argumentation in Multi-Agent Systems: Fifth International Workshop, ArgMAS 2008, Estoril, Portugal, May 12, 2008. Revised Selected and Invited Papers (2009)

In this paper, we propose a flexible dialogue mechanism through which a set of agents can establish a coherent set of public beliefs. Flexibility and coherence are achieved by decomposing the dialogue mechanism into two parts, a backbone protocol and a set of conversation policies. The backbone protocol maintains the set of arguments put forward by the agents, and each agent uses a pre-agreed argumentation theory to extract a set of public beliefs from this set of arguments. The flexibility is achieved by distributing the other functions of the dialogue mechanism among a set of conversation policies, some of which are public and some of which are private to each agent.
An XML-based language for DEVS components
Authors: Nicolas G. Meseth, Patrick Kirchhof, Thomas Witte
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

An XML-based language for simulation components (XLSC) is presented in this paper. The language is designed in a way that the resulting components comply with the DEVS formalism. The objective is to model the static structure of a component as well as its behavior (dynamic structure). For execution of XLSC, an interpreter is prototypically implemented in Java. The use of XLSC enables components to be exchangeable and to be used with any DEVS simulator regardless of its implementation language. Thereby, the interpreter acts as an interface between the model and the simulator as it can directly execute the component's functions.
Final Cut Pro Portable Genius
Authors: GeniusDV
Venue:  (2008)

This savvy Portable Guide shows you how to get the most from Final Cut Pro. Youll find cool and useful tips, full-color screenshots, and pages of easy-to-access shortcuts and tools that show you which editing technique is right for you, how to use Final Cut Pro as a sound and mixing tool, and the best ways to maximize the output of your final product.
The Rise of the Commodity Vectors
Authors: Satoshi Matsuoka
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

Commodity clusters revolutionized high performance computing in a fundamental way since its first inception, and now now dominate many of the world's premiere supercomputers on the Top500, growing to the scale of over 10,000 CPU cores and beyond. Still,"classical" specialized vector supercomputers still remain to be sold and facilitated, especially at high end of the market, largely due to the nature of some of the HPC workloads still requiring the computing power of vectors, in areas such as CFD, FEM with kernels such as FFT, characterized as mostly large-scale irregular sparse codes Finally, however, commoditization of vector computing is on the rise, lead by multimedia application requirements, and spurred many architectures to arise such as GPUs and the Cell processor. But various problems still remain by which we cannot claim with 100% confidence that commodity vectors are here to stay in the HPC space. Research and development has to be conducted at various degrees of intensity to utilize the new breed of commodity vector hardware to their fullest capabilities, just as various research were needed to harness the power and the scalability of commodity clusters. In the talk I will outline some of the details, and our recent research endeavors aimed at solving the various issues.
Fast computation of equispaced Pareto manifolds and Pareto fronts for multiobjective optimization problems
Authors: Victor Pereyra
Venue: Mathematics and Computers in Simulation (2009)

In this paper, we consider the problem of generating a well sampled discrete representation of the Pareto manifold or the Pareto front corresponding to the equilibrium points of a multi-objective optimization problem. We show how the introduction of simple additional constraints into a continuation procedure produces equispaced points in either of those two sets. Moreover, we describe in detail a novel algorithm for global continuation that requires two orders of magnitude less function evaluations than evolutionary algorithms commonly used to solve this problem. The performance of the methods is demonstrated on problems from the current literature.
Using ANP priorities with goal programming for revitalization strategies in historic transport: A case study of the Alishan Forest Railway
Authors: Yu-Hern Chang, Wann-Ming Wey, Hsiao-Yu Tseng
Venue: Expert Systems with Applications: An International Journal (2009)

The main purpose of this research was to solve a real-world, multi-criteria, revitalization strategies project selection problem for the historic Alishan Forest Railway in Taiwan by using fuzzy Delphi, analytic network process (ANP), and zero-one goal programming (ZOGP). This required identifying the most cost-beneficial projects for maximizing the net benefit to the public and allocating resources most efficiently. To evaluate different revitalization strategies, we used a hierarchical network model based on various factors, and we present the interactions of those factors. The proposed ANP model consists of a control hierarchy and a network of connections between the clusters of alternatives, actors, and criteria. The strategic criteria were included into the model to rate benefits (B), opportunities (O), costs (C), and risks (R). A synthesis of alternatives was finally obtained using rated BOCR. In this paper, we suggest an improved methodology, one that uses an integrated approach and reflects the interdependencies between the evaluation criteria and candidate projects. The management of the Alishan Forest Railway has implemented the processing system proposed by this research and suggested to the government the best alternative strategies.
Teaching mathematics for search using a tutorial style of delivery
Authors: Andrew Macfarlane
Venue: Information Retrieval (2009)

Understanding of mathematics is needed to underpin the process of search, either explicitly with Exact Match (Boolean logic, adjacency) or implicitly with Best match natural language search. In this paper we outline some pedagogical challenges in teaching mathematics for information retrieval (IR) to postgraduate information science students. The aim is to take these challenges either found by experience or in the literature, to identify both theoretical and practical ideas in order to improve the delivery of the material and positively affect the learning of the target audience by using a tutorial style of teaching. Results show that there is evidence to support the notion that a more pro-active style of teaching using tutorials yield benefits both in terms of assessment results and student satisfaction.
An industrial software engineering methodology supported by an automated environment
Authors: Michael S. Deutsch
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

In recent years, industry and government have sought to formalize software development by constructing automated environments that support the application of modern techniques and methodologies to the production of software. This paper describes the automated software development system being installed at Hughes Aircraft Company. This system is expected to be a major contributor to the orderly management of software development at Hughes. This software development system consists of integrated development techniques over the life cycle, a set of software tools, and a physical facility for software development and test. Structured methodologies such as structured analysis, structured design, and structured programming are supported by automated tools. The configuration of the software development facility consists of a host software development system, the target machines, and the user display terminals. Project planning and performance measurement are based on the rate charting technique and earned value assessment.
Achievement standards network (ASN): an application profile for mapping K-12 educational resources to achievement standards
Authors: Stuart A. Sutton, Diny Golder
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

This paper describes metadata development of an application profile for the National Science Digital Library (NSDL) Achievement Standards Network (ASN) in the United States. The ASN is a national repository of machine-readable achievement standards modeled in RDF that shape teaching and learning in the various states. We describe the nature of the ASN metadata and the various uses to which that metadata is applied including the alignment of the standards of one state to those of another and the correlation of those standards to educational resources in support of resource discovery and retrieval.
Graph transformations for object-oriented refinement
Authors: Liang Zhao, Xiaojian Liu, Zhiming Liu, Zongyan Qiu
Venue: Formal Aspects of Computing (2009)

An object-oriented program consists of a section of class declarations and a main method. The class declaration section represents the structure of an object-oriented program, that is the data, the classes and relations among them. The execution of the main method realizes the application by invoking methods of objects of the classes defined in the class declarations. Class declarations define the general properties of objects and how they collaborate with each other in realizing the application task programmed as the main method. Note that for one class declaration section, different main methods can be programmed for different applications, and this is an important feature of reuse in object-oriented programming. On the other hand, different class declaration sections may support the same applications, but these different class declaration sections can make significant difference with regards to understanding, reuse and maintainability of the applications. With a UML-like modeling language, the class declaration section of a program is represented as a class diagram, and the instances of the class diagram are represented by object diagrams, that form the state space of the program. In this paper, we define a class diagram and its object diagrams as directed labeled graphs, and investigate what changes in the class structure maintain the capability of providing functionalities (or services). We formalize such a structure change by the notion of structure refinement. A structure refinement is a transformation from one graph to another that preserves the capability of providing services, that is, the resulting class graph should be able to provide at least as many, and as good, services (in terms of functional refinement) as the original graph. We then develop a calculus of object-oriented refinement, as an extension to the classical theory of data refinement, in which the refinement rules are classified into four categories according to their natures and uses in object-oriented software design. The soundness of the calculus is proved and the completeness of the refinement rules of each category is established with regard to normal forms defined for object-oriented programs. These completeness results show the power of the simple refinement rules. The normal forms and the completeness results together capture the essence of polymorphism, dynamic method binding and object sharing by references in object-oriented computation.
Bankruptcy prediction modeling with hybrid case-based reasoning and genetic algorithms approach
Authors: Hyunchul Ahn, Kyoung-jae Kim
Venue: Applied Soft Computing (2009)

One of the most important research issues in finance is building effective corporate bankruptcy prediction models because they are essential for the risk management of financial institutions. Researchers have applied various data-driven approaches to enhance prediction performance including statistical and artificial intelligence techniques, and many of them have been proved to be useful. Case-based reasoning (CBR) is one of the most popular data-driven approaches because it is easy to apply, has no possibility of overfitting, and provides good explanation for the output. However, it has a critical limitation-its prediction performance is generally low. In this study, we propose a novel approach to enhance the prediction performance of CBR for the prediction of corporate bankruptcies. Our suggestion is the simultaneous optimization of feature weighting and the instance selection for CBR by using genetic algorithms (GAs). Our model can improve the prediction performance by referencing more relevant cases and eliminating noises. We apply our model to a real-world case. Experimental results show that the prediction accuracy of conventional CBR may be improved significantly by using our model. Our study suggests ways for financial institutions to build a bankruptcy prediction model which produces accurate results as well as good explanations for these results.
A Process Model of Actin Polymerisation
Authors: Luca Cardelli, Emmanuelle Caron, Philippa Gardner, Ozan Kahramanoğulları, Andrew Phillips
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Actin is the monomeric subunit of actin filaments which form one of the three major cytoskeletal networks in eukaryotic cells. Actin dynamics, be it the polymerisation of actin monomers into filaments or the reverse process, plays a key role in many cellular activities such as cell motility and phagocytosis. There is a growing number of experimental, theoretical and mathematical studies on the components of actin polymerisation and depolymerisation. However, it remains a challenge to develop compositional models of actin dynamics, e.g., by using differential equations. In this paper, we propose compositional process algebra models of actin polymerisation, and present a geometric representation of these models that allows to generate movies reflecting their dynamics.
A splitting technique of higher order for the Navier-Stokes equations
Authors: Jörg Frochte, Wilhelm Heinrichs
Venue: Journal of Computational and Applied Mathematics (2009)

This article presents a splitting technique for solving the time dependent incompressible Navier-Stokes equations. Using nested finite element spaces which can be interpreted as a postprocessing step the splitting method is of more than second order accuracy in time. The integration of adaptive methods in space and time in the splitting are discussed. In this algorithm, a gradient recovery technique is used to compute boundary conditions for the pressure and to achieve a higher convergence order for the gradient at different points of the algorithm. Results on the 'Flow around a cylinder's- and the 'Driven Cavity's-problem are presented.
Elastic Shape Models for Face Analysis Using Curvilinear Coordinates
Authors: A. Srivastava, C. Samir, S. H. Joshi, M. Daoudi
Venue: Journal of Mathematical Imaging and Vision (2009)

This paper studies the problem of analyzing variability in shapes of facial surfaces using a Riemannian framework, a fundamental approach that allows for joint matchings, comparisons, and deformations of faces under a chosen metric. The starting point is to impose a curvilinear coordinate system, named the Darcyan coordinate system, on facial surfaces; it is based on the level curves of the surface distance function measured from the tip of the nose. Each facial surface is now represented as an indexed collection of these level curves. The task of finding optimal deformations, or geodesic paths, between facial surfaces reduces to that of finding geodesics between level curves, which is accomplished using the theory of elastic shape analysis of 3D curves. The elastic framework allows for nonlinear matching between curves and between points across curves. The resulting geodesics between facial surfaces provide optimal elastic deformations between faces and an elastic metric for comparing facial shapes. We demonstrate this idea using examples from FSU face database.
Survey of Advanced CABAC Accelerator Architectures for Future Multimedia
Authors: Yahya Jan, Lech Jozwiak
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

The future high quality multimedia systems require efficient video coding algorithms and corresponding adaptive high-performance computational platforms. In this paper, we survey the hardware accelerator architectures for Context-based Adaptive Binary Arithmetic Coding (CABAC) of H.264/AVC. The purpose of the survey is to deliver a critical insight in the proposed solutions, and this way facilitate further research on accelerator architectures, architecture development methods and supporting EDA tools. The architectures are analyzed, classified and compared based on the core hardware acceleration concepts, algorithmic characteristics, video resolution support and performance parameters, and some promising design directions are discussed.
Intertwining synchronous and asynchronous communication to support collaborative learning--system design and evaluation
Authors: Andrea Kienle
Venue: Education and Information Technologies (2009)

This paper presents the design and evaluation of the CSCL-system KOLUMBUS 2 that integrates synchronous and asynchronous communication support and the joint work on material. The design is theory driven and is based on characteristics of collaborative learning, context-oriented communication theory and media synchronicity theory. The description of the design of the system follows a model that shows the interweavement of asynchronous and synchronous functionalities. The evaluation showed mixed acceptance: concerning the interweavement a successful technical solution with limitations in its usage was found. The technical functionalities were widely used but the usage also reveals potentials for improvements. Based on the description of the study and its results the paper ends with proposals for these improvements of the integration as well as for the redesign of the functionalities.
Generating requirements from enterprise analysis
Authors: David V. Kerner, Ashok Malhotra
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

BICS is an enterprise analysis methodology based on a normative, top-down model of the information requirements of a corporation. This paper provides an overview of BICS and introduces REQGEN, an extension of the BICS methodology that generates definitions for the data required to manage the organization and specifications for the processes required to maintain the data.
Multi Relational Rules Mining in Data Warehouse
Authors: Youdong Zhang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Multi relational rules mining is a new area of data mining research. There three kinds of algorithm currently. One is ILP approach, the second is AVL upgrading approach, and the last is mould a relational database into a single table to mine with traditionally single table technology. Due to the drawback of these methods, a new ideal to mine rules in data warehouse is proposed. The data schema constructing, primitive language and mining algorithm are analysis. The algorithm concerns the rules from one table to another only, but considers the single table’s rules. The experiments show it has a good accuracy due to utilize the relational information in data warehouse.
A stochastic-based efficient critical area extractor on OpenAccess platform
Authors: Bo-Zhou Chen, Hung-Ming Chen, Li-Da Huang, Po-Cheng Pan
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Due to inefficient calculation in current critical area analyzer, in this work we present a method of extracting critical area for short faults from the mask layout of an integrated circuit. The method is based on the concept of sampling framework and the geometry computation of critical area. By constructing the density table of layout, our weighted sampling approach can be more efficient, thus more suitable for the larger layout. The algorithm has been implemented on OpenAccess platform to allow efficient extraction of the critical area from an arbitrary mask layout. The results show that this method can reduce computation cost, and can still maintain the accuracy at the same time.
Reliable system design: models, metrics and design techniques
Authors: Subhasish Mitra, Ravishankar K. Iyer, Kishor Trivedi, James W. Tschanz
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Design of reliable systems meeting stringent quality, reliability, and availability requirements is becoming increasingly difficult in advanced technologies. The current design paradigm, which assumes that no gate or interconnect will ever operate incorrectly within the lifetime of a product, must change to cope with this situation. Future systems must be designed with built-in mechanisms for failure tolerance, prediction, detection and recovery during normal system operation. This tutorial will focus on models and metrics for designing reliable systems, algorithms and tools for modeling and evaluating such systems, will discuss a broad spectrum of techniques for building such systems with support for concurrent error detection, failure prediction, error correction, recovery, and self-repair. Complex interplay between power, performance and reliability requirements in future systems, and associated constraints will also be discussed.
A combined neural network and DEA for measuring efficiency of large scale datasets
Authors: Ali Emrouznejad, Estelle Shale
Venue: Computers and Industrial Engineering (2009)

Data Envelopment Analysis (DEA) is one of the most widely used methods in the measurement of the efficiency and productivity of Decision Making Units (DMUs). DEA for a large dataset with many inputs/outputs would require huge computer resources in terms of memory and CPU time. This paper proposes a neural network back-propagation Data Envelopment Analysis to address this problem for the very large scale datasets now emerging in practice. Neural network requirements for computer memory and CPU time are far less than that needed by conventional DEA methods and can therefore be a useful tool in measuring the efficiency of large datasets. Finally, the back-propagation DEA algorithm is applied to five large datasets and compared with the results obtained by conventional DEA.