bluuebunny/crossref_metadata_2025_split huggingface dataset:
POUR UNE NOUVELLE APPROCHE COMMUNAUTAIRE DU SERVICE D'INTÉRĚT ÉCONOMIQUE GÉNÉRAL*
Authors: Fournier Par Jacques 
Published: April 2007

RESUME**: Face à laprimauté de la politique de la concurrence dans la construction européenne la prise en compte du service d'intérět économique général peut ětre un élément utile de rééquilibrage. L'auteur propose dans ce but une nouvelle approche. Celle‐ci trouverait sa base dans une modification du traité dont les termes possibles sont discutés. Elle devrait se traduire concrètement par la mise en oeuvre de quatre orientations: le développement et l'interopérabilité des grands réseaux d'infrastructure; la qualité et l'accessibilité du service public, qui ne se réduit pas au “service universel”; un meilleur usage de la concurrence et l'amélioration de l'efficacité de l'actionpublique.* Comme le rappelait récemment son président, Fritz Gautier, le CIRIEC n'est pas un groupe de pression mais une institution scientifique de réflexion et d'étude. Cela n'interdit pas à ses membres d'avoir une opinion sur l'évolution souhaitable des politiques dans les domaines qu'ils étudient.C'est une telle opinion qui est exprimée ci‐dessous. Elle n'engage que son auteur, qui l'a présentée le 21 mai 1996 au 21ème congrès international du CIRIEC à Lisbonne. Elle s'appuie sur une expérience acquise en qualité de fonctionnaire de l'Etat français, de président de grandes entreprises publiques françaises et de président du Centre européen des entreprises à participation publique.
CONTRIBUTIONS DU MOUVEMENT COOPÉRATIF AU CONTRǑLE DE L'ÉCONOMIE ET À LA COHÉSION SOCIALE DU QUÉBEC
Authors: ST‐PIERRE Par Majella 
Published: April 2007

RESUME*: Selon l'auteur, le mouvement coopératif du Québec s'est développé en trois grandes étapes:—1900–1920;‐1940–1960;‐1975–1985, sous l'impulsion de leaders proches des besoins populaires. Prětres, intellectuels, membres de professions libérales, leaders syndicaux et communautaires liés par le nationalistie québécois, vont permettre au mouvement coopératif de se donner un enracinement populaire exceptionnel et des résultats économiques impressionnants.i
Parsing with restricted quantification: an initial demonstration1
Authors: Frisch Alan M. 
Published: April 2007

The primary goal of this paper is to illustrate how smaller deductive search spaces can be obtained by extending a logical language with restricted quantification and tailoring an inference system to this extension. The illustration examines the search spaces for a bottom‐up parse of a sentence with a series of four strongly equivalent grammars. The grammars are stated in logical languages of increasing expressiveness, each restatement resulting in a more concise grammar and a smaller search space.A secondary goal is to point out an area where further research could yield results useful to the design of efficient parsers, particularly for grammatical formalisms that rely heavily on feature systems.
Similarity‐based learning and its extensions
Authors: Rendell Larry 
Published: April 2007

This paper synthesizes a number of approaches to concept representation and learning in a multilayered model. The paper emphasizes what has been called similarity‐based learning (SBL) from examples, although this review is extended to address wider issues. The paper pays particular attention to requirements for incremental and uncertain environments, and to interrelationships among concept purpose, concept representation, and concept learning.One goal of the paper is to unite some of the notions underlying recent research, in an attempt to construct a more complete and extensible framework. This framework is designed to capture representations and methods such as those based on hypothesis search and bias selection, and to extend the ideas for greater system capability. This leads to a specific perspective for multilayered learning which has several advantages, such as greater clarity, more uniform learning, and more powerful induction.The approach clarifies and unifies various aspects of the problem of concept learning. Some results'are (1) Various concept representations (such as logic, prototypes, and decision trees) are subsumed by a standard form which is well suited to learning, particularly in incremental and uncertain environments; (2) Concept learning may be enhanced by exploiting a particular phenomenon in many spaces‐this phenomenon is a certain kind of smoothness or regularity, one instance of which underlies the similarity in SBL systems; (3) The paper treats the phenomenon in a general way and applies it hierarchically. This has various advantages of uniformity. For example the model allows layered learning algorithms for concept learning all to be instantiations of one basic algorithm. A single kind of representation (an instantiation of the standard form) is prominent at each level. The combination of representation and algorithm allows fast, accurate, concise, and robust concept learning.
Denkprothesen: on programs that reason
Authors: DWYER MICHAEL W. 
Published: April 2007

This paper considers computer programs that purport to do inference. It finds the essence of their reasoning ability to reside in a particular relationship which exists between the computations described by the texts of those programs and machine‐independent formal representations of the theories in which they are said to reason. The principal novelties in the treatment of this question are the use of explicit “abstraction functions” between states of a computation and sets of sentences of a theory, and the notion of global “inference relations” which characterize the set of all inferences of which a system is capable. The central result of the paper is an “arrow‐theoretic” characterization of the concept of a knowledge representation, along with the related concept of a knowledge representation realization. The notions of equivalence and subsumption for knowledge representations are defined, as well as equivalence of knowledge representation realizations. Finally, important issues of expression evaluation and control are addressed. The paper concludes with a slogan: “The AI is in the arrows.”Cet article traite des programmes informatiques qui prétendent faire de ľinférence. Ľauteur constate que ľessentiel de leur capacityé de raisonnement réside dans la relation particulière qui existe entre les calculs décrits par les textes de ces programmes et les représentations formelles non liées à un type de machine des théories dans le cadre desquelles ils sont supposés raisonner. Les principales nouveautés dans le traitement de cette question sont ľutilisation de fonctions ?abstraction explicites éntre les etats ?un calcul et les ensembles de phrases ?une théorie, et la notion de relations ?inférence globales qui caractérisent ľensemble de toutes les inférences dont un système est capable. Le principal résultat de cet article est une caractérisation du concept de la représentation des connaissances, ainsi que du concept connexe de la réalisation de la représentation des connaissances. Les notions ?équivalence et de sous‐somption pour la représentation des connaissances sont définies, ainsi que ľéquivalence des réalisations de la représentation des connaissances. Enfin, des questions importantes comme ľanalyse et le contr&#x006f;&#x030c;le ?expressions sont traitées.
Notes on Ginsberg's multivalued logics
Authors: SCHAERF MARCO 
Published: April 2007

The use of multivalued logics for knowledge representation and nonmonotonic reasoning has often been advocated, in particular within the general framework proposed by Ginsberg in his paper “Multivalued logics: a uniform approach to reasoning in artificial intelligence.” His system is based on a multivalued logic with an arbitrary number of truth values classified with respect to two partial orders, a truth order and a knowledge order. This classification is very interesting and gives an intuitive appeal to the framework. In this paper the work by Ginsberg is critically reviewed, pointing out some flaws and ways to overcome them. Moreover, we present some ideas on how to modify the original schema in order to obtain a more semantically well‐founded framework.L'utilisation de la Iogique multivalente pour la représentation des connaissances et le raisonnement non monotone a souvent été préconisée, en particulier à l'intérieur du cadre général proposé par Ginsberg dans son article intitulé? Multivalued logics: a uniform approach to reasoning in artificial intelligence ? Son système est basé sur une logique multivalente comportant un nombre arbitraire de valeurs de vérité classées selon deux ordres partiels: un ordre de vérité et un ordre de connaissances. Cette classification est très intéressante et donne un attrait intuitif au cadre. Dans cet article, l'auteur examine le travail de Ginsberg, y relève des lacunes et propose des moyens de les corriger. De plus, il expose certaines idées en vue de modifier le schéma original et ainsi obtenir un meilleur cadre du point de vue de la sémantique.
Self‐learning inductive inference machines
Authors: CERANS KARLIS H. , SMITH CARL H. 
Published: April 2007

Self‐knowledge is a concept that is present in several philosophies. In this article, we consider the issue of whether or not a learning algorithm can in some sense possess self‐knowledge. The question is answered affirmatively. Self‐learning inductive inference algorithms are taken to be those that learn programs for their own algorithms, in addition to other functions.La connaissance de soi est un concept qui se retrouve dans plusieurs philosophies. Dans cet article, les auteurs s'interrogent à savoir si un algorithme d' apprentissage peut dans une certaine mesure posséder la connaissance de soi. lis apportent une reponse positive a cette question. Les algorithmes d'inference inductive autodidactes sont ceux qui font l'apprentissage de programmes pour leurs propres algorithmes, en plus d' autres fonctions.
Planning in polynomial time: the SAS‐PUBS class
Authors: BÄCKSTRÖM CHRISTER , KLEIN INGER 
Published: April 2007

This article describes a polynomial‐time, O(n3), planning algorithm for a limited class of planning problems. Compared to previous work on complexity of algorithms for knowledge‐based or logic‐based planning, our algorithm achieves computational tractability, but at the expense of only applying to a significantly more limited class of problems. Our algorithm is proven correct, and it always returns a parallel minimal plan if there is a plan at all.Cet article décrit un algorithme de planification de temps polynomial O(n3) pour une classe restreinte de problemes de planification. Contrairement aux travaux précédents sur la complexité des algorithmes pour la planification basée sur la logique ou les connaissances, l' algorithme dont il est question dans cet article permet d' obtenir la tractabilityé computationnelle; cependant, il ne peut ětre appliqué qu'à une catégorie beaucoup plus restreinte de problèmes. Cet algorithme s'est done révélé correct et il génère toujours un plan minimal en parallèle lorsqu'il y en a un.
A new model of lexical choice for nouns1
Authors: Reiter Ehud 
Published: April 2007

Natural language generation systems should choose nouns by searching for lexical units that (i) are known to the user; (ii) truthfully describe the object being lexicalised; (iii) convey sufficient information to fulfill the system's underlying communicative goals; and (iv) are maximal under a lexical preference function. This model of lexical choice allows a clean separation to be made between what the system knows about the object being lexicalized and what it wishes to communicate about this object. The model also allows lexical choice to be biased towards basic‐level and other preferred lexical units.Les systèmes de génération du langage naturel devraient choisir des noms en recherchant des unités lexicales (i) qui soient connues de ľutilisateur, (ii) qui décrivent fidèlement ľobjet soumis à un traitement lexical, (iii) qui transmettent suffisamment ?information pour répondre aux objectifs de communication du système, et (iv) qui soient maximales dans une fonction de préférence lexicale. Ce modéle de choix lexical permet une nette séparation entre ce que le système sait à propos de ľobjet soumis à un traitement lexical et ce qu'il souhaite communiquer à propos de cet objet. Le modèle permet également au choix lexical ?avoir un préjugé vis‐à‐vis les unités lexicales de niveau de base et autres unités lexicales préférées.
SYNTAX OR SEMANTICS? HANDLING NONLOCAL DEPENDENCIES WITH MCTAGS OR SYNCHRONOUS TAGS
Authors: Abeillé Anne 
Published: April 2007

We show how multicomponent TAGs, although in their “local” version equivalent to “simple” TAGs, enable one to associate the derived structures with a richer set of derivations. This is especially useful for representing some nonlocal dependencies such as wh‐extraction out of NP or extraposition, as soon as one interprets the derivation structures as representing the predicate‐argument dependencies. However, there is a formal alternative in the formalism of synchronous TAGs that achieves a similar result, namely, that associates standard syntactic derivations with nonisomorphic semantic derivations, and relies on the latter to represent the dependency relations. We show that the latter treatment accounts for a different range of extraposition facts in French, where the relationship between the head noun and its extraposed dependent is a semantic one.Nous montrons comment les TAGs ensemblistes “locales” (MCTAGs), qui sont équivalentes aux TAGs simples, permettent ?associer aux structures syntaxiques dérivées un ensemble plus large de structures dérivationnelles. Cela est particulièrement utile pour la représentation des dépendances non locales qu'on observe dans les extractions hors du groupe nominal et les extrapositions, à partirdu moment oùľon interprète les arbres de dérivation comme représentant les relations de dépendance. II existe toutefois une autre possibilityé dans le cadre des TAGs synchrones qui associe aux dérivations syntaxiques standard des dérivations sémantiques non isomorphes et interprète les relations de dépendance en se basant sur ces dernières. Nous montrons que cette deuxième possibilityé est mieux adaptée pour des cas ?extraposition en français où la relation de dépendance entre le nom těte et ľélément extraposé est ?ordre sémantique.
GENERAL GAME‐PLAYING AND REINFORCEMENT LEARNING
Authors: Levinson Robert 
Published: April 2007

This paper provides a blueprint for the development of a fully domain‐independent single‐agent and multiagent heuristic search system. It gives a graph‐theoretic representation of search problems based on conceptual graphs and outlines two different learning systems. One, an “informed learner”, makes use of the graph‐theoretic definition of a search problem or game in playing and adapting to a game in the given environment. The other, a “blind learner”, is not given access to the rules of a domain but must discover and then exploit the underlying mathematical structure of a given domain. Relevant work of others is referenced within the context of the blueprint.To illustrate further how one might go about creating general game‐playing agents, we show how we can generalize the understanding obtained with the Morph chess system to all games involving the interactions of abstract mathematical relations. A monitor for such domains has been developed, along with an implementation of a blind and informed learning system known as Morphll. Performance results with MorphK are preliminary but encouraging and provide a few more data points with which to understand and evaluate the blueprint.
A STRENGTHENED ALGORITHM FOR TEMPORAL REASONING ABOUT PLANS
Authors: Song Fei , Cohen Robin 
Published: April 2007

Allen's interval algebra has been shown to be useful for representing plans. We present a strengthened algorithm for temporal reasoning about plans, which improves on straightforward applications of the existing reasoning algorithms for the algebra. This is made possible by viewing plans as both temporal networks and hierarchical structures. The temporal network view allows us to check for inconsistencies as well as propagate the effects of new temporal constraints, whereas the hierarchical view helps us to get the strengthened results by taking into account the dependency relationships between actions.We further apply our algorithm to the process of plan recognition through the analysis of natural language input. We show that such an application has two useful effects: the temporal relations derived from the natural language input can be used as constraints to reduce the number of candidate plans, and the derived constraints can be made more specific by combining them with the prestored constraints in the plans being recognized.
Clasping Hands and Folding Arms: A Data Investigation
Authors: MacGillivray Helen 
Published: April 2007

SummaryThis is the first of a series on data investigations in which the cycle of issues, planning, collecting, exploring, interpreting and discussing is reported for selected data investigations, with the data sets available on the Blackwell repository. The motivating issues for the investigation of this report were the manner in which people clasp their hands and fold their arms. The data set yields some interesting aspects for students, for teaching and for future or further investigations, and illustrates the needs for systematic and thoughtful exploration of data.
Measuring Marbles: Demonstrating the Basic Tenets of Measurement Theory
Authors: Wininger Steven R. 
Published: April 2007

SummaryA hands‐on activity is described in which students attempt to measure something that they cannot see. In small groups, students estimate the number of marbles in sealed boxes. Next, students’ estimates are compared with the actual numbers. Last, values from both the students’ estimates and actual numbers are used to explain measurement theory and reliability.
There is no ‘truth’ outside a context: implications for the teaching of analytical psychology in the 21st century
Authors: Horne Michael 
Published: April 2007

Abstract:  Humans are from birth embedded in a historical and contemporary context of meanings. This always constrains their theoretical and practical activities. In this paper, I will be suggesting that there are no guiding ‘truths’ outside such contexts. In order to understand the foundations of any concept or new idea, it is important to comprehend the context in which it is embedded. Candidates and some of their teachers have very little knowledge of the intellectual context in which Jung or any other analytic theorist wrote. As a result, the analytic ‘founders’ are often believed to have discovered ‘truths’ transcending the context of history and of everyday life. They were, however, as much creative synthesizers as pure originators.I propose that the components of all analytic theories emerge from their embeddedness. I contend, therefore, that the understandings of these components such as psychic causality, epistemology and identity formation were quite differently conceived at the time the analytic founders were working than they are today. I will give examples to show how the acceptance of this attitude is useful in inculcating a discerning approach in candidates towards traditionally accepted analytic theories and practices. This can provide them with a method to promote their individual creative development.
The alchemy of training
Authors: Egger‐Biniores Deborah 
Published: April 2007

