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

Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing, UIC-ATC

作者： Feng Wang Yasha Wang Jiangtao Wang Haoyi Xiong Junfeng Zhao Daqing Zhang Key Laboratory of High Confdence Software Technologies Ministry of Education Beijing China School of Electronics Engineering and Computer Science Peking University Beijing China Peking University Information Technology Institute Tianjin Binhai China National Engineering Research Center of Software Engineering Beijing China Big Data Lab Baidu Research Beijing

ISBN: (数字)9781728140346

ISBN: (纸本)9781728140353

Mental stress is a critical factor affecting one's physical and mental well-being. At the early stage, the effect of stress is often underestimated, while it usually leads to serious issue Lateran. Therefore, it is crucial to detect stress before it evolves into severe problems. Traditional stress detection methods are based on either questionnaires or professional devices, which are time-consuming, costly and intrusive. With the popularity of smartphones embedded with a rich set of sensors, which can capture people's context, such as movement, sound, location and so on, it is an alternative way to access people's behavior by smartphones. Through an empirical study, this paper proposes an automatic and non-intrusive stress detection framework based on smartphone sensing data. First, we construct various discriminative features from multi-modality phone sensing data, in which both absolute and relative features are considered to make the model more personalized. Then, to tackle the challenge of label insufficiency, we further develop a co-training based method for stress level classification. Finally, we evaluate our model based on an open dataset, and the experimental results verify its advantages over other baselines.

关键词： Sensors Stress Feature extraction Psychology Mobile handsets data models Biomedical monitoring

来源：评论

学校读者我要写书评

暂无评论

Variational reconstruction using subdivision surfaces with continuous sharpness control

引用

Computational Visual Media 2017年第3期3卷 217-228页

作者： Xiaoqun Wu Jianmin Zheng Yiyu Cai Haisheng Li Beijing Key Lab of Big Data Technology for Food Safety School of Computer and Information EngineeringBeijing Technology and Business University College of Engineering Nanyang Technological University

We present a variational method for subdivision surface reconstruction from a noisy dense mesh. A new set of subdivision rules with continuous sharpness control is introduced into Loop subdivision for better modeling subdivision surface features such as semi-sharp creases, creases, and corners. The key idea is to assign a sharpness value to each edge of the control mesh to continuously control the surface *** on the new subdivision rules, a variational model with L_1 norm is formulated to find the control mesh and the corresponding sharpness values of the subdivision surface that best fits the input mesh. An iterative solver based on the augmented Lagrangian method and particle swarm optimization is used to solve the resulting non-linear, non-differentiable optimization problem. Our experimental results show that our method can handle meshes well with sharp/semi-sharp features and noise.

关键词： variational model subdivision surface sharpness surface reconstruction L1 norm

来源：评论

学校读者我要写书评

暂无评论

Online transmission policy in wireless powered networks with urgency-aware age of information 15

Online transmission policy in wireless powered networks with...

引用

15th IEEE International Wireless Communications and Mobile Computing Conference, IWCMC 2019

作者： Lu, Yang Xiong, Ke Fan, Pingyi Zhong, Zhangdui Letaief, Khaled Ben School of Computer and Information Technology Beijing Jiaotong University Beijing100044 China Beijing Key Laboratory of Traffic Data Analysis and Mining Beijing Jiaotong University Beijing100044 China Department of Electronic Engineering Tsinghua University Beijing100084 China State Key Lab of Rail Traffic Control and Safety Beijing Jiaotong University Beijing100044 China Beijing Engineering Research Center of High-speed Railway Broadband Mobile Communications Beijing Jiaotong University Beijing100044 China Hong Kong University of Science and Technology Hong Kong Hong Kong

ISBN: (纸本)9781538677476

This paper investigates the age of information (AoI) for a radio frequency (RF) energy harvesting (EH) enabled network, where a sensor first scavenges energy from a wireless power station and then transmits the collected status update to a sink node. To capture the thirst for the fresh update becoming more and more urgent as time elapsing, urgency-aware AoI (U-AoI) is defined, which increases exponentially with the increment of time between two received updates. Due to EH, a waiting time is required at the sensor before transmitting the status update. An optimization problem is formulated to minimize the long-term average U-AoI under constraint of energy causality. A two-layer algorithm is presented to solve it, where the outer loop is designed based on Dinklebach's method, and the inner loop presents a semi-closed-form expression of the optimal waiting time policy based on Karush-Kuhn-Tucker (KKT) optimality conditions. Numerical results show that our proposed optimal transmission policy outperforms the zero time waiting policy and equal time waiting policy in terms of long-term average U-AoI, especially when the networks are in slight load. It also shows that the system U-AoI first decreases and then keeps unchanged with the increments of EH circuit's saturation level. © 2019 IEEE.

关键词： Energy harvesting

来源：评论

学校读者我要写书评

暂无评论

Erratum to "Multi-View Face Synthesis via Progressive Face Flow"

引用

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society 2021年 30卷 6700页

作者： Yangyang Xu Xuemiao Xu Jianbo Jiao Keke Li Cheng Xu Shengfeng He School of Computer Science and Engineering South China University of Technology Guangzhou China State Key Laboratory of Subtropical Building Science the Key Laboratory of Big Data and Intelligent Robot Ministry of Education and the Guangdong Provincial Key Lab of Computational Intelligence and Cyberspace Information South China University of Technology Guangzhou China University of Oxford Oxford U.K.

In the above article [1], unfortunately, Fig. 5 was not displayed correctly with many empty images. The correct version is supplemented here.

关键词： Faces

来源：评论

学校读者我要写书评

暂无评论

Analysis and optimization for RIS-aided multi-pair communications relying on statistical CSI

arXiv

引用

arXiv 2020年

作者： Peng, Zhangjie Li, Tianshu Pan, Cunhua Ren, Hong Xu, Wei Renzo, Marco Di College of Information Mechanical and Electrical Engineering Shanghai Normal University Shanghai200234 China Institute of Artificial Intelligence on Education Shanghai Normal University Shanghai200234 China College of Information Mechanical and Electrical Engineering Shanghai Normal University Shanghai200234 China School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom National Mobile Communications Research Lab Southeast University Nanjing210096 China Henan Joint International Research Laboratory of Intelligent Networking and Data Analysis Zhengzhou University Zhengzhou450001 China Université Paris-Saclay CNRS CentraleSupélec Laboratoire des Signaux et Systèmes 3 Rue Joliot-Curie Gif-surYvette91192 France

In this paper, we investigate a reconfigurable intelligent surface (RIS) aided multi-pair communication system, in which multi-pair users exchange information via an RIS. We derive an approximate expression for the achievable rate by assuming that statistical channel state information (CSI) is available. A genetic algorithm (GA) to solve the rate maximization problem is proposed as well. In particular, we consider implementations of RISs with continuous phase shifts (CPSs) and discrete phase shifts (DPSs). Simulation results verify the obtained results and show that the proposed GA method has almost the same performance as the globally optimal solution. In addition, numerical results show that three quantization bits can achieve a large portion of the achievable rate for the CPSs setup. © 2020, CC BY.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Structured query construction via knowledge graph embedding

arXiv

引用

arXiv 2019年

作者： Wang, Ruijie Wang, Meng Liu, Jun Cochez, Michael Decker, Stefan National Engineering Lab for Big Data Analytics Xi'an Jiaotong University Xi'an China School of Electronic and Information Engineering Xi'an Jiaotong University Xi'an China School of Computer Science and Engineering Southeast University Nanjing China Guang Dong Xi'an Jiaotong University Academy Shunde China VU Amsterdam Amsterdam Netherlands Fraunhofer FIT Sankt Augustin Germany Informatik 5 RWTH Aachen University Aachen Germany Faculty of Information Technology University of Jyvskyl Jyvskyl Finland

In order to facilitate the accesses of general users to knowledge graphs, an increasing effort is being exerted to construct graph-structured queries of given natural language questions. At the core of the construction is to deduce the structure of the target query and determine the vertices/edges which constitute the query. Existing query construction methods rely on question understanding and conventional graph-based algorithms which lead to inefficient and degraded performances facing complex natural language questions over knowledge graphs with large scales. In this paper, we focus on this problem and propose a novel framework standing on recent knowledge graph embedding techniques. Our framework first encodes the underlying knowledge graph into a low-dimensional embedding space by leveraging generalized local knowledge graphs. Given a natural language question, the learned embedding representations of the knowledge graph are utilized to compute the query structure and assemble vertices/edges into the target query. Extensive experiments were conducted on the benchmark dataset, and the results demonstrate that our framework outperforms state-of-the-art baseline models regarding effectiveness and efficiency. Copyright © 2019, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Studying weariness prediction using SMOTE and random forests 3rd

Studying weariness prediction using SMOTE and random forests

引用

3rd International Conference on Smart Computing and Communications, SmartCom 2018

作者： Weng, Yu Deng, Fengming Yang, Guosheng Chen, Liandong Yuan, Jie Gui, Xinkai Wang, Jue School of Information Engineering Minzu University of China Beijing100081 China National & Local Joint Engineering Lab for Big Data Analysis and Computing Technology Beijing100190 China State Grid Hebei Electric Power Company ShijiazhuangHebei050022 China Computer Network Information Center Chinese Academy of Sciences Beijing100190 China

ISBN: (纸本)9783030057541

This article is aimed at the low accuracy of student weariness prediction in education and the poor prediction effect of traditional prediction models. It was established the SMOTE (Synthetic Minority Oversampling Technique) algorithm and random forest prediction models. This study puts forward to useing the SMOTE oversampling method to balance the data set and then use the random forest algorithm to train the classifier. By comparing the common single classifier with the ensemble learning classifier, it was found that the SMOTE and Random forest method performed more prominently, and the reasons for the increase in the AUC value after using the SMOTE method were analyzed. Using Massive Open Online Course (Mooc) synthesis student’s datasets, which mainly include the length of class, whether the mouse has moved, whether there is a job submitted, whether there is participating in discussions and completing the accuracy of the assignments. It is proved that this method can significantly improve the classification effect of classifiers, so teachers can choose appropriate teaching and teaching interventions to improve student’s learning outcomes. © 2018, Springer Nature Switzerland AG.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Channel Estimation for Ambient Backscatter Communication Systems with Massive-Antenna Reader

arXiv

引用

arXiv 2019年

作者： Zhao, Wenjing Wang, Gongpu Atapattu, Saman He, Ruisi Liang, Ying-Chang Beijing Key Lab of Transportation Data Analysis and Mining School of Computer and Information Technology Beijing Jiaotong University China Department of Electrical and Electronic Engineering University of Melbourne ParkvilleVIC3010 Australia Center for Intelligent Networking and Communications University of Electronic Science and Technology of China Chengdu China

—Ambient backscatter, an emerging green communication technology, has aroused great interest from both academia and industry. One open problem for ambient backscatter communication (AmBC) systems is channel estimation for a massive-antenna reader. In this paper, we focus on channel estimation problem in AmBC systems with uniform linear array (ULA) at the reader which consists of large number of antennas. We first design a two-step method to jointly estimate channel gains and direction of arrivals (DoAs), and then refine the estimates through angular rotation. Additionally, Cramér-Rao lower bounds (CRLBs) are derived for both the modulus of the channel gain and the DoA estimates. Simulations are then provided to validate the analysis, and to show the efficiency of the proposed approach. Copyright © 2019, The Authors. All rights reserved.

关键词： Backscattering

来源：评论

学校读者我要写书评

暂无评论

Automatic Extraction of Medication Mentions from Tweets-Overview of the BioCreative VII Shared Task 3 Competition

引用

database : the journal of biological databases and curation 2023年第2023期2023卷 baac108页

作者： Davy Weissenbacher Karen O'Connor Siddharth Rawal Yu Zhang Richard Tzong-Han Tsai Timothy Miller Dongfang Xu Carol Anderson Bo Liu Qing Han Jinfeng Zhang Igor Kulev Berkay Köprü Raul Rodriguez-Esteban Elif Ozkirimli Ammer Ayach Roland Roller Stephen Piccolo Peijin Han V G Vinod Vydiswaran Ramya Tekumalla Juan M Banda Parsa Bagherzadeh Sabine Bergler João F Silva Tiago Almeida Paloma Martinez Renzo Rivera-Zavala Chen-Kai Wang Hong-Jie Dai Luis Alberto Robles Hernandez Graciela Gonzalez-Hernandez Department of Computational Biomedicine Cedars-Sinai Medical Center Los Angeles CA USA. DBEI The Perelman School of Medicine University of Pennsylvania Philadelphia PA USA. Department of Computer Science and Information Engineering National Central University No. 300 Zhongda Rd Zhongli District Taoyuan 320 Taiwan. IoX Center National Taiwan University Da'an District Section 4 Roosevelt Rd No. 1 Barry Lam Hall Taipei 106 Taiwan. Research Center for Humanities and Social Sciences Academia Sinica No. 128 Section 2 Academia Rd Nangang District Taipei 115 Taiwan. Computational Health Informatics Program Boston Children's Hospital Boston MA USA. Department of Pediatrics Harvard Medical School Boston MA USA. NVIDIA Santa Clara CA USA. Department of Statistics Florida State University Tallahassee FL USA. Data and Analytics Chapter F. Hoffmann-La Roche Ltd Switzerland. Pharmaceutical Research and Early Development Roche Innovation Center Basel Switzerland. Speech and Language Technology Lab DFKI Berlin Germany. Department of Biology Brigham Young University Provo UT USA. Department of Computational Medicine and Bioinformatics Medical School University of Michigan Ann Arbor MI USA. Department of Learning Health Sciences Medical School University of Michigan Ann Arbor MI USA. School of Information University of Michigan Ann Arbor MI USA. Department of Computer Science Georgia State University Atlanta GA USA. CLaC Labs Concordia University Montreal Canada. DETI Institute of Electronics and Informatics Engineering of Aveiro University of Aveiro Portugal. Department of Computation University of A Coruña Spain. Computer Science and Engineering Department Universidad Carlos III de Madrid Madrid Spain. Big Data Laboratory Chunghwa Telecom Laboratories Taoyuan Taiwan. Department of Computer Science National Yang Ming Chiao Tung University Hsinchu Taiwan. Department of Electrical Engineering College of Electrical Engineering and Computer Sci

This study presents the outcomes of the shared task competition BioCreative VII (Task 3) focusing on the extraction of medication names from a Twitter user's publicly available tweets (the user's 'timeline'). In general, detecting health-related tweets is notoriously challenging for natural language processing tools. The main challenge, aside from the informality of the language used, is that people tweet about any and all topics, and most of their tweets are not related to health. Thus, finding those tweets in a user's timeline that mention specific health-related concepts such as medications requires addressing extreme imbalance. Task 3 called for detecting tweets in a user's timeline that mentions a medication name and, for each detected mention, extracting its span. The organizers made available a corpus consisting of 182 049 tweets publicly posted by 212 Twitter users with all medication mentions manually annotated. The corpus exhibits the natural distribution of positive tweets, with only 442 tweets (0.2%) mentioning a medication. This task was an opportunity for participants to evaluate methods that are robust to class imbalance beyond the simple lexical match. A total of 65 teams registered, and 16 teams submitted a system run. This study summarizes the corpus created by the organizers and the approaches taken by the participating teams for this challenge. The corpus is freely available at https://***/tasks/biocreative-vii/track-3/. The methods and the results of the competing systems are analyzed with a focus on the approaches taken for learning from class-imbalanced data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Constrained Multi-scale Dense Connections for Accurate Biomedical Image Segmentation

Constrained Multi-scale Dense Connections for Accurate Biome...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Jiawei Zhang Yanchun Zhang Shanfeng Zhu Xiaowei Xu Shanghai key Laboratory of Data Science School of Computer Science Fudan University Shanghai China Cyberspace Institute of Advanced Technology Guangzhou University Guangzhou China College of Engineering and Science Victoria University Melbourne Australia ISTBI and Shanghai Institute of Artificial Intelligence Algorithms Fudan University Shanghai China Nanjing University Institute of Artificial Intelligence Biomedicine Nanjing China Shanghai Key Lab of Intelligent Information Processing Fudan University Shanghai China Guangdong Provincial People’s Hospital Guangdong Cardiovascular Institute Guangzhou China

ISBN: (数字)9781728162157

ISBN: (纸本)9781728162164

Biomedical image segmentation plays a critical role in clinical diagnosis and medical intervention. Recently, a variety of deep neural networks have boosted the biomedical image segmentation performance with a large margin, which adopts dense connections to explore rich representations in multiple scales. In multi-scale dense connections, features from all or most scales are fused or iteratively aggregated. In this paper, we propose constrained multi-scale dense connections (CMDC) for accurate biomedical image segmentation, which only fuse features from the nearest scales containing the most relevant appearance or semantic information. Based on CMDC, we further construct constraint multi-scale dense networks (CMD-Net) by applying CMDC to existing segmentation networks. Experiments across various architectures (including FCN-8s, U-Net, and DeeplabV3) and datasets (including GlaS, CRAG, KID, and ECS) demonstrate that CMD-Net not only outperforms existing schemes on both accuracy and efficiency but also can be easily generalized to a variety of segmentation networks. In addition, CMD-Net achieves state-of-the-art performance on two instance segmentation datasets, GlaS and CRAG.

关键词： Decoding Image segmentation Image resolution Biomedical imaging Glands Fuses Cancer

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：