Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 10 papers published in subject: > since this site started. |
Results per page: |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. Multidimensional Features Based Model for Social Network User Classification | |||
MO Qin-Chu,DENG Xiao-Long1,SONG Lin-Ming | |||
Computer Science and Technology 12 March 2021 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In recent years, social network users have been the focus of research, but existing research often divides users into normal and malicious users, lacking a more detailed analysis. To address the absence of a precise user classification model, this paper builds a three-dimensional classification model including Anti-bot Analysis, Publicity, and Hashtag Manipulation for measuring user behaviors and classifying users into four categories: harmless users, publicizing users, hashtag hijacking users, and malicious publicizing users. Based on the classification model, this paper has built a set of user classification features, and introduces four new features. We also create two new Weibo user datasets with new features, and re-processes an existing Weibo user dataset. The experimental results show that the model and features proposed in this paper have good classification efficiency for precise Weibo user classification and bot behavior recognition, and have obvious classification improvement for decision trees and BP neural networks. | |||
TO cite this article:MO Qin-Chu,DENG Xiao-Long1,SONG Lin-Ming. Multidimensional Features Based Model for Social Network User Classification[OL].[12 March 2021] http://en.paper.edu.cn/en_releasepaper/content/4753963 |
2. Wiener Granger Causality Index based on a generalized Akaike's Information Criterion and its application in EEG | |||
YANG Chunfeng,XIANG Wentao,Wu Jiasong,LE BOUQUIN JEANNES Régine,SHU Huazhong | |||
Computer Science and Technology 21 August 2014 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Our objective is to analyze EEG signals recorded with depth electrodes during seizures in patients with drug-resistant epilepsy. The Wiener-Granger Causality Index (WGCI) is an effective measure to detect causal relations of interdependence in EEG signals. In this paper, a generalized Akaike's Information Criterion (gAIC) algorithm is presented and incorporated in the WGCI to estimate the model orders which play an important role in such an approach. Experimental simulation results support the interesting performance of the proposed algorithm to characterize the information flow both in a linear stochastic system and in a physiology-based model. | |||
TO cite this article:YANG Chunfeng,XIANG Wentao,Wu Jiasong, et al. Wiener Granger Causality Index based on a generalized Akaike's Information Criterion and its application in EEG[OL].[21 August 2014] http://en.paper.edu.cn/en_releasepaper/content/4607101 |
3. Research on Distributed Web Service Mining Method Based on Peer to Peer | |||
Zhu Hongkang,Yu Xueli | |||
Computer Science and Technology 18 February 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Composite service selection is a research difficulty in service-oriented computing domain. Most selection approaches are based on service QoS information which is difficult to acquire accurately. In this paper, a distributed web service usage pattern mining infrastructure based on services execution information is proposed. In order to meet the cross-organizational associated business requirement, a service registry federation mechanism is presented. Then, a distributed algorithm of composite service frequent sequential mining within registry federation is described. In the end, some simulation results are demonstrated to show the effectiveness of the proposed method. | |||
TO cite this article:Zhu Hongkang,Yu Xueli. Research on Distributed Web Service Mining Method Based on Peer to Peer[OL].[18 February 2012] http://en.paper.edu.cn/en_releasepaper/content/4464144 |
4. Multiple Description Video Coding Using Rate-Distortion Optimized Temporal Sampling | |||
Huihui Bai,Lili Wan | |||
Computer Science and Technology 10 February 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, an effective multiple description video codec is designed based on pre- and post-processing of video sequences without modifying the actual coding process itself, which makes it compatible with the current standard coding. In pre-processing, adaptive modes of temporal sampling are employed to regulate the motion change between frames before performing odd/even frame splitting, which facilitates a good estimation of lost frames in post-processing after side decoding. In particular, given a central distortion, rate-distortion optimization with La-grangian formulation is applied in pre-processing to achieve a good tradeoff between bit rate and side distortion. Furthermore, for simplicity of the Lagrangian multiplier selection, a new optimization criterion is proposed based on the correlation of intra-/inter-description. The experimental results exhibit better performance of the proposed scheme than other tested schemes. | |||
TO cite this article:Huihui Bai,Lili Wan. Multiple Description Video Coding Using Rate-Distortion Optimized Temporal Sampling[OL].[10 February 2012] http://en.paper.edu.cn/en_releasepaper/content/4465152 |
5. A Destination-Oriented Multicast Trees Optimization Algorithm for Controlling P2P Traffic | |||
An Yuyan,LI Yue,Zhao Yuhui | |||
Computer Science and Technology 20 January 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:It is necessary to control the P2P traffic among ASs (Autonomous Systems) while the P2P applications occupy the most bandwidth of the backbone network. Instead of only restricting the P2P applications, the paper suggests an intelligent relay method based on P2P communities model. The Proxy of Content Caching (PCC) nodes is proposed which are used to manage the local content cache in the P2P communities. The problems of building the Core Overlay Multicast Tree (COMT) among the PCC nodes can be reduced to the Minimal Steiner Tree Problem (MSTP). For optimizing the multicast trees, the off-line genetic algorithm (GA) is adopted, which uses the destination-oriented method for represent chromosomes and genetic operators. Simulation experimental results show that our model can obtain a near optimal solution for COMT, which has the feathers of low bandwidth cost and high scalability. | |||
TO cite this article:An Yuyan,LI Yue,Zhao Yuhui. A Destination-Oriented Multicast Trees Optimization Algorithm for Controlling P2P Traffic[OL].[20 January 2012] http://en.paper.edu.cn/en_releasepaper/content/4462349 |
6. An Improved Infrared and Visible Images Registration Based on SURF Algorithm | |||
DENG Jixuan,CHENG Yongqiang,GUO Feng,XU Fengliang | |||
Computer Science and Technology 16 December 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract: Image registration is the basis of image processing. As the Harris algorithm is depend on scale and the SIFT(Scale Invariant Feature Transform) Algorithm is depend on the hardware, an image registration based on SURF(Speeded Up Robust Features) algorithm is proposed. First, the correspondences are found by SURF algorithm. Second the descriptor is made by computing the sum of Haar wavelet responses. Then matching points are using Euclidean distance. To improve the matching speed, the features which have the same type of contrast are only compared. The effectiveness of the method is also verified by the experiment. | |||
TO cite this article:DENG Jixuan,CHENG Yongqiang,GUO Feng, et al. An Improved Infrared and Visible Images Registration Based on SURF Algorithm[OL].[16 December 2011] http://en.paper.edu.cn/en_releasepaper/content/4456157 |
7. Research on Assembly Sequence Planning Based on Improved Slope One Algorithm | |||
JIN Yu,HOU Wenjun,YANG Fuxing | |||
Computer Science and Technology 09 October 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:According to the characteristics and needs of complicated products, a method for handing assembly sequence based on improved Slope One algorithm was proposed. On the basis of that the network graph of assembly relationship was constructed, and a method for simplifying it was proposed by expressing elliptically same parts, identifying and hiding fasteners. In this paper, Slope One algorithm was initially introduced into the assembly sequence planning, and it was improved according to the problems to be resolved. In the meantime, particle swarm optimization algorithm was introduced into the feedback of the recommendation result. The method has been proved that it was not only used to obtain a good recommendation of assembly sequence but also sensitive to the individuation of designers. | |||
TO cite this article:JIN Yu,HOU Wenjun,YANG Fuxing. Research on Assembly Sequence Planning Based on Improved Slope One Algorithm[OL].[ 9 October 2011] http://en.paper.edu.cn/en_releasepaper/content/4445176 |
8. Feature-Distance-Based Region Matching Interpolation of Multidimensional Grey-Level Images | |||
Su Yong,Zhang Caiming | |||
Computer Science and Technology 18 June 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Image interpolation plays an important role in three-dimensional reconstruction, and the interpolation results have a great impact on the reconstruction directly. A feature-distance-based region matching interpolation method is presented in this paper: First, the corresponding relation between the interpolated images is built by an optimization process which is based on the gray value, the gradient of the gray value, the gradient direction in neighboring slices and the gray-scale continuous threshold which is set to get the paired points. Second, for the best-matching point pair, linear interpolation, and for the worst-matching point pair, we calculate the shortest feature distance to the relative feature points and use the shortest feature distance to control the image interpolation. The results show that the new method does not require the image shape information and can improve the image fuzzy border problem of internal organs and enhance the quality of the interpolated images. | |||
TO cite this article:Su Yong,Zhang Caiming. Feature-Distance-Based Region Matching Interpolation of Multidimensional Grey-Level Images[OL].[18 June 2009] http://en.paper.edu.cn/en_releasepaper/content/33255 |
9. Sublingual Vein Segmentation Based on Color Features | |||
Zifei Yan,Kuanquan Wang,Naimin Li | |||
Computer Science and Technology 06 January 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The Sublingual Vein Diagnosis, one part of Tongue Diagnosis, plays an important role in deciding the healthy condition of humans. So far, extensive studies have been made on extracting tongue surface features, but rarely refer to sublingual vein that is also diagnostically important. This paper presents two approaches to segment the sublingual veins taking the color features of sublingual images into consideration. Experimental results show that, sublingual vein structures can been successfully mapped for 129 out of 150 patients and healthy subjects, when utilizing u component and S component for segmentation, and the average segmentation rate is up to 86%. | |||
TO cite this article:Zifei Yan,Kuanquan Wang,Naimin Li. Sublingual Vein Segmentation Based on Color Features[OL].[ 6 January 2008] http://en.paper.edu.cn/en_releasepaper/content/17785 |
10. The Research on Using STK to the Simulation of Interference in Satellite Communication | |||
Shi Zhiliang | |||
Computer Science and Technology 16 March 2007 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The purpose of the simulation of the interference in the satellite communication is to determine the affection of the interference. This paper puts forward a method of the simulation of the interference in the satellite communication using STK/Comm., builds a scenario and analyses the effect of the interference. | |||
TO cite this article:Shi Zhiliang. The Research on Using STK to the Simulation of Interference in Satellite Communication [OL].[16 March 2007] http://en.paper.edu.cn/en_releasepaper/content/11472 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
|
Results per page: |
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated