ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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
    Electronic Resource
    Electronic Resource
    Bingley : Emerald
    Kybernetes 24 (1995), S. 99-122 
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: The set of fuzzy threshold functions is defined to be a fuzzy set over the set of functions. All threshold functions have full memberships in this fuzzy set. Defines and investigates a distance measure between a non-linearly separable function and the set of all threshold functions. Defines an explicit expression for the membership function of a fuzzy threshold function through the use of this distance measure and finds three upper bounds for this measure. Presents a general method to compute the distance, an algorithm to generate the representation automatically, and a procedure to determine the proper weights and thresholds automatically. Presents the relationships among threshold gate networks, artificial neural networks and fuzzy neural networks. The results may have useful applications in logic design, pattern recognition, fuzzy logic, multi-objective fuzzy optimization and related areas.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Bingley : Emerald
    Kybernetes 27 (1998), S. 1036-1052 
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: The L-map method is an innovative method for sequential machine state minimization. More specifically, the L-map method consists of five steps. This method uses a portion of the partitioning method (step 1), and a portion of the implication table method (step 4). Steps 2 (eliminate singleton blocks), 3 (order non-singleton blocks) and 5 (process the block implication table cells) are developed in this paper. The resultant method is more effective than both the partitioning method and the implication table method. The L-map method is best illustrated by examples. In addition, 11 theorems are proven with illustrative examples. The advantages of this method over the partitioning method and the implication table method are stated. Furthermore, an algorithm which has four steps for finding the shortest input sequences for separating all pairs of distinguishable states using the L-map method is developed. Illustrative examples are given to demonstrate this algorithm. The results obtained in this may have useful applications in logic design, computer design, as well as VLSI design.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Bingley : Emerald
    Kybernetes 25 (1996), S. 51-55 
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: Manufacturing is a key to continuous economic growth. Fuzzy expert systems, fuzzy logics, fuzzy languages, fuzzy neural networks, and intelligent control are proposed as additional tools in manufacturing. Fuzzy logic is a new way to program computers and appliances to mimic the imprecise way humans make decisions. Fuzzy logic has been applied to cameras, subways, computers and air conditioners. Through the use of fuzzy logic, fuzzy expert systems can be built which add a new dimension in the technologies for intelligent factories.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Bingley : Emerald
    Kybernetes 25 (1996), S. 131-140 
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: Describes intuitively the fact that four types of formal languages can be generated by four types of grammars or can be recognized by four types of automata. Gives the relationships between context-sensitive languages and computer programming languages. Defines and investigates parallel productions, parallel grammars, and context-free parallel grammars. Shows that context-sensitive languages exist which can be generated by context-free parallel grammars. In addition, states the advantages of context-free parallel grammars. Also shows that context-free languages (CFL) are a proper subset of context-free parallel languages (CFPL). Furthermore, CFPL is a more effective tool for modelling computer programming languages than CFL, especially for parallel computer programming languages, for example, the ADA programming language. Also illustrates context-sensitive property of recognizing hand-written characters. The results may have useful applications in artificial intelligence, model parallel computer programming languages, software engineering, expert systems and robotics.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Bingley : Emerald
    Kybernetes 28 (1999), S. 198-203 
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: An improvement transformation is a transformation which has the following two properties, namely, (1) after applying it, all the already achieved subgoals are still being accomplished and (2) additional new subgoals or partial new subgoals may be accomplished. By using improvement transformations, an intelligent problem-solving method is presented with illustrative examples. This method consists of three parts: (1) goal decomposition and subgoal ordering; (2) successive improvement transformations; and (3) backtrack algorithms. The intelligent problem-solving method using successive improvement transformations may have useful applications in goal decomposition, goal regression, genetic algorithms, robotics, and future expert system design.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Bingley : Emerald
    Kybernetes 28 (1999), S. 298-305 
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: The entity-relationship approach is applied to similarity-driven pictorial database design. The capabilities and the limitations of computers are presented. Advantages of the entity-relationship approach, and similarity-driven pictorial database design are also presented. Classification of pictures, similarity-driven face databases, chromosome databases, leukocyte databases are investigated. Quantitative measure of equal-perimeter circular shape, equal-area circular shape, elongated, spiculed, indented, slightly indented, and deeply indented leukocytes are also investigated. The entity-relationship diagrams of a house, a house with high roof, and a church are shown as illustrative examples of this approach. The class of elongated isosceles triangles is viewed as a "fuzzy entity". Topics for future research are also stated. The results have useful applications in data engineering, knowledge engineering, pattern recognition, artificial intelligence, fuzzy language theory, computer graphics, expert systems and pictorial database design.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Bingley : Emerald
    Kybernetes 26 (1997), S. 392-406 
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: An efficient method utilizing a "max-pro" optimum scheme for solving the "max-min" decision function in a fuzzy optimization environment. The proposed method significantly simplifies the "max-min" optimum solving problem, especially in the case when the number of objectives and constraints is large. Presents illustrative examples. The technique may also have valuable applications in solving general optimization problems with a piecewise-smoothed objective function.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Bingley : Emerald
    Kybernetes 24 (1995), S. 38-43 
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: Briefly reviews co-ordinate-based navigation, behaviour-based navigation, navigation with a conic mirror and navigation with a spherical mirror. Proposes to include fuzzy languages and fuzzy instructions to perform robot navigation. Gives illustrative examples. One main characteristic of this approach is to trade precision with speed. This approach may also be applied to object motion tracking and fault-tolerant task scheduling.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Bingley : Emerald
    Kybernetes 28 (1999), S. 837-844 
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: Gray code is a code with the property that there is one and only one bit-change between any two neighboring numbers. An algorithm for generating gray codes is presented. It turns out that there are other codes which have the same characteristics as gray codes. We call this class of codes generalized gray code (GGC). More precisely, a GGC is a code which has both the reflective property and the unit distance property. Algorithms for generating n-bit GGC from the (n - 1)-bit GGC are presented with illustrative examples. It is found that the number of n-bit GGC is equal to 2n times the number of (n - 1)-bit GGC. GGC generation trees are used to find GGC. Shows that GGC may be used in the two cases: where 1: gray code cannot be used, and as 2: member of the GGC is better suited than the gray code. Deduces that through the use of GGC, we have more choices than using just gray codes, and that we may obtain better results in terms of fan-in, fan-out, propagation delays, power consumption, or other related constraints in designing digital systems. The results obtained in this paper may also have useful applications in implementing special logic functions such as fuzzy threshold functions or fuzzy symmetric functions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Bingley : Emerald
    Kybernetes 26 (1997), S. 217-220 
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: Presents four approaches (relational, network, hierarchical, entity-relationship) to medical database design with illustrative examples. Medical databases appear to be a fertile field for further study. In addition, the study of medical databases may contribute to finding more effective and more efficient ways to disseminate the latest scientific, engineering, and technical information in biomedical engineering.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...