Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: K-Systems.

Dissertationen zum Thema „K-Systems“

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "K-Systems" 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

Joss, Matthew Albert Henry. „K-Star rapid rotators and the detection of relatively young multiple K-Star systems“. Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/90661.

Der volle Inhalt der Quelle
Annotation:
Thesis: S.B. in Physics and Earth, Atmospheric, and Planetary Sciences, Massachusetts Institute of Technology, Department of Physics, 2014.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 55-56).
In this thesis, I searched through the Kepler light curves of 14,440 K-star targets for evidence of periodicities that indicate rapid stellar rotation. Many Kepler M, K, and G stars show modulations in flux due to rotating star spots, and these have been previously investigated by a number of different groups. Rotational periodicities mediated by the rotation of stellar spots were identified using Fourier transforms of Kepler light curves. Additional analytical techniques including the folding of light curves and the utilization of 'sonograms' were used to support our hypothesis that these periodicities arise from the rotation of stellar spots as opposed to planetary transits, binary eclipses, or stellar pulsations. In total, 293 of the Kepler K-star targets exhibited rotational periods, Prot, of 2 days or less. Of these 293 targets, 17 systems show two or more independent short periods within the same photometric aperture. Images from the United Kingdom Infra Red Telescope (UKIRT) provide evidence for my conclusion that these 17 targets with multiple periods are likely to be relatively young binary and triple K-star systems. The ~ 2% occurrence rate of rapid rotation among the 14,440 K star targets is consistent with spin evolution models that presume an initial contraction phase followed by spin down due to magnetic braking where typical K stars would be expected to spend up to a few hundred million years before slowing down to a rotation period of more than 2 days.
by Matthew Albert Henry Joss.
S.B.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Ewing, Alistair Kyles. „Lattice calculations in the B and K systems“. Thesis, University of Southampton, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.241142.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Williams, Tomicka Nicole. „Crisis Communication Systems Among K-12 School Principals“. ScholarWorks, 2019. https://scholarworks.waldenu.edu/dissertations/6704.

Der volle Inhalt der Quelle
Annotation:
Crisis communication systems (CCS) in educational settings have been challenged by mass casualty events including shootings, natural disasters, and health outbreaks in the United States. The U.S. federal government and the U.S. Department of Education have created safety and security instructions to manage these complex and diverse security issues, yet they do not address the role of school leaders within a CCS. Using complex adaptive systems as the theoretical construct, the purpose of this qualitative case study was to examine CCSs utilized by school leaders within a single public school district in the United States. The research questions are focused on the influence of components in a CCS, CCS influence on safety and security, and the school leader's role. Data were collected through interviews with 20 school principals and assistant principals of the school district. Interview data were inductively coded and subjected to thematic analysis. Findings indicate that approximately 40% of interviewees believe that communication behavior was the most critical component in a CCS. Methods of communication are varied and include a combination of technologies and behaviors. In addition, the majority of participants reported that internal decision making used by human agents in a CCS influences safety and security in an educational environment. The positive social change implications stemming from this study include recommendations to the school district to enhance communication systems with both human and nonhuman methods, which may contribute to creating safer educational settings for students, faculty, and communities.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Pillay, Venasan. „The simulation of electrolyte Systems: the System K-Na-Mg-CI-S04-H20“. Master's thesis, University of Cape Town, 2004. http://hdl.handle.net/11427/5414.

Der volle Inhalt der Quelle
Annotation:
Includes bibliographical references.
The objectives of this work were to carry out a critical review of relevant literature on existing models and to thereafter select and input this model into mathematical modelling software in order to set up a simulator. Once the simulator converged to a solution, it was shown that the simulator predictions are accurate. Thereafter, the simulator was applied to two industrial issues so that its usefulness could be demonstrated.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Coucopoulos, Georges Carleton University Dissertation Computer Science. „Continuously K-tolerant systems: schemes for maintaining full availability in distributed file systems“. Ottawa, 1994.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Klundt, Kai. „Optimierung eines Pulsröhrenkühler-Systems für die Sensorkühlung bei 80 K“. [S.l. : s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=959042547.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Breda, Kara. „Validation of Ohio’s Proposed Reforms for K-12 Accountability Systems“. The Ohio State University, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=osu1513878179808997.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

MONTI, DIEGO MICHELE. „Multicriteria Evaluation for Top-k and Sequence-based Recommender Systems“. Doctoral thesis, Politecnico di Torino, 2020. http://hdl.handle.net/11583/2841172.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Parasoglou, Prodromos, Andrew J. Sederman, John Rasburn, Hugh Powell und Michael L. Johns. „Optimal k-space sampling for single point imaging of transient systems“. Universitätsbibliothek Leipzig, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-192138.

Der volle Inhalt der Quelle
Annotation:
A modification of the Single Point Imaging (SPI) is presented. The novel approach aims at increasing the sensitivity of the method and hence the resulting Signal-to-Noise ratio (SNR) for a given total time interval. With prior knowledge of the shape of the object under study, a selective sparse k-space sampling can then be used to follow dynamic phenomena of transient systems, in this case the absorption of moisture by a cereal-based wafer material. Further improvement in the image quality is achieved when the un-sampled k-space points are replaced by those of the initial dry or the final wet sample acquired at the beginning and the end of the acquisition respectively when there are no acquisition time limitations.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Parasoglou, Prodromos, Andrew J. Sederman, John Rasburn, Hugh Powell und Michael L. Johns. „Optimal k-space sampling for single point imaging of transient systems“. Diffusion fundamentals 10 (2009) 13, S. 1-3, 2009. https://ul.qucosa.de/id/qucosa%3A14104.

Der volle Inhalt der Quelle
Annotation:
A modification of the Single Point Imaging (SPI) is presented. The novel approach aims at increasing the sensitivity of the method and hence the resulting Signal-to-Noise ratio (SNR) for a given total time interval. With prior knowledge of the shape of the object under study, a selective sparse k-space sampling can then be used to follow dynamic phenomena of transient systems, in this case the absorption of moisture by a cereal-based wafer material. Further improvement in the image quality is achieved when the un-sampled k-space points are replaced by those of the initial dry or the final wet sample acquired at the beginning and the end of the acquisition respectively when there are no acquisition time limitations.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
11

Hu, Keli. „Signal transduction systems involved in ischemic preconditioning and ATP-sensitive K+ channels“. Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape11/PQDD_0002/NQ44456.pdf.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
12

Alouini, Mohamed-Slim. „Impact of the atmosphere on K [subscript a]-Band satellite communication systems“. Thesis, Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/15364.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
13

Bean, Jessica. „Hydrogel systems for triggered release of bacteriophage K and directed cell growth“. Thesis, University of Bath, 2015. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.687356.

Der volle Inhalt der Quelle
Annotation:
Hydrogels have been increasingly used in the treatment of skin and soft tissue wounds in recent years due to their superb water holding and cell-growth promoting properties. When impregnated with antibiotics, they can also treat or prevent bacterial infections. Due to the global increase in antibiotic resistance, antibiotics are now becoming less effective and bacteriophage (viruses able to kill bacteria) offer a new alternative. Triggered release mechanisms also slow resistance development, as bacteria are not continually exposed to sub-lethal levels of therapeutic. Here, Staphylococcus aureus (S. aureus) was focussed on as it is the most common pathogen present in skin and soft tissue infections. The main aim of this work was to form biocompatible hydrogel systems which were able to give passive or triggered release of bacteriophage particles by S. aureus virulence factors. Micropatterned hydrogels were also investigated to assess the response in eukaryotic systems. This study found that Bacteriophage K was highly infective against S. aureus, with 94% strains (out of 86 strains) showing complete or intermediate sensitivity. Bacteriophage were immobilised into PVA and agarose hydrogel systems without a significant loss in concentration or efficacy. A photocrosslinkable polymer, HAMA (hyaluronic acid methacrylate) was also investigated which could be crosslinked in situ into a robust hydrogel; this hydrogel was sensitive to hyaluronidase (HAase), an enzyme secreted by the majority of S. aureus strains. On incubation with purified HAase and S. aureus supernatant, hydrogel degradation was recorded (Carbazole assay and SEM imaging) compared to buffer and HAase – negative S. aureus strains. When combined into a bilayered hydrogel system, 2% agarose/HAMA hydrogels gave triggered release of bacteriophage by pure HAase and HAase positive bacterial supernatant. However, in live culture triggered killing was not possible. HAMA could also be successfully printed, and NIH-3T3 fibroblasts showed directed aggregation but no adhesion to HAMA hydrogels. In general, hydrogel systems which gave triggered release of Bacteriophage K only in the presence of S. aureus HAase were successfully formed. However, the passive leakage of bacteriophage into the wider environment was seen in live culture. This could be remedied by direct coupling of the bacteriophage to the polymer network, and is a possible avenue for future work. This system was significant as it proved that S. aureus HAase can be used as a trigger for bacteriophage release from hydrogel systems. In eukaryotic cells, HAMA hydrogels did not promote cell growth, although some promise was seen in gelatin-based gels.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
14

Ghodsi, Ali. „Distributed k-ary System: Algorithms for Distributed Hash Tables“. Doctoral thesis, KTH, Mikroelektronik och Informationsteknik, IMIT, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4186.

Der volle Inhalt der Quelle
Annotation:
This dissertation presents algorithms for data structures called distributed hash tables (DHT) or structured overlay networks, which are used to build scalable self-managing distributed systems. The provided algorithms guarantee lookup consistency in the presence of dynamism: they guarantee consistent lookup results in the presence of nodes joining and leaving. Similarly, the algorithms guarantee that routing never fails while nodes join and leave. Previous algorithms for lookup consistency either suffer from starvation, do not work in the presence of failures, or lack proof of correctness. Several group communication algorithms for structured overlay networks are presented. We provide an overlay broadcast algorithm, which unlike previous algorithms avoids redundant messages, reaching all nodes in O(log n) time, while using O(n) messages, where n is the number of nodes in the system. The broadcast algorithm is used to build overlay multicast. We introduce bulk operation, which enables a node to efficiently make multiple lookups or send a message to all nodes in a specified set of identifiers. The algorithm ensures that all specified nodes are reached in O(log n) time, sending maximum O(log n) messages per node, regardless of the input size of the bulk operation. Moreover, the algorithm avoids sending redundant messages. Previous approaches required multiple lookups, which consume more messages and can render the initiator a bottleneck. Our algorithms are used in DHT-based storage systems, where nodes can do thousands of lookups to fetch large files. We use the bulk operation algorithm to construct a pseudo-reliable broadcast algorithm. Bulk operations can also be used to implement efficient range queries. Finally, we describe a novel way to place replicas in a DHT, called symmetric replication, that enables parallel recursive lookups. Parallel lookups are known to reduce latencies. However, costly iterative lookups have previously been used to do parallel lookups. Moreover, joins or leaves only require exchanging O(1) messages, while other schemes require at least log(f) messages for a replication degree of f. The algorithms have been implemented in a middleware called the Distributed k-ary System (DKS), which is briefly described.
QC 20100824
APA, Harvard, Vancouver, ISO und andere Zitierweisen
15

Forthaus, Martin K. [Verfasser]. „Pressure-induced unusual ground states in selected correlated electron systems / Martin K. Forthaus“. Aachen : Shaker, 2010. http://d-nb.info/1080766790/34.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
16

Geppert, Anne K. [Verfasser]. „Experimental Investigation of Droplet Wall-Film Interaction of Binary Systems / Anne K. Geppert“. München : Verlag Dr. Hut, 2019. http://d-nb.info/1194288766/34.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
17

Wei, Frank L. (Frank Lili) 1977. „Effects of mechanical properties on the reliability of Cu/low-k metallization systems“. Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/42026.

Der volle Inhalt der Quelle
Annotation:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Materials Science and Engineering, 2007.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (leaves 211-217).
Cu and low-dielectric-constant (k) metallization schemes are critical for improved performance of integrated circuits. However, low elastic moduli, a characteristic of the low-k materials, lead to significant reliability degradation in Cu-interconnects. A thorough understanding of the effects of mechanical properties on electromigration induced failures is required for accurate reliability assessments. During electromigration inside Cu-interconnects, a change in atomic concentration correlates with a change in stress through the effective bulk modulus of the materials system, B, which decreases as the moduli of low-k materials used as inter-level dielectrics (ILDs) decrease. This property is at the core of discussions on electromigration-induced failures by all mechanisms. B is computed using finite element modeling analyses, using experimentally determined mechanical properties of the individual constituents. Characterization techniques include nanoindentation, cantilever deflection, and pressurized membrane deflection for elastic properties measurements, and chevron-notched double-cantilever pull structures for adhesion measurements. The dominant diffusion path in Cu-interconnects is the interface between Cu and the capping layer, which is currently a Si3N4-based film. We performed experiments on Cu-interconnect segments to investigate the kinetics of electromigration. A steady resistance increase over time prior to open-circuit failure, a result of void growth, correlates with the electromigration drift velocity. Diffusive measurements made in this fashion are more fundamental than lifetime measurements alone, and correlate with the combined effects of the electron wind and the back stress forces during electromigration induced void growth.
(cont.)Using this method, the electromigration activation energy was determined to be 0.80±0.06eV. We conducted experiments using Cu-interconnects with different lengths to study line length effects. Although a reliability improvement is observed as the segment length decreases, there is no deterministic current-density line-length product, jL, for which all segments are immortal. This is because small, slit-like voids forming directly below vias will cause open-failures in Cu-interconnects. Therefore, the probabilistic jLcrit values obtained from via-above type nterconnects approximate the thresholds for void nucleation. The fact that jLcrit,nuc monotonically decreases with B results from an energy balance between the strain energy released and surface energy cost for void nucleation and the critical stress required for void nucleation is proportional to B. We also performed electromigration experiments using Cu/low-k interconnect trees to investigate the effects of active atomic sinks and reservoirs on interconnect reliability. In all cases, failures were due to void growth. Kinetic parameters were extracted to be ... Quantitative analysis demonstrates that the reliability of the failing segments is modulated by the evolution of stress in the whole interconnect tree. During this process, not only the diffusive parameters but also B play critical roles. However, as B decreases, the positive effects of reservoirs on reliability are diminished, while the negative effects of sinks on reliability are amplified.
(cont.) Through comprehensive failure analyses, we also successfully identified the mechanism of electromigration-induced extrusions in Cu/low-k interconnects to be nearmode-I interfacial fracture between the Si3N4-based capping layer and the metallization/ILD layer below. The critical stress required for extrusion is found to depend not only on B but also on the layout and dimensions of the interconnects. As B decreases, sparsely packed, wide interconnects are most prone to extrusion-induced failures. Altogether, this research accounts for the effects of mechanical properties on all mechanisms of failure due to electromigration. The results provide an improved experimental basis for accurate circuit-level, layout-specific reliability assessments.
by Frank LiLi Wei.
Ph.D.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
18

Gong, Ning. „Resilient Control Strategy and Analysis for Power Systems using (n, k)-Star Topology“. Diss., Temple University Libraries, 2016. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/410406.

Der volle Inhalt der Quelle
Annotation:
Electrical Engineering
Ph.D.
This research focuses on developing novel approaches in load balancing and restoration problems in electrical power distribution systems. The first approach introduces an inter-connected network topology, referred to as (n, k)-star topology. While power distribution systems can be constructed in different communication network topologies, the performance and fault assessment of the networked systems can be challenging to analyze. The (n, k)-star topologies have well defined performance and stability analysis metrics. Typically, these metrics are defined based on: i) degree, ii) diameter, and iii) conditional diagnosability of a faulty node. These parameters could be evaluated and assessed before a physical (n, k)-star topology power distribution system is constructed. Moreover, in the second approach, we evaluate load balancing problems by using a decentralized algorithm, i.e., the Multi-Agent System (MAS) based consensus algorithm on an (n, k)-star power topology. With aforementioned research approaches, an (n, k)-star power distribution system can be assessed with proposed metrics and assessed with encouraging results compared to other topology networked systems. Other encouraging results are found in efficiency and performance enhancement during information exchange using the decentralized algorithm. It has been proven that a load balance solution is convergent and asymptotically stable with a simple gain controller. The analysis can be achieved without constructing a physical network to help evaluate the design. Using the (n, k)-star topology and MAS, the load balancing/restoration problems can be solved much more quickly and accurately compared to other approaches shown in the literature.
Temple University--Theses
APA, Harvard, Vancouver, ISO und andere Zitierweisen
19

