Academic literature on the topic 'Electrical Networks'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Electrical Networks.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Electrical Networks"
Yan, Linjuan, Bin Bao, Daniel Guyomar, and Mickaël Lallart. "Periodic structure with interconnected nonlinear electrical networks." Journal of Intelligent Material Systems and Structures 28, no. 2 (July 28, 2016): 204–29. http://dx.doi.org/10.1177/1045389x16649448.
Full textBrown, O. R. "Electrical networks." Electrochimica Acta 38, no. 4 (March 1993): 626. http://dx.doi.org/10.1016/0013-4686(93)85025-t.
Full textSharp, A. A., L. F. Abbott, and E. Marder. "Artificial electrical synapses in oscillatory networks." Journal of Neurophysiology 67, no. 6 (June 1, 1992): 1691–94. http://dx.doi.org/10.1152/jn.1992.67.6.1691.
Full textVingron, Martin, and Michael S. Waterman. "Alignment networks and electrical networks." Discrete Applied Mathematics 71, no. 1-3 (December 1996): 297–309. http://dx.doi.org/10.1016/s0166-218x(96)00070-4.
Full textZemanian, A. H. "Transfinite electrical networks." IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications 46, no. 1 (1999): 59–70. http://dx.doi.org/10.1109/81.739185.
Full textMarinov, Corneliu A., and Gheorghe Moroşanu. "Consistent models for electrical networks with distributed parameters." Mathematica Bohemica 117, no. 2 (1992): 113–22. http://dx.doi.org/10.21136/mb.1992.125904.
Full textRücker, Gerta. "Network meta-analysis, electrical networks and graph theory." Research Synthesis Methods 3, no. 4 (September 25, 2012): 312–24. http://dx.doi.org/10.1002/jrsm.1058.
Full textSharma, Shalini, Bhupendra Kumar Pathak, and Rajiv Kumar. "Understanding of Network Resiliency in Communication Networks with its Integration in Internet of Things - A Survey." Electrica 23, no. 2 (April 5, 2023): 318–28. http://dx.doi.org/10.5152/electrica.2023.22126.
Full textKLYUEV, R. V., V. I. GOLIK, I. I. BOSIKOV, and O. A. GAVRINA. "DEVELOPMENT OF METHODS FOR ENSURING ELECTRICAL SAFETY OF ELECTRIC NETWORKS OF QUARRIES." News of the Tula state university. Sciences of Earth 3, no. 1 (2020): 74–91. http://dx.doi.org/10.46689/2218-5194-2020-3-1-74-91.
Full textWang, Tao, Xiaoguang Wei, Tao Huang, Jun Wang, Luis Valencia-Cabrera, Zhennan Fan, and Mario J. Pérez-Jiménez. "Cascading Failures Analysis Considering Extreme Virus Propagation of Cyber-Physical Systems in Smart Grids." Complexity 2019 (March 13, 2019): 1–15. http://dx.doi.org/10.1155/2019/7428458.
Full textDissertations / Theses on the topic "Electrical Networks"
SILVA, DENIS LAGE FERREIRA DA. "NONLINEAR ELECTRICAL NETWORKS SIMULATION." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2009. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14447@1.
Full textFUNDAÇÃO DE APOIO À PESQUISA DO ESTADO DO RIO DE JANEIRO
As simulações de redes elétricas são atualmente fundamentais para o setor elétrico. Uma de suas principais utilidades é permitir a análise de falhas e ocorrências, que eventualmente passariam despercebidas. Existe atualmente, uma grande variedade de algoritmos para realizar simulações de redes lineares, que correspondem à grande maioria dos testes realizados em uma rede elétrica típica, quando submetidos a situações usuais. Contudo, existem consumidores de grande porte que possuem cargas não-lineares com uma grande influência na rede que a alimenta. Sendo assim, torna-se necessário modelar esta carga não-linear para que possa ser inserida no simulador da rede elétrica. Este trabalho propõe um método para a formulação das equações de estado de redes não-lineares de forma sistemática. A formulação do problema é, neste caso, parte fundamental da sua solução, já que atualmente existem, comercialmente, algoritmos capazes de resolver equações diferenciais não-lineares, como as que serão abordadas. Este trabalho apresenta a simulação de uma rede elétrica contendo sub-redes lineares e sub-redes não-lineares, utilizando um modelo de linhas de transmissão a parâmetros distribuídos através de filtros digitais, permitindo a simulação da subrede linear em taxas mais baixas.
Electrical network simulations are currently very important to the electricity sector. A major benefit from simulations is to permit a deeper insight into faulty network situations, that otherwise could eventually pass unnoticed. Currently, there are many algorithms that simulate linear networks, which comprise the majority of the tests done in a typical network, when subject to normal situations. However, there are large consumers, whose loads are nonlinear. These loads represent large influences to their power feeding network. Thus, it becomes necessary to model this nonlinear sub network so it can be inserted into the electrical network simulator. The purpose of this work is to develop a formulation approach for the nonlinear state equations that represents a nonlinear electrical network. The formulation of the network is, in this case, an essential part of the solution, since there are currently algorithms capable of solving nonlinear differential equations, like the ones that will be studied in this work.
Jannotti, John 1974. "Network layer support for overlay networks." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/29274.
Full textIncludes bibliographical references (p. 98-103).
Overlay networks are virtual networks formed by cooperating nodes that share an underlying physical network. They represent a flexible and deployable approach for applications to obtain new network semantics without modification of the underlying network, but they suffer from efficiency concerns. This thesis presents two new primitives for implementation in the network layer (i.e., the routers of the physical network). These primitives support the efficient operation and construction of overlay networks. Packet Reflection allows end hosts to request that routers perform specialized routing and duplication for certain packets. Path Painting allows multiple end hosts to determine where their disparate paths to a rendezvous point meet, in order to facilitate overlay topology building that reflects the topology of the underlying network. Both primitives can be incrementally deployed for incremental benefit. This thesis describes a variety applications of these primitives: application level multicast systems with various semantics, an extended Internet Indirect Infrastructure with latency benefits over the original proposal, and an extension to Chord which would allows faster lookups. Experimental results on simulated topologies indicate that when all routers support the proposed primitives, less that 5% overhead (in terms of link usage and latency) remains in two common overlay network usage scenarios. In addition, the benefits gained from deployment are significant even at low deployment levels. At approximately 25% deployment, the primitives have reduced overhead by over 50%. When intelligent deployment strategies are used, link usage overhead is less than 30% at less than 10% deployment. Finally, the results indicate that these benefits affect the area local to the deployed routers, providing a deployment incentive to independent networks.
by John Jannotti.
Ph.D.
Kim, MinJi Ph D. Massachusetts Institute of Technology. "Network coding for robust wireless networks." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/71276.
Full textThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student submitted PDF version of thesis.
Includes bibliographical references (p. 157-167).
Wireless networks and communications promise to allow improved access to services and information, ubiquitous connectivity, and mobility. However, current wireless networks are not well-equipped to meet the high bandwidth and strict delay requirements of future applications. Wireless networks suffer from frequent losses and low throughput. We aim to provide designs for robust wireless networks. This dissertation presents protocols and algorithms that significantly improve wireless network performance and effectively overcome interference, erasures, and attacks. The key idea behind this dissertation is in understanding that wireless networks are fundamentally different from wired networks, and recognizing that directly applying techniques from wired networks to wireless networks limits performance. The key ingredient underlying our algorithms and protocols is network coding. By recognizing the algebraic nature of information, network coding breaks the convention of routing networks, and allows mixing of information in the intermediate nodes and routers. This mixing has been shown to have numerous performance benefits, e.g. increase in throughput and robustness against losses and failures. We present three protocols and algorithms, each using network coding to harness a different characteristic of the wireless medium. We address the problem of interference, erasures, and attacks in wireless networks with the following network coded designs. -- Algebraic NC exploits strategic interference to provide a distributed, randomized code construction for multi-user wireless networks. Network coding framework simplifies the multi-user wireless network model, and allows us to describe the multi-user wireless networks in an algebraic framework. This algebraic framework provides a randomized, distributed code construction, which we show achieves capacity for multicast connections as well as a certain set of non-multicast connections. -- TCP/NC efficiently and reliably delivers data over unreliable lossy wireless networks. TCP, which was designed for reliable transmission over wired networks, often experiences severe performance degradation in wireless networks. TCP/NC combines network coding's erasure correction capabilities with TCP's congestion control mechanism and reliability. We show that TCP/NC achieves significantly higher throughput than TCP in lossy networks; therefore, TCP/NC is well suited for reliable communication in lossy wireless networks. -- Algebraic Watchdog takes advantage of the broadcast nature of wireless networks to provide a secure global self-checking network. Algebraic Watchdog allows nodes to detect malicious behaviors probabilistically, and police their neighbors locally using overheard messages. Unlike traditional detection protocols which are receiver-based, this protocol gives the senders an active role in checking the nodes downstream. We provide a trellis-based inference algorithm and protocol for detection, and analyze its performance. The main contribution of this dissertation is in providing algorithms and designs for robust wireless networks using network coding. We present how network coding can be applied to overcome the challenges of operating in wireless networks. We present both analytical and simulation results to support that network coded designs, if designed with care, can bring forth significant gains, not only in terms of throughput but also in terms of reliability, security, and robustness.
by MinJi Kim.
Ph.D.
Taiwo, Olugbenga Adekunle. "Network access selection in heterogeneous wireless networks." Master's thesis, University of Cape Town, 2013. http://hdl.handle.net/11427/16832.
Full textLee, Anna H. "Simplified random network codes for multicast networks." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/33306.
Full textIncludes bibliographical references (p. 43).
Network coding is a method of data transmission across a network which involves coding at intermediate nodes. Network coding is particularly attractive for multicast. Building on the work done on random linear network codes, we develop a constrained, simplified code construction suitable for multicast in wireless networks. We analyze bounds on sufficient code size and code success probability via an algebraic framework for network coding. We also present simulation results that compare generalized random network codes with our code construction. Issues unique to the simplified code are explored and a relaxation of the code to improve code performance is discussed.
by Anna H. Lee.
M.Eng.and S.B.
Shi, Xiaomeng Ph D. Massachusetts Institute of Technology. "Energy aware network coding in wireless networks." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/78533.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (p. 97-104).
Energy is one of the most important considerations in designing reliable low-power wireless communication networks. We focus on the problem of energy aware network coding. In particular, we investigate practical energy efficient network code design for wireless body area networks (WBAN). We first consider converge-cast in a star-shaped topology, in which a central base station (BS), or hub, manages and communicates directly with a set of nodes. We then consider a wireless-relay channel, in which a relay node assists in the transmission of data from a source to a destination. This wireless relay channel can be seen as a simplified extended star network, where nodes have relay capabilities. The objective is to investigate the use of network coding in these scenarios, with the goal of achieving reliability under low-energy and lower-power constraints. More specifically, in a star network, we propose a simple network layer protocol, study the mean energy to complete uploads of given packets from the nodes to the BS using a Markov chain model, and show through numerical examples that when reception energy is taken into account, the incorporation of network coding offers reductions in energy use. The amount of achievable gains depends on the number of nodes in the network, the degree of asymmetry in channel conditions experienced by different nodes, and the relative difference between transmitting and receiving power at the nodes. We also demonstrate the compatibility of the proposed scheme with the IEEE 802.15.6 WBAN standard by describing ways of incorporating network coding into systems compliant to the standard. For a wireless relay channel, we explore the strategic use of network coding according to both throughput and energy metrics. In the relay channel, a single source communicates to a single sink through the aid of a half-duplex relay. The fluid flow model is used to describe the case where both the source and the relay are coding, and Markov chain models are proposed to describe packet evolution if only the source or only the relay is coding. Although we do not attempt to explicitly categorize the optimal network coding strategies in the relay channel under different system parameters, we provide a framework for deciding whether and where to code, taking into account of throughput maximization and energy depletion constraints.
by Xiaomeng Shi.
Ph.D.
Kim, Anthony Eli. "On network coding capacity : matroidal networks and network capacity regions." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/62657.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (p. 68-70).
One fundamental problem in the field of network coding is to determine the network coding capacity of networks under various network coding schemes. In this thesis, we address the problem with two approaches: matroidal networks and capacity regions. In our matroidal approach, we prove the converse of the theorem which states that, if a network is scalar-linearly solvable then it is a matroidal network associated with a representable matroid over a finite field. As a consequence, we obtain a correspondence between scalar-linearly solvable networks and representable matroids over finite fields in the framework of matroidal networks. We prove a theorem about the scalar-linear solvability of networks and field characteristics. We provide a method for generating scalar-linearly solvable networks that are potentially different from the networks that we already know are scalar-linearly solvable. In our capacity region approach, we define a multi-dimensional object, called the network capacity region, associated with networks that is analogous to the rate regions in information theory. For the network routing capacity region, we show that the region is a computable rational polytope and provide exact algorithms and approximation heuristics for computing the region. For the network linear coding capacity region, we construct a computable rational polytope, with respect to a given finite field, that inner bounds the linear coding capacity region and provide exact algorithms and approximation heuristics for computing the polytope. The exact algorithms and approximation heuristics we present are not polynomial time schemes and may depend on the output size.
by Anthony Eli Kim.
M.Eng.
Ahmed, Ebad. "Delay gains from network coding in wireless networks." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/41253.
Full textIncludes bibliographical references (p. 73-77).
We consider a single-hop cellular wireless system with a single source (base station) broadcasting a stream of incoming files to multiple receivers over stochastic time-varying channels with non-zero erasure probabilities. The base station charges a price per receiver per file with the aim of maximizing its profit. Customers who wish to transmit files to the receivers decide to enter the system based on the price, the queuing delay, and the utility derived from the transaction. We look at network coding and scheduling as possible strategies for file transmission, and obtain approximate characterizations of the optimal customer admission rate, optimal price and the optimal base-station profit as functions of the first and second moments of the service time processes under mild assumptions. We show that network coding leads to significant gains in the base station profits as compared to scheduling, and also demonstrate that the optimal network coding window size is highly insensitive to the number of receivers, which suggests that pricing and coding decisions can be decoupled. We also investigate the behavior of network coding in the case where the number of receivers is sufficiently large, and derive scaling laws for the asymptotic gains from network coding. We subsequently propose a way to extend our analysis of single-source, multiple-receiver systems to multiple-source, multiple-receiver systems in general network topologies and obtain explicit characterizations of the file download completion time under network coding and scheduling, also taking into account the effects of collisions and interference among concurrent packet transmissions by two or more sources.
(cont.) Our formulation allows us to model multi-hop networks as a series of single-hop multiple-source, multiple-receiver systems, which provides a great deal of insight into the workings of larger and denser multi-hop networks such as overlay networks and peer-to-peer systems, and appears to be a promising application of network coding in such networks in the future.
by Ebad Ahmed.
M.Eng.
Mak, Wai Y. "Ad Hoc Network Architecture for Multi-Media Networks." Thesis, Monterey California. Naval Postgraduate School, 2007. http://hdl.handle.net/10945/2988.
Full textSingapore Armed Forces author.
Masood, Syed Haani. "Distribution of files using network-coding in opportunistic networks." Thesis, McGill University, 2012. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=106560.
Full textL'immense croissance de l'utilisation des données mobiles a placé les opérateurs mobiles dans une position difficile. L'expérience utilisateur est menacée de se dégrader en raison de problèmes de capacité du réseau. La route vers la mise à niveau du réseau est coûteuse en particulier en raison des frais de licence élevés attachés à l'acquisition du spectre. Nous proposons un schéma basé sur l'identification communautaire pour la distribution de gros fichiers à des abonnés en utilisant la communication opportuniste. Le système est capable de se décharger de gros fichiers sur le réseau cellulaire et sans avoir à investir dans n'importe quelle infrastructure. Le réseau cellulaire d'abord les graines du fichier à l'abonné la plus centrale dans chaque communauté, qui est ensuite étendue à tous les abonnés via des contacts opportunistes. Réseau de codage est utilisé pour l'échange de paquets de fichiers opportunistes entre les abonnés. Nous montrons que l'ensemencement du fichier dans chaque communauté est important pour assurer une meilleure délais de livraison du fichier et réduit également la surcharge du nombre d'échanges de paquets nécessaires pendant la diffusion de fichiers. Notre programme prévoit également des incitations pour les abonnés influents dans le réseau qui contribuent davantage vers la diffusion opportuniste de fichier.
Books on the topic "Electrical Networks"
Hadjsaïd, Nouredine, and Jean-Claude Sabonnadi`re, eds. Electrical Distribution Networks. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118601280.
Full textPrévé, Christophe. Protection of Electrical Networks. London, UK: ISTE, 2006. http://dx.doi.org/10.1002/9780470612224.
Full textLyubarskiy, Yuriy, and Aleksandr Hrennikov. Intelligent electrical networks: computer support for dispatching solutions. ru: INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1134516.
Full textNarayanan, H. Submodular functions and electrical networks. Amsterdam: Elsevier, 1997.
Find full textBook chapters on the topic "Electrical Networks"
Bollobás, Béla. "Electrical Networks." In Modern Graph Theory, 39–66. New York, NY: Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4612-0619-4_2.
Full textBloch, Ingram. "Electrical Networks." In The Physics of Oscillations and Waves, 104–19. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4899-0050-0_7.
Full textBerns, Karsten, Alexander Köpper, and Bernd Schürmann. "Electrical Networks." In Lecture Notes in Electrical Engineering, 19–43. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-65157-2_3.
Full textSeshadri, V. "Electrical networks." In The Inverse Gaussian Distribution, 198–202. New York, NY: Springer New York, 1999. http://dx.doi.org/10.1007/978-1-4612-1456-4_12.
Full textZemanian, Armen H. "Transfinite Electrical Networks." In Transfiniteness, 115–55. Boston, MA: Birkhäuser Boston, 1996. http://dx.doi.org/10.1007/978-1-4612-0767-2_5.
Full textHsu, Yuan-Yih, and Chien-Chun Yang. "Electrical Load Forecasting." In Applications of Neural Networks, 157–89. Boston, MA: Springer US, 1995. http://dx.doi.org/10.1007/978-1-4757-2379-3_7.
Full textKories, Ralf, and Heinz Schmidt-Walter. "Networks at Variable Frequency." In Electrical Engineering, 192–207. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-642-55629-6_5.
Full textLoebl, Martin. "Trees and electrical networks." In Discrete Mathematics in Statistical Physics, 51–64. Wiesbaden: Vieweg+Teubner, 2010. http://dx.doi.org/10.1007/978-3-8348-9329-1_3.
Full textPahwa, S., M. Youssef, and C. Scoglio. "Electrical Networks: An Introduction." In Understanding Complex Systems, 163–86. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-03518-5_8.
Full textWalrand, Jean. "Networks: A." In Probability in Electrical Engineering and Computer Science, 71–92. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-49995-2_5.
Full textConference papers on the topic "Electrical Networks"
Luksa, Jolanta, Vivita Pukite, and Maris Virkavs. "EVALUATION OF ELECTRICAL NETWORKS IN LAND PROPERTIES IN LATVIA." In 9th SWS International Scientific Conferences on SOCIAL SCIENCES - ISCSS 2022. SGEM WORLD SCIENCE, 2022. http://dx.doi.org/10.35603/sws.iscss.2022/s15.128.
Full textJi, Philip N. "Hybrid Optical-Electrical Data Center Networks." In Photonic Networks and Devices. Washington, D.C.: OSA, 2016. http://dx.doi.org/10.1364/networks.2016.nem3b.3.
Full textZaitsev, Ievgen O., Igor V. Blinov, Victorii O. Bereznychenko, and Serhiy A. Zakusilo. "Electrical Transmission Line Damage Identification System for Distribution Electrical Networks." In 16th IC Measurement and Control in Complex Systems. Vinnytsia: VNTU, 2022. http://dx.doi.org/10.31649/mccs2022.21.
Full textCross, J. D., and R. Hartshorn. "My Electric Avenue: Integrating Electric Vehicles into the Electrical Networks." In 6th Hybrid and Electric Vehicles Conference (HEVC 2016). Institution of Engineering and Technology, 2016. http://dx.doi.org/10.1049/cp.2016.0972.
Full textPapallo, Thomas. "Networks in a network, communications in electrical distribution." In 2013 IEEE Petroleum and Chemical Industry Technical Conference (PCIC 2013). IEEE, 2013. http://dx.doi.org/10.1109/pcicon.2013.6666043.
Full textKrane, Christian, and Hans-Jurgen Haubrich. "Evaluation of the network structure of electrical transmission networks." In 2008 Third International Conference on Electric Utility Deregulation and Restructuring and Power Technologies. IEEE, 2008. http://dx.doi.org/10.1109/drpt.2008.4523518.
Full textZhao, Sicheng, and Zuqing Zhu. "Network Service Reconfiguration in Hybrid Optical/Electrical Datacenter Networks." In 2020 International Conference on Optical Network Design and Modeling (ONDM). IEEE, 2020. http://dx.doi.org/10.23919/ondm48393.2020.9133032.
Full textBohm, V., A. Popelka, and B. Sadecky. "Synchronous measurement in electrical networks." In 18th International Conference and Exhibition on Electricity Distribution (CIRED 2005). IEE, 2005. http://dx.doi.org/10.1049/cp:20051145.
Full textYaghoti, A. A., M. Parsa, and V. J. Majd. "Electrical distribution networks state estimation." In 18th International Conference and Exhibition on Electricity Distribution (CIRED 2005). IEE, 2005. http://dx.doi.org/10.1049/cp:20051342.
Full textMehmeri, Victor Dantas, Juan Jose Vegas Olmos, and Idelfonso Tafur Monroy. "Software architecture for hybrid electrical/optical data center network." In 2016 17th International Telecommunications Network Strategy and Planning Symposium (Networks). IEEE, 2016. http://dx.doi.org/10.1109/netwks.2016.7751165.
Full textReports on the topic "Electrical Networks"
Divan, Deepakraj. Sensing Electrical Networks Securely & Economically (SENSE). Office of Scientific and Technical Information (OSTI), December 2022. http://dx.doi.org/10.2172/1908949.
Full textDu, Xinlong, and Jerome F. Hajjar. Structural Performance Assessment of Electrical Transmission Networks for Hurricane Resilience Enhancement. Northeastern University, August 2022. http://dx.doi.org/10.17760/d20460693.
Full textChen, Wai-Kai. On Broadband Matching of Multiport Electrical Networks with Applications. Fort Belvoir, VA: Defense Technical Information Center, January 1988. http://dx.doi.org/10.21236/ada194224.
Full textBeskok, Ali, Michael Bevan, Dimitris Lagoudas, Zoubeida Ounaies, Pradipkumar Bahukudumbi, and William Everett. Reversible Control of Anisotropic Electrical Conductivity using Colloidal Microfluidic Networks. Fort Belvoir, VA: Defense Technical Information Center, April 2007. http://dx.doi.org/10.21236/ada482538.
Full textHossain, Niamat Ullah Ibne, Raed Jaradat, Seyedmohsen Hosseini, Mohammad Marufuzzaman, and Randy Buchanan. A framework for modeling and assessing system resilience using a Bayesian network : a case study of an interdependent electrical infrastructure systems. Engineer Research and Development Center (U.S.), April 2021. http://dx.doi.org/10.21079/11681/40299.
Full textKnox, Hunter Anne, Jonathan Ajo-Franklin, Timothy Johnson, Joseph Morris, Mark C. Grubelich, Stephanie James, Alex Rinehart, et al. Imaging Fracture Networks Using Joint Seismic and Electrical Change Detection Techniques - Final Report. Office of Scientific and Technical Information (OSTI), February 2017. http://dx.doi.org/10.2172/1494179.
Full textDe Crescenzi, Maurizio. 3D Carbon Nanotube Networks as Mechanical, Electrical and Photovoltaic Transducer and Superhydrophobic Filter. Fort Belvoir, VA: Defense Technical Information Center, June 2015. http://dx.doi.org/10.21236/ada621229.
Full textStojanovic, Vladimir, and Krste Asanovic. Analysis and Design of Manycore Processor-to-DRAM Opto-Electrical Networks with Integrated Silicon Photonics. Fort Belvoir, VA: Defense Technical Information Center, December 2009. http://dx.doi.org/10.21236/ada511353.
Full textModlo, Yevhenii O., Serhiy O. Semerikov, Ruslan P. Shajda, Stanislav T. Tolmachev, and Oksana M. Markova. Methods of using mobile Internet devices in the formation of the general professional component of bachelor in electromechanics competency in modeling of technical objects. [б. в.], July 2020. http://dx.doi.org/10.31812/123456789/3878.
Full textTarasenko, Rostyslav O., Svitlana M. Amelina, and Albert A. Azaryan. Integrated testing system of information competence components of future translators. [б. в.], July 2020. http://dx.doi.org/10.31812/123456789/3879.
Full text