• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 10
  • 7
  • 1
  • Tagged with
  • 19
  • 19
  • 5
  • 5
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 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.
1

Trust Building for Online Private Sellers : Case of Taobao in China

Xu, Miaowen, Guo, Xinlei January 2016 (has links)
Aim:The aim of our study is to analyzeelements of online trust building process from sellers’ standpoint based on case study of Chinese website: Taobao. Method:This study was conducted in qualitative method with 12 interviewees as online sellers from Taobao website. Data presentation involves tables and figures to help readers to understand trust building process and apply it in business. Result & Conclusions: Online trust building is dynamic and interactive. Three main elements of trust building are product, communication and 3rd party. Trust building process goes through three stages: knowledge-based trust, experience-based trust, and relationship-based trust. Suggestions for future research: Limitation of generality suggests further study in quantitative method. Since it is a single case study specific in China, comparison cross-culture or between websites is also suggested as future possibilitiesto test generalizability of this theoretic framework. Contribution & implication: This study provided atheoretic framework for online trust building process in real-world context. Management implication was suggested to focus on development of product, communication and 3rdparty service for sellers and website holder
2

Modelagem e dimensionamento do custo de migração de processos em programas MPI

Neves, Marcelo Veiga January 2009 (has links)
A migração de processos é importante em programas MPI por vários motivos, tais como permitir re-escalonamento de processos, balanceamento de cargas e tolerância a falhas. Independentemente do tipo do uso da migração, conhecer o custo imposto pela realização desta operação é um problema pertinente. Quando utiliza-se migração para tentar diminuir o tempo de execução de uma aplicação paralela, este custo passa a ser um ponto crítico. Existem algumas soluções para migração de processos em programas MPI disponíveis atualmente. No entanto, ainda não existe um estudo que quantifique o custo destas migrações. Nesse contexto, este trabalho apresenta um estudo para modelar e dimensionar o custo de migração de processos em programasMPI. Primeiramente, o trabalho identificou, analisou, avaliou e, quando necessário, adaptou as principais soluções disponíveis atualmente para migrar processos MPI. Com base nessas soluções, foram criados modelos de custo que poderão ser utilizado para estimar dinamicamente os custos de migração e auxiliar na tomada de decisão em algoritmos de escalonamento. Osmodelos criados foram utilizados para estimar os custos demigração emaplicações paralelas e o resultado foi comparado comos custos demigração reais. Nesta comparação, os valores previsto ficaram bastante próximos dos valores observados no experimento, demonstrando a qualidade das previsões dos modelos propostos. / Process migration is essential for MPI programs for different reasons, such as processes rescheduling, load balancing and fault tolerance. Knowing well the cost necessary for this operation is a pertinent problem, regardless of the type of migration use. Whenever migration is used for improving the performance of parallel applications, its cost becomes a deciding point. Nowadays, there are some solutions to process migration available for MPI programs. However, there is not a study that can quantify the migration cost and its impact on the execution of MPI programs. In this context, this work presents a study for modeling and dimensioning the process migration cost in MPI programs. First, we identified, analyzed, evaluated and, when needed, adapted the main solutions which are presently available to migrate MPI processes. Based in these solutions, we defined cost models. These models can be used to dynamically estimate the migration costs and to guide scheduling decisions. These models were used to predict the migration cost in parallel applications and the result was compared to observed migration costs. In this comparison, the predicted values were very similar to those observed in the experiment. This work still shows an evaluation about the impact of a migration in the execution of real parallel applications in order to verifying the viability of applying this approach to improve the performance.
3

[en] NUMERICAL SIMULATION OF NATURAL GAS FLOW IN CITYGATE STATIONS / [pt] SIMULAÇÃO NUMÉRICA DO ESCOAMENTO EM ESTAÇÕES DE ENTREGA DE GÁS NATURAL