Zhu, Ruiying. „An eigenmatrices method to obtain transient solutions for the M/M/k:(N/FIFO) queueing system (k=1,2)“. Ohio : Ohio University, 1991. http://www.ohiolink.edu/etd/view.cgi?ohiou1183989760.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
20

Keilson, Julian, und Les D. Servi. „Extended Vacation Systems and the Universality of the M/G/1/K Blocking Formula“. Massachusetts Institute of Technology, Operations Research Center, 1989. http://hdl.handle.net/1721.1/5382.

Der volle Inhalt der Quelle
Annotation:
A simple blocking formula B(K) = (1 - p)EK [1 - pEK]- 1 relates the probability of blocking for the finite capacity M/G/1/K to EK, the steady state occupancy tail probability of the same system with infinite capacity. The validity of this formula is demonstrated for M/G/1 vacation systems augmented by an idle state, an umbrella for a host of priority systems and vacation systems related to M/G/1. A class of occupancy level dependent vacation systems introduced are shown to require a variant of this blocking formula.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
21

Nazarian, Arbi. „Ultrasonic vocalizations of preweanling rats the interaction of k-opioid and a₂-noradrenergic systems“. CSUSB ScholarWorks, 2000. https://scholarworks.lib.csusb.edu/etd-project/1627.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
22

Hird, Mackenzie Douglas. „Barriers to implementation of new programs and pedagogies in K-12 STEM Education : a systems perspective“. Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/81121.

Der volle Inhalt der Quelle
Annotation:
Thesis (S.M. in Technology and Policy)--Massachusetts Institute of Technology, Engineering Systems Division, 2013.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 85-97).
The continued usage of poor pedagogies in K-12 classrooms, despite large pressures for teachers to change their practice, points towards systematic barriers to change. In the last few decades, there has been a national focus to improve Science, Technology, Engineering and Math (STEM) Education. Driven by their concern for developing their future workforce, science and technology companies have invested billions of dollars in improving student outcomes. Further, the federal and state governments have responded by adopting new policies meant to improve student performance. Promising new pedagogies, such as Project Based Learning or the Flipped Classroom, have been developed alongside new technologies to complement them. Yet despite this support, pedagogical practice has not drastically changed and students are primarily taught through lectures and homework sets. This thesis argues that teachers do not adopt new pedagogies because they are under short-term pressure to improve test scores, often face an uphill battle against their school culture and/or do not have deep enough pedagogical or content expertise. A causal model of pedagogical implementation barriers is developed using the results of in-depth surveys and interviews of administrators, principals and teachers. Within this model, critical points of leverage are identified that can interrupt the negative feedback loops creating pedagogical lock-in, and three case studies of international attempts at pedagogical reform are presented to illustrate effective strategies to utilize these leverage points. General policy recommendations are then developed that will remove the current system of pressures and incentives for teachers to use rote memorization and incentivize use of more effective pedagogies.
by Mackenzie Douglas Hird.
S.M.in Technology and Policy
APA, Harvard, Vancouver, ISO und andere Zitierweisen
23

Tschakarow, Roland K. [Verfasser]. „Entwurf, Auslegung und Umsetzung eines Systems neuartiger Gelenkmodule für rekonfigurierbare Leichtbau-Gelenkarmroboter / Roland K Tschakarow“. Aachen : Shaker, 2010. http://d-nb.info/110683870X/34.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
24

Pera, Maria Soledad. „Using Online Data Sources to Make Recommendations on Reading Material for K-12 and Advanced Readers“. BYU ScholarsArchive, 2014. https://scholarsarchive.byu.edu/etd/4378.

Der volle Inhalt der Quelle
Annotation:
Reading is a fundamental skill that each person needs to develop during early childhood and continue to enhance into adulthood. While children/teenagers depend on this skill to advance academically and become educated individuals, adults are expected to acquire a certain level of proficiency in reading so that they can engage in social/civic activities and successfully participate in the workforce. A step towards assisting individuals to become lifelong readers is to provide them adequate reading selections which can cultivate their intellectual and emotional growth. Turning to (web) search engines for such reading choices can be overwhelming, given the huge volume of reading materials offered as a result of a search. An alternative is to rely on reading materials suggested by existing recommendation systems, which unfortunately are not capable of simultaneously matching the information needs, preferences, and reading abilities of individual readers. In this dissertation, we present novel recommendation strategies which identify appealing reading materials that the readers can comprehend, which in turn can motivate them to read. In accomplishing this task, we have examined used-defined data, in addition to information retrieved/inferred from reputable and freely-accessible online sources. We have incorporated the concept of “social trust” when making recommendations for advanced readers and suggested fiction books that match the reading ability of individual K-12 readers using our readability-analysis tool for books. Furthermore, we have emulated the readers' advisory service offered at school/public libraries in making recommendations for K-12 readers, which can be applied to advanced readers as well. A major contribution of our work is in the development of unsupervised recommendation strategies for advanced readers which suggest reading materials for both entertainment and learning acquisition purposes. Unlike their counterparts, these recommendation strategies are unaffected by the cold-start or long-tail problems, since they exploit user-defined data (if available) while taking advantage of alternative publicly-available metadata. Our readability-analysis tool is innovative, which can predict the readability-levels of books on-the-fly, even in the absence of excerpts from books, a task that cannot be accomplished by any of the well-known readability tools/strategies. Moreover, our multi-dimensional recommendation strategy is novel, since it simultaneously analyzes the reading abilities of K-12 readers, which books readers enjoy, why the books are appealing to them, and what subject matters the readers favor. Besides assisting K-12 readers, our recommender can be used by parents/teachers/librarians in locating reading materials to be suggested to their (K-12) children/students/patrons. We have validated the performance of each methodology presented in this dissertation using existing benchmark datasets or datasets we created for the evaluation purpose (which is another contribution we make to the research community). We have also compared the performance of our proposed methodologies with their corresponding baselines and state-of-the-art counterparts, which further verifies the correctness of the proposed methodologies.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
25

Gil, de la Iglesia Didac. „A Formal Approach for Designing Distributed Self-Adaptive Systems“. Doctoral thesis, Linnéuniversitetet, Institutionen för medieteknik (ME), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-34195.

Der volle Inhalt der Quelle
Annotation:
Engineering contemporary distributed software applications is a challenging task due to the dynamic operating conditions in which these systems have to function. Examples are dynamic availability of resources, errors that are difficult to predict, and changing user requirements. These dynamics can affect a number of quality concerns of a system, such as robustness, openness, and performance. The challenges of engineering software systems with such dynamics have motivated the need for self-adaptation. Self-adaptation is based on the principle of separation of concerns, distinguishing two well defined systems: a managed system that deals with domain specific concerns and a managing system that deals with particular quality concerns of the managed system through adaptation with a feedback loop. State of the art in self- adaptation advocates the use of formal methods to specify and verify the system's behavior in order to provide evidence that the system's goals are satisfied. However, little work has been done on the consolidation of design knowledge to model and verify self-adaptation behaviors. To support designers, this thesis contributes with a set of formally specified templates for the specification and verification of self-adaptive behaviors of a family of distributed self-adaptive systems. The templates are based on the MAPE-K reference model (Monitor-Analyze-Plan-Execute plus Knowledge). The templates comprise: (1) behavior specification patterns for modeling the different MAPE components of a feedback loop, and (2) property specification patterns that support verification of the correctness of the adaptation behaviors. The target domain are distributed applications in which self-adaptation is used for managing resources for robustness and openness requirements. The templates are derived from expertise with developing several self-adaptive systems, including a collaborative mobile learning application in which we have applied self-adaptation to make the system robust to degrading GPS accuracy, and a robotic system in which we apply self-adaptation to support different types of openness requirements. We demonstrate the reusability of the templates in a number of case studies.
AMULETS
APA, Harvard, Vancouver, ISO und andere Zitierweisen
26

Wang, Luo. „Excess enthalpies and excess volumes for n-butyl methyl ether + n-alkane systems at 298.15 K“. Thesis, University of Ottawa (Canada), 1990. http://hdl.handle.net/10393/5686.

Der volle Inhalt der Quelle
Annotation:
Research on excess properties plays an important role in solution thermodynamics. The experimental excess properties of liquid mixtures provide essential information for testing and developing solution theories. They also provide the data required for process design in chemical and petroleum industries. In addition excess properties are useful for testing thermodynamic consistency for vapor-liquid equilibrium data. Both excess enthalpies $H\sp{E}$ and excess volume $V\sp{E}$ were determined in this study for six binary systems consisting of n-butyl methyl ether and an n-alkane at 208.15 K. Flory theory with an interaction parameter, which was found to be a quadratic function of the carbon number of the n-alkane molecules, was used to correlate the experimental $H\sp{E}$ data and then to predict $V\sp{E}$ values which were subsequently compared with the experimental $V\sp{E}$ data.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
27

Schwalb, Nina K. [Verfasser]. „Ultrafast electronic deactivation dynamics in DNA model systems by femtosecond UV fluorescence spectroscopy / Nina K. Schwalb“. Kiel : Universitätsbibliothek Kiel, 2009. http://d-nb.info/1019867485/34.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
28

Kaushik, Ankit [Verfasser], und Jondral F. [Akademischer Betreuer] K. „Performance Analysis of Cognitive Radio Systems with Imperfect Channel Knowledge / Ankit Kaushik ; Betreuer: F. K. Jondral“. Karlsruhe : KIT-Bibliothek, 2017. http://d-nb.info/1131169042/34.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
29

Geppert, Anne K. [Verfasser], und Bernhard [Akademischer Betreuer] Weigand. „Experimental investigation of droplet wall-film interaction of binary systems / Anne K. Geppert ; Betreuer: Bernhard Weigand“. Stuttgart : Universitätsbibliothek der Universität Stuttgart, 2019. http://d-nb.info/1197056475/34.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
30

Yao, Junpin. „Control of Molecular Contaminants in Porous Low-k Dielectric Films and in UHP Gas Delivery Systems“. Diss., The University of Arizona, 2008. http://hdl.handle.net/10150/195243.

Der volle Inhalt der Quelle
Annotation:
As compared to silicon oxide, porous low-k dielectric materials are more susceptible to molecular contaminants. As the device feature size decreases, control of molecular contaminants in porous low-k dielectric films and in UHP gas delivery systems becomes increasingly more challenging. Moisture was selected as the principal model contaminant in this research because the moisture impurity retained in the dielectric films not only increases the effective dielectric constant (k) value of the films but also degrades the reliability of the device. Dry-down of moisture contaminated UHP systems takes days to weeks, which significantly decreases the process throughput. In this research, the fundamental interaction mechanisms of moisture with spin-on porous methylsilsesquioxane (p-MSQ) and Black Diamond IIx (BDIIx) dielectric films were investigated through isothermal challenge-purge processes at different exposure environments. Mass spectrometers (APIMS and EIMS), and cavity ring-down spectroscopy were used to detect moisture concentration in the gas phase. The moisture concentration in the thin films was directly analyzed by Fourier transform infrared spectroscopy (FTIR). Transmission Electron Microscope (TEM) micrographs were used to evaluate how patterning processes change the films. Moisture solubility, impact of temperature and gas flow rate on moisture removal, and dynamics of moisture uptake and removal in the films were determined by experimental study.Two process models were developed. The first one is capable of predicting the dynamic aspects of moisture adsorption and desorption in the films, and the second one is used to predict dry-down of moisture-contaminated gas delivery systems. The parameters in the models, such as moisture solubility and diffusivity in the films and rate constants of adsorption and desorption on the surface of the electro-polished stainless steel tube, were extracted through fitting these models to the experimental data. The models can be used to optimize key operating conditions such as purge temperature, purge gas purity, and purge gas flow rate. The models are also valuable tools for developing efficient contamination control strategies and process recipes for contamination removal in porous low-k dielectric films and for minimizing the gas usage in gas delivery systems.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
31

Griffiths, David Anthony. „Methodology and diagnostic management tool for the coordination of Organisational Knowledge Management“. Thesis, University of Edinburgh, 2012. http://hdl.handle.net/1842/10614.

Der volle Inhalt der Quelle
Annotation:
Since the late 1980s there has been a greater awareness of the need to manage organisational knowledge resources, which are seen as vital to the value proposition of any organisation. This has resulted in the development of a multiplicity of Organisational Knowledge Management (OKM) approaches, systems and processes. OKM as a concept is however experiencing a prolonged period of practitioner and academic dissatisfaction, which is impacting its credibility. Commentators claim that this emanates from the fact that a general model, as a diagnostic mechanism for the field, has not yet emerged, an indicator of immaturity in the field and a destabilising influence on practitioner confidence. This research sets out to explore OKM, with the aim of understanding and attempting to help address this dissatisfaction. The literature review focuses on environmental drivers of OKM as a concept from both practitioner and academic perspectives. This highlights a need for (1) an agreed definition of purpose for OKM systems and (2) a general diagnostic model or framework for those systems that identifies common constructs across sectors or geographic locations. In turn, these require appropriate research evidence. The research reported on in this thesis utilises Soft Systems Methodology as a framework for enquiry. By means of a meta-analysis of literature, the enquiry progresses to a descriptive survey, with findings being illustrated and analysed through fractal analysis. The data is then compared against a sample of models from the field before being translated into a new OKM diagnostic model and supporting toolkit, using logic modelling and a Participatory Integrated Assessment Tool. The application of these to a case study, carried out within in a large multinational organisation, is reported on and evaluated. Findings are that 'self-similarity' exists across existing views of OKM; that the need for knowledge to be used as an organisational resource is a persistent one; that a methodology can be developed that reacts to the needs of academics and practitioners in responding to the challenges from the field; that a proposition for a general organisation diagnostic model is possible; that a robust evidence-based definition for the concept, as well as a general diagnostic model for the coordination of organisational knowledge resources is needed and are provided; and that such a general diagnostic tool, such as has been developed in the research on which this thesis is based, can be applied within an organisation to identify gaps in systems designed to coordinate organisational knowledge resources.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
32

Svensson, Jesper, und Ideal Berisha. „Generisk Felkodsfunktionalitet“. Thesis, Linnéuniversitetet, Institutionen för datavetenskap (DV), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-66119.

Der volle Inhalt der Quelle
Annotation:
BSR Svenska AB har gett oss uppgiften är att göra deras Portable Programming Carrier 3 (PPC 3) till en felkodsläsare som klarar av att läsa och radera generiska felkoder. Felkodsläsaren kommer kallas för PPC Diagnostic System och kommer att kunna användas till alla bilar med OBDII-uttag. Meningen är att vem som helst ska kunna kontrollera och radera felkoder i sin bil. De generiska felkoderna är mestadels lagstadgade och har oftast koppling med drivlina eller miljöklassificerade värden på bilen.
BSR Svenska AB have developed a diagnostic device for cars and the task at hand is to develop this device called PPC diagnostic to make it compatible with generic OBDII codes. This will make it easier for the ordinary person to control their cars and check if there is anything wrong, that is contained in the generic protocol. This includes mostly a lot of probes weather they are ok or not and also a lot of values for temperature and similar stuff, but the most important part of the generic fault codes is the environmental fault codes.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
33

Jeanneau, Élise. „Failure Detectors in Dynamic Distributed Systems“. Electronic Thesis or Diss., Sorbonne université, 2018. http://www.theses.fr/2018SORUS207.

Der volle Inhalt der Quelle
Annotation:
Les systèmes dynamiques sont des systèmes distribués dans lesquels (1) les processus peuvent rejoindre ou quitter le système en cours d'exécution, et (2) le graphe de communication évolue au fil du temps. L'abstraction des détecteurs de fautes a été introduite afin de contourner l'impossibilité de résoudre le consensus dans les systèmes asynchrones sujets aux pannes franches. Mais un détecteur de fautes qui est suffisant pour résoudre un problème donné dans un système statique n'est pas nécessairement suffisant pour résoudre le même problème dans un système dynamique. Par conséquent, il est nécessaire de redéfinir les détecteurs de fautes existants et de concevoir de nouveaux algorithmes. Dans cette thèse, nous fournissons une nouvelle définition d'un détecteur de fautes pour le k-accord, et nous prouvons qu'il est suffisant pour résoudre le k-accord dans un système dynamique. Nous définissons également un modèle de système dynamique, ainsi qu'un algorithme capable d'implémenter ce nouveau détecteur de fautes dans notre modèle. De plus, nous adaptons un détecteur existant pour l'exclusion mutuelle et nous prouvons que même dans les systèmes dynamiques, il s'agit toujours du détecteur de fautes le plus faible pour résoudre l'exclusion mutuelle. Cela signifie que ce détecteur est plus faible que tous les autres détecteurs capables de résoudre l'exclusion mutuelle
Dynamic systems are distributed systems in which (1) processes can join or leave the system during the run, and (2) the communication graph evolves over time. The failure detector abstraction was introduced as a way to circumvent the impossibility of solving consensus in asynchronous systems prone to crash failures. A failure detector is a local oracle that provides processes in the system with unreliable information on process failures. But a failure detector that is sufficient to solve a given problem in a static system is not necessarily sufficient to solve the same problem in a dynamic system. Additionally, some existing failure detectors cannot be implemented in dynamic systems. Therefore, it is necessary to redefine existing failure detectors and provide new algorithms. In this thesis, we provide a new definition of a failure detector for k-set agreement, and prove that it is sufficient to solve k-set agreement in dynamic systems. We also design a dynamic system model and an algorithm that implements this new failure detector. Additionally, we adapt an existing failure detector for mutual exclusion and prove that it is still the weakest failure detector to solve mutual exclusion in dynamic systems, which means that it is weaker than any other failure detector capable of solving mutual exclusion
APA, Harvard, Vancouver, ISO und andere Zitierweisen
34

Scholz, Christian. „The role of K ATP channels in model systems of dopaminergic neuron loss in the ventral mesencephalon“. [S.l. : s.n.], 2008. http://nbn-resolving.de/urn:nbn:de:bsz:16-opus-80809.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
35

Oliveira, Sandra Cristina de. „Uso de Métodos Bayesianos para Confiabilidade de Redes“. Universidade de São Paulo, 1999. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-24102012-100857/.

Der volle Inhalt der Quelle
Annotation:
Neste trabalho apresentamos uma análise Bayesiana para confiabilidade de sistemas de redes usando métodos de simulação de Monte Carlo via Cadeias de Markov. Assumimos diferentes densidades a priori para as confiabilidades dos componentes individuais, com o objetivo de obtermos sumários de interesse. A metodologia é exemplificada condiderando um sistema de rede com sete componentes e um caso especial de sistema complexo composto por nove componentes. Consideramos ainda confiabilidade de redes tipo k-out--of-m com alguns exemplos numéricos
In this work we present a Bayesian approach for network reliability systems using Marov Chain Monte Carlo methods. We assume different prior densities for the individual component reliabilities th to get the posterior summaries of interest. The methodology is exemplified considering a network system with seven components and a special case of complex system with nine components. We also consider k-out-of-m system reliabiility with some numerical examples
APA, Harvard, Vancouver, ISO und andere Zitierweisen
36

Subramanian, Shivaram. „Routing Algorithms for Dynamic, Intelligent Transportation Networks“. Thesis, Virginia Tech, 1997. http://hdl.handle.net/10919/37056.

Der volle Inhalt der Quelle
Annotation:
Traffic congestion has been cited as the most conspicuous problem in traffic management. It has far-reaching economic,social and political effects. Intelligent Transportation Systems (ITS) research and development programs have been assigned the task of developing sophisticated techniques and counter-measures to reduce traffic congestion to manageable levels, and also achieve these objectives using area-wide traffic management methods. During times of traffic congestion, the traffic network in a transient, time-dynamic state, and resembles a dynamic network. In addition, in the context of ITS, the network can accurately detect such transient behavior using traffic sensors, and several other information gathering devices. In conjunction with Operations Research techniques, the time-varying traffic flows can be routed through the network in an optimal manner, based on the feedback from these information sources. Dynamic Traffic Assignment (DTA) methods have been proposed to perform this task. An important step in DTA is the calculation of user-optimal, system-optimal, and multiple optimal routes for assigning traffic. One would also require the calculation of user-optimal paths for vehicle scheduling and dispatching problems. The main objective of this research study is to analyze the effectiveness of time-dependent shortest path (TDSP) algorithms and k-shortest path (k-SP) algorithms as a practical routing tool in such intelligent transportation networks. Similar algorithms have been used to solve routing problems in computer networks. The similarities and differences between computer and ITS road networks are studied. An exhaustive review of TDSP and k-SP algorithms was conducted to classify and determine the best algorithms and implementation procedures available in the literature. A new (heuristic) algorithm (TD-kSP) that calculates multiple optimal paths for dynamic networks is proposed and developed. A complete object-oriented computer program in C++ was written using specialized network representations, node-renumbering schemes and efficient path processing data structures (classes) to implement this algorithm. A software environment where such optimization algorithms can be applied in practice was then developed using object-oriented design methodology. Extensive statistical and regression analysis tests for various random network sizes, densities and other parameters were conducted to determine the computational efficiency of the algorithm. Finally, the algorithm was incorporated within the GIS-based Wide-Area Incident Management Software System (WAIMSS) developed at the Center for Transportation Research, Virginia Tech. The results of these tests are used to obtain the empirical time-complexity of the algorithm. Results indicate that the performance of this algorithm is comparable to the best TDSP algorithms available in the literature, and strongly encourages its possible application in real-time applications. Complete testing of the algorithm requires the use of real-time link flow data. While the use of randomly generated data and delay functions in this study may not significantly affect its computational performance, other measures of effectiveness as a routing tool remains untested. This can be verified only if the algorithm itself becomes a part of the user-behavior feedback loop. A closed loop traffic simulation/ system-dynamics study would be required to perform this task. On the other hand, an open-loop simulation would suffice for vehicle scheduling/dispatching problems.
Master of Science
APA, Harvard, Vancouver, ISO und andere Zitierweisen
37

Faraj, Dina. „Using Machine Learning for Predictive Maintenance in Modern Ground-Based Radar Systems“. Thesis, KTH, Matematisk statistik, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-299634.

Der volle Inhalt der Quelle
Annotation:
Military systems are often part of critical operations where unplanned downtime should be avoided at all costs. Using modern machine learning algorithms it could be possible to predict when, where, and at what time a fault is likely to occur which enables time for ordering replacement parts and scheduling maintenance. This thesis is a proof of concept study for anomaly detection in monitoring data, i.e., sensor data from a ground based radar system as an initial experiment to showcase predictive maintenance. The data in this thesis was generated by a Giraffe 4A during normal operation, i.e., no anomalous data with known failures was provided. The problem setting is originally an unsupervised machine learning problem since the data is unlabeled. Speculative binary labels are introduced (start-up state and steady state) to approximate a classification accuracy. The system is functioning correctly in both phases but the monitoring data looks differently. By showing that the two phases can be distinguished, it is possible to assume that anomalous data during break down can be detected as well.  Three different machine learning classifiers, i.e., two unsupervised classifiers, K-means clustering and isolation forest and one supervised classifier, logistic regression are evaluated on their ability to detect the start-up phase each time the system is turned on. The classifiers are evaluated graphically and based on their accuracy score. All three classifiers recognize a start up phase for at least four out of seven subsystems. By only analyzing their accuracy score it appears that logistic regression outperforms the other models. The collected results manifests the possibility to distinguish between start-up and steady state both in a supervised and unsupervised setting. To select the most suitable classifier, further experiments on larger data sets are necessary.
Militära system är ofta en del av kritiska operationer där oplanerade driftstopp bör undvikas till varje pris. Med hjälp av moderna maskininlärningsalgoritmer kan det vara möjligt att förutsäga när och var ett fel kommer att inträffa. Detta möjliggör tid för beställning av reservdelar och schemaläggning av underhåll. Denna uppsats är en konceptstudie för detektion av anomalier i övervakningsdata från ett markbaserat radarsystem som ett initialt experiment för att studera prediktivt underhåll. Datat som används i detta arbete kommer från en Saab Giraffe 4A radar under normal operativ drift, dvs. ingen avvikande data med kända brister tillhandahölls. Problemställningen är ursprungligen ett oövervakat maskininlärningsproblem eftersom datat saknar etiketter. Spekulativa binära etiketter introduceras (uppstart och stabil fas) för att uppskatta klassificeringsnoggrannhet. Systemet fungerar korrekt i båda faserna men övervakningsdatat ser annorlunda ut. Genom att visa att de två faserna kan urskiljas, kan man anta att avvikande data också går att detektera när fel uppstår.  Tre olika klassificeringsmetoder dvs. två oövervakade maskininlärningmodeller, K-means klustring och isolation forest samt en övervakad modell, logistisk regression utvärderas utifrån deras förmåga att upptäcka uppstartfasen varje gång systemet slås på. Metoderna utvärderas grafiskt och baserat på deras träffsäkerhet. Alla tre metoderna känner igen en startfas för minst fyra av sju delsystem. Genom att endast analysera deras noggrannhetspoäng, överträffar logistisk regression de andra modellerna. De insamlade resultaten demonstrerar möjligheten att skilja mellan uppstartfas och stabil fas, både i en övervakad och oövervakad miljö. För att välja den bästa metoden är det nödvändigt med ytterligare experiment på större datamängder.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
38

Pek, Denis [Verfasser]. „Identifizierung von K-Ras-Interaktionspartnern in der humanen Pankreaskarzinomzelllinie PANC-1 mittels des tandem affinity purification-Systems / Denis Pek“. Ulm : Universität Ulm. Medizinische Fakultät, 2014. http://d-nb.info/1052935869/34.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
39

Namballa, Ravi K. „CHESS [electronic resource] : a tool for CDFG extraction and high-lelvel synthesis of VLSI systems / by Ravi K. Namballa“. [Tampa, Fla.] : University of South Florida, 2003. http://purl.fcla.edu/fcla/etd/SFE0000054.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
40

Johnson, David Philip. „How Attitude Toward the Behavior, Subjective Norm, and Perceived Behavioral Control Affects Information Security Behavior Intention“. ScholarWorks, 2017. https://scholarworks.waldenu.edu/dissertations/4454.

Der volle Inhalt der Quelle
Annotation:
The education sector is at high risk for information security (InfoSec) breaches and in need of improved security practices. Achieving data protections cannot be through technical means alone. Addressing the human behavior factor is required. Security education, training, and awareness (SETA) programs are an effective method of addressing human InfoSec behavior. Applying sociobehavioral theories to InfoSec research provides information to aid IT security program managers in developing improved SETA programs. The purpose of this correlational study was to examine through the theoretical lens of the theory of planned behavior (TPB) how attitude toward the behavior (ATT), subjective norm (SN), and perceived behavioral control (PBC) affected the intention of computer end users in a K-12 environment to follow InfoSec policy. Data collection was from 165 K-12 school administrators in Northeast Georgia using an online survey instrument. Data analysis occurred applying multiple linear regression and logistic regression. The TPB model accounted for 30.8% of the variance in intention to comply with InfoSec policies. SN was a significant predictor of intention in the model. ATT and PBC did not show to be significant. These findings suggest improvement to K-12 SETA programs can occur by addressing normative beliefs of the individual. The application of improved SETA programs by IT security program managers that incorporate the findings and recommendations of this study may lead to greater information security in K-12 school systems. More secure school systems can contribute to social change through improved information protection as well as increased freedoms and privacy for employees, students, the organization, and the community.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
41

Abkenar, Masoud [Verfasser], Gerhard [Akademischer Betreuer] Gompper und Jan K. G. [Akademischer Betreuer] Dhont. „Collective Behavior of Self-Propelled Rods in Quasi-Two Dimensional Systems / Masoud Abkenar. Gutachter: Gerhard Gompper ; Jan K. G. Dhont“. Köln : Universitäts- und Stadtbibliothek Köln, 2014. http://d-nb.info/1068619813/34.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
42

Stiller, Peter [Verfasser], und Andreas K. [Akademischer Betreuer] Hüttel. „Ultraclean carbon nanotubes and superconducting coplanar resonators: Materials, nano-electromechanics, and few-electron systems / Peter Stiller ; Betreuer: Andreas K. Hüttel“. Regensburg : Universitätsbibliothek Regensburg, 2016. http://d-nb.info/1129956458/34.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
43

Küchenmeister, Jens [Verfasser], und K. [Akademischer Betreuer] Busch. „Modeling of nano-photonic systems using the adaptive Fourier Modal Method and analytical dipole models / Jens Küchenmeister. Betreuer: K. Busch“. Karlsruhe : KIT-Bibliothek, 2012. http://d-nb.info/102976462X/34.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
44

Chang, Hsun-Wen, und 張薰文. „Optimal Assignments of Consecutive-k Systems“. Thesis, 2000. http://ndltd.ncl.edu.tw/handle/70809039762557548152.

Der volle Inhalt der Quelle
Annotation:
博士
國立交通大學
資訊工程系
88
A consecutive-k system consists of n components arranged in a line. A consecutive-k-out-of-n:F (con(k/n:F)) system fails if and only if some consecutive k components are all failed. A consecutive-k-out-of-n:G (con(k/n:G)) system works if and only if some consecutive k components are all working. Consecutive-k systems are used in several applications, such as telecommunication, space relay stations, monitoring systems, and so on. That is why they have attracted many researchers. In 1982, Derman, Lieberman and Ross proposed the optimal assignment problem which is to assign the n functionally exchangeable components to the n positions in a line to maximize the system reliability. The dissertation first addresses the existence of invariant series systems. It is known that a consecutive-k-out-of-n:G system has an invariant optimal assignment if and only if k£n£2k. In Chapter 2, we discuss the consecutive-ki-out-of-ni:G series system with ki £ ni £ 2ki and completely characterize the existence of invariant optimal assignments. Many consecutive-k systems, however, do not have invariant optimal assignments. At the present, we consider heuristic algorithms for optimal assignments. In Chapter 3, we summarize our knowledge of the combinatorial case (p=1/2) and the uniform case (0
APA, Harvard, Vancouver, ISO und andere Zitierweisen
45

Chang, Jen-Chun, und 張仁俊. „Reliability Algorithms for Consecutive-k Systems“. Thesis, 2000. http://ndltd.ncl.edu.tw/handle/36061694916231560147.

Der volle Inhalt der Quelle
Annotation:
博士
國立交通大學
資訊工程系
89
Reliability algorithms are useful tools in reliability analyses and reliability optimizations. In this dissertation, we study and design efficient reliability algorithms for consecutive-k-out-of-n:F systems, weighted-consecutive-k-out-of-n:F systems, f-or-consecutive-k-out-of-n:F systems, f-within-consecutive-k-out-of-n:F systems, consecutive-k-out-of-n:F networks, consecutive-k-out-of-n:F flow networks, consecutive-k-r-out-of-n:DFM systems, and other reliability systems which do not have the “consecutive-k” property. We use two general approaches to develop our reliability algorithms: the first is the recursive equation approach, and second is the Markov chain approach. By carefully designed recursive equations and heterogeneous Markov chains, and under the supports of computation theory, automata theory, and sparse matrix data structures, our reliability algorithms are simpler and (or) more efficient than other published corresponding ones. In addition, we think that designing reliability algorithms case by case is a messy work. Therefore, we propose a “regular reliability model”. It is not a system, but a tool to specify the structures of various systems which may not have the “consecutive-k” property. When analyzing the reliability of a system, we first specify the system structure with the regular reliability model, and apply the automata theory to derive a minimal state heterogeneous Markov chain, then an efficient reliability algorithm can be obtained by implementing the Markov chain approach with the sparse matrix data structure. English Abstract ii Acknowledgements iii Contents iv 1. Introduction 1 1.1 Historical background 1 1.2 The problems and the methodologies 3 1.3 Outline of this dissertation 4 2. The consecutive-k-out-of-n:F system 6 2.1 Assumptions and notation 8 2.2 The linear consecutive-k-out-of-n:F system 10 2.2.1 Shanthikumar’s O(nk) time algorithm 11 2.2.2 Hwang’s O(n) time algorithm 12 2.2.3 A linear component replacement algorithm 13 2.3 The circular consecutive-k-out-of-n:F system 16 2.3.1 Hwang’s O(nk2) time algorithm 17 2.3.2 Antonopoulou and Papastavridis’s O(n2k) time algorithm 18 2.3.3 Wu and Chen’s O(nk) time algorithm 19 2.3.4 Hwang’s O(nk) time algorithm 20 2.3.5 Wu and Chen’s second O(nk) time algorithm 21 2.3.6 A simpler O(nk) time algorithm 22 2.3.7 A circular component replacement algorithm 25 3. The weighted-consecutive-k-out-of-n:F system 30 3.1 Assumptions and notation 32 3.2 The linear weighted-consecutive-k-out-of-n:F system 34 3.2.1 Wu and Chen’s O(n) time algorithm 35 3.3 The circular weighted-consecutive-k-out-of-n:F system 37 3.3.1 Wu and Chen’s incomplete O(min{n, k}·n) time algorithm 38 3.3.2 An O(Tn) time algorithm 41 4. The f-or-consecutive-k-out-of-n:F system ……………………………...…… 46 4.1 Assumptions and notation 47 4.2 Chang, Cui and Hwang’s O(f2k2n) time algorithm 49 4.3 An O(fkn) time algorithm 52 4.4 Another O(fkn) time algorithm 53 4.5 An O((fk)kn) time algorithm 55 5. The f-within-consecutive-k-out-of-n:F system 59 5.1 Assumptions and notation 61 5.2 Hwang and Wright’s O(23kn) time algorithm 62 5.3 An O( n) time algorithm 64 6. The consecutive-k-out-of-n:F network 76 6.1 Assumptions and notation 78 6.2 Chen, Hwang and Li’s algorithm for k = 2 80 6.3 An O(2kn) time algorithm 83 7. The consecutive-k-out-of-n:F flow network 91 7.1 Assumptions and notation 92 7.2 An O( n) time f-flow-reliability algorithm 93 7.3 An O(k) time on-line routing algorithm 96 8. The consecutive-k-r-out-of-n:DFM system 99 8.1 Assumptions and notation 101 8.2 Koutras’s O((k+r)n) time algorithm 102 8.3 An O((k+r)n) time algorithm 103 8.4 An O(n) time algorithm 108 9. The regular reliability model 111 9.1 The regular reliability model 113 9.2 The F reliability model and the G reliability model 115 9.3 The relations among F models, G models, and regular models 118 9.4 An efficient reliability algorithm for the regular model 120 9.5 Applications 121 9.5.1 The f-or-consecutive-k:F model 121 9.5.2 The f-within-consecutive-k:F model 123 9.5.3 The k-mod-q model 125 9.5.4 Logic circuits 126 10. Conclusions 128 Bibliography 130 Vita 141 Publications 143
APA, Harvard, Vancouver, ISO und andere Zitierweisen
46

Chun-AnChen und 陳俊安. „(t,k)-Diagnosis of Multiprocessor Systems“. Thesis, 2014. http://ndltd.ncl.edu.tw/handle/44244083485928170179.

Der volle Inhalt der Quelle
Annotation:
博士
國立成功大學
資訊工程學系
102
System-level diagnosis is a process of identifying faulty processors in a system by conducting tests on various processors and interpreting the test results. The application of system-level diagnosis is the diagnosis of multiprocessor systems. There are five important issues in system-level diagnosis: diagnosis model, diagnosis strategy, diagnosis algorithm, fault model and diagnosability. We focus the (t,k)-diagnosis strategy, (t,k)-diagnosis algorithm, random fault model and (t,k)-diagnosis diagnosability for some multiprocessor systems under the PMC and MM* models.   (t,k)-diagnosis, which is a generalization of sequential diagnosis, requires at least k faulty processors identified and replaced in each iteration provided there are at most t faulty processors, where t 〉= k. In this thesis, faulty nodes of multiprocessor systems may occur everywhere without any restriction. We propose a unified approach to compute the (t,k)-diagnosability for numerous multiprocessor systems, including hypercubes, crossed cubes, twisted cubes, locally twisted cubes, multiply twisted cubes, generalized twisted cubes, recursive circulants, Möbius cubes, Mcubes, star graphs, bubble-sort graphs, pancake graphs, and burnt pancake graphs. The key concept of our approach is to sketch the common graph properties of the above multiprocessor systems and demonstrate that their underlying topologies have a common super class of graphs, called component-composition graphs. We then show that the m-dimensional component-composition graph G for m 〉= 4 is a lower bound of the (t,k)-diagnosability. Based on this result, the (t,k)-diagnosability of the referred multiprocessor systems can be efficiently computed.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
47

Wu, Jer-Shyan, und 吳哲賢. „Reliability Analyses on k-out-of-n Systems and K-terminal Networks“. Thesis, 1994. http://ndltd.ncl.edu.tw/handle/w88276.

Der volle Inhalt der Quelle
Annotation:
博士
國立交通大學
資訊工程研究所
82
In this dissertation, we study reliability analyses on both k- out-of-n systems and K-terminals networks. For k-out-of-n systems, computing reliabilities of k-out-of-n:G system, consecutive-k-out-of-n:F system, and circular-consecutive-out- of-n:F system has been widely discussed since 1981. Here, we propose a more general model of :weighted k-out-of-n systems, which lead to new reliability evaluation problems on three systems: (1) weighted-k-out-of-n:G system, (2) consecutive- weighted-k-out-of-n:F system, and (3) circular consecutive- weighted-k-out-of-n:F system. To compute these system reliabilities, we design efficient algorithms with the same time complexities as the algorithms for the original model. For K-terminal networks reliability, the early studies consider that only edges may fail while vertices always function. In this dissertation, we propose a new model: both edges and vertices may fail. An algorithm using polygon-to-chain reductions is constructed for computing the K-terminal networks reliability with both edge and vertex failures.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
48

Hu, Xue-Ru, und 胡學儒. „Frequency Synthesizer for K-band Communication Systems“. Thesis, 2017. http://ndltd.ncl.edu.tw/handle/42633230584519373918.

Der volle Inhalt der Quelle
Annotation:
碩士
國立中興大學
電機工程學系所
105
Recently, the wireless communications are fast developing. In wireless communication systems, the high performance phase-locked loop (PLL) can provide a stable local oscillator (LO), exact frequencies, and channel switch function. In this case, the merger of a quadrature-voltage-controlled oscillator (QVCO) with a frequency tripler is designed for 24-GHz band. This thesis presents a 24-GHz frequency synthesizer implemented with 0.13um CMOS technology. In order to produce high speed output, the frequency tripler using a sub-harmonic mixer is applied at the output stage of the oscillator. The QVCO provides the quadrature fundamental signals which are fed into the frequency tripler for frequency mixing.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
49

高銘禧. „Continuous Top-k Queries in Unstructured P2P Systems“. Thesis, 2007. http://ndltd.ncl.edu.tw/handle/37483528305952449661.

Der volle Inhalt der Quelle
Annotation:
碩士
國立清華大學
資訊工程學系
95
The research of retrieving data in peer-to-peer (P2P) systems has become more and more important in many research communities nowadays. Among all query-related studies, the technique of top-k queries, which can locate the k objects with the highest overall rankings, is urgently demanded in many network applications. Designing top-k techniques in P2P systems is challenging. P2P systems are characterized by large-scale, free peer behaviors, and dynamic data. Under the circumstances, the traditional query techniques designed for static environments and data would probably generate many unnecessary traffic messages and consume huge computation cost. To ease these problems, we propose an effective solution for continuous top-k query in P2P systems in this paper. The proposed technique, based on superpeer topology, consists of a reliable update mechanism between peers and a distributing mechanism between superpeers. As the experimental results show, the proposed technique can provide comparable results while reducing considerable communication cost. iv
APA, Harvard, Vancouver, ISO und andere Zitierweisen
50

Huang, Chun Hung, und 黃俊鴻. „The functional role of Heterogeneous nuclear ribonucleoprotein K The functional role of Heterogeneous nuclear ribonucleoprotein K (hnRNP K) in transcriptional systems“. Thesis, 2006. http://ndltd.ncl.edu.tw/handle/44235470736643793561.

Der volle Inhalt der Quelle
Annotation:
碩士
國防醫學院
生物化學研究所
94
Heterogeneous nuclear ribonucleoprotein (hnRNP) K, a component of the hnRNP particles, is a multifunctional protein known to be involved in several steps of regulation of transcription, translation, nuclear transport and signal transduction. Involvement of hnRNP K protein in gene expression has been demonstrated, hnRNP K protein can both activate and repress these processes, depending on different cell lines or gene expression system. The current study has showed that hnRNP K would be induced after DNA damage and be a transcription coactivator for regulating the expression of p53-target gene. However, the mechanism of hnRNP K for regulating the expression of p53-target gene remains unclear. Recent studies also show that arginine methylation of hnRNP K by PRMT 1,not CARM 1 would influence the protein-protein interaction and the ability of transcriptional regulation. In this study, we identified the transcriptional activation domain of hnRNP K and demonstrate that no effect of arginine methylation of hnRNP K on its induction of p53-target gene expression, suggesting that the arginine methylation of hnRNP K is not involved in regulating the p53 functions.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!