On the Construction of (d, k) Graphs

The computer organization described here is an extension of a concept of Leondes and Rubinoff [1]. The original machine consisted of a drum store and a single processor capable of sequencing its access from one track (array column) to another at the end of each drum revolution. In this way the syste...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on electronic computers 1965-06, Vol.EC-14 (3), p.488-488
1. Verfasser:	Akers, Sheldon B.
Format:	Artikel
Sprache:	eng
Schlagworte:	Application software Boolean functions Digital systems Laplace equations Linear programming Minimization methods Partial differential equations Power capacitors Upper bound
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	488
container_issue	3
container_start_page	488
container_title	IEEE transactions on electronic computers
container_volume	EC-14
creator	Akers, Sheldon B.
description	The computer organization described here is an extension of a concept of Leondes and Rubinoff [1]. The original machine consisted of a drum store and a single processor capable of sequencing its access from one track (array column) to another at the end of each drum revolution. In this way the system could process one iteration of a Laplace equation in n-drum revolutions, where n is the number of columns of the array.
doi_str_mv	10.1109/PGEC.1965.264176
format	Article
fullrecord	<record><control><sourceid>crossref_RIE</sourceid><recordid>TN_cdi_ieee_primary_4038473</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4038473</ieee_id><sourcerecordid>10_1109_PGEC_1965_264176</sourcerecordid><originalsourceid>FETCH-LOGICAL-c263t-befcd8dc2804f6463967fabff5d86ef322b4861073d1a0c73748a0d7be2228eb3</originalsourceid><addsrcrecordid>eNo9z71LxDAYBvAMCp6nu-CSwUHB1jd50yQdpZxVODgHnUOaD65-tEdSB_97LRWnZ3meB36EXDAoGYP67rndNCWrZVVyKZiSR2QFKFWhKtAn5DTnNwAECXxFrnYDnfaBNuOQp_Tlpn4c6Bjptb-l7ze0Tfawz2fkONqPHM7_ck1eHzYvzWOx3bVPzf22cFziVHQhOq-94xpElEJiLVW0XYyV1zJE5LwTWjJQ6JkFp1AJbcGrLnDOdehwTWD5dWnMOYVoDqn_tOnbMDCzzMwyM8vMIvudXC6TPoTwXxeAWijEH-zNShM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On the Construction of (d, k) Graphs</title><source>IEEE Electronic Library (IEL)</source><creator>Akers, Sheldon B.</creator><creatorcontrib>Akers, Sheldon B.</creatorcontrib><description>The computer organization described here is an extension of a concept of Leondes and Rubinoff [1]. The original machine consisted of a drum store and a single processor capable of sequencing its access from one track (array column) to another at the end of each drum revolution. In this way the system could process one iteration of a Laplace equation in n-drum revolutions, where n is the number of columns of the array.</description><identifier>ISSN: 0367-7508</identifier><identifier>DOI: 10.1109/PGEC.1965.264176</identifier><language>eng</language><publisher>IEEE</publisher><subject>Application software ; Boolean functions ; Digital systems ; Laplace equations ; Linear programming ; Minimization methods ; Partial differential equations ; Power capacitors ; Upper bound</subject><ispartof>IEEE transactions on electronic computers, 1965-06, Vol.EC-14 (3), p.488-488</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c263t-befcd8dc2804f6463967fabff5d86ef322b4861073d1a0c73748a0d7be2228eb3</citedby><cites>FETCH-LOGICAL-c263t-befcd8dc2804f6463967fabff5d86ef322b4861073d1a0c73748a0d7be2228eb3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4038473$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4038473$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Akers, Sheldon B.</creatorcontrib><title>On the Construction of (d, k) Graphs</title><title>IEEE transactions on electronic computers</title><addtitle>T-EC</addtitle><description>The computer organization described here is an extension of a concept of Leondes and Rubinoff [1]. The original machine consisted of a drum store and a single processor capable of sequencing its access from one track (array column) to another at the end of each drum revolution. In this way the system could process one iteration of a Laplace equation in n-drum revolutions, where n is the number of columns of the array.</description><subject>Application software</subject><subject>Boolean functions</subject><subject>Digital systems</subject><subject>Laplace equations</subject><subject>Linear programming</subject><subject>Minimization methods</subject><subject>Partial differential equations</subject><subject>Power capacitors</subject><subject>Upper bound</subject><issn>0367-7508</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1965</creationdate><recordtype>article</recordtype><recordid>eNo9z71LxDAYBvAMCp6nu-CSwUHB1jd50yQdpZxVODgHnUOaD65-tEdSB_97LRWnZ3meB36EXDAoGYP67rndNCWrZVVyKZiSR2QFKFWhKtAn5DTnNwAECXxFrnYDnfaBNuOQp_Tlpn4c6Bjptb-l7ze0Tfawz2fkONqPHM7_ck1eHzYvzWOx3bVPzf22cFziVHQhOq-94xpElEJiLVW0XYyV1zJE5LwTWjJQ6JkFp1AJbcGrLnDOdehwTWD5dWnMOYVoDqn_tOnbMDCzzMwyM8vMIvudXC6TPoTwXxeAWijEH-zNShM</recordid><startdate>196506</startdate><enddate>196506</enddate><creator>Akers, Sheldon B.</creator><general>IEEE</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>196506</creationdate><title>On the Construction of (d, k) Graphs</title><author>Akers, Sheldon B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c263t-befcd8dc2804f6463967fabff5d86ef322b4861073d1a0c73748a0d7be2228eb3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1965</creationdate><topic>Application software</topic><topic>Boolean functions</topic><topic>Digital systems</topic><topic>Laplace equations</topic><topic>Linear programming</topic><topic>Minimization methods</topic><topic>Partial differential equations</topic><topic>Power capacitors</topic><topic>Upper bound</topic><toplevel>online_resources</toplevel><creatorcontrib>Akers, Sheldon B.</creatorcontrib><collection>CrossRef</collection><jtitle>IEEE transactions on electronic computers</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Akers, Sheldon B.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the Construction of (d, k) Graphs</atitle><jtitle>IEEE transactions on electronic computers</jtitle><stitle>T-EC</stitle><date>1965-06</date><risdate>1965</risdate><volume>EC-14</volume><issue>3</issue><spage>488</spage><epage>488</epage><pages>488-488</pages><issn>0367-7508</issn><abstract>The computer organization described here is an extension of a concept of Leondes and Rubinoff [1]. The original machine consisted of a drum store and a single processor capable of sequencing its access from one track (array column) to another at the end of each drum revolution. In this way the system could process one iteration of a Laplace equation in n-drum revolutions, where n is the number of columns of the array.</abstract><pub>IEEE</pub><doi>10.1109/PGEC.1965.264176</doi><tpages>1</tpages></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISSN: 0367-7508
ispartof	IEEE transactions on electronic computers, 1965-06, Vol.EC-14 (3), p.488-488
issn	0367-7508
language	eng
recordid	cdi_ieee_primary_4038473
source	IEEE Electronic Library (IEL)
subjects	Application software Boolean functions Digital systems Laplace equations Linear programming Minimization methods Partial differential equations Power capacitors Upper bound
title	On the Construction of (d, k) Graphs
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T16%3A10%3A38IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20Construction%20of%20(d,%20k)%20Graphs&rft.jtitle=IEEE%20transactions%20on%20electronic%20computers&rft.au=Akers,%20Sheldon%20B.&rft.date=1965-06&rft.volume=EC-14&rft.issue=3&rft.spage=488&rft.epage=488&rft.pages=488-488&rft.issn=0367-7508&rft_id=info:doi/10.1109/PGEC.1965.264176&rft_dat=%3Ccrossref_RIE%3E10_1109_PGEC_1965_264176%3C/crossref_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4038473&rfr_iscdi=true