Academic literature on the topic 'Network synthesi'

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Network synthesi.'

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.

Dissertations / Theses on the topic "Network synthesi"

1

Wynants, Christelle. "Network synthesis problems." Doctoral thesis, Universite Libre de Bruxelles, 1999. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/211871.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hughes, Timothy Howard. "On the synthesis of passive networks without transformers." Thesis, University of Cambridge, 2014. https://www.repository.cam.ac.uk/handle/1810/265924.

Full text
Abstract:
This thesis is concerned with the synthesis of passive networks, motivated by the recent invention of a new mechanical component, the inerter, which establishes a direct analogy between mechanical and electrical networks. We investigate the minimum numbers of inductors, capacitors and resistors required to synthesise a given impedance, with a particular focus on transformerless network synthesis. The conclusions of this thesis are relevant to the design of compact and cost-effective mechanical and electrical networks for a broad range of applications. In Part 1, we unify the Laplace-domain and phasor approach to the analysis of transformerless networks, using the framework of the behavioural approach. We show that the autonomous part of any driving-point trajectory of a transformerless network decays to zero as time passes. We then consider the trajectories of a transformerless network, which describe the permissible currents and voltages in the elements and at the driving-point terminals. We show that the autonomous part of any trajectory of a transformerless network is bounded into the future, but need not decay to zero. We then show that the value of the network's impedance at a particular point in the closed right half plane can be determined by finding a special type of network trajectory. In Part 2, we establish lower bounds on the numbers of inductors and capacitors required to realise a given impedance. These lower bounds are expressed in terms of the extended Cauchy index for the impedance, a property defined in that part. Explicit algebraic conditions are also stated in terms of a Sylvester and a Bezoutian matrix. The lower bounds are generalised to multi-port networks. Also, a connection is established with continued fraction expansions, with implications for network synthesis. In Part 3, we first present four procedures for the realisation of a general impedance with a transformerless network. These include two known procedures, the Bott-Duffin procedure and the Reza-Pantell-Fialkow-Gerst simplification, and two new procedures. We then show that the networks produced by the Bott-Duffin procedure, and one of our new alternatives, contain the least possible number of reactive elements (inductors and capacitors) and resistors, for the realisation of a certain type of impedance (called a biquadratic minimum function), among all series-parallel networks. Moreover, we show that these procedures produce the only series-parallel networks which contain exactly six reactive elements and two resistors and realise a biquadratic minimum function. We further show that the networks produced by the Reza-Pantell-Fialkow-Gerst simplification, and the second of our new alternatives, contain the least possible number of reactive elements and resistors for the realisation of almost all biquadratic minimum functions among the class of transformerless networks. We group the networks obtained by these two procedures into two quartets, and we show that these are the only quartets of transformerless networks which contain exactly five reactive elements and two resistors and realise all of the biquadratic minimum functions. Finally, we investigate the minimum number of reactive elements required to realise certain impedances, of greater complexity than the biquadratic minimum function, with series-parallel networks.
APA, Harvard, Vancouver, ISO, and other styles
3

Khor, Cheng Seong. "Optimization of water network synthesis." Thesis, Imperial College London, 2012. http://hdl.handle.net/10044/1/39370.

Full text
Abstract:
Water is a key component in most industries. It has become a crucial resource today particularly in the process and allied industries due to increasingly higher demand for water use, scarcities in water resources, and ever more stringent regulations on wastewater discharges. Hence, this thesis addresses water network synthesis with the goal of developing a systematic approach for optimizing water recovery through regeneration-reuse and regeneration-recycle schemes. A water network super structure is first develop ed that consists of three elements similar to a pooling problem formulation: sources for reuse/recycle, regenerators for contaminants removal, and sinks for acceptance of water for reuse/recycle. The superstructure encompasses membrane separation-based technologies for water regeneration, particularly ultrafiltration and reverse osmosis, which are gaining widespread industrial applications. For the membrane regenerators, we formulate simplified linear models that admit a more general concentration expression as functions of both the liquid phase recovery factors and contaminant removal ratios. The overall superstructure leads to a mixed-integer nonlinear programming (MINLP) optimization model formulation, with continuous variables on water flowrates and contaminant concentrations while binary 0?1 variables are used for selection of piping interconnections. The resultant model is nonconvex particularly in bilinear terms due to contaminant mixing in the regenerators. Realizing the important influence of the physical parameters of a membrane regenerator, the network design is refined by proposing the use of a more detailed nonlinear preliminary design model of this regenerator type that also accounts for various cost elements of the associated equipment components. The more detailed model is applied to a single-stage reverse osmosis network that is incorporated within an overall water network MINLP. To address uncertainty in the formulation, this work develops a recourse-based two-stage stochastic programming framework by using multiple discrete scenarios to approximate the underlying probability distribution of the uncertain parameters. The model is extended with risk management considerations by using the conditional value-at-risk (CVaR) metric. However, a large number of scenarios are often required to capture the uncertainty meaningfully, causing the model to suffer from the curse of dimensionality. Hence, a stepwise solution strategy is propose d to reduce the computational load. This framework is appl ied to reformulate the original deterministic water network synthesis model as a multiscenario stochastic MINLP consisting of a first -stage network design and a second-stage operation as recourse. The thesis handles these challenging nonconvex formulations, which can result in multiple local optimal solutions, by employing global optimization techniques to ensure reliable solutions. To enhance convergence, a solution strategy is presented that incorporates additional constraints into the model in the form of logic-based linear inequalities by exploiting the physics of the underpinning problem. These logical constraints enforce certain design and structural specifications that consequently reduce the solution time. The proposed modeling and solution strategy is implemented on industrial-size case studies of the water systems in an actual operating petroleum refinery in Malaysia and obtained promising results by employing a state-of-the-art general purpose global solver GAMS/BARON. For the stochastic model formulation, computational comparisons are also conducted with the performance of a recently available global solver, GloMIQO. Finally, the main contributions of this thesis are consolidated and perspectives for future work are offered.
APA, Harvard, Vancouver, ISO, and other styles
4

Hagvall, Hörnstedt Julia. "Synthesis of Thoracic Computer Tomography Images using Generative Adversarial Networks." Thesis, Linköpings universitet, Avdelningen för medicinsk teknik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-158280.

Full text
Abstract:
The use of machine learning algorithms to enhance and facilitate medical diagnosis and analysis is a promising and an important area, which could improve the workload of clinicians’ substantially. In order for machine learning algorithms to learn a certain task, large amount of data needs to be available. Data sets for medical image analysis are rarely public due to restrictions concerning the sharing of patient data. The production of synthetic images could act as an anonymization tool to enable the distribution of medical images and facilitate the training of machine learning algorithms, which could be used in practice. This thesis investigates the use of Generative Adversarial Networks (GAN) for synthesis of new thoracic computer tomography (CT) images, with no connection to real patients. It also examines the usefulness of the images by comparing the quantitative performance of a segmentation network trained with the synthetic images with the quantitative performance of the same segmentation network trained with real thoracic CT images. The synthetic thoracic CT images were generated using CycleGAN for image-to-image translation between label map ground truth images and thoracic CT images. The synthetic images were evaluated using different set-ups of synthetic and real images for training the segmentation network. All set-ups were evaluated according to sensitivity, accuracy, Dice and F2-score and compared to the same parameters evaluated from a segmentation network trained with 344 real images. The thesis shows that it was possible to generate synthetic thoracic CT images using GAN. However, it was not possible to achieve an equal quantitative performance of a segmentation network trained with synthetic data compared to a segmentation network trained with the same amount of real images in the scope of this thesis. It was possible to achieve equal quantitative performance of a segmentation network, as a segmentation network trained on real images, by training it with a combination of real and synthetic images, where a majority of the images were synthetic images and a minority were real images. By using a combination of 59 real images and 590 synthetic images, equal performance as a segmentation network trained with 344 real images was achieved regarding sensitivity, Dice and F2-score. Equal quantitative performance of a segmentation network could thus be achieved by using fewer real images together with an abundance of synthetic images, created at close to no cost, indicating a usefulness of synthetically generated images.
APA, Harvard, Vancouver, ISO, and other styles
5

Lee, Robert. "ON THE APPLICATION OF LOCALITY TO NETWORK INTRUSION DETECTION: WORKING-SET ANALYSIS OF REAL AND SYNTHETIC NETWORK SERVER TRAFFIC." Doctoral diss., Orlando, Fla. : University of Central Florida, 2009. http://purl.fcla.edu/fcla/etd/CFE0002718.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhang, Ying. "Passive network synthesis for vibration suppression." Thesis, University of Bristol, 2017. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.730880.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Jiang, Z. "Passive electrical and mechanical network synthesis." Thesis, University of Cambridge, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.605602.

Full text
Abstract:
This dissertation is concerned with low-complexity mechanical and electrical network synthesis. This dissertation first formalises the concept of regular positive real function and develops a series of lemmas characterising the basic properties of regularity. This concept will be shown to be useful in the classification of low-complexity two-terminal networks. We classify the positive-real biquadratic functions which can be realised by five-element networks. It will be shown that a biquadratic can be realised by a series-parallel network with two reactive elements if and only if it is regular. Moreover, there are two such networks quartets which can realise all regular biquadratics. It will also be shown that the only five-element networks which can realise non-regular biquadratics can be arranged into three network quartets. We then investigate the series-parallel six-element networks with three reactive elements. We will describe a classification procedure to find an efficient subset of such networks which may realise any non-regular biquadratic that can be synthesised by this class of networks. Four network quartets will be identified which serve this purpose. We will then derive the non-regular biquadratics which can be realised by each quartet. We will show that the set of non-regular realisable biquadratics are identical for three of the quartets. The series-parallel six-element networks with four reactive elements will then be investigated. We describe a classification procedure to find an efficient subset of such networks which may realise any non-regular biquadratic that can be synthesised by this class of networks. Five network quartets will be identified which serve this purpose. We will then derive the non-regular biquadratics which can be realised by each quartet.
APA, Harvard, Vancouver, ISO, and other styles
8

Chen, Z. "Passive network synthesis of restricted complexity." Thesis, University of Cambridge, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.597545.

Full text
Abstract:
This dissertation is concerned with passive network synthesis in a mechanical context and applications to vehicle suspensions. This dissertation first presents a modified test for positive-realness of real-rational functions which appears only subtly different from a known condition. The test allows existing results to be derived more simply and allows more general results to be established. We then consider a realisation problem of restricted complexity where the number of dampers and inerters is restricted to one in each case, while allowing an arbitrary number of springs and no transformers (levers). The solution uses element extraction of the damper and inerter followed by the derivation of a necessary and sufficient condition for the one-element-kind (transformerless) realisation of an associated three-port network. This involves the derivation of a necessary and sufficient condition for a third-order non-negative definite matrix to be reducible to a paramount matrix using a diagonal transformation. It is shown that the relevant class of mechanical admittances can be parametrised in terms of five circuit arrangements each containing four springs. We investigate and compare the performances of the five circuit arrangements proposed when applied to suspension systems. One of the five circuits has appeared in the literature and therefore serves as the benchmark. One or more circuit arrangements appear to outperform the benchmark in terms of each individual performance measure among the three of interest and a multi-objective performance measure incorporating two of the three individual performance measures. Finally, we consider the minimum reactance synthesis of a class of biquadratic functions by reactance extraction. We show that at most four dampers are needed to synthesise the remaining resistive 3-port network when explicit conditions are met. The results are an advancement on an equivalent problem studied in the electrical network case.
APA, Harvard, Vancouver, ISO, and other styles
9

Chen, Chia-Hsin Ph D. Massachusetts Institute of Technology. "On-Chip Network exploration and synthesis." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/70792.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 57-60).<br>As CMOS technology improves, the trend of processor designs has gone towards multi-core architectures. Networks-on-Chips (NoCs) have become popular on-chip interconnect fabrics that connect the ever-increasing cores because of their ability to provide high-bandwidth. However, as the number of cores keeps increasing, the endto- end packet latency and the total network power begin to pose tight constraints on NoC designs. In this thesis, we studied architecture proposals designed to tackle this latency and power budget issue. We also studied the impact of applying advanced circuit techniques to these architecture proposals and how to implement these techniques while realizing a NoC design. The thesis begins with an evaluation of physical express topologies and the virtual express topologies that enable the bypassing of intermediate router pipelines. The bypassing of pipeline stages help reduce both end-to-end latency and power consumption since fewer resources are used. We observed that both topologies have similar low-traffic-load latencies and that virtual express topologies result in higher throughput and are more robust across traffic patterns. Physical express topologies, however, deliver a better throughput/watt and can leverage the low-swing link circuits to lower the latency and increase the throughput. Next, then we identified that crossbars, in addition to links, can obtain benefit from the low-swing circuit techniques. We thus developed a layout generation tool for low-swing crossbars and links due to the inability of the existing tools for physical designs to generate these low-swing circuits automatically. The generated crossbars and links using our tool showed 50% energy saving compared to the full-swing synthesized counterpart. We also demonstrated a case study with a router synthesized with the generated crossbar and links.<br>by Chia-Hsin Chen.<br>S.M.
APA, Harvard, Vancouver, ISO, and other styles
10

Burniston, J. D. "A neural network/rule-based architecture for continuous function approximation." Thesis, University of Nottingham, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.387198.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!