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

SSRN 2023年

作者： Liu, Yanjie Yoshigoe, Kenji Ullah, Farhan Zhang, Shijin Zhao, Yue Shanghai Key Lab of Intelligent Manufacturing and Robotics School of Mechatronic Engineering and Automation Shanghai University Shanghai200444 China School of Software Northwestern Polytechnical University Xi’an710129 China Department of Electrical Engineering and Computer Science Embry-Riddle Aeronautical University Daytona BeachFL32114 United States

High-power continuous wave fiber laser cutting is a next-generation cutting technology for rapid prototyping and small-scale fabrication. To utilize the advantage offered by this technology in terms of high-quality cutting, the laser cutting process parameters must be optimized. In this study, separation speed experiment on thick mild steel plates was performed using a 12-kW continuous-wave multimode ytterbium-doped fiber laser, and a high-power fiber laser cutting cut-through criterion for thick carbon steel plates was proposed. The response surface method was used to model and optimize the cut quality characteristics. Material thickness, laser power, cutting speed, gas pressure, and defocus amount were selected as input factors, whereas kerf taper and material removal rate (MRR) were selected as output quality characteristics. The effects of the various factors on the kerf taper and MRR were investigated using analysis of variance, and second-order regression models were developed for the kerf taper and MRR. Furthermore, a multi-objective optimization method was used to optimize the kerf taper and MRR. The percentage errors of the validation experiments and multi-objective optimization results were 5.27% and 1.93% for the kerf taper and MRR, respectively. Moreover, the analysis revealed that the material removal mechanism and the kerf taper formation mechanism are related to the melt flow. The findings presented in this paper contribute to the improvement of quality and accuracy when cutting thick plates by using a high-power fiber laser. © 2023, The Authors. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

A Privacy Preserving Method for IoT Forensics

A Privacy Preserving Method for IoT Forensics

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Wenzheng Zhang Boxi Chen Xiao Fu Qing Gu Jin Shi Xiaojiang Du Xiaoyang Zhou State Key Laboratory for Novel Software Technology Nanjing University Nanjing China School of Information Management Nanjing University Nanjing China Department of Electrical and Computer Engineering Stevens Institute of Technology Hoboken NJ USA China Mobile Zijin(Jiangsu)Innovation Research Institute Nanjing China

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

The diversity of the Internet of Things (IoT) poses challenges to privacy protection, especially in the field of digital forensics. How to ensure that only the private information of the suspect is provided, and not the irrelevant information of other users is disclosed is crucial, especially when obtaining evidence in the complex IoT environment. To the best of our knowledge, there are few studies on protecting the privacy of irrelevant users in the IoT forensics. However, it is very important to ensure that the evidence does not violate the privacy of other users when collecting evidence, because it directly determines whether the evidence is legal and whether it can be admissible in court. In this paper, a new method based on data provenance graph is designed to solve the privacy protection problem of IoT forensics. The key idea of this method is to protect privacy by dividing multi-user information and protecting it from an encryption perspective. The method consists of three main phrases: distinguishing different users' data provenance graphs using traversal search, node abstraction, and hiding techniques, utilizing pseudo-random dual-key negotiation methods tailored for the scenario to enhance privacy protection for unrelated users, and employing identity authentication technology to facilitate better investigation and extraction of data provenance graph information of criminal accomplices in specific scenarios. Example proves that this method has practical significance and promising application prospects in protecting the privacy of unrelated users in IoT forensics while ensuring evidence accessibility in special criminal scenarios.

关键词： Privacy Data privacy Digital forensics Semantics Authentication Smart homes Encryption Internet of Things Protection Monitoring

来源：评论

学校读者我要写书评

暂无评论

Accelerating zk-SNARK with Group and Zone Optimization on GPU

Accelerating zk-SNARK with Group and Zone Optimization on GP...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Runnan Shen Liang Wang Haotian Luo Rui Yang Jinqian Yang Jinquan Wang Qiancheng Sun Limin Xiao Jin Dong State Key Laboratory of Complex Key Software Environment Beihang University Beijing China School of Computer Science and Engineering Beihang University Beijing China Shen Yuan Honors College Beihang University Beijing China Beijing Academy of Blockchain and Edge Computing (BABEC) Beijing China

Zero-knowledge proof (ZKP) is a popular cryptographic strategy for building a trusted environment, which can be applied to blockchain, electronic voting, and other scenarios. However, ZKP involves a number of computationally intensive operations that limit its widespread adoption in time-sensitive practical applications. The multi-scalar multiplication (MSM) dominates the computations and takes over 70% of the total computation time. This paper proposes a GPU-based acceleration method for ZKP by designing several optimization techniques for MSM. First, this paper constructs a formal mathematical formula of the Pippenger algorithm, which provides a theoretical optimization framework for MSM. Second, by parallelizing the prefix sum, the time complexity of the bucket reduction part of MSM is reduced from $\mathcal{O}\left( {3 \times {2^C}} \right)$ to $\mathcal{O}\left( {2 \times {2^C}} \right)$. Finally, this paper also analyzes the influence of group size on the final calculation time under different data scales and gives a suitable range of group sizes. Compared to the state-of-the-art method, our method can achieve 1.01× to 1.12× for throughput.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Reconfigurable Intelligence Surface Assisted Opportunistic Multiple Access in UAV-IoT Networks

引用

IEEE Internet of Things Journal 2025年

作者： Zhang, Xi-Ran Sun, Wen-Bin Zhang, Zhaolin Wang, Ling Gao, Ang Cheng, Nan Meng, Wei-Xiao Leung, Victor C. M. Northwestern Polytechnical University School of Electronics And Information Xi'an China Xidian University State Key Laboratory of ISN Xi'an710071 China Xidian University School of Cyber Engineering Xi'an710071 China Harbin Institute of Technology Communication Research Center Harbin150001 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China The University of British Columbia Department of Electrical and Computer Engineering VancouverBCV6T1Z4 Canada

Due to the advantages of flexible deployment and strong environmental adaptability of an unmanned aerial vehicle (UAV), UAVs serve as aerial base stations (BSs) to meet Quality of Services (QoSs) of ground users in internet of things (IoT) networks. NOMA (Non-Orthogonal Multiple Access) is a potential technique in wireless communications area, which can significantly improve sum spectrum efficiency (SE) of systems. To avoid the limitation of perfect CSI, opportunistic beamforming (OBF) is proposed, where a set of randomly generated weights is used to preprocess transmitted signals. Due to multiuser diversity gain introduced by OBF, OBF-NOMA systems can achieve approximate sum SE to conventional NOMA systems. Additionally, reconfigurable intelligent surfaces (RISs) are involved to overcome obstruction and obtain further improvements of SE. Therefore, this paper proposes a RIS-aid OBF-NOMA system in UAV-IoT networks, where random weights and opportunistic phase matrix are respectively applied in a UAV and RIS. Statistical characteristics of equivalent channels are derived in Nakagami-m (m≥1) fading channels. Theoretical asymptotic analyses of SE and bit error rate (BER) are then presented. Furthermore, a non-convex optimization problem is formulated to maximize SE. To obtain the optimal solution, we divide the problem into two sub-optimization problems and apply a joint iterative algorithm. Numerical results show that the proposed method achieves a satisfactory SE without complex channel estimation and perfect CSI. © 2014 IEEE.

关键词： Micro air vehicle (MAV)

来源：评论

学校读者我要写书评

暂无评论

How to Reduce Change Detection to Semantic Segmentation

arXiv

引用

arXiv 2022年

作者： Wang, Guo-Hua Gao, Bin-Bin Wang, Chenjie State Key Laboratory for Novel Software Technology Nanjing University China Youtu Lab Tencent China Department of Computer Science and Engineering Shanghai Jiao Tong University China

Change detection (CD) aims to identify changes that occur in an image pair taken different times. Prior methods devise specific networks from scratch to predict change masks in pixel-level, and struggle with general segmentation problems. In this paper, we propose a new paradigm that reduces CD to semantic segmentation which means tailoring an existing and powerful semantic segmentation network to solve CD. This new paradigm conveniently enjoys the mainstream semantic segmentation techniques to deal with general segmentation problems in CD. Hence we can concentrate on studying how to detect changes. We propose a novel and importance insight that different change types exist in CD and they should be learned separately. Based on it, we devise a module named MTF to extract the change information and fuse temporal features. MTF enjoys high interpretability and reveals the essential characteristic of CD. And most segmentation networks can be adapted to solve the CD problems with our MTF module. Finally, we propose C-3PO, a network to detect changes at pixel-level. C-3PO achieves state-of-the-art performance without bells and whistles. It is simple but effective and can be considered as a new baseline in this field. Our code is at https://***/Doctorkey/C-3PO. Copyright © 2022, The Authors. All rights reserved.

关键词： Change detection

来源：评论

学校读者我要写书评

暂无评论

Research on Microservice Architecture: A Tertiary Study

SSRN

引用

SSRN 2022年

作者： Liu, Xiaodong Li, Shanshan Zhang, He Zhong, Chenxing Wang, Yanze Waseem, Muhammad Babar, Muhammad Ali State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Software Institute Nanjing University Nanjing China School of Computer Science Wuhan University Wuhan China Centre for Research on Engineering Software Technologies School of Computer Science University of Adelaide Adelaide Australia Cyber Security Cooperative Research Centre Australia

Context: Microservices architecture (MSA) has gained its popularity for designing software systems. Migrating to MSA is a challenging task and requires comprehensive understanding and careful decisions. Objective: This study aims to characterize secondary studies in the field of MSA from two main points of view, i.e., the topics addressed and their findings, as well as the potential opportunities for the future research. Method: We conducted a tertiary study following the guideline of Kitchenham and collected data from secondary studies of MSA published by the end of 2021. Results: We identified 37 secondary studies in the domain of MSA, including systematic literature reviews and systematic mapping studies that address research questions. The topics addressed, the findings, and the research directions are analyzed in detail in terms of different phases of MSA lifecycle, i.e., Architectural Understanding and Analysis, Architectural Transformation, Architectural Implementation, and Architectural Maintenance and Evolution. Conclusion: Emerging topics require more in-depth research by primary and secondary researchers. Researchers are suggested to have more collaboration with industry and pay more attention to some domains as well as emerging technologies. Tertiary researchers may consider some new types of secondary study with quality control, for example, gray literature review or multivocal literature review. © 2022, The Authors. All rights reserved.

关键词： Quality control

来源：评论

学校读者我要写书评

暂无评论

GrabDAE: An Innovative Framework for Unsupervised Domain Adaptation Utilizing Grab-Mask and Denoise Auto-Encoder

arXiv

引用

arXiv 2024年

作者： Chen, Junzhou Wen, Xuan Zhang, Ronghui Ren, Bingtao Wu, Di Xu, Zhigang Wang, Danwei The Guangdong Provincial Key Laboratory of Intelligent Transport System School of Intelligent Systems Engineering Sun Yat-sen University Guangzhou510275 China The School of Transportation Science and Engineering Beihang University State Key Lab of Intelligent Transportation System Beijing100191 China The School of Computer Science and Engineering Sun Yat-sen University Guangzhou510006 China The Guangdong Key Laboratory of Big Data Analysis and Processing Guangdong510006 China The School of Information Engineering Chang’an University Shaanxi Xi’an710064 China The School of Electrical and Electronic Engineering Nanyang Technological University Singapore639798 Singapore

Unsupervised Domain Adaptation (UDA) aims to adapt a model trained on a labeled source domain to an unlabeled target domain by addressing the domain shift. Existing Unsupervised Domain Adaptation (UDA) methods often fall short in fully leveraging contextual information from the target domain, leading to suboptimal decision boundary separation during source and target domain alignment. To address this, we introduce GrabDAE, an innovative UDA framework designed to tackle domain shift in visual classification tasks. GrabDAE incorporates two key innovations: the Grab-Mask module, which blurs background information in target domain images, enabling the model to focus on essential, domain-relevant features through contrastive learning;and the Denoising Auto-Encoder (DAE), which enhances feature alignment by reconstructing features and filtering noise, ensuring a more robust adaptation to the target domain. These components empower GrabDAE to effectively handle unlabeled target domain data, significantly improving both classification accuracy and robustness. Extensive experiments on benchmark datasets, including VisDA-2017, OfficeHome, and Office31, demonstrate that GrabDAE consistently surpasses state-of-the-art UDA methods, setting new performance benchmarks. By tackling UDA’s critical challenges with its novel feature masking and denoising approach, GrabDAE offers both significant theoretical and practical advancements in domain adaptation. © 2024, CC BY-NC-SA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DANI-Net: Uncalibrated Photometric Stereo by Differentiable Shadow Handling, Anisotropic Reflectance Modeling, and Neural Inverse Rendering

arXiv

引用

arXiv 2023年

作者： Li, Zongrui Zheng, Qian Shi, Boxin Pan, Gang Jiang, Xudong School of Electrical and Electronic Engineering Nanyang Technological University Singapore The State Key Lab of Brain-Machine Intelligence Zhejiang University Hangzhou China College of Computer Science and Technology Zhejiang University Hangzhou China National Key Laboratory for Multimedia Information Processing School of Computer Science Peking University Beijing China National Engineering Research Center of Visual Technology School of Computer Science Peking University Beijing China

Uncalibrated photometric stereo (UPS) is challenging due to the inherent ambiguity brought by the unknown light. Although the ambiguity is alleviated on non-Lambertian objects, the problem is still difficult to solve for more general objects with complex shapes introducing irregular shadows and general materials with complex reflectance like anisotropic reflectance. To exploit cues from shadow and reflectance to solve UPS and improve performance on general materials, we propose DANI-Net, an inverse rendering framework with differentiable shadow handling and anisotropic reflectance modeling. Unlike most previous methods that use non-differentiable shadow maps and assume isotropic material, our network benefits from cues of shadow and anisotropic reflectance through two differentiable paths. Experiments on multiple real-world datasets demonstrate our superior and robust performance. Copyright © 2023, The Authors. All rights reserved.

关键词： Reflection

来源：评论

学校读者我要写书评

暂无评论

TraInterSim: Adaptive and Planning-Aware Hybrid-Driven Traffic Intersection Simulation

arXiv

引用

arXiv 2022年

作者： Lv, Pei Pei, Xinming Ren, Xinyu Zhang, Yuzhen Li, Chaochao Xu, Mingliang The School of Computer and Artificial Intelligence Zhengzhou University Zhengzhou China The State Key Laboratory of CAD&CG Zhejiang University Hangzhou China Network engineering Henan University China Computer science and technology The State Key Laboratory of CAD&CG Zhejiang University Hangzhou China Software engineering Zhengzhou University China Software engineering Henan Polytechnic University Jiaozuo China The School of Information Engineering Zhengzhou University Zhengzhou China

Traffic intersections are important scenes that can be seen almost everywhere in the traffic system. Currently, most simulation methods perform well at highways and urban traffic networks. In intersection scenarios, the challenge lies in the lack of clearly defined lanes, where agents with various motion plannings converge in the central area from different directions. Traditional model-based methods are difficult to drive agents to move realistically at intersections without enough predefined lanes, while data-driven methods often require a large amount of high-quality input data. Simultaneously, tedious parameter tuning is inevitable involved to obtain the desired simulation results. In this paper, we present a novel adaptive and planning-aware hybrid-driven method (TraInterSim) to simulate traffic intersection scenarios. Our hybrid-driven method combines an optimization-based data-driven scheme with a velocity continuity model. It guides the agent’s movements using real-world data and can generate those behaviors not present in the input data. Our optimization method fully considers velocity continuity, desired speed, direction guidance, and planning-aware collision avoidance. Agents can perceive others’ motion plannings and relative distances to avoid possible collisions. To preserve the individual flexibility of different agents, the parameters in our method are automatically adjusted during the simulation. TraInterSim can generate realistic behaviors of heterogeneous agents in different traffic intersection scenarios in interactive rates. Through extensive experiments as well as user studies, we validate the effectiveness and rationality of the proposed simulation method. © 2022, CC BY-NC-SA.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

A Generalized Hybrid Hoare Logic

arXiv

引用

arXiv 2023年

作者： Zhan, Naijun Jin, Xiangyu Zhan, Bohua Wang, Shuling Guelev, Dimitar School of Computer Science Peking University Institute of Software Chinese Academy of Sciences Beijing China State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences University of CAS Beijing China Huawei Technologies Co. Ltd. Beijing China National Key Laboratory of Space Integrated Information System Institute of Software Chinese Academy of Sciences University of CAS Beijing China Institute of Mathematics and Informatics Bulgarian Academy of Sciences Sofia Bulgaria

Deductive verification of hybrid systems (HSs) increasingly attracts more attention in recent years because of its power and scalability, where a powerful specification logic for HSs is the cornerstone. Often, HSs are naturally modelled by concurrent processes that communicate with each other. However, existing specification logics cannot easily handle such models. In this paper, we present a specification logic and proof system for Hybrid Communicating Sequential Processes (HCSP), that extends CSP with ordinary differential equations (ODE) and interrupts to model interactions between continuous and discrete evolution. Because it includes a rich set of algebraic operators, complicated hybrid systems can be easily modelled in an algebra-like compositional way in HCSP. Our logic can be seen as a generalization and simplification of existing hybrid Hoare logics (HHL) based on duration calculus (DC), as well as a conservative extension of existing Hoare logics for concurrent programs. Its assertion logic is the first-order theory of differential equations (FOD), together with assertions about traces recording communications, readiness, and continuous *** prove continuous relative completeness of the logic w.r.t. FOD, as well as discrete relative completeness in the sense that continuous behaviour can be arbitrarily approximated by discretization. Finally, we implement the above logic in Isabelle/HOL, and apply it to verify two case studies to illustrate the power and scalability of our logic. Copyright © 2023, The Authors. All rights reserved.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：