scispace - formally typeset
Search or ask a question
Institution

University of Electronic Science and Technology of China

EducationChengdu, China
About: University of Electronic Science and Technology of China is a education organization based out in Chengdu, China. It is known for research contribution in the topics: Computer science & Antenna (radio). The organization has 50594 authors who have published 58502 publications receiving 711188 citations. The organization is also known as: UESTC.


Papers
More filters
Journal ArticleDOI
TL;DR: For the case d = 3, a new method to establish the existence and boundedness of global classical solutions for arbitrarily large initial data under the assumption α > 1 2, which is slightly stronger than the corresponding subcritical assumption α> 1 3 on the fluid-free system as mentioned in this paper.

164 citations

Journal ArticleDOI
TL;DR: This paper proposes the first efficient and secure encrypted EMRs deduplication scheme for cloud-assisted eHealth systems (HealthDep), and shows that HealthDep provides a stronger security guarantee than Marforio et al.'s scheme (NDSS 2014) and Bellare et-al.
Abstract: In this paper, we analyze the inherent characteristic of electronic medical records (EMRs) from actual electronic health (eHealth) systems, where we found that first, multiple patients would generate large amounts of duplicate EMRs and second, cross-patient duplicate EMRs would be generated numerously only in the case that the patients consult doctors in the same department. We then propose the first efficient and secure encrypted EMRs deduplication scheme for cloud-assisted eHealth systems (HealthDep). With the integration of our analysis results, HealthDep allows the cloud server to efficiently perform the EMRs deduplication, and enables the cloud server to reduce storage costs by more than 65% while ensuring the confidentiality of EMRs. Security analysis shows that HealthDep provides a stronger security guarantee than Marforio et al. 's scheme (NDSS 2014) and Bellare et al. 's scheme (USENIX Security 2013). Algorithm implementation and performance analysis demonstrate the feasibility and high efficiency of HealthDep.

163 citations

Journal ArticleDOI
TL;DR: A deep reinforcement learning-based method is developed, which the secondary user can use to intelligently adjust its transmit power such that after a few rounds of interaction with the primary user, both users can transmit their own data successfully with required qualities of service.
Abstract: We consider the problem of spectrum sharing in a cognitive radio system consisting of a primary user and a secondary user. The primary user and the secondary user work in a non-cooperative manner. Specifically, the primary user is assumed to update its transmitted power based on a pre-defined power control policy. The secondary user does not have any knowledge about the primary user’s transmit power, or its power control strategy. The objective of this paper is to develop a learning-based power control method for the secondary user in order to share the common spectrum with the primary user. To assist the secondary user, a set of sensor nodes are spatially deployed to collect the received signal strength information at different locations in the wireless environment. We develop a deep reinforcement learning-based method, which the secondary user can use to intelligently adjust its transmit power such that after a few rounds of interaction with the primary user, both users can transmit their own data successfully with required qualities of service. Our experimental results show that the secondary user can interact with the primary user efficiently to reach a goal state (defined as a state in which both users can successfully transmit their data) from any initial states within a few number of steps.

163 citations

Journal ArticleDOI
TL;DR: This article investigates an important computation offloading scheduling problem in a typical VEC scenario, where a VT traveling along an expressway intends to schedule its tasks waiting in the queue to minimize the long-term cost in terms of a tradeoff between task latency and energy consumption.
Abstract: Vehicular edge computing (VEC) is a new computing paradigm that has great potential to enhance the capability of vehicle terminals (VTs) to support resource-hungry in-vehicle applications with low latency and high energy efficiency. In this article, we investigate an important computation offloading scheduling problem in a typical VEC scenario, where a VT traveling along an expressway intends to schedule its tasks waiting in the queue to minimize the long-term cost in terms of a tradeoff between task latency and energy consumption. Due to diverse task characteristics, dynamic wireless environment, and frequent handover events caused by vehicle movements, an optimal solution should take into account both where to schedule (i.e., local computation or offloading) and when to schedule (i.e., the order and time for execution) each task. To solve such a complicated stochastic optimization problem, we model it by a carefully designed Markov decision process (MDP) and resort to deep reinforcement learning (DRL) to deal with the enormous state space. Our DRL implementation is designed based on the state-of-the-art proximal policy optimization (PPO) algorithm. A parameter-shared network architecture combined with a convolutional neural network (CNN) is utilized to approximate both policy and value function, which can effectively extract representative features. A series of adjustments to the state and reward representations are taken to further improve the training efficiency. Extensive simulation experiments and comprehensive comparisons with six known baseline algorithms and their heuristic combinations clearly demonstrate the advantages of the proposed DRL-based offloading scheduling method.

163 citations

Journal ArticleDOI
TL;DR: A computational method called i6mA-Pred was developed to identify 6mA sites in the rice genome, in which the optimal nucleotide chemical properties obtained by the using feature selection technique were used to encode the DNA sequences.
Abstract: Motivation DNA N6-methyladenine (6mA) is associated with a wide range of biological processes. Since the distribution of 6mA site in the genome is non-random, accurate identification of 6mA sites is crucial for understanding its biological functions. Although experimental methods have been proposed for this regard, they are still cost-ineffective for detecting 6mA site in genome-wide scope. Therefore, it is desirable to develop computational methods to facilitate the identification of 6mA site. Results In this study, a computational method called i6mA-Pred was developed to identify 6mA sites in the rice genome, in which the optimal nucleotide chemical properties obtained by the using feature selection technique were used to encode the DNA sequences. It was observed that the i6mA-Pred yielded an accuracy of 83.13% in the jackknife test. Meanwhile, the performance of i6mA-Pred was also superior to other methods. Availability and implementation A user-friendly web-server, i6mA-Pred is freely accessible at http://lin-group.cn/server/i6mA-Pred.

163 citations


Authors

Showing all 51090 results

NameH-indexPapersCitations
Gang Chen1673372149819
Frede Blaabjerg1472161112017
Kuo-Chen Chou14348757711
Yi Yang143245692268
Guanrong Chen141165292218
Shuit-Tong Lee138112177112
Lei Zhang135224099365
Rajkumar Buyya133106695164
Lei Zhang130231286950
Bin Wang126222674364
Haiyan Wang119167486091
Bo Wang119290584863
Yi Zhang11643673227
Qiang Yang112111771540
Chun-Sing Lee10997747957
Network Information
Related Institutions (5)
Nanyang Technological University
112.8K papers, 3.2M citations

93% related

Tsinghua University
200.5K papers, 4.5M citations

92% related

City University of Hong Kong
60.1K papers, 1.7M citations

92% related

University of Science and Technology of China
101K papers, 2.4M citations

92% related

Zhejiang University
183.2K papers, 3.4M citations

91% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20241
2023159
2022980
20217,385
20207,220
20196,976