نتایج جستجو برای: mcnaughton function
تعداد نتایج: 1213156 فیلتر نتایج به سال:
Title: Association between diet quality, dietary patterns and cardiometabolic health in Australian adults: a cross-sectional study Authors: Katherine Livingstone ([email protected]) Sarah McNaughton ([email protected]) Version: 2 Date: 13 Jan 2018 Author’s response to reviews: Manuscript ID: NUTJ-D-17-00316R1 Manuscript title: Association between diet quality, dietary pat...
Desde a década de 1980, um número crescente universidades, como parte sua missão, passa assumir transformações internas fim se adaptar às condições externas e legitimar o seu papel na economia, dando origem novo tipo universidade: universidade empreendedora. Este estudo analisou os elementos determinantes da orientação empreendedora (OE) nas universidades públicas federais Região Nordeste do Br...
abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...
As an alternative to the two classical proofs for complemen-tation of B uchi automata, due to B uchi himself and to McNaughton, we outline a third approach, based on stratiied alternating automata with a \weak" acceptance condition. Building on work by Muller, Saoudi, Schupp (1986) and Kupferman and Vardi (1997), we present a streamlined version of this complementation proof. An essential point...
Abstract. A few things are known, and many are unknown, on the automorphism group of the free MV-algebra over n − 1 generators. In this paper we show that this group appears as the stabilizer of 1l in the larger group of all automorphisms of the free cancellative hoop over n generators. Both groups have a dual action on the same space, namely the (n − 1)-dimensional cube. The larger group has a...
This work considers a finite-duration variant of Muller games, and their connection to infinite-duration Muller games. In particular, it studies the question of how long a finiteduration Muller game must be played before the winner of the finite-duration game is guaranteed to be able to win the corresponding infinite-duration game. Previous work by McNaughton has shown that this must occur afte...
C. S. McNaughton, A. D. Clarke, V. Kapustin, Y. Shinozuka, S. G. Howell, B. E. Anderson, E. Winstead, J. Dibb, E. Scheuer, R. C. Cohen, P. Wooldridge, A. Perring, L. G. Huey, S. Kim, J. L. Jimenez, E. J. Dunlea, P. F. DeCarlo, P. O. Wennberg, J. D. Crounse, A. J. Weinheimer, and F. Flocke School of Ocean and Earth Science and Technology, University of Hawaii, Honolulu, HI, 96822, USA NASA Langl...
A growing body of evidence suggests that the spatial and the temporal domains seem to share the same or similar conditions, basic effects, and mechanisms. The blocking, unblocking and overshadowing experiments (and also those of latent inhibition and perceptual learning reviewed by Prados and Redhead in this issue) show that to exclude associative learning as a basic mechanism responsible for s...
Church’s Problem asks for the construction of a procedure which, given a logical specification φ on sequence pairs, realizes for any input sequence I an output sequenceO such that (I,O) satisfies φ. McNaughton reduced Church’s Problem to a problem about two-player ω-games. Büchi and Landweber gave a solution for Monadic Second-Order Logic of Order (MLO) specifications in terms of finite-state s...
We examine a class of infinite two-person games on finitely coloured graphs. The main aim is to construct finite memory winning strategies for both players. This problem is motivated by applications to finite automata on infinite trees. A special attention is given to the exact amount of memory needed by the players for their winning strategies. Based on a previous work of Gurevich and Harringt...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید