985 resultados para Names, Sumerian
Resumo:
Impression formation is an important aspect of person perception and has important interpersonal consequences. There are assimilation and contrast effects in impression formation and is still considerable debate regarding the best way to account for them. This present research used trait-implying sentences as priming materials, trait inferences sever as self-generated primes, examined the effect of different trait knowledge in assimilation and contrast effects. Experiment 1 determined the priming and target stimuli of this research by pretest. In experiment 2, participants read trait-implying sentences and resulted in trait inference as self-generated primes, examined the influence of trait activation on impression formation. The results indicated that participants instructed to memorize trait-implying sentences showed assimilation effect, whereas participants instructed to form impression from trait-implying sentences showed contrast effect. Difference to previous studies that emphasized the impact of awareness of the prime in impression formation, this research paid attention to the impact of different trait knowledge that resulted from trait inference. Experiment 3 studied the influence of actor salience on impression formation. The results indicated that when trait-implying sentences that described actors with names and were accompanied with photos of the actors, participants showed contrast under both memorization and impression instructions. Experiment 4 studied the influence of attribution context on assimilation and contrasts. The results showed that contrast ensued when trait-implying sentences were accompanied with the information that suggested a person attribution, whereas assimilation ensued when that information suggested a situation attribution, independent of processing goals. Experiment 5 made a direct test of the effect of different trait knowledge in impression formation. The results discovered that when abstract trait concepts were activated they act as a general interpretation frame in encoding stage, whereas when specific actor-trait links were activated, the activated information is likely to be used as a comparative standard in judgment stage. All studied indicated that there are two types of activated trait knowledge in trait inference: abstract trait concepts versus specific actor-trait links. When trait inference activated abstract trait concepts, the activated information serves as interpretation frame and lead to assimilation effect during impression formation, when trait inference activated specific actor-trait links, the activated information is more likely to be used as a comparative standards and resulted in contrast effects. These findings have important implications for understanding the mechanism of impression formation and practical values for interpersonal communication.
Resumo:
Conventional parallel computer architectures do not provide support for non-uniformly distributed objects. In this thesis, I introduce sparsely faceted arrays (SFAs), a new low-level mechanism for naming regions of memory, or facets, on different processors in a distributed, shared memory parallel processing system. Sparsely faceted arrays address the disconnect between the global distributed arrays provided by conventional architectures (e.g. the Cray T3 series), and the requirements of high-level parallel programming methods that wish to use objects that are distributed over only a subset of processing elements. A sparsely faceted array names a virtual globally-distributed array, but actual facets are lazily allocated. By providing simple semantics and making efficient use of memory, SFAs enable efficient implementation of a variety of non-uniformly distributed data structures and related algorithms. I present example applications which use SFAs, and describe and evaluate simple hardware mechanisms for implementing SFAs. Keeping track of which nodes have allocated facets for a particular SFA is an important task that suggests the need for automatic memory management, including garbage collection. To address this need, I first argue that conventional tracing techniques such as mark/sweep and copying GC are inherently unscalable in parallel systems. I then present a parallel memory-management strategy, based on reference-counting, that is capable of garbage collecting sparsely faceted arrays. I also discuss opportunities for hardware support of this garbage collection strategy. I have implemented a high-level hardware/OS simulator featuring hardware support for sparsely faceted arrays and automatic garbage collection. I describe the simulator and outline a few of the numerous details associated with a "real" implementation of SFAs and SFA-aware garbage collection. Simulation results are used throughout this thesis in the evaluation of hardware support mechanisms.
Resumo:
Meng Q. and Lee M.H., Behaviour-Based Assistive Robotics for the Home, in Proc. SMC2001, IEEE 2001 Int. Conf. on Systems, Man and Cybernetics, Tucson, Arizona, Oct 2001, pp684-689.
Resumo:
Bain, William, 'One Order, Two Laws: Recovering the 'Normative' in English School Theory', Review of International Studies, (2007) 33(4) pp.557-575 RAE2008
Resumo:
Falileyev, A. (2006). Vostochnije Balkany na karte Ptolemeja: Kritiko-biograficheskije izyskanija. Munchen: Biblion Verlag.
Resumo:
Wydział Filologii Polskiej i Klasycznej: Instytut Filologii Polskiej
Resumo:
Filologia Polska i Klasyczna: Instytut Filologii Polskiej; Zakład Gramatyki Współczesnego Języka Polskiego i Onomastyki
Resumo:
Wydział Filologii Polskiej i Klasycznej
Resumo:
Wydział Nauk Politycznych i Dziennikarstwa
Resumo:
Monografia apresentada à Universidade Fernando Pessoa para obtenção do grau Licenciada em Terapêutica da Fala
Resumo:
Projeto de Pós-Graduação/Dissertação apresentado à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Ciências Farmacêuticas
Resumo:
Communication and synchronization stand as the dual bottlenecks in the performance of parallel systems, and especially those that attempt to alleviate the programming burden by incurring overhead in these two domains. We formulate the notions of communicable memory and lazy barriers to help achieve efficient communication and synchronization. These concepts are developed in the context of BSPk, a toolkit library for programming networks of workstations|and other distributed memory architectures in general|based on the Bulk Synchronous Parallel (BSP) model. BSPk emphasizes efficiency in communication by minimizing local memory-to-memory copying, and in barrier synchronization by not forcing a process to wait unless it needs remote data. Both the message passing (MP) and distributed shared memory (DSM) programming styles are supported in BSPk. MP helps processes efficiently exchange short-lived unnamed data values, when the identity of either the sender or receiver is known to the other party. By contrast, DSM supports communication between processes that may be mutually anonymous, so long as they can agree on variable names in which to store shared temporary or long-lived data.
Resumo:
This paper proposes a novel protocol which uses the Internet Domain Name System (DNS) to partition Web clients into disjoint sets, each of which is associated with a single DNS server. We define an L-DNS cluster to be a grouping of Web Clients that use the same Local DNS server to resolve Internet host names. We identify such clusters in real-time using data obtained from a Web Server in conjunction with that server's Authoritative DNS―both instrumented with an implementation of our clustering algorithm. Using these clusters, we perform measurements from four distinct Internet locations. Our results show that L-DNS clustering enables a better estimation of proximity of a Web Client to a Web Server than previously proposed techniques. Thus, in a Content Distribution Network, a DNS-based scheme that redirects a request from a web client to one of many servers based on the client's name server coordinates (e.g., hops/latency/loss-rates between the client and servers) would perform better with our algorithm.
Resumo:
How do visual form and motion processes cooperate to compute object motion when each process separately is insufficient? Consider, for example, a deer moving behind a bush. Here the partially occluded fragments of motion signals available to an observer must be coherently grouped into the motion of a single object. A 3D FORMOTION model comprises five important functional interactions involving the brain’s form and motion systems that address such situations. Because the model’s stages are analogous to areas of the primate visual system, we refer to the stages by corresponding anatomical names. In one of these functional interactions, 3D boundary representations, in which figures are separated from their backgrounds, are formed in cortical area V2. These depth-selective V2 boundaries select motion signals at the appropriate depths in MT via V2-to-MT signals. In another, motion signals in MT disambiguate locally incomplete or ambiguous boundary signals in V2 via MT-to-V1-to-V2 feedback. The third functional property concerns resolution of the aperture problem along straight moving contours by propagating the influence of unambiguous motion signals generated at contour terminators or corners. Here, sparse “feature tracking signals” from, e.g., line ends, are amplified to overwhelm numerically superior ambiguous motion signals along line segment interiors. In the fourth, a spatially anisotropic motion grouping process takes place across perceptual space via MT-MST feedback to integrate veridical feature-tracking and ambiguous motion signals to determine a global object motion percept. The fifth property uses the MT-MST feedback loop to convey an attentional priming signal from higher brain areas back to V1 and V2. The model's use of mechanisms such as divisive normalization, endstopping, cross-orientation inhibition, and longrange cooperation is described. Simulated data include: the degree of motion coherence of rotating shapes observed through apertures, the coherent vs. element motion percepts separated in depth during the chopsticks illusion, and the rigid vs. non-rigid appearance of rotating ellipses.
Resumo:
There are several thousand souterrains in Ireland, and in Co. Cork to date we have records of the existence of approximately 500. The scientific name souterrain is an antiquarian's term for these monuments. Other names used in the past were Dane's Hole and Rath Cave. Folknames for souterrains range from the nondescript Cave or Poll Talaimh to, in specific cases, Tigh-faoi-thalamh and Carraig-an-tseomra. Dr Anthony Lucas states in a recent paper (2) that probably, during the period in which they were used, one of the common names for a souterrain was Uam (Uaimh in modern Irish).