ppxscal/embedding_network huggingface dataset:
Peridynamics via finite element analysis
Authors: Richard W. Macek, Stewart A. Silling
Venue: Finite Elements in Analysis and Design (2007)

Peridynamics is a recently developed theory of solid mechanics that replaces the partial differential equations of the classical continuum theory with integral equations. Since the integral equations remain valid in the presence of discontinuities such as cracks, the method has the potential to model fracture and damage with great generality and without the complications of mathematical singularities that plague conventional continuum approaches. Although a discretized form of the peridynamic integral equations has been implemented in a meshless code called EMU, the objective of the present paper is to describe how the peridynamic model can also be implemented in a conventional finite element analysis (FEA) code using truss elements. Since FEA is arguably the most widely used tool for structural analysis, this implementation may hasten the verification of peridynamics and significantly broaden the range of problems that the practicing analyst might attempt. Also, the present work demonstrates that different subregions of a model can be solved with either the classical partial differential equations or the peridynamic equations in the same calculation thus combining the efficiency of FEA with the generality of peridynamics. Several example problems show the equivalency of the FEA and the meshless peridynamic approach as well as demonstrate the utility and robustness of the method for problems involving fracture, damage and penetration.
Getting Rid of the OR-Join in Business Process Models
Authors: J. Mendling, B. F. van Dongen, W. M. P. van der Aalst
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

In practice, the development of process-aware informa- tion systems suffers from a gap between conceptual business process models and executable workflow specifications. Be- cause of this gap, conceptual models are hardly reused as execution templates. In this paper, we address the noto- rious "OR-join problem" that is partly responsible for this gap. At the conceptual level people frequently use OR-joins. However, given their non-local semantics, OR-joins cannot be mapped easily onto executable languages. In particular, we present a new approach to map a conceptual process model with OR-joins (expressed in terms of an EPC) onto an executable model without OR-joins (expressed in terms of a Petri net). Although we used an EPC process model as a run- ning example, the approach is equally applicable to other process modeling languages that offer OR-joins as (e.g. BPMN). Moreover, the resulting Petri net can be mapped onto other execution languages such as BPEL. All of this has been implemented in the context of the ProM frame- work.
Add Semantic Role to Dependency Structure Language Model for Topic Detection and Tracking
Authors: Jing Qiu, LeJian Liao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In this paper, an idea of adding semantic role to the dependency structure language model is proposed. Firstly, the dependency structure language model for topic detection and tracking is presented. Then we introduce the method to determine the semantic role for the constituents of a sentence. Finally, we add the semantic role to the dependency structure language model. Compare the verbs of the sentences in the stories with a list of verbs related with the verb of the topic. Then, annotate the verbs with semantic roles. This can enable us establish a relation between topics and semantic roles. So, only stories whose sentences containing the right semantic roles are selected. We propose using this semantic information as an extension of the dependency structure language model in order to reduce the number of stories retrieved by the system, and get a high precision in topic detection and tracking.
Multiple-Valued Logic its Status and its Future
Authors: S. L. Hurst
Venue: IEEE Transactions on Computers (1984)

Multiple-valued logic, in which the number of discrete logic levels is not confined to two, has been the subject of much research over many years. The practical objective of this work has been to increase the information content of the digital signals in a system to a higher value than that provided by binary operation. In this tutorial/survey paper we will review the historical developments in this field, both in circuit realizations and in methods of handling multiple-valued design data, and consider the present state-of-the-art and future expectations.
A Dynamic Logic for Deductive Verification of Concurrent Programs
Authors: Bernhard Beckert, Vladimir Klebanov
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

In this paper, we present an approach aiming at full functional deductive verification of concurrent Java programs, based on symbolic execution. We define a Dynamic Logic and a deductive verification calculus for a restricted fragment of Java with native concurrency primitives. Even though we cannot yet deal with non-atomic loops, employing the technique of symmetry reduction allows us to verify unbounded systems. The calculus has been implemented within the KeYsystem, and we demonstrate it by verifying a central method of the StringBuffer class from the Java standard library.
Designing interactive music mixing applications for mobile devices
Authors: Juha Arrasvuori, Jukka Holm
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

Mobile devices are a potential platform for interactive music mixing applications for a large target audience. In this paper, the authors discuss the development of four such application concepts. The concepts were implemented as software prototypes for PDAs and mobile phones. The authors reflect on the design decisions and the technical obstacles they encountered. Solutions related to the user interfaces and creating content for interactive music mixing applications are also discussed.
Multi-agent Simulation on Day-to-Day Route Choice Behavior
Authors: Tian-Liang Liu, Hai-Jun Huang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

The day-to-day route choice is a non-cooperative game process with many participants during a long time period. The multi-agent simulation system SeSAm is used to investigate two different route update rules designed for traffic information release and unrelease respectively. Simulation results on a small grid network show that the rule under information release can make route flow evolve to the logit-based stochastic user equilibrium faster than that under information unrelease. However, the flow pattern may be unstable if travelers put undue compliance on the released information. A stable flow pattern can also be achieved only relying on travelers' perceived experience and learning ability, but the evolution is rather slow. It is thus suggested that the traffic information should be timely released to public meanwhile utilized properly.
An optimization algorithm for the inventory routing problem with continuous moves
Authors: Martin Savelsbergh, Jin-Hwa Song
Venue: Computers and Operations Research (2008)

The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all be reached with out-and-back trips. Unfortunately, this is not always the reality. We focus on the inventory routing problem with continuous moves, which incorporates two important real-life complexities: limited product availabilities at facilities and customers that cannot be served using out-and-back tours. We need to design delivery tours spanning several days, covering huge geographic areas, and involving product pickups at different facilities. We develop an integer programming based optimization algorithm capable of solving small to medium size instances. This optimization algorithm is embedded in local search procedure to improve solutions produced by a randomized greedy heuristic. We demonstrate the effectiveness of this approach in an extensive computational study.
Metadata Extraction from Chinese Research Papers Based on Conditional Random Fields
Authors: Jiangde Yu, Xiaozhong Fan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

With the appearance of more and more research papers on the Internet, it becomes more and more important to accurately extract the metadata from paper header and citation of research papers. In this paper, a method based on Conditional Random Fields (CRFs) is proposed for automatic extraction of metadata from Chinese research papers. The key of this algorithm is parameter estimation and feature selection. We employ L-BFGS algorithm for parameter estimation. We analyze three classes of features and perform feature induction. In the processing the method makes use of the format information of list separators and special-labels to segment text, and then combines CRFs for metadata extraction from papers. We compare the performance of the metadata extracting on English and Chinese datasets using CRFs, also compare the performance of the different model: CRFs and hidden Markov model (HMM) on Chinese datasets. Experimental results show that CRFs perform better than HMM.
New Literature
Venue: Computer (1976)

Datapro Digest. A bimonthly newsletter that provides a brief review of new information services offered by Datapro Research Corporation is available by writing the company at 1805 Underwood Blvd., Delran, NJ 08075. 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
An improved method for Daugman's iris localization algorithm
Authors: Xinying Ren, Zhiyong Peng, Qingning Zeng, Chaonan Peng, Jianhua Zhang, Shuicai Wu, Yanjun Zeng
Venue: Computers in Biology and Medicine (2008)

Computer-based automatic recognition of persons for security reasons is highly desirable. Iris patterns provide an opportunity for separation of individuals to an extent that would avoid false positives and negatives. The current standard for this science is Daugman's iris localization algorithm. Part of the time required for analysis and comparison with other images relates to eyelid and eyelash positioning and length. We sought to remove the upper and lower eyelids and eyelashes to determine if separation of individuals could still be attained. Our experiments suggest separation can be achieved as effectively and more quickly by removing distracting and variable features while retaining enough stable factors in the iris to enable accurate identification.
Supporting Product Derivation by Adapting and Augmenting Variability Models
Authors: Rick Rabiser, Paul Grunbacher, Deepak Dhungana
Venue: Proceedings of the 11th International Software Product Line Conference (2007)

Product derivation is the process of constructing products from the core assets in a product line. Guidance and support are needed to increase efficiency and to deal with the complexity of product derivation. Research has, however, devoted comparatively little attention to this process. In this paper we describe an approach for supporting product derivation. We show that variability models need to be prepared for concrete projects before they can be effectively utilized in the derivation process. Project-specific information and sales knowledge should be added and irrelevant variability should be pruned. We also present tool support and illustrate the approach using examples from ongoing research collaboration.
Language Features for Access Control
Authors: P. Ancilotti
Venue: IEEE Transactions on Software Engineering (1983)

The properties of a capability-based protection mechanism to be incorporated in a language for concurrent programming are presented. The protection mechanism is first abstractly characterized in terms of a protection model; the components of the protection mechanism, that is, the objects, subjects, and protection rules which govern the accessing to the objects by the subjects, are defined.
An Algorithm for 3D Image Segmentation
Authors: Ding Zhi, Dong Yu-ning
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

We propose a new 3D image segmentation method based on prediction, block-matching and partial 3D constraint in this paper. The algorithm only needs to set a few key points in the first image. We use intensity information and block-matching to optimize the initial condition, and consider the 3D object's characteristics at the same time. By using the partial 3D constraints we can get the result of 2D and 3D smoothness. Experimental results validate its usefulness in 3D image segmentation.
A Study of the Physical Structure of Algorithms
Authors: S. H. Zweben
Venue: IEEE Transactions on Software Engineering (1977)

A theory of the structural composition of an algoithm is presented which allows the frequencies of occurrence of the individual operators and operands to be estimated. It provides justification for some recent hypotheses which suggest certain functional relationships between properties of algorithms.
Modelling student behavior in algorithm simulation exercises with code mutation
Authors: Otto Seppälä
Venue: Proceedings of the 6th Baltic Sea conference on Computing education research: Koli Calling 2006 (2006)

Visual algorithm simulation exercises test student knowledge of different algorithms by making them trace the steps of how a given algorithm would have manipulated a set of input data. When assessing such exercises the main difference between a human assessor and an automated assessment procedure is the human ability to adapt to the possible errors made by the student. A human assessor can continue past the point where the model solution and the student solution deviate and make a hypothesis on the source of the error based on the student's answer. Our goal is to bring some of that ability to automated assessment. We anticipate that providing better feedback on student errors might help reduce persistent misconceptions. The method described tries to automatically recreate erroneous student behavior by introducing a set of code mutations on the original algorithm code. The available mutations correspond to different careless errors and misconceptions held by the student. The results show that such automatically generated "misconceived" algorithms can explain much of the student behavior found in erroneous solutions to the exercise. Non-systematic mutations can also be used to simulate slips which greatly reduces the number of erroneous solutions without explanations.
Improving the Bandwidth Sharing in IEEE 802.11
Authors: Yassine Chetoui, Nizar Bouabdallah, Jalel Ben Othman
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

In this paper, we propose a new solution to cope with the unfairness limitations of the Distributed Coordination Function (DCF) algorithm. Our solution is based on multiple backoff windows principle. We demonstrate through simulations the efficiency of our proposal that enables fair bandwidth sharing and increase total network throughput.
Synthesis and bioconjugation of gold nanoparticles as potential molecular probes for light-based imaging techniques
Authors: Raja Gopal Rayavarapu, Wilma Petersen, Constantin Ungureanu, Janine N. Post, Ton G. van Leeuwen, Srirang Manohar
Venue: Journal of Biomedical Imaging (2007)

We have synthesized and characterized gold nanoparticles (spheres and rods) with optical extinction bands within the "optical imaging window." The intense plasmon resonant driven absorption and scattering peaks of these nanoparticles make them suitable as contrast agents for optical imaging techniques. Further, we have conjugated these gold nanoparticles to a mouse monoclonal antibody specific to HER2 overexpressing SKBR3 breast carcinoma cells. The bioconjugation protocol uses noncovalent modes of binding based on a combination of electrostatic and hydrophobic interactions of the antibody and the gold surface. We discuss various aspects of the synthesis and bioconjugation protocols and the characterization results of the functionalized nanoparticles. Some proposed applications of these potential molecular probes in the field of biomedical imaging are also discussed.
The Constrained-Input Problem
Authors: F. M. Brown
Venue: IEEE Transactions on Computers (1975)

Given a combinational output function f and an input constraint f = 0, there is a set G( f, f) of output functions equivalent to f with respect to f. A function belongs to G( f, f), that is, provided its evaluations agree with those of f for all argument combinations satisfying the constraint f = 0. We define the constrained-input problem as that of generating G( f, f), given f and f. A general solution for this problem is developed. Applications to the "don't-care" problem and to translator synthesis are discussed.
Automated Information Extraction from Empirical Software Engineering Literature: Is that possible?
Authors: Daniela Cruzes, Manoel Mendonça, Victor Basili, Forrest Shull, Mario Jino
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

The number of scientific publications is constantly increasing, and the results published on Empirical Software Engineering are growing even faster. Some software engineering publishers have begun to collaborate with research groups to make available repositories of software engineering empirical data. However, these initiatives are limited due to data ownership and privacy issues. As a result, many researchers in the area have adopted systematic reviews as a mean to extract empirical evidence from published material. Systematic reviews are labor intensive and costly. In this paper, we argue that the use of Information Extraction Tools can support systematic reviews and significantly speed up the creation of repositories of SE empirical evidence.
Reducing the Overhead of Real-Time Operating System through Reconfigurable Hardware
Authors: Moonvin Song, Sang Hoon Hong, Yunmo Chung
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

This paper demonstrates the benefits of hardwiring two of the main RTOS functionalities for multitasking environment. They are context switching and software interrupt processing operations. In particular, the paper proposes reconfiguring the FPGA which includes the proposed one time reconfigurable CPU and RTOS hardware, optimized for a given application by tailoring the entire hardware around the particular tasks involved. As a demonstration, the proposed RTOS hardware was designed and tested on a multichannel speaker system application to yield 60% performance increase over the conventional softwarebased RTOS.
Perceptual-based region extraction from hand drawn sketches
Authors: Rattapoom Waranusast
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Pen-based computing devices have become more popular and more important, because it facilitates a natural way of input to users. To develop pen-based systems, automatic interpretation of sketches is crucial. However, this task is sensitive to drawing styles. This paper proposes a stroke grouping method based on Gestalt theory. The proposed algorithm group strokes into regions, each stroke is split into smaller stroke segments according to its corners and junctions. Then, for every stroke segments that can form closed loops, all possible regions are searched. Applying the notion of law of continuity in Gestalt theory to a set of all possible regions, scores of good continuity and convexity of all regions can be computed. The region with the best score is stored and extracted from the sketch. This iterative process is repeated until no stroke segments are left in the set of closed-loop segments. The algorithm implemented and tested on a tablet PC showed good results.
Personal Development Systems for the Professional Programmer
Authors: S. Gutz
Venue: Computer (1981)

Recent advances in hardware technology-VLSI, graphics, voice, powerful personal computers-can be brought to bear on problems of software development.
BFCD: A Component Coordination Method based on Grid Workflow Engine
Authors: Yang Qin, Chen Jun-Liang, Meng Xiang-Wu, Li Li
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

The development of grid technology and the springing up of services oriented computing bring both opportunity and challenge to the field oriented software development. The component composition technology researches based on business flow have not yet fully developed, especially in the grid environment. This paper brings forward a new method which separates the execution model of an underlying workflow engine from definition of the components of the workflow. Through this method, each component corresponds to a so called component descriptor which is used by the business developer to describe business flow, and all the details such as the coordination between the components and the network, and the cooperation among the components are taken care of by the workflow engine. So this method can offer convenience to the business developer, speed up business implementation, and elevate company's competence.
Spoken Handwriting Verification Using Statistical Models
Authors: A. Humm, R. Ingold, J. Hennebert
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

We are proposing a novel and efficient user authenti- cation system using combined acquisition of online hand- writing and speech signals. In our approach, signals are recorded by asking the user to say what she or he is simulta- neously writing. This methodology has the clear advantage of acquiring two sources of biometric information at no ex- tra cost in terms of time or inconvenience. We have built a straightforward verification system to model these sig- nals using statistical models. It is composed of two Gaus- sian Mixture Models (GMMs) sub-systems that takes as in- put features extracted from the pen and voice signals. The system is evaluated on MyIdea, a realistic multimodal bio- metric database. Results show that the use of both speech and handwriting modalities outperforms significantly these modalities used alone. We also report on the evaluations of different training algorithms and fusion strategies.
Modeling object states and behaviors using a state action manager
Authors: Gunther Palfinger
Venue: Crossroads (2007)

This design pattern is an extension of the well-known state pattern [2], which allows an object to change its behavior depending on the internal state of the object. The behavior is defined by events, whose transformation to actions depends on the object state. This pattern introduces a way to manage state actions.
Variation in approaches to lab practical classes among computing academics
Authors: Simon, Michael de Raadt, Anne Venables
Venue: Informatics in education (2007)

As part of a wide-ranging phenomenographic study of computing teachers, we explored their varying understandings of the lab practical class and discovered four distinct categories of description of lab practicals. We consider which of these categories appear comparable with nonlecture classes in other disciplines, and which appear distinctive to computing. An awareness of this range of approaches to conducting practical lab classes will better enable academics to consider which is best suited to their own purposes when designing courses.