Conference Program of WCICA 2012
Conference Program of WCICA 2012
Conference Program of WCICA 2012
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
<strong>Conference</strong> <strong>Program</strong> <strong>WCICA</strong> <strong>2012</strong><br />
Intelligent Test Paper Generation System Based on Slicing Processing,<br />
pp.506–511<br />
Ma, Fengning<br />
Dong, Yao<br />
Shi, Jin<br />
Zhang, Ying<br />
Tianjin Univ.<br />
Hebei Univ. <strong>of</strong> Tech.<br />
Hebei Univ. <strong>of</strong> Tech.<br />
Tianjin Univ.<br />
nowadays, paperless test is very popular in the universities. The classical<br />
test paper generating methods have not satisfied the increasing<br />
test requirement. So, an intelligent test paper generating algorithm<br />
based on the slicing processing is proposed, which classifies the indexes,<br />
such as the type and amount <strong>of</strong> questions, the knowledge point,<br />
difficulty and discrimination <strong>of</strong> the test paper, with the value type and<br />
flexible feature. The actual application indicates that the method has a<br />
balance between the success ratio and efficiency, and provides the theory<br />
evidence for the efficient intelligent test paper generation system.<br />
◁ PFrA-90<br />
An improved Transfer Learning Algorithm for Document categorization<br />
Based on data sets reconstruct, pp.575–578<br />
Sun, Wei<br />
Qian, Xu<br />
China Univ. <strong>of</strong> Mining & Tech.(Beijing)<br />
School <strong>of</strong> Mechanical Electronic & Information<br />
Engineering, China Univ. <strong>of</strong> Mining & Tech.<br />
(Beijing)<br />
Traditional machine learning and data mining algorithms usually assume<br />
that the training and test data have the same feature space and<br />
data distribution, but in the real application this assumption is <strong>of</strong>ten d-<br />
ifficult to establish, and always lead the existing model to outdate. As<br />
a new learning mechanism, transfer learning can solve this problem effectively,<br />
in this paper, we will propose an improved transfer learning<br />
algorithm for document categorization based on data sets reconstruct,<br />
we also describe the main idea and the step <strong>of</strong> the algorithm, then use<br />
experiment to test the algorithm and compare it with other algorithms,<br />
the result <strong>of</strong> experiment proves the algorithm we proposed in this paper<br />
is better than the others in some extent.<br />
◁ PFrA-91<br />
A New Ant Colony Optimization with Global Exploring Capability and<br />
Rapid Convergence, pp.579–583<br />
Deng, Xiangyang<br />
Yu, Wenlong<br />
Zhang, Limin<br />
Naval Aeronautical & Astronautical Univ.<br />
Naval Aeronautical & Astronautical Univ.<br />
Naval Aeronautical & Astronautical Univ.<br />
Ant colony optimization (ACO) is a meta-heuristic algorithm, and is<br />
widely applied in combinatorial optimization. To enhance the ACO’s<br />
global exploiting capability and convergence, a new pheromone update<br />
strategy is presented, which results in a gradually transition <strong>of</strong> the ant<br />
colony’s diversity, and an improved ACO algorithm called ACO+ is<br />
proposed. For a solution to the traveling salesman problem (TSP), a s-<br />
tatistical model <strong>of</strong> traversed ants <strong>of</strong> sub-routes is introduced to rank the<br />
sub-routes, and an adaptive pheromone trails update mechanism is implemented,<br />
which integrates with the iteration-best pheromone update<br />
strategy. The algorithm can effectively combine the global exploring capability<br />
and convergence rate. Experiments show that the ACO+ has a<br />
good performance and robustness.<br />
◁ PFrA-92<br />
Study on Control Strategy for Vehicle Braking Force on Low Adhesive<br />
Cornering Road, pp.618–622<br />
Song, Dandan<br />
Yang, Tao<br />
Henan Communication Vocational Tech.<br />
Henan Communication Vocational Tech.<br />
Along with reducing the centrifugal force based on decreased speed using<br />
vehicle braking, the maximum lateral force <strong>of</strong> the wheel could bear<br />
diminishing gradually. In this paper, the deficiency <strong>of</strong> vehicle’s anti-lock<br />
braking system on cornering road is analyzed, a control strategy <strong>of</strong> vehicle<br />
braking on low adhesive cornering road is presented, vehicle’s<br />
ABS and the biggest lateral force <strong>of</strong> the wheel could bearing when vehicle<br />
occur side slip are comprehensive considered, and the maximum<br />
braking force applied to vehicle can be determined according to relatively<br />
small value <strong>of</strong> both. Simulation shows the validity <strong>of</strong> the proposed<br />
control method.<br />
◁ PFrA-93<br />
A Novel Prototype Architecture for Equipment Tele-control and Simulation,<br />
pp.633–637<br />
Wang, Yong Ming<br />
Zhao, Guang Zhou<br />
Yin, Hong Li<br />
Kunming Univ. <strong>of</strong> Sci. & Tech.<br />
Kunming Univ. <strong>of</strong> Sci. & Tech.<br />
Yunnan Normal Univ.<br />
Due to the working hazardous or other conditions, such as tele-medical,<br />
tele-embodiment, operations should be executed with a fully remote<br />
control and monitoring. So, tele-control and reality simulation are crucial<br />
in these environments. However, there exists a lack <strong>of</strong> an effective<br />
system architecture that integrates remote condition monitoring and<br />
control <strong>of</strong> automated equipment; that give much consideration about<br />
data transfer time delay via TCP/IP data package. This paper presented<br />
a novel prototype architecture for tele-control and reality simulation,<br />
which can guarantee the non-distortion-transfer <strong>of</strong> control information<br />
and reduce the action time difference between local simulated virtual<br />
equipment and remote real equipment, couple the remote control and<br />
virtual reality together. In order to demonstrate and validate the effectiveness<br />
<strong>of</strong> the novel architecture, a 3 DOF Fischertechnik industry<br />
robot remote operation and monitoring system have been developed.<br />
Experimental results are encouraging and demonstrate a promising<br />
application in any other relevant environment.<br />
◁ PFrA-94<br />
Keep the Geometries: Image Segmentation by K-MSVC with Random<br />
Region Grouping and Propagation, pp.672–679<br />
LIN, Yining<br />
Wei, Wei<br />
DAI, Yuanming<br />
Zhejiang Univ.<br />
College <strong>of</strong> Electrical Engineering, Zhejiang Univ.<br />
Zhejiang Univ.<br />
We propose new techniques to address low-level image segmentation<br />
problem under clustering theory. The goal <strong>of</strong> this paper is to provide<br />
a compromised solution between methods that produce two different<br />
kinds <strong>of</strong> segmentation results: one generates coherent regions but<br />
views disjoint regions as totally different objects, and the others do not<br />
consider the spatial relationship at all. For our approach, spatial geometries<br />
are partially preserved and disjoint regions are also allowed<br />
to be grouped into a single cluster. The approach is built on the feature<br />
space clustering algorithm called K-MSVC, but constrained by the<br />
graph to maintain the capability <strong>of</strong> partially preserving the spatial coherence.<br />
A new type <strong>of</strong> graph called Random Grouping Graph (RGG) is<br />
introduced then, to overcome the high computational cost on the gridgraph<br />
based image representation. It’s fast to construct, greatly reduce<br />
the graph size and can speedup other graph-based segmentation<br />
algorithms. Though with less vertices, the segmentation on RGG<br />
works better than on downsampled version <strong>of</strong> the image. Nontrivial experimental<br />
results on the Berkeley Segmentation Dataset demonstrate<br />
that our method outperforms the existing algorithms and yields more<br />
satisfactory results.<br />
◁ PFrA-95<br />
Routing in Wireless Sensor Networks Using Swarm Intelligence,<br />
pp.680–684<br />
Lv, Yong<br />
JiaXing Univ.<br />
Wireless Sensor Networks consisting <strong>of</strong> nodes with limited power are<br />
deployed to collect and distribute useful information from the field to<br />
the other sensor nodes. Energy consumption is a key issue in the sensor’s<br />
communications since many use battery power, which is limited.<br />
The sensors also have limited memory and functionality to support<br />
communications. Ant Colony Optimization, a swarm intelligence based<br />
optimization technique, is widely used in network routing. This paper<br />
describes a new routing approach for Wireless Sensor Networks consisting<br />
<strong>of</strong> stable nodes based an Ant Colony Optimization algorithm that<br />
explore the network and learn good routes, using a novel variation <strong>of</strong><br />
reinforcement learning. Simulation results show that proposed algorithm<br />
provides promising solutions allowing node designers to efficiently<br />
operate routing tasks.<br />
122