Página 1 dos resultados de 16367 itens digitais encontrados em 0.132 segundos

## Produção documental do legislativo no império - gênese e tipologia: o caso da assembléia legislativa provincial de São Paulo (1835 - 1889); Documentary production of legislative in the empire - gênese and types: the case of the Provincial State Legislature of São Paulo (1835 - 1889)

Pazin, Marcia Cristina de Carvalho
Fonte: Biblioteca Digitais de Teses e Dissertações da USP Publicador: Biblioteca Digitais de Teses e Dissertações da USP
Tipo: Dissertação de Mestrado Formato: application/pdf
Publicado em 02/05/2006 Português
Relevância na Pesquisa
36.462007%
Este trabalho apresenta o desenvolvimento de uma pesquisa de Tipologia Documental em acervo histórico, utilizando como modelo o caso da Assembléia Legislativa Provincial de São Paulo, organismo legislativo da Província de São Paulo durante o período imperial do Brasil. A partir do estudo das condições de criação e de funcionamento da Assembléia Provincial, são apresentados os tipos documentais substantivos de sua atuação - representativos do cumprimento de suas funções - e os documentos acessórios - documentos anexos e complementos encaminhados pela população e instituições locais visando ampliar a argumentação de suas solicitações. Apresenta o Glossário de Formatos, Espécies e Tipos Documentais da Assembléia Legislativa Provincial de São Paulo, instrumento que contém em cada verbete as definições dos tipos documentais representativos do acervo e histórico de utilização dos termos. ; This assignment presents the development of a research of Types of Documents in historical collection, using as model the case of the Provincial State Legislature of São Paulo, legislative organism of the Province of São Paulo during the imperial period of Brazil. Starting from the study of the creation conditions and of operation of the Provincial Assembly...

## Codificação incidental da ordem serial na memória de trabalho visuoespacial: evidências baseadas em uma tarefa de detecção da mudança; Incidental encoding of serial order in visuospatial working memory: evidence based on a change detection task

Santana, Jeanny Joana Rodrigues Alves de
Fonte: Biblioteca Digitais de Teses e Dissertações da USP Publicador: Biblioteca Digitais de Teses e Dissertações da USP
Tipo: Dissertação de Mestrado Formato: application/pdf
Publicado em 03/09/2010 Português
Relevância na Pesquisa
36.4398%
A memória para a ordem dos eventos em uma sequência está relacionada com muitos domínios cognitivos, como direcionar o comportamento a um objetivo, reconhecer uma ação e prever eventos do ambiente. A codificação da ordem serial tem sido, portanto, um tema polêmico a ser explicado pelos modelos de memória de trabalho visuoespacial. Neste estudo investigamos a codificação incidental da ordem serial de eventos em tarefas de reconhecimento de sequências, nas quais a dimensão relevante para a resposta poderia ser a aparência visual, a localização espacial ou a conjunção visuoespacial dos eventos. A tarefa exigia que os participantes (n=60) detectassem uma mudança em um dos estímulos da sequência e ignorassem mudanças na dimensão irrelevante: a ordem na qual os eventos eram apresentados. De maneira geral, o desempenho foi mais prejudicado nas sequências em que a ordem dos itens mudava. A comparação das três condições de memória (aparência visual, localização espacial e conjunção visuoespacial) revelou que houve melhor desempenho na tarefa espacial. Nesta condição, ocorreu uma interação entre os fatores mudança na dimensão relevante (localização espacial) e mudança na dimensão irrelevante (ordem serial). Estes resultados revelam que a ordem foi codificada de forma incidental com as informações relevantes para a tarefa. A diferença do efeito da mudança da dimensão irrelevante para os três tipos de sequências sugere que a ordem foi codificada em um estágio inicial do processamento de informações e...

## A função executiva de atualização de informações na memória de trabalho para a ordem serial de eventos visuais e espaciais; The executive function of updating information in working memory for the serial order of visual and spatial events

Santana, Jeanny Joana Rodrigues Alves de
Fonte: Biblioteca Digitais de Teses e Dissertações da USP Publicador: Biblioteca Digitais de Teses e Dissertações da USP
Tipo: Tese de Doutorado Formato: application/pdf
Publicado em 20/09/2013 Português
Relevância na Pesquisa
36.60519%
No modelo dos multicomponentes da memória de trabalho o problema do armazenamento da ordem serial de eventos visuais e espaciais ainda é muito discutido. A literatura sugere que recursos do executivo central (o sistema de controle atencional da memória de trabalho) são utilizados para manter a representação da posição serial dos estímulos visuais e espaciais na memória. Mais precisamente, é proposto que a função executiva de atualização de informações esteja envolvida com este processo. Esta função promoveria a modificação contínua da representação mental conforme a entrada de novas informações no sistema cognitivo. Entretanto, não está esclarecido se ocorre uma dissociação visual e espacial no uso de recursos da função executiva de atualização de informações para o registro da ordem serial. O objetivo do presente estudo foi verificar o envolvimento da função executiva de atualização da informação na memória para a ordem de eventos visuais e espaciais. Os participantes foram estudantes universitários (n = 71) que realizaram as tarefas de memória delineadas segundo o paradigma de tarefas duplas. Neste procedimento as tarefas primárias de memória visual e espacial foram combinadas a tarefas secundárias executivas de tempo de reação de escolha (CRT) e tarefas que exigiam recursos de atualização da informação (tarefa de tempo de reação de escolha para um item anterior CRT-1). Na tarefa CRT o participante deveria julgar dois tons auditivos como sendo de alta ou baixa frequência. Na tarefa CRT-1 esta resposta deveria ser atrasada em um item...

## Pecking order theory versus trade-off theory : are service SMEs’ capital structure decisions different?

Serrasqueiro, Zélia; Armada, Manuel José da Rocha; Maças Nunes, Paulo
Tipo: Artigo de Revista Científica
Publicado em /12/2011 Português
Relevância na Pesquisa
36.56556%
This paper seeks to analyse if the capital structure decisions of service small and medium-sized enterprises (SMEs) are different from those of other types of firm. To do so, we consider four research samples: (i) 610 service SMEs; (ii) 126 service large firms; (iii) 679 manufacturing and construction SMEs; and (iv) 132 manufacturing and construction large firms. Using the two-step estimation method, the empirical evidence obtained in this study shows that the capital structure decisions of service SMEs are different from those of other types of firm. Service SMEs’ capital structure decisions are closer to the assumptions of Pecking Order Theory and further removed from those of Trade-Off Theory compared with the case of other types of firm.

## Type inference for conversation types

Lourenço, Maria Luísa Sobreira Gouveia
Fonte: Faculdade de Ciências e Tecnologia Publicador: Faculdade de Ciências e Tecnologia
Tipo: Dissertação de Mestrado
Publicado em //2009 Português
Relevância na Pesquisa
36.428955%
Trabalho apresentado no âmbito do Mestrado em Engenharia Informática, como requisito parcial para obtenção do grau de Mestre em Engenharia Informática; This dissertation tackles the problem of type inference for conversation types by devising and implementing a type inference algorithm. This is an interesting issue to address if we take into account that service-oriented applications can have very rich and complex protocols of services’usage, thus requiring the programmer to annotate every service invocation with a type corresponding to his role in a protocol, which would make the development of such applications quite unpractical. Therefore, freeing the programmer from that task, by having inference of types that describe such protocols, is quite desirable not only because it is cumbersome and tedious to do such annotations but also because it reduces the occurrences of errors when developing real complex systems. While there is several work done related to session types and type inference in the context of binary sessions, work regarding multiparty conversations is still lacking even though there are some proposals related to multi-session conversations(i.e. interactions happen through shared channels that are distributed at service invocation time to all participants). Our approach is based on Conversation Calculus...

## Improved high-order bending analysis of double curved sandwich panels subjected to multiple loading conditions

Fard,K. Malekzadeh; Livani,M.; veisi,A.; Gholami,M.
Fonte: Associação Brasileira de Ciências Mecânicas Publicador: Associação Brasileira de Ciências Mecânicas
Tipo: Artigo de Revista Científica Formato: text/html
Publicado em 01/01/2014 Português
Relevância na Pesquisa
36.455776%
For the first time, the bending analysis of a double curved sandwich panel was presented which was subjected to point load, uniform distributed load on a patch, and harmonic distributed loads and was based on a new improved higher order sandwich panel theory. Since the cross-sectional warping was accurately modeled by this theory, it did not require any shear correction factor. Also, the present analysis incorporated trapezoidal shape factor (the 1+z/R terms) of a curved panel element. Geometry was used for the consideration of different radii curvatures of the face sheets, while the core was unique. Unlike most of other reference works, the core can have non-uniform thickness. The governing equations were derived by the principle of minimum potential energy. The effects of types of boundary conditions, types of applied loads, core to panel, and radii curvatures ratios on the bending response were also studied.

## Extreme point and halving edge search in abstract order types

Aichholzer, Oswin; Miltzow, Tillmann; Pilz, Alexander
Fonte: Elsevier Publicador: Elsevier
Tipo: Artigo de Revista Científica
Publicado em /10/2013 Português
Relevância na Pesquisa
46.455776%
Many properties of finite point sets only depend on the relative position of the points, e.g., on the order type of the set. However, many fundamental algorithms in computational geometry rely on coordinate representations. This includes the straightforward algorithms for finding a halving line for a given planar point set, as well as finding a point on the convex hull, both in linear time. In his monograph Axioms and Hulls, Knuth asks whether these problems can be solved in linear time in a more abstract setting, given only the orientation of each point triple, i.e., the setʼs chirotope, as a source of information. We answer this question in the affirmative. More precisely, we can find a halving line through any given point, as well as the vertices of the convex hull edges that are intersected by the supporting line of any two given points of the set in linear time. We first give a proof for sets realizable in the Euclidean plane and then extend the result to non-realizable abstract order types.

## Theorem proving in higher order logics: emerging trends

Fonte: Universidade Nacional da Austrália Publicador: Universidade Nacional da Austrália
Tipo: Conference item Formato: 1116555 bytes; 356 bytes; application/pdf; application/octet-stream
Português
Relevância na Pesquisa
36.570327%
Mechanical theorem provers for higher order logics have been successfully applied in many areas including hardware verification and synthesis; verification of security and communications protocols; software verification, transformation and refinement; compiler construction; and concurrency. The higher order logics used to reason about these problems and the underlying theorem prover technology that support them are also active areas of research. The International Conference on Theorem Proving in Higher Order Logics (TPHOLs) brings together people working in these and related areas for the discussion and dissemination of new ideas in the field. TPHOLs'98 continues the conference tradition of having both a completed work and work-in-progress stream. The Papers from the first stream were formally refereed, and published as volume 1479 of LNCS. This, supplementary, proceedings records work accepted under the work-in-progress category, and is intended to document emerging trends in higher-order logic research. Papers in the work-in-progress stream are vetted for relevance and contribution before acceptance. The work-in-progress stream is regarded as an important feature of the conference as it provides a venue for the presentation of ongoing research projects...

## Efeito Combinado das Estratégias e do Limit Order Book num Mercado Artificial

Rabino, Bruno António Santos
Fonte: Instituto Superior de Economia e Gestão Publicador: Instituto Superior de Economia e Gestão
Tipo: Dissertação de Mestrado
Publicado em /09/2011 Português
Relevância na Pesquisa
36.445146%

## Development of Learning Modules to Enhance Students' Higher-Order Cognitive Skills

Crowe, Alison J.
Fonte: International Society for the Scholarship of Teaching and Learning Publicador: International Society for the Scholarship of Teaching and Learning
Tipo: Conferência ou Objeto de Conferência
Português
Relevância na Pesquisa
36.589883%
Bloom’s Taxonomy of cognitive domains is a well-defined and broadly accepted tool for categorizing types of thinking into six different levels: knowledge, comprehension, application, analysis, synthesis and evaluation. It is commonly accepted that memorization and recall (knowledge-level skills) are lower order cognitive skills that require only a minimum level of understanding, whereas the application of knowledge and critical thinking (application, analysis, synthesis & evaluation-level skills) are higher order cognitive skills that require deep conceptual understanding. In our Biology department we have begun introducing students to Bloom’s taxonomy during the introductory series to help students recognize the different levels of thinking they will need to master to succeed in the curriculum. First, we indicate on our exams the Bloom’s level required to successfully answer each question (e.g. knowledge or application) and then provide students with the overall “Bloom’s distribution” for the exam i.e. what percentage of the questions require lower-order versus higher-order cognitive skills. To aid students in identifying the levels that are most challenging for them, we are piloting a program that provides students with their individual “Bloom’s score” after each exam. The Bloom’s score indicates how well they performed on questions requiring different levels of Bloom’s. Typically students receive Bloom’s scores that are high for knowledge and comprehension and lower for one or more higher-order cognitive skills. Once these challenging areas have been identified...

## Ham-Sandwich Cuts for Abstract Order Types

Felsner, Stefan; Pilz, Alexander
Tipo: Artigo de Revista Científica
Publicado em 10/03/2015 Português
Relevância na Pesquisa
46.455776%
The linear-time ham-sandwich cut algorithm of Lo, Matou\v{s}ek, and Steiger for bi-chromatic finite point sets in the plane works by appropriately selecting crossings of the lines in the dual line arrangement with a set of well-chosen vertical lines. We consider the setting where we are not given the coordinates of the point set, but only the orientation of each point triple (the order type) and give a deterministic linear-time algorithm for the mentioned sub-algorithm. This yields a linear-time ham-sandwich cut algorithm even in our restricted setting. We also show that our methods are applicable to abstract order types.; Comment: A preliminary version of this paper appeared in the proceedings of ISAAC 2014

## A Note on Euclidean Order Types

Clark, Pete L.
Tipo: Artigo de Revista Científica
Publicado em 04/08/2012 Português
Relevância na Pesquisa
46.508647%
Euclidean functions with values in an arbitrary well-ordered set were first considered in a 1949 work of Motzkin and studied in more detail in work of Fletcher, Samuel and Nagata in the 1970's and 1980's. Here these results are revisited, simplified, and extended. The two main themes are (i) consideration of Ord-valued functions on an Artinian poset and (ii) use of ordinal arithmetic, including the Hessenberg-Brookfield ordinal sum. In particular, to any Euclidean ring we associate an ordinal invariant, its Euclidean order type, and we initiate a study of this invariant. The main new result gives upper and lower bounds on the Euclidean order type of a finite product of Euclidean rings in terms of the Euclidean order types of the factor rings.; Comment: 11 pages

## An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings

Aichholzer, Oswin; Kusters, Vincent; Mulzer, Wolfgang; Pilz, Alexander; Wettstein, Manuel
Tipo: Artigo de Revista Científica
Publicado em 29/07/2015 Português
Relevância na Pesquisa
46.828296%
Given a set $P$ of $n$ labeled points in the plane, the radial system of $P$ describes, for each $p\in P$, the radial order of the other points around $p$. This notion is related to the order type of $P$, which describes the orientation (clockwise or counterclockwise) of every ordered triple of $P$. Given only the order type of $P$, it is easy to reconstruct the radial system of $P$, but the converse is not true. Aichholzer et al. ("Reconstructing Point Set Order Types from Radial Orderings", in Proc. ISAAC 2014) defined $T(R)$ to be the set of order types with radial system $R$ and showed that sometimes $|T(R)|=n-1$. They give polynomial-time algorithms to compute $T(R)$ when only given $R$. We describe an optimal $O(kn^2)$ time algorithm for computing $T(R)$, where $k$ is the number of order types reported by the algorithm. The reporting relies on constructing the convex hulls of all possible point sets with the given radial system, after which sidedness queries on point triples can be answered in constant time. This set of convex hulls can be constructed in linear time. Our results generalize to abstract order types.

## On Berry's conjectures about the stable order in PCF

Müller, Fritz
Tipo: Artigo de Revista Científica
Português
Relevância na Pesquisa
36.654731%
PCF is a sequential simply typed lambda calculus language. There is a unique order-extensional fully abstract cpo model of PCF, built up from equivalence classes of terms. In 1979, G\'erard Berry defined the stable order in this model and proved that the extensional and the stable order together form a bicpo. He made the following two conjectures: 1) "Extensional and stable order form not only a bicpo, but a bidomain." We refute this conjecture by showing that the stable order is not bounded complete, already for finitary PCF of second-order types. 2) "The stable order of the model has the syntactic order as its image: If a is less than b in the stable order of the model, for finite a and b, then there are normal form terms A and B with the semantics a, resp. b, such that A is less than B in the syntactic order." We give counter-examples to this conjecture, again in finitary PCF of second-order types, and also refute an improved conjecture: There seems to be no simple syntactic characterization of the stable order. But we show that Berry's conjecture is true for unary PCF. For the preliminaries, we explain the basic fully abstract semantics of PCF in the general setting of (not-necessarily complete) partial order models (f-models.) And we restrict the syntax to "game terms"...

