Library

Language
Preferred search index
Number of Hits per Page
Default Sort Criterion
Default Sort Ordering
Size of Search History
Default Email Address
Default Export Format
Default Export Encoding
Facet list arrangement
Maximum number of values per filter
Auto Completion
Feed Format
Maximum Number of Items per Feed
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Oxford, UK : Blackwell Publishing Ltd
    Annals of the New York Academy of Sciences 572 (1989), S. 0 
    ISSN: 1749-6632
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Natural Sciences in General
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Palo Alto, Calif. : Annual Reviews
    Annual Review of Public Health 25 (2004), S. 139-153 
    ISSN: 0163-7525
    Source: Annual Reviews Electronic Back Volume Collection 1932-2001ff
    Topics: Medicine
    Notes: With the completion of the Human Genome Project, it is likely that genetic testing for susceptibility to a wide range of diseases will increase in society. One venue for such increased testing is likely to be the workplace as employers attempt to protect workers from unhealthy gene-environment interactions, improve productivity, and control escalating health care costs. Past and recent examples of genetic testing in the workplace raise serious concerns that such testing could pose a significant threat to workers' privacy, autonomy, and dignity. Thus, defining the ethically, legally, and socially appropriate and inappropriate uses of genetic testing in the workplace presents a major challenge for occupational health professionals in the years ahead.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    facet.materialart.
    Unknown
    Leiden : Periodicals Archive Online (PAO)
    Journal of Phenomenological Psychology. 5:1 (1974:Fall) 41 
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Amsterdam : Elsevier
    The @Arts in Psychotherapy 18 (1991), S. 113-121 
    ISSN: 0197-4556
    Source: Elsevier Journal Backfiles on ScienceDirect 1907 - 2002
    Topics: Medicine
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Queueing systems 32 (1999), S. 363-381 
    ISSN: 1572-9443
    Keywords: head-of-the-line processor-sharing ; many queues ; permanent customers ; marked point process ; stability condition ; Loynes’ construction ; ergodicity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We consider a single server system consisting of n queues with different types of customers and k permanent customers. The permanent customers and those at the head of the queues are served in processor-sharing by the service facility (head-of-the-line processor-sharing). By means of Loynes’ monotonicity method a stationary work load process is constructed and using sample path analysis general stability conditions are derived. They allow to decide which queues are stable and, moreover, to compute the fraction of processor capacity devoted to the permanent customers. In case of a stable system the constructed stationary state process is the only one and for any initial state the system converges pathwise to the steady state.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Queueing systems 6 (1990), S. 287-310 
    ISSN: 1572-9443
    Keywords: Single server queue ; discrete time ; batch arrivals ; spaced packets ; embedded Markov chain ; functional equation ; stationary mean queue length ; limiting results
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We study a discrete-time single-server queue where batches of messages arrive. Each message consists of a geometrically distributed number of packets which do not arrive at the same instant and which require a time unit as service time. We consider the cases of constant spacing and geometrically distributed (random) spacing between consecutive packets of a message. For the probability generating function of the stationary distribution of the embedded Markov chain we derive in both cases a functional equation which involves a boundary function. The stationary mean number of packets in the system can be computed via this boundary function without solving the functional equation. In case of constant (random) spacing the boundary function can be determined by solving a finite-dimensional (an infinite-dimensional) system of linear equations numerically. For Poisson- and Bernoulli-distributed arrivals of messages numerical results are presented. Further, limiting results are derived.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Queueing systems 17 (1994), S. 275-315 
    ISSN: 1572-9443
    Keywords: Fluid flow approximation ; superposition ; Markov modulated rate processes ; counting process ; bursty traffic ; asymptotical normality ; complex integration ; numerical integration
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Fluid flow approximations are widely used for approximating models of communication systems where packet arrival streams are generated in a regular manner over certain intervals (constant rate). The appropriate mathematical model for describing those bursty arrival streams in the fluid flow framework are the well-known Markov modulated rate processes (MMRP). The paper deals with the distribution of the numberN(t) of packets in the interval [0,t] of MMRP. For two-state MMRPs and their superpositions we derive formulas for the distribution ofN(t) and its density. Further we give asymptotic results. The presented numerical results and simulation studies illustrate the goodness of the fluid flow approximation and show that the proposed numerical algorithms work well even in the case of multiplexing a large number of burst silence sources.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Methodology and computing in applied probability 1 (1999), S. 191-210 
    ISSN: 1387-5841
    Keywords: two queues ; many-server ; server reservation ; impatience ; occupancy distribution ; waiting time distribution ; approximate system ; M(n)/M(n)/s+GI ; call center application
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We consider an s-server priority system with a protected and an unprotected queue. The arrival rates at the queues and the service rate may depend on the number n of customers being in service or in the protected queue, but the service rate is assumed to be constant for n 〉 s. As soon as any server is idle, a customer from the protected queue will be served according to the FCFS discipline. However, the customers in the protected queue are impatient. If the offered waiting time exceeds a random maximal waiting time I, then the customer leaves the protected queue after time I. If I is less than a given deterministic time, then he leaves the system, else he will be transferred by the system to the unprotected queue. The service of a customer from the unprotected queue will be started if the protected queue is empty and more than a given number of servers become idle. The model is a generalization of the many-server queue with impatient customers. The global balance conditions seem to have no explicit solution. However, the balance conditions for the density of the stationary state process for the subsystem of customers being in service or in the protected queue can be solved. This yields the stability conditions and the probabilities that precisely n customers are in service or in the protected queue. For obtaining performance measures for the unprotected queue, a system approximation based on fitting impatience intensities is constructed. The results are applied to the performance analysis of a call center with an integrated voice-mail-server.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Archives of dermatological research 27 (1894), S. 129-156 
    ISSN: 1432-069X
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    ISSN: 1432-1424
    Keywords: junctional foot protein ; calpain ; calmodulin ; ryanodine receptor ; PEST sequence ; skeletal muscle triad junction
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Chemistry and Pharmacology
    Notes: Summary The Ca2+ activated neutral protease calpain II in a concentration-dependent manner sequentially degrades the Junctional foot protein (JFP) of rabbit skeletal muscle triad junctions in either the triad membrane or as the pure protein. This progression is inhibited by calmodulin. Calpain initially cleaves the 565 kDa JFP monomer into peptides of 160 and 410 kDa, which is subsequently cleaved to 70 and 340 kDa. The 340 kDa peptide is finally cleaved to 140 and 200 kDa or its further products. When the JFP was labeled in the triad membrane with the hydrophobic probe 3-(trifuoromethyl) 3-(m) [125I]iodophenyl diazirine and then isolated and proteolysed with calpain II, the [125I] was traced from the 565 kDa parent to M r, 410 kDa and then to 340 kDa, implying that these large fragments contain the majority of the transmembrane segments. A 70-kDa frament was also labeled with the hydrophobic probe, although weakly suggesting an additional transmembrane segment in the middle of the molecule. These transmembrane segments have been predicted to be in the C-terminal region of the JFP. Using an ALOM program, we also predict that transmembrane segments may exist in the 70 kDa fragment. The JFP has eight PEDST sequences; this finding together with the calmodulin inhibition of calpain imply that the JFP is a PEDST-type calpain substrate. Calpain usually cleaves such substrates at or near calmodulin binding sites. Assuming such sites for proteolysis, we propose that the fragments of the JFP correspond to the monomer sequence in the following order from the N-terminus: 160, 70, 140 and 200 kDa. For this model, new calmodulin sequences are predicted to exist near 160 and 225 kDa from the N-terminus. When the intact JFP was labeled with azidoATP, label appeared in the 160 and 140 kDa fragments, which according to the above model contain the GXGXXG sequences postulated as ATP binding sites. This transmembrane segment was predicted by the ALOM program. In addition, calpain and calpastatin activities remained associated with triad component organelles throughout their isolation. These findings and the existence of PEDST sequences suggest that the JFP is normally degraded by calpain in vivo and that degradation is regulated by calpastatin and calmodulin
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...