Relevant bibliographies by topics / Shared systems

Academic literature on the topic 'Shared systems'

Author: Grafiati
Published: 14 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Shared systems.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Shared systems"

1

Laporte, Gilbert, Frédéric Meunier, and Roberto Wolfler Calvo. "Shared mobility systems." 4OR 13, no. 4 (November 24, 2015): 341–60. http://dx.doi.org/10.1007/s10288-015-0301-z.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tobias, Jim. "Shared Resource Assistive Systems." Technology and Disability 3, no. 3 (September 1, 1994): 213–17. http://dx.doi.org/10.3233/tad-1994-3308.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

MORIN, RÉMI. "UNAMBIGUOUS SHARED-MEMORY SYSTEMS." International Journal of Foundations of Computer Science 21, no. 04 (August 2010): 665–85. http://dx.doi.org/10.1142/s0129054110007489.

Full text
Abstract:
Shared-memory systems appear as a generalization of asynchronous cellular automata. In this paper we relate the partial-order semantics of shared-memory systems to Mazurkiewicz trace languages by means of a new refinement construction. We show that a set of labeled partial orders is recognized by some unambiguous shared-memory system if and only if it is definable in monadic second-order logic and media-bounded.
APA, Harvard, Vancouver, ISO, and other styles
4

Evan, Kami, Kris Aubry, Marilyn Hawkins, Terrence A. Curley, and Tim Porter-O??Grady. "Whole Systems Shared Governance." JONA: The Journal of Nursing Administration 25, no. 5 (May 1995): 18–27. http://dx.doi.org/10.1097/00005110-199505000-00006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bienefeld, Nadine, and Gudela Grote. "Shared Leadership in Multiteam Systems." Human Factors: The Journal of the Human Factors and Ergonomics Society 56, no. 2 (May 17, 2013): 270–86. http://dx.doi.org/10.1177/0018720813488137.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Steverson, Leonard A. "Shared Obliviousness in Family Systems." Journal of Family Theory & Review 2, no. 1 (March 26, 2010): 96–98. http://dx.doi.org/10.1111/j.1756-2589.2010.00043.x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Merritt, Michael, and Gadi Taubenfeld. "Knowledge in shared memory systems." Distributed Computing 7, no. 2 (December 1993): 99–109. http://dx.doi.org/10.1007/bf02280839.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Pennell, Charles, Natalie Sommerville, and Derek A. Rodriguez. "Shared Resources, Shared Records." Library Resources & Technical Services 57, no. 4 (September 30, 2013): 227–38. http://dx.doi.org/10.5860/lrts.57n4.227.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Berenbrink, Petra, André Brinkmann, Robert Elsässer, Tom Friedetzky, and Lars Nagel. "Randomized renaming in shared memory systems." Journal of Parallel and Distributed Computing 150 (April 2021): 112–20. http://dx.doi.org/10.1016/j.jpdc.2021.01.002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kamp, Poul-Henning, and Robert Watson. "Building Systems to Be Shared, Securely." Queue 2, no. 5 (July 2004): 42–51. http://dx.doi.org/10.1145/1016998.1017001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Shared systems"

1

Gutekunst, Thomas F. "Shared window systems /." [S.l.] : [s.n.], 1995. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=11120.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jacob, Jeremy. "On shared systems." Thesis, University of Oxford, 1987. http://ora.ox.ac.uk/objects/uuid:a17b30b9-eef5-4db2-8420-6df3cf3f8175.

Full text
Abstract:
Most computing systems are shared between users of various kinds. This thesis treats such systems as mathematical objects, and investigates two of their properties: refinement and security. The first is the analysis of the conditions under which one shared system can be replaced by another, the second the determination of a measure of the information flow through a shared system. Under the heading of refinement we show what it means for one shared system to be a suitable replacement for another, both in an environment of co-operating users and in an environment of independent users. Both refine- ment relations are investigated, and a large example is given to demonstrate the relation for cooperating users. We show how to represent the security of a shared system as an 'inference function', and define several security properties in terms of such functions. A partial order is defined on systems, with the meaning 'at least as secure as'. We generalise inference functions to produce 'security specifications' which can be used to capture the desired degree of security in any shared system. We define what it means for a shared system to meet a security specification and indicate how implementations may be derived from their specifications in some cases. A summary of related work is given.
APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chemla, Daniel, and Daniel Chemla. "Algorithms for optimizing shared mobility systems." Phd thesis, Université Paris-Est, 2012. http://pastel.archives-ouvertes.fr/pastel-00839521.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
5

Beal, Jacob Stuart Michael. "Generating communication systems through shared context." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/87194.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Chemla, Daniel. "Algorithms for optimizing shared mobility systems." Thesis, Paris Est, 2012. http://www.theses.fr/2012PEST1066/document.

Full text
Abstract:
Les systèmes de vélos en libre-service ont connu ces dernières années un développement sans précédent. Bien que les premières tentatives de mise en place remontent aux années 60, l'arrivée de technologies permettant un suivi des différents véhicules mis à la disposition du grand public et de l'état des bornes de stationnement en temps réel a rendu ces systèmes plus attractifs. Plus de 200 villes disposent de tels systèmes et cette tendance se poursuit avec l'entrée en fonctionnement du système de New York prévue pour mars 2013. La fin de l'année 2011 a été marquée par l'arrivée d'un nouvel avatar de ce type de transport avec la mise en place d'Autolib à Paris. L'objectif de cette thèse est de proposer des algorithmes d'aide à la décision pour l'optimisation de réseaux de transport en libre-service. L'exploitation de ces systèmes, qui fleurissent actuellement un peu partout dans le monde, pose en effet de nombreux problèmes, l'un des plus cruciaux étant celui de la régulation. Cette dernière a pour objectif de maintenir dans chaque station un nombre de vélos ni trop faible, ni trop élevé, afin de satisfaire au mieux la demande. Cette régulation se fait souvent par le biais de camions qui effectuent des tournées sur le réseau. Il apparaît rapidement que la question d'une régulation optimale à l'aide d'une flotte fixée de camions est une question difficile. La thèse est divisée en deux parties. Dans la première partie, le cas “statique” est considéré. Les déplacements de véhicules dus aux usagers sont négligés. Cela traduit la situation la nuit ou lorsque le système est fermé à la location. L'opérateur doit redistribuer les véhicules afin que ceux-ci soient disposés selon une répartition définie. Les problèmes de rééquilibrage avec un ou plusieurs camions sont traités. Pour chacun des deux cas, un algorithme est proposé et utilisé pour résoudre des instances de tailles variées. La seconde partie traite du cas “dynamique” dans lequel les utilisateurs interagissent avec le système. Afin d'étudier ce système complexe, un simulateur a été développé. Il est utilisé pour comparer différentes stratégies de redistribution des véhicules. Certaines utilisent des camions se déplaçant dans la ville pendant la journée. D'autres tentent d'organiser une régulation intrinsèque du système par le biais d'une politique d'incitation : des prix mis à jour régulièrement encouragent les usagers à rendre leur véhicule dans certaines stations. Enfin, si on choisit de ne pas utiliser de camion durant la journée, la question de la détermination du nombre optimal de véhicules à disposer à chaque station se pose. Deux méthodes de recherche locale visant à minimiser le temps total perdu par les usagers sont présentées. Les résultats obtenus peuvent servir pour la définition des répartitions cibles de la première partie. Durant ma thèse, j'ai pu participer à deux challenges EURO/ROADEF, celui de 2010 proposé par EDF et celui de 2012 proposé par Google. Dans les deux cas, mon équipe a atteint les phases finales. Lors de l'édition de 2010, notre méthode est arrivée quatrième et a donné lieu à une publication. En 2012, notre méthode est arrivée dix-huitième sur tous les participants. Les travaux menés dans ces cadres sont ajoutés en annexe
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
APA, Harvard, Vancouver, ISO, and other styles
7

Jiang, Jingjing. "Shared-control for systems with constraints." Thesis, Imperial College London, 2016. http://hdl.handle.net/10044/1/33381.

Full text
Abstract:
In the thesis we solve the shared-control problem for three classes of systems: a class of linear mechanical systems, mobile robots and rear wheel drive cars, via full state feedback or output feedback while ensuring that all the state constraints on the closed-loop systems are satisfied. To design the feedback controller for a system with state constraints we firstly remove all the constraints by changing the coordinates through a logarithmic function. Then the back-stepping method is used to design the controller and a Lyapunov-like analysis is used to prove stability properties of the closed-loop system. The shared-control algorithm is based on a hysteresis switch which reduces oscillations when changing the control authority from the human operator to the feedback controller or vice-versa. Unlike other shared-control methods, formal properties of the closed-loop systems with the shared-control have been rigorously established. We start the design of the full state-feedback shared-controller with the assumption that the admissible Cartesian configuration set Pa of the system is a time-invariant convex set defined by a group of linear inequalities. Then the results are extended to the design of shared-controllers via output feedback. In the cases in which only output feedback is available, we can solve the problem by either developing an observer or 'remodeling' the system. Through system remodeling we are able to deal with any shape of the admissible configuration set Pa, even time-varying ones. Simulation results help to illustrate how the shared-controller works and show its effectiveness. The state of the closed-loop system with the shared-control never violates the constraints. Experiments done on a mobile robot also demonstrate that the shared-control algorithm works well in practice and meets all safety requirements. In addition, the experimental results match the simulation ones, indicating that the modeling approximations are reasonable and suitable.
APA, Harvard, Vancouver, ISO, and other styles
8

Wen, Yuzhong. "Replication of Concurrent Applications in a Shared Memory Multikernel." Thesis, Virginia Tech, 2016. http://hdl.handle.net/10919/71813.

Full text
Abstract:
State Machine Replication (SMR) has become the de-facto methodology of building a replication based fault-tolerance system. Current SMR systems usually have multiple machines involved, each of the machines in the SMR system acts as the replica of others. However having multiple machines leads to more cost to the infrastructure, in both hardware cost and power consumption. For tolerating non-critical CPU and memory failure that will not crash the entire machine, there is no need to have extra machines to do the job. As a result, intra-machine replication is a good fit for this scenario. However, current intra-machine replication approaches do not provide strong isolation among the replicas, which allows the faults to be propagated from one replica to another. In order to provide an intra-machine replication technique with strong isolation, in this thesis we present a SMR system on a multi-kernel OS. We implemented a replication system that is capable of replicating concurrent applications on different kernel instances of a multi-kernel OS. Modern concurrent application can be deployed on our system with minimal code modification. Additionally, our system provides two different replication modes that allows the user to switch freely according to the application type. With the evaluation of multiple real world applications, we show that those applications can be easily deployed on our system with 0 to 60 lines of code changes to the source code. From the performance perspective, our system only introduces 0.23\% to 63.39\% overhead compared to non-replicated execution.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
Abstract:
In this thesis will explore how a scientific application forseismic inversion can take advantage of multi-core programming on x86 architecture. The thesis will focus on most effective domain divisions, communication patterns and multithreaded scalability. Performance comparison withthe original codes will be included, as well as an evaluation of thedevelopment effort required for implementing such techniques.
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Shared systems"

1

Shared obliviousness in family systems. Albany: State University of New York Press, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Raynal, Michel. Concurrent Crash-Prone Shared Memory Systems. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-79213-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Jelica, Protić, Tomaševic Milo, and Milutinović Veljko, eds. Distributed shared memory: Concepts and systems. Los Alamitos, Calif: IEEE Computer Society Press, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ted, Neward, and Shilling Geoff, eds. Shared source CLI essentials. Beijing: O'Reilly, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gaddam, Sridhar. A distributed shared memory implementation for UNIX systems. Oxford: Oxford Brookes University, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Nebraska. Legislature. Legislative Research Division., ed. Nebraska Legislative Shared Information System, NLSIS. Lincoln, NE: The Division, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Shared ICT services catalogue. 3rd ed. Edmonton]: Alberta Restructuring and Government Efficiency, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Council, Northern Alberta Development. Telecommunications: Improved access by shared resources, conference proceedings. Edmonton: Northern Alberta Development Council, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wisconsin. Dept. of Transportation., United States. Dept. of Transportation. Office of the Secretary., and Ecosometrics inc, eds. Marketing manual for shared-ride taxi systems in Wisconsin. [Washington, D.C.?]: U.S. Dept. of Transportation, Office of the Secretary of Transportation, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Vermont. Office of the State Auditor. Auditor's survey of shared services in Vermont school systems. Montpelier, Vt: Office of the State Auditor, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Shared systems"

1

Gutekunst, Thomas. "Shared Window Systems." In Informatik aktuell, 436–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-60729-5_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Li, Mandy, Willy Susilo, and Joseph Tonien. "Securing Shared Systems." In Lecture Notes in Computer Science, 194–201. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-46771-9_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Valduriez, Patrick. "Shared-Disk Architecture." In Encyclopedia of Database Systems, 1. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4899-7993-3_1511-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Valduriez, Patrick. "Shared-Nothing Architecture." In Encyclopedia of Database Systems, 1–2. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4899-7993-3_1512-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kim, Jin-Dong, and Sampo Pyysalo. "BioNLP Shared Task." In Encyclopedia of Systems Biology, 138–41. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4419-9863-7_138.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Valduriez, Patrick. "Shared-Memory Architecture." In Encyclopedia of Database Systems, 2638. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_1082.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Valduriez, Patrick. "Shared-Disk Architecture." In Encyclopedia of Database Systems, 2637. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_1511.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Valduriez, Patrick. "Shared-Nothing Architecture." In Encyclopedia of Database Systems, 2638–39. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_1512.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Valduriez, Patrick. "Shared-Memory Architecture." In Encyclopedia of Database Systems, 1. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4899-7993-3_1082-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Valduriez, Patrick. "Shared-Memory Architecture." In Encyclopedia of Database Systems, 3485–86. New York, NY: Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_1082.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Shared systems"

1

Nagai, Y., and K. Inoue. "Bookmark shared system using agent systems." In 5th International Conference on Intelligent Systems Design and Applications (ISDA'05). IEEE, 2005. http://dx.doi.org/10.1109/isda.2005.30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hou, Yifan, Zhenzhong Jia, and Matthew Mason. "Manipulation with Shared Grasping." In Robotics: Science and Systems 2020. Robotics: Science and Systems Foundation, 2020. http://dx.doi.org/10.15607/rss.2020.xvi.086.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mower, Christopher, Joao Moura, and Sethu Vijayakumar. "Skill-based Shared Control." In Robotics: Science and Systems 2021. Robotics: Science and Systems Foundation, 2021. http://dx.doi.org/10.15607/rss.2021.xvii.028.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Brubaker, Jed R., Gina Venolia, and John C. Tang. "Focusing on shared experiences." In the Designing Interactive Systems Conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2317956.2317973.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Angelstorf, Fabian, Stefan Apelt, Nico Bau, Norman Jansen, and Sylvia Kathner. "Shared Information Space." In 2017 International Conference on Military Communications and Information Systems (ICMCIS). IEEE, 2017. http://dx.doi.org/10.1109/icmcis.2017.7956489.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gupta, Himanshu, Md Shaifur Rahman, and Max Curran. "Shared Spectrum Allocation via Pathloss Estimation in Crowdsensed Shared Spectrum Systems." In 2019 IEEE International Symposium on Dynamic Spectrum Access Networks (DySPAN). IEEE, 2019. http://dx.doi.org/10.1109/dyspan.2019.8935638.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Javdani, Shervin, Siddhartha Srinivasa, and Andrew Bagnell. "Shared Autonomy via Hindsight Optimization." In Robotics: Science and Systems 2015. Robotics: Science and Systems Foundation, 2015. http://dx.doi.org/10.15607/rss.2015.xi.032.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

McGrath, Andrew, and Amanda Oldroyd. "Designing shared virtual environments." In CHI98: ACM Conference on Human Factors and Computing Systems. New York, NY, USA: ACM, 1998. http://dx.doi.org/10.1145/286498.286636.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sweazey, P. "Shared memory systems on the Futurebus." In COMPCON Spring 88. IEEE, 1988. http://dx.doi.org/10.1109/cmpcon.1988.4920.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bicker, Robert, and Sing M. Ow. "Shared control in bilateral telerobotic systems." In Photonics for Industrial Applications, edited by Hari Das. SPIE, 1995. http://dx.doi.org/10.1117/12.197312.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Shared systems"

1

Shaw, Mary. Software Architecture for Shared Information Systems. Fort Belvoir, VA: Defense Technical Information Center, March 1993. http://dx.doi.org/10.21236/ada266995.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Truett, LF. Shared Communications: Volume 2. In-Depth Systems Research. Office of Scientific and Technical Information (OSTI), September 2004. http://dx.doi.org/10.2172/885827.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wang, Andrew, Shivaram Venkataraman, Sara Alspaugh, Randy H. Katz, and Ion Stoica. Cake: Enabling High-level SLOs on Shared Storage Systems. Fort Belvoir, VA: Defense Technical Information Center, November 2012. http://dx.doi.org/10.21236/ada569773.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tzou, Shin-Yuan, David P. Anderson, and G. S. Graham. Efficient Local Data Movement in Shared-Memory Multiprocessor Systems. Fort Belvoir, VA: Defense Technical Information Center, December 1987. http://dx.doi.org/10.21236/ada604009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Finkelstein, Maxim S. On systems with shared resources and optimal switching strategies. Rostock: Max Planck Institute for Demographic Research, October 2008. http://dx.doi.org/10.4054/mpidr-wp-2008-025.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Birman, Kenneth P., Thomas A. Joseph, and Pat Stephenson. Programming with Shared Bulletin Boards in Asynchronous Distributed Systems. Fort Belvoir, VA: Defense Technical Information Center, August 1986. http://dx.doi.org/10.21236/ada171902.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Menon, Nikhil. Impact of COVID-19 on Travel Behavior and Shared Mobility Systems. Tampa, FL: University of South Florida, 2020. http://dx.doi.org/10.5038/cutr-nctr-rr-2020-30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

George, A., M. T. Heath, J. Liu, and E. Ng. Solution of sparse positive definite systems on a shared-memory multiprocessor. Office of Scientific and Technical Information (OSTI), January 1987. http://dx.doi.org/10.2172/6842453.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Jeffay, Kevin. Scheduling Sporadic Tasks with Shared Resources in Hard-Real-Time Systems. Fort Belvoir, VA: Defense Technical Information Center, November 1990. http://dx.doi.org/10.21236/ada242043.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Linville, James M., Michael J. Liebhaber, Andrew H. Obermayer, and Jon J. Fallesen. Computer-Mediated Group Processes in Distributed Command and Control Systems: Dyad Shared Work. Fort Belvoir, VA: Defense Technical Information Center, June 1989. http://dx.doi.org/10.21236/ada211337.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Shared systems' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography