Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Placement system.
Dissertationen zum Thema „Placement system“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Placement system" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
1
Barrow, John H. „Revising the BGSU Mathematics Placement System“. Bowling Green State University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1245699733.
Der volle Inhalt der Quelle
2
SANTOS-MENDES, RAFAEL. „Synthese de regulateurs robustes a placement de poles“. Toulouse 3, 1988. http://www.theses.fr/1988TOU30148.
Der volle Inhalt der QuelleAnnotation:
On propose une methode de synthese des regulateurs robustes par rapport a des erreurs de modelisation. On definit une fonction de mesure de robustesse pour un regulateur donne et que l'on calcule grace a un algorithme iteratif maximisant la robustesse finale obtenue. On donne des exemples d'application pratique
3
Guethler, Raymond M. IV. „Optimization of passive coherent receiver system placement“. Thesis, Monterey California: Naval Postgraduate School, 2013. http://hdl.handle.net/10945/37634.
Der volle Inhalt der QuelleAnnotation:
Approved for public release; distribution is unlimitedPassive coherent receiver systems are a form of non-monostatic radar (NMR) that use active emitters of opportunity (digital television, cell phone systems, and other types of emissions) as a source of reflected target energy. These systems, used within both the military and public sectors, require specific information in order to be placed properly relative to emitters of opportunity and the desired area of detection/coverage. This thesis refines and presents a method of deriving optimal NMR placement, taking into account such variables as spreading loss and terrain data. This also includes optimal placement in a dynamic electromagnetic environment, when one or more of the emitters of opportunity cease transmission/are shut down for maintenance. The majority of the modeling utilizes Matrix Laboratory (MATLAB) to generate signal strength plots which can be applied toward predicting the optimal location for passive receiver placement, as well as where detection hole/voids may be present. MATLAB was used to model the signal-to-noise ratios presented by varying the number and location of receivers. These simulations provide an analytic means to estimate the optimal placement of assets to maximize coverage for a particular geographic area.
4
Sharma, Ankur Kumar. „VPLACEMENT: Contention Aware Virtual Machine Placement System“. Research Showcase @ CMU, 2014. http://repository.cmu.edu/theses/60.
Der volle Inhalt der QuelleAnnotation:
Maximizing the number of cohosted virtual machines (VMs) while still maintaining the desired performance level is a critical goal in cloud. As we pack more virtual machines on a physical machine (PM), the resource contention increases, thereby affecting the response time. This virtual machine placement problem has been vastly studied and most of effort has been in either allocating more resources to virtual machines (resizing) or migrating them to a higher capacity PM based on the resource demand estimation. Studies have also shown that in the presence of resource contention the resource demand estimation mechanisms could predict more resource requirement than actually needed. Hence deciding virtual machine placement and allocated resources based on utilization estimation could lead to inefficient usage of PM resources. We propose a novel approach to solve this problem which focuses on overall application response time rather than individual virtual machines. Large scale applications are deployed as multi-tier components. These components interact with each other so that application can perform its task. Our placement algorithm uses the dependency relationship between these components to understand application response time behavior. Our solution focuses on reducing the performance degradation because of resource contention. We propose a VM placement system termed as Vplacement. This system uses the traffic analysis to understand the dependency relationship between application components. This dependency relationship and traffic analysis provides some vital iii data like impact of component processing time on application response time, the probability of resource contention between a pair of component nodes (coArrival Probability) etc. The impact and coarrival probability is used by the placement engine of Vplacement to minimize the degradation of application performance because of resource contention by cohosting the low impact component nodes together.
5
Brinkman, Kevin Michael, Sandra Araiza, Dalton Hirst, Fermin Prieto, Alejandro Thompson, Kevin Michael Brinkman, Sandra Araiza, Dalton Hirst, Fermin Prieto und Alejandro Thompson. „Nasogastric Tube Placement Verification System: Final Report“. Thesis, The University of Arizona, 2017. http://hdl.handle.net/10150/624927.
Der volle Inhalt der QuelleAnnotation:
The Nasogastric Tube Placement Verification System was designed to determine the proper
placement of a nasogastric tube in the stomach for tube feeding. Every year, many fatalities
occur due to misplacement of nasogastric tubes. Current verification methods include X-ray and
indirect verification. These methods are either expensive or inaccurate, and require a medical
professional, creating a great need for a system that accurately indicates the correct placement
of the tube in the stomach. The team designed a sensor, based on galvanic cell
electrochemistry, that recognizes the acidic stomach environment. As the sensor enters the
stomach, a chemical reaction produces a current that correlates to the pH of the solution. This
current is processed by a microcontroller and indicates to the user whether the tube has been
correctly placed. This system is specific, cost-efficient, and easy to use, allowing caregivers
outside of the hospital to properly feed their patients.
6
Karnagel, Tomas. „Heterogeneity-Aware Placement Strategies for Query Optimization“. Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-225613.
Der volle Inhalt der QuelleAnnotation:
Computing hardware is changing from systems with homogeneous CPUs to systems with heterogeneous computing units like GPUs, Many Integrated Cores, or FPGAs. This trend is caused by scaling problems of homogeneous systems, where heat dissipation and energy consumption is limiting further growths in compute-performance. Heterogeneous systems provide differently optimized computing hardware, which allows different operations to be computed on the most appropriate computing unit, resulting in faster execution and less energy consumption.
For database systems, this is a new opportunity to accelerate query processing, allowing faster and more interactive querying of large amounts of data. However, the current hardware trend is also a challenge as most database systems do not support heterogeneous computing resources and it is not clear how to support these systems best. In the past, mainly single operators were ported to different computing units showing great results, while missing a system wide application. To efficiently support heterogeneous systems, a systems approach for query processing and query optimization is needed.
In this thesis, we tackle the optimization challenge in detail. As a starting point, we evaluate three different approaches on isolated use-cases to assess their advantages and limitations. First, we evaluate a fork-join approach of intra-operator parallelism, where the same operator is executed on multiple computing units at the same time, each execution with different data partitions. Second, we evaluate using one computing unit statically to accelerate one operator, which provides high code-optimization potential, due to this static and pre-known usage of hardware and software. Third, we evaluate dynamically placing operators onto computing units, depending on the operator, the available computing hardware, and the given data sizes. We argue that the first and second approach suffer from multiple overheads or high implementation costs. The third approach, dynamic placement, shows good performance, while being highly extensible to different computing units and different operator implementations.
To automate this dynamic approach, we first propose general placement optimization for query processing. This general approach includes runtime estimation of operators on different computing units as well as two approaches for defining the actual operator placement according to the estimated runtimes. The two placement approaches are local optimization, which decides the placement locally at run-time, and global optimization, where the placement is decided at compile-time, while allowing a global view for enhanced data sharing. The main limitation of the latter is the high dependency on cardinality estimation of intermediate results, as estimation errors for the cardinalities propagate to the operator runtime estimation and placement optimization. Therefore, we propose adaptive placement optimization, allowing the placement optimization to become fully independent of cardinalities estimation, effectively eliminating the main source of inaccuracy for runtime estimation and placement optimization. Finally, we define an adaptive placement sequence, incorporating all our proposed techniques of placement optimization. We implement this sequence as a virtualization layer between the database system and the heterogeneous hardware. Our implementation approach bases on preexisting interfaces to the database system and the hardware, allowing non-intrusive integration into existing database systems. We evaluate our techniques using two different database systems and two different OLAP benchmarks, accelerating the query processing through heterogeneous execution.
7
Kooper, Laurence Stanley. „A composite information system for the Sloan Placement Office“. Thesis, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/61048.
Der volle Inhalt der Quelle
8
Nilsson, Marcus, und Alexander Westring. „A decision support system for an improved article placement“. Thesis, Linköpings universitet, Kommunikations- och transportsystem, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-141688.
Der volle Inhalt der QuelleAnnotation:
Warehouse storage is an important part of a business supply chain. This is where articles temporary are stored before they either are carried on to the next step of the production or to be delivered to the customers of the company. The largest part of the stock keeping often devoted to the order picking. Order picking includes the activities that are occurring when an article is being picked from its stored position and is being transported to the next step of the flow of the materials. The most time- consuming part of the order picking process are often the time to pinpoint and to get the hold of an article. This implies quite likely that an enhancement of the productivity could be realized, inter alia, through cut the transport distances. SKF Mekan AB is an industrial corporation whose primary occupation is to manufacture bearing housings. Currently, the business has a flawed inventory for stock keeping. A great many of the articles stored in the inventory, entitled 104C, are placed in regard to their measures, without any thought in regard of how frequently the articles are picked. In addition, the article placement that is used today is outdated, which has resulted in that a lot of articles are lacking a specific placement in the inventory. The purpose of storing articles in the inventory 104C is to cope with fluctuations in the next step of the manufacturing, which is the processing factory. The aim of the study is to find out how the article placement looks in the current situation and how decisions concerning article placement are determined and what issues occurs due to this. A decision support system has been developed which purpose is to give SKF Mekan AB decision basis regarding where the different kinds of articles should be placed to attain an increased efficiency in business stock keeping. The decision support system is adaptable to the extent that the user can adjust the parameters that are determining the article placement. The study has been accomplished by means of observations and interviews. With the help of the observations, the layout of the warehouse and the article placement has been mapped out and with the help of the interviews; the results concerning work models and decision-making of article placement has been answered. Through the observations and the interviews appeared that 42.5 % of the stocked pallets were misplaced and that 15.6 % of the stocked pallets lacked a specific placement in the warehouse. This results in that the truck operators has a hard time localizing the pallets, which leads to inefficient labouring. This causes delays in the next step of the supply chain; i. e. the processing factory, meaning the personnel has to wait for the articles to be delivered. With the articles picking frequency and the principle of family grouping as point of reference for the article placement SKF Mekan AB should be able to eliminate non-value adding activities in the supply chain, which should lead to an increased potential of profitability.
9
Sankar, Sandhya. „INTELLIGENT PLACEMENT OF METERS/SENSORS FOR SHIPBOARD POWER SYSTEM ANALYSIS“. MSSTATE, 2008. http://sun.library.msstate.edu/ETD-db/theses/available/etd-09102007-140439/.
Der volle Inhalt der QuelleAnnotation:
Real time monitoring of the shipboard power system is a complex task to address. Unlike the terrestrial power system, the shipboard power system is a comparatively smaller system but with more complexity in terms of its system operation. This requires the power system to be continuously monitored to detect any type of fluctuations or disturbances. Planning metering systems in the power system of a ship is a challenging task not only due to the dimensionality of the problem, but also due to the need for reducing redundancy while improving network observability and efficient data collection for a reliable state estimation process. This research is geared towards the use of a Genetic Algorithm for intelligent placement of meters in a shipboard system for real time power system monitoring taking into account different system topologies and critical parameters to be measured from the system. The algorithm predicts the type and location of meters for identification and collection of measurements from the system. The algorithm has been tested with several system topologies.
10
Silva, Aguinaldo Silveira e. „Placement and control of static compensators for power system stability“. Thesis, University of Manchester, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.311620.
Der volle Inhalt der Quelle
11
Silveira, e. Silva Aguinaldo. „Placement and control of static compensators for power system stability“. reponame:Repositório Institucional da UFSC, 1990. http://repositorio.ufsc.br/xmlui/handle/123456789/75626.
Der volle Inhalt der Quelle
12
Hallqvist, Kristoffer. „Dynamic label placement for moving objects“. Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-201632.
Der volle Inhalt der QuelleAnnotation:
In command and control systems, for example air traffic control, operators must view many moving objects simultaneously. Graphical labels that identify objects move along with them, and for readability it is important that such labels do not overlap or hop around erratically as objects come close to each other. Instead, the labels should smoothly revolve around their objects. The goal of this thesis is to explore label placement strategies for moving objects that avoid overlap and hopping effects. In this thesis, we consider a simplified problem, in which time is coarsely discretized and each label is of a fixed size and can only be displayed in a limited number of distinct positions relative to its corresponding object. An optimal and a reactive heuristic algorithm are developed and applied to a number of test cases, which are then analysed for different statistical measures. In a scene with 25 objects traveling across a common area, the reactive algorithm is on average able to keep approximately half of the labels visible the whole time, whereas the optimal algorithm could only be applied to test cases with at most four objects. A prediction mechanism is implemented that on average decreases the number of times labels alternate between being hidden and visible. Future work could investigate how users perceive the usability of a system implementing the reactive algorithm.I lednings- och övervakningssystem för t.ex. flygtrafik måste operatörer hålla uppsikt på flera rörliga objekt samtidigt. För att kunna identifiera objekten visas de tillsammans med grafiska etiketter som följer dem åt, och för att det ska gå att läsa etiketterna ordentligt är det viktigt att de inte överlappar eller gör hastiga oförutsägbara rörelser när objekt närmar sig varandra. Istället bör etiketterna röra sig mjukt runt sina respektive objekt. Målet med detta arbete är att utforska strategier för att placera etiketter till rörliga objekt på ett sådant sätt att överlapp och hastiga oförutsägbara rörelser undviks. I arbetet behandlas ett förenklat problem där tiden är grovt diskretiserad och varje etikett har en förutbestämd storlek och enbart kan visas på ett begränsat antal platser i förhållande till objektet den tillhör. En optimal och en reaktiv heuristisk algoritm utvecklas och tillämpas på ett antal testfall som sedan analyseras för mätdata. I en vy med 25 objekt som färdas genom ett gemensamt område klarar den reaktiva algoritmen i genomsnitt att behålla ungefär hälften av etiketterna synliga hela tiden, medan den optimala algoritmen endast kunde tillämpas på testfall med som mest fyra objekt. En förutsägelsemekanism implementeras och lyckas i många fall förhindra att etiketterna växlar mellan att vara dolda och synliga. Framtida arbete skulle kunna utreda hur användare upplever användbarheten av en praktisk tillämpning som använder den reaktiva algoritmen.
13
Suwit, Pulthasthan Information Technology & Electrical Engineering Australian Defence Force Academy UNSW. „Optimal placement of sensor and actuator for sound-structure interaction system“. Awarded by:University of New South Wales - Australian Defence Force Academy. School of Information Technology and Electrical Engineering, 2006. http://handle.unsw.edu.au/1959.4/38741.
Der volle Inhalt der QuelleAnnotation:
This thesis presents the practical and novel work in the area of optimal placement of actuators and sensors for sound-structure interaction systems. The work has been done by the author during his PhD candidature. The research is concentrated in systems with non-ideal boundary conditions as in the case in practical engineering applications. An experimental acoustic cavity with five walls of timber and a thin aluminium sheet fixed tightly on the cavity mouth is chosen in this thesis as a good representation of general sound-structure interaction systems. The sheet is intentionally so fixed that it does not satisfy ideal boundary conditions. The existing methods for obtaining optimal sensor-actuator location using analytic models with ideal boundary conditions are of limited use for such problem with non-ideal boundary conditions. The method presented in this thesis for optimal placement of actuators and sensors is motivated by energy based approach and model uncertainty inclusion. The optimal placement of actuator and sensor for the experimental acoustic cavity is used to construct a robust feedback controller based on minimax LQG control design method. The controller is aimed to reduce acoustic potential energy in the cavity. This energy is due to the structure-borne sound inside the sound-structure interaction system. Practical aspects of the method for optimal placement of actuator and sensors are highlighted by experimental vibration and acoustic noise attenuation for arbitrary disturbance using feedback controllers with optimal placement of actuator and sensor. The disturbance is experimentally set to enter the system via a spatial location different from the controller input as would be in any practical applications of standard feedback disturbance rejections. Experimental demonstration of the novel methods presented in this thesis attenuate structural vibration up to 13 dB and acoustic noise up to 5 dB for broadband frequency range of interest. This attenuation is achieved without the explicit knowledge of the model of the disturbance.
14
Wu, Yang. „Improved measurement placement and topology processing in power system state estimation“. [College Station, Tex. : Texas A&M University, 2007. http://hdl.handle.net/1969.1/ETD-TAMU-1925.
Der volle Inhalt der Quelle
15
Peter, Shaun K. „A Performance Driven Placement System Using an Integrated Timing Analysis Engine“. University of Cincinnati / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1406820542.
Der volle Inhalt der Quelle
16
Ding, Qifeng. „Optimal meter placement and transaction-based loss allocation in deregulated power system operation“. Texas A&M University, 2004. http://hdl.handle.net/1969.1/1475.
Der volle Inhalt der QuelleAnnotation:
In this dissertation topics of optimal meter placement and transaction-based loss allocation in deregulated power system operation are investigated.
Firstly, Chapter II introduces the basic idea of candidate measurement identification, which is the selection of candidate measurement sets, each of which will make the system observable under a given contingency (loss of measurements and network topology changes). A new method is then developed for optimal meter placement, which is the choice of the optimal combination out of the selected candidate measurement sets in order to ensure the entire system observability under any one of the contingencies.
A new method, which allows a natural separation of losses among individual transactions in a multiple-transaction setting is proposed in Chapter III. The proposed method does not use any approximations such as a D.C. power flow, avoiding method induced inaccuracies. The power network losses are expressed in terms of individual power transactions. A transaction-loss matrix, which illustrates the breakdown of losses introduced by each individual transaction and interactions between any two transactions, is created. The network losses can then be allocated to each transaction based on the transaction-loss matrix entries.
The conventional power flow analysis is extended in Chapter IV to combine with the transaction loss allocation. A systematic solution procedure is formed in order to adjust generation while simultaneously allocating losses to the generators designated by individual transactions.
Furthermore, Chapter V presents an Optimal Power Flow (OPF) algorithm to optimize the loss compensation if some transactions elect to purchase the loss service from the Independent System Operator (ISO) and accordingly the incurred losses are fairly allocated back to individual transactions. IEEE test systems have been used to verify the effectiveness of the proposed method.
17
Batts, William Merle. „Modeling of a hardware VLSI placement system : accelerating the simulated annealing algorithm /“. Link to online version, 2005. https://ritdml.rit.edu/dspace/handle/1850/1015.
Der volle Inhalt der Quelle
18
Singh, Mohan G. „Data base management system for the placement center of the Atlanta University“. DigitalCommons@Robert W. Woodruff Library, Atlanta University Center, 1985. http://digitalcommons.auctr.edu/dissertations/2137.
Der volle Inhalt der QuelleAnnotation:
The Placement Center of the Atlanta University organizes interviews of the students with the companies around the country. A database management system is being developed for signing up and preparation of interview schedules on the IBM PC. The dBASE II database manager is used for creating the database and writing the programs to access the database. In the first phase, a pilot database management system was tested and suggestions were collected. This system us called Model I. In this model, the database exists in the third normal form. The students and the Placement Office personnel found this system to be not too user-friendly. Then Model I was modified to make the system more user-friendly and cut down the user-time. The modified system is called Model II, where the database is the unnormalized form.
This study makes a comparison of Model I and Model II and analyzes the advantages and disadvantages of both the models and concludes that in order to make a database system user-friendly and cut down the user-time, sometimes a database may have to be designed in the unnormalized form; knowing that a database in unnormalized form has insertion, deletion and update anomalies.
19
De-Heer-Menlah, Frederick Kofi. „Analyzing communication flow and process placement in Linda programs on transputers“. Thesis, Rhodes University, 1992. http://hdl.handle.net/10962/d1006698.
Der volle Inhalt der QuelleAnnotation:
With the evolution of parallel and distributed systems, users from diverse disciplines have looked to these systems as a solution to their ever increasing needs for computer processing resources. Because parallel processing systems currently require a high level of expertise to program, many researchers are investing effort into developing programming approaches which hide some of the difficulties of parallel programming from users. Linda, is one such parallel paradigm, which is intuitive to use, and which provides a high level decoupling between distributable components of parallel programs. In Linda, efficiency becomes a concern of the implementation rather than of the programmer. There is a substantial overhead in implementing Linda, an inherently shared memory model on a distributed system. This thesis describes the compile-time analysis of tuple space interactions which reduce the run-time matching costs, and permits the distributon of the tuple space data. A language independent module which partitions the tuple space data and suggests appropriate storage schemes for the partitions so as to optimise Linda operations is presented. The thesis also discusses hiding the network topology from the user by automatically allocating Linda processes and tuple space partitons to nodes in the network of transputers. This is done by introducing a fast placement algorithm developed for Linda.KMBT_223
20
Fent, Thomas. „Using genetics based machine learning to find strategies for product placement in a dynamic market“. SFB Adaptive Information Systems and Modelling in Economics and Management Science, WU Vienna University of Economics and Business, 1999. http://epub.wu.ac.at/694/1/document.pdf.
Der volle Inhalt der QuelleAnnotation:
In this paper we discuss the necessity of models including complex adaptive systems in order to eliminate the shortcomings of neoclassical models based on equilibrium theory. A simulation model containing artificial adaptive agents is used to explore the dynamics of a market of highly replaceable products. A population consisting of two classes of agents is implemented to observe if methods provided by modern computational intelligence can help finding a meaningful strategy for product placement. During several simulation runs it turned out that the agents using CI-methods outperformed their competitors. (author's abstract)Series: Working Papers SFB "Adaptive Information Systems and Modelling in Economics and Management Science"
21
Eriksson, Madeleine, und Evelina Tertelyté. „Text Placement in SNS forEffective Communication : A qualitative study investigating the most favourable text placement onmedia sharing SNS advertisements to best communicate informationthrough text“. Thesis, Tekniska Högskolan, Jönköping University, JTH, Datateknik och informatik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-49541.
Der volle Inhalt der QuelleAnnotation:
The aim of this thesis is to conduct a qualitative study investigating the mostfavourable text placement on social networking sites (SNS) to best communicateinformation through text. To discover a suitable placement for text, we utilizeconscious and unconscious visual gaze points from participants. To discover thevisual gravity of participants, the research methods of eye tracking and survey areused. The eye tracking supplies unpretentious and real-time behavioral insight asgaze points. Whereas the survey supplies subjective conscious visual gravity data.Previous research suggests that users are drawn to elements containing text.Furthermore, another theory describes users seeking task-relevant information, agoal is to uncover where is the best placement to aid users seeking task-relevantinformation. The conclusion of this thesis uncovered that users are drawn to textelements unconsciously, but conscious visual gravity could be based on imageexposure. Furthermore, the most favourable placement for text is centered along avertical axis on a 1:1 image and slightly higher than the horizontal axis line.
22
Altan, Hal. „MOBILE GROUND TRACKING STATION DESIGN MODIFICATIONS AND PLACEMENT PREPARATION FOR CROWDED AIRSPACE“. International Foundation for Telemetering, 2007. http://hdl.handle.net/10150/604566.
Der volle Inhalt der QuelleAnnotation:
ITC/USA 2007 Conference Proceedings / The Forty-Third Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2007 / Riviera Hotel & Convention Center, Las Vegas, NevadaAs the frequency spectrum becomes more crowded each day, preparation for placement of tracking ground station in tracking environment gains more importance. Existence of high power weather ground radars, airport approach equipment, and various other RF sources in the environment necessitates the test teams to be more cautious. This paper discusses, implemented design changes to an S-band antenna system to reduce the in-band interfering power, calculation of the effects from nearby interferers, analysis of the environment during placement of the mobile ground system by Honeywell telemetry teams.
23
Tonon, Rosa Alexandre. „Corn and soybean genotypes with contrasting root system: response to fertilizer placement and tillage“. Thesis, Kansas State University, 2016. http://hdl.handle.net/2097/32714.
Der volle Inhalt der QuelleAnnotation:
Master of ScienceAgronomy
Dorivar A. Ruiz Diaz Suarez
The effect of tillage on crop yield, early growth, and soil nutrient stratification can be influenced by fertilizer placement. In addition, deeper root systems can enhance the crop ability to uptake water and nutrients. A thorough understanding of how these factors interact can result in increased grain yields and profitability for the producer. Three studies were completed to describe and evaluate different aspects of crop root system and response to fertilizer placement and tillage. The objective of the first study was to characterize the root system of two genotypes of corn (Zea mays) and soybean (Glycine max (L.) Merr.) using image analysis in the greenhouse and in the field, as well as evaluate dry weight accumulation and nutrient uptake patterns by shoot and root plant parts for both crops. Two different genotypes of each crop were sampled during the growing season to access root characteristics such as biomass, length, surface area, average diameter and volume. Significant differences were found in corn where the P1151 AM hybrid had greater root length, surface area and volume than the P1105 AM hybrid. In soybean, the differences were found in nutrient uptake with overall greater nutrient uptake values for the poor drainage variety (PD) compared to the good drainage variety (GD). The objective of the second study was to evaluate the effect of fertilizer placement and tillage system on corn with different genotypes. Three fertilizer treatments were combined with two different corn genotypes selected based on contrasting root systems and two different tillage systems. The three fertilizer placements were sub-surface band, broadcast, and control. The two hybrids of corn used were a P1151 AM hybrid and P1105 AM hybrid. The two tillage systems were no-till (NT) and strip-till (ST). Corn hybrids showed different response in root biomass but did not show a consistent response in other characteristics evaluated. Broadcast and sub-surface band increased nutrient uptake and grain yields over the control but were not significantly different from each other. Tillage showed no difference in corn response. The objective of the third study was to evaluate the effect of fertilizer placement and tillage system on contrasting soybean genotypes. Three fertilizer treatments were combined with two different genotypes selected based on contrasting root systems and two different tillage operations. The three fertilizer placements were sub-surface band, broadcast, and control. The two varieties of soybean used were one recommended for poor drainage (PD) and one recommended for good drainage (GD). The two tillage operations were NT and ST. Soybean root biomass differences were observed by varieties. Sub-surface band treatment favored early soybean growth, biomass and P uptake at the V3 growth stage, but it did not turn into yield increase. Soybean grain yields did not respond to fertilization in this study. Yield was affected significantly by variety selection and response varies by site-year.
24
Bezerra, Josà Roberto. „Contributions to the efficient switch placement and automatic restoration of power distribution systems“. Universidade Federal do CearÃ, 2015. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=16190.
Der volle Inhalt der QuelleAnnotation:
Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgicoThe demand for electricity grows in the same way as the consumers requirement for an uninterrupted supply. Many reliability indices are applied by regulatory agencies, utilities and consumers for measuring the power systems reliability. The improvement of such indices has been required by regulatory agencies and pursued by energy distributors. Therefore, the application of automatic restauration systems has gained relevance as a support tool for control center operators for a quick and secure restauration of faulty electric networks. This work proposes two contributions to the restoration process of radial power system networks. The former is a multiobjective algorithm for effective switch placement in distribution networks. Multiobjective optimization techniques are applied to achieve a set of non-dominated solutions rather than an unique one. Therefore, the decision making for switch placement is eased by the flexibility given from the multiple solutions. The latter contribution is a model for automatic restoration of power distribution networks adaptable to the network topology changes and able to ensure the operational security of the power system network. The proposed model is based on coloured Petri nets as the modelling tool. Reusability and extensibility features have been pursued and implemented on the proposed model. As a result, the needed time to restore faulty power system networks is reduced without compromising its operational security. Case studies are presented demonstrating the benefits to the power system distribution utilities obtained with the deployment of the proposed tools to improve the reliability of the power system networks.
A demanda por energia elÃtrica cresce e de igual modo a exigÃncia dos consumidores pela continuidade do seu fornecimento. Diversos Ãndices de confiabilidade sÃo utilizados por agÃncias reguladoras, concessionÃrias e consumidores para aferir a continuidade dos sistemas elÃtricos de potÃncia. A melhoria de tais Ãndices vem sendo requisitada por agÃncias reguladoras e perseguida pelas concessionÃrias de energia. Para tanto, o uso de sistemas de restauraÃÃo automÃtica vem ganhando destaque como uma ferramenta de apoio a operadores de centros de controle para a restauraÃÃo rÃpida e segura de redes elÃtricas em situaÃÃes de falta. Este trabalho apresenta duas contribuiÃÃes para a restauraÃÃo automÃtica de redes radiais de distribuiÃÃo de energia. A primeira consiste em um algoritmo para o posicionamento eficiente de chaves telecontroladas em redes de distribuiÃÃo. TÃcnicas de otimizaÃÃo multiobjetivo sÃo aplicadas para obter-se como resultado um conjunto de soluÃÃes nÃo-dominadas ao invÃs de uma Ãnica soluÃÃo. Com isso, a tomada de decisÃo para o posicionamento eficiente de chaves na rede elÃtrica à facilitado pela flexibilidade das mÃltiplas soluÃÃes oferecidas pelo algoritmo proposto. A segunda contribuiÃÃo do trabalho consiste em um modelo para restauraÃÃo automÃtica da rede de distribuiÃÃo de energia adaptÃvel Ãs mudanÃas de topologia e que garante a seguranÃa operacional da rede elÃtrica. O modelo proposto fundamentou-se em Redes de Petri Coloridas como ferramenta de modelagem. CaracterÃsticas de reusabilidade e extensibilidade foram buscadas e implementadas no modelo proposto. Como resultado, o tempo necessÃrio para restaurar redes elÃtricas em condiÃÃo de falta à reduzido sem comprometer a seguranÃa do sistema elÃtrico. Estudos de caso sÃo apresentados evidenciando os benefÃcios para concessionÃrias de distribuiÃÃo de energia com a implementaÃÃo das ferramentas propostas para melhoria da confiabilidade da rede elÃtrica.
25
Ramos, Corchado Félix Francisco. „Une approche multi-agents pour le placement dynamique de requêtes dans les systèmes globaux“. Compiègne, 1997. http://www.theses.fr/1997COMP1026.
Der volle Inhalt der QuelleAnnotation:
Le placement dynamique de requêtes dans un système d'information global consiste à exploiter de manière transparente l'importante quantité d'information disponible dans le système en s'adaptant dynamiquement aux évolutions de l'environnement et aux caractéristiques des requêtes. Dans ce travail notre objectif est d'optimiser l'utilisation des ressources disponibles et le coût de la communication afin de réduire le temps de réponse. Nous utilisons une approche multi-agents pour mettre en oeuvre quatre stratégies de placement dynamique de requêtes. Dans la première stratégie, afin de réduire les appels au processus de négociation, les agents placeurs apprennent les identités des agents réactifs lui ayant proposé ses services. La deuxième stratégie combine la stratégie aléatoire avec les connaissances acquises par les agents placeurs des expériences du passé pour placer la requête. La stratégie suivante raffine les connaissances des agents placeurs en définissant une qualité de service, qui est utilisée pour choisir l'agent réactif qui exécutera la requête dès l'arrivée de la requête. La dernière stratégie permet aux agents réactifs de proposer leurs services à leurs clients potentiels en fonction de leurs besoins. Nos quatre stratégies de placement ont été validées par des simulations et par une implémentation de taille intranet. Les résultats des simulations montrent que nos stratégies de placement dynamique diminuent le temps de réponse des requêtes soumises au système et bénéficient d'une réduction du coût de communication très significative. Afin de prendre en compte la topologie du réseau sous-jacent tout en gardant l'intérêt sur l'économie des messages. Au chapitre quatre nous proposons deux techniques pour le placement dynamique de requêtes basées sur les arbres couvrants. Cette approche nous permet de prendre en compte des autres caractéristiques que la topologie du réseau sous-jacent afin de router les requêtes de proche en proche, par exemple la distance physique entre les sites ou la charge des canaux. Les deux stratégies ont été validées par simulation et les résultats sont présentés dans la quatrième partie du document. Finalement, au chapitre cinq, nous concluons sur les résultats de nos travaux et donnons les perspectives.
26
Zolla, George A. „TARPS : a prototype expert system for Training and Administration of Reserves (TAR) officer placement“. Thesis, Monterey, California. Naval Postgraduate School, 1991. http://hdl.handle.net/10945/28590.
Der volle Inhalt der QuelleAnnotation:
The billet assignment for Training and Administration of Reserves (TAR) officers is normally two to three years. A placement officer determines where the TAR officer's subsequent assignment will be based on the officer's qualifications and billet requirements. This assignment is vitally important because it significantly affects the officer's career opportunities for promotion and command. This thesis describes the design and implementation of a prototype expert database system that enhances the placement officer's ability to efficiently select the optimum billet for each officer. The prototype integrates a rule based expert system with officer and billet databases to produce a list of billets that match an officer's qualifications and desires. A rudimentary prototype of TARPS has already been evaluated in the field. Initial feedback is encouraging. Placement officer recommendations have been implemented into an enhanced prototype, detailed in this thesis
27
Pearl, Kristine H. „What educational outcomes influence placement in college, career, or both?| A school system analysis“. Thesis, Frostburg State University, 2016. http://pqdtopen.proquest.com/#viewpdf?dispub=10168406.
Der volle Inhalt der QuelleAnnotation:
All students should leave high school equipped with the academic and technical skills necessary to pursue higher education and/or a career. In a changing world, this now means that workforce readiness now demands the same high level of knowledge and skills needed for those who plan to pursue a post-secondary education. While Career and Technical Education (CTE) plays a critical role in accomplishing this goal, it is not always included in the college and career ready conversation. The purpose of this study was to determine what educational outcomes influence student placement in college, career, or both at 12 and 24 months after graduation and what can be learned by examining patterns of those outcomes that will advance current knowledge relative to placement in college or career.
The research study used ex post facto data in a quantitative non-experimental correlational research design to retrospectively examine placement at 12 and 24 months after high school graduation to determine which educational variables (independent variables) most significantly influenced placement (dependent) in college and career or both. The sample included 6,145 graduates from a Maryland school system. Data analysis included Chi-Square with Cramer’s V and Chi-Square Automatic Interaction Detection (CHAID).
The key finding indicated that participation in Advanced Placement (AP) college level courses while in high school, was the most significant predictor of placement at 12 and 24 months after graduation indicating that continued exposure to college level courses throughout a student’s high school experience can overcome performance on standardized tests intended to determine college and career readiness. The study also confirmed that a significant number of students who selected traditional career pathways also pursued college. This speaks to the importance of preparation for both college and career no matter what industry the student intends to pursue.
28
Zini, Roger. „Placement, routage conjoints et hierarchiques de reseaux prediffuses“. Paris 6, 1987. http://www.theses.fr/1987PA066116.
Der volle Inhalt der QuelleAnnotation:
Cette these propose un algorithme original de construction hierarchique d'arbres de steiner ainsi qu'une technique d'estimation de longueur au fur et a mesure de cette construction. Deux algorithmes de partitionnement d'hypergraphes, de maniere gloutonne ou par recuit simule sans rejets, y sont exposes. Elle introduit enfin un concept de directions d'attraction permettant d'effectuer un placement routage de circuits vlsi, a implanter sur des reseaux prediffuses, sous forme de systeme regule par retroaction entre le placement, le routage et l'analyse temporelle, afin d'obtenir du circuit, par un placement-routage adequat, les performances temporelles souhaitees
29
Belliveau, Tammie. „Barely a whisper in the system, parents' perspectives on the prevention of foster care placement“. Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/mq21874.pdf.
Der volle Inhalt der Quelle
30
Malings, Carl Albert. „Optimal Sensor Placement for Infrastructure System Monitoring using Probabilistic Graphical Models and Value of Information“. Research Showcase @ CMU, 2017. http://repository.cmu.edu/dissertations/869.
Der volle Inhalt der QuelleAnnotation:
Civil infrastructure systems form the backbone of modern civilization, providing the basic services that allow society to function. Effective management of these systems requires decision-making about the allocation of limited resources to maintain and repair infrastructure components and to replace failed or obsolete components. Making informed decisions requires an understanding of the state of the system; such an understanding can be achieved through a computational or conceptual system model combined with information gathered on the system via inspections or sensors. Gathering of this information, referred to generally as sensing, should be optimized to best support the decision-making and system management processes, in order to reduce long-term operational costs and improve infrastructure performance. In this work, an approach to optimal sensing in infrastructure systems is developed by combining probabilistic graphical models of infrastructure system behavior with the value of information (VoI) metric, which quantifies the utility of information gathering efforts (referred to generally as sensor placements) in supporting decision-making in uncertain systems. Computational methods are presented for the efficient evaluation and optimization of the VoI metric based on the probabilistic model structure. Various case studies on the application of this approach to managing infrastructure systems are presented, illustrating the flexibility of the basic method as well as various special cases for its practical implementation. Three main contributions are presented in this work. First, while the computational complexity of the VoI metric generally grows exponentially with the number of components, growth can be greatly reduced in systems with certain topologies (designated as cumulative topologies). Following from this, an efficient approach to VoI computation based on a cumulative topology and Gaussian random field model is developed and presented. Second, in systems with non-cumulative topologies, approximate techniques may be used to evaluate the VoI metric. This work presents extensive investigations of such systems and draws some general conclusions about the behavior of this metric. Third, this work presents several complete application cases for probabilistic modeling techniques and the VoI metric in supporting infrastructure system management. Case studies are presented in structural health monitoring, seismic risk mitigation, and extreme temperature response in urban areas. Other minor contributions included in this work are theoretical and empirical comparisons of the VoI with other sensor placement metrics and an extension of the developed sensor placement method to systems that evolve in time. Overall, this work illustrates how probabilistic graphical models and the VoI metric can allow for efficient sensor placement optimization to support infrastructure system management. Areas of future work to expand on the results presented here include the development of approximate, heuristic methods to support efficient sensor placement in non-cumulative system topologies, as well as further validation of the efficient sensing optimization approaches used in this work.
31
Potami, Raffaele. „Optimal sensor/actuator placement and switching schemes for control of flexible structures“. Worcester, Mass. : Worcester Polytechnic Institute, 2008. http://www.wpi.edu/Pubs/ETD/Available/etd-042808-124333/.
Der volle Inhalt der QuelleAnnotation:
Dissertation (Ph.D.)--Worcester Polytechnic Institute.Keywords: hybrid system, PZT actuators, performance enchancement, actuator placement, actuator switching. Includes bibliographical references (leaves 102-108).
32
Mantri, Sushil Govindnarayan. „Efficient In-Depth IO Tracing and its application for optimizing systems“. Thesis, Virginia Tech, 2014. http://hdl.handle.net/10919/50145.
Der volle Inhalt der QuelleAnnotation:
Understanding user and system behavior is most vital for designing efficient systems. Most
systems are designed with certain user workload in mind. However, such workloads evolve
over time, or the underlying hardware assumptions change. Further, most modern systems
are not built or deployed in isolation, they interact with other systems whose behavior might
not be exactly understood. Thus in order to understand the performance of a system, it
must be inspected closely while user workloads are running. Such close inspection must be
done with minimum disturbance to the user workload. Thus tracing or collection of all the
user and system generated events becomes an important approach in gaining comprehensive
insight in user behavior.
As part of this work, we have three major contributions. We designed and implemented
an in-depth block level I/O tracer, which would collect block level information like sector
number, size of the I/O, actual contents of the I/O, along with certain file system information
like filename, and offset in the file, for every I/O request. Next, to minimize the impact of
the tracing to the running workload, we introduce and implement a sampling mechanism
which traces fewer I/O requests. We validate that this sampling preserves certain I/O access
patterns. Finally, as one of the application of our tracer, we use it as a crucial component
of a system designed to do VM placements according to user workload.Master of Science
33
Wang, Fei Dr. „A Field Programmable Gate Array Architecture for Two-Dimensional Partial Reconfiguration“. Wright State University / OhioLINK, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=wright1166735848.
Der volle Inhalt der Quelle
34
Jansson, Magnus. „A 3D-ultrasound guidance device for central venous catheter placement using augmented reality“. Thesis, KTH, Medicinsk teknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-203814.
Der volle Inhalt der QuelleAnnotation:
Central venous catheterization (CVC) is performed frequently in clinical practices in Operation Rooms(OR) and Emergency Rooms(ER). CVC is performed for different reasons such as supply nutrition or medicine. For CVC ultrasound (US), diagnostic device is preferable among other medical imaging technologies. Central Venous Catheterization (CVC) under the 2D US guidance requires skills for catheter placement to avoid damaging non-targeted blood vessels. Therefore, there is a great need for improvements in the CVC field where mechanical complication has a risk of occurring during the procedure, for example misplacement of the needle. This master thesis project was performed at Kyushu University department of mechanical engineering and collaboration with Maidashi Kyushu University Hospital department of Advanced Medicine and Innovative Technology in Japan. This thesis is aimed to develop a new simple and cheap guidance system for CVC placement. The system performed on a Tablet PC and will be using already existing Ultrasound machines in Hospitals and Augmented Reality(AR). The project developed a simple AR-System for CVC placement with use of the ArUco library. The new developed system takes information from Ultrasound images and constructs a 3D-model of a vein and artery. Then the 3D-model is augmented on the patient through the tablet PC by using the ArUco library. The construction and augmentation is all performed on the tablet PC and has a small computation to complete the necessary procedures for the 3D-blood vessels. The AR-system has a simple control where the interface of the system is a simple push and action system. When a good visualization of the blood vessels and Doppler effect is shown on the ultrasound machine, the surgeon presses the screen and the image is saved. After about five images are acquired, the system builds the 3D-model and augments it on the patient using a marker. For the development of this system it implemented the waterfall method where each step was tested and checked, before moving to the next step. A full functional system was developed and tested. From the tests performed it is shown that there were limitations due to segmentation and depth perception. But the system has possibilities as an aid for CVC placement.
35
Esposito, Tonino. „From initial maltreatment investigation: exploring the placement trajectories of children in the Québec child protection system“. Thesis, McGill University, 2013. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=114201.
Der volle Inhalt der QuelleAnnotation:
This three article dissertation contributes to the growing child protection placement literature by providing the first Canadian series of interconnected province-wide longitudinal studies identifying age-specific factors associated to when and for whom placement, placement changes, and family reunification are most likely to occur. This information can assist child protection authorities in making program and policy decisions regarding existing family preservation and placement support efforts as well as new initiatives and interventions aimed at targeting the most vulnerable.DESIGN/METHODS: Two different data sources were merged to create the province-wide dataset used for this dissertation. One data source is comprised of anonymized longitudinal clinical-administrative child protection data from all sixteen mandated child protection jurisdictions in the province of Québec. The second is comprised of provincial data extracted from the 2006 Canadian Census used to create a neighbourhood area socioeconomic disadvantage composite index. The first study examines when and for whom initial out-of-home placement is most likely to occur for 127,181 children investigated for maltreatment for the first time between April 1, 2002 and March 31, 2010. The second study examines when and for whom out-of-home placement changes are most likely to occur for 29,040 children admitted to out-of-home care for the first time between April 1, 2002 and March 31, 2011. The third study examines when and for whom family reunification is most likely to occur for 24,196 children admitted to out-of-home care for the first time between April 1, 2002 and March 31, 2011. Cox proportional hazard regression models are used in all three studies. FINDINGS: The majority of children served by the Québec child protection system are not placed in out-of-home care, and the majority of those who are experience less than one placement change and return to live with their families within less than six months of initial out-of-home placement. The three studies suggest that there are two discrete age-specific sub-groups who experience problematic placement trajectories, one described as younger children living in unsafe environments due to family difficulties and a lack of appropriate and adequate parental care and the other described as older children manifesting child-specific high risk behaviours which compromise their safety and/or the safety of others, as well as their development. However, all children, irrespective of age, are less likely to reunify with their families if they were placed as a result of parent's high risk behaviours and a lack of appropriate and adequate parental care. This dissertation also suggests that an increase in the number of maltreatment investigations significantly increases children's chances of placement, placement changes, and decreases their chances of returning to live with their families. Similarly, an increase in the number of placement changes decreases children's chances of returning to live with their families. Youth criminal behaviours also statistically explain older children's chances of removal, changing placements and reunification; specifically, older placed children receiving youth criminal justice services are more likely to experience frequent placement changes and less likely to return to their families. Last, this dissertation confirms the association between neighbourhood area socioeconomic disadvantages and the increased risk of experiencing problematic placement trajectories, suggesting that an increase in neighbourhood area socioeconomic disadvantages significantly increases children's chances of placement, placement changes (only for older children) and decrease their chances of returning to live with their families.Cette étude contribue à la littérature croissante sur les trajectoires de placement des enfants dans le but d'identifier les caractéristiques spécifiques ou une combinaison de caractéristiques associées aux placements, aux changements de placement, et à quand les réunifications familial sont les plus susceptibles de se produire. CONCEPTION/ MÉTHODES: Cette étude se base sur des données clinico-administratives des seize centres jeunesse de la province du Québec. Les cohortes principales extraites de cette étude sont constituées de 127,181 enfants provenant d'enquêtes pour mauvais traitements (article 1), et deux sous-cohorte de 29,040 (article 2) et 24,196 (article 3) enfants placés entre 2002 et 2011, suivis de leur entrée jusqu'en septembre 2011. Un compte rendu détaillé de l'historique de maltraitance de ces enfants peut être construit en utilisant un certain nombre de mesures provenant de ces données. Les données sur la composition de la famille, l'emploi et le revenu ne sont pas encore systématiquement saisi dans tous les établissements de la protection de la jeunesse et ne sont donc pas disponibles par le biais des données clinico-administratives des centres jeunesse. Par conséquent, les données provinciales extraites du recensement canadien de 2006 ont été utilisées pour créer un indice de défavorisation socio-économique. Les modèles de régression de risques proportionnels Cox ont été utilisés pour évaluer les effets indépendants des caractéristiques des enfants afin de déterminer pour qui et quand les placements sont les plus susceptibles de se produire (article 1), pour qui et quand les changements de placement sont le plus susceptibles de se produire (article 2), et pour qui et quand les réunifications familiales sont les plus susceptibles de se produire (article 3).RÉSULTATS: La majorité des enfants desservis par le système québécois de protection de la jeunesse ne sont pas placés, et la majorité de ceux qui sont placés connaîtront des placements stables, et seront réunifies avec leur familles en moins de six mois. Les trois études suggèrent qu'il existe deux sous-groupes distincts qui ont des trajectoires de placement problématiques : les jeunes enfants vivant dans des environnements à risque en raison de difficultés familiales et de manque de soins parentaux appropriés et adéquats; et les enfants plus âgés pour qui les défis ne sont pas spécifiques à la famille, mais plutôt liés à la manifestation de problèmes de comportement mettant en danger leur sécurité ou la sécurité des autres, ainsi que leur développement. Cependant, tous les enfants, sans importance d'âge, sont moins susceptibles de retourner vivre avec leur famille si elles ont été placées en raison des difficultés familiales et de manque de soins parentaux appropriés et adéquats. Cette thèse suggère également que l'augmentation du nombre d'enquêtes sur la maltraitance augmente les chances de placement et les changements de placement, et diminue leurs chances de réunifications familiales. De même, une augmentation du nombre de changements de placement diminue les chances de réunification familiales. Les enfants qui recevaient des services en tant que jeune contrevenant étaient plus susceptibles de changer de placement et moins susceptibles de retourner vivre avec leur famille. Dernièrement, cette thèse confirme l'association entre la défavorisation socio-économique et les trajectoires de placements problématiques, en suggérant qu'une augmentation de la défavorisation socio-économique augmente considérablement les chances de placement et de changements de placement (pour les enfants plus âgés seulement), et diminue les chances de réunifications familiales.
36
Rosich, Oliva Albert. „Sensor placement for fault diagnosis based on structural models: application to a fuel cell stak system“. Doctoral thesis, Universitat Politècnica de Catalunya, 2011. http://hdl.handle.net/10803/53635.
Der volle Inhalt der QuelleAnnotation:
The present work aims to increase the diagnosis systems capabilities by choosing the location of sensors in the process. Therefore, appropriate sensor location will lead to better diagnosis performance and implementation easiness. The work is based on structural models ands some simplifications are considered in order to only focus on the sensor placement analysis. Several approaches are studied to solve the sensor placement problem. All of them find the optimal sensor configuration.
The sensor placement techniques are applied to a fuel cell stack system. The model used to describe the behaviour of this system consists of non-linear equations. Furthermore, there are 30 candidate sensors to improve the diagnosis specifications. The results obtained from this case study are used to strength the applicability of the proposed approaches.El present treball té per objectiu incrementar les prestacions dels diagnosticadors mitjançant la localització de sensors en el procés. D'aquesta manera, instal·lant els sensors apropiats s'obtenen millors diagnosticador i més facilitats d'implementació. El treball està basat en models estructurals i contempla una sèrie de simplificacions per tal de entrar-se només en la problemàtica de la localització de sensors. S'utilitzen diversos enfocs per tal de resoldre la localització de sensors, tot ells tenen com objectiu trobar la configuració òptima de sensors. Les tècniques de localització de sensors són aplicades a un sistema basat en una pila de combustible. El model d'aquest sistema està format per equacions no lineals. A més, hi ha la possibilitat d'instal·lar fins a 30 sensors per tal de millorar la diagnosis del sistema. Degut a aquestes característiques del sistema i del model, els resultats obtinguts mitjançant aquest cas d'estudi reafirmen l'aplicabilitat dels mètodes proposats.
37
Polyzos, Dimitrios. „"Measuring System Properties & Structured Diagnostics for the Selection of Sensors, Actuators Placement & Eigenstructure Assignment"“. Thesis, City University London, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.524712.
Der volle Inhalt der Quelle
38
Xu, Bei. „Optimal monitoring and visualization of steady state power system operation“. [College Station, Tex. : Texas A&M University, 2006. http://hdl.handle.net/1969.1/ETD-TAMU-1784.
Der volle Inhalt der Quelle
39
Bouvry, Pascal. „Placement de tâches sur ordinateurs parallèles à mémoire distribuée“. Grenoble INPG, 1994. http://tel.archives-ouvertes.fr/tel-00005081.
Der volle Inhalt der QuelleAnnotation:
La demande croissante de puissance de calcul est telle que des ordinateurs de plus en plus performants sont fabriqués. Afin que ces machines puissent être facilement exploitées, les lacunes actuelles en terme d'environnements de programmation doivent être comblées. Le but à atteindre est de trouver un compromis entre recherche de performances et portabilité. Cette thèse s'intéresse plus particulièrement au placement statique de graphes de taches sur architectures parallèles a mémoire distribuée. Ce travail s'inscrit dans le cadre du projet INRIA-IMAG APACHE et du projet européen SEPP-COPERNICUS (Software Engineering for Parallel Processing). Le graphe de taches sans précédence est le modèle de représentation de programmes parallèles utilise dans cette thèse. Un tour d'horizon des solutions apportées dans la littérature au problème de l'ordonnancement et du placement est fourni. La possibilité d'utilisation des algorithmes de placement sur des graphes de précédence, après une phase de regroupement, est soulignée. Une solution originale est proposée, cette solution est interfacée avec un environnement de programmation complet. Trois types d'algorithmes (gloutons, iteratifs et exacts) ont été conçus et implémentes. Parmi ceux-ci, on retrouve plus particulièrement un recuit simule et une recherche tabu. Ces algorithmes optimisent différentes fonctions objectives (des plus simples et universelles aux plus complexes et ciblées). Les différents paramètres caractérisant le graphe de taches peuvent être affinés suite à un relevé de traces. Des outils de prise de traces permettent de valider les différentes fonctions de cout et les différents algorithmes d'optimisation. Un jeu de tests est défini et utilise. Les tests sont effectué sur le Mégapode (machine a 128 transputers), en utilisant comme routeur VCR de l'université de Southampton, les outils de génération de graphes synthétiques ANDES du projet ALPES (développé par l'équipe d'évaluation de performances du LGI-IMAG) et l'algorithme de regroupement DSC (Dominant Sequence Clustering) de PYRROS (développé par Tao Yang et Apostolos Gerasoulis). Mapping task graphs on distributed memory parallel computersThe growing needs in computing performance imply more complex computer architectures. The lack of good programming environments for these machines must be filled. The goal to be reached is to find a compromise solution between portability and performance. The subject of this thesis is studying the problem of static allocation of task graphs onto distributed memory parallel computers. This work takes part of the project INRIA-IMAG APACHE and of the european one SEPP-COPERNICUS (Software Engineering for Parallel Processing). The undirected task graph is the chosen programming model. A survey of the existing solutions for scheduling and for mapping problems is given. The possibility of using directed task graphs after a clustering phase is underlined. An original solution is designed and implemented ; this solution is implemented within a working programming environment. Three kinds of mapping algorithms are used: greedy, iterative and exact ones. Most developments have been done for tabu search and simulated annealing. These algorithms improve various objective functions (from most simple and portable to the most complex and architecturaly dependant). The weigths of the task graphs can be tuned using a post-mortem analysis of traces. The use of tracing tools leads to a validation of the cost function and of the mapping algorithms. A benchmark protocol is defined and used. The tests are runned on the Meganode (a 128 transputer machine) using VCR from the university of Southampton as a router, synthetic task graphs generation with ANDES of the ALPES project (developped by the performance evaluation team of the LGI-IMAG) and the Dominant Sequence Clustering of PYRROS (developped by Tao Yang and Apostolos Gerasoulis)
40
Kahne, Brian C. „A Genetic Algorithm-Based Place-and-Route Compiler For A Run-time Reconfigurable Computing System“. Thesis, Virginia Tech, 1997. http://hdl.handle.net/10919/36521.
Der volle Inhalt der QuelleAnnotation:
Configurable Computing is a technology which attempts to increase computational power by customizing the computational platform to the specific problem at hand. An experimental computing model known as wormhole run-time reconfiguration allows for partial reconfiguration and is highly scalable. In this approach, configuration information and data are grouped together in a computing unit called a stream, which can tunnel through the chip creating a series of interconnected pipelines.
The Colt/Stallion project at Virginia Tech implements this computing model into integrated circuits. In order to create applications for this platform, a compiler is needed which can convert a human readable description of an algorithm into the sequences of configuration information understood by the chip itself. This thesis covers two compilers which perform this task. The first compiler, Tier1, requires a programmer to explicitly describe placement and routing inside of the chip. This could be considered equivalent to an assembler for a traditional microprocessor. The second compiler, Tier2, allows the user to express a problem as a dataflow graph. Actual placing and routing of this graph onto the physical hardware is taken care of through the use of a genetic algorithm.
A description of the two languages is presented, followed by example applications. In addition, experimental results are included which examine the behavior of the genetic algorithm and how alterations to various genetic operator probabilities affects performance.Master of Science
41
Le, Van-Minh. „Machine Learning methods for optimization in Multi-Agent Decision Support System : application to Sign Placement for Tsunami Evacuation“. Thesis, Sorbonne Paris Cité, 2016. http://www.theses.fr/2016USPCD097/document.
Der volle Inhalt der QuelleAnnotation:
Les tsunamis sont l’une des catastrophes naturelles les plus dangereuses. Ils peuvent tuer des milliers de personnes (par exemple : le tsunami de l’Océan Indien en 2004 et le tsunami Tohoku Japan en 2011). L’évacuation est une solution efficace pour sauver les gens dans ces cas des désastres. Avant que le tsunami n’arrive, il faut que les gens atteignent des bâtiments en hauteur ou des zones éloignées de la mer. Notre objectif est d’aider les personnes à se diriger vers les bons endroits durant l'évacuation, en plaçant de façon judicieuse des panneaux signalétiques. Pour le placement optimal de ces panneaux est formulé dans cette thèse comme un problème d’optimisation. Dans un premier temps, nous utiliserons un simulateur multi-agents pour estimer le nombre de survivants en cas de tsunamis. Ce simulateur intégre un modèle de comportement des individus, en fonction des panneaux signalétiques placés dans la ville. L’optimisation basée sur ce simulateur étant inefficace, nous utiliserons des techniques d’apprentissage pour estimer plus rapidement le nombre de survivants dans différents casIn recent years, whenever we talked about tsunami, we mentioned the terrible destruction and huge casualties (the tsunami from Indian Ocean in 2004 and the tsunami in Tohoku Japan 2011). The evacuation is the most effective solution to save people in this kind of disaster. Before a tsunami arrival, people should go to the high buildings (called vertical shelters) or high ground areas or zones far from the sea (called horizontal shelters). However, there are always the part of evacuees (e.g. the tourist) who lack information of the city map, we then focus on the solution to guide people in evacuation.This thesis presents the approach of Efficient Optimization in a Multi-Agent Decision Support System : Application to Sign Placement for Tsunami Evacuation. More precisely, we study the approach to place signs and also evacuation maps in the city (at certain crossroads or junctions) to have as many people (call survivors) as possible reach the shelters before tsunami arrival. Our multiagent simulator allows us to estimate the number of survivors after a tsunami. Using various optimization techniques, we then place signs in the city in order to maximize the estimated number of survivors
42
Chen, Jiaxiong. „Power System State Estimation Using Phasor Measurement Units“. UKnowledge, 2013. http://uknowledge.uky.edu/ece_etds/35.
Der volle Inhalt der QuelleAnnotation:
State estimation is widely used as a tool to evaluate the real time power system prevailing conditions. State estimation algorithms could suffer divergence under stressed system conditions. This dissertation first investigates impacts of variations of load levels and topology errors on the convergence property of the commonly used weighted least square (WLS) state estimator. The influence of topology errors on the condition number of the gain matrix in the state estimator is also analyzed. The minimum singular value of gain matrix is proposed to measure the distance between the operating point and state estimation divergence.
To study the impact of the load increment on the convergence property of WLS state estimator, two types of load increment are utilized: one is the load increment of all load buses, and the other is a single load increment. In addition, phasor measurement unit (PMU) measurements are applied in state estimation to verify if they could solve the divergence problem and improve state estimation accuracy.
The dissertation investigates the impacts of variations of line power flow increment and topology errors on convergence property of the WLS state estimator. A simple 3-bus system and the IEEE 118-bus system are used as the test cases to verify the common rule. Furthermore, the simulation results show that adding PMU measurements could generally improve the robustness of state estimation.
Two new approaches for improving the robustness of the state estimation with PMU measurements are proposed. One is the equality-constrained state estimation with PMU measurements, and the other is Hachtel's matrix state estimation with PMU measurements approach. The dissertation also proposed a new heuristic approach for optimal placement of phasor measurement units (PMUs) in power system for improving state estimation accuracy. In the problem of adding PMU measurements into the estimator, two methods are investigated. Method I is to mix PMU measurements with conventional measurements in the estimator, and method II is to add PMU measurements through a post-processing step. These two methods can achieve very similar state estimation results, but method II is a more time-efficient approach which does not modify the existing state estimation software.
43
Galic, Dragan M. „Fertilizer placement, tillage system and hybrid effects on corn response to potassium after long-term no-till“. Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape2/PQDD_0028/MQ51067.pdf.
Der volle Inhalt der Quelle
44
Nusrat, Nazia. „Development of novel electrical power distribution system state estimation and meter placement algorithms suitable for parallel processing“. Thesis, Brunel University, 2015. http://bura.brunel.ac.uk/handle/2438/10902.
Der volle Inhalt der QuelleAnnotation:
The increasing penetration of distributed generation, responsive loads and emerging smart metering technologies will continue the transformation of distribution systems from passive to active network conditions. In such active networks, State Estimation (SE) tools will be essential in order to enable extensive monitoring and enhanced control technologies. In future distribution management systems, the novel electrical power distribution system SE requires development in a scalable manner in order to accommodate small to massive size networks, be operable with limited real time measurements and a restricted time frame. Furthermore, a significant phase of new sensor deployment is inevitable to enable distribution system SE, since present-day distribution networks lack the required level of measurement and instrumentation. In the above context, the research presented in this thesis investigates five SE optimization solution methods with various case studies related to expected scenarios of future distribution networks to determine their suitability. Hachtel's Augmented Matrix method is proposed and developed as potential SE optimizer for distribution systems due to its potential performance characteristics with regard to accuracy and convergence. Differential Evolution Algorithm (DEA) and Overlapping Zone Approach (OZA) are investigated to achieve scalability of SE tools; followed by which the network division based OZA is proposed and developed. An OZA requiring additional measurements is also proposed to provide a feasible solution for voltage estimation at a reduced computation cost. Realising the requirement of additional measurements deployment to enable distribution system SE, the development of a novel meter placement algorithm that provides economical and feasible solutions is demonstrated. The algorithm is strongly focused on reducing the voltage estimation errors and is capable of reducing the error below desired threshold with limited measurements. The scalable SE solution and meter placement algorithm are applied on a multi-processor system in order to examine effective reduction of computation time. Significant improvement in computation time is observed in both cases by dividing the problem into smaller segments. However, it is important to note that enhanced network division reduces computation time further at the cost of accuracy of estimation. Different networks including both idealised (16, 77, 356 and 711 node UKGDS) and real (40 and 43 node EG) distribution network data are used as appropriate to the requirement of the applications throughout this thesis.
45
Vural, Ozgur Ahmet. „Fuzzy Logic Guidance System Design For Guided Missiles“. Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/1026715/index.pdf.
Der volle Inhalt der QuelleAnnotation:
This thesis involves modeling, guidance, control, and flight simulations of a canard
controlled guided missile.
The autopilot is designed by a pole placement technique. Designed autopilot is
used with the guidance systems considered in the thesis.
Five different guidance methods are applied in the thesis, one of which is the
famous proportional navigation guidance. The other four guidance methods are
different fuzzy logic guidance systems designed considering different types of
guidance inputs.
Simulations are done against five different target types and the performances of the
five guidance methods are compared and discussed.
46
Guo, Kai-Lin, und 郭楷林. „Multimedia data placement in multi-disk system“. Thesis, 1999. http://ndltd.ncl.edu.tw/handle/83083637978324140637.
Der volle Inhalt der Quelle
47
Kunigahalli, Raghavan S. „CNC concrete placement planning and control system“. 1994. http://catalog.hathitrust.org/api/volumes/oclc/31614890.html.
Der volle Inhalt der QuelleAnnotation:
Thesis (Ph. D.)--University of Wisconsin--Madison, 1994.Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 147-160).
48
Li, Jun Nan, und 李俊男. „Hierarchical MCM placement system with thermal analysis“. Thesis, 1995. http://ndltd.ncl.edu.tw/handle/97236794230028727167.
Der volle Inhalt der Quelle
49
ZHANG, GUO-EN, und 張國恩. „Top-down placement for hierarchical layout system“. Thesis, 1986. http://ndltd.ncl.edu.tw/handle/23604507836604137662.
Der volle Inhalt der Quelle
50
Green, Kary. „Optimal sensor placement for parameter identification“. Thesis, 2007. http://hdl.handle.net/1911/20506.
Der volle Inhalt der QuelleAnnotation:
This thesis surveys methods for determining sensor locations which maximize the achievable accuracy in parameter estimation of differential equations. The approach considers the placement of sensors as an experimental design problem. The optimal sensor locations are found based on the so-called Fisher Information Matrix. After illustration of the general methodology, a particular algorithm is presented which finds optimal weights associated with a given set of potential sensor locations. Numerical results are provided to show that improvements in the accuracy of parameter estimates can be achieved using the ideas reviewed in this thesis.