نتایج جستجو برای: upward communication

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

Journal: :J. Parallel Distrib. Comput. 2015
Guoqi Xie Renfa Li Keqin Li

Scheduling for a directed acyclic graph (DAG) on networked embedded systems is to maximize concurrency and minimize inter-processor communication for minimum end-to-end worst-case response time (WCRT). Time accuracy and synchronization are critical for scheduling on heterogeneous networked embedded systems, where computing and networking are both heterogeneous and deeply jointed. Most algorithm...

Journal: :Eating behaviors 2015
Emilie Pinkasavage Danielle Arigo Leah M Schumacher

Comparing one's body to those of individuals perceived as more attractive is common among college women, and has been associated with increases in body dissatisfaction and disordered eating. Not all college women are vulnerable to the negative influence of these upward body comparisons; however, little is known about characteristics that may distinguish more vulnerable women. Coping styles, whi...

2003
RAMI GROSSBERG ALEXEI S. KOLESNIKOV

The assumption that an AEC is tame is a powerful assumption permitting development of stability theory for AECs with the amalgamation property. Lately several upward categoricity theorems were discovered where tameness replaces strong set-theoretic assumptions. We present in this article two sufficient conditions for tameness, both in form of strong amalgamation properties that occur in nature....

Journal: :Inf. Process. Lett. 1994
Rajesh P. N. Rao Jörg Rothe Osamu Watanabe

This paper studies the range of application of the upward separation technique that has been introduced by Hartmanis to relate certain structural properties of polynomial-time complexity classes to their exponential-time analogs and was rst applied to NP [Har83]. Later work revealed the limitations of the technique and identi ed classes defying upward separation. In particular, it is known that...

2003
THOMAS E. NELSON RUSSELL A. ARMSTRONG VICTOR P. PASKO

AFFILIATIONS: LYONS AND NELSON—FMA Research, Inc., Fort Collins, Colorado; ARMSTRONG—Mission Research Corporation, Nashua, New Hampshire; PASKO—The Pennsylvania State University, University Park, Pennsylvania; STANLEY—Los Alamos National Laboratory, Los Alamos, New Mexico CORRESPONDING AUTHOR: Walter A. Lyons, CCM, FMA Research, Inc., Yucca Ridge Field Station, 46050 Weld County Road 13, Fort C...

2012
Parth Gupta Paolo Rosso

With rapidly increasing community, a plethora of conferences related to Natural Language Processing and easy access to their proceedings make it essential to check the integrity and novelty of the new submissions. This study aims to investigate the trends of text reuse in the ACL submissions, if any. We carried a set of analyses on two spans of five years papers (the past and the present) of AC...

2014
Patrick J. Carroll

This research examined how and when people engage in upward self-revision to embrace new possible selves in response to social validation. First, the present study (n1⁄4 67) predicted and found that upward self-revision was more likely to occur when validations fully specify the meaning of the positive discrepancy between the desired self and the alternative self into the explicit prospect of t...

Journal: :American journal of human genetics 2002
D Siegmund

Because of the large number of tests for linkage that are performed in genome scans, the naive estimator of the size of a genetic effect in cases of borderline significance can be inflated and lead to unrealistic expectations for successful replication. As a remedy, this report proposes lower confidence limits that account for the multiple comparisons of the genome scan.

Journal: :J. Graph Algorithms Appl. 2015
Oswin Aichholzer Thomas Hackl Sarah Lutteropp Tamara Mchedlidze Alexander Pilz Birgit Vogtenhuber

We study monotone simultaneous embeddings of upward planar digraphs, which are simultaneous embeddings where the drawing of each digraph is upward planar, and the directions of the upwardness of different graphs can differ. We first consider the special case where each digraph is a directed path. In contrast to the known result that any two directed paths admit a monotone simultaneous embedding...

2011
Guy Kortsarz Harald Räcke Rajiv Raman

We show that the gap in profit between a naturally defined upward instance of the tollbooth problem on a tree and the original instance can be at least Ω(log log n) where n is the number of edges in the tree.

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

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