ppxscal/embedding_network huggingface dataset:
A Management System Supporting Interorganizational Cooperative Development Processes In Chemical Engineering
Authors: Markus Heller, René Wörzberger
Venue: Journal of Integrated Design Process Science (2006)

Development processes in chemical engineering are hard to support. In particular, interorganizational development processes are concerned with the coordination of activities carried out by engineering teams distributed across several cooperating organizations. The management system AHEAD is based on long-term experience gathered in multiple application domains (software, mechanical, or chemical engineering). AHEAD supports the management of dynamic interorganizational development processes by dynamic process views which allow the partial visibility management of processes for external organizations. AHEAD provides support for evolving process views which are able to reflect the changes in evolving development processes. Process views serve as the basis for inter-process connection. Processes can be split top-down into subprocesses for different organizations or composed bottom-up for pre-existing processes from different organizations. When mixing top-down and bottom-up process, planning and execution is possible. AHEAD allows process managers to monitor and control their intra-organizational development processes with all inter-organizational connections to processes in cooperating organizations in a uniform modeling language.
Application of the integro-moment method to steady-state two-dimensional rarefied gas flows subject to boundary induced discontinuities
Authors: Stelios Varoutis, Dimitris Valougeorgis, Felix Sharipov
Venue: Journal of Computational Physics (2008)

The computational efficiency of the integro-moment method for solving steady-state two-dimensional rarefied gas flows is investigated. The two-dimensional boundary driven flow of a single gas in a cavity is used as a model problem, because the kinetic equations and the boundary conditions describing this flow contain most of the terms and features, which might appear in problems modeled by kinetic equations. Following a detailed quantitative comparison with the discrete velocity method, it is concluded that the integro-moment method may be considered as a alternative reliable and efficient computational scheme for solving rarefied (or non-equilibrium) flows in the whole range of the Knudsen number. Even more, it is shown that by implementing the integro-moment method the propagation of any discontinuities, which may exist at the boundaries, inside the computational domain and the production of an unphysical oscillatory behavior in the macroscopic quantities, are completely eliminated. The proposed integro-moment methodology is general and may be applied to any multidimensional non-equilibrium flow described by linear kinetic model equations.
A Legal Information flow (LIF) scheduler for distributed systems
Authors: Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

