ppxscal/embedding_network huggingface dataset:
A MAP/G/1 Queue with Negative Customers
Authors: Quan-Lin Li, Yiqiang Q. Zhao
Venue: Queueing Systems: Theory and Applications (2004)

In this paper, we consider a MAP/G/1 queue with MAP arrivals of negative customers, where there are two types of service times and two classes of removal rules: the RCA and RCH, as introduced in section 2. We provide an approach for analyzing the system. This approach is based on the classical supplementary variable method, combined with the matrix-analytic method and the censoring technique. By using this approach, we are able to relate the boundary conditions of the system of differential equations to a Markov chain of GI/G/1 type or a Markov renewal process of GI/G/1 type. This leads to a solution of the boundary equations, which is crucial for solving the system of differential equations. We also provide expressions for the distributions of stationary queue length and virtual sojourn time, and the Laplace transform of the busy period. Moreover, we provide an analysis for the asymptotics of the stationary queue length of the MAP/G/1 queues with and without negative customers.
Adaptive Grid Service Flow Management: Framework and Model
Authors: Yu Long, Herman Lam, Stanley Y. W. Su
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

Grid computing provides the basic software infrastructure forintegrating geographically distributed resources and services throughstandardized Grid services. One of the key challenges to enable thebroader use of Grid services beyond the domain of scientificcomputing is the ability to perform complex tasks that require themodeling and coordination of the enactment of a number ofdistributed Grid services. Workflow technology is a good candidatefor supporting Grid service flow. However, traditional workflow isstatic, thus unable to exploit the dynamic information available in theGrid and respond to the dynamic nature of the Grid. In this paper, wepresent an adaptive framework that provides adaptive management ofGrid service flows. The framework is based on an Adaptive GridService Flow Model and is supported by an Event-Trigger-Rule(ETR) technology that will be used to trigger rules in a distributedfashion to adapt a Grid service flow to the dynamic Grid environmentand the changing requirements of a Grid application.
Extracting Measurements from Existing Photographs of Ancient Pottery
Authors: Geoff Wyvill, Dimitri Anson
Venue: Proceedings of the Computer Graphics International (2004)

By using known symmetry of an artifact we canextract accurate 3D measurements from a singlephotograph. This is done by combining human abilityto identify features with an automatic calculation thatdiscovers and reverses the perspective projection of theoriginal camera. The user fits ellipses on a computerimage to features known to be circles in the original3D space. The procedure yields measurementsaccurate to better than 1%.
Constructivist or instructivist: pedagogical concepts practically applied to a computer learning environment
Authors: Peter McKenna, Ben Laycock
Venue: ACM SIGCSE Bulletin (2004)

This paper discusses an innovative use of information technology in supporting the learning and teaching of sampling and quantisation within the Multimedia Computing curriculum. Three parallel on-line learning resources were developed to teach the principles of sampling to Multimedia Computing undergraduates: one highly interactive Flash artefact was developed on the basis of constructivist principles; a second drill-based html resource followed instructivist principles; and a third combined the two strategies. This paper reports the practical and conceptual exploration of what it means to take a constructivist or instructivist, or mixed approach to the design of learning software.All three resources were tested with distinctive groups of students in order to explore and contrast the relative short-term benefits of the different pedagogical approaches to learning software development. The results indicated that a combined constructivist resource offered the learner a deeper knowledge of waveform sampling; the question of longer-term retention and transferable understanding can only be answered by means of longitudinal research.
Analyzing Geographic Patterns of Disease Incidence: Rates of Late-Stage Colorectal Cancer in Iowa
Authors: Gerard Rushton, Ika Peleg, Aniruddha Banerjee, Geoffrey Smith, Michele West
Venue: Journal of Medical Systems (2004)

This study, using geocodes of the locations of residence of newly diagnosed colorectal cancer patients from the Iowa Cancer Registry, computed continuous spatial patterns of late-stage rates of colorectal cancer in Iowa. Variations in rates in intrahospital service regions were as great as interhospital service regions, shown by analysis of variance tests. Some of the spatial variations observed could be explained, using a general linear regression model on individual-level data, by spatial variations in attributes of individuals and their relationships to health resources. We show how this source of variation can be removed from the original map leaving a new map showing the remaining variation in late-stage rate not explained by these relationships. We argue that it would be more appropriate to organize prevention and control activities targeted at the areas with higher than expected late-stage rates shown on this map. The originality of this approach is in the integration of geocoded data from a cancer registry with methods of spatial analysis that provide considerable geographic detail in the cancer rate while controlling for rate stabilization and reliability due to the small number problem.
Advanced automatic generation scheme of prestressing tendons for efficient FE analysis of PSC shell structures
Authors: Byung Hwan Oh, Se Jin Jeon
Venue: Finite Elements in Analysis and Design (2004)

In finite element analysis of the prestressed concrete (PSC) shell structures, preparation of the tendon data including the intersection points with the shell elements is very time-consuming. In this respect, automatic generation scheme of these points can be very effective. The purpose of this study is to propose an efficient method that can improve the existing automatic generation algorithm of the tendon data for the shell elements. Here, some useful techniques are proposed that can accelerate the procedure and overcome cases of singularity. Numerical examples are presented to verify the enhanced speed as well as the accuracy of the proposed scheme in comparison with the previous algorithms.
The Consistency of Task-Based Authorization Constraints in Workflow Systems
Authors: Kaijun Tan, Jason Crampton, Carl A. Gunter
Venue: Proceedings of the 17th IEEE workshop on Computer Security Foundations (2004)

Workflow management systems (WFMSs) have attracteda lot of interest both in academia and the business community.A workflow consists of a collection of tasks that areorganized to facilitate some business process specification.To simplify the complexity of security administration, it iscommon to use role-based access control (RBAC) to grantauthorization to roles and users. Typically, security policiesare expressed as constraints on users, roles, tasks and theworkflow itself. A workflow system can become very complexand involve several organizations or different units ofan organization, thus the number of security policies may bevery large and their interactions very complex. It is clearlyimportant to know whether the existence of such constraintswill prevent certain instances of the workflow from completing.Unfortunately, no existing constraint models have consideredthis problem satisfactorily.In this paper we define a model for constrained workflowsystems that includes local and global cardinality constraints,separation of duty constraints and binding of dutyconstraints. We define the notion of a workflow specificationand of a constrained workflow authorization schema.Our main result is to establish necessary and sufficient conditionsfor the set of constraints that ensure a sound constrainedworkflow authorization schema, that is, for anyuser or any role who are authorized to a task, there is atleast one complete workflow instance when this user or thisrole executes this task.
VIsualization for HPC Data - Large Terrain Model
Authors: Bo-Yin Li, Horng-Shyang Liao, Charlie H. Chang, San-Liang Chu
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

Interactive navigation of large terrain data with high-resolution aerial photographic image has been a challenging problem. In this paper, we intend to conduct visual simulation on large image and geometric data, and create a realistic real-time navigation. We propose the level-of-detail(LOD) modeling with quad-tree[Large Scale Terrain Visualization Using The Re-stricted Quadtree Triangulation] to speed up the large terrain mesh rendering and using tiled texture[SIGGRAPH'99 coursenotes: Advanced Graphics Programming Techniques Using OpenGL, 1999] to display the detail of the aerial photographic image in real-time rendering. On geometric data, we use LOD and dike structure to provide blocks of meshes with different levels of detail, and remove the possible artifacts and cracks. In respect to the image data, the high-resolution aerial photographic images are divided into tiles, and every tile will be pre-processed into multi-resolution image data similar to the geometric LOD described above.
Computing the Writhing Number of a Polygonal Knot
Authors: Pankaj K. Agarwal, Herbert Edelsbrunner, Yusu Wang
Venue: Discrete Computational Geometry (2004)

The writhing number measures the global geometry of a closed space curve or knot. We show that this measure is related to the average winding number of its Gauss map. Using this relationship, we give an algorithm for computing the writhing number for a polygonal knot with n edges in time roughly proportional to n1.6. We also implement a different, simple algorithm and provide experimental evidence for its practical efficiency.
On the Optimisation of Reed-Muller Expressions
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

The choice of a set of basis functions withwhich to represent Reed-Muller canonical formsmakes less and less difference, on average, tothe efficiency, as measured by the number ofnon-zero terms, in which they can be expressed,as the number of variables in the functionincreases. This is because the possible efficiencygain itself declines exponentially in the generalcase, independently of the basis used. Weexplain why this is so, and using an integratedset of software tools, including a geneticalgorithm, we provide supporting evidence ofthe phenomenon.
An approach to testing specifications
Authors: C. Jard, G. v. Bochmann
Venue: Proceedings of the symposium on High-level debugging (1983)

An approach to testing the consistency of specifications is explored, which is applicable to the design validation of communication protocols and other cases of step-wise refinement. In this approach, a testing module compares a trace of interactions obtained from an execution of the refined specification (e. g. the protocol specification) with the reference specification (e. g. the communication service specification). Non-determinism in reference specifications presents certain problems. Using an extended finite state transition model for the specifications, a strategy for limiting the amount of non-determinacy is presented. An automated method for constructing a testing module for a given reference specification is discussed. Experience with the application of this testing approach to the design of a Transport protocol and a distributed mutual exclusion algorithm is described.
Computational Auditory Scene Analysis and Its Application to Robot Audition
Authors: Hiroshi G. Okuno, Tetsuya Ogata, Kazunori Komatani, Kazuhiro Nakadai
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

We are engaged in research on computational auditoryscene analysis to attain sophisticated robot (computer) humaninteraction by recognizing auditory awareness. Theobjective of our research is the understanding of an arbitrarysound mixture including non-speech sounds and musicas well as voiced speech, obtained by robotýs ears (ormicrophones embedded in the robot). The main issues aresound source localization, separation, and recognition atsignal processing levels, and signal-to-symbol transformationat the interface level to symbol processing levels. Thelatter is critical in developmental communication and weare developing an automatic onomatopoeia recognition system.This paper overviews our activities in robot audition,in particular, active direction-pass filter (ADPF) that separatessounds originating from a specific direction by integratingsound source localization and visual processing.ADPF is implemented on three kinds of robots anddemonstrates separating and recognizing three simultaneousspeeches with a pair of microphones.
Multiple Blocking Sets in PG(n, q), n > 3
Authors: János Barát, Leo Storme
Venue: Designs, Codes and Cryptography (2004)

This article discusses minimal s-fold blocking sets B in PG (n, q), q = ph, p prime, q > 661, n > 3, of size |B| > sq + cp q2/3 - (s - 1) (s - 2)/2 (s > min (cp q1/6, q1/4/2)). It is shown that these s-fold blocking sets contain the disjoint union of a collection of s lines and/or Baer subplanes. To obtain these results, we extend results of Blokhuis&ndash;Storme&ndash;Sz&ouml;nyi on s-fold blocking sets in PG(2, q) to s-fold blocking sets having points to which a multiplicity is given. Then the results in PG(n, q), n &ge; 3, are obtained using projection arguments. The results of this article also improve results of Hamada and Helleseth on codes meeting the Griesmer bound.
GEMLCA: Grid Execution Management for Legacy Code Architecture Design
Authors: T. Delaitre, A. Goyeneche, P. Kacsuk, T. Kiss, G. Z. Terstyanszky, S. C. Winter
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

The Grid Execution Management for Legacy Code Architecture (GEMLCA) describes a solution for exposing and executing legacy applications through an OGSI Grid Service. This architecture has been introduced in a previous paper by the same authors where the general concept was demonstrated by creating an OGSI/GT3 version of the MadCity traffic simulator. In this paper, the class structure of the architecture is described presenting each component and describing the relationships between them. Also, the current architecture implementation is evaluated through test results gained by running the MadCity traffic simulator as a C/PVM legacy application.
A reference ontology for biomedical informatics: the foundational model of anatomy
Authors: Cornelius Rosse, José L. V. Mejino,  Jr.
Venue: Journal of Biomedical Informatics (2003)

The Foundational Model of Anatomy (FMA), initially developed as an enhancement of the anatomical content of UMLS, is a domain ontology of the concepts and relationships that pertain to the structural organization of the human body. It encompasses the material objects from the molecular to the macroscopic levels that constitute the body and associates with them nonmaterial entities (spaces, surfaces, lines, and points) required for describing structural relationships. The disciplined modeling approach employed for the development of the FMA relies on a set of declared principles, high level schemes, Aristotelian definitions and a frame-based authoring environment. We propose the FMA as a reference ontology in biomedical informatics for correlating different views of anatomy, aligning existing and emerging ontologies in bioinformatics ontologies and providing a structure-based template for representing biological functions.
Balanced graph partitioning
Authors: Konstantin Andreev, Harald Räcke
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

In this paper we consider the problem of (k, υ)-balanced graph partitioning - dividing the vertices of a graph into k almost equal size components (each of size less than υ • n<over>k) so that the capacity of edges between different components is minimized. This problem is a natural generalization of several other problems such as minimum bisection, which is the (2,1)-balanced partitioning problem. We present a bicriteria polynomial time approximation algorithm with an O(log2n)-approximation for any constant υ > 1. For υ = 1 we show that no polytime approximation algorithm can guarantee a finite approximation ratio unless P=NP. Previous work has only considered the (k, υ)-balanced partitioning problem for υ ≥ 2.
A sequential-design metamodeling strategy for simulation optimization
Authors: Anthony C. Keys, Loren Paul Rees
Venue: Computers and Operations Research (2004)

This paper examines the feasibility and worthiness of a sequential simulation optimization strategy using nonparametric metamodeling. Incorporating notions advanced in the nonparametric statistics literature, the procedure starts with a uniform grid of points, and then adds points based on the solution of a mathematical programming problem involving quantiles of the squared second derivative of a thin-plate spline metamodel. Termination is reached based on two user-specified criteria.A feasibility study is conducted, generating 21,000 nonparametric metamodels to fit seven different, basic simulation surfaces. The appropriateness of metamodel fits is judged using recently published criteria. It is concluded that the nonparametric thin-plate spline sequential procedure faithfully reproduces the test case response surfaces and terminates reasonably. However, it is also seen that misleading results may be obtained in systems heavily constrained by budget, and that splines may do a poor job fitting plateaus due to their inherent predisposition to "create ripples."
Innovation Diffusion: Predicting Success of System Development
Authors: Alan Thomson, Mandy Haggith, Ravi Prabhu
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

To guide technology transfer, a simulation model of the innovation diffusion process is developed in which the five attributes of an innovation (relative advantage, compatibility, complexity, triability and observability) interact with adopter characteristics. These attributes are combined into a measure of innovation "fitness" to modify adoption rate.A measure of "exposure" is also developed to integrate time, communication channels and prior adoption to predict adoption rate.Behavior of the simulation is explored in relation to sparse data sets, especially in the field of information technology.
Learning Ensembles from Bites: A Scalable and Accurate Approach
Authors: Nitesh V. Chawla, Lawrence O. Hall, Kevin W. Bowyer, W. Philip Kegelmeyer
Venue: The Journal of Machine Learning Research (2004)

Bagging and boosting are two popular ensemble methods that typically achieve better accuracy than a single classifier. These techniques have limitations on massive data sets, because the size of the data set can be a bottleneck. Voting many classifiers built on small subsets of data ("pasting small votes") is a promising approach for learning from massive data sets, one that can utilize the power of boosting and bagging. We propose a framework for building hundreds or thousands of such classifiers on small subsets of data in a distributed environment. Experiments show this approach is fast, accurate, and scalable.
An equation concerning the Smarandache LCM function
Authors: Maohua Le
Venue: Smarandache Notions Journal (2004)

In this paper we completely solve an open problem concerning the Smarandache LCM function.
Proceedings of the symposium on High-level debugging
Venue: Foundations of Software Engineering (1983)

It has been my pleasure to serve as General Chairman of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on High-Level Debugging, which was held at the Asilomar Conference Center in Pacific Grove, California, on March 21-23, 1983. The symposium was one in a continuing series of Software Engineering Symposia sponsored by ACM.The symposium was limited to approximately 90 attendees; roughly twice that number indicated an interest in attending. Attendees were chosen on the basis of position statements submitted to the program committee. The attendees came from Canada, China, France, Germany, Italy, Scandinavia, the United Kingdom, and all regions of the United States.Publication of these proceedings substantially increases the literature in debugging. To my knowledge, this is the first symposium on debugging since the Courant Symposium in 1970. Many new issues and many new approaches to old issues are reported here.These proceedings contain session summaries and papers submitted by the participants. They constitute the formal record of the symposium. The informal discussion, the live and videotaped demonstrations of debugging tools, and the spirit of collegiality among the participants were important aspects of the symposium that are not recorded here.The Program Committee met on November 8, 1982, to organize the Symposium and to select participants. One hundred twenty submissions (representing one hundred sixty people) were received, numbering over eleven hundred pages of material. To maintain the workshop character of the symposium, only half of these could be accommodated.The submissions fell into three groups: position statements (60%), working papers (30%), and research abstracts (10%). The proceedings contains the revised papers and abstracts of all invited participants; the position statements are not included. Versions of several of the papers have been submitted for publication in referred journals.The Symposium was organized into seven sessions based on the submissions: Debugging Methodology, Knowledge-Based Debugging, Requirements/Design Debugging, Integrated Environments, Distributed Debugging, Implementation Issues, and Demonstrations. The proceedings are likewise divided into these seven categories; each begins with a summary of the session as i t unfolded at Asilomar, followed by the papers and abstracts that most relate to the session. It should be noted, however, that few papers were formally presented at the Symposium. Most sessions were organized as panels, short papers, or directed group discussions.
Coevolution of active vision and feature selection
Authors: Dario Floreano, Toshifumi Kato, Davide Marocco, Eric Sauser
Venue: Biological Cybernetics (2004)

We show that complex visual tasks, such as position- and size-invariant shape recognition and navigation in the environment, can be tackled with simple architectures generated by a coevolutionary process of active vision and feature selection. Behavioral machines equipped with primitive vision systems and direct pathways between visual and motor neurons are evolved while they freely interact with their environments. We describe the application of this methodology in three sets of experiments, namely, shape discrimination, car driving, and robot navigation. We show that these systems develop sensitivity to a number of oriented, retinotopic, visual-feature-oriented edges, corners, height, and a behavioral repertoire to locate, bring, and keep these features in sensitive regions of the vision system, resembling strategies observed in simple insects.
On the analytical comparison of testing techniques
Authors: Sandro Morasca, Stefano Serra-Capizzano
Venue: ACM SIGSOFT Software Engineering Notes (2004)

We introduce necessary and sufficient conditions for comparing the expected values of the number of failures caused by applications of software testing techniques. Our conditions are based only on the knowledge of a total or even a hierarchical order among the failure rates of the subdomains of a program's input domain. We also prove conditions for comparing the probability of causing at least one failure in three important special cases.