159 results
Search Results
2. Multilayer Financial Complex Networks and Their Applications.
- Author
-
Li, Xuerong, Xu, Xiaoyue, Liu, Jiaqi, Dong, Jichang, and Lu, Jinhu
- Subjects
- *
MAXIMUM entropy method , *FINANCIAL risk , *INTERNATIONAL trade - Abstract
In the context of global integration, the theory of financial complex networks has made significant contributions to the establishment of stable financial systems and effective regulatory systems. This survey paper presents a systematic methodology for the multi-layer financial complex networks and their applications. Several typical financial networks in existing research are first summarized: the interbank network, the credit network, the international trade network, and the dealer network. The main methods used in the existing literature to analyze the structure of financial networks include maximum entropy methods, network characterization, community detection, and dynamic multi-layer network. Financial risk contagion as well as spillover effects are the core issues that most of the literature focuses on. Finally, this paper reviews the shortcomings of the existing literature and suggests future research directions in this area. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
3. Analysis of Mumbai Grid Failure Restoration on Oct 12, 2020: Challenges and Lessons Learnt.
- Author
-
Kumar, Sunny, Pandey, Abhishek, Goswami, Prerna, Pentayya, Polagani, and Kazi, Faruk
- Subjects
- *
WATER masses , *DYNAMIC models , *ELECTRIC power distribution grids , *SYSTEM dynamics , *FOREST restoration - Abstract
After any major blackout, recreating the exact scene is one of the crucial but foundation steps in postmortem analysis. This helps in identifying and understanding the exact causes and sequence of events to avoid such failures in the future. Rather, power system restoration demands critical skills which involves deployment of appropriate strategies based on information about various factors, notably the extent and duration of the blackout, location of black-started units, interconnections with neighbouring systems, generator capabilities, and selecting appropriate restoration paths. The actual execution of the restoration plan consists of many surprises of unique nature and a lot of learning’s to avoid future occurrences of such incidents. The restoration efforts and failure of Mumbai grid failure on October 12, 2020, are highlighted in this paper. The paper first proposes formulating the dynamic models to get a better insight of the restoration process in the event of critical issues during this incident. The various challenges faced in systematic recovery of such a large system and lessons learnt from it forms focus of the paper. The paper also discusses factors not covered in existing literature, such as weather, fuel availability, and water mass oscillations which plays an important role in the restoration. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
4. An Experimental Implementation of China Digital Radio (CDR) Broadcasting in Hubei.
- Author
-
Gao, Li, Liu, Jun, Huang, Yihang, and Men, Aidong
- Subjects
- *
DIGITAL audio broadcasting , *INTELLIGENT networks , *REGRESSION discontinuity design , *BROADCASTING industry , *QUALITY of service , *ELECTRONIC services - Abstract
This paper presents the research and implementation of a China Digital Radio (CDR) experimental network in Hubei, China with two FM-CDR transmitting stations and four FM-band channels. To study the coverage discontinuity problem in a large service area, the experimental network employs an intelligent networking solution that incorporates multiple service channels carrying Broadcast and Data Services (BADS) and a Common-Regional-Information Channel (CRIC) carrying both service data and system information. The electronic service guide (ESG) carried by CRIC can inform the receivers about the available contents from current and adjacent stations, which can significantly improve the service quality in the overlapping areas, especially under mobile reception environment. Two RF tuners are used in the receiving terminals to access the CRIC, and the BADS channel, respectively. This paper first presents the frequency analysis and coverage tests of the experimental network, and then summarizes the coverage performances with different transmission parameter combinations. The goal is to gain experience in frequency planning, coverage prediction, as well as supportable services of CDR digital audio broadcasting. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
5. Cleaning Uncertain Data With Crowdsourcing - A General Model With Diverse Accuracy Rates.
- Author
-
Zhang, Chen, Zhang, Haodi, Xie, Weiteng, Liu, Nan, Li, Qifan, Jiang, Di, Lin, Peiguang, Wu, Kaishun, and Chen, Lei
- Subjects
- *
PROBABILISTIC databases , *DATA scrubbing , *CROWDSOURCING , *APPROXIMATION algorithms , *DATABASES - Abstract
Since inaccuracies commonly exist in many applications, data uncertainty has become an important problem in database systems. To deal with data uncertainty, probabilistic databases can be used to store uncertain data, and querying facilities are provided to yield answers with confidence. However, the results from a query or mining process may not be reliable when the uncertainty propagates in the systems. In this paper, we leverage the power of crowdsourcing by designing a set of Human Intelligence Tasks, or HITs in short, to ask a crowd to improve the quality of uncertain data. In particular, we consider crowds consists of workers with diverse accuracy rates when answering the HITs. We design solutions to maximize the data quality with minimal number of HITs. There are two obstacles for this non-trivial optimization, which lead to very high computational cost for selecting the optimal set of HITs. First, members of a crowd may return incorrect answers with different probabilities. Second, the HITs decomposed from uncertain data are often correlated. We have addressed these challenges in this paper by designing an effective approximation algorithm and an efficient heuristic solution, especially for crowds with diverse individual accuracy rates. To further improve the efficiency, we derive tight lower and upper bounds for effective filtering and estimation. Extensive experiments on both a simulated crowd and a real crowdsourcing platform are conducted to evaluate our solutions. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
6. A Galois Connection Approach to Wei-Type Duality Theorems.
- Author
-
Xu, Yang, Kan, Haibin, and Han, Guangyue
- Subjects
- *
LINEAR codes , *HAMMING weight , *MATROIDS - Abstract
In 1991, Wei proved a duality theorem that established an interesting connection between the generalized Hamming weights of a linear code and those of its dual code. Wei’s duality theorem has since been extensively studied from different perspectives and extended to other settings. In this paper, we re-examine Wei’s duality theorem and its various extensions, henceforth referred to as Wei-type duality theorems, from a new Galois connection perspective. Our approach is based on the observation that the generalized Hamming weights and the dimension/length profiles of a linear code form a Galois connection. The central result of this paper is a general Wei-type duality theorem for two Galois connections between finite subsets of $\mathbb {Z}$ , from which all the known Wei-type duality theorems can be recovered. As corollaries of our central result, we prove new Wei-type duality theorems for $w$ -demi-matroids defined over finite sets and $w$ -demi-polymatroids defined over modules with a composition series, which further allows us to unify and generalize all the known Wei-type duality theorems established for codes endowed with various metrics. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
7. Competitive Relationship Prediction for Points of Interest: A Neural Graphlet Based Approach.
- Author
-
Zhou, Jingbo, Huang, Tao, Li, Shuangli, Hu, Renjun, Liu, Yanchi, Fu, Yanjie, and Xiong, Hui
- Subjects
- *
FORECASTING , *ELECTRONIC information resource searching , *DATA mining , *PREDICTION models - Abstract
Competition between Points of Interest (POIs) refers to the situation in which two POIs directly or indirectly provide similar services to secure businesses. A large portion of prior studies on competition analysis focuses on mining textual data, e.g., news articles and social comments. However, the increasing availability of human mobility and mobile query data enables a new paradigm for analyzing the competitive relationships among POIs, which remains largely unexplored. To this end, in this paper, we attempt to mine large-scale online map search query data for better understanding POI competitive relationships. Based on a co-query POI graph built from the map search query data, we develop a novel neural graphlet-based prediction framework to predict the competitive relationships among POIs. A unique perspective of our model is to infer latent POI competitive relationships by integrating multiple distinct factors, e.g., graphlet structure, geographical distance, and regional features, reflected in map search query data and POI data. Finally, we conduct extensive experiments on real-world datasets to demonstrate the effectiveness of the proposed framework, and show that our framework outperforms all baselines with a significant margin in all evaluation metrics. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
8. Sequence Pairs With Lowest Combined Autocorrelation and Crosscorrelation.
- Author
-
Katz, Daniel J. and Moore, Eli
- Subjects
- *
BINARY sequences , *COMPLEX numbers , *AUTOCORRELATION (Statistics) , *FINITE fields , *PORTULACA oleracea - Abstract
Pursley and Sarwate established a lower bound on a combined measure of autocorrelation and crosscorrelation for a pair $(f,g)$ of binary sequences (i.e., sequences with terms in {−1, 1}). If $f$ is a nonzero sequence, then its autocorrelation demerit factor, $\text {ADF}(f)$ , is the sum of the squared magnitudes of the aperiodic autocorrelation values over all nonzero shifts for the sequence obtained by normalizing $f$ to have unit Euclidean norm. If $(f,g)$ is a pair of nonzero sequences, then their crosscorrelation demerit factor, $\text {CDF}(f,g)$ , is the sum of the squared magnitudes of the aperiodic crosscorrelation values over all shifts for the sequences obtained by normalizing both $f$ and $g$ to have unit Euclidean norm. Pursley and Sarwate showed that for binary sequences, the sum of $\text {CDF}(f,g)$ and the geometric mean of $\text {ADF}(f)$ and $\text {ADF}{(g)}$ must be at least 1. For randomly selected pairs of long binary sequences, this quantity is typically around 2. In this paper, we show that Pursley and Sarwate’s bound is met for binary sequences precisely when $(f,g)$ is a Golay complementary pair. We also prove a generalization of this result for sequences whose terms are arbitrary complex numbers. We investigate constructions that produce infinite families of Golay complementary pairs, and compute the asymptotic values of autocorrelation and crosscorrelation demerit factors for such families. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
9. Comparing Alternative Route Planning Techniques: A Comparative User Study on Melbourne, Dhaka and Copenhagen Road Networks.
- Author
-
Li, Lingxiao, Cheema, Muhammad Aamir, Lu, Hua, Ali, Mohammed Eunus, and Toosi, Adel N.
- Subjects
- *
AUTOMOTIVE navigation systems , *COMPARATIVE studies ,PLANNING techniques - Abstract
Many modern navigation systems and map-based services do not only provide the fastest route from a source location $s$ s to a target location $t$ t but also provide a few alternative routes to the users as more options to choose from. Consequently, computing alternative paths has received significant research attention. However, it is unclear which of the existing approaches generates alternative routes of better quality because the quality of these alternatives is mostly subjective. Motivated by this, in this paper, we present a user study conducted on the road networks of Melbourne, Dhaka and Copenhagen that compares the quality (as perceived by the users) of the alternative routes generated by four of the most popular existing approaches including the routes provided by Google Maps. We also present a web-based demo system that can be accessed using any internet-enabled device and allows users to see the alternative routes generated by the four approaches for any pair of selected source and target. We report the average ratings received by the four approaches and our statistical analysis shows that there is no credible evidence that the four approaches receive different ratings on average. We also discuss the limitations of this user study and recommend the readers to interpret these results with caution because certain factors may have affected the participants’ ratings. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
10. A Multi-Level Movement Intention Inference Approach for an Urban Evasive Target With Unknowable Destinations.
- Author
-
Yan, Peng, Guo, Jifeng, and Bai, Chengchao
- Subjects
- *
CONVOLUTIONAL neural networks , *INTENTION , *INFERENCE (Logic) - Abstract
Movement intention inference for non-cooperative evasive targets in urban environments is difficult due to the lack of a priori knowledge of the possible target's movement intentions set. To solve this problem, this paper proposes a multi-level intention inference approach to construct and infer the movement intentions of a non-cooperative evasive target in urban environments. Firstly, to reasonably represent the possible movement intentions of the target, we decompose the target's movement intention into different regions at multiple levels according to the urban environment and the location of the target. At the same time, we divide the region at each level into several different sub-regions to represent the different movement intentions of the target at that level. Thus, the possible target's movement intentions are constructed as different regions at different levels where the target intends to go. Secondly, Convolutional Neural Network (CNN)-based intention inference models are developed, which can fuse the urban environment information and the observed target's trajectory to infer the target's movement intentions. Extensive simulation experiments results show that our proposed multi-level intention inference models can accurately and timely (with 79% accuracy and 84% timeliness) infer the region where the target intends to go when the possible destinations of the target are unknowable and maintain a robust inference performance when the target's behavior changes. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
11. A Three-Layer Model for Studying Metro Network Dynamics.
- Author
-
Wu, Xingtang, Dong, Hairong, and Tse, Chi K.
- Subjects
- *
INTERVAL training , *PUBLIC transit - Abstract
This paper studies the dynamic performance of subway transportation systems. A three-layer model, consisting of a rail layer, a train layer, and a passenger layer, is proposed to describe the structure and operation of a metro system. Two parameters, namely, time efficiency and maximum load ratio, are proposed to assess the transport efficiency and the train utilization rate, respectively. Case studies of the metro networks in Beijing, Tokyo, and Hong Kong show that the time efficiency decreases nonlinearly with the increase of vehicle resource and passenger demand, whereas maximum load ratio varies in an opposite manner. For the three metro networks under study, the Tokyo metro system has the highest time efficiency when passengers adopt a shortest-path (SP) routing strategy, while the Hong Kong system’s highest time efficiency exceeds the others’ when passengers adopt a minimum-transfer-path (MTP) strategy. In general, the maximum time efficiency is higher when passengers adopt SP routing rather than MTP routing. Moreover, the Beijing metro system has the highest maximum load ratio, regardless of the passengers’ routing behavior. This paper can be applied to a metro network to optimize the train departure interval under a certain passenger entrance rate, with the aim to maximize the time efficiency and maximum load ratio. Our model permits assessment of the operational effectiveness of metro systems, which helps the metro operators to improve the performance and reduce the cost. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
12. 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
13. Entity Alignment for Knowledge Graphs With Multi-Order Convolutional Networks.
- Author
-
Tam, Nguyen Thanh, Trung, Huynh Thanh, Yin, Hongzhi, Van Vinh, Tong, Sakong, Darnbi, Zheng, Bolong, and Hung, Nguyen Quoc Viet
- Subjects
- *
KNOWLEDGE graphs , *MACHINE translating , *CONVOLUTIONAL neural networks , *END-to-end delay - Abstract
Knowledge graphs (KGs) have become popular structures for unifying real-world entities by modelling the relationships between them and their attributes. To support multilingual applications, a significant number of language-specific KGs have been built by different parties using various data sources. As a result, these monolingual KGs are often disconnected, causing semantic heterogeneity and detracting from the original purpose of KGs. Entity alignment – the task of identifying corresponding entities across different KGs – has attracted a great deal of attention in both academia and industry. However, existing alignment techniques often require large amounts of labelled data, are unable to encode multi-modal data simultaneously, and enforce only a few consistency constraints. In this paper, we propose an end-to-end, unsupervised entity alignment framework for cross-lingual KGs that fuses different types of information in order to fully exploit the richness of KG data. The model captures the relation-based correlation between entities by using a multi-order graph convolutional neural (GCN) model that is designed to satisfy the consistency constraints, while incorporating the attribute-based correlation via a translation machine. We adopt a late-fusion mechanism to combine all the information together, which allows these approaches to complement each other and thus enhances the final alignment result, and makes the model more robust to consistency violations. Empirical results for various scenarios on real-world and synthetic KGs show that our model is up to 22.71 percent more accurate and orders of magnitude faster than existing baselines. We also demonstrate its sensitivity to hyper-parameters, effort saving in terms of labelling, and the robustness against adversarial conditions. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
14. RMGen: A Tri-Layer Vehicular Trajectory Data Generation Model Exploring Urban Region Division and Mobility Pattern.
- Author
-
Kong, Xiangjie, Chen, Qiao, Hou, Mingliang, Rahim, Azizur, Ma, Kai, and Xia, Feng
- Subjects
- *
DATA modeling , *TRAFFIC flow , *INTERNET of things , *VEHICULAR ad hoc networks , *PUBLIC transit - Abstract
As an important branch of the Internet of Things (IoT), the Internet of Vehicles (IoV) has attracted extensive attention in the research field. To deeply study the IoV and build a vehicle spatiotemporal interaction network, it is necessary to use the trajectory data of private cars. However, due to privacy and security protection policies and other reasons, the data set of private cars cannot be obtained, which hinders the research on the social attributes of vehicles in the IoV. Most of the previous work generated the same type of data, and how to generate private car data sets from various existing data sets is a huge challenge. In this paper, we propose a tri-layer framework to solve this problem. First, we propose a novel region division scheme that considers detailed inter-region relations connected by traffic flux. Second, a new spatial-temporal interaction model is developed to estimate the traffic flow between two regions. Third, we devise an evaluation pipeline to validate generation results from microscopic and macroscopic perspectives. Qualitative and quantitative results demonstrate that the data generated in heavy density scenarios can provide strong data support for downstream IoV and mobility research tasks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
15. A Deep Neural Network for Crossing-City POI Recommendations.
- Author
-
Li, Dichao and Gong, Zhiguo
- Subjects
- *
ARTIFICIAL neural networks , *SMARTPHONES , *MACHINE learning - Abstract
With the popularity of location-aware devices (e.g., smart phones), large amounts of location-based social media data such as check-ins are generated. This stimulates plenty of studies for POI recommendations by applying machine learning techniques. However, most of the existing studies focus on POI recommendations in the same city or region, and fail to recommend POIs for users when they travel to a new city. In this paper, we propose a novel deep neural network, named as ST-TransRec, for crossing-city POI recommendations. It integrates the deep neural network, transfer learning technique, and density-based resampling method into a unified framework. In this model, the deep neural network is used to capture users’ preferences for POIs and learn the embeddings of POIs. Besides, the transfer learning technique is employed to bridge the gap between cities that results from the city-dependent features. As the distributions over POIs are imbalanced, we design a density-based spatial resampling model which enables POIs to be well matched across cities. We conduct extensive experiments on two real-world datasets. The experimental results show the advantages of ST-TransRec over the state-of-the-art methods for crossing-city POI recommendations. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
16. Extract Human Mobility Patterns Powered by City Semantic Diagram.
- Author
-
Shan, Zhangqing, Sun, Weiwei, and Zheng, Baihua
- Subjects
- *
GPS receivers , *GLOBAL Positioning System - Abstract
With widespread deployment of GPS devices, massive spatiotemporal trajectories became more accessible. This booming trend paved the solid data ground for researchers to discover the regularities or patterns of human mobility. However, there are still three challenges in semantic pattern extraction including semantic absence, semantic bias and semantic complexity. In this paper, we invent and apply a novel data structure namely City Semantic Diagram to overcome above three challenges. First, our approach resolves semantic absence by exactly identifying semantic behaviours from raw trajectories. Second, the design of semantic purification helps us to detect semantic complexity from human mobility. Third, we avoid semantic bias using objective data source such as ubiquitous GPS trajectories. Comprehensive and massive experiments have been conducted based on real taxi trajectories and points of interest in Shanghai. Compared with existing approaches, City Semantic Diagram is able to discover fine-grained semantic patterns effectively and accurately. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
17. A Vector-Based Approach for Dimensioning Small Cell Networks in Millimeter-Wave Frequencies.
- Author
-
Zhang, Jianming, Zhang, Deru, and Sun, Juanjuan
- Subjects
- *
MILLIMETER waves , *SEARCH algorithms , *DYNAMIC programming , *BUDGET - Abstract
Millimeter wave (mmW) is being deployed in hotspot scenarios for providing high bandwidths. However, the coverage of mmW cell is limited due to the rapid attenuation during the propagation and sensitivity to blockage by obstacles. In this paper, we propose a novel dynamic programming approach for automated dimensioning and appropriate placement of mmW small cells (SCs) in dense urban under the constraints of coverage and budget. Being cognizant of the blockage by city buildings, a fast search algorithm based on vector is introduced to enable most line-of-sight (LOS) communication links between base stations (BSs) and mobile stations (MSs). The analysis of time complexity is also derived in closed forms. The evaluation of our approach was carried out in both hypothetic and realistic scenarios. Results show that the studied model is effective for a real large-scaled network and 4 or 5 times faster than the conventional ones based on grid-map. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
18. Traffic Anomaly Detection Using Deep Semi-Supervised Learning at the Mobile Edge.
- Author
-
Pelati, Annalisa, Meo, Michela, and Dini, Paolo
- Subjects
- *
TRAFFIC monitoring , *MOBILE learning , *RECURRENT neural networks , *SUPERVISED learning , *METROPOLIS , *DEEP learning - Abstract
In this paper, we design an Anomaly Detection (AD) framework for mobile data traffic, capable of identifying different types of anomalous events generated by flash crowds in metropolitan areas. We state the problem using a semi-supervised approach and exploit the great performance of different Recurrent Neural Network (RNN) models to learn the temporal context of input sequences. Our proposal processes real traffic traces from the unencrypted LTE Physical Downlink Control Channel (PDCCH) of an operative network, gathered during an extensive measurement campaign in two major cities in Spain. The AD framework is designed to perform: i) a-posteriori analysis to understand users’ behavior and urban environment variations; ii) real-time analysis to automatically and on-the-fly alert urban anomalies; and iii) estimation of the duration of the periods identified as anomalous. Numerical results show the higher performance of our AD framework compared to classic AD algorithms and confirm that the proposed framework predicts anomalous behaviours with high accuracy and regardless of their cause. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
19. Impact of Blocking Correlation on the Performance of mmWave Cellular Networks.
- Author
-
Gupta, Saurabh Kumar, Malik, Vikrant, Gupta, Abhishek K., and Andrews, Jeffrey G.
- Subjects
- *
STATISTICAL correlation , *SIGNAL-to-noise ratio , *STOCHASTIC geometry - Abstract
In mmWave networks, a large or nearby object can obstruct multiple communication links, which results in spatial correlation in the blocking probability between a user and two or more base stations (BSs). This paper characterizes this blocking correlation and derives its impact on the signal-to-interference-plus-noise ratio (SINR) of a mmWave cellular network. We first present an exact analysis of a 1D network and highlight the impact of blocking correlation in the derived expressions. Gaining insights from the 1D analysis, we develop an analytical framework for a 2D network where we characterize the sum interference at the user by considering the correlation between the blocking of serving and interfering links. Using this, we derive the SINR coverage probability. Via simulations, we demonstrate that including blockage correlation in the analysis is required for accurate characterization of the system performance, in particular when the blocking objects tend to be large. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
20. Camouflaged Instance Segmentation In-the-Wild: Dataset, Method, and Benchmark Suite.
- Author
-
Le, Trung-Nghia, Cao, Yubo, Nguyen, Tan-Cong, Le, Minh-Quan, Nguyen, Khanh-Duy, Do, Thanh-Toan, Tran, Minh-Triet, and Nguyen, Tam V.
- Subjects
- *
IMAGE color analysis , *PIXELS , *IMAGE segmentation - Abstract
This paper pushes the envelope on decomposing camouflaged regions in an image into meaningful components, namely, camouflaged instances. To promote the new task of camouflaged instance segmentation of in-the-wild images, we introduce a dataset, dubbed CAMO++, that extends our preliminary CAMO dataset (camouflaged object segmentation) in terms of quantity and diversity. The new dataset substantially increases the number of images with hierarchical pixel-wise ground truths. We also provide a benchmark suite for the task of camouflaged instance segmentation. In particular, we present an extensive evaluation of state-of-the-art instance segmentation methods on our newly constructed CAMO++ dataset in various scenarios. We also present a camouflage fusion learning (CFL) framework for camouflaged instance segmentation to further improve the performance of state-of-the-art methods. The dataset, model, evaluation suite, and benchmark will be made publicly available on our project page. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
21. Universal Consistency of Deep Convolutional Neural Networks.
- Author
-
Lin, Shao-Bo, Wang, Kaidong, Wang, Yao, and Zhou, Ding-Xuan
- Subjects
- *
CONVOLUTIONAL neural networks , *DEEP learning - Abstract
Compared with avid research activities of deep convolutional neural networks (DCNNs) in practice, the study of theoretical behaviors of DCNNs lags heavily behind. In particular, the universal consistency of DCNNs remains open. In this paper, we prove that implementing empirical risk minimization on DCNNs with expansive convolution (with zero-padding) is strongly universally consistent. Motivated by the universal consistency, we conduct a series of experiments to show that without any fully connected layers, DCNNs with expansive convolution perform not worse than the widely used deep neural networks with hybrid structure containing contracting (without zero-padding) convolutional layers and several fully connected layers. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
22. Multi-Agent Deep Reinforcement Learning to Manage Connected Autonomous Vehicles at Tomorrow's Intersections.
- Author
-
Antonio, Guillen-Perez and Maria-Dolores, Cano
- Subjects
- *
INTELLIGENT transportation systems , *REINFORCEMENT learning , *DEEP learning , *TRAFFIC signs & signals , *TRAFFIC engineering , *TRAFFIC flow , *TELECOMMUNICATION systems , *CONGESTION pricing - Abstract
In recent years, the growing development of Connected Autonomous Vehicles (CAV), Intelligent Transport Systems (ITS), and 5G communication networks have led to the advent of Autonomous Intersection Management (AIM) systems. AIMs present a new paradigm for CAV control in future cities, taking control of CAVs in scenarios where cooperation is necessary and allowing safe and efficient traffic flows, eliminating traffic signals. So far, the development of AIM algorithms has been based on basic control algorithms, without the ability to adapt or keep learning new situations. To solve this, in this paper we present a new advanced AIM approach based on end-to-end Multi-Agent Deep Reinforcement Learning (MADRL) and trained using Curriculum through Self-Play, called advanced Reinforced AIM (adv.RAIM). adv.RAIM enables the control of CAVs at intersections in a collaborative way, autonomously learning complex real-life traffic dynamics. In addition, adv.RAIM provides a new way to build smarter AIMs capable of proactively controlling CAVs in other highly complex scenarios. Results show remarkable improvements when compared to traffic light control techniques (reducing travel time by 59% or reducing time lost due to congestion by 95%), as well as outperforming other recently proposed AIMs (reducing waiting time by 56%), highlighting the advantages of using MADRL. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
23. Rook Coding for Batch Matrix Multiplication.
- Author
-
Soto, Pedro, Fan, Xiaodi, Saldivia, Angel, and Li, Jun
- Subjects
- *
MATRIX multiplications , *TWO-dimensional bar codes , *DISTRIBUTED algorithms , *DISTRIBUTED computing , *POLYNOMIALS - Abstract
Matrix multiplication is a fundamental building block in various distributed computing algorithms. In order to multiply large matrices, it is common practice to distribute the computation into multiple tasks running on different nodes. In order to tolerate stragglers among such nodes, various coding schemes have been proposed by adding additional coded tasks. However, most existing coding schemes for matrix multiplication are constructed for only one matrix multiplication, while batch matrix multiplication is common in large-scale distributed computing workloads. In this paper, we propose Rook Coding (RC), a novel polynomial-based coding framework for computing the multiplication of $n$ pairs of matrices in batch. Designed to achieve lower encoding time in practice, we construct RC as polynomials of much simpler forms than existing coding schemes for batch matrix multiplication, achieving a recovery threshold of $O(n^{\log _{2} ~3})$. Compared to existing coding schemes, RC achieves a lower encoding complexity in practice, because of its simpler forms in the encoding polynomials. Through extensive experiments, we show that RC can save the time of the whole job thanks to its low overhead of encoding. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
24. Predicting Citywide Crowd Flows in Irregular Regions Using Multi-View Graph Convolutional Networks.
- Author
-
Sun, Junkai, Zhang, Junbo, Li, Qiaofei, Yi, Xiuwen, Liang, Yuxuan, and Zheng, Yu
- Subjects
- *
TRAFFIC engineering , *CROWDS , *PUBLIC safety , *RISK assessment , *FORECASTING - Abstract
Being able to predict the crowd flows in each and every part of a city, especially in irregular regions, is strategically important for traffic control, risk assessment, and public safety. However, it is very challenging because of interactions and spatial correlations between different regions. In addition, it is affected by many factors: i) multiple temporal correlations among different time intervals: closeness, period, trend; ii) complex external influential factors: weather, events; iii) meta features: time of the day, day of the week, and so on. In this paper, we formulate crowd flow forecasting in irregular regions as a spatio-temporal graph (STG) prediction problem in which each node represents a region with time-varying flows. By extending graph convolution to handle the spatial information, we propose using spatial graph convolution to build a multi-view graph convolutional network (MVGCN) for the crowd flow forecasting problem, where different views can capture different factors as mentioned above. We evaluate MVGCN using four real-world datasets (taxicabs and bikes) and extensive experimental results show that our approach outperforms the adaptations of state-of-the-art methods. And we have developed a crowd flow forecasting system for irregular regions that can now be used internally. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
25. On Decoding Binary Quasi-Reversible BCH Codes.
- Author
-
Lin, Tsung-Ching, Lee, Chong-Dao, Chang, Yaotsu, and Truong, Trieu-Kien
- Subjects
- *
MATRIX multiplications , *LINEAR systems , *ERROR-correcting codes , *COMPUTATIONAL complexity , *DECODING algorithms , *COMPUTER simulation , *MATRIX decomposition - Abstract
For the recently developed quasi-reversible BCH codes with long lengths and high error-correcting capability, this paper is aimed at proposing a new and faster decoding procedure. It consists of four steps: 1) compute the consecutive syndromes; 2) calculate the syndrome functions by the forward and backward recursions; 3) solve a linear subsystem together with one matrix multiplication in order to find an error-locator polynomial; 4) determine the errors from the obtained polynomial by using the root-finding algorithm. This procedure, especially in Steps 2 and 3, differs greatly from the conventional procedures, which determine an error-locator polynomial directly from solving a linear system with the aid of the consecutive syndromes. The key idea behind this decoding technique is that the computational complexity of such a small subsystem instead of an originally large linear system can be significantly reduced, although there are additional forward and backward syndrome calculations with low complexity increasing. Finally, the illustrative examples and numerical simulations can be helpful to demonstrate the accuracy and efficacy of the presented decoding technique at different error-correcting capabilities. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
26. Leveraging Currency for Repairing Inconsistent and Incomplete Data.
- Author
-
Ding, Xiaoou, Wang, Hongzhi, Su, Jiaxuan, Wang, Muxian, Li, Jianzhong, and Gao, Hong
- Subjects
- *
DATA scrubbing , *HARD currencies , *DATA management , *BIG data , *MULTIPLE imputation (Statistics) , *DATA quality , *REPAIRING - Abstract
Data quality plays a key role in big data management today. With the explosive growth of data from a variety of sources, the quality of data is faced with multiple problems. Motivated by this, we study the multiple data cleaning on incompleteness and inconsistency with currency reasoning and determination in this paper. We introduce a 4-step framework, named ${\sf Imp3C}$ Imp 3 C , for errors detection and quality improvement in incomplete and inconsistent data without timestamps. We achieve an integrated currency determining method to compute the currency orders among tuples, according to currency constraints. Thus, the inconsistent data and missing values are repaired effectively considering the temporal impact. For both effectiveness and efficiency consideration, we carry out inconsistency repair ahead of incompleteness repair. A currency-related consistency distance metric is defined to measure the similarity between dirty tuples and clean ones more accurately. In addition, currency orders are treated as an important feature in the missing imputation training process. The solution algorithms are introduced in detail with case studies. A thorough experiment on three real-life datasets verifies our method ${\sf Imp3C}$ Imp 3 C improves the performance of data repairing with multiple quality problems. ${\sf Imp3C}$ Imp 3 C outperforms the existing advanced methods, especially in the datasets with complex currency orders. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
27. Binomial Line Processes: Distance Distributions.
- Subjects
- *
STOCHASTIC geometry , *POISSON processes , *GEOMETRIC modeling , *STOCHASTIC models , *BINOMIAL theorem , *MODEL airplanes , *STREETS , *EUCLIDEAN distance - Abstract
We introduce the binomial line process (BLP), a novel spatial stochastic model for the characterization of streets in the statistical evaluation of wireless and vehicular networks. Existing stochastic geometry models for streets, e.g., Poisson line processes (PLP) and Manhattan line processes (MLP) lack an important aspect of city-wide street networks: streets are denser in the city center and sparse near the suburbs. Contrary to these models, the BLP restricts the generating points of the streets to a fixed radius centered at the origin of the Euclidian plane, thereby capturing the inhomogeneity of the streets with respect to the distance from the center. We derive a closed-form expression for the contact distribution of the BLP from a random location on the plane. Leveraging this, we introduce the novel Binomial line Cox process (BLCP) to emulate points on individual lines of the BLP and derive the distribution to the nearest BLCP point from an arbitrary location. Using numerical results, we highlight that the spatial configuration of the streets is remarkably distinct from the perspective of a city center user to that of a suburban user. The framework developed in this paper can be integrated with the existing models of line processes for more accurate characterization of streets in urban and suburban environments. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
28. Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields.
- Author
-
Jin, Lingfei, Ma, Liming, and Xing, Chaoping
- Abstract
Locally repairable codes, or locally recoverable codes (LRC for short), are designed for applications in distributed and cloud storage systems. Similar to classical block codes, there is an important bound called the Singleton-type bound for locally repairable codes. In this paper, an optimal locally repairable code refers to a block code achieving this Singleton-type bound. Like classical MDS codes, optimal locally repairable codes carry some very nice combinatorial structures. Since the introduction of the Singleton-type bound for locally repairable codes, people have put tremendous effort into construction of optimal locally repairable codes. There are a few constructions of optimal locally repairable codes in the literature. Most of these constructions are realized via either combinatorial or algebraic structures. In this paper, we apply automorphism group of the rational function field to construct optimal locally repairable codes by considering the group action on projective lines over finite fields. Due to various subgroups of the projective general linear group, we are able to construct optimal locally repairable codes with flexible locality as well as smaller alphabet size comparable to the code length. In particular, we produce new families of $q$ -ary locally repairable codes, including codes of length $q+1$ via cyclic groups. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
29. Performance Analysis of Power Control in Urban UAV Networks With 3D Blockage Effects.
- Author
-
Tang, Wenfei, Zhang, Hongtao, and He, Yuan
- Subjects
- *
STOCHASTIC geometry , *RAYLEIGH model , *STOCHASTIC processes , *INTERFERENCE channels (Telecommunications) , *CITIES & towns ,URBAN ecology (Sociology) - Abstract
In urban UAV networks, UAVs deployment locations and air-to-ground (AtG) communication links will possibly conflict with densely located buildings, which exacerbate network irregularity and make interference management more complicated. This paper proposes interference coordination via power control under 3D blockage effects in urban environments, where buildings are distributed according to Boolean model with heights ($H_k$) followed Rayleigh distribution. Specifically, a dynamic UAV group (UAVG) is organized to serve each user for interference coordination, which consists several nearest visible UAVs with line-of-sight (LOS) connections considering buildings blockage effects, and the modified distribution from user to its nearest unblocked UAV is derived. Power control is executed in UAVG where adjacent interfering UAVs within the group will mute their transmission for interference mitigation, and optimal UAVG radius coefficient $\mu$ is obtained, which reveals the trade-off between interference mitigation and resource utilization. Leveraging stochastic geometry, theoretical expressions of network metrics are derived with Nakagami- $m$ fading assumption, including network coverage probability and network connectivity. Analytical results show that in urban city scenario, comparing with traditional terrestrial networks, coverage performance can achieve 4.1× gain by deploying UAVs with optimal height, and achieve additional 26 $\%$ gain with respect to scenarios where power control is disabled. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
30. Constrained Truth Discovery.
- Author
-
Ye, Chen, Wang, Hongzhi, Zheng, Kangjie, Kong, YouKang, Zhu, Rong, Gao, Jing, and Li, Jianzhong
- Subjects
- *
PARALLEL algorithms , *FIRST-order logic , *TASK analysis - Abstract
To aggregate useful information among diversified sources, a hotspot research topic called truth discovery has emerged in recent years. Existing truth discovery methods attempt to infer the true attribute values for the entities by identifying and trusting reliable data sources. That is, the values provided by reliable sources are more likely to be the true values. However, all these methods neglect the relations among different entities, which play important roles in truth discovery task. When reliable data sources cannot provide sufficient information of entities, the true attribute values of these entities can still be inferred by propagating trustworthy information from related entities. Motivated by this, in this paper, we introduce the constrained truth discovery problem. We incorporate denial constraints, a universally quantified first-order logic formalism which can express a large number of effective and widely existing relations among entities, into the process of truth discovery. We formulate it as a constrained optimization problem and analyze its hardness. To address the problem, we propose algorithms to partition the entities into disjoint groups, and generate arithmetic constraints for each disjoint group separately. Then, the true attribute values of the entities in each disjoint group are derived by minimizing the objective function under the corresponding arithmetic constraints. Experimental results on both real-world and synthetic datasets demonstrate that the proposed approach achieves good performance even with very few constraints and reliable sources. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
31. Hardware Limitations to Secure C-ITS: Experimental Evaluation and Solutions.
- Author
-
Pollicino, Francesco, Stabili, Dario, Ferretti, Luca, and Marchetti, Mirco
- Subjects
- *
INTELLIGENT transportation systems , *DIGITAL signatures , *ELLIPTIC curves , *TRAFFIC safety , *VEHICULAR ad hoc networks , *HARDWARE - Abstract
Cooperative Intelligent Transportation Systems (C-ITS) improve driving experience and safety through secure Vehicular Ad-hoc NETworks (VANETs) that satisfy strict security and performance constraints. Relevant standards, such as the IEEE 1609.2, prescribe network-efficient cryptographic protocols to reduce communication latencies through a combination of the Elliptic Curve Qu-Vanstone (ECQV) implicit certificate scheme and the Elliptic Curve Digital Signature Algorithm (ECDSA). However, literature lacks open implementations and performance evaluations for vehicular systems. This paper assesses the applicability of IEEE 1609.2 and of ECQV and ECDSA schemes to C-ITSs. We release an open implementation of the standard ECQV scheme to benchmark its execution time on automotive-grade boards. Moreover, we evaluate its performance in real road and traffic scenarios and show that compliance with strict latency requirements defined for C-ITS requires computational resources that are not met by many automotive-grade embedded hardware platforms. As a final contribution, we propose and evaluate novel heuristics to reduce the number of signatures to be verified in real C-ITS scenarios. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
32. Analysis and Suppression Control of High Frequency Resonance for MMC-HVDC System.
- Author
-
Li, Yunfeng, An, Ting, Zhang, De, Pei, Xiangyu, Ji, Ke, and Tang, Guangfu
- Subjects
- *
STABILITY theory , *PHASE-locked loops - Abstract
The high-frequency resonances (HFRs) around 700 Hz and 1.8 kHz have occurred in Yu′E project. Mechanism studies indicate that HFRs are caused by the interactions between the negative damping inductance characteristics of the MMC and the capacitive characteristics of the AC system. In this paper, two optimized methods regarding the current control loop are presented to suppress the HFRs. The first one is to use a round(x) function inserted into voltage feed-forward loop instead of low pass filter (LPF). The proposed method has less negative impact on transient characteristics of an MMC. The second one is to employ a second-order damping controller, including the parameters design, to reshape the MMC impedance around the multiple risky regions. The core of HFRs suppression is that the real part of the MMC impedance near the multiple intersection frequencies should be positive according to impedance stability theory. Combined with the proposed control methods and core of HFRs suppression, the simplified model of MMC is adopted to design the parameters using the analytical expressions. Moreover, the general steps of parameters design are presented. Finally, the optimized methods to suppress HFRs are verified by time-domain simulations. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
33. 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
34. Improved Non-Adaptive Algorithms for Threshold Group Testing With a Gap.
- Author
-
Bui, Thach V., Cheraghchi, Mahdi, and Echizen, Isao
- Subjects
- *
DECODING algorithms , *COMBINATORICS , *TEST design - Abstract
The basic goal of threshold group testing is to identify up to $d$ defective items among a population of $n$ items, where $d$ is usually much smaller than $n$. The outcome of a test on a subset of items is positive if the subset has at least $u$ defective items, negative if it has up to $\ell $ defective items, where $0 \leq \ell < u$ , and arbitrary otherwise. This is called threshold group testing. The parameter $g = u - \ell - 1$ is called the gap. In this paper, we focus on the case $g > 0$ , i.e., threshold group testing with a gap. Note that the results presented here are also applicable to the case $g = 0$ ; however, the results are not as efficient as those in related work. Currently, a few reported studies have investigated test designs and decoding algorithms for identifying defective items. Most of the previous studies have not been feasible because there are numerous constraints on their problem settings or the decoding complexities of their proposed schemes are relatively large. Therefore, it is compulsory to reduce the number of tests as well as the decoding complexity, i.e., the time for identifying the defective items, for achieving practical schemes. The work presented here makes five contributions. The first is a more accurate theorem for a non-adaptive algorithm for threshold group testing proposed by Chen and Fu. The second is an improvement in the construction of disjunct matrices, which are the main tools for tackling (threshold) group testing and other tasks such as constructing cover-free families or learning hidden graphs. Specifically, we present a better exact upper bound on the number of tests for disjunct matrices compared with that in related work. The third and fourth contributions are a reduced exact upper bound on the number of tests and a reduced asymptotic bound on the decoding time for identifying defective items in a noisy setting on test outcomes. The fifth contribution is a simulation on the number of tests of the resulting improvements for previous work and the proposed theorems. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
35. Tracking Based Mix-Zone Location Privacy Evaluation in VANET.
- Author
-
Hou, Lei, Yao, Nianmin, Lu, Zhimao, Zhan, Furui, and Liu, Zhimin
- Subjects
- *
ARTIFICIAL neural networks , *PRIVACY , *VEHICULAR ad hoc networks - Abstract
Mix-Zone is one of the most effective real-time location privacy preserving techniques over road networks. By breaking the continuity of location exposure and changing pseudonyms, this strategy can effectively keep users from tracking attacks. Existing Mix-Zone evaluation mechanisms are mainly divided into two categories – Calculation and vehicle tracking. Calculation based evaluation methods like K-anonymity and Entropy are more suitable for qualitative analysis and comparison, but lacks accuracy and quantitative criteria, whereas existing tracking methods are too simple to accurately quantify the privacy of the Mix-Zone. Accordingly, it is urgent to bring up more accurate tracking methods to get a better view of the Mix-Zone's privacy. In this paper, we propose two categories of Mix-Zone tracking methods based on the basic BP and the customized artificial neural networks, where the former is used as verification and based on the result analysis of which we designed the latter, which greatly improves the tracking result, revealing the privacy preserving level of the Mix-Zone more reasonably. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
36. An Improved Traffic Rerouting Strategy Using Real-Time Traffic Information and Decisive Weights.
- Author
-
Tseng, Ying-Tsu and Ferng, Huei-Wen
- Subjects
- *
VEHICULAR ad hoc networks , *TRAFFIC congestion , *INTELLIGENT transportation systems , *TRAFFIC signs & signals , *ENERGY consumption , *HYBRID electric vehicles - Abstract
To alleviate possible traffic congestion during rush hours, an improved traffic rerouting strategy designed for (or interplayed with) the vehicular ad hoc networks (VANETs) is proposed in this paper. The proposed strategy considers not only the real-time traffic information but also the maximization of road utilization to reach an optimized solution. Furthermore, an alternative path selection is incorporated so that an efficient rerouting path is determined according to the destination of the vehicle, the density and the capacity of the road, and the speed. Via simulations, we can successfully show that our proposed strategy significantly outperforms the closely related strategies in the literature in terms of the travel time, CO $_{2}$ emission, and fuel consumption, in particular, when heavy traffic is involved. Specifically, our proposed strategy can gain up to 20% of reduction in the average travel time in a realistic scenario to be observed later. Additionally, our proposed strategy gains 19% at least of improvement in the case with different road networks and 28.6% at least of improvement in the case with different percentages of reduction of traffic lights as compared to the closely related strategies as shown in the Appendices given in the supplementary downloadable material. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
37. A Combinatorial Design for Cascaded Coded Distributed Computing on General Networks.
- Author
-
Woolsey, Nicholas, Chen, Rong-Rong, and Ji, Mingyue
- Subjects
- *
DISTRIBUTED computing , *COMPUTER systems - Abstract
Coding theoretic approaches have been developed to significantly reduce the communication load in modern distributed computing system. In particular, coded distributed computing (CDC) introduced by Li et al. can efficiently trade computation resources to reduce the communication load in MapReduce like computing systems. For the more general cascaded CDC, Map computations are repeated at $r$ nodes to significantly reduce the communication load among nodes tasked with computing $Q$ Reduce functions $s$ times. In this paper, we propose a novel low-complexity combinatorial design for cascaded CDC which 1) determines both input file and output function assignments, 2) requires significantly less number of input files and output functions, and 3) operates on heterogeneous networks where nodes have varying storage and computing capabilities. We provide an analytical characterization of the computation-communication tradeoff, from which we show the proposed scheme can outperform the state-of-the-art scheme proposed by Li et al. for the homogeneous networks. Further, when the network is heterogeneous, we show that the performance of the proposed scheme can be better than its homogeneous counterpart. In addition, the proposed scheme is optimal within a constant factor of the information theoretic converse bound while fixing the input file and the output function assignments. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
38. Land Use Classification With Point of Interests and Structural Patterns.
- Author
-
Barlacchi, Gianni, Lepri, Bruno, and Moschitti, Alessandro
- Subjects
- *
SUPPORT vector machines , *CITIES & towns , *ALGORITHMS , *ZONING , *URBAN renewal , *SOCIAL networks , *LAND use - Abstract
In this paper, we present a framework for performing automatic analysis of Land Use Zones based on Location-Based Social Networks (LBSNs). We model city areas using a hierarchical structure of POIs extracted from foursquare. We encode such structures in kernel machines, e.g., Support Vector Machines, using a new Tree Kernel, i.e., the Hierarchical POI Kernel (HPK), which can take the importance of the individual POIs into account during the substructure matching. This way, HPK projects structures in the space of all their possible substructures such that each dimension corresponds to a semantic structural feature, weighted according to the discriminative power of POIs. We generated four different datasets for the following cities: Barcelona, Lisbon, Amsterdam and Milan, where we trained and tested our models. The results show that our approach largely outperforms previous work and standard baseline built on simple features, such as counts of different POIs. Finally, we apply a mining algorithm to extract the most relevant features (tree fragments) from the implicit TK space according to the weights the kernel machine assigned to them. Our approach can produce an explicit set of representative features that can be used to classify and characterize urban areas. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
39. Swarm-Based 4D Path Planning For Drone Operations in Urban Environments.
- Author
-
Wu, Yu, Low, Kin Huat, Pang, Bizhao, and Tan, Qingyu
- Subjects
- *
ANT algorithms , *CONFLICT management , *ACTIVITIES of daily living , *ALGORITHMS , *GENETIC algorithms ,URBAN ecology (Sociology) - Abstract
Drones have a wide range of applications in urban environments as they can both enhance people's daily activities and commercial activities through various operations and deployments. With the increasing number of drones, flight safety and efficiency become the main concern, and effective drone operations can make a difference. Accordingly, 4D path planning for drone operations is the focus of this paper, and the swarm-based method is proposed to solve this complicated optimization problem. Under the framework of ‘AirMatrix’, the problem is solved in two levels, i.e., 3D path planning for a single drone and conflict resolution among drones. In the multi-path planning level, multiple alternative flight paths for each drone are generated to increase the acceptance rate of a flight request. The constraints on a single flight path and two different flight paths are considered. The goal is to obtain several different short flight paths as alternatives. A clustering improved ant colony optimization CIACO) algorithm is employed to solve the multi-path planning problem. The crowding mechanism is used in clustering, and some improvements are made to strengthen the global and local search ability in the early and later phases of iterations. In the task scheduling level, the conflicts between two drones are defined in two circumstances. One is for the time interval of passing the same path point, another one is for the right-angle collision between two drones. A three-layer fitness function is proposed to maximize the number of permitted flights according to the safety requirement, in which the airspace utilization and the operators’ requests are both considered. A ‘cross-off’ strategy is developed to calculate the fitness value, and a ‘distributed-centralized’ strategy is applied considering the task priorities of drones. A genetic algorithm GA)-based task scheduling algorithm is also developed according to the characteristic of the established model. Simulation results demonstrate that 4D flight path of each drone can be generated by the proposed swarmed-based algorithms, and safe and efficient drone operations in a specific airspace can be ensured. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
40. 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
41. Multi-Class Management With Sub-Class Service for Autonomous Electric Mobility On-Demand Systems.
- Author
-
Belakaria, Syrine, Ammous, Mustafa, Smith, Lauren, Sorour, Sameh, and Abdel-Rahim, Ahmed
- Subjects
- *
URBAN planning , *CUSTOMER services , *PARKING facilities , *CITIES & towns - Abstract
This paper aims to resolve a clear and unrealistic limitation found in recent works that have proposed solutions to the massive demand for the autonomous electric mobility-on-demand (AEMoD) services. Namely, this paper will focus on the matched charge-to-trip only service by enabling sub-class service; i.e., allowing vehicles to serve customer classes with trips needing less charge. The paper proposes a multi-class management system with a new queuing model for one city zone, and then derives the stability conditions of the system. Proportions of vehicles from each class that will immediately serve customers with sub-class service or full/partial charge are modeled, and the maximum expected response time of the system is then minimized by optimizing these vehicle service decisions. The advantages of the new model are then compared with previously proposed schemes and non-optimized models through simulations. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
42. Causal Markov Elman Network for Load Forecasting in Multinetwork Systems.
- Author
-
Konila Sriram, Lalitha Madhavi, Gilanifar, Mostafa, Zhou, Yuxun, Erman Ozguven, Eren, and Arghandeh, Reza
- Subjects
- *
MARKOV processes , *ELECTRICITY , *INFORMATION theory , *ARTIFICIAL intelligence ,URBAN ecology (Sociology) - Abstract
This paper proposes a novel causality analysis approach called the causal Markov Elman network (CMEN) to characterize the interdependence among heterogeneous time series in multinetwork systems. The CMEN performance, which comprises inputs filtered by Markov property, successfully characterizes various multivariate dependencies in an urban environment. This paper also proposes a novel hypothesis of characterizing joint information between interconnected systems such as electricity and transportation networks. The proposed methodology and the hypotheses are then validated by information theory distance-based metrics. For cross validation, the CMEN is applied to the electricity load forecasting problem using actual data from Tallahassee, Florida. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
43. Survey of Available Experimental Data of Radio Wave Propagation for Wireless Transmission.
- Author
-
Sarkar, Tapan K., Abdallah, Mohammad Najib, and Salazar-Palma, Magdalena
- Subjects
- *
RADIO wave propagation , *WIRELESS communications , *RECEIVING antennas , *TRANSMITTING antennas , *ELECTRIC fields - Abstract
This paper provides a survey of various experimental data available on the value of the propagation path loss of radio waves in a cellular wireless environment. It is shown starting with the Okumuraet al.’s paper on propagation measurements and other available published experimental data that they all exhibit that the electric field varies as $\rho ^{-1.5}$ within a cellular radius of a few kilometers, where $\rho $ is the radial distance of the receiving antenna from the transmitting one. This decay in the fields is equivalent to a propagation loss of −9 dB/octave or −30 dB for a decade of the distance. This value is independent of the nature of the ground, whether it be composed of rural, urban, suburban, or water. This is the first time it is stated that the propagation path loss due to the presence of ground generates a path loss of 90 dB when the signals travel a distance of 1 km. This value is rather large when compared to a loss of 30–50 dB produced by buildings, trees, and similar artifacts. Therefore, the experimental data indicate that the effect of trees and buildings have a secondary influence on the decay of the electric field with distance, the dominant one is the propagation loss over an imperfect ground. Contemporary propagation models do not acknowledge this fact. Outside the cellular radius of a few kilometers, the path loss appears to be 12 dB/octave or 40 dB/decade of distance. In a companion paper, it will be demonstrated that the values for the path loss can be explained from an analytical standpoint without taking recourse to statistics which involves a lot of assumptions on the functional variation of the variables of interest. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
44. Exploiting Terrestrial Positioning Signals to Enable a Low-Cost Passive Radar.
- Author
-
Navratil, Vaclav, Garry, J. Landon, O'Brien, Andrew J., and Smith, Graeme E.
- Subjects
- *
PASSIVE radar , *GLOBAL Positioning System , *COMPUTATIONAL complexity , *SIGNAL processing , *RADAR signal processing - Abstract
This paper presents results from experiments that utilize Global-Positioning-System-like terrestrial positioning signals in a passive radar system to track aircraft over a metropolitan area. Unlike communication signals, these positioning signals offer unique properties that are advantageous for a passive radar. Exploitation of these properties provides an opportunity to reduce hardware complexity and to enable passive radar systems with a lower cost. This paper provides a detailed description of the signal processing in the context of low-cost hardware. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
45. Semantics-Aware Hidden Markov Model for Human Mobility.
- Author
-
Shi, Hongzhi, Li, Yong, Cao, Hancheng, Zhou, Xiangxin, Zhang, Chao, and Kostakos, Vassilis
- Subjects
- *
HIDDEN Markov models , *URBAN planning , *SEMANTICS , *TRAFFIC engineering - Abstract
Understanding human mobility benefits numerous applications such as urban planning, traffic control, and city management. Previous work mainly focuses on modeling spatial and temporal patterns of human mobility. However, the semantics of trajectory are ignored, thus failing to model people's motivation behind mobility. In this paper, we propose a novel semantics-aware mobility model that captures human mobility motivation using large-scale semantic-rich spatial-temporal data from location-based social networks. In our system, we first develop a multimodal embedding method to project user, location, time, and activity on the same embedding space in an unsupervised way while preserving original trajectory semantics. Then, we use hidden Markov model to learn latent states and transitions between them in the embedding space, which is the location embedding vector, to jointly consider spatial, temporal, and user motivations. In order to tackle the sparsity of individual mobility data, we further propose a von Mises-Fisher mixture clustering for user grouping so as to learn a reliable and fine-grained model for groups of users sharing mobility similarity. We evaluate our proposed method on two large-scale real-world datasets, where we validate the ability of our method to produce high-quality mobility models. We also conduct extensive experiments on the specific task of location prediction. The results show that our model outperforms state-of-the-art mobility models with higher prediction accuracy and much higher efficiency. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
46. Forecasting Gathering Events through Trajectory Destination Prediction: A Dynamic Hybrid Model.
- Author
-
Khezerlou, Amin Vahedian, Zhou, Xun, Tong, Ling, Li, Yanhua, and Luo, Jun
- Subjects
- *
DYNAMIC models , *FORECASTING , *PREDICTION models , *MARKOV processes , *DATA mining - Abstract
Identifying urban gathering events is an important problem due to challenges it brings to urban management. In our prior work, we proposed a hybrid model (H-VIGO-GIS) to predict future gathering events through trajectory destination prediction. Our approach consisted of two models: historical and recent and continuously predicted future gathering events. However, H-VIGO-GIS has limitations. (1) The recent model does not capture the newly-emerged abnormal patterns effectively, since it uses all recent trajectories, including normal ones. (2) The recent model is sparse due to limited number of trajectories it learns, i.e., it cannot produce predictions in many cases, forcing us to rely only on the historical model. (3) The accuracy of both recent and historical models varies by space and time. Therefore, combining them the same way at all times and places undermines the overall accuracy of the hybrid model. Addressing these issues, in this paper we propose a Dynamic Hybrid model called (DH-VIGO-TKDE) that addresses the above-mentioned issues. We perform comprehensive evaluations using two large real-world datasets and an event simulator. The experiments show the proposed model significantly improves the prediction accuracy and timeliness of forecasting gathering events, resulting in average precision of 0.91 and recall of 0.67 as opposed to 0.74 and 0.50 of H-VIGO-GIS. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
47. An Efficient Fronthaul Scheme Based on Coaxial Cables for 5G Centralized Radio Access Networks.
- Author
-
Acatauassu, Diogo, Lica, Moyses, Ohashi, Aline, Fernandes, Andre Lucas Pinho, Freitas, Marx, Costa, Joao C. W. A., Medeiros, Eduardo, Almeida, Igor, and Cavalcante, Andre Mendes
- Subjects
- *
RADIO access networks , *COAXIAL cables , *MOBILE communication systems , *5G networks , *MOBILE antennas , *TRANSMITTING antennas - Abstract
The 5G mobile communication systems introduce multiples functional splits between base station elements, new transmission bands and a large number of antennas supporting beamforming. In this scenario, a viable strategy to avoid building penetration losses is to deploy the antenna elements indoor and use a fronthaul link to establish the connection between them and the rest of the radio access network. This work explores a 5G fronthaul scheme based on analog radio over coaxial cables, leveraging this existing fixed access infrastructure to facilitate 5G deployments. Results indicate that the fronthaul solution discussed here is able to support the high capacity requirement of 5G, with the additional benefits of low transmit power, low latency and low cost. The main novelty of this paper is to investigate the potential of this kind of fronthaul architecture considering both the physical layer and economic aspects. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
48. Analysis of Blocking in mmWave Cellular Systems: Characterization of the LOS and NLOS Intervals in Urban Scenarios.
- Author
-
Ruiz, Cristian Garcia, Pascual-Iserte, Antonio, and Munoz, Olga
- Subjects
- *
STOCHASTIC geometry , *MILLIMETER waves , *POISSON processes , *STOCHASTIC processes , *POINT processes - Abstract
In the millimeter waves (mmWave) bands considered for 5G and beyond, the use of very high frequencies results in the interruption of communication whenever there is no line of sight between the transmitter and the receiver. Blockages have been modeled in the literature so far using tools such as stochastic geometry and random shape theory. Using these tools, in this paper, we characterize the lengths of the segments in line-of-sight (LOS) and in non-line-of-sight (NLOS) statistically in an urban scenario where buildings (with random positions, lengths, and heights) are deployed in parallel directions configuring streets. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
49. User-Driven Geolocated Event Detection in Social Media.
- Author
-
Bendimerad, Anes, Plantevit, Marc, Robardet, Celine, and Amer-Yahia, Sihem
- Subjects
- *
TIME series analysis , *MAGNITUDE (Mathematics) - Abstract
Event detection is one of the most important research topics in social media analysis. Despite this interest, few researchers have addressed the problem of identifying geolocated events in an unsupervised way, and none includes user interests during the process. In this paper, we tackle the problem of local event detection from social media data. We present a method to automatically identify events by evaluating the burstiness of hashtags in a geographical area and a time interval, and at the same time integrating user feedback. We devise two algorithms to discover user-driven events. The first one relies on an exact enumeration process, while the other directly samples the space of events. In our empirical study, we provide evidence that geolocated events cannot be detected by non location-aware methods. We also show that our methods (i) outperform by a factor of two to several orders of magnitude state-of-the-art methods designed to discover geolocated events, (ii) are more robust to noise, and (iii) produce high quality events with respect to user interests. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
50. Decomposition-Based Multiobjective Optimization for Constrained Evolutionary Optimization.
- Author
-
Wang, Bing-Chuan, Li, Han-Xiong, Zhang, Qingfu, and Wang, Yong
- Subjects
- *
CONSTRAINED optimization , *DIFFERENTIAL evolution , *LINEAR programming , *EVOLUTIONARY algorithms - Abstract
Pareto dominance-based multiobjective optimization has been successfully applied to constrained evolutionary optimization during the last two decades. However, as another famous multiobjective optimization framework, decomposition-based multiobjective optimization has not received sufficient attention from constrained evolutionary optimization. In this paper, we make use of decomposition-based multiobjective optimization to solve constrained optimization problems (COPs). In our method, first of all, a COP is transformed into a biobjective optimization problem (BOP). Afterward, the transformed BOP is decomposed into a number of scalar optimization subproblems. After generating an offspring for each subproblem by differential evolution, the weighted sum method is utilized for selection. In addition, to make decomposition-based multiobjective optimization suit the characteristics of constrained evolutionary optimization, weight vectors are elaborately adjusted. Moreover, for some extremely complicated COPs, a restart strategy is introduced to help the population jump out of a local optimum in the infeasible region. Extensive experiments on three sets of benchmark test functions, namely, 24 test functions from IEEE CEC2006, 36 test functions from IEEE CEC2010, and 56 test functions from IEEE CEC2017, have demonstrated that the proposed method shows better or at least competitive performance against other state-of-the-art methods. [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.