43 results on '"Li, Zhoujun"'
Search Results
2. Scanning, attention, and reasoning multimodal content for sentiment analysis
- Author
-
Liu, Yun, Li, Zhoujun, Zhou, Ke, Zhang, Leilei, Li, Lang, Tian, Peng, and Shen, Shixun
- Published
- 2023
- Full Text
- View/download PDF
3. Rational design of the nanocomposite by in-situ sub-10 nm La(OH)3 formation for selective phosphorus removal in waters
- Author
-
Zhao, Ziyi, Li, Zhoujun, Wu, Lijie, Song, Yaran, Roger Razanajatovo, Mamitiana, Sun, Qina, Jiao, Tifeng, Peng, Qiuming, and Zhang, Qingrui
- Published
- 2023
- Full Text
- View/download PDF
4. Neighbor enhanced graph convolutional networks for node classification and recommendation
- Author
-
Chen, Hao, Huang, Zhong, Xu, Yue, Deng, Zengde, Huang, Feiran, He, Peng, and Li, Zhoujun
- Published
- 2022
- Full Text
- View/download PDF
5. Dissimilar joining mechanism, microstructure and properties of Ni to 316 stainless steel via Ni-Al thermal explosion reaction
- Author
-
Cai, Xiaoping, Ren, Xuanru, Sang, Changcheng, Zhu, Lu, Li, Zhoujun, and Feng, Peizhong
- Published
- 2021
- Full Text
- View/download PDF
6. Visual Question Answering via Combining Inferential Attention and Semantic Space Mapping
- Author
-
Liu, Yun, Zhang, Xiaoming, Huang, Feiran, Zhou, Zhibo, Zhao, Zhonghua, and Li, Zhoujun
- Published
- 2020
- Full Text
- View/download PDF
7. Mixture distribution modeling for scalable graph-based semi-supervised learning
- Author
-
Li, Zhi, Li, Chaozhuo, Yang, Liqun, Yu, Philip S., and Li, Zhoujun
- Published
- 2020
- Full Text
- View/download PDF
8. Visual question answering via Attention-based syntactic structure tree-LSTM
- Author
-
Liu, Yun, Zhang, Xiaoming, Huang, Feiran, Tang, Xianghong, and Li, Zhoujun
- Published
- 2019
- Full Text
- View/download PDF
9. Sentiment analysis of social images via hierarchical deep fusion of content and links
- Author
-
Xu, Jie, Huang, Feiran, Zhang, Xiaoming, Wang, Senzhang, Li, Chaozhuo, Li, Zhoujun, and He, Yueying
- Published
- 2019
- Full Text
- View/download PDF
10. Deep multi-view representation learning for social images
- Author
-
Huang, Feiran, Zhang, Xiaoming, Zhao, Zhonghua, Li, Zhoujun, and He, Yueying
- Published
- 2018
- Full Text
- View/download PDF
11. Multi-modal kernel ridge regression for social image classification
- Author
-
Zhang, Xiaoming, Chao, Wenhan, Li, Zhoujun, Liu, Chunyang, and Li, Rui
- Published
- 2018
- Full Text
- View/download PDF
12. Search engine reinforced semi-supervised classification and graph-based summarization of microblogs
- Author
-
Chen, Yan, Zhang, Xiaoming, Li, Zhoujun, and Ng, Jun-Ping
- Published
- 2015
- Full Text
- View/download PDF
13. Event detection and popularity prediction in microblogging
- Author
-
Zhang, Xiaoming, Chen, Xiaoming, Chen, Yan, Wang, Senzhang, Li, Zhoujun, and Xia, Jiali
- Published
- 2015
- Full Text
- View/download PDF
14. A novel variable precision [formula omitted]-fuzzy rough set model based on fuzzy granules
- Author
-
Yao, Yanqing, Mi, Jusheng, and Li, Zhoujun
- Published
- 2014
- Full Text
- View/download PDF
15. Relationship strength estimation for online social networks with the study on Facebook
- Author
-
Zhao, Xiaojian, Yuan, Jin, Li, Guangda, Chen, Xiaoming, and Li, Zhoujun
- Published
- 2012
- Full Text
- View/download PDF
16. Monitoring, analyzing and characterizing lookup traffic in a large-scale DHT
- Author
-
Yu, Jie, Lu, Liming, Xiao, Peng, Li, Zhoujun, and Zhou, Yuan
- Published
- 2011
- Full Text
- View/download PDF
17. Cryptanalysis of simple three-party key exchange protocol
- Author
-
Guo, Hua, Li, Zhoujun, Mu, Yi, and Zhang, Xiyong
- Abstract
To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.cose.2008.03.001 Byline: Hua Guo (a), Zhoujun Li (a), Yi Mu (b), Xiyong Zhang (c) Abstract: Recently, Lu and Cao published a novel protocol for password-based authenticated key exchanges (PAKE) in a three-party setting in Journal of Computers and Security, where two clients, each shares a human-memorable password with a trusted server, can construct a secure session key. They argued that their simple three-party PAKE (3-PAKE) protocol can resist against various known attacks. In this paper, we show that this protocol is vulnerable to a kind of man-in-the-middle attack that exploits an authentication flaw in their protocol and is subject to the undetectable on-line dictionary attack. We also conduct a detailed analysis on the flaws in the protocol and provide an improved protocol. Author Affiliation: (a) School of Computer Science & Engineering, Beihang University, 37 Xueyuan Road, Beijing 100083, People's Republic of China (b) Centre for Computer and Information Security Research, School of Computer Science Software Engineering, University of Wollongong, NSW 2522, Australia (c) Department of Applied Mathematics, Information Engineering University Zhengzhou 450002, People's Republic of China Article History: Received 18 May 2007; Accepted 5 March 2008
- Published
- 2008
18. A unified framework of identity-based sequential aggregate signatures from 2-level HIBE schemes.
- Author
-
Yao, Yanqing, Li, Zhoujun, and Guo, Hua
- Subjects
- *
IMPERSONATION , *LEARNING problems , *HARDNESS - Abstract
• We show how to construct IBSAS schemes in general by employing 2-level hierarchical identity-based encryption schemes under a weaker unforgeability model, and give a rigorous proof of its unforgeability. • We instantiate the generic construction to obtain an IBSAS scheme, which has weak existential unforgeability based on a standard computational hardness assumption (i.e., the Computational Diffie-Hellman assumption) in the standard model. • We instantiate our generic construction to construct a lattice-based IBSAS scheme, which is the first lattice-based IBSAS scheme. • We show the performance comparisons between our schemes and previous ones. Identity-based sequential aggregate signature (IBSAS for short) schemes, introduced by Boldyreva et al. [CCS 2007], allow a large quantity of signers to generate one signature sequentially, in which these messages as well as their order can be attested by employing their identities. In such a scheme, storage space and bandwidth overhead can be reduced. To our best knowledge, though many concrete IBSAS schemes have been constructed in literature, none of them is constructed under a standard computational hardness assumption and unforgeable under the standard model. The problem of how to construct such schemes is still open. Latterly, Gentry et al. [PKC 2018] proposed a unified construction of SAS (i.e., abbreviated form of sequential aggregate signature) schemes by employing trapdoor permutation and ideal ciphers. Motivated by the above problem and hints, here we study how to construct IBSAS schemes in a new unified perspective. By employing 2-level HIBE (i.e., abbreviated form of hierarchical identity-based encryption) schemes, we present unified construction of IBSAS schemes and give a rigorous proof of their unforgeability. The unified construction is then instantiated to get a concrete IBSAS scheme, which has existential unforgeability under the standard model using a standard computational hardness assumption (i.e., the CDH assumption). An extra fruit is that it can be used to construct an existentially unforgeable IBSAS scheme using the Learning with Errors problem, which is constructed under a lattice hardness assumption for the first time. In the end, we show a detailed performance comparison among our schemes and previous ones. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
19. Response selection with topic clues for retrieval-based chatbots.
- Author
-
Wu, Yu, Li, Zhoujun, Wu, Wei, and Zhou, Ming
- Subjects
- *
INFORMATION retrieval , *CHATBOTS , *RECURRENT neural networks , *MATCHING theory , *ARTIFICIAL neural networks - Abstract
Abstract We consider incorporating topic information into message-response matching to boost responses with rich content in retrieval-based chatbots. To this end, we propose a topic aware attentive recurrent neural network in which representations of the message and the response are enhanced by the topic information. The model first leverages the message and the response represented by recurrent neural networks (RNNs) to weight topic words given by a pre-trained LDA model and forms topic vectors as linear combinations of the topic words. It then refines the representations of the message and the response with the topic vectors through an attention mechanism. The attention mechanism weights the hidden sequences of the message and the response not only by themselves but also by their topic vectors. Thus both the parts that are important to matching and the parts that are semantically related to the topics are highlighted in the representations.Empirical studies on public data and human annotated data show that our model can significantly outperform state-of-the-art methods and rank more responses with rich content in high positions. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
20. Effect of test configurations and loading protocols on performance of timber-concrete connectors.
- Author
-
Ling, Zhibin, Li, Zhoujun, Rong, Xiuqiang, and Shi, Huiyuan
- Subjects
- *
FAILURE mode & effects analysis , *MODULUS of rigidity , *DUCTILITY - Abstract
• Push-out tests were performed on timber-concrete composite (TCC) shear connections with glued-in rod (GIR). • Most of the TCC shear connections with GIR mainly failed by the double-hinge yield mode of GIR. • Both the test configurations and loading rates showed influence on the shear performance of TCC shear connectors. • Calculation modes for shear capacity and shear stiffness were proposed according to typical failure modes of specimens. To examine the effect of test configurations and loading protocols on the performance of timber-concrete composite (TCC) shear connectors, a total of twenty-seven TCC shear connections with glued – in threaded steel rod (GIR) were designed to experience push-out tests. The experimental variables include rod diameter, test configurations (single - and double - shear), and loading protocols including the loading protocol (EN26891) and the displacement rate (0.5 mm/min, 2 mm/min, and 4 mm/min). The results indicate that both the test configurations and the displacement rates showed different influences on the performance of the shear connections. Most of the tested TCC shear connections with GIR mainly failed by the double – hinge yield mode of GIR. Double – shear specimens with 16 mm – diameter GIR exhibited a 49 % higher maximum load compared to the single – shear specimens. The slip modulus of the specimens tested at a displacement rate of 4 mm/min was about 40 % lower than that of the specimens tested at the displacement rates of 0.5 mm/min and 2 mm/min, respectively. Among the single-shear specimens, the 16 mm– diameter GIR showed the lowest ductility, by 65 % and 59 %, as compared to the 10 mm – and 12 mm – diameter specimens. Finally, theoretical analytical formulas were proposed to predict the load carrying capacity and the slip modulus of the TCC shear connections with GIR. The experimental slip modulus was also compared with the results obtained by existing calculation models. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
21. A novel fuzzy identity based signature scheme based on the short integer solution problem.
- Author
-
Yao, Yanqing and Li, Zhoujun
- Subjects
- *
FUZZY systems , *DIGITAL signatures , *SCHEME programming language , *INTEGERS , *PROBLEM solving , *CRYPTOSYSTEMS - Abstract
Lattice-based cryptosystems have recently acquired much importance. In this work, we construct a fuzzy identity based signature (FIBS) scheme based on the Small Integer Solution (SIS) Problem. FIBS schemes allow a user with identity id to issue a signature which could be verified under identity id′ if and only if id and id′ are close to each other. To our best knowledge, no lattice based FIBS schemes were known before, and the existing security model of FIBS schemes is not correct indeed. We propose a modified security model and prove that our scheme is existentially unforgetable against adaptively chosen message and identity attacks in the random oracle model. To break the bottleneck of designing lattice-based FIBS scheme, the secret key of each identity bit is generated by employing the Bonsai Tree techniques in the fuzzy extract algorithm. We also use some techniques to prove its security. Then we show the performance comparisons of all existing FIBS schemes. Finally, we give its application in biometric authentication. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
22. An efficient dynamic authenticated key exchange protocol with selectable identities
- Author
-
Guo, Hua, Li, Zhoujun, Mu, Yi, Zhang, Fan, Wu, Chuankun, and Teng, Jikai
- Subjects
- *
AUTHENTICATION (Law) , *COMPUTER network protocols , *CRYPTOGRAPHY , *COMPUTER security , *MATHEMATICAL mappings , *DATA encryption - Abstract
Abstract: In the traditional identity-based cryptography, when a user holds multiple identities as its public keys, it has to manage an equal number of private keys. The recent advances of identity-based cryptography allow a single private key to map multiple public keys (identities) that are selectable by the user. This approach simplifies the private key management. Unfortunately, the existing schemes have a heavy computation overhead, since the private key generator has to authenticate all identities in order to generate a resultant private key. In particular, it has been considered as a drawback that the data size for a user is proportional to the number of associated identities. Moreover, these schemes do not allow dynamic changes of user identities. When a user upgrades its identities, the private key generator (PKG) has to authenticate the identities and generate a new private key. To overcome these problems, in this paper we present an efficient dynamic identity-based key exchange protocol with selectable identities, and prove its security under the bilinear Diffie–Hellman assumption in the random oracle model. [Copyright &y& Elsevier]
- Published
- 2011
- Full Text
- View/download PDF
23. Provably secure identity-based authenticated key agreement protocols with malicious private key generators
- Author
-
Guo, Hua, Li, Zhoujun, Mu, Yi, and Zhang, Xiyong
- Subjects
- *
AUTHENTICATION (Law) , *MALWARE , *DATA security , *COMPUTER users , *COMPUTER network protocols , *IDENTIFICATION cards - Abstract
Abstract: Identity-based authenticated key agreement is a useful cryptographic primitive and has received a lot of attention. The security of an identity-based system relies on a trusted private key generator (PKG) that generates private keys for users. Unfortunately, the assumption of a trusted PKG (or a curious-but-honest PKG) is considered to be too strong in some situations. Therefore, achieving security without such an assumption has been considered in many cryptographic protocols. As a PKG knows the private keys of its users, man-in-the-middle attacks (MIMAs) from a malicious PKG is considered as the strongest attack against a key agreement protocol. Although securing a key agreement process against such attacks is desirable, all existent identity-based key agreement protocols are not secure under such attacks. In this paper, we, for the first time, propose an identity-based authenticated key agreement protocol resisting MIMAs from malicious PKGs that form a tree, which is a commonly used PKG structure for distributing the power of PKGs. Users are registered at a PKG in the tree and each holds a private key generated with all master keys of associated PKGs. This structure is much more efficient, in comparison with other existing schemes such as threshold-based schemes where a user has to register with all PKGs. We present our idea in two protocols. The first protocol is not secure against MIMAs from some kinds of malicious PKGs but holds all other desirable security properties. The second protocol is fully secure against MIMAs. We provide a complete security proof to our protocols. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
24. fficient and Provably Secure Generic Construction of Client-to-Client Password-Based Key Exchange Protocol.
- Author
-
Li, Zhoujun, Guo, Hua, and Zhang, Xiyong
- Subjects
COMPUTER network protocols ,COMPUTER passwords ,CLIENT/SERVER computing ,COMPUTER network security ,COMPUTER security - Abstract
Abstract: Client-to-client password authenticated key exchange (C2C-PAKE) protocol enables two clients who only share their passwords with their own servers to establish a shared key for their secure communications. Recently, Byun et al. and Yin-Li respectively proposed first provably secure C2C-PAKE protocols. However, both protocols are found to be vulnerable to undetectable online dictionary attacks and other attacks. In this paper, we present an efficient generic construction for cross-realm C2C-PAKE protocols and prove its security in the Random-or-Real model due to Abdalla et al., without making use of the Random Oracle model. [Copyright &y& Elsevier]
- Published
- 2008
- Full Text
- View/download PDF
25. Modeling and Verifying Time Sensitive Security Protocols with Constraints.
- Author
-
Zhou, Ti, Li, Mengjun, Li, Zhoujun, and Chen, Huowang
- Subjects
COMPUTER network protocols ,COMPUTER network security ,CALCULUS ,MATHEMATICAL logic ,COMPUTER science - Abstract
Abstract: This paper researches the characteristic of time sensitive protocols and presents a method with simple operations to verify protocols with time stamps and avoid false attacks. Firstly, an extension of π calculus is given to model a time sensitive security protocol. And then, by appending linear arithmetic constraints to the Horn logic model, the extended Horn logic model of security protocols and the modified-version verification method with time constraints are represented. All operations and the strategy of verification are defined for our constraints system. Thirdly, a method is given to determine whether the constraints has a solution or not. Finally, as a result of an experiment, Denning-Sacco protocol with time stamps is verified. The experiment shows that our approach is an innovative and effective method on verifying time sensitive security protocols. [Copyright &y& Elsevier]
- Published
- 2008
- Full Text
- View/download PDF
26. A Novel Derivation Framework For Definite Logic Program.
- Author
-
Li, MengJun, Li, ZhouJun, Chen, HuoWang, and Zhou, Ti
- Subjects
MATHEMATICAL logic ,COMPUTER software termination ,COMPUTER science ,ELECTRONIC data processing ,MATHEMATICS - Abstract
Abstract: Is a closed atom derivable from a definite logic progam? This derivation problem is undecidable. Focused on this problem there exist two categories approaches: the accurate approach that does not guarantee termination, and the terminated abstract approaches. Both approaches have its advantages and disadvantages. We present a novel derivation framework for the definite logic program. A dynamic approach to characterizing termination of fixpoint is presented, then which is used to approximately predict termination of fixpoint in advance. If the fixpoint is predicted termination, we use the non-terminational approach to the derivation problem, otherwise,the terminated abstract approach is used. With this termination predicting approach, we combine the non-termination accurate approaches and the termination abstract approaches together for solving the derivation problem more efficiently. And the experiment results demonstrates the effectiveness of our approach. [Copyright &y& Elsevier]
- Published
- 2008
- Full Text
- View/download PDF
27. PPMGS: An efficient and effective solution for distributed privacy-preserving semi-supervised learning.
- Author
-
Li, Zhi, Li, Chaozhuo, Li, Zhoujun, Weng, Jian, Huang, Feiran, and Zhou, Zhibo
- Subjects
- *
SUPERVISED learning , *MACHINE learning , *DATA privacy , *GRAPH algorithms , *GAUSSIAN distribution , *PRIVACY , *LOCATION-based services , *CLASSIFICATION - Abstract
Recently, distributed semi-supervised learning has attracted increasing research attention due to its tremendous practical value. A promising distributed semi-supervised learning method should not only achieve desirable classification performance but also protect data privacy in distributed scenarios. Existing approaches typically capture the similarities between data instances with privacy-preserving computations. This paradigm introduces extra computation and heuristic changes to the algorithm, resulting in sub-optimal solutions that are time-consuming. In current distributed semi-supervised learning, instance similarities are widely used to capture the underlying manifold or guide label propagation. This paper emphasizes that instance similarities are not necessary because the structure of data connections can be estimated using coarser-grained information. We propose a Privacy-preserving Mixture-distribution based Graph Smoothing (PPMGS) model for distributed privacy-preserving semi-supervised learning. Our motivation is to construct a graph based on a Gaussian mixture distribution instead of individual data instances, which better captures the underlying data distribution and improves model efficiency. PPMGS includes a privacy-preserving expectation-maximization (EM) phase to estimate the Gaussian mixture distribution depicting the input data and a mixture-distribution-based graph smoothing algorithm to learn a distribution-based classifier by fitting a few labeled samples. Experimental results show that the proposed PPMGS achieves 5%-10% higher accuracy and macro-F1 than state-of-the-art privacy-preserving semi-supervised learning methods. In terms of efficiency, it reduces time cost by 97% and communication cost by 96% in the most complex dataset. The numerical results demonstrate that our proposal outperforms state-of-the-art baselines in both efficiency and effectiveness. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
28. From content to links: Social image embedding with deep multimodal model.
- Author
-
Huang, Feiran, Zhang, Xiaoming, Li, Zhoujun, Zhao, Zhonghua, and He, Yueying
- Subjects
- *
IMAGE processing , *DEEP learning , *ONLINE social networks , *IMAGE retrieval , *DATA mining - Abstract
Abstract With the popularity of social network, social media data embedding has attracted extensive research interest and boomed many applications, such as image classification and cross-modal retrieval. In this paper, we examine the scenario of social images containing multimodal content (e.g., visual content and textual tags) and connecting with each other (e.g., two images submitted to the same group). In such a case, both the multimodal content and link information provide useful clues for representation learning. Therefore, simply learning the embedding from network structure or data content results in sub-optimal social image representation. In this paper, we propose a Deep Multimodal Attention Networks (DMAN) to combine multimodal content and link information for social image embedding. Specifically, to effectively incorporate the multimodal content, a visual-textual attention model is proposed to encode the fine-granularity correlation between multimodal content, i.e., the alignment between image regions and textual words. To incorporate the network structure for embedding learning, a novel Siamese-Triplet neural network is proposed to model the first-order proximity and the second-order proximity among images. Then the two modules are integrated into a joint deep model for social image embedding. Once the representation has been learned, a wide variety of data mining problems can be solved by using the task-specific algorithms designed for handling vector representations. Extensive experiments are conducted to demonstrate the effectiveness of our approach on multi-label classification and cross-modal search. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
29. Improved-ELM method for detecting false data attack in smart grid.
- Author
-
Yang, Liqun, Li, Yuancheng, and Li, Zhoujun
- Subjects
- *
SMART power grids , *ELECTRIC fault location , *ELABORATION likelihood model , *ELECTRIC power transmission , *BEES algorithm - Abstract
Power grid is a complex system which closely links the power generation and power consumer through transmission and distribution networks. With the development of smart grid, smart grid is more open to external communication systems, it also has exposed some problems in the network attacks. A new false data injection attack (called the unobservable attack) that can bypass the traditional BDD and inject random errors into state estimation. We propose an improved extreme learning machine (ELM) for attack detection. The artificial bee colony (ABC) incorporates the thought of differential evolution algorithm (DE) to optimize ELM for improving detection precision. In this paper, Autoencoder is used to reduce the dimensionality of the measurement data, which makes the low-dimensional data information basically and fully represent high-dimensional data. We verify the performance of the proposed method on IEEE bus systems, and prove that the proposed method can effectively detect such unobservable attack. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
30. Named entity disambiguation for questions in community question answering.
- Author
-
Wang, Fang, Wu, Wei, Li, Zhoujun, and Zhou, Ming
- Subjects
- *
THEORY of knowledge , *SOCIOLINGUISTICS , *QUESTION answering systems , *SOCIAL learning , *HUMAN behavior - Abstract
Named entity disambiguation (NED) refers to the task of mapping entity mentions in running texts to the correct entries in a specific knowledge base (e.g., Wikipedia). Although there has been a lot of work on NED for long and formal texts like Wikipedia and news, the task is not well studied for questions in community question answering (CQA). The challenges of the task include little context for mentions in questions, lack of ground truth for learning, and language gaps between CQA and knowledge bases. To overcome these problems, we propose a topic modelling approach to NED for questions. Our model performs learning in an unsupervised manner, but can take advantage of weak supervision signals estimated from the metadata of CQA and knowledge bases. The signals can enrich the context of mentions in questions, and bridge the language gaps between CQA and knowledge bases. Besides these advantages, our model simulates people’s behavior in CQA and thus is intuitively interpretable. We conduct experiments on both Chinese and English CQA data. The experimental results show that our method can significantly outperform state-of-the-art methods when we apply them to questions in CQA. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
31. Social image tagging using graph-based reinforcement on multi-type interrelated objects.
- Author
-
Zhang, Xiaoming, Zhao, Xiaojian, Li, Zhoujun, Xia, Jiali, Jain, Ramesh, and Chao, Wenhan
- Subjects
- *
GRAPH theory , *IMAGE processing , *COMPUTER algorithms , *SOCIAL media , *DATA analysis - Abstract
Abstract: Social image tagging is becoming increasingly popular with the development of social website, where images are annotated with arbitrary keywords called tags. Most of present image tagging approaches are mainly based on the visual similarity or mapping between visual feature and tags. However, in the social media environment, images are always associated with multi-type of object information (i.e., visual content, tags, and user contact information) which makes this task more challenging. In this paper, we propose to fuse multi-type of information to tag social image. Specifically, we model social image tagging as a “ranking and reinforcement” problem, and a novel graph-based reinforcement algorithm for interrelated multi-type objects is proposed. When a user issue a tagging request for a query image, a candidate tag set is derived and a set of friends of the query user is selected. Then a graph which contains three types of objects (i.e., visual features of the query image, candidate tags, and friend users) is constructed, and each type of objects are initially ranked based on their weight and intra-relation. Finally, candidate tags are re-ranked by our graph-based reinforcement algorithm which takes into consideration both inter-relation with visual features and friend users, and the top ranked tags are saved. Experiments on real-life dataset demonstrate that our algorithm significantly outperforms state-of-the-art algorithms. [Copyright &y& Elsevier]
- Published
- 2013
- Full Text
- View/download PDF
32. Efficient and dynamic key management for multiple identities in identity-based systems
- Author
-
Guo, Hua, Xu, Chang, Li, Zhoujun, Yao, Yanqing, and Mu, Yi
- Subjects
- *
PUBLIC key cryptography , *INFORMATION technology security , *INFORMATION resources management , *INFORMATION retrieval , *STOCHASTIC models , *COMPARATIVE studies , *INFORMATION theory - Abstract
Abstract: The traditional identity-based cryptography requires a user, who holds multiple identities, to hold multiple private keys, where each private key is associated with an identity. Managing multiple private/public keys is a heavy burden to a user due to key management and storage. The recent advancement of identity-based cryptography allow a single private key to map multiple public keys (identities); therefore the private key management is simplified. Unfortunately, the existing schemes capturing this feature do not allow dynamic changes of identities and have a large data size proportional to the number of the associated identities. To overcome these problems, in this paper, we present an efficient and dynamic identity-based key exchange protocol and prove its security under the Bilinear Diffie–Hellman assumption in the random oracle model. Our protocol requires a relatively small bandwidth for a key agreement communication, in comparison with other existing schemes. [Copyright &y& Elsevier]
- Published
- 2013
- Full Text
- View/download PDF
33. Adversarial learning for multi-view network embedding on incomplete graphs.
- Author
-
Li, Chaozhuo, Wang, Senzhang, Yang, Dejian, Yu, Philip S., Liang, Yanbo, and Li, Zhoujun
- Subjects
- *
EMBEDDINGS (Mathematics) , *ELECTRIC network topology , *VECTOR spaces , *INFORMATION networks , *LEARNING strategies - Abstract
Network embedding, as a promising way of node representation learning, is capable of supporting various downstream network mining tasks, and has attracted growing research interests recently. Existing approaches mostly focus on learning the low-dimensional node representations by preserving the local or global topology information of a static network. It is difficult for such methods to learn desirable features for the nodes in an incomplete graph whose topology information is sparse or the new nodes in a dynamic graph. It is also challenging for them to deeply incorporate node attributes as the complementary information to improve the network embedding performance. To this end, in this paper we propose a Multi-View Adversarial learning based Network Embedding model named MVANE to deeply fuse the network topology information and node attributes to better perform network embedding on incomplete graphs. The insight is that the network topology and the node attributes are treated as two correlated views. The learned embedding vector of a node should be able to reveal its unique characteristics in both views. Specifically, the adversarial autoencoder is introduced as the basic model of MVANE. Autoencoder can learn a projection function to directly map the input feature vectors into the latent space, which ensures the MVANE learn embeddings for the new nodes through features projection without the need of retraining the model. Meanwhile, the adversarial learning strategy is also applied to better capture the cross-view correlations. The idea is that the learned embeddings in one view can not only reconstruct the inputs in this view, but also generate the features in another view. Under a unified learning framework, the latent representations in different views are fused and jointly reinforced by the proposed self/cross-view learning model. Empirically, we evaluate MVANE over multiple network datasets, and the results demonstrate the superiority of our proposal. • We investigate the novel problem of network embedding on incomplete graphs. • We propose an adversarial learning based network embedding model MVANE. • The experimental results demonstrate the superiority of the proposed model. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
34. Visual-textual sentiment classification with bi-directional multi-level attention networks.
- Author
-
Xu, Jie, Huang, Feiran, Zhang, Xiaoming, Wang, Senzhang, Li, Chaozhuo, Li, Zhoujun, and He, Yueying
- Subjects
- *
SENTIMENT analysis , *ATTENTION , *SOCIAL media , *CLASSIFICATION , *HYACINTHOIDES , *SOCIAL networks - Abstract
Social network has become an inseparable part of our daily lives and thus the automatic sentiment analysis on social media content is of great significance to identify people's viewpoints, attitudes, and emotions on the social websites. Most existing works have concentrated on the sentiment analysis of single modality such as image or text, which cannot handle the social media content with multiple modalities including both image and text. Although some works tried to conduct multi-modal sentiment analysis, the complicated correlations between the two modalities have not been fully explored. In this paper, we propose a novel Bi-Directional Multi-Level Attention (BDMLA) model to exploit the complementary and comprehensive information between the image modality and text modality for joint visual-textual sentiment classification. Specifically, to highlight the emotional regions and words in the image–text pair, visual attention network and semantic attention network are proposed respectively. The visual attention network makes region features of the image interact with multiple semantic levels of text (word, phrase, and sentence) to obtain the attended visual features. The semantic attention network makes semantic features of the text interact with multiple visual levels of image (global and local) to obtain the attended semantic features. Then, the attended visual and semantic features from the two attention networks are unified into a holistic framework to conduct visual-textual sentiment classification. Proof-of-concept experiments conducted on three real-world datasets verify the effectiveness of our model. • Bi-directional attention to highlight the emotional regions and words. • Multiple levels to excavate the emotional correlations between image and text. • The experimental results demonstrate the superiority of the proposed model. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
35. Network embedding by fusing multimodal contents and links.
- Author
-
Huang, Feiran, Zhang, Xiaoming, Xu, Jie, Li, Chaozhuo, and Li, Zhoujun
- Subjects
- *
EMBEDDINGS (Mathematics) , *EMBEDDING theorems , *SHORT-term memory , *SOCIAL media , *LEARNING - Abstract
Abstract Embedding the network into a low-dimensional space has attracted extensive research interest as well as boomed a lot of applications, such as node classification and link prediction. Most existing methods learn the network embedding simply from the network structure. However, the social media data, such as social images, usually contain both multimodal contents (e.g., visual content and text description) and social links among the images. To address this problem, we propose a novel model Attention-based Multi-view Variational Auto-Encoder (AMVAE) to fuse both the links and the multimodal contents for more effectively and efficiently network embedding. Specifically, Bi-LSTM (bidirectional long short-term memory) with attention model is proposed to capture the fine-granularity correlation between different data modalities, such as some words are reflected by specific visual regions. A joint representation of the multimodal contents is accordingly learned. Then, the network structure information and the learned representation for the multimodal contents are considered as two views. To fuse the two views, a multi-view correlation learning based Variational Auto-Encoder (VAE) is proposed to learn the representation of each node. By jointly optimizing the two components into a holistic learning framework, the embedding of network structure and multimodal contents are integrated and mutually reinforced. Experiments on three real-world datasets demonstrate the superiority of the proposed model in two applications, i.e., multi-label classification and link prediction. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
36. Image–text sentiment analysis via deep multimodal attentive fusion.
- Author
-
Huang, Feiran, Zhang, Xiaoming, Zhao, Zhonghua, Xu, Jie, and Li, Zhoujun
- Subjects
- *
SENTIMENT analysis , *SOCIAL media , *DISCRIMINATION (Sociology) , *CLASSIFIERS (Linguistics) , *COMPUTATIONAL linguistics - Abstract
Abstract Sentiment analysis of social media data is crucial to understand people's position, attitude, and opinion toward a certain event, which has many applications such as election prediction and product evaluation. Though great effort has been devoted to the single modality (image or text), less effort is paid to the joint analysis of multimodal data in social media. Most of the existing methods for multimodal sentiment analysis simply combine different data modalities, which results in dissatisfying performance on sentiment classification. In this paper, we propose a novel image–text sentiment analysis model, i.e., Deep Multimodal Attentive Fusion (DMAF), to exploit the discriminative features and the internal correlation between visual and semantic contents with a mixed fusion framework for sentiment analysis. Specifically, to automatically focus on discriminative regions and important words which are most related to the sentiment, two separate unimodal attention models are proposed to learn effective emotion classifiers for visual and textual modality respectively. Then, an intermediate fusion-based multimodal attention model is proposed to exploit the internal correlation between visual and textual features for joint sentiment classification. Finally, a late fusion scheme is applied to combine the three attention models for sentiment prediction. Extensive experiments are conducted to demonstrate the effectiveness of our approach on both weakly labeled and manually labeled datasets. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
37. Unsupervised geographically discriminative feature learning for landmark tagging.
- Author
-
Zhang, Xiaoming, Zhao, Zhonghua, Zhang, Haijun, Wang, Senzhang, and Li, Zhoujun
- Subjects
- *
FEATURE selection , *IMAGE processing , *SOCIAL media , *GLOBAL Positioning System , *TAGS (Metadata) - Abstract
Recently, a large number of geo-tagged landmark images have been uploaded through various social media services. Usually, these geo-tagged images are annotated by users with GPS and tags related to the landmarks where they are taken. Landmark tagging aims to automatically annotate an image with the tags to describe the landmark where the image is taken. It has been observed that the images and tags show strong correlation with the geographical locations. The widely used assumption by many existing tagging methods is that images are independently and identically distributed is not effective to capture the geographical correlation. In this paper, we study the novel problem of utilizing the geographical correlation among images and landmarks for better tagging landmark images. In particular, we propose an unsupervised feature learning approach to learn the geographically discriminative features across geographical locations, by integrating latent space learning and geographically structural analysis (LSGSA) into a joint model. A latent space learning model is proposed to effectively fuse the heterogeneous features of visual content and tags. Meanwhile, the geographical structure analysis and group sparsity are applied to learn the geographically discriminative features. Then, a geo-guided sparse reconstruction method is proposed to tag images by utilizing the discriminative information of features, in which the landmark-specific tags are boosted by a weighting method. Experiments on the real-world datasets demonstrate the superiority of our approach. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
38. Response selection from unstructured documents for human-computer conversation systems.
- Author
-
Yan, Zhao, Duan, Nan, Bao, Junwei, Chen, Peng, Zhou, Ming, and Li, Zhoujun
- Subjects
- *
HUMAN-computer interaction , *INFORMATION retrieval , *ONLINE chat , *EMPIRICAL research , *NATURAL language processing , *ARTIFICIAL intelligence - Abstract
This paper studies response selection for human-computer conversation systems. Existing retrieval-based human-computer conversation systems are intended to reply to user utterances based on existing utterance-response pairs. However, collecting sufficient utterance-response pairs is intractable in practical situations, especially for many specific domains. We introduce DocChat a novel information retrieval approach for human-computer conversation systems that can use unstructured documents rather than semi-structured utterance-response pairs, to react to user utterances. The key of DocChat is a learning to rank model with features designed at various levels of granularity which is proposed to quantify the relevance between utterances and responses directly. We conduct comprehensive experiments on both sentence selection and real human-computer conversation scenarios. Empirical studies of sentence selection datasets shows reasonable improvements and the strong adaptability of our model. We compare DocChat with Xiaoice, a famous open domain chitchat engine in China. Side-by-side evaluation shows that DocChat is a good complement for human-computer conversation systems using utterance-response pairs as the primary source of responses. Furthermore, we release a large scale open-domain dataset for sentence selection which contains 304,413 query-sentence pairs. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
39. Dynamic self-attention with vision synchronization networks for video question answering.
- Author
-
Liu, Yun, Zhang, Xiaoming, Huang, Feiran, Shen, Shixun, Tian, Peng, Li, Lang, and Li, Zhoujun
- Subjects
- *
SYNCHRONIZATION , *VIDEO excerpts , *VIDEOS , *TIME series analysis - Abstract
• A novel token selection mechanism based on the dynamic self-attention network is proposed to automatically extract important video features. • A vision synchronization network is proposed to align appearance and motion features at the time slice level. • Extensive experiments and analysis confirm the superiority of the proposed model DSAVS. Video Question Answering (VideoQA) has gained increasing attention as an important task in understanding the rich spatio-temporal contents, i.e., the appearance and motion in the video. However, existing approaches mainly use the question to learn attentions over all the sampled appearance and motion features separately, which neglect two properties of VideoQA: (1) the answer to the question is often reflected on a few frames and video clips, and most video contents are superfluous; (2) appearance and motion features are usually concomitant and complementary to each other in time series. In this paper, we propose a novel VideoQA model, i.e., Dynamic Self-Attention with Vision Synchronization Networks (DSAVS), to address these problems. Specifically, a gated token selection mechanism is proposed to dynamically select the important tokens from appearance and motion sequences. These chosen tokens are fed into a self-attention mechanism to model the internal dependencies for more effective representation learning. To capture the correlation between the appearance and motion features, a vision synchronization block is proposed to synchronize the two types of vision features at the time slice level. Then, the visual objects can be correlated with their corresponding activities and the performance is further improved. Extensive experiments conducted on three public VideoQA data sets confirm the effectivity and superiority of our model compared with state-of-the-art methods. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
40. A new methodology for anomaly detection of attacks in IEC 61850-based substation system.
- Author
-
Yang, Liqun, Zhai, You, Zhang, Yipeng, Zhao, Yufei, Li, Zhoujun, and Xu, Tongge
- Subjects
- *
ANOMALY detection (Computer security) , *CYBER physical systems , *DISCRETE wavelet transforms , *FEATURE extraction , *SHORT-term memory - Abstract
Smart substation is a crucial Cyber-Physical system and is prone to cyber-attack. In this paper, we propose a novel anomaly detection mechanism tailored for detecting the IEC 61850-based network traffic. Three types of traffic features are taken into account for comprehensively characterizing the network traffic during a time window. To eliminate the subjectivity of manually selecting the traffic features, we exploit Discrete Wavelet Transform (DWT) algorithm to secondarily extract the deep features. An improved Locally Linear Embedding (LLE) algorithm is proposed to reduce the dimension of deep feature vectors with more effective dimensionality reduction ability. By doing so, the LSTM (Long Short Term Memory)-based Autoencoder network that can learn to reconstruct the normal traffic time-series behavior, and thereafter uses the reconstruction error to detect the anomalies. We assess the performance of our proposed mechanism with the comprehensive experiments on the real smart substation. The results indicate that the proposed mechanism can be performed in a fast way with satisfactory detection performance. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
41. A provably secure authenticated key agreement protocol for wireless communications
- Author
-
Guo, Hua, Xu, Chang, Mu, Yi, and Li, Zhoujun
- Subjects
- *
WIRELESS communications , *ENGINEERING design , *ELLIPTIC curves , *KEY agreement protocols (Computer network protocols) , *BANDWIDTHS , *MOBILE apps , *COMPARATIVE studies , *PROOF theory - Abstract
Abstract: Designing elliptic curve password-based authenticated key agreement (ECPAKA) protocols for wireless mobile communications is a challenging task due to the limitation of bandwidth and storage of the mobile devices. Some well-published ECPAKA protocols have been proved to be insecure. We notice that until now none of the existing ECPAKA protocols for wireless mobile communication is provided any formal security analysis. In this paper, we propose a novel protocol and conduct a formal security analysis on our protocol. Compared with other ECPAKA protocol, our protocol meets all basic security properties and is the first ECPAKA protocol with formal security proof for wireless communication. We also explore the suitability of the novel protocol for 3GPP2 specifications and improve the A-Key (Authentication Key) distribution for current mobile cellular systems. [Copyright &y& Elsevier]
- Published
- 2012
- Full Text
- View/download PDF
42. Dual self-attention with co-attention networks for visual question answering.
- Author
-
Liu, Yun, Zhang, Xiaoming, Zhang, Qianyun, Li, Chaozhuo, Huang, Feiran, Tang, Xianghong, and Li, Zhoujun
- Subjects
- *
RECURRENT neural networks , *CONVOLUTIONAL neural networks , *IMAGE representation - Abstract
• A novel model based on the self-attention mechanism is proposed to learn more effective multi-modal representations. • The DSACA model is proposed to capture the internal dependencies and cross-modal correlation between the image and question sentence. • Extensive experiments and analysis confirm the superiority of the proposed DSACA. Visual Question Answering (VQA) as an important task in understanding vision and language has been proposed and aroused wide interests. In previous VQA methods, Convolutional Neural Networks (CNN) and Recurrent Neural Networks (RNN) are generally used to extract visual and textual features respectively, and then the correlation between these two features is explored to infer the answer. However, CNN mainly focuses on extracting local spatial information and RNN pays more attention on exploiting sequential architecture and long-range dependencies. It is difficult for them to integrate the local features with their global dependencies to learn more effective representations of the image and question. To address this problem, we propose a novel model, i.e., Dual Self-Attention with Co-Attention networks (DSACA), for VQA. It aims to model the internal dependencies of both the spatial and sequential structure respectively by using the newly proposed self-attention mechanism. Specifically, DSACA mainly contains three submodules. The visual self-attention module selectively aggregates the visual features at each region by a weighted sum of the features at all positions. The textual self-attention module automatically emphasizes the interdependent word features by integrating associated features among the sentence words. Besides, the visual-textual co-attention module explores the close correlation between visual and textual features learned from self-attention modules. The three modules are integrated into an end-to-end framework to infer the answer. Extensive experiments performed on three generally used VQA datasets confirm the favorable performance of DSACA compared with state-of-the-art methods. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
43. An improved ELM-based and data preprocessing integrated approach for phishing detection considering comprehensive features.
- Author
-
Yang, Liqun, Zhang, Jiawei, Wang, Xiaozhe, Li, Zhi, Li, Zhoujun, and He, Yueying
- Subjects
- *
PHISHING , *MACHINE learning , *MATRIX inversion , *ALGORITHMS - Abstract
• Define three types of features extracted from URLs, domains, etc. • Exploit a method to balance the majority and minority class samples. • Adopt an improved DAE-based method to reduce the dimension of the dataset. • Boost the detection performance by using the improved ELM-based classifier. • Do experiments to verify the feasibility and effectiveness of the proposed approach. In this paper, a novel approach based on non-inverse matrix online sequence extreme learning machine (NIOSELM) for phishing detection is presented, which takes into account three types of features to comprehensively characterize a website. For the NIOSELM algorithm, we use Sherman Morriso Woodbury equation to avoid the matrix inversion operation, and introduce the idea of online sequence extreme learning machine (OSELM) to update the training model. In order to reduce the dependence of the detection model on the majority class, we use Adaptive Synthetic Sampling (ADASYN) algorithm to generate the synthetic minority class samples to balance the distribution between the samples of the majority and minority classes. Furthermore, an improved denoising auto-encoder (SDAE) is designed to reduce the dimension of the experimental dataset. The experimental results show the efficiency and feasibility of the proposed detection mechanism. Moreover, the overall detection performance of NIOSELM is better than that of other existing methods, especially in training speed and the detection accuracy. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.