988 resultados para Uniform law
Resumo:
Internets ökade betydelse gjorde att företagen började inse vilka problem som kan uppstå av att en webbsida med ett domännamn i form av deras varumärke olovligen handhas av en utomstående part. Konflikterna blev därför fler medan existerande tvistlösningsmekanismer ansågs dyra, tungrodda och ineffektiva. Ur detta behov föddes sedermera Uniform Domain Name Dispute Resolution Policy (UDRP). Detta internationella tvistlösningsförfarande skapades för att tillämpas på s.k. cybersquatting, dvs. situationer där domännamn, som inkräktar på andras varu- eller servicemärken, registreras i ond tro t.ex. för framtida försäljning. Jag granskar i denna avhandling huvudsakligen förutsättningarna för överföring eller upphävning av domännamnsregistreringar i enlighet med UDRP, varför jag fokuserar på artikel 4.a och då i synnerhet på innebörden av begreppet ”registrering och användning i ond tro”. Arbetet bygger huvudsakligen på en analys av de avgöranden som fattats inom ramen för UDRP. Syftet är att genom en systematisk undersökning av tillämpningen av begreppet ond tro beskriva och utvärdera rättstillämpningen inom UDRP. De granskade avgörandena är 396 st. till antalet och har meddelats under tidsperioden 14.1.2000-15.8.2001.
Resumo:
Non-uniform sampling of a signal is formulated as an optimization problem which minimizes the reconstruction signal error. Dynamic programming (DP) has been used to solve this problem efficiently for a finite duration signal. Further, the optimum samples are quantized to realize a speech coder. The quantizer and the DP based optimum search for non-uniform samples (DP-NUS) can be combined in a closed-loop manner, which provides distinct advantage over the open-loop formulation. The DP-NUS formulation provides a useful control over the trade-off between bitrate and performance (reconstruction error). It is shown that 5-10 dB SNR improvement is possible using DP-NUS compared to extrema sampling approach. In addition, the close-loop DP-NUS gives a 4-5 dB improvement in reconstruction error.
Resumo:
Utilization bounds for Earliest Deadline First(EDF) and Rate Monotonic(RM) scheduling are known and well understood for uniprocessor systems. In this paper, we derive limits on similar bounds for the multiprocessor case, when the individual processors need not be identical. Tasks are partitioned among the processors and RM scheduling is assumed to be the policy used in individual processors. A minimum limit on the bounds for a 'greedy' class of algorithms is given and proved, since the actual value of the bound depends on the algorithm that allocates the tasks. We also derive the utilization bound of an algorithm which allocates tasks in decreasing order of utilization factors. Knowledge of such bounds allows us to carry out very fast schedulability tests although we are constrained by the fact that the tests are sufficient but not necessary to ensure schedulability.
Resumo:
The systems formalism is used to obtain the interfacial concentration transients for power-law current input at an expanding plane electrode. The explicit results for the concentration transients obtained here pertain to arbitrary homogeneous reaction schemes coupled to the oxidant and reductant of a single charge-transfer step and the power-law form without and with a preceding blank period (for two types of power-law current profile, say, (i) I(t) = I0(t−t0)q for t greater-or-equal, slanted t0, I(t) = 0 for t < t0; and (ii) I(t) = I0tq for t greater-or-equal, slanted t0, I(t) = 0 for t < t0). Finally the potential transients are obtained using Padé approximants. The results of Galvez et al. (for E, CE, EC, aC) (J. Electroanal. Chem., 132 (1982) 15; 146 (1983) 221, 233, 243), Molina et al. (for E) (J. Electroanal. Chem., 227 (1987) 1 and Kies (for E) (J. Electroanal. Chem., 45 (1973) 71) are obtained as special cases.
Resumo:
We study the energy current in a model of heat conduction, first considered in detail by Casher and Lebowitz. The model consists of a one-dimensional disordered harmonic chain of n i.i.d. random masses, connected to their nearest neighbors via identical springs, and coupled at the boundaries to Langevin heat baths, with respective temperatures T_1 and T_n. Let EJ_n be the steady-state energy current across the chain, averaged over the masses. We prove that EJ_n \sim (T_1 - T_n)n^{-3/2} in the limit n \to \infty, as has been conjectured by various authors over the time. The proof relies on a new explicit representation for the elements of the product of associated transfer matrices.
Resumo:
A fully self-consistent formulation is described here for the analysis and generation of base-pairs in non-uniform DNA structures, in terms of various local parameters. It is shown that the internal "wedge parameters" are mathematically related to the parameters describing the base-pair orientation with respect to an external helix axis. Hence any one set of three translation and three rotation parameters are necessary and sufficient to completely describe the relative orientation of the base-pairs comprising a step (or doublet). A general procedure is outlined for obtaining an average or global helix axis from the local helix axes for each step. A graphical representation of the local helix axes in the form of a polar plot is also shown and its application for estimating the curvature of oligonucleotide structures is illustrated, with examples of both A and B type structures.
Resumo:
The steady natural convection flow on a horizontal cone embedded in a saturated porous medium with non-uniform wall temperature/concentration or heat/mass flux and suction/injection has been investigated. Non-similar solutions have been obtained. The nonlinear couple differential equations under boundary layer approximations governing the flow have been numerically solved. The Nusselt and Sherwood numbers are found to depend on the buoyancy forces, suction/injection rates, variation of wall temperature/concentration or heat/mass flux, Lewis number and the non-Darcy parameter.