## Higher Order Architecture of Collections of Objects

Baas, Nils A.
Tipo: Artigo de Revista Científica
Português
Relevância na Pesquisa
36.508647%
We show that on an arbitrary collection of objects there is a wide variety of higher order architectures governed by hyperstructures. Higher order gluing, local to global processes, fusion of collections, bridges and higher order types are discussed. We think that these types of architectures may have interesting applications in many areas of science.; Comment: This is a philosophical paper presenting some new ideas on general systems which may be of interest in category theory as well

## Characterization of order types of pointwise linearly ordered families of Baire class 1 functions

Elekes, Márton; Vidnyánszky, Zoltán
Tipo: Artigo de Revista Científica
Publicado em 30/10/2014 Português
Relevância na Pesquisa
46.508647%
In the 1970s M. Laczkovich posed the following problem: Let $\mathcal{B}_1(X)$ denote the set of Baire class $1$ functions defined on a Polish space $X$ equipped with the pointwise ordering. $\text{Characterize the order types of the linearly ordered subsets of \mathcal{B}_1(X).}$The main result of the present paper is a complete solution to this problem. We prove that a linear order is isomorphic to a linearly ordered family of Baire class $1$ functions iff it is isomorphic to a subset of the following linear order that we call $([0,1]^{<\omega_1}_{\searrow 0},<_{altlex})$, where $[0,1]^{<\omega_1}_{\searrow 0}$ is the set of strictly decreasing transfinite sequences of reals in $[0, 1]$ with last element $0$, and $<_{altlex}$, the so called \emph{alternating lexicographical ordering}, is defined as follows: if $(x_\alpha)_{\alpha\leq \xi}, (x'_\alpha)_{\alpha\leq \xi'} \in [0,1]^{<\omega_1}_{\searrow 0}$, and $\delta$ is the minimal ordinal where the two sequences differ then we say that $(x_\alpha)_{\alpha\leq \xi} <_{altlex} (x'_\alpha)_{\alpha\leq \xi'} \iff (\delta \text{ is even and } x_{\delta}x'_{\delta}).$ Using this characterization we easily reprove all the known results and answer all the known open questions of the topic.

## Using higher-order contracts to model session types

Bernardi, Giovanni; Hennessy, Matthew
Tipo: Artigo de Revista Científica
Português
Relevância na Pesquisa
36.767566%
Session types are used to describe and structure interactions between independent processes in distributed systems. Higher-order types are needed in order to properly structure delegation of responsibility between processes. In this paper we show that higher-order web-service contracts can be used to provide a fully-abstract model of recursive higher-order session types. The model is set-theoretic, in the sense that the meaning of a contract is given in terms of the set of contracts with which it complies. The proof of full-abstraction depends on a novel notion of the complement of a contract. This in turn gives rise to an alternative to the type duality commonly used in systems for type-checking session types. We believe that the notion of complement captures more faithfully the behavioural intuition underlying type duality.; Comment: Added definitions of m-closed terms, of 'dual', and a discussion to show the problems of the complement function

## The Interplay between VSO and Coordination in Two Types of Non-Degree Exclamatives

Martins, Ana Maria
Fonte: Universidade Autônoma de Barcelona Publicador: Universidade Autônoma de Barcelona
Tipo: Artigo de Revista Científica Formato: application/pdf
Publicado em //2013 Português
Relevância na Pesquisa
36.685986%
Research for this paper was funded by FCT – Fundação para a Ciência e a Tecnologia within the project WOChWEL – Word Order and Word Order Change in Western European Languages (PTDC/CLE-LIN/121707/2010). I am thankful to the editors of the current volume of CatJL and an anonymous reviewer, who in different ways contributed to this work. All shortcomings are, of course, my own responsibility; Aquest article estudia dos tipus diferents d’estructures en indicatiu que tenen inversió subjecte-verb i que no han rebut gaire atenció en els estudis sobre l’ordre VS al portuguès europeu. Ambdues estructures expressen la comparació/contrast mitjançant la coordinació, presenten l’ordre VSO i poden ser classificades com a oracions exclamatives sense gradació. Mentre que en el primer tipus (tipus I) el subjecte postverbal rep una lectura de focus contrastiu, l’altre tipus (tipus II) es caracteritza per tenir un patró menys general d’inversió subjecte-verb que no requereix ni focus del subjecte ni sintaxi de V2, però que afegeix al contingut proposicional de l’oració un comentari implícit que denota una actitud de desaprovació per part del parlant respecte a l’estat de coses descrit. Es proposa que el factor que unifica els dos tipus d’exclamatives sense gradació és la presència d’un tret valoratiu a dintre del domini del CP que dóna lloc al trasllat de V a C. Les estructures de tipus I mostren desplaçament de V a C en tots dos membres de la coordinació i comporten...

## Collaborating queues: large service network and a limit order book

Yudovina, Elena
Fonte: University of Cambridge; Department of Pure Mathematics and Mathematical Statistics; Emmanuel College; Statistics Laboratory Publicador: University of Cambridge; Department of Pure Mathematics and Mathematical Statistics; Emmanuel College; Statistics Laboratory
Tipo: Thesis; doctoral; PhD
Português
Relevância na Pesquisa
36.654243%
E-thesis pagination differs from hardbound copy kept in the Manuscripts Department, Cambridge University Library.; We analyse the steady-state behaviour of two different models with collaborating queues: that is, models in which "customers" can be served by many types of "servers", and "servers" can process many types of "customers". The first example is a large-scale service system, such as a call centre. Collaboration is the result of cross-trained staff attending to several different types of incoming calls. We first examine a load-balancing policy, which aims to keep servers in different pools equally busy. Although the policy behaves order-optimally over fixed time horizons, we show that the steady-state distribution may fail to be tight on the diffusion scale. That is, in a family of ever-larger networks whose arrival rates grow as O(r) (where r is a scaling parameter growing to infinity), the sequence of steady-state deviations from equilibrium scaled down by sqrt(r) is not tight. We then propose a different policy, for which we show that the sequence of invariant distributions is tight on the r^(1/2+epsilon) scale, for any epsilon > 0. For this policy we conjecture that tightness holds on the diffusion scale as well. The second example models a limit order book...

## OS PRINCIPAIS MODOS DO PENSAMENTO JURÍDICO PROFISSIONAL; THE MAIN TYPES OF PROFESSIONAL JURIDICAL THINKING

Davydova, Marina L.; Universidade Estadual de Volgogrado – Federação Russa.
Fonte: UFPR Publicador: UFPR
Tipo: info:eu-repo/semantics/article; info:eu-repo/semantics/publishedVersion; Formato: application/pdf; application/pdf
Publicado em 26/11/2015 Português
Relevância na Pesquisa
36.56556%
Em seu livro Os três modos de pensar a ciência jurídica, publicado em 1934, Carl Schmitt apresenta seu conceito de pensamento de ordem-concreta que contrasta com dois modos clássicos de pensamento jurídico: o decisionismo e o normativismo, considerados como etapas passadas do desenvolvimento geral da história jurídica. No direito comparado, o estilo jurídico, que inclui um modo especial de pensamento, é um dos critérios tradicionais que distinguem um sistema jurídico nacional de outro. De acordo com este ponto de vista, o normativismo alemão e o decisionismo americano são determinados por características típicas de seus sistemas jurídicos correspondentes. Nossa ideia é que cada modo de pensamento jurídico não se relaciona nem com o sistema jurídico nem com o período histórico do desenvolvimento científico, mas com a especialidade da profissão jurídica. Juízes de todos os países têm muita coisa em comum em seu estilo de pensamento. Entretanto, em um país particular, pode-se encontrar uma grande diferença entre o modo de pensamento de um juiz e, por exemplo, o de um cartorário ou oficial de justiça (enforcer). Em nosso artigo, buscamos encontrar a relação entre os três modos de pensamento jurídico de Carl Schmitt (pensamento normativo ou estatutário...