Search results for "General Computer Science"
showing 10 items of 895 documents
Vertical representation of C∞-words
2015
We present a new framework for dealing with C ∞ -words, based on their left and right frontiers. This allows us to give a compact representation of them, and to describe the set of C ∞ -words through an infinite directed acyclic graph G. This graph is defined by a map acting on the frontiers of C ∞ -words. We show that this map can be defined recursively and with no explicit reference to C ∞ -words. We then show that some important conjectures on C ∞ -words follow from analogous statements on the structure of the graph G.
Tautology as presumptive meaning
2008
Ever since the seminal work of Paul Grice, tautologies such as Business is business have been discussed from a number of angles. While most approaches assume that tautological utterances have to do with the operation of conversational maxims, an integrated analysis is still lacking. This paper makes an attempt at analysing tautologies within the framework of Levinson (2000), who proposes a distinction between three pragmatic levels, namely Indexical Pragmatics, Gricean Pragmatics 1, and Gricean Pragmatics 2. It is shown that observations of Ward and Hirschberg (1991) on the exclusion of alternatives, the claim of Autenrieth (1997) that the second NP in nominal equatives is predicative, and …
Evaluative meaning
2012
Linguistic evaluation has become an important area of inquiry in recent years. In the traditions of, e.g., lexical semantics, phraseology, corpus linguistics, and interactional linguistics, a large inventory of linguistic means have been identified by which speakers can express evaluative meanings. However, the class of German sentential idioms, e.g., Das kannst du dir in die Haare schmieren (lit. ‘You can smear that into your hair’, fig. ‘That is useless’), has not gained much attention. This paper explores how the evaluative meaning of German sentential idioms is constructed syntactically, semantically, and pragmatically. In particular, it is investigated how the meaning of these idioms i…
A Coexistence Analysis of Blockchain, SCADA Systems, and OpenADR for Energy Services Provision
2022
The advent of blockchain technology allows the raise of new business models for the electricity market, opening the way also to end-users and letting them offer regulation services to the power grid. Thanks to the characteristic of being distributed, the blockchain technology could be a solution to balancing problems caused by the penetration of renewable sources, implementing a platform for Demand-Response programs delivery. Demand-Response allows consumers to respond to market signals by increasing or reducing their energy consumption, contributing to greater flexibility and stability of the grid and to a more efficient use of infrastructures and energy resources. Currently, Demand-Respon…
The shortest-path problem with resource constraints with -loop elimination and its application to the capacitated arc-routing problem
2014
Abstract In many branch-and-price algorithms, the column generation subproblem consists of computing feasible constrained paths. In the capacitated arc-routing problem (CARP), elementarity constraints concerning the edges to be serviced and additional constraints resulting from the branch-and-bound process together impose two types of loop-elimination constraints. To fulfill the former constraints, it is common practice to rely on a relaxation where loops are allowed. In a k-loop elimination approach all loops of length k and smaller are forbidden. Following Bode and Irnich (2012) for solving the CARP, branching on followers and non-followers is the only known approach to guarantee integer …
From First Principles to the Burrows and Wheeler Transform and Beyond, via Combinatorial Optimization
2007
AbstractWe introduce a combinatorial optimization framework that naturally induces a class of optimal word permutations with respect to a suitably defined cost function taking into account various measures of relatedness between words. The Burrows and Wheeler transform (bwt) (cf. [M. Burrows, D. Wheeler, A block sorting lossless data compression algorithm, Technical Report 124, Digital Equipment Corporation, 1994]), and its analog for labelled trees (cf. [P. Ferragina, F. Luccio, G. Manzini, S. Muthukrishnan, Structuring labeled trees for optimal succinctness, and beyond, in: Proc. of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2005, pp. 198–207]), are special cases i…
Stability analysis and H∞ controller synthesis of discrete-time switched systems with time delay
2014
Abstract This paper studies the problems of stability analysis and H ∞ controller synthesis of switched systems with time-varying delay based on an input–output approach. The attention is focused on developing a new method to further reduce the conservatism of the existing results. The system under consideration is transformed into an interconnection system, and the scaled small gain condition for the interconnection systems is introduced. Based on the system transformation and the scaled small gain theorem, an improved delay-dependent stability criterion is proposed such that the interconnection system is asymptotically stable, which is also proved to guarantee the asymptotic stability of …
Non-linear protocols for optimal distributed consensus in networks of dynamic agents
2006
We consider stationary consensus protocols for networks of dynamic agents with fixed topologies. At each time instant, each agent knows only its and its neighbors'' state, but must reach consensus on a group decision value that is function of all the agents'' initial state. We show that the agents can reach consensus if the value of such a function is time-invariant when computed over the agents'' state trajectories. We use this basic result to introduce a non-linear protocol design rule allowing consensus on a quite general set of values. Such a set includes, e.g., any generalized mean of order p of the agents'' initial states. As a second contribution we show that our protocol design is t…
Tool support for MOLA
2006
AbstractThe paper describes the MOLA Tool, which supports the model transformation language MOLA. MOLA Tool consists of two parts: MOLA definition environment and MOLA execution environment. MOLA definition environment is based on the GMF (Generic Modeling Framework) and contains graphical editors for metamodels and MOLA diagrams, as well as the MOLA compiler. The main component of MOLA execution environment is a MOLA virtual machine, which performs model transformations, using an SQL database as a repository. The execution environment may be used as a plug-in for Eclipse based modeling tools (e.g., IBM Rational RSA). The current status of the tool is truly academic.
The use of national administrative data to describe the spatial distribution of in-hospital mortality following stroke in France, 2008-2011.
2016
International audience; Background: In the context of implementing the National Stroke Plan in France, a spatial approach was used to measure inequalities in this disease. Using the national PMSI-MCO databases, we analyzed the in-hospital prevalence of stroke and established a map of in-hospital mortality rates with regard to the socio-demographic structure of the country.Methods: The principal characteristics of patients identified according to ICD10 codes relative to stroke (in accordance with earlier validation work) were studied. A map of standardized mortality rates at the level of PMSI geographic codes was established. An exploratory analysis (principal component analysis followed by …