نتایج جستجو برای: characterizable group

تعداد نتایج: 979331  

Journal: :CoRR 1994
R. Michael Young Johanna D. Moore

Research in discourse processing has identi ed two representational requirements for discourse planning systems. First, discourse plans must adequately represent the intentional structure of the utterances they produce in order to enable a computational discourse agent to respond e ectively to communicative failures [15]. Second, discourse plans must represent the informational structure of utt...

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 2017
Oded Goldreich Guy N. Rothblum

A proof system is called doubly-efficient if the prescribed prover strategy can be implemented in polynomial-time and the verifier’s strategy can be implemented in almost-linear-time. We present direct constructions of doubly-efficient interactive proof systems for problems in P that are believed to have relatively high complexity. Specifically, such constructions are presented for t-CLIQUE and...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه گیلان - دانشکده علوم انسانی 1392

this study investigated how group formation method, namely student-selected vs. teacher-assigned, influences the results of the community model of teaching creative writing; i.e., group dynamics and group outcome (the quality of performance). the study adopted an experimental comparison group and microgenetic research design to observe the change process over a relatively short period of time. ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تربیت دبیر شهید رجایی - دانشکده علوم انسانی 1392

this study investigated the impact of explicit instruction of morphemic analysis and synthesis on the vocabulary development of the students. the participants were 90 junior high school students divided into two experimental groups and one control group. morphological awareness techniques (analysis/synthesis) and conventional techniques were used to teach vocabulary in the experimental groups a...

Journal: :CoRR 2014
György Turán Jon Yaggie

A formal framework is given for the characterizability of a class of belief revision operators, defined using minimization over a class of partial preorders, by postulates. It is shown that for partial orders characterizability implies a definability property of the class of partial orders in monadic second-order logic. Based on a non-definability result for a class of partial orders, an exampl...

Journal: :Studia Logica 2014
Christian G. Fermüller Christoph Roschger

Motivated by aspects of reasoning in theories of physics, Robin Giles defined a characterization of infinite valued Lukasiewicz logic in terms of a game that combines Lorenzen-style dialogue rules for logical connectives with a scheme for betting on results of dispersive experiments for evaluating atomic propositions. We analyze this game and provide conditions on payoff functions that allow us...

Journal: :Molecular biology and evolution 2001
A D Greenwood F Lee C Capelli R DeSalle A Tikhonov P A Marx R D MacPhee

Endogenous retrovirus-like elements characterizable by a leucine tRNA primer (ERV-Ls) are reiterated genomic sequences known to be widespread in mammals, including humans. They may have arisen from an ancestral foamy virus-like element by successful germ line infection followed by copy number expansion. However, among mammals, only primates and rodents have thus far exhibited high copy number a...

2013
Bhavesh Mehta Tahmina Ansari

(57) Disclosed is a system and method for computing out of plane motion between tWo ultrasound images. The method identi ?es regions of fully developed speckle that are common to the tWo images, computes a correlation coe?icient corresponding to the tWo fully developed speckle image regions, and then computing an elevation distance corresponding to the corre lation coe?icient. The method exploi...

Journal: :Information and Control 1984
A. Prasad Sistla Edmund M. Clarke Nissim Francez Albert R. Meyer

Message passing is one of the primary modes of interprocess communication in a distributed system. In this paper we investigate the possibility of characterizing and axiomatizing different message passing systems in temporal logic. Specifically, we consider FIFO buffers (queues), LIFO buffers (stacks) and unordered buffers (bags). We show that all bounded buffers are characterizable in proposit...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید