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
  • 1
    Electronic Resource
    Electronic Resource
    Fuzzy threshold functions and applications (1995)
    Bingley : Emerald
    Kybernetes 24 (1995), S. 99-122 
    Details
    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
    URL: http://dx.doi.org/10.1108/03684929510095711
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    The L-map method for sequential machine state minimization (1998)
    Bingley : Emerald
    Kybernetes 27 (1998), S. 1036-1052 
    Details
    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
    URL: http://dx.doi.org/10.1108/03684929810246053
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Intelligent factories using fuzzy expert systems (1996)
    Bingley : Emerald
    Kybernetes 25 (1996), S. 51-55 
    Details
    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
    URL: http://dx.doi.org/10.1108/03684929610116428
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Line-oriented two-dimensional parallel computer languages (2002)
    Bingley : Emerald
    Kybernetes 31 (2002), S. 872-883 
    Details
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: Line-oriented two-dimensional grammars (LOTDGs), region-oriented two-dimensional grammars (ROTDGs) and parallel productions are introduced. The relationships between LOTDGs and ROTDGs are stated. Examples of LOTDGS for generating all possible 45° right-angled triangles, all possible squares, all possible 45° isosceles trapezoids, and all possible 45° parallelograms using parallel productions are presented. A new concise representation of a derivation chain is also introduced and illustrated by examples. LOTDGs and ROTDGs are compared. Generally speaking, LOTDGs require less terminal variables and non-terminal variables, require less storage space, and require less derivation steps. Seven challenging problems for future research are also included. In addition, parallel production is an effective tool to model parallel computers as well as parallel processing. The results have useful applications in robot vision interpretation, robot pictorial communication, artificial intelligence, visual languages, software engineering, medical expert systems, and fuzzy logic functions.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1108/03684920210432826
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Research topics in pictorial databases (2004)
    Bingley : Emerald
    Kybernetes 33 (2004), S. 1320-1328 
    Details
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: Pictures are natural and effective means of communication among people, computers, and robotics. A pictorial database is a collection of sharable pictorial data encoded in various formats. During the past several years, pictorial databases have attracted growing attention as an important component in building pictorial information systems as well as intelligent information systems. Eight research tasks are presented. They are comparing the numerical and the linguistic variable approaches, examining new linguistic hedges, studying the similarity of various similarity measures, investigating pictorial data compression techniques, performing pictorial data compression using array grammars, applying the entity-relationship (ER) model to picture description; further investigating the relationship hierarchy for picture representation using ER diagrams, and extracting pictorial knowledge from pictorial databases. The research results may have a major impact on the development of object-oriented pictorial databases.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1108/03684920410545298
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Human Emotion Estimation through Facial Expressions (1994)
    Bingley : Emerald
    Kybernetes 23 (1994), S. 39-46 
    Details
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: Facial primitives such as eyebrows, eyes and mouth are used for the computer estimation of emotion. Describes how a pictorial knowledge-base and pictorial knowledge-tree are constructed from facial primitives in order to identify emotions in humans. Shows how the pictorial knowledge is compiled using a rule-based knowledge representation. Discusses the future research implications and suggests areas where such computer estimation may be applied.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1108/03684929410050568
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Boolean Algebra from the Lattice Point of View (1994)
    Bingley : Emerald
    Kybernetes 23 (1994), S. 59-64 
    Details
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: Using lattices, presents Boolean Algebra, which is usually introduced using its postulate-oriented approach. Relationships among sets, relations, lattices and Boolean algebra are shown to form a distributive but not complemented lattice. Provides examples together with corresponding Hasse diagrams. References useful application areas.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1108/03684929410059055
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Context-free parallel grammars and their applications to generating context-sensitive languages (1996)
    Bingley : Emerald
    Kybernetes 25 (1996), S. 131-140 
    Details
    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
    URL: http://dx.doi.org/10.1108/03684929610118390
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Applying successive improvement transformations for intelligent problem solving (1999)
    Bingley : Emerald
    Kybernetes 28 (1999), S. 198-203 
    Details
    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
    URL: http://dx.doi.org/10.1108/03684929910258815
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Similarity-driven pictorial database design using entity-relationship approach (1999)
    Bingley : Emerald
    Kybernetes 28 (1999), S. 298-305 
    Details
    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
    URL: http://dx.doi.org/10.1108/03684929910265925
    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...