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

6th International Conference on Intelligent Computing and Signal Processing (ICSP)

作者： Pingfang Tian Deting Liu Department of Computer Science and Technology Wuhan University of Science and Technology Wuhan China The Key Laboratory of the Rich Media Knowledge Organisation and Service of Digital Publishing Content Institute of Scientific and Technical Information of China Beijing China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan China Big Data Science and Engineering Research Institute Wuhan University of Science and Technology Wuhan China

ISBN: (数字)9798350376548

ISBN: (纸本)9798350376555

Topic shift detection aims to identify whether there is a change in the current topic of conversation or if a change is needed. The study found previous work did not evaluate the performance of large language models like ChatGPT on the task of topic shift. Therefore, this paper's main task and innovation lie in analyzing ChatGPT's performance on topic shift detection. To provide a more comprehensive evaluation, we conducted topic shift detection tasks on ChatGPT from three aspects: single utterances, adjacent utterances, and contextual levels. Additionally, to gauge the performance of large language models, we conducted experiments on multiple small-scale models and compared the results of the two models. Experimental results on the publicly available English TIAGE dataset showed that small-scale models exhibited lower recall in all three aspects, while ChatGPT performed better in the recall. This suggests that compared to small-scale models, large models are more capable of accurately detecting topic shifts. However, large models also exhibited lower precision, indicating that while ChatGPT can recognize content differences in utterances, its judgment on whether these different contents belong to the same topic is poor.

关键词： Technological innovation Large language models Oral communication Signal processing Chatbots Context modeling

来源：评论

学校读者我要写书评

暂无评论

A Fast and Effective Multiple Kernel Clustering Method on Incomplete data

引用

Computers, Materials & Continua 2021年第4期67卷 267-284页

作者： Lingyun Xiang Guohan Zhao Qian Li Gwang-Jun Kim Osama Alfarraj Amr Tolba Changsha Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication EngineeringChangsha University of Science and TechnologyChangsha410114China Hunan Key Laboratory of Smart Roadway and Cooperative Vehicle-Infrastructure Systems Changsha University of Science and TechnologyChangsha410114China Faculty of Engineering and Information Technology Global Big Data Technologies CentreUniversity of Technology SydneyUltimoNSW2007Australia Department of Computer Engineering Chonnam National UniversityGwangju61186Korea Computer Science Department Community CollegeKing Saud UniversityRiyadh11437Saudi Arabia Department of Mathematics and Computer Science Faculty of ScienceMenoua UniversityShebin-El-kom32511Egyp

Multiple kernel clustering is an unsupervised data analysis method that has been used in various scenarios where data is easy to be collected but hard to be ***,multiple kernel clustering for incomplete data is a critical yet challenging *** the existing absent multiple kernel clustering methods have achieved remarkable performance on this task,they may fail when data has a high value-missing rate,and they may easily fall into a local *** address these problems,in this paper,we propose an absent multiple kernel clustering(AMKC)method on incomplete *** AMKC method rst clusters the initialized incomplete ***,it constructs a new multiple-kernel-based data space,referred to as K-space,from multiple sources to learn kernel combination ***,it seamlessly integrates an incomplete-kernel-imputation objective,a multiple-kernel-learning objective,and a kernel-clustering objective in order to achieve absent multiple kernel *** three stages in this process are carried out simultaneously until the convergence condition is *** on six datasets with various characteristics demonstrate that the kernel imputation and clustering performance of the proposed method is signicantly better than state-of-the-art ***,the proposed method gains fast convergence speed.

关键词： Multiple kernel clustering absent-kernel imputation incomplete data kernel k-means clustering

来源：评论

学校读者我要写书评

暂无评论

Reversible data Hiding With Secret Encrypted Image Sharing and Adaptive Coding

引用

IEEE Internet of Things Journal 2025年

作者： Fang, Guangtian Wang, Feng Zhao, Chenbin Qin, Chuan Chang, Ching-Chun Chang, Chin-Chen Fujian University of Technology College of Computer Science and Mathematics Fuzhou350118 China Fujian University of Technology College of Computer Science and Mathematics Key Laboratory of Big Data Mining and Applications Fuzhou350118 China Monash University Faculty of IT Department of Software Systems and Cybersecurity VIC3800 Australia Ministry of Education School of Cyber Science and Engineering Key Laboratory of Aerospace Information Security and Trusted Computing Wuhan430072 China University of Shanghai for Science and Technology School of Optical-Electrical and Computer Engineering Shanghai200093 China Feng Chia University Information and Communication Security Research Center Taichuang 40724 Taiwan Feng Chia University Department of Information Engineering and Computer Science Taichung40724 Taiwan

To ensure the security of image information and facilitate efficient management in the cloud, the utilization of reversible data hiding in encrypted images (RDHEI) has emerged as pivotal. However, most existing RDHEI schemes suffer from lower security and limited embedding capacity. To tackle these challenges, we propose a reversible data hiding with secret encrypted image sharing and adaptive coding scheme. Specifically, in the encryption phase, we introduce an improved secret sharing (SS) encryption method based on the chinese remainder theorem for polynomials (CRTP). This method not only improves the security of encrypted images but also vacates a larger room for embedding. In the embedding phase, we introduce an adaptive coding embedding approach using XOR preservation (XORP) and huffman coding, which provides high embedding capacity. Experimental results and security analysis demonstrate that our proposed encryption method achieves optimal values in security indicators for encrypted images, such as information entropy, histograms, NPCR and UACI. The proposed embedding method is superior to some state-of-the-art schemes in terms of embedding capacity. Furthermore, in datasets BOSSBase and BOWS2, the average embedding rates of the proposed embedding approach can reach 2.1745 bpp and 2.0656 bpp, respectively. © 2025 IEEE.

关键词： adaptive coding chinese remainder theorem for polynomials encrypted images Reversible data hiding secret sharing

来源：评论

学校读者我要写书评

暂无评论

A Case Study of Absolute- and Comparative-Based Life Cycle Assessment of Greek Organic Red Wine as it Affects "Climate Change"

SSRN

引用

SSRN 2022年

作者： Tsalidis, Georgios Archimidis Kryona, Zoi-Panagiota Hatzisavva, Kiriaki Korevaar, Gijsbert Rapsomanikis, Spyridon Environmental and Networking Technologies and Applications Unit Athena - Research and Innovation Center in Information Communication and Knowledge Technologies Greece Biotechnology Department Delft University of Technology Netherlands Engineering Systems and Services Department Delft University of Technology Netherlands

Agriculture may play a crucial role in mitigating climate change due to the sequestration of atmospheric carbon dioxide. Environmental life cycle assessment (E-LCA) indicates which product has the lowest global warming potential (GWP), and the planetary boundaries (PBs) concept provides the safe operating space (SOS) in which human activity should occur, to mitigate the parameters that affect climate change. This study aims to apply E-LCA and the PBs concept to calculate the respective comparative and absolute environmental performance of a bottle of Greek red organic wine in 2021 and 2026, when the "case study" vineyard will have reached full capacity. Two scenarios were investigated for 2026 because viticulture may produce a minimum (2026 Low) or a maximum (2026 High) yield. The functional unit was a bottle of 0.75 L of wine and the system was modeled based on the product environmental footprint category rules for still wine. The SOS was developed based on four partitioning methods: grandfathering, economic, agri-land, and calorific content. The results show that 2021, 2026-Low, and 2026-High yields result in a GWP of 1.14, 0.76, and 0.69 kg ***-1, and the zeolite used in the grape-growing stage was the largest contributor to this result. The largest SOS was derived from the "economic partitioning" method due to the significance of the wine industry in the Greek economy. The carbon balance of 2021, 2026-Low, and 2026-High yields remains within the SOS. However, the margin for the 2021 yield is small, while the margin for the 2026-Low, and 2026-High yields is large enough for the wine producer to make even significant changes in the viticulture or winemaking stages. To conclude, the case study shows that red organic wine production and consumption in Greece results in climate change mitigation, and determining actual carbon sequestration in the viticulture stage is crucial. © 2022, The Authors. All rights reserved.

关键词： Carbon dioxide

来源：评论

学校读者我要写书评

暂无评论

Synthetic Instance Segmentation from Semantic Image Segmentation Masks

arXiv

引用

arXiv 2023年

作者： Shen, Yuchen Zhang, Dong Zhang, Zhao Fu, Liyong Ye, Qiaolin College of Information Science and Technology & Artificial Intelligence Nanjing Forestry University Jiangsu Nanjing210037 China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Hefei230009 China College of Information Science and Technology Nanjing Forestry University Jiangsu Nanjing210037 China Institute of Forest Resource Information Techniques Chinese Academy of Forestry Beijing100091 China

In recent years, instance segmentation has garnered significant attention across various applications. However, training a fully-supervised instance segmentation model requires costly both instance-level and pixel-level annotations. In contrast, weakly-supervised instance segmentation methods, such as those using image-level class labels or point labels, often struggle to satisfy the accuracy and recall requirements of practical scenarios. In this paper, we propose a novel paradigm called Synthetic Instance Segmentation (SISeg). SISeg achieves instance segmentation results by leveraging image masks generated by existing semantic segmentation models, and it is highly efficient as we do not require additional training for semantic segmentation or the use of instance-level image annotations. In other words, the proposed model does not need extra manpower or higher computational expenses. Specifically, we first obtain a semantic segmentation mask of the input image via an existent semantic segmentation model. Then, we calculate a displacement field vector for each pixel based on the segmentation mask, which can indicate representations belonging to the same class but different instances, i.e., obtaining the instance-level object information. Finally, the instance segmentation results are refined by a learnable category-agnostic object boundary branch. Extensive experimental results on two challenging datasets highlight the effectiveness of SISeg in achieving competitive results when compared to state-of-the-art methods, especially fully-supervised methods. The code will be released at: SISeg Copyright © 2023, The Authors. All rights reserved.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

SUBDIFFERENTIALLY POLYNOMIALLY BOUNDED FUNCTIONS AND GAUSSIAN SMOOTHING-BASED ZEROTH-ORDER OPTIMIZATION ∗

arXiv

引用

arXiv 2024年

作者： Lei, Ming Pong, Ting Kei Sun, Shuqin Yue, Man-Chung College of Applied Mathematics Chengdu University of Information Technology Chengdu China Department of Applied Mathematics The Hong Kong Polytechnic University Hong Kong Key Laboratory of Optimization Theory and Applications China West Normal University of Sichuan Province School of Mathematics Education China West Normal University Nanchong China Musketeers Foundation Institute of Data Science Department of Data and Systems Engineering The University of Hong Kong Hong Kong

We study the class of subdifferentially polynomially bounded (SPB) functions, which is a rich class of locally Lipschitz functions that encompasses all Lipschitz functions, all gradient- or Hessian-Lipschitz functions, and even some non-smooth locally Lipschitz functions. We show that SPB functions are compatible with Gaussian smoothing (GS), in the sense that the GS of any SPB function is well-defined and satisfies a descent lemma akin to gradient-Lipschitz functions, with the Lipschitz constant replaced by a polynomial function. Leveraging this descent lemma, we propose GS-based zeroth-order optimization algorithms with an adaptive stepsize strategy for minimizing SPB functions, and analyze their convergence rates with respect to both relative and absolute stationarity measures. Finally, we also establish the iteration complexity for achieving a (δ, ϵ)-approximate stationary point, based on a novel quantification of Goldstein stationarity via the GS gradient that could be of independent interest. Copyright © 2024, The Authors. All rights reserved.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

A Design of Hybrid Model and Bayesian Neural Networks for Smart Grid Stability Prediction 1

A Design of Hybrid Model and Bayesian Neural Networks for Sm...

引用

1st IEEE International Conference on Smart and Sustainable Developments in Electrical engineering, SSDEE 2025

作者： Hole, Shreyas Rajendra Kolluru, Vinothkumar Salotagi, Shreekant Challagundla, Yagnesh Mungara, Sudeep Sriramkumar, R. Dayananda Sagar University AI & ML Bangalore India Stevens Institute of Technology Department of Data Science HobokenNJ07030 United States Dayananda Sagar University Computer Science & Engineering Bagalore India Herbert Wertheim College of Engineering University of Florida Department of Computer Science GainesvilleFL32611 United States Stevens Institute of Technology Masters in Information Systems HobokenNJ07030 United States

ISBN: (纸本)9798331542108

The latest evolution in power systems, is 'smart grids'that offers real time monitoring, control features as well as effective management of renewable energy sources. Nonetheless, with the increase in the system complexity, the chances for insta- bility also increase and thus it is crucial to forecast the stability accurately for the safety of the grid. Weather it is in terms of Gradient Boosting Tree Algorithm or any other traditional algorithm, these machine learning models are successful in achieving the objectives of the task but they lack a forthcoming metric to assist in high stake situations, uncertainty quantification. The paper is devoted to the analysis of the reliability of smart grid systems based on Bayesian Neural Networks (BNN) taking into account both the reliability of predictive modeling and forecasting uncertainty. The smart grid stability augmented dataset was used to benchmark the efficacy of using BNNs or BNNs combined hybrid models, one with XGBoost, for feature extraction and the other with LightGBM. The present study shows that the BNN used with the above mentioned smart grid system achieved an accuracy of 92% with precision of 0.89, recall of 0.91 and F1 of 0.90. These metrics are appending with the help of the additional features of BNN where they are capable of addressing the key questions around uncertainty and thus the metrics confirming the predictions are quite strong in terms of real-time grid stability evaluation. This article encapsulates a detailed study of BNN architecture, the role of uncertainty in machine learning models and the natural application of such models in the design of dependable and fault-tolerant smart grids. © 2025 IEEE.

关键词： Smart power grids

来源：评论

学校读者我要写书评

暂无评论

HUSS: A Heuristic Method for Understanding the Semantic Structure of Spreadsheets

HUSS: A Heuristic Method for Understanding the Semantic Stru...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Xindong Wu Hao Chen Chenyang Bu Shengwei Ji Zan Zhang Victor S. Sheng Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Computer Science Texas Tech University Lubbock TX USA

Spreadsheets contain a lot of valuable data and have many practical applications. The key technology of these practical applications is how to make machines understand the semantic structure of spreadsheets, e.g., identifying cell function types and discovering relationships between cell pairs. Most existing methods for understanding the semantic structure of spreadsheets do not make use of the semantic information of cells. A few studies do, but they ignore the layout structure information of spreadsheets, which affects the performance of cell function classification and the discovery of different relationship types of cell pairs. In this paper, we propose a Heuristic algorithm for Understanding the Semantic Structure of spreadsheets (HUSS). Specifically, based on the existing cell function classification model [11], we propose five types of heuristic rules to extract four different types of cell pairs, based on the cell style and spatial location information. Our experimental results on two real-world datasets demonstrate that the proposed method HUSS can effectively understand the semantic structure of spreadsheets and outperforms corresponding baselines.

关键词： Analytical models Heuristic algorithms Semantics Layout Feature extraction Classification algorithms data mining

来源：评论

学校读者我要写书评

暂无评论

Facial Expression Recognition in the Wild using Artificial Rabbits Optimizer based Residual Neural Network

Facial Expression Recognition in the Wild using Artificial R...

引用

Advances in Computation, Communication and information Technology (ICAICCIT), International Conference on

作者： P S Metkewar N Uma Rajesh Kumar Dhanaraj Balasubramanian Prabhu Kavin Malathy Sathyamoorthy Symbiosis Institute of Computer Studies and Research (SICSR) Symbiosis International (Deemed University) (SIU) Pune Maharashtra India New Horizon College of Engineering Bengaluru Department of Data Science and Business Systems SRM Institute of Science and Technology Kattankulathur Chengalpattu India Department of Information Technology KPR Institute of Engineering and Technology Coimbatore India

In affective computing, emotion acknowledgement in the wild is a much-studied area. Although there have been advancements, the difficulty of emotion acknowledgement in the wild due to head movement, face deformation, illumination fluctuation, etc. remains an open subject. To improve the model's simplification ability and, by extension, its performance across a variety of learning tasks, it is crucial that a wide variety of features be extracted by the deep neural network. Interest in facial expression detection in natural settings has grown in recent years despite the difficulty of obtaining discriminative and informative characteristics from partially obscured photos. In the first stage of this paper's pre-processing, the noisy pictures are enhanced by Contrast Limited Adaptive Histogram Equalization (CLAHE). After that, Residual Neural Network (ResNet) features extraction is used, and the same method serves as an emotion classifier. An iterative technique called stochastic gradient descent (SGD) is utilized to refine the ResNet model's objective function. Finally, the Artificial Rabbits Optimization Algorithm (ARO) is used to choose the best value for, thereby enhancing the reliability of the categorization. The suggested method is effective, as evidenced by experimental findings on three popular facial expression recognition in-the-wild datasets: AffectNet, AFEW dataset, and RAF-DB, where it accomplishes state-of-the-art presentation with 96% accuracy and improves upon existing models by roughly 5% to 8%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Health information Broadcast Distributed Pattern Association based on Estimated Volume

Health Information Broadcast Distributed Pattern Association...

引用

Artificial Intelligence and Smart systems (ICAIS), International Conference on

作者： R. Dhanalakshmi A.V. Kalpana J. Umamageswaran B. Praveen Kumar Department of Computer Science and Engineering Saveetha School of Engineering Saveetha Institute of Medical and Technical Sciences Chennai Tamil Nadu India Department of Data Science and Business Systems SRM Institute of Science and Technology Kattankulathur Chennai Tamil Nadu India Department of Information Technology R.M.K Engineering College Chennai Tamil Nadu India Department of Computer Science and Engineering K L University Andhra Pradesh India

Any study on dataset and inadequate representation are featured in the conventional data mining process. Consequently, data mining findings reveal high chances of challenges and huge root-mean-square approximation errors besides long utilization. The proposed algorithm for associating distribution patterns in streams of medical data is based on density calculations. The distance approach will be utilized to identify any orphaned or questionable data within the data stream, and the gathering of medical data will be used to achieve the aim. data stream duplicates are compiled by sector match quality, and both the out-of-the-ordinary and the redundant data are eventually eliminated. The density of the information stream is then calculated based on histogram calculations. This investigates the flow of medical information from the viewpoints of concentration and dispersion, as well as the physical characteristics of information distribution, in combination with the results of data density estimate. The model is then built upon a neural network composite, the data distribution parameters in the clustering layer of the model are entered, and in-depth testing is carried out via the neural B.P. network (Back Propagation) on the mining layer of the model. Temporarily, all laws under the grouping of the hidden layer operation value besides the resulting output value are derived, and all rules under the grouping of the hidden layer value besides the conforming contribution value in the medical information stream pattern. The new findings show a curve of contour contiguous to the true curve of the likelihood density, a fair range of medical data dispersion and high medical data consistency, a lower probability of data redundancy, a low RMSEA for mining, a lower time for data recovery.

关键词： Histograms Neural networks Redundancy Approximation algorithms data models Classification algorithms data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：