In formation systems have to be kept consistent and secure in presence of multiple conflicting transactions and security threats. The role-based access control (RBAC) model is widely used to make systems secure. Here, a subject s is allowed to issue a method op to an object o only if an access right ho; opi is included in the roles granted to the subject s. Even if every access request issued by every subject is authorized in the roles, illegal information flow might occur as well known confinement problem. In this paper, we newly define a legal information flow (LIF) relation (R1 &#x21D2; R2) among a pair of role families R1 and R2 to prevent illegal information flow. Here, the relation R1 &#x21D2; R2 shows that no illegal information flow occur if a transaction T1 with a role family R1 is performed prior to another transaction T2 with R2. In addition, we discuss an illegal information flow (IIF) relation R1 &#x21A6; R2, i.e. illegal information flow necessarily occur if every transaction T1 with R1 is performed before T2 with R2. The more significant transaction, the more prior performed. We discuss a legal information flow (LIF) scheduler to synchronize transactions so as to prevent illegal information flow and to serialize conflicting methods from multiple transactions in terms of significancy and information flow relation of roles families.
Finding repetitive patterns in 3D human motion captured data
Authors: Kai-Tai Tang, Howard Leung, Taku Komura, Hubert P. H. Shum
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Finding repetitive patterns is important to many applications such as bioinformatics, finance and speech processing, etc. Repetitive patterns can be either cyclic or acyclic such that the patterns are continuous and distributed respectively. In this paper, we are going to find repetitive patterns in a given motion signal without prior knowledge about the type of motion. It is relatively easier to find repetitive patterns in discrete signal that contains a limited number of states by dynamic programming. However, it is impractical to identify exactly matched states in a continuous signal such as captured human motion data. A point cloud similarity of the input motion signal itself is considered and the longest similar patterns are located by tracing and extending matched posture pairs. Through pattern alignment and autoclustering, cyclic and acyclic patterns are identified. Experiment results show that our approach can locate repetitive movements with small error rates.
Demand Pricing & Resource Allocation in Market-Based Compute Grids: A Model and Initial Results
Authors: Vladimir Marbukh, Kevin Mills
Venue: Proceedings of the Seventh International Conference on Networking (2008)

Market-based compute grids encompass service providers offering limited resources to potential users with varying quality of service demands and willingness to pay. Providers face problems of pricing and allocating resources to maximize revenue. Previous research proposed and analyzed a method for allocating resources based on joint optimization of access control and scheduling strategies. This paper proposes a tractable analytical model for joint optimization of job pricing and scheduling strategies with the objective of maximizing provider revenue. The paper provides initial results for the case of a single provider serving price-sensitive users whose utilities decay linearly with increasing service delay. The paper also shows that providers must combine both pricing and admission control to achieve maximum revenue.
Assessing the Reliability and Cost of Web and Grid Orchestrations
Authors: Alan Stewart, Maurice Clint, Terry Harmer, Peter Kilpatrick, Ron Perrott, Joaquim Gabarro
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Unreliability is a characteristic feature of web and grid based computation: a call to a web or grid site may or may not succeed. An orchestration manager aims to control web or grid behaviour by constructing dynamic threads which acquire and utilise appropriate resources. For example, in an orchestration, a site may be called and may fail to respond after a period of time. Subsequently, the site may be recalled, or an alternative site may be utilised. In this paper approaches to estimating the reliability and cost of complex orchestrations are proposed. It is assumed that information about site reliability can be accessed from empirically acquired information.
Sensible Doctor - A Mobile Diagnosis Tool for Wireless Sensor Networks
Authors: Seunghun Cha, Hyojeong Shin, Hojung Cha
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

We show a mobile monitoring application, called Sensible Doctor, for sensor network diagnosis. The solution is applied to a restricted region of the network, which surrounds the mobile monitoring device. The network traffic is reduced to cover only the monitoring part of the network by adopting algorithms tailored to mobile monitoring. Sensible Doctor is implemented on the RETOS operating system and provides system information, system profiling, remote application installation and network topology monitoring.
Sparse Oracles And Uniform Complexity Classes
Authors: J. Balcazar
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

We show that several questions about the polynomial-time hierarchy can be answered by answering their counterparts for the polynomial-time hierarchy relativized to an arbitrary sparse oracle set. For each of these questions, the answer will be the same for the hierarchy relativized to S/sub 1/ as it will be for the hierarchy relativized to S/sub 2/ for any choice of S/sub 1/ and S/sub 2/ that are sparse sets, including the choice of S/sub 1/ being empty and S/sub 2/ being nonempty but sparse.
Assistive browser for conducting web transactions
Authors: Jalal Mahmud, Yevgen Borodin, I. V. Ramakrishnan
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

People with visual impairments use screen readers to browse the Web. Sequential processing of web pages by screen readers causes information overload, making web browsing time-consuming and strenuous. These problems are further exacerbated in web transactions (e.g.: online shopping), which involve multiple steps spanning several web pages. In this paper we present a lightweight approach for doing Web transactions using non-visual modalities. We describe how analysis of context surrounding the link coupled with a shallow knowledge-base with patterns and keywords can help identify various concepts (e.g.: "add to cart", "item description", etc.) that are important in web transactions. Our preliminary results show promise that presenting such concepts to the users can reduce information overload and improve their overall browsing experience.
The return of the trivial: problems formalizing collection/item metadata relationships
Authors: Allen H. Renear, Karen M. Wickett, Richard J. Urban, David Dubin
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Formalizing collection/item metadata relationships encounters the problem of trivial satisfaction. We offer a solution related to current work in IR and ontology evaluation.
Take a walk, grow a tree
Authors: S. Bhatt, Jin-Yi Cai
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

A simple randomized algorithm is presented for maintaining dynamically evolving binary trees on hypercube networks. The algorithm guarantees that: (1) nodes adjacent in the tree are within distance O(log log N) in an N-processor hypercube, and (2) with overwhelming probability, no hypercube processor is assigned more than O(1+M/N) tree nodes, where M is the number of nodes in the tree. The algorithm is distributed and does not require any global information. This is the first load-balancing algorithm with provably good performance. The algorithm can be used to parallelize efficiently any tree-based computation. It can also be used to maintain efficiently dynamic data structures such as quadtrees. A technique called tree surgery is introduced to deal with dependencies inherent in trees. Together with tree surgery, the study of random walks is used to analyze the algorithm.
Design and implementation of remote meter reading and billing system
Authors: Mahmoud Z. Iskandarani, Nidal F. Shilbayeh
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

A remote meter reading system is designed, tested and implemented. The hardware and software in the designed system work together, to remotely receive readings from meters and then process it in order to obtain an accurate bill for the subscriber. The system makes use of modern communication and networking techniques to enable customers to not only view and pay their bill on-line, but also to history trace and analyze their consumption and to adjust it accordingly. The system offers hardcopy bill that can be sent to the customers via a collection center connected to the billing system through a private communication network.
Multi-Layer Traceback under the Hierarchical Tracers Deployment
Authors: Chun-Hsin Wang, Yen-Chih Chiang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The enhanced routers which can provide tracing service are referred to as tracers. In this paper, we propose a new hierarchical tracers deployment which can guarantee that the distance between any attack origin and its first met tracer be within an assigned hop distance. Networks are partitioned into hierarchical areas which are surrounded by tracers. Based on hierarchical tracers deployment, we design a multi-layer traceback method which can guarantee to find all of attack origins. Packets are marked only by their first met tracer in low probability. A single marked packet can be used to locate where the area attack origin is from. If the number of nodes in the found area is more than a threshold, the proposed multi-layer traceback will be recursively executed till attack origins are found. Extended simulation shows that the searching cost of finding attack origins can be bounded.
Discrete neural network for solving general quadratic programming problems
Authors: Valeri Mladenov
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

Quadratic programming problems are widespread class of nonlinear programming problems with many practical applications. The case of inequality constraints have been considered in a previous author's paper. Later on an extension of these results for the case of inequality and equality constraints has been proposed. Based on equivalent formulation of Kuhn-Tucker conditions, a new neural network for solving the general quadratic programming problems, for the case of both inequality and equality constraints has been presented. In this contribution a discrete version of this network is proposed. Two theorems for global stability and convergence of this network are given as well. The presented network has lower complexity and it is suitable for FPGA implementations. Simulation results based on SIMULINK® models are given and compared.
Long tours and short superstrings
Authors: S. R. Kosaraju
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

This paper considers weight-maximizing variants of the classical symmetric and asymmetric traveling-salesman problems. Like their weight-minimizing counterparts, these variants are MAX SNP-hard. We present the first nontrivial approximation algorithms for these problems. Our algorithm for directed graphs finds a tour whose weight is at least 38/63/spl ap/0.603 times the weight of a maximum-weight tour, and our algorithm for undirected graphs finds a tour whose weight is at least 5/7/spl ap/0.714 times optimal. These bounds compare favorably with the 1/2 and 2/3 bounds that can be obtained for undirected and directed graphs, respectively, by simply deleting the minimum-weight edge from each cycle of a maximum-weight cycle cover. Our algorithm for directed graphs can be used to improve several recent approximation results for the shortest-superstring problem.
Towards end-user programming with wikis
Authors: Craig Anslow, Dirk Riehle
Venue: Proceedings of the 4th international workshop on End-user software engineering (2008)

When business software fails to provide the desired functionality, users typically turn to spreadsheets to perform simple but general computational tasks. However, spreadsheets enforce a view of the world that consists mostly of tables and numbers rather than the domain concepts users have in mind. We are using wikis as a platform for empowering end-users to perform computational tasks of their choice. This paper discusses how core properties of wikis can support end-user programming. We illustrate our approach using wiki prototype software for working with business objects as made available by SAP's business application suite.
A Blended Text Mining Method for Authorship Authentication Analysis
Authors: Philip Sallis, Subana Shanmuganathan
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

The paper elaborates upon the interim results achieved in resolving a few newly discovered 16th century letters now alleged to be written by Queen Mary of Scots (QMS). Despite the significant progress seen in stylometry and its role in authorship attribute analysis especially in disputed writings/ texts controversies over the authorship of Shakespeare’s literary work still continue as does research into this corpus of letters. Using more sophisticated computational and mathematical modelling techniques than in previously published research, this study still employs the use of stylometic measures, to show a distinct variation between the authentic writings of QMS and the newly discovered letters, claimed by numerous enthusiasts to be of her authorship. Incorporating additional advanced statistical methods, such as principle component analysis (PCA) and artificial neural networks (ANNs), especially Kohonen’s self-organising map (SOM) based visualisation technique, a text mining approach for this application has been developed. The similarities between different pairs of the new and authentic letters and in some cases within individual letters become apparent when using “cusum” analysis adding further complexity to the task of resolving the anomaly seen among QMS loyalists, archaeologists, linguists and the like. The reasons for the inconclusive results of this study are presented with suggestions for future work but in essence, the data mining method used is regarded as being unique in its blend of conventional and non-conventional statistics and useful for this class of text analysis problem.
Exposing GAPS, exploring legacies: paradoxes of writing use in computing education
Authors: Timothy T Dansdill, Mark E. Hoffman, David S. Herscovici
Venue: Journal of Computing Sciences in Colleges (2008)

The authors conducted a survey of computing educators to better understand their objectives for assigning writing in computing courses, as well as to assess the impact of the Writing Across the Curriculum (WAC) movement on the field. Three general categories of writing are assessed: writing to learn, academic, and professional writing. The present survey's results, though limited, address the lack of any such data in the literature. The results point to a "gap" between types of writing---particularly between "writing-to-learn" and professional writing tasks. Filling this perceived gap is what the authors define as "legacy" writing. Results futher suggest that the WAC movement has had marginal influence on writing in computing education.
An improved centroid classifier for text categorization
Authors: Songbo Tan
Venue: Expert Systems with Applications: An International Journal (2008)

In the context of text categorization, Centroid Classifier has proved to be a simple and yet efficient method. However, it often suffers from the inductive bias or model misfit incurred by its assumption. In order to address this issue, we propose a novel batch-updated approach to enhance the performance of Centroid Classifier. The main idea behind this method is to take advantage of training errors to successively update the classification model by batch. The technique is simple to implement and flexible to text data. The experimental results indicate that the technique can significantly improve the performance of Centroid Classifier.
Calibration and Data Integration of Multiple Optical Flow Sensors for Mobile Robot Localization
Authors: Jwu-Sheng Hu, Yung-Jung Chang, Yu-Lun Hsu
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

This paper proposes a calibration method as well as a computational algorithm to integrate multiple optical flow sensors. Optical flow sensors offer a different kind of odometer as compared with the wheel encoder. Using multiple sensors, it is possible to reduce the effect of measurement uncertainties. Since all sensors are mounted on a rigid body, their measurement data must obey a certain relation. This relation is utilized in this paper and mathematical formulations are developed to realize the computation. It is shown that the calibration procedure can be cast as an optimization problem given enough measurement data. Further, the rigid-body relation is formulated as a null-space constraint using the calibrated parameters. During operation, unreliable sensor measurements can be removed by accessing the error distance to the null space. Simulation results are presented to support the proposed methods.
Stable haptic interaction using a damping model to implement a realistic tooth-cutting simulation for dental training
Authors: Guanyang Liu, Yuru Zhang, Dangxiao Wang, William T. Townsend
Venue: Virtual Reality (2008)

It is difficult to implement a stable and realistic haptic simulation for cutting rigid objects that is based on a damping model because of an inevitable conflict between stability and high output force. This paper presents passivity techniques to show that an excessive damping coefficient causes the output stiffness to exceed the maximum output stiffness of the haptic device, leading to instability. By analysing the damping model of a haptic dental-training simulator, we construct a relationship among the damping coefficient, position resolution, sampling frequency, human operation, and the maximum achievable device stiffness that will still maintain device stability. A method is also provided to restrict the output stiffness of the haptic device to ensure stability while enabling the realistic haptic simulation of cutting rigid objects (teeth) that is based in a damping model. Our analysis and conclusions are verified by a damping model that is constructed for a dental-training haptic display. Three types of haptic devices are used in our analysis and experiments.
Evaluating x86 condition codes impact on superscalar execution
Authors: Virginia Escuder, Raúl Durán, Rafael Rico
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

The design of instruction sets is a fundamental aspect of computer architecture. A critical requirement of instruction set design is to allow for concurrent execution, avoiding those constructs that may produce data dependencies among instructions. Therefore, it is important to count on methods and tools for the evaluation of the behavior of instruction sets and quantify the influence of particular features of its architecture into the overall available parallelism. We propose an analysis method that applies graph theory to gather metrics to evaluate the impact of different characteristics of instruction sets as sources of coupling thus quantifying available parallelism. We present a case study using the x86 instruction set and obtain some measures of the influence of condition flags in code coupling.