Android adware shows advertisement in a disruptive way, and has the possibility to further transform into malware which posed a serious threat to user’s smartphone. The traditional adware detection method has high time costs and depends on dynamic feature of Android adware,making it difficult to respond to large-scale, high-precision detection requirements. To solve this problem, an Android adware static detection method based on improved random forest algorithm was proposed. Based on the characteristics of android adware, on the basis of traditional application programming interface, permission and intent, the third party library was included in the scope of feature selection. Statically decompile all the APK of adware collected in the dataset and extract the static information from them, and the static information was statistically analyzed to obtain the highfrequency information. After filtering this information, the base feature set was determined, and the static information in each APK was extracted and transforms into the feature vector, based on the idea of ensemble, used a variety of feature selection algorithms to joinly select features for model training and gave feature weights. Finally, the improved random forest algorithm based feature weights was used to improve the accuracy of the classifier, 5751 adware and 3465 non-adware application were selected for classification detection. The experimental results prove that the method has a faster speed while ensuring the accuracy.

Hive's existing audit function cannot make compliance judgment on the purpose of data operation. To solve the above problems, a hive data operation compliance analysis method based on subgraph isomorphism is proposed. Firstly, the modeling method of hive data operation and compliance rules based on graph is proposed to form data traceability graph and compliance rule graph; Then, the compliance judgment of data operation is modeled as the matching problem of traceability graph and compliance graph, and a solution algorithm based on subgraph isomorphism is proposed. Finally, the experimental verification is carried out in the data governance platforms Apache atlas and hive. The experimental results show that the proposed method has higher compliance verification efficiency than the collection based compliance verification.

The concealing technology of Trojan horses which determines the concealing capability and the life cycle of Trojan is one of the most important technologies in Trojan horse. This paper puts forward a model of distributed Trojan Horses cooperative concealment. This model can reflect the variation rate of Trojan horses and the migration status of hosts and so on. Experiment results demonstrate that it can improve the concealment capability of Trojan and reduce the probability of remote control being found.

Besides the improvement of the security of our system,Trusted Computing also contributes a lot of restricting for users. Aimed at resolving the problem of trusted verification of free software,a distributed trusted verification mechanism called DTVMTC on the strength of Trusted Computing is presented.Based on the huge amount of Internet users,this progress manages to verify the software’s reliability through the network data statistics,as a result of assuring the user’s using Trusted Computing Platform at one’s own discretion by verifying the application with no trusted source.Finally,a prototype of DTVMTC is presented and this in return indicates the outstanding performance of DTVMTC in achieving targets in advance.

Ray-tracing is the technique that rendering images from a three dimensional model of a scene by projecting it on to a two dimensional image plane.In the past decades,the development of the computer graphic(especial for raster graphics systems) emphasize on building the high-efficient,low-cost large graphic systems.For the above-mentioned reasons such as the implementation of a large number of mathematical calculation,the large-scale parallel processing technologies play a important role in graphics compose.The principle of ray-tracing algorithm is introduced.A ray-tracing parallel processing model is built through the research on GPU stream processing and MPICH,and it is proved that applying this mode reduces computation time effectively and the quality of the generated graph holds no difference with that by traditional stand-alone computer.

对于分布式异构数据库,查询优化既是非常复杂的问题,又是影响系统性能的关键因素。结合遗传算法和模拟退火算法的优点,提出基于遗传模拟退火算法的分布式异构数据库查询优化方法。仿真实验表明,该方法有效地提高分布式异构数据库的查询优化效率。

Regression analysis is one of the important methods in the data mining system.This paper mainly researches how to use the regression models for modeling data mining,introduces the regression model followed by 3 types,the parameter estimation based on the least squares,the significant validation and presents three kinds of optimization algorithm that included the test and deal of disperse extremum,model improvement and the selection of independent variable.Finally,it explains the regression analysis in data mining application through real data.

Nowadays multi-core processors are becoming more and more popular.Past serial ways of programming can no longer make full use of multi-core CPU power.How to efficiently use the computation ability of multi-core processors has become a new challenge to software developers.Based on traditional multi-thread programming,according to features of Intel Microarchitecure,and CPU binding technology provided by Linux kernel,Cache optimization and CPU affinity optimization are introduced,aiming to eliminate Cache line competition and reduce the cost of thread schedule.After these optimizations,multi-thread program will be running more efficiently.

Globus Toolkit(GT)作为构建网格计算系统的系统软件,提供解决网格计算问题所需的一系列服务模块,简化用户开发网格应用程序的流程。因此,详细分析网格安全架构(GSI),它为网格应用提供基础安全服务。

Nowadays multi-core processors are becoming more and more common.How to make every core in a CPU work most effectively in order to enhance performance through software multi-threading has become a hotspot.So Threading Building Blocks was introduced.Compared the advantages and disadvantages of TBB to raw threads and OpenMP.Also researched on the computing applications of mixing TBB with MPI on SMP cluster.As a result,found TBB had many significant advantages on multi-core programming.Mixing TTB with MPI provides a layered structure for computing applications on multi-core cluster,and it highly optimized the performance of clusters.

Web service provides applications running on different platforms with interoperability.It is based on a centralized architecture.P2P network takes advantages of decentralization,self-organization etc.More and more scholars begin to study how to deploy and discover Web services based on P2P network.Illustrate the idea of Web service and its architecture.Introduce JXTA platform and its approach of deploying and locating services.Put forward a process model for implementing Web service on a JXTA network.Overcome the shortage of centralized mechanism used in traditional Web service architecture.Security,integrity and identification for messages used in Web service invoke process can be implemented by the JXTA platform.

High performance computing (HPC) is becoming more and more popular in recent years for its high productivity by using parallel processing algorithms. The concept of HPC and the data processing for gene chip(DPGC) are firstly introduced and a programming model based on MPI is given to address the problem in gene chip data processing, which takes too long time for huge data processing due to computing ability of one CPU is relatively quite low. The programming model is discussed in detail including system environment, system structure and data processing work flow. At last, a demo program is shown to demonstrate its feasibility and the processing result is compared with traditional gene chip data processing's.

Data packets are transmistted on a path that had least hops in AODV protocol. It couldn’t consider the path stability. When the path had short lifetime, the path recovery and routing again is caused. It is a lot of network resource. For network performance, AODV-S-M is provided to improve AODV protocol. It used navigating technology to predict path lifetime and selected the less hops but high stability path to send data packets. In the same time, multi-path are introduced to assure the path stability. Finally, two protocols is compared using network simulator. It confirms the latter can improve the delivery rate of data packets and reduce the routing overhead.

The DSR(dynamic source routing) protocol is typically one of the on-demand routing protocols for wireless Ad hoc networks.But it lacks the corresponding renewal mechanism for routes in the route cache.Through detailed research on the cache mechanism of DSR routing protocol,a new strategy is put forward using the information of route expiration based on the past,which is the weight ration between initiative expiration and passive expiration,and the information of current route with forecast of survival period towards each route that is newly added.The value of cache expiration,set dynamically,differs in each new route.It thus conforms to the current condition of networks to some extent,and eventually reduces the impact brought by the expired route and therefore can improve the per-formance of Ad hoc networks.

AODV is an on-demand routing protocol which is specifically designed for MANET.It's revealed that the performance of this protocol degrades drastically as the load becomes heavy or the topology changes frequently.It represents a Location Aided AODV Routing Protocol to improve its performance.The mobile node determin the broadcasting restricted area by its position ob- tained.The message's transmit area is limited to the restricted area.In this way,the number of the message transmitted,the retransmit nodes involved and the confliction reduce.This results in a significant reduction in the number of routing overhead.The experiment confirms that the improved protocol obtains a better performance when the heavy load and the frequent topology changes appear.

The article introduces the concepts of MPI and grid computing,and describes the working principle of MPICH-G2 with its characteristics.The article also explains the way of implementing MPI parallel computing under grid with MPICH-G2,whose communication performance and application actuality are discussed later,and displays the importance of MPICH-G2 in grid computing through detail analysis of the typical examples of constructing the distributed and heterogeneous environment with MPICH-G2 and Globus grid service.Finally,the article summarizes the problems and future of MPICH-G2.

There are a lot of different report forms in enterprise WEB applications.The developers working at the model layer have to develop business logic on each report form because of the different form objects.Obviously the reuse ratio of code is very low and it wastes much human resource.According to this problem this paper represents enterprise report form groupware based on Struts and Hibernate frame,which can build different report forms automatically.The developer only need give the searching object,searching condition and display format(read only,read/write),then it can build report form automatically.There is no need to write any code.

Nowadays producers breed pigs through abusing hormone,microelement and non-observance drugs.However,consumers can't discern this harmful pork that seriously threatens food hygiene and safety of people.For purpose,it is a idealer method that sets up the safe and sanitary tracking system of pork production for emsuring food hygiene and safety of people.The system applies advanced radio frequency identification technology and compositive software management.It also carries out three net uniting as one search way by one-dimensional form code.

Message-passing mechanisms take a very important part in distributed computing.With the increasing need for high perform-ance computing and the appearances of many new technologies,message-passing mechanisms are also in need of exploration and impro-vement.Two major message-passing systems,PVM and MPI,are compared in detail in many aspects at first,such as background,objective,portability,communication and etc.According to the current situation of message-passing mechanisms,the latest development is shown.Finaly,the conclusion of the future trend of message-passing mechanisms is given.

This paper presents a watermarking algorithm based on fractal coding and wavelet transform. In this method, we adopt images which are self-similar to search for its Iterated Function System(IFS) as the watermark information, considering the robust against geometric transformations of fractal code. A chaos system is utilized to control the position of watermark embedded in the DWT domain, and then append the ITS coefficients to the wavelet decomposition coefficients. The approach proves rather efficient against many kinds of distortions.