ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • Bücher
  • Artikel  (47)
  • Weitere Quellen
  • 1995-1999  (36)
  • 1950-1954  (11)
  • Informatik  (47)
Sammlung
  • Bücher
  • Artikel  (47)
  • Weitere Quellen
Datenquelle
Schlagwörter
Verlag/Herausgeber
Erscheinungszeitraum
Jahr
Zeitschrift
Thema
  • 1
    Digitale Medien
    Digitale Medien
    Task performance using the library and Internet to acquire business intelligence (1998)
    Bingley : Emerald
    Internet research 8 (1998), S. 290-302 
    Details
    ISSN: 1066-2243
    Quelle: Emerald Fulltext Archive Database 1994-2005
    Thema: Informatik
    Notizen: The Internet is increasingly being used as a potential library substitute for a wide variety of business information tasks. However, little comparative research exists on the impact of such uses on task performance. This study examined performance differences (perceived, actual, and temporal) for a strategic business information acquisition experimental task when subjects used a library or the Internet. It was found that task performance decreased and time to completion increased when using the Internet as compared to the library. This paradox of performance enhancement expectations and actual outsomes when using the Internet may be temporal or idiosyncratic, or it may signal that our assumptions about traditional and electronic repositories are invalid. In any case, it is imperative that research on task performance continues to be done in order to ascertain the viability of this repository for information tasks. Implications of these findings and avenues of future research are discussed.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1108/10662249810231032
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 2
    Digitale Medien
    Digitale Medien
    System entropy analysis (1997)
    Bingley : Emerald
    Kybernetes 26 (1997), S. 674-688 
    Details
    ISSN: 0368-492X
    Quelle: Emerald Fulltext Archive Database 1994-2005
    Thema: Informatik
    Notizen: A number of entropy models of social systems have been developed recently. Unfortunately, the complementarity of these approaches remains largely unanalysed, due to terminological and conceptual differences among them. There is an urgent need for a meta-theoretical framework that will facilitate the analysis and comparison of all social entropy models. System entropy analysis (SEA), as presented here, is designed to fill this need. It is a second-order, meta-analytic tool which analyses each approach in terms of its major concepts, its basic units of analysis, its definition and measurement of entropy, and its specification of microstates and macrostates. First discusses the need for SEA, and then specifies its structure. Concludes with an application of SEA to the comparison and integration of three entropy approaches: synergetics, complexity theory and social entropy theory (SET).
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1108/03684929710169852
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 3
    Digitale Medien
    Digitale Medien
    The Use of SI-Algebra in the design of sequencer circuits (1997)
    Springer
    Formal aspects of computing 9 (1997), S. 395-408 
    Details
    ISSN: 1433-299X
    Schlagwort(e): Asynchronous circuits ; Four-phase handshake ; Speed-independent ; Formal methods ; Process algebra
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract One approach to the design of VLSI systems involves the use of asynchronous circuits that communicate by handshaking with each other. The control circuitry generated when following this approach often includes large trees of binary sequencer components. This paper demonstrates that there is scope here for optimization (in order to improve size, speed and energy consumption). Indeed, an industrial-strength silicon compiler has now been modified to take advantage of this fact. The problem that is addressed concerns the design of efficient control circuits that sequenceN four-phase handshakes (N 〉 2). Muller's speed-independent discipline facilitates the design of such circuits. SI-Algebra, a calculus that supports that discipline, is used to specify the problem and to verify (using recursion-induction) various implementations. Simple counting arguments at the gate level establish that optimization using these implementations is worthwhile.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF01211298
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 4
    Digitale Medien
    Digitale Medien
    A Comparison of Cox Regression and Neural Networks for Risk Stratification in Cases of Acute Lymphoblastic Leukaemia in Children (1999)
    Springer
    Neural computing & applications 8 (1999), S. 257-264 
    Details
    ISSN: 1433-3058
    Schlagwort(e): Key words: Acute lymphoblastic leukaemia; Cox regression; Neural network; Prognosis
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/s005210050028
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 5
    Digitale Medien
    Digitale Medien
    Adapting the Network Interface for High-Performance Computing: The CNI Approach (1997)
    Springer
    The journal of supercomputing 11 (1997), S. 181-200 
    Details
    ISSN: 1573-0484
    Schlagwort(e): Network Interfaces ; Consistency ; Cluster Computing ; Distributed Shared Memory
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract As the prices of commodity workstations go down, clusters of workstations have started to emerge as a viable economic solution for scalable computing. Recent advances in networking technology have made it possible to obtain high-bandwidth connections between applications. However, the interconnect latency between workstation nodes in a cluster remains a serious concern and can prove to be the limiting factor in workstation performance. In this paper, we present the CNI orcluster network interface that achieves the twin goals of low latency and high bandwidth. In addition, CNI efficiently supports multiple programming paradigms for programming generality. This is done by functionally coupling the network interface more closely to the CPU without violating the constraints of a standard workstation architecture, CNI results in performance gains for applications, substantially reducing communication overhead and delay.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1007916208676
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 6
    Digitale Medien
    Digitale Medien
    Unsupervised Learning of Multiple Motifs in Biopolymers Using Expectation Maximization (1995)
    Springer
    Machine learning 21 (1995), S. 51-80 
    Details
    ISSN: 0885-6125
    Schlagwort(e): Unsupervised learning ; expectation maximization ; consensus sequence ; motif ; biopolymer ; promoter ; binding site ; DNA ; protein ; sequence analysis
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract The MEME algorithm extends the expectation maximization (EM) algorithm for identifying motifs in unaligned biopolymer sequences. The aim of MEME is to discover new motifs in a set of biopolymer sequences where little or nothing is known in advance about any motifs that may be present. MEME innovations expand the range of problems which can be solved using EM and increase the chance of finding good solutions. First, subsequences which actually occur in the biopolymer sequences are used as starting points for the EM algorithm to increase the probability of finding globally optimal motifs. Second, the assumption that each sequence contains exactly one occurrence of the shared motif is removed. This allows multiple appearances of a motif to occur in any sequence and permits the algorithm to ignore sequences with no appearance of the shared motif, increasing its resistance to noisy data. Third, a method for probabilistically erasing shared motifs after they are found is incorporated so that several distinct motifs can be found in the same set of sequences, both when different motifs appear in different sequences and when a single sequence may contain multiple motifs. Experiments show that MEME can discover both the CRP and LexA binding sites from a set of sequences which contain one or both sites, and that MEME can discover both the −10 and −35 promoter regions in a set of E. coli sequences.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1022617714621
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 7
    Digitale Medien
    Digitale Medien
    Coherence and Enumeration of Tilings of 3-Zonotopes (1999)
    Springer
    Discrete & computational geometry 22 (1999), S. 119-147 
    Details
    ISSN: 1432-0444
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract. A rhombohedral tiling of a d -zonotope Z is said to be coherent if it may be obtained by projecting the ``top faces'' of some (d+1) -zonotope onto Z. We classify those 3 -zonotopes with five or fewer distinct zones which have all rhombohedral tilings coherent, and give concise enumeration formulas for the tilings of the zonotopes in each class. This enumeration relies in equal parts on the theory of oriented matroids and the theory of discriminantal arrangements of hyperplanes.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/PL00009445
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 8
    Digitale Medien
    Digitale Medien
    Unsupervised learning of multiple motifs in biopolymers using expectation maximization (1995)
    Springer
    Machine learning 21 (1995), S. 51-80 
    Details
    ISSN: 0885-6125
    Schlagwort(e): Unsupervised learning ; expectation maximization ; consensus sequence ; motif ; biopolymer ; promoter ; binding site ; DNA ; protein ; sequence analysis
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract The MEME algorithm extends the expectation maximization (EM) algorithm for identifying motifs in unaligned biopolymer sequences. The aim of MEME is to discover new motifs in a set of biopolymer sequences where little or nothing is known in advance about any motifs that may be present. MEME innovations expand the range of problems which can be solved using EM and increase the chance of finding good solutions. First, subsequences which actually occur in the biopolymer sequences are used as starting points for the EM algorithm to increase the probability of finding globally optimal motifs. Second, the assumption that each sequence contains exactly one occurrence of the shared motif is removed. This allows multiple appearances of a motif to occur in any sequence and permits the algorithm to ignore sequences with no appearance of the shared motif, increasing its resistance to noisy data. Third, a method for probabilistically erasing shared motifs after they are found is incorporated so that several distinct motifs can be found in the same set of sequences, both when different motifs appear in different sequences and when a single sequence may contain multiple motifs. Experiments show that MEME can discover both the CRP and LexA binding sites from a set of sequences which contain one or both sites, and that MEME can discover both the −10 and −35 promoter regions in a set ofE. coli sequences.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF00993379
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 9
    Digitale Medien
    Digitale Medien
    L0-The first five years of an automated language acquisition project (1996)
    Springer
    Artificial intelligence review 10 (1996), S. 103-129 
    Details
    ISSN: 1573-7462
    Schlagwort(e): language learning ; structured connectionism ; embodied cognition
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract The L0 project at ICSI and UC Berkeley attempts to combine not only vision and natural language modelling, but also learning. The original task was put forward in (Feldman et al. 1990a) as a touchstone task for AI and cognitive science. The task is to build a system that can learn the appropriate fragment of any natural language from sentence-picture pairs. We have not succeeded in building such a system, but we have made considerable progress on component subtasks and this has led in a number of productive and surprising directions.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF00159218
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 10
    Digitale Medien
    Digitale Medien
    Orthogonal Partitions in Designed Experiments (1996)
    Springer
    Designs, codes and cryptography 8 (1996), S. 45-77 
    Details
    ISSN: 1573-7586
    Schlagwort(e): association scheme ; block structure ; crossing ; infimum ; nesting ; orthogonality ; partition ; poset ; supremum
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract A survey is given of the statistical theory of orthogonalpartitions on a finite set. Orthogonality, closure under suprema,and one trivial partition give an orthogonal decomposition ofthe corresponding vector space into subspaces indexed by thepartitions. These conditions plus uniformity, closure under infimaand the other trivial partition give association schemes. Examplescovered by the theory include Latin squares, orthogonal arrays,semilattices of subgroups, and partitions defined by the ancestralsubsets of a partially ordered set (the poset block structures). Isomorphism, equivalence and duality are discussed, and theautomorphism groups given in some cases. Finally, the ideas areillustrated by some examples of real experiments.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1018072606346
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...