检索结果-内蒙古大学图书馆

IEEE International Conference on Image Processing

作者： Jian Cao Haodong Li Weiqi Luo Jiwu Huang Shenzhen Graduate School Harbin Institute of Technology Shenzhen China School of Data and Computer Science and Guangdong Key Lab. of Information Security and Technology Sun Yat-Sen University Guangzhou China College of Information Engineering and Shenzhen Key Laboratory of Media Security Shenzhen University Shenzhen China

Removed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Community Detection in Complicated Network Based on the Multi-view Weighted Signed Permanence

Community Detection in Complicated Network Based on the Mult...

引用

IEEE International Conference on Trust, security and Privacy in Computing and Communications (TrustCom)

作者： Juan-Hui Li Pei-Zhen Li Chang-Dong Wang Jian-Huang Lai Guangdong Key Laboratory of Information Security Technology Guangzhou China School of Data and Computer Science Sun Yat-sen University Guangzhou China

ISBN: (纸本)9781509032068

This paper addresses the community detection problem in multi-view weighted signed network. Although some methods have been developed to detect communities in multi-view network, they are mostly designed for the unweighted unsigned case. There is still a lack of methods for multi-view weighted signed network. Since an increasing number of multi-view weighted signed networks are being generated in some applications, there is a necessity to develop a community detection approach to reveal the complicated structure of such networks. In this paper, we extend the single-view permanence model to the multi-view weighted signed case, which is a node-level model by considering four factors based on the influence of the nodes, including internal connections, total connections, maximum external connections and internal clustering coefficient. Extensive experiments are conducted on some networks to evaluate the performance of our proposed approach.

关键词： Couplings Color Weight measurement Adaptation models Partitioning algorithms computer science

来源：评论

学校读者我要写书评

暂无评论

PEDESTRIAN DETECTION VIA A LEG-DRIVEN PHYSIOLOGY FRAMEWORK

PEDESTRIAN DETECTION VIA A LEG-DRIVEN PHYSIOLOGY FRAMEWORK

引用

IEEE International Conference on Image Processing

作者： Gongbo Liang Qi Li Xiangui Kang Western Kentucky University Department of Computer Science Ogden College of Science & Engineering Guangdong Key Lab of Information Security Sun Yat-Sen University School of Data and Computer Science

ISBN: (纸本)9781467399623

In this paper, we propose a leg-driven physiology framework for pedestrian detection. The framework is introduced to reduce the search space of candidate regions of pedestrians. Given a set of vertical line segments, we can generate a space of rectangular candidate regions, based on a model of body proportions. The proposed framework can be either integrated with or without learning-based pedestrian detection methods to validate the candidate regions. A symmetry constraint is then applied to validate each candidate region to decrease the false positive rate. The experiment demonstrates the promising results of the proposed method by comparing it with Dalal & Triggs method. For example, rectangular regions detected by the proposed method has much similar area to the ground truth than regions detected by Dalal & Triggs method.

关键词： Pedestrian detection Leg Line segment Bounding box bounding boxes Line sections Leg Pedestrians Physiology candidate species vertical line ground truth inspection methods

来源：评论

学校读者我要写书评

暂无评论

CSBD: A Nonlinear Clustering Method Based on Cluster Shrinking and Border Detection

CSBD: A Nonlinear Clustering Method Based on Cluster Shrinki...

引用

IEEE International Conference on Trust, security and Privacy in Computing and Communications (TrustCom)

作者： Chao Chen Kun-Yu Lin Chang-Dong Wang Dong Huang Guangdong Key Laboratory of Information Security Technology Guangzhou China School of Data and Computer Science Sun Yat-sen University Guangzhou China College of Mathematics and Informatics South China Agricultural University Guangzhou China

ISBN: (纸本)9781509032068

Nonlinear clustering has attracted an increasing amount of attention recently. In this paper, we propose a new nonlinear clustering method based on Cluster Shrinking and Border Detection (CSBD). Unlike most existing clustering method, the CSBD method focuses on every data point rather then the cluster centers. A novel idea, namely Cluster Shrinking, is designed to transform the original nonlinear datasets into several hyperspheres, which makes clustering work much easier. Besides, we also introduce a simple but effective Border Detection method based on histogram analysis to automatically determine the threshold parameter in Cluster Shrinking phase. Extensive experiments have been conducted to demonstrate the effectiveness of CSBD in both synthetic and real-world datasets.

关键词： Clustering algorithms Clustering methods Algorithm design and analysis Electronic mail Histograms Arrays

来源：评论

学校读者我要写书评

暂无评论

An efficient parallel topic-sensitive expert finding algorithm using spark

An efficient parallel topic-sensitive expert finding algorit...

引用

IEEE International Conference on Big data

作者： Yao-Ming Yang Chang-Dong Wang Jian-Huang Lai Ministry of Education Key Laboratory of Machine Intelligence and Advanced Computing China Guangdong Key Laboratory of Information Security Technology China School of Data and Computer Science Sun Yat-sen University Guangzhou P. R. China

ISBN: (纸本)9781467390064

Expert finding is an important technique to obtain the user authority ranking in community question answering (CQA) websites. ZhihuRank is a topic-sensitive expert finding algorithm, which is based on both LDA and PageRank. Currently, with the amount of participants and documents increasing rapidly in CQA websites, how to parallel expert finding algorithms for big data analysis has received significant attention. In this paper, we find that the Spark framework is more suitable for paralleling expert finding algorithms than the MapReduce framework, which is a memory-based parallel computing model to support complicated iterative algorithms. As an example, we parallel ZhihuRank using MLlib's LDA and GraphX's PageRank in Spark. Experiments have been conducted on large-scale real data from Zhihu 1 (the most popular CQA website in China). And the experimental results confirmed the effectiveness and scalab.lity of our proposed approach.

关键词： Sparks Algorithm design and analysis Machine learning algorithms Heuristic algorithms Programming Computational modeling Libraries

来源：评论

学校读者我要写书评

暂无评论

Detecting infeasible traces in process models

Detecting infeasible traces in process models

引用

14th International Conference on Enterprise information Systems, ICEIS 2012

作者： Wang, Zhaoxia Wen, Lijie Zhu, Xiaochen Liu, Yingbo Wang, Jianmin School of Software Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Key Lab. for Information System Security Ministry of Education Beijing 100084 China National Laboratory for Information Science and Technology Beijing 100084 China Logistical Engineering University Chongqing 400016 China

ISBN: (纸本)9789898565105

Workflow testing is an important method of workflow analysis in design time. A challenging problem with trace-oriented test data generation in particular and trace-based workflow analysis in general is the existence of infeasible traces for which there is no input data for them to be executed. In this paper we build on the theory of workflow nets and introduce workflow nets where transitions have conditions associated with them. We then demonstrate that we can determine which execution traces, that are possible according to the control-flow dependencies, are actually possible taking the data perspective into account. This way we are able to more accurately determine in design time the infeasible traces caused by the correlation between transition conditions along this trace. Finally, we provide a solution to automatically detecting the shortest infeasible trace.

关键词： Infeasible traces Process models Workflow analysis

来源：评论

学校读者我要写书评

暂无评论

Multicast algorithms based on minimum delay tree

引用

Journal of Computational information Systems 2012年第10期8卷 4039-4046页

作者： Zheng, Xinwei Jiang, Wenchao Wang, Xiaoyun Yuan, Zhibin Information Science School of Guangdong University of Business Studies Guangzhou 510023 China Computer School of Guangdong University of Technology Guangzhou 510006 China The Key Lab. of E-Business Market Application on Technology of Guangdong Province Guangzhou 510023 China

In constructing an efficient multicast tree of application-level multicast, not only the delay of link should be considered, but also the process delay of many end systems in sending and transmitting data can not be ignored. To solve the problem of "minimum delay spanning tree", this paper proposed two routing models including the MRDL model based on optimum delay and the LRRB model based on load balance. Moreover, this paper proposes corresponding heuristic algorithms. Simulation results prove these algorithms can transmit the media stream efficiently. © 2011 by Binary information Press.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Practical privacy for value-added applications in vehicular ad hoc networks 5th

