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

作者： Zhang, Mingyue Zhou, Junlong Cong, Peijin Zhang, Gongxuan Zhuo, Cheng Hu, Shiyan Nanjing University of Science and Technology School of Computer Science and Engineering Nanjing210094 China Institute of Computing Technology Chinese Academy of Sciences State Key Laboratory of Computer Architecture Beijing100190 China Zhejiang University Department of Information Science and Electronic Engineering Hangzhou310027 China University of Southampton School of Electronics and Computer Science SouthamptonSO17 1BJ United Kingdom

Internet of Vehicles (IoV) has become an indispensable data sensing and processing platform in Internet of Things (IoT) for intelligent transportation. The mounted cameras on the vehicles along with the fixed roadside cameras are utilized to provide pictorial services for IoV users and law enforcement agencies. For such forensic services, ensuring the security and privacy of vehicles while guaranteeing the efficiency of data transmission among vehicles is important. In this paper, we propose a lightweight incentive authentication scheme (LIAS) for forensic services in IoV. LIAS is developed on a three-tier architecture containing cloud layer, fog layer, and user layer. LIAS uses pairing-free certificateless signcryption, pseudonym update mechanism, and incentive mechanism to realize a secure anonymous authentication efficiently. We conduct correctness and security analysis, as well as performance analysis and evaluation to validate the high security and efficiency of LIAS. Experimental results reveal that, the communication and computation overheads as well as the message delay and packet loss of LIAS are much lower than those of state-of-the-art techniques. Note to Practitioners - This paper is motivated by the security and privacy issues of forensic services in IoV for intelligent transportation. Our goal is to improve the security and privacy of vehicles while guaranteeing the lightweight and incentive of data transmission among the vehicles. Fog-assisted IoV is introduced to fully utilize the capacities of near-user edge devices as well as the connections between fog nodes and devices. However, it still faces the difficulties in ensuring vehicles' security and privacy. Moreover, vehicles' information dissemination could be easily monitored because of the unavoidable defect of wireless communication. Thereby, it is essential to guarantee the security and privacy of vehicles while enhancing the efficiency of vehicles' data transmission during the forensic service.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Donut Modes in Space Wavelength Division Multiplexing: Multimode Optical Fiber Transmission based on Electrical Feedback Equalizer 5

Donut Modes in Space Wavelength Division Multiplexing: Multi...

引用

5th International Conference on Electronic Design, ICED 2020

作者： Ghazi, Alaan Aljunid, S.A. Idrus, Syed Zulkarnain Syed Endut, R. Ali, N. Amphawan, Angela Fareed, Alaa Al-Dawoodi, Aras Noori, Awab School of Human Development and Techno-communication University Malaysia Perlis Malaysia School of Computer and Communication Engineering University Malaysia Perlis Malaysia Computer Technical Engineering Al-Qalam University College Iraq Centre of Excellence Universiti Malaysia Perlis Malaysia Universiti Malaysia Perlis Perlis Malaysia Lightwave Laboratory School of Engineering and Technology Sunway University Petaling Jaya Selangor47500 Malaysia School of Computing University Utara Malaysia Malaysia Computer Science Department College of Computer Science and Information Technology Kirkuk University Iraq Data Science Research Lab School of Computing Universiti Utara Malaysia Malaysia

This study demonstrates the implementation of multi-input-multi-output (MIMO) transmission donut modes in space wavelength division multiplexing (SWDM) over multi-mode optical fiber (MMOF) and simulating the effect of mode coupling of the transmitted signal. However, during the data transmitted over MMF by using SWDM an issue is encountered, which is the inter symbol interference (ISI) due to mode coupling. ISI has been recognized as a major obstacle to high-speed data transmission. The signal processing in SDM of donut modes over MMOF with electrical feedback equalizer is used to improve the performance for increasing the bandwidth. A data rate 80 Gbit/s up for a distance of 1600 meters is achieved. SWDM topology was designed emitted from a spatial vertical cavity surface-emitting laser (VCSEL) through MMOF in conjunction with the configurations of electrical feedback equalizer. The parameters and values used in Opt-Sim simulation topology were listed. The performance measurement of this study based on bit-error rates (BER) and eye diagram before and after electrical feedback equalization were analysed. © 2021 Published under licence by IOP Publishing Ltd.

关键词： Space division multiple access

来源：评论

学校读者我要写书评

暂无评论

Reducing Length Bias in Scoring Neural Machine Translation via a Causal Inference Method 20

Reducing Length Bias in Scoring Neural Machine Translation v...

引用

20th China National Conference on Computational Linguistics, CCL 2021

作者： Shi, Xuewen Huang, Heyan Jian, Ping Tang, Yi-Kun School of Computer Science and Technology Beijing Institute of Technology Beijing100081 China Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications Beijing100081 China

ISBN: (纸本)9783030841850

Neural machine translation (NMT) usually employs beam search to expand the searching space and obtain more translation candidates. However, the increase of the beam size often suffers from plenty of short translations, resulting in dramatical decrease in translation quality. In this paper, we handle the length bias problem through a perspective of causal inference. Specifically, we regard the model generated translation score S as a degraded true translation quality affected by some noise, and one of the confounders is the translation length. We apply a Half-Sibling Regression method to remove the length effect on S, and then we can obtain a debiased translation score without length information. The proposed method is model agnostic and unsupervised, which is adaptive to any NMT model and test dataset. We conduct the experiments on three translation tasks with different scales of datasets. Experimental results and further analyses show that our approaches gain comparable performance with the empirical baseline methods. © 2021, Springer Nature Switzerland AG.

关键词： Neural machine translation

来源：评论

学校读者我要写书评

暂无评论

TUT4CRS: Time-aware User-preference Tracking for Conversational Recommendation System 24

TUT4CRS: Time-aware User-preference Tracking for Conversatio...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： He, Dongxiao Zhang, Jinghan Wang, Xiaobao Ge, Meng Feng, Zhiyong Wang, Longbiao Ma, Xiaoke Tianjin Key Laboratory of Cognitive Computing and Application College of Intelligence and Computing Tianjin University Tianjin China Saw Swee Hock School of Public Health National University of Singapore Singapore Singapore School of Computer Science and Technology Xidian University Xi'an China

ISBN: (纸本)9798400706868

The Conversational Recommendation System (CRS) aims to capture user dynamic preferences and provide item recommendations based on multi-turn conversations. However, effectively modeling these dynamic preferences faces challenges due to conversational limitations, which mainly manifests as limited turns in a conversation (quantity aspect) and low compliance with queries (quality aspect). Previous studies often address these challenges in isolation, overlooking their interconnected nature. The fundamental issue underlying both problems lies in the potential abrupt changes in user preferences, to which CRS may not respond promptly. We acknowledge that user preferences are influenced by temporal factors, serving as a bridge between conversation quantity and quality. Therefore, we propose a more comprehensive CRS framework called Time-aware User-preference Tracking for Conversational Recommendation System (TUT4CRS), leveraging time dynamics to tackle both issues simultaneously. Specifically, we construct a global time interaction graph to incorporate rich external information and establish a local time-aware weight graph based on this information to adeptly select queries and effectively model user dynamic preferences. Extensive experiments on two real-world datasets validate that TUT4CRS can significantly improve recommendation performance while reducing the number of conversation turns. © 2024 ACM.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time 32

Streaming Algorithms for Graph k-Matching with Optimal or Ne...

引用

32nd International Symposium on Algorithms and Computation, ISAAC 2021

作者： Chen, Jianer Huang, Qin Kanj, Iyad Li, Qian Xia, Ge Department of Computer Science and Engineering Texas A&M University College StationTX United States School of Computing DePaul University ChicagoIL United States Institute of Computing Technology Chinese Academy of Sciences Beijing China Department of Computer Science Lafayette College EastonPA United States

ISBN: (纸本)9783959772143

