نتایج جستجو برای: distribute pattern

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

Asadnia, Fatemeh, Atai, Mahmood Reza,

In response to the competitive demands for establishing their international academic and financial credentials, the universities globally distribute some online introductory information about themselves. To this end, the university homepages have increasingly turned into the rhetorical space for the development of promotional academic texts in recent years. In this study, we examined university...

Journal: :Journal of Business Research 2021

Formal financial institutions inadequately distribute startup capital to business ventures of ethnic minorities, women, low-educated, and young people. Self-financing groups fill this gap because in these associations agents accumulate their savings into a fund that is later used provide loans the members. This study builds simulates an agent-based model compares profitability businesses starte...

Journal: :Metals 2022

The mechanical properties of Zr-based alloys, such as strength and elongation, are heavily dependent on the cooling rate during heat treatment. Understanding phase transformation microstructural evolution in various media can establish connection between properties. effect phase, microstructure, tensile Zr-4Hf-3Nb (wt%) alloy is studied this paper. results show that composition samples transfor...

Introduction All governments through different policies, laws, and regulations try to deal with distribution issue and demand distinct distribution . Every community encounters with its own laws .Distributive justice notion tries to offer strategy regarding relevant alternatives. The proponents of “discrependency principle” contend changing policies and laws toward the betterment of low inco...

2009
P. Hrubeš S. Jukna A. Kulikov P. Pudlák

Khrapchenko’s classical lower bound n on the formula size of the parity function f can be interpreted as designing a suitable measure of subrectangles of the combinatorial rectangle f−1(0)× f−1(1). Trying to generalize this approach we arrived at the concept of convex measures. We prove the negative result that convex measures are bounded by O(n) and show that several measures considered for pr...

1999
Ulrich Schmid Martin Horauer Nikolaus Kero

This paper shows how to distribute GPS-time with s-accuracy and below even in Ethernet-based distributed systems. Our SynUTC-approach 1 is based upon a simple network controller-level hardware for timestamping data packets as they leave and arrive at a node, which comes in two avours: The memory-based timestamping method exploited by our Network Time Interface (NTI) M-Module timestamps data pac...

Journal: :Physical review letters 2012
Alastair Kay

One of the many bizarre features of entanglement is that Alice, by sending a qubit to Bob in a separable state, can generate some entanglement between herself and Bob. This protocol is stripped down to the bare essentials to better elucidate the key properties of the initial resource state that enable this entanglement distribution. The necessary and sufficient conditions under which the correl...

2014
NIKITA MARTYNOV Nikita Martynov

English) The Internet of Things is a rapidly evolving eld of high-end technology and research. Its security is vital to the reliability and safety of the future everyday communications. The DTLS protocol is a default protocol to assure security for unicast communication. A DTLS record layer extension for multicast in constrained environments is being designed to assure security for multicast. H...

1993
Anne-Marie Pinna-Dery W. Lejouad Coco Djossou

In this paper we point out the reasons that lead us to distribute modular applications and how we distribute them. We illustrate our ideas with an example of expert system shell.

2000
Alan D. Amis Ravi Prakash Dung Huynh Thai Vuong

An ad hoc network may be logically represented as a set of clusters. The clusterheads form a d-hop dominating set. Each node is at most d hops from a clusterhead. Clusterheads form a virtual backbone and may be used to route packets for nodes in their cluster. Previous heuristics restricted themselves to 1-hop clusters. We show that the minimum d-hop dominating set problem is NP-complete. Then ...

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

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