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

A Lightening Fine-grained Access Control Scheme Supporting Full Policy Hiding in Cloud Storage

学校读者我要写书评

暂无评论

A Lightening Fine-grained Access Control Scheme Supporting F...

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Jiaoli Shi Chao Hu Shimao Yao Zhuolin Mei Bin Wu Hui Li School of Computer and Big Data Jiujiang Univ. Jiujiang China School of Software IoT Engineering Jiangxi Univ. of Finance and Economics Nanchang China Jiujiang Key Lab. of Network and Information Security Jiujiang China School of Computer and Big Data Jiujiang University Jiujiang China School of Elec. and Comp. Engineering Peking University Shenzhen China

Efficiency, security, and flexibility are difficult to balance in a full policy hiding CP-ABE scheme. This paper creatively converts the privacy matching problem of access policy and a user’s private key to the privacy three-party set computation problem. Then the new privacy set computation problem is resolved by a message driven key generation method. Additionally, the ROBDD (Reduced Ordered Binary Decision Diagrams) is utilized to rich access structure expression and convert access policies into feasible path sets. Each feasible path is composed of attributes and these attributes are bound to the ciphertext using CP-ABE. Based on the innovative ideas mentioned above, we present a Lighten Fine-grained Access Control scheme supporting Full Policy Hidden (LFAC-FPH) that integrates data confidentiality protection, access policy rich expression but complete hiding, fine-grained access control, and lightweight terminal computing. Our scheme has three advantages: 1) High Efficiency. The proposed scheme can achieve fast privacy matching of access policies during user decryption. 2) Full Policy Hiding. The access policy bound by an owner on the ciphertext does not leak any information. Moreover, a user cannot know attributes they do not own. 3) High Flexibility. The decryption process does not require online from owners or KGC, and system attributes can be added at any time.

关键词：

Admission Control with Latency Considerations for 5G Mobile Edge Computing

学校读者我要写书评

暂无评论

Admission Control with Latency Considerations for 5G Mobile ...

IEEE International Symposium on World of Wireless Mobile and Multimedia Networks (WoWMoM)

作者： Ye Zhang Wuyungerile Li Winston K.G. Seah Inner Mongolia Key Lab. of Wireless Networking & Mobile Computing Engineering Research Center of Ecological Big Data Ministry of Education School of Computer Science Inner Mongolia University Hohhot China Wireless Networks Research Group School of Engineering and Computer Science Victoria University of Wellington Wellington New Zealand

The fifth generation (5G) mobile network is a new generation of broadband mobile communication technology with the potential to address the increasing demands of new user services and applications that have stringent low latency and high bandwidth requirements. Besides the enhanced mobile broadband (eMBB) which is an evolution of broadband services from previous generations, the ultra reliable low latency communication (URLLC) service comes with stringent delay requirements that are needed to support new applications like autonomous vehicles, augmented/virtual reality, etc. Mobile or multiple access edge computing (MEC) emerged to provide services and computing resources for users at the network edge to provide faster access speeds and lower end-to-end delays. To better meet user needs and maximize resource utilization, network resources need to be allocated and managed efficiently. Admission control for user requests is one of the methods used that can effectively prevent network congestion, thereby improving the overall performance of the system. In this paper, we propose a RED-based Admission Control with Latency Considerations (REDAL) algorithm for user admission control that aims to increase throughput, meet users’ delay requirements and reduce packet discard rate. By explicitly accounting for user traffic delay constraints and bandwidth requirements, we are able to meet the strict delay constraints of URLLC traffic while meeting the bandwidth requirements of eMBB traffic. We validate our approach in an MEC scenario to demonstrate high resource utilization and also keeping the request discard rate below 20%.

关键词：

Semi-autoregressive transformer for image captioning

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zhou, Yuanen Zhang, Yong Hu, Zhenzhen Wang, Meng School of Computer Science and Information Engineering Hefei University of Technology Tencent AI Lab Key Laboratory of Knowledge Engineering with Big Data Ministry of Education

Current state-of-the-art image captioning models adopt autoregressive decoders, i.e. they generate each word by conditioning on previously generated words, which leads to heavy latency during inference. To tackle this issue, non-autoregressive image captioning models have recently been proposed to significantly accelerate the speed of inference by generating all words in parallel. However, these non-autoregressive models inevitably suffer from large generation quality degradation since they remove words dependence excessively. To make a better trade-off between speed and quality, we introduce a semi-autoregressive model for image captioning (dubbed as SATIC), which keeps the autoregressive property in global but generates words parallelly in local. Based on Transformer, there are only a few modifications needed to implement SATIC. Experimental results on the MSCOCO image captioning benchmark show that SATIC can achieve a good trade-off without bells and whistles. Code is availab.e at https://***/YuanEZhou/satic. Copyright © 2021, The Authors. All rights reserved.

关键词： Economic and social effects

Reading-strategy Inspired Visual Representation Learning for Text-to-Video Retrieval

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Dong, Jianfeng Wang, Yabing Chen, Xianke Qu, Xiaoye Li, Xirong He, Yuan Wang, Xun The College of Computer and Information Engineering Zhejiang Gongshang University Hangzhou310035 China The State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China The School of Electronic Information and Communications Huazhong University of Science and Technology Hubei430074 China The Key Lab of Data Engineering and Knowledge Engineering Renmin University of China The AIMC Lab. School of Information Renmin University of China Beijing100872 China The Alibaba Group Beijing100102 China

This paper aims for the task of text-to-video retrieval, where given a query in the form of a natural-language sentence, it is asked to retrieve videos which are semantically relevant to the given query, from a great number of unlab.led videos. The success of this task depends on cross-modal representation learning that projects both videos and sentences into common spaces for semantic similarity computation. In this work, we concentrate on video representation learning, an essential component for text-to-video retrieval. Inspired by the reading strategy of humans, we propose a Reading-strategy Inspired Visual Representation Learning (RIVRL) to represent videos, which consists of two branches: a previewing branch and an intensive-reading branch. The previewing branch is designed to briefly capture the overview information of videos, while the intensive-reading branch is designed to obtain more in-depth information. Moreover, the intensive-reading branch is aware of the video overview captured by the previewing branch. Such holistic information is found to be useful for the intensive-reading branch to extract more fine-grained features. Extensive experiments on three datasets are conducted, where our model RIVRL achieves a new state-of-the-art on TGIF and VATEX. Moreover, on MSR-VTT, our model using two video features shows comparable performance to the state-of-the-art using seven video features and even outperforms models pre-trained on the large-scale HowTo100M dataset. Code is availab.e at https://***/LiJiaBei-7/rivrl. © 2022, CC BY.

关键词： Video recording

Takeover Performance and Workload under Varying Automation Levels, Time Budget and Road Curvature

学校读者我要写书评

暂无评论

Takeover Performance and Workload under Varying Automation L...

2022 IEEE Asia-Pacific Conference on Image Processing, Electronics and Computers, IPEC 2022

作者： Xu, Chengliang Li, Penghui Li, Yibing Merat, Natasha Lu, Ziwang Guo, Xing Tsinghua University State Key Laboratory of Automotive Safety and Energy School of Vehicle and Mobility Beijing China Beijing Jiaotong University Key Lab. of Transport Industry of Big Data Application Technologies for Comprehensive Transport School of Traffic and Transportation Beijing China University of Leeds Institute for Transport Studies Leeds United Kingdom Beijing Information Science and Technology University School of Mechanical and Electrical Engineering Beijing China

ISBN: (纸本)9781665409025

In SAE Level 2 (L2) and Level 3 (L3) automated driving, drivers are required to take over control from automation when reaching system boundaries. The length of time budget is the vital parameter that needs to be determined to ensure a safe takeover manner. Existing literature on this issue rarely considers potential interactions between time budget and other factors, and a variable time budget seemed to be paradoxical in critical unplanned transitions. To this end, this study investigated drivers' takeover performance and workload under varying automation levels, time budget and road curvature. We employed the operational design domain (ODD) exiting event as the transition scenario where the ego car was about to leave the highway. Results showed that drivers in L3 takeovers performed worse and elicited higher workload than L2 when entering a curved ramp with a limited time budget. Takeovers when entering a curved ramp yielded worse performance and higher workload, as compared to entering a straight ramp. Such detrimental effects caused by loss of situation awareness (SA) and change of road curvature can be mitigated by increasing the length of time budget. All these findings suggest that even in simplified ODD exiting scenarios, the length of time budget should vary according to the state of the driver and the environment. © 2022 IEEE.

关键词： Automation

A Causality Network Construction Method for High Dimensional Time Series Big data 5

学校读者我要写书评

暂无评论

A Causality Network Construction Method for High Dimensional...

5th International Conference on data Science and Information Technology, DSIT 2022

作者： Jing, Yi Liu, Zhenyu Gao, Jing Li, Tao Inner Mongolia Agricultural University Inner Mongolia Autonomous Reg. Key Lab. of Big Data Res. and Applic. for Agric. and Animal Husbandry Hohhot China The University of New Sales Wales The Faculty of Science Sydney Australia College of Computer and Information Engineering College of Life Sciences Inner Mongolia Agricultural University Hohhot China

ISBN: (数字)9781665498685

ISBN: (纸本)9781665498685

How to infer the causal relationship between variables in high-dimensional time series data and construct the causal network have always been a difficulty of research. The two major challenges are dimension reduction and causal inference. This paper proposes a causality network construction method for high-dimensional sequential big data. In this method, the dimensionality of feature variables is reduced by fuzzy C-means clustering twice and feature variables with similar and specific patterns are screened out. Then transfer entropy is used to infer causal relationships among variables and construct the time-series data network of causal relationships among variables. The proposed method was applied to a high-dimensional time-series data set which contains 32884 rats' gene expression values at 480 time points to infer the causal regulatory relationships among the genes, and efficiently construct the regulatory network of rats' rhythm genes. © 2022 IEEE.

关键词： Big data

GPTR: Gestalt-Perception Transformer for Diagram Object Detection

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Hu, Xin Zhang, Lingling Liu, Jun Fan, Jinfu You, Yang Wu, Yaqiang Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering School of Computer Science and Technology Xi’an Jiaotong University China National Engineering Lab for Big Data Analytics Xi’an Jiaotong University China Department of Control Science and Engineering Tongji University Shanghai China Department of Computer Science National University of Singapore Singapore Lenovo Research Beijing China

Diagram object detection is the key basis of practical applications such as textbook question answering. Because the diagram mainly consists of simple lines and color blocks, its visual features are sparser than those of natural images. In addition, diagrams usually express diverse knowledge, in which there are many low-frequency object categories in diagrams. These lead to the fact that traditional data-driven detection model is not suitable for diagrams. In this work, we propose a gestalt-perception transformer model for diagram object detection, which is based on an encoder-decoder architecture. Gestalt perception contains a series of laws to explain human perception, that the human visual system tends to perceive patches in an image that are similar, close or connected without abrupt directional changes as a perceptual whole object. Inspired by these thoughts, we build a gestalt-perception graph in transformer encoder, which is composed of diagram patches as nodes and the relationships between patches as edges. This graph aims to group these patches into objects via laws of similarity, proximity, and smoothness implied in these edges, so that the meaningful objects can be effectively detected. The experimental results demonstrate that the proposed GPTR achieves the best results in the diagram object detection task. Our model also obtains comparable results over the competitors in natural image object detection. Copyright © 2022, The Authors. All rights reserved.

关键词： Object detection

Implementing Predictive Model for Low Birth Weight in Afghanistan

学校读者我要写书评

暂无评论

Implementing Predictive Model for Low Birth Weight in Afghan...

International Conference on knowledge and Smart Technology (KST)

作者： Abdullah Zahirzada Kittichai Lavangnananda Data and Knowledge Engineering Lab. School of Information Technology (SIT) King Mongkut's University of Technology Thonburi (KMUTT) Bangkok Thailand

ISBN: (纸本)9781728176024;9781728176031

Birth weight is a significant determinant of the likelihood of survival of an infant. Low Birth Weight (LBW) has become an increasingly common problem, especially in developing and underdeveloped countries. Therefore, an ability to predict the LBW is beneficial and a good preventive measure. It is also a good indicator of future health risks of that infant. This study is concerned about the implementation of predictive LBW models for rural and urban areas of Afghanistan based on the data obtained from the Afghanistan Demographic and Health Survey 2015. The main objective of the study is to identify the most suitable machine learning techniques (i.e. classifiers) among the five popular ones. These are K-Nearest Neighbor (K-NN), Naïve Bayes, Neural Network, Random Forest, and Support Vector Machine (SVM). Prior to implementing the predictive models, data preprocessing is carried out. This is done by means of data cleansing and feature selection. The well-known Correlation based Feature Selection algorithm (CFS) is employed to select the top ten attributes. The classifier in this study comprises two categories, Normal and LBW. The preparation of the dataset is carefully done to ensure well-balanced samples in each category. The study reveals that Random Forest is the best classifier with an accuracy of 84.70% and 85.2% and with the Area Under the Curve (AUC) of 91.0% and 92.1% for both rural and urban areas, respectively. The study has a direct benefit to the health and prevention policy making in Afghanistan.

关键词： Support vector machines Pediatrics Urban areas Neural networks data preprocessing Predictive models Feature extraction

BADet: Boundary-Aware 3D Object Detection from Point Clouds

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Qian, Rui Lai, Xin Li, Xirong Key Lab of Data Engineering and Knowledge Engineering Renmin University of China Beijing100872 China School of Mathematics Renmin University of China Beijing100872 China

Currently, existing state-of-the-art 3D object detectors are in two-stage paradigm. These methods typically comprise two steps: 1) Utilize a region proposal network to propose a handful of high-quality proposals in a bottom-up fashion. 2) Resize and pool the semantic features from the proposed regions to summarize RoI-wise representations for further refinement. Note that these RoI-wise representations in step 2) are considered individually as uncorrelated entries when fed to following detection headers. Nevertheless, we observe these proposals generated by step 1) offset from ground truth somehow, emerging in local neighborhood densely with an underlying probability. Challenges arise in the case where a proposal largely forsakes its boundary information due to coordinate offset while existing networks lack corresponding information compensation mechanism. In this paper, we propose BADet for 3D object detection from point clouds. Specifically, instead of refining each proposal independently as previous works do, we represent each proposal as a node for graph construction within a given cut-off threshold, associating proposals in the form of local neighborhood graph, with boundary correlations of an object being explicitly exploited. Besides, we devise a lightweight Region Feature Aggregation Module to fully exploit voxel-wise, pixel-wise, and point-wise features with expanding receptive fields for more informative RoI-wise representations. We validate BADet both on widely used KITTI dataset and highly challenging nuScenes dataset. As of Apr. 17th, 2021, our BADet achieves on par performance on KITTI 3D detection leaderboard and ranks 1st on Moderate difficulty of Car category on KITTI BEV detection leaderboard. The source code is availab.e at https://***/rui-qian/BADet. © 2021, CC BY.

关键词： Object detection