Academic literature on the topic 'Center for Research in Social Systems'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Center for Research in Social 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 "Center for Research in Social Systems"
Lv, Yishing. "Center for Connected Multimodal Mobility Transportation Cyber-Physical-Social Systems Laboratory [ITS Research Lab]." IEEE Intelligent Transportation Systems Magazine 13, no. 2 (2021): 242–45. http://dx.doi.org/10.1109/mits.2021.3066012.
Full textRadatz, Alecia, Michael Reinsborough, Erik Fisher, Elizabeth Corley, and David Guston. "An assessment of engaged social science research in nanoscale science and engineering communities." Science and Public Policy 46, no. 6 (August 21, 2019): 853–65. http://dx.doi.org/10.1093/scipol/scz034.
Full textWatts, Lori, Nicolas Camilo, Nicole Thurston, Michele Betts, and Dan Sayam Zuckerman. "Distress management in a community oncology center." Journal of Clinical Oncology 30, no. 34_suppl (December 1, 2012): 107. http://dx.doi.org/10.1200/jco.2012.30.34_suppl.107.
Full textDaiute, Colette, Bengi Sullu, and Tünde Kovács-Cerović. "What Is Social Inclusion? Insights From Interventions With Youth Across Migration Systems." Policy Insights from the Behavioral and Brain Sciences 8, no. 2 (September 11, 2021): 143–51. http://dx.doi.org/10.1177/23727322211033001.
Full textVermeulen, Niki. "The choreography of a new research field: Aggregation, circulation and oscillation." Environment and Planning A: Economy and Space 50, no. 8 (September 5, 2017): 1764–84. http://dx.doi.org/10.1177/0308518x17725317.
Full textجاسم, احسان عباس. "Activate the city center utility Measure the variables to activate the functionality of the city center case stady: AL-Kut city center." Wasit Journal of Engineering Sciences 5, no. 1 (April 12, 2017): 154–73. http://dx.doi.org/10.31185/ejuow.vol5.iss1.75.
Full textBiroscak, Brian J., Tali Schneider, Anthony D. Panzera, Carol A. Bryant, Robert J. McDermott, Alyssa B. Mayer, Mahmooda Khaliq, et al. "Applying Systems Science to Evaluate a Community-Based Social Marketing Innovation." Social Marketing Quarterly 20, no. 4 (November 5, 2014): 247–67. http://dx.doi.org/10.1177/1524500414556649.
Full textLuchkina, Veronika. "Business Center construction project as the sustainable development model." E3S Web of Conferences 258 (2021): 09011. http://dx.doi.org/10.1051/e3sconf/202125809011.
Full textFifield, Marvin, and Glendon Casto. "Utah State University Developmental Center for Handicapped Persons." Journal of the Association for Persons with Severe Handicaps 11, no. 4 (December 1986): 271–75. http://dx.doi.org/10.1177/154079698601100407.
Full textKameyama, Yasuko. "Research focused on climate change and security for Japan." Impact 2020, no. 6 (November 16, 2020): 23–25. http://dx.doi.org/10.21820/23987073.2020.6.23.
Full textDissertations / Theses on the topic "Center for Research in Social Systems"
Maes, Pauline. "Engaging Content Experience- Utilizing the Strossle recommendation capabilities, across publishers’ websites." Thesis, Malmö universitet, Fakulteten för kultur och samhälle (KS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-21487.
Full textDreser, Melanie. "Design, Fun and Sustainability: Utilizing Design Research Methods to Develop an Application to Inform and Motivate Students to Make Sustainable Consumer Choices." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1322669294.
Full textEschenfeldt, Patrick Clark. "Multiserver queueing systems in heavy traffic." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/108834.
Full textThis 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 (pages 107-109).
In the study of queueing systems, a question of significant current interest is that of large scale behavior, where the size of the system increases without bound. This regime has becoming increasingly relevant with the rise of massive distributed systems like server farms, call centers, and health care management systems. To minimize underutilization of resources, the specific large scale regime of most interest is one in which the work to be done increases as processing capability increases. In this thesis, we characterize the behavior of two such large scale queueing systems. In the first part of the thesis we consider a Join the Shortest Queue (JSQ) policy in the so-called Halfin-Whitt heavy traffic regime. We establish that a scaled process counting the number of idle servers and queues of length two weakly converges to a two-dimensional reflected Ornstein-Uhlenbeck process, while processes counting longer queues converge to a deterministic system decaying to zero in constant time. This limiting system is similar to that of the traditional Halfin-Whitt model in its basic performance measures, but there are key differences in the queueing behavior of the JSQ model. In particular, only a vanishing fraction of customers will have to wait, but those who do will incur a constant order waiting time. In the second part of the thesis we consider a widely studied so-called "supermarket model" in which arriving customers join the shortest of d randomly selected queues. Assuming rate n[lambda]n Poisson arrivals and rate 1 exponentially distributed service times, our heavy traffic regime is described by [lambda]n 1 as n --> [infinity]. We give a simple expectation argument establishing that queues have steady state length at least i* = logd 1/1-[lambda]n with probability approaching one as n [infinity] 8. Our main result for this system concerns the detailed behavior of queues with length smaller than i*. Assuming [lambda]n converges to 1 at rate at most [square root of]n, we show that the dynamics of such queues does not follow a diffusion process, as is typical for queueing systems in heavy traffic, but is described instead by a deterministic infinite system of linear differential equations, after an appropriate rescaling.
by Patrick Clark Eschenfeldt.
Ph. D.
Bailey-Shimizu, Pamelalee. "First Nations Tribal Library and Social Research Center." CSUSB ScholarWorks, 2000. https://scholarworks.lib.csusb.edu/etd-project/1952.
Full textGoldberg, David Alan Ph D. Massachusetts Institute of Technology. "Large scale queueing systems : asymptotics and insights." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/67765.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (p. 195-203).
Parallel server queues are a family of stochastic models useful in a variety of applications, including service systems and telecommunication networks. A particular application that has received considerable attention in recent years is the analysis of call centers. A feature common to these models is the notion of the 'trade-off' between quality and efficiency. It is known that if the underlying system parameters scale together according to a certain 'square-root scaling law', then this trade-off can be precisely quantified, in which case the queue is said to be in the Halfin-Whitt regime. A common approach to understanding this trade-off involves restricting one's models to have exponentially distributed call lengths, and restricting one's analysis to the steady-state behavior of the system. However, these are considered shortcomings of much work in the area. Although several recent works have moved beyond these assumptions, many open questions remain, especially w.r.t. the interplay between the transient and steady-state properties of the relevant models. These questions are the primary focus of this thesis. In the first part of this thesis, we prove several results about the rate of convergence to steady-state for the A/M/rn queue, i.e. n-server queue with exponentially distributed inter-arrival and processing times, in the Halfini-Whitt regime. We identify the limiting rate of convergence to steady-state, discover an asymptotic phase transition that occurs w.r.t. this rate, and prove explicit bounds on the distance to stationarity. The results of the first part of this thesis represent an important step towards understanding how to incorporate transient effects into the analysis of parallel server queues. In the second part of this thesis, we prove several results regarding the steadystate G/G/n queue, i.e. n-server queue with generally distributed inter-arrival and processing times, in the Halfin-Whitt regime. We first prove that under minor technical conditions, the steady-state number of jobs waiting in queue scales like the square root of the number of servers. We then establish bounds for the large deviations behavior of this model, partially resolving a conjecture made by Gamarnik and Momcilovic in [431. We also derive bounds for a related process studied by Reed in [91]. We then derive the first qualitative insights into the steady-state probability that an arriving job must wait for service in the Halfin-Whitt regime, for generally distributed processing times. We partially characterize the behavior of this probability when a certain excess parameter B approaches either 0 or oo. We conclude by studying the large deviations of the number of idle servers, proving that this random variable has a Gaussian-like tail. We prove our main results by combining tools from the theory of stochastic comparison [99] with the theory of heavy-traffic approximations [113]. We compare the system of interest to a 'modified' queue, in which all servers are kept busy at all times by adding artificial arrivals whenever a server would otherwise go idle, and certain servers can permanently break down. We then analyze the modified system using heavy-traffic approximations. The proven bounds hold for all n, have representations as the suprema of certain natural processes, and may prove useful in a variety of settings. The results of the second part of this thesis enhance our understanding of how parallel server queues behave in heavy traffic, when processing times are generally distributed.
by David Alan Goldberg.
Ph.D.
Papush, Anna. "Data-driven methods for personalized product recommendation systems." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/115655.
Full textCataloged from PDF version of thesis.
Includes bibliographical references.
The online market has expanded tremendously over the past two decades across all industries ranging from retail to travel. This trend has resulted in the growing availability of information regarding consumer preferences and purchase behavior, sparking the development of increasingly more sophisticated product recommendation systems. Thus, a competitive edge in this rapidly growing sector could be worth up to millions of dollars in revenue for an online seller. Motivated by this increasingly prevalent problem, we propose an innovative model that selects, prices and recommends a personalized bundle of products to an online consumer. This model captures the trade-off between myopic profit maximization and inventory management, while selecting relevant products from consumer preferences. We develop two classes of approximation algorithms that run efficiently in real-time and provide analytical guarantees on their performance. We present practical applications through two case studies using: (i) point-of-sale transaction data from a large U.S. e-tailer, and, (ii) ticket transaction data from a premier global airline. The results demonstrate that our approaches result in significant improvements on the order of 3-7% lifts in expected revenue over current industry practices. We then extend this model to the setting in which consumer demand is subject to uncertainty. We address this challenge using dynamic learning and then improve upon it with robust optimization. We first frame our learning model as a contextual nonlinear multi-armed bandit problem and develop an approximation algorithm to solve it in real-time. We provide analytical guarantees on the asymptotic behavior of this algorithm's regret, showing that with high probability it is on the order of O([square root of] T). Our computational studies demonstrate this algorithm's tractability across various numbers of products, consumer features, and demand functions, and illustrate how it significantly out performs benchmark strategies. Given that demand estimates inherently contain error, we next consider a robust optimization approach under row-wise demand uncertainty. We define the robust counterparts under both polynomial and ellipsoidal uncertainty sets. Computational analysis shows that robust optimization is critical in highly constrained inventory settings, however the price of robustness drastically grows as a result of pricing strategies if the level of conservatism is too high.
by Anna Papush.
Ph. D.
Zarybnisky, Eric J. (Eric Jack) 1979. "Maintenance scheduling for modular systems-models and algorithms." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/68972.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (p. 185-188).
Maintenance scheduling is an integral part of many complex systems. For instance, without effective maintenance scheduling, the combined effects of preventative and corrective maintenance can have severe impacts on the availability of those systems. Based on current Air Force trends including maintenance manpower, dispersed aircraft basing, and increased complexity, there has been a renewed focus on preventative maintenance. To address these concerns, this thesis develops two models for preventative maintenance scheduling for complex systems, the first of interest in the system concept development and design phase, and the second of interest during operations. Both models are highly complex and intractable to solve in their original forms. For the first model, we develop approximation algorithms that yield high quality and easily implementable solutions. To address the second model, we propose a decomposition strategy that produces submodels that can be solved via existing algorithms or via specialized algorithms we develop. While much of the literature has examined stochastically failing systems, preventative maintenance of usage limited systems has received less attention. Of particular interest is the design of modular systems whose components must be repaired/replaced to prevent a failure. By making cost tradeoffs early in development, program managers, designers, engineers, and test conductors can better balance the up front costs associated with system design and testing with the long term cost of maintenance. To facilitate such a tradeoff, the Modular Maintenance Scheduling Problem provides a framework for design teams to evaluate different design and operations concepts and then evaluate the long term costs. While the general Modular Maintenance Scheduling Problem does not require maintenance schedules with specific structure, operational considerations push us to consider cyclic schedules in which components are maintained at a fixed frequency. In order to efficiently find cyclic schedules, we propose the Cycle Rounding algorithm, which has an approximation guarantee of 2, and a family of Shifted Power-of-Two algorithms, which have an approximation guarantee of 1/ ln(2) ~ 1.4427. Computational results indicate that both algorithms perform much better than their associated performance guarantees providing solutions within 15%-25% of a lower bound. Once a modular system has moved into operations, manpower and transportation scheduling become important considerations when developing maintenance schedules. To address the operations phase, we develop the Modular Maintenance and System Assembly Model to balance the tradeoffs between inventory, maintenance capacity, and transportation resources. This model explicitly captures the risk-pooling effects of a central repair facility while also modeling the interaction between repair actions at such a facility. The full model is intractable for all but the smallest instances. Accordingly, we decompose the problem into two parts, the system assembly portion and module repair portion. Finally, we tie together the Modular Maintenance and System Assembly Model with key concepts from the Modular Maintenance Scheduling Problem to propose an integrated methodology for design and operation.
by Eric Jack Zarybnisky.
Ph.D.
Werner, Loren M. (Loren Michael) 1977. "Analysis and design of closed loop manufacturing systems." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/82688.
Full textThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 89-90).
by Loren M. Werner.
S.M.
Chhaochhria, Pallav. "Forecast-driven tactical planning models for manufacturing systems." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/68700.
Full textThis 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. 243-247).
Our work is motivated by real-world planning challenges faced by a manufacturer of industrial products. In the first part of the thesis, we study a multi-product serial-flow production line that operates in a low-volume, long lead-time environment. The objective is to minimize variable operating costs, in the face of forecast uncertainty, raw material arrival uncertainty and in-process failure. We develop a dynamic-programming-based tactical model to capture the key uncertainties and trade-offs, and to determine the minimum-cost operating tactics. The tactics include smoothing production to reduce production-related costs, and segmenting the serial-flow line with decoupling buffers to protect against variance propagation. For each segment, we specify a work release policy and a production control policy to manage the work-in-process inventory within the segment and to maintain the inventory targets in the downstream buffer. We also optimize the raw material ordering policy with fixed ordering times, long lead-times and staggered deliveries. In the second part of the thesis, we examine a multi-product assembly system that operates in a high-volume, short lead- time environment. The operating tactics used here include determining a fixed-length cyclic schedule to control production, in addition to smoothing production and segmenting the system with decoupling buffers. We develop another dynamic-programming-based tactical model that determines optimal policies for production planning and scheduling, inventory, and raw material ordering; these policies minimize the operating cost for the system in the face of forecast and raw material arrival uncertainty. We tested these models on both hypothetical and actual factory scenarios. The results confirmed our intuition and also helped develop new managerial insights on the application of these operating tactics. Moreover, the tactical model's factory performance predictions were found to be within 10% of simulation results for the testbed systems, thus validating the models.
by Pallav Chhaochhria.
Ph.D.
Achy-Brou, Aristide C. E. 1976. "A new approach to multistage serial inventory systems." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/8776.
Full textIncludes bibliographical references (leaves 61-62).
We consider a single product multistage serial inventory system with several installations, say N - I, ... , l. Installation N - I intakes exogenous supply of a single commodity. For i E {I, ... N - 2}, installation i is supplied by shipments from installation i + 1. Demands for the finished good occur at installation l. Demands that cannot be filled immediately are backlogged. We assume holding costs at each installation which are linear functions of inventory, as well as a constant cost for each unit of backlogged demand, per period. Clark and Scarf {1960) showed that over a finite horizon an echelon basestock policy is optimal. Federgruen and Zipkin (1984) extend their result to the infinite-horizon case for both discounted and average costs. We present a new approach to this multistage serial inventory management problem, and give new proofs of these results by introducing and solving a simple Travel Time problem, using Dynamic Programming. This approach is motivated by the fact that the exact cost-to-go function of the related Travel Time problem can be easily computed using a straightforward recursive procedure (instead of using the typical value iteration or policy iteration methods). Moreover, this cost-to-go function gives various insights useful for a group of more complex multistage inventory problems. In this regard, we discuss how this cost-to-go function can be used to develop good Approximate Dynamic Programming algorithms for a number of complex multistage serial inventory problems. The results obtained suggest that the idea of introducing a related "Travel Time" problem and our algorithm to solve this problem can be used as a building block of a new approach to solve large scale multistage inventory management problems. This thesis was part of a research effort to find a fast algorithm to get very good robust suboptimal solutions to large scale multistage inventory management problems.
by Aristide C.E. Achy-Brou.
S.M.
Books on the topic "Center for Research in Social Systems"
Fernand Braudel Center for the Study of Economies, Historical Systems, and Civilizations. Report on an intellectual project: The Fernand Braudel Center, 1976-1991. [Binghamton, N.Y.] (P.O. Box 6000, State University of New York at Binghamton, Binghamton 139-6000): The Center, 1991.
Find full textUniversity, Brandeis. The consortium of the Center for Complex Systems. Waltham, Mass: Brandeis University, 1991.
Find full textAlbers, James A. NASA Ames Aerospace Systems Directorate research. Moffett Field, Calif: National Aeronautics and Space Administration, Ames Research Center, 1991.
Find full textCommission of the European Communities. Coordination Workshop. Natural resource development and utilization: Future research and technology development in soil-plant-animal-human systems : proceedings of the Commission of the European Communities Coordinination Workshop held at the International Agricultural centre, Wageningen, 29 June - 2 July, 1992. Wageningen: Agricultural University, Tropical Animal Production, 1992.
Find full textBertaccini, Bruno, Luigi Fabbris, and Alessandra Petrucci, eds. ASA 2021 Statistics and Information Systems for Policy Evaluation. Florence: Firenze University Press, 2021. http://dx.doi.org/10.36253/978-88-5518-304-8.
Full textGarg, Sanjay. Propulsion controls and health management research at NASA Glenn Research Center. [Cleveland, Ohio: NASA Glenn Research Center, 2002.
Find full textGarg, Sanjay. Propulsion controls and health management research at NASA Glenn Research Center. [Cleveland, Ohio: NASA Glenn Research Center, 2002.
Find full textSiewiorek, Daniel P. Assessment Team Report on flight-critical systems research at NASA Langley Research Center. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1989.
Find full textEasley, Wesley C. Packet radio data link applications in the NASA Langley Research Center Transport Systems Research Vehicle. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1994.
Find full textWorkshop on Farming Systems Research (1986 ICRISAT Center, India). Proceedings of the Workshop on Farming Systems Research, 17-21 February 1986, ICRISAT Center, India. Patancheru, Andhra Pradesh, India: Published for the International Agricultural Research Centers of the Consultative Group on International Agricultural Research by ICRISAT, 1987.
Find full textBook chapters on the topic "Center for Research in Social Systems"
Tokowicz, Natasha. "The Learning Research and Development Center Summer Undergraduate Research Internship." In Advancing Diversity, Inclusion, and Social Justice Through Human Systems Engineering, 215–20. Boca Raton: CRC Press, 2020.: CRC Press, 2019. http://dx.doi.org/10.1201/9780429425905-14.
Full textWang, Huijiong. "Work, Learning, and Life Prior to Joining Development Research Center of the State Council (1983–1990)." In Explorations in Social Systems Engineering, 171–209. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-3390-7_6.
Full textNoe, Egon, and Hugo F. Alrøe. "Observing farming systems: Insights from social systems theory." In Farming Systems Research into the 21st Century: The New Dynamic, 387–403. Dordrecht: Springer Netherlands, 2012. http://dx.doi.org/10.1007/978-94-007-4503-2_17.
Full textTurner, Barry. "Center for Social and Economic Research." In The Statesman’s Yearbook, 75. London: Palgrave Macmillan UK, 2013. http://dx.doi.org/10.1007/978-1-349-59643-0_122.
Full textHazans, Mihails. "Emigration from Latvia: A Brief History and Driving Forces in the Twenty-First Century." In IMISCOE Research Series, 35–68. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-12092-4_3.
Full textKlein, Louis. "Understanding Social Systems Research." In Nonlinear Systems and Complexity, 51–67. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-46164-9_3.
Full textSpremann, K. "Medical Care and Social Security." In Health Systems Research, 223–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/978-3-642-83240-6_19.
Full textShoham, Yoav. "Multi-agent research in the knobotics group." In Artificial Social Systems, 271–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58266-5_15.
Full textLekapat, Sukanjana, Panarit Sethakul, and Matheepot Phattanasak. "Management Model for Excellent World-Class Research Center." In Advances in Intelligent Systems and Computing, 465–74. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-40271-6_46.
Full textRamic, H. "Health Center: Integrated Primary Health Care Resources and Services Within the District and Coordinative Role of General Practice." In Health Systems Research, 101–18. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/978-3-642-83240-6_11.
Full textConference papers on the topic "Center for Research in Social Systems"
Abramson, Steven, William Horka, and Leonard Wisniewski. "A Hybrid Cloud Architecture for a Social Science Research Computing Data Center." In 2014 IEEE 34th International Conference on Distributed Computing Systems Workshops (ICDCSW). IEEE, 2014. http://dx.doi.org/10.1109/icdcsw.2014.32.
Full textTseng, Hsueh-Wen, Ya-Ju Yu, and Kai-Hsu Hsieh. "An efficient load balancing multicast scheduling for solving congestion problem in social data center networks." In RACS '18: International Conference on Research in Adaptive and Convergent Systems. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3264746.3264763.
Full textLiang, Feng, and You Hu. "Research on the Construction Index System of China Guilin Tourism Distribution Center." In 2018 2nd International Conference on Management, Education and Social Science (ICMESS 2018). Paris, France: Atlantis Press, 2018. http://dx.doi.org/10.2991/icmess-18.2018.253.
Full text"Social Networks and Pythagoreans Centres - A Two-level Social Connection for Virtual Global Research." In Special Session on Socio-technical Dynamics in Information Systems. SciTePress - Science and and Technology Publications, 2013. http://dx.doi.org/10.5220/0004501105930596.
Full textDeng, Ting. "Research on the Problems and Countermeasures of Data Management in CRM System of Financial Shared Service Center." In 2021 International Conference on Diversified Education and Social Development (DESD 2021). Paris, France: Atlantis Press, 2021. http://dx.doi.org/10.2991/assehr.k.210803.051.
Full textRenaldi, Refli, Sukaria Sinulingga, and Iskandarini. "An Analysis on Employees’ Performance Appraisal System and Its Implication on Their Work Satisfaction at Oil Palm Research Center, Medan." In Unimed International Conference on Economics Education and Social Science. SCITEPRESS - Science and Technology Publications, 2018. http://dx.doi.org/10.5220/0009505205380544.
Full textSutriningsih, Ani, Chatarina Umbul Wahyuni, and Setya Haksama. "Community Health Center Resilience in Disaster Management: A Narrative Review." In The 7th International Conference on Public Health 2020. Masters Program in Public Health, Universitas Sebelas Maret, 2020. http://dx.doi.org/10.26911/the7thicph.04.12.
Full textPalestini, Caterina, and Carlos Cacciavillani. "Integrazioni multidisciplinari: storia, rilievo e rappresentazioni del castello di Palmariggi in Terra d’Otranto." In FORTMED2020 - Defensive Architecture of the Mediterranean. Valencia: Universitat Politàcnica de València, 2020. http://dx.doi.org/10.4995/fortmed2020.2020.11358.
Full textJayatilaka, Bandula, Heinz Klein, and Jinyoul Lee. "Categorizing the IS research literature: A user oriented perspective." In InSITE 2006: Informing Science + IT Education Conference. Informing Science Institute, 2006. http://dx.doi.org/10.28945/2982.
Full textFujita, Satoshi, Keisuke Minagawa, Mitsuru Miyazaki, Go Tanaka, and Osamu Takahashi. "Research and Development of Intelligent Seismic Isolation System Using Air Bearing." In ASME 2008 Pressure Vessels and Piping Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/pvp2008-61450.
Full textReports on the topic "Center for Research in Social Systems"
George, Nicholas. Center for Opto-Electronic Systems Research. Fort Belvoir, VA: Defense Technical Information Center, February 1988. http://dx.doi.org/10.21236/ada195159.
Full textFarrell, P. V. Center of Excellence for Propulsion Systems at the Engine Research Center. Fort Belvoir, VA: Defense Technical Information Center, October 2004. http://dx.doi.org/10.21236/ada428401.
Full textGeorge, Nicholas. Center for Opto-Electronic Systems Research Instrumentation Grant. Fort Belvoir, VA: Defense Technical Information Center, February 1988. http://dx.doi.org/10.21236/ada193711.
Full textMarchette, David, and Carey Priebe. Neural Network Research at NOSC (Naval Ocean Systems Center). Fort Belvoir, VA: Defense Technical Information Center, April 1988. http://dx.doi.org/10.21236/ada209091.
Full textMcClure, Donald E. Center for Intelligent Control Systems, Brown University Component: Graduate Research Fellowships. Fort Belvoir, VA: Defense Technical Information Center, August 1991. http://dx.doi.org/10.21236/ada253620.
Full textSwinson Evans, Tammeka, Suzanne West, Linda Lux, Michael Halpern, and Kathleen Lohr. Cancer Symptoms and Side Effects: A Research Agenda to Advance Cancer Care Options. RTI Press, July 2017. http://dx.doi.org/10.3768/rtipress.2017.rb.0016.1707.
Full textKwinn, Michael J., Klimack Jr., Kaufman William K., and Jr Daniel J. Research Plan of the Operations Research Center and Department of Systems Engineering for Academic Year 2004. Fort Belvoir, VA: Defense Technical Information Center, September 2003. http://dx.doi.org/10.21236/ada418694.
Full textLuniewski, Allen W., and Laura Haas. The Stanford IBM Management of Multiple Information Systems (TSIMMIS)-IBM Almaden Research Center. Fort Belvoir, VA: Defense Technical Information Center, March 2000. http://dx.doi.org/10.21236/ada383046.
Full textBickford, D. F. Selection of melter systems for the DOE/Industrial Center for Waste Vitrification Research. Office of Scientific and Technical Information (OSTI), December 1993. http://dx.doi.org/10.2172/10189289.
Full textGoerger, Simon R., Timothy E. Trainor, and Patrick Finnegan. Research Plan of the Department of Systems Engineering and the Operations Research Center for Academic Year 2007. Fort Belvoir, VA: Defense Technical Information Center, October 2006. http://dx.doi.org/10.21236/ada455049.
Full text