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 84 papers published in subject: since this site started. |
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. Unsupervised domain adaptation with joint supervised sparse coding and Discriminative regularization term | |||
ZHU Lin,ZHANG Xiang,ZHANG Wenju,HUANG Xuhui,GUAN Naiyang,LUO Zhigang | |||
Computer Science and Technology 04 May 2017 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Domain adaptation (DA) is to narrow the gap of the distributions across domains with the hope of enhancing the generalization capability of classifier. This paper focuses on the most challenging unsupervised domain adaptation where no labels are available in target domain. Most existing approaches explore the domain-invariant features shared by domains but neglect the valuable discriminative information of source domain. To address this issue, we propose a discriminative domain adaptation method (DDA) to reduce domain shift by seeking a common discriminative subspace jointly using supervised sparse coding (SSC) and discriminative regularization term. Particularly, DDA adapts SSC to yield discriminative coefficients of target data and further unites with discriminative regularization term to induce a discriminative common subspace across domains. We show that both strategies can boost the knowledge transferability of source domain to target domain. Experiments on two real world datasets demonstrate the effectiveness of our proposed method over several existing state-of-the-art domain adaptation methods. | |||
TO cite this article:ZHU Lin,ZHANG Xiang,ZHANG Wenju, et al. Unsupervised domain adaptation with joint supervised sparse coding and Discriminative regularization term[OL].[ 4 May 2017] http://en.paper.edu.cn/en_releasepaper/content/4732643 |
2. A User Interest Recommendation Model Based on Topic Network and Social Graph | |||
TANG Zhirong,TIAN Ye,WANG Wendong | |||
Computer Science and Technology 02 May 2017 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Detecting user interested topics is one of the most important issues in a recommender system. A topic recommendation model is proposed in this paper, which utilizes the topic network and the social graph to recommend topics that are interesting to the user. The model could be applied to a social Q&A (Question and Answering) system. First, all the topics in the social Q&A system are organized as a topic network. By analyzing the topics that the users have followed and the topic distribution in the topic network, we explore the most relevant topics for users. Secondly, we observe that the topics which attract the majority of our friends or the topics that our best friends are concerned about, might be prospective interesting topics for us. Therefore, we consider these two kinds of scenarios simultaneously to design the topic recommendation algorithm. Based on the data set derived from the Quora website, the experimental results demonstrate that our algorithm outperforms the standard Collaborative Filtering (CF) in the accuracy. | |||
TO cite this article:TANG Zhirong,TIAN Ye,WANG Wendong. A User Interest Recommendation Model Based on Topic Network and Social Graph[OL].[ 2 May 2017] http://en.paper.edu.cn/en_releasepaper/content/4731619 |
3. Adaptive Clustering Algorithm based small Group Detection and Tracking | |||
CHENG Zhongbin,ZOU Qi,TIAN Mei | |||
Computer Science and Technology 02 September 2016 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:We propose to detect and track small groups of individuals who are traveling together in surveiuance videos. Coherent groups are dynamically updated through merge and split events. To handle these challenges, we propose to discover groups by adaptive clustering (AGD). Experiments on challenging videos (FM dataset) which have complex motions and occlusions show that the proposed method based on trajectory-level similarity can correctly discover dynamic changes of groups. The effectiveness of the proposed approach is shown through comparison with classical methods. | |||
TO cite this article:CHENG Zhongbin,ZOU Qi,TIAN Mei. Adaptive Clustering Algorithm based small Group Detection and Tracking[OL].[ 2 September 2016] http://en.paper.edu.cn/en_releasepaper/content/4703372 |
4. New Public-Key Cryptosystem Based on the Morphism of Polynomials Problem | |||
WANG Hou-Zhen,ZHANG Huan-Guo, MAO Shao-Wu,WU Wan-Qing | |||
Computer Science and Technology 19 May 2016 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract: During the last two decades, there has been intensive and fast development in the multivariate public key cryptography (MPKC), which is considered to be an important candidate for post-quantum cryptography. However, it is universally regarded as a difficult task, as in the Knapsack cryptosystems, to design a secure MPKC scheme (especially encryption scheme) employing the existing trapdoor construction. In this paper, we propose a new key exchange scheme and MPKC scheme based on the Morphism of Polynomials problem. The security of the proposed schemes is provably reducible to the conjectured intractability of a new difficult problem, namely the decisional multivariate Diffie-Hellman(DMDH) problem originated from the Morphism of Polynomials problem. The proposed key agreement is one of several non number theory based protocols, and shall be considered to be a candidate for the post-quantum era. More importantly, by slightly modifying the protocol, we offer a truly original approach to design the secure MPKC scheme. Furthermore, the proposed encryption scheme achieves a good tradeoff between security and efficiency, and seems fairly competitive in comparison with the traditional MPKC schemes. | |||
TO cite this article:WANG Hou-Zhen,ZHANG Huan-Guo, MAO Shao-Wu, et al. New Public-Key Cryptosystem Based on the Morphism of Polynomials Problem[OL].[19 May 2016] http://en.paper.edu.cn/en_releasepaper/content/4692638 |
5. Procedural Texture Generation Based on Semantic Descriptions | |||
DONG Jun-Yu, WANG Li-Na, LIU Jun,SUN Xin | |||
Computer Science and Technology 10 May 2016 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Procedural textures are normally generated from mathematical models and have been widely used in computer games and animations for efficient rendering of natural elements, such as wood, marble, stone and other materials. Although the intuitive way to describe procedural texture is to use semantic attributes, there is no connection between procedural models, model parameters and texture semantic descriptions. In this paper, we propose a novel framework for generating procedural textures according to semantic descriptions. First a vocabulary of semantic attributes is collected for describing procedural textures based on extensive psychophysical experiments. Then a multi-label learning method is employed to label more new textures using the semantic attributes. We construct a procedural texture dataset with semantic attributes and further learn a low-dimensional semantic texture space. Finally, for a set of input semantic descriptions, we are able to find a generation model with proper parameters in this space. This model can be used to generate procedural textures that retain the input semantic attributes. Experimental results show that the proposed framework is effective and the generated procedural textures are correlated with the corresponding input semantic descriptions. | |||
TO cite this article:DONG Jun-Yu, WANG Li-Na, LIU Jun, et al. Procedural Texture Generation Based on Semantic Descriptions[OL].[10 May 2016] http://en.paper.edu.cn/en_releasepaper/content/4688895 |
6. A privacy preserving method for community location sensing | |||
TAN Lei, FAN Hui-Ting, XING Kai | |||
Computer Science and Technology 07 December 2015 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:As the advancement of network and sensing, online/mobile applications get increasing popularity. Participatory sensing provides a promising way for people to understand the world better. Many people show interest to their relative status in their community, that is, ``Where am I in my community?". In this paper, we present a technique that uses EM Algorithm to perform a Gaussian mixture model on distributed data, which controls data sharing and prevents disclosure of individual data items. We also propose a method consisting of several protocols that provide privacy preservation in participatory sensing without revealing individual's privacy information. The experiment results show that our approach can not only answer where they are in their community but also preserve their privacy. | |||
TO cite this article:TAN Lei, FAN Hui-Ting, XING Kai. A privacy preserving method for community location sensing[OL].[ 7 December 2015] http://en.paper.edu.cn/en_releasepaper/content/4668152 |
7. Detecting Spatial-Temporal Subject Caption for News Video | |||
Wang Xihan,Feng Xiaoyi,Peng Jinye | |||
Computer Science and Technology 23 November 2015 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:With the increasing popularity of Internet news video analysis, indexing, and retrieval, locate both spatial and temporal positions of captions in news video becomes a challenging task. Most existing methods have focused on detecting texts in staitc frame and tracking in different frames. In this paper, we propose an effective and efficient system for detecting news video subject caption by using spatial and temproal imformation. An classification scheme is equipped in Our alogrithm and a set of spatial-temporal features specially designed for eliminating false caption candidates. The experimental results on our datasets have shown the robustness and efficiency of the proposed method. | |||
TO cite this article:Wang Xihan,Feng Xiaoyi,Peng Jinye. Detecting Spatial-Temporal Subject Caption for News Video[OL].[23 November 2015] http://en.paper.edu.cn/en_releasepaper/content/4665038 |
8. Proactive Pod-Based Load Balancing in Data Center Network | |||
Yan Junchi,Li Xiuhua | |||
Computer Science and Technology 08 November 2015 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Fat-tree structure is widely adopted in data center network for its high bisection. There have been lots of researches of load balancing in fat-tree topology network. Static ECMP is easily trapped in local optimum and centralized scheduler causes large overheads. In this paper, we proposed a ProAcive Pod-Based (PAPB) load balancing scheme. PAPB is based on SDN architecture, thus gets a global congestion aware of network. Proactive and pod based flow instantiation reduce the number of flow entries in an OpenFlow switch and decrease the overheads between control plane and data plane. Simulation shows that our PAPB scheme greatly reducing the packet loss rate and the queue length compared to ECMP and RR. | |||
TO cite this article:Yan Junchi,Li Xiuhua. Proactive Pod-Based Load Balancing in Data Center Network[OL].[ 8 November 2015] http://en.paper.edu.cn/en_releasepaper/content/4660721 |
9. The Calculation of Isogeometric Analysis in the Two-dimensional Problems of Linear Elasticity | |||
Du Xiaoxiao,Zhao Gang,Wang Wei | |||
Computer Science and Technology 01 November 2015 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Isogeometric analysis bridges the gap between the fields of CAD (Computer-Aided Design) and CAE (Computer-Aided Engineering) with the concept that the NURBS(Non-Uniform Rational B-Spline) basis function widely used for geometry description is employed to approximate the field variables such as nodal displacement, stress and strain in FEA(Finite Element Analysis). The problems in linear elasticity are the original examples successfully solved by finite element analysis and still occupy a large part of industrial applications, therefore we apply the method of IGA (isogeometric analysis) to solve this problem and proved the effectiveness of this newly invented approach. | |||
TO cite this article:Du Xiaoxiao,Zhao Gang,Wang Wei. The Calculation of Isogeometric Analysis in the Two-dimensional Problems of Linear Elasticity[OL].[ 1 November 2015] http://en.paper.edu.cn/en_releasepaper/content/4659829 |
10. A Continuous Gestures Recognition Method Using Single Accelerometer | |||
Tang Jiyu,Zhang Xiaoying,Zou Junwei | |||
Computer Science and Technology 22 September 2015 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Gesture recognition with acceleration signal applied to human-computer interaction task, which is continuous signal. There are a number of inter-class variations and intra-class variations, such as time shift and different user operation. Based on these properties, this paper proposes a noval continuous gesture recognition method based on three-axis acceleration sensor, which contains motion segmentation model, removing noises model, normalized features extraction model. Then we constructing supervised classifier using SVM (Support Vector Machines). And we evaluate our method under the scenarios of user-dependent and user-independent, respectively. The experimental results show that our proposed method achieves excellent recognition accuracy under two scenarios. | |||
TO cite this article:Tang Jiyu,Zhang Xiaoying,Zou Junwei. A Continuous Gestures Recognition Method Using Single Accelerometer[OL].[22 September 2015] http://en.paper.edu.cn/en_releasepaper/content/4655029 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
|
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated