ppxscal/embedding_network huggingface dataset:
Dynamic Setting, Verification and Adjustment of Upper Bound Constraints in Grid Workflow Systems
Authors: Jinjun Chen, Yun Yang
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate modelling or international stock market analysis often have only one end-to-end upper bound constraint. This is not sufficient to control overall temporal correctness as we may not find temporal violations until the last activity. Then, it is too late to take any handling actions. Consequently, the execution results may not be useful and overall cost-effectiveness would be impacted. Therefore, in this paper, we systematically investigate how to set, verify and adjust sub-upper bound constraints within the timeframe of one end-to-end upper bound constraint so that we can control grid workflow execution locally. We develop corresponding setting, verification and adjustment methods and algorithms. The quantitative evaluation demonstrates that with sub-upper bound constraints, we can achieve better cost-effectiveness than only based on one end-to-end upper bound constraint.
A set of patterns for the web-based interfaces of an employee services system
Authors: Pradip K. Sarkar, Jacob L. Cybulski
Venue: Proceedings of the 2002 conference on Pattern languages of programs - Volume 13 (2003)

The provision of Human Resource (HR), especially payroll, is a core function in every organization. Previously, providers of HR/payroll have offered their services to their clients via conventional modes of communication, such as telephones, facsimile, and courier services. In recent years, with the advent of the Internet and the emergence of web-based electronic commerce, there has been a rise in the adoption of web-based technology and information systems by service providers, thereby enabling them to interact with their clients through this medium. This development necessitates the use of web-based user interfaces as workspaces between the HR/payroll providers and their clients, and thus, raises certain concerns that determine the effectiveness of web-based workflow systems. These concerns, related to the use of web interfaces, form the basis of the patterns discussed in this paper
Telepresence and user-initiated control
Authors: Daniel Kerse, Holger Regenbrecht, Martin Purvis
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

To date, telepresence; defined as being virtually present at a remote, real location; is a research subject primarily of interest to robotics and aerospace industries. The pilot system and the study presented here aim to investigate whether telepresence can be achieved with an affordable and easy to use system.In our approach a Personal Digital Assistant (PDA) with a camera represents the remote self at the local site. The PDA is mounted to a pan and tilt unit which can be controlled from the remote location by simply pressing keys on the keyboard of a PC. In a pilot user study we can show, that (a) even this simple setup can be used as a telepresence system, (b) the control of the field of view within the remote environment is important, and (c) some social presence properties are positively influenced by the user-initiated control.
A suffix tree approach to anti-spam email filtering
Authors: Rajesh Pampapathi, Boris Mirkin, Mark Levene
Venue: Machine Learning (2006)

We present an approach to email filtering based on the suffix tree data structure. A method for the scoring of emails using the suffix tree is developed and a number of scoring and score normalisation functions are tested. Our results show that the character level representation of emails and classes facilitated by the suffix tree can significantly improve classification accuracy when compared with the currently popular methods, such as naive Bayes. We believe the method can be extended to the classification of documents in other domains.
A heuristic approach to cost-efficient fragmentation and allocation of complex value databases
Authors: Hui Ma, Klaus-Dieter Schewe, Qing Wang
Venue: Proceedings of the 17th Australasian Database Conference - Volume 49 (2006)

The quality of database distribution design, which involves fragmentation and allocation, should be assessed by the performance of a system. In particular, this applies to non-relational database systems. This paper addresses fragmentation and allocation in the context of complex value databases. Fragmentation and fragment allocation are performed simultaneously. For this we present a query processing cost model to evaluate the performance of the system. The core of the paper is a heuristic approach for fragmentation and fragment allocation, which uses the cost model and is targeted at globally minimising these costs. The validity of the approach is supported by experimental results.
Derandomization of Probabilistic Auxiliary Pushdown Automata Classes
Authors: H. Venkateswaran
Venue: Proceedings of the 21st Annual IEEE Conference on Computational Complexity (2006)

We extend Nisan's breakthrough derandomization result that BP_HL \subseteq SC^2 [11] to bounded error probabilistic complexity classes based on auxiliary pushdown automata. In particular, we show that any logarithmic space, polynomial time two-sided bounded-error probabilistic auxiliary pushdown automaton (the corresponding complexity class is denoted by BP_HLOGCFL) can be simulated by an SC^2machine. This derandomization result improves a classical result by Cook [7] that LOGDCFL \sybseteqSC^2 since LOGDCFL is contained in BP_HLOGCFL. We also present a simple circuit-based proof that BP_HLOGCFL is in NC^2.
Completing prefix codes in submonoids
Authors: Jean Néraud
Venue: Theoretical Computer Science (2006)

Let M be a submonoid of the free monoid A*, and let X ⊆ M be a variable length code (for short a code). X is weakly M-complete if any word in M is a factor of some word in X* [J. Néraud, C. Selmi, Free monoid theory: maximality and completeness in arbitrary submonoids, Internat. J. Algorithms Comput. 13(5) (2003) 507-516]. Given a code X ⊆ M, we are interested in the construction of a weakly M-complete code that contains X, if it exists. In the case where M and X are regular sets, the existence of such a code has been established [J. Néraud, Completing a code in a regular submonoid of the free monoid, in acts of MCU'2004, Lecture Notes in Computer Sciences, Vol. 3354, Springer, Berlin, 2005, pp. 281-291; J. Néraud, On the completion of codes in submonoids with finite rank, Fund. Inform., to appear]. Actually, this result lays upon a method of construction that preserves the regularity of sets. As well known, any regular (or finite) code may be embedded into a regular (finite) prefix code that is complete in A*: Instance: A regular submonoid M of A*, and a regular (or finite) prefix code X ⊆ M. Question: Does a weakly M-complete regular (finite) prefix code containing X exist?
Implementing Authentic Activities for supporting learning through remote monitoring of earthquakes
Authors: Nelson Baloian, Stephan Buschmann, Henning Breuer, Mitsuji Matsumoto
Venue: Proceedings of the Fourth IEEE International Workshop on Technology for Education in Developing Countries (2006)

The discovery or re-construction of scientific explanations and understanding based on experience is a complex process, for which school learning often uses shortcuts. Based on the example of analyzing real seismic measurements, we propose a computerfacilitated collaborative learning scenario which meets many of the requirements for authentic learning. The implementation of the learning environment is based on a general platform for supporting collaborative modeling.
Supporting educational software design with knowledge-rich tools
Authors: Benjamin Bell
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

As educational software becomes more complex and multimedia more pervasive, authoring tools become increasingly central to the construction of instructional applications. Moreover, the importance of creating tools that encourage effective instructional design is now widely recognized. In response to this, researchers are creating sophisticated tools that not only support the mechanics of software design but embody models of pedagogy as well, which has led to efforts in designing specialized authoring environments around specific instructional frameworks. To better support the design process, such tools must possess knowledge of the domain and of the kinds of tasks suited to that domain. This paper reports preliminary work in augmenting a specialized authoring tool with task and domain knowledge. The tool supports the design of a specific class of Goal-Based Scenarios that emphasizes investigation. The extension to this tool represents and applies knowledge of investigations, in terms of both their structure and the objects that typically appear in them.
Discrete-event simulation and automatic data collection improve performance in a manufacturing system
Authors: Arne Ingemansson, Jan Oscarsson
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Data utilization from an automatic collection system helps simulation. DES (Discrete-Event Simulation) is a suitable tool in that respect. Improvements of a manufacturing system by reducing production disturbances in block engine line of a truck manufacturer were shown in a case study. The manufacturing line is equipped with an automatic data gathering system, collecting detailed information from each machine, such as DT (DownTime). The collected data and the simulation model were used in finding bottlenecks in the system. The improvement groups of the company suggested improvements to these machines in collaboration with DES work. An improvement of 12% was achieved in the block line during two years. The long-term improvement work was profitable. Further potential with the method is investigated in a new case study.
Incentives for electronic coupon systems
Authors: Jussi Kangasharju, Andreas Heinemann
Venue: Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking (2006)

Ad hoc networks and peer-to-peer systems typically require many users to participate, in order to leverage the full benefits of the system. In this paper we examine an electronic coupon system, where providers send out coupons, which are passed from user to user. The incentive for users to participate is that they receive bonus points for each redemption of the coupon. The contributions of this paper are two-fold. First, we define a general model for such bonus point -based coupon schemes and derive an optimal strategy which allows each user to determine how many bonus points she should ask for when passing the coupon. Second, we show that our optimal strategy is extremely robust against all other user strategies, and that there is a strong incentive for users to follow our optimal strategy.
Hierarchical Volumetric Multi-view Stereo Reconstruction of Manifold Surfaces based on Dual Graph Embedding
Authors: Alexander Hornung, Leif Kobbelt
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph structure embedded into the volumetric grid, which establishes a well defined relationship between the integrated photo-consistency function of a region in space and the corresponding edge weights of the embedded graph. This new graph structure allows for a highly efficient hierarchical implementation supporting high volumetric resolutions and large numbers of input images. Furthermore we will show how the resulting cut surface can be directly converted into a consistent, closed and manifold mesh. Hence this work provides a complete multi-view stereo reconstruction pipeline. We demonstrate the robustness and efficiency of our technique by a number of high quality reconstructions of real objects.
OPEDo: a tool framework for modeling and optimization of stochastic models
Authors: Peter Buchholz, Dennis Müller, Peter Kemper, Axel Thümmler
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

A model-based design of systems requires appropriate tool support in many ways. It requires a modeling notation that suits the application problem, a set of analysis techniques that provide qualitative and/or quantitative results, and finally some optimization methods that help a designer to make appropriate design decisions. The challenge is to integrate those components into a homogenous framework such that a model based design takes advantage from synergy effects that result from a sophisticated combination of modeling formalism, analysis and optimization technique. In this paper, we present OPEDo, a tool framework that integrates modeling tools and analysis engines with state-of-the-art optimization methods. With respect to modeling, it contains the ProC/B editor for specifying open process-oriented simulation models, the APNN Toolbox for modeling with stochastic Petri nets, and OMNet++, for modeling using a simulation language. OPEDo provides analysis techniques for stochastic models based on discrete event simulation, based on queueing network analysis and numerical analysis techniques for continuous time Markov chains with the help of HIT, OMNeT++, and APNN Toolbox. Optimization of stochastic models has particular challenges due to the cost of model evaluation and the precision of results that can be achieved, so OPEDo contains specially adjusted variants of a variety of optimization methods, which includes response surface methodology, evolutionary strategies, genetic algorithms, and Kriging metamodeling techniques.
Semantic Web Service Composition through a Matchmaking of Domain
Authors: Freddy Lecue, Alain Leger
Venue: Proceedings of the European Conference on Web Services (2006)

The automated composition of Web services is one of the most promising ideas and at the same time one of the most challenging research area for the taking off of serviceoriented applications. It is widely recognised that one of the key elements for the automated composition of Web services is semantics i.e., unambiguous descriptions of Web services capabilities and processes. However Web services described at capability level need a formal context to perform the automated composition ofWeb services. In this paper a TLB Architecture (Three Levels based Architecture) is presented to perform Web service composition. Moreover we introduce the composition process as a matchmaking of domains and solve the latter problem according to a formal model i.e., the xCLM (eXtended Causal link matrix) and a knowledge base of the domain.
A Self-Adaptive Hybrid Channel Assignment Scheme forWireless Communication Systems
Authors: A. K. Prajapati, R. K. Ghosh, H. Mohanty
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

A Self Adaptive Hybrid Channel Assignment (SA-HCA) scheme for cellular wireless communication system is proposed. It uses history of traffic data of the cells to predict most probable future estimation of the communication loads. Using the predicted load patterns, the channel assignments to the cells are adjusted.
Secure Authenticated Key Exchange protocol based on EC using Signcryption Scheme
Authors: Rack-Hyun Kim, Heung-Youl Youm
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

A Signcryption proposed by Yuliang Zheng in 1997 is a hybrid public key primitive that combines a digital signature and an encryption. It provides more efficient method than a straightforward composition of a signature scheme with an encryption scheme. In a mobile communication environment, the authenticated key agreement protocol should be designed to have lower computational complexity and memory requirements. Therefore, in this paper, our proposed method that efficient authenticated key exchange protocol using Signcryption scheme and based on EC using Signcryption in mobile and wireless network. And we analyze computational cost and security requirements of proposed protocol.
Fast Kernel Classifiers with Online and Active Learning
Authors: Antoine Bordes, Seyda Ertekin, Jason Weston, Léon Bottou
Venue: The Journal of Machine Learning Research (2005)

Very high dimensional learning systems become theoretically possible when training examples are abundant. The computing cost then becomes the limiting factor. Any efficient learning algorithm should at least take a brief look at each example. But should all examples be given equal attention?This contribution proposes an empirical answer. We first present an online SVM algorithm based on this premise. LASVM yields competitive misclassification rates after a single pass over the training examples, outspeeding state-of-the-art SVM solvers. Then we show how active example selection can yield faster training, higher accuracies, and simpler models, using only a fraction of the training example labels.
APL96 conference survey results
Authors: Dick Holt
Venue: ACM SIGAPL APL Quote Quad (1996)

This article summarizes a survey of APL96 Conference attenders in Lancaster, England. Its purpose is to help design better future conferences. Each survey question is quoted, and then followed by a summary of respondents' answers.
Performance Analysis for a Multi-Stage Negotiation
Authors: Jiaxing Li, Jen-Hsiang Chen, Kuo-Ming Chao, Nick Godwin, Yinsheng Li, Ying Huang
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

It is not uncommon for negotiating agents to involve complex utility functions in the negotiation process. To search for an optimised solution in a large and complex space can be very time consuming. The choice of appropriate parameter settings for searching methods can have significant impact on the negotiation result. In this paper, we report a series of the experiments that have been carried out to analyze the performance of a multi-stage bi-lateral negotiation mechanism. Apart from the efficiency of processing time, two key criteria, joint total utility and the difference between the agents' degrees of satisfaction, were selected to measure the effectiveness of the proposed negotiation mechanism.
Engineering Sufficiently Secure Computing
Authors: Brian Witten
Venue: Proceedings of the 22nd Annual Computer Security Applications Conference (2006)

We propose an architecture of four complimentary technologies increasingly relevant to a growing number of home users and organizations: cryptography, separation kernels, formal verification, and rapidly improving techniques relevant to software defect density estimation. Cryptographic separation protects information in transmission and storage. Formally proven properties of separation kernel based secure virtualization can bound risk for information in processing. Then, within each strongly separated domain, risk can be measured as a function of people and technology within that domain. Where hardware, software, and their interactions are proven to behave as and only as desired under all circumstances, such hardware and software can be considered to not substantially increase risk. Where the size or complexity of software is beyond such formal proofs, we discuss estimating risk related to software defect densities, and emerging work related to binary analysis with potential for improving software defect density estimation.
A surface reconstruction algorithm for topology optimization
Authors: Atsushi Koguchi, Noboru Kikuchi
Venue: Engineering with Computers (2006)

For mechanical structural design, topology optimization is often utilized. During this process, a topologically optimized model must be converted into a parametric CAD solid model. The key point of conversion is that a discretized shape of a topologically optimized model must be smoothed, but features such as creases and corners must be retained. Thus, a surface reconstruction algorithm to produce the parametric CAD solid model from a topologically optimized model is proposed in this paper. Our presented algorithm consists of three parts: (1) an enclosed isosurface geometry from which the topologically optimized model is generated, (2) features detected and (3) the parametric CAD solid model reconstructed as biquartic surface splines. In order to generate an enclosed isosurface model effectively, we propose an algorithm based upon the marching cubes method to detect elements intersected by an isosurface. After generating an enclosed isosurface model, we produce biquartic surface splines. By applying our algorithm to an enclosed isosurface model, it is possible to produce smoothed biquartic surface splines with features retained. Some examples are shown and the effectiveness of our algorithm is discussed in this paper.
MAC Layer admission control and priority re-allocation for handling QoS guarantees in non-cooperative wireless LANs
Authors: Ming Li, B. Prabhakaran
Venue: Mobile Networks and Applications (2005)

Providing QoS guarantee with appropriate service differentiation in IEEE 802.11 wireless LANs is quite desirable. However, users may be selfish and thus rigorously try to maximize their performance by demanding high services even though the network has already saturated. On the other hand, user misbehaviors such as misuse of priority and over-rate transmission pose further harm to performance of existing flows. These application layer non-cooperation makes successful resource allocation very challenging with existing contention based CSMA/CA channel access. In this paper, we propose a MAC layer coordinated QoS framework of admission control and priority re-allocation for quality of services of real-time applications in wireless LANs. Our focus is on priority based MAC schedulers where each user can set its flow priority in order to receive appropriate level of services. With channel condition information such as available bandwidth and mean delay exchanged among neighboring stations, users can enforce admission control based on the perceived channel status and may re-allocate their priorities to accommodate existing flows as desired. User misbehaviors are identified by estimating the flow transmitting rate and matching priority setting, or even punished by assigning appropriate low priorities. Extensive simulations results show that the proposed framework can effectively coordinate wireless users on keeping reserved transmission rate, using appropriate MAC priority, and allocating sufficient resource.
Negotiating using rewards
Authors: Sarvapali D. Ramchurn, Carles Sierra, Lluis Godo, Nicholas R. Jennings
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

In situations where self-interested agents interact repeatedly, it is important that they are endowed with negotiation techniques that enable them to reach agreements that are profitable in the long run. To this end, we devise a novel negotiation algorithm that generates promises of rewards in future interactions, as a means of permitting agents to reach better agreements, in a shorter time, in the present encounter. Moreover, we thus develop a specific negotiation tactic based on this reward generation algorithm and show that it can achieve significantly bettter outcomes than existing benchmark tactics that do not use such inducements. Specifically, we show, via empirical evaluation, that our tactic can lead to a 26% improvement in the utility of deals that are made and that 21 times fewer messages need to be exchanged in order to achieve this under concrete settings.