Popular distributed graph processing frameworks, such as Pregel and GraphLab, are based on the vertex-centric computation model, where users write their customized Compute function for each vertex to process the data iteratively. Vertices are evenly partitioned among the compute nodes, and the granularity of parallelism of the graph algorithm is normally tuned by adjusting the number of compute nodes. Vertex-centric model splits the computation into phases. Inside one specific phase, the computation proceeds as an embarrassingly parallel process, because no communication between compute nodes incurs. By default, current graph engine only handles one iteration of the algorithm in a phase. However, in this paper, we find that we can also tune the granularity of parallelism, by aggregating the computation of multiple iterations into one phase, which has a significant impact on the performance of the graph algorithm. In the ideal case, if all computations are handled in one phase, the whole algorithm turns into an embarrassingly parallel algorithm and the benefit of parallelism is maximized. Based on this observation, we propose two approaches, a function-based approach and a parameter-based approach, to automatically transform a Pregel algorithm into a new one with tunable granularity of parallelism. We study the cost of such transformation and the trade-off between the granularity of parallelism and the performance. We provide a new direction to tune the performance of parallel algorithms. Finally, the approaches are implemented in our graph processing system, N2, and we illustrate their performance using popular graph algorithms.

Web service personalization is an important research topic in the area of service-oriented computing which has the potential to bring more service value to end users that are fit for individual user's particular needs. In this paper, we propose Rule nets, which is based on PrT (Predicate/Transition) nets. Rule nets has the capability to model a wide spectrum of rules for expressing personalization needs. There rules then can be woven to a business process to bring flexible personalization features to this process. The woven process can be expressed as a PrT net suitable for formal analysis and simulation using existing Petri net tools.

In recent years, the Web service composition technology has developed rapidly, as a result, the energy consumption problem is also increasingly prominent. Faced with this situation, the paper firstly gives out the power model of single service; then derives the model of service composition according to its characteristics, and gives out the corresponding QoS constraints at the same time. After finishing the model, the paper talks about the allocation of feasible path, which is one of the problem in model calculation. The author introduces a graph-plan based searching algorithm, and uses the concept of hierarchical search to solve the problem. At last, the experimental results show that compared with traditional methods, the approach in this paper can not only satisfy the user requests with QoS restricted, but also reduce the energy consumption of service composition effectively.

A Digital polishing machine used to polish electric kettle surface is introduced in order to resolve the problems of serious pollution,low efficiency and unstable quality with the manual polishing of the kettle surface.The paper describes the error's reason and the influence caused by the stepping motor lost time of the machine and then proposes the method that the acceleration and deceleration are controlled by the stepping motor base on 51SCM to eliminate the error.In the same time,the feasibility of these methods is confirmed through experiments.

This paper introduces a kind of polishing process based on automatic polishing system,which is used for stainless steel instead of hand work to achieve stable quality,high efficiency.Assuming that the polishing process obeys elliptical Hertzian contact,preston equation is used to find out thess factors of the material removal quantity relationship among abrasive and surface,touch press under the relative speed.The screw pitch of helix track is choosed rightly to ensure the uniformity of surface quality from the processing experiment it is concluded that the perfect finishing surface can be gained.

OBJECTIVE: To identify and evaluate the informative set of genes for DNA methylation-based detection of bladder cancer in urine sediments.METHODS: Methylation specific PCR was used in the test.RESULTS: Ninety of 20 genes tested in three bladder cancer cell lines(T24,5637 and SCaBER) had at least one allele methylated.Six genes were MSP profiled in urine sediments from 40 cases of bladder cancer and the following controls: the healthy volunteers(7 cases),non-cancerous urinary diseases(23 cases) and the neurological diseases(6 cases).While no methylated were observed in the control groups,the methylated incidence in bladder cancer group was: SALL3 is 67.5%(27/40),MT1A is 50.0%(20/40),HPP1 is 50.0%(20/40),MYOD1 is 37.5%(15/40),BRCA1 is 32.5%(13/40),and TMS1 is 5.0%(2/40),respectively.By using any gene being hypermethylated of the 5 most frequently methylated genes tested as the positive indicator,over 90%(36/40 cases) bladder cancer cases in this retrospective study were detectable.CONCLUSION: MSP profiling of these 5 genes in urine sediments is a potentially robust method for the non-invasive detection of bladder cancer.

以巯基乙酸（HSCH2COOH）为稳定剂,在水溶液中合成半导体CdTe纳米晶。通过隧道扫描显微镜（STM）、紫外吸收光谱、荧光光谱等测试技术对所得的样品进行表征。结果表明,随着回流时间的增加,CdTe半导体纳米晶的粒径变大,其荧光发射峰和紫外吸收峰发生红移,荧光颜色从绿色逐渐向红色过渡。