نتایج جستجو برای: ∆Tmin

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

2007
David B. Lobell

Trends in recent temperature observations and model projections of the future are characterized by greater warming of daily minimum (tmin) relative to maximum (tmax) temperatures. To aid understanding of how tmin and tmax differentially affect crop yields, we analyzed variations of regional spring wheat yields and temperatures for three irrigated sites in western North America that were charact...

2008
Laura Giordano Valentina Gliozzi Nicola Olivetti Gian Luca Pozzato

In this paper we propose a nonmonotonic extension ALC + Tmin of the Description Logic ALC for reasoning about prototypical properties and inheritance with exception. The logic ALC + Tmin is built upon a previously introduced (monotonic) logic ALC + T, that is obtained by adding a typicality operator T to ALC. The operator T is intended to select the “most normal” or “most typical” instances of ...

2011
Laura Giordano Valentina Gliozzi Nicola Olivetti Gian Luca Pozzato

In this paper we propose nonmonotonic extensions of low complexity Description Logics EL and DL-Litecore for reasoning about typicality and defeasible properties. The resulting logics are called EL⊥Tmin and DL-LitecTmin. We summarize complexity results for such extensions recently studied. Entailment in DL-LitecTmin is in Π p 2 , whereas entailment in EL ⊥ Tmin is EXPTIMEhard. However, consider...

1999
L. Jetsu J. Pelt I. Tuominen

Standard Johnson UBVRI photometry of V 1794 Cyg (HD199178) between 1975 and 1995 is analysed. Instead of the traditional constant period ephemeris, we determine the seasonal periodicities (Pphot) and the primary and secondary minima epochs (tmin,1, tmin,2) of the normalized UBVRI magnitudes using the three stage period analysis (TSPA) and complementary methods. Our tmin,1 and tmin,2 estimates w...

2011
Laura Giordano Valentina Gliozzi Nicola Olivetti Gian Luca Pozzato

We propose a nonmonotonic extension of low complexity Description Logics EL⊥ and DL-Litecore for reasoning about typicality and defeasible properties. The resulting logics are called EL⊥Tmin and DL-LitecTmin. Concerning DL-LitecTmin, we prove that entailment is in Πp2. With regard to EL⊥Tmin, we first show that entailment remains EXPTIME-hard. Next we consider the known fragment of Left Local E...

2007
Jørgen Bauck Jensen Sigurd Skogestad

We show in this paper that the common method of specifying ∆Tmin in design of heat exchanger systems may lead to wrong decisions and should be used with care. Although specifying ∆Tmin is reasonable for heat exchanger networks synthesis with given stream data, it should not generally be used for obtaining optimal design data and especially not stream data (temperatures). An alternative simple T...

Journal: :Science 1999
Alward Detling Milchunas

Global minimum temperatures (TMIN) are increasing faster than maximum temperatures, but the ecological consequences of this are largely unexplored. Long-term data sets from the shortgrass steppe were used to identify correlations between TMIN and several vegetation variables. This ecosystem is potentially sensitive to increases in TMIN. Most notably, increased spring TMIN was correlated with de...

2012
Bin Luo Shuyu Zhang Shoucun Ma Ji Zhou Baojian Wang

The purpose was to investigate the effects of artificial cold air on cardiovascular risk in hypertensive subjects. An artificial cold air was simulated with hourly ambient temperature data of a real moderate cold air in China. Twenty-four male SHR rats were randomly divided into the minimum temperature (Tmin) group, the rewarming temperature (Tr) group and two concurrent control groups with six...

2013
Ruonan Li Todd Zickler

To apply branch-and-bound algorithm to minimize the quality function (6) in the main paper, we first specify the spaces where Ts and Te may take a value. We denote the length of the shortest exemplar activity as Tmin, then we assume 1 ≤ Ts ≤ T − Tmin + 1 and Tmin + 1 ≤ Te ≤ T . Additional constraint may be imposed, such as Tmin ≤ Te − Ts. Given these information, the temporal branch-and-bound a...

2012
Laura Giordano Valentina Gliozzi Nicola Olivetti Gian Luca Pozzato

In this paper we describe an approach for reasoning about typicality and defeasible properties in low complexity preferential Description Logics. We describe the non-monotonic extension of the low complexity DLs EL and DL-Litecore based on a typicality operator T, which enjoys a preferential semantics. We summarize complexity results for such extensions, called EL⊥Tmin and DL-LitecTmin. Entailm...

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

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