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

A proof-of-majority consensus protocol for blockchain-enabled collaboration infrastructure of 5G network slice brokers 2

A proof-of-majority consensus protocol for blockchain-enable...

引用

2nd ACM International Symposium on Blockchain and Secure Critical Infrastructure, BSCI 2020, Co-located with AsiaCCS 2020

作者： Lin, Wenmin Xu, Xiaolong Qi, Lianyong Zhang, Xuyun Dou, Wanchun Khosravi, Mohammad R. Institute of VR and Intelligent Systems Alibaba Business School Hangzhou Normal University Hangzhou China Nanjing University of Information and Technology Nanjing China Qufu Normal University Rizhao China Department of Computing Macquarie University Sydney Australia State Key Laboratory of Novel Software Department of Computer Science and Technology Nanjing University Nanjing China Department of Electrical and Electronic Engineering Shiraz University of Technology Shiraz Department of Computer Engineering Persian Gulf University Bushehr Iran

ISBN: (纸本)9781450376105

With network slicing technology, 5G changes the classical mobile network business model from a network-operator-oriented business to a more open system with multiple stakeholders. In this context, a network slice broker plays the role of agency between network resource providers and vertical service providers, to lease and provide on-demand network slice services. In practice, a single network slice broker normally owns limited types of network slices. And a collaboration infrastructure could be built up to enable network slice sharing among multiple network slice brokers, so as to improve user experience, and enhance the resource utilization rate. However, a major challenge with such an infrastructure is how to support fair and secure slice trading process among multiple un-trusted network slice providers. Blockchain technology, on the other side, brings in high opportunities to implement a fair and secure trading system without a trusted third-party. In view of this observation, this paper proposes a design of blockchain-enabled collaboration infrastructure for network slice brokers, where a group of registered brokers can trade their network slices in a fair and secure manner. To enhance the accountability of slice trading records, transactions are verified and sorted by each broker node, which are further packed into blocks and appended to a shared ledger maintained by each member in the collaboration network. More specifically, we design a Proof-of-Majority (PoM) consensus protocol to sort slice trading transactions before packing transaction blocks of the shared ledger. Furthermore, an optimization for the basic PoM protocol is discussed, with dependency resolving strategy to improve system performance. Experiments are conducted to verify the feasibility of our proposal. © 2020 ACM.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

Bias-corrected peaks-over-threshold estimation of the CVaR

arXiv

引用

arXiv 2021年

作者： Troop, Dylan Godin, Frédéric Yu, Jia Yuan Department of Computer Science and Software Engineering Concordia University Montreal Canada Department of Mathematics and Statistics Concordia University Montreal Canada Concordia Institute of Information Systems Engineering Concordia University Montreal Canada Quantact Actuarial and Financial Mathematics Laboratory Montreal Canada

The conditional value-at-risk (CVaR) is a useful risk measure in fields such as machine learning, finance, insurance, energy, etc. When measuring very extreme risk, the commonly used CVaR estimation method of sample averaging does not work well due to limited data above the value-at-risk (VaR), the quantile corresponding to the CVaR level. To mitigate this problem, the CVaR can be estimated by extrapolating above a lower threshold than the VaR using a generalized Pareto distribution (GPD), which is often referred to as the peaks-over-threshold (POT) approach. This method often requires a very high threshold to fit well, leading to high variance in estimation, and can induce significant bias if the threshold is chosen too low. In this paper, we derive a new expression for the GPD approximation error of the CVaR, a bias term induced by the choice of threshold, as well as a bias correction method for the estimated GPD parameters. This leads to the derivation of a new estimator for the CVaR that we prove to be asymptotically unbiased. In a practical setting, we show through experiments that our estimator provides a significant performance improvement compared with competing CVaR estimators in finite samples. As a consequence of our bias correction method, it is also shown that a much lower threshold can be selected without introducing significant bias. This allows a larger portion of data to be be used in CVaR estimation compared with the typical POT approach, leading to more stable estimates. As secondary results, a new estimator for a second-order parameter of heavy-tailed distributions is derived, as well as a confidence interval for the CVaR which enables quantifying the level of variability in our estimator. Copyright © 2021, The Authors. All rights reserved.

关键词： Value engineering

来源：评论

学校读者我要写书评

暂无评论

SRBench++: Principled Benchmarking of Symbolic Regression With Domain-Expert Interpretation

引用

IEEE Transactions on Evolutionary Computation 2024年 1-1页

作者： de Franca, F.O. Virgolin, M. Kommenda, M. Majumder, M.S. Cranmer, M. Espada, G. Ingelse, L. Fonseca, A. Landajuela, M. Petersen, B. Glatt, R. Mundhenk, N. Lee, C.S. Hochhalter, J.D. Randall, D.L. Kamienny, P. Zhang, H. Dick, G. Simon, A. Burlacu, B. Kasak, Jaan Machado, Meera Wilstrup, Casper Cavaz, W.G.L. Federal University of ABC Santo Andre Brazil Evolutionary Intelligence group Centrum Wiskunde and Informatica Science Park Amsterdam Netherlands University of Applied Sciences Upper Austria Hagenberg Austria Computational Health Informatics Program Boston Children’s Hospital Harvard Medical School Boston USA Center for Computational Astrophysics Flatiron Institute and Department of Astrophysical Sciences of Princeton University USA LASIGE Faculdade de Ciências Universidade de Lisboa Lisboa Portugal Computational Engineering Division Lawrence Livermore National Laboratory Livermore USA Department of Mechanical Engineering University of Utah Utah USA Meta FAIR France Victoria University of Wellington School of Engineering and Computer Science New Zealand University of otago Department of Information Science New Zealand Institut für Angewandte Physik Universität TübingenMax Planck Institute for Intelligent Systems Tübingen Germany Abzu AI Orient Plads 1 Nordhavn Denmark

Symbolic regression searches for analytic expressions that accurately describe studied phenomena. The main promise of this approach is that it may return an interpretable model that can be insightful to users, while maintaining high accuracy. The current standard for benchmarking these algorithms is SRBench, which evaluates methods on hundreds of datasets that are a mix of real-world and simulated processes spanning multiple domains. At present, the ability of SRBench to evaluate interpretability is limited to measuring the size of expressions on real-world data, and the exactness of model forms on synthetic data. In practice, model size is only one of many factors used by subject experts to determine how interpretable a model truly is. Furthermore, SRBench does not characterize algorithm performance on specific, challenging sub-tasks of regression such as feature selection and evasion of local minima. In this work, we propose and evaluate an approach to benchmarking SR algorithms that addresses these limitations of SRBench by 1) incorporating expert evaluations of interpretability on a domain-specific task, and 2) evaluating algorithms over distinct properties of data science tasks. We evaluate 12 modern symbolic regression algorithms on these benchmarks and present an in-depth analysis of the results, discuss current challenges of symbolic regression algorithms and highlight possible improvements for the benchmark itself. Authors

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Corrections to “An Ensemble Hybrid Framework: A Comparative Analysis of Metaheuristic Algorithms for Ensemble Hybrid CNN Features for Plants Disease Classification”

引用

IEEE Access 2025年 13卷 31659-31659页

作者： Khaoula Taji Ali Sohail Tariq Shahzad Bilal Shoaib Khan Muhammad Adnan Khan Khmaies Ouahada Electronic Systems Information Processing Mechanics and Energy Laboratory Kenitra Faculty of Sciences Ibn Tofail University Kenitra Morocco Department of Computer Science Minhaj University Lahore Lahore Pakistan Department of Electrical and Electronic Engineering Science University of Johannesburg Johannesburg South Africa Department of Computer Science Green International University Lahore Pakistan Department of Software Faculty of Artificial Intelligence and Software Gachon University Seongnam-si Republic of Korea

Presents corrections to the paper, Corrections to “An Ensemble Hybrid Framework: A Comparative Analysis of Metaheuristic Algorithms for Ensemble Hybrid CNN Features for Plants Disease Classification”.

关键词： Plant diseases Metaheuristics

来源：评论

学校读者我要写书评

暂无评论

A Survey on how computer vision can response to urgent need to contribute in COVID-19 pandemics

A Survey on how computer vision can response to urgent need ...

引用

作者： Gazzah, Sami Bencharef, Omar Latis Laboratory of Advanced Technology and Intelligent Systems National Engineering School of Sousse University of Sousse Tunisia Institut Supérieur des Métiers de la Mine Zouerate Mauritania Fstg Marrakech Computer Science Department *** 40000 Morocco

ISBN: (纸本)9781728180410

The coronavirus first outbreak in Wuhan city of China by December 2019. Due to its highly contagious power, they spread promptly in the four continents. Moreover, it devastating our daily lives and cause huge economic damage. Therefore, it is urgent to detect the positive cases at the earliest and put then under isolation. Automatic virus detection using Machine Learning will be a valuable contribution to prevent the spread of this epidemic. The purpose of this paper is to present short reviews on the coronavirus detection. In reviewing the existing works, we summarized and compared some related works performed on a collection of CT and X-ray images provided from infected patients. We conclude the paper with some discussions on how computer vision can response to urgent need to contribute in pandemics and to investigate many aspects of new viral replication and pathogenesis. © 2020 IEEE.

关键词： Coronavirus

来源：评论

学校读者我要写书评

暂无评论

Solution subset selection for final decision making in evolutionary multi-objective optimization

arXiv

引用

arXiv 2020年

作者： Ishibuchi, Hisao Pang, Lie Meng Shang, Ke University Key Laboratory of Evolving Intelligent Systems of Guangdong Province Department of Computer Science and Engineering Southern University of Science and Technology

In general, a multi-objective optimization problem does not have a single optimal solution but a set of Pareto optimal solutions, which forms the Pareto front in the objective space. Various evolutionary algorithms have been proposed to approximate the Pareto front using a pre-specified number of solutions. Hundreds of solutions are obtained by their single run. The selection of a single final solution from the obtained solutions is assumed to be done by a human decision maker. However, in many cases, the decision maker does not want to examine hundreds of solutions. Thus, it is needed to select a small subset of the obtained solutions. In this paper, we discuss subset selection from a viewpoint of the final decision making. First we briefly explain existing subset selection studies. Next we formulate an expected loss function for subset selection. We also show that the formulated function is the same as the IGD plus indicator. Then we report experimental results where the proposed approach is compared with other indicator-based subset selection methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Learning to Branch in Combinatorial Optimization with Graph Pointer Networks

arXiv

引用

arXiv 2023年

作者： Wang, Rui Zhou, Zhiming Zhang, Tao Wang, Ling Xu, Xin Liao, Xiangke Li, Kaiwen The College of Systems Engineering National University of Defense Technology Changsha410073 China The Hunan Key Laboratory of Multi-Energy System Intelligent Interconnection Technology HKLMSI2T Changsha410073 China Institute of Automation Chinese Academy of Sciences Beijing100190 China The College of Intelligence Science and Technology National University of Defense Technology Changsha410073 China Department of Automation Tsinghua University Beijing100084 China The College of Computer Science and Technology National University of Defense Technology Changsha410073 China

Branch-and-bound is a typical way to solve combinatorial optimization problems. This paper proposes a graph pointer network model for learning the variable selection policy in the branch-and-bound. We extract the graph features, global features and historical features to represent the solver state. The proposed model, which combines the graph neural network and the pointer mechanism, can effectively map from the solver state to the branching variable decisions. The model is trained to imitate the classic strong branching expert rule by a designed top-k Kullback-Leibler divergence loss function. Experiments on a series of benchmark problems demonstrate that the proposed approach significantly outperforms the widely used expert-designed branching rules. Our approach also outperforms the state-of-the-art machine-learning-based branch-and-bound methods in terms of solving speed and search tree size on all the test instances. In addition, the model can generalize to unseen instances and scale to larger instances. Copyright © 2023, The Authors. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Nonlinear parameter-varying state-feedback design for a gyroscope using virtual control contraction metrics

arXiv

引用

arXiv 2021年

作者： Wang, Ruigang Koelwijn, Patrick J.W. Manchester, Ian R. Tóth, Roland Australian Centre for Field Robotics Sydney Institute for Robotics and Intelligent Systems University of Sydney SydneyNSW2006 Australia Department of Electrical Engineering Eindhoven University of Technology Eindhoven Netherlands Systems and Control Laboratory Institute for Computer Science and Control Budapest Hungary

In this paper, we present a virtual control contraction metric (VCCM) based nonlinear parameter-varying (NPV) approach to design a state-feedback controller for a control moment gyroscope (CMG) to track a user-defined trajectory set. This VCCM based nonlinear stabilization and performance synthesis approach, which is similar to linear parameter-varying (LPV) control approaches, allows to achieve exact guarantees of exponential stability and L2-gain performance on nonlinear systems with respect to all trajectories from the predetermined set, which is not the case with the conventional LPV methods. Simulation and experimental studies conducted in both fully- and under-actuated operating modes of the CMG show effectiveness of this approach compared to standard LPV control methods. © 2021, CC BY.

关键词： State feedback

来源：评论

学校读者我要写书评

暂无评论

MedSteGAN: Medical Embedding-Optimized Steganography with Improved GAN

SSRN

引用

SSRN 2023年

作者： Peng, Yuxiang Fu, Chong Zheng, Yu Tian, Yunjia Cao, Guixing Chen, Junxin School of Computer Science and Engineering Northeastern University Liaoning 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 Liaoning Shenyang110819 China Department of Information Engineering The Chinese University of Hong Kong Ma Liu Shui Shatin New Territories Hong Kong Institute of Telecommunication Satellite China Academy of Space Technology Beijing100094 China School of Software Dalian University of Technology Liaoning Dalian116621 China

Medical diagnosing systems contain sensitive information, especially the resulting certificate of diagnosis that involves the patient’s privacy, required to be protected carefully. An effective way is to secretly embed privacy-sensitive information into medical-generated images, eventually being viewed as arbitrary images of nobody/nothing in public. The current research line of medical steganography targets simple data-hiding methods, yet remains barren in optimal embedding and stronger robustness. To fill this gap, we propose an end-to-end steganographic framework for medical images. Our idea is to integrate medical-image adaptive steganography with a generative adversarial network (GAN), named MedSteGAN. To improve both robustness, we design an optimized U-shape gen- erator that extracts features more efficiently utilizing larger kernel convolutions and the ReLU6 function. Also, deconvolutions are replaced by upsampling and convolution layers to avoid the checkerboard effect. To enhance security and image quality, we employ visual quality loss and mean squared error (MSE) loss based on the multi-scale structural similarity index metric (MS- SSIM) and the high-pass filters, respectively. Extensive experiments demonstrate that MedSteGAN outperforms state-of-the-art steganographic schemes in terms of robustness and image quality. © 2023, The Authors. All rights reserved.

关键词： Image quality

来源：评论

学校读者我要写书评

暂无评论

Learning Purified Feature Representations from Task-irrelevant Labels

arXiv

引用

arXiv 2021年

作者： Li, Yinghui Wang, Chen Li, Yangning Zheng, Hai-Tao Shen, Ying Tsinghua Shenzhen International Graduate School Tsinghua University China Department of Computer Science and Technology Tsinghua University China School of Intelligent Systems Engineering Sun-Yat Sen University China Peng Cheng Laboratory China

Learning an empirically effective model with generalization using limited data is a challenging task for deep neural networks. In this paper, we propose a novel learning framework called Purified Learning to exploit task-irrelevant features extracted from task-irrelevant labels when training models on small-scale datasets. Particularly, we purify feature representations by using the expression of task-irrelevant information, thus facilitating the learning process of classification. Our work is built on solid theoretical analysis and extensive experiments, which demonstrate the effectiveness of Purified Learning. According to the theory we proved, Purified Learning is model-agnostic and doesn’t have any restrictions on the model needed, so it can be combined with any existing deep neural networks with ease to achieve better performance. © 2021, CC BY.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：