Library

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
  • 1
    facet.materialart.
    Unknown
    Experimental Studies of Stochastic Models for the Prisoner's Dilemma (1966)
    Baltimore, Md. : Periodicals Archive Online (PAO)
    Behavioral science. 11:6 (1966:Nov.) 444 
    Details
    ISSN: 0005-7940
    Topics: Psychology
    URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pao:&rft_dat=xri:pao:article:5019-1966-011-06-000003
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Entropy and the complexity of graphs: I. An index of the relative complexity of a graph (1968)
    Springer
    Bulletin of mathematical biology 30 (1968), S. 175-204 
    Details
    ISSN: 1522-9602
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Mathematics
    Notes: Abstract The structural information content (Rashevsky, 1955; Trucco 1956a, b)I g (X) of a graphX is defined as the entropy of the finite probability scheme constructed from the orbits of its automorphism groupG(X). The behavior ofI g on various graph operations—complement, sum, join, cartesian product and composition, is examined. The principal result of the paper is the characterization of a class of graph product operations on whichI g is semi-additive. That is to say, conditions are found for binary operations o and ∇ defined on graphs and groups, respectively, which are sufficient to insure thatI g (X o Y)=I g (X)+I g (Y)−H XY , whereH XY is a certain conditional entropy defined relative to the orbits ofG(X o Y) andG(X) ∇G(Y).
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02476948
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Knowledge-intensive systems in the social service agency: Anticipated impacts on the organisation (1995)
    Springer
    AI & society 9 (1995), S. 161-183 
    Details
    ISSN: 1435-5655
    Keywords: Bureaucratic rationalism ; Expert systems ; Knowledge-intensive systems ; Organisational impact ; Social services
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Shrinking resources and the increasing complexity of clinical decisions are stimulating research in knowledge-intensive computer applications for the delivery of social services. The expected benefits of knowledge-intensive applications such as expert systems include improvement in both the quality and the consistency of service delivery, augmentation of institutional memory, and reduced labour costs through greater reliance on paraprofessionals. This paper analyses the likely impacts of knowledge-intensive systems on social service organisations, drawing on trends in related service-delivery fields, and on known impacts of computer applications in organisations. A structural change may be anticipated: decision making and planning functions will shift increasingly from social service professionals to administrators.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01210602
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs (1968)
    Springer
    Bulletin of mathematical biology 30 (1968), S. 225-240 
    Details
    ISSN: 1522-9602
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Mathematics
    Notes: Abstract In a previous paper (Mowshowitz, 1968), a measureI g (X) of the structural information content of an (undirected) graphX was defined, and its properties explored. The class of graphs on whichI g is defined is here enlarged to included directed graphs (digraphs). Most of the properties ofI g observed in the undirected case are seen to hold for digraphs. The greater generality of digraphs allows for a construction which shows that there exists a digraph having information content equal to the entropy of an arbitrary partition of a given positive integer. The measureI g is also extended to a measure defined on infinite (undirected) graphs. The properties of this extension are discussed, and its applicability to the problem of measuring the complexity of algorithms is considered.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02476692
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Entropy and the complexity of graphs: III. Graphs with prescribed information content (1968)
    Springer
    Bulletin of mathematical biology 30 (1968), S. 387-414 
    Details
    ISSN: 1522-9602
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Mathematics
    Notes: Abstract The connection between the adjacency matrix and the automorphisms of a digraph is used to develop a method for studying the automorphism group and, thus, the information content (Mowshowitz 1968a, b) of a digraph. An algorithm is given for constructing digraphs with zero information content, and the properties of such digraphs are examined. Moreover, an algorithm for computing the automorphism group of a digraph is presented and is used to find conditions which insure that two digraphs have the same information content. This algorithm is further used to determine the information content of digraphs whose adjacency matrices have prescribed properties.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02476603
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Entropy and the complexity of graphs: IV. Entropy measures and graphical structure (1968)
    Springer
    Bulletin of mathematical biology 30 (1968), S. 533-546 
    Details
    ISSN: 1522-9602
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Mathematics
    Notes: Abstract The structural information contentI g (X) of a graphX was treated in detail in three previous papers (Mowshowitz 1968a, 1968b, 1968c). Those investigations ofI g point up the desirability of defining and examining other entropy-like measures on graphs. To this end the chromatic information contentI c (X) of a graphX is defined as the minimum entropy over all finite probability schemes constructed from chromatic decompositions having rank equal to the chromatic number ofX. Graph-theoretic results concerning chromatic number are used to establish basic properties ofI c on arbitrary graphs. Moreover, the behavior ofI c on certain special classes of graphs is examined. The peculiar structural characteristics of a graph on which the respective behaviors of the entropy-like measuresI c andI g depend are also discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02476673
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Book
    Book
    ¬The¬ conquest of will, information processing in human affairs (1976)
    Reading, MA u.a. :Addison-Wesley,
    Details
    Title: ¬The¬ conquest of will, information processing in human affairs
    Author: Mowshowitz, Abbe
    Publisher: Reading, MA u.a. :Addison-Wesley,
    Year of publication: 1976
    Pages: 363 S.
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
  • 8
    Book
    Book
    2nd IFIP Conference on Human Choice and Computers (1980)
    Amsterdam u.a. :North-Holland,
    Details
    Title: 2nd IFIP Conference on Human Choice and Computers
    Contributer: Mowshowitz, Abbe , IFIP
    Publisher: Amsterdam u.a. :North-Holland,
    Year of publication: 1980
    Pages: 305 S.
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...