Realizing Video Analytic Service in the Fog-Based Infrastructure-Less Environments

Deep learning has unleashed the great potential in many fields and now is the most significant facilitator for video analytics owing to its capability to providing more intelligent services in a complex scenario. Meanwhile, the emergence of fog computing has brought unprecedented opportunities to provision intelligence services in infrastructure-less environments like remote national parks and rural farms. However, most of the deep learning algorithms are computationally intensive and impossible to be executed in such environments due to the needed supports from the cloud. In this paper, we develop a video analytic framework, which is tailored particularly for the fog devices to realize video analytic service in a rapid manner. Also, the convolution neural networks are used as the core processing unit in the framework to facilitate the image analysing process

Sequential Prediction of Social Media Popularity with Deep Temporal Context Networks

Prediction of popularity has profound impact for social media, since it offers opportunities to reveal individual preference and public attention from evolutionary social systems. Previous research, although achieves promising results, neglects one distinctive characteristic of social data, i.e., sequentiality. For example, the popularity of online content is generated over time with sequential post streams of social media. To investigate the sequential prediction of popularity, we propose a novel prediction framework called Deep Temporal Context Networks (DTCN) by incorporating both temporal context and temporal attention into account. Our DTCN contains three main components, from embedding, learning to predicting. With a joint embedding network, we obtain a unified deep representation of multi-modal user-post data in a common embedding space. Then, based on the embedded data sequence over time, temporal context learning attempts to recurrently learn two adaptive temporal contexts for sequential popularity. Finally, a novel temporal attention is designed to predict new popularity (the popularity of a new user-post pair) with temporal coherence across multiple time-scales. Experiments on our released image dataset with about 600K Flickr photos demonstrate that DTCN outperforms state-of-the-art deep prediction algorithms, with an average of 21.51% relative performance improvement in the popularity prediction (Spearman Ranking Correlation).Comment: accepted in IJCAI-1

An Obstacle Avoidance Method of Soccer Robot Based on Evolutionary Artificial Potential Field

AbstractIn order to solve the problems that local minimum, path planning in obstacles, and optimizing global obstacle avoidance path, the paper proposed a new obstacle avoidance method. In this method, used the grid method to describe the information of obstacles environment, utilized the evolutionary artificial potential field method to optimize obstacle avoidance path. The simulation results show that the proposed method is feasible and effective

Improving tensor regression by optimal model averaging

Tensors have broad applications in neuroimaging, data mining, digital marketing, etc. CANDECOMP/PARAFAC (CP) tensor decomposition can effectively reduce the number of parameters to gain dimensionality-reduction and thus plays a key role in tensor regression. However, in CP decomposition, there is uncertainty which rank to use. In this article, we develop a model averaging method to handle this uncertainty by weighting the estimators from candidate tensor regression models with different ranks. When all candidate models are misspecified, we prove that the model averaging estimator is asymptotically optimal. When correct models are included in the candidate models, we prove the consistency of parameters and the convergence of the model averaging weight. Simulations and empirical studies illustrate that the proposed method has superiority over the competition methods and has promising applications

KICGPT: Large Language Model with Knowledge in Context for Knowledge Graph Completion

Knowledge Graph Completion (KGC) is crucial for addressing knowledge graph incompleteness and supporting downstream applications. Many models have been proposed for KGC. They can be categorized into two main classes: triple-based and text-based approaches. Triple-based methods struggle with long-tail entities due to limited structural information and imbalanced entity distributions. Text-based methods alleviate this issue but require costly training for language models and specific finetuning for knowledge graphs, which limits their efficiency. To alleviate these limitations, in this paper, we propose KICGPT, a framework that integrates a large language model (LLM) and a triple-based KGC retriever. It alleviates the long-tail problem without incurring additional training overhead. KICGPT uses an in-context learning strategy called Knowledge Prompt, which encodes structural knowledge into demonstrations to guide the LLM. Empirical results on benchmark datasets demonstrate the effectiveness of KICGPT with smaller training overhead and no finetuning.Comment: Accepted to EMNLP 2023 Finding

Digital Pre-distortion Technology For Optimization Design Of VDB Transmitter

Due to the nonlinear distortion of the power amplifier, the problems of in-band distortion and Adjacent Channel Interference will occur in VDB transmitter .To address the problem ,this paper introduces a digital pre-distortion method based on memoryless polynomial model ,which can solve the coefficients of digital pre-distorter with indirect learning structure. The results show that the digital pre-distortion method can effectively improve the third-order intermodulation distortion, the adjacent channel power ratio (ACPR) and the error vector amplitude (EVM) of VDB transmitter, and it can also improve the performance and efficiency of the communication system

Time Differential Pricing Model of Urban Rail Transit Considering Passenger Exchange Coefficient

Passenger exchange coefficient is a significant factor which has great impact on the pricing model of urban rail transit. This paper introduces passenger exchange coefficient into a bi-level programming model with time differential pricing for urban rail transit by analysing variation regularity of passenger flow characteristics. Meanwhile, exchange cost coefficient is also considered as a restrictive factor in the pricing model. The improved particle swarm optimisation algorithm (IPSO) was applied to solve the model, and simulation results show that the proposed improved pricing model can effectively realise stratification of fares for different time periods with different routes. Taking Line 2 and Line 8 of the Beijing rail transit network as an example, the simulation result shows that passenger flows of Line 2 and Line 8 in peak hours decreased by 9.94% and 19.48% and therefore increased by 32.23% and 44.96% in off-peak hours, respectively. The case study reveals that dispersing passenger flows by means of fare adjustment can effectively drop peak load and increase off-peak load. The time differential pricing model of urban rail transit proposed in this paper has great influences on dispersing passenger flow and ensures safety operation of urban rail transit. It is also a valuable reference for other metropolitan rail transit operating companies