• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 50
  • 19
  • 9
  • 8
  • 6
  • 5
  • 2
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 124
  • 40
  • 39
  • 21
  • 19
  • 19
  • 18
  • 17
  • 17
  • 16
  • 15
  • 14
  • 12
  • 11
  • 10
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
101

Statistical Yield Analysis and Design for Nanometer VLSI

Jaffari, Javid January 2010 (has links)
Process variability is the pivotal factor impacting the design of high yield integrated circuits and systems in deep sub-micron CMOS technologies. The electrical and physical properties of transistors and interconnects, the building blocks of integrated circuits, are prone to significant variations that directly impact the performance and power consumption of the fabricated devices, severely impacting the manufacturing yield. However, the large number of the transistors on a single chip adds even more challenges for the analysis of the variation effects, a critical task in diagnosing the cause of failure and designing for yield. Reliable and efficient statistical analysis methodologies in various design phases are key to predict the yield before entering such an expensive fabrication process. In this thesis, the impacts of process variations are examined at three different levels: device, circuit, and micro-architecture. The variation models are provided for each level of abstraction, and new methodologies are proposed for efficient statistical analysis and design under variation. At the circuit level, the variability analysis of three crucial sub-blocks of today's system-on-chips, namely, digital circuits, memory cells, and analog blocks, are targeted. The accurate and efficient yield analysis of circuits is recognized as an extremely challenging task within the electronic design automation community. The large scale of the digital circuits, the extremely high yield requirement for memory cells, and the time-consuming analog circuit simulation are major concerns in the development of any statistical analysis technique. In this thesis, several sampling-based methods have been proposed for these three types of circuits to significantly improve the run-time of the traditional Monte Carlo method, without compromising accuracy. The proposed sampling-based yield analysis methods benefit from the very appealing feature of the MC method, that is, the capability to consider any complex circuit model. However, through the use and engineering of advanced variance reduction and sampling methods, ultra-fast yield estimation solutions are provided for different types of VLSI circuits. Such methods include control variate, importance sampling, correlation-controlled Latin Hypercube Sampling, and Quasi Monte Carlo. At the device level, a methodology is proposed which introduces a variation-aware design perspective for designing MOS devices in aggressively scaled geometries. The method introduces a yield measure at the device level which targets the saturation and leakage currents of an MOS transistor. A statistical method is developed to optimize the advanced doping profiles and geometry features of a device for achieving a maximum device-level yield. Finally, a statistical thermal analysis framework is proposed. It accounts for the process and thermal variations simultaneously, at the micro-architectural level. The analyzer is developed, based on the fact that the process variations lead to uncertain leakage power sources, so that the thermal profile, itself, would have a probabilistic nature. Therefore, by a co-process-thermal-leakage analysis, a more reliable full-chip statistical leakage power yield is calculated.
102

Otimização da configuração e operação de sistemas médicos emergenciais em rodovias utilizando o modelo hipercubo.

Iannoni, Ana Paula 11 March 2005 (has links)
Made available in DSpace on 2016-06-02T19:50:24Z (GMT). No. of bitstreams: 1 TeseAPI.pdf: 1231033 bytes, checksum: 51120574caaa9608efc8725f12321b14 (MD5) Previous issue date: 2005-03-11 / Financiadora de Estudos e Projetos / The purpose of this study is to develop effective methods to analyze the configuration and operation of the emergency medical systems (EMS) on highways. Due to the stochastic nature of these systems, especially in the arrival and assistance processes of the emergency calls, we apply the Hypercube Queuing Model to evaluate the performance measures of the system. This is a well-known model in the location literature, which is based on spatially distributed queuing theory. The EMS on highways operate within a particular dispatching policy which considers that only some ambulances in the system can travel to certain regions (partial backup) and multiple dispatch of ambulances to respond to certain calls. In this study we extend the Hypercube model to deal with these situations. Since the Hypercube model is a descriptive model, we also develop a Hypercube embedded genetic algorithm to create a prescriptive approach to optimize the configuration and operation of EMS on highways. This approach can support decisions at the strategic level, for example, the location of ambulances along the highway and the primary response area to each ambulance, as well as, decisions on the operational level, for example, the optimal dispatch policy of ambulances to respond to the emergency calls and the coverage area to each ambulance (if the system configuration can be modified according to the operational conditions of the week or the day). In order to evaluate the performance of the proposed approach, we conducted experiments using the data of two realsystems: the EMS Anjos do Asfalto (Presidente Dutra highway) and EMS Centrovias (portions of the highways Washington Luis, Eng. Paulo Nilo Romano e Comandante João Ribeiro de Barros) in São Paulo State. The results show that the approach is effective to support planning and operation decisions in such systems. / O objetivo deste trabalho é desenvolver métodos efetivos para analisar a configuração e operação de sistemas de atendimento emergencial (SAEs) em rodovias. Devido às características estocásticas de tais sistemas, principalmente nos processos de chegada e atendimento dos chamados de emergência, aplicamos o modelo Hipercubo para analisar as medidas de desempenho do sistema. Este modelo, conhecido na literatura de localização de sistemas de emergência, é baseado em teoria de filas espacialmente distribuídas. Os SAEs em rodovia operam com uma política de despacho particular, a qual admite que apenas algumas ambulâncias do sistema possam viajar a determinadas regiões (backup parcial) e utiliza múltiplo despacho de ambulâncias para atender a certas chamadas. Neste trabalho estendemos o modelo Hipercubo para analisar tais situações. Como o modelo Hipercubo é descritivo, combinamos estas extensões do modelo Hipercubo com um algoritmo genético para obter uma abordagem prescritiva capaz de otimizar a configuração e operação de SAEs em rodovias. Tal abordagem pode ser útil para apoiar decisões no plano estratégico, por exemplo, a localização das bases das ambulâncias ao longo da rodovia e o dimensionamento das regiões de cobertura de cada base. Assim como apoiar decisões no plano operacional, por exemplo, a escolha da política de despacho das ambulâncias para atender chamados de urgência e a determinação das áreas de cobertura de cada servidor (quando a configuração do sistema puder ser alterada de acordo com as condições operacionais de uma semana ou de um dia). Para analisar o desempenho desta abordagem, realizamos estudos de casos com dados reais do sistema Anjos do Asfalto (rodovia Presidente Dutra) e da concessionária Centrovias (trechos das rodovias Washington Luis, Eng. Paulo Nilo Romano e Comandante João Ribeiro de Barros), no interior de São Paulo. Os resultados mostram que a abordagem é efetiva para apoiar decisões relacionadas ao planejamento e operação destes sistemas.
103

Análise dos serviços emergenciais de manutenção agrícola e borracharia na agroindústria canavieira utilizando teoria de filas

Rodrigues, Lásara Fabrícia 03 October 2014 (has links)
Made available in DSpace on 2016-06-02T19:50:25Z (GMT). No. of bitstreams: 1 6409.pdf: 5953158 bytes, checksum: 512230a587c3c0bebfcb0f30124c3e71 (MD5) Previous issue date: 2014-10-03 / The sugarcane industry is an important branch of the Brazilian agroindustry considering the major role of sugarcane cultivation in the country history and the prominent position that this industry has achieved in the international scenario. In recent years, this industry has faced major changes and challenges. Therefore, the use of methods to support decision making has become increasingly necessary to optimize the available resources and enable the analysis of larger data sets. The present study addresses the Maintenance and Tire Repair Emergency Services in the agricultural stage of the sugarcane industry. In order to analyze and support decisions in the Tire Repair System, the Hypercube Model, the Simulation Model, and the known Queue Models M/M/m and M/G/m were developed or adapted using data from a case study conducted in a sugar and alcohol mill with centralized servers. In addition, an alternative scenario with decentralized servers was also investigated, and it showed better results in terms of performance measures compared to those of the original scenario. Extensions of the Hypercube Model, the Approximated Hypercube Model and the Simulation Models were developed to analyze and support decisions in the Maintenance Service System. At first, an illustrative example was used to address the issues of priority queue, partial backup, and differentiated service rates between the hypercube states and the states of the tail. Subsequently, experiments using these models and the case study data were conducted. An alternative scenario including one more server was also studied, and it showed better results than those of the original scenario, especially in terms of travel times. The present study shows that the adaptations and extensions of the hypercube model and the simulation models developed to treat Maintenance and Tire Repair Emergency Systems in sugarcane mills have proven to be effective approaches for these systems planning and analysis. The results of this study indicate that the models developed and adapted are suitable for application in sugarcane industries. / A agroindústria canavieira constitui um importante ramo da agroindústria brasileira, tanto considerando a experiência histórica do Brasil no cultivo da cana-de-açúcar, quanto à posição de destaque que essa indústria ocupa atualmente no cenário mundial. Essa indústria enfrenta, nos últimos anos, grandes mudanças e desafios, tornando cada vez mais necessário utilizar métodos efetivos que apoiem a tomada de decisão dentro dessas empresas, otimizando os recursos disponíveis e possibilitando análise de um conjunto cada vez maior de dados. O presente trabalho aborda os Serviços de Emergência de Manutenção e Borracharia na etapa agrícola da indústria canavieira. Para analisar e apoiar decisões no Sistema da Borracharia, foram desenvolvidos ou adaptados o Modelo Hipercubo de Filas, um Modelo de Simulação e conhecidos Modelos de Filas M/M/m e M/G/m, utilizando os dados de um estudo de caso desenvolvido em uma usina de açúcar e álcool com servidores centralizados. Também foi analisado um cenário alternativo neste estudo com servidores descentralizados, que apresenta melhores resultados do ponto de vista de algumas medidas de desempenho em relação ao cenário original. Para analisar e apoiar decisões no Sistema de Manutenção, foram desenvolvidos extensões do Modelo Hipercubo de Filas, um Modelo Hipercubo Aproximado e Modelos de Simulação. Inicialmente utilizou-se um exemplo ilustrativo para tratar a prioridade na fila de espera e o backup parcial e taxas de atendimento diferenciadas entre os estados do hipercubo e os estados da cauda. Em seguida, foram realizados experimentos utilizando esses modelos e os dados coletados em um estudo de caso de um Sistema Emergencial de Manutenção em Campo. Foi também estudado um cenário alternativo que conta com mais um servidor em comparação com o cenário original e que apresenta resultados melhores que o cenário original, principalmente em relação aos tempos de viagem. Neste trabalho mostra-se que estas adaptações e extensões do modelo hipercubo de filas e os modelos de simulação desenvolvidos para tratar sistemas emergenciais de manutenção e borracharia em usinas são abordagens efetivas para análise e planejamento desses sistemas. Os resultados do estudo indicam que os modelos desenvolvidos e adaptados se mostram adequados para a aplicação no contexto da agroindústria canavieira.
104

Hypercube coloring and the structure of binary codes

Rix, James Gregory 11 1900 (has links)
A coloring of a graph is an assignment of colors to its vertices so that no two adjacent vertices are given the same color. The chromatic number of a graph is the least number of colors needed to color all of its vertices. Graph coloring problems can be applied to many real world applications, such as scheduling and register allocation. Computationally, the decision problem of whether a general graph is m-colorable is NP-complete for m ≥ 3. The graph studied in this thesis is a well-known combinatorial object, the k-dimensional hypercube, Qk. The hypercube itself is 2-colorable for all k; however, coloring the square of the cube is a much more interesting problem. This is the graph in which the vertices are binary vectors of length k, and two vertices are adjacent if and only if the Hamming distance between the two vectors is at most 2. Any color class in a coloring of Q2k is a binary (k;M, 3) code. This thesis will begin with an introduction to binary codes and their structure. One of the most fundamental combinatorial problems is finding optimal binary codes, that is, binary codes with the maximum cardinality satisfying a specified length and minimum distance. Many upper and lower bounds have been produced, and we will analyze and apply several of these. This leads to many interesting results about the chromatic number of the square of the cube. The smallest k for which the chromatic number of Q2k is unknown is k = 8; however, it can be determined that this value is either 13 or 14. Computational approaches to determine the chromatic number of Q28 were performed. We were unable to determine whether 13 or 14 is the true value; however, much valuable insight was learned about the structure of this graph and the computational difficulty that lies within. Since a 13-coloring of Q28 must have between 9 and 12 color classes being (8; 20; 3) binary codes, this led to a thorough investigation of the structure of such binary codes. / Graduate Studies, College of (Okanagan) / Graduate
105

Parallel Tomographic Image Reconstruction On Hierarchical Bus-Based And Extended Hypercube Architectures

Rajan, K 07 1900 (has links) (PDF)
No description available.
106

Pravděpodobnostní řešení porušení ochranné hráze v důsledku přelití / The probabilistic solution of dike breaching due to overtopping

Alhasan, Zakaraya January 2017 (has links)
Doctoral thesis deals with reliability analysis of flood protection dikes by estimating the probability of dike failure. This study based on theoretical knowledge, experimental and statistical researches, mathematical models and field survey extends present knowledge concerning with reliability analysis of dikes vulnerable to the problem of breaching due to overtopping. This study contains the results of probabilistic solution of breaching of a left bank dike of the River Dyje at a location adjacent to the village of Ladná near the town of Břeclav in the Czech Republic. Within thin work, a mathematical model describing the overtopping and erosion processes was proposed. The dike overtopping is simulated using simple surface hydraulics equations. For modelling the dike erosion which commences with the exceedance of erosion resistance of the dike surface, simple transport equations were used with erosion parameters calibrated depending on data from past real embankment failures. In the context of analysis of the model, uncertainty in input parameters was determined and subsequently the sensitivity analysis was carried out using the screening method. In order to achieve the probabilistic solution, selected input parameters were considered random variables with different probability distributions. For generating the sets of random values for the selected input variables, the Latin Hypercube Sampling (LHS) method was used. Concerning with the process of dike breaching due to overtopping, four typical phases were distinguished. The final results of this study take the form of probabilities for those typical dike breach phases.
107

Response Surface Analysis of Trapped-Vortex Augmented Airfoils

Zope, Anup Devidas 11 December 2015 (has links)
In this study, the effect of a passive trapped-vortex cell on lift to drag (L/D) ratio of an FFA-W3-301 airfoil is studied. The upper surface of the airfoil was modified to incorporate a cavity defined by seven parameters. The L/D ratio of the airfoil is modeled using a radial basis function metamodel. This model is used to find the optimal design parameter values that give the highest L/D. The numerical results indicate that the L/D ratio is most sensitive to the position on an airfoil’s upper surface at which the cavity starts, the position of the end point of the cavity, and the vertical distance of the cavity end point relative to the airfoil surface. The L/D ratio can be improved by locating the cavity start point at the point of separation for a particular angle of attack. The optimal cavity shape (o19_aXX) is also tested for a NACA0024 airfoil.
108

計算機實驗設計--旋轉因子設計 / Designing computer experiments: rotated factorial designs

侯永盛 Unknown Date (has links)
計算機模型可以描述複雜的物理現象,然而這些模型應用在科學研究時其運算需要很長的時間,而且要有特定的實驗設計才能了解現象的本質。在有缺少一個或數個主效應的情形下,因子設計是不適合的,因為在缺少主效應下時其重複實驗不但不能估計誤差,只是產生重複實驗。雖然已經有學者提出許多可替代的設計,但是大部份設計的計算還是很累贅。本篇論文所提出的一些設計是從旋轉平面的二維因子設計發展而來,這些旋轉因子的設計很容易建構而且保有許多標準因子設計中吸引人的性質:(1)在每個維度的投影是均等空間投影;(2)在迴歸模型中,估計效應是不相關的(即正交的)。這些設計被稱為最大化最小拉丁超方陣,其設計與近期學者建構的最小化內點間距離的準則是同等的。 關鍵字:有效相關((Effect Correaltion)、拉丁超方陣(Latin Hypercube)、最大化最小距離(Maximin Distance)、最大化最小內點距離(Minimum Interpoint Distance) / Computer models can describe complicated physical phenomena. To use these models for scientific investigation, however, their generally long running times and mostly deterministic nature require a special designed experiment. Standard factorial designs are inadequate; in the absence of one or more main effects, their replication cannot be used to estimate error but instead produces redundancy. A number of alternative designs have been proposed, but many can be burdensome computationally. This paper presents a class of designs developed from the rotation of a two-dimensional factorial design in the plane. These rotated factorial designs are very easy to construct and preserve many of the attractive properties of standard factorial designs: they have equally-spaced projections to univariate dimensions and uncorrelated regression effect estimates (orthogonality) . They also rate comparably to maximin Latin hypercube designs by the minimum interpoint distance criterion used in the latter "s construction. Key Word : Effect Correlation, Latin Hypercube, Maximin Distance, Minimum Interpoint Distance
109

[en] A SYSTEM FOR GENERATING DYNAMIC FACIAL EXPRESSIONS IN 3D FACIAL ANIMATION WITH SPEECH PROCESSING / [pt] UM SISTEMA DE GERAÇÃO DE EXPRESSÕES FACIAIS DINÂMICAS EM ANIMAÇÕES FACIAIS 3D COM PROCESSAMENTO DE FALA

PAULA SALGADO LUCENA RODRIGUES 24 April 2008 (has links)
[pt] Esta tese apresenta um sistema para geração de expressões faciais dinâmicas sincronizadas com a fala em uma face realista tridimensional. Entende-se por expressões faciais dinâmicas aquelas que variam ao longo do tempo e que semanticamente estão relacionadas às emoções, à fala e a fenômenos afetivos que podem modificar o comportamento de uma face em uma animação. A tese define um modelo de emoção para personagens virtuais falantes, de- nominado VeeM (Virtual emotion-to-expression Model ), proposto a partir de uma releitura e uma reestruturação do modelo do círculo emocional de Plutchik. O VeeM introduz o conceito de um hipercubo emocional no espaço canônico do R4 para combinar emoções básicas, dando origem a emoções derivadas. Para validação do VeeM é desenvolvida uma ferramenta de autoria e apresentação de animações faciais denominada DynaFeX (Dynamic Facial eXpression), onde um processamento de fala é realizado para permitir o sincronismo entre fonemas e visemas. A ferramenta permite a definição e o refinamento de emoções para cada quadro ou grupo de quadros de uma animação facial. O subsistema de autoria permite também, alternativamente, uma manipulação em alto-nível, através de scripts de animação. O subsistema de apresentação controla de modo sincronizado a fala da personagem e os aspectos emocionais editados. A DynaFeX faz uso de uma malha poligonal tridimensional baseada no padrão MPEG-4 de animação facial, favorecendo a interoperabilidade da ferramenta com outros sistemas de animação facial. / [en] This thesis presents a system for generating dynamic facial expressions synchronized with speech, rendered using a tridimensional realistic face. Dynamic facial expressions are those temporal-based facial expressions semanti- cally related with emotions, speech and affective inputs that can modify a facial animation behavior. The thesis defines an emotion model for speech virtual actors, named VeeM (Virtual emotion-to-expression Model ), which is based on a revision of the emotional wheel of Plutchik model. The VeeM introduces the emotional hypercube concept in the R4 canonical space to combine pure emotions and create new derived emotions. In order to validate VeeM, it has been developed an authoring and player facial animation tool, named DynaFeX (Dynamic Facial eXpression), where a speech processing is realized to allow the phoneme and viseme synchronization. The tool allows either the definition and refinement of emotions for each frame, or group of frames, as the facial animation edition using a high-level approach based on animation scripts. The tool player controls the animation presentation synchronizing the speech and emotional features with the virtual character performance. DynaFeX is built over a tridimensional polygonal mesh, compliant with MPEG-4 facial animation standard, what favors tool interoperability with other facial animation systems.
110

A Framework for the Determination of Weak Pareto Frontier Solutions under Probabilistic Constraints

Ran, Hongjun 09 April 2007 (has links)
A framework is proposed that combines separately developed multidisciplinary optimization, multi-objective optimization, and joint probability assessment methods together but in a decoupled way, to solve joint probabilistic constraint, multi-objective, multidisciplinary optimization problems that are representative of realistic conceptual design problems of design alternative generation and selection. The intent here is to find the Weak Pareto Frontier (WPF) solutions that include additional compromised solutions besides the ones identified by a conventional Pareto frontier. This framework starts with constructing fast and accurate surrogate models of different disciplinary analyses. A new hybrid method is formed that consists of the second order Response Surface Methodology (RSM) and the Support Vector Regression (SVR) method. The three parameters needed by SVR to be pre-specified are automatically selected using a modified information criterion based on model fitting error, predicting error, and model complexity information. The model predicting error is estimated inexpensively with a new method called Random Cross Validation. This modified information criterion is also used to select the best surrogate model for a given problem out of the RSM, SVR, and the hybrid methods. A new neighborhood search method based on Monte Carlo simulation is proposed to find valid designs that satisfy the deterministic constraints and are consistent for the coupling variables featured in a multidisciplinary design problem, and at the same time decouple the three loops required by the multidisciplinary, multi-objective, and probabilistic features. Two schemes have been developed. One scheme finds the WPF by finding a large enough number of valid design solutions such that some WPF solutions are included in those valid solutions. Another scheme finds the WPF by directly finding the WPF of each consistent design zone. Then the probabilities of the PCs are estimated, and the WPF and corresponding design solutions are found. Various examples demonstrate the feasibility of this framework.

Page generated in 0.0342 seconds