• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 316
  • 157
  • 140
  • 68
  • 54
  • 29
  • 19
  • 10
  • 9
  • 8
  • 8
  • 6
  • 6
  • 6
  • 5
  • Tagged with
  • 927
  • 121
  • 75
  • 65
  • 64
  • 59
  • 55
  • 51
  • 50
  • 49
  • 48
  • 47
  • 45
  • 42
  • 42
  • 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.
541

Three-dimensional modeling of rigid pavement

Beegle, David J. January 1998 (has links)
No description available.
542

Structural Insight into Self-assembly of Coacervate-forming Polyesteramides

Liu, Xinhao 03 August 2022 (has links)
No description available.
543

Triple generations of the Lyons sporadic simple group

Motalane, Malebogo John 03 1900 (has links)
The Lyons group denoted by Ly is a Sporadic Simple Group of order 51765179004000000 = 28 37 56 7 11 31 37 67. It(Ly) has a trivial Schur Multiplier and a trivial Outer Automorphism Group. Its maximal subgroups are G2(5) of order 5859000000 and index 8835156, 3 McL:2 of order 5388768000 and index 9606125, 53 L3(5) of order 46500000 and index 1113229656, 2 A11 of order 29916800 and index 1296826875, 51+4 + :4S6 of order 9000000 and index 5751686556, 35:(2 M11) of order 3849120 and index 13448575000, 32+4:2 A5 D8 of order 699840 and index 73967162500, 67:22 of order 1474 and index 35118846000000 and 37:18 of order 666 and index 77725494000000. Its existence was suggested by Richard Lyons. Lyons characterized its order as the unique possible order of any nite simple group where the centralizer of some involution is isomorphic to the nontrivial central extension of the alternating group of degree 11 by the cyclic group of order 2. Sims proved the existence of this group and its uniqueness using permutations and machine calculations. In this dissertation, we compute the (p; q; t)-generations of the Lyons group for dis- tinct primes p, q and t which divide the order of Ly such that p < q < t. For computations, we made use of the Computer Algebra System GAP / Mathematical Sciences / M.Sc. (Mathematics)
544

Web service control of component-based agile manufacturing systems

Phaithoonbuathong, Punnuluk January 2009 (has links)
Current global business competition has resulted in significant challenges for manufacturing and production sectors focused on shorter product lifecyc1es, more diverse and customized products as well as cost pressures from competitors and customers. To remain competitive, manufacturers, particularly in automotive industry, require the next generation of manufacturing paradigms supporting flexible and reconfigurable production systems that allow quick system changeovers for various types of products. In addition, closer integration of shop floor and business systems is required as indicated by the research efforts in investigating "Agile and Collaborative Manufacturing Systems" in supporting the production unit throughout the manufacturing lifecycles. The integration of a business enterprise with its shop-floor and lifecycle supply partners is currently only achieved through complex proprietary solutions due to differences in technology, particularly between automation and business systems. The situation is further complicated by the diverse types of automation control devices employed. Recently, the emerging technology of Service Oriented Architecture's (SOA's) and Web Services (WS) has been demonstrated and proved successful in linking business applications. The adoption of this Web Services approach at the automation level, that would enable a seamless integration of business enterprise and a shop-floor system, is an active research topic within the automotive domain. If successful, reconfigurable automation systems formed by a network of collaborative autonomous and open control platform in distributed, loosely coupled manufacturing environment can be realized through a unifying platform of WS interfaces for devices communication. The adoption of SOA- Web Services on embedded automation devices can be achieved employing Device Profile for Web Services (DPWS) protocols which encapsulate device control functionality as provided services (e.g. device I/O operation, device state notification, device discovery) and business application interfaces into physical control components of machining automation. This novel approach supports the possibility of integrating pervasive enterprise applications through unifying Web Services interfaces and neutral Simple Object Access Protocol (SOAP) message communication between control systems and business applications over standard Ethernet-Local Area Networks (LAN's). In addition, the re-configurability of the automation system is enhanced via the utilisation of Web Services throughout an automated control, build, installation, test, maintenance and reuse system lifecycle via device self-discovery provided by the DPWS protocol.
545

Paprasto skylėto daugiakampio skaidymo algoritmai / Algorithms for decomposition of simple polygon with holes

Motiejauskas, Danas 22 June 2010 (has links)
Baigiamajame magistro darbe nagrinėjama paprasto skylėto daugiakampio skaidymo į dalis, kurių viršūnių skaičius neviršyja nustatyto skaičiaus problema. Apibrėžiamas uždavinys ir jo svarba. Apžvelgiami egzistuojantys skaidymo algoritmai, padedantys išspręsti uždavinį, bei jų realizacijos. Pateikiamos trianguliacijos ir padalinimo į apytiksliai iškilius daugiakampius algoritmų modifikacijos, jų privalumai ir trūkumai. Įvertinamas šių modifikuotų algoritmų sudėtingumas. Eksperimentinėje dalyje pateikiami skaičiavimo eksperimentų rezultatai, jų analizė ir palyginimas su teoriniais algoritmų sudėtingumo įverčiais. Remiantis skaičiavimo eksperimentų rezultatais pateikiamos išvados ir siūlymai. / This study deals with decomposition of simple polygon with holes into components so that every piece does not exceed some defined number of vertices. We define the problem and its appliances. Existing studies and algorithms for polygon decomposition are covered. We propose modifications of polygon triangulation and approximate convex decomposition algorithms. Also the complexity analysis of both algorithms is made. In the experimental part of the work results of computing experiments are presented, analyzed and compared to the theoretical complexity bounds.
546

KISSing and other strategies for successful communication : A case study on communication between Nordic and Chinese business people using English as a lingua franca / “KISSing” och andra strategier för framgångsrik kommunikation : En fallstudie om kommunikation mellan nordiska och kinesiska affärsmän och   -kvinnor som använder engelska som lingua franca

Rixer, Johanna January 2016 (has links)
This is a case study on the communication between Nordic and Chinese business people using English as a lingua franca in their business communication. The aim of this paper is to establish if misunderstandings in communication occur between Chinese and Nordic language speakers (Finnish and Swedish) in a business environment and, if they do, what the nature of these misunderstandings is. In this paper, recorded conversations are analysed to establish if there are misunderstandings between the parties. The recordings were made at a global industrial company in Sweden and in China. Interviews with the participants were also carried out in order to establish their own ideas concerning the communication flow and to find out if the participants are themselves aware of using any particular communication strategies when interacting with one another. The results of the case study show that there were some misunderstandings in the communication between Nordic and Chinese business people; however, there were not any particularly serious misunderstandings with respect to the company’s business aims and objectives. The results indicate that the parties use communication strategies to enhance their messages and to determine if a message has been conveyed successfully. The strategies that were commonly used were confirmations in the form of follow-up questions and speaking slowly. Written or non-verbal communication were found to be used as a supplement to verbal communication. A strategy that the participants themselves noted as successful was keeping their messages short and simple. This is also known as the KISS-principle. The result of the study indicates potential misunderstandings caused by the Chinese using Yes as an act of active listening rather than agreement and it is suggested that an awareness of this cultural difference may help improve the intercultural communication between the parties.
547

Analyse de la variation terminologique en corpus parallèle anglais-espagnol et de son incidence sur l'extraction des termes bilingue

Carreño Cruz, Sahara Iveth January 2004 (has links)
Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.
548

Évaluation de l’effet du neurofeedback sur les capacités d’inhibition d’enfants ayant un Trouble déficitaire de l’attention avec hyperactivité

Perreau-Linck, Elisabeth 05 1900 (has links)
Le neurofeedback (NF) suscite actuellement un vif intérêt dans la prise en charge du trouble déficitaire de l’attention avec hyperactivité (TDAH) chez l’enfant. Proposée comme méthode alternative à la médication par de nombreux cliniciens, notamment aux États-Unis, le NF est une intervention non-invasive de type électrophysiologique qui repose sur l’apprentissage par conditionnement opérant de l’autorégulation d’ondes cérébrales déviantes. Les études empiriques qui étayent cette pratique font toutefois l’objet de virulentes critiques de la part de spécialistes dans le domaine du TDAH en raison de résultats systématiquement positifs mais non spécifiques, auxquels s’ajoutent de nombreuses lacunes méthodologiques. Les travaux de cette thèse visent à appliquer une méthodologie stricte de type essai clinique contrôlé avec assignation aléatoire afin d’isoler les effets particuliers du NF, en appliquant un protocole d’entraînement propre au déficit primaire sous-tendant le TDAH, soit l’inhibition motrice, dans le but d’évaluer la spécificité de cette intervention. Dans un premier temps, les connaissances relatives à la nosologie du TDAH, à ses principaux traitements, au NF et aux capacités d’inhibition chez l’enfant ayant un TDAH sont présentées (Chapitre 1). Ensuite, les études réalisées dans le cadre de cette thèse sont exposées. Dans l’étude initiale, la spécificité du NF est évaluée sur les capacités d’inhibition grâce à des mesures subjectives, soit des questionnaires de comportements complétés par les parents, ainsi que des mesures objectives, à savoir des tâches neuropsychologiques (Chapitre 2). Afin de préciser davantage les conséquences d’un entraînement à l’autorégulation d’ondes cérébrales, l’étude subséquente s’est intéressée à l’impact neurophysiologiques de l’amélioration des capacités d’inhibition, par le biais d’une étude en potentiels évoqués employant une tâche de performance continue de type Stop-signal (Chapitre 3). Les principaux résultats reflètent un recrutement sous optimal, avec une puissance statistique insuffisante pour réaliser des statistiques quantitatives de groupe. Néanmoins, l’appréciation des données selon une approche d’étude de cas multiples permet de mettre en évidence la présence d’une réponse placebo sur les capacités d’inhibition suite à un entraînement en NF. Finalement, les implications de la taille de l’échantillon, ainsi que les limites et les critiques de ces études sont discutées au Chapitre 4. / In recent years, there has been a lively interest in the use of neurofeedback (NF) as an alternative treatment to pharmacotherapy in pediatric Attention-deficit hyperactivity disorder (ADHD). NF is defined as an operant conditioning procedure whereby an individual learns to self-regulate electrical brain activity. Yet, empirical studies supporting its practice are harshly criticized in the field of ADHD research due to systematic unspecific positive results associated to numerous methodological flaws. Studies presented in this dissertation aim at applying a randomized placebo-controlled clinical trial to the investigation of NF specific effects. In order to further establish treatment specificity, we trained the participants using a NF protocol characteristic to motor-inhibition functioning since it has repeatedly been described as the core deficit in ADHD. The fist part of this thesis comprises a brief review of knowledge concerning ADHD, principal treatments offered for this disorder, NF research in pediatric ADHD and inhibition abilities in these children (Chapter 1). Following are the two studies conducted as part of this dissertation. In the initial study, effects of NF training are investigated on inhibition capacities by means of behavior rating scales and neuropsychological tests (Chapter 2). With the aim of further defining the consequence of training to self-regulate ones brain activity, the subsequent study looks at the neurophysiologic impact of improving inhibition capacities with an event-related potential study using a Stop-signal continuous performance task (Chapter 3). The principal results reveal a non optimal recruitment, with insufficient statistical power, thus precluding quantitative group statistics. Nevertheless, appreciating the data from a multiple case study perspective enables to suggest that a placebo response could be at play following NF training, such as measured by improvements on inhibition capacities. Finally, the implications of such a small sample size, limits and critics of these studies are discussed in Chapter 4.
549

Einführung in die Ökonometrie

Huschens, Stefan 30 March 2017 (has links) (PDF)
Die Kapitel 1 bis 6 im ersten Teil dieses Skriptes beruhen auf einer Vorlesung Ökonometrie I, die zuletzt im WS 2001/02 gehalten wurde, die Kapitel 7 bis 16 beruhen auf einer Vorlesung Ökonometrie II, die zuletzt im SS 2006 gehalten wurde. Das achte Kapitel enthält eine komprimierte Zusammenfassung der Ergebnisse aus dem Teil Ökonometrie I.
550

« Resolution Search » et problèmes d’optimisation discrète

Posta, Marius 02 1900 (has links)
Thèse réalisée en cotutelle avec l'Université d'Avignon. / Les problèmes d’optimisation discrète sont pour beaucoup difficiles à résoudre, de par leur nature combinatoire. Citons par exemple les problèmes de programmation linéaire en nombres entiers. Une approche couramment employée pour les résoudre exactement est l’approche de Séparation et Évaluation Progressive. Une approche différente appelée « Resolution Search » a été proposée par Chvátal en 1997 pour résoudre exactement des problèmes d’optimisation à variables 0-1, mais elle reste mal connue et n’a été que peu appliquée depuis. Cette thèse tente de remédier à cela, avec un succès partiel. Une première contribution consiste en la généralisation de Resolution Search à tout problème d’optimisation discrète, tout en introduisant de nouveaux concepts et définitions. Ensuite, afin de confirmer l’intérêt de cette approche, nous avons essayé de l’appliquer en pratique pour résoudre efficacement des problèmes bien connus. Bien que notre recherche n’ait pas abouti sur ce point, elle nous a amené à de nouvelles méthodes pour résoudre exactement les problèmes d’affectation généralisée et de localisation simple. Après avoir présenté ces méthodes, la thèse conclut avec un bilan et des perspectives sur l’application pratique de Resolution Search. / The combinatorial nature of discrete optimization problems often makes them diffi- cult to solve. Consider for instance integer linear programming problems, which are commonly solved using a Branch-and-Bound approach. An alternative approach, Resolution Search, was proposed by Chvátal in 1997 for solving 0-1 optimization problems, but remains little known to this day and as such has seen few practical applications. This thesis attempts to remedy this state of affairs, with partial success. Its first contribution consists in the generalization of Resolution Search to any discrete optimization problem, while introducing new definitions and concepts. Next, we tried to validate this approach by attempting to solve well-known problems efficiently with it. Although our research did not succeed in this respect, it lead us to new methods for solving the generalized assignment and uncapacitated facility location problems. After presenting these methods, this thesis concludes with a summary of our attempts at practical application of Resolution Search, along with further perspectives on this matter.

Page generated in 0.026 seconds