摘要：
In this paper, the Quantum Genetic Algorithms is used to do sensor optimization design. The results indicate that the QGA can solve the problems of parameter optimization in the sensor design. The placement of sensor node is important in wireless sensor network, optimize sensor node or not which relate to the life circle of the network. In the past the algorithms be used in sensor node placement can not reach large coverage, which affect the life cycle of the network serious, researchers try many methods to solve the problem, but the result is not satisfied. With the appearance of quantum genetic algorithm, this situation has changed. In order to enlarge the coverage degree of sensor region, the paper advance quantum genetic algorithm, this algorithm use quantum bit to denote chromosome, use quantum rotation door and quantum NOT door to come true the chromosome renewal, thereby optimize the solution of the target problems.
作者机构：
Department of Computer Science, Hua Zhong Normal University, 430079, China;[Shanthi Gamage] Faculty of Law University of Colombo Sri Lanka
会议名称：
第一届国际教育信息技术及应用研讨会(2007 1st International Symposium on Information Technologies and Applications in Education(ISITAE 2007))
会议时间：
2007-11-23
会议地点：
昆明
会议论文集名称：
第一届国际教育信息技术及应用研讨会（2007 1st International Symposium
关键词：
M-learning;campus grid;GSA
摘要：
With the rapid development of information technology,people are having greater hunger for knowledge.To be adapted with the lifelong learning trend of the society,M-learning has emerged.In order to sha
摘要：
In wireless sensor networks where nodes operate on limited battery energy, some other unique characteristics make these nodes impossible to be replaced or recharged, so the efficient utilization of the energy Is very Important. There are many papers proposed In order to reduce energy consumption, but at the same time another problem emerged, i.e., for each node with limited energy the cumulative load of data traffic from its neighbor nodes will become heavier and the energy of such nodes will deplete more quickly than before. So we have formulated the routing problem as maximizing the network lift-time. Firstly we split these nodes Into to some domains, and then we balance load among each domain dynamic. Considering this we describe a dynamic load balancing routing algorithm based on each node's energy, through which we trying to maximize the lifetime of each node as well as the whole lifespan of the sensor networks. Through our models and algorithms, the simulation results showed our algorithms are more dynamic and mobility efficient, nodes can change their domains if necessary.
期刊：
Sixth Wuhan International Conference on E-Business, Vols 1-4: MANAGEMENT CHALLENGES IN A GLOBAL WORLD,2007年:1352-1356
作者机构：
[Gao, Li; Dai, Shangping; Zheng, Shijue] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
会议名称：
Management Challenges in a Global World vol.II
会议时间：
2007-01-01
会议地点：
Wuhan,China
会议论文集名称：
Management Challenges in a Global World vol.II
关键词：
data mining;genetic algorithm;association rules
摘要：
The development of data mining systems has received a great deal of attention in recent years. It plays a key enabling role for competitive businesses in the E-commerce era. One of the challenges in developing data mining systems is to integrate and coordinate existing data mining applications in a seamless manner so that cost-effective systems can be developed without the need of costly proprietary products. In this paper we take advantage of the genetic algorithm (GA) designed specifically for discovering association rules. While generating candidate from frequent using the complementary matrix, we prune most impossible candidate patterns. We propose a novel spatial mining algorithm, called ARMAGA, Compared to the literature[2] algorithm. the ARMAGA algorithm avoids. generating impossible candidates, and therefore is more efficient in terms of the execution time.
通讯机构：
[Gao, Li] H;Hua Zhong Normal Univ, Dept Comp Sci, Wuhan 430079, Hubei, Peoples R China.
关键词：
data mining;Genetic Algorithm;Association rules;multimedia;image databases
摘要：
The development of data mining systems has received a great deal of attention in recent years. It plays a key enabling role for competitive businesses in the E-commerce era. One of the challenges in developing data mining systems is to integrate and coordinate existing data mining applications in a seamless manner so that cost-effective systems can be developed without the need of costly proprietary products. In this paper we take advantage of the genetic algorithm (GA) designed specifically for discovering association rules. We propose a novel spatial mining algorithm, called ARMNGA(Association Rules Mining in Novel Genetic Algorithm), Compared to the algorithm in Reference [2], the ARMNGA algorithm avoids generating impossible candidates, and therefore is more efficient in terms of the execution time.
摘要：
Wireless sensor networks (WSNs) are composed of small, energy-constraint nodes, many of which may work in hostile or even unattended environments, and these unique characteristics make these nodes impossible to be replaced or recharged. So there are many papers proposed in order to reduce energy consumption, but at the same time another problems emerged, i.e., for each node with limited energy the cumulative load of data traffic from its neighbor nodes will become more heavier and the energy of such nodes will deplete more quickly than before. So in this paper we design a load balancing routing algorithm based on each node's energy, through which we trying to maximize the lifetime of each node as well as the whole lifespan of the sensor networks.
摘要：
With the development of network technology, distance-education research is increasingly valued. Background knowledge and learning objectives of various groups of students on the network are very different. Adaptive education system, which uses different teaching programs for different students, can enhance the efficiency of learning process. In an adaptive education system, the algorithm dealing with uncertainty factors of student model is very important. Bayesian network artifice is a very effective one within various methods dealing with uncertainty. In this paper, we applied Bayesian network method to student model; designed Bayesian network structure in a student model; assigned the local probability distribution and discussed the way to acquire and propagate related evidences. The practice has proven Bayesian network approach for student model is a very effective method.
期刊：
Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms,2006年13:760-764 ISSN：1492-8760
通讯作者：
Zheng, Shijue
作者机构：
[Gao, Li; Dai, Shangping; Zheng, Shijue; Shu, Wanneng; Du, Jianhua] Hua Zhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
通讯机构：
[Zheng, Shijue] H;Hua Zhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
摘要：
The complex resources and tasks in Grid computing environment make it very difficult to validate the methods of resource management and task scheduling. This paper proposes a task scheduling model for grid computing, designs and realizes a target genetic algorithm based on task scheduling method, combining resource management and task scheduling then gives attention to quality of service (QoS). The experimental results are perfect.
摘要：
An important task, of mobile embedded svstem design is to seek, an optimal hardware/software co-design. With the growing complexity of the systems. mobile embedded svstem hardware/software co-design becomes an effective Nvay to improve the design quality. In the discussion of general methods used in mobile embedded system designing. this paper illustrates hardware/software co-design technology and their partitioning. and proposes a design idea based on hardware/software partitioning. the weight of components and their partitioning. which leads to the construction of MEHSC ( Mobile Embedded HW/SW Co-design, MEHSC). Based on the MEHSC Algorithm model. a kind of the mobile "Eelectronics' Schoolbag " is developed.
摘要：
The wireless sensor networks was integrated with many advanced techniques in order to supply the way of getting information, processing information for people. This paper gives an idea about the application of wireless sensor networks in campus and analyzes the benefits that the sensor networks bring. We consider the specialty of campus and design the model of the campus sensor network in detail, which includes indoor and outdoor placement of sensor nodes. In addition. we introduce an improved OCOV algorithm which is applied to the campus. The aim is to achieve anticipant request of coverage by laying as less sensors as possible. At last we give the simulation results and statistical data.
期刊：
ICICIC 2006: FIRST INTERNATIONAL CONFERENCE ON INNOVATIVE COMPUTING, INFORMATION AND CONTROL, VOL 3, PROCEEDINGS,2006年:316-+
通讯作者：
Zheng, Shijue
作者机构：
[Shu, Wanneng; Dai, Shangping; Zheng, Shijue] Hua Zhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
通讯机构：
[Zheng, Shijue] H;Hua Zhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
摘要：
The existing Globus grid environment emphasizes resources searching and marking-up, and is not so perfect in task submission and ways of scheduling, in which the way of task submission is manual; task scheduling depends on round robin method. To research into the task scheduling in grid computing, this paper puts forward a model dealing with task scheduling, designs and realizes a hybrid genetic algorithm. From the analysis and experiment result, it is concluded that this algorithm is superior to traditional algorithm and standard genetic algorithm.
通讯机构：
[Wanneng Shu] H;Hua Zhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
摘要：
Task scheduling is a NP-hard problem and is an integral part of parallel and distributed computing. It is more complicated especially under the grid computing environment. This paper combined with the advantages of genetic algorithm and simulated annealing, brings forward an improved genetic simulated annealing algorithm and applied to solve grid computing task scheduling problem. From the analysis and experiment result, it is concluded that this algorithm is superior to genetic algorithm and simulated annealing.
摘要：
This paper discusses a parallel task-scheduling algorithm in network cluster computing system based oil the model of multiprocessor parallel task scheduling. Compared with other methods, heuristic table scheduling can achieve better result with less cost. We designed this parallel task-scheduling algorithm for cluster system based oil heuristic table scheduling algorithm. First, define the two properties of priority as: t-level (top-level) and b-level (bottom level). Then, Critical path is defined. Third, consider critical path node. Finally, we execute node-transferring scheduling. We apply a series of table scheduling algorithms, such as DLS (Dynamic level Scheduling, DLS) and MCP (Modified Critical Path) to compare performance. Our simulation experiment result shows this algorithm greatly improves scheduling performance.
摘要：
The availability of micro-sensors and low-power wireless communications enable the deployment of distributed sensor networks-for a wide range of applications. Considering the great potential of distributed wireless sensor networks in civil domains, this paper gives an idea about the application of wireless sensor networks in campus and analyzes the benefits that the sensor networks bring. Taking the Central China Normal University for example, we consider the specialty of campus and design the model of the campus sensor network in detail, which includes indoor and outdoor placement of sensor nodes. In addition, based on the placement an improved OPTIMUM-COV algorithm that applies in campus in the design was introduced. The aim is to achieve anticipant request of coverage by laying as less sensors as possible. At last it gives the simulation results and statistical data. The results show our design is feasible.
通讯机构：
[Shu, Wanneng] H;Hua Zhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
会议名称：
2006 International Conference on Communications,Circuits and Systems(第四届国际通信、电路与系统学术会议)
会议时间：
2006-06-25
会议地点：
广西桂林
会议论文集名称：
第四届国际通信、电路与系统学术会议
摘要：
Since the task scheduling in grid computing faces a NP-hard problem, it leads very difficult to validate the methods of task scheduling .This paper combined with the advantages of two evaluative algorithms: genetic algorithm and simulated annealing, brings forward an hybrid evaluative algorithm and applied to solve task scheduling problem in grid computing. From the analysis and experiment result, it is concluded that this algorithm is superior to genetic algorithm and simulated annealing.
通讯机构：
[Shu, Wanneng] H;Hua Zhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
会议名称：
4th International Conference on Communications, Circuits and Systems (ICCCAS 2006)
会议时间：
JUN 25-28, 2006
会议地点：
Guilin, PEOPLES R CHINA
会议主办单位：
[Shu, Wanneng;Zheng, Shijue;Gao, Li] Hua Zhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.^[Wang, Xiong] Tsinghua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China.
会议论文集名称：
International Conference on Communications Circuits and Systems
摘要：
In order to improve the throughput, response speed and scalability of VOID server efficiently, many VOD server have thrown away single servers and turn into VOD server clusters which centrally accepts all the coming requests and evenly dispatches them to the servers in the cluster. Weighted Round-robin, Weighted Least Connections algorithms which commonly used in VOID cluster show low efficiencies, because they either do not consider the difference in performance between servers or do not consider the contents of coming different requests. In this paper analyzes and explores the load balancing technology of VOD cluster server, and puts forward a self-adjusted genetic algorithm. The experimental results are perfect.
摘要：
Task scheduling is a NP-hard problem and is an integral part of parallel and distributed computing. This paper combined with the advantages of genetic algorithm and simulated annealing, brings forward a parallel genetic simulated annealing algorithm and applied to solve task scheduling in grid computing. It first generates a new group of individuals through genetic operation such as reproduction, crossover, mutation, etc, and than simulated anneals independently all the generated individuals respectively. When the temperature in the process of cooling no longer falls, the result is the optimal solution on the whole. From the analysis and experiment result, it is concluded that this algorithm is superior to genetic algorithm and simulated annealing.
