ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Springer  (97)
  • Wiley  (19)
  • Oxford University Press  (10)
  • 2000-2004  (61)
  • 1985-1989  (65)
  • 1
    Electronic Resource
    Electronic Resource
    A note on the estimation of microbial glycosidase activities by dinitrosalicylic acid reagent (2000)
    Springer
    Applied microbiology and biotechnology 53 (2000), S. 732-735 
    Details
    ISSN: 1432-0614
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Process Engineering, Biotechnology, Nutrition Technology
    Notes: Abstract  In the estimation of glycosidase activity by dinitrosalicylic acid (DNS) reagent, the stoichiometry of DNS reduction was reported to increase proportionately with the increase in the number of glycosidic linkages present in oligosaccharides liberated by the enzyme. The relationship between increases in DNS reduction and increases in the number of glycosidic bonds was found to be represented by a part of a rectangular hyperbola. The increase was optimum with disaccharide and insignificant when the degree of polymerization (DP) was ≥10. The difference did not arise as a result of the DNSA discriminating between mono- and oligosaccharide oxidation. The relationship stemmed from the acidity of the hydroxyl group adjacent to the reducing group, which repressed DNS reduction. The acidity is likely to decrease with an increase in oligosaccharide chain length. It is suggested that DNS reduction is actually optimum and uniform for all oligosaccharides of DP ≥ 10 and that it is minimum for monosaccharide. Thus the introduction of rectification factors in the estimation of glycosidase activities by the DNS method appears to be justified.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s002530000327
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    facet.materialart.
    Unknown
    A note on the estimation of microbial glycosidase activities by dinitrosalicylic acid reagent (2000)
    Springer
    Details
    Publication Date: 2000-06-13
    Print ISSN: 0175-7598
    Electronic ISSN: 1432-0614
    Topics: Biology , Process Engineering, Biotechnology, Nutrition Technology
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 3
    facet.materialart.
    Unknown
    Investigations on the binding and antioxidant properties of the plant flavonoid fisetin in model biomembranes (2004)
    Wiley
    Details
    Publication Date: 2004-06-20
    Print ISSN: 0014-5793
    Electronic ISSN: 1873-3468
    Topics: Biology , Chemistry and Pharmacology
    Published by Wiley on behalf of Federation of European Biochemical Societies.
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 4
    Electronic Resource
    Electronic Resource
    Mechanical properties of oriented fibres of semicrystalline polymers based upon orientation function from optical properties (1986)
    Springer
    Colloid & polymer science 264 (1986), S. 128-130 
    Details
    ISSN: 1435-1536
    Keywords: Orientation of polymer chains ; mechanical properties ; birefringence ; deformation scheme
    Source: Springer Online Journal Archives 1860-2000
    Topics: Chemistry and Pharmacology , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract The computation of the orientational averages is a great problem in the case of semicrystalline polymers. In a previous communication [1] it has been shown that sinθ=f(λ) sinθ′ describes the orientational changes satisfactorily for a certain class of polymers. In this paper some alternative deformation schemes are also discussed. It has been concluded that birefringence provides a useful guideline in the choice of a deformation scheme.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01414838
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Algorithms for Dynamic Routing in All-Optical Networks (2000)
    Springer
    Photonic network communications 2 (2000), S. 163-184 
    Details
    ISSN: 1572-8188
    Keywords: wavelength routed optical network ; dynamic lightpath assignment ; all-optical networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract In this paper, we have studied a number of algorithms for routing in all-optical wavelength routed networks. We have considered situations where a lightpath is dynamically created in response to a request for communication and the WDM channels constituting the lightpath are reclaimed when the communication is over. We have looked at two schemes for dynamic wavelength allocation. In the first scheme we have assumed the existence of a central agent to maintain a database of existing lightpaths where the central agent attempts to generate a new lightpath in response to a request for communication. In the second scheme, we attempt to generate a new lightpath using a distributed algorithm. In the first scheme we have exploited the existence of multiple paths between any pair of nodes in a network in order to reduce the blocking probability. For the second scheme, we have proposed three distributed strategies to determine, if possible, a lightpath when there is a request for communication. Each of these strategies have their advantages and disadvantages in terms of the expected blocking probability and the set-up time. We have studied the performances of both the schemes using Monte Carlo simulation.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1010088407041
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    An Optical Layer Lightpath Management Protocol for WDM AONs (2000)
    Springer
    Photonic network communications 2 (2000), S. 185-198 
    Details
    ISSN: 1572-8188
    Keywords: all-optical networks (AONs) ; WDM ; lightpath management ; optical layer protocol ; specification ; communicating finite state machine (CFSM) ; validation and reachability analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract In this work, we propose a control protocol for lightpath management in the optical layer of all-optical networks (AONs). AONs follow a layered structure, as used by various network standards, where each layer communicates with its peer through Protocol Data Units (PDUs). In the context of Open System Interconnection (OSI) Reference Model (RM), a new layer, called optical layer, has been introduced in the AON architecture to manage the lightpath related functions. The optical layer lies in between the physical layer and the data link layer. The objective of this paper is to define a specification for an optical layer protocol for managing lightpaths in AONs. In order to study the dynamics of the optical layer protocol system, we first employ the communicating finite state machine model to represent the protocol. Then a reachability analysis of the model is performed to verify the protocol. This paper shows how the optical layer protocol can be specified formally and made error-free by the step-wise refinement of an initial specification, where validation is done after each refinement.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1010040523879
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    A Distributed Fault Management Scheme for Wavelength Routed All-Optical Networks (2000)
    Springer
    Photonic network communications 2 (2000), S. 369-382 
    Details
    ISSN: 1572-8188
    Keywords: all-optical networks ; fault management ; distributed algorithm ; dynamic routing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract This paper presents a distributed algorithm to determine fault avoiding routes between source-destination end-node pairs in an all-optical network. Fault-tolerant routing for WDM routed all-optical networks has not been studied in details in the literature except for using protection switching or loopback recovery. Such schemes use predetermined protection mechanism and hence assume that the protection path is not faulty. This paper considers extensions to a dynamic routing scheme (presented earlier by these authors for fault-free networks) to handle rerouting in case of fault occurrence. The performance degradations of the network because of fault occurrence are then studied in terms of blocking probability and set-up time through simulations.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1026522715035
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Optimal Tests for No Contamination in Reliability Models (2000)
    Springer
    Lifetime data analysis 6 (2000), S. 281-290 
    Details
    ISSN: 1572-9249
    Keywords: contamination model ; optimal tests ; Pivotal Parametric Product ; reliability distributions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Inferences on mixtures of probability distributions, in general,and of life distributions, in particular, are receiving considerableimportance in recent years. The likelihood ratio procedure oftesting for the null hypothesis of no contamination is oftenvery cumbersome and lacks its usual asymptotic properties. Recently,SenGupta (1991) has introduced the notion of an `L-optimal' testfor such testing problems. The idea is to recast the originalseveral parametric hypotheses representation of the null hypothesisin terms of only a single hypothesis involving an appropriatelychosen parametric function. This approach is shown to be bothmathematically elegant and operationally simple for a quite generalclass of mixture distributions which contains, in particular,all mixtures of the one-parameter exponential family and alsoa very rich subclass of mixtures useful in life-testing and reliabilityanalysis. It is also illustrated through two examples—onebased on real-life data and the other on a simulated sample.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009645810290
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    ATM Routing Algorithms for Multimedia Traffic in Private ATM Networks (2000)
    Springer
    Journal of heuristics 6 (2000), S. 21-38 
    Details
    ISSN: 1572-9397
    Keywords: ATM networks ; dynamic routing ; PNNI ; simulations ; QoS ; multimedia
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The goal of this paper is to recommend a good Private Network-to-Network Interface (PNNI) routing algorithm for private ATM networks. A good routing algorithm has to work well with multimedia traffic with several quality of service (QoS) requirements (such as cell loss ratio, cell delay and its variation etc.) in different networks under various traffic conditions. The multiplicity of QoS requirements makes the routing problem NP-complete, so our approach to the problem is based on large scale simulations involving several empirical algorithms (compliant with the PNNI routing specification) which have been tested for different network topologies and traffic scenarios. Based on analysis of tradeoffs involving performance metrics (such as blocking rate, complexity, load distribution) we recommend a consistently good routing algorithm for single domain ATM networks.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009609609199
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    A single server queue with gated processor-sharing discipline (1989)
    Springer
    Queueing systems 4 (1989), S. 249-261 
    Details
    ISSN: 1572-9443
    Keywords: Processor-sharing ; discrimination function ; gating mechanism
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper we consider a single server queue in which arrivals occur according to a Poisson process and each customer's service time is exponentially distributed. The server works according to the gated process-sharing discipline. In this discipline, the server provides service to a batch of at mostm customers at a time. Once a batch of customers begins service, no other waiting customer can receive service until all members of the batch have completed their service. For this queue, we derive performance characteristics, such as waiting time distribution, queue length distribution etc. For this queue, it is possible to obtain the mean conditional response time for a customer whose service time is known. This conditional response time is a nonlinear function (as opposed to the linear case for the ordinary processor-sharing queue). A special case of the queue (wherem=∞) has an interesting and unusual solution. For this special case, the size of the batch for service is a Markov chain whose steady state distribution can be explicitly written down. Apart from the contribution to the theory of Markov chains and queues, the model may be applicable to scheduling of computer and communication systems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02100269
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...