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

Fuzzy relational equation with defuzzification -d* algorithm for the largest solution

FUZZY SETS ANd SYSTEMS 2001年第1期123卷 119-127页

作者： Kagei, S Yokohama Natl Univ Fac Engn Dept Informat & Syst Hodogaya Ku Yokohama Kanagawa 2408501 Japan

This paper provides and* algorithm for solving a new fuzzy relational equation including defuzzification. An input fuzzy set is first transformed into an internal fuzzy set by a fuzzy relation, and then an element giving the largest membership value is selected from the support set as an output. Our purpose is to obtain the internal fuzzy relation from pairs of input fuzzy sets and output set-elements. These relational equations are classified into two types, called Type I and Type II in the text, depending on where internal fuzzy sets are defuzzified. discussions in this paper are done on the largest solutions of these problems.d* algorithms to obtain the largest solutions are shown as well as some propositions and numerical examples. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： relational equation defuzzification largest solution identification algorithm

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Constrained Multiobjective Optimization: Scalable High-dimensional Constraint Benchmarks and* algorithm

引用

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 2024年第4期28卷 965-979页

作者： Qiao, Kangjia Liang, Jing Yu, Kunjie Yue, Caitong Lin, Hongyu Zhang, dezheng Qu, Boyang Zhengzhou Univ Sch Elect & Informat Engn Zhengzhou 450001 Peoples R China Henan Inst Technol Sch Elect Engn & Automat Xinxiang 453003 Henan Peoples R China Zhongyuan Univ Technol Sch Elect & Informat Engn Zhengzhou 450007 Peoples R China

Evolutionary constrained multiobjective optimization has received extensive attention and research in the past two decades, and a lot of benchmarks have been proposed to test the effect of the constrained multiobjective evolutionaryd* algorithms (CMOEAs). Especially, the constraint functions are highly correlated with the objective values, which makes the features of constraints too monotonic and differ from the properties of the real-world problems. Accordingly, previous CMOEAs cannot solve real-world problems well, which generally involve decision space constraints with multimodal/nonlinear features. Therefore, we propose a new benchmark framework and design a suite of new test functions with scalable high-dimensional decision space constraints. To be specific, different high-dimensional constraint functions and mixed linkages in variables are considered to be close to realistic features. In this framework, several parameter interfaces are provided, so that users can easily adjust the parameters to obtain the variant functions and test the generalization performance of thed* algorithms. different types of existing CMOEAs are employed to test the use of the proposed test functions, and the results show that they are easy to fall into local feasible regions. Therefore, we improve one evolutionary multitasking-based CMOEA to better handle these problems, in which a new searchd* algorithm is designed to enhance the search abilities of populations. Compared with the existing CMOEAs, the proposed CMOEA presents better performance.

关键词： Benchmark testing Heuristicd* algorithms Optimization Linear programming Search problems Task analysis Sociology algorithm benchmark decision space constraints evolutionary constrained multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

A dynamic bidirectional heuristic trust path searchd* algorithm

引用

CAAI Transactions on Intelligence Technology 2022年第3期7卷 340-353页

作者： Jiaying Che Xiangrong Tong Lei Yu School of Computer and Control Engineering Yantai UniversityYantaiShandongChina Department of Computer Science State University of New York at BinghamtonBinghamtonNew YorkUSA

Online social networks greatly promote peoples'online interaction,where trust plays a crucial *** prediction with trust path search is widely used to help users find the trusted friends and obtain valid ***,the shortcomings of accuracy and time still exist in some famous ***,the dynamic bidirectional heuristic search(dBHS)algorithm is proposed in this paper to find the reliable trust path by studying the heuristic ***,the trust value and path length are comprehensively considered to find the most trusted ***,it constrains the traversal depth based on the‘small world’theory and obtains the acceptable path set by using the relaxation coefficientλto relax the depth of the shortest *** this way,some longer path with the higher trust can be considered to improve the precision of ***,an adjustment factor is designed based on the meet in the middle(MM)algorithm to assign search weights to two directions based on the size of the search tree expanded,so as to improve the problem of no priori when fixed parameters are ***,the complexity of unidirectional trust path search can also be reduced by searching from two directions,which can reduce the depth and improve the efficiency of ***,the predictive trust degree is outputted by the trust propagation *** public datasets are used to generate experimental results,which show that dBHS can quickly search and form reliable trust relationship,and it partly improves otherd* algorithms.

关键词： directions algorithm dynamic

来源：评论

学校读者我要写书评

暂无评论

A Privacy-Protecting Step-Level Walking direction detectiond* algorithm Based on Floor Vibration

引用

IEEE SENSORS JOURNAL 2023年第10期23卷 10814-10824页

作者： Yu, Yang Carl, Oskar Hussain, Shabir Hou, Weiyan Weis, Torben Univ Duisburg Essen Dept Comp Sci & Appl Cognit Sci D-47057 Duisburg Germany Zhengzhou Univ Sch Comp & Artificial Intelligence Zhengzhou 450001 Peoples R China Zhengzhou Univ Sch Elect & Informat Engn Zhengzhou 450001 Peoples R China

We present and* algorithm and measurement system to detect the walking direction of persons based on ground vibrations. The approach is privacy-preserving because it solely relies on piezoelectric sensors built into the floor. Therefore, our system can be used in areas where cameras are not allowed or cannot capture the entire area. We present and compare our two innovative methods to analyze the ground vibrations caused by footsteps: the multipeaks averaged* algorithm (MPAA) and the multipeaks averaged feature with a deep neural network-based classifier (MPAF-dNNC). MPAA judges the walking direction of pedestrians by analyzing the time-space relationship of at least two consecutive footstep vibration signals from multiple sensors. MPAF-dNNC receives multipeaks averaged feature as input and uses a deep neural network-based classifier to judge walking direction. Our experiments and evaluation show that our system can correctly determine the walking direction based on only three input step events (SEs) and provides an average F1 score of 0.97. When more than five SEs are inputted, the proposed system can correctly determine the walking direction with an average F1 score of 1.00.

关键词： Sensors Legged locomotion Vibrations Sensor fusion data integration Monitoring Sensor systems algorithm data fusion pattern recognition piezoelectric sensor privacy protection vibration signal walking direction detection

来源：评论

学校读者我要写书评

暂无评论

A NEW dATA STREAM MININGd* algorithm FOR INTERESTINGNESS-RICH ASSOCIATION RULES

引用

JOURNAL OF COMPUTER INFORMATION SYSTEMS 2013年第3期53卷 14-27页

作者： Kuthadi, Venu Madhav Univ Johannesburg Johannesburg South Africa

Frequent itemset mining and association rule generation is a challenging task in data stream. Even though, variousd* algorithms have been proposed to solve the issue, it has been found out that only frequency does not decides the significance interestingness of the mined itemset and hence the association rules. This accelerates thed* algorithms to mine the association rules based on utility i.e. proficiency of the mined rules. However, fewerd* algorithms exist in the literature to deal with the utility as most of them deals with reducing the complexity in frequent itemset/association rules miningd* algorithm. Also, those fewd* algorithms consider only the overall utility of the association rules and not the consistency of the rules throughout a defined number of periods. To solve this issue, in this paper, an enhanced association rule miningd* algorithm is proposed. Thed* algorithm introduces new weightage validation in the conventional association rule miningd* algorithms to validate the utility and its consistency in the mined association rules. The utility is validated by the integrated calculation of the cost/price efficiency of the itemsets and its frequency,. The consistency validation is performed at even, defined number of windows using the probability distribution function, assuming that the weights are normally distributed. Hence, validated and the obtained rules are frequent and utility efficient and their interestingness are distributed throughout the entire time period. Thed* algorithm is implemented and the resultant rules are compared against the rules that can be obtained from conventional miningd* algorithms.

关键词： data Stream data Stream Parameters-tuned lnterestingness (dSPI) algorithm Parameters-tuned Interestingness (API) Frequency Supporters-tuned Interestingness (FSI) Interestingness

来源：评论

学校读者我要写书评

暂无评论

Fast Target detection in Synthetic Aperture Sonar Imagery: A Newd* algorithm and Large-Scale Performance Analysis

引用

IEEE JOURNAL OF OCEANIC ENGINEERING 2015年第1期40卷 71-92页

作者： Williams, david P. NATO Sci & Technol Org CMRE I-19126 La Spezia Italy

In this paper, a new unsupervised* algorithm for the detection of underwater targets in synthetic aperture sonar (SAS) imagery is proposed. The method capitalizes on the high-quality SAS imagery whose high resolution permits many pixels on target. One particularly novel component of the method also detects sand ripples and estimates their orientation. The overalld* algorithm is made fast by employing a cascaded architecture and by exploiting integral-image representations. As a result, the approach makes near-real-time detection of proud targets in sonar data onboard an autonomous underwater vehicle (AUV) feasible. No training data are required because the proposed method is adaptively tailored to the environmental characteristics of the sensed data that are collected in situ. To validate and assess the performance of the proposed detectiond* algorithm, a large-scale study of SAS images containing various mine-like targets is undertaken. The data were collected with the MUSCLE AUV during six large sea experiments, conducted between 2008 and 2012, in different geographical locations with diverse environmental conditions. The analysis examines detection performance as a function of target type, aspect, range, image quality, seabed environment, and geographical site. To our knowledge, this study-based on nearly 30 000 SAS images collectively covering approximately 160 km of seabed, and involving over 1100 target detection opportunities-represents the most extensive such systematic, quantitative assessment of target detection performance with SAS data to date. The analysis reveals the variables that have the largest impact on target detection performance, namely, image quality and environmental conditions on the seafloor. Ways to exploit the results for adaptive AUV surveys using through-the-sensor data are also suggested.

关键词： algorithm autonomous underwater vehicle (AUV) detection mine countermeasures (MCM) performance analysis synthetic aperture sonar (SAS)

来源：评论

学校读者我要写书评

暂无评论

A software method for suppressing statistical fluctuations in preset count digital-rate meterd* algorithms

引用

IEEE TRANSACTIONS ON NUCLEAR SCIENCE 2002年第5期49卷 2561-2566页

作者： Arandjelovic, V Koturovic, A Vukanovic, R Boris Kidric Inst Nucl Sci YU-11001 Belgrade Yugoslavia

A method for suppression of statistical fluctuations of the mean count rate measurements based on limiting the time difference between two adjacent input pulses to a pre-assigned range, has been incorporated in the preset count digital-rate meterd* algorithm. Thed* algorithm allows measurement of mean count rates with considerably lower levels of statistical fluctuations of the measurement results and significantly lower values of the preset count compared to the traditionald* algorithm. The exact relation between the lower and upper limits of the difference between two adjacent pulses has been derived. The lower limit of the preset count applicable to thed* algorithm has been identified. The response time of thed* algorithm to a sudden change of count rate has been determined.

关键词： algorithm counting data processing rate meter

来源：评论

学校读者我要写书评

暂无评论

An improved* algorithm for sorting by block-interchanges based on permutation groups

引用

INFORMATION PROCESSING LETTERS 2010年第8-9期110卷 345-350页

作者： Huang, Yen-Lin Huang, Cheng-Chen Tang, Chuan Yi Lu, Chin Lung Natl Chiao Tung Univ Inst Bioinformat & Syst Biol Hsinchu 300 Taiwan Natl Chiao Tung Univ Dept Biol Sci & Technol Hsinchu 300 Taiwan Natl Tsing Hua Univ Dept Comp Sci Hsinchu 300 Taiwan

Given a chromosome represented by a permutation of genes, a block-interchange is proposed as a generalized transposition that affects the chromosome by swapping two non-intersecting segments of genes. The problem of sorting by block-interchanges is to find a minimum series of block-interchanges for sorting one chromosome into another. In this paper, we present an O(n + delta log delta) timed* algorithm for solving the problem of sorting by block-interchanges, which improves a previousd* algorithm of O(delta n) time proposed by Lin et al. (2005) [14], where n is the number of genes and delta is the minimum number of block-interchanges required to sort a chromosome. (C) 2010 Elsevier B.V. All rights reserved.

关键词： algorithm data structure Genome rearrangement Permutation group Block-interchange Generalized transposition Permutation tree

来源：评论

学校读者我要写书评

暂无评论

A new approach to nuclear reactor design optimization using geneticd* algorithms and regression analysis

引用

ANNALS OF NUCLEAR ENERGY 2015年 85卷 27-35页

作者： Kumar, Akansha Tsvetkov, Pavel V. Texas A&M Univ Dept Nucl Engn College Stn TX 77843 USA

A module based optimization method using geneticd* algorithms (GA), and multivariate regression analysis has been developed to optimize a set of parameters in the design of a nuclear reactor. GA simulates natural evolution to perform optimization, and is widely used in recent times by the scientific community. The GA fits a population of random solutions to the optimized solution of a specific problem. In this work, we have developed a geneticd* algorithm to determine the values for a set of nuclear reactor parameters to design a gas cooled fast breeder reactor core including a basis thermal hydraulics analysis, and energy transfer. Multivariate regression is implemented using regression splines (RS). Reactor designs are usually complex and a simulation needs a significantly large amount of time to execute, hence the implementation of GA or any other global optimization techniques is not feasible, therefore we present a new method of using RS in conjunction with GA. due to using RS, we do not necessarily need to run the neutronics simulation for all the inputs generated from the GA module rather, run the simulations for a predefined set of inputs, build a multivariate regression fit to the input and the output parameters, and then use this fit to predict the output parameters for the inputs generated by GA. The reactor parameters are given by the, radius of a fuel pin cell, isotopic enrichment of the fissile material in the fuel, mass flow rate of the coolant, and temperature of the coolant at the core inlet. And, the optimization objectives for the reactor core are, high breeding of U-233 and Pu-239 in desired power peaking limits, desired effective and infinite neutron multiplication factors, high fast fission factor, high thermal efficiency in the conversion from thermal energy to electrical energy using the Brayton cycle, and high fuel burn-up. It is to be noted that we have kept the total mass of the fuel as constant. In this work, we present a module based (modula

关键词： Genetic algorithm Reactor design Modular Optimization

来源：评论

学校读者我要写书评

暂无评论

A Review of the Current Task Offloadingd* algorithms,Strategies and Approach in Edge Computing Systems

引用

Computer Modeling in Engineering & Sciences 2023年第1期134卷 35-88页

作者： Abednego Acheampong Yiwen Zhang Xiaolong Xu daniel Appiah Kumah School of Computer Science and Technology Anhui UniversityHefei230039China School of Computer and Software Nanjing University of Information Science and TechnologyNanjing210044China

Task offloading is an important concept for edge computing and the Internet of Things(IoT)because computationintensive tasksmust beoffloaded tomore resource-powerful remote *** has several advantages,including increased battery life,lower latency,and better application performance.A task offloading method determines whether sections of the full application should be run locally or offloaded for execution *** offloading choice problem is influenced by several factors,including application properties,network conditions,hardware features,and mobility,influencing the offloading system’s operational *** study provides a thorough examination of current task offloading and resource allocation in edge computing,covering offloading strategies,algorithms,and factors that influence *** offloading and partial offloading strategies are the two types of offloading ***d* algorithms for task offloading and resource allocation are then categorized into two parts:machine learningd* algorithms and non-machine learning *** examine and elaborate ond* algorithms like Supervised Learning,Unsupervised Learning,and Reinforcement Learning(RL)under machine *** the non-machine learningd* algorithm,we elaborate ond* algorithms like non(convex)optimization,Lyapunov optimization,Game theory,Heuristicd* algorithm,dynamic Voltage Scaling,Gibbs Sampling,and Generalized Benders decomposition(GBd).Finally,we highlight and discuss some research challenges and issues in edge computing.

关键词： Task offloading machine learning algorithm game theory dynamic voltage scaling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：