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
  • Articles  (103)
  • Springer  (103)
  • American Geophysical Union (AGU)
  • Computer Science  (103)
Collection
  • Articles  (103)
Source
Keywords
Publisher
Years
Journal
Topic
  • 1
    Electronic Resource
    Electronic Resource
    A field trial using Artificial Neural Networks to predict psychiatric in-patient Length-of-stay (1997)
    Springer
    Neural computing & applications 5 (1997), S. 184-193 
    Details
    ISSN: 1433-3058
    Keywords: Neural networks ; Length-of-stay ; Psychiatry ; Resource utilization ; Back propagation ; Field study
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Demands for health care reform will increase service utilization, much of which will fall on a system of expanded primary care providers, many of whom will not be specialists in psychiatry. These providers will need tools to augment their decision-making process. In this paper, we explore the use of Artificial Neural Networks (ANNs) in three different field sites to predict inpatient psychiatric Length-Of-Stay (LOS). This study describes the development and implementation of a runtime system in three different psychiatric facilities. Data was collected at these respective sites using the runtime system, and then this data was used to retrain the networks to determine if site-specific data would improve accuracy of prediction of LOS. The results indicate that ANNs trained with state hospital data could accurately predict LOS in two different community hospital psychiatric units. When the respective ANNs were retrained with approximately 10% new data from these specific hospitals, rates of improvement ranged from 3% to 15%. Our findings demonstrate that an ANN can adapt to different treatment settings and, when retrained, significantly improve prediction of LOS. Prediction rates by the ANN after retraining are comparable to results of a clinical team.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01413862
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A note on some computationally difficult set covering problems (1980)
    Springer
    Mathematical programming 18 (1980), S. 138-145 
    Details
    ISSN: 1436-4646
    Keywords: Set-covering Problem ; Branch and Bound ; Lower Bounds ; Steiner Triple Systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Fulkerson et al. have given two examples of set covering problems that are empirically difficult to solve. They arise from Steiner triple systems and the larger problem, which has a constraint matrix of size 330 × 45 has only recently been solved. In this note, we show that the Steiner triple systems do indeed give rise to a series of problems that are probably hard to solve by implicit enumeration. The main result is that for ann variable problem, branch and bound algorithms using a linear programming relaxation, and/or elimination by dominance require the examination of a super-polynomial number of partial solutions
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588309
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Scheduling activities among conflicting facilities to minimize conflict cost (1974)
    Springer
    Mathematical programming 6 (1974), S. 224-228 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01580238
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Interpolation by a local taut cubic piecewise polynomial (1987)
    Springer
    Computing 38 (1987), S. 299-313 
    Details
    ISSN: 1436-5057
    Keywords: 65D05 ; 41A10 ; Interpolation ; local piecewise polynomials ; ratio slope
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Ein Satz diskreter Datenwerte über dem Intervall [a, b], der eine Funktiong (x) repräsentiert, wird stückweise durch lokal definierte kubische Polynome interpoliert. Die entstehende Interpolationsfunktion hat folgende Eigenschaften: sie ist monoton und/oder konvex und repräsentiert alle durch die Daten vorgegebenen Wendepunkte, wobei keine zusätzlichen Wendepunkte erzeugt werden. Das Approximationsverfahren wird in Form eines FORTRAN 77-Unterprogramms angegeben.
    Notes: Abstract The interpolation of a discrete set of data, on the interval [a, b], representing the functiong(x) is obtained using a local piecewise polynomial of order 3. This piecewise cubic interpolant has the following properties: monotonicity and/or convexity or turning points that are present in the data are preserved and no extraneous turning points are created. This approximation method is also presented in the form of a FORTRAN77 subroutine.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02278708
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    A Research Perspective for Information Systems and Example of Emerging Area of Research (1999)
    Springer
    Information systems frontiers 1 (1999), S. 195-203 
    Details
    ISSN: 1572-9419
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1010094126762
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Constraint Networks of Topological Relations and Convexity (1999)
    Springer
    Constraints 4 (1999), S. 241-280 
    Details
    ISSN: 1572-9354
    Keywords: constraints ; topology ; convexity ; RCC8 ; expressivity ; complexity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper studies the expressivity and computational complexity of networks of constraints of topological relations together with convexity. We consider constraint networks whose nodes are regular regions (a regular region is one equal to the closure of its interior) and whose constraints have the following forms: (i) the eight “base relations” of [12], which describe binary topological relations of containment and adjacency between regions; (ii) the predicate, “X is convex.” We establish tight bounds on the computational complexity of this language: Determining whether such a constraint network is consistent is decidable, but essentially as hard as determining whether a set of comparable size of algebraic constraints over the real numbers is consistent. We also show an important expressivity result for this language: If r and s are bounded, regular regions that are not related by an affine transformation, then they can be distinguished by a constraint network. That is, there is a constraint network and a particular node in that network such that there is a solution where the node is equal to r, but no solution where the node is equal to s.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1026401931919
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    A simulation model for determining variable worker requirements in a service operation with time-dependent customer demand (1988)
    Springer
    Queueing systems 3 (1988), S. 265-275 
    Details
    ISSN: 1572-9443
    Keywords: Simulation ; service operations ; worker requirements ; queueing models
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In a service operation where worker requirements have to be determined for short scheduling time periods with nonstationary customer demand, the assumptions necessary for applying steady-state solutions to elementary queueing models are usually violated. This paper describes a simulation study of the behavior of such a service operation. The results are compared with the steady-state solutions to a queueing model where individual scheduling time periods are assumed to be independent. It is found that if the system utilization is below a derived maximum value (based on a service level criterion), then the steady-state solutions are robust enough to explain the behavior of the system and can be used to schedule worker requirements.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01161218
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Real-time queueing theory: A tutorial presentation with an admission control application (2000)
    Springer
    Queueing systems 35 (2000), S. 1-21 
    Details
    ISSN: 1572-9443
    Keywords: queueing theory ; real-time ; admission control
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Real-time scheduling, or scheduling with respect to a deadline, is critical in many application areas such as telecommunications, control systems, and manufacturing. This paper presents a novel approach to real-time scheduling based on a queueing theory model. Using real-time queueing theory (RTQT), one can analytically determine the distribution of the lead-time profile (i.e., the time until the deadline is reached) of customers waiting for service. Emphasis is placed on the development of the equations used to determine the lead-time profile distribution. The development of the GI/G/1 case is presented and confirmed using simulation. Simulation results confirm prior research for the M/M/1 and GI/M/1 case. As a practical application, RTQT is used to implement a packet admission control algorithm for a telecommunications network. Using this algorithm, packet lateness was reduced by up to 31%.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1019177624198
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Computerizing biblical literature (1996)
    Springer
    Computers and the humanities 30 (1996), S. 117-119 
    Details
    ISSN: 1572-8412
    Keywords: Web ; hypertext ; canon ; tutorial ; religion ; Lynx ; Netscape ; VAX
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Notes: Abstract Interpretation of literary texts is a multidimensional task requiring students to master a variety of skills and to acquire factual knowledge in diverse areas. The use of the World Wide Web in conjunction with student computer accounts has allowed me to create a virtual classroom in which students can explore many historical and theoretical aspects of interpretation through the use of HTML tutorials and Web resources. The discussion of the literary text in a community of scholars can take center stage in the physical classroom.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00419787
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Reviews (1975)
    Springer
    Computers and the humanities 9 (1975), S. 145-150 
    Details
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02404298
    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...