2015 International Conference on Informative and Cybernetics for Computational Social Systems (ICCSS)最新文献

筛选
英文 中文
A flick biometric authentication mechanism on mobile devices 移动设备上的轻弹生物识别认证机制
Dong-Her Shih, Chia-Ming Lu, Ming-Hung Shih
{"title":"A flick biometric authentication mechanism on mobile devices","authors":"Dong-Her Shih, Chia-Ming Lu, Ming-Hung Shih","doi":"10.1109/ICCSS.2015.7281144","DOIUrl":"https://doi.org/10.1109/ICCSS.2015.7281144","url":null,"abstract":"Smartphones nowadays are used not only for communication but also for many emerging applications, such as m-commerce. And, biometric methods can provide promising applications to secure mobile devices. In this paper, we propose a novel authentication mechanism using the information collected from the accelerometer sensor and touchscreen of the smartphone. We design an authentication mechanism that adopts features transformed from those readings. Experimental result show that the proposed mechanism can build a robust authentication environment for smartphone users.","PeriodicalId":299619,"journal":{"name":"2015 International Conference on Informative and Cybernetics for Computational Social Systems (ICCSS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122503093","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
A distributed K-means clustering algorithm in wireless sensor networks 无线传感器网络中的分布式k -均值聚类算法
Jin Zhou, Y. Zhang, Yuyan Jiang, C. L. P. Chen, Long Chen
{"title":"A distributed K-means clustering algorithm in wireless sensor networks","authors":"Jin Zhou, Y. Zhang, Yuyan Jiang, C. L. P. Chen, Long Chen","doi":"10.1109/ICCSS.2015.7281143","DOIUrl":"https://doi.org/10.1109/ICCSS.2015.7281143","url":null,"abstract":"It is a hard work for the traditional k-means algorithm to perform data clustering in a large, dynamic distributed wireless sensor networks. In this paper, we propose a distributed k-means clustering algorithm, in which the distributed clustering is performed at each sensor with the collaboration of its neighboring sensors. To extract the important features and improve the clustering results, the attribute-weight-entropy regularization technique is used in the proposed clustering method. Experiments on synthetic datasets have shown the good performance of the proposed algorithms.","PeriodicalId":299619,"journal":{"name":"2015 International Conference on Informative and Cybernetics for Computational Social Systems (ICCSS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134470966","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
A novel feature fusion method for predicting protein subcellular localization with multiple sites 一种预测多位点蛋白亚细胞定位的新特征融合方法
Dong Wang, Shiyuan Han, Xumi Qu, Wenzheng Bao, Yuehui Chen, Yuling Fan, Jin Zhou
{"title":"A novel feature fusion method for predicting protein subcellular localization with multiple sites","authors":"Dong Wang, Shiyuan Han, Xumi Qu, Wenzheng Bao, Yuehui Chen, Yuling Fan, Jin Zhou","doi":"10.1109/ICCSS.2015.7281141","DOIUrl":"https://doi.org/10.1109/ICCSS.2015.7281141","url":null,"abstract":"This paper proposes a novel feature fusion method for the protein subcellular multiple-site localization prediction. Several types of features are employed in this novel protein coding method. The first one is the composition of amino acids. The second is pseudo amino acid composition, which mainly extract the location information of each amino acid residues in protein sequence. Lastly, the information for local sequence of amino acids is taken into consideration in this research. Generally, k nearest neighbor, supporting vector machine and other methods, has been used in the field of protein subcellular localization prediction. In our research, the multi-label k nearest neighbor algorithm has been employed in the classification model. The overall accuracy rate may reach 66.7304% in Gnos-mploc dataset.","PeriodicalId":299619,"journal":{"name":"2015 International Conference on Informative and Cybernetics for Computational Social Systems (ICCSS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114813754","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Matrix completion via extended linearized augmented Lagrangian method of multipliers 乘子的扩展线性增广拉格朗日方法的矩阵补全
Fengming Ma, Mingfang Ni, Wei Tong, Xinrong Wu
{"title":"Matrix completion via extended linearized augmented Lagrangian method of multipliers","authors":"Fengming Ma, Mingfang Ni, Wei Tong, Xinrong Wu","doi":"10.1109/ICCSS.2015.7281147","DOIUrl":"https://doi.org/10.1109/ICCSS.2015.7281147","url":null,"abstract":"The problem of recovering low-rank matrix from only a subset of observed entries is known as the matrix completion problem. Many problems arising in compressive sensing, image processing, machine learning, can be usefully cast as this problem. In this paper, we propose an extended linearized augmented Lagrangian method of multipliers for the problem, and prove its global convergence. We show that all the resulting subproblems have closed-forms solutions. Finally, some numerical experiments are conducted to show its efficiency.","PeriodicalId":299619,"journal":{"name":"2015 International Conference on Informative and Cybernetics for Computational Social Systems (ICCSS)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129586094","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Robust audio watermarking scheme via QIM of correlation coefficients using LWT and QR decomposition 基于LWT和QR分解的相关系数QIM鲁棒音频水印方案
Jinfeng Li, Tao Wu
{"title":"Robust audio watermarking scheme via QIM of correlation coefficients using LWT and QR decomposition","authors":"Jinfeng Li, Tao Wu","doi":"10.1109/ICCSS.2015.7281138","DOIUrl":"https://doi.org/10.1109/ICCSS.2015.7281138","url":null,"abstract":"In order to realize the copyright protection of audio information and improve the security of the watermarking algorithm, a secure robust audio watermarking algorithm via quantization of the random correlation coefficients in lifting wavelet transform domain and QR decomposition is proposed Firstly, lifting wavelet transform is performed on the audio data, the approximate components are mapped into matrix, and QR decomposition is done to the blocks of the matrix. The watermark is embedded by quantization the correlation coefficient of R matrix vector and a random vector using quantization index modulation. Simulation results show that the algorithm not only have good imperceptibility and high embedding capacity, but also strong robustness against common signal processing, such as noise addition, resampling, low-pass filtering, re-quantization, MP3 compression and so on.","PeriodicalId":299619,"journal":{"name":"2015 International Conference on Informative and Cybernetics for Computational Social Systems (ICCSS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129441118","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Formation control for multiple nonlinear autonomous agents based on iterative method 基于迭代法的多非线性自治智能体编队控制
Xi-xin Yang, Shiyuan Han, Dong Wang, Jin Zhou
{"title":"Formation control for multiple nonlinear autonomous agents based on iterative method","authors":"Xi-xin Yang, Shiyuan Han, Dong Wang, Jin Zhou","doi":"10.1109/ICCSS.2015.7281148","DOIUrl":"https://doi.org/10.1109/ICCSS.2015.7281148","url":null,"abstract":"This paper is concerned with approximate optimal formation control for multiple nonlinear autonomous agents based on iterative method. By designing some concatenation vectors, a whole multi-agent system is obtained, and the original formation control problem is transformed into a classic tracking problem. Based on the classic optimal tracking control theories, the optimal formation control problem is viewed as a two-point boundary value problem. Then, the approximate formation controller is obtained by using the successive approximation approach, which composes of analytic feedback terms and a compensation term. The compensation term can be obtained by calculating an iteration adjoint vectors. By introducing a finite term of the adjoint vector sequence, an approximate formation controller is designed. Simulation results show that the proposed approximate formation controller produces the better value of control performances.","PeriodicalId":299619,"journal":{"name":"2015 International Conference on Informative and Cybernetics for Computational Social Systems (ICCSS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123672828","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An improvement of recommender system to find appropriate candidate for recruitment with colloborative filtering 基于协同过滤的招聘推荐系统改进
Chanawee Chanavaltada, Panpaporn Likitphanitkul, M. Phankokkruad
{"title":"An improvement of recommender system to find appropriate candidate for recruitment with colloborative filtering","authors":"Chanawee Chanavaltada, Panpaporn Likitphanitkul, M. Phankokkruad","doi":"10.1109/ICCSS.2015.7281152","DOIUrl":"https://doi.org/10.1109/ICCSS.2015.7281152","url":null,"abstract":"Recruitment is a significant process that affects to organizational performance. Recruiters expect to meet the most appropriate employee for the right job, but a large number of resumes make more difficult to their decision. For this reason, this paper proposed the recommender system to support recruiter in the decision and manage recruitments. The two techniques include matching and collaborative filtering. In the matching process, it compares the profile data and takes a score in order to rank the candidates. However, the scoring remains some problem that candidate scores are low dispersion. Therefore, the collaborative filtering technique was used to solve scoring problem. By applying this technique, the results shown that the scores were adjusted the distinction. Thus, the collaborative filtering could improve the score dispersion and easy to identify the most appropriate candidates, who had the best required qualification.","PeriodicalId":299619,"journal":{"name":"2015 International Conference on Informative and Cybernetics for Computational Social Systems (ICCSS)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126158078","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Separate Modal Analysis using Scale Invariant Feature Transform (SIFT) with Digital Image Elasto Tomography (DIET) for breast cancer screening test 使用比例不变特征变换(SIFT)和数字图像弹性断层扫描(DIET)进行乳腺癌筛查试验的分离模态分析
Mubashir Hussain, H. Rehman, Owais Nazir, A. Kashif, A. Hassan, Muhammad Awais Dildar
{"title":"Separate Modal Analysis using Scale Invariant Feature Transform (SIFT) with Digital Image Elasto Tomography (DIET) for breast cancer screening test","authors":"Mubashir Hussain, H. Rehman, Owais Nazir, A. Kashif, A. Hassan, Muhammad Awais Dildar","doi":"10.1109/ICCSS.2015.7281162","DOIUrl":"https://doi.org/10.1109/ICCSS.2015.7281162","url":null,"abstract":"Digital Image Elasto Tomography (DIET) is noninvasive approach for detection and screening test of breast cancer at an early stage. In DIET mechanical vibrations are applied on the surface of breast after applying fiducial markers and images are taken to capture surface motion using five digital cameras. Applying Scale Invariant Feature Transform (SIFT) on the unmarked surface of the breast to produce reference points for tracking surface motion. Using Separate Modal Analysis frequency and amplitude response of oscillations are evaluated using markers. SIFT features are used to detect change in stiffness which refers to presence and/or location of tumor. This increases motion data and reduces noise for detection of cancerous tumours.","PeriodicalId":299619,"journal":{"name":"2015 International Conference on Informative and Cybernetics for Computational Social Systems (ICCSS)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114068179","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Prediction of protein structure classes 蛋白质结构分类预测
Wenzheng Bao, Dong Wang, Fanliang Kong, R. Han, Yuehui Chen
{"title":"Prediction of protein structure classes","authors":"Wenzheng Bao, Dong Wang, Fanliang Kong, R. Han, Yuehui Chen","doi":"10.1007/978-3-319-22180-9_74","DOIUrl":"https://doi.org/10.1007/978-3-319-22180-9_74","url":null,"abstract":"","PeriodicalId":299619,"journal":{"name":"2015 International Conference on Informative and Cybernetics for Computational Social Systems (ICCSS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114412634","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Detecting image forgery using linear constraints based on shading and shadows 基于阴影和阴影的线性约束检测图像伪造
H. Ge, S. Fang
{"title":"Detecting image forgery using linear constraints based on shading and shadows","authors":"H. Ge, S. Fang","doi":"10.1109/ICCSS.2015.7281160","DOIUrl":"https://doi.org/10.1109/ICCSS.2015.7281160","url":null,"abstract":"According to the shadows and shading constraints in the Lambert illumination model, the paper proposes a method to detect image forgery. This method describes a multitude of constraints in shading and shadows based on the direction of the light source, by analyzing the intersection of the wedges to verify the images. The linear programming problem is employed to confine the direction and angle in the wedge, and the conjugate gradient methods are employed to describe the shading to verify the direction of the light source. The tampering image can be determined by the inconsistency in light source direction with shading and the intersection with wedges. Combining both the shading and shadow make the parameters in wedge more accurate. By the improved corresponding algorithms, the experimental results show that the light source direction and consistency can be calculated accurately in the shadows and shading.","PeriodicalId":299619,"journal":{"name":"2015 International Conference on Informative and Cybernetics for Computational Social Systems (ICCSS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124969181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信