检索结果-内蒙古大学图书馆

Gaining Technological Autonomy and Social-emotional Support: A Case Study of How and Why Chinese Older Adults Engage with a Semi-acquaintance Online Community

引用

Proceedings of the ACM on Human-computer Interaction 2024年第CSCW2期8卷 1-35页

作者： Qian, Zhigu Fu, Jiaojiao Zhou, Yangfan School of Computer Science Fudan University Shanghai Key Laboratory of Intelligent Information Processing Shanghai China School of Information Science and Engineering East China University of Science and Technology Shanghai China

Older adults are often underserved and marginalized in technology engagement due to their reluctance and the barriers they face in adopting and engaging with mainstream technology. However, Pinxiaoquan, a social feature of an e-commerce platform in China, has gained a large number of older users. This work investigates how and why Chinese older adults use Pinxiaoquan, aiming to unveil the underlying logic and inspire technology-inclusive design for older adults. To this end, we conducted a mixed-methods qualitative study over two years, which included online observation, and semi-interview. We found that Pinxiaoquan’s success among Chinese older adults is mainly due to its ability to inspire technological autonomy and provide social-emotional support. Rather than simply lowering technical barriers or asking them to seek assistance outside the platform, Pinxiaoquan builds a semi-acquaintance online community based on location and social ties that allows older adults to realize technical support mutually. Pinxiaoquan also fulfills their social-emotional needs, such as free online expression, memory creation and preservation, relationship expansion and maintenance, and a sense of value. Our research contributes to the HCI community by highlighting the importance of improving older adults’ technology autonomy following their specific social and cultural background and social-emotional needs. This work also provides unique insights and implications for building inclusive technology for the growing aging population. © 2024 Copyright held by the owner/author(s).

关键词： Marketplaces

来源：评论

学校读者我要写书评

暂无评论

A hyperledger fabric-based EMR sharing mechanisms with proxy re-encryption and IPFS

引用

Cluster Computing 2024年第5期27卷 6953-6983页

作者： Huang, Der-Chen Liu, Ling-Chun Deng, Yong-Yuan Chen, Chin-Ling Zeng, Kuang-Wei Department of Computer Science and Engineering National Chung-Hsing University Taichung402 Taiwan School of Information Engineering Changchun Sci-Tech University Jilin Changchun130600 China Department of Computer Science and Information Engineering Chaoyang University of Technology Taichung41349 Taiwan

With the advent of the information age, data storage has not only developed from paper information systems to electronic information system storage, but has also extended to cloud database storage methods. To date, we can see the application of big data and cloud in various fields and levels, making induction, arrangement, transmission, and exchange of data easier and faster. The electronic and systematisation of patient medical records in the medical environment is an example. The use of electronic medical records can help improve the quality of medical care, reduce duplication of treatment, and reduce the waste of examination resources. It has many advantages, but also many risks. Medical institutions may abuse electronic medical data without the consent of patients, leading to the leakage of patient privacy data and causing serious social impact. Therefore, this study proposes a medical record exchange and sharing mechanism based on the Hyperledger blockchain architecture combined with proxy reencryption. When pharmacists need to obtain medical records for related research, patients can decide whether to share medical records, and hospitals can also revoke pharmacist access rights at any time to achieve more private, secure, and convenient sharing of medical records. The proposed scheme meets various blockchain security requirements and the BAN (Burrows–Abadi–Needham) logic proof model (Burrows–Abadi–Needham) is applied to assess the correctness of the proposed scheme. The proposed scheme performs well in terms of computational and communication costs. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Improved Dynamic Johnson Sequencing Algorithm(DJS)in Cloud Computing Environment for Efficient Resource Scheduling for Distributed Overloading

引用

Journal of Systems science and Systems engineering 2024年第4期33卷 391-424页

作者： Anurag Sinha Pallab Banerjee Sharmistha Roy Nitasha Rathore Narendra Pratap Singh Mueen Uddin Maha Abdelhaq Raed Alsaqour Department of Computer Science Engineering ICFAI Tech SchoolICFAI UniversityJharkhandRanchi834004India Department of Computer Science Engineering Amity UniversityJharkhandRanchi835303India Department of Computing and Information Technology Usha Martin UniversityRanchi835103India Department of Information Technology Bharti Vidyapeeth’s College of EngineeringPaschim ViharNew DelhiIndia Department of CSE Delhi UniversityNew DelhiIndia College of Computing and Information Technology University of Doha for Science and TechnologyDoha24449Qatar Department of Information Technology College of Computer and Information SciencesPrincess Nourah Bint Abdurrahman UniversityP.O.Box 84428Riyadh11671Saudi Arabia Department of Information Technology College of Computing and InformaticsSaudi Electronic University93499RiyadhSaudi Arabia

This study introduces an innovative approach to optimize cloud computing job distribution using the Improved Dynamic Johnson Sequencing Algorithm(DJS).Emphasizing on-demand resource sharing,typical to Cloud Service Providers(CSPs),the research focuses on minimizing job completion delays through efficient task *** Johnson’s rule from operations research,the study addresses the challenge of resource availability post-task *** advocates for queuing models with multiple servers and finite capacity to improve job scheduling models,subsequently reducing wait times and queue *** Dynamic Johnson Sequencing Algorithm and the M/M/c/K queuing model are applied to optimize task sequences,showcasing their efficacy through comparative *** research evaluates the impact of makespan calculation on data file transfer times and assesses vital performance indicators,ultimately positioning the proposed technique as superior to existing approaches,offering a robust framework for enhanced task scheduling and resource allocation in cloud computing.

关键词： First come first served(FCFS)scheduling round robin task scheduling queuing model Johnson scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Transaction transmission model for blockchain channels based on non-cooperative games

引用

science China(information sciences) 2023年第1期66卷 97-114页

作者： Peiyun ZHANG Chenxi LI Mengchu ZHOU Wenjun HUANG Abdullah ABUSORRAH Omaimah O.BAMASAG Engineering Research Center of Digital Forensics of Ministry of Education School of Computer and SoftwareNanjing University of Information Science and Technology School of Computer and Information Anhui Normal University Department of Electrical and Computer Engineering New Jersey Institute of Technology Center of Research Excellence in Renewable Energy and Power Systems Department of Electrical and Computer Engineering Faculty of Engineering and K.A.CARE Energy Research and Innovation CenterKing Abdulaziz University Department of Computer Science Faculty of Computing and Information Technology Center of Excellence in Smart Environment Research King Abdulaziz University

In blockchain networks, transactions can be transmitted through channels. The existing transmission methods depend on their routing information. If a node randomly chooses a channel to transmit a transaction, the transmission may be aborted due to insufficient funds(also called balance) or a low transmission rate. To increase the success rate and reduce transmission delay across all transactions, this work proposes a transaction transmission model for blockchain channels based on non-cooperative game *** balance, channel states, and transmission probability are fully considered. This work then presents an optimized channel transaction transmission algorithm. First, channel balances are analyzed and suitable channels are selected if their balance is sufficient. Second, a Nash equilibrium point is found by using an iterative sub-gradient method and its related channels are then used to transmit transactions. The proposed method is compared with two state-of-the-art approaches: Silent Whispers and Speedy Murmurs. Experimental results show that the proposed method improves transmission success rate, reduces transmission delay,and effectively decreases transmission overhead in comparison with its two competitive peers.

关键词： Blockchain channel transaction transmission channel balance channel state channel transmission probability non-cooperative game

来源：评论

学校读者我要写书评

暂无评论

Hybrid Approach for Privacy Enhancement in Data Mining Using Arbitrariness and Perturbation

引用

computer Systems science & engineering 2023年第3期44卷 2293-2307页

作者： B.Murugeshwari S.Rajalakshmi K.Sudharson Department of Computer Science and Engineering Velammal Engineering CollegeChennai600066India Department of Information Technology Velammal Institute of TechnologyChennai601204India

Imagine numerous clients,each with personal data;individual inputs are severely corrupt,and a server only concerns the collective,statistically essential facets of this *** several data mining methods,privacy has become highly *** a result,various privacy-preserving data analysis technologies have ***,we use the randomization process to reconstruct composite data attributes ***,we use privacy measures to estimate how much deception is required to guarantee *** are several viable privacy protections;however,determining which one is the best is still a work in *** paper discusses the difficulty of measuring privacy while also offering numerous random sampling procedures and statistical and categorized data ***-more,this paper investigates the use of arbitrary nature with perturbations in privacy *** to the research,arbitrary objects(most notably random matrices)have"predicted"frequency *** shows how to recover crucial information from a sample damaged by a random number using an arbi-trary lattice spectral selection *** system's conceptual frame-work posits,and extensive practicalfindings indicate that sparse data distortions preserve relatively modest privacy protection in various *** a result,the research framework is efficient and effective in maintaining data privacy and security.

关键词： Data mining data privacy arbitrariness data security perturbation

来源：评论

学校读者我要写书评

暂无评论

MLMO-HSM: Multi-label Multi-output Hybrid Sequential Model for multi-resident smart home activity recognition

引用

Journal of Ambient Intelligence and Humanized Computing 2023年第3期14卷 2313-2325页

作者： Ramanujam, E. Perumal, Thinagaran Department of Computer Science and Engineering National Institute of Technology Silchar Assam 788010 India Department of Computer Science Faculty of Computer Science and Information Technology Universiti Putra Malaysia Serdang India

Smart home automation is protective and preventive measures that are taken to monitor elderly people in a non-intrusive manner using simple and pervasive sensors termed Ambient Assistive Living. The smart home produces a large volume of sensor activations to predict an elder’s health status to improve the quality of life and independent living. Machine learning techniques are very familiar and popular in recognizing single resident activities using such a sensor reading. However, multi-resident activities are more complex, and no correlation exists between sensor readings and activities. Recently deep learning and graphical models have been proposed to solve this problem, but it consumes more time to train the model. Moreover, models are primarily executed in parallel, or multi-resident activity recognition has been converted to single for classifying events. This paper proposes a Multi-label Multi-output Hybrid Sequential Model (MLMO-HSM), a feature engineering approach with a hybrid sequential model to recognize the multi-resident activities concurrently in the shortest time. Experimentation has been performed with various machine learning, graphical and deep learning models at the different sizes of the ARAS dataset to validate the efficiency of the proposed model in terms of activity recognition and computation time. © 2022, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Automation

来源：评论

学校读者我要写书评

暂无评论

Deep Learning Enabled Social Media Recommendation Based on User Comments

引用

computer Systems science & engineering 2023年第2期44卷 1691-1702页

作者： K.Saraswathi V.Mohanraj Y.Suresh J.Senthilkumar Department of Computer Science and Engineering Government College of EngineeringSalem636011India Department of Information Technology Sona College of TechnologySalem636005India

Nowadays,review systems have been developed with social media Recommendation systems(RS).Although research on RS social media is increas-ing year by year,the comprehensive literature review and classiﬁcation of this RS research is limited and needs to be *** previous method did notﬁnd any user reviews within a time,so it gets poor accuracy and doesn’tﬁlter the irre-levant comments efﬁ*** Recursive Neural Network-based Trust Recom-mender System(RNN-TRS)is proposed to overcome this method’s *** it is efﬁcient to analyse the trust comment and remove the irrelevant sentence ***ﬁrst step is to collect the data based on the transactional reviews of social *** second step is pre-processing using Imbalanced Col-laborative Filtering(ICF)to remove the null values from the *** the features from the pre-processing step using the Maximum Support Grade Scale(MSGS)to extract the maximum number of scaling features in the dataset and grade the weights(length,count,etc.).In the Extracting features for Training and testing method before that in the feature weights evaluating the softmax acti-vation function for calculating the average weights of the ***,In the classiﬁcation method,the Recursive Neural Network-based Trust Recommender System(RNN-TRS)for User reviews based on the Positive and negative scores is analysed by the *** simulation results improve the predicting accuracy and reduce time complexity better than previous methods.

关键词： Recommendation systems(RS) social media recursive neural network-based trust recommender system(RNN-TRS) user reviews

来源：评论

学校读者我要写书评

暂无评论

WSO-KELM: War Strategy Optimization-Based Kernel Extreme Learning Machine for Automatic Software Fault Prediction Model

引用

Journal of The Institution of Engineers (India): Series B 2025年第1期106卷 145-163页

作者： Elci, J. Brundha Nandagopalan, S. Department of Computer Science and Engineering Vemana Institute of Technology Visvesvaraya Technological University Karnataka Belagavi India Department of Information Science and Engineering Vemana Institute of Technology Visvesvaraya Technological University Karnataka Belagavi India

The software development projects’ testing part is usually expensive and complex, but it is essential to gauge the effectiveness of the developed software. Software Fault Prediction (SFP) primarily serves to detect faults within software components. The scale of software projects is getting larger, making it impossible and time-consuming to analyze the flaws manually. Artificial Intelligence (AI) techniques are mainly incorporated to solve this problem. The massive data retrieved from the software repositories helps in identifying the features that are highly correlated with fault prediction and the features that are not. This paper introduces a Kernel Extreme Learning Machine (KELM) for SFP. To optimize the hyperparameters of the classifier and also enhance the classification accuracy, the War Strategy Optimization (WSO) algorithm is employed here. The experimental evaluations are conducted using different baseline actual-world datasets of software programs such as Java-coded open-source and PROMISE datasets. The experimental outcomes are conducted using different performance metrics that include sensitivity, Accuracy, and F1-score with values of 0.96%, 0.97%, and 0.96%, respectively. The results show that KELM is beneficial, and the optimization provided by the WSO algorithm also helps us obtain higher classification accuracy for the SFP problem and improve the fault detection process. © The Institution of Engineers (India) 2024.

关键词： Software reliability

来源：评论

学校读者我要写书评

暂无评论

Identify information sources with different start times in complex networks based on sparse observers

引用

Chinese Physics B 2024年第11期33卷 467-479页

作者： Yuan-Zhang Deng Zhao-Long Hu Feilong Lin Chang-Bing Tang Hui Wang Yi-Zhen Huang School of Computer Science and Technology Zhejiang Normal UniversityJinhua 321004China School of Physics and Electronic Information Engineering Zhejiang Normal UniversityJinhua 321004China School of Information Engineering Jinhua PolytechnicJinhua 321016China

The dissemination of information across various locations is an ubiquitous occurrence,however,prevalent methodologies for multi-source identification frequently overlook the fact that sources may initiate dissemination at distinct initial *** there are many research results of multi-source identification,the challenge of locating sources with varying initiation times using a limited subset of observational nodes remains *** this study,we provide the backward spread tree theorem and source centrality theorem,and develop a backward spread centrality algorithm to identify all the information sources that trigger the spread at different start *** proposed algorithm does not require prior knowledge of the number of sources,however,it can estimate both the initial spread moment and the spread *** core concept of this algorithm involves inferring suspected sources through source centrality theorem and locating the source from the suspected sources with linear *** experiments from synthetic and real network simulation corroborate the superiority of our method in terms of both efficacy and ***,we find that our method maintains robustness irrespective of the number of sources and the average degree of *** with classical and state-of-the art source identification methods,our method generally improves the AUROC value by 0.1 to 0.2.

关键词： complex networks information spread source identification backward spread centricity

来源：评论

学校读者我要写书评

暂无评论

Reconfiguration of vertex-disjoint shortest paths on graphs

引用

Journal of Graph Algorithms and Applications 2024年第3期28卷 87-101页

作者： Saito, Rin Eto, Hiroshi Ito, Takehiro Uehara, Ryuhei Graduate School of Information Sciences Tohoku University Sendai Japan School of Computer Science and Systems Engineering Kyushu Institute of Technology Iizuka Japan School of Information Science Japan Advanced Institute of Science and Technology Nomi Japan

We introduce and study reconfiguration problems for (internally) vertex-disjoint shortest paths: Given two tuples of internally vertex-disjoint shortest paths for fixed terminal pairs in an unweighted graph, we are asked to determine whether one tuple can be transformed into the other by exchanging a single vertex of one shortest path in the tuple at a time, so that all intermediate results remain tuples of internally vertex-disjoint shortest paths. We also study the shortest variant of the problem, that is, we wish to minimize the number of vertex-exchange steps required for such a transformation, if exists. These problems generalize the well-studied Shortest Path Reconfiguration problem. In this paper, we analyze the complexity of these problems from the viewpoint of graph classes, and give some interesting contrast. © 2024, Brown University. All rights reserved.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：