引用

5th International Conference on Internet and Distributed Computing Systems, IDCS 2012

作者： Zhang, Lei Wu, Qianhong Qin, Bo Domingo-Ferrer, Josep Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University Shanghai China UNESCO Chair in Data Privacy Dept. of Comp. Eng. and Maths Universitat Rovira i Virgili TarragonaCatalonia Spain Key Lab. of Aerospace Information Security and Trusted Computing Ministry of Education Wuhan University School of Computer China Department of Maths School of Science Xi’an University of Technology China

ISBN: (纸本)9783642348822

Advances in mobile networking and information processing technologies have triggered vehicular ad hoc networks (VANETs) for traffic safety and value-added applications. Most efforts have been made to address the security concerns while little work has been done to investigate security and privacy for value-added applications in VANETs. To fill this gap, we propose a value-added application, specifically, a security and privacy preserving location-based service (LBS) scheme for VANETs. For each LBS transaction, the scheme provides authentication, integrity and non-repudiation for both the service provider and the user. A user can obtain the service in an anonymous way and hence user privacy is well protected. However, a tracing procedure can be invoked to find malicious users, thereby efficiently preventing users from abusing the anonymity provided by the system. © Springer-Verlag Berlin Heidelberg 2012.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

Multi-user private keyword search for cloud computing

Multi-user private keyword search for cloud computing

引用

2011 3rd IEEE International Conference on Cloud Computing technology and science, CloudCom 2011

作者： Yang, Yanjiang Lu, Haibing Weng, Jian Institute for Infocomm Research Singapore Singapore Dept. of Operations Management and Information Systems Leavey School of Business Santa Clara University United States Department of Computer Science Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security Jinan University Guangzhou China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences China State Key Lab. of Networking and Switching Technology Beijing University of Posts and Telecommunications China

ISBN: (纸本)9780769546223

Enterprises outsourcing their databases to the cloud and authorizing multiple users for access represents a typical use scenario of cloud storage services. In such a case of database outsourcing, data encryption is a good approach enabling the data owner to retain its control over the outsourced data. Searchable encryption is a cryptographic primitive allowing for private keyword based search over the encrypted database. The above setting of enterprise outsourcing database to the cloud requires multi-user searchable encryption, whereas virtually all of the existing schemes consider the single-user setting. To bridge this gap, we are motivated to propose a practical multi-user searchable encryption scheme, which has a number of advantages over the known approaches. The associated model and security requirements are also formulated. We further discuss to extend our scheme in several ways so as to achieve different search capabilities. © 2011 IEEE.

关键词： Outsourcing

来源：评论

学校读者我要写书评

暂无评论

Hierarchical certificateless signatures

Hierarchical certificateless signatures

引用

International Workshop on Wireless Network Algorithm and Theory

作者： Zhang, Lei Wu, Qianhong Domingo-Ferrer, Josep Qin, Bo UNESCO in Data Privacy Department of Computer Engineering and Mathematics Universitat Rovira i Virgili Catalonia Spain Wuhan University School of Computer Key Lab. of Aerospace Information Security and Trusted Computing China Xi'an University of Technology School of Science Department of Maths China

ISBN: (纸本)9780769543222

Certificateless cryptography eliminates the key escrow problem in identity-based cryptography. Hierarchical cryptography exploits a practical security model to mirror the organizational hierarchy in the real world. In this paper, to incorporate the advantages of both types of cryptosystems, we instantiate hierarchical certificateless cryptography by formalizing the notion of hierarchical certificateless signatures. Furthermore, we propose an HCLS scheme which, under the hardness of the computational Diffie-Hellman (CDH) problem, is proven to be existentially unforgeable against adaptive chosen-message attacks in the random oracle model. As to efficiency, our scheme has constant complexity, regardless of the depth of the hierarchy. Hence, the proposal is secure and scalab.e for practical applications. © 2010 IEEE.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：