Log in

Relevant bibliographies by topics / Buffer storage (Computer science)

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Buffer storage (Computer science)'

Author: Grafiati

Published: 4 June 2021

Last updated: 26 January 2023

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Buffer storage (Computer science).'

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 "Buffer storage (Computer science)"

1

Martin, G. E. "Optimal buffer storage capacity in unpaced lines." Computers & Industrial Engineering 18, no. 3 (January 1990): 401–5. http://dx.doi.org/10.1016/0360-8352(90)90062-q.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Chang, Ping-Chen, Chia-Chun Wu, and Chin-Tan Lee. "System Reliability Estimation for a Manufacturing Network with Joint Buffers." International Journal of Reliability, Quality and Safety Engineering 25, no. 04 (June 6, 2018): 1850020. http://dx.doi.org/10.1142/s0218539318500201.

Full text

Abstract:

This paper develops a Monte Carlo Simulation (MCS) approach to estimate the performance of a multistate manufacturing network (MMN) with joint buffers. In the MMN, products are allowed to be produced by two production lines with the same function to satisfy demand. A performance index, system reliability, is applied to estimate the probability that all workstations provide sufficient capacity to satisfy a specified demand and buffers possess adequate storage. The joint buffers with finite storage are considered in the MMN. That is, extra work-in-process output from different production lines can be stored in the same buffer. An MCS algorithm is proposed to generate the capacity state and to check the storage usage of buffers to evaluate whether the demand can be satisfied or not. System reliability of the MMN is estimated through this MCS algorithm. Besides, performability for demand pairs assigned to production lines can be obtained. A practical example of touch panel manufacturing system is used to demonstrate the applicability of the MCS approach. Experimental result shows that system reliability is overestimated when buffer storage is assumed to be infinite. Moreover, joint buffer for an MMN is more reliable than buffers are installed separately in different production lines.

APA, Harvard, Vancouver, ISO, and other styles

3

Lin, Mingwei, Riqing Chen, Li Lin, Xuan Li, and Jingchang Huang. "Buffer-Aware Data Migration Scheme for Hybrid Storage Systems." IEEE Access 6 (2018): 47646–56. http://dx.doi.org/10.1109/access.2018.2866573.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Lan, Xiaolong, Qingchun Chen, Lin Cai, and Lisheng Fan. "Buffer-Aided Adaptive Wireless Powered Communication Network With Finite Energy Storage and Data Buffer." IEEE Transactions on Wireless Communications 18, no. 12 (December 2019): 5764–79. http://dx.doi.org/10.1109/twc.2019.2938958.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Mak, K. L. "The allocation of interstage buffer storage capacity in production lines." Computers & Industrial Engineering 10, no. 3 (January 1986): 163–69. http://dx.doi.org/10.1016/0360-8352(86)90002-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Rojas-Delgado, Brenda, Monica Alonso, Hortensia Amaris, and Juan de Santiago. "Wave Power Output Smoothing through the Use of a High-Speed Kinetic Buffer." Energies 12, no. 11 (June 10, 2019): 2196. http://dx.doi.org/10.3390/en12112196.

Full text

Abstract:

In this paper, a new control strategy for power output smoothing in a hybrid wave energy installation coupled to a flywheel energy storage system (FESS) is proposed. The control scheme is composed by three stages: a wave generator clustering process at the farm connection point; a power filtering process; and the control of the flywheel energy storage in order to improve the power output of the hybrid wave farm. The proposed control is validated at the existing Lysekil Wave Energy Site located in Sweden, by using real generator measurements. Results show that the application of the flywheel energy storage system reduces the maximum peak power output from the wave energy installation by 85% and the peak/average power ratio by 76%. It is shown that the proposed system can reduce grid losses by 51%, consequently improving the energy efficiency of the power network. The application of the proposed control strategy allows the hybrid wave power plant to follow a power reference signal that is imposed by the grid operator. In addition, the study demonstrates that the application of the proposed control allows the hybrid wave power plant to follow a power reference signal that is imposed by the grid operator. In addition, the study demonstrates that the application of the proposed control enables a wave farm with flywheel energy storage to be a controllable, flexible resource in order to fulfill future grid code requirements for marine energy installations.

APA, Harvard, Vancouver, ISO, and other styles

7

Kwak, Jaewook, Jungkeol Lee, Daeyong Lee, Joonyong Jeong, Gyeongyong Lee, Jungwook Choi, and Yong Ho Song. "GALRU: A Group-Aware Buffer Management Scheme for Flash Storage Systems." IEEE Access 8 (2020): 185360–72. http://dx.doi.org/10.1109/access.2020.3030089.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

A. Jalil, Muhammad, Muhammad S. Roslan, Azam Mohamad, Nathaporn Suwanpayak, K. Raman, Chat Teeka, Jalil Ali, and Preecha P. Yupapin. "Molecular Buffer, Storage and Delivery Using a PANDA Ring Resonator and an Optical Router." Recent Patents on Computer Science 4, no. 1 (March 21, 2011): 71–76. http://dx.doi.org/10.2174/1874479611104010071.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Khelili, Adrian, Sophie Robert, and Soraya Zertal. "FiLiP: A File Lifecycle-based Profiler for hierarchical storage." Infocommunications journal 14, no. 4 (2022): 26–33. http://dx.doi.org/10.36244/icj.2022.4.4.

Full text

Abstract:

The increasing gap between computing speed and storage latency leads to possible I/O bottlenecks on massively parallel computers. To mitigate this issue, hierarchical storage provides multi-tiered configurations where each tier has its own physical characteristics and associated performance. Selecting the most appropriate file placement policy on this multi-tiered storage is difficult and there is to our knowledge no tool that systematically provides statistics and metrics for optimal file policy selection. In this paper, we present FiLiP (File Lifecycle Profiler), a software which provides statistics and metrics for a better understanding of file access by applications and the consequences on file movements across hierarchical storage. After the description of FiLiP’s main features and architecture, we highlight the usefulness of our tool using three I/O intensive simulation HPC applications: NEMO, S3DIO and NAMD and a three-tiered burst buffer.

APA, Harvard, Vancouver, ISO, and other styles

10

Deng, Zhishan, Qianyun Gong, Quanzhong Li, and Jiayin Qin. "Stochastic Optimal Control for Buffer-Aided Cooperative Relaying Systems Using Nonorthogonal Multiple Access." Mobile Information Systems 2019 (May 21, 2019): 1–10. http://dx.doi.org/10.1155/2019/6825814.

Full text

Abstract:

In this paper, a multiple-cluster downlink multiple-input single-output (MISO) nonorthogonal multiple access (NOMA) system is considered. In each cluster, there are one central user and one cell-edge user. The central user has a data buffer with finite storage units, which will decode the cell-edge user’s message and store it at the data buffer. To enhance the performance of the cell-edge user, the central user operates as a relay and helps forward the message to the cell-edge user. Our objective is to maximize the long-term average sum rates for the cell-edge users by designing the beamforming vectors and online power control, under the constraints of the data buffer causality, required information rates for central users, and transmit power at the base station and central users. Based on the current buffer state and the channel state information, we propose a low-complexity online Lyapunov optimization algorithm combined with a constrained concave-convex procedure (CCCP) to solve the causal and nonconvex problem. Furthermore, we verify the asymptotic optimality of the proposed online Lyapunov optimization algorithm. Simulation results demonstrate that our proposed scheme performs better than the greedy algorithm and the orthogonal multiple access (OMA) scheme.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Buffer storage (Computer science)"

1

McNamee, Dylan James. "Virtual memory alternatives for transaction buffer management in a single-level store /." Thesis, Connect to this title online; UW restricted, 1996. http://hdl.handle.net/1773/6961.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Connor, John. "The RIT IEEE-488 Buffer design /." Online version of thesis, 1992. http://hdl.handle.net/1850/11259.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Ghemawat, Sanjay. "The modified object buffer : a storage management technique for object-oriented databases." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/37012.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
Includes bibliographical references (p. 113-117).
by Sanjay Ghemawat.
Ph.D.

APA, Harvard, Vancouver, ISO, and other styles

4

Romer, Theodore H. "Using virtual memory to improve cache and TLB performance /." Thesis, Connect to this title online; UW restricted, 1998. http://hdl.handle.net/1773/6913.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Dong, Xiaomin. "D-Buffer : a new hidden-line algorithm in image-space /." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0035/MQ47446.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Rydberg, Ray Robert. "Gasping for harmony communication between arbitrary clock domains with multiple voltage domains using a locally-clocked, linear dual-clock FIFO scheme /." Pullman, Wash. : Washington State University, 2009. http://www.dissertations.wsu.edu/Dissertations/Spring2009/r_rydberg_042209.pdf.

Full text

Abstract:

Thesis (Ph. D.)--Washington State University, May 2009.
Title from PDF title page (viewed on June 19, 2009). "School of Electrical Engineering and Computer Science." Includes bibliographical references (p. 117-125).

APA, Harvard, Vancouver, ISO, and other styles

7

Rydberg, Ray Robert. "A gasp of fresh air a high speed distributed FIFO scheme for managing interconnect parasitics /." Online access for everyone, 2005. http://www.dissertations.wsu.edu/Thesis/Spring2005/R%5FRydberg%5F050505.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Cheng, Kin On. "A multi-stage optical switch with output buffer using WDM for delay lines sharing /." View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202003%20CHENG.

Full text

Abstract:

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2003.
Includes bibliographical references (leaves 77-79). Also available in electronic version. Access restricted to campus users.

APA, Harvard, Vancouver, ISO, and other styles

9

Torabkhani, Nima. "Modeling and analysis of the performance of networks in finite-buffer regime." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/51810.

Full text

Abstract:

In networks, using large buffers tend to increase end-to-end packet delay and its deviations, conflicting with real-time applications such as online gaming, audio-video services, IPTV, and VoIP. Further, large buffers complicate the design of high speed routers, leading to more power consumption and board space. According to Moore's law, switching speeds double every 18 months while memory access speeds double only every 10 years. Hence, as memory requirements increasingly become a limiting aspect of router design, studying networks in finite-buffer regime seems necessary for network engineers. This work focuses on both practical and theoretical aspects of finite-buffer networks. In Chapters 1-7, we investigate the effects of finite buffer sizes on the throughput and packet delay in different networks. These performance measures are shown to be linked to the stationary distribution of an underlying irreducible Markov chain that exactly models the changes in the network. An iterative scheme is proposed to approximate the steady-state distribution of buffer occupancies by decoupling the exact chain to smaller chains. These approximate solutions are used to analytically characterize network throughput and packet delay, and are also applied to some network performance optimization problems. Further, using simulations, it is confirmed that the proposed framework yields accurate estimates of the throughput and delay performance measures and captures the vital trends and tradeoffs in these networks. In Chapters 8-10, we address the problem of modeling and analysis of the performance of finite-memory random linear network coding in erasure networks. When using random linear network coding, the content of buffers creates dependencies which cannot be captured directly using the classical queueing theoretical models. A careful derivation of the buffer occupancy states and their transition rules are presented as well as decodability conditions when random linear network coding is performed on a stream of arriving packets.

APA, Harvard, Vancouver, ISO, and other styles

10

Ye, Lei. "Energy Management for Virtual Machines." Diss., The University of Arizona, 2013. http://hdl.handle.net/10150/283603.

Full text

Abstract:

Current computing infrastructures use virtualization to increase resource utilization by deploying multiple virtual machines on the same hardware. Virtualization is particularly attractive for data center, cloud computing, and hosting services; in these environments computer systems are typically configured to have fast processors, large physical memory and huge storage capable of supporting concurrent execution of virtual machines. Subsequently, this high demand for resources is directly translating into higher energy consumption and monetary costs. Increasingly managing energy consumption of virtual machines is becoming critical. However, virtual machines make the energy management more challenging because a layer of virtualization separates hardware from the guest operating system executing inside a virtual machine. This dissertation addresses the challenge of designing energy-efficient storage, memory and buffer cache for virtual machines by exploring innovative mechanisms as well as existing approaches. We analyze the architecture of an open-source virtual machine platform Xen and address energy management on each subsystem. For storage system, we study the I/O behavior of the virtual machine systems. We address the isolation between virtual machine monitor and virtual machines, and increase the burstiness of disk accesses to improve energy efficiency. In addition, we propose a transparent energy management on main memory for any types of guest operating systems running inside virtual machines. Furthermore, we design a dedicated mechanism for the buffer cache based on the fact that data-intensive applications heavily rely on a large buffer cache that occupies a majority of physical memory. We also propose a novel hybrid mechanism that is able to improve energy efficiency for any memory access. All the mechanisms achieve significant energy savings while lowering the impact on performance for virtual machines.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Buffer storage (Computer science)"

1

O'Connell, Neil. Large deviations for departures from a shared buffer. Bristol [England]: Hewlett Packard, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Wood, Jamie. A simulation study of generalised processor sharing. Bristol [England]: Hewlett Packard, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Pang, Youlun. Buffering and disk accesses. Urbana, Ill. (1304 W. Springfield, Urbana 61801): Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

O'Connell, Neil. Large deviations for queue lengths at a multi-buffered resource. Bristol [England]: Hewlett Packard, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Farley, Marc. Building storage networks. Berkeley: Osborne/McGraw-Hill, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Axel, Simon. Value-range analysis of C programs: Towards proving the absence of buffer overflow vulnerabilities. London: Springer, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Axelson, Jan. USB Mass Storage. Chicago: Lakeview Research, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Building storage networks. Berkeley: Osborne/McGraw-Hill, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Building Storage Networks. New York: McGraw-Hill, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Building storage networks. 2nd ed. New York: Osborne/McGraw-Hill, 2001.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Buffer storage (Computer science)"

1

Weik, Martin H. "buffer storage." In Computer Science and Communications Dictionary, 150. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1919.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Tang, Xian, Na Li, and Qiang Ma. "ABR: An Optimized Buffer Replacement Algorithm for Flash Storage Devices." In Communications in Computer and Information Science, 136–50. Singapore: Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-10-2053-7_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Oberhauser, Jonas. "Store Buffer Reduction in the Presence of Mixed-Size Accesses and Misalignment." In Lecture Notes in Computer Science, 322–44. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-03592-1_19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Angelov, Stanislav, Sanjeev Khanna, and Keshav Kunal. "The Network as a Storage Device: Dynamic Routing with Bounded Buffers." In Lecture Notes in Computer Science, 1–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11538462_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Weik, Martin H. "buffer." In Computer Science and Communications Dictionary, 150. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1910.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Abdulla, Parosh Aziz, Mohamed Faouzi Atig, Ahmed Bouajjani, and Tuan Phong Ngo. "Replacing Store Buffers by Load Buffers in TSO." In Lecture Notes in Computer Science, 22–28. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00359-3_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Weik, Martin H. "speed buffer." In Computer Science and Communications Dictionary, 1637. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_17926.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Weik, Martin H. "buffer amplifier." In Computer Science and Communications Dictionary, 150. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1911.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Weik, Martin H. "buffer depletion." In Computer Science and Communications Dictionary, 150. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1912.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Weik, Martin H. "buffer gate." In Computer Science and Communications Dictionary, 150. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1915.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Buffer storage (Computer science)"

1

Wang, Wenlong. "Exponential Stability of Series CMS with a Single Storage Buffer." In 2009 WRI World Congress on Computer Science and Information Engineering. IEEE, 2009. http://dx.doi.org/10.1109/csie.2009.694.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Burr, Geoffrey W., Hans J. Coufal, John A. Hoffnagle, C. Michael Jefferson, Mark C. Jurich, Roger M. Macfarlane, and Robert M. Shelby. "Multiplexed phase-conjugate holographic storage using an intermediate buffer hologram." In International Symposium on Optical Science and Technology, edited by Shizhuo Yin and Francis T. S. Yu. SPIE, 2000. http://dx.doi.org/10.1117/12.404771.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Lv, Jin-na, Xiao-zhong Li, Zhi-jun Zhang, Guo-hong Gao, and Shun-ping Wang. "A Video Storage Algorithm Based on Buffer and Anomaly Detection." In 2010 International Conference of Information Science and Management Engineering. ISME 2010. IEEE, 2010. http://dx.doi.org/10.1109/isme.2010.130.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kang, Dong Hyun, Changwoo Min, and Young Ik Eom. "An Efficient Buffer Replacement Algorithm for NAND Flash Storage Devices." In 2014 IEEE 22nd International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems (MASCOTS. IEEE, 2014. http://dx.doi.org/10.1109/mascots.2014.38.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Jin, Xin, Sanghyuk Jung, and Yong Ho Song. "SEPL: Smart Evicted Page List Buffer for NAND Flash Storage System." In 2010 IEEE 10th International Conference on Computer and Information Technology (CIT). IEEE, 2010. http://dx.doi.org/10.1109/cit.2010.297.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Shrawankar, Urmila, and Reetu Gupta. "Block pattern based buffer cache management." In 2013 8th International Conference on Computer Science & Education (ICCSE). IEEE, 2013. http://dx.doi.org/10.1109/iccse.2013.6554052.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Chung, Chung-Ping, Tung-Lin Lu, and Hui-Chin Yang. "H-Buffer: An Efficient History-Based and Overflow Sharing Transparent Fragment Storage Method." In 2009 International Conference on Computational Science and Engineering. IEEE, 2009. http://dx.doi.org/10.1109/cse.2009.463.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Xu Cheng-zhi, Mei Chuan-jun, and Li Hao. "Spatial association rules study based on buffer analysis." In 2013 8th International Conference on Computer Science & Education (ICCSE). IEEE, 2013. http://dx.doi.org/10.1109/iccse.2013.6554014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Englert, Matthias, Harald Racke, and Richard Stotz. "Polylogarithmic Guarantees for Generalized Reordering Buffer Management." In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2019. http://dx.doi.org/10.1109/focs.2019.00012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Oikawa, Shuichi. "Accelerating storage access by combining block storage with memory storage." In 2015 IEEE/ACIS 14th International Conference on Computer and Information Science (ICIS). IEEE, 2015. http://dx.doi.org/10.1109/icis.2015.7166635.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Buffer storage (Computer science)"

1

Rudd, Ian. Leveraging Artificial Intelligence and Robotics to Improve Mental Health. Intellectual Archive, July 2022. http://dx.doi.org/10.32370/iaj.2710.

Full text

Abstract:

Artificial Intelligence (AI) is one of the oldest fields of computer science used in building structures that look like human beings in terms of thinking, learning, solving problems, and decision making (Jovanovic et al., 2021). AI technologies and techniques have been in application in various aspects to aid in solving problems and performing tasks more reliably, efficiently, and effectively than what would happen without their use. These technologies have also been reshaping the health sector's field, particularly digital tools and medical robotics (Dantas & Nogaroli, 2021). The new reality has been feasible since there has been exponential growth in the patient health data collected globally. The different technological approaches are revolutionizing medical sciences into dataintensive sciences (Dantas & Nogaroli, 2021). Notably, with digitizing medical records supported the increasing cloud storage, the health sector created a vast and potentially immeasurable volume of biomedical data necessary for implementing robotics and AI. Despite the notable use of AI in healthcare sectors such as dermatology and radiology, its use in psychological healthcare has neem models. Considering the increased mortality and morbidity levels among patients with psychiatric illnesses and the debilitating shortage of psychological healthcare workers, there is a vital requirement for AI and robotics to help in identifying high-risk persons and providing measures that avert and treat mental disorders (Lee et al., 2021). This discussion is focused on understanding how AI and robotics could be employed in improving mental health in the human community. The continued success of this technology in other healthcare fields demonstrates that it could also be used in redefining mental sicknesses objectively, identifying them at a prodromal phase, personalizing the treatments, and empowering patients in their care programs.

APA, Harvard, Vancouver, ISO, and other styles

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!