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

arXiv 2018年

作者： Xu, Yanqing Shen, Chao Chang, Tsung-Hui Lin, Shih-Chun Zhao, Yajun Zhu, Gang State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing China School of Science and Engineering Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data Shenzhen China Department of Department of Electronic and Computer Engineering National Taiwan University of Science and Technology Taipei Taiwan Algorithm Department Wireless Product RandD Institute ZTE Corporation Shenzhen China

This paper investigates energy-efficient resource allocation for the two-user downlink with strict latency constraints at users. To cope with strict latency constraints, the capacity formula of the finite blocklength codes (FBCs) is adopted, in contrast to the classical Shannon capacity formula. The FBC formula explicitly specifies the trade-off between blocklength and reliability. We first consider the case where the transmitter uses super-position coding based non-orthogonal multiple access (NOMA). However, due to heterogeneous latency constraints and channel conditions at users, the conventional successive interference cancellation may be infeasible. We thus propose to use different interference mitigation schemes according to heterogeneous user conditions and solve the corresponding NOMA design problems. Though the target energy function is non-convex and implicit, optimal user blocklength and power allocation can still be identified for the considered NOMA schemes and checking the problem feasibility is simple. It is observed that when the latency requirements are more heterogeneous, the NOMA scheme cannot achieve the best energy-efficiency of the downlink. In view of this, a hybrid transmission scheme which includes time division multiple access (TDMA) and NOMA as special cases is considered. Although the energy minimization is even challenging than the pure NOMA design problem, we propose a concave approximation of the FBC capacity formula which allows to obtain computationally efficient and high-quality solutions. Simulation results show that the hybrid scheme can benefits from both NOMA and TDMA. Copyright © 2018, The Authors. All rights reserved.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Real-time chaotic video encryption based on multithreaded parallel confusion and diffusion

arXiv

引用

arXiv 2023年

作者： Jiang, Dong Yuan, Zhen Li, Wen-Xin Lu, Liang-Liang School of Internet Anhui University Hefei230039 China National Engineering Research Center of Agro-Ecological Big Data Analysis and Application Anhui University Hefei230601 China Key Laboratory of Optoelectronic Technology of Jiangsu Province Nanjing Normal University Nanjing210023 China School of Physical Science and Technology Nanjing Normal University Nanjing210023 China National Laboratory of Solid State Microstructures Nanjing University Nanjing210093 China

MSC Codes 68P25 (Primary) 68W10 (Secondary)Due to the strong correlation between adjacent pixels, most image encryption schemes perform multiple rounds of confusion and diffusion to protect the image against attacks. Such operations, however, are time-consuming, cannot meet the real-time requirements of video encryption. Existing works, therefore, realize video encryption by simplifying the encryption process or encrypting specific parts of video frames, which results in lower security compared to image encryption. To solve the problem, this paper proposes a real-time chaotic video encryption strategy based on multithreaded parallel confusion and diffusion. It takes a video as the input, splits the frame into subframes, creates a set of threads to simultaneously perform five rounds of confusion and diffusion operations on corresponding subframes, and efficiently outputs the encrypted frames. The encryption speed evaluation shows that our method significantly improves the confusion and diffusion speed, realizes real-time 480 × 480, 576 × 576, and 768 × 768 24FPS video encryption using Intel Core i5-1135G7, Intel Core i7-8700, and Intel Xeon Gold 6226R, respectively. The statistical and security analysis prove that the deployed cryptosystems have outstanding statistical properties, can resist attacks, channel noise, and data loss. Compared with previous works, to the best of our knowledge, the proposed strategy achieves the fastest encryption speed, and realizes the first real-time chaotic video encryption based on multi-round confusion-diffusion architecture, thus, providing a more secure and feasible solution for practical applications and related research. © 2023, CC BY.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Model-enhanced Vector Index

arXiv

引用

arXiv 2023年

作者： Zhang, Hailin Wang, Yujing Chen, Qi Chang, Ruiheng Zhang, Ting Miao, Ziming Hou, Yingyan Ding, Yang Miao, Xupeng Wang, Haonan Pang, Bochen Zhan, Yuefeng Sun, Hao Deng, Weiwei Zhang, Qi Yang, Fan Xie, Xing Yang, Mao Cui, Bin School of Computer Science Key Lab of High Confidence Software Technologies Peking University China Microsoft United States Aerospace Information Research Institute Key Laboratory of Target Cognition and Application Technology Chinese Academy of Sciences China Institute of Information Engineering Chinese Academy of Sciences China Carnegie Mellon University United States National University of Singapore Singapore National Engineering Laboratory for Big Data Analysis and Applications Peking University China

Embedding-based retrieval methods construct vector indices to search for document representations that are most similar to the query representations. They are widely used in document retrieval due to low latency and decent recall performance. Recent research indicates that deep retrieval solutions offer better model quality, but are hindered by unacceptable serving latency and the inability to support document updates. In this paper, we aim to enhance the vector index with endto- end deep generative models, leveraging the differentiable advantages of deep retrieval models while maintaining desirable serving efficiency. We propose Modelenhanced Vector Index (MEVI), a differentiable model-enhanced index empowered by a twin-tower representation model. MEVI leverages a Residual Quantization (RQ) codebook to bridge the sequence-to-sequence deep retrieval and embeddingbased models. To substantially reduce the inference time, instead of decoding the unique document ids in long sequential steps, we first generate some semantic virtual cluster ids of candidate documents in a small number of steps, and then leverage the well-adapted embedding vectors to further perform a fine-grained search for the relevant documents in the candidate virtual clusters. We empirically show that our model achieves better performance on the commonly used academic benchmarks MSMARCO Passage and Natural Questions, with comparable serving latency to dense retrieval solutions. Copyright © 2023, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Research on Pre-view Method of Safety Level of Cascading Trip for Power Grid 6th

Research on Pre-view Method of Safety Level of Cascading Tri...

引用

6th International Conference on Advanced Machine Learning Technologies and Applications, AMLTA 2021

作者： Deng, Huiqiong Li, Qinbin Zheng, Rongjin Li, Peiqiang Chang, Kuo-Chi School of Information Science and Engineering Fujian University of Technology No. 3 Xueyuan Road University Town Minhou Fuzhou Fujian350118 China Fujian Provincial University Engineering Research Center of Smart Grid Simulation Analysis and Integrated Control Fuzhou Fujian350118 China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology No. 3 Xueyuan Road University Town Minhou Fuzhou Fujian350118 China College of Mechanical & Electrical Engineering National Taipei University of Technology No. 1 Section 3 Zhongxiao East Road Taipei10608 Taiwan Department of Business Administration North Borneo University College Lot 47 Block-F Alamesra Permai Plaza 2 Jln Sulaman Kota Kinabalu Sabah88400 Malaysia

ISBN: (纸本)9783030697167

This article introduces a method by which the power grid's security level can be observed in advance based on the expected initial failure. Firstly, based on the general form of cascading trip, this paper gives a mathematical expression of grid tripping based on cascading trip relay protection action behavior. According to the mathematical expression, the relationship between grid tripping and grid node injection power is discussed. According to this relationship, the distance between the node injection power under the current operation state and the nearest critical state node injection power is taken as the index to measure the power grid's security for cascading trip. According to this index, combined with various power grid constraints before and after the initial fault, a mathematical model for obtaining this safety index is given. This model is an optimized mathematical model. For the model, this paper gives a solution idea based on particle swarm. Finally, a few cases are performed in the IEEE-14 node system, and the calculations of the cases proved the accuracy of the proposed model and method. © 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Electric load flow

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient non-orthogonal transmission under reliability and finite blocklength constraints

arXiv

引用

arXiv 2017年

作者： Xu, Yanqing Shen, Chao Chang, Tsung-Hui Lin, Shih-Chun Zhao, Yajun Zhu, Gang State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing China School of Science and Engineering Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data Shenzhen China Department of ECE National Taiwan University of Science and Technology Taipei Taiwan Algorithm Department Wireless Product R&D Institute ZTE Corporation Shenzhen China

This paper investigates an energy-efficient nonorthogonal transmission design problem for two downlink receivers that have strict reliability and finite blocklength (latency) constraints. The Shannon capacity formula widely used in traditional designs needs the assumption of infinite blocklength and thus is no longer appropriate. We adopt the newly finite blocklength coding capacity formula for explicitly specifying the trade-off between reliability and code blocklength. However, conventional successive interference cancellation (SIC) may become infeasible due to heterogeneous blocklengths. We thus consider several scenarios with different channel conditions and with/without SIC. By carefully examining the problem structure, we present in closed-form the optimal power and code blocklength for energy-efficient transmissions. Simulation results provide interesting insights into conditions for which non-orthogonal transmission is more energy efficient than the orthogonal transmission such as TDMA. Copyright © 2017, The Authors. All rights reserved.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Two-Stream Regression Network for Dental Implant Position Prediction

arXiv

引用

arXiv 2023年

作者： Yang, Xinquan Li, Xuguang Li, Xuechen Chen, Wenting Shen, Linlin Li, Xin Deng, Yongqiang College of Computer Science and Software Engineering Shenzhen University Shenzhen China AI Research Center for Medical Image Analysis and Diagnosis Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Department of Stomatology Shenzhen University General Hospital Shenzhen China Department of Electrical Engineering City University of Hong Kong Hong Kong

In implant prosthesis treatment, the design of surgical guide requires lots of manual labors and is prone to subjective variations. When deep learning based methods has started to be applied to address this problem, the space between teeth are various and some of them might present similar texture characteristic with the actual implant region. Both problems make a big challenge for the implant position prediction. In this paper, we develop a two-stream implant position regression framework (TSIPR), which consists of an implant region detector (IRD) and a multi-scale patch embedding regression network (MSPENet), to address this issue. For the training of IRD, we extend the original annotation to provide additional supervisory information, which contains much more rich characteristic and do not introduce extra labeling costs. A multi-scale patch embedding module is designed for the MSPENet to adaptively extract features from the images with various tooth spacing. The global-local feature interaction block is designed to build the encoder of MSPENet, which combines the transformer and convolution for enriched feature representation. During inference, the RoI mask extracted from the IRD is used to refine the prediction results of the MSPENet. Extensive experiments on a dental implant dataset through five-fold cross-validation demonstrated that the proposed TSIPR achieves superior performance than existing methods. Copyright © 2023, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Xiaoke Zhu Danyang Li Xiaopan Chen Fumin Qi Fan Zhang Xiao-Yuan Jing School of Computer and Information Engineering Henan University Kaifeng China Henan Engineering Research Center of Intelligent Technology and Application Henan University Kaifeng China Department of System Operation National Supercomuting Center in Shenzhen Shenzhen China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng China School of Computer Science Wuhan University Wuhan China

ISBN: (数字)9798350390155

ISBN: (纸本)9798350390162

Facial image based kinship verification aims to decide whether there exists kinship between the given facial images. In practice, the cross-generation differences will cause adverse effects on kinship verification, which limits the performance. Therefore, how to mine the implied similarity from facial images with large cross-generation divergence is an important problem in kinship verification, which has not yet been well studied. In view of this, we propose a Similarity Mining via Implicit matching pattern LEarning (SMILE) approach for kinship verification. Specifically, SMILE mainly consists of two modules, including a Semi-coupled Multi-pattern Similarity Learning (SMSL) module and a Cross-Generation Feature Normalization (CGFN) module. The SMSL module is designed to learn multiple semi-coupled matching patterns for mining the implicit facial similarity information from different perspectives. The CGFN module aims to reduce the divergence between facial images of parent and child. Extensive experiments demonstrate that the proposed approach outperforms the existing state-of-the-art methods.

关键词： Pattern matching Similarity learning

来源：评论

学校读者我要写书评

暂无评论

The Cauchy problem for two dimensional generalized Kadomtsev-Petviashvili-I equation in anisotropic Sobolev spaces

arXiv

引用

arXiv 2017年

作者： Yan, Wei Li, Yongsheng Huang, Jianhua Duan, Jinqiao School of Mathematics and Information Science Henan Engineering Laboratory for Big Data Statistical Analysis and Optimal Control Henan Normal University Xinxiang Henan453007 China School of Mathematics South China University of Technology Guangzhou Guangdong510640 China College of Science National University of Defense Technology Changsha Hunan410073 China Department of Applied Mathematics Illinois Institute of Technology ChicagoIL60616 United States

The goal of this paper is three-fold. Firstly, we prove that the Cauchy problem for generalized KP-I equation ut+ |Dx|αθxu + θ-1xθ2yu + 1/2 θx(u2) = 0, α ≥ 4 is locally well-posed in the anisotropic Sobolev spaces Hs1,s2(R2) with s1> -α-1/4 and s2≥ 0. Secondly, we prove that the problem is globally well-posed in Hs1,0(R2) with s1> -(α-1)(3α-4)/4(5α+3) if 4 ≤ α ≤ 5. Finally, we prove that the problem is globally well-posed in Hs1,0(R2) with s1> -α(3α-4)/4(5α+4) if α > 5. Our result improves the result of Saut and Tzvetkov (J. Math. Pures Appl. 79(2000), 307-338.) and Li and Xiao (J. Math. Pures Appl. 90(2008), 338-352.). Copyright © 2017, The Authors. All rights reserved.

关键词： Sobolev spaces

来源：评论

学校读者我要写书评

暂无评论

Counterfactual data Augmentation with Denoising Diffusion for Graph Anomaly Detection

arXiv

引用

arXiv 2024年

作者： Xiao, Chunjing Pang, Shikang Xu, Xovee Li, Xuan Trajcevski, Goce Zhou, Fan The School of Computer and Information Engineering Henan University China The Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng475004 China The University of Electronic Science and Technology of China Sichuan Chengdu610054 China The National Key Laboratory of Fundamental Science on Synthetic Vision Sichuan University Chengdu610065 China The Department of Electrical and Computer Engineering Iowa State University AmesIA50011 United States

A critical aspect of Graph Neural Networks (GNNs) is to enhance the node representations by aggregating node neighborhood information. However, when detecting anomalies, the representations of abnormal nodes are prone to be averaged by normal neighbors, making the learned anomaly representations less distinguishable. To tackle this issue, we propose CAGAD - an unsupervised Counterfactual data Augmentation method for Graph Anomaly Detection - which introduces a graph pointer neural network as the heterophilic node detector to identify potential anomalies whose neighborhoods are normal-node-dominant. For each identified potential anomaly, we design a graph-specific diffusion model to translate a part of its neighbors, which are probably normal, into anomalous ones. At last, we involve these translated neighbors in GNN neighborhood aggregation to produce counterfactual representations of anomalies. Through aggregating the translated anomalous neighbors, counterfactual representations become more distinguishable and further advocate detection performance. The experimental results on four datasets demonstrate that CAGAD significantly outperforms strong baselines, with an average improvement of 2.35% on F1, 2.53% on AUC-ROC, and 2.79% on AUC-PR. Copyright © 2024, The Authors. All rights reserved.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Generating High-quality Movie Tags from Social Reviews: A Learning-driven Approach

Generating High-quality Movie Tags from Social Reviews: A Le...

引用

IEEE/ACM Int'l Conference on & Int'l Conference on Cyber, Physical and Social Computing (CPSCom) Green Computing and Communications (GreenCom)

作者： Zhenxiao Luo Guopin Tang Chen Wang Yipeng Zhou Xi Zheng Jessie Hui Wang Gang Liu Di Wu School of Computer Science and Engineering Sun Yat-Sen University Guangzhou China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Faculty of Science and Engineering Macquarie University Sydney Australia Institute for Network Sciences and Cyberspace Beijing National Research Center for Information Science and Technology Tsinghua University Beijing China College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (纸本)9781665417631

As a kind of keywords to describe video contents, tags are extremely beneficial for viewers to locate videos when they search the site. Additionally, tags also help video platform operators to better organize and recommend videos to platform users. Previous approaches are mainly based on manually tagging or tag propagation via video content analysis, which is time-consuming and resource-consuming. Especially, given the high volume of fresh movies generated per year, it is difficult to accurately tag all the movies manually. Moreover, video content analysis is also not easy considering typical features (e.g., long duration, complicated scenarios) of commercial movies. In this paper, we propose an automatic tagging algorithm called TagRec that exploits crowdsourced user reviews to generate accurate movie tags. We observe that user reviews contain rich information about movies (e.g., quality, actors) which can be learned to generate high-quality movie tags. Inspired by the above observation, we choose to transform the movie video tagging problem into a tag recommendation problem, in which tags are recommended to different movies by extracting knowledge from crowdsourced movie reviews. We take latent topics, tag co-occurrence probability and tag semantics into account, and formulate the problem as a recommendation optimization problem. We evaluate the performance of our pro-posed TagRec algorithm with a large-scale real-world dataset. Extensive experiments demonstrate that TagRec achieves 7.1 % and 9.6% improvement compared with other state-of-the-art methods in terms of Hit Ratio and Normalized Discounted Cumulative Gain respectively.

关键词： Social computing Filtering Semantics Transforms Tagging Motion pictures Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：