Dissertations / Theses: 'Network Simplex'

1

CORDEIRO, JOAQUIM PEDRO DE V. "NETWORK SIMPLEX, ALGORITHM E IMPLEMENTATION." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2008. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=13219@1.

Full text

Abstract:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
Este trabalho busca desenvolver o método Simplex para Redes na solução de problemas de Fluxo de Custo Mínimo. Este método consiste em uma adaptação do método Simplex primal em que são exploradas as características específicas da rede subjacente ao problema ao se buscar a solução ótima em um número finito de árvores geradoras. A árvore geradora ótima será obtida iterativamente através de sucessivas melhorias na estrutura de cada árvore formada. A maior eficiência do Simplex para Redes se dá tanto no menor número de iterações necessárias para se atingir o ótimo, quanto na maior velocidade destas iterações, trata-se, portanto, de um método bastante poderoso na resolução de problemas de Fluxo de Custo Mínimo. Serão, também, abordados aspectos práticos da implementação do algoritmo além da aplicação deste algoritmo implementado em VBA (Visual Basic for Applications) em um problema prático a título de exemplificação.
The current work intends to develop a Network Simplex Method for solving Minimum Cost Flow problems. Such method consists of a primal Simplex Method adaptation in which specific characteristics of the network underlying the problem are investigated by searching for the optimal solution within a finite number of spanning trees. The optimal spanning tree is iteratively obtained through successive structure improvements in each formed tree. The higher efficiency of Network Simplex lies both in fewer iterations necessary to achieve the optimum and in the higher speed of these iterations. Therefore, it is a powerful method for solving Minimum Cost Flow Problems. Practical aspects of implementing the algorithm will be discussed, as well as the algorithm´s implementation in VBA (Visual Basic for Applications) through a practical instance.

APA, Harvard, Vancouver, ISO, and other styles

2

Aggarwal, Charu C., Haim Kaplan, and Robert E. 1948 Tarjan. "A Faster Primal Network Simplex Algorithm." Massachusetts Institute of Technology, Operations Research Center, 1996. http://hdl.handle.net/1721.1/5266.

Full text

Abstract:

We present a faster implementation of the polynomial time primal simplex algorithm due to Orlin [23]. His algorithm requires O(nm min{log(nC), m log n}) pivots and O(n2 m ??n{log nC, m log n}) time. The bottleneck operations in his algorithm are performing the relabeling operations on nodes, selecting entering arcs for pivots, and performing the pivots. We show how to speed up these operations so as to yield an algorithm whose running time is O(nm. log n) per scaling phase. We show how to extend the dynamic-tree data-structure in order to implement these algorithms. The extension may possibly have other applications as well.

APA, Harvard, Vancouver, ISO, and other styles

3

Solveson, Keith D. "Design and implementation of a Primal Simplex Network Optimizer in C." Thesis, Monterey, California : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA241350.

Full text

Abstract:

Thesis (M.S. in Operations Research)--Naval Postgraduate School, September 1990.
Thesis Advisor(s): Bradley, Gordon H. Second Reader: Stemp, Roger. "September 1990." Description based on title screen as viewed on December 21, 2009. DTIC Descriptor(s): Computer Networks, Simplex Method, Computer Program Documentation, Optimization, Programming Languages, Theses, Time, FORTRAN, Tuning, Symbols, Parameters, Networks, Algorithms, Test And Evaluation, Data Bases. DTIC Identifier(s): Software Engineering. Author(s) subject terms: Network, C, Primal, Transportation, Transshipment, Simplex. Includes bibliographical references (p. 48-50). Also available in print.

APA, Harvard, Vancouver, ISO, and other styles

4

Collet, François. "Short scale study of 4-simplex assembly with curvature, in euclidean Loop Quantum Gravity." Thesis, Aix-Marseille, 2016. http://www.theses.fr/2016AIXM4076/document.

Full text

Abstract:

Une étude d'un assemblage symétrique de trois 4-simplex en géométrie classique, de Regge et quantique. Nous étudions les propriétés géométriques et surtout la présence de courbure. Nous montrons que les géométries classique et de Regge de l'assemblage ont une courbure qui évolue en fonction de ses paramètres de bordure. Pour la géométrie quantique, une version euclidienne du modèle EPRL est utilisé avec une valeur pratique du paramètre Barbero-Immirzi pour définir l'amplitude de transition de l'ensemble et de ses composants. Un code C ++ est conçu pour calculer les amplitudes et étudier numériquement la géométrie quantique. Nous montrons qu'une géométrie classique, avec une courbure, émerge déjà à bas spin. Nous reconnaissons également l'apparition de configurations dégénérées et de leurs effets sur la géométrie attendue
A study of symmetrical assembly of three euclidean 4-simplices in classical, Regge and quantum geometry. We study the geometric properties and especially the presence of curvature. We show that classical and Regge geometry of the assembly have curvature which evolves in function of its boundary parameters. For the quantum geometry, a euclidean version of EPRL model is used with a convenient value of the Barbero-Immirzi parameter to define the transition amplitude of the assembly and its components. A C++ code is design for compute the amplitudes and study numerically the quantum geometry. We show that a classical geometry, with curvature, emerges already at low spin. We also recognize the appearance of the degenerate configurations and their effects on the expected geometry

APA, Harvard, Vancouver, ISO, and other styles

5

Vanderlinde, Jeferson Back [UNESP]. "Planejamento da expansão de sistemas de transmissão usando técnicas especializadas de programação inteira mista." Universidade Estadual Paulista (UNESP), 2017. http://hdl.handle.net/11449/152089.

Full text

Abstract:

Submitted by JEFERSON BACK VANDERLINDE null (jefersonbv@yahoo.com.br) on 2017-11-01T16:38:25Z No. of bitstreams: 1 jeferson_tese_final_20171101.pdf: 4860852 bytes, checksum: 2f99c37969be3815f82b1b4455a40230 (MD5)
Approved for entry into archive by LUIZA DE MENEZES ROMANETTO (luizamenezes@reitoria.unesp.br) on 2017-11-13T15:38:34Z (GMT) No. of bitstreams: 1 vanderlinde_jb_dr_ilha.pdf: 4860852 bytes, checksum: 2f99c37969be3815f82b1b4455a40230 (MD5)
Made available in DSpace on 2017-11-13T15:38:34Z (GMT). No. of bitstreams: 1 vanderlinde_jb_dr_ilha.pdf: 4860852 bytes, checksum: 2f99c37969be3815f82b1b4455a40230 (MD5) Previous issue date: 2017-09-06
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Neste trabalho, consideram-se a análise teórica e a implementação computacional dos algoritmos Primal Simplex Canalizado (PSC) e Dual Simplex Canalizado (DSC) especializados. Esses algoritmos foram incorporados em um algoritmo Branch and Bound (B&B) de modo a resolver o problema de Planejamento da Expansão de Sistemas de Transmissão (PEST). Neste caso, o problema PEST foi modelado usando os chamados modelo de Transportes e modelo Linear Disjuntivo (LD), o que produz um problema de Programação Linear Inteiro Misto (PLIM). O algoritmo PSC é utilizado na resolução do problema de Programação Linear (PL) inicial após desconsiderar a restrição de integralidade do problema PLIM original. Juntamente com o algoritmo PSC, foi implementada uma estratégia para reduzir o número de variáveis artificiais adicionadas ao PL, consequentemente reduzindo o número de iterações do algoritmo PSC. O algoritmo DSC é utilizado na reotimização eficiente dos subproblemas gerados pelo algoritmo B&B, através do quadro ótimo do PL inicial, excluindo, assim, a necessidade da resolução completa de cada subproblema e, consequentemente, reduzindo o consumo de processamento e memória. Nesta pesquisa, é apresentada uma nova proposta de otimização, e, consequentemente, a implementação computacional usando a linguagem de programação FORTRAN que opera independentemente de qualquer solver.
In this research, the theoretical analysis and computational implementation of the specialized dual simplex algorithm (DSA) and primal simplex algorithm (PSA) for bounded variables is considered. These algorithms have been incorporated in a Branch and Bound (B&B) algorithm to solve the Transmission Network Expansion Planning (TNEP) problem. In this case, the TNEP problem is modeled using transportation model and linear disjunctive model (DM), which produces a mixed-integer linear programming (MILP) problem. After relaxing the integrality of investment variables of the original MILP problem, the PSA is used to solve the initial linear programming (LP) problem. Also, it has been implemented a strategy in PSA to reduce the number of artificial variables which are added into the LP problem, and consequently reduces the number of iterations of PSA. Through optimal solution of the initial LP, the DSA is used in efficient reoptimization of subproblems, resulting from the B&B algorithm, thus excludes the need for complete resolution of each subproblems, which results reducing the CPU time and memory consumption. This research presents the implementation of the proposed approach using the FORTRAN programming language which operates independently and does not use any commercial solver.

APA, Harvard, Vancouver, ISO, and other styles

6

Vanderlinde, Jeferson Back. "Planejamento da expansão de sistemas de transmissão usando técnicas especializadas de programação inteira mista /." Ilha Solteira, 2017. http://hdl.handle.net/11449/152089.

Full text

Abstract:

Orientador: Rubén Augusto Romero Lázaro
Resumo: Neste trabalho, consideram-se a análise teórica e a implementação computacional dos algoritmos Primal Simplex Canalizado (PSC) e Dual Simplex Canalizado (DSC) especializados. Esses algoritmos foram incorporados em um algoritmo Branch and Bound (B&B) de modo a resolver o problema de Planejamento da Expansão de Sistemas de Transmissão (PEST). Neste caso, o problema PEST foi modelado usando os chamados modelo de Transportes e modelo Linear Disjuntivo (LD), o que produz um problema de Programação Linear Inteiro Misto (PLIM). O algoritmo PSC é utilizado na resolução do problema de Programação Linear (PL) inicial após desconsiderar a restrição de integralidade do problema PLIM original. Juntamente com o algoritmo PSC, foi implementada uma estratégia para reduzir o número de variáveis artificiais adicionadas ao PL, consequentemente reduzindo o número de iterações do algoritmo PSC. O algoritmo DSC é utilizado na reotimização eficiente dos subproblemas gerados pelo algoritmo B&B, através do quadro ótimo do PL inicial, excluindo, assim, a necessidade da resolução completa de cada subproblema e, consequentemente, reduzindo o consumo de processamento e memória. Nesta pesquisa, é apresentada uma nova proposta de otimização, e, consequentemente, a implementação computacional usando a linguagem de programação FORTRAN que opera independentemente de qualquer solver.
Doutor

APA, Harvard, Vancouver, ISO, and other styles

7

Sundaresan, Latha. "Simple network management protocol /." Online version of thesis, 1995. http://hdl.handle.net/1850/12254.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Chonbodeechalermroong, Yongyut School of Electrical Engineering UNSW. "Simple star multihop optical network." Awarded by:University of New South Wales. School of Electrical Engineering, 2001. http://handle.unsw.edu.au/1959.4/20328.

Full text

Abstract:

A new multihop wavelength-division multiplexed (WDM) optical network designed for uniform traffic with two wavelengths per node that can give the maximum throughput and minimum delay is proposed. It is called a 'Simple Star' multihop optical network. This network has good characteristics in traffic balance and small average number of hops. Moreover, Simple Star can be used together with multiple star couplers to reduce the number of wavelength used. Furthermore, unlike most existing networks, this network does not impose an upper limit to the number of nodes. Another interesting pattern is Simple Star with Center Node (Simple Star CN) particularly for prime numbers of nodes. It can be shown that the average number of hops of Simple Star (normal plus CN) is in between those of Shufflenet and Kautz, but the throughput and delay are better. An associated network called Simple Star Shared Channel (Simple Star SC) for two transceivers per node is also presented and it can be used together with multiple star couplers to reduce the number of wavelengths. An example of a 16-node Simple Star SC shows that the number of wavelengths used can be 8 times less than that in the normal Simple Star network. The Shared Channel simulation model is based on the concept of CSMA/CD (Carrier Sense Multiple Access with Collision Detection).

APA, Harvard, Vancouver, ISO, and other styles

9

Folke, Fredrik. "Security for home, small & medium sized enterprises IPv6 networks : Security using simple network equipment." Thesis, KTH, Kommunikationssystem, CoS, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-98295.

Full text

Abstract:

This theses project investigates and presents different threats that a network can be exposed to and the common protection techniques that can be applied, with a focus on the network perimeter – specifically the router/firewall between the local area network and the Internet. All Internet connected devices and networks are exposed to and affected by security threats to some degree, hence security is important in almost every type of network. With the constant growth of the Internet the 32-bit addressing scheme ipv4 is proving to be inadequate, and therefore the transition to the 128-bit addressing scheme ipv6 is becoming critical. With ipv6 comes new security threats (while still old threats remain) that requires an understanding of perimeter security. In this thesis we secure a home router and describe these steps to enable home and small business owners to secure their IPv6 network at a relatively low cost.
Detta projekt kommer att undersöka och presentera olika hot som ett IPv6 nätverk kan utsättas för samt de vanligaste skydds mekanismer som används idag, med fokus på nätverkets skallskydd mellan det interna lokala nätet och det yttre publika Internet. I stort sätt all Internet ansluten utrustning och nätverk är exponerad och påverkad i någon grad av säkerhets brister, säkerhet är en viktig del i stort sätt alla nätverk oavsett syfte eller verksamhet. Genom ett ständigt växande Internet börjar de 32-bitar adresser tillhörande IPv4 nätet ta slut, vilket gör behovet av att immigrera till 128-bitar adresser på IPv6 nätet allt mer kritiskt. Med IPv6 kommer nya säkerhetshot, samt att även vissa äldre hot kvarstår, som kräver en förståelse av perimeter skydd. I denna rapport säkrar vi en hemma router och beskriver för varje steg tillvägagångssättet för att hem och små företagare ska få möjlighet att skydda sina IPv6 nätverk till en relativt låg kostnad.

APA, Harvard, Vancouver, ISO, and other styles

10

Holmgren, Johan. "Efficient Updating Shortest Path Calculations for Traffic Assignment." Thesis, Linköping University, Department of Mathematics, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2573.

Full text

Abstract:

Traffic planning in a modern congested society is an important and time consuming procedure. Finding fast algorithms for solving traffic problems is therefore of great interest for traffic planners allover the world.

This thesis concerns solving the fixed demand traffic assignment problem (TAP) on a number of different transportation test networks. TAP is solved using the Frank-Wolfe algorithm and the shortest path problems that arise as subproblems to the Frank-Wolfe algorithm are solved using the network simplex algorithm. We evaluate how a number of existing pricing strategies to the network simplex algorithm performs with TAP. We also construct a new efficient pricing strategy, the Bucket Pricing Strategy, inspired by the heap implementation of Dijkstra's method for shortest path problems. This pricing strategy is, together with the actual use of the network simplex algorithm, the main result of the thesis and the pricing strategy is designed to take advantage of the special structure of TAP. In addition to performing tests on the conventional Frank-Wolfe algorithm, we also test how the different pricing strategies perform on Frank-Wolfe algorithms using conjugate and bi-conjugate search directions.

These test results show that the updating shortest path calculations obtained by using the network simplex outperforms the non-updating Frank-Wolfe algorithms. Comparisons with Bar-Gera's OBA show that our implementation, especially together with the bucket pricing strategy, also outperforms this algorithm for relative gaps down to 10E-6.

APA, Harvard, Vancouver, ISO, and other styles

11

Kimmel, Jason. "Simple Games on Networks." Oberlin College Honors Theses / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1307994412.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Dukach, Semyon. "SNPP--a Simple Network Payment Protocol." Thesis, Massachusetts Institute of Technology, 1992. http://hdl.handle.net/1721.1/12629.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Steenkamp, Leon. "Wireless sensor network monitoring using the Simple Network Management Protocol." Thesis, Cape Peninsula University of Technology, 2012. http://hdl.handle.net/20.500.11838/1139.

Full text

Abstract:

Thesis (MTech(Electrical Engineering)--Cape Peninsula University of Technology, 2012
Wireless sensor networks (WSNs) have long been separate networks using non-standard, custom and application speci c protocols. The arrival of IPv6 over Low power Wireless Personal Area Network (6LoWPAN) changes this, with the Internet Protocol (IP) being the common protocol between conventional IP networks and Wireless Sensor Networks. Through the use of 6LoWPAN implementations like blip, developed for the WSN operating system TinyOS, it is possible to make use of the advantages that the common IP layer brings. This includes the reuse of techniques, protocols and software that are already developed for, and in use on, conventional IP networks.One such protocol is the Simple Network Management Protocol (SNMP), which is a User Datagram Protocol (UDP) based protocol used for monitoring and management in conventional IP networks. This work describes an implementation of the rst version of the SNMP in nesC for TinyOS using the blip 6LoWPAN implementation. The SNMPv1 software agent imple- mentation requires no modi cation to the 6LoWPAN stack and responds to standard SNMP get and set requests. This means that standard SNMP software can be used to communicate with the implemented SNMP software agent. Therefore network monitoring packages like Nagios and Cacti can be used to monitor wireless sensor networks.Relevant background information is discussed, ranging from the division of commu- nication between network nodes into logical layers, to similar work done and the Simple Network Management Protocol. The implementation of the SNMP software agent is ex- amined, along with the anatomy of an SNMP GetRequest message in aid of understanding the structure of SNMP messages.The SNMP agent implementation is then tested against network monitoring tools like Cacti, Nagios and applications from the Net-SNMP package. The results verify the correct operation of the SNMP software agent and demonstrate the added functionality that the software agent provides.

APA, Harvard, Vancouver, ISO, and other styles

14

Naidoo, Vaughn. "Policy Based Network management of legacy network elements in next generation networks for Voice Services." Thesis, University of the Western Cape, 2002. http://etd.uwc.ac.za/index.php?module=etd&action=viewtitle&id=gen8Srv25Nme4_5830_1370595582.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Rodriguez, Paul Fabian. "Mathematical foundations of simple recurrent networks /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 1999. http://wwwlib.umi.com/cr/ucsd/fullcit?p9935464.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Sagar, Youvaraj T. "Capacity of a modulo-sum simple relay network." Thesis, Wichita State University, 2009. http://hdl.handle.net/10057/2521.

Full text

Abstract:

This thesis proposes the capacity of a modulo-sum simple relay network. In previous work related to relay channels, capacity was characterized in the case where noise was transmitted to the relay, and the closed-form capacity was derived only for the noise with a Bernoulli-( distribution. However, in this work, the source is transmitted to the relay, and a more general case of noise with an arbitrary Bernoulli-( distribution, , is considered. The relay observes a corrupted version of the source, uses a quantize-and-forward strategy, and transmits the encoded codeword through a separate dedicated channel to the destination. The destination receives the codeword from both the relay and source. For the relay channel, it is assumed that the channel is discrete and memoryless. After deriving the achievable capacity theorem (i.e., the forward theorem) for the binary symmetric simple relay network, it is proven that the capacity is strictly below the cut-set bound. In addition, this thesis presents the proof of the converse theorem. Finally, the capacity of the binary symmetric simple relay network is extended to that of an m-ary modulo-sum relay network.
Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical and Computer Engineering

APA, Harvard, Vancouver, ISO, and other styles

17

Yu, Suhyoun. "Simple certificate for power distribution network security assessment." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113748.

Full text

Abstract:

Thesis: S.M., Massachusetts Institute of Technology, Department of Mechanical Engineering, 2017.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 53-54).
The integration of volatile renewable energy sources, non-traditional load managements, and unforeseen natural disasters introduce uncertainties that could easily jeopardize the security of power systems. Meanwhile, constructing the real solvable boundary-crucial for contingency analysis, security assessment, and planning network processes-in multidimensional parameter space is burdensome and time consuming; hence there is an urgent need for a tool to identify the security region, or the set of viable injections. This thesis presents fast and reliable inner approximation techniques for solvable boundaries of power distribution systems based on Banach fixed point theorem and Kantorovich theorem. The novel method is in a simple "certificate" form-a single lined inequality condition that involves the system variables and parameters. Our certificate is noniterative, therefore computationally efficient, and the simulation results confirm that the presented approach constructs regions that are sufficiently large for most security-constrained functions. The construction for our "certificates" begins with re-formulating power-flow equations into appropriate forms such that they are applicable to the aforementioned two major theorems. Practical applications of the proposed technique include fast screening tool for feasible injection change, certified solvability margins, and new computationally robust continuation power flow algorithms.
by Suhyoun Yu.
S.M.

APA, Harvard, Vancouver, ISO, and other styles

18

Gateau, James B. "Extending Simple Network Management Protocol (SNMP) beyond network management a MIB architecture for network-centric services." Thesis, Monterey, Calif. : Naval Postgraduate School, 2007. http://bosun.nps.edu/uhtbin/hyperion.exe/07Mar%5FGateau.pdf.

Full text

Abstract:

Thesis (M.S. in Information Systems and Operations)--Naval Postgraduate School, March 2007.
Thesis Advisor(s): Alex Bordetsky. "March 2007." Includes bibliographical references (p. 161-163). Also available in print.

APA, Harvard, Vancouver, ISO, and other styles

19

Parfitt, Shan Helen. "Explorations in anaphora resolution in artificial neural networks : implications for nativism." Thesis, Imperial College London, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.267247.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Kang, Min Wook. "An alignment optimization model for a simple highway network." College Park, Md. : University of Maryland, 2008. http://hdl.handle.net/1903/8060.

Full text

Abstract:

Thesis (Ph. D.) -- University of Maryland, College Park, 2008.
Thesis research directed by: Dept. of Civil and Environmental Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

APA, Harvard, Vancouver, ISO, and other styles

21

Van, Rooyen M. W. (Melchior Werner). "Simple broadband measurements of balanced loads using a network analyzer." Thesis, Stellenbosch : Stellenbosch University, 2001. http://hdl.handle.net/10019.1/52451.

Full text

Abstract:

Thesis (MEng)--University of Stellenbosch, 2001.
ENGLISH ABSTRACT: Balanced loads such as antennas normally require baluns when they are measured. For wide band applications, designing and building a balun complicates the measurement and introduces errors. A simple model for load impedances was developed, together with a novel measurement procedure. The procedure enables the measurement of balanced loads using a network analyzer with no balun. Measured and simulated results are presented.
AFRIKAANSE OPSOMMING: Gebalanseerde laste soos antennas benodig gewoonlik balons om korrek gemeet te word. Die ontwerp van 'n balon vir wye band toepassings bemoeilik die metings en veroorsaak foute. 'n Eenvoudige model vir die lasimpedansies is ontwikkel sowel as 'n eenvoudige meetmetode. Die metode word gebruik om die gebalanseerde laste te meet met 'n netwerk analiseerder sonder die gebruik van 'n balon. Gemete en gesimuleerde resultate word getoon.

APA, Harvard, Vancouver, ISO, and other styles

22

Salem, Jaber. "A SIMPLE FPGA - BASED ARCHITECTURE DESIGN OF RECONFIGURABLE NEURAL NETWORK." OpenSIUC, 2013. https://opensiuc.lib.siu.edu/theses/1154.

Full text

Abstract:

In contrast with analog design, digital design and implementation of any logic circuit suffer much from the difficulty in terms of economy and implementation. Neural networks are artificial systems inspired by the brain's cognitive behavior, which can learn tasks with some degree of complexity, such as, optimization problems, text and speech recognition. Since the topology of neural networks is highly crucial to the performance, the reconfigurable ability of the neural network hardware is very essential. Reconfigurability factually means several different designs can be implemented on a single architecture. Therefore, this work proposes an efficient architecture to implement the reconfigurable back propagation and Hopfield neural networks. We specifically adopted the reconfigurable artificial neural networks approach to show how it is possible to build an efficient chip. Simple neural network models with an appropriate training were used to behave as traditional logic functions in the bit- level. In order to further reduce the hardware, memories-sharing method has been adopted. Also, a comparison between the proposed and traditional networks shows that the proposed network has significantly reduced the time delay and power consumption. Xilinx - ISE is used to synthesize our design. VHDL code is used to build the architecture. The architecture code is then downloaded to FPGAs (Field Programmable Gate Array) to implement the design. FPGAs are strong tools to implement ANNs as one can exploit concurrency and rapidly reconfigure to adapt the weights and topologies of an ANN. Also, XPower, as one of the best tools in Xilinx, was used to measure the total required power by our architecture. Finally, the results showed that the proposed reconfigurable architecture leads to a considerable decrease in the consumed power to almost 43% as well as the total time delay. Also, the architecture can easily be scalable as a future work and is able to cope with several network sizes with the same hardware.

APA, Harvard, Vancouver, ISO, and other styles

23

Xia, Lei. "Discovering free-riders before trading : a simple approach /." View abstract or full-text, 2010. http://library.ust.hk/cgi/db/thesis.pl?CSED%202010%20XIA.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Southworth, David. "A simple artificial neural network development system for study and research." Master's thesis, This resource online, 1991. http://scholar.lib.vt.edu/theses/available/etd-02162010-020120/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Ghaderi, Reza. "Arranging simple neural networks to solve complex classification problems." Thesis, University of Surrey, 2000. http://epubs.surrey.ac.uk/844428/.

Full text

Abstract:

In "decomposition/reconstruction" strategy, we can solve a complex problem by 1) decomposing the problem into simpler sub-problems, 2) solving sub-problems with simpler systems (sub-systems) and 3) combining the results of sub-systems to solve the original problem. In a classification task we may have "label complexity" which is due to high number of possible classes, "function complexity" which means the existence of complex input-output relationship, and "input complexity" which is due to requirement of a huge feature set to represent patterns. Error Correcting Output Code (ECOC) is a technique to reduce the label complexity in which a multi-class problem will be decomposed into a set of binary sub-problems, based oil the sequence of "0"s and "1"s of the columns of a decomposition (code) matrix. Then a given pattern can be assigned to the class having minimum distance to the results of sub-problems. The lack of knowledge about the relationship between distance measurement and class score (like posterior probabilities) has caused some essential shortcomings to answering questions about "source of effectiveness", "error analysis", " code selecting ", and " alternative reconstruction methods" in previous works. Proposing a theoretical framework in this thesis to specify this relationship, our main contributions in this subject are to: 1) explain the theoretical reasons for code selection conditions 2) suggest new conditions for code generation (equidistance code)which minimise reconstruction error and address a search technique for code selection 3) provide an analysis to show the effect of different kinds of error on final performance 4) suggest a novel combining method to reduce the effect of code word selection in non-optimum codes 5) suggest novel reconstruction frameworks to combine the component outputs. Some experiments on artificial and real benchmarks demonstrate significant improvement achieved in multi-class problems when simple feed forward neural networks are arranged based on suggested framework To solve the problem of function complexity we considered AdaBoost, as a technique which can be fused with ECOC to overcome its shortcoming for binary problems. And to handle the problems of huge feature sets, we have suggested a multi-net structure with local back propagation. To demonstrate these improvements on realistic problems a face recognition application is considered. Key words: decomposition/ reconstruction, reconstruction error, error correcting output codes, bias-variance decomposition.

APA, Harvard, Vancouver, ISO, and other styles

26

Kerdsri, Jiradett. "SNMP over Wi-Fi wireless networks." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2003. http://library.nps.navy.mil/uhtbin/hyperion-image/03Mar%5FKerdsri.pdf.

Full text

Abstract:

Thesis (M.S. in Computer Science)--Naval Postgraduate School, March 2003.
Thesis advisor(s): Ted Lewis, Geoffrey Xie, Gurminder Singh. Includes bibliographical references (p. 89). Also available online.

APA, Harvard, Vancouver, ISO, and other styles

27

Shelley, Rian. "A Novel Technique of Network Auditability with Managers In The Loop." DigitalCommons@USU, 2008. https://digitalcommons.usu.edu/etd/115.

Full text

Abstract:

Network management requires a large amount of knowledge about the network. In particular, knowledge about used network addresses, access time, and topology is useful. In a network composed of managed devices, much of the data necessary can come from simple network management protocol (SNMP) queries. Other data can come from other databases, or analysis of existing data. In particular, layer-two network topology can be determined by analyzing the mac address forwarding tables of layer-two devices. The layer-two topology can be merged with a layer-three topology to generate a complete topology of the network. This information is useless unless it is easily accessible to the network manager; therefore, a simple interface should be used to give access to all of this data.

APA, Harvard, Vancouver, ISO, and other styles

28

Pettersson, Erik. "A Comparison of Pull- and Push- based Network Monitoring Solutions : Examining Bandwidth and System Resource Usage." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-299853.

Full text

Abstract:

Monitoring of computer networks is central to ensuring that they function as intended, with solutions based on SNMP being used since the inception of the protocol. SNMP is however increasingly being challenged by solutions that, instead of requiring a request-response message flow, simply send information to a central collector at predefined intervals. These solutions are often based on Protobuf and gRPC, which are supported and promoted by equipment manufacturers such as Cisco, Huawei, and Juniper. Two models exist for monitoring. The pull model used by SNMP where requests are sent out in order to retrieve data, has historically been widely used. The push model, where data is sent at predefined intervals without a preceding request, is used by the implementations using Protobuf and gRPC. There is a perceived need to understand which model more efficiently uses bandwidth and the monitored system’s memory and processing resources. The purpose of the thesis is to compare two monitoring solutions, one being SNMP, and one based on Protobuf and gRPC. This is done to determine if one solution makes more efficient use of bandwidth and the system resources available to the network equipment. This could aid those who operate networks or develop monitoring software in determining how to implement their solutions. The study is conducted as a case study, where two routers manufactured by Cisco and Huawei were used to gather data about the bandwidth, memory, and CPU utilisation of the two solutions. The results of the measurements show that when retrieving information about objects that have 1-byte values SNMP was the better performer. When objects with larger values were retrieved SNMP performed best until 26 objects were retrieved per message. Above this point the combination of Protobuf and gRPC performed better, resulting in fewer bytes being sent for a given number of objects. No impact on the memory and CPU utilisation in the routers was shown.
Övervakning av nätverk är av yttersta vikt för att säkerställa att de fungerar som tänkt. Lösningar baserade på SNMP har använts sen protokollet kom till. SNMP utmanas mer och mer av lösningar som, istället för att använda ett meddelandeflöde baserat på fråga-svar, helt enkelt sänder information till en insamlande enhet i fördefinierade intervall. Dessa lösningar baseras ofta på Protobuf och gRPC, vilka stöds och propageras för av bland andra utrustningstillverkarna Cisco, Huawei, och Juniper. Två modeller för övervakning finns. Pull-modellen där frågor skickas ut för att hämta data, används av SNMP och har historiskt sett använts i stor skala. Push- modellen, där data skickas i fördefinierade intervall utan föregående fråga, används av lösningar som använder Protobuf och gRPC. Det finns ett behov av att förstå vilken modell som på ett mer effektivt sätt använder bandbredd och de övervakade systemens minnes- och processorresurser. Syftet med denna rapport är att jämföra två övervakningslösningar. SNMP är den ena lösningen, och den andra lösningen är baserad på Protobuf och gRPC. Detta i syfte att utröna om endera lösning på ett mer effektivt sätt använder bandbredd och systemresurser i nätverksutrustning. Detta kan hjälpa nätverksoperatörer och utvecklare av mjukvara för övervakning att avgöra hur dessa bör implementeras. För att besvara detta används en fallstudie, där två routrar tillverkade av Cisco och Huawei används för att samla in data om de två lösningarnas användning av bandbredd, minne, och processorkraft. Mätningarnas resultat visade att när objekt vars värde var 1 byte hämtades så presterade SNMP bättre. När objekt vars värden var större hämtades presterade SNMP bäst tills 26 objekt hämtades per meddelande. Därefter presterade kombinationen Protobuf och gRPC bättre, och krävde färre bytes för att skicka information om ett givet antal objekt. Ingen påverkan på minnes- eller processoranvändningen i routrarna påvisades av mätresultaten.

