نتایج جستجو برای: lmax
تعداد نتایج: 285 فیلتر نتایج به سال:
To provide continuous growth of Amsterdam Airport Schiphol (AAS), the department Stakeholder Strategy and Development (SSD) of Amsterdam Airport Schiphol (AAS) introduces Noise Abatement Measures to create quieter aircraft operations and hence to be able to fly more frequent within the current environmental law related to aircraft noise. However, SSD faces difficulties with the evaluation regar...
Fourteen adult cats were exercised on a motor-driven treadmill 5 days each week for 6 weeks to determine the effect of exercise conditioning on the intrinsic contractile state of the myocardium. The exercise program was sufficient to produce a cardiovascular training effect manifested by slower exercising heart rates and resting heart rates after atropine by the end of the 6th week. The mechani...
Microspectrophotometric measurements of visual pigments have been obtained for a large sample of New World monkeys of the species Callithrix jacchus jacchus. These animals exhibit a polymorphism of visual pigments. The rods (Lmax 499 nm) and the short-wave receptors (Lmax 423 nm) appear to be common to all animals but individuals differ in the number and spectral position of pigments in the gre...
In this paper we consider low-density parity-check (LDPC) codes for the classic bursty channel. We present lower bounds on the maximum resolvable erasure burst length, Lmax, for arbitrary LDPC codes and then present constructions for LDPC codes with good burst erasure correction performance for channels with and without the presence of noise in the guard band.
New supramolecular luminescent host systems based on 2-cyano-3(4-(diphenylamino)phenyl) acrylic acid (CDPA), a triphenylamine based luminescent acid, and amines (propylamine (1), dimethylaminopyridine, DMAP (2) and (1S,2R)-2-amino-1,2-diphenylethanol (3)) were prepared using a supramolecular approach. For each, the inclusion of amines in the CDPA matrix led to blue shifts in the solid state lum...
While the picture of approximation complexity class becomes clear for most combinatorial optimization problems, it remains an open question whether Feedback Vertex Set can be approximated within a constant ratio in directed graph case. In this paper we present an approximation algorithm with performance bound Lmax 1, where Lmax is the largest length of essential cycles in the graph G(V;E). The ...
The cosmological particle horizon is the maximum measurable length in the Universe. The existence of such a maximum observable length scale implies a modification of the quantum uncertainty principle. Thus due to non-locality of quantum mechanics, the global properties of the Universe could produce a signature on the behaviour of local quantum systems. A Generalized Uncertainty Principle (GUP) ...
We examine the performance of Shifting Bottleneck (SB) heuristics for shop scheduling problems where the performance measure to be minimized is makespan (Cmax) or maximum lateness (Lmax). Extensive computational experiments are conducted on benchmark problems from the literature as well as several thousand randomly generated test problems with three different routing structures and up to 1000 o...
In this paper, we introduce a new concept of semi-preemptive scheduling and we show how it can be used to derive a maximumow based lower bound for the P=rj=Lmax which dominates the well-known preemptive lower bound. We show that, in some cases the proposed bound strictly dominates the preemptive one while having the same complexity.
We study oscillations of slowly rotating relativistic barotropic as well as non-barotropic polytropic stars in the Cowling approximation, including first order rotational corrections. By taking into account the coupling between the polar and axial equations, we find that, in contrast to previous results, the m = 2 r modes are essentially unaffected by the continuous spectrum and exist even for ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید