Search

It is a very crucial part of note receiver to recognize the version, nominal value and orientation of a note. The existing methods often do the operation and the authentication recognition simultaneously, which is after the currency feature collection. Considering that the counterfeit note is very similar with the genuine one, for extracting it with the authentication operation, a rapid method is proposed to recognize the note's version, nominal value and orientation, which do the discrimination while collecting the image features. This method can help reduce the feature dimensions and the computation on authentication identification, which is significant in promoting the identification speed of the note receiver and the authentication accuracy.

This project uses the methods of integration with respect to instantaneous power, the wave record of instantaneous voltage and current and the laboratory reduction to monitor the accuracy of three-phase smart meter that on working state. And it also uses the idea of double-circuit sampling and measurement to improve the redundancy of the system.

The availability and performance of Grid sites change dynamically, which makes it be a great challenge to design a good site selection and task scheduling mechanism for Grid workflows. A multi-stage Grid site evaluation and selection mechanism, involving site testing, time series based site performance prediction and adaptive selection, was proposed in this paper. In order to enhance reliability of workflow execution and potentially reduce execution time, an incremental task replication policy based on empirical CDF of queuing time of sites was introduced. The experiments done in Open Science Grid (OSG) proved that adaptive site selection and task scheduling proposed in this paper could control JRR and JSL in a reasonable range in a realistic Grid environment, and workflow execution performance could be greatly improved by initial site evaluation and task replication policies.

Based on the white noise filtration method, the time domain model of stochastic road irregularities was established including the model of multipoint time-delay correlative excitation from the same track and the model of space-coherance excitation from the bilateral tracks of a vehicle on the road. Further the development was made from the time domain model of one dimensional road irregularities to two-dimensional road surface and the simulation realization completed in MATLAB environment. The case studies demonstrated that the digital road surface characteristics simulated by white noise filtration was consistent with that of a standard grade road surface, thus formed virtual road surface which provided digital road environment efficiently and conveniently for virtual prototyping (VP) and virtual proving ground (VPG) of vehicles.

Workflow management system model and workflow task scheduling algorithm are the critical research areas in combination of workflow and grid techniques. On the basis of active network, a distributed, scalable workflow management system model which can adapt to dynamic changes of grid resource is presented. Workflow tasks are partitioned according to the characteristic of workflow structure, and the entire deadline and cost are divided into sub-deadline and sub-cost for each task partition based on its length and communication traffic; Considering user?s multi-QoS requirements and communication time between workflow tasks, a trust and cost based Comprehensive Beneficial function and determination methods of trust?s and cost?s weights are provided. A scheduling algorithm TCD aims at comprehensive optimization of trust and cost is put forward and this algorithm tries to get an optimized solution for each task partition to achieve an optimized scheduling with multi-object for the entire workflow. Simulation results show that the algorithm can guarantee user?s multi-QoS quite well.

In mobile ad hoc networks, each host moves in an arbitrary manner and thus routes are subject to frequent disconnections. Furthermore, rebuilding routes operations consume lots of the network resources and the nodes energy. In this paper, a novel reliable routing algorithm using fuzzy applicability is proposed to increase the route reliability and reduce the number of broken routes during the routing selection. The algorithm uses fuzzy applicability to express the matching degree between each neighboring node. It produces a routing sprouting tree from source node to destination node utilizing the IRS (immediate reachable set) and RS (reachable set) of each node. Finally, by comparing the applicability of each route in the routing sprouting tree, the most proper route can be computed. The algorithm provides not only a select mechanism for searching the next routing node, but also a global reliability for the whole selected route. The simulation results show that the algorithm can reduce the number of broken routes efficiently when applying the proposed algorithm to the AODV (adhoc on demand distance vector) routing protocol.

The arbitrary movements of nodes in mobile ad hoc networks lead the frequent operation of rebuilding routes. In order to reduce the number of broken routes, a novel reliable routing algorithm using fuzzy applicability is proposed to increase the reliability during the routing selection. The algorithm expresses the matching degree between each neighboring node which uses fuzzy applicability. It produces a routing sprouting tree from source node to destination node according to the network topology. Finally, by comparing the value of applicability in the routing sprouting tree, the most proper route can be computed. The algorithm provides not only a select mechanism for searching the next routing node, but also a global reliability for the whole selected route. The simulation results show that the algorithm can reduce the number of broken routes efficiently and the improvement percentage of routing reliability is about 45% when applying the proposed algorithm to the AODV routing protocol.

In this paper, a novel concept is proposed to express the matching degree between available resources and meta-tasks which uses weighted average fuzzy applicability. Furthermore, a new scheduling algorithm aimed at time and cost for meta-tasks in grid computing is designed on the basis of layered task scheduling model. The scheduling aim can be chosen according to user's requirement through setting different weights, for example, Time-Weight, Cost-Weight, etc. The comparison metric is the value of fuzzy applicability, and the optimum solution is the scheme which has the maximum. The experiment result shows that the algorithm can consider the factors of time and cost as a whole. It also ensures that, given the aim with different weights, the algorithm's performance is better than some existent heuristic algorithms