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

16th International Conference on Digital Image Processing, ICDIP 2024

作者： Zhang, Qian Ran, Yaqin Luo, Di Xu, Kaili Shi, Jilaing School of Data Science and Information Engineering GuiZhou MinZu University Guiyang550025 China Guizhou Key Laboratory of Pattern Recognition and Intelligent System Guiyang550025 China

ISBN: (数字)9781510682917

ISBN: (纸本)9781510682900

It's very meaningful to conduct the driver to the parking space available in the parking lot clearly and accurately by computer vision and computational intelligence. While it is an extremely difficult task, because of the scene complexity in the parking lot. In this paper, a new computational intelligence technology is proposed to detect parking spaces available in the parking lot outdoor based on fusing of Region Convolution Neural Network (RCNN) and random forests (RF), and we called it as RCNN-RF. Within the RCNN-RF, a new activation function is design. And with the help of random forests, RCNN-RF overcomes scene complexity includes illumination, weather, and slight occlusion successfully. Extensive experimental results on the benchmark dataset named PKLot and the self-built dataset named GZMU-LOT outperform those of the state-of-the-art, and it shows the superiority of our proposed RCNN-RF method. © 2024 SPIE.

关键词： Random forests

来源：评论

学校读者我要写书评

暂无评论

MTSS: multi-path traffic scheduling mechanism based on SDN

引用

Journal of systems Engineering and Electronics 2019年第5期30卷 974-984页

作者： XU Xiaolong CHEN Yun HU Liuyun KUMAR Anup Jiangsu Key Laboratory of Big Data Security&Intelligent Processing Nanjing University of Posts and TelecommunicationsNanjing 210023China Institute of Big Data Research at Yancheng Nanjing University of Posts and TelecommunicationsYancheng 224000China School of Computer Science Nanjing University of Posts and TelecommunicationsNanjing 210023China Department of Computer Engineering and Computer Science University of LouisvilleLouisville KY40292USA

Large-scale and diverse businesses based on the cloud computing platform bring the heavy network traffic to cloud data ***,the unbalanced workload of cloud data center network easily leads to the network congestion,the low resource utilization rate,the long delay,the low reliability,and the low *** order to improve the utilization efficiency and the quality of services(QoS)of cloud system,especially to solve the problem of network congestion,we propose MTSS,a multi-path traffic scheduling mechanism based on software defined networking(SDN).MTSS utilizes the data flow scheduling flexibility of SDN and the multi-path feature of the fat-tree structure to improve the traffic balance of the cloud data center network.A heuristic traffic balancing algorithm is presented for MTSS,which periodically monitors the network link and dynamically adjusts the traffic on the heavy link to achieve programmable data forwarding and load *** experimental results show that MTSS outperforms equal-cost multi-path protocol(ECMP),by effectively reducing the packet loss rate and *** addition,MTSS improves the utilization efficiency,the reliability and the throughput rate of the cloud data center network.

关键词： cloud data center software defined networking(SDN) load balancing multi-path transmission OpenFlow

来源：评论

学校读者我要写书评

暂无评论

An adaptive flow table adjustment algorithm for SDN 21

An adaptive flow table adjustment algorithm for SDN

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on data Science and systems, HPCC/SmartCity/DSS 2019

作者： Xu, Xiaolong Hu, Liuyun Lin, Haowei Fan, Zexuan School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781728120584

SDN (Software-defined networking) are important for current network systems, such as cloud systems. The characteristics of flow in SDN and the impact of flow table entries and controllers on data packet transmission are analyzed. We propose an adaptive flow table adjustment algorithm for SDN called CFC (Combine flow table and controller). It is important for CFC to monitor the network traffic in real time. According to the proportion of active flow entries in the OpenFlow switch, the value of idle-timeout will be set dynamically based on the characteristics of different data flows. When the switch forwards packets, it will minimize the calculation load of controller, and allocate a reasonable value of idle-timeout to the idle flow table entries. So it can delete discarded flow table entries in time and improve the hit rate of data packets. The experiments show that the utilization rate of the flow table resource is enhanced. With the improvement of data packets' forwarding rate, the average throughput of the network has also increased. At the same time, it can also cope with the burst traffic in SDN and ensure them to be forwarded normally and effectively. © 2019 IEEE.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

Distributed optimization strategy for multi-region power scheduling based on alternating direction method of multipliers 12

Distributed optimization strategy for multi-region power sch...

引用

12th World Congress on intelligent Control and Automation, WCICA 2016

作者： Sun, Chenlin Wu, Jiang Gao, Feng Guan, Xiaohong State Key Laboratory for Manufacturing System Engineering of xi'An Jiaotong University Xi'an710049 China Ministry of Education Key Lab for Intelligent Networks and Networks Security of xi'An Jiaotong University Xi'an710049 China

ISBN: (纸本)9781467384148

The large-scale and frequent cross-regional electricity allocations bring about the critical need to coordinate multi-region power scheduling. It is recognized that each sub-systems' taking charge of own scheduling makes the ideal centralized optimization method infeasible. In this paper, a distributed optimization strategy based on alternating direction method of multipliers (ADMM) is put forward to solve this problem. The strategy can achieve optimal solution of global power system as the ideal centralized optimization method does, by adding steps of information exchange and iterations of decision variables to subsystems' independent scheduling. The distributed bid cost minimization model with a price-wise constant bidding curve is built to describe the multi-region scheduling problem as precisely as possible. To suit the distributed model, the standard ADMM is improved, by expanding the size of sub-systems, adding inequality constraints, and considering the complex coupling relationship between sub-systems. This coordinating strategy uses the framework of augmented Lagrangian to decompose the scheduling problem into a distributed scheduling model for regional power grid, achieving global optimal solution by updating decision variables of each sub-system and Lagrange multipliers with mapping of sub-system information. Simulations on IEEE 30 system are conducted to show the computational performance and solution quality of the proposed method. © 2016 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Learning Disentangled Latent Factors for Individual Treatment Effect Estimation Using Variational Generative Adversarial Nets 25

Learning Disentangled Latent Factors for Individual Treatmen...

引用

25th IEEE International Conference on Computer Supported Cooperative Work in Design, CSCWD 2022

作者： Bao, Qingsen Mao, Zeyong Chen, Lei Nanjing University of Posts and Telecommunications School of Computer Science Nanjing China Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing China

ISBN: (纸本)9781665405270

Estimating individual treatment effect (ITE) is a challenging task due to the need for individual potential outcomes to be learned from biased data and counterfactuals are inherently unobservable. Some researchers propose to use generative adversarial approaches to infer the counterfactual outcomes based on the distribution of factual outcomes. However, these methods assume that complete confounding factors are observed, and simply treat all observed variables as confounding factors, ignoring identification of possible instrumental factors and adjustment factors, which will bring large deviation to ITE estimation when facing biased data. To address these issues, we propose a novel Variational Generative Adversarial Nets for ITE estimation by designing the collaborative learning strategy with Variational AutoEncoder (VAE) and Generative Adversarial Nets (GAN). Specifically, we employ VAE to infer the latent representations of observed variables to access complete latent factors while using GAN to infer unseen counterfactual outcomes and guide VAE for disentangling these latent factors into three sets corresponding to the instrumental, confounding, and adjustment factors. Then the disentangled latent confounding factors can be used to further control data bias using an adaptive weighting scheme. Extensive experiments on real and synthetic data demonstrate learning disentangled latent factors for ITE estimation is effective, and our method has excellent performance even with high data bias. © 2022 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

A First Look at LLM-powered Smartphones 39

A First Look at LLM-powered Smartphones

引用

39th ACM/IEEE International Conference on Automated Software Engineering Workshops, ASEW 2024

作者： Wu, Liangxuan Zhao, Yanjie Wang, Chao Liu, Tianming Wang, Haoyu Huazhong University of Science and Technology Wuhan China Huazhong University of Science and Technology Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering China

ISBN: (纸本)9798400712494

The integration of Large Language Models (LLMs) into edge devices such as smartphones represents a significant leap in mobile technology, promising enhanced user experiences and novel functionalities. This paper presents a first look at LLM-powered smartphones, addressing four key aspects: the current market landscape, core functions enabled by integrated LLMs, potential security risks, and user perceptions. The findings reveal a rapidly evolving market with major manufacturers competing to integrate LLMs, innovative features that improve user interaction, significant security challenges, and mixed user perceptions that balance enthusiasm for new capabilities with privacy concerns. This study contributes to understanding LLM integration in mobile devices and its implications for users, manufacturers, and the broader technological landscape. © 2024 ACM.

关键词： Smartphones

来源：评论

学校读者我要写书评

暂无评论

A Client Selection Method Based on Loss Function Optimization for Federated Learning

引用

Computer Modeling in Engineering & Sciences 2023年第10期137卷 1047-1064页

作者： Yan Zeng Siyuan Teng Tian Xiang Jilin Zhang Yuankai Mu Yongjian Ren Jian Wan School of Computer Science and Technology Hangzhou Dianzi UniversityHangzhou310018China Key Laboratory of Complex System Modeling and Simulation Ministry of EducationHangzhou310018China Zhejiang Engineering Research Center of Data Security Governance Hangzhou310018China Intelligent Robotics Research Center Zhejiang LabHangzhou311100China HDU-ITMO Joint Institute Hangzhou Dianzi UniversityHangzhou310018China

Federated learning is a distributedmachine learningmethod that can solve the increasingly serious problemof data islands and user data privacy,as it allows training data to be kept locally and not shared with other *** trains a globalmodel by aggregating locally-computedmodels of clients rather than their ***,the divergence of local models caused by data heterogeneity of different clients may lead to slow convergence of the global *** this problem,we focus on the client selection with federated learning,which can affect the convergence performance of the global model with the selected local *** propose FedChoice,a client selection method based on loss function optimization,to select appropriate local models to improve the convergence of the global *** firstly sets selected probability for clients with the value of loss function,and the client with high loss will be set higher selected probability,which can make them more likely to participate in ***,it introduces a local control vector and a global control vector to predict the local gradient direction and global gradient direction,respectively,and calculates the gradient correction vector to correct the gradient direction to reduce the cumulative deviationof the local gradient causedby *** experiments to verify the validity of FedChoice on CIFAR-10,CINIC-10,MNIST,EMNITS,and FEMNIST datasets,and the results show that the convergence of FedChoice is significantly improved,compared with FedAvg,FedProx,and FedNova.

关键词： Federated learning model aggregation Non-IID

来源：评论

学校读者我要写书评

暂无评论

TSC-ECFA:A Trusted Service Composition Scheme for Edge Cloud 27

TSC-ECFA:A Trusted Service Composition Scheme for Edge Cloud

引用

27th IEEE International Conference on Parallel and Distributed systems, ICPADS 2021

作者： Jiang, Yu Xu, Xiaolong Lin, Kunda Duan, Weihua Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781665408783

In order to select a composition scheme that meets user's needs and high performance from large-scale web services in the edge cloud, this paper proposes a trusted service composition optimization scheme called TSC-ECFA for edge cloud, which applies the predation strategy to the firefly algorithm (FA) and divides the services with the same input and output into one category, reducing the number of combinations to search for feasible solutions. The cotangent chaos theory is used to generate the initial firefly population and disturb the location of the individual to improve the overall search efficiency of FA. This paper also improves the step factor and attractiveness formula of FA to give full play to the detection ability of the step factor in the early stage of the algorithm, and balance the local search and the global search. Considering that the QoS attribute values of the service are vulnerable to be tampered with, the blockchain is used to store the QoS attribute values to ensure the tamper-proof and reliability of the QoS attribute value. Finally, simulation experiments compare the number of iterations and optimization of the three algorithms. The experimental results show that the comprehensive performance of TSC-ECFA is better than other algorithms. © 2021 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Maximum likelihood estimation based on random subspace EDA: Application to extrasolar planet detection 11th

Maximum likelihood estimation based on random subspace EDA: ...

引用

11th International Conference on Simulated Evolution and Learning, SEAL 2017

作者： Liu, Bin Chen, Ke-Jia School of Computer Science Nanjing University of Posts and Telecommunications NanjingJiangsu210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing NanjingJiangsu210023 China

ISBN: (纸本)9783319687582

This paper addresses maximum likelihood (ML) estimation based model fitting in the context of extrasolar planet detection. This problem is featured by the following properties: (1) the candidate models under consideration are highly nonlinear;(2) the likelihood surface has a huge number of peaks;(3) the parameter space ranges in size from a few to dozens of dimensions. These properties make the ML search a very challenging problem, as it lacks any analytical or gradient based searching solution to explore the parameter space. A population based searching method, called estimation of distribution algorithm (EDA), is adopted to explore the model parameter space starting from a batch of random locations. EDA is featured by its ability to reveal and utilize problem structures. This property is desirable for characterizing the detections. However, it is well recognized that EDAs can not scale well to large scale problems, as it consists of iterative random sampling and model fitting procedures, which results in the well-known dilemma curse of dimensionality. A novel mechanism to perform EDAs in interactive random subspaces spanned by correlated variables is proposed and the hope is to alleviate the curse of dimensionality for EDAs by performing the operations of sampling and model fitting in lower dimensional subspaces. The effectiveness of the proposed algorithm is verified via both benchmark numerical studies and real data analysis. © Springer International Publishing AG 2017.

关键词： Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

APDPk-means: A new differential privacy clustering algorithm based on arithmetic progression privacy budget allocation 21

APDPk-means: A new differential privacy clustering algorithm...

引用

作者： Fan, Zexuan Xu, Xiaolong Jiangsu Key Laboratory of Big Data Security AND Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781728120584

How to protect users' private data during network data mining has become a hot issue in the fields of big data and network information security. Most current researches on differential privacy k-means clustering algorithms focus on optimizing the selection of initial centroids. However, the traditional privacy budget allocation has the problem that the random noise becomes too large as the number of iterations increases, which will reduce the performance of data clustering. To solve the problem, we improved the way of privacy budget allocation in differentially private clustering algorithm DPk-means, and proposed APDPk-means, a new differential privacy clustering algorithm based on arithmetic progression privacy budget allocation. APDPk-means decomposes the total privacy budget into a decreasing arithmetic progression, allocating the privacy budgets from large to small in the iterative process, so as to ensure the rapid convergence in early iteration. The experiment results show that compared with the other differentially private k-means algorithms, APDPk-means has better performance in availability and quality of the clustering result under the same level of privacy protection. © 2019 IEEE.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：