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

IEEE International Conference on Cyber Security and Cloud computing (CSCloud)

作者： Peng Che Zhenlian Peng Buqing Cao Jianxun Liu Tieping Chen Runqing Fan School of Computer Science and Engineering Hunan Provincial Key Laboratory for Services Computing and Novel Software Technology Hunan University of Science and Technology Xiangtan China School of Physical Education Hunan University of Science and Technology Xiangtan China

In recent years, the physical health status of college students have been attached by the country and all universities. Much effort is spent every year to conduct physical health tests, generating a large amount of physical fitness data. Due to some irresistible reasons, such as entering incorrect data or students being unable to participate in some physical fitness programs, missing data exists in the physical fitness test, and the calculation of total points according to the existing rules of weighted summation may lead to inaccurate classification of some students grades. To this end, a classification method based on physical fitness test data with missing items is proposed in this paper. Firstly, the method collects the raw data set and constructs a structured data set. Then, the MLP method is used to construct a classifier model to classify the test data set with missing items. Finally, compared experiments are conducted with the training model constructed by GaussianNB, SVM and XGBoost and the results show that the classification effect of MLP is excellent, and the accuracy of classification can reach 93.29 %.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Behavioral Authentication for Security and Safety

arXiv

引用

arXiv 2023年

作者： Wang, Cheng Tang, Hao Zhu, Hangyu Zheng, Junhan Jiang, Changjun Department of Computer Science and Technology Tongji University Shanghai201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China Shanghai Artificial Intelligence Laboratory Shanghai200232 China

The issues of both system security and safety can be dissected integrally from the perspective of behavioral appropriateness. That is, a system is secure or safe can be judged by whether the behavior of certain agent(s) is appropriate or not. Specifically, a so-called appropriate behavior involves the right agent performing the right actions at the right time under certain conditions. Then, according to different levels of appropriateness and degrees of custodies, behavioral authentication can be graded into three levels, i.e., the authentication of behavioral Identity, Conformity, and Benignity. In a broad sense, for the security and safety issue, behavioral authentication is not only an innovative and promising method due to its inherent advantages but also a critical and fundamental problem due to the ubiquity of behavior generation and the necessity of behavior regulation in any system. By this classification, this review provides a comprehensive examination of the background and preliminaries of behavioral authentication. It further summarizes existing research based on their respective focus areas and characteristics. The challenges confronted by current behavioral authentication methods are analyzed, and potential research directions are discussed to promote the diversified and integrated development of behavioral authentication. Copyright © 2023, The Authors. All rights reserved.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

On the Expressive Power of Behavior Structure

arXiv

引用

arXiv 2023年

作者： Wang, Cheng Zhu, Hangyu Lin, Yuhang Jiang, Changjun Department of Computer Science and Technology Tongji University Shanghai201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China Shanghai Artificial Intelligence Laboratory Shanghai200232 China

Efforts toward a comprehensive description of behavior have indeed facilitated the development of representation-based approaches that utilize deep learning to capture behavioral information. As behavior complexity increases, the expressive power of these models reaches a bottleneck. We coin the term "behavioral molecular structure" and propose a new model called the Behavioral Molecular Structure (BMS). The model characterizes behaviors at the atomic level, analogizes behavioral attributes to atoms, and concretizes interrelations at the granularity of atoms using graphs. Here, we design three different downstream tasks to test the performance of the BMS model on public datasets. Additionally, we provide a preliminary theoretical analysis demonstrating that the BMS can offer effective expressiveness for complex behaviors. Copyright © 2023, The Authors. All rights reserved.

关键词： Atoms

来源：评论

学校读者我要写书评

暂无评论

Towards Survivable In-Memory Stores with Parity Coded NVRAM

Towards Survivable In-Memory Stores with Parity Coded NVRAM

引用

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Zhixuan Wang Guangping Xu Hongzhang Yang Yulei Wu School of Computer Science and Engineering Tianjin University of Technology Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin China Key Laboratory of Computer Vision and System Ministry of Education China Faculty of Engineering University of Bristol Bristol U.K.

ISBN: (数字)9798350381993

ISBN: (纸本)9798350382006

Erasure codes have been widely applied to in-memory key-value storage systems for high reliability and low redundancy. In distributed in-memory key-value storage systems, update operations are relatively frequent, especially the partial-stripe update, which makes data update more challenging. Recently, existing research has been based on appending logs to accelerate parity data write. However, its logs are stored on disks, which decreases the system performance significantly. Therefore, we propose a novel in-memory key-value storage architecture, DNVPL, which utilizes NVRAM to log parity data. Our main idea is to design an appending-only update scheme to tradeoff the memory cost and the update overhead. We implement DNVPL with an in-memory key-value storage prototype, called LogKV. We evaluate it with different workloads. The experiments show that our scheme achieves high update performance from different metrics. Our scheme can reduce update latency by up to 49% and save storage space by 48% compared to the state-of-the-art schemes.

关键词： Privacy Nonvolatile memory system performance Redundancy Random access memory Prototypes Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Joint Edge Aggregation and Association for Cost-Efficient Multi-Cell Federated Learning

Joint Edge Aggregation and Association for Cost-Efficient Mu...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Tao Wu Yuben Qu Chunsheng Liu Yuqian Jing Feiyu Wu Haipeng Dai Chao Dong Jiannong Cao National University of Defense Technology China Key Laboratory of Dynamic Cognitive System of Electromagnetic Spectrum Space Nanjing University of Aeronautics and Astronautics China State Key Laboratory for Novel Software Technology Nanjing University China Department of Computing The Hong Kong Polytechnic University Hong Kong

Federated learning (FL) has been proposed as a promising distributed learning paradigm to realize edge artificial intelligence (AI) without revealing the raw data. Nevertheless, it would incur inevitable costs in terms of training latency and energy consumption, due to periodical communication between user equipments (UEs) and the geographically remote central parameter server. Thus motivated, we study the joint edge aggregation and association problem to minimize the total cost, where the model aggregation over multiple cells just happens at the network edge. After proving its hardness with complex coupled variables, we transform it into a set function optimization problem and prove the objective function is neither submodular nor supermodular, which further complicates the problem. To tackle this difficulty, we first split it into multiple edge association subproblems, where the optimal solution to the computation resource allocation can be efficiently obtained in the closed form. We then construct a substitute function with the supermodularity and provable upper bound. On this basis, we reformulate an equivalent set function minimization problem under a matroid base constraint. We then propose an approximation algorithm to the original problem based on the two-stage search strategy with theoretical performance guarantee. Both extensive simulations and field experiments are conducted to validate the effectiveness of our proposed solution.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Predictive Resilience Assessment of Road Networks Based on Dynamic Multi-Granularity Graph Neural Network

SSRN

引用

SSRN 2024年

作者： Zang, Di Ding, Yongjie Zhao, Jiayi Tang, Keshuang Zhu, Hong Key Laboratory of Embedded System and Service Computing Ministry of Educaiton Department of Computer Science and Technology Tongji University No. 4800 Cao’an Road Shanghai China Key Laboratory of Road and Traffic Engineering Ministry of Education College of Transportation Engineering Tongji University No. 4800 Cao’an Road Shanghai China

Due to the influence of global climate anomalies, abnormal weather conditions such as heavy rainfall have become more frequent in recent years, posing a significant threat to the operation of transportation systems. An effective assessment of the resilience of the transportation system before and during heavy rain can alert the transportation department to take necessary emergency actions. However, existing methods for assessing the rainfall resilience of transportation networks mostly suffer from the following problems: 1) Simulation methods for modeling rainfall impacts lack realism;2) After-the-fact evaluations of resilience cannot offer advance warning prior to or during a heavy rain event. To address above problems, we present a novel resilience assessment methodology for evaluating the resilience of road networks in real-time during heavy rainfall scenarios. In this methodology, we propose the temporal decomposition-based dynamic multi-granularity graph neural network (TD2MG2NN) for long-term traffic speed forecasting, providing a perspective on the future evolution of traffic states for accurate resilience assessment. In addition, we construct a composite traffic resilience indicator, designed to comprehensively reflect changes in the spatial-temporal resilience of the transportation system during heavy rain. Experimental results on four publicly real datasets indicate that the prediction performance of TD2MG2NN outperforms state-of-the-art models. The assessment results for the transportation road network in California demonstrate that the comprehensive resilience indicator is superior to single functional resilience indicator and the real-time methodology for evaluating resilience can accurately depict and predict the operation of the road network system under heavy rainfall scenarios. © 2024, The Authors. All rights reserved.

关键词： Roads and streets

来源：评论

学校读者我要写书评

暂无评论

Detecting and Exploiting Unit Commitment Structures in MIPs 6

Detecting and Exploiting Unit Commitment Structures in MIPs

引用

6th International Conference on Power and Energy technology, ICPET 2024

作者： Su, Zhao-Gang Chen, Sheng-Jie Li, Yu-Fei Chen, Liang Kou, Caixia Cai, Zhi Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China Institute of Applied Mathematics Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China College of Sciences Beijing University of Posts and Telecommunications Beijing China Beijing Key Laboratory of Research and System Evaluation of Power Dispatching Automation Technology China Electric Power Research Institute Beijing China

ISBN: (纸本)9798350375855

The unit commitment (UC) problem has been extensively researched in the literature, which is typically formulated as a mixed integer programming (MIP) problem. However, current studies lack effective methods to identify potential UC problem structures within a general MIP problem, making it challenging to leverage well-established valid inequalities for UC problems to accelerate the solution process. In this paper, we present a novel detection method that automatically identifies UC structures within an MIP problem by analyzing the relationships between variables and constraints. Moreover, we enhance the MIP formulation by incorporating three well-studied classes of valid inequalities as cutting planes, based on the identified UC structures. Our experiments demonstrate that our proposed UC detection method greatly improves computational efficacy of a standard MIP solver compared to the default setting. © 2024 IEEE.

关键词： Mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

BHJO: A Novel Hybrid Metaheuristic Algorithm Combining the Beluga Whale, Honey Badger, and Jellyfish Search Optimizers for Solving Engineering Design Problems

引用

Computer Modeling in Engineering & Sciences 2024年第10期141卷 219-265页

作者： Farouq Zitouni Saad Harous Abdulaziz S.Almazyad Ali Wagdy Mohamed Guojiang Xiong Fatima Zohra Khechiba Khadidja Â Kherchouche Department of Computer Science and Information Technology Kasdi Merbah UniversityP.O.Box 30000OuarglaAlgeria Department of Computer Science College of Computing and InformaticsUniversity of SharjahP.O.Box 27272SharjahUnited Arab Emirates Department of Computer Engineering College of Computer and Information SciencesKing Saud UniversityP.O.Box 51178Riyadh11543Saudi Arabia Operations Research Department Faculty of Graduate Studies for Statistical ResearchCairo UniversityGiza12613Egypt Applied Science Research Center Applied Science Private UniversityAmman11937Jordan Guizhou Key Laboratory of Intelligent Technology in Power System College of Electrical EngineeringGuizhou UniversityGuiyang550025China

Hybridizing metaheuristic algorithms involves synergistically combining different optimization techniques to effectively address complex and challenging optimization *** approach aims to leverage the strengths of multiple algorithms,enhancing solution quality,convergence speed,and robustness,thereby offering a more versatile and efficient means of solving intricate real-world optimization *** this paper,we introduce a hybrid algorithm that amalgamates three distinct metaheuristics:the Beluga Whale Optimization(BWO),the Honey Badger Algorithm(HBA),and the Jellyfish Search(JS)*** proposed hybrid algorithm will be referred to as *** this fusion,the BHJO algorithm aims to leverage the strengths of each *** this hybridization,we thoroughly examined the exploration and exploitation capabilities of the BWO,HBA,and JS metaheuristics,as well as their ability to strike a balance between exploration and *** meticulous analysis allowed us to identify the pros and cons of each algorithm,enabling us to combine them in a novel hybrid approach that capitalizes on their respective strengths for enhanced optimization *** addition,the BHJO algorithm incorporates Opposition-Based Learning(OBL)to harness the advantages offered by this technique,leveraging its diverse exploration,accelerated convergence,and improved solution quality to enhance the overall performance and effectiveness of the hybrid ***,the performance of the BHJO algorithm was evaluated across a range of both unconstrained and constrained optimization problems,providing a comprehensive assessment of its efficacy and applicability in diverse problem ***,the BHJO algorithm was subjected to a comparative analysis with several renowned algorithms,where mean and standard deviation values were utilized as evaluation *** rigorous comparison aimed to assess the performance of the BHJOalgorithmabout its counterparts,shedd

关键词： Global optimization hybridization of metaheuristics beluga whale optimization honey badger algorithm jellyfish search optimizer chaotic maps opposition-based learning

来源：评论

学校读者我要写书评

暂无评论

Towards High-resolution 3D Anomaly Detection via Group-Level Feature Contrastive Learning 24

Towards High-resolution 3D Anomaly Detection via Group-Level...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Zhu, Hongze Xie, Guoyang Hou, Chengbin Dai, Tao Gao, Can Wang, Jinbao Shen, Linlin National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Computer Science City University of Hong Kong Hong Kong Hong Kong Department of Intelligent Manufacturing CATL Ningde China Fuzhou Fuyao Institute for Advanced Study Fuyao University of Science and Technology Fuzhou China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China

ISBN: (纸本)9798400706868

High-resolution point clouds (HRPCD) anomaly detection (AD) plays a critical role in precision machining and high-end equipment manufacturing. Despite considerable 3D-AD methods that have been proposed recently, they still cannot meet the requirements of the HRPCD-AD task. There are several challenges: i) It is difficult to directly capture HRPCD information due to large amounts of points at the sample level;ii) The advanced transformer-based methods usually obtain anisotropic features, leading to degradation of the representation;iii) The proportion of abnormal areas is very small, which makes it difficult to characterize. To address these challenges, we propose a novel group-level feature-based network, called Group3AD, which has a significantly efficient representation ability. First, we design an Intercluster Uniformity Network (IUN) to present the mapping of different groups in the feature space as several clusters, and obtain a more uniform distribution between clusters representing different parts of the point clouds in the feature space. Then, an Intracluster Alignment Network (IAN) is designed to encourage groups within the cluster to be distributed tightly in the feature space. In addition, we propose an Adaptive Group-Center Selection (AGCS) based on geometric information to improve the pixel density of potential anomalous regions during inference. The experimental results verify the effectiveness of our proposed Group3AD, which surpasses Reg3D-AD by the margin of 5% in terms of object-level AUROC on Real3D-AD. We provide the code and supplementary information on our website: https://***/M-3LAB/Group3AD. © 2024 ACM.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Upper Bounds on Lifetime of Three Dimensional Extended UWB Sensor Networks*

引用

Chinese Journal of Electronics 2023年第2期19卷 307-312页

作者： Juan Xu Changjun Jiang Aihuang Guo Yongfa Hong Shu Li Cheng Wang School of Electronics and Information Engineering Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing of the Ministry of Education Tongji University Shanghai China College of Information Science and Engineering Shandong University of Science and Technology Qingdao China

The upper bounds on lifetime of three dimensional extended Time hopping impulse radio Ultrawide band (TH-IR UWB) sensor networks are derived using percolation theory arguments. The TH-IR UWB sensor network consists of $n$ sensor nodes distributed in a cube of edge length $n^{1/3}$ according to a Poisson point process of unit intensity. It is shown that for such a static three dimensional extended TH-IR UWB sensor network, the upper bound on the lifetime is of order $O(n^{-1})$ , while in the ideal case, the upper bound on the lifetime is longer than that of a static network by a factor of $n^{2/3}$ . Therefore sensor nodes moving randomly in the deployment area can improve the upper bound on network lifetime. The results also reveal that the upper bounds on network lifetime decrease with the number of nodes $n$ , thus extended TH-IR UWB sensor networks aren't prone to be employed in large-scale network.

关键词： Wireless communication Wireless sensor networks Upper bound Protocols

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：