15,559 research outputs found
Dissertationem Inauguralem Ad L. Aede III. C. De Locat. Et Conduct. Permissu Superiorum Illustri Praeside ... Dn. Joh. Volk. Bechmann ... Pro Consequenda Doctorali Licentia Publicae Censurae Exhibet Andreas Straub/ Norimb. Ienae, Die Ian. A.C. M.DC.LXXXII.
Get PDFDISSERTATIONEM INAUGURALEM AD L. AEDE III. C. DE LOCAT. ET CONDUCT. PERMISSU SUPERIORUM ILLUSTRI PRAESIDE ... DN. JOH. VOLK. BECHMANN ... PRO CONSEQUENDA DOCTORALI LICENTIA PUBLICAE CENSURAE EXHIBET ANDREAS STRAUB/ NORIMB. IENAE, DIE IAN. A.C. M.DC.LXXXII.
Dissertationem Inauguralem Ad L. Aede III. C. De Locat. Et Conduct. Permissu Superiorum Illustri Praeside ... Dn. Joh. Volk. Bechmann ... Pro Consequenda Doctorali Licentia Publicae Censurae Exhibet Andreas Straub/ Norimb. Ienae, Die Ian. A.C. M.DC.LXXXII. ([1])
Titelseite ([1])
Viri Magnifici, Nobilissimi, Praestrenui et Prudentissimi ... ([2])
Text ([3])
Beitrag ([16]
Werksessie A: Slimmer, Ad Straub
No full textGooi het roer om. Maak slimmere combinaties van reparaties, klachten- en planmatig onderhoud. Betrek bewoners veel actiever bij het signaleren en uitvoeren van onderhoud
Constantia ab Suedicis obsessa, ab Caesarianis & obsessis, deo opitulante defensa, liberata, sive, Narratio super rebus gestis, eo tempore, quo ab Septembris Anni MDCXXXIII die VII ad usque diem V. Octobr. anni eiusdem Suedici hostes, Duce Gustavo Hornio etc. auxiliatoribus Wirtenbergicis ... Constantiam obsederunt, oppugnarunt : Deus vero Max. Imp. Caesarianis copiis ... liberavit & conservavit etc
No full textDruckjahr gemäss VD17TitelvignetteVerfasser ist gemäss der deutschen Übersetzung Leonhard StraubBogensignaturen: A-E
Historia Antiqua Liberae Atque Imperialis Civitatis Norimbergae
No full textQuam Sub Praesidio Casparis Sagittarii ... Publico Examini Proponit Andreas Straub Norimbergensis. Ad d. IanuariiErscheinungsjahr nach dem Datum der Dissertation ermittelt (vgl. VD17 12:000133T
Link stability estimation based on link connectivity changes in mobile ad-hoc networks
Get PDFDear Wang,
Re: Link Stability Estimation Based on Link Connectivity Changes in Mobile Ad-hoc Networks
I have not been able to assess if this is an author version peer-reviewed or is it an author version non peer reviewed. Could you please clarify this so I can proceed to add your paper to Spiral. Spiral digital repository only accept peer-reviewed papers.
30/11/12 author has confirmed peer reviewe
Cost savings from performance-based maintenance contracting
Get PDFNew procurement approaches combined with performance-based building approaches should reduce costs, but empirical qualitative and quantitative studies are lacking. Performance-based maintenance contracts give maintenance suppliers incentives to improve their way of working. Innovative, cost-effective solutions that meet the performance criteria can be achieved, especially if the principle of whole-life costing is being adopted. Indirect cost savings are expected as well. It enables maintenance contractors to assume responsibility for certain activities for which they are better equipped to perform than their clients. A calculation model was developed that calculates the net present value of the direct (product) and indirect (transaction) costs at project level for a competitive maintenance tendering approach and for performance-based maintenance contracts. The fi ndings show that performance-based maintenance contracts reduce both direct and indirect costs compared to a competitive tendering approach. Essential preconditions are an early supplier involvement and longer term contracts, giving opportunities for maintenance product and maintenance process improvements.Sustainable housing transformationsOTB Research Institut
Cerebral atrophy in mild cognitive impairment and Alzheimer disease: rates and acceleration.
Get PDFOBJECTIVE: To quantify the regional and global cerebral atrophy rates and assess acceleration rates in healthy controls, subjects with mild cognitive impairment (MCI), and subjects with mild Alzheimer disease (AD). METHODS: Using 0-, 6-, 12-, 18-, 24-, and 36-month MRI scans of controls and subjects with MCI and AD from the Alzheimer's Disease Neuroimaging Initiative (ADNI) database, we calculated volume change of whole brain, hippocampus, and ventricles between all pairs of scans using the boundary shift integral. RESULTS: We found no evidence of acceleration in whole-brain atrophy rates in any group. There was evidence that hippocampal atrophy rates in MCI subjects accelerate by 0.22%/year2 on average (p = 0.037). There was evidence of acceleration in rates of ventricular enlargement in subjects with MCI (p = 0.001) and AD (p < 0.001), with rates estimated to increase by 0.27 mL/year2 (95% confidence interval 0.12, 0.43) and 0.88 mL/year2 (95% confidence interval 0.47, 1.29), respectively. A post hoc analysis suggested that the acceleration of hippocampal loss in MCI subjects was mainly driven by the MCI subjects that were observed to progress to clinical AD within 3 years of baseline, with this group showing hippocampal atrophy rate acceleration of 0.50%/year2 (p = 0.003). CONCLUSIONS: The small acceleration rates suggest a long period of transition to the pathologic losses seen in clinical AD. The acceleration in hippocampal atrophy rates in MCI subjects in the ADNI seems to be driven by those MCI subjects who concurrently progressed to a clinical diagnosis of AD
A Fair and Secure Cluster Formation Process for Ad Hoc Networks
Get PDFAn efficient approach for organizing large ad hoc networks is to divide the nodes
into multiple clusters and designate, for each cluster, a clusterhead which is responsible for
holding intercluster control information. The role of a clusterhead entails rights and duties.
On the one hand, it has a dominant position in front of the others because it manages the
connectivity and has access to other node¿s sensitive information. But on the other hand, the
clusterhead role also has some associated costs. Hence, in order to prevent malicious nodes
from taking control of the group in a fraudulent way and avoid selfish attacks from suitable
nodes, the clusterhead needs to be elected in a secure way. In this paper we present a novel
solution that guarantees the clusterhead is elected in a cheat-proof manner
Energy efficiency in ad-hoc wireless networks
Get PDFIn ad-hoc wireless networks, nodes are typically battery-powered, therefore energy limitations are among the critical constraints in ad-hoc wireless networks' development. The approaches investigated in this thesis to achieve energy efficient performance in wireless networks
can be grouped into three main categories.
1. Each wireless network node has four energy consumption states: transmitting, receiving, listening and sleeping states. The power consumed in the listening state is less than the power consumed in the transmitting and receiving states, but significantly greater than that in the sleeping state. Energy efficiency is achieved if as many nodes as possible are put into the sleeping states.
2) Since energy is consumed for transmission nonlinearly in terms of the transmission range, transmission range adjustment is another energy saving approach. In this work, the optimal transmission range is derived and applied to achieve energy efficient performance in a number of scenerios.
3) Since energy can be saved properly arranging the communication algorithms, network topology management or network routing is the third approach which can be utilised in combination with the above two approaches. In this work, Geographical Adaptive Fidelity (GAF) algorithms, clustering algorithms and Geographic Routing (GR) algorithms are all utilised to reduce the energy consumption of wireless networks, such as Sensor Networks and Vehicular Networks.
These three approaches are used in this work to reduce the energy consumption of wireless networks. With the GAF algorithm. We derived the optimal transmission range and optimal grid size in both linear and rectangular networks and as a result we show how the network energy consumptions can be reduced and how the network lifetime can be prolonged. With Geographic Routing algorithms the author
proposed the Optimal Range Forward (ORF) algorithm and Optimal Forward with Energy Balance (OFEB) algorithm to reduce the energy consumption and to prolong the network lifetime. The results show that compared to the traditional GR algorithms (Most Forward within Radius, Nearest Forward Progress), the network lifetime is prolonged. Other approaches have also been considered to improve the networks's energy efficient operation utilising Genetic Algorithms to find the optimal size of the grid or cluster. Furthermore realistic physical layer models, Rayleigh fading and LogNormal fading, are considered in evaluating energy efficiency in a realistic network environment
The impact of mobility models on the performance of mobile Ad Hoc network routing protocol
No full textA mobility model represents nodes distribution and movement over the network. Several research works have shown that a selection of mobility model can affect the outcome of routing performance simulation in Mobile Ad Hoc Networks. Thus, a routing protocol may only be effective in a particular mobility model or scenario but performs inferiorly in another. As a result, analyses of routing protocol performance are often based on inadequate information leading to inaccurate argument and conclusion. In this paper, three different mobility models have been selected, where each of them is highly distinctive in terms of nodes movement behavior. In addition, a new measurement technique called probability of route connectivity is introduced. The technique is used to quantify the success rate of route established by a routing protocol. Extensive simulation runs are done and results are compared between each mobility model
- …
