Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 5849 for “"NP"”.
-
Nosná konstrukce 2. NP rodinného domu
Předmětem bakalářské práce je návrh nosné dřevěné konstrukce pro druhé nadzemní podlaží rodinného domu v katastrálním území Jakubčovice a vytvoření 3D modelu pomocí metody BIM. Objekt je uvažován dvou podlažní bez suterénu. První nadzemní podlaží je tvořeno klasickými zděnými konstrukcemi s tuhými …
-
Learning to solve NP-complete problems
… decision variant of the TSP, a highly relevant NP-Complete problem. Our model is trained to function as an effective message-passing algorithm in graph in which edges from the input graph communicate with vertices from the input graph for a number of iterations after which the model is asked to …
-
Preverbal NP positions in Mandarin Chinese
This is a study of topicalization (OSV) and object preposing (SOV) in Mandarin Chinese. Whether topics in Mandarin are base-generated or derived by movement has been controversial. We provide a detailed discussion and show that they are derived by movement. Topicalization in Mandarin is generally …
-
An Interactive Tutorial for NP-Completeness
… Complexity Theory, reductions, and the NP-Complete class of problems are considered difficult by students. Numerous algorithm visualizations (AVs) have been developed over the years to portray the dynamic nature of known algorithms commonly taught in undergraduate classes. However, to …
-
Partitioning methods for NP-hard routing problems
… on developing partitioning frameworks for NP-hard routing problems. Specifically, different partitioning methods are applied to the traveling salesman problem (TSP), resource-constrained shortest path problem (RCSPP), and other related problems. The TSP framework, referred to as convex hull …
-
Approximation algorithms for NP-hard clustering problems
Given a set of n points and their pairwise distances, the goal of clustering is to partition the points into a “small” number of “related” sets. Clustering algorithms are used widely to manage, classify, and summarize many kinds of data. In this dissertation, we study the classic facility location …
-
Metaheuristics for NP-hard combinatorial optimization problems
In one part of this work, we studied how decomposition-based search methods can improve running time performance when solving very large optimization instances. In another part of the work, carried out a theoretical analysis on convergence properties of Graph-based Ant System and derived a method …
-
Sorption Modelling of Np(IV), Np(V), and Pd(II) on Illite and Montmorillonite Under High Ionic Strength Conditions
… at DGR depths in Ontario, Canada. Pd(II), Np(IV), and Np(V) have all been identified as elements of interest by the NWMO. Sorption experiments of Pd(II) were conducted on illite, bentonite, and shale to investigate the effects that ionic strength (I), and pH have on sorption. Na-Ca-Cl …
-
Mössbauer studies of ²³⁷Np in a synthetic monazite
… nuclear gamma resonance (NGR) for <sup>237</sup>Np in the compound NpPO<sub>4</sub> has been measured at 4.2 K following the α decay of <sup>241</sup>Am metal as a source. NGR was also measured in the compound NpO<sub>2</sub> at 4.2 K and 77 K following the α decay of <sup>241</sup>Am in the …
-
Modular DNA nanopore (NP) for targeted cell killing
… killing using self-assembling DNA nanopores (NPs). This study focuses on designing 6-helix bundle NP, featuring hydrophobic moieties that enable membrane insertion, leading to uncontrolled ion flow and ultimately to cell death. These NPs are conjugated site-specifically to rituximab, a …
-
L-changing in Na(Ns, Np)-Xe collisions
… field ionization have been used to study Na(nS,nP)-Xe collisions for 28 =< n =< 52. The predominate mode for destruction of the parent nS,nP atoms is l-changing. The time evolution of the A-mixed population is monitored at several times after laser fire and fit to a rate equation to determine …
-
Self-healing Omniphobic POSS-based NP-GLIDE Coating
… oligomeric silsesquioxane (POSS)–based NP-GLIDE coating that integrates omniphobicity, mechanical robustness, and thermally activated self-healing. The coating family, denoted (SH)x2k(tA)y, is constructed from T8 SH/tA-functional POSS cages bearing ~2 kDa PDMS side chains and …
-
Networks of hosts implementing DNS are NP-complete
… Boolean circuits. Finally, I discuss CSAT and NP-completeness.
-
The INDEPENDENT SET Decision Problem is NP-complete
… be precisely specified. They became known as the NP-complete problems. The SATISFIABILITY problem (SAT) was the first problem to be proved NP-complete in 1971. Since then numerous other hard-to-solve problems have been proved to be in NP-complete. In this paper we will examine the problem of how …
-
Mελέτη των συμπλόκων [VO{Ph2P(O)NP(O)Ph2}2] και [Cu{Ph2P(O)NP(O)Ph2}2] με φασματοσκοπία EPR
… είναι η μελέτη των S = ½ συμπλόκων[VO{Ph2P(O)NP(O)Ph2}2] και [Cu{Ph2P(O)NP(O)Ph2}2], κυρίως με την μέθοδο HYSCORE, μέσω της οποίας ανιχνεύονται πολύ ασθενείς αλληλεπιδράσεις μετάλλου-υποκαταστάτη. Οι εν λόγω αλληλεπιδράσεις εκφράζονται ποσοτικά μέσω των σταθερών υπέρλεπτης σύζευξης με τα άτομα …
-
A* paieškos algoritmo variantų tyrimai sprendžiant NP sudėtingumo uždavinius /
Solving NP problems is a difficult challange: a slight increase in problem’s size causes an exponential increase in problem’s complexity. It soon becomes impossible to find a solution in a given time. To mitigate this issue, A* algorithm is introduced ‑ it can solve a subclass of NP problems. A* …
-
Algorithms for NP-hard Optimization Problems and Cluster Analysis
… dominating set problem are all classical NP-hard optimization problems of great importance in both theory and real applications. Since the exact algorithms, which require exhaustive exploration of exponentially many options, are infeasible in practice, approximation algorithms and …
-
Sequential decay in the C__(d,np)C__ reaction
The C12(d,pn)C12 reaction has been studied using the Rice University high resolution 180° magnetic spectrometer for deuteron energies of 4.66, 4.89, 5.46 MeV. No evidence was found for the existence of a density of states cusp near the neutron threshold similar to that seen in the Be9(p,pn)Be8 …
Page 1 of 293