نتایج جستجو برای: pmax

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

Journal: :Forests 2021

As climate change progresses, it is becoming more crucial to understand how timber species respond increased drought frequency and severity. Photosynthetic traits in a 40-year-old clonal Japanese cedar (Cryptomeria japonica) plantation were assessed under artificial stress using roof exclude rainfall control with no exclusion. C. japonica commercial tree that native Japan has high growth on mes...

2013
Barna Saha

We consider the problem of efficiently scheduling jobs on data centers to minimize the cost of renting machines from “the cloud.” In the most basic cloud service model, cloud providers offer computers on demand from large pools installed in data centers. Clients pay for use at an hourly rate. In order to minimize cost, each client needs to decide on the number of machines to be rented and the d...

Journal: :Acta Gymnica 2023

Background: In ice hockey, regular off-ice testing can serve as a controlling mechanism for training program's effectiveness. Objective: The main aim of this study was to describe changes in selected morphological and physiological parameters, intended be relevant complex hockey performance, after two months pre-season preparation following one month an off-season period. Methods: sample consis...

2008
STUART ZOBLE

We study a strengthening of Bounded Martin’s Maximum which asserts that if a Σ1 fact holds of ω V 2 in a stationary set preserving extension then it holds in V for a stationary set of ordinals less than ω2. We show that this principle implies Global Projective Determinacy, and therefore does not hold in the Pmax model for BMM, but that the restriction of this principle to forcings which render ...

2006
PAUL B. LARSON

In [6], we modified a coding device from [14] and the consistency proof of Martin’s Maximum from [3] to show that from a supercompact limit of supercompact cardinals one could force Martin’s Maximum to hold while the Pmax axiom (∗) fails. Here we modify that argument to prove a stronger fact, that Martin’s Maximum is consistent with the existence of a wellordering of the reals definable in H(א2...

2010
Marin Bougeret Pierre-François Dutot Klaus Jansen Christina Robenek Denis Trystram

We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organizations (composed each of m identical processors) minimizing the maximum completion time (makespan). This algorithm runs in O(n(N +log(n)) log(npmax)), where pmax is the maximum processing time of the jobs. It improve...

2014
Ali Turkcan Ahmet Necati Ozsezen Mustafa Canakci

Abbreviations: aBDC, after bottomdead center; aTDC, aft bottomdead center; bTDC, before top dead center; CA50, cra fraction reaches to 50%; CI, compression ignition; COVime indicated mean effective pressure; DI, direct injection; DIS DOI, duration of injection (first DOI1, second DOI2); EGR, homogenous charge compression ignition; IMEP, indicat injection ratio; MPRR, maximum pressure rise rate;...

2015
Yan-Xi Liu Zeng-Li Fan Ze-Mei Gao Yun-Xiang Li Qiu-Mei Quan Ping Yang

Photosynthetic responses to light environment can be useful measurements to determine favorable habitat conditions for the conservation and cultivation of medicinal species. The eight models are used to explore the best model for describing light-response curves in two Bergenia species. The results show that the light-response curves of Bergenia tianquaninsis and Bergenia purpurascens were best...

2008
Andrew Wuensche

Chain rules are maximally chaotic CA rules that can be constructed at random to provide a huge number of encryption keys — where the the CA is run backwards to encrypt, forwards to decrypt. The methods are based on the reverse algorithm and the Z-parameter [5]. 1 The CA reverse algorithm and basins of attraction In the simplest cellular automata [4], each cell in a ring of cells updates its val...

1995
Costas Busch Marios Mavronicolas

It is shown that a threshold network of width w and depth d cannot be constructed from balancers of width p0; p1; : : : ; pm 1, if w does not divide P , where P is the least common multiple of p0; p1; : : : ; pm 1. This holds regardless of the size of the network, as long as it is nite, and it implies a lower bound of logP w on the depth of the network. More strongly, a lower bound of logpmax w...

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

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