APA, Harvard, Vancouver, ISO, and other styles

29

Enani, Mohammad A. "MURR nodal analysis with simple interactive simulation /." free to MU campus, to others for purchase, 1997. http://wwwlib.umi.com/cr/mo/fullcit?p9841283.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Nilsson, Mikael. "Efficient Temporal Reasoning with Uncertainty." Licentiate thesis, Linköpings universitet, Artificiell intelligens och integrerade datorsystem, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-119409.

Full text

Abstract:

Automated Planning is an active area within Artificial Intelligence. With the help of computers we can quickly find good plans in complicated problem domains, such as planning for search and rescue after a natural disaster. When planning in realistic domains the exact duration of an action generally cannot be predicted in advance. Temporal planning therefore tends to use upper bounds on durations, with the explicit or implicit assumption that if an action happens to be executed more quickly, the plan will still succeed. However, this assumption is often false. If we finish cooking too early, the dinner will be cold before everyone is at home and can eat. Simple Temporal Networks with Uncertainty (STNUs) allow us to model such situations. An STNU-based planner must verify that the temporal problems it generates are executable, which is captured by the property of dynamic controllability (DC). If a plan is not dynamically controllable, adding actions cannot restore controllability. Therefore a planner should verify after each action addition whether the plan remains DC, and if not, backtrack. Verifying dynamic controllability of a full STNU is computationally intensive. Therefore, incremental DC verification algorithms are needed. We start by discussing two existing algorithms relevant to the thesis. These are the very first DC verification algorithm called MMV (by Morris, Muscettola and Vidal) and the incremental DC verification algorithm called FastIDC, which is based on MMV. We then show that FastIDC is not sound, sometimes labeling networks as dynamically controllable when they are not. We analyze the algorithm to pinpoint the cause and show how the algorithm can be modified to correctly and efficiently detect uncontrollable networks. In the next part we use insights from this work to re-analyze the MMV algorithm. This algorithm is pseudo-polynomial and was later subsumed by first an n5 algorithm and then an n4 algorithm. We show that the basic techniques used by MMV can in fact be used to create an n4 algorithm for verifying dynamic controllability, with a new termination criterion based on a deeper analysis of MMV. This means that there is now a comparatively easy way of implementing a highly efficient dynamic controllability verification algorithm. From a theoretical viewpoint, understanding MMV is important since it acts as a building block for all subsequent algorithms that verify dynamic controllability. In our analysis we also discuss a change in MMV which reduces the amount of regression needed in the network substantially. In the final part of the thesis we show that the FastIDC method can result in traversing part of a temporal network multiple times, with constraints slowly tightening towards their final values. As a result of our analysis we then present a new algorithm with an improved traversal strategy that avoids this behavior. The new algorithm, EfficientIDC, has a time complexity which is lower than that of FastIDC. We prove that it is sound and complete.

APA, Harvard, Vancouver, ISO, and other styles

31

Schuller, Walter H. Jr. "Hardware Interfacing in the Broadcast Industry Using Simple Network Management Protocol (SNMP)." UNF Digital Commons, 1997. http://digitalcommons.unf.edu/etd/339.

Full text

Abstract:

Communication between various broadcast equipment plays a major role in the daily operation of a typical broadcast facility. For example, editing equipment must interface with tape machines, production switchers must interface with font generators and video effect equipment, and satellite ground controllers must interface with satellite dishes and receivers. Communication between these devices may be a simple hardware handshake configuration or a more elaborate software based communications via serial or parallel interfacing. This thesis concerns itself with the software interfacing needed to allow various dissimilar types of equipment to communicate, and therefore, interface with each other. The use of Simple Network Management Protocol (SNMP) in a non-typical manner for the purpose of hardware interfacing is the basis for this work.

APA, Harvard, Vancouver, ISO, and other styles

32

Khan, Hamzah I. "Evaluating Flexibility Metrics on Simple Temporal Networks with Reinforcement Learning." Scholarship @ Claremont, 2018. https://scholarship.claremont.edu/hmc_theses/116.

Full text

Abstract:

Simple Temporal Networks (STNs) were introduced by Tsamardinos (2002) as a means of describing graphically the temporal constraints for scheduling problems. Since then, many variations on the concept have been used to develop and analyze algorithms for multi-agent robotic scheduling problems. Many of these algorithms for STNs utilize a flexibility metric, which measures the slack remaining in an STN under execution. Various metrics have been proposed by Hunsberger (2002); Wilson et al. (2014); Lloyd et al. (2018). This thesis explores how adequately these metrics convey the desired information by using them to build a reward function in a reinforcement learning problem.

APA, Harvard, Vancouver, ISO, and other styles

33

Flärdh, Oscar. "Modelling, analysis and experimentation of a simple feedback scheme for error correction control." Licentiate thesis, KTH, School of Electrical Engineering (EES), 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4300.

Full text

Abstract:

Data networks are an important part in an increasing number of applications with real-time and reliability requirements. To meet these demands a variety of approaches have been proposed. Forward error correction, which adds redundancy to the communicated data, is one of them. However, the redundancy occupies communication bandwidth, so it is desirable to control the amount of redundancy in order to achieve high reliability without adding excessive communication delay. The main contribution of the thesis is to formulate the problem of adjusting the redundancy in a control framework, which enables the dynamic properties of error correction control to be analyzed using control theory. The trade-off between application quality and resource usage is captured by introducing an optimal control problem. Its dependence on the knowledge of the network state at the transmission side is discussed. An error correction controller that optimizes the amount of redundancy without relying on network state information is presented. This is achieved by utilizing an extremum seeking control algorithm to optimize the cost function. Models with varying complexity of the resulting feedback system are presented and analyzed. Conditions for convergence are given. Multiple-input describing function analysis is used to examine periodic solutions. The results are illustrated through computer simulations and experiments on a wireless sensor network.

APA, Harvard, Vancouver, ISO, and other styles

34

Pospíšil, Petr. "Optimalizace predikce pozice v síti." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2008. http://www.nusl.cz/ntk/nusl-217436.

Full text

Abstract:

This work is about position prediction in network, it is focused to find Landmark closest to the Host in the network (with lowest distance vector). The algorithm is based on GNP system. In terms of GNP system simulation was selected method for mathematical part of position prediction. The method was Simplex Downhill. The designed algorithm was implemented in Java. In the first step chose Host continent by meassuring the distance vector. In next step is selected nearest part in the continent. In conclusion estimate Host its position and then closest Landmark. Results from this work is important for designing TTP protocol. The verdict is that the GNP can be used for TTP, but Landmarks must be located in uniform density.

APA, Harvard, Vancouver, ISO, and other styles

35

Adekolu, Adekunle Matthew, and Lei Chen. "A Simple Approach to Develop a Parental Control via a Monitoring Home Network." Thesis, Högskolan i Halmstad, Akademin för informationsteknologi, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-38994.

Full text

Abstract:

This thesis explains how a simple parental control can be developed. The system aims to limit kids’ activities rather than entirely restrict those activities. However, current solutions are applying some filtering methods that prevent kids from playing games. In order to overcome this issue, this thesis presents a simple approach to implement a cost-effective parental control using low-cost hardware devices and open source applications.The main advantage of the suggested method is that it can be used without installing any additional software and gives parents general information about their kids' activities on the internet without preventing kids from playing online games.

APA, Harvard, Vancouver, ISO, and other styles

36

Wehowsky, Andreas Frederik. "Safe distributed coordination of heterogeneous robots through dynamic simple temporal networks /." [Cambridge, Mass.] : Massachusetts Institute of Technology - Artificial Intelligence Laboratory, 2003. ftp://publications.ai.mit.edu/ai-publications/2003/AITR-2003-012.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Wehowsky, Andreas Frederik 1977. "Safe distributed coordination of heterogeneous robots through dynamic simple temporal networks." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/82783.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Ng, Hwee Ping. "Performance analysis of management techniques for SONET/SDH telecommunications networks." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://library.nps.navy.mil/uhtbin/hyperion/05Mar%5FNg.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Oelhafen, Markus. "SNMP Application for the MINT Router (Walkstation II project)." Thesis, KTH, Teleinformatik, 1994. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-98767.

Full text

Abstract:

The purpose of the Walkstation II project is to create a testbed for a wireless communication system with access to the Internet. The Mobile INTernet (MINT) router is a core element of this project. Most of the routers and many other nodes of today's Internet support network management. This includes the remote control of various parameters which caracterize the status of physical interfaces, protocols and many other objects. The Simple Network Management Protocol (SNMP) which was used in the current work is a standard protocol of the TCP/IP suite. All the managed nodes of the Internet have a common set of management capabilities. Their implementation is available in software development packages. The management of mobile stations requires a new set of management capabilities. They will allow for the control of mobility support and the radio links. The current work consists in adapting the set of standard SNMP capabilities to the MINT router and of the creation of a set of new capabilities specific to the MINT.

I do not know the number of university credits, but entered it as 30 ECTS. This was an exchange student and I do not know if they were actually registered at KTH.

APA, Harvard, Vancouver, ISO, and other styles

40

OLIVEIRA, JUNIOR Wilson Rosa de. "Turing´s analysis of computation and artificial neural network." Universidade Federal de Pernambuco, 2004. https://repositorio.ufpe.br/handle/123456789/1970.

Full text

Abstract:

Made available in DSpace on 2014-06-12T15:53:32Z (GMT). No. of bitstreams: 2 arquivo5203_1.pdf: 2427628 bytes, checksum: b7e101175fb8c6dac688a04de83a3303 (MD5) license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5) Previous issue date: 2004
Conselho Nacional de Desenvolvimento Científico e Tecnológico
Inspirado por uma sugestão de McCulloch e Pitts em seu trabalho pioneiro, uma simulação de Máquinas de Turing (MT) por Redes Neurais Artifiais (RNAs) apresentada. Diferente dos trabalhos anteriores, tal simulação está de acordo com a interpretação correta da análise de Turing sobre computação; é compatvel com as abordagens correntes para análise da cognição como um processo interativo agente-ambiente; e é fisicamente realizável uma vez que não se usa pesos nas conexãos com precisão ilimitada. Uma descrição completa de uma implementação de uma MT universal em uma RNA recorrente do tipo sigmóide é dada. A fita, um recurso infinito, é deixada fora da codificação como uma caracterstica externa não-intrínsica. A rede resultante é chamada de Máquina de Turing Neural. O modelo clássico de computação Máquina de Turing = Fita + Autômato de Estados Finito (AEF) é trocado pelo modelo de computação neural Máquina de Turing Neural (MTN) = Fita + Rede Neural Artifial (RNA) Argumentos para plausabilidade física e cognitiva desta abordagem são fornecidos e as consequências matemáticas são investigadas. E bastante conhecido na comunidade de neurocomputação teórica, que um AEF arbitrário não pode ser implementado em uma RNA quando ruído ou limite de precisão é considerado: sob estas condições, sistemas analógicos em geral, e RNA em particular, são computacionalmente equivalentes aos Autômatos Definidos uma classe muita restrita de AEF. Entre as principais contribuições da abordagem proposta é a definição de um novo modelo de máquina, Máquina de Turing Definida(MTD), que surge quando ruído é levado em consideração. Este resultado reflete na segunda equação descrita acima se tornando MTN com ruíıdo (MTN) = Fita + RNA com ruído(RNA) com a equação correspondente Máquina de Turing Definida = Fita + Autômatos Finitos Definidos (AFD) A investigação de capacidades computacionais das Máquinas de Turing Definida é uma outra contribuição importante da Tese. É provado que elas computam a classe das funções elementares (Brainerd & Landweber, 1974) da Teoria da Recursão

APA, Harvard, Vancouver, ISO, and other styles

41

Marmo, Carlos Nehemy. "Sincronismo em redes mestre-escravo de via-única: estrela simples, cadeia simples e mista." Universidade de São Paulo, 2003. http://www.teses.usp.br/teses/disponiveis/3/3139/tde-18022004-233234/.

Full text

Abstract:

Neste trabalho, são estudados os problemas de sincronismo de fase nas redes mestre-escravo de via única (OWMS), nas topologias Estrela Simples, Cadeia Simples e mista, através da Teoria Qualitativa de Equações Diferenciais, com ênfase no Teorema da Variedade Central. Através da Teoria das Bifurcações, analisa-se o comportamento dinâmico das malhas de sincronismo de fase (PLL) de segunda ordem que compõem cada rede, frente às variações nos seus parâmetros constitutivos. São utilizadas duas funções de excitação muito comuns na prática: o degrau e a rampa de fase, aplicadas pelo nó mestre. Em cada caso, discute-se a existência e a estabilidade do estado síncrono. A existência de pontos de equilíbrio não-hiperbólicos, não permite uma aproximação linear, e nesses casos é aplicado o Teorema da Variedade Central. Através dessa rigorosa técnica de simplificação de sistemas dinâmicos é possível fazer uma aproximação homeomórfica em torno desses pontos, preservando a orientação no espaço de fases. Desse modo, é possível determinar, localmente, suas estabilidades.
This work presents stability analysis of the syncronous state for three types of one-way master-slave time distribution network topologies: single star, single chain and both of them, mixed. Using bifurcation theory, the dynamical behavior of second-order phase-locked loops employed to extract the syncronous state in each node is analyzed in function of the constitutive parameters. Two usual inputs, the step and the ramp phase pertubations, are supposed to appear in the master node and, in each case, the existence and stability of the syncronous state are studied. For parameter combinations resulting in non hyperbolic synchronous states, the linear approximation does not provide any information, even about the local behaviour of the system. In this case, the center manifold theorem permits the construction of an equivalent vector field representing the asymptotic behaviour of the original system in the neighborhood of these points. Thus, the local stability can be determined.

APA, Harvard, Vancouver, ISO, and other styles

42

Diederich, Jörg [Verfasser]. "Simple and Scalable Quality of Service for Wireless Mobile Networks / Jörg Diederich." Aachen : Shaker, 2003. http://d-nb.info/1174514396/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Lane, Peter. "Simple synchrony networks : a new connectionist architecture applied to natural language parsing." Thesis, University of Exeter, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.322386.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Sagaser, Michael Bernard. "A computational comparison of the primal simplex and relaxation algorithms for solving minimum cost flow networks." Thesis, Monterey, California. Naval Postgraduate School, 1989. http://hdl.handle.net/10945/26936.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Abu-Ghazaleh, Nayef Bassam. "Optimizing communication performance of web services using differential deserialization of SOAP messages." Diss., Online access via UMI:, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

46

Pugh, Keith. "A home network infrastructure based on a simple low cost, low latency, scaleable, serial interconnect." Thesis, Keele University, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.403769.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Vallejo, Mauricio. "Noradrenergic tuning, not simple rate effects, produces temperature-sensitivity of the respiratory network in bullfrogs." Wright State University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=wright1527181646566301.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Yamazato, Takaya, Hiraku Okada, Masaaki Katayama, and Akira Ogawa. "A Simple Data Relay Process and Turbo Code Application to Wireless Sensor Networks." IEEE, 2004. http://hdl.handle.net/2237/7760.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Jacobsson, Henrik. "A Comparison of Simple Recurrent and Sequential Cascaded Networks for Formal Language Recognition." Thesis, University of Skövde, Department of Computer Science, 1999. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-391.

Full text

Abstract:

Two classes of recurrent neural network models are compared in this report, simple recurrent networks (SRNs) and sequential cascaded networks (SCNs) which are first- and second-order networks respectively. The comparison is aimed at describing and analysing the behaviour of the networks such that the differences between them become clear. A theoretical analysis, using techniques from dynamic systems theory (DST), shows that the second-order network has more possibilities in terms of dynamical behaviours than the first-order network. It also revealed that the second order network could interpret its context with an input-dependent function in the output nodes. The experiments were based on training with backpropagation (BP) and an evolutionary algorithm (EA) on the AnBn-grammar which requires the ability to count. This analysis revealed some differences between the two training-regimes tested and also between the performance of the two types of networks. The EA was found to be far more reliable than BP in this domain. Another important finding from the experiments was that although the SCN had more possibilities than the SRN in how it could solve the problem, these were not exploited in the domain tested in this project

APA, Harvard, Vancouver, ISO, and other styles

50

Russo, Elena Tea. "Fluctuation properties in random walks on networks and simple integrate and fire models." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/9565/.

Full text

Abstract:

In questa tesi si è studiato l’insorgere di eventi critici in un semplice modello neurale del tipo Integrate and Fire, basato su processi dinamici stocastici markoviani definiti su una rete. Il segnale neurale elettrico è stato modellato da un flusso di particelle. Si è concentrata l’attenzione sulla fase transiente del sistema, cercando di identificare fenomeni simili alla sincronizzazione neurale, la quale può essere considerata un evento critico. Sono state studiate reti particolarmente semplici, trovando che il modello proposto ha la capacità di produrre effetti "a cascata" nell’attività neurale, dovuti a Self Organized Criticality (auto organizzazione del sistema in stati instabili); questi effetti non vengono invece osservati in Random Walks sulle stesse reti. Si è visto che un piccolo stimolo random è capace di generare nell’attività della rete delle fluttuazioni notevoli, in particolar modo se il sistema si trova in una fase al limite dell’equilibrio. I picchi di attività così rilevati sono stati interpretati come valanghe di segnale neurale, fenomeno riconducibile alla sincronizzazione.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Network Simplex'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles