798 results
Search Results
2. The first propaganda war through computer networks: STEM academia and the breakup of Yugoslavia.
- Author
-
Brautović, Mato
- Subjects
- *
COMPUTER networks , *NETWORK PC (Computer) , *INTERNET forums , *WAR , *HISTORY of computers , *ACADEMIA - Abstract
The history of computer networks is relatively well described in Western literature but some parts of the world have been neglected. This paper explores the first ways in which computer networks were used in Yugoslavia, since these are different from the modes used in the West or Russia, because the dissolution of the country -- mixed with its transition from communism to democracy and the wars for independence -- created an environment which allowed computer networks to be used in unprecedented ways. The paper uses a mix of historical method, computational methods for collecting and analysing USENET data, semi-structured interview, archival research, and qualitative online observation. The main findings show that access to Western technology and participation in academic networks enabled Yugoslavian STEM academia and hackers to use computer networks for the first computer networks' propaganda war. Slovenians, Croatians, and Serbians created electronic mailing lists through which they tried to manipulate international actors and to bond the diaspora for a common cause, and they additionally fought in USENET discussion groups by implementing trolling techniques. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
3. Dual Encoding for Video Retrieval by Text.
- Author
-
Dong, Jianfeng, Li, Xirong, Xu, Chaoxi, Yang, Xun, Yang, Gang, Wang, Xun, and Wang, Meng
- Subjects
- *
VIDEO coding , *BLENDED learning , *ENCODING , *VIDEOS , *MACHINE learning , *RECURRENT neural networks - Abstract
This paper attacks the challenging problem of video retrieval by text. In such a retrieval paradigm, an end user searches for unlabeled videos by ad-hoc queries described exclusively in the form of a natural-language sentence, with no visual example provided. Given videos as sequences of frames and queries as sequences of words, an effective sequence-to-sequence cross-modal matching is crucial. To that end, the two modalities need to be first encoded into real-valued vectors and then projected into a common space. In this paper we achieve this by proposing a dual deep encoding network that encodes videos and queries into powerful dense representations of their own. Our novelty is two-fold. First, different from prior art that resorts to a specific single-level encoder, the proposed network performs multi-level encoding that represents the rich content of both modalities in a coarse-to-fine fashion. Second, different from a conventional common space learning algorithm which is either concept based or latent space based, we introduce hybrid space learning which combines the high performance of the latent space and the good interpretability of the concept space. Dual encoding is conceptually simple, practically effective and end-to-end trained with hybrid space learning. Extensive experiments on four challenging video datasets show the viability of the new method. Code and data are available at https://github.com/danieljf24/hybrid_space. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
4. A Survey on Knowledge Graph-Based Recommender Systems.
- Author
-
Guo, Qingyu, Zhuang, Fuzhen, Qin, Chuan, Zhu, Hengshu, Xie, Xing, Xiong, Hui, and He, Qing
- Subjects
- *
RECOMMENDER systems , *KNOWLEDGE graphs , *GRAPH algorithms , *USER experience - Abstract
To solve the information explosion problem and enhance user experience in various online applications, recommender systems have been developed to model users’ preferences. Although numerous efforts have been made toward more personalized recommendations, recommender systems still suffer from several challenges, such as data sparsity and cold-start problems. In recent years, generating recommendations with the knowledge graph as side information has attracted considerable interest. Such an approach can not only alleviate the above mentioned issues for a more accurate recommendation, but also provide explanations for recommended items. In this paper, we conduct a systematical survey of knowledge graph-based recommender systems. We collect recently published papers in this field, and group them into three categories, i.e., embedding-based methods, connection-based methods, and propagation-based methods. Also, we further subdivide each category according to the characteristics of these approaches. Moreover, we investigate the proposed algorithms by focusing on how the papers utilize the knowledge graph for accurate and explainable recommendation. Finally, we propose several potential research directions in this field. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
5. Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths.
- Author
-
Dai, Guowei, Guo, Longkun, Gutin, Gregory, Zhang, Xiaoyan, and Zhang, Zan-Bo
- Subjects
- *
TANNER graphs , *CODING theory , *ALGORITHMS , *DIRECTED graphs , *ARTIFICIAL intelligence , *GRAPH algorithms , *NP-hard problems , *WEIGHTED graphs - Abstract
As an algorithmic framework, message passing is extremely powerful and has wide applications in the context of different disciplines including communications, coding theory, statistics, signal processing, artificial intelligence and combinatorial optimization. In this paper, we investigate the performance of a message-passing algorithm called min-sum belief propagation (BP) for the vertex-disjoint shortest $k$ -path problem ($k$ -VDSP) on weighted directed graphs, and derive the iterative message-passing update rules. As the main result of this paper, we prove that for a weighted directed graph $G$ of order $n$ , BP algorithm converges to the unique optimal solution of $k$ -VDSP on $G$ within $O(n^{2}w_{max})$ iterations, provided that the weight $w_{e}$ is nonnegative integral for each arc $e\in E(G)$ , where $w_{max}=\max \{w_{e}: e\in E(G)\}$. To the best of our knowledge, this is the first instance where BP algorithm is proved correct for NP-hard problems. Additionally, we establish the extensions of $k$ -VDSP to the case of multiple sources or sinks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
6. On the Rate of Convergence of a Classifier Based on a Transformer Encoder.
- Author
-
Gurevych, Iryna, Kohler, Michael, and Sahin, Gozde Gul
- Subjects
- *
NATURAL language processing , *PATTERN recognition systems - Abstract
Pattern recognition based on a high-dimensional predictor is considered. A classifier is defined which is based on a Transformer encoder. The rate of convergence of the misclassification probability of the classifier towards the optimal misclassification probability is analyzed. It is shown that this classifier is able to circumvent the curse of dimensionality provided the a posteriori probability satisfies a suitable hierarchical composition model. Furthermore, the difference between the Transformer classifiers theoretically analyzed in this paper and the ones used in practice today is illustrated by means of classification problems in natural language processing. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
7. Cooperative Multiple-Access Channels With Distributed State Information.
- Author
-
Miretti, Lorenzo, Kobayashi, Mari, Gesbert, David, and de Kerret, Paul
- Subjects
- *
TRANSMITTERS (Communication) , *GAUSSIAN channels , *TRANSMITTING antennas , *COOPERATIVE societies , *CHANNEL coding , *WIRELESS communications - Abstract
This paper studies a memoryless state-dependent multiple access channel (MAC) where two transmitters wish to convey a message to a receiver under the assumption of causal and imperfect channel state information at transmitters (CSIT) and imperfect channel state information at receiver (CSIR). In order to emphasize the limitation of transmitter cooperation between physically distributed nodes, we focus on the so-called distributed CSIT assumption, i.e., where each transmitter has its individual channel knowledge, while the message can be assumed to be partially or entirely shared a priori between transmitters by exploiting some on-board memory. Under this setup, the first part of the paper characterizes the common message capacity of the channel at hand for arbitrary CSIT and CSIR structure. The optimal scheme builds on Shannon strategies, i.e., optimal codes are constructed by letting the channel inputs be a function of current CSIT only. For a special case when CSIT is a deterministic function of CSIR, the considered scheme also achieves the capacity region of a common message and two private messages. The second part addresses an important instance of the previous general result in a context of a cooperative multi-antenna Gaussian channel under i.i.d. fading operating in frequency-division duplex mode, such that CSIT is acquired via an explicit feedback of perfect CSIR. The capacity of the channel at hand is achieved by distributed linear precoding applied to Gaussian codes. Surprisingly, we demonstrate that it is suboptimal to send a number of data streams bounded by the number of transmit antennas as typically considered in a centralized CSIT setup. Finally, numerical examples are provided to evaluate the sum capacity of the binary MAC with binary states as well as the Gaussian MAC with i.i.d. fading. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
8. Lightweight, Effective Detection and Characterization of Mobile Malware Families.
- Author
-
Elish, Karim O., Elish, Mahmoud O., and Almohri, Hussain M. J.
- Subjects
- *
SOFTWARE measurement , *SUPERVISED learning , *SMART devices , *MALWARE , *CELL phones , *FAMILIES - Abstract
Android malware is an ongoing threat to billions of smart devices’ security, ranging from mobile phones to car infotainment systems. Despite numerous approaches and previous studies to develop solutions for detecting and preventing Android malware, the rapid continuous development of new malware variants requires a careful reconsideration and the development of effective methods to identify malware families given a meager number of malware instances. In this paper, we present DroidMalVet, a novel Android malware family classification and detection approach that does not require to perform complex program analyses or utilize large feature sets. DroidMalVet is the first to use a promising, diverse, and small set of software metrics as features in a supervised learning platform to classify and detect various Android malware families. Our extensive empirical evaluations on two large public malware datasets show that DroidMalVet accurately detects both small and large malware families with F-Score accuracy of 94.4% and 96%, and AUC equal to 99.5% and 99.7% on the malware families in Drebin and AMD datasets, respectively. Moreover, our results demonstrate the superior performance of DroidMalVet in detecting small families (i.e., families with few samples). DroidMalVet complements existing approaches and presents an early warning tool for detecting known and emerging malware families. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
9. On the Information-Theoretic Security of Combinatorial All-or-Nothing Transforms.
- Author
-
Gu, Yujie, Akao, Sonata, Esfahani, Navid Nasr, Miao, Ying, and Sakurai, Kouichi
- Subjects
- *
INFORMATION-theoretic security , *DISTRIBUTION (Probability theory) , *INFORMATION technology security , *RANDOM variables - Abstract
All-or-nothing transforms (AONTs) were proposed by Rivest as a message preprocessing technique for encrypting data to protect against brute-force attacks, and have numerous applications in cryptography and information security. Later the unconditionally secure AONTs and their combinatorial characterization were introduced by Stinson. Informally, a combinatorial AONT is an array with the unbiased requirements and its security properties in general depend on the prior probability distribution on the inputs $s$ -tuples. Recently, it was shown by Esfahani and Stinson that a combinatorial AONT has perfect security provided that all the inputs $s$ -tuples are equiprobable, and has weak security provided that all the inputs $s$ -tuples are with non-zero probability. This paper aims to explore on the gap between perfect security and weak security for combinatorial $(t,s,v)$ -AONTs. Concretely, we consider the typical scenario that all the $s$ inputs take values independently (but not necessarily identically) and quantify the amount of information $H(\mathcal {X}|\mathcal {Y})$ about any $t$ inputs $\mathcal {X}$ that is not revealed by any $s-t$ outputs $\mathcal {Y}$. In particular, we establish the general lower and upper bounds on $H(\mathcal {X}|\mathcal {Y})$ for combinatorial AONTs using information-theoretic techniques, and also show that the derived bounds can be attained in certain cases. Furthermore, the discussions are extended for the security properties of combinatorial asymmetric AONTs. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
10. Scalable Intra Coding Optimization for Video Coding.
- Author
-
Zhang, Jiaqi, Wang, Meng, Jia, Chuanmin, Wang, Shanshe, Ma, Siwei, and Gao, Wen
- Subjects
- *
VIDEO coding , *CITIES & towns , *ALGORITHMS , *COMPLEXITY (Philosophy) - Abstract
Flexible block partition and newly adopted intra coding tools bring significant performance improvement for next generation video coding, and meanwhile introduce non-negligible encoding complexity increment. This paper presents a scalable intra coding optimization (SICO) scheme for the third generation of audio video coding standard (AVS3). The complexity distribution and inheriting relationship among different partitioning, as well as intra prediction modes, are systematically analyzed. Subsequently, low-complexity algorithms are proposed, which could early exclude unlikely coding modes safely. In particular, a data-driven binary classifier is elegantly trained for the determination of coding unit partitioning. Moreover, the preliminary coding information can be exhaustively utilized for the mode decision in a low-cost manner. The proposed method provides scalable intra coding optimizing solutions, which is eligible to cater to various application scenarios. Experimental results show that the proposed method could achieve a wide range of encoding complexity reduction from 18% to 76% with moderate compression performance loss. One implementation of the proposed method has been adopted to the AVS3 reference software. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
11. Guest Editorial Special Issue on Selected Papers From EAPPC 2014.
- Author
-
Redondo, Luis M. S., Hosseini, Hamid, Novac, Bucur, and Yu, Xinjie
- Subjects
- *
PULSED power systems , *ELECTRIC power systems , *CONFERENCES & conventions - Abstract
This is a Special Issue containing selected papers presented at the 5th Euro-Asian Pulsed Power Conference (EAPPC) in Kumamoto, Japan, held on September 8-12, 2014. The present Special Issue continues the tradition of chronicling the latest advances in the domain of pulsed-power science and technology. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
12. Periodic Communities Mining in Temporal Networks: Concepts and Algorithms.
- Author
-
Qin, Hongchao, Li, Rong-Hua, Yuan, Ye, Wang, Guoren, Yang, Weihua, and Qin, Lu
- Subjects
- *
TIME-varying networks , *MINES & mineral resources , *SEARCH algorithms , *ALGORITHMS , *SOCIAL interaction , *COMMUNITIES - Abstract
Periodicity is a frequently happening phenomenon for social interactions in temporal networks. Mining periodic communities are essential to understanding periodic group behaviors in temporal networks. Unfortunately, most previous studies for community mining in temporal networks ignore the periodic patterns of communities. In this paper, we study the problem of seeking periodic communities in a temporal network, where each edge is associated with a set of timestamps. We propose novel models, including $\sigma$ σ -periodic $k$ k -core and $\sigma$ σ -periodic $k$ k -clique, that represent periodic communities in temporal networks. Specifically, a $\sigma$ σ -periodic $k$ k -core (or $\sigma$ σ -periodic $k$ k -clique) is a $k$ k -core (or clique with size larger than $k$ k ) that appears at least $\sigma$ σ times periodically in the temporal graph. The problem of searching periodic core is efficient but the resulting communities may be not enough cohesive; the problem of enumerating all periodic cliques is not efficient (NP-hard) but the resulting communities are very cohesive. To compute all of them efficiently, we first develop two effective graph reduction techniques to significantly prune the temporal graph. Then, we transform the temporal graph into a static graph and prove that mining the periodic communities in the temporal graph equals mining communities in the transformed graph. Subsequently, we propose a decomposition algorithm to search maximal $\sigma$ σ -periodic $k$ k -core, a Bron-Kerbosch style algorithm to enumerate all maximal $\sigma$ σ -periodic $k$ k -cliques, and a branch-and-bound style algorithm to find the maximum $\sigma$ σ -periodic clique. The results of extensive experiments on five real-life datasets demonstrate the efficiency, scalability, and effectiveness of our algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
13. Reading-Strategy Inspired Visual Representation Learning for Text-to-Video Retrieval.
- Author
-
Dong, Jianfeng, Wang, Yabing, Chen, Xianke, Qu, Xiaoye, Li, Xirong, He, Yuan, and Wang, Xun
- Subjects
- *
VISUAL learning , *VIDEOS , *FEATURE extraction - Abstract
This paper aims for the task of text-to-video retrieval, where given a query in the form of a natural-language sentence, it is asked to retrieve videos which are semantically relevant to the given query, from a great number of unlabeled videos. The success of this task depends on cross-modal representation learning that projects both videos and sentences into common spaces for semantic similarity computation. In this work, we concentrate on video representation learning, an essential component for text-to-video retrieval. Inspired by the reading strategy of humans, we propose a Reading-strategy Inspired Visual Representation Learning (RIVRL) to represent videos, which consists of two branches: a previewing branch and an intensive-reading branch. The previewing branch is designed to briefly capture the overview information of videos, while the intensive-reading branch is designed to obtain more in-depth information. Moreover, the intensive-reading branch is aware of the video overview captured by the previewing branch. Such holistic information is found to be useful for the intensive-reading branch to extract more fine-grained features. Extensive experiments on three datasets are conducted, where our model RIVRL achieves a new state-of-the-art on TGIF and VATEX. Moreover, on MSR-VTT, our model using two video features shows comparable performance to the state-of-the-art using seven video features and even outperforms models pre-trained on the large-scale HowTo100M dataset. Code is available at https://github.com/LiJiaBei-7/rivrl. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
14. Conditional Feature Learning Based Transformer for Text-Based Person Search.
- Author
-
Gao, Chenyang, Cai, Guanyu, Jiang, Xinyang, Zheng, Feng, Zhang, Jun, Gong, Yifei, Lin, Fangzhou, Sun, Xing, and Bai, Xiang
- Subjects
- *
IMAGE registration , *LEARNING , *SUPERVISED learning , *DATA mining , *ELECTRONIC publications , *PHYSICAL distribution of goods - Abstract
Text-based person search aims at retrieving the target person in an image gallery using a descriptive sentence of that person. The core of this task is to calculate a similarity score between the pedestrian image and description, which requires inferring the complex latent correspondence between image sub-regions and textual phrases at different scales. Transformer is an intuitive way to model the complex alignment by its self-attention mechanism. Most previous Transformer-based methods simply concatenate image region features and text features as input and learn a cross-modal representation in a brute force manner. Such weakly supervised learning approaches fail to explicitly build alignment between image region features and text features, causing an inferior feature distribution. In this paper, we present CFLT, Conditional Feature Learning based Transformer. It maps the sub-regions and phrases into a unified latent space and explicitly aligns them by constructing conditional embeddings where the feature of data from one modality is dynamically adjusted based on the data from the other modality. The output of our CFLT is a set of similarity scores for each sub-region or phrase rather than a cross-modal representation. Furthermore, we propose a simple and effective multi-modal re-ranking method named Re-ranking scheme by Visual Conditional Feature (RVCF). Benefit from the visual conditional feature and better feature distribution in our CFLT, the proposed RVCF achieves significant performance improvement. Experimental results show that our CFLT outperforms the state-of-the-art methods by 7.03% in terms of top-1 accuracy and 5.01% in terms of top-5 accuracy on the text-based person search dataset. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
15. Pseudo-Pair Based Self-Similarity Learning for Unsupervised Person Re-Identification.
- Author
-
Wu, Lin, Liu, Deyin, Zhang, Wenying, Chen, Dapeng, Ge, Zongyuan, Boussaid, Farid, Bennamoun, Mohammed, and Shen, Jialie
- Subjects
- *
VIDEO surveillance , *BASE pairs , *LEARNING , *IMAGE registration , *SUPERVISED learning - Abstract
Person re-identification (re-ID) is of great importance to video surveillance systems by estimating the similarity between a pair of cross-camera person shorts. Current methods for estimating such similarity require a large number of labeled samples for supervised training. In this paper, we present a pseudo-pair based self-similarity learning approach for unsupervised person re-ID without human annotations. Unlike conventional unsupervised re-ID methods that use pseudo labels based on global clustering, we construct patch surrogate classes as initial supervision, and propose to assign pseudo labels to images through the pairwise gradient-guided similarity separation. This can cluster images in pseudo pairs, and the pseudos can be updated during training. Based on pseudo pairs, we propose to improve the generalization of similarity function via a novel self-similarity learning:it learns local discriminative features from individual images via intra-similarity, and discovers the patch correspondence across images via inter-similarity. The intra-similarity learning is based on channel attention to detect diverse local features from an image. The inter-similarity learning employs a deformable convolution with a non-local block to align patches for cross-image similarity. Experimental results on several re-ID benchmark datasets demonstrate the superiority of the proposed method over the state-of-the-arts. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
16. Non-Local Robust Quaternion Matrix Completion for Large-Scale Color Image and Video Inpainting.
- Author
-
Jia, Zhigang, Jin, Qiyu, Ng, Michael K., and Zhao, Xi-Le
- Subjects
- *
QUATERNIONS , *MACHINE learning , *INPAINTING , *IMAGE color analysis , *SINGULAR value decomposition - Abstract
The image nonlocal self-similarity (NSS) prior refers to the fact that a local patch often has many nonlocal similar patches to it across the image and has been widely applied in many recently proposed machining learning algorithms for image processing. However, there is no theoretical analysis on its working principle in the literature. In this paper, we discover a potential causality between NSS and low-rank property of color images, which is also available to grey images. A new patch group based NSS prior scheme is proposed to learn explicit NSS models of natural color images. The numerical low-rank property of patched matrices is also rigorously proved. The NSS-based QMC algorithm computes an optimal low-rank approximation to the high-rank color image, resulting in high PSNR and SSIM measures and particularly the better visual quality. A new tensor NSS-based QMC method is also presented to solve the color video inpainting problem based on quaternion tensor representation. The numerical experiments on color images and videos indicate the advantages of NSS-based QMC over the state-of-the-art methods. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
17. Multi-View Consensus Proximity Learning for Clustering.
- Author
-
Liu, Bao-Yu, Huang, Ling, Wang, Chang-Dong, Lai, Jian-Huang, and Yu, Philip S.
- Subjects
- *
INITIAL value problems , *LAPLACIAN matrices - Abstract
Most proximity-based multi-view clustering methods are sensitive to the initial proximity matrix, where the clustering performance is quite unstable when using different initial proximity matrixes. This problem is defined as the initial value sensitivity problem. Since clustering is an unsupervised learning task, it is unrealistic to tune the initial proximity matrix. Thus, how to overcome the initial value sensitivity problem is a significant but unsolved issue in the proximity-based multi-view clustering. To this end, this paper proposes a novel multi-view proximity learning method, named multi-view consensus proximity learning (MCPL). On the one hand, by integrating the information of all views in a self-weighted manner and giving a rank constraint on the Laplacian matrix, the MCPL method learns the consensus proximity matrix to directly reflect the clustering result. On the other hand, different from most multi-view proximity learning methods, in the proposed MCPL method, the data representatives rather than the original data objects are adopted to learn the consensus proximity matrix. The data representatives will be updated in the process of the proximity learning so as to weaken the impact of the initial value on the clustering performance. Extensive experiments are conducted to demonstrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
18. GAN-Based Enhanced Deep Subspace Clustering Networks.
- Author
-
Yu, Zhiwen, Zhang, Zhongfan, Cao, Wenming, Liu, Cheng, Chen, C. L. Philip, and Wong, Hau-San
- Subjects
- *
GENERATIVE adversarial networks , *LEARNING modules , *SELF-adaptive software - Abstract
In this paper, we propose two GAN-based deep subspace clustering approaches: deep subspace clustering via dual adversarial generative networks (DSC-DAG) and self-supervised deep subspace clustering with adversarial generative networks (S $^2$ 2 DSC-AG). In DSC-DAG, the distributions of both the inputs and corresponding latent representations are learnt via adversarial training simultaneously. Besides, there are two kinds of synthetic representations to facilitate the fine-tuning of the encoder: the combinations of latent representations with random combination coefficients and representations of real-like inputs derived from noise variables. In S $^2$ 2 DSC-AG, a self-supervised information learning module substitutes for adversarial learning in the latent space, since both of them play the same role in learning discriminative latent representations. We analyze connections between these methods and demonstrate their equivalences. We conduct extensive experiments on multiple real-world data sets against state-of-the-art subspace clustering methods in terms of accuracy, normalized mutual information and purity. Experimental results demonstrate the effectiveness and superiority of our proposed methods. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
19. GraphShield: Dynamic Large Graphs for Secure Queries With Forward Privacy.
- Author
-
Du, Minxin, Wu, Shuangke, Wang, Qian, Chen, Dian, Jiang, Peipei, and Mohaisen, Aziz
- Subjects
- *
PRIVACY , *INFORMATION retrieval , *CLOUD computing , *GRAPH algorithms , *CONTRACTING out , *SCALABILITY - Abstract
The increasing amount of graph-structured data catalyzes analytics over graph databases using semantic queries. Motivated by the ubiquity of commercial cloud platforms, data owners are willing to store their graph databases remotely. However, data privacy has emerged as a widespread concern since the cloud platforms are not fully trusted. One viable solution is to encrypt sensitive data before outsourcing, which inevitably hinders data retrieval. To enable queries over encrypted data, searchable symmetric encryption (SSE) has been introduced. Yet, the most well-studied class of SSE schemes focuses on retrieving textual files given keywords, which cannot be applied to graph databases directly. This paper extends our preliminary work (FC’17) and proposes GraphShield, a structured encryption scheme for graphs. Beyond shortest distance queries, GraphShield can support other classic graph-based queries (e.g., maximum flow) and more complicated analytics (e.g., PageRank). Technically, we incorporate a suite of (efficient) cryptographic primitives and tailor some extra secure protocols for facilitating graph analytics. Our scheme also allows updates on the encrypted graph with forward privacy guaranteed. We formalize the security model and prove the adaptive security with reasonable leakage. Finally, we implement our scheme on various real-world datasets, and the experiment results demonstrate its practicality and scalability. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
20. Distributed Hypergraph Processing Using Intersection Graphs.
- Author
-
Gu, Yu, Yu, Kaiqiang, Song, Zhen, Qi, Jianzhong, Wang, Zhigang, Yu, Ge, and Zhang, Rui
- Subjects
- *
HYPERGRAPHS , *INTERSECTION graph theory , *DISTRIBUTED computing , *ONLINE social networks - Abstract
The advent of online applications such as social networks has led to an unprecedented scale of data and complex relationships among data. Hypergraphs are introduced to represent complex relationships that may involve more than two entities. A hypergraph is a generalized form of a graph, where edges are generalized to hyperedges. Each hyperedge may consist of any number of vertices. The flexibility of hyperedges also brings challenges in distributed hypergraph processing. In particular, a hypergraph is more difficult to be partitioned and distributed among $k$ k workers with balanced partitions. In this paper, we propose to convert a hypergraph into an intersection graph before partitioning by leveraging the inherent shared relationships among hypergraphs. We explore the intersection graph construction method and the corresponding partition strategy which can achieve the goal of evenly distributing vertices and hyperedges across workers, while yielding a significant communication reduction. We also design a distributed processing framework named $Hyraph$ H y r a p h that can directly run hypergraph analysis algorithms on our intersection graphs. Experimental results on real datasets confirm the effectiveness of our techniques and the efficiency of the $Hyraph$ H y r a p h framework. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
21. I/O-Efficient Algorithms for Degeneracy Computation on Massive Networks.
- Author
-
Li, Rong-Hua, Song, Qiushuo, Xiao, Xiaokui, Qin, Lu, Wang, Guoren, Yu, Jeffrey Xu, and Mao, Rui
- Subjects
- *
ALGORITHMS , *HEURISTIC algorithms - Abstract
Degeneracy is an important concept to measure the sparsity of a graph which has been widely used in many network analysis applications. Many network analysis algorithms, such as clique enumeration and truss decomposition, perform very well in graphs having small degeneracies. In this paper, we propose an I/O-efficient algorithm to compute the degeneracy of the massive graph that cannot be fully kept in the main memory. The proposed algorithm only uses $O(n)$ O (n) memory, where $n$ n denotes the number of nodes of the graph. We also develop an I/O-efficient algorithm to incrementally maintain the degeneracy on dynamic graphs. Extensive experiments show that our algorithms significantly outperform the state-of-the-art degeneracy computation algorithms in terms of both running time and I/O costs. The results also demonstrate high scalability of the proposed algorithms. For example, in a real-world web graph with 930 million nodes and 13.3 billion edges, the proposed algorithm takes only 633 seconds and uses less than 4.5GB memory to compute the degeneracy. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
22. Preference-Aware Task Assignment in Spatial Crowdsourcing: From Individuals to Groups.
- Author
-
Zhao, Yan, Zheng, Kai, Yin, Hongzhi, Liu, Guanfeng, Fang, Junhua, and Zhou, Xiaofang
- Subjects
- *
CROWDSOURCING , *SMART devices , *TASKS , *PERFORMANCE theory - Abstract
With the ubiquity of smart devices, Spatial Crowdsourcing (SC) has emerged as a new transformative platform that engages mobile users to perform spatio-temporal tasks by physically traveling to specified locations. Thus, various SC techniques have been studied for performance optimization, among which one of the major challenges is how to assign workers the tasks that they are really interested in and willing to perform. In this paper, we propose a novel preference-aware spatial task assignment system based on workers’ temporal preferences, which consists of two components: History-based Context-aware Tensor Decomposition (HCTD) for workers’ temporal preferences modeling and preference-aware task assignment. We model workers’ preferences with a three-dimension tensor (worker-task-time). Supplementing the missing entries of the tensor through HCTD with the assistant of historical data and other two context matrices, we recover workers’ preferences for different categories of tasks in different time slots. Several preference-aware individual task assignment algorithms are then devised, aiming to maximize the total number of task assignments at every time instance, in which we give higher priorities to the workers who are more interested in the tasks. In order to make our proposed framework applicable to more scenarios, we further optimize the original framework by proposing strategies to allow each task to be assigned to a group of workers such that the task can be completed by these workers simultaneously, wherein workers’ tolerable waiting time, consensus, and tasks’ rewards are taken into consideration. We conduct extensive experiments using a real dataset, verifying the practicability of our proposed methods. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
23. The Dynamic Privacy-Preserving Mechanisms for Online Dynamic Social Networks.
- Author
-
Zhu, Tianqing, Li, Jin, Hu, Xiangyu, Xiong, Ping, and Zhou, Wanlei
- Subjects
- *
ONLINE social networks - Abstract
Networks that constantly transmit information and change structure are becoming increasingly prevalent. However, traditional privacy models are designed to protect static information, such as records in a database or a person’s profile information, which seldom changes. This conflict between static models and dynamic environments is dramatically hindering the effectiveness and efficiency of privacy preservation in today’s dynamic world. Hence, in this paper, we formally define the concept of dynamic privacy, present two novel perspectives, privacy propagation and accumulation, on the way private information can spread through dynamic cyberspace, and develop associated theories and mechanisms for preserving privacy in advanced complex networks, such as social networking sites where data are constantly being released, shared, and exchanged. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
24. Probabilistic Graph Attention Network With Conditional Kernels for Pixel-Wise Prediction.
- Author
-
Xu, Dan, Alameda-Pineda, Xavier, Ouyang, Wanli, Ricci, Elisa, Wang, Xiaogang, and Sebe, Nicu
- Subjects
- *
PIXELS , *CONVOLUTIONAL neural networks , *RANDOM fields , *FORECASTING - Abstract
Multi-scale representations deeply learned via convolutional neural networks have shown tremendous importance for various pixel-level prediction problems. In this paper we present a novel approach that advances the state of the art on pixel-level prediction in a fundamental aspect, i.e. structured multi-scale features learning and fusion. In contrast to previous works directly considering multi-scale feature maps obtained from the inner layers of a primary CNN architecture, and simply fusing the features with weighted averaging or concatenation, we propose a probabilistic graph attention network structure based on a novel Attention-Gated Conditional Random Fields (AG-CRFs) model for learning and fusing multi-scale representations in a principled manner. In order to further improve the learning capacity of the network structure, we propose to exploit feature dependant conditional kernels within the deep probabilistic framework. Extensive experiments are conducted on four publicly available datasets (i.e. BSDS500, NYUD-V2, KITTI and Pascal-Context) and on three challenging pixel-wise prediction problems involving both discrete and continuous labels (i.e. monocular depth estimation, object contour prediction and semantic segmentation). Quantitative and qualitative results demonstrate the effectiveness of the proposed latent AG-CRF model and the overall probabilistic graph attention network with feature conditional kernels for structured feature learning and pixel-wise prediction. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
25. Magnitude Bounded Matrix Factorisation for Recommender Systems.
- Author
-
Jiang, Shuai, Li, Kan, and Da Xu, Richard Yi
- Subjects
- *
LOW-rank matrices , *FACTORIZATION , *MATHEMATICAL optimization , *SPARSE matrices , *RECOMMENDER systems , *MATRICES (Mathematics) - Abstract
Low rank matrix factorisation is often used in recommender systems as a way of extracting latent features. When dealing with large and sparse datasets, traditional recommendation algorithms face the problem of acquiring large, unrestrained, fluctuating values over predictions. Imposing bounding constraints has been proven an effective solution. However, existing bounding algorithms can only deal with one pair of fixed bounds, and are very time-consuming when applied on large-scale datasets. In this paper, we propose a novel algorithm named Magnitude Bounded Matrix Factorisation (MBMF), which allows different bounds for individual users/items and performs very quickly on large scale datasets. The key idea of our algorithm is to construct a model by constraining the magnitudes of each individual user/item feature vector. By converting coordinate system with radii set as the corresponding magnitudes, MBMF allows the above constrained optimisation problem to become an unconstrained one, which can be solved by unconstrained optimisation algorithms such as the stochastic gradient descent. We also explore an acceleration approach and the choice of magnitudes are given in detail as well. Experiments on synthetic and real datasets demonstrate that in most cases the proposed MBMF is superior over all existing algorithms in terms of accuracy and time complexity. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
26. Image-to-Video Generation via 3D Facial Dynamics.
- Author
-
Tu, Xiaoguang, Zou, Yingtian, Zhao, Jian, Ai, Wenjie, Dong, Jian, Yao, Yuan, Wang, Zhikang, Guo, Guodong, Li, Zhifeng, Liu, Wei, and Feng, Jiashi
- Subjects
- *
GENERATIVE adversarial networks , *TEXTURE mapping , *FACIAL expression , *FACE perception , *VIDEO excerpts - Abstract
We present a versatile model, FaceAnime, for various video generation tasks from still images. Video generation from a single face image is an interesting problem and usually tackled by utilizing Generative Adversarial Networks (GANs) to integrate information from the input face image and a sequence of sparse facial landmarks. However, the generated face images usually suffer from quality loss, image distortion, identity change, and expression mismatching due to the weak representation capacity of the facial landmarks. In this paper, we propose to “imagine” a face video from a single face image according to the reconstructed 3D face dynamics, aiming to generate a realistic and identity-preserving face video, with precisely predicted pose and facial expression. The 3D dynamics reveal changes of the facial expression and motion, and can serve as a strong prior knowledge for guiding highly realistic face video generation. In particular, we explore face video prediction and exploit a well-designed 3D dynamic prediction network to predict a 3D dynamic sequence for a single face image. The 3D dynamics are then further rendered by the sparse texture mapping algorithm to recover structural details and sparse textures for generating face frames. Our model is versatile for various AR/VR and entertainment applications, such as face video retargeting and face video prediction. Superior experimental results have well demonstrated its effectiveness in generating high-fidelity, identity-preserving, and visually pleasant face video clips from a single source face image. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
27. Multi-Task Learning With Coarse Priors for Robust Part-Aware Person Re-Identification.
- Author
-
Ding, Changxing, Wang, Kan, Wang, Pengfei, and Tao, Dacheng
- Subjects
- *
PRIOR learning , *SPINE , *PEDESTRIANS , *FEATURE extraction , *TASK analysis - Abstract
Part-level representations are important for robust person re-identification (ReID), but in practice feature quality suffers due to the body part misalignment problem. In this paper, we present a robust, compact, and easy-to-use method called the Multi-task Part-aware Network (MPN), which is designed to extract semantically aligned part-level features from pedestrian images. MPN solves the body part misalignment problem via multi-task learning (MTL) in the training stage. More specifically, it builds one main task (MT) and one auxiliary task (AT) for each body part on the top of the same backbone model. The ATs are equipped with a coarse prior of the body part locations for training images. ATs then transfer the concept of the body parts to the MTs via optimizing the MT parameters to identify part-relevant channels from the backbone model. Concept transfer is accomplished by means of two novel alignment strategies: namely, parameter space alignment via hard parameter sharing and feature space alignment in a class-wise manner. With the aid of the learned high-quality parameters, MTs can independently extract semantically aligned part-level features from relevant channels in the testing stage. MPN has three key advantages: 1) it does not need to conduct body part detection in the inference stage; 2) its model is very compact and efficient for both training and testing; 3) in the training stage, it requires only coarse priors of body part locations, which are easy to obtain. Systematic experiments on four large-scale ReID databases demonstrate that MPN consistently outperforms state-of-the-art approaches by significant margins. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
28. A Self-Consistent-Field Iteration for Orthogonal Canonical Correlation Analysis.
- Author
-
Zhang, Lei-Hong, Wang, Li, Bai, Zhaojun, and Li, Ren-Cang
- Subjects
- *
STATISTICAL correlation , *CANONICAL correlation (Statistics) , *ORTHOGRAPHIC projection , *PATTERN recognition systems , *PROBLEM solving , *FEATURE extraction - Abstract
We propose an efficient algorithm for solving orthogonal canonical correlation analysis (OCCA) in the form of trace-fractional structure and orthogonal linear projections. Even though orthogonality has been widely used and proved to be a useful criterion for visualization, pattern recognition and feature extraction, existing methods for solving OCCA problem are either numerically unstable by relying on a deflation scheme, or less efficient by directly using generic optimization methods. In this paper, we propose an alternating numerical scheme whose core is the sub-maximization problem in the trace-fractional form with an orthogonality constraint. A customized self-consistent-field (SCF) iteration for this sub-maximization problem is devised. It is proved that the SCF iteration is globally convergent to a KKT point and that the alternating numerical scheme always converges. We further formulate a new trace-fractional maximization problem for orthogonal multiset CCA and propose an efficient algorithm with an either Jacobi-style or Gauss-Seidel-style updating scheme based on the SCF iteration. Extensive experiments are conducted to evaluate the proposed algorithms against existing methods, including real-world applications of multi-label classification and multi-view feature extraction. Experimental results show that our methods not only perform competitively to or better than the existing methods but also are more efficient. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
29. Group Sampling for Scale Invariant Face Detection.
- Author
-
Ming, Xiang, Wei, Fangyun, Zhang, Ting, Chen, Dong, Zheng, Nanning, and Wen, Fang
- Subjects
- *
OBJECT recognition (Computer vision) , *DEEP learning , *CONVOLUTIONAL neural networks - Abstract
Detectors based on deep learning tend to detect multi-scale objects on a single input image for efficiency. Recent works, such as FPN and SSD, generally use feature maps from multiple layers with different spatial resolutions to detect objects at different scales, e.g., high-resolution feature maps for small objects. However, we find that objects at all scales can also be well detected with features from a single layer of the network. In this paper, we carefully examine the factors affecting detection performance across a large range of scales, and conclude that the balance of training samples, including both positive and negative ones, at different scales is the key. We propose a group sampling method which divides the anchors into several groups according to the scale, and ensure that the number of samples for each group is the same during training. Our approach using only one single layer of FPN as features is able to advance the state-of-the-arts. Comprehensive analysis and extensive experiments have been conducted to show the effectiveness of the proposed method. Moreover, we show that our approach is favorably applicable to other tasks, such as object detection on COCO dataset, and to other detection pipelines, such as YOLOv3, SSD and R-FCN. Our approach, evaluated on face detection benchmarks including FDDB and WIDER FACE datasets, achieves state-of-the-art results without bells and whistles. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
30. Unsourced Massive Random Access Scheme Exploiting Reed-Muller Sequences.
- Author
-
Wang, Jue, Zhang, Zhaoyang, Chen, Xiaoming, Zhong, Caijun, and Hanzo, Lajos
- Subjects
- *
ERROR probability , *SEQUENCE spaces , *COMPUTATIONAL complexity , *CHANNEL estimation - Abstract
The challenge in massive Machine Type Communication (mMTC) is to support reliable and instant access for an enormous number of machine-type devices (MTDs). In some particular applications of mMTC, the access point (AP) only has to know the messages received, but not where they source from, thus giving rise to the concept of unsourced random access (URA). In this paper, we propose a novel URA scheme exploiting the elegant properties of Reed-Muller (RM) sequences. Specifically, after dividing the message of an active user into several information chunks, RM sequences are used to carry those chunks, for exploiting the vast sequence space to improve the spectral efficiency, and their nested structure to enable reliable and efficient sequence detection. Next, we further explore a novel structural property of RM sequences for designing sparse patterns which carry part of the information and serve as the hints of coupling the information chunks of a single user. The factors affecting the performance of our slot-based RM detection are characterized. Besides, the complexity of the proposed message stitching method is analyzed and compared to the commonly used tree coding approach. Our simulation results verify the enhanced performance of the proposed URA scheme in error probability and computational complexity compared to the existing counterpart. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
31. Blockchain-Based Secure and Cooperative Private Charging Pile Sharing Services for Vehicular Networks.
- Author
-
Wang, Yuntao, Su, Zhou, Li, Jiliang, Zhang, Ning, Zhang, Kuan, Choo, Kim-Kwang Raymond, and Liu, Yiliang
- Subjects
- *
BLOCKCHAINS , *SMART cities , *RIDESHARING services , *INFRASTRUCTURE (Economics) , *SHARING , *ENERGY consumption , *PUBLIC spaces - Abstract
With the proliferation of electric vehicles (EVs), private charging pile (PCP) sharing networks are likely to be an integral part of future smart cities, especially in places with limited public charging infrastructure. However, there are a number of operational challenges associated with the deployment of PCPs in such a shared and untrusted environment. For example, how do we formulate efficient PCP sharing strategies in PCP sharing networks, while also taking into consideration the dynamic charging behaviors of EVs? Therefore, in this paper, we propose an energy blockchain-based secure PCP sharing scheme (BBC) for PCP sharing networks. First, an energy blockchain-based framework is designed for PCP sharing networks to facilitate energy sharing services for EVs and PCPs, using both distributed ledgers and cryptocurrency. Then, we devise a reputation-based secure PCP sharing algorithm to improve consensus efficiency with smaller signature sizes. In addition, a distributed reputation mechanism is constructed to assess the trustworthiness of consensus nodes in blockchain, based on ratings, behaviors, and fading. We also model the interactions among EVs and cooperative PCPs as a joint coalition-matching game, and obtain the optimal strategies of PCPs and EVs by analyzing the Nash-stable coalitional structure and stable many-to-one matching pairs. Extensive simulations and the real-world implementation demonstrate that the proposed approach improves the utility of EV users and renewable energy efficiency in PCP sharing networks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
32. Using Randomness to Improve Robustness of Tree-Based Models Against Evasion Attacks.
- Author
-
Yang, Fan, Chen, Zhiyuan, and Gangopadhyay, Aryya
- Subjects
- *
ERROR functions , *MACHINE learning , *RANDOM forest algorithms , *DIFFERENTIABLE functions , *SPAM email , *DECISION trees - Abstract
Machine learning models have been widely used in security applications. However, it is well-known that adversaries can adapt their attacks to evade detection. There has been some work on making machine learning models more robust to such attacks. However, one simple but promising approach called randomization is under-explored. In addition, most existing works focus on models with differentiable error functions while tree-based models do not have such error functions but are quite popular because they are easy to interpret. This paper proposes a novel randomization-based approach to improve robustness of tree-based models against evasion attacks. The proposed approach incorporates randomization into both model training time and model application time (meaning when the model is used to detect attacks). We also apply this approach to random forest, an existing ML method which already has incorporated randomness at training time but still often fails to generate robust models. We proposed a novel weighted-random-forest method to generate more robust models and a clustering method to add randomness at model application time. We also proposed a theoretical framework to provide a lower bound for adversaries’ effort. Experiments on intrusion detection and spam filtering data show that our approach further improves robustness of random-forest method. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
33. Maximizing the Utility in Location-Based Mobile Advertising.
- Author
-
Cheng, Peng, Lian, Xiang, Chen, Lei, and Liu, Siyuan
- Subjects
- *
LOCATION marketing , *ONLINE algorithms , *NP-hard problems , *AUTOMATIC timers , *APPROXIMATION algorithms , *ADVERTISING - Abstract
With the rapid development of mobile technology, nowadays, people spend a large amount of time on mobile devices. The locations and contexts of users are easily accessed by mobile advertising brokers, and the brokers can send customers related location-based advertisements. In this paper, we consider an important location-based advertising problem, namely maximum utility advertisement assignment (MUAA) problem, with the estimation of the interests of customers and the contexts of the vendors, we want to maximize the overall utility of ads by determining the ads sent to each customer subject to the constraints of the capacities of customers, the distance ranges and the budgets of vendors. We prove that the MUAA problem is NP-hard and intractable. Thus, we propose one offline approach, namely the ${\sf reconciliation\ approach}$ reconciliation approach , which has an approximation ratio of $(1-\epsilon)\cdot \theta$ (1 - ε) · θ . In addition, we also address the online scenario, in which customers arrive in a streaming fashion, with one novel online algorithm, namely the ${\sf online\ adaptive\ factor-aware\ approach}$ online adaptive factor - aware approach , which has a competitive ratio (compared to the optimal solution of the offline scenario) of $\frac{\ln (g)+1}{\theta }$ ln (g) + 1 θ , $g>e$ g > e , where $e$ e is the base of the natural logarithm. Through extensive experiments, we demonstrate the efficiency and effectiveness of our proposed approaches over both real and synthetic datasets. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
34. Multiview Clustering: A Scalable and Parameter-Free Bipartite Graph Fusion Method.
- Author
-
Li, Xuelong, Zhang, Han, Wang, Rong, and Nie, Feiping
- Subjects
- *
GRAPH connectivity , *BIPARTITE graphs - Abstract
Multiview clustering partitions data into different groups according to their heterogeneous features. Most existing methods degenerate the applicability of models due to their intractable hyper-parameters triggered by various regularization terms. Moreover, traditional spectral based methods always encounter the expensive time overheads and fail in exploring the explicit clusters from graphs. In this paper, we present a scalable and parameter-free graph fusion framework for multiview clustering, seeking for a joint graph compatible across multiple views in a self-supervised weighting manner. Our formulation coalesces multiple view-wise graphs straightforward and learns the weights as well as the joint graph interactively, which could actively release the model from any weight-related hyper-parameters. Meanwhile, we manipulate the joint graph by a connectivity constraint such that the connected components indicate clusters directly. The designed algorithm is initialization-independent and time-economical which obtains the stable performance and scales well with the data size. Substantial experiments on toy data as well as real datasets are conducted that verify the superiority of the proposed method compared to the state-of-the-arts over the clustering performance and time expenditure. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
35. Cohesive Subgraph Search Using Keywords in Large Networks.
- Author
-
Zhu, Yuanyuan, Zhang, Qian, Qin, Lu, Chang, Lijun, and Yu, Jeffrey Xu
- Subjects
- *
KEYWORD searching , *TRUSSES , *SUBGRAPHS - Abstract
Keyword search has been widely studied to retrieve relevant substructures from graphs for a given set of keywords. However, existing well-studied approaches aim at finding compact trees/subgraphs containing the keywords, and ignore a critical measure, density, to represent how strongly and stably the keyword nodes are connected in the substructure. In this paper, given a set of keywords $Q = \lbrace w_1, w_2, \ldots, w_l\rbrace$ Q = { w 1 , w 2 ,... , w l } , we study the problem of finding a cohesive subgraph containing $Q$ Q with high density and compactness from a graph $G$ G . We model the cohesive subgraph based on a carefully chosen $k$ k -truss model, and formulate the problem of finding cohesive subgraphs for keyword queries as minimal dense truss search problem, i.e., finding minimal subgraph that maximizes the trussness covering $Q$ Q . However, unlike $k$ k -truss based community search that can be efficiently done based on the local search from a given set of nodes, minimal dense truss search for keyword queries is a nontrivial task as the subset of keyword nodes to be included in the retrieved substructure is previously unknown. To tackle this problem, we first design a novel hybrid KT-Index to keep the keyword and truss information compacly, and then propose an efficient algorithm that carries the search on KT-Index directly to find the dense truss with the maximum trussness $G_{den}$ G d e n without repeated accesses to the original graph. Then, we develop a novel refinement approach to extract minimal dense truss from the dense truss $G_{den}$ G d e n , by checking each node at most once based on the anti-monotonicity property derived from $k$ k -truss, together with several optimization strategies including batch based deletion, early-stop based deletion, and local exploration. Moreover, we also extend the proposed method to deal with the top- $r$ r search. Extensive experimental studies on real-world networks validated the effectiveness and efficiency of our approaches. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
36. A Class of Optimal Structures for Node Computations in Message Passing Algorithms.
- Author
-
He, Xuan, Cai, Kui, and Zhou, Liang
- Subjects
- *
GRAPH algorithms - Abstract
Consider the computations at a node in a message passing algorithm. Assume that the node has incoming and outgoing messages $\mathbf {x} = (x_{1}, x_{2}, \ldots, x_{n})$ and $\mathbf {y} = (y_{1}, y_{2}, \ldots, y_{n})$ , respectively. In this paper, we investigate a class of structures that can be adopted by the node for computing $\mathbf {y}$ from $\mathbf {x}$ , where each $y_{j}, j = 1, 2, \ldots, n$ is computed via a binary tree with leaves $\mathbf {x}$ excluding $x_{j}$. We make three main contributions regarding this class of structures. First, we prove that the minimum complexity of such a structure is $3n - 6$ , and if a structure has such complexity, its minimum latency is $\delta + \lceil \log (n-2^{\delta }) \rceil $ with $\delta = \lfloor \log (n/2) \rfloor $ , where the logarithm always takes base two. Second, we prove that the minimum latency of such a structure is $\lceil \log (n-1) \rceil $ , and if a structure has such latency, its minimum complexity is $n \log (n-1)$ when $n-1$ is a power of two. Third, given $(n, \tau)$ with $\tau \geq \lceil \log (n-1) \rceil $ , we propose a construction for a structure which we conjecture to have the minimum complexity among structures with latencies at most $\tau $. Our construction method runs in $O(n^{3} \log ^{2}(n))$ time, and the obtained structure has complexity at most (generally much smaller than) $n \lceil \log (n) \rceil - 2$. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
37. Robust R-Peak Detection in Low-Quality Holter ECGs Using 1D Convolutional Neural Network.
- Author
-
Zahid, Muhammad Uzair, Kiranyaz, Serkan, Ince, Turker, Devecioglu, Ozer Can, Chowdhury, Muhammad E. H., Khandakar, Amith, Tahir, Anas, and Gabbouj, Moncef
- Subjects
- *
CONVOLUTIONAL neural networks , *HEART beat , *ELECTROCARDIOGRAPHY - Abstract
Objective: Noise and low quality of ECG signals acquired from Holter or wearable devices deteriorate the accuracy and robustness of R-peak detection algorithms. This paper presents a generic and robust system for R-peak detection in Holter ECG signals. While many proposed algorithms have successfully addressed the problem of ECG R-peak detection, there is still a notable gap in the performance of these detectors on such low-quality ECG records. Methods: In this study, a novel implementation of the 1D Convolutional Neural Network (CNN) is used integrated with a verification model to reduce the number of false alarms. This CNN architecture consists of an encoder block and a corresponding decoder block followed by a sample-wise classification layer to construct the 1D segmentation map of R-peaks from the input ECG signal. Once the proposed model has been trained, it can solely be used to detect R-peaks possibly in a single channel ECG data stream quickly and accurately, or alternatively, such a solution can be conveniently employed for real-time monitoring on a lightweight portable device. Results: The model is tested on two open-access ECG databases: The China Physiological Signal Challenge (2020) database (CPSC-DB) with more than one million beats, and the commonly used MIT-BIH Arrhythmia Database (MIT-DB). Experimental results demonstrate that the proposed systematic approach achieves 99.30% F1-score, 99.69% recall, and 98.91% precision in CPSC-DB, which is the best R-peak detection performance ever achieved. Results also demonstrate similar or better performance than most competing algorithms on MIT-DB with 99.83% F1-score, 99.85% recall, and 99.82% precision. Significance: Compared to all competing methods, the proposed approach can reduce the false-positives and false-negatives in Holter ECG signals by more than 54% and 82%, respectively. Conclusion: Finally, the simple and invariant nature of the parameters leads to a highly generic system and therefore applicable to any ECG dataset. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
38. Secrecy Outage Performance of FD-NOMA Relay System With Multiple Non-Colluding Eavesdroppers.
- Author
-
Hoang, Tran Manh, Dung, Le The, Nguyen, Ba Cao, Tran, Xuan Nam, and Kim, Taejoon
- Subjects
- *
RAYLEIGH fading channels , *POWER transmission , *SIGNAL-to-noise ratio - Abstract
In this paper, we investigate the secrecy performance of a full-duplex (FD) non-orthogonal multiple access (NOMA) relay system under the presence of multiple non-colluding eavesdroppers over Rayleigh fading channels. Furthermore, to improve legitimate link's capacity, the partial relay selection (PRS) scheme is applied to choose the best relay. To evaluate the secrecy performance, we derive the closed-form expressions of the secure outage probability (SOP) of each user, the overall SOP and the sum effective secrecy throughput (EST) of the considered FD-NOMA relay system. We compare the SOP of the FD-NOMA relay system with that of the half-duplex (HD)-NOMA system and the SOPs of FD-NOMA relay system in the cases that PRS and multiple-relay (MR) schemes are employed at multiple relays. Monte-Carlo simulations verify the correctness of all derived mathematical expressions. Numerical results show that thanks to utilizing FD relays and PRS scheme, the considered FD-NOMA relay system has superior secrecy performance than other systems. Furthermore, increasing the number of FD relays, enhancing their self-interference cancellation capability, and selecting a suitable transmission power help to reduce the SOP of the considered FD-NOMA relay system. Meanwhile, the EST rapidly increases with the equivocation rate of the eavesdropping channel then gradually reaches the saturated maximum value. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
39. Publicly Verifiable Databases With All Efficient Updating Operations.
- Author
-
Chen, Xiaofeng, Li, Hui, Li, Jin, Wang, Qian, Huang, Xinyi, Susilo, Willy, and Xiang, Yang
- Subjects
- *
DATABASES , *CLOUD computing - Abstract
The primitive of verifiable database (VDB) can enable a resource-limited client to securely outsource an encrypted database to an untrusted cloud server and the client could efficiently retrieve and update the data at will. Meanwhile, the client can undoubtedly detect any misbehavior by the server if the database has been tampered with. We argue that most of the existing VDB schemes can only support the updating operation of replacement, rather than other common updating operations such as insertion and deletion. Recently, the first publicly verifiable VDB schemes that supports all updating operations was proposed based on the idea of hierarchical vector commitment. However, one disadvantage of the proposed VDB scheme is that the computation and storage complexity increases linearly when the client continually inserts data records in the same index of the database. As a result, it remains an open problem how to construct an efficient (and publicly verifiable) VDB scheme that can support all updating operations regardless of the manner of insertion. In this paper, we first introduce a new primitive called committed invertible Bloom filter (CIBF) and utilize it to propose a new publicly verifiable VDB scheme that can support all kinds of updating operations. Additionally, the proposed construction is efficient regardless of the manner of updating operations and thus provides an affirmative answer to the above open problem. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
40. Fast and Accurate SimRank Computation via Forward Local Push and its Parallelization.
- Author
-
Wang, Yue, Che, Yulin, Lian, Xiang, Chen, Lei, and Luo, Qiong
- Subjects
- *
TRACKING algorithms , *GRAPH theory , *DATA mining , *HEURISTIC algorithms , *APPROXIMATION algorithms , *MULTICORE processors - Abstract
Measuring similarity among data objects is important in data analysis and mining. SimRank is a popular link-based similarity measurement among nodes in a graph. To compute the all-pairs SimRank matrix accurately, iterative methods are usually used. For static graphs, current iterative solutions are not efficient enough, both in time and space, due to the unnecessary cost and storage by the nature of iterative updating. For dynamic graphs, all current incremental solutions for updating the SimRank matrix are based on an approximated SimRank definition, and thus have no accuracy guarantee. In this paper, we propose a novel local push based algorithm for computing and tracking all-pairs SimRank. Furthermore, we develop an iterative parallel two-step framework for local push to take advantage of modern hardwares with multicore CPUs. We show that our algorithms outperform the state-of-the-art methods. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
41. Multi-View Spectral Clustering Tailored Tensor Low-Rank Representation.
- Author
-
Jia, Yuheng, Liu, Hui, Hou, Junhui, Kwong, Sam, and Zhang, Qingfu
- Subjects
- *
MATRIX decomposition , *SPARSE matrices , *SYMMETRIC matrices , *FEATURE extraction - Abstract
This paper explores the problem of multi-view spectral clustering (MVSC) based on tensor low-rank modeling. Unlike the existing methods that all adopt an off-the-shelf tensor low-rank norm without considering the special characteristics of the tensor in MVSC, we design a novel structured tensor low-rank norm tailored to MVSC. Specifically, we explicitly impose a symmetric low-rank constraint and a structured sparse low-rank constraint on the frontal and horizontal slices of the tensor to characterize the intra-view and inter-view relationships, respectively. Moreover, the two constraints could be jointly optimized to achieve mutual refinement. On basis of the novel tensor low-rank norm, we formulate MVSC as a convex low-rank tensor recovery problem, which is then efficiently solved with an augmented Lagrange multiplier-based method iteratively. Extensive experimental results on seven commonly used benchmark datasets show that the proposed method outperforms state-of-the-art methods to a significant extent. Impressively, our method is able to produce perfect clustering. In addition, the parameters of our method can be easily tuned, and the proposed model is robust to different datasets, demonstrating its potential in practice. The code is available at https://github.com/jyh-learning/MVSC-TLRR. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
42. Cohesive Group Nearest Neighbor Queries on Road-Social Networks under Multi-Criteria.
- Author
-
Guo, Fangda, Yuan, Ye, Wang, Guoren, Chen, Lei, Lian, Xiang, and Wang, Zimeng
- Subjects
- *
SOCIAL networks , *SOCIAL services , *GRAPH algorithms - Abstract
The group nearest neighbor (GNN) search on a road network $G_r$ G r , i.e., finding the spatial objects as activity assembly points with the smallest sum of distances to query users on $G_r$ G r , has been extensively studied; however, previous works neglected the fact that social relationships among query users, which ensure the maximally favorable atmosphere in the activity, can play an important role in GNN queries. Meanwhile, the ratings of spatial objects can also be used as recommended guidelines. Many real-world applications, such as location-based social networking services, require such queries. In this paper, we study two new problems: (1) a GNN search on a road network that incorporates cohesive social relationships (CGNN) and (2) a CGNN query under multi-criteria (MCGNN). Specifically, both the query users of highest closeness and the corresponding top- $j$ j objects are retrieved. To address critical challenges on the effectiveness of results and the efficiency of computation over large road-social networks: (1) for CGNN, we propose a filtering-and-verification framework. During filtering, we prune substantial unpromising users and objects using social and geospatial constraints. During verification, we obtain the object candidates, among which the top $j$ j are selected, with respect to the qualified users; (2) for MCGNN, we propose threshold-based selection and expansion strategies, where different strict boundaries are proposed to ensure that correct top- $j$ j objects are found early. Moreover, we further optimize search strategies to improve query performance. Finally, experimental results on real social and road networks significantly demonstrate the efficiency and efficacy of our solutions. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
43. Joint Deep Multi-View Learning for Image Clustering.
- Author
-
Xie, Yuan, Lin, Bingqian, Qu, Yanyun, Li, Cuihua, Zhang, Wensheng, Ma, Lizhuang, Wen, Yonggang, and Tao, Dacheng
- Subjects
- *
DEEP learning , *LEARNING strategies , *MACHINE learning , *FEATURE extraction - Abstract
In this paper, a novel Deep Multi-view Joint Clustering (DMJC) framework is proposed, where multiple deep embedded features, multi-view fusion mechanism, and clustering assignments can be learned simultaneously. Through the joint learning strategy, the clustering-friendly multi-view features and useful multi-view complementary information can be exploited effectively to improve the clustering performance. Under the proposed joint learning framework, we design two ingenious variants of deep multi-view joint clustering models, whose multi-view fusion is implemented by two kinds of simple yet effective schemes. The first model, called DMJC-S, performs multi-view fusion in an implicit way via a novel multi-view soft assignment distribution. The second model, termed DMJC-T, defines a novel multi-view auxiliary target distribution to conduct the multi-view fusion explicitly. Both DMJC-S and DMJC-T are optimized under a KL divergence objective. Experiments on eight challenging image datasets demonstrate the superiority of both DMJC-S and DMJC-T over single/multi-view baselines and the state-of-the-art multi-view clustering methods, which proves the effectiveness of the proposed DMJC framework. To the best of our knowledge, this is the first work to model the multi-view clustering in a deep joint framework, which will provide a meaningful thinking in unsupervised multi-view learning. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
44. Covert Rate Maximization in Wireless Full-Duplex Relaying Systems With Power Control.
- Author
-
Sun, Ranran, Yang, Bin, Ma, Siqi, Shen, Yulong, and Jiang, Xiaohong
- Subjects
- *
RELAY control systems , *WIRELESS sensor networks , *WIRELESS communications , *DECODE & forward communication , *MULTICASTING (Computer networks) - Abstract
This paper investigates the fundamental covert rate performance in a wireless relaying system consisting of a source-destination pair, a full-duplex (FD) relay and a warden, where the relay can work at either the FD mode or the half-duplex (HD) mode. We first provide theoretical modeling for the instantaneous/average covert rate when the system works solely under the FD mode or HD mode, and then explore the corresponding optimal transmit power control of relay for the covert rate maximization. For an improvement of covert rate, we further propose a joint FD/HD mode that flexibly switches between the FD and HD modes depending on channel state of the relay self-interference channel. Under the joint FD/HD mode, we also examine the related problems of theoretical modeling for covert rate and optimal transmit power control of relay for covert rate maximization. Finally, extensive numerical results are provided to illustrate the covert rate performances of the relaying system under the FD, HD and joint FD/HD modes. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
45. Petersen Graph Multi-Orientation Based Multi-Scale Ternary Pattern (PGMO-MSTP): An Efficient Descriptor for Texture and Material Recognition.
- Author
-
Khadiri, Issam El, Merabet, Youssef El, Tarawneh, Ahmad S., Ruichek, Yassine, Chetverikov, Dmitry, Touahni, Raja, and Hassanat, Ahmad B.
- Subjects
- *
PETERSEN graphs , *MATERIALS texture , *DESCRIPTOR systems , *DEEP learning , *COMPUTER vision , *FEATURE extraction , *SPATIAL arrangement - Abstract
Classifying and modeling texture images, especially those with significant rotation, illumination, scale, and view-point variations, is a hot topic in the computer vision field. Inspired by local graph structure (LGS), local ternary patterns (LTP), and their variants, this paper proposes a novel image feature descriptor for texture and material classification, which we call Petersen Graph Multi-Orientation based Multi-Scale Ternary Pattern (PGMO-MSTP). PGMO-MSTP is a histogram representation that efficiently encodes the joint information within an image across feature and scale spaces, exploiting the concepts of both LTP-like and LGS-like descriptors, in order to overcome the shortcomings of these approaches. We first designed two single-scale horizontal and vertical Petersen Graph-based Ternary Pattern descriptors ($PGTP_{h}$ and $PGTP_{v}$). The essence of $PGTP_{h}$ and $PGTP_{v}$ is to encode each $5\times 5$ image patch, extending the ideas of the LTP and LGS concepts, according to relationships between pixels sampled in a variety of spatial arrangements (i.e., up, down, left, and right) of Petersen graph-shaped oriented sampling structures. The histograms obtained from the single-scale descriptors $PGTP_{h}$ and $PGTP_{v}$ are then combined, in order to build the effective multi-scale PGMO-MSTP model. Extensive experiments are conducted on sixteen challenging texture data sets, demonstrating that PGMO-MSTP can outperform state-of-the-art handcrafted texture descriptors and deep learning-based feature extraction approaches. Moreover, a statistical comparison based on the Wilcoxon signed rank test demonstrates that PGMO-MSTP performed the best over all tested data sets. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
46. Structure-Texture Image Decomposition Using Discriminative Patch Recurrence.
- Author
-
Xu, Ruotao, Xu, Yong, and Quan, Yuhui
- Subjects
- *
SPATIAL arrangement , *FEATURE extraction - Abstract
Morphology component analysis provides an effective framework for structure-texture image decomposition, which characterizes the structure and texture components by sparsifying them with certain transforms respectively. Due to the complexity and randomness of texture, it is challenging to design effective sparsifying transforms for texture components. This paper aims at exploiting the recurrence of texture patterns, one important property of texture, to develop a nonlocal transform for texture component sparsification. Since the plain patch recurrence holds for both cartoon contours and texture regions, the nonlocal sparsifying transform constructed based on such patch recurrence sparsifies both the structure and texture components well. As a result, cartoon contours could be wrongly assigned to the texture component, yielding ambiguity in decomposition. To address this issue, we introduce a discriminative prior on patch recurrence, that the spatial arrangement of recurrent patches in texture regions exhibits isotropic structure which differs from that of cartoon contours. Based on the prior, a nonlocal transform is constructed which only sparsifies texture regions well. Incorporating the constructed transform into morphology component analysis, we propose an effective approach for structure-texture decomposition. Extensive experiments have demonstrated the superior performance of our approach over existing ones. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
47. A Common Method of Share Authentication in Image Secret Sharing.
- Author
-
Yan, Xuehu, Lu, Yuliang, Yang, Ching-Nung, Zhang, Xinpeng, and Wang, Shudong
- Subjects
- *
BLOCKCHAINS , *DIGITAL watermarking , *DIGITAL images , *CLOUD storage , *ACCESS control , *PIXELS - Abstract
Because of the importance of digital images and their extensive application to digital watermarking, block chain, access control, identity authentication, distributive storage in the cloud and so on, image secret sharing (ISS) is attracting ever-increasing attention. Share authentication is an important issue in its practical application. However, most ISS schemes with share authentication ability require a dealer to participate in the authentication (namely, dealer participatory authentication). In this paper, we design an ISS for a $(k,n)$ -threshold with separate share authentication abilities of both dealer participatory authentication and dealer nonparticipatory authentication. The advantages of polynomial-based ISS and visual secret sharing (VSS) are skillfully fused to achieve these two authentication abilities without sending a share by using a screening operation. In addition, the designed scheme has the characteristics of low decryption (authentication) complexity, lossless decryption and no pixel expansion. Experiments and theoretical analyses are performed to show the effectiveness of the designed scheme. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
48. Positive and Negative Label-Driven Nonnegative Matrix Factorization.
- Author
-
Wu, Wenhui, Jia, Yuheng, Wang, Shiqi, Wang, Ran, Fan, Hongfei, and Kwong, Sam
- Subjects
- *
MATRIX decomposition , *NONNEGATIVE matrices , *TASK analysis - Abstract
Positive label is often used as the supervisory information in the learning scenario, which refers to the category that a sample is assigned to. However, another side information lying in the labels, which describes the categories that a sample is exclusive of, have been largely ignored. In this paper, we propose a nonnegative matrix factorization (NMF) based classification method leveraging both positive and negative label information, which is termed as positive and negative label-driven NMF (PNLD-NMF). The proposed scheme concurrently accomplishes data representation and classification in a joint manner. Owing to the complementary characteristics between positive and negative labels, we further design a new regularization framework to take advantage of these two label types. Extensive experiments on six image classification benchmark datasets show that the proposed scheme is able to consistently deliver better classification accuracy. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
49. Learning Regional Attraction for Line Segment Detection.
- Author
-
Xue, Nan, Bai, Song, Wang, Fu-Dong, Xia, Gui-Song, Wu, Tianfu, Zhang, Liangpei, and Torr, Philip H.S.
- Subjects
- *
DEEP learning , *IMAGE segmentation , *PIXELS - Abstract
This paper presents regional attraction of line segment maps, and hereby poses the problem of line segment detection (LSD) as a problem of region coloring. Given a line segment map, the proposed regional attraction first establishes the relationship between line segments and regions in the image lattice. Based on this, the line segment map is equivalently transformed to an attraction field map (AFM), which can be remapped to a set of line segments without loss of information. Accordingly, we develop an end-to-end framework to learn attraction field maps for raw input images, followed by a squeeze module to detect line segments. Apart from existing works, the proposed detector properly handles the local ambiguity and does not rely on the accurate identification of edge pixels. Comprehensive experiments on the Wireframe dataset and the YorkUrban dataset demonstrate the superiority of our method. In particular, we achieve an F-measure of 0.831 on the Wireframe dataset, advancing the state-of-the-art performance by 10.3 percent. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
50. Spatially Coupled Generalized LDPC Codes: Asymptotic Analysis and Finite Length Scaling.
- Author
-
Mitchell, David G. M., Olmos, Pablo M., Lentmaier, Michael, and Costello, Daniel J.
- Subjects
- *
LOW density parity check codes , *BLOCK codes , *ITERATIVE decoding , *LINEAR codes , *TANNER graphs , *DRUM set - Abstract
Generalized low-density parity-check (GLDPC) codes are a class of LDPC codes in which the standard single parity check (SPC) constraints are replaced by constraints defined by a linear block code. These stronger constraints typically result in improved error floor performance, due to better minimum distance and trapping set properties, at a cost of some increased decoding complexity. In this paper, we study spatially coupled generalized low-density parity-check (SC-GLDPC) codes and present a comprehensive analysis of these codes, including: (1) an iterative decoding threshold analysis of SC-GLDPC code ensembles demonstrating capacity approaching thresholds via the threshold saturation effect; (2) an asymptotic analysis of the minimum distance and free distance properties of SC-GLDPC code ensembles, demonstrating that the ensembles are asymptotically good; and (3) an analysis of the finite-length scaling behavior of both GLDPC block codes and SC-GLDPC codes based on a peeling decoder (PD) operating on a binary erasure channel (BEC). Results are compared to GLDPC block codes, and the advantages and disadvantages of SC-GLDPC codes are discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.