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

Proceedings of the 29th USENIX Conference on Security Symposium

作者： Bin Yuan Yan Jia Luyi Xing Dongfang Zhao XiaoFeng Wang Deqing Zou Hai Jin Yuqing Zhang School of Cyber Science and Engineering Huazhong Univ. of Sci. & Tech. China and National Engineering Research Center for Big Data Technology and System Cluster and Grid Computing Lab Services Computing Technology and System Lab and Big Data Security Engineering Research Center and Indiana University Bloomington and Shenzhen Huazhong University of Science and Technology Research Institute China School of Cyber Engineering Xidian University China and National Computer Network Intrusion Protection Center University of Chinese Academy of Sciences China and Indiana University Bloomington Indiana University Bloomington School of Cyber Science and Engineering Huazhong Univ. of Sci. & Tech. China and National Engineering Research Center for Big Data Technology and System Cluster and Grid Computing Lab Services Computing Technology and System Lab and Big Data Security Engineering Research Center School of Computer Science and Technology Huazhong Univ. of Sci. & Tech. China and National Engineering Research Center for Big Data Technology and System Cluster and Grid Computing Lab Services Computing Technology and System Lab and Big Data Security Engineering Research Center Huazhong Univ. of Sci. & Tech. China National Computer Network Intrusion Protection Center University of Chinese Academy of Sciences China and School of Cyber Engineering Xidian University China

ISBN: (纸本)9781939133175

IoT clouds facilitate the communication between IoT devices and users, and authorize users' access to their devices. In this paradigm, an IoT device is usually managed under a particular IoT cloud designated by the device vendor, e.g., Philips bulbs are managed under Philips Hue cloud. Today's mainstream IoT clouds also support device access delegation across different vendors (e.g., Philips Hue, LIFX, etc.) and cloud providers (e.g., Google, IFTTT, etc.): for example, Philips Hue and SmartThings clouds support to delegate device access to another cloud such as Google Home, so a user can manage multiple devices from different vendors all through Google Home. Serving this purpose are the IoT delegation mechanisms developed and utilized by IoT clouds, which we found are heterogeneous and ad-hoc in the wild, in the absence of a standardized delegation protocol suited for IoT environments. In this paper, we report the first systematic study on real-world IoT access delegation, based upon a semi-automatic verification tool we developed. Our study brought to light the pervasiveness of security risks in these delegation mechanisms, allowing the adversary (e.g., Airbnb tenants, former employees) to gain unauthorized access to the victim's devices (e.g., smart locks) or impersonate the devices to trigger other devices. We confirmed the presence of critical security flaws in these mechanisms through end-to-end exploits on them, and further conducted a measurement study. Our research demonstrates the serious consequences of these exploits and the security implications of the practice today for building these mechanisms. We reported our findings to related parties, which acknowledged the problems. We further propose principles for developing more secure cross-cloud IoT delegation services, before a standardized solution can be widely deployed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A study on the differences of attitude learning and learning behavior sequences for university computer MOOC+ SPOC Course 15

A study on the differences of attitude learning and learning...

引用

15th International Conference on Computer science and Education, ICCSE 2020

作者： Changhua, Zhao Chunqiao, Mi Huaihua University School of Computer Science and Engineering Huaihua418000 China Key Laboratory of Wuling-Mountain Health Big Data Intelligent Processing and Application Hunan Province Universities Huaihua Hunan418000 China Key Lab. of Intelligent Contr. Technol. for Wuling-Mountain Ecological Agriculture in Hunan Province Huaihua Hunan418000 China

ISBN: (纸本)9781728172675

The outbreak of COVID-19 make University Computer MOOC+SPOC course face opportunities and challenges. There are some problems in MOOC+SPOC course teaching, such as learners' curiosity decreasing, lack of accomplishment and etc. In order to deal with these problems, this study explores the correlation and differences in the learning behavior sequences of learners with different attitudes to high happiness, medium happiness, and low happiness. Through the learners' comments on University Computer MOOC+SPOC course, the learner's attitude information is tapped. By analyzing learning behavior sequences, this study finds out the degree of learning behavior change of learners with different attitudes. The result of this study can improve the existing University Computer MOOC+SPOC instructional design and promote the learning mode to move towards intelligent personalized adaptive learning. © 2020 IEEE.

关键词： Curricula

来源：评论

学校读者我要写书评

暂无评论

Accelerating exploitation and integration of global renewable energy

引用

Innovation 2025年

作者： Wang, Jianxiao Chen, Xinjiang Zhuang, Minghao Li, Yan Ruan, Ziwen Wang, Yuhan Zhang, Ning Song, Jie He, Kebin Lu, Xi National Engineering Laboratory for Big Data Analysis and Applications Peking University Beijing100871 China Department of Industrial Engineering and Management College of Engineering Peking University Beijing100871 China Peking University Ordos Research Institute of Energy Ordos017000 China State Key Laboratory of Nutrient Use and Management College of Resources and Environmental Sciences China Agricultural University Beijing100193 China College of Environmental Science and Engineering Tongji University Shanghai200092 China School of Environment State Key Joint Laboratory of Environment Simulation and Pollution Control Tsinghua University Beijing100084 China State Key Lab of Power Systems Department of Electrical Engineering Tsinghua University Beijing100084 China Institute for Carbon Neutrality Tsinghua University Beijing100084 China

来源：评论

学校读者我要写书评

暂无评论

How generative Artificial Intelligence can transform drug discovery?

引用

European Journal of Medicinal Chemistry 2025年 295卷 117825页

作者： Jusoh, Ainin Sofia Remli, Muhammad Akmal Mohamad, Mohd Saberi Cazenave, Tristan Fong, Chin Siok Institute for Artificial Intelligence and Big Data Universiti Malaysia Kelantan Kota Bharu Kelantan 16100 Malaysia Faculty of Data Science and Computing Universiti Malaysia Kelantan Kota Bharu Kelantan 16100 Malaysia Health Data Science Lab Department of Genetics and Genomics College of Medical and Health Sciences United Arab Emirates University Al Ain 15551 United Arab Emirates Faculty of Engineering and Technology Multimedia University Melaka 75450 Malaysia Department of Biosystems Engineering Faculty of Agricultural Technology Universitas Brawijaya East Java Malang 65145 Indonesia LAMSADE Université Paris Dauphine - PSL Paris France UKM Medical Molecular Biology Institute (UMBI) Kuala Lumpur 56000 Malaysia

Generative Artificial Intelligence (Generative AI) is transforming drug discovery by enabling advanced analysis of complex biological and chemical data. This review explores key Generative AI models, including Generative Adversarial Networks (GANs), Variational Autoencoders (VAEs), flow-based models and Transformer-based models, with Transformers gaining prominence due to the abundance of text-based biological data and the success of language models like ChatGPT. The paper discusses molecular representations, performance evaluation metrics, and current trends in Generative AI-driven drug discovery, such as protein-protein interactions (PPIs), drug-target interactions (DTIs) and de-novo drug design. However, these approaches face significant challenges, including applicability domain issues, lack of interpretability, data scarcity, novelty, scalability, computational resource limitations, and the absence of standardized evaluation metrics. These challenges hinder model performance, complicate decision-making, and limit the generation of novel and viable drug candidates. To address these issues, strategies such as hybrid models, integration of multiomics datasets, explainable AI (XAI) techniques, data augmentation, transfer learning, and cloud-based solutions are proposed. Additionally, a curated list of databases supporting drug discovery research is provided. The review concludes by emphasizing the need for optimized AI models, robust validation methods, interdisciplinary collaboration, and future academic efforts to fully realize the potential of Generative AI in advancing drug discovery. © 2025 Elsevier Masson SAS

关键词： database Drug discovery Drug-target interactions Generative artificial Intelligence Molecules representations Performance metrics Protein-protein interactions

来源：评论

学校读者我要写书评

暂无评论

Adversarial Learning with Cost-Sensitive Classes

arXiv

引用

arXiv 2021年

作者： Shen, Haojing Chen, Sihong Wang, Ran Wang, Xizhao Big Data Institute College of Computer Science and Software Engineering Guangdong Key Lab. of Intelligent Information Processing Shenzhen University Guangdong Shenzhen518060 China The College of Mathematics and Statistics Shenzhen University Shenzhen518060 China The Shenzhen Key Laboratory of Advanced Machine Learning and Applications Shenzhen University Shenzhen518060 China

It is necessary to improve the performance of some special classes or to particularly protect them from attacks in adversarial learning. This paper proposes a framework combining cost-sensitive classification and adversarial learning together to train a model that can distinguish between protected and unprotected classes, such that the protected classes are less vulnerable to adversarial examples. We find in this framework an interesting phenomenon during the training of deep neural networks, called Min-Max property, that is, the absolute values of most parameters in the convolutional layer approach zero while the absolute values of a few parameters are significantly larger becoming bigger. Based on this Min-Max property which is formulated and analyzed in a view of random distribution, we further build a new defense model against adversarial examples for adversarial robustness improvement. An advantage of the built model is that it performs better than the standard one and can combine with adversarial training to achieve an improved performance. It is experimentally confirmed that, regarding the average accuracy of all classes, our model is almost as same as the existing models when an attack does not occur and is better than the existing models when an attack occurs. Specifically, regarding the accuracy of protected classes, the proposed model is much better than the existing models when an attack occurs. © 2021, CC BY.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Refining BERT embeddings for document hashing via mutual information maximization

arXiv

引用

arXiv 2021年

作者： Ou, Zijing Su, Qinliang Yu, Jianxing Zhao, Ruihui Zheng, Yefeng Liu, Bang School of Computer Science and Engineering Sun Yat-sen University Guangzhou China School of Artificial Intelligence Sun Yat-sen University Guangdong China Tencent Jarvis Lab Rali & Mila Université de Montréal Guangdong Key Lab. of Big Data Analysis and Processing Guangzhou China Key Lab. of Machine Intelligence and Advanced Computing Ministry of Education China

Existing unsupervised document hashing methods are mostly established on generative models. Due to the difficulties of capturing long dependency structures, these methods rarely model the raw documents directly, but instead to model the features extracted from them (e.g. bag-of-words (BOW), TFIDF). In this paper, we propose to learn hash codes from BERT embeddings after observing their tremendous successes on downstream tasks. As a first try, we modify existing generative hashing models to accommodate the BERT embeddings. However, little improvement is observed over the codes learned from the old BOW or TFIDF features. We attribute this to the reconstruction requirement in the generative hashing, which will enforce irrelevant information that is abundant in the BERT embeddings also compressed into the codes. To remedy this issue, a new unsupervised hashing paradigm is further proposed based on the mutual information (MI) maximization principle. Specifically, the method first constructs appropriate global and local codes from the documents and then seeks to maximize their mutual information. Experimental results on three benchmark datasets demonstrate that the proposed method is able to generate hash codes that outperform existing ones learned from BOW features by a substantial margin. Copyright © 2021, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Temporal data fusion at the edge

Temporal data fusion at the edge

引用

2019 IEEE International Conferences on Ubiquitous Computing and Communications and data science and Computational Intelligence and Smart Computing, Networking and Services, IUCC/DSCI/SmartCNS 2019

作者： Yang, Linfu Liu, Bin School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Jiangsu Key Lab of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781728152097

As an enabler technique, data fusion has gained great attention in the context of Internet of things (IoT). In traditional settings, data fusion is done at the cloud server. So the data to be fused should be transferred from the sensor nodes to the cloud server before data fusion. Such an application mode of data fusion inherits disturbing concerns from the cloud computing framework, e.g., privacy-leaking, large latency between data capture and computation, excessive ingress bandwidth consumption. We take into account how to do temporal data fusion at the edge to bypass the above issues. We present a Gaussian process based temporal data fusion (GPTDF) method targeted for the problem of sequential online prediction at the edge. The GPTDF method fits the edge computing framework and thus inherits desirable properties from edge computing, such as privacy-preserving, low latency between data capture and computation, and tiny bandwidth consumption. Through a real-data experiment using archived traffic datasets from the Caltrans Performance Measurement System (PeMS), we demonstrate that the application of GPTDF can provide more timely and accurate real-time predictions at the network edge. © 2019 IEEE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Fashion Editing With Adversarial Parsing Learning

Fashion Editing With Adversarial Parsing Learning

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Haoye Dong Xiaodan Liang Yixuan Zhang Xujie Zhang Xiaohui Shen Zhenyu Xie Bowen Wu Jian Yin School of Data and Computer Science Sun Yat-sen University Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou P.R. China School of Intelligent Systems Engineering Sun Yat-sen University Petuum Inc. ByteDance AI Lab

ISBN: (数字)9781728171685

ISBN: (纸本)9781728171692

Interactive fashion image manipulation, which enables users to edit images with sketches and color strokes, is an interesting research problem with great application value. Existing works often treat it as a general inpainting task and do not fully leverage the semantic structural information in fashion images. Moreover, they directly utilize conventional convolution and normalization layers to restore the incomplete image, which tends to wash away the sketch and color information. In this paper, we propose a novel Fashion Editing Generative Adversarial Network (FE-GAN), which is capable of manipulating fashion images by free-form sketches and sparse color strokes. FE-GAN consists of two modules: 1) a free-form parsing network that learns to control the human parsing generation by manipulating sketch and color; 2) a parsing-aware inpainting network that renders detailed textures with semantic guidance from the human parsing map. A new attention normalization layer is further applied at multiple scales in the decoder of the inpainting network to enhance the quality of the synthesized image. Extensive experiments on high-resolution fashion image datasets demonstrate that the proposed FE-GAN significantly outperforms the state-of-the-art methods on fashion image manipulation.

关键词： Image color analysis Semantics Convolution Colored noise Feature extraction Task analysis Neural networks

来源：评论

学校读者我要写书评

暂无评论

Weakly supervised learning for textbook question answering

TechRxiv

引用

TechRxiv 2021年

作者： Ma, Jie Chai, Qi Huang, Jingyue Liu, Jun You, Yang Zheng, Qinghua National Engineering Lab for Big Data Analytics School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech. R&D School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China The High Performance Computing for Artificial intelligence Lab Department of Computer Science National University of Singapore 117417 Singapore

Textbook Question Answering (TQA) is the task of answering diagram and non-diagram questions given large multimodal contexts consisting of abundant text and diagrams. Deep text understandings and effective learning of diagram semantics are important for this task due to its specificity. In this paper, we propose a Weakly Supervised learning method for TQA (WSTQ), which regards the incompletely accurate results of essential intermediate procedures for this task as supervision to develop Text Matching (TM) and Relation Detection (RD) tasks and then employs the tasks to motivate itself to learn strong text comprehension and excellent diagram semantics respectively. Specifically, we apply the result of text retrieval to build positive as well as negative text pairs. In order to learn deep text understandings, we first pre-train the text understanding module of WSTQ on TM and then fine-tune it on TQA. We build positive as well as negative relation pairs by checking whether there is any overlap between the items/regions detected from diagrams using object detection. The RD task forces our method to learn the relationships between regions, which are crucial to express the diagram semantics. We train WSTQ on RD and TQA simultaneously, i.e., multitask learning, to obtain effective diagram semantics and then improve the TQA performance. Extensive experiments are carried out on CK12-QA and AI2D to verify the effectiveness of WSTQ. Experimental results show that our method achieves significant accuracy improvements of 5.02% and 4.12% on test splits of the above datasets respectively than the current state-of-the-art baseline. We have released our code on https://***/dr-majie/WSTQ. © 2021, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A novel parameter for nonequilibrium analysis in reconstructed state spaces

arXiv

引用

arXiv 2021年

作者： Yao, Wenpo Yao, Wenli Wang, Jun School of Geographic and Biologic Information Smart Health Big Data Analysis and Location Services Engineering Lab of Jiangsu Province Nanjing University of Posts and Telecommunications Jiangsu Nanjing210023 China School of Life Science and Technology University of Electronic Science and Technology of China Chengdu611731 China Department of hydraulic engineering School of civil engineering Tsinghua University Beijing100084 China

Kernel methods are widely used for probability estimation by measuring the distribution of low-passed vector distances in reconstructed state spaces. However, the information conveyed by the vector distances that are greater than the threshold has received little attention. In this paper, we consider the probabilistic difference of the kernel transformation in reconstructed state spaces, and derive a novel nonequilibrium descriptor by measuring the fluctuations of the vector distance with respect to the tolerance. We verify the effectiveness of the proposed kernel probabilistic difference using three chaotic series (logistic, Henon, and Lorenz) and a first-order autoregressive series according to the surrogate theory, and we use the kernel parameter to analyze real-world heartbeat data. In the heartbeat analysis, the kernel probabilistic difference, particularly that based on the Kullback–Leibler divergence, effectively characterizes the physiological complexity loss related to reduced cardiac dynamics in the elderly and diseased heartbeat data. Overall, the kernel probabilistic difference provides a novel method for the quantification of nonequilibria by characterizing the fluctuation theorem in reconstructed state spaces, and enables reliable detection of cardiac physiological and pathological information from heart rates. Copyright © 2021, The Authors. All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：