Search

Internet addiction is a serious social problem nowadays. People with internet addiction usually spend much time on line, which there is no effectively technical way to evaluate. We propose a time-online evaluating method based on net log. The method gathers adjacent timestamps of every account's network log into a cluster, which can be seen as a time period. The sum of all periods is the account's total time online. Besides, we apply parallel processing in the data analysis and cluster. The experiments on real datasets show that this method is effective for time online evaluation.

Topic models such as LDA have been widely used to capture latent topics in textual collections. Due to the large scale of data, researchers begin to pay more attention to speed up the efficiency of LDA Gibbs sampling by parallel inference algorithms or distributed computing. In this paper, we improve the traditional Approximate Distributed LDA (AD-LDA) algorithm by introducing weighted factor during iteration of Gibbs sampling, and propose a novel model called Weighted AD-LDA (WAD-LDA). Experiments are conducted over real-world dataset and the results show that our method can promote the computing efficiency significantly and can achieve meaningful topics as AD-LDA simultaneously.

3D reconstruction from the microscopy images of serial sections plays an important role in analyzing structure of biological specimens, such as neuronal circuits in brain tissue. This paper is focusing on the 3D reconstruction of synapses which is a branch of micro reconstruction of brain. Having analysed the structure of synapses, we first detect and locate them in serial sections with cascade AdaBoost algorithm, then optimize the shape of synapses by constructing suitable fitting functions and segment them with morphology processing method. Taking the connection of adjacent sections and synaptic extensibility in space into consideration, we complete the reconstruction of synapses which is based on the segmentation in serial sections. Actually all our works are based on the registration of serial sections.

this paper emphasizes on the interface complexity — one of the most influential factors affecting Web Services invocation performance. Our ultimate goal is to propose a novel and versatile model to measure the interface complexity. First we introduce the term WSDL2Java Cost to measure the overall cost for converting a WSDL file into server-side Java source code. Then we conduct myriads of experiments to respectively figure out the correlations between parameters, operations, their synthetic effects and the WSDL2Java Cost with various SOAP toolkits. We analyze the experimental results, finding an interesting feature called PODU (Parameter-to-Operation Distribution Unrelated), and introduce a model named WSDL Contour to measure the interface complexity. In order to test our model, we ad hoc refer to more than 9,000 WSDL files on the World Wide Web. In the end, based on our experimental results and the WSDL Contour model, we give some advice on Web Services Interface Design Principle, especially on the Web Services Granularity in the aspect of interface complexity.