Дисертації з теми "Shared systems"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Shared systems".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Gutekunst, Thomas F. "Shared window systems /." [S.l.] : [s.n.], 1995. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=11120.
Повний текст джерелаJacob, Jeremy. "On shared systems." Thesis, University of Oxford, 1987. http://ora.ox.ac.uk/objects/uuid:a17b30b9-eef5-4db2-8420-6df3cf3f8175.
Повний текст джерелаPrescher, Daniel. "Shared Service Center : Att införa ett Shared Service Center." Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-22481.
Повний текст джерелаChemla, Daniel, and Daniel Chemla. "Algorithms for optimizing shared mobility systems." Phd thesis, Université Paris-Est, 2012. http://pastel.archives-ouvertes.fr/pastel-00839521.
Повний текст джерелаBeal, Jacob Stuart Michael. "Generating communication systems through shared context." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/87194.
Повний текст джерелаChemla, Daniel. "Algorithms for optimizing shared mobility systems." Thesis, Paris Est, 2012. http://www.theses.fr/2012PEST1066/document.
Повний текст джерелаBikes sharing systems have known a growing success all over the world. Several attempts have been made since the 1960s. The latest developments in ICT have enabled the system to become efficient. People can obtain real-time information about the position of the vehicles. More than 200 cities have already introduced the system and this trend keeps on with the launching of the NYC system in spring 2013. A new avatar of these means of transportation has arrived with the introduction of Autolib in Paris end of 2011.The objective of this thesis is to propose algorithms that may help to improve this system efficiency. Indeed, operating these systems induces several issues, one of which is the regulation problem. Regulation should ensures users that a right number of vehicles are present at any station anytime in order to fulfill the demand for both vehicles and parking racks. This regulation is often executed thanks to trucks that are travelling the city. This regulation issue is crucial since empty and full stations increase users' dissatisfaction. Finding the optimal strategy for regulating a network appears to be a difficult question. This thesis is divided into two parts. The first one deals with the “static” case. In this part, users' impact on the network is neglected. This is the case at night or when the system is closed. The operator faces a given repartition of the vehicles. He wants the repartition to match a target one that is known a priori. The one-truck and multiple-truck balancing problems are addressed in this thesis. For each one, an algorithm is proposed and tested on several instances. To deal with the “dynamic” case in which users interact with the system, a simulator has been developed. It is used to compare several strategies and to monitor redistribution by using trucks. Strategies not using trucks, but incentive policies are also tested: regularly updated prices are attached to stations to deter users from parking their vehicle at specified stations. At last, the question to find the best initial inventory is also addressed. It corresponds to the case when no truck are used within the day. Two local searches are presented and both aim at minimizing the total time lost by users in the system. The results obtained can be used as inputs for the target repartitions used in the first part. During my thesis, I participated to two EURO-ROADEF challenges, the 2010 edition proposed by EDF and the 2012 one by Google. In both case, my team reached the final phase. In 2010, our method was ranked fourth over all the participants and led to the publication of an article. In 2012, we ranked eighteenth over all the participants. Both works are added in the appendix
Jiang, Jingjing. "Shared-control for systems with constraints." Thesis, Imperial College London, 2016. http://hdl.handle.net/10044/1/33381.
Повний текст джерелаWen, Yuzhong. "Replication of Concurrent Applications in a Shared Memory Multikernel." Thesis, Virginia Tech, 2016. http://hdl.handle.net/10919/71813.
Повний текст джерелаMaster of Science
Hysing, Andreas Dreyer. "Parallel Seismic Inversion for Shared Memory Systems." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for datateknikk og informasjonsvitenskap, 2010. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-11795.
Повний текст джерелаBruce, Craig Steven. "Performance optimization for distributed-shared-data systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ32819.pdf.
Повний текст джерелаCoe, Paul. "Simulation models of shared-memory multiprocessor systems." Thesis, University of Edinburgh, 2000. http://hdl.handle.net/1842/13437.
Повний текст джерелаMolka, Daniel. "Performance Analysis of Complex Shared Memory Systems." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-221729.
Повний текст джерелаZhang, Ping, and Andrew Dillon. "HCI and MIS: shared concerns (Editorial)." Elsevier, 2003. http://hdl.handle.net/10150/106118.
Повний текст джерелаPrytz, Erik. "Performance and Shared Understanding in Mixed C2-Systems." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-56430.
Повний текст джерелаGong, Yan. "Locking granularity in shared-nothing parallel database systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ36879.pdf.
Повний текст джерелаRuppert, Eric. "The consensus power of shared-memory distributed systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0028/NQ49848.pdf.
Повний текст джерелаWahbe, Andrew A. "Linearizable shared objects for asynchronous message passing systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0024/MQ50378.pdf.
Повний текст джерелаHsieh, Wilson Cheng-Yi. "Dynamic computation migration in distributed shared memory systems." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/36635.
Повний текст джерелаVita.
Includes bibliographical references (p. 123-131).
by Wilson Cheng-Yi Hsieh.
Ph.D.
Kouzoupis, Antonios. "High performance shared state schedulers." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-196145.
Повний текст джерелаNu för tiden lagrar stora organisationer och forskningsinstitutioner enorma mängder data.För att kunna utvinna någon värdefull information från dessa data behöver den bearbetasav ett kluster av datorer. När flera datorer gemensamt ska bearbeta data behöver de utgåfrån ett så kallat "distributed processing framework''. I dagsläget är Apache Hadoop detmest använda ramverket för distribuerad lagring och behandling av data. Detta examensarbeteär har genomförts vid SICS Swedish ICT där vi byggt Hops, en ny distribution avApache Hadoop som drivs av ett distribuerat MySQL Cluster NDB som erbjuder en hög tillgänglighet.Hops-YARN är Hops ramverk för resurshantering med distribuerade ResourceManagers som lastbalanserarderas ResourceTrackerService. I detta examensarbete använder vi Hops-Yarn på ett sätt där ``back-end''databasen flitigt används för att hantera ResourceManagerns metadata och inkommande RPC-anrop. Vårkonfiguration erbjuder en hög feltolerans och återställer sig mycket snabbt vidfelberäkningar. Vidare används NDB-klustrets Event API för att ResourceManager ska kunnakommunicera med den distribuerade ResourceTrackers. Detta projekt syftar till att optimera de mekanismer som används för ihållande metadatai NDB både i termer av transaktions begå tid men också i termer av pre-bearbeta dem medan samtidigt garantera enhetlighet i RM: s tillstånd. ResourceManagerns tillståndi RAM-minnet får under inga omständigheteravvika från det tillstånd som finns lagrat i NDB:n. Med dessa mål i åtanke undersöktes fleralösningar som förbättrar prestandan och därmed gör Hops-Yarn jämförbart med Apache YARN.De lösningar som föreslås i denna uppsats förbättrar “pure commit time” när en transaktiongörs i ett MySQL Cluster samt förbehandlingen och parallelismen i vår Transaction Manager.Resultaten tyder på att Hops prestanda ökade dramatiskt vilket ledde till ett effektivarenyttjande av tillgängliga resurser i ett kluster bestående av ett tusental datorer. Närnyttjandet av tillgänliga resurser i ett kluster förbättras med några få procent kanorganisationer spara mycket pengar.
Ramesh, Bharath. "Samhita: Virtual Shared Memory for Non-Cache-Coherent Systems." Diss., Virginia Tech, 2013. http://hdl.handle.net/10919/23687.
Повний текст джерелаPh. D.
Krishnaswamy, Vijaykumar. "Shared state management for time-sensitive distributed applications." Diss., Georgia Institute of Technology, 2001. http://hdl.handle.net/1853/8197.
Повний текст джерелаArgile, Andrew Duncan Stuart. "Distributed processing in decision support systems." Thesis, Nottingham Trent University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.259647.
Повний текст джерелаCosta, Prats Juan José. "Efficient openMP over sequentially consistent distributed shared memory systems." Doctoral thesis, Universitat Politècnica de Catalunya, 2011. http://hdl.handle.net/10803/81012.
Повний текст джерелаWu, Yunhui. "Agent behavior in peer-to-peer shared ride systems /." Connect to thesis, 2007. http://eprints.unimelb.edu.au/archive/00003214.
Повний текст джерелаMohindra, Ajay. "Issues in the design of distributed shared memory systems." Diss., Georgia Institute of Technology, 1993. http://hdl.handle.net/1853/9123.
Повний текст джерелаZhang, Guowei Ph D. Massachusetts Institute of Technology. "Architectural support to exploit commutativity in shared-memory systems." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/106073.
Повний текст джерелаCataloged from PDF version of thesis.
Includes bibliographical references (pages 57-64).
Parallel systems are limited by the high costs of communication and synchronization. Exploiting commutativity has historically been a fruitful avenue to reduce traffic and serialization. This is because commutative operations produce the same final result regardless of the order they are performed in, and therefore can be processed concurrently and without communication. Unfortunately, software techniques that exploit commutativity, such as privatization and semantic locking, incur high runtime overheads. These overheads offset the benefit and thereby limit the applicability of software techniques. To avoid high overheads, it would be ideal to exploit commutativity in hardware. In fact, hardware already provides much of the functionality that is required to support commutativity For instance, private caches can buffer and coalesce multiple updates. However, current memory hierarchies can understand only reads and writes, which prevents hardware from recognizing and accelerating commutative operations. The key insight this thesis develops is that, with minor hardware modifications and minimal extra complexity, cache coherence protocols, the key component of communication and synchronization in shared-memory systems, can be extended to allow local and concurrent commutative operations. This thesis presents two techniques that leverage this insight to exploit commutativity in hardware. First, Coup provides architectural support for a limited number of single-instruction commutative updates, such as addition and bitwise logical operations. CouP allows multiple private caches to simultaneously hold update-only permission to the same cache line. Caches with update-only permission can locally buffer and coalesce updates to the line, but cannot satisfy read requests. Upon a read request, Coup reduces the partial updates buffered in private caches to produce the final value. Second, CoMMTM is a commutativity-aware hardware transactional memory (HTM) that supports an even broader range of multi-instruction, semantically commutative operations, such as set insertions and ordered puts. COMMTM extends the coherence protocol with a reducible state tagged with a user-defined label. Multiple caches can hold a given line in the reducible state with the same label, and transactions can implement arbitrary user-defined commutative operations through labeled loads and stores. These commutative operations proceed concurrently, without triggering conflicts or incurring any communication. A non-commutative operation (e.g., a conventional load or store) triggers a user-defined reduction that merges the different cache lines and may abort transactions with outstanding reducible updates. CouP and CoMMTM reduce communication and synchronization in many challenging parallel workloads. At 128 cores, CouP accelerates state-of-the-art implementations of update-heavy algorithms by up to 2.4x, and COMMTM outperforms a conventional eager-lazy HTM by up to 3.4x and reduces or eliminates wasted work due to transactional aborts.
by Guowei Zhang.
S.M.
Garside, Jamie. "Real-time prefetching on shared-memory multi-core systems." Thesis, University of York, 2015. http://etheses.whiterose.ac.uk/10711/.
Повний текст джерелаKaiser, Alexander. "Monotonicity in shared-memory program verification." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:1d16b4b5-524a-40db-b7bf-062374f8679c.
Повний текст джерелаFitzsimons, Declan. "A psychodynamic perspective on the implementation of shared leaderships." Thesis, Cranfield University, 2013. http://dspace.lib.cranfield.ac.uk/handle/1826/7921.
Повний текст джерелаGull, Aarron. "Cherub : a hardware distributed single shared address space memory architecture." Thesis, City University London, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356981.
Повний текст джерелаKong, Jiantao. "Trusted data path protecting shared data in virtualized distributed systems." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/33820.
Повний текст джерелаFarook, Mohammad. "Fast lock-free linked lists in distributed shared memory systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ32107.pdf.
Повний текст джерелаLo, Adley Kam Wing. "Tolerating latency in software distributed shared memory systems through multithreading." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ34040.pdf.
Повний текст джерелаJaseemuddin, Muhammad. "Bidirectional ring, an interconnection network for shared-memory multiprocessor systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape11/PQDD_0004/NQ41554.pdf.
Повний текст джерелаMärtens, Holger. "Options in Scan Processing for Shared-Disk Parallel Database Systems." Universität Leipzig, 1998. https://ul.qucosa.de/id/qucosa%3A34523.
Повний текст джерелаDai, Donglai. "Designing efficient communication subsystems for distributed shared memory (DSM) systems /." The Ohio State University, 1999. http://rave.ohiolink.edu/etdc/view?acc_num=osu1488186329503887.
Повний текст джерелаAusavarungnirun, Rachata. "Techniques for Shared Resource Management in Systems with Throughput Processors." Research Showcase @ CMU, 2017. http://repository.cmu.edu/dissertations/905.
Повний текст джерелаLai, Bo-Cheng. "Cross-layer co-design of shared memory multi-core systems." Diss., Restricted to subscribing institutions, 2007. http://proquest.umi.com/pqdweb?did=1324381171&sid=1&Fmt=2&clientId=1564&RQT=309&VName=PQD.
Повний текст джерелаMortensen, Christian. "Implementation of Data Parallel Primitives on MIMD Shared Memory Systems." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-44165.
Повний текст джерелаSyed, Moiz Masood. "Shared Solar Generation and Battery Storage Systems in Residential Microgrids." Thesis, Curtin University, 2021. http://hdl.handle.net/20.500.11937/86206.
Повний текст джерелаPeña, Alcaraz Maite. "Analysis of capacity pricing and allocation mechanisms in shared railway systems." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99564.
Повний текст джерелаCataloged from PDF version of thesis.
Includes bibliographical references (pages 187-194).
In the last 15 years, the use of rail infrastructure by different train operating companies (shared railway system) has been proposed as a way to improve infrastructure utilization and to increase efficiency in the railway industry. Shared use requires coordination between the infrastructure manager and multiple train operators. Such coordination requires capacity planning mechanisms that determine which trains can access the infrastructure at each time, capacity allocation, and the access charges they have to pay, capacity pricing. The objective of this thesis is to contribute to the field of shared railway systems coordination by 1) developing a framework to analyze the performance of shared railway systems under alternative capacity pricing and allocation mechanisms, and 2) using this framework to understand the implications of representative capacity pricing and allocation mechanisms in representative shared railway systems. There are strong interactions between capacity planning and infrastructure operations in the railway industry; the operations on the infrastructure determine the available capacity in the system. As a consequence, the framework developed in this thesis to evaluate the performance of shared railway systems under alternative capacity pricing and allocation consists of two models: 1) a train operator model and 2) an infrastructure manager model. The train operator model is a financial model that anticipates how train operators would respond to the capacity pricing and allocation mechanisms and determine their demand for infrastructure use. The infrastructure manager model is a network optimization model that determines the optimal train timetable (infrastructure manager's decisions) that accommodates the train operators' demands for scheduling trains, considering the topology of the system, safety constraints, and other technical aspects of the infrastructure for shared railway systems. To be able to solve the train timetabling optimization problem in meaningful instances, this thesis develops a novel approximate dynamic programming algorithm based on linear programming that extends previous algorithms proposed in the literature to effectively solve large network optimization problems. This thesis then uses the train operator model to compare the operational decisions of train operators in shared railway systems with the operational decisions of even-handed integrated railway companies. We show that train operators in shared railway system access charges reflect variable infrastructure manager's costs to operate trains on the infrastructure. We also identify two cases in which the train operators may have incentives to deviate from the integrated railway systems' operational decisions: 1) when the infrastructure manager needs to recover part of the infrastructure management fixed costs, or 2) when the railway system is congested. This motivates the choice of the two case studies of this thesis, one based on the Central Corridor in Tanzania, and the other one based on the Northeast Corridor in the US. We then show how to use the framework proposed in this thesis to analyze the trade-offs associated with the use of alternative mechanisms in these two cases. To our knowledge, this is the first effort to compare alternative mechanisms to price and allocate capacity in the same shared railway system. The results of this thesis show that there are important trade-offs associated with each mechanism and none of them is superior to the other on all dimensions. We thus recommend that system stakeholders carefully analyze the implications of alternative capacity pricing and allocation mechanisms before locking the system into one of them. This is particularly important today since several countries are currently restructuring their railway sector to allow shared use. We claim that the improved understanding of the system performance gained with the framework proposed in this thesis is important to be able to design adequate capacity pricing and allocation mechanisms that can mitigate the coordination problems of shared railway systems while maintaining the benefits of shared infrastructure in the railway industry.
by Maite (Maria Teresa) Pena-Alcaraz.
Ph. D.
Tappan, Jacqueline M. (Jacqueline Marie). "Designing an error resolution checklist for a shared manned-unmanned environment." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/62776.
Повний текст джерелаCataloged from PDF version of thesis.
Includes bibliographical references (p. 151-153).
The role of unmanned vehicles in military and commercial environments continues to expand, resulting in Shared Manned-Unmanned (SMU) domains. While the introduction of unmanned vehicles can have many benefits, humans operating within these environments must shift to high-level supervisory roles, which will require them to resolve system errors. Error resolution in current Human Supervisory Control (HSC) domains is performed using a checklist; the error is quickly identified, and then resolved using the steps outlined by the checklist. Background research into error resolution identified three attributes that impact the effectiveness of an error resolution checklist: domain predictability, sensor reliability, and time availability. These attributes were combined into a Checklist Attribute Model (CAM), demonstrating that HSC domains with high levels of complexity (e.g. SMU domains) are ill-suited to error resolution using traditional checklists. In particular, it was found that more support was required during such error identification, as data is uncertain and unreliable. A new error resolution checklist, termed the GUIDER (Graphical User Interface for Directed Error Recovery) Probabilistic Checklist, was developed to aid the human during the error identification process in SMU domains. Evaluation was performed through a human performance experiment requiring participants to resolve errors in a simulated SMU domain using the GUIDER Probabilistic Checklist and a traditional checklist tool. Thirty-six participants were recruited, and each was assigned to a single checklist tool condition. Participants completed three simulated error scenarios. The three scenarios had varying sensor reliability levels (low, medium, high) to gauge the impact of uncertainty on the usefulness of each checklist tool. The human performance experiment showed that the addition of error likelihood data using an intuitive visualization through the GUIDER Probabilistic Checklist improved error resolution in uncertain settings. In settings with high certainty, there was no difference found between the performances of the two checklists. While positive, further testing is required in more realistic settings to validate both the effectiveness of the GUIDER Probabilistic Checklist tool and the Checklist Attribute Model.
by Jacqueline M. Tappan.
S.M.
Avnet, Mark Sean. "Socio-cognitive analysis of engineering systems design : shared knowledge, process, and product." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/52782.
Повний текст джерелаThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (p. 213-222).
This research is based on the well-known but seldom stated premise that the design of complex engineered systems is done by people -- each with their own knowledge, thoughts, and views about the system being designed. To understand the implications of this social dimension, the Integrated Concurrent Engineering (ICE) environment, a real-world setting for conceptual space mission design, is examined from technical and social perspectives. An integrated analysis demonstrates a relationship among shared knowledge, process, and product. The design process is analyzed using a parameter-based Design Structure Matrix (DSM). This model, consisting of 682 dependencies among 172 parameters, is partitioned (reordered) to reveal a tightly coupled design process. Further analysis shows that making starting assumptions about design budgets leads to a straightforward process of well-defined and sequentially executed design iterations. To analyze the social aspects, a network-based model of shared knowledge is proposed. By quantifying team members' common views of design drivers, a network of shared mental models is built to reveal the structure of shared knowledge at a snapshot in time. A structural comparison of pre-session and post-session networks is used to compute a metric of change in shared knowledge. Based on survey data from 12 design sessions, a correlation is found between change in shared knowledge and each of several system attributes, including technological maturity, development time, mass, and cost. Integrated analysis of design process and shared knowledge yields three interdisciplinary insights.
(cont.) First, certain features of the system serve a central role both in the design process and in the development of shared knowledge. Second, change in shared knowledge is related to the design product. Finally, change in shared knowledge and team coordination (agreement between expected and reported interactions) are positively correlated. The thesis contributes to the literature on product development, human factors engineering, and organizational and social psychology. It proposes a rigorous means of incorporating the socio cognitive aspects of design into the practice of systems engineering. Finally, the thesis offers a set of recommendations for the formation and management of ICE design facilities and discusses the applicability of the proposed methodology to the full-scale development of complex engineered systems.
by Mark Sean Avnet.
Ph.D.
Chan, Serena 1977. "Architectures for a space-based information network with shared on-orbit processing." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/30353.
Повний текст джерелаThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 335-343).
This dissertation provides a top level assessment of technology design choices for the architecture of a space-based information network with shared on-orbit processing. Networking is an efficient method of sharing communications and lowering the cost of communications, providing better interoperability and data integration for multiple satellites. The current space communications architecture sets a critical limitation on the collection of raw data sent to the ground. By introducing powerful space-borne processing, compression of raw data can alleviate the need for expensive and expansive downlinks. Moreover, distribution of processed data directly from space sensors to the end-users may be more easily realized. A space-based information network backbone can act as the transport network for mission satellites as well as enable the concept of decoupled, shared, and perhaps distributed space-borne processing for space-based assets. Optical crosslinks are the enabling technology for creating a cost-effective network capable of supporting high data rates. In this dissertation, the space-based network backbone is designed to meet a number of mission requirements by optimizing over constellation topologies under different traffic models. With high network capacity availability, space-borne processing can be accessible by any mission satellite attached to the network. Space-borne processing capabilities can be enhanced with commercial processors that are tolerant of radiation and replenished periodically (as frequently as every two years).
(cont.) Additionally, innovative ways of using a space-based information network can revolutionize satellite communications and space missions. Applications include distributed computing in space, interoperable space communications, multiplatform distributed satellite communications, coherent distributed space sensing, multisensor data fusion, and restoration of disconnected global terrestrial networks after a disaster. Lastly, the consolidation of all the different communications assets into a horizontally integrated space-based network infrastructure calls for a space-based network backbone to be designed with a generic nature. A coherent infrastructure can satisfy the goals of interoperability, flexibility, scalability, and allows the system to be evolutionary. This transformational vision of a generic space-based information network allows for growth to accommodate civilian demands, lowers the price of entry for the commercial sector, and makes way for innovation to enhance and provide additional value to military systems.
by Serena Chan.
Ph.D.
Sun, Jiawen. "The GraphGrind framework : fast graph analytics on large shared-memory systems." Thesis, Queen's University Belfast, 2018. https://pure.qub.ac.uk/portal/en/theses/the-graphgrind-framework-fast-graph-analytics-on-large-sharedmemory-systems(e1eb006f-3a68-4d05-91fe-961d04b42694).html.
Повний текст джерелаFaltemier, Timothy Collin. "A groupware interface to a shared file system." Texas A&M University, 2004. http://hdl.handle.net/1969.1/1352.
Повний текст джерелаJohansson, Oscar, and Max Forsman. "Shared computer systems and groupware development : Escaping the personal computer paradigm." Thesis, Linnéuniversitetet, Institutionen för datavetenskap (DV), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-75953.
Повний текст джерелаPrytz, Erik. "Performance and Shared Understanding in Mixed C2-Systems." Thesis, Linköping University, Department of Computer and Information Science, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-56430.
Повний текст джерелаOBJECTIVE: This thesis had two purposes. The main one was to examine how mixed conditions affect a Command & Control (C2) system, particularly in terms of shared understanding, situation awareness (SA), performance and workload. Mixed conditions refer here to when subsystems of a larger C2-system differ in terms of capabilities, particularly those capabilities influencing the understanding of a situation e.g. sensors or communication, which could affect the C2-capabilities when working toward a common goal. The second purpose of this thesis was to investigate a newly developed tool for measuring shared understanding, Shared Priorities, in terms of validity and usefulness.
METHOD: A number of hypotheses were constructed and investigated by a controlled experiment using a microworld, C3Fire, where two-man teams fought a simulated forest fire. The independent variable manipulated was the type of support system used. One condition used one computer interface per participant, the second was mixed conditions where one participant used the computer interface and one used a paper map, and the last condition was both participants using a paper map. Different questionnaires developed to measure SA, workload etc. was used to measure the dependent variables.
RESULTS: The statistical analysis performed on the collected data showed that the performance and SA was comparatively better when both participants used the computer interface than the mixed condition, which in turn was better than when both participants used a paper map. For workload and teamwork, no differences between the mixed condition and the dual map condition were found. As for the Shared Priorities measurement, no differences were found between any of the conditions.
CONCLUSION: A C2-system in which some additional capabilities are introduced for some but not all subsystems may not benefit in some regards, e.g. workload and teamwork, but could improve in others, e.g. SA and performance. A Structural Equation Model (SEM) shows that the theoretical constructs of SA, workload, teamwork and performance are related and affect each other, so that the workload of the system negatively affects the teamwork and SA, while the teamwork may affect SA positively and a high SA enables high performance.
Heitmann, Carsten Andreas. "DISCOlab: a toolkit for development of shared display systems in UbiCollab." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2005. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9179.
Повний текст джерелаShared displays are important tools for promoting collaboration.Ubiquitous computing presents new requirements for the design of shared display systems.Contextualisation of information at shared displays is becoming more important. The ability to rapidly create shared display systems is motivated by the fact that shared displays play central roles in collaboration. Low level implementation issues, common to shared display systems can be an obstacle for this. A toolkit for creation of such systems is therefore needed to provide basic shared display functionality to developers. This master thesis presents a toolkit for creating shared display applications on UbiCollab, a platform supporting collaborative work in ubiquitous environments. The work shows the development of the toolkit and how the toolkit can be used to create a shared display system. The toolkit takes advantage of the opportunities the UbiCollab platform provides on contextualisation of information.
Mikael, Silvén. "Evaluation and Comparison of Programming Frameworks for Shared Memory Multicore Systems." Thesis, Linköpings universitet, Programvara och system, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-109674.
Повний текст джерела