To see the other types of publications on this topic, follow the link: Network synthesi.
Dissertations / Theses on the topic 'Network synthesi'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research 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.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
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
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 textAbstract:
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.
3
Khor, Cheng Seong. "Optimization of water network synthesis." Thesis, Imperial College London, 2012. http://hdl.handle.net/10044/1/39370.
Full textAbstract:
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.
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 textAbstract:
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.
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
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
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 textAbstract:
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.
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 textAbstract:
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.
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 textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.Cataloged from PDF version of thesis.
Includes bibliographical references (p. 57-60).
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.
by Chia-Hsin Chen.
S.M.
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
11
Hojati, Mehran. "Network synthesis problem : cost allocation and algorithms." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/27318.
Full textAbstract:
This thesis is concerned with a network design problem which is referred to in the literature as the network synthesis problem. The objective is to design an undirected network, at a minimum cost, which satisfies known requirements, i.e., lower bounds on the maximum flows, between every pair of nodes. If the requirements are to be satisfied nonsimultaneously, i.e., one at a time, the problem is called the nonsimultaneous network
synthesis problem, whereas if the requirements are to be satisfied simultaneously, the problem is called the simultaneous network synthesis problem. The total construction
cost of the network is the sum of the construction cost of capacities on the edges, where the construction cost of a unit capacity is fixed for any edge, independent of the size of the capacity, but it may differ from edge to edge. The capacities are allowed to assume noninteger nonnegative values. The simultaneous network synthesis problem was efficiently solved by Gomory and Hu [60], whereas the nonsimultaneous network synthesis problem can only be formulated and solved as a linear program with a large number of constraints. However, the special equal-cost case, i.e., when the unit construction
costs are equal across the edges, can be efficiently solved, see Gomory and Hu [60], by some combinatorial method, other than linear programming. A cost allocation problem which is associated with the network synthesis problem would naturally arise, if we assume that the various nodes in the network represent different users or communities.
In this case, we need to find a fair method for allocating the construction cost of the network among the different users. An interesting generalization of the nonsimultaneous
network synthesis problem, the Steiner network synthesis problem, is derived, when only a proper subset of the nodes have positive requirements from each other.
The thesis is concerned with two issues. First, we will analyze the cost allocation problems arising in the simultaneous and the equal cost nonsimultaneous network synthesis
problem. Secondly, we will consider the Steiner network synthesis problem, with particular emphasis on simplifying the computations in some special cases, not considered
before. We will employ cooperative game theory to formulate the cost allocation problems, and we will prove that the derived games are 'concave', which implies the existence of the core and the inclusion of the Shapley value and the nucleolus in the core, and then we will present irredundant representations of the cores. For the equal cost nonsimultaneous network synthesis game, we will use the irredundant representation of the core to provide an explicit closed form expression for the nucleolus of the game, when the requirement structure is a spanning tree; then, we will develop, in a special case, a decomposition of the game, which we will later use to efficiently compute the Shapley value of the game when the requirement structure is a tree; the decomposition will also be used for the core and the nucleolus of the game in the special case. For the simultaneous network synthesis game, we will also use the irredundant representation of the core to derive an explicit closed form expression for the nucleolus, and we will also decompose the core of this game in the special case, and prove that the Shapley value and the nucleolus coincide.
Secondly, for the Steiner network synthesis problem, two conceptually different contributions
have been made, one being a simplifying transformation, and the other being the case when the network has to be embedded in (i.e., restricted to) some special graphs. Namely, when the requirement structure is sparse (because there are only a few demand nodes and the rest are just intermediate nodes) and the positive requirements are equal, we will employ a transformation procedure to simplify the computations. This will enable us to efficiently solve the Steiner network synthesis problem with five or less nodes which have equal positive requirements from each other. Finally, when the solution network to the Steiner network synthesis problem is to be embedded in (restricted to) some special graphs, namely trees, rings (circles), series-parallel graphs, or M₂ and M₃-free graphs, we will provide combinatorial algorithms which are expected to simplify the computations.Business, Sauder School of
Graduate
12
Argyropoulos, Dimitris S. "Synthesis and degradation of model network polymers." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=72032.
Full textAbstract:
Theoretical expressions essentially based on the Flory-Stockmayer statistics of gelation were experimentally examined for their applicability beyond the gel point. By studying the crosslinking process of a polyester network formed from 1,3,5-benzenetriacetic acid and 1,10-decamethylene glycol beyond the gel point, the validity of the expressions was quantitatively confirmed, and their limitations were delineated.On stepwise degradation of a similar network, increasingly large soluble fractions were obtained at each step, and their weight-average molecular weights increased as the degelation point was approached. The molecular weights and distributions of these fractions were in close quantitative agreement with theory, i.e., they represented a near-mirror image of the molecular weights of sol fractions obtained on crosslinking beyond the gel point. Similar results were obtained by degrading a network prepared by the random crosslinking of monodisperse primary chains of polystyrene.
Experimental support was thus obtained for treating random network degradation by reversing the statistics of the Flory-Stockmayer theory of gelation.
13
Coetzee, W. A. S. "Steam systems network synthesis using process integration." Pretoria : [s.n.], 2007. http://upetd.up.ac.za/thesis/available/etd-08252008-165312/.
Full text
14
Leonardi, Suryanto Felix 1958, and Suryanto Felix 1958 Leonardi. "Switched-capacitor network synthesis using leapfrog method." Thesis, The University of Arizona, 1989. http://hdl.handle.net/10150/558107.
Full text
15
Zhu, Yi. "Interconnection networks synthesis and optimization." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2008. http://wwwlib.umi.com/cr/ucsd/fullcit?p3320728.
Full textAbstract:
Thesis (Ph. D.)--University of California, San Diego, 2008.Title from first page of PDF file (viewed October 3, 2008). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 86-90).
16
Jacob, Philipp-Maximilian. "Towards algorithmic use of chemical data." Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/275643.
Full textAbstract:
The growth of chemical knowledge available via online databases opens opportunities for new types of chemical research. In particular, by converting the data into a network, graph theoretical approaches can be used to study chemical reactions. In this thesis several research questions from the field of data science and graph theory are re-formulated for the chemistry-specific data. Firstly, the structure of chemical reactions data was studied using graph theory. It was found that the network of reactions obtained from the Reaxys data was scale-free, that on average any two species were separated by six reactions, and that evidence for a hierarchy of nodes existed, most clearly in that the hubs that combine a large share of connections onto them also facilitate a large proportion of routes across the network. The hierarchy was also evidenced in the clustering and degree correlations of nodes. Next, it was investigated whether Reaxys could be mined to construct a network of reactions and use it to plan and evaluate synthesis routes in two case studies. A number of heuristics were developed to find synthesis routes using the network taking chemical structures into account. These routes were fed into a multi-criteria decision making framework scoring the routes along environmental sustainability considerations. The approach was successful in discovering and scoring synthesis route candidates. It was found that Reaxys lacked process data in many instances. To address this a proposal for extension of the RInChI reaction data format was developed. The final question addressed was whether the network could be used to predict future reactions by using Stochastic Block Models. Block model-based link prediction performed impressively, being able to achieve a classification accuracy of close to 95% during time-split validation on historic data, differentiating future reaction discoveries from random data. Next, a set of transformation suggestions was thus evaluated and a framework for analysing these results was presented. Overall, the thesis was able to further the understanding of the network’s topology and to present a framework allowing the mining of Reaxys to plan synthesis routes and target R&D efforts in a specific area to discover new reactions.
17
Gustafsson, Emil. "Synthetic Generation of Realistic Network Traffic." Thesis, Linköpings universitet, Databas och informationsteknik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-165285.
Full textAbstract:
The industry shows a clear need for synthetically generated realistic network traffic. As a possible solution, this thesis proposes a method for generating such data in an automatic and controllable manner. This thesis first examines the characteristics of real network traffic and analyzes the length of ON/OFF periods. The theory that network traffic exhibits self-similarity and high variability is once again tested and proven, thereby also the fact that the ON/OFF periods of real network traffic comes from a heavy-tailed distribution. Thereafter, the thesis proposes a way to simulate user interaction with real world applications by using a UI testing framework called WinAppDriver. This tool is then used to synthetically generate network traffic, of which the characteristics are analyzed and compared to that of real network traffic. The results show that the generated network traffic is indeed statistically similar to real network traffic. Finally, everything is combined by setting up a whole network of virtual machines with simulated users.
18
Pozo, Francisco. "Synthesis of Extremely Large Time-Triggered Network Schedules." Licentiate thesis, Mälardalens högskola, Inbyggda system, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-34974.
Full textAbstract:
Many embedded systems with real-time requirements demand minimal jitter and low communication end-to-end latency for its communication networks. The time-triggered paradigm, adopted by many real-time protocols, was designed to cope with these demands. A cost-efficient way to implement this paradigm is to synthesize a static schedule that indicates the transmission times of all the time-triggered frames such that all requirements are met. Synthesizing this schedule can be seen as a bin-packing problem, known to be NPcomplete, with complexity driven by the number of frames. In the last years, requirements on the amount of data being transmitted and the scalability of the network have increased. A solution was proposed, adapting real-time switched Ethernet to benefit from its high bandwidth. However, it added more complexity in computing the schedule, since every frame is distributed over multiple links. Tools like Satisfiability Modulo Theory solvers were able to cope with the added complexity and synthesize schedules of industrial size networks. Despite the success of such tools, applications are appearing requiring embedded systems with even more complex networks. In the future, real-time embedded systems, such as large factory automation or smart cities, will need extremely large hybrid networks, combining wired and wireless communication, with schedules that cannot be synthesized with current tools in a reasonable amount of time. With this in mind, the first thesis goal is to identify the performance limits of Satisfiability Modulo Theory solvers in schedule synthesis. Given these limitations, the next step is to define and develop a divide and conquer approach for decomposing the entire scheduling problem in smaller and easy solvable subproblems. However, there are constraints that relate frames from different subproblems. These constraints need to be treated differently and taken into account at the start of every subproblem. The third thesis goal is to develop an approach that is able to synthesize schedules when different frame constraints related to different subproblems are inter-dependent. Last, is to define the requirements that the integration of wireless communication in hybrid networks will bring to the schedule synthesis and how to cope with the increased complexity. We demonstrate the viability of our approaches by means of evaluations, showing that our method is capable to synthesize schedules of hundred of thousands of frames in less than 5 hours.RetNet
19
McCulloch, Neil Andrew. "Neural network approaches to speech recognition and synthesis." Thesis, Keele University, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.387255.
Full text
20
Kokil, Akshay. "Conjugated Polymer Networks: Synthesis and Properties." online version, 2005. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=case1121451946.
Full text
21
Slevinsky, James Brent. "Synthesis of ring-based restorable networks." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0027/MQ40113.pdf.
Full text
22
Mehta, U. L. "Synthesis and optimisation multiphase reactor networks." Thesis, University of Manchester, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.504689.
Full text
23
Rahim, Mazin. "Neural networks in articulatory speech synthesis." Thesis, University of Liverpool, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.317191.
Full text
24
Liu, Ming. "Analysis and Synthesis of Boolean Networks." Licentiate thesis, KTH, Elektronik och Inbyggda System, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-177138.
Full textAbstract:
In this thesis, we present techniques and algorithms for analysis and synthesis of synchronous Boolean and multiple-valued networks. Synchronous Boolean and multiple-valued networks are a discrete-space discrete-time model of gene regulatory networks. Their cycle of states, called \emph{attractors}, are believed to give a good indication of the possible functional modes of the system. This motivates research on algorithms for finding attractors. Existing decision diagram-based approaches have limited capacity due to the excessive memory requirements of decision diagrams. Simulation-based approaches can be applied to large networks, however, their results are incomplete. In the first part of this thesis, we present an algorithm, which uses a SAT-based bounded model checking approach to find all attractors in a multiple-valued network. The efficiency of the presented algorithm is evaluated by analysing 30 network models of real biological processes as well as \num{35000} randomly generated 4-valued networks. The results show that our algorithm has a potential to handle an order of magnitude larger models than currently possible. One of the characteristic features of genetic regulatory networks is their inherent robustness, that is, their ability to retain functionality in spite of the introduction of random faults. In the second part of this thesis, we focus on the robustness of a special kind of Boolean networks called \emph{Balanced Boolean Networks} (BBNs). We formalize the notion of robustness and introduce a method to construct \emph{BBNs} for $2$-singleton attractors Boolean networks. The experiment results show that \emph{BBNs} are capable of tolerating single stuck-at faults. Our method improves the robustness of random Boolean networks by at least $13\%$ on average, and in some special case, up to $61\%$. In the third part of this thesis, we focus on a special type of synchronous Boolean networks, namely Feedback Shift Registers (FSRs). FSR-based filter generators are used as a basic building block in many cryptographic systems, e.g. stream ciphers. Filter generators are popular because their well-defined mathematical description enables a detailed formal security analysis. We show how to modify a filter generator into a nonlinear FSR, which is faster, but slightly larger, than the original filter generator. For example, the propagation delay can be reduced 1.54 times at the expense of 1.27\% extra area. The presented method might be important for applications, which require very high data rates, e.g. 5G mobile communication technology. In the fourth part of this thesis, we present a new method for detecting and correcting transient faults in FSRs based on duplication and parity checking. Periodic fault detection of functional circuits is very important for cryptographic systems because a random hardware fault can compromise their security. The presented method is more reliable than Triple Modular Redundancy (TMR) for large FSRs, while the area overhead of the two approaches are comparable. The presented approach might be important for cryptographic systems using large FSRs.QC 20151120
25
Anderson, Kimberley Lana. "Synthesis of functionalised, crosslinked polymer networks." Thesis, University of Strathclyde, 2016. http://digitool.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=27948.
Full textAbstract:
Crosslinked polymer networks that are largely insoluble and tolerant to various chemical environments are useful in solid-supported chemistries and as sorbents in chemical separation. The selective retention of organic pollutants is an area of environmental importance for the clean-up of contaminated water sources, and a family of ion-exchange hypercrosslinked polymer particles have recently been developed for use as mixed-mode solid phase extraction sorbents. Expanding this family of polymers will give rise to a greater range of materials with enhanced selectivity and capacity for specific analytes of environmental concern. This work is an investigation of methods to synthesise and functionalise crosslinked polymer networks with ion-exchange character. The approaches explored for the synthesis of crosslinked polymers containing aromatic rings bridged by methylene (–CH2) chains include phenol-formaldehyde inspired chemistry, precipitation polymerisation, and Friedel Crafts chemistry. Weak anion-exchange character was imparted by the introduction of tertiary amine groups through post-polymerisation chemical modification reactions. Furthermore, by utilising amino acid derived alkyl esters it was proposed that there could be potential to exploit the weak cation-exchange character of the deprotected carboxylic acid and harness and exploit zwitterionic character. The use of precipitation polymerisation to synthesise poly(divinylbenzene-co-vinylbenzyl chloride) yielded spherical particles of low polydispersity in the 2-5 μm size range, with tuneable particle size and porosity (0-740 m2/g). Subsequent hypercrosslinking using Friedel-Crafts chemistry produced microporous polymers with a high concentration of micropores and ultra-high specific surface areas (1,900 m2/g). Amino acid derived esters, including sarcosine methyl and ethyl esters, and the L- and D- enantiomers of phenylalanine methyl ester, were utilised in a post-polymerisation amination study to impart weak anion-exchange character into the polymers at a level of around 1 mmol/g. Through evaluation of the macroreticular and hypercrosslinked variants as mixed-mode solid phase-extraction sorbents for the extraction of spiked organic analytes from ultra-pure water, it was found that these sorbents possess additional and useful functionality that is distinct from the weak anion-exchange polymeric sorbents that have been reported previously.
26
Tong, Darren Pong-Choi. "Implementation of a protocol validation and synthesis system." Thesis, University of British Columbia, 1985. http://hdl.handle.net/2429/25061.
Full textAbstract:
VALISYN, an automated system for the validation and synthesis of error-free protocols has been implemented in C language. It assists designers in the detection and prevention of various kinds of potential design errors, such as state deadlocks, non-executable interactions, unspecified receptions and state ambiguities.
The technique employed is a stepwise application of a set of production rules which guarantee complete reception capability. These rules are implemented in a tracking algorithm, which prevents the formation of non-executable interactions and unspecified receptions, and which monitors the existence of state deadlocks and state ambiguities.
The implementation of VALISYN is discussed and a number of protocol validation and synthesis examples are presented to illustrate its use and features.Science, Faculty of
Computer Science, Department of
Graduate
27
Heefner, Jay Wilson. "Accelerator waveform synthesis." Scholarly Commons, 1988. https://scholarlycommons.pacific.edu/uop_etds/2168.
Full text
28
Morton, R. J. "Practical heat exchanger networks : capital cost, exchanger type and utilities." Thesis, University of Manchester, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239341.
Full text
29
Kim, Do Kyun. "Identifying Opinion Leaders by Using Social Network Analysis: A Synthesis of Opinion Leadership Data Collection Methods and Instruments." Ohio : Ohio University, 2007. http://www.ohiolink.edu/etd/view.cgi?ohiou1186672135.
Full text
30
Afeyan, Raffi Badrig. "A synthetic gene network architecture that propagates." Thesis, Boston University, 2014. https://hdl.handle.net/2144/10923.
Full textAbstract:
Thesis (Ph.D.)--Boston UniversitySynthetic biology is a field that is tending towards maturity. Synthetic gene networks are becoming increasingly more complex, and are being engineered with functional outcomes as design goals rather than just logical demonstration. As complex as circuits become, it is still a difficult process to build a functional gene network. Much work has been done to reduce DNA assembly time, but none specifically addresses the complexity ofproducing functional networks. To this end, we present a synthetic gene network assembly strategy that emphasizes characterization-driven iteration. The Plug- and-Play methodology allows for post-construction modification to circuits, which enables the simple swapping of parts. This type of modification makes it possible to tune circuits for troubleshooting, or even to repurpose networks. We used a specified set of restriction enzymes, a library of optimized parts and a compatible backbone vector system to preserve uniqueness of cloning sites and allow maintained post-construction access to the network. To demonstrate the system, we rapidly constructed a bistable genetic toggle and subsequently transformed it into two functionally distinct networks, a 3 and 4-node feed-forward loop. We also designed a synthetic gene network that can propagate signals across a population ofisogenic bacteria. We used the Plug-and-Play methodology to quickly construct an excitable system that toggles between sending and receiving states. We developed a spatial assay platform that could accommodate long-term, large-scale plating experiments so as to visualize the propagation effect on the centimeter scale. We built several iterations ofthe propagating network, probed the regulatory dynamics ofthe various nodes and identified problematic nodes. We took steps to address these nodes with both orthogonal transcription machinery as well as multiple modes of genetic regulation. We integrated the propagating networks with a DNA-damage sensitive triggering module. This opened up the gene network to potentially complex applications such as antibiotic sensing, or longer-distance communication experiments.
31
Zenteno, Efrain. "Vector Measurements for Wireless Network Devices." Licentiate thesis, KTH, Signalbehandling, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-111863.
Full textAbstract:
Wireless networks are an iconic technology of today’s modern era, theyare present in our daily activities as can be exemplified by cellular communications,wi-fi, bluetooth, and others. Vector measurements play an importantrole in the design, simulation, and testing of wireless networks and are usedto characterize key devices operating in the radio interface, such as amplifiers,filters, and mixers.Accurate characterization is the key for improving the capacity and efficiencyof wireless networks. As the demand for network capacity continuouslyincreases, the accuracy of vector measurements must also improve. Further,it is anticipated that such trends will continue in the years to come. Consequently,the wireless industry needs to include nonlinear behavior in theircharacterization and analysis, to assess and guaranty the operation of the devices,and to comply to the specifications from governmental regulations. Incontrast to linear behavior, nonlinear behavior presents an additional bandwidthrequirement because the signal bandwidth grows when it passes throughnonlinear devices. In this thesis, vector measurements for devices operatingin wireless networks are studied, emphasizing a synthetic approach for theinstrumentation. This approach enables the use of digital post-processing algorithms,which enhances the measurement accuracy and/or speed and canovercome hardware impairments. This thesis presents the design of a vectorialmeasurement system for wireless devices considering the aforementionedtrends and requirements. It also explores the advantages of the proposedapproach, describes its limitations, and discusses the digital signal processingalgorithms used to reach its final functionality. Finally, measurement resultsof the proposed setup are presented, analyzed and compared to those of modernindustrial instruments.QC 20130204
32
Sunderam, V. S. "A methodology for the synthesis of network protocol software." Thesis, University of Kent, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.372773.
Full text
33
Slisenko, O. V., I. M. Bei, and V. L. Budzinska. "Synthesis and characterization of Polyacrylamide / Siloxane Double Network Hydrogels." Thesis, Sumy State University, 2015. http://essuir.sumdu.edu.ua/handle/123456789/42515.
Full textAbstract:
A novel double-network (DN) hydrogels consisting of organic polyacrylamide (PAAm) network and inorganic siloxane network were synthesized by one-pot in situ polymerization. Spectral studies indicate a formation of DN structure of composite hydrogels obtained. Detailed study of the composites showed welldefined structurizing of hybrid hydrogels at molecular and nanolevel as well as intra- and intercomponent
interactions via H-bonding. Nanostructurization possesses a great impact on final properties of the composite hydrogels. Prepared materials are characterized by improved thermal stability and hydrophilicity. Swelling degree of hybrid composite hydrogels depends on components ratio and reaches 2700 %.
34
Filloy-García, Enrique Rafael. "A hierarchically organised genetic algorithm for fuzzy network synthesis." Thesis, University of Edinburgh, 2002. http://hdl.handle.net/1842/23345.
Full textAbstract:
A hierarchical, two-level genetic algorithm to produce the rules for a fuzzy system is proposed. The underlying architecture of fuzzy networks corresponds with the structured, two-level representations used. At one level, a variable-length structure was designed to represent entire rule sets as individuals in a population; at a lower level, another population contains elements which represent single fuzzy rules. The two populations co-evolve simultaneously in an interdependent fashion. This method has been shown to be capable of producing effective fuzzy systems of an adequate size for particular classes of problems; examples of a control task and a classification problem are shown. Suitable replacement strategies for the elements population were devised, introducing the definition of a heredity factor. Additionally, means for the adaptation of system parameters like cut & splice probabilities were developed to further enhance system performance.
35
Higgs, Paul G. "Biological and synthetic polymer networks." Thesis, University of Cambridge, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.306415.
Full text
36
Bhojwani, Praveen Sunder. "Communication synthesis of networks-on-chip (noc)." [College Station, Tex. : Texas A&M University, 2007. http://hdl.handle.net/1969.1/ETD-TAMU-2022.
Full text
37
Chai, Qinyuan. "Synthesis and Characterization of Ionically Crosslinked Networks." University of Akron / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=akron1367939178.
Full text
38
Msiza, Andrew Khutso. "Hybrid synthesis method for mass exchange networks." Master's thesis, University of Cape Town, 2001. http://hdl.handle.net/11427/5434.
Full textAbstract:
Bibliography: leaves 121-[123].Process synthesis can be approached from three techniques: heuristics, physical and thermodynamic insight, and mathematical programming. Hybrid methods where two or all of the synthesis methods are combined are now becoming used, taking advantage of the combined strength of the individual techniques. In this thesis the option of combining pinch analysis (a physical and thermodynamic insight-based approach) and superstructure-based programming is explored.
39
Conway, Stephen Malcolm. "Vowel synthesis using feed-forward neural networks." Thesis, University of Edinburgh, 1994. http://hdl.handle.net/1842/19643.
Full textAbstract:
This thesis is an investigation into the ability of artificial neural networks to learn to map from a symbolic representation of CVC triphones to a continuous representation of vowel formant tracks, and the influence of a number of factors on that ability. This mapping is interesting because, apart from being a necessary part of any text to speech system and not having any accepted definitive solution, it is from a discrete symbolic representation to a continuous non-symbolic representation. Neural networks provide one method of automatically learning such mappings and prove to be capable of doing so in this particular case. The input representation used appears to have little effect on the performance of the neural networks. A feature based representation does no better than a 1-of-n coding of the phonemes. The representation of the vowel formant tracks, produced as output of the neural networks, has a far greater effect on performance. Simple representations consisting of the initial, central and final frequencies of the formant tracks out-perform polynomial and Fourier coefficient representations which encode more information about the shape of the formant tracks. The back-propagation and conjugate gradient neural network training algorithms produced neural networks with similar performance, and the use of cross-validation made no difference in generalisation (although the cross-validation data set was far too small). Interestingly, neural networks with no hidden layer proved to be as capable of learning the mapping as those with a hidden layer, indicating that the mapping is not substantially non-linear.
40
Yan, Shan. "Synthesis of application-specific on-chip networks." Diss., [La Jolla] : University of California, San Diego, 2009. http://wwwlib.umi.com/cr/ucsd/fullcit?p3360452.
Full textAbstract:
Thesis (Ph. D.)--University of California, San Diego, 2009.Title from first page of PDF file (viewed July 23, 2009). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 96-103).
41
Näslund, Per. "Artificial Neural Networks in Swedish Speech Synthesis." Thesis, KTH, Tal-kommunikation, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-239350.
Full textAbstract:
Text-to-speech (TTS) systems have entered our daily lives in the form of smart assistants and many other applications. Contemporary re- search applies machine learning and artificial neural networks (ANNs) to synthesize speech. It has been shown that these systems outperform the older concatenative and parametric methods. In this paper, ANN-based methods for speech synthesis are ex- plored and one of the methods is implemented for the Swedish lan- guage. The implemented method is dubbed “Tacotron” and is a first step towards end-to-end ANN-based TTS which puts many differ- ent ANN-techniques to work. The resulting system is compared to a parametric TTS through a strength-of-preference test that is carried out with 20 Swedish speaking subjects. A statistically significant pref- erence for the ANN-based TTS is found. Test subjects indicate that the ANN-based TTS performs better than the parametric TTS when it comes to audio quality and naturalness but sometimes lacks in intelli- gibility.Talsynteser, också kallat TTS (text-to-speech) används i stor utsträckning inom smarta assistenter och många andra applikationer. Samtida forskning applicerar maskininlärning och artificiella neurala nätverk (ANN) för att utföra talsyntes. Det har visats i studier att dessa system presterar bättre än de äldre konkatenativa och parametriska metoderna. I den här rapporten utforskas ANN-baserade TTS-metoder och en av metoderna implementeras för det svenska språket. Den använda metoden kallas “Tacotron” och är ett första steg mot end-to-end TTS baserat på neurala nätverk. Metoden binder samman flertalet olika ANN-tekniker. Det resulterande systemet jämförs med en parametriskt TTS genom ett graderat preferens-test som innefattar 20 svensktalande försökspersoner. En statistiskt säkerställd preferens för det ANN- baserade TTS-systemet fastställs. Försökspersonerna indikerar att det ANN-baserade TTS-systemet presterar bättre än det parametriska när det kommer till ljudkvalitet och naturlighet men visar brister inom tydlighet.
42
Egan, Nicholas R. (Nicholas Ryan). "Natural video synthesis with Generative Adversarial Networks." Thesis, Massachusetts Institute of Technology, 2019. https://hdl.handle.net/1721.1/123076.
Full textAbstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019Cataloged from PDF version of thesis.
Includes bibliographical references (pages 71-74).
Generative Adversarial Networks (GANs) are the state of the art neural network models for image generation, but the use of GANs for video generation is still largely unexplored. This thesis introduces new GAN based video generation methods by proposing the technique of model inflation and the segmentation-to-video task. The model inflation technique converts image generative models into video generative models, and experiments show that model inflation improves training speed, training stability, and output video quality. The segmentation-to-video task is that of turning an input image segmentation mask into an output video matching that segmentation. A GAN model was created to perform this task, and its usefulness as a creative tool was demonstrated.
by Nicholas R. Egan.
M. Eng.
M.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
43
Tan, Yin Ling. "Synthesis of heat integrated resource conservation networks." Thesis, Curtin University, 2013. http://hdl.handle.net/20.500.11937/1999.
Full textAbstract:
Huge amount of energy and fresh resources (i.e. water, chemicals, solvents) are consumed by process industries to achieve the desired product throughput and quality. The current drive toward sustainability and business competitiveness has driven the process industries to effectively use these resources. Thus, resource conservation activities have become the centre of attention as compared to conventional end-of-pipe waste treatment system. Process integration has been commonly used as an effective tool for resource conservation and waste reduction. One of the most established areas of process integration is concentration- and property-based resource conservation networks (RCNs). Most works in RCNs synthesis do not consider temperature as part of process constraints. However, in many cases, temperature is an important design parameter. Thus, simultaneous consideration of mass/property and heat recovery should be addressed. Earlier works in this area have been mainly focusing on heat integrated water networks (HIWNs).However, these methods cannot be applied for property-based RCNs, as they are limited to “chemo-centric” system. Clearly, a more generic approach is needed for the synthesis of concentration- and property-based heat integrated resource conservation networks (HIRCNs). This thesis presents novel and generic methodologies for the synthesis of concentration- and property-based HIRCNs with variable operating parameters (i.e. flowrates, temperatures and properties). Firstly, a new generic overall methodology for concentration- and property-based HIRCNs is established. Next, a general framework for synthesis of HIRCNs with and without heat of mixing is presented. Based on this framework, new methodology for the synthesis of HIRCNs with and without heat of mixing are established respectively. Moreover, a revised floating pinch method is developed for utilities targeting in heat exchanger networks (HENs) with varying temperature range, and it is incorporated in the new methodologies for the synthesis of HIRCNs with and without heat of mixing. Various case studies are solved to illustrate the developed methodologies.
44
Hamwi, Khawla. "Low Power Design Methodology and Photonics Networks on Chip for Multiprocessor System on Chip." Thesis, Brest, 2013. http://www.theses.fr/2013BRES0029.
Full textAbstract:
Les systèmes multiprocesseurs sur puce (MPSoC)s sont fortement émergent comme principaux composants dans les systèmes embarqués à hautes performances. La principale complexité dans la conception et l’implémentation des MPSoC est la communication entre les cœurs. Les réseaux sur puce (NoC) sont considérés comme la solution pour cet effet. ITRS prédit que des centaines de cœurs seront utilisées dans la génération future de système sur puce (SoC), ce qui va donc augmenter les coûts de l’évolutivité, de bande passante et de l’implémentation des réseaux sur puce (NoC)s. Ces problèmes sont présents dans diverses tendances technologiques dans le domaine des semiconducteurs et de la photonique. Cette thèse préconise l'utilisation de la synthèse NoC comme l'approche la plus appropriée pour exploiter ces tendances technologiques et rattraper les exigences des applications. A partir de plusieurs méthodologies de conception basées sur la technologie FPGA et des techniques d'estimation basse énergie (HLS) pour plusieurs IPs, nous proposons une implémentation ASIC basée sur la technologie 3D Tezzaron. Multi-FPGA technologie est utilisée pour valider la conception MPSoC avec 64 processeurs Butterfly NoC. La synthèse NoC est basée sur le regroupement de maîtres et d’esclaves générant des architectures asymétriques avec un soutien approprié pour les demandes très haut débit par optique NoC (ONoC), tandis que les demandes de bande passante inférieure sont traitées par électronique NoC. Une programmation linéaire est proposée comme une solution pour la synthèse NoCMultiprocessor systems on chip (MPSoC)s are strongly emerging as main components in high performance embedded systems. Several challenges can be determined in MPSoC design like the challenge which comes from interconnect infrastructure. Network-on-Chip (NOC) with multiple constraints to be satisfied is a promising solution for these challenges. ITRS predicts that hundreds of cores will be used in future generation system on chip (SoC) and thus raises the issue of scalability, bandwidth and implementation costs for NoCs. These issues are raised within the various technological trends in semiconductors and photonics. This PhD thesis advocates the use of NoC synthesis as the most appropriate approach to exploit these technological trends catch up with the applications requirements. Starting with several design methodologies based on FPGA technology and low power estimation techniques (HLS) for several IPs, we propose an ASIC implementation based on 3D Tezzaron technology. Multi-FPGA technology is used to validate MPSoC design with up to 64 processors with Butterfly NoC. NoC synthesis is based on a clustering of masters and slaves generating asymmetric architectures with appropriate support for very high bandwidth requests through Optical NoC (ONoC) while lower bandwidth requests are processed by electronic NoC. A linear programming is proposed as a solution to the NoC synthesis
45
Fredriksson, Mattias. "Tree structured neural network hierarchy for synthesizing throwing motion." Thesis, Blekinge Tekniska Högskola, Institutionen för datavetenskap, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-20812.
Full textAbstract:
Realism in animation sequences requires movements to be adapted to changing environments within the virtual world. To enhance visual experiences from animated characters, research is being focused on recreating realistic character movement adapted to surrounding environment within the character's world. Existing methods as applied to the problem of controlling character animations are often poorly suited to the problem as they focus on modifying and adapting static sequences, favoring responsiveness and reaching the motion objective rather than realism in characters movements. Algorithms for synthesizing motion sequences can then bridge the gap between motion quality and responsiveness, and recent methods have shown to open the possibility to recreate specific motions and movement patterns. Effectiveness of proposed methods to synthesize motion can however be questioned, particularly due to the sparsity and quality of evaluations between methods. An issue which is further complicated by variations in learning tasks and motion data used to train models. Rather than directly propose a new synthesis method, focus is put on refuting existing methods by applying them to the task of synthesizing objective-oriented motion involving the action of throwing a ball. To achieve this goal, two experiments are designed. The first experiment evaluates if a phase-functioned neural network (PFNN) model based on absolute joint configurations can generate objective oriented motion. To achieve this objective, a separate approach utilizing a hierarchy of phase-function networks is designed and implemented. By comparing application of the two methods on the learning task, the proposed hierarchy model showed significant improvement regarding the ability to fit generated motion to intended end effector trajectories. To be able to refute the idea of using dense feed-forward neural networks, a second experiment is performed comparing PFNN and feed-forward based network hierarchies. Outcome from the experiment show significant differences in favor for the hierarchy model utilizing phase-function networks. To facilitate experimentation, objective oriented motion data for training network models are obtained by researching and implementing methods for processing optical motion capture data over repeated practices of over-arm ball throws. Contribution is then threefold: creation of a dataset containing motion sequences of ball throwing actions, evaluation of PFNN on the task of learning sequences of objective oriented motion, and definition of a hierarchy based neural network model applicable to the motion synthesis task.
46
Ali, Baraa Saeed. "HIGH LEVEL SYNTHSIS FOR A NETWORK ON CHIP TOPOLOGY." OpenSIUC, 2013. https://opensiuc.lib.siu.edu/theses/1079.
Full textAbstract:
Network on chips (NoCs) have emerged as a panacea to solve many intercommunication issues that are imposed by the fast growing of VLSI design. NOC have been deployed as a solution for the communication delay between cores, area overhead, power consumption, etc. One of the leading parameters of speeding up the performance of system on chips (SOCs) is the efficiency of scheduling algorithms for the applications running on a SOC. In this thesis we are arguing that a global scheduling view can significantly improve latency in NoCs. This view can be achieved by having the NoC nodes communicate with each other in a predefined application-based fashion; by calculating in advance how many clock cycles the nodes need to execute and transmit packets to the network and how many clock cycles are needed for the packets to travel all the way to the destination through routers (including queuing delay). By knowing that, we could keep some of the cores stay in "Hold-On" state until the right time comes to start transmitting. This technique could lead to reduced congestion and it may guarantee that the cores do not suffer from severe resource contention, e.g. accessing memory. This task is achieved by using a network simulator (such as OPNET) and gathering statistics, so the worst case latency can be determined. Therefore, if NoC nodes can somehow postpone sending packets in a way that does not violate the deadline of their tasks, packet dropping or livelock can be avoided. It is assumed that the NoC nodes here need buffers of their own in order to hold the ready-to-transmit packets and this can be the cost of this approach.
47
Boyle, Patrick M. "Network-Scale Engineering: Systems Approaches to Synthetic Biology." Thesis, Harvard University, 2012. http://dissertations.umi.com/gsas.harvard:10298.
Full textAbstract:
The field of Synthetic Biology seeks to develop engineering principles for biological systems. Modular biological parts are repurposed and recombined to develop new synthetic biological devices with novel functions. The proper functioning of these devices is dependent on the cellular context provided by the host organism, and the interaction of these devices with host systems. The field of Systems Biology seeks to measure and model the properties of biological phenomena at the network scale. We present the application of systems biology approaches to synthetic biology, with particular emphasis on understanding and remodeling metabolic networks. Chapter 2 demonstrates the use of a Flux Balance Analysis model of the Saccharomyces cerevisiae metabolic network to identify and construct strains of S. cerevisiae that produced increased amounts of formic acid. Chapter 3 describes the development of synthetic metabolic pathways in Escherichia coli for the production of hydrogen, and a directed evolution strategy for hydrogenase enzyme improvement. Chapter 4 introduces the use of metabolomic profiling to investigate the role of circadian regulation in the metabolic network of the photoautotrophic cyanobacterium Synechococcus elongatus PCC 7942. Together, this work demonstrates the utility of network-scale approaches to understanding biological systems, and presents novel strategies for engineering metabolism.
48
Ghedamsi, Abderrazak. "A Petri-net-based graphical system for network protocol synthesis." Thesis, University of Ottawa (Canada), 1987. http://hdl.handle.net/10393/5452.
Full text
49
Wang, Chenyu Jr. "Synthesis of crosslinked polyurethane and Network constrained surface phase separation." VCU Scholars Compass, 2011. http://scholarscompass.vcu.edu/etd/2630.
Full textAbstract:
To create functional surfaces for soft materials, such as polyurethanes, our approach is to use a semifluorinated surface modifier as minor component to the matrix material. The surface modifier, driving by reduction in surface energy, surface-concentrates to form a functionalized surface layer at the air-polymer interface. In our previous studies, linear PTMO-based polyurethanes were used as the matrix material. These systems undergo slow surface phase separation at room temperature due to the thermodynamically immiscibility of the soft blocks. In this study, chemically crosslinked matrix was developed to provides a steric hindrance to constrain the mobility of surface modifier and to form a kinetically stable surface. The physical property and morphology of base crosslinked matrix has been characterized using DSC, UTT, DMA and AFM. The surface morphology of surface modified crosslinked matrix has been characterized using AFM, DCA and XPS.
50
Yang, Rupu. "Methodology for developing flexible, controllable and cost-effective heat exchanger network." Thesis, Université Paris sciences et lettres, 2020. http://thesesprivees.mines-paristech.fr/2020/2020UPSLM011_archivage.pdf.
Full textAbstract:
Cette thèse a pour objectif de considérer les performances dynamiques d’un réseau d'échangeurs de chaleur (HEN) lors de sa conception. Nous définissons le temps de transition (TT) comme un indicateur pour mesurer les performances dynamiques lorsque le HEN subit des variations opérationnelles. La thèse vise à résoudre deux problèmes: comment estimer le TT d'un HEN donné; et comment réaliser la conception pour optimiser le coût du HEN, ce qui nous permet d'obtenir un compromis entre le coût et le TT. En nous appuyant sur la transformation de Laplace, nous développons une formulation mathématique pour déterminer TT, et cela conduit à deux modèles dynamiques. Le modèle de base nécessite le processus de transformation inverse de Laplace. Le deuxième modèle, plus avancé, est basé sur des développements purement analytiques afin d’éviter la difficulté numérique de la transformation inverse de Laplace. Les méthodes de synthèse suivent l'approche séquentielle multi-période pour itérer différentes structures, puis le TT peut être calculé pour chaque HEN optimisé en coût. Nous proposons deux méthodes d'itération: BINLP pour le petit cas et IINLP pour les problèmes de moyenne à grande échelle. Les méthodes de synthèse et les modèles dynamiques HEN ont été appliqués avec succès dans cinq études de cas à travers différents chapitres, et nous constatons que le TT varie énormément selon les structures testés. Il est important de prendre en compte le temps de transition dans le problème de conception de HEN, et nos méthodes proposées peuvent servir d'outil de présélection pour aider à trier des HEN en termes de coût et de performances dynamiquesThis thesis pioneers to consider the time response in the heat exchanger network (HEN) multi-period design problem. We define the transition time (TT) as an indicator to measure the dynamic performance when HEN gets an operational period changeover. The thesis aims to solve two problems: how to measure the TT of a given HEN; and how to carry out synthesis work to optimize the HEN cost, allowing us to obtain a trade-off between the cost and TT. Relying on the Laplace transform, we develop a mathematical formulation to reach TT, leading to two dynamic models. The basic one requires the inverse Laplace transform process during the calculation. The improved dynamic model follows the analytic way, and free of the concern of the numerical difficulty of the inverse Laplace transform. The synthesis methods follow the sequential approach to iterate various structures and then TT can be calculated for each cost-optimized HEN. We propose two iteration methods: BINLP for the small case and IINLP for medium-large scale problems. The synthesis methods and HEN dynamic models were applied successfully in five case studies through different chapters, and found that TT varied hugely for different designs in each case. It is important to consider the time response in the HEN design problem, and our proposed methods can act as a pre-selection tool to help sort out those designs in terms of the cost and dynamic performances