Search results for " Computer"
showing 10 items of 6910 documents
Verbal learning and memory and their associations with brain morphology and illness course in schizophrenia spectrum psychoses.
2012
The California Verbal Learning Test and structural brain imaging were administered to 57 subjects with schizophrenia spectrum disorders and 94 controls in a general population sample. Cases had lower semantic cluster scores. Poorer verbal memory strategies were associated with longer duration of illness and heavier use of antipsychotic medication. After controlling for duration of illness, sex, and total gray matter, poorer verbal memory was associated with lower gray matter volume in the cingulate cortex, juxtapositional lobule, right superior temporal gyrus, and precuneus. After controlling for use of antipsychotic medication, there was an association between higher serial clustering and …
Détection de formes compactes en imagerie : développement de méthodes cumulatives basées sur l'étude des gradients : Applications à l'agroalimentaire
2018
The counting cells (Malassez, Thoma ...) are designed to allow the enumeration of cells under a microscope and the determination of their concentration thanks to the calibrated volume of the grid appearing in the microscopic image. Manual counting has major disadvantages: subjectivity, non-repeatability ... There are commercial automatic counting solutions, the disadvantage of which is that a well-controlled environment is required which can’t be obtained in certain studies ( eg glycerol greatly affects the quality of the images ). The objective of the project is therefore twofold: an automated cell count and sufficiently robust to be feasible regardless of the acquisition conditions.In a f…
Neighbor-Distinguishing k-tuple Edge-Colorings of Graphs
2009
AbstractThis paper studies proper k-tuple edge-colorings of graphs that distinguish neighboring vertices by their sets of colors. Minimum numbers of colors for such colorings are determined for cycles, complete graphs and complete bipartite graphs. A variation in which the color sets assigned to edges have to form cyclic intervals is also studied and similar results are given.
Combining workload balance and patient priority maximisation in operating room planning through hierarchical multi-objective optimisation
2022
Abstract Previous analysis suggested the opportunity to consider the preferences of different stakeholders (hospital, patients, doctors and nurses) through the adoption of both patient priority maximisation and workload balance as performance criteria. The aim of this paper is to develop an effective and efficient solution approach for the operating room planning and scheduling capable to take into account the patient priority maximisation and workload balance criteria at the same time. This work is inspired by the need of a deeper understanding of the quality of the solutions obtained when a combination of the two criteria leads the OR planning decisions. Starting from a hierarchical multi…
Elements of Language Theory
1988
In this chapter we shall review the mathematical and computer science background on which the presentation in this book is based. We shall discuss the elements of discrete mathematics and formal language theory, emphasizing those issues that are of importance from the point of view of context-free parsing. We shall devote a considerable part of this chapter to matters such as random access machines and computational complexity. These will be relevant later when we derive efficient algorithms for parsing theoretic problems or prove lower bounds for the complexity of these problems. In this chapter we shall also discuss a general class of formal language descriptors called “rewriting systems”…
Fitbit for learning: Towards capturing the learning experience using wearable sensing
2020
The assessment of learning during class activities mostly relies on standardized questionnaires to evaluate the efficacy of the learning design elements. However, standardized questionnaires pose additional strain on students, do not provide “temporal” information during the learning experience, require considerable effort and language competence, and sometimes are not appropriate. To overcome these challenges, we propose using wearable devices, which allow for continuous and unobtrusive monitoring of physiological parameters during learning. In this paper we set out to quantify how well we can infer students’ learning experience from wrist-worn devices capturing physiological data. We coll…
Debates with Small Transparent Quantum Verifiers
2014
We study a model where two opposing provers debate over the membership status of a given string in a language, trying to convince a weak verifier whose coins are visible to all. We show that the incorporation of just two qubits to an otherwise classical constant-space verifier raises the class of debatable languages from at most NP to the collection of all Turing-decidable languages (recursive languages). When the verifier is further constrained to make the correct decision with probability 1, the corresponding class goes up from the regular languages up to at least E.
The PASSI and Agile PASSI MAS Meta-models Compared with a Unifying Proposal
2005
A great number of processes for multi-agent systems design have been presented in last years to support the different approaches to agent-oriented design; each process is specific for a particular class of problems and it instantiates a specific MAS meta-model. These differences produce inconsistences and overlaps: a MAS meta-model may define a term not referred by another, or the same term can be used with a different meaning. We think that the lack of a standardization may cause a significant delay to the diffusion of the agent paradigm outside research context. Working for this unification goal, it is also necessary to define in unambiguous way the terms of the agent model and their rela…
On Duality in Learning and the Selection of Learning Teams
1996
AbstractPrevious work in inductive inference dealt mostly with finding one or several machines (IIMs) that successfully learn collections of functions. Herein we start with a class of functions and considerthe learner setof all IIMs that are successful at learning the given class. Applying this perspective to the case of team inference leads to the notion ofdiversificationfor a class of functions. This enable us to distinguish between several flavours of IIMs all of which must be represented in a team learning the given class.
Positive Versions of Polynomial Time
1998
Abstract We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems, which we denote by posP . By a well-known result of Razborov, posP is a proper subclass of the class of monotone problems in P . We exhibit complete problems for posP via weak logical reductions, as we do for other logically defined classes of problems. Our work is a continuation of research undertaken by Grigni and Sipser, and subsequently Stewart; indeed, we introduce the notion of a positive deterministic Turing machine and consequently solve a problem posed by Grigni and Sipser.