Homology Priority Task Scheduling in μC/OS-Ⅱ Real-Time Kernel

μC/OS-Ⅱ is an open source real-time kernel adopting priority preemptive schedule strategy. Aiming at the problem of μC/OS-Ⅱ failing to support homology priority tasks scheduling, an approach for solution is proposed. The basic idea is adding round-robin scheduling strategy in its original scheduler in order to schedule homology priority tasks through time slice roundrobin. Implementation approach is given in detail. Firstly, the Task Control Block （TCB） is extended. And then, a new priority index table is created, in which each index pointer points to a set of homology priority tasks. Eventually, on the basis of reconstructing μC/OS-Ⅱ real-time kernel, task scheduling module is rewritten. Otherwise, schedulability of homology task supported by modified kernel had been analyzed, and deadline formula of created homology tasks is given. By theoretical analysis and experiment verification, the modified kernel can support homology priority tasks scheduling, meanwhile, it also remains preemptive property of original μC/OS-Ⅱ.     

Slack-nibbling battery-aware task scheduling

Dynamic voltage scaling (DVS) is an efficient approach to maximize the battery life of portable devices. A novel overall planning strategy (OPS II) balancing slack supply and demand for DVS is proposed. An OPS II-based slack-nibbling overall planning strategy (SNOPS) algorithm is also proposed, which iteratively nibbles slacks for appropriate tasks selected by an overall planning dynamic priority function to perform DVS until the slack is exhausted and an optimum voltage setting is obtained. For a high-load task set, SNOPS manages to recover battery overload while maintaining schedulability. For random variable-load task sets, SNOPS achieves a saving of 29.51% battery capacity on average, the suboptimal gap is 27.84% narrower than that of our previously proposed OPS-based algorithm, and 92.10% narrower than that of the algorithm proposed by Chowdhury et al. Results indicate that OPS II manages to save battery to various extents while maintaining schedulability, and demonstrates good load compatibility and close-to-optimal performance on average. Biography: GAO Xun(1981–), male, Ph.D. candidate, research direction: embedded system, power optimization.     

Publicly Verifiable Distributed Proxy Blind Signature Scheme

In this present paper, we propose a new proxy blind signature scheme, which is publicly verifiable distributed. The algorithm uses the idea of secret sharing schemes to distribute original signer＇s ability and the power of the proxy signer, and ensure the property of publicly verifiable secret sharing schemes. A new concept ＂verifiable time period＂ is also introduced to reduce the time cost in the period of verifications and increases the efficiency of our scheme.     

Mining Interesting Knowledge from Web-Log

Web-tog contains a lot of information related with user activities on the Internet. How to mine user browsing interest patterns effectively is an important and chattengeable research topic. On the analysis of the present algorithm‘s advantages and disadvantages, we propose a new concept: support-interest. Its key insight is that visitor will backtrack if they do not find the information where they expect. And the point from where they backtrack is tbe expected location for the page. We present User Access Matrix and the corresponding algorithm for discovering such expected locations that can handle page caching by the browser. Since the URL-URL matrix is a sparse matrix which can be represented by List of 3 tuples, we can mine user preferred sub-paths from the computation of this matrix. Accordinglyo all the sub-paths are merged, and user preferred paths are formed. Experiments showed that it was accurate and scalable. It‘s suitable for website based application, such as to optimize website‘s topologicat structure or to design personalized scrvices.     

Research on Bayesian Network Based User＇s Interest Model

It has very realistic significance for improving the quality of users＇ accessing information to filter and selectively retrieve the large number of information on the Internet. On the basis of analyzing the existing users＇ interest models and some basic questions of users＇ interest （representation, derivation and identification of users＇ interest）, a Bayesian network based users＇ interest model is given. In this model, the users＇ interest reduction algorithm based on Markov Blanket model is used to reduce the interest noise, and then users＇ interested and not interested documents are used to train the Bayesian network. Compared to the simple model, this model has the following advantages like small space requirements, simple reasoning method and high recognition rate. The experiment result shows this model can more appropriately reflect the user＇s interest, and has higher performance and good usability.     

Joint Power Control Algorithm for CDMA TDD System

Current uplink power control algorithm of code division multiple access （CDMA） time division duplex（TDD） system contains signal-to-interference-ratio（SIR） and interference measurement, which is based on history information. However, the adjustment of transmission power of one user equipment（UE） will affect SIR of the others, because the power control is done independently of the power adjustment of other UE＇s. So the convergence speed of power control is not fast and the system performance degrades. In the proposed algorithm, all UE＇s assigned in same time slot adjust their transmission power based on current information, which takes into account the adjustments of transmission power of all UE＇s. The simulation results indicated that the proposed algorithm outperforms the old algorithm.     

A Deep Web Query Interfaces Classification Method Based on RBF Neural Network

This paper proposes a new approach for classification for query interfaces of Deep Web, which extracts features from the form＇s text data on the query interfaces, assisted with the synonym library, and uses radial basic function neural network （RBFNN） algorithm to classify the query interfaces. The applied RBFNN is a kind of effective feed-forward artificial neural network, which has a simple networking structure but features with strength of excellent nonlinear approximation, fast convergence and global convergence. A TEL_8 query interfaces＇ data set from UIUC on-line database is used in our experiments, which consists of 477 query interfaces in 8 typical domains. Experimental results proved that the proposed approach can efficiently classify the query interfaces with an accuracy of 95.67%.     

An improved sanitizable signature scheme

A new sanitizable signature scheme is proposed, in which the security flaw of Miyazaki＇s sanitizable signature scheme SUMI-4 is improved. The new scheme overcomes the shortcomings of the original scheme SUM1-4 by using sanitizable authorization certificates. The new scheme enables the primitive signer to limit the sanitizer＇s power and still satisfies the security request of sanitizable signature.     

Automatic evolutionary modeling by the Lattice-Boltzmann method

The Lattice-Boltzmann method is an effective tool for solving fluid mechanics problems, but there isn’t still a good scheme to determinate some parameters in Boltzmann equations. In this paper, a technique using evolutionary algorithm to automatically model Boltzmann equations is introduced. Numerical simulation shows that the designed scheme is fast and efficient. Biography: Chen Ju-hua ( 1963-), male, Associate professor, research direction: Lattice-Boltzmann method, evolutionary algorithm.     

A processing approach for event-based location aware queries in hybrid wireless sensor networks

In hybrid wireless sensor networks, sensor mobility causes the query areas to change dynamically. Aiming at the problem of inefficiency in processing the data aggregation queries in dynamic query areas, this paper proposes a processing approach for event-based location aware queries (ELAQ), which includes query dissemination algorithm, maximum distance projection proxy selection algorithm, in-network query propagation, and aggregation algorithm. ELAQs are triggered by the events and the query results are dependent on mobile sensors’ location, which are the characteristics of ELAQ model. The results show that compared with the TinyDB query processing approach, ELAQ processing approach increases the accuracy of the query result and decreases the query response time. Biography: HONG Liang (1982–), male, Ph.D. candidate, research direction: database system, sensor network.     

New Abnormal Cervical Cell Detection Method of Multi-Spectral Pap Smears

Considering the problem of traditional cervical cancer detection method that brings high false negative rate （FNR） and high false positive rate （FPR）, a new abnormal cervical cells detection method of multi-spectral Pap smear is proposed in this thesis, on the basis of multi-spectral microscopic imaging technology and computer automotive recognition technology. At first, image in a specific wave band is segmented according to the relationship between intensity and spectrum of each pixel. Then, multi-spectral features of each pixel are extracted making use of improved cosine correlation analysis （CCA） algorithm. Combined with the characteristic of each cell＇s area, final definition is made. Experiments have proved the new approach could identify abnormal cells efficiently as well as lower FNR and FPR.     

Authenticated Diffie-Hellman key agreement protocol with forward secrecy

Forward secrecy is an important security property in key agreement protocol. Based on Ham＇s protocol, in this paper a new authenticated Diffie-Hellman key agreement protocol with half forward secrecy is proposed. This protocol is also based on a single cryptographic assumption, and is user authentication and shared key authentication. More importantly, our protocol provides forward secrecy with respect to one of the parties. For this reason, besides the advantages of Ham＇s protocol, in practice, our protocol can reduce the damages resulted from the disclosure of the user＇s secret key and it is very beneficial to today＇s communication with portable devices.     

Secure localization algorithm based on node cooperative for sensor networks

As to the safety threats faced by sensor networks （SN）, nodes limitations of computation, memory and communication, a secure location algorithm （node cooperative secure localization, NCSL） is presented in this paper. The algorithm takes the improvements of SN location information security as its design targets, utilizing nodes＇ cooperation to build virtual antennae array to communicate and localize, and gains arraying antenna advantage for SN without extra hardware cost, such as reducing multi-path effects, increasing receivers＇ signal to noise ratio and system capa- bility, reducing transmitting power, and so on. Simulations show that the algorithm based on virtual antennae array has good localization ability with a at high accuracy in direction-of-arrival （DOA） estimation, and makes SN capable to resist common malicious attacks, especially wormhole attack, by using the judgment rules for malicious attacks.     

Mining Representative Subset Based on Fuzzy Clustering

Two new concepts-fuzzy mutuality and average fuzzy entropy are presented. Then based on these concepts, a new algorithm-RSMA （representative subset mining algorithm） is proposed, which can abstract representative subset from massive data. To accelerate the speed of producing representative subset, an improved algorithm-ARSMA（accelerated representative subset mining algorithm） is advanced, which adopt combining putting forward with backward strategies. In this way, the performance of the algorithm is improved. Finally we make experiments on real datasets and evaluate the representative subset. The experiment shows that ARSMA algorithm is more excellent than RandomPick algorithm either on effectiveness or efficiency.     

Automatic Web services composition based on SLM

Motivated by the problem of simplifying the manual operation of the composition process, we propose an approach to automatically compose available Web services to fulfill user＇s goal based on the assumption that there are a set of alternative Web services with similar functionality and different QoS properties. A formal model （i.e. semantic links matrix, SLM for short ） is proposed to store semantic links values for the Web services with semantic relationship and QoS of Web services. The SLM provides a search place for a backward-search planning algorithm, at the same time; the QoS criteria make a rational and effective decision among a number of similar Web services. The function and some properties of the algorithm are analyzed. The approach can improve the correctness and flexibility for Web services composition and satisfy the local QoS attribute.     

Combination Reduction： A SYN-Sequence Selection Strategy for Reachability Testing of Concurrent Programs

Reachability testing is an approach to testing concurrent programs, which can systematically exercise every partially ordered SYN-sequence without constructing the static model. In fact, not all the SYN-sequences need to be tested. This paper proposed a SYN-sequence selection strategy for reachability testing, which can reduce the number of SYN-sequences generated without decreasing the effectiveness of detecting programs＇ errors. We described a simple algorithm to implement the strategy, and then discussed several optimizations to the algorithm. Experiments have been carried out in a case study to verify the efficacy of the strategy.     

Two-phase genetic algorithm applied in the optimization of multi-modal function

This paper presents a two-phase genetic algorithm (TPGA) based on the multi-parent genetic algorithm (MPGA). Through analysis we find MPGA will lead the population’s evolvement to diversity or convergence according to the population size and the crossover size, so we make it run in different forms during the global and local optimization phases and then forms TPGA. The experiment results show that TPGA is very efficient for the optimization of low-dimension multi-modal functions) usually we can obtain all the global optimal solutions. Foundation item: Supported by the National Natural Science Foundation of China (70071042, 60073043,60133010) Biography: Huang Yu-zhen ( 1977-), female, Master candidate, research direction; evolution computation.     

基于改进优先级的相控阵雷达任务调度方法

针对相控阵雷达多目标跟踪中的资源调度的问题,提出基于改进优先级的任务调度方法。该方法将目标对雷达的威胁引入到目标任务优先级设计当中,首先,定义目标威胁度,根据目标和雷达的各项参数指标,将信息熵综合决策与主观权重法相结合,计算出目标的威胁度值;然后,将目标的威胁度值、任务工作方式优先级以及任务截止期进行综合规划,得到目标任务的综合优先级,最后对目标威胁度的计算和任务的调度分别进行仿真。仿真结果表明,方法对目标威胁程度的计算结果符合不同威胁度等级目标跟踪资源分配的需求,对高威胁任务的执行优于传统方法,具有一定的优越性。     

A New Feature Selection Method for Text Clustering

Feature selection methods have been successfully applied to text categorization but seldom applied to text clustering due to the unavailability of class label information. In this paper, a new feature selection method for text clustering based on expectation maximization and cluster validity is proposed. It uses supervised feature selection method on the intermediate clustering result which is generated during iterative clustering to do feature selection for text clustering; meanwhile, the Davies-Bouldin＇s index is used to evaluate the intermediate feature subsets indirectly. Then feature subsets are selected according to the curve of the Davies-Bouldin＇s index. Experiment is carried out on several popular datasets and the results show the advantages of the proposed method.     

A Method to Implement Full Anonymous Attestation for Trusted Computing Platform

Trusted computing （TC） technology is brought out by trusted computing group （TCG） to make computing as safe and reliable as people expect. Attestation is one main function specified by TCG, which is the means by which a trusted computer assures a remote computer whose platform is not tampered with. There are two protocols that implement attestation without disclosing the platform＇s real identity, which are Privacy CA-based protocol and direct anonymous attestation （DAA） protocol. However, in the first protocol the privacy CA is the bottleneck and the platform＇s identity will be disclosed if the privacy CA is compromise, while DAA protocol can do profiling when dealing with rogue hardware device. In this paper, we propose a DAA-extended new approach to ensure full anonymous attestation that can not only detect a rogue TPM, but also reveal rogue TPM＇s real identity.