Le présent article a pour but de proposer une méthode de constitution de corpus pour transcrire les traits tant prosodiques que gestuels, qui avaient été peu pris en compte jusqu’à présent. Comme constitutifs du corpus, les aspects formels et kinésiques de l’activité gestuelle, ainsi que le rapport temporel et fonctionnel entre geste et discours sont expliqués, afin de mieux appréhender l’organisation du discours et de l’interaction. A titre d’exemple, une thématisation est analysée.

Le présent article a pour but de proposer une méthode de constitution de corpus pour transcrire les traits tant prosodiques que gestuels, qui avaient été peu pris en compte jusqu’à présent. Comme constitutifs du corpus, les aspects formels et kinésiques de l’activité gestuelle, ainsi que le rapport temporel et fonctionnel entre geste et discours sont expliqués, afin de mieux appréhender l’organisation du discours et de l’interaction. A titre d’exemple, une thématisation est analysée.

We examine the range of anonymity that is compatible with a Paretian social welfare relation (SWR) on infinite utility streams. Three alternative coherence properties of an SWR are considered, namely, acyclicity, quasi-transitivity, and Suzumura consistency. For each case, we show that a necessary and sufficient condition for a set of permutations to be the set of permissible permutations of some Paretian SWR is given by the cyclicity of permutations and a weakening of group structure. Further, for each case of coherence (...) property, we show that the extended Pareto rule is the least element of the class of anonymous Paretian SWRs. (shrink)

日本人はグローバル化の潮流といかに向き合うべきなのか―そのヒントは「国学」にあった。先人たちが葛藤した問いのなかを私たちはいまも生きている。.

Discovery of representative Web pages regarding specific topics is important for assisting users' information retrieval from the Web. Researches on Web structure mining, whose goals are to discover or to rank important Web pages based on the graph structure of hyperlinks, have been very active recently. A complete bipartite of Web graph, which is composed of centers (containing useful information regarding specific topic) and fans (containing hyperlinks to centers), can be regarded as a Web community sharing a common interest. Although (...) Murata's method for discovering Web communities is a simple method for finding related Web pages, it has the following weaknesses: (1) since the number of centers increases monotonously, pages irrelevant to the members of Web communities may be added in the process of discovery, and (2) since the number of fans decreases monotonously according as the number of centers increases, the method may suffer topic drift. This paper describes an improved method for refining Web communities in order to acquire representative Web pages of the topics of input Web communities. The method is based on the assumption that most of the fans contain hyperlinks pointing to representative pages regarding their topic, and that hyperlinks to the pages of the same quality often co-occur. In our new method, both fans and centers are renewed iteratively by the result of the majority vote of the members of previous Web community. Results of our experiments show that the new method has abilities of finding desirable pages for several topics. (shrink)

This paper proposes a method for discovering Web communities. A complete bipartite graph K i, j of Web pages can be regarded as a community sharing a common interest. Discovery of such community is expected to assist users’ information retrieval from the Web. The method proposed in this paper is based on the assumption that hyperlinks to related Web pages often co-occur. Relations of Web pages are detected by the co-occurrence of hyperlinks on the pages which are acquired from a (...) search engine by backlink search. In order to find a new member of a Web community, all the hyperlinks contained in the acquired pages are extracted. A page which is pointed by the most frequent hyperlinks is regarded as a new member of the community. We have build a system which discovers complete bipartite graphs based on the method. Only from a few URLs of initial community members, the system succeeds in discovering several genres of Web communities without analyzing the contents of Web pages. (shrink)

明治維新を支えた志士たちは、儒教を行動の指針としていた。尊王攘夷という中国からの思想は、やがて日本中心主義へと置き変わる。.

Magnetoencephalography (MEG) and electroencephalography (EEG) are invaluable neuroscientific tools for unveiling human neural dynamics in three dimensions (space, time, and frequency), which are associated with a wide variety of perceptions, cognition, and actions. MEG/EEG also provides different categories of neuronal indices including activity magnitude, connectivity, and network properties along the three dimensions. In the last 20 years, interest has increased in inter-regional connectivity and complex network properties assessed by various sophisticated scientific analyses. We herein review the definition, computation, short history, (...) and pros and cons of connectivity and complex network (graph-theory) analyses applied to MEG/EEG signals. We briefly describe recent developments in source reconstruction algorithms essential for source-space connectivity and network analyses. Furthermore, we discuss a relatively novel approach used in MEG/EEG studies to examine the complex dynamics represented by human brain activity. The correct and effective use of these neuronal metrics provides a new insight into the multi-dimensional dynamics of the neural representations of various functions in the complex human brain. (shrink)

Le présent article vise à développer la notion d’« interprétation argumentative » introduite par Carel dans la Théorie des Blocs Sémantiques avec deux autres notions, celles de « décodage argumentatif » et de « Carte Argumentative du Lexique ». Il s’agira de montrer que l’interprétation argumentative est soumise à des contraintes alors que Carel semble donner plus de poids à la liberté qu’on a d’interpréter argumentativement un énoncé.

Let H be a proof system for quantified propositional calculus (QPC). We define the Σqj-witnessing problem for H to be: given a prenex Σqj-formula A, an H-proof of A, and a truth assignment to the free variables in A, find a witness for the outermost existential quantifiers in A. We point out that the Σq1-witnessing problems for the systems G*1and G1 are complete for polynomial time and PLS (polynomial local search), respectively. We introduce and study the systems G*0 and G0, (...) in which cuts are restricted to quantifier-free formulas, and prove that the Σqj-witnessing problem for each is complete for NC1. Our proof involves proving a polynomial time version of Gentzen’s midsequent theorem for G*0 and proving that G0-proofs are TC0-recognizable. We also introduce QPC systems for TC0 and prove witnessing theorems for them. We introduce a finitely axiomatizable second-order system VNC1 of bounded arithmetic which we prove isomorphic to Arai’s first order theory AID + Σb0-CA for uniform NC1. We describe simple translations of VNC1 proofs of all bounded theorems to polynomial size families of G*0 proofs. From this and the above theorem we get alternative proofs of the NC1 witnessing theorems for VNC1 and AID. (shrink)

Le présent travail vise à proposer une description de la métaphore filée dans le cadre de la Théorie des Blocs Sémantiques. Il s’agira de soutenir qu’il existe au moins deux modes de construction pour les discours correspondant à la structure que nous appellerons « minimale » de la métaphore filée. Nous chercherons à montrer que de tels discours se laissent décrire notamment en termes de « schéma argumentatif signifié » et « schéma argumentatif préfiguré ».

Cet article a pour objectif de soutenir que certains éléments de sens communiqués par un énoncé, qui sont le plus souvent vus dans la sémantique vériconditionnelle ordinaire comme implicites, sont susceptibles d’être réanalysés dans une sémantique argumentative, la Théorie des Blocs Sémantiques, comme faisant partie du contenu explicite de l’énoncé, dans la mesure où de tels éléments constituent des « enchaînements argumentatifs » sémantiquement indécomposables.