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  (26)
  • Springer  (26)
  • American Geophysical Union (AGU)
  • 1995-1999  (26)
  • Computer Science  (26)
Collection
  • Articles  (26)
Source
Keywords
Publisher
Years
Year
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 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
  • 3
    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
  • 4
    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
  • 5
    Electronic Resource
    Electronic Resource
    Predicting returns on Canadian exchange rates with artificial neural networks and EGARCH-M models (1996)
    Springer
    Neural computing & applications 4 (1996), S. 168-174 
    Details
    ISSN: 1433-3058
    Keywords: Backpropagation ; EGARCH-M ; Elman ; Exchange rates ; Neural networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper investigates the problem of predicting daily returns based on five Canadian exchange rates using artificial neural networks and EGARCH-M models. First, the statistical properties of five daily exchange rate series (US Dollar, German Mark, French Franc, Japanese Yen and British Pound) are analysed. EGARCH-M models on the Generalised Error Distribution (GED) are fitted to the return series, and serve as comparison standards, along with random walk models. Second, backpropagation networks (BPN) using lagged returns as inputs are trained and tested. Estimated volatilities from the EGARCH-M models are used also as inputs to see if performance is affected. The question of spillovers in interrelated markets is investigated with networks of multiple inputs and outputs. In addition, Elman-type recurrent networks are also trained and tested. Comparison of the various methods suggests that, despite their simplicity, neural networks are similar to the EGARCH-M class of nonlinear models, but superior to random walk models, in terms of insample fit and out-of-sample prediction performance.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01414877
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    PERs from projections for binding-time analysis (1995)
    Springer
    Higher-order and symbolic computation 8 (1995), S. 249-266 
    Details
    ISSN: 1573-0557
    Keywords: Binding-time analysis ; abstract interpretation ; projections ; PERs
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract First-order projection-based binding-time analysis has proven genuinely useful in partial evaluation [18]. There have been three notable generalisations of projection-based analysis to higher order. The first lacked a formal basis [19]; the second used structures strictly more general than projections, namelypartial equivalence relations (PERs) [14]; the third involved a complex construction that gave rise to impractically large abstract domains [7]. This paper presents a technique free of these shortcomings: it is simple, entirely projection-based, satisfies a formal correctness condition, and gives rise to reasonably small abstract domains. Though the technique is cast in terms of projections, there is also an interpretation in terms of PERs. The principal limitation of the technique is the restriction tomonomorphic typing.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01019006
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Parallel algorithms for image enhancement and segmentation by region growing, with an experimental study (1996)
    Springer
    The journal of supercomputing 10 (1996), S. 141-168 
    Details
    ISSN: 1573-0484
    Keywords: Parallel algorithms ; image processing ; region growing ; image enhancement ; image segmentation ; Symmetric Neighborhood Filter ; connected components ; parallel performance
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper presents efficient and portable implementations of a powerful image enhancement process, the Symmetric Neighborhood Filter (SNF), and an image segmentation technique that makes use of the SNF and a variant of the conventional connected components algorithm which we call δ-Connected Components. We use efficient techniques for distributing and coalescing data as well as efficient combinations of task and data parallelism. The image segmentation algorithm makes use of an efficient connected components algorithm based on a novel approach for parallel merging. The algorithms have been coded in Split-C and run on a variety of platforms, including the Thinking Machines CM-5, IBM SP-1 and SP-2, Cray Research T3D, Meiko Scientific CS-2, Intel Paragon, and workstation clusters. Our experimental results are consistent with the theoretical analysis (and provide the best known execution times for segmentation, even when compared with machine-specific implementations). Our test data include difficult images from the Landsat Thematic Mapper (TM) satellite data.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00130707
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Visibility with One Reflection (1998)
    Springer
    Discrete & computational geometry 19 (1998), S. 553-574 
    Details
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. We extend the concept of the polygon visible from a source point S in a simple polygon by considering visibility with two types of reflection, specular and diffuse. In specular reflection a light ray reflects from an edge of the polygon according to the rule: the angle of incidence equals the angle of reflection. In diffuse reflection a light ray reflects from an edge of the polygon in all inward directions. Several geometric and combinatorial properties of visibility polygons under these two types of reflection are described, when at most one reflection is permitted. We show that the visibility polygon Vs(S) under specular reflection may be nonsimple, while the visibility polygon Vd(S) under diffuse reflection is always simple. We present a Θ(n 2 ) worst-case bound on the combinatorial complexity of both Vs(S) and Vd(S) and describe simple O(n 2 log 2 n) time algorithms for constructing the sets.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/PL00009368
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Visibility with Multiple Reflections (1998)
    Springer
    Discrete & computational geometry 20 (1998), S. 61-78 
    Details
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. We show that the region lit by a point light source inside a simple n -gon after at most k reflections off the boundary has combinatorial complexity O(n 2k ) , for any k≥ 1 . A lower bound of Ω ((n/k-Θ(1)) 2k ) is also established which matches the upper bound for any fixed k . A simple near-optimal algorithm for computing the illuminated region is presented, which runs in O(n 2k log n) time and O(n 2k ) space for k〉1 , and in O(n 2 log 2 n) time and O(n 2 ) space for k=1 .
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/PL00009378
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Modeling inhibition of type II units in the dorsal cochlear nucleus (1997)
    Springer
    Biological cybernetics 76 (1997), S. 419-428 
    Details
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract.  Type II units in the dorsal cochlear nucleus (DCN) are characterized by vigorous but nonmonotonic responses to best frequency tones as a function of sound pressure level, and relatively weak responses to noise. A model of DCN neural circuitry was used to explore two hypothetical mechanisms by which neurons may be endowed with type II unit response properties. Both mechanisms assume that type II units receive excitatory input from auditory nerve (AN) fibers and inhibitory input from an unspecified class of cochlear nucleus interneurons that also receive excitatory AN input. The first mechanism, a lateral inhibition (LI) model, supposes that type II units receive inhibitory input from a number of narrowly tuned interneurons whose best frequencies (BFs) flank the BF of the type II unit. Tonal stimuli near BF result in only weak inhibitory input, but broadband stimuli recruit enough lateral inhibitors to greatly weaken the type II unit response. The second mechanism, a wideband inhibition (WBI) model, supposes that type II units receive inhibitory input from interneurons that are broadly tuned so that they respond more vigorously to broadband stimuli than to tones. Physiological and anatomical evidence points to the possible existence of such a class of neurons in the cochlear nucleus. The model extends an earlier computer model of an iso-frequency DCN patch to multiple frequency slices and adds a population of interneurons to provide the inhibition to model type II units (called I2-cells). The results show that both mechanisms accurately simulate responses of type II units to tones and noise. An experimental paradigm for distinguishing the two mechanisms is proposed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s004220050355
    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...