pinecone/core-2020-05-10-deduplication huggingface dataset:
A WSDL-Based Type System for WS-BPEL

We tackle the problem of providing rigorous formal foundations to current software engineering technologies for web services. We focus on two of the most used XML-based languages for web services: WSDL and WS-BPEL. To this aim, first we select an expressive subset of WS-BPEL, with special concern for modeling the interactions among web service instances in a network context, and define its operational semantics. We call ws-calculus the resulting formalism. Then, we put forward a rigorous typing discipline that formalizes the relationship existing between ws-calculus terms and the associated WSDL documents and supports verification of their compliance. We prove that the type system and the operational semantics of ws-calculus are ‘sound’ and apply our approach to an example application involving three interacting web services
The effect of adapting feedback generality in ITS

Intelligent tutoring systems achieve much of their success by adapting to individual students. One potential avenue for personalization is feedback generality. This paper presents two evaluation studies that measure the effects of modifying feedback generality in a web-based Intelligent Tutoring System (ITS) based on the analysis of student models. The object of the experiments was to measure the effectiveness of varying feedback generality, and to determine whether this could be performed en masse or if personalization is needed. In an initial trial with a web-based ITS it appeared that it is feasible to use a mass approach to select appropriate concepts for generalizing feedback. A second study gave conflicting results and showed a relationship between generality and ability, highlighting the need for feedback to be personalized to individual students’ needs
A graph-based monitoring tool for adaptive hypermedia course systems

The final publication is available at Springer via http://dx.doi.org/10.1007/11768012_33Proceedings of 4th International Conference, AH 2006, Dublin, Ireland, June 21-23, 2006Adaptive hypermedia courses are difficult to debug, validate and maintain. Logfile analysis is partly to blame. We propose a graph-based approach to both real-time student monitoring and logfile analysis. Students are represented at their current locations in a dynamically created map of the course. Selected parts of student user models are visually exposed, and more detail is available on demand. Hierarchically clustered graphs, automatic layout and focus+context techniques are used to keep visual complexity at a manageable level. This component has been developed for an existing AH course system. However we believe that our approach can be readily extended to a wide selection of adaptive hypermedia course systems, filling in an important gap during course creation and maintenance.This work has been sponsored by the Spanish Ministry of Science with project code TIN2004-0314
On the dynamic adaptation of Computer Assisted Assessment of free-text answers

The final publication is available at Springer via http://dx.doi.org/10.1007/11768012_54Proceedings of 4th International Conference, AH 2006, Dublin, Ireland, June 21-23, 2006.To our knowledge, every free-text Computer Assisted Assessment (CAA) system automatically scores the students and gives feedback to them according to their responses, but, none of them include yet personalization options. The free-text CAA system Atenea [1] had simple adaptation possibilities by keeping static student profiles [2]. In this paper, we present a new adaptive version called Willow. It is based on Atenea and adds the possibility of dynamically choosing the questions to be asked according to their difficulty level, the students’ profile and previous answers. Both Atenea and Willow have been tested with 32 students that manifested their satisfaction after using them. The results stimulate us to continue exploiting the possibilities of incorporating dynamic adaptation to free-text CAA.This work has been sponsored by Spanish Ministry of Science and Technology, project number TIN2004-0314
Generating Instance Models from Meta Models.

This is the author’s final draft of the paper published as Software and Systems Modeling, 2008, Online First.  The original publication is available at www.springerlink.com, Doi: 10.1007/s10270-008-0095-y.  The paper is also published in the book, Generating Instance Models from Meta Models, Doi: 10.1007/11768869_13.Meta modeling is a wide-spread technique to define visual languages, with the UML being the most prominent one. Despite several advantages of meta modeling such as ease of use, the meta modeling approach has one disadvantage: It is not constructive, i.e., it does not offer a direct means of generating instances of the language. This disadvantage poses a severe limitation for certain applications. For example, when developing model transformations, it is desirable to have enough valid instance models available for largescale testing. Producing such a large set by hand is tedious. In the related problem of compiler testing, a string grammar together with a simple generation algorithm is typically used\ud
to produce words of the language automatically. In this paper, we introduce instance-generating graph grammars for creating instances of meta models, thereby overcoming the main deficit of the meta modeling approach for defining languages
Agility in the avionics software world

This paper(1) takes a look at how XP and other agile practices can improve a software process for the development of avionics software. Developers of mission critical airborne software are heavily constrained by the RTCA DO-178B regulations [8]. These regulations impose strict rules regarding traceability and documentation that make it extremely hard to employ an iterative software development process. In particular, the extra validation overhead increases the time spent on small iteration cycles (for example, a bug-fix) to several weeks.status: publishe
Motivating the learner: an empirical evaluation

The M-Ecolab was developed to provide motivational scaffolding via an on-screen character whose demeanour defended on modelling the learner’s motivational state at interaction time. Motivational modelling was based on three variables: effort, independence and the confidence. A classroom evaluation was conducted to illustrate the effects of motivational scaffolding. Students had an eighty minute interaction with the M-Ecolab, divided into two sessions. The results suggested a positive effect of the motivational scaffolding, particularly for initially de-motivated students who demonstrated higher learning gains. We found that these students followed the suggestions of the on- screen character which delivered personalized feedback. They behaved in a way that was conducive to learning by being challenge-seekers and displaying an inclination to exert more effort. This paper gives a detailed account of the methodology and findings that resulted from the empirical evaluation
Evaluating the Effectiveness of tutorial dialogue instruction in a Explotary learning context

[Proceedings of] ITS 2006, 8th International Conference on Intelligent Tutoring Systems, 26-30 June 2006, Jhongli, Taoyuan County, TaiwanIn this paper we evaluate the instructional effectiveness of tutorial dialogue agents in an exploratory learning setting. We hypothesize that the creative nature of an exploratory learning environment creates an opportunity for the benefits of tutorial dialogue to be more clearly evidenced than in previously published studies. In a previous study we showed an advantage for tutorial dialogue support in an exploratory learning environment where that support was administered by human tutors [9]. Here, using a similar experimental setup and materials, we evaluate the effectiveness of tutorial dialogue agents modeled after the human tutors from that study. The results from this study provide evidence of a significant learning benefit of the dialogue agentsThis project is supported by ONR Cognitive and Neural Sciences Division, Grant number N000140410107proceedingPublicad
An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity (Algorithmic aspects in information and management)

Algorithmic aspects in information and management : Second International Conference, AAIM 2006, Hong Kong, China, June 20-22, 2006 : proceedings : (Lecture notes in computer science ; 4041)The 2nd Int. Conf. on Algorithmic Aspect in Information and Management. LNCS4041In this paper, we consider the quickest flow problem in a network which consists of a directed graph with capacities and transit times on its arcs. We present an O(n logn) time algorithm for the quickest flow problem in a network of grid structure with uniform arc capacity which has a single sink where n is the number of vertices in the network
Design by contract - Deontic design language for multiagent systems

Design by contract is a well known theory that views software construction as based on contracts between clients (callers) and suppliers (routines),relying on mutual obligations and benefits made explicit by assertions. However, there is a gap between this theory and software engineering concepts and tools. For example, dealing with contract violations is realized by exception handlers, whereas it has been observed in the area of deontic logic in computer science that violations and exceptions are distinct concepts that should not be confused. To bridge this gap, we propose a software design language based on temporal deontic logic. Moreover, we show how preferences over the possible outcomes of a supplier can be added. We also discuss the relation between the normative stance toward systems implicit in the design by contract approach and the intentional or BDI stance popular in agent theor
On the weights of binary irreducible cyclic codes

International audienceThis paper is devoted to the study of the weights of binary irreducible cyclic codes. We start from McEliece's interpretation of these weights by means of Gauss sums. Firstly, a dyadic analysis, using the Stickelberger congruences and the Gross-Koblitz formula, enables us to improve McEliece's divisibility theorem by giving results on the multiplicity of the weights. Secondly, in connection with a Schmidt and White's conjecture, we focus on binary irreducible cyclic codes of index two. We show, assuming the generalized Riemann hypothesis, that there are an infinite of such codes. Furthermore, we consider a subclass of this family of codes satisfying the quadratic residue conditions. The parameters of these codes are related to the class number of some imaginary quadratic number fields. We prove the non existence of such codes which provide us a very elementary proof, without assuming G.R.H, that any two-weight binary irreducible cyclic code c(m,v) of index two with v prime greater that three is semiprimitive
Evaluation of several algorithms in forecasting flood

Precise flood forecasting is desirable so as to have more lead time for taking appropriate prevention measures as well as evacuation actions. Although conceptual prediction models have apparent advantages in assisting physical understandings of the hydrological process, the spatial and temporal variability of characteristics of watershed and the number of variables involved in the modeling of the physical processes render them difficult to be manipulated other than by specialists. In this study, two hybrid models, namely, based on genetic algorithm-based artificial neural network and adaptive-network-based fuzzy inference system algorithms, are employed for flood forecasting in a channel reach of the Yangtze River. The new contributions made by this paper are the application of these two algorithms on flood forecasting problems in real prototype cases and the comparison of their performances with a benchmarking linear regression model in this field. It is found that these hybrid algorithms with a “black-box” approach are worthy tools since they not only explore a new solution approach but also demonstrate good accuracy performance.Department of Civil and Environmental EngineeringSeries: Lecture notes in computer scienceAuthor name used in this publication: K.W. Chau2005-2006 > Academic research: refereed > Publication in refereed journalpreprint_postprin
Prediction of construction litigation outcome - A case-based reasoning approach

Series: Lecture notes in computer scienceSince construction claims are normally affected by a large number of complex and interrelated factors, it will be advantageous to the parties to a dispute to know with some certainty how the case would be resolved if it were taken to court. The application of recent artificial intelligence technologies can be cost-effective in this problem domain. In this paper, a case-based reasoning (CBR) approach is adopted to predict the outcome of construction claims, on the basis of characteristics of cases and the corresponding past court decisions. The approach is demonstrated to be feasible and effective by predicting the outcome of construction claims in Hong Kong in the last 10 years. The results show that the CBR system is able to give a successful prediction rate higher than 80%. With this, the parties would be more prudent in pursuing litigation and hence the number of disputes could be reduced significantly.Department of Civil and Environmental EngineeringAuthor name used in this publication: K. W. Chau2005-2006 > Academic research: refereed > Publication in refereed journalpreprint_postprin
Cross-organisational workflow enactment via progressive linking by run-time agents

This is a conference paper [© Springer-Verlag], further details can be obtained:- http://esia2.univ-savoie.fr/conf-iea-aie/Driven by popular adoptions of workflow and requirements from the\ud
practice of virtual enterprise (VE), research in workflow interoperability is\ud
currently on the increase. Nonetheless, it is still in its early stage compared with\ud
the maturity of individual workflow technology. Some attempts have been tried,\ud
however results are not satisfactory especially in a VE context, where many of\ud
the partnerships are dynamic and temporary. Reasons include the rigidity and\ud
high initial coordination cost inherently associated with top-down modelling\ud
and enactment approaches. Therefore, this paper proposes a bottom-up and\ud
WfMS 1\ud
Keywords: Multi-Agent Systems, Workflow Interoperability, Virtual Enterprise\ud
-independent approach towards cross-organisational workflow\ud
enactment, which is via progressive linking enabled by run-time agents. This is\ud
expected to pave the way for further cross-organisational workflow needs
Dimension Extractors and Optimal Decompression

A *dimension extractor* is an algorithm designed to increase the effective
dimension -- i.e., the amount of computational randomness -- of an infinite
binary sequence, in order to turn a "partially random" sequence into a "more
random" sequence. Extractors are exhibited for various effective dimensions,
including constructive, computable, space-bounded, time-bounded, and
finite-state dimension. Using similar techniques, the Kucera-Gacs theorem is
examined from the perspective of decompression, by showing that every infinite
sequence S is Turing reducible to a Martin-Loef random sequence R such that the
asymptotic number of bits of R needed to compute n bits of S, divided by n, is
precisely the constructive dimension of S, which is shown to be the optimal
ratio of query bits to computed bits achievable with Turing reductions. The
extractors and decompressors that are developed lead directly to new
characterizations of some effective dimensions in terms of optimal
decompression by Turing reductions.Comment: This report was combined with a different conference paper "Every
  Sequence is Decompressible from a Random One" (cs.IT/0511074, at
  http://dx.doi.org/10.1007/11780342_17), and both titles were changed, with
  the conference paper incorporated as section 5 of this new combined paper.
  The combined paper was accepted to the journal Theory of Computing Systems,
  as part of a special issue of invited papers from the second conference on
  Computability in Europe, 200
Prefix-like complexities and computability in the limit

Computability in the limit represents the non-plus-ultra of constructive describability. It is well known that the limit computable functions on naturals are exactly those computable with the oracle for the halting problem. However, prefix (Kolmogorov) complexities defined with respect to these two models may differ. We introduce and compare several natural variations of prefix complexity definitions based on generalized Turing machines embodying the idea of limit computability, as well as complexities based on oracle machines, for both finite and infinite sequences
An extension to Bellare and Rogaway (1993) model: resetting compromised long-term keys

A security proof in the Bellare–Rogaway model and the random oracle model is provided for a protocol closely based on one originally proposed by Boyd (1996), which enjoys some remarkable efficiency properties. The model is extended so that it can detect a known weakness of the protocol that cannot be captured in the original model. An alternative protocol, provably secure in the extended model and the random oracle model, offering the same efficiency features as the original protocol is proposed. Moreover, our alternative protocol provides key confirmation and forward secrecy. It also allows session keys to be renewed in subsequent sessions without the server’s further involvement even in the event that the long-term key or the earlier session key have been compromised
Discovering Network Topology in the Presence of Byzantine Faults

We study the problem of Byzantine-robust topology discovery in an arbitrary
asynchronous network. We formally state the weak and strong versions of the
problem. The weak version requires that either each node discovers the topology
of the network or at least one node detects the presence of a faulty node. The
strong version requires that each node discovers the topology regardless of
faults. We focus on non-cryptographic solutions to these problems. We explore
their bounds. We prove that the weak topology discovery problem is solvable
only if the connectivity of the network exceeds the number of faults in the
system. Similarly, we show that the strong version of the problem is solvable
only if the network connectivity is more than twice the number of faults. We
present solutions to both versions of the problem. The presented algorithms
match the established graph connectivity bounds. The algorithms do not require
the individual nodes to know either the diameter or the size of the network.
The message complexity of both programs is low polynomial with respect to the
network size. We describe how our solutions can be extended to add the property
of termination, handle topology changes and perform neighborhood discovery
Exploring the notion of 'clutter' in Euler diagrams

Euler diagrams are an effective and intuitive way of representing relationships between sets. As the number of sets represented grows, Euler diagrams can become ‘cluttered’ and lose some of their intuitive appeal. In this paper we consider various measures of ‘clutter’ for abstract Euler diagrams and show that they compare well with results obtained from an empirical study. We also show that all abstract Euler diagrams can be constructed inductively by inserting a contour at a time and we relate this inductive description to the clutter metrics
Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles

The novel octilinear routing paradigm (X-architecture) in VLSI design requires new approaches for the construction of Steiner trees. In this paper, we consider two versions of the shortest octilinear Steiner tree problem for a given point set K of terminals in the plane: (1) a version in the presence of hard octilinear obstacles, and (2) a version with rectangular soft obstacles. The interior of hard obstacles has to be avoided completely by the Steiner tree. In contrast, the Steiner tree is allowed to run over soft obstacles. But if the Steiner tree intersects some soft obstacle, then no connected component of the induced subtree may be longer than a given fixed length L. This kind of length restriction is motivated by its application in VLSI design where a large Steiner tree requires the insertion of buffers (or inverters) which must not be placed on top of obstacles. For both problem types, we provide reductions to the Steiner tree problem in graphs of polynomial size with the following approximation guarantees. Our main results are (1) a 2-approximation of the octilinear Steiner tree problem in the presence of hard rectilinear or octilinear obstacles which can be computed in O(n log^2 n) time, where n denotes the number of obstacle vertices plus the number of terminals, (2) a (2 + epsilon)-approximation of the octilinear Steiner tree problem in the presence of soft rectangular obstacles which runs in O(n^3) time, and (3) a (1.55 + epsilon)-approximation of the octilinear Steiner tree problem in the presence of soft rectangular obstacles
Using UML’s Sequence Diagrams for Representing Execution Models Associated to Triggers

11 pages, 3 figures.-- Contributed to: 23rd British National Conference on Databases (BNCOD 23, Belfast, Northern Ireland, UK, July 18-20, 2006).Using active rules or triggers to verify integrity constraints is a serious and complex problem because these mechanisms have behaviour that could be difficult to predict in a complex database. The situation is even worse as there are few tools available for developing and verifying them. We believe that automatic support for trigger development and verification would help database developers to adopt triggers in the database design process. Therefore, in this work we suggest a visualization add-in tool that represents and verifies triggers execution by using UML’s sequence diagrams. This tool is added in RATIONAL ROSE and it simulates the execution sequence of a set of triggers when a DML operation is produced. This tool uses the SQL standard to express the triggers semantics and execution.This work is part of the project "Software Process Management Platform: modelling, reuse and measurement". TIN2004/07083.Publicad
Posture constraints for Bayesian human motion tracking

Conference on Articulated Motion and Deformable Objects (AMDO), 2006, Andratx (Spain)One of the most used techniques for full-body human tracking consists of estimating the probability of the parameters of a human body model over time by means of a particle ﬁlter. However, given the high-dimensionality of the models to be tracked, the number of required particles to properly populate the space of solutions makes the problem computationally very expensive. To overcome this, we present an efficient scheme which makes use of an action-specific model of human postures to guide the prediction step of the particle ﬁlter, so only feasible human postures are considered. As a result, the prediction step of this model-based tracking approach samples from a ﬁrst order motion model only those postures which are accepted by our action-specific model. In this manner, particles are propagated to locations in the search space with most a posteriori information avoiding particle wastage. We show that this scheme improves the efficiency and accuracy of the overall tracking approach.Peer Reviewe