We present streaming algorithms for the graph k-matching problem in both the insert-only and dynamic models. Our algorithms, while keeping the space complexity matching the best known upper bound, have optimal or near-optimal update time, significantly improving on previous results. More specifically, for the insert-only streaming model, we present a one-pass randomized algorithm that runs in optimal O(k2) space and has optimal O(1) update time, and that, w.h.p. (with high probability), computes a maximum weighted k-matching of a weighted graph. Previously, the best upper bound on the update time was O(log k), which was achieved by a deterministic streaming algorithm that however only works for unweighted graphs [16]. For the dynamic streaming model, we present a one-pass randomized algorithm that, w.h.p., computes a maximum weighted k-matching of a weighted graph in Õ(Wk2) space1 and with Õ(1) update time, where W is the number of distinct edge weights. Again the update time of our algorithm improves the previous best upper bound Õ(k2) [7]. Moreover, we prove that in the dynamic streaming model, any randomized streaming algorithm for the problem requires k2 · Ω(W(log W + 1)) bits of space. Hence, both the space and update-time complexities achieved by our algorithm in the dynamic model are near-optimal. A streaming approximation algorithm for k-matching is also presented, whose space complexity matches the best known upper bound with a significantly improved update time. © Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, and Ge Xia.

关键词： Dynamic models

来源：评论

学校读者我要写书评

暂无评论

An urban area-oriented traffic information query strategy in VANETs

An urban area-oriented traffic information query strategy in...

引用

8th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2013

作者： Wang, Xinjing Guo, Longjiang Ai, Chunyu Li, Jinbao Cai, Zhipeng School of Computer Science and Technology Heilongjiang University Heilongjiang China Key Laboratory of Database and Parallel Computing Heilongjiang University Heilongjiang China Division of Math and Computer Science University of South Carolina Upstate United States Department of Computer Science Georgia State University Atlanta 30303 United States

ISBN: (纸本)9783642397004

Traffic information query in Vehicular Ad Hoc Network has various significant applications. Real-time traffic information can provide support for users to choose an optimal route according to current traffic situation. In this paper, we propose an urban area-oriented traffic information query processing mechanism, which can acquire the realtime traffic information of multiple paths from source to destination in relatively fast and accurate manner, and help users to determine an optimal route. The proposed mechanism includes two key algorithms - query dissemination and processing, and routing results backward to query requester. The query processing algorithm determines the scope of each query, so that a vehicle can query and collect data within a certain efficient scope to avoid returning overwhelmed large amount results. For queried vehicles, returning results to the moving query requester is a dynamic routing problem. We proposed a position predicting method to estimate the current location of the requester according to the information stored in the query packet. Simulation results show that the proposed strategy can improve the efficiency of data transmission, and the returned query results is effective for choosing an optimal route. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Applying feature extraction of speech recognition on VoIP auditing

Applying feature extraction of speech recognition on VoIP au...

引用

作者： Wang, Xuan Lin, Jiancheng Sun, Yong Gan, Haibo Yao, Lin Intelligence Computing Research Center Department of Computer Science Harbin Institute of Technology Shenzhen Graduate School Shenzhen 518055 China School of Electronics and Information Engineering Shenzhen Polytechnic Shenzhen 518055 China

This paper presents an approach that combines both VoIP auditing and speech recognition, and an application of using speech recognition on VoIP voice data is described. It also deals with how to obtain VoIP voice data during audio communication: signaling protocol analysis and voice data traffic analysis. Feature extraction is a very important step in speech recognition, and the result derived from this research shows that the differences between the features extracted from voice recorded directly and voice captured through VoIP are very small and that applying speech recognition on VoIP auditing is applicable. © 2009 ICIC International.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Xdn: towards efficient inference of residual neural networks on cambricon chips 2nd

Xdn: towards efficient inference of residual neural networks...

引用

2nd International Symposium on Benchmarking, Measuring, and Optimization, Bench 2019

作者： Li, Guangli Wang, Xueying Ma, Xiu Liu, Lei Feng, Xiaobing State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China College of Computer Science and Technology Jilin University Changchun China MOE Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun China

ISBN: (纸本)9783030495558

In this paper, we present XDN, an optimization and inference engine for accelerating residual neural networks on Cambricon chips. We leverage a channel pruning method to compress the weights of ResNet-50. By exploring the optimization opportunities in computational graphs, we propose a layer fusion strategy, which dramatically decreases the number of scalar computation layers, such as Batch Normalization, Scale. Furthermore, we design an efficient implementation of XDN, including data preprocessing, hyper-parameter auto-tuning, etc. The experimental results show that the ResNet-50 model can achieve significant speedup without accuracy loss by using our XDN engine. © Springer Nature Switzerland AG 2020.

关键词： Engines

来源：评论

学校读者我要写书评

暂无评论

Optimal Confidential Mechanisms in Smart City Healthcare

引用

computers, Materials & Continua 2022年第3期70卷 4883-4896页

作者： R.Gopi P.Muthusamy P.Suresh C.G.Gabriel Santhosh Kumar Irina V.Pustokhina Denis A.Pustokhin K.Shankar Department of Computing Science and Engineering Dhanalakshmi Srinivasan Engineering CollegePerambalur621212India School of Computing Science and Engineering Galgotias UniversityNCRDelhi203201India Department of Computer Science and Engineering KPR Institute of Engineering and TechnologyCoimbatore641407India Department of Electrical and Electronics Engineering K.Ramakrishnan College of EngineeringTiruchirappalli621112India Department of Entrepreneurship and Logistics Plekhanov Russian University of EconomicsMoscow117997Russia Department of Logistics State University of ManagementMoscow109542Russia Department of Computer Applications Alagappa UniversityKaraikudi630001India

Smart City Healthcare(SHC2)system is applied in monitoring the patient at home while it is also expected to react to their needs in a timely *** system also concedes the freedom of a *** is a part of this system and it helps in providing care to the *** healthcare devices are trustworthy since it almost certainly recognizes the potential intensifications at very early stage and alerts the patients and medical experts to such an extent that they are provided with immediate *** methodologies exhibit few shortcomings in terms of computational complexity,cost and data ***,the current research article examines SHC2 security through LightWeight Cipher(LWC)with Optimal S-Box model in PRESENT *** procedure aims at changing the sub bytes in which a single function is connected with several bytes’information to upgrade the security level through Swam *** key contribution of this research article is the development of a secure healthcare model for smart city using SHC2 security via LWC and Optimal S-Box *** study used a nonlinear layer and single 4-bit S box for round configuration after verifying SHC2 information,constrained by Mutual Authentication(MA).The security challenges,in healthcare information systems,emphasize the need for a methodology that immovably concretes the *** methodology should act practically,be an effective healthcare framework that depends on solidarity and adapts to the developing *** service providers integrated the IoT applications and medical services to offer individuals,a seamless technology-supported healthcare *** proposed SHC^(2) was implemented to demonstrate its security levels in terms of time and access *** model was tested under different parameters such as encryption time,decryption time,access time and response time inminimum ***,the level of the model and throughput were analyzed by maximum value i.e.,50Mbp

关键词： Smart city healthcare security block cipher LWC

来源：评论

学校读者我要写书评

暂无评论

GridIS: An incentive-based grid scheduling

GridIS: An incentive-based grid scheduling

引用

19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

作者： Xiao, Lijuan Zhu, Yanmin Ni, Lionel M. Xu, Zhiwei Software Division Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China Graduate School Chinese Academy of Sciences Beijing 100039 China Department of Computer Science Hong Kong University of Science and Technology Clearwater Bay Kowloon Hong Kong Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

ISBN: (纸本)0769523129

In a grid computing environment, resources are autonomous, wide-area distributed, and what's more, they are usually not free. These unique characteristics make scheduling in a self-sustainable and market-like grid highly challenging. The goal of our work is to build such a global computational grid that every participant has enough incentive to stay and play in it. There are two parties in the grid: resource consumers and resource providers. Thus the performance objective of scheduling is two-fold: for consumers, high successful execution rate of jobs, and for providers, fair allocation of benefits. We propose an incentive-based grid scheduling, GridIS, which is composed of a P2P decentralized scheduling framework and incentive-based scheduling algorithms. Simulation results show that GridIS guarantees the incentive of every participant to a satisfying extent.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：