Quellcodebibliothek Statistik Leitseite products/Sources/formale Sprachen/GAP/pkg/thelma/doc/   (Algebra von RWTH Aachen Version 4.15.1©)  Datei vom 3.2.2022 mit Größe 8 kB image not shown  

Quelle  chapBib.html   Sprache: HTML

 
 products/Sources/formale Sprachen/GAP/pkg/thelma/doc/chapBib.html


<?xml version="1.0" encoding="UTF-8"?>

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
         "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">

<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<title>GAP (Thelma) - References</title>
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<meta name="generator" content="GAPDoc2HTML" />
<link rel="stylesheet" type="text/css" href="manual.css" />
<script src="manual.js" type="text/javascript"></script>
<script type="text/javascript">overwriteStyle();</script>
</head>
<body class="chapBib"  onload="jscontent()">


<div class="chlinktop"><span class="chlink1">Goto Chapter: </span><a href="chap0.html">Top</a>  <a href="chap1.html">1</a>  <a href="chap2.html">2</a>  <a href="chap3.html">3</a>  <a href="chap4.html">4</a>  <a href="chap5.html">5</a>  <a href="chapBib.html">Bib</a>  <a href="chapInd.html">Ind</a>  </div>

<div class="chlinkprevnexttop"> <a href="chap0.html">[Top of Book]</a>   <a href="chap0.html#contents">[Contents]</a>    <a href="chap5.html">[Previous Chapter]</a>    <a href="chapInd.html">[Next Chapter]</a>   </div>

<p id="mathjaxlink" class="pcenter"><a href="chapBib_mj.html">[MathJax on]</a></p>
<p><a id="X7A6F98FD85F02BFE" name="X7A6F98FD85F02BFE"></a></p>

<h3>References</h3>


<p><a id="biBGecheBovdi80" name="biBGecheBovdi80"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>ABGG80</span>]   <b class='BibAuthor'>Aizenberg, N., Bovdi, A., Gergo, E. and Geche, F.</b>,
 <i class='BibTitle'>Algebraic aspects of threshold logic</i>,
 <span class='BibJournal'>Cybernetics</span>,
 <em class='BibVolume'>2</em> (<span class='BibNumber'>16</span>)
 (<span class='BibYear'>1980</span>),
 <span class='BibPages'>188-193</span>.
</p>


<p><a id="biBAvedillo1999" name="biBAvedillo1999"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>AQR99</span>]   <b class='BibAuthor'>Avedillo, M., Quintana, J. and Rueda, A.</b>,
 <i class='BibTitle'>Threshold Logic</i>,
  <i class='BibBooktitle'>Wiley Encyclopedia of Electrical and Electronics Engineering</i>,
 <span class='BibPublisher'>American Cancer Society</span>
 (<span class='BibYear'>1999</span>).
</p>


<p><a id="biBDertouzos65" name="biBDertouzos65"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Der65</span>]   <b class='BibAuthor'>Dertouzos, M.</b>,
 <i class='BibTitle'>Threshold Logic: A Synthesis Approach</i>,
 <span class='BibPublisher'>M.I.T. Press</span>
 (<span class='BibYear'>1965</span>).
</p>


<p><a id="biBFranco2006" name="biBFranco2006"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>FSAJ06</span>]   <b class='BibAuthor'>Franco, L., Subirats, J., Anthony, M. and Jerez, J.</b>,
 <i class='BibTitle'>A New Constructive Approach for Creating All Linearly Separable (Threshold) Functions</i>,
  in  <i class='BibBooktitle'>The 2006 IEEE International Joint Conference on Neural Network Proceedings</i>
 (<span class='BibYear'>2006</span>),
 <span class='BibPages'>4791--4796</span>.
</p>


<p><a id="biBGeche2010" name="biBGeche2010"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Gec10</span>]   <b class='BibAuthor'>Geche, F.</b>,
 <i class='BibTitle'>Analysis of Discrete Functions and Logical Schemes Synthesis in Neurobasis (in Ukrainian)</i>,
 <span class='BibPublisher'>Uzhhorod National University</span>
 (<span class='BibYear'>2010</span>).
</p>


<p><a id="biBGecheMulesa2017" name="biBGecheMulesa2017"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>GMB17</span>]   <b class='BibAuthor'>Geche, F., Mulesa, O. and Buchok, V.</b>,
 <i class='BibTitle'>Verification of realizability of boolean functions by a neural element with a threshold activation function</i>,
 <span class='BibJournal'>Eastern European Journal of Enterprise Technologies</span>,
 <em class='BibVolume'>1</em>
 (<span class='BibYear'>2017</span>),
 <span class='BibPages'>30-40</span>.
</p>


<p><a id="biBGecheRobotyshyn83" name="biBGecheRobotyshyn83"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>GPR83</span>]   <b class='BibAuthor'>Geche, F., Polivko, V. and Robotishin, V.</b>,
 <i class='BibTitle'>Realization of boolean functions using threshold elements</i>,
 <span class='BibJournal'>Kibernetika (Kiev)</span> (<span class='BibNumber'>6</span>)
 (<span class='BibYear'>1983</span>),
 <span class='BibPages'>62--67</span>.
</p>


<p><a id="biBGowda11" name="biBGowda11"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>GVKB11</span>]   <b class='BibAuthor'>Gowda, T., Vrudhula, S., Kulkarni, N. and Berezowski, K.</b>,
 <i class='BibTitle'>Identification of Threshold Functions and Synthesis of Threshold Networks</i>,
 <span class='BibJournal'>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</span>,
 <em class='BibVolume'>30</em>
 (<span class='BibYear'>2011</span>),
 <span class='BibPages'>665--677</span>.
</p>


<p><a id="biBHorvath1994" name="biBHorvath1994"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Hor94</span>]   <b class='BibAuthor'>Horvath, E.</b>,
 <i class='BibTitle'>Invariance groups of threshold functions</i>,
 <span class='BibJournal'>Acta Cybernetica</span>,
 <em class='BibVolume'>11</em> (<span class='BibNumber'>4</span>)
 (<span class='BibYear'>1994</span>),
 <span class='BibPages'>325--332</span>.
</p>


<p><a id="biBHorvath16" name="biBHorvath16"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>HST16</span>]   <b class='BibAuthor'>Horvath, E., Seselja, B. and Tepavcevic, A.</b>,
 <i class='BibTitle'>A note on lattice variant of thresholdness of Boolean functions</i>,
 <span class='BibJournal'>Miskolc Mathematical Notes</span>,
 <em class='BibVolume'>17</em>
 (<span class='BibYear'>2016</span>),
 <span class='BibPages'>293--304</span>.
</p>


<p><a id="biBKulkarni16" name="biBKulkarni16"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>KYSV16</span>]   <b class='BibAuthor'>Kulkarni, N., Yang, J., Seo, J. and Vrudhula, S.</b>,
 <i class='BibTitle'>Reducing Power, Leakage, and Area of Standard-Cell ASICs Using Threshold Logic Flip-Flops</i>,
 <span class='BibJournal'>IEEE Transactions on Very Large Scale Integration (VLSI) Systems</span>,
 <em class='BibVolume'>24</em> (<span class='BibNumber'>9</span>)
 (<span class='BibYear'>2016</span>),
 <span class='BibPages'>2873--2886</span>.
</p>


<p><a id="biBLittlestone88" name="biBLittlestone88"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Lit88</span>]   <b class='BibAuthor'>Littlestone, N.</b>,
 <i class='BibTitle'>Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm</i>,
 <span class='BibJournal'>Machine Learning</span>,
 <em class='BibVolume'>2</em> (<span class='BibNumber'>4</span>)
 (<span class='BibYear'>1988</span>),
 <span class='BibPages'>285--318</span>.
</p>


<p><a id="biBMcCulloch43a" name="biBMcCulloch43a"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>MP43</span>]   <b class='BibAuthor'>Mcculloch, W. and Pitts, W.</b>,
 <i class='BibTitle'>A Logical Calculus of Ideas Immanent in Nervous Activity</i>,
 <span class='BibJournal'>Bulletin of Mathematical Biophysics</span>,
 <em class='BibVolume'>5</em>
 (<span class='BibYear'>1943</span>),
 <span class='BibPages'>115--133</span>.
</p>


<p><a id="biBRosenblatt58" name="biBRosenblatt58"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Ros58</span>]   <b class='BibAuthor'>Rosenblatt, F.</b>,
 <i class='BibTitle'>The Perceptron: A Probabilistic Model for Information Storage and Organization in The Brain</i>,
 <span class='BibJournal'>Psychological Review</span>,
 <em class='BibVolume'>65</em> (<span class='BibNumber'>6</span>)
 (<span class='BibYear'>1958</span>),
 <span class='BibPages'>386--408</span>.
</p>


<p><a id="biBSubirats2008" name="biBSubirats2008"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>SJF08</span>]   <b class='BibAuthor'>Subirats, J., Jerez, J. and Franco, L.</b>,
 <i class='BibTitle'>A New Decomposition Algorithm for Threshold Synthesis and Generalization of Boolean Functions</i>,
 <span class='BibJournal'>IEEE Transactions on Circuits and Systems I: Regular Papers</span>,
 <em class='BibVolume'>55</em> (<span class='BibNumber'>10</span>)
 (<span class='BibYear'>2008</span>),
 <span class='BibPages'>3188--3196</span>.
</p>

<p> </p>


<div class="chlinkprevnextbot"> <a href="chap0.html">[Top of Book]</a>   <a href="chap0.html#contents">[Contents]</a>    <a href="chap5.html">[Previous Chapter]</a>    <a href="chapInd.html">[Next Chapter]</a>   </div>


<div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><a href="chap0.html">Top</a>  <a href="chap1.html">1</a>  <a href="chap2.html">2</a>  <a href="chap3.html">3</a>  <a href="chap4.html">4</a>  <a href="chap5.html">5</a>  <a href="chapBib.html">Bib</a>  <a href="chapInd.html">Ind</a>  </div>

<hr />
<p class="foot">generated by <a href="http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
</body>
</html>

100%


¤ Dauer der Verarbeitung: 0.15 Sekunden  (vorverarbeitet)  ¤

*© Formatika GbR, Deutschland




Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung ist noch experimentell.