Abstract:  Training in Zurich has its own special character but also is marked by the very fact that it is in Zurich. Zurich radiates its own distinct energy and carries a specific historical significance in the world of analytical psychology. This, like all things with psychic energy, has a spectrum of meaning. This spectrum, as well as the ‘spirit’ of the place, will be critically examined, taking into account the ‘blessings’ and ‘curses’ of such genius loci.Training in Zurich is experientially based and is first and foremost an initiation: an initiation into symbolic life, or rather life where symbol plays an important role. Training is understood to involve a transformation of one's self, much like the 8th century alchemist Morienus Romanus understood the opus as a ‘human transformation system’. It is not merely an education.The requirement of ‘immersion’ is core to the experience of becoming an analyst in Zurich and this sets up a valuable discomfort between rational intellectual learning and intuitive experience, between knowing and not‐knowing. How does this dis‐serve the making of an analyst? What is implicit in this immersion and its discomfort? Does it have a role in today's emphasis on clinical and empirical training? Does Zurich still offer something unique and valuable in the world of training, or is it passé? From these questions, the dichotomy of what is ‘urgent’ and ‘essential’ in training will be examined.
Evaluating progress in training: character or competence?
Authors: Wiener Jan 
Published: April 2007

Abstract:  Jung was mercurial in his attitudes to method and technique, leaving us a problematic legacy when it comes to evaluating the progress of trainees. Some would say that those of us involved with the assessment of candidates during their training continue to rely too heavily on intuition and subjective assessments. However good our admissions' procedures and the structures in place to review progress, the emotional and financial demands for trainees of embarking on an analytic training, the tendency for analytic institutes to remain opaque and slow to link up with the external world and the cliques within our profession make more objective assessments of progress and readiness to qualify at best haphazard and at worst inadequate.Some trainees have an immediate talent for analytic work; others develop their gifts more slowly; some never find this capacity. Working from a definition of analytic talent, the paper begins to map out a Jungian framework for assessing progress, emphasizing the significance of both character and competence and the developing relationship between them.
Flumazenil selectively prevents the increase in α4‐subunit gene expression and an associated change in GABAAreceptor function induced by ethanol withdrawal
Authors: Biggio Francesca , Gorini Giorgio , Caria Stefania , Murru Luca , Sanna Enrico , Follesa Paolo 
Published: April 2007

AbstractThe actions of ethanol on γ‐aminobutyric acid type A (GABAA) receptors are still highly controversial issues but it appears that some of its pharmacological effects may depend on receptor subunit composition. Prolonged ethanol exposure produces tolerance and dependence and its withdrawal alters GABAAreceptor subunit gene expression and function. Whereas benzodiazepines are clinically effective in ameliorating ethanol withdrawal symptoms, work in our laboratory showed that benzodiazepines also prevent,in vitro, some of the ethanol withdrawal‐induced molecular and functional changes of the GABAAreceptors. In the present work, we investigated the effects, on such changes, of the benzodiazepine receptor antagonist flumazenil that can positively modulate α4‐containing receptors. We here report that flumazenil prevented both the ethanol withdrawal‐induced up‐regulation of the α4‐subunit and the increase in its own modulatory action. In contrast, flumazenil did not inhibit ethanol withdrawal‐induced decrease in α1‐ and δ‐subunit expression as well as the corresponding decrease in the modulatory action on GABAAreceptor function of both the α1‐selective ligand zaleplon and the δ‐containing receptor preferentially acting steroid allopregnanolone. These observations are the first molecular and functional evidence that show a selective inhibition by flumazenil of the up‐regulation of α4‐subunit expression elicited by ethanol withdrawal.