pinecone/core-2020-05-10-deduplication huggingface dataset:
The use of experts panels in ERP cost estimation research

Published version of a chapter in the book: Enterprise information systems. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-642-16419-4_10This paper is an effort towards illustrating the use of expert panel (EP) as a mean of eliciting knowledge from a group of enterprise resource planning (ERP) experts as an exploratory research. The development of a cost estimation model (CEM) for ERP adoptions is very crucial for research and practice, and that was the main reason behind the willingness of experts to participate in this research. The use of EP was very beneficial as it involved various data collection and visualisation techniques, as well as data validation and confirmation. Beside its advantages, one of the main motives for using a group technique is that it is difficult to find a representative sample for a casual survey method, as ERP experts and consultants are rare to find, especially in the scope of SMEs’ ERP implementations. It is worth noting that the panel reached consensus regarding the results of the EP. The experts modified and enhanced the initial cost drivers (CD) list largely, as they added, modified, merged and split different costs drivers. In addition, the experts added CF (sub-factors) that could influence or affect each cost driver. Moreover, they ranked the CD according to their weight on total costs. All of this helped the authors to better understand relationships among various CF.This paper is an effort towards illustrating the use of expert panel (EP) as a mean of eliciting knowledge from a group of enterprise resource planning (ERP) experts as an exploratory research. The development of a cost estimation model (CEM) for ERP adoptions is very crucial for research and practice, and that was the main reason behind the willingness of experts to participate in this research. The use of EP was very beneficial as it involved various data collection and visualisation techniques, as well as data validation and confirmation. Beside its advantages, one of the main motives for using a group technique is that it is difficult to find a representative sample for a casual survey method, as ERP experts and consultants are rare to find, especially in the scope of SMEs’ ERP implementations. It is worth noting that the panel reached consensus regarding the results of the EP. The experts modified and enhanced the initial cost drivers (CD) list largely, as they added, modified, merged and split different costs drivers. In addition, the experts added CF (sub-factors) that could influence or affect each cost driver. Moreover, they ranked the CD according to their weight on total costs. All of this helped the authors to better understand relationships among various CF
A semantic approach for learning objects repositories with knowledge reuse

In this paper we discuss how the inclusion of semantic functionalities
in a Learning Objects Repository allows a better characterization of the learning
materials enclosed and improves their retrieval through the adoption of some
query expansion strategies. Thus, we started to regard the use of ontologies to
automatically suggest additional concepts when users are filling some metadata
fields and add new terms to the ones initially provided when users specify the
keywords with interest in a query. Dealing with different domain areas and
having considered impractical the development of many different ontologies,
we adopted some strategies for reusing ontologies in order to have the
knowledge necessary in our institutional repository. In this paper we make a
review of the area of knowledge reuse and discuss our approach
A Secure and Efficient Authenticated Diffie–Hellman Protocol

International audienceThe Exponential Challenge Response (XRC) and Dual Exponential Challenge Response (DCR) signature schemes are the building blocks of the HMQV protocol. We pro-pose a complementary analysis of these schemes; on the basis of this analysis we show how impersonation and man in the middle attacks can be mounted against the HMQV protocol when some session specific information leakages happen. We define the Full Exponential Challenge Response (FXRC) and Full Dual Exponential Challenge Response (FDCR) sig-nature schemes; using these schemes we propose the Fully Hashed MQV protocol (with security arguments), which preserves the remarkable performance of the (H)MQV protocols and resists the attacks we present
Understanding Formal Description of Pitch-Based Input

The pitch-based input (humming, whistling, singing) in acoustic modality has already been studied in several projects. There is also a formal description of the pitch-based input which can be used by designers to define user control of an application. However, as we discuss in this paper, the formal description can contain semantic errors. The aim of this paper is to validate the formal description with designers. We present a tool that is capable of visualizing vocal commands and detecting semantic errors automatically. We have conducted a user study that brings preliminary results on comprehension of the formal description by designers and ability to identify and remove syntactic errors
Application Composition Driven by UI Composition

International audienceAhead of the multiplication of specialized applications, needs for application composition increase. Each application can be described by a pair of a visible part –the User Interface (UI) –and a hidden part –the tasks and the Functional Core (FC). Few works address the problem of application composition by handling both visible and hidden parts at the same time. Our proposition described in this paper is to start from the visible parts of applications, their UIs, to build a new application while using information coming from UIs as well as from tasks. We base upon the semantic description of UIs to help the developer merge parts of former applications. We argue that this approach driven by the composition of UIs helps the user during the composition process and ensures the preservation of a usable UI for the resulting application
The APEX framework: prototyping of ubiquitous environments based on Petri Nets

The user experience of ubiquitous environments is a determining factor in their success. The characteristics of such systems must be explored as early as possible to anticipate potential user problems, and to reduce the cost of redesign. However, the development of early prototypes to be evaluated in the target environment can be disruptive
to the ongoing system and therefore unacceptable. This paper reports on an ongoing effort to explore how model-based rapid prototyping of ubiquitous
environments might be used to avoid actual deployment while still enabling users to interact with a representation of the system. The paper describes APEX, a framework that brings together an existing 3D Application Server with CPN Tools. APEX-based prototypes enable users to navigate a virtual world simulation of the envisaged ubiquitous environment.
The APEX architecture and the proposed CPN-based modelling approach are described. An example illustrates their use.Fundação para a Ciência e a Tecnologia (FCT) - bolsa de doutoramento SFRH/BD/41179/200
Transcription of satellite DNAs in insects

Chromatin condensation is an important regulatory mechanism of gene silencing as well as gene activation for the hundreds of functional protein genes harbored in heterochromatic regions of different insect species. Being the major heterochromatin constituents, satellite DNAs serve important roles in heterochromatin regulation in insect in general. Their expression occurs in all developmental stages, being the highest during embryogenesis. Satellite DNA transcrips range from small RNAs, corresponding in size to siRNA, and piwiRNAs, to large, a few Kb long RNAs. The long transcripts are preferentially nonpolyadenylated and remain in the nucleus. The actively regulated expression of satDNAs by cis or trans elements as well as by environmental stress, rather than constitutive transcription, speaks in favour of their involvement in differentiation, development, and environmental response
Legal electronic institutions and ONTOMEDIA: dialogue, inventio, and relational justice scenarios

Since the seminal work by Perelman, Olbrechts-Tyteca, Toulmin, Ong, Giuliani and many others in late fifties and sixties, dialogue and argumentation have increasingly been at the center of philosophical discussions. Modelization of arguments and “argumentation schemes” constitute one of the main domains within the AI & Law field. The construction of Legal Electronic Institutions (LEI), and Ontomedia, an Online Dispute Resolution (ODR) platform in the context of the research carried out within the Catalan White Book on Mediation, has enhanced the discussion about fundamental issues on the theoretical approach taken in building such Web 2.0 and Web 3.0 tools. In this paper, I will address the question of how the content of ancient stasis, ekphrasis and inventio may be captured and reelaborated to define their theoretical backbones. I will call “relational justice” the conceptual legal framework in which Semantic Web strategies can be nested to offer a better user-centered service
Network Analysis of the French Environmental Code

International audienceWe perform a detailed analysis of the network constituted by the citations in a legal code, we search for hidden structures and properties. The graph associated to the Environmental code has a small-world structure and it is partitioned in several hidden communities of articles that only partially coincide with the organization of the code as given by its table of content. Several articles are also connected with a low number of articles but are intermediate between large communities. The structure of the Environmental Code is contrasting with the reference network of all the French Legal Codes that presents a rich-club of ten codes very central to the whole French legal system, but no small-world property. This comparison shows that the structural properties of the reference network associated to a legal system strongly depends on the scale and granularity of the analysis, as is the case for many complex system
Social Ontology Documentation for Knowledge Externalization

Knowledge externalization and organization is a major challenge
that companies must face. Also, they have to ask whether is possible
to enhance its management. Mechanical processing of information
represents a chance to carry out these tasks, as well as to turn intangible
knowledge assets into real assets. Machine-readable knowledge provides
a basis to enhance knowledge management. A promising approach is the
empowering of Knowledge Externalization by the community (users, employees).
In this paper, a social semantic tool (called OntoxicWiki) for
enhancing the quality of knowledge is presented.Ministerio de Ciencia e Innovación TIN2009-0949
Utilizing Embedded Semantics for User-driven Design of Pervasive Environments

The Web does not only offer an almost infinitive number of services and resources but can be also seen as a technology to combine different technological devices, like mobile phones, digital media solutions, intelligent household appliances, tablet PCs, and any other kind of computers, in order to create environments satisfying the need of users. However, due to the large amount of web resources and services as well as the variety and range of user needs, it is impossible to realize software solutions for all possible scenarios. In this paper, we present a user-driven approach towards designing and assembling pervasive environments, taking into consideration resources and services available on the Web and provided through computing devices. Based on semantics embedded in the web content, we explain the concept as well as important components of this user-driven environment design methodology and show a first prototype. Finally, the overall approach is critically discussed from the perspectives of programmers and web users on the basis of related work.status: publishe
Contract-based slicing

In the last years, the concern with the correctness of programs has been leading programmers to enrich their programs with annotations following the principles of design-by-contract, in order to be able to guarantee their correct behaviour and to facilitate reuse of veriﬁed components without having to reconstruct proofs of correctness. 
In this paper we adapt the idea of speciﬁcation-based slicing to the scope of (contract-based) program veriﬁcation systems and behaviour speciﬁcation languages. In this direction, we introduce the notion of contract-based slice of a program and show how any speciﬁcation-based slicing algorithm can be used as the basis for a contract-based slicing algorithm.Fundação para a Ciência e a Tecnologia (FCT) - RESCUE (PTDC / EIA / 65862 / 2006), CROSS (PTDC / EIACCO/ 108995 / 2008)
Compiler-support for robust multi-core computing

???The original publication is available at www.springerlink.com???. Copyright Springer.Embedded computing is characterised by the limited availability of computing resources. Further, embedded systems are often used in safety-critical applications with real-time constraints. Thus, the software development has to follow rigorous procedures to minimise the risk of system failures. However, besides the inherent application complexities, there is also an increased technology-based complexity due to the shift to concurrent programming of multi-core systems. For such systems it is quite challenging to develop safe and resource-efficient systems. In this paper we give a plea for the need of better software development tools to cope with this challenge. For example, we outline how compilers can help to simplify the writing of fault-tolerant and robust software, which keeps the application code more compact, comprehensive, and maintainable. We take a rather extreme stand by promoting a functional programming approach. This functional programming paradigm reduces the complexity of program analysis and thus allows for more efficient and powerful techniques. We will implement an almost transparent support for robustness within the SaC research compiler, which accepts a C-like functional program as input. Compared to conventional approaches in the field of automatic software-controlled resilience, our functional setting will allow for lower overhead, making the approach interesting for embedded computing as well as for high-performance computing
Model-checking temporal properties of real-time HTL programs

This paper describes a tool-supported method for the formal verification of timed properties of HTL programs, supported by the automated translation tool HTL2XTA, which extracts from a HTL program (i) an Uppaal model and (ii) a set of properties that state the compliance of the model with certain automatically inferred temporal constraints. These can be manually extended with other temporal properties provided by the user. The paper introduces the details of the proposed mechanisms as well as the results of our experimental validation.Fundação para a Ciência e a Tecnologia (FCT) -  Projets Rescue (PTDC/EIA/65862/2006), FAVAS (PTDC/EIA-CCO/105034/2008), LIACC-UP Programa de Financiamento Plurianua
Context-sensitivity in IPET for measurement-based timing analysis

The original publication is available at www.springerlink.com Copyright Springer VerlagThe Implicit Path Enumeration Technique (IPET) has become widely accepted as a powerful technique to compute upper bounds on the Worst-Case Execution Time (WCET) of time-critical software components. While the technique works fine whenever fixed execution times can be assumed for the atomic program parts, standard IPET does not consider the context-dependence of execution times. As a result, the obtained WCET bounds can often be overly pessimistic. The issue of context-dependence has previously been addressed in the field of static timing analysis, where context-dependent execution times of program parts can be extracted from a hardware model. In the case of measurement-based execution time analysis, however, contexts must be derived from timed execution traces. In the present extended abstract we present an overview of our work on the automatic detection and exploitation of context dependencies from timed execution traces. ?? 2010 Springer-Verlag
Increasing Functional Coverage by Inductive Testing: A Case Study

This paper addresses the challenge of generating test sets that achieve functional coverage, in the absence of a complete specification. The inductive testing technique works by probing the system behaviour with tests, and using the test results to construct an internal model of software behaviour, which is then used to generate further tests. The idea in itself is not new, but prior attempts to implement this idea have been hampered by expense and scalability, and inflexibility with respect to testing strategies. In the past, inductive testing techniques have tended to focus on the inferred models, as opposed to the suitability of the test sets that were generated in the process. This paper presents a flexible implementation of the inductive testing technique, and demonstrates its application with case-study that applies it to the Linux TCP stack implementation. The evaluation shows that the generated test sets achieve a much better coverage of the system than would be achieved by similar non-inductive techniques.Peer-reviewedPost-print22nd IFIP International Conference on Testing Software and Systems, Natal, Brazil, 8-10 November 201
More Testable Properties

International audienceIn this paper, we explore the set of testable properties within the Safety-Progress classification where testability means to establish by testing that a relation, between the tested system and the property under scrutiny, holds. We characterize testable properties wrt. several relations of interest. For each relation, we give a su cient condition for a property to be testable. Then, we study and delineate, for each Safety-Progress class, the subset of testable properties and their corresponding test oracle producing verdicts for the possible test executions. Finally, we address automatic test generation for the proposed framework
Verification of an AFDX infrastructure using simulation and probabilities

International audienceUntil recently, there was not a strong need for networking inside aircrafts. Indeed, the communications were mainly cabled and handled by etherned protocols. The evolution of avionics embedded systems and the number of integrated functions in civilian aircrafts has changed the situation. Indeed, those functionalities implies a huge increase in the quantity of data exchanged and thus in the number of connections between functions. Among the available mechanisms provided to handle this new complexity, one find Avionics Full Duplex Switched Ethernet (AFDX), a protocol that allows to simulate a point-to-point network between a source and one or more destinations. The core idea in AFDX is the one of Virtual Links (VL) that are used to simulate point-to-point communication between devices. One of the main challenge is to show that the total delivery time for packets on VL is bounded by some predefined value. This is a difficult problem that also requires to provide a formal, but quite evolutive, model of the AFDX network. In this paper, we propose to use a component-based design methodology to describe the behavior of the model. We then propose a stochastic abstraction that allows not only to simplify the complexity of the verification process but also to provide quantitative information on the protocol
Statistical Model Checking: An Overview

International audienceQuantitative properties of stochastic systems are usually specified in logics that allow one to compare the measure of executions satisfying certain temporal properties with thresholds. The model checking problem for stochastic systems with respect to such logics is typically solved by a numerical approach [31,8,35,22,21,5] that iteratively computes (or approximates) the exact measure of paths satisfying relevant subformulas; the algorithms themselves depend on the class of systems being analyzed as well as the logic used for specifying the properties. Another approach to solve the model checking problem is to simulate the system for finitely many executions, and use hypothesis testing to infer whether the samples provide a statistical evidence for the satisfaction or violation of the specification. In this tutorial, we survey the statistical approach, and outline its main advantages in terms of efficiency, uniformity, and simplicity
Compensation-aware runtime monitoring

To avoid large overheads induced by runtime monitoring, the use of\ud
asynchronous log-based monitoring is sometimes adopted — even though this\ud
implies that the system may proceed further despite having reached an anomalous\ud
\ud
state. Any actions performed by the system after the error occurring are undesirable, since for instance, an unchecked malicious user may perform unauthorized\ud
\ud
actions. Since stopping such actions is not feasible, in this paper we investigate\ud
\ud
the use of compensations to enable the undoing of actions, thus enriching asynchronous monitoring with the ability to restore the system to the original state\ud
\ud
in which the anomaly occurred. Furthermore, we show how allowing the monitor to adaptively synchronise and desynchronise with the system is also possible\ud
\ud
and report on the use of the approach on an industrial case study of a financial\ud
transaction system.peer-reviewe
LarvaStat : monitoring of statistical properties

Execution paths expose non-functional information such as system reliability and performance, which can be collected using runtime verification techniques. Statistics gathering and evaluation can be very useful for processing such information for areas ranging from performance profiling to user modelling and intrusion detection. In this paper, we give an overview of LarvaStat -- a runtime verification tool extending LARVA [2] with the ability to straight forwardly specify real-time related statistical properties. Being automaton-based, LarvaStat also makes explicit the overhead induced by monitoring.peer-reviewe
Interval-valued algebras and fuzzy logics

In this chapter, we present a propositional calculus for several interval-valued fuzzy logics, i.e., logics having intervals as truth values. More precisely, the truth values are preferably subintervals of the unit interval. The idea behind it is that such an interval can model imprecise information. To compute the truth values of ‘p implies q’ and ‘p and q’, given the truth values of p and q, we use operations from residuated lattices. This truth-functional approach is similar to the methods developed for the well-studied fuzzy logics. Although the interpretation of the intervals as truth values expressing some kind of imprecision is a bit problematic, the purely mathematical study of the properties of interval-valued fuzzy logics and their algebraic semantics can be done without any problem. This study is the focus of this chapter
Fast k-NN classifier for documents based on a graph structure

In this paper, a fast k nearest neighbors (k-NN) classifier for documents is presented. Documents are usually represented in a high-dimensional feature space, where terms appeared on it are treated as features and the weight of each term reflects its importance in the document. There are many approaches to find the vicinity of an object, but their performance drastically decreases as the number of dimensions grows. This problem prevents its application for documents. The proposed method is based on a graph index structure with a fast search algorithm. It’s high selectivity permits to obtain a similar classification quality than exhaustive classifier, with a few number of computed distances. Our experimental results show that it is feasible the use of the proposed method in problems of very high dimensionality, such as Text Mining