323,894 research outputs found
How Philosophy of Mind Needs Philosophy of Chemistry
No full textBy the 1960s many (perhaps most) philosophers had adopted ‘physicalism’ ─ the view that physical causes fully account for mental activities. However, controversy persists about what count as ‘physical causes’. ‘Reductive’ physicalists recognize only microphysical (elementary-particle-level) causality. Many (perhaps most) physicalists are ‘non-reductive’ ─ they hold that entities considered by other (‘special’) sciences have causal powers. Philosophy of chemistry can help resolve main issues in philosophy of mind in three ways: developing an extended mereology applicable to chemical combination, testing whether ‘singularities’ prevent reduction of chemistry to microphysics, and demonstrating ‘downward causation’ in complex networks of chemical reactions
Textiles, environment, design (TED): making theory into textiles through sustainable design strategies, pedagogy and collaboration
No full textAbstract
The TED research cluster at Chelsea College of Art and Design, University of the Arts London, is a collective of practice-based design researchers whose main concerns are the consideration of the role that the designer can play in creating textiles that have a reduced impact on the environment and to provide a toolbox of designer-centred solutions. The cluster involves both staff and students in projects that apply ecodesign theories to textiles practice, with the aim of generating artefacts and theories that will aid designers in creating „better‟ materials, products, systems and improved social well-being. This essay uses three recent TED projects to illustrate how some of the TED members are creating new textiles, dialogues, and enterprises that are all inspired and guided by the TED cluster and its open, pedagogic and collaborative structure
Earley, T J, NX32540
No full textThis record was harvested from a previous catalogue system and will be withdrawn in 2025. Information in this record may be superseded or incomplete. Visit this record in UMA's new catalogue at: https://archives.library.unimelb.edu.au/nodes/view/383241Surname: EARLEY. Given Name(s) or Initials: T J. Military Service Number or Last Known Location: NX32540. Missing, Wounded and Prisoner of War Enquiry Card Index Number: 33493.222888
Item: [2016.0049.15534] "Earley, T J, NX32540
Proof of Time Bounds for Recognizing Unambiguous and LR(k) Grammars Using Earley's Algorithm
No full textThis paper is meant to present a different proof of the time bounds for Earley 's algorithm for parsing context-free grammars. Often these proofs are difficult to follow, and it is helpful to the reader to be able to see different approaches to a proof. These time bounds are proved in Earley's dissertation, but in many popular textbooks--- including Compilers: Principles, Techniques, and Tools by Aho, Sethi, and Ullman, The Theory of Parsing, Translation, and Compiling by Aho and Ullman, and The Language of Machines: An Introduction to Computability and Formal Languages by Floyd and Beigel--- the proofs are either incomplete or omitted altogether. Earley's algorithm is an important example of dynamic programming. Like the Cocke-Younger-Kasami algorithm, Earley's algorithm breaks a parsing problem into many subproblems. Like the CYK algorithm, it is a general recognizer that works on any context-free grammar. Unlike the CYK algorithm, Earley's algorithm only attempts to solve subproblems that are feasible in the parsing. For this reason, the algorithm solves fewer subproblems when parsing unambiguous and LR(k) grammars. This makes sense intuitively, since the algorithm outputs all of the parse trees for its input, and, given an unambiguous grammar, it will only output one tree. Furthermore, when parsing LR(k) grammars, the algorithm only solves those subproblems that will actually be in the parse tree for its input (using a lookahead of at least k). In a sense, it builds the parse tree without wasting time building parts of trees that will not be in final parse tree; thus it runs in time directly proportional to the size of the parse tree. In the following section, the terminology used in this paper is defined. Then, a simplified version of the algorithm is presented. ..
Russian-Language Verification of P.C. Earley and S. Ang’s “Cultural Intelligence Scale”
No full textThe psychological construct “cultural intelligence” is examined in the article; the stages of the Russian-language verification of P.C. Earley and S. Ang’s “Cultural Intelligence Scale” are described; its psychometric characteristics are given; the results of validation are discussed
The effect of road and sea transport on inflammatory, adrenocortical, metabolic and behavioural responses of weanling heifers
No full textpeer-reviewedThe objective was to investigate the effect of transport on inflammatory, adrenocortical, metabolic and behavioural responses of weanling heifers transported from Ireland to Spain. Background: At the end of the grazing season, 60 Charolais × beef heifers (mean live weight 245, s.e. 4.3 kg and mean weaning age 219, s.e. 4.9 days) were abruptly weaned from their dams on day 0. The animals were assigned by live weight to two treatments, transport (T) (n = 40) (mean 246, s.e. 5.4 kg) and control (C) (n = 20) (mean 247, s.e. 7.2 kg) on day 0. The T animals were transported from Ireland to France on a roll-on roll-off ferry at a stocking density of 0.93 m2/animal and then by road for 9 h to a French lairage while C animals remained in Ireland and were not transported. On arrival at the French lairage (d 2), 20 T animals were unloaded (ULT) and rested for 12 h in the French lairage and 20 animals rested (RT) on the transporter. All animals had access to hay and water. After the rest period, the ULT animals were re-loaded. The subsequent journey by road from France to Spain was 9 h travel, 7 h rest (on the transporter) and a further 7 h travel by road. All T animals were blood sampled prior to transport (day (d) 0; baseline), on arrival in the French lairage (d 2), after 12 h rest in the French lairage (d 2), on arrival at the feedlot in Spain (d 4) and on d 6, d 8, d 10 and d 34. Control animals were blood sampled at the same times as T animals. Results: ULT and RT animals had lower (P 0.05) in plasma protein concentration between RT and ULT animals from day 2 to d 34. Plasma concentrations of urea were higher (P < 0.05) in RT animals from d 2 to d 34 compared with C animals. RT and ULT animals had lower (P < 0.05) non-esterified fatty acid (NEFA) and βeta-hydroxy-butyrate (ßHB) concentrations on d 10 and d 34 compared with d 0. Conclusion: It is concluded that, within the conditions of the present study, the performance of the animals that remained on the transporter during the 12 h lairage period in France was not different post-transport from the transported animals that were unloaded and lairaged in France
Earley-based stochastic context-free grammar estimation from bracketed corpora and its use in a hybrid languaje model
No full textEn este artículo estudiamos el problema de la estimación de gramáticas incontextuales
estocásticas en formato general y su uso en un modelo de lenguaje híbrido.
En este trabajo se propone la estimación de una gramática incontextual estocástica usando
una nueva versión del algoritmo de Earley que permite manejar muestras parentizadas. El
modelo de lenguaje híbrido es definido como una combinación lineal de un modelo de ngramas
basado en palabras, que se utiliza para capturar las relaciones locales entre palabras,
y una gramática estocástica, basada en categorías junto con una distribución de palabras en
categorías, que se utiliza para representar las relaciones a largo término entre estas categorías. Se han realizado experimentos usando el corpus UPenn Treebank. La evaluación
de los modelos se ha realizado desde el punto de vista de la perplejidad de un conjunto
de test, y desde el punto de vista de la tasa de errores por palabra en un experimento de
reconocimiento automático del habla.In this paper, we study the problem of estimating Stochastic Context-Free Grammars
(SCFGs) in general format and their use in a hybrid language model. In this work,
we propose the estimation of a SCFG by means of a new bracketed version of the Earley
algorithm. A hybrid language model is defined as a combination of a word-based n-gram,
which is used to capture the local relations between words, and a category-based SCFG
with a word distribution in categories, which is defined to represent the long-term relations
between these categories. Experiments on the UPenn Treebank corpus are reported. These
experiments have been carried out in terms of the test set perplexity and the word error rate
in a speech recognition experiment.This work has been partially supported by the Spanish
CICYT under contract (TIC2002/04103-C03-03)
Diffusive author(s), cohesive author: Analysis of S/N (1994)
No full textThis study indicates the ways in which various aspects of the author(s) are brought forth in Dumb type’s performance art, the S/N production. Previous research has suggested a non-hierarchical organization of Dumb type and the absence of a “privileged author” in Dumb type’s collaborative work, S/N. However, the results that I have investigated from member’s interviews on the creative process of S/N along with my analysis of the recorded images of S/N, indicate a different aspect of the author(s). First, S/N was created through, so to speak, the collective ideas of the members of Dumb type. Further, S/N has at least nine quotations from previous performances, installations, and printed writings, besides the work-in-progress technique. Explicating one of the “author functions” as given by Michel Foucault, each text has plural subjects of the author. However, it has been revealed from members’ interviews that Teiji Furuhashi had a decision-making role in selecting the members’ ideas within the performance. Since then, S/N has had plural subjects of creation; however, Furuhashi is one of the subjects of creation along with the “privileged author.” S/N has plural authors (diffusive authors) yet at the same time, it has a “privileged author,” Teiji Furuhashi (cohesive author)
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
ABSTRACT FORMAL DEVELOPMENT OF CORRECT ALGORITHMS: AN EXAMPLE BASED ON EARLEY'S RECOGNISER
No full textThis paper contains the formal development of a correct algorithm from an implicit definition of the task to be performed. Each step of the development can be accompanied by a proof of its correctness. As well as ensuring the correctness of the final program, the structured development gives considerable insight into the algorithm and possible alternatives. The example used is a simplified form of the recognition algorithm due to Earley.
- …
