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

ASBSO: An improved brain storm optimization with flexible search length and memory-based selection

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Yu, Yang Gao, Shangce Wang, Yirui Cheng, Jiujun Todo, Yuki The Faculty of Engineering University of Toyama Toyama930-8555 Japan Key Laboratory of Embedded System and Service Computing Ministry of Education Department of Computer Science and Technology Tongji University Shanghai200092 China The School of Electrical and Computer Engineering Kanazawa University Kanazawa-shi920-1192 Japan

Brain storm optimization (BSO) is a newly proposed population-based optimization algorithm which uses a logarithmic sigmoid transfer function to adjust its search range during the convergent process. However, this adjustment only varies with the current iteration number, and lacks of flexibility and variety which makes a poor search efficiency and robustness of BSO. To alleviate this problem, an adaptive step length structure together with a success memory selection strategy are proposed to be incorporated into BSO. This proposed method, adaptive step length based on memory selection BSO, namely ASBSO, applies multiple step lengths to modify the generation process of new solutions, thus supplying a flexible search according to corresponding problems and convergent periods. The novel memory mechanism which is capable of evaluating and storing the degree of improvements of solutions is used to determine the selection possibility of step lengths. A set of 57 benchmark functions are used to test ASBSO's search ability, and four real-world problems are adopted to show its application value. All these test results indicate the remarkable improvement in solution quality, scalability and robustness of ASBSO. Copyright © 2021, The Authors. All rights reserved.

关键词： Swarm intelligence

Finite time convergence of pinning synchronization with a single nonlinear controller

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Chen, Tianping Lu, Wenlian Liu, Xiwei The School of Computer Sciences/Mathematics Fudan University Shanghai200433 China The Centre for Computational Systems Biology School of Mathematical Sciences Fudan University China Department of Computer Science and Technology Tongji University The Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai200092 China

An Automated Feature Engineering Method for Online Payment Fraud Detection

学校读者我要写书评

暂无评论

Jisuanji Xuebao/Chinese Journal of Computers 2020年第10期43卷 1983-2001页

作者： Wang, Cheng Wang, Chang-Qi Department of Computer Science and Technology School of Electronics and Information Engineering Tongji University Shanghai201804 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China Shanghai Institute of Intelligent Science and Technology Tongji University Shanghai200092 China

Internet finance fraud is an increasingly serious social and economic problem. Online payment services (OPSs) are the typical models of Internet finance, and the fraudulent transaction in OPSs is also a typical fraud pattern. The method of identifying fraudulent transactions by constructing a fraud detection model based on machine learning has become a promising idea for online payment anti-fraud. In the process of constructing fraud detection models, the feature engineering is the most critical step. It is also one of the most time-consuming and specialized steps in the relevant area. In the study of feature engineering, the existing online payment fraud detection models are mainly carried out by experts in the form of manual construction based on business knowledge. However, there are many fraud scenarios in OPSs where the process of feature construction is so different. Artificial feature construction methods can no longer meet the increasing demand of anti-fraud. An important way to solve this problem is to automate feature engineering. In the field of Internet financial anti-fraud, the expressibility and interpretability of features play a pivotal role. It is helpful to understand the original source fields and their construction process of important features. This is useful for mining and analyzing the characteristics of fraud methods and follow-up improvement rules engines. These are of great significance for fraud detection models. Therefore, the interpretability of the model method is particularly important. Usually, the optimization of detection accuracy is carried out under the premise of ensuring interpretability. This paper proposed a lightweight, tree-structure, high efficiency and scalable automatic feature engineering method for fraud detection of online payment. The method is as follows: (1) The method has low requirements on the calculation conditions and little dependence on the dataset samples. To realize this advantage, it used the tree structur

关键词： Feature extraction

Base station network traffic prediction approach based on LMA-DeepAR

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zhang, Jiachen Zuo, Xingquan Xu, Mingying Han, Jing Zhang, Baisheng Key Laboratory of Trustworthy Distributed Computing and Service Ministry of Education Beijing Uinversity of Posts and Telecommunications Beijing China Key Laboratory of Intelligent Telecommunication Software and Multimedia Beijing Uinversity of Posts and Telecommunications Beijing China Network Interface Virtualization Shanghai System Design Deptment Zhongxing Telecommunication Equipment Corporation Shanghai China

Accurate network traffic prediction of base station cell is very vital for the expansion and reduction of wireless devices in base station cell. The burst and uncertainty of base station cell network traffic makes the network traffic nonlinear and non-stationary, which brings challenges to the long-term prediction of network traffic. In this paper, the traffic model LMA-DeepAR for base station network is established based on DeepAR. Acordding to the distribution characteristics of network traffic, this paper proposes an artificial feature sequence calculation method based on local moving average (LMA). The feature sequence is input into DeepAR as covariant, which makes the statistical characteristics of network traffic near a period of time in the past be considered when updating parameters, and the interference of non-stationary network traffic on model training will be reduced. Experimental results show that the proposed prediction approach (LMA-DeepAR) outperforms other methods in the overall long-term prediction performance and stability of multi cell network traffic. Copyright © 2021, The Authors. All rights reserved.

关键词： Base stations

Conditional GANs with Auxiliary Discriminative Classifier

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Hou, Liang Cao, Qi Shen, Huawei Pan, Siyuan Li, Xiaoshuang Cheng, Xueqi Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Shanghai Jiao Tong University Shanghai China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

Conditional generative models aim to learn the underlying joint distribution of data and labels to achieve conditional data generation. Among them, the auxiliary classifier generative adversarial network (AC-GAN) has been widely used, but suffers from the problem of low intra-class diversity of the generated samples. The fundamental reason pointed out in this paper is that the classifier of AC-GAN is generator-agnostic, which therefore cannot provide informative guidance for the generator to approach the joint distribution, resulting in a minimization of the conditional entropy that decreases the intra-class diversity. Motivated by this understanding, we propose a novel conditional GAN with an auxiliary discriminative classifier (ADC-GAN) to resolve the above problem. Specifically, the proposed auxiliary discriminative classifier becomes generator-aware by recognizing the class-labels of the real data and the generated data discriminatively. Our theoretical analysis reveals that the generator can faithfully learn the joint distribution even without the original discriminator, making the proposed ADC-GAN robust to the value of the coefficient hyperparameter and the selection of the GAN loss, and stable during training. Extensive experimental results on synthetic and real-world datasets demonstrate the superiority of ADC-GAN in conditional generative modeling compared to state-of-the-art classifier-based and projection-based conditional GANs. Copyright © 2021, The Authors. All rights reserved.

关键词： Generative adversarial networks

Qoe-Aware Edge Server Placement in Mobile Edge computing Using an Enhanced Genetic Algorithm

学校读者我要写书评

暂无评论

SSRN

SSRN 2025年

作者： Sha, Jinxiang Wu, Jintao Wang, Mingliang Pu, Yonglin Lu, Sheng Bilal, Muhammad School of Computer Science and Technology Nanjing University of Information Science and Technology Jiangsu Nanjing210044 China Yunnan Key Laboratory of Service Computing Yunnan University of Finance and Economics Yunnan Kunming650221 China State Key Laboratory for Novel Software Technology Nanjing University Jiangsu Nanjing210023 China School of Computing and Communications Lancaster University LancasterLA1 4WA United Kingdom

Mobile Edge computing (MEC) enhances service quality by decentralizing computational resources to network edges, thereby reducing latency and improving Quality of service (QoS). However, the spatial distribution of edge servers critically impacts network transmission efficiency, while heterogeneous user perceptions of QoS metrics frequently lead to suboptimal Quality of Experience (QoE). Current research on Edge Server Placement (ESP) predominantly focuses on localized optimization of QoS metrics, yet fails to adequately incorporate systematic QoE modeling and coordinated optimization frameworks, leading to significant discrepancies between actual user experience and satisfaction with resource allocation. To address this gap, this study establishes a formalized QoE-aware Edge Server Placement (EESP) framework by rigorously characterizing the interdependence between QoE and QoS. We first prove the NP-completeness of the EESP problem through computational complexity analysis. Subsequently, we develop an Integer Linear Programming-based exact solver (EESP-O) for small-scale scenarios and propose an Enhanced Genetic Algorithm (EESP-EGA) for large-scale deployments. The EESP-EGA integrates adaptive crossover probability mechanisms and elite retention strategies to achieve near-optimal solutions for complex real-world configurations. Experimental evaluations conducted on a broad range of real-world datasets demonstrate that the proposed method outperforms several existing representative approaches in terms of QoE. © 2025, The Authors. All rights reserved.

关键词： Genetic algorithms

CODH++: Macro-semantic differences oriented instance segmentation network

学校读者我要写书评

暂无评论

Expert systems with Applications 2022年 202卷 1页

作者： Zhang, Wenchao Fu, Chong Cao, Lin Sham, Chiu-Wing School of Computer Science and Engineering Northeastern University Shenyang110819 China Engineering Research Center of Security Technology of Complex Network System Ministry of Education China Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Northeastern University Shenyang110819 China School of Information and Communication Engineering Beijing Information Science and Technology University Beijing100101 China School of Computer Science The University of Auckland New Zealand

With the idea of divide and rule, there exist two different forms of semantic features flowing in the two stage instance segmentation paradigms. They are the global features at the image level and the instance features at the region-wise. The most significant distinction of the two macro-semantic morphological features lies in the different relevance of neighborhood features caused by background noise. Hence, we should consider different situations and make different schemes. Notice that the fields-of-view determines the range of local features that can be perceived in the convolution operation and implies the representation capability of the network. To this end, for FPN and Mask Head in two stage paradigms, we propose a more efficient methodology with Group-Inception and Asymmetric-Inception modules. This proposed methodology can act as a drop-in replacement to upgrade the plain convolution operation, which enables the network to look more via modeling long-range dependencies. Our method is simple yet effective. Quantitatively, we can significantly improve the state-of-the-art frameworks, including Mask R-CNN, Mask Scoring R-CNN, Cascade Mask R-CNN, and HTC by about 1.2%–2.2% AP on MS COCO test-dev yet with fewer parameters and FLOPs. Moreover, the proposed approach achieves competitive performances on the Scapes, KINS and SBD datasets. The source code of our method will be made available. © 2022 Elsevier Ltd

关键词： Semantics

Learning how to avoiding obstacles for end-to-end driving with conditional imitation learning 2

学校读者我要写书评

暂无评论

Learning how to avoiding obstacles for end-to-end driving wi...

2nd International Conference on Signal Processing and Machine Learning, SPML 2019

作者： Zhang, Enwei Zhou, Hongtu Ding, Yongchao Zhao, Junqiao Ye, Chen Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University School of Electronics and Information Engineering Shanghai China

ISBN: (纸本)9781450372213

Obstacle avoiding is one of the most complex tasks for autonomous driving systems, which was also ignored by many cutting-edge end-to-end learning-based methods. The difficulties stem from the integrated process of detection and interpretation of environment and obstacles and generation of proper behaviors. We make the use of CARLA, a simulator for autonomous driving research, and collect massive human drivers' reactions to obstacles on road subjecting to given driving commands, i.e. follow, go straight, turn left and turn right for about 6 hours. A behavior-Cloning neural network architecture is proposed with the modified loss that enlarge the effects of errors for steer, which indicates the benefit to high an accuracy. We found the data augmentation of the image is crucial to the training of the proposed network. And a reasonable limit allows avoiding unexpected stop. The experiments demonstrate 3 obstacle avoidance cases: for the same type as the training dataset, other automobile and two-wheeled vehicles. Finally, the CARLA benchmark is also tested. © 2019 Association for computing Machinery.

关键词： Autonomous vehicles

Variable petri nets for mobility

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Ding, Zhijun Yang, Ru Cui, Puwen Zhou, MengChu Jiang, Changjun Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China Department of Computer Science and Technology Tongji University Shanghai201804 China Institute of Systems Engineering Macau University of Science and Technology Macau999078 China Department of Electrical and Computer Engineering New Jersey Institute of Technology NewarkNJ07102 United States

Mobile computing systems, service-based systems and some other systems with mobile interacting components have recently received much attention. However, because of their characteristics such as mobility and disconnection, it is difficult to model and analyze them by using a structure-fixed model. This work proposes a new Petri net model called Variable Petri Net (VPN) for modeling and analyzing these systems. The definition, firing rule, and related analysis technology of VPN are introduced in detail. In a VPN, the possible interaction interfaces are abstracted as a new kind of places called virtual places, and the occurrences of (dis)connections are described by new functions, which makes it appropriate to describe the component collaboration in systems and realize the scalability and pluggability of systems. Moreover, to overcome the shortcoming that markings cannot reflect link capability of a system, VPNs add a constraint function along with a marking to represent a complete system configuration. Several examples are used to demonstrate the newly proposed model and method. Copyright © 2021, The Authors. All rights reserved.

关键词： Embedded systems