Wireless Sensor Networks are composed of autonomous sensing devices which are interconnected to form a closed network.This closed network is intended to share sensitive location-centric information from a source node ...Wireless Sensor Networks are composed of autonomous sensing devices which are interconnected to form a closed network.This closed network is intended to share sensitive location-centric information from a source node to the base station through efficient routing mechanisms.The efficiency of the sensor node is energy bounded,acts as a concentrated area for most researchers to offer a solution for the early draining power of sensors.Network management plays a significant role in wireless sensor networks,which was obsessed with the factors like the reliability of the network,resource management,energy-efficient routing,and scalability of services.The topology of the wireless sensor networks acts dri-ven factor for network efficiency which can be effectively maintained by perform-ing the clustering process effectively.More solutions and clustering algorithms have been offered by various researchers,but the concern of reduced efficiency in the routing process and network management still exists.This research paper offers a hybrid algorithm composed of a memetic algorithm which is an enhanced version of a genetic algorithm integrated with the adaptive hill-climbing algorithm for performing energy-efficient clustering process in the wireless sensor networks.The memetic algorithm employs a local searching methodology to mitigate the premature convergence,while the adaptive hill-climbing algorithm is a local search algorithm that persistently migrates towards the increased elevation to determine the peak of the mountain(i.e.,)best cluster head in the wireless sensor networks.The proposed hybrid algorithm is compared with the state of art clus-tering algorithm to prove that the proposed algorithm outperforms in terms of a network life-time,energy consumption,throughput,etc.展开更多
In order to generate an efficient common bitmap in single bitmap block truncation coding(SBBTC)of color images,an improved SBBTC scheme based on weighted plane(W-plane)method and hill climbing algorithm is proposed.Fi...In order to generate an efficient common bitmap in single bitmap block truncation coding(SBBTC)of color images,an improved SBBTC scheme based on weighted plane(W-plane)method and hill climbing algorithm is proposed.Firstly,the incoming color image is partitioned into non-overlapping blocks and each block is encoded using the W-plane method to get an initial common bitmap and quantization values.Then,the hill climbing algorithm is applied to optimize an initial common bitmap and generate a near-optimized common bitmap.Finally,the quantization values are recalculated by the near-optimized common bitmap and the considered color image is reconstructed block by block through the common bitmap and the new quantization values.Since the processing of each image block in SBBTC is independent and identical,parallel computing is applied to reduce the time consumption of this scheme.The simulation results show that the proposed scheme has better visual quality and time consumption than those of the reference SBBTC schemes.展开更多
This paper presents a formal approach to design of a solver of an intelligent management information system and its implementation. The approach implies set theoretic modeling based on the general systems concepts and...This paper presents a formal approach to design of a solver of an intelligent management information system and its implementation. The approach implies set theoretic modeling based on the general systems concepts and implementation in the extProlog.There are research efforts which attack (optimization) problems using the set theory and logics. Furthermore, they use logic programming languages for their implementation. Although their methods look quite similar to the approach of this paper, there are clear differences between them. This paper is interested in exploration of the solving system rather than algorithms.The paper first presents a design and implementation procedure of a solver. Then, classification of problems is discussed. The least structured class of the classification is the target of this paper. A data mining system is an example of the class.Formal theories are derived for the design procedure assuming the least structured case. A solving strategy, which is called a hill climbing method with a push down stack, is proposed on the theories.A data mining system is used as an example to illustrate the results.Finally, a full implementation in extProlog is presented for the data mining system.展开更多
This article implements maximum power point tracking(MPPT)based on the improved hill-climbing algorithm for photovoltaic(PV)systems feeding resistive loads.A direct current-to-direct current boost converter is inserte...This article implements maximum power point tracking(MPPT)based on the improved hill-climbing algorithm for photovoltaic(PV)systems feeding resistive loads.A direct current-to-direct current boost converter is inserted between the PV system and the load to achieve matching.The converter is managed using MPPT based on the hill-climbing algorithm.The objective of this paper is to optimize the code program to achieve the best compromise between accuracy and rapidity by implementing this algorithm using a microcontroller.Two PV systems are tested under identical meteorological conditions.In the first,an improved hill-climbing MPPT controller is used whereas,in the second,the conventional version is employed.The experimental results obtained show a signifi-cant enhancement in terms of speed for the improved algorithm with a value of 0.4 s for the response time and 3%for the oscillation power;those values remain satisfactory in terms of precision of the algorithm compared with the conventional system studied and the compared algorithm from the literature.展开更多
Instead of running away, she stood to attention with arms akimbo and gave a serious smile. The giant wooden basket on her back almost made her fall as she tried to straighten her body. When I raised the camera, Yang J...Instead of running away, she stood to attention with arms akimbo and gave a serious smile. The giant wooden basket on her back almost made her fall as she tried to straighten her body. When I raised the camera, Yang Jiaxiu was walking along a narrow, muddy mountain path in a virgin fir forest, carrying about 50 kilograms of water. She twisted her body to pour the water into a large tank when she finally arrived at her house. Then the Miao woman put down the展开更多
A Mobile Ad-hoc NETwork(MANET)contains numerous mobile nodes,and it forms a structure-less network associated with wireless links.But,the node movement is the key feature of MANETs;hence,the quick action of the nodes ...A Mobile Ad-hoc NETwork(MANET)contains numerous mobile nodes,and it forms a structure-less network associated with wireless links.But,the node movement is the key feature of MANETs;hence,the quick action of the nodes guides a link failure.This link failure creates more data packet drops that can cause a long time delay.As a result,measuring accurate link failure time is the key factor in the MANET.This paper presents a Fuzzy Linear Regression Method to measure Link Failure(FLRLF)and provide an optimal route in the MANET-Internet of Things(IoT).This work aims to predict link failure and improve routing efficiency in MANET.The Fuzzy Linear Regression Method(FLRM)measures the long lifespan link based on the link failure.The mobile node group is built by the Received Signal Strength(RSS).The Hill Climbing(HC)method selects the Group Leader(GL)based on node mobility,node degree and node energy.Additionally,it uses a Data Gathering node forward the infor-mation from GL to the sink node through multiple GL.The GL is identified by linking lifespan and energy using the Particle Swarm Optimization(PSO)algo-rithm.The simulation results demonstrate that the FLRLF approach increases the GL lifespan and minimizes the link failure time in the MANET.展开更多
The fast convergence without initial value dependence is the key to solving large angle relative orientation.Therefore,a hybrid conjugate gradient algorithm is proposed in this paper.The concrete process is:①stochast...The fast convergence without initial value dependence is the key to solving large angle relative orientation.Therefore,a hybrid conjugate gradient algorithm is proposed in this paper.The concrete process is:①stochastic hill climbing(SHC)algorithm is used to make a random disturbance to the given initial value of the relative orientation element,and the new value to guarantee the optimization direction is generated.②In local optimization,a super-linear convergent conjugate gradient method is used to replace the steepest descent method in relative orientation to improve its convergence rate.③The global convergence condition is that the calculation error is less than the prescribed limit error.The comparison experiment shows that the method proposed in this paper is independent of the initial value,and has higher accuracy and fewer iterations.展开更多
In order to solve the constraint satisfied problem in the genetic algorithm, the partheno-genetic algorithm is designed. And then the schema theorem of the partheno-genetic algorithm is proposed to show that the high ...In order to solve the constraint satisfied problem in the genetic algorithm, the partheno-genetic algorithm is designed. And then the schema theorem of the partheno-genetic algorithm is proposed to show that the high rank schemas at the subsequent generation decrease exponentially even though its fitness is more optimal than the average one in the population and the low rank schemas at the subsequent generation increase exponentially when its fitness is more optimal than the average one in the population. In order to overcome the shortcoming that the optimal high rank schema can be deserted arbitrarily, the HGA (hybrid partheno-genetic algorithm) is proposed, that is, the hill-climbing algorithm is integrated to search for a better individual. Finally, the results of the simulation for facility layout problem and no-wait schedule problem are given. It is shown that the hybrid partheno- genetic algorithm is of high efficiency.展开更多
Making full use of wind power is one of the main purposes of the wind turbine generator control. Conventional hill climbing search (HCS) method can realize the maximum power point tracking (MPPT). However, the ste...Making full use of wind power is one of the main purposes of the wind turbine generator control. Conventional hill climbing search (HCS) method can realize the maximum power point tracking (MPPT). However, the step size of HCS method is constant so that it cannot consider both steady-state response and dynamic response. A fuzzy logical control (FLC) algorithm is proposed to solve this problem in this paper, which can track the maximum power point (MPP) quickly and smoothly. To evaluate MPPT algorithms, four performance indices are also proposed in this paper. They are the energy captured by wind turbine, the maximum power-point tracking time when wind speed changes slowly, the fluctuation magnitude of real power during steady state, and the energy captured by wind turbine when wind speed changes fast. Three cases are designed and simulated in MATLAB/Simulink respectively. The comparison of the three MPPT strategies concludes that the proposed fuzzy logical control algorithm is more superior to the conventional HCS algorithms.展开更多
The robustness is an important functionality of networks because it manifests the ability of networks to resist failures or attacks. Many robustness measures have been proposed from different aspects, which provide us...The robustness is an important functionality of networks because it manifests the ability of networks to resist failures or attacks. Many robustness measures have been proposed from different aspects, which provide us various ways to evaluate the network robustness. However, whether these measures can properly evaluate the network robustness and which aspects of network robustness these measures can evaluate are still open questions. Therefore, in this paper, a thorough introduction over attacks and robustness measures is first given, and then nine widely used robustness mea- sures are comparatively studied. To validate whether a robustness measure can evaluate the network robustness properly, the sensitivity of robustness measures is first studied on both initial and optimized networks. Then, the performance of robustness measures in guiding the optimization process is studied, where both the optimization process and the ob- tained optimized networks are studied. The experimental re- suits show that, first, the robustness measures are more sen- sitive to the changes in initial networks than to those in op- timized networks; second, an optimized network may not be useful in practical situations because some useful function- alities, such as the shortest path length and communication efficiency, are sacrificed too much to improve the robustness; third, the robustness of networks in terms of closely corre- lated robustness measures can often be improved together. These results indicate that it is not wise to just apply the opti- mized networks obtained by optimizing over one certain robustness measure into practical situations. Practical requirements should be considered, and optimizing over two or more suitable robustness measures simultaneously is also a promising way.展开更多
文摘Wireless Sensor Networks are composed of autonomous sensing devices which are interconnected to form a closed network.This closed network is intended to share sensitive location-centric information from a source node to the base station through efficient routing mechanisms.The efficiency of the sensor node is energy bounded,acts as a concentrated area for most researchers to offer a solution for the early draining power of sensors.Network management plays a significant role in wireless sensor networks,which was obsessed with the factors like the reliability of the network,resource management,energy-efficient routing,and scalability of services.The topology of the wireless sensor networks acts dri-ven factor for network efficiency which can be effectively maintained by perform-ing the clustering process effectively.More solutions and clustering algorithms have been offered by various researchers,but the concern of reduced efficiency in the routing process and network management still exists.This research paper offers a hybrid algorithm composed of a memetic algorithm which is an enhanced version of a genetic algorithm integrated with the adaptive hill-climbing algorithm for performing energy-efficient clustering process in the wireless sensor networks.The memetic algorithm employs a local searching methodology to mitigate the premature convergence,while the adaptive hill-climbing algorithm is a local search algorithm that persistently migrates towards the increased elevation to determine the peak of the mountain(i.e.,)best cluster head in the wireless sensor networks.The proposed hybrid algorithm is compared with the state of art clus-tering algorithm to prove that the proposed algorithm outperforms in terms of a network life-time,energy consumption,throughput,etc.
基金Supported by the National Natural Science Foundation of China(No.61402537)the Open Fund of Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis(No.HCIC201706)the Sichuan Science and Technology Programme(No.2018GZDZX0041)
文摘In order to generate an efficient common bitmap in single bitmap block truncation coding(SBBTC)of color images,an improved SBBTC scheme based on weighted plane(W-plane)method and hill climbing algorithm is proposed.Firstly,the incoming color image is partitioned into non-overlapping blocks and each block is encoded using the W-plane method to get an initial common bitmap and quantization values.Then,the hill climbing algorithm is applied to optimize an initial common bitmap and generate a near-optimized common bitmap.Finally,the quantization values are recalculated by the near-optimized common bitmap and the considered color image is reconstructed block by block through the common bitmap and the new quantization values.Since the processing of each image block in SBBTC is independent and identical,parallel computing is applied to reduce the time consumption of this scheme.The simulation results show that the proposed scheme has better visual quality and time consumption than those of the reference SBBTC schemes.
文摘This paper presents a formal approach to design of a solver of an intelligent management information system and its implementation. The approach implies set theoretic modeling based on the general systems concepts and implementation in the extProlog.There are research efforts which attack (optimization) problems using the set theory and logics. Furthermore, they use logic programming languages for their implementation. Although their methods look quite similar to the approach of this paper, there are clear differences between them. This paper is interested in exploration of the solving system rather than algorithms.The paper first presents a design and implementation procedure of a solver. Then, classification of problems is discussed. The least structured class of the classification is the target of this paper. A data mining system is an example of the class.Formal theories are derived for the design procedure assuming the least structured case. A solving strategy, which is called a hill climbing method with a push down stack, is proposed on the theories.A data mining system is used as an example to illustrate the results.Finally, a full implementation in extProlog is presented for the data mining system.
文摘This article implements maximum power point tracking(MPPT)based on the improved hill-climbing algorithm for photovoltaic(PV)systems feeding resistive loads.A direct current-to-direct current boost converter is inserted between the PV system and the load to achieve matching.The converter is managed using MPPT based on the hill-climbing algorithm.The objective of this paper is to optimize the code program to achieve the best compromise between accuracy and rapidity by implementing this algorithm using a microcontroller.Two PV systems are tested under identical meteorological conditions.In the first,an improved hill-climbing MPPT controller is used whereas,in the second,the conventional version is employed.The experimental results obtained show a signifi-cant enhancement in terms of speed for the improved algorithm with a value of 0.4 s for the response time and 3%for the oscillation power;those values remain satisfactory in terms of precision of the algorithm compared with the conventional system studied and the compared algorithm from the literature.
文摘Instead of running away, she stood to attention with arms akimbo and gave a serious smile. The giant wooden basket on her back almost made her fall as she tried to straighten her body. When I raised the camera, Yang Jiaxiu was walking along a narrow, muddy mountain path in a virgin fir forest, carrying about 50 kilograms of water. She twisted her body to pour the water into a large tank when she finally arrived at her house. Then the Miao woman put down the
文摘A Mobile Ad-hoc NETwork(MANET)contains numerous mobile nodes,and it forms a structure-less network associated with wireless links.But,the node movement is the key feature of MANETs;hence,the quick action of the nodes guides a link failure.This link failure creates more data packet drops that can cause a long time delay.As a result,measuring accurate link failure time is the key factor in the MANET.This paper presents a Fuzzy Linear Regression Method to measure Link Failure(FLRLF)and provide an optimal route in the MANET-Internet of Things(IoT).This work aims to predict link failure and improve routing efficiency in MANET.The Fuzzy Linear Regression Method(FLRM)measures the long lifespan link based on the link failure.The mobile node group is built by the Received Signal Strength(RSS).The Hill Climbing(HC)method selects the Group Leader(GL)based on node mobility,node degree and node energy.Additionally,it uses a Data Gathering node forward the infor-mation from GL to the sink node through multiple GL.The GL is identified by linking lifespan and energy using the Particle Swarm Optimization(PSO)algo-rithm.The simulation results demonstrate that the FLRLF approach increases the GL lifespan and minimizes the link failure time in the MANET.
基金National Natural Science Foundation of China(Nos.4156108241161061)。
文摘The fast convergence without initial value dependence is the key to solving large angle relative orientation.Therefore,a hybrid conjugate gradient algorithm is proposed in this paper.The concrete process is:①stochastic hill climbing(SHC)algorithm is used to make a random disturbance to the given initial value of the relative orientation element,and the new value to guarantee the optimization direction is generated.②In local optimization,a super-linear convergent conjugate gradient method is used to replace the steepest descent method in relative orientation to improve its convergence rate.③The global convergence condition is that the calculation error is less than the prescribed limit error.The comparison experiment shows that the method proposed in this paper is independent of the initial value,and has higher accuracy and fewer iterations.
文摘In order to solve the constraint satisfied problem in the genetic algorithm, the partheno-genetic algorithm is designed. And then the schema theorem of the partheno-genetic algorithm is proposed to show that the high rank schemas at the subsequent generation decrease exponentially even though its fitness is more optimal than the average one in the population and the low rank schemas at the subsequent generation increase exponentially when its fitness is more optimal than the average one in the population. In order to overcome the shortcoming that the optimal high rank schema can be deserted arbitrarily, the HGA (hybrid partheno-genetic algorithm) is proposed, that is, the hill-climbing algorithm is integrated to search for a better individual. Finally, the results of the simulation for facility layout problem and no-wait schedule problem are given. It is shown that the hybrid partheno- genetic algorithm is of high efficiency.
基金supported by the National High Technology Research and Development Program of China under Grant No.2011AA05S113Major State Basic Research Development Program under Grant No.2012CB215106+1 种基金Science and Technology Plan Program in Zhejiang Province under Grant No.2009C34013National Science and Technology Supporting Plan Project under Grant No.2009BAG12A09
文摘Making full use of wind power is one of the main purposes of the wind turbine generator control. Conventional hill climbing search (HCS) method can realize the maximum power point tracking (MPPT). However, the step size of HCS method is constant so that it cannot consider both steady-state response and dynamic response. A fuzzy logical control (FLC) algorithm is proposed to solve this problem in this paper, which can track the maximum power point (MPP) quickly and smoothly. To evaluate MPPT algorithms, four performance indices are also proposed in this paper. They are the energy captured by wind turbine, the maximum power-point tracking time when wind speed changes slowly, the fluctuation magnitude of real power during steady state, and the energy captured by wind turbine when wind speed changes fast. Three cases are designed and simulated in MATLAB/Simulink respectively. The comparison of the three MPPT strategies concludes that the proposed fuzzy logical control algorithm is more superior to the conventional HCS algorithms.
文摘The robustness is an important functionality of networks because it manifests the ability of networks to resist failures or attacks. Many robustness measures have been proposed from different aspects, which provide us various ways to evaluate the network robustness. However, whether these measures can properly evaluate the network robustness and which aspects of network robustness these measures can evaluate are still open questions. Therefore, in this paper, a thorough introduction over attacks and robustness measures is first given, and then nine widely used robustness mea- sures are comparatively studied. To validate whether a robustness measure can evaluate the network robustness properly, the sensitivity of robustness measures is first studied on both initial and optimized networks. Then, the performance of robustness measures in guiding the optimization process is studied, where both the optimization process and the ob- tained optimized networks are studied. The experimental re- suits show that, first, the robustness measures are more sen- sitive to the changes in initial networks than to those in op- timized networks; second, an optimized network may not be useful in practical situations because some useful function- alities, such as the shortest path length and communication efficiency, are sacrificed too much to improve the robustness; third, the robustness of networks in terms of closely corre- lated robustness measures can often be improved together. These results indicate that it is not wise to just apply the opti- mized networks obtained by optimizing over one certain robustness measure into practical situations. Practical requirements should be considered, and optimizing over two or more suitable robustness measures simultaneously is also a promising way.