检索结果-南通市图书馆

Fully Bayesian analysis of the relevance vector machine classification for imbalanced data problem

CAAI Transactions on Intelligence Technology 2023年第1期8卷 192-205页

作者： Wenyang Wang Yanna Sun Keran Li Jinglin Wang Chong He Dongchu Sun School of Maritime Economics and Management Dalian Maritime UniversityDalianChina Collaborative Innovation Center for Transport Studies Dalian Maritime UniversityDalianChina Maritime Safety and Environmental Management World Maritime UniversityMalmöSweden Department of Statistics University of Nebraska-LincolnLincolnNebraskaUSA School of Statistics Faculty of Economics and ManagementEast China Normal UniversityShanghaiChina Department of Statistics University of MissouriColumbiaMissouriUSA

Relevance Vector Machine(RVM)is a supervised learning algorithm extended from Support Vector Machine based on the Bayesian sparsity *** Vector Machine classification suffers from theoretical limitations and computational inefficiency mainly because there is no closed-form solution for the posterior of the weight *** propose two advanced Bayesian approaches for RVM classification,namely the Enhanced RVM and the Reinforced RVM,to perfect the theoretic framework of RVM and extend the algorithm to the imbalanced data problem,which has an arresting skew in data size between ***,the Enhanced RVM conducts a strict Bayesian sampling process instead of the approximation method in the original one to remedy its theoretic limitations,especially the nonconvergence of the ***,we conjecture that the hierarchical prior makes the Reinforced RVM achieve consistent estimations of the quantities of interest compared with the non-consistent estimations of the original *** is necessary for RVM classification since it makes the model more stable and localises the relevant vectors more accurately in the imbalanced data *** two-level prior also renders the Reinforced one competitive in the imbalanced data problem by building the inner connection of parameter dimensions and alloting a more vital relevance to the small class data weight *** theoretic proofs and several numeric studies demonstrate the merits of our two proposed algorithms.

关键词： limitations problem render

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Satisfiability threshold of the random regular(s,c,k)-SAT problem

引用

Frontiers of Computer Science 2022年第3期16卷 227-229页

作者： Xiaoling MO Daoyun XU Kai YAN Zaijun ZHANG College of Computer Science and Technology Guizhou UniversityGuiyang 550025China Agricultural Development Bank of China Beijing 100045China Key Laboratory of Complex Systems and Intelligent Computing and School of Mathematics and Statistics Qiannan Normal University for NationalitiesDuyun 558000China

1Introduction The satisfiability(SAT)problem is always a core problem in the field of computer *** theoretical and applied research have long been the common attention of many scholars in the field of artificial intelligence and mathematical *** the real world,all issues related to combinatorial optimization and coordination verification are closely related to SAT problem.

关键词： problem. problem combinatorial

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

An improved fireworks algorithm for the capacitated vehicle routing problem

引用

Frontiers of Computer Science 2019年第3期13卷 552-564页

作者： Weibo YANG Liangjun KE State Key Laboratory for Manufacturing Systems Engineering Xi'an Jiaotong University Xi'an 710049 China

The capacitated vehicle routing problem (CVRP), which aims at minimizing travel costs, is a wellknown NP-hard combinatorial optimization. Owing to its hardness, many heuristic search algorithms have been proposed to tackle this problem. This paper explores a recently proposed heuristic algorithm named the fireworks algorithm (FWA), which is a swarm intelligence algorithm. We adopt FWA for the combinatorial CVRP problem with several modifications of the original FWA: it employs a new method to generate "sparks" according to the selection rule, and it uses a new method to determine the explosion amplitude for each firework. The proposed algorithm is compared with several heuristic search methods on some classical benchmark CVRP instances. The experimental results show a promising performance of the proposed method. We also discuss the strengths and weaknesses of our algorithm in contrast to traditional algorithms.

关键词： fireworks algorithm vehicle routing problem computational intelligence

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Real-time pricing method for smart grids based on complementarity problem

引用

Journal of Modern Power Systems and Clean Energy 2019年第5期7卷 1280-1293页

作者： Hongjie WANG Yan GAO School of Management University of Shanghai for Science and TechnologyShanghai 200093China

Considering a demand response(DR)based social welfare maximization model,a complementarity problem based on the Karush-Kuhn-Tuker condition is described,which is a non-dual method for determining real-time price for smart *** Lagrange multiplier in the dual method,which is used to determine the basic electricity price,is applied in the *** proposed method computes the optimal electricity consumption,price and *** to the electricity price,users can arrange their electricity equipment reasonably to reduce the consumption pressure at peak *** model aims to encourage users to actively participate in the DR and realize peak cutting and valley *** addition,the model considers different utility functions representing three types of ***,a Jacobian smoothing version of Newton method is used to solve the *** simulations of the model validate the rationality and feasibility of the proposed method.

关键词： Smart grids Real-time pricing Shadow price Complementarity problem Smoothing method

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

An inverse problem in film/substrate indentation:extracting both the Young's modulus and thickness of films

引用

Acta Mechanica Sinica 2018年第6期34卷 1061-1071页

作者： Yin Zhang Feifei Gao Zhiyue Zheng Zhihai Cheng State Key Laboratory of Nonlinear Mechanics(LNM) Institute of MechanicsChinese Academy of SciencesBeijing 100190China School of Engineering Science University of Chinese Academy of SciencesBeijing 100049China Department of Physics and Beijing Key Laboratory of Optoelectronic Functional Materials and Micro-Nano Devices Renmin University of ChinaBeijing 100872China

In an indentation test,the effective Young's modulus of a film/substrate bilayer heterostructure varies with the indentation depth,a phenomenon known as the substrate *** previous studies investigating this,only the Young's modulus of the film was *** the effective Young's modulus of a film/substrate structure is determined at a given contact depth,the Young's modulus of the film can be uniquely determined,i.e.,there is a one-to-one relation between the Young's modulus of the film and the film/substrate effective Young's ***,at times it is extremely challenging or even impossible to measure the film ***,the precise definition of the layer/film thickness for a two-dimensional material can be *** the current study,therefore,the thickness of the film and its Young's modulus are treated as two unknowns that must be *** the case with one unknown,there are infinite combinations of film thickness and Young's modulus which can yield the same effective Young's modulus for the film/*** inverse problem is formulated and solved to extract the Young's modulus and thickness of the film from the indentation depth-load *** accuracy and robustness of the inverse problem-solving method are also demonstrated.

关键词： Indentation test Film Substrate Inverse problem

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Univector field method-based multi-agent navigation for pursuit problem in obstacle environments

引用

Journal of Central South University 2017年第4期24卷 1002-1012页

作者： Le Pham Tuyen Hoang Huu Viet Sang Hyeok An Seung Gwan Lee Dong-Han Kim Tae Choong Chung Department of Computer Science and Engineering Kyung Hee University Yongin Gyeonggi 446-701 Korea Department of Information Technology Vinh University 182-Le Duan Vinh City Nghe An 461056 Vietnam Humanitas College Kyung Hee University Yongin Gyeonggi 446-701 Korea Department of Electronics and Radio Engineering Kyung Hee University Yongin Gyeonggi 446-701 Korea

The pursuit problem is a well-known problem in computer science. In this problem, a group of predator agents attempt to capture a prey agent in an environment with various obstacle types, partial observation, and an infinite grid-world. Predator agents are applied algorithms that use the univector field method to reach the prey agent, strategies for avoiding obstacles and strategies for cooperation between predator agents. Obstacle avoidance strategies are generalized and presented through strategies called hitting and following boundary(HFB); trapped and following shortest path(TFSP); and predicted and following shortest path(PFSP). In terms of cooperation, cooperation strategies are employed to more quickly reach and capture the prey agent. Experimental results are shown to illustrate the efficiency of the method in the pursuit problem.

关键词： pursuit problem predator agent prey agent univector field method multi-agent systems

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Hilbert problem 15 and Ritt-Wu Method(Ⅰ)

引用

Journal of Systems Science & Complexity 2019年第1期32卷 47-61页

作者： LI Banghe KLMM Academy of Mathematics and Systems Science Chinese Academy of Sciences

Hilbert problem 15 requires to understand Schubert's book. In this book, there is a theorem in §23, about the relation of the tangent lines from a point and the singular points of cubed curves with cusp near a 3-multiple straight line, which was obtained by the so called main trunk numbers, while for these numbers, Schubert said that he obtained them by experiences. So essentially Schubert even did not give any hint for the proof of this theorem. In this paper, by using the concept of generic point in the framework of Van der Waerden and Weil on algebraic geometry, and realizing Ritt-Wu method on computer, the authors prove that this theorem of Schubert is completely right.

关键词： Cubed curves with cusp Hilbert problem 15 Ritt-Wu Method

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Enjoy the most beautiful scene now:a memetic algorithm to solve two-fold time-dependent arc orienteering problem

引用

Frontiers of Computer Science 2020年第2期14卷 364-377页

作者： Chao CHEN Liping GAO Xuefeng XIE Zhu WANG School of Computer Science Chongqing UniversityChongqing 400044China School of Computer Science Northwestern Polytechnical UniversityXi'an 710072China

Traditional route planners commonly focus on finding the shortest path between two points in terms of travel distance or time over road ***,in real cases,especially in the era of smart cities where many kinds of transportation-related data become easily available,recent years have witnessed an increasing demand of route planners that need to optimize for multiple criteria,e.g.,finding the route with the highest accumulated scenic score along(utility)while not exceeding the given travel time budget(cost).Such problem can be viewed as a variant of arc orienteering problem(AOP),which is well-known as an NP-hard *** this paper,targeting a more realistic AOP,we allow both scenic score(utility)and travel time(cost)values on each arc of the road network are time-dependent(2TD-AOP),and propose a memetic algorithm to solve *** be more specific,within the given travel time budget,in the phase of initiation,for each population,we iteratively add suitable arcs with high scenic score and build a path from the origin to the destination via a complicate procedure consisting of search region narrowing,chromosome encoding and *** the phase of the local search,each path is improved via chromosome selection,local-improvement-based mutation and crossover ***,we evaluate the proposed memetic algorithm in both synthetic and real-life datasets extensively,and the experimental results demonstrate that it outperforms the baselines.

关键词： arc orienteering problem two-fold timedependent scenic score travel time memetic algorithm

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Fundamental problem in optimizing the biaxial testing specimen

引用

Science China(Technological Sciences) 2019年第5期62卷 773-780页

作者： IMTIAZ Haroon FANG YaoPeng DU JianBin LIU Bin Department of Engineering Mechanics Applied Mechanics Lab Tsinghua University

Most of the elements in structural design are subjected to the complex loading conditions that need to be predicted in advance for a reliable design. The failure prediction of these structural elements is based on the failure theories that employ the experimental data of the uniaxial, the biaxial and the shear tests. Among these tests, the biaxial testing is used to model the behavior of the structure loaded in more than one direction. In this study, we discover an interesting fact for the biaxial tension specimen that the thickness reduction of the measuring region cannot increase the stress to a high level. This behavior of the biaxial testing is different from the uniaxial testing where the thickness reduction of the measuring region always increases its stress to a higher level. Therefore, we further investigate the biaxial testing specimen via related fundamental problem, i.e., an axisymmetric plate with varying thickness under axisymmetric tension. We perform the shape optimization based on our analytical solution and the FEM results. For an infinite axisymmetric disk, the optimized design should include a low slope diverging section connecting the inner to outer region. On the contrary, the larger inner measuring region for finite axisymmetric disk would result in higher corresponding stress. These conclusions can be used as a guideline for the design of a biaxial testing specimen.

关键词： uniaxial testing biaxial testing axisymmetric disk problem optimization

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Turbulent Wagner problem with transition

引用

Chinese Journal of Aeronautics 2020年第1期33卷 1-4页

作者： Sicheng LI Chenyuan BAI Jing LIN Ziniu WU Department of Engineering Mechanics Tsinghua UniversityBeijing 100084China

Wagner problem is originally concerned with inviscid flow and unsteady force due to a small step motion,or attaining of a small angle of attack,of an airfoil in an initially uniform flow and has been studied recently for inviscid flow with large amplitude step *** we propose to consider turbulent Wagner problem for a plate that is initially covered with a mixed laminarboundary layer on both sides and is set into step motion of small or large amplitude and in direction normal to the *** evolution of skin friction and transition region in time are examined *** is found that transition region unexpectedly changes direction of movement for small amplitude of step motion while global transition or laminarization exists for large amplitude step *** significance of this study is ***,the present study treated a new and interesting problem since it combines two problems of fundamental interests,one is Wagner problem and the other is boundary layer ***,the present study appears to show that the pressure gradient normal to the airfoil and caused by discontinuous step motion may have subtle influence on transition and the mechanism of this influence deserves further studies.

关键词： Step motion Transition Unsteady force Wagner problem

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：