CLAUDIO VELOSO BARRETO 29 July 2011 (has links)
[pt] Análise numérica do processo dinâmico do escoamento de gás natural em estações de entrega, considerando o comportamento transiente dos principais equipamentos existentes, tais como válvula de três vias, válvulas redutoras de pressão e aquecedores de gás. Desenvolvimento da lógica de controle dinâmica (controle PID - proporcional-integral-derivativo) de todos os equipamentos relevantes. Para determinação das propriedades termodinâmicas do gás natural empregou-se as equações de estado Peng-Robinson e Soave-Redlich-Kwong. O estudo apresenta um maior enfoque na análise do comportamento de aquecedores de gás indireto a banho d’água e na regulagem dinâmica da temperatura de entrega através de um controlador PID que comanda a válvula de três vias. Investigou-se o desempenho de uma estação de entrega de gás natural existente baseada nas condições operacionais estabelecidas no projeto. Simulou-se o escoamento correspondente a operação em uma estação de entrega real e realizou-se comparação direta com dados de instrumentação enviados ao supervisório de controle e aquisição de dados (SCADA). A metodologia desenvolvida reproduziu de forma adequada a operação em condições normais da estação de entrega de São Carlos-SP e eventos anormais como cenários de apagamento dos aquecedores que foram registrados no banco de dados do supervisório. Finalmente analisaram-se procedimentos a serem aplicados nas estações de entrega existentes para redução do consumo do gás combustível utilizado no processo de pré-aquecimento. / [en] Numerical simulation of the dynamic process of natural gas flow through citygate stations, considering the transient behavior of the main existing equipments, such as three-way-valves, pressure reduction valves and gas heaters. Development of the dynamic control logic (PID controller) of all relevant equipments. To determine the natural gas thermodynamic properties, the equations of state of Peng-Robinson and Soave-Redlich-Kwong were employed. The study concentrates in the analysis of indirect fired water bath heater and in the delivery temperature regulation using a PID controller that commands the three-way-valve. It was investigated the performance of an existing natural gas citygate station based on established design operational conditions. The flow field corresponding to an operational natural gas city gate station was determined and direct comparison with instrumentation data sent to supervisory control and data acquistion (SCADA) was performed. The methodology developed reproduced in a satisfactory way the normal operational condition of the São Carlos-SP natural gas citygate station and abnormal events such as the heater shut-down scenarios registered on SCADA database. Finally, procedures to be applied in existing delivery stations for the reduction of gas fuel consumption in the pre-heating process were analyzed.
4

Modelagem e dimensionamento do custo de migração de processos em programas MPI

Neves, Marcelo Veiga January 2009 (has links)
A migração de processos é importante em programas MPI por vários motivos, tais como permitir re-escalonamento de processos, balanceamento de cargas e tolerância a falhas. Independentemente do tipo do uso da migração, conhecer o custo imposto pela realização desta operação é um problema pertinente. Quando utiliza-se migração para tentar diminuir o tempo de execução de uma aplicação paralela, este custo passa a ser um ponto crítico. Existem algumas soluções para migração de processos em programas MPI disponíveis atualmente. No entanto, ainda não existe um estudo que quantifique o custo destas migrações. Nesse contexto, este trabalho apresenta um estudo para modelar e dimensionar o custo de migração de processos em programasMPI. Primeiramente, o trabalho identificou, analisou, avaliou e, quando necessário, adaptou as principais soluções disponíveis atualmente para migrar processos MPI. Com base nessas soluções, foram criados modelos de custo que poderão ser utilizado para estimar dinamicamente os custos de migração e auxiliar na tomada de decisão em algoritmos de escalonamento. Osmodelos criados foram utilizados para estimar os custos demigração emaplicações paralelas e o resultado foi comparado comos custos demigração reais. Nesta comparação, os valores previsto ficaram bastante próximos dos valores observados no experimento, demonstrando a qualidade das previsões dos modelos propostos. / Process migration is essential for MPI programs for different reasons, such as processes rescheduling, load balancing and fault tolerance. Knowing well the cost necessary for this operation is a pertinent problem, regardless of the type of migration use. Whenever migration is used for improving the performance of parallel applications, its cost becomes a deciding point. Nowadays, there are some solutions to process migration available for MPI programs. However, there is not a study that can quantify the migration cost and its impact on the execution of MPI programs. In this context, this work presents a study for modeling and dimensioning the process migration cost in MPI programs. First, we identified, analyzed, evaluated and, when needed, adapted the main solutions which are presently available to migrate MPI processes. Based in these solutions, we defined cost models. These models can be used to dynamically estimate the migration costs and to guide scheduling decisions. These models were used to predict the migration cost in parallel applications and the result was compared to observed migration costs. In this comparison, the predicted values were very similar to those observed in the experiment. This work still shows an evaluation about the impact of a migration in the execution of real parallel applications in order to verifying the viability of applying this approach to improve the performance.
5

Modelagem e dimensionamento do custo de migração de processos em programas MPI

Neves, Marcelo Veiga January 2009 (has links)
A migração de processos é importante em programas MPI por vários motivos, tais como permitir re-escalonamento de processos, balanceamento de cargas e tolerância a falhas. Independentemente do tipo do uso da migração, conhecer o custo imposto pela realização desta operação é um problema pertinente. Quando utiliza-se migração para tentar diminuir o tempo de execução de uma aplicação paralela, este custo passa a ser um ponto crítico. Existem algumas soluções para migração de processos em programas MPI disponíveis atualmente. No entanto, ainda não existe um estudo que quantifique o custo destas migrações. Nesse contexto, este trabalho apresenta um estudo para modelar e dimensionar o custo de migração de processos em programasMPI. Primeiramente, o trabalho identificou, analisou, avaliou e, quando necessário, adaptou as principais soluções disponíveis atualmente para migrar processos MPI. Com base nessas soluções, foram criados modelos de custo que poderão ser utilizado para estimar dinamicamente os custos de migração e auxiliar na tomada de decisão em algoritmos de escalonamento. Osmodelos criados foram utilizados para estimar os custos demigração emaplicações paralelas e o resultado foi comparado comos custos demigração reais. Nesta comparação, os valores previsto ficaram bastante próximos dos valores observados no experimento, demonstrando a qualidade das previsões dos modelos propostos. / Process migration is essential for MPI programs for different reasons, such as processes rescheduling, load balancing and fault tolerance. Knowing well the cost necessary for this operation is a pertinent problem, regardless of the type of migration use. Whenever migration is used for improving the performance of parallel applications, its cost becomes a deciding point. Nowadays, there are some solutions to process migration available for MPI programs. However, there is not a study that can quantify the migration cost and its impact on the execution of MPI programs. In this context, this work presents a study for modeling and dimensioning the process migration cost in MPI programs. First, we identified, analyzed, evaluated and, when needed, adapted the main solutions which are presently available to migrate MPI processes. Based in these solutions, we defined cost models. These models can be used to dynamically estimate the migration costs and to guide scheduling decisions. These models were used to predict the migration cost in parallel applications and the result was compared to observed migration costs. In this comparison, the predicted values were very similar to those observed in the experiment. This work still shows an evaluation about the impact of a migration in the execution of real parallel applications in order to verifying the viability of applying this approach to improve the performance.
6

Designing Support For MPI-2 Programming Interfaces On Modern InterConnects

Gangadharappa, Tejus A. 02 September 2009 (has links)
No description available.
7

Adjusting Process Count on Demand for Petascale Global Optimization

Radcliffe, Nicholas Ryan 16 January 2012 (has links)
There are many challenges that need to be met before efficient and reliable computation at the petascale is possible. Many scientific and engineering codes running at the petascale are likely to be memory intensive, which makes thrashing a serious problem for many petascale applications. One way to overcome this challenge is to use a dynamic number of processes, so that the total amount of memory available for the computation can be increased on demand. This thesis describes modifications made to the massively parallel global optimization code pVTdirect in order to allow for a dynamic number of processes. In particular, the modified version of the code monitors memory use and spawns new processes if the amount of available memory is determined to be insufficient. The primary design challenges are discussed, and performance results are presented and analyzed. / Master of Science
8

Reconstrução tomográfica dinâmica industrial

OLIVEIRA, Eric Ferreira de 29 February 2016 (has links)
Submitted by Rafael Santana (rafael.silvasantana@ufpe.br) on 2017-05-11T18:10:34Z No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Versão Atualizada Tese Eric Ferreira de Oliveira.pdf: 1865683 bytes, checksum: 517608a245f6372afd45b3bba78733d6 (MD5) / Made available in DSpace on 2017-05-11T18:10:34Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Versão Atualizada Tese Eric Ferreira de Oliveira.pdf: 1865683 bytes, checksum: 517608a245f6372afd45b3bba78733d6 (MD5) Previous issue date: 2016-02-29 / CNEN / O estado da arte dos métodos aplicados para processos industriais é atualmente baseado em princípios de reconstruções tomográficas clássicas desenvolvidos para padrões tomográficos de distribuições estáticas, ou seja, são limitados a processos de pouca variabilidade. Ruídos e artefatos de movimento são os principais problemas causados pela incompatibilidade nos dados gerada pelo movimento. Além disso, em processos tomográficos industriais é comum um número limitado de dados podendo produzir ruído, artefatos e não concordância com a distribuição em estudo. Um dos objetivos do presente trabalho é discutir as dificuldades que surgem da implementação de algoritmos de reconstrução em tomografia dinâmica que foram originalmente desenvolvidos para distribuições estáticas. Outro objetivo é propor soluções que visam reduzir a perda de informação temporal devido a utilização de técnicas estáticas em processos dinâmicos. No que diz respeito à reconstrução de imagem dinâmica foi realizada uma comparação entre diferentes métodos de reconstrução estáticos, como MART e FBP, quando usado para cenários dinâmicos. Esta comparação foi baseada em simulações por MCNPX, e também analiticamente, de um cilindro de alumínio que se move durante o processo de aquisição, e também com base em imagens de cortes transversais de técnicas de CFD. Outra contribuição foi aproveitar o canal triplo de cores necessário para exibir imagens coloridas na maioria dos monitores, de modo que, dimensionando adequadamente os valores adquiridos de cada vista no sistema linear de reconstrução, foi possível imprimir traços temporais na imagem tradicionalmente reconstruída. Finalmente, uma técnica de correção de movimento usado no campo da medicina foi proposto para aplicações industriais, considerando-se que a distribuição de densidade nestes cenários pode apresentar variações compatíveis com movimentos rígidos ou alterações na escala de certos objetos. A ideia é usar dados conhecidos a priori ou durante o processo, como vetor deslocamento, e então usar essas informações para melhorar a qualidade da reconstrução. Isto é feito através da manipulação adequada da matriz peso no método algébrico, isto é, ajustando-se os valores para refletir o movimento objeto do previsto ou deformação. Os resultados de todas essas técnicas aplicadas em vários experimentos e simulações são discutidos neste trabalho. / The state of the art methods applied to industrial processes is currently based on the principles of classical tomographic reconstructions developed for tomographic patterns of static distributions, or is limited to cases of low variability of the density distribution function of the tomographed object. Noise and motion artifacts are the main problems caused by a mismatch in the data from views acquired in different instants. All of these add to the known fact that using a limited amount of data can result in the presence of noise, artifacts and some inconsistencies with the distribution under study. One of the objectives of the present work is to discuss the difficulties that arise from implementing reconstruction algorithms in dynamic tomography that were originally developed for static distributions. Another objective is to propose solutions that aim at reducing a temporal type of information loss caused by employing regular acquisition systems to dynamic processes. With respect to dynamic image reconstruction it was conducted a comparison between different static reconstruction methods, like MART and FBP, when used for dynamic scenarios. This comparison was based on a MCNPx simulation as well as an analytical setup of an aluminum cylinder that moves along the section of a riser during the process of acquisition, and also based on cross section images from CFD techniques. As for the adaptation of current tomographic acquisition systems for dynamic processes, this work established a sequence of tomographic views in a just-in-time fashion for visualization purposes, a form of visually disposing density information as soon as it becomes amenable to image reconstruction. A third contribution was to take advantage of the triple color channel necessary to display colored images in most displays, so that, by appropriately scaling the acquired values of each view in the linear system of the reconstruction, it was possible to imprint a temporal trace into the regularly reconstructed image, where the temporal trace utilizes a channel and the regular reconstruction utilizes a different one. Finally, a motion correction technique used in the medical field was proposed for industrial applications, considering that the density distribution in these scenarios may present variations compatible with rigid motions or changes in scale of certain objects. The idea is to identify in some configurations of the temporarily distributed data clues of the type of motion or deformation suffered by the object during the data acquisition, and then use this information to improve the quality of the reconstruction. This is done by appropriately manipulating the weight matrix in the algebraic method, i.e., by adjusting the values to reflect the predicted object motion or deformation. The results of all these techniques applied in several experiments and simulations are discussed in this work.
9

Le modèle bayésien de l’intégration identitaire : vers une approche dynamique des processus internes du soi

Mérineau, Samuel 04 1900 (has links)
Nos sociétés évoluent et se transforment constamment. Il devient de plus en plus difficile pour chacun de nous d’éviter le changement social. Lorsqu’un changement survient, nous devons modifier qui nous sommes afin de s’adapter à notre nouvel environnement et ressentir du bien-être. Plusieurs études ont proposé des étapes menant à l’intégration identitaire, mais ces processus demeurent limités sur une perspective statique. Les processus statiques ne parviennent pas à expliquer le processus itératif utilisé chaque jour pour intégrer une nouvelle identité. Le but de notre étude est de fusionner deux champs de la littérature : la psychologie sociale et les neurosciences afin de créer le Modèle bayésien d’intégration identitaire (MBII). Lors d’une première étude, nous discutons du fondement théorique du MBII ainsi que deux exemples fictifs de l’intégration d’une identité personnelle et sociale. Dans la seconde étude, nous testons certaines parties du MBII dans le contexte de la légalisation du cannabis au Canada. Ce contexte peut avoir changé l’intégration du cannabis des Canadiens dans leur identité de groupe. Nous avons mesuré l’intégration du cannabis de 1682 Canadiens sur trois temps de mesure à l’aide d’un questionnaire. Nous avons utilisé le MBII sur les trois temps de mesure afin de prédire l’intégration du cannabis au temps 3. Des analyses de régression montrent que les scores prédits par le MBII prédisent positivement les scores rapportés par les participants au temps 3. Les implications théoriques, méthodologiques et pratiques sont discutées. / Societies grow and modify themselves continually. It becomes more and more difficult for people to avoid social change. When social change does show up, people need to modify who they are as to adapt themselves to their new environment and experience well-being. Several studies propose stages that lead to identity integration, but these processes remain limited to a static perspective. Static processes cannot explain how people actualize their identities on an iterative basis every day. The goal of the present study is to develop a new dynamic conceptualization of identity integration. To do so, we merge two fields of research: social psychology and fields of computed neuroscience and machine learning as to create our model: The Bayesian Model of Identity Integration (BMII). We discuss and test the BMII in two studies. In the first study, we describe the theoretical basis of our model along with two examples of how the BMII could explain a personal and a social identity integration. In the second study, we test several parts of the BMII in the context of cannabis legalization in Canada. Such context may have changed people’s integration of cannabis into their identity of Canadians. We measure cannabis integration of 1682 Canadians over three measurement time questionnaires. The BMII is used on all three questionnaires and produce scores that aim to predict cannabis integration at time 3. Regression tests between predicted scores and actual scores of cannabis integration at time 3 shows positive predictions. Theoretical, methodological and practical implications are discussed.
10

Cognitive Modeling of high-level cognition through Discrete State Dynamic processes

D'Alessandro, Marco 17 February 2021 (has links)
Modeling complex cognitive phenomena is a challenging task, especially when it is required to account for the functioning of a cognitive system interacting with an uncertain and changing environment. Psychometrics offers a heterogeneous corpus of computational tools to infer latent cognitive constructs from the observation of behavioral outcomes. However, there is not an explicit consensus regarding the optimal way to properly take into account the intrinsic dynamic properties of the environment, as well as the dynamic nature of cognitive states. In the present dissertation, we explore the potentials of relying on discrete state dynamic models to formally account for the unfolding of cognitive sub-processes in changing task environments. In particular, we propose Probabilistic Graphical Models (PGMs) as an ideal and unifying mathematical language to represent cognitive dynamics as structured graphs codifying (causal) relationships between cognitive sub-components which unfolds in discrete time. We propose several works demonstrating the advantage and the representational power of such a modeling framework, by providing dynamic models of cognition specified according to different levels of abstraction.

Page generated in 0.0705 seconds