Search results

People with pre-existing mental health conditions are more likely to be affected by global crises. The Covid-19 pandemic has presented them with unique challenges, including reduced contact with the psychiatric rehabilitation and support systems. Thus, understanding the emotional experience of this population may assist mental health organizations in future global crises.

In this paper, researchers analyzed the discourse of the mentally ill during the Covid-19 pandemic, as reflected in Israeli Facebook groups: three private groups and one public group. Researchers explored the language, reactions, emotions and sentiments used in these groups during the year before the pandemic, outbreak periods and remission periods, as well as the period before the vaccine’s introduction and after its appearance.

Analyzing groups’ discourse using the collective emotion theory suggests that the group that expressed the most significant difficulty was the Depression group, while individuals who suffer from social phobia/anxiety and PTSD were less affected during the lockdowns and restrictions forced by the outbreak.

Findings may serve as a tool for service providers during crises to monitor patients’ conditions, and assist individuals who need support and help.

This research conducts bibliometric analyses and network mapping on smart libraries worldwide. It examines publication profiles, identifies the most cited publications and preferred sources and considers the cooperation of the authors, organizations and countries worldwide. The research also highlights keyword trends and clusters and finds new developments and emerging trends from the co-cited references network.

A total of 264 records with 1,200 citations were extracted from the Web of Science database from 2003 to 2021. The trends in the smart library were analyzed and visualized using BibExcel, VOSviewer, Biblioshiny and CiteSpace.

The People’s Republic of China had the most publications (119), the most citations (374), the highest H-index (12) and the highest total link strength (TLS = 25). Wuhan University had the highest H-index (6). Chiu, Dickson K. W. (H-index = 4, TLS = 22) and Lo, Patrick (H-index = 4, TLS = 21) from the University of Hong Kong had the highest H-indices and were the most cooperative authors. Library Hi Tech was the most preferred journal. “Mobile library” was the most frequently used keyword. “Mobile context” was the largest cluster on the research front.

This study helps librarians, scientists and funders understand smart library trends.

There are several studies and solid background research on smart libraries. However, to the best of the author’s knowledge, this study is the first to conduct bibliometric analyses and network mapping on smart libraries around the globe.

Exact solution of time–cost trade-off problem (TCTP) by the state-of-the-art meta-heuristic algorithms can be obtained for small- and medium-scale problems, while satisfactory results cannot be obtained for large construction projects. In this study, a hybrid heuristic meta-heuristic algorithm that adapts the search domain is developed to solve the large-scale discrete TCTP more efficiently.

Minimum cost slope–based heuristic network analysis algorithm (NAA), which eliminates the unfeasible search domain, is embedded into differential evolution meta-heuristic algorithm. Heuristic NAA narrows the search domain at the initial phase of the optimization. Moreover, activities with float durations higher than the predetermined threshold value are eliminated and then the meta-heuristic algorithm starts and searches the global optimum through the narrowed search space. However, narrowing the search space may increase the probability of obtaining a local optimum. Therefore, adaptive search domain approach is employed to make reintroduction of the eliminated activities to the design variable set possible, which reduces the possibility of converging into local minima.

The developed algorithm is compared with plain meta-heuristic algorithm with two separate analyses. In the first analysis, both algorithms have the same computational demand, and in the latter analysis, the meta-heuristic algorithm has fivefold computational demand. The tests on case study problems reveal that the developed algorithm presents lower total project costs according to the dependent t-test for paired samples with α = 0.0005.

In this study, TCTP is solved without considering quality or restrictions on the resources.

The proposed method enables to adapt the number of parameters, that is, the search domain and provides the opportunity of obtaining significant improvements on the meta-heuristic algorithms for other engineering optimization problems, which is the theoretical contribution of this study. The proposed approach reduces the total construction cost of the large-scale projects, which can be the practical benefit of this study.