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

Ontological Model for Cohesive Smart Health Services Management

Computers, Materials & Continua 2023年第2期74卷 3679-3695页

作者： Muhammad Raza Naqvi Muhammad Waseem Iqbal Syed Khuram Shahzad M.Usman Ashraf Khalid Alsubhi Hani Moaiteq Aljahdali Le Laboratoire Génie de Production de l’École Nationale d’Ingénieurs de Tarbes(LGP-INP-ENIT) Universitéde ToulouseCEDEXTarbes65016France Department of Software Engineering Superior UniversityLahore53700Pakistan Department of Informatics&Systems University of Management&TechnologyLahore54000Pakistan Department of Computer Science University of Management and TechnologySialkot51310Pakistan Department of Computer Science King Abdul-Aziz UniversityJeddah21577Saudi Arabia Faculty of Computing and Information Technology King Abdulaziz UniversityJeddah21577Saudi Arabia

Health care has become an essential social-economic concern for all stakeholders(e.g.,patients,doctors,hospitals etc.),health needs,private care and the elderly class of *** massive increase in the usage of health care Internet of things(IoT)applications has great technological evolvement in human *** are various smart health care services like remote patient monitoring,diagnostic,disease-specific remote treatments and *** applications are available in a split fashion and provide solutions for variant diseases,medical resources and remote service *** main objective of this research is to provide a management platform where all these services work as a single unit to facilitate the *** ontological model of integrated healthcare services is proposed by getting requirements from various existing healthcare *** were 26 smart health care services and 26 smart health care services to classify the knowledge-based ontological *** proposed ontological model is derived from different classes,relationships,and constraints to integrate health care *** model is developed using Protégébased on each interrelated/correlated health care service having different *** querying SPARQL protocol and RDF query language(SPARQL)were used for knowledge *** Pellet Reasoner is used to check the validity and relations coherency of the proposed ontology *** to other smart health care services integration systems,the proposed ontological model provides more cohesiveness.

关键词： Ontology internet of things smart health services integration

来源：评论

学校读者我要写书评

暂无评论

A Topic-Aware Graph-Based Neural Network for User Interest Summarization and Item Recommendation in Social Media 28th

A Topic-Aware Graph-Based Neural Network for User Interest ...

引用

28th International Conference on Database Systems for Advanced Applications, DASFAA 2023

作者： Chen, Junyang Fan, Ge Gong, Zhiguo Li, Xueliang Leung, Victor C. M. Wang, Mengzhu Yang, Ming College of Computer Science and Software Engineering Shenzhen University Shenzhen China Shenzhen China Tencent Inc. Shenzhen China State Key Laboratory of Internet of Things for Smart City Department of Computer Information Science University of Macau China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

ISBN: (纸本)9783031306716

User-generated content is daily produced in social media, as such user interest summarization is critical to distill salient information from massive information. While the interested messages (e.g., tags or posts) from a single user are usually sparse becoming a bottleneck for existing methods, we propose a topic-aware graph-based neural interest summarization method (UGraphNet), enhancing user semantic mining by unearthing potential user relations and jointly learning the latent topic representations of posts that facilitates user interest learning. Experiments on two datasets collected from well-known social media platforms demonstrate the superior performance of our model in the tasks of user interest summarization and item recommendation. Further discussions also show that exploiting the latent topic representations and user relations are conductive to the user automatic language understanding. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

EEiF: Efficient Isolated Forest with e Branches for Anomaly Detection

EEiF: Efficient Isolated Forest with e Branches for Anomaly ...

引用

IEEE International Conference on Data Mining (ICDM)

作者： Yifan Zhang Haolong Xiang Xuyun Zhang Xiaolong Xu Wei Fan Qin Zhang Lianyong Qi School of software Nanjing University of Information Science and Technology China Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services China School of Computing Macquarie University Australia Uffield Department of Women's & Reproductive Health University of Oxford England College of Computer Science and Software Engineering Shenzhen University China Faculty of Science and Engineering University of Petroleum (East China) China

ISBN: (数字)9798331506681

ISBN: (纸本)9798331506698

Anomaly detection is a popular research topic in Artificial Intelligence and has been widely applied in network security, financial fraud detection, and industrial equipment failure detection. Isolation forest based methods are the base algorithms to detect anomalies in these scenarios for their simplicity and efficiency, which has been further exploited with multi-folk trees and learning mechanisms to realize the optimal isolation forest for high detection accuracy. However, the optimal isolation forest is time-consuming with the learning mechanisms, resulting in the task failing of time-constrained applications. Moreover, the original optimal isolation forest fails to construct the optimal tree structure restricted by the time complexity. To address the above challenges, we propose an efficient anomaly detection method called EEIF, which realizes the real e-folk structure of the optimal isolation forest in our practical algorithm design. Specifically, we design a distribution that perfectly matches the e-branch theory to construct the optimal isolation forest. Then, we design an FR clustering scheme to achieve fast training of the isolation forest with learning to hash and provide related proofs of accuracy and efficiency. Besides, a parallel algorithm is integrated into our method to reduce prediction time. Finally, extensive experiments are conducted on a large amount of real-world datasets and the results demonstrate that our method significantly improves efficiency while ensuring effectiveness, compared with the state-of-the-art methods.

关键词： Learning systems Training Accuracy Clustering algorithms Forestry Network security Fraud Time complexity Parallel algorithms Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Reseed Skipping of Linear Congruential Generator for Multi-level Image Steganography Security of Financial Data

引用

SN Computer Science 2023年第2期4卷 124页

作者： Danso, Juliana Mantebea Missah, Yaw Marfo Gyamfi, Enoch Opanin Dankwa, Stephen Kwabena, Sarpong Department of Computer Science Kwame Nkrumah University of Science and Technology (KNUST) Kumasi Ghana School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China Department of Cyber Security and Computer Engineering Technology School of Computing and Information Sciences C.K. Tedam University of Technology and Applied Sciences Upper East Region Navrongo Ghana School of Automation Engineering University of Electronic Science and Technology of China Chengdu China

This paper proposed a multi-level image steganography model that integrates with image and plaintext encryption schemes. The model starts by partitioning the cover-image pixel positions into two regions of respective purposes, one is reserved to hold the data, and through the implementation of the dynamic difference expansion principle, the other sloughs some parts to the reserved region in responsive to the size of the data to embed. Continuously reseeding and initializing the parameter values of a Linear Congruential Generator (LCG), generate a set of random pixel positions as members of the reserved region. Before data embedding, the region reserved to hold the data as well as the data bits to embed, are then encrypted using AES with respective keys. Encryption keys are randomly generated using a Cryptographically Secure Pseudo-Random Number Generator (CSPRNG), the Fortuna algorithm. Multiplex security nature of using a randomization generator to reserve image region for encryption and encrypting plaintext data before performing steganography still ensures stability in computational complexities better than a logarithmic O(n log n). A visual inspection by evaluators who made 3000 choices to correctly differentiate stego images from its cover-images shows that only 47 choices were correct, 1884 choices were wrong, while 1069 choices were uncertain. An experiment shows an average Embedding Rates (ERs) of 0.00109 bpp and an average PSNR of 72. This concludes, as our integrated steganography and image encryption which implements the dynamic difference expansion principle, outputs encrypted stego mages that can deceive the naked human eyes into identifying them as rather cover-images, its embedding rate is faster (i.e. ER < 0.1), suitably good, and ensures better imperceptibility of cover-image alterations. When comparing these experimental results with existing methods, our proposed model shows significant competitiveness. We even show real-life scenarios on how this

关键词： AES encryption scheme Dynamic difference expansion principle Linear congruential generator Pseudo-random number generator Reserving room before encryption Steganography

来源：评论

学校读者我要写书评

暂无评论

Understanding Older Adults' (Dis)Engagement with Design Materials 25

Understanding Older Adults' (Dis)Engagement with Design Mate...

引用

2025 CHI Conference on Human Factors in computing Systems, CHI 2025

作者： Pradhan, Alisha Jelen, Ben Thangaraj, Ramprabu Siek, Katie A. Jette, Shannon Lazar, Amanda Department of Informatics Ying Wu College of Computing New Jersey Institute of Technology Newark NJ United States Computer Science and Software Engineering Rose-Hulman Institute of Technology Terre Haute IN United States Ying Wu College of Computing New Jersey Institute of Technology Newark NJ United States Luddy School of Informatics Computing and Engineering Indiana University Bloomington IN United States University of Maryland College Park MD United States College of Information Studies University of Maryland College Park MD United States

ISBN: (纸本)9798400713941

Design workshops are a popular approach to include older adults in the technology design process. However, formative design sessions with older adults have had unexpected outcomes such as the non-use of traditional design materials like craft-based prototyping supplies or disengagement from design activities. Analyzing the engagement of 32 older adults across two design workshops, this paper sheds insights on some of these outcomes. Contributing to a growing body of HCI research on understanding older adults' participation in design, we provide an understanding of how design materials can shape older adults' engagement in formative design activities. Our discussion furthers research on understanding who older adults design for and why, argues for a different understanding of creative expression, and offers considerations for choosing design materials. © 2025 Copyright held by the owner/author(s).

关键词： co-design design materials design workshops Older adults participatory design

来源：评论

学校读者我要写书评

暂无评论

Optimal Bounds for Distinct Quartics

arXiv

引用

arXiv 2024年

作者： Charalampopoulos, Panagiotis Gawrychowski, Pawel Ghazawi, Samah School of Computing and Mathematical Sciences Birkbeck University of London United Kingdom Institute of Computer Science University of Wroclaw Poland Department of Software Engineering Braude College of Engineering Karmiel Israel Department of Computer Science University of Haifa Israel

A fundamental concept related to strings is that of repetitions. It has been extensively studied in many versions, from both purely combinatorial and algorithmic angles. One of the most basic questions is how many distinct squares, i.e., distinct strings of the form UU, a string of length n can contain as fragments. It turns out that this is always O(n), and the bound cannot be improved to sublinear in n [Fraenkel and Simpson, JCTA 1998]. Several similar questions about repetitions in strings have been considered, and by now we seem to have a good understanding of their repetitive structure. For higher-dimensional strings, the basic concept of periodicity has been successfully extended and applied to design efficient algorithms—it is inherently more complex than for regular strings. Extending the notion of repetitions and understanding the repetitive structure of higher-dimensional strings is however far from complete. Quartics were introduced by Apostolico and Brimkov [TCS 2000] as analogues of squares in two dimensions. Charalampopoulos, Radoszewski, Rytter, Waleń, and Zuba [ESA 2020] proved that the number of distinct quartics in an n × n 2D string is O(n2 log2 n) and that they can be computed in O(n2 log2 n) time. Gawrychowski, Ghazawi, and Landau [SPIRE 2021] constructed an infinite family of n×n 2D strings with Ω(n2 log n) distinct quartics. This brings the challenge of determining asymptotically tight bounds. Here, we settle both the combinatorial and the algorithmic aspects of this question: the number of distinct quartics in an n × n 2D string is O(n2 log n) and they can be computed in the worst-case optimal O(n2 log n) time. As expected, our solution heavily exploits the periodic structure implied by occurrences of quartics. However, the two-dimensional nature of the problem introduces some technical challenges. Somewhat surprisingly, we overcome the final challenge for the combinatorial bound using a result of Marcus and Tardos [JCTA 2004] for permutation

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

$\mathrm{E}_{\gamma}$-Mixing Time

$\mathrm{E}_{\gamma}$-Mixing Time

引用

IEEE International Symposium on Information Theory

作者： Behnoosh Zamanlooy Shahab Asoodeh Mario Diaz Flavio P. Calmon Department of Computing and Software McMaster University Canada IIMAS Universidad Nacional Autónoma de México Mexico School of Engineering and Applied Sciences Harvard University USA

ISBN: (数字)9798350382846

ISBN: (纸本)9798350382853

We investigate the mixing times of Markov kernels under $\mathsf{E}_{\gamma}-\mathbf{divergence}$ . We demonstrate that the zero-error $\mathsf{E}_{\gamma}- \mathbf{mixing}$ time, for any $\gamma > 1$ , of irreducible and aperiodic Markov chains, is bounded, a property that is not shared by the TV-mixing time. We further obtain upper bounds on the $\mathsf{E}_{\gamma}-\mathbf{mixing}$ times for a broad family of contractive Markov kernels via a new non-linear strong data processing inequality for the $\mathsf{E}_{\gamma}- \mathbf{divergence}$ . We apply our results to derive new bounds for the local differential privacy guarantees offered by the sequential application of a privacy mechanism to data.

关键词： Differential privacy Upper bound Data processing Kernel Information theory

来源：评论

学校读者我要写书评

暂无评论

Towards Evidence-Based Cybersecurity Assessment of Programmable Systems to Ensure the Protection of Critical IT Infrastructure 12

Towards Evidence-Based Cybersecurity Assessment of Programma...

引用

12th IEEE International Conference on Intelligent Data Acquisition and Advanced computing Systems: Technology and Applications, IDAACS 2023

作者： Illiashenko, Oleg Kharchenko, Vyacheslav Odarushchenko, Oleg National Aerospace University 'KhAI' Department of Computer Systems and Networks Kharkiv61070 Ukraine Institute of Information Science and Technologies 'Alessandro Faedo' - Isti Cnr Software Engineering & Dependable Computing Laboratory Pisa56124 Italy Research and Production Enterprise Rpc Radics Llc Kropyvnytskyi25009 Ukraine

ISBN: (纸本)9798350358056

The paper is devoted to developing scientific principles, methods, means, and information technology of model-oriented verification and evidence-based assessment using functional safety and cybersecurity cases for programmable systems of critical applications (PSCA). In particular, information and control systems important for the safety of nuclear power plants (NPPs), aerospace systems, railway domains, etc., developed using Field Programmable Gate Arrays (FPGAs) and hardware platforms are reviewed. The goal is to ensure the guaranteed completeness and reliability of its functional safety and cybersecurity assessment by developing and implementing a set of formal and semi-formal methods and tools that consider defects of different nature - physical, design, trojans, and vulnerabilities that can be attacked and lead to a fatal system failure, which results in damaging the critical IT infrastructure. The methods shown are based on integrating algebraic, tabular, graph models, and case assessment methodology. The methods are implemented as appropriate technologies for evidence-based verification and evaluation of PSCA. For formal methods, a prototype of a translator of Very High-Speed Integrated Circuits Hardware Description Language (VHDL) code is developed into an algebra of behaviors. It provides evidence-based verification and a framework and tools to design reports on assessing the cybersecurity and functional safety of programmable systems. © 2023 IEEE.

关键词： critical IT infrastructure cybersecurity FPGA functional safety programmable systems of critical applications

来源：评论

学校读者我要写书评

暂无评论

Stock Price Prediction using CuDNNLSTM and multiple CNN layers

Stock Price Prediction using CuDNNLSTM and multiple CNN laye...

引用

Artificial Intelligence, Blockchain, and Internet of Things (AIBThings), IEEE International Conference on

作者： Anika Kanwal Siva Chandrasekaran Adnan Akhunzada Department of Computer Science and Software Engineering Swinburne University of Technology Melbourne Australia Department of Computing and Information Technology University of Doha for Science and Technology Doha Qatar

Academic and financial sectors are interested in research areas that focus on understanding the patterns of financial activities and predicting their future changes. The daily movement of financial data involves complex, insufficient, and ambiguous information, making its prediction an extremely difficult endeavour. The issues of forecasting and analysing financial data is therefore complex and time-dependent. Deep neural networks (DNNs) can be used to solve nonlinear problems more effectively than conventional machine learning techniques. This study proposes an intelligent and optimal model CuDNNLSTM-Multi(1dCNN) for stock market price prediction using a hybrid of CUDA based Long Short Term Memory (LSTM) and Multiple One Dimensional Convolution Neural Networks (CNNs). A variety of models, including Multiple CuDNNLSTM-CNN, Multi-CuDNNLSTM, Multi (1dCNN), are used to compare the prediction performance of the proposed model. In terms of RMSE, MAE, and MAPE, the results show that the suggested model outperforms all hybrid and individual models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Enhancing Anomaly Detection in Electric Vehicle Supply Equipment (EVSE) Networks Using Classical and Ensemble Learning Approaches

Enhancing Anomaly Detection in Electric Vehicle Supply Equip...

引用

Control Instrumentation System Conference (CISCON)

作者： Sandeep R. Hegde Vijayabhaskaramoorthy V. K. R. M. Vijaya Chandrakala Gireesh Kumar T. V. K. Arun Shankar Department of Computer Science and Engineering Amrita School of Computing Coimbatore Amrita Vishwa Vidyapeetham India Department of Electrical and Electronics Engineering Amrita School of Engineering Coimbatore Amrita Vishwa Vidyapeetham India Software Testing Engineer Danfoss Industries Private Limited USA

ISBN: (数字)9798350375480

ISBN: (纸本)9798350375497

Electric Vehicle Supply Equipment (EVSE) networks, integral to modern transportation systems, are vulnerable to cyber threats due to integration into smart grids and IoT ecosystems. EVSE network A represents a traditional, centralized EV charging infrastructure, whereas EVSE network B denotes a distributed, decentralized charging network with varying levels of connectivity. This research investigates the security landscape of EVSE networks A and B, focusing on the detection and classification of network attacks. Through meticulous comparative analysis, the research highlights the effectiveness of Ensemble Learning over Classical learning models in improving attack classification precision. This approach enhances the precision of attack detection by leveraging diverse algorithms and data sources to mitigate security risks effectively.

关键词： Biological system modeling Soft sensors Instruments Ecosystems Transportation Smart grids Security Ensemble learning Internet of Things Context modeling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：