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

Graduate employment prediction with bias

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Guo, Teng Xia, Feng Zhen, Shihao Bai, Xiaomei Zhang, Dongyu Liu, Zitao Tang, Jiliang Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province Dalian University of Technology Dalian116620 China School of Science Engineering and Information Technology Federation University Australia BallaratVIC3353 Australia Computing Center Anshan Normal University Anshan114007 China TAL AI Lab TAL Education Group Beijing100080 China Department of Computer Science and Engineering Michigan State University East LansingMI48824 United States

The failure of landing a job for college students could cause serious social consequences such as drunkenness and suicide. In addition to academic performance, unconscious biases can become one key obstacle for hunting jobs for graduating students. Thus, it is necessary to understand these unconscious biases so that we can help these students at an early stage with more personalized intervention. In this paper, we develop a framework, i.e., MAYA (Multi-mAjor emploYment stAtus) to predict students’ employment status while considering biases. The framework consists of four major components. Firstly, we solve the heterogeneity of student courses by embedding academic performance into a unified space. Then, we apply a generative adversarial network (GAN) to overcome the class imbalance problem. Thirdly, we adopt Long Short-Term Memory (LSTM) with a novel dropout mechanism to comprehensively capture sequential information among semesters. Finally, we design a bias-based regularization to capture the job market biases. We conduct extensive experiments on a large-scale educational dataset and the results demonstrate the effectiveness of our prediction framework. Copyright © 2019, The Authors. All rights reserved.

关键词： Students

Secure Beamforming Design for MISO SWIPT Systems: An Indirectly Optimized Approach

学校读者我要写书评

暂无评论

Secure Beamforming Design for MISO SWIPT Systems: An Indirec...

2019 IEEE Global Communications Conference (GLOBECOM)

作者： Yao Yu Siyu Wang Shumei Liu Lei Guo Zhaolong Ning Shimin Gong Mohammad S. Obaidat School of Computer Science and Engineering Northeastern University Shenyang China Chongqing University of Posts and Telecommunications China State Key Laboratory for Novel Software Technology Nanjing University China School of Intelligent Systems Engineering Sun Yat-sen University China ECE Department Nazarbayev University Astana Kazakhstan College of Computing and Informatics University of Sharjah UAE The King Abdullah II School of Information Technology The University of Jordan Amman Jordan University of Science and Technology Beijing China

ISBN: (数字)9781728109626

ISBN: (纸本)9781728109633

By considering the Simultaneous Wireless information and Power Transfer (SWIPT) schemes, this paper focuses on secure transmission model design in multiple-input-single-output (MISO) channels. In these channels, the channel state information is assumed to be perfect. Our objective is to maximize the worst-case secrecy rate with respect to both potential eavesdroppers and obvious eavesdroppers under the constraints of energy-harvesting and total transmission power. We present an optimization model to indirectly obtain maximum security rate in a single receiver system. Due to the high computational complexity of the solution process caused by the formulated non-convex optimization problem, we propose a novel indirect method to handle this issue. Then, a Semi-Definite Programming (SDP) relaxation method is used to approach the optimal solution. Moreover, we reveal the conditions for ensuring that the above semi-definite relaxation is compact. Simulation results demonstrate that the gained performance in our system is much better than those of the existing competing schemes.

关键词： Receivers Interference Signal to noise ratio Transmitters Optimization Security Communication system security

Fine-Grained User Profiling for Personalized Task Matching in Mobile Crowdsensing

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Yang, Shuo Zheng, Zhenzhe Tang, Shaojie Wu, Fan Chen, Guihai Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University China Department of Information Systems University of Texas Dallas United States

In mobile crowdsensing, finding the best match between tasks and users is crucial to ensure both the quality and effectiveness of a crowdsensing system. Existing works usually assume a centralized task assignment by the crowdsensing platform, without addressing the need of fine-grained personalized task matching. In this paper, we argue that it is essential to match tasks to users based on a careful characterization of both the users’ preference and reliability. To that end, we propose a personalized task recommender system for mobile crowdsensing, which recommends tasks to users based on a recommendation score that jointly takes each user’s preference and reliability into consideration. We first present a hybrid preference metric to characterize users’ preference by exploiting their implicit feedback. Then, to profile users’ reliability levels, we formalize the problem as a semi-supervised learning model, and propose an efficient block coordinate descent algorithm to solve the problem. For some tasks that lack users’ historical information, we further propose a matrix factorization method to infer the users’ reliability levels on those tasks. We conduct extensive experiments to evaluate the performance of our system, and the evaluation results demonstrate that our system can achieve superior performance to the benchmarks in both user profiling and personalized task recommendation. Copyright © 2018, The Authors. All rights reserved.

关键词： Recommender systems

Fog computing: Concept, Applications and Future

学校读者我要写书评

暂无评论

Fog Computing: Concept, Applications and Future

International Conference on Cloud computing, Big Data and Blockchain (ICCBB)

作者： Xianghan Zheng Wei Wu Chunming Rong Tao Zhang Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China Department of Computer Science and Electronic Engineering University of Stavanger Stavanger Norway College of Mathematics and Computer Science Fuzhou University Fuzhou China

ISBN: (纸本)9781728112787

Recently, both academia and industry have initiated research projects directed on fog computing. Fog computing is not composed of a powerful server, but by the relatively weak and scattered computers, processing appliances, factories, cars, street lamps and other equipment data. In this paper, we survey fog computing recently both in the academic and industrial research. We introduce it and consider case study that include In-vehicle Network, NextGen Manufacturing, Wireless sensor network, and technical challenges. Our survey is based on recent research publications..

关键词： cloud computing Cloud computing street light industrial research research project OTHER EQUIPMENT

Brief Investigation on Square Root of a Node of <i>T</i><sub>3</sub>Tree

学校读者我要写书评

暂无评论

Advances in Pure Mathematics 2018年第7期8卷 666-671页

作者： Guihong Chen Jianhui Li Department of Computer Science and Technology Neusoft Institute Guangdong Foshan China School of Electronics and Information Technology Sun Yat-sen University Guangzhou China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China

The article investigates some properties of square root of T3 tree’s nodes. It first proves several inequalities that are helpful to estimate the square root of a node, and then proves several theorems to describe th... 详细信息

关键词： Square Root Node Valuated Binary Tree Inequality

Android library for recognition of activities of daily living: Implementation considerations, challenges, and solutions

学校读者我要写书评

暂无评论

Open Bioinformatics Journal 2018年第1期11卷 61-88页

作者： Pires, Ivan Miguel Teixeira, Maria Canavarro Pombo, Nuno Garcia, Nuno M. Flórez-Revuelta, Francisco Spinsante, Susanna Goleva, Rossitza Zdravevski, Eftim Instituto de Telecomunicações Universidade da Beira Interior Covilhã Portugal Altran portugal Lisbon Portugal ALLab - Assisted Living Computing and Telecommunications Laboratory Computing Science Department Universidade da Beira Interior Covilhã Portugal UTC de Recursos Naturais e Desenvolvimento Sustentável Polytechnique Institute of Castelo Branco Castelo Branco Portugal CERNAS - Research Centre for Natural Resources Environment and Society Polytechnique Institute of Castelo Branco Castelo Branco Portugal Department of Computer Technology Universidad de Alicante Alicante Spain Department of Information Engineering Marche Polytechnic University Ancona Italy Department of Informatics New Bulgarian University Sofia Bulgaria Faculty of Computer Science and Engineering University Ss Cyril and Methodius Skopje North Macedonia

Background: Off-the-shelf-mobile devices have several sensors available onboard that may be used for the recognition of Activities of Daily Living (ADL) and the environments where they are performed. This research is focused on the development of Ambient Assisted Living (AAL) systems, using mobile devices for the acquisition of the different types of data related to the physical and physiological conditions of the subjects and the environments. Mobile devices with the Android Operating Systems are the least expensive and exhibit the biggest market while providing a variety of models and onboard sensors. Objective: This paper describes the implementation considerations, challenges and solutions about a framework for the recognition of ADL and the environments, provided as an Android library. The framework is a function of the number of sensors available in different mobile devices and utilizes a variety of activity recognition algorithms to provide a rapid feedback to the user. Methods: The Android library includes data fusion, data processing, features engineering and classification methods. The sensors that may be used are the accelerometer, the gyroscope, the magnetometer, the Global Positioning System (GPS) receiver and the microphone. The data processing includes the application of data cleaning methods and the extraction of features, which are used with Deep Neural Networks (DNN) for the classification of ADL and environment. Throughout this work, the limitations of the mobile devices were explored and their effects have been minimized. Results: The implementation of the Android library reported an overall accuracy between 58.02% and 89.15%, depending on the number of sensors used and the number of ADL and environments recognized. Compared with the results available in the literature, the performance of the library reported a mean improvement of 2.93%, and they do not differ at the maximum found in prior work, that based on the Student’s t-test. Conclusion: Thi

关键词： Activities of daily living Android library Artificial neural networks Data fusion Mobile devices Pattern recognition Recognition Sensors

The effect of non-Markovian recovery on reversible failure propagation on networks

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Lin, Zhaohua Feng, Mi Tang, Ming Liu, Zonghua Hui, Pak Ming Lai, Ying-Cheng Department of Physics East China Normal University Shanghai200062 China School of Information Science Technology East China Normal University Shanghai200241 China Web Sciences Center University of Electronic Science and Technology of China Chengdu611731 China Big Data Research Center University of Electronic Science and Technology of China Chengdu611731 China Shanghai Key Laboratory of Multidimensional Information Processing East China Normal University Shanghai200241 China Department of Physics Chinese University of Hong Kong Shatin Hong Kong School of Electrical Computer and Energy Engineering Arizona State University TempeAZ85287 United States

Compared with the classical irreversible failure propagation, the spontaneous recovery model can better depict the failure propagation on network systems such as financial and transportation networks. In this paper, we study how the non-Markovian recovery process influences cascading failure dynamics in the spontaneous recovery systems. To this end, we compare two kinds of failure-recovery models: the non-Markovian recovery (NMR) model and the corresponding Markovian recovery (MR) model. We first develop a Pairwise approximation theory for the MR and NMR models, which can predict the time evolution, steady state, and hysteresis behaviour of failure-recovery systems more accurately than the classical mean-field (MF) method. We find that although the non-Markovian recovery mechanism does not essentially affect the steady state and hysteresis behaviour of failure-recovery systems, the two models exhibit distinct evolution processes. When investigating the effect of initial conditions on the phase transition and hysteresis behavior, we find in the hysteresis region, the NMR model exhibits a non-monotonic growth characteristic: with the increase of initial failed nodes, the steady state staying in relative low-failure phase first turns into relative high-failure phase, and then into relative low-failure phase again. We then use the MF theory to explain the phenomenon qualitatively and point out when considering non-Markovian dynamics, we should study the steady state not only from the perspective of the variation of parameters, but also from the initial conditions. Copyright © 2019, The Authors. All rights reserved.

关键词： Hysteresis

An Algorithm for Describing the Convex and Concave Shape of Protein Surface

学校读者我要写书评

暂无评论

An Algorithm for Describing the Convex and Concave Shape of ...

2018国际计算机前沿大会（原国际青年计算机大会）

作者： Wei Wang Keliang Li Hehe Lv Lin Sun Hongjun Zhang Jinling Shi Shiguang Zhang Yun Zhou Yuan Zhao Jingjing Xv Department of Computer Science and Technology College of Computer and Information Engineering Henan Normal University Laboratory of Computation Intelligence and Information Processing Engineering Technology Research Center for Computing Intelligence and Data Mining School of Aviation Engineering Anyang University School of International Education Xuchang University

Protein surface plays a key role in many biological *** proteins participate in the life activities of cells via binding to other proteins or ligand molecules. It is an important work to study protein structure and function by analyzing the protein surface shape. Based on the CX algorithm and the 2 D fngerprint-base method, we proposed a FCX method to identify the morphology of bulges and depressions on the protein surface. The experimental results show that the FCX algorithm has a more desirable outcome than CX algorithm. The FCX algorithm has a higher correlation with the convex and concave features than CX values with solvent accessibility, solvent accessibility, and Bfactor's Pearson correlation coefficient. This result shows that the FCX algorithm can describe the shape of the protein surface residues more accurately than the CX algorithm.

关键词：

QU-BraTS: MICCAI BraTS 2020 Challenge on Quantifying Uncertainty in Brain Tumor Segmentation - Analysis of Ranking Scores and Benchmarking Results

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Mehta, Raghav Filos, Angelos Baid, Ujjwal Sako, Chiharu McKinley, Richard Rebsamen, Michael Dätwyler, Katrin Meier, Raphael Radojewski, Piotr Murugesan, Gowtham Krishnan Nalawade, Sahil Ganesh, Chandan Wagner, Ben Yu, Fang F. Fei, Baowei Madhuranthakam, Ananth J. Maldjian, Joseph A. Daza, Laura Gómez, Catalina Arbeláez, Pablo Dai, Chengliang Wang, Shuo Reynaud, Hadrien Mo, Yuanhan Angelini, Elsa Guo, Yike Bai, Wenjia Banerjee, Subhashis Pei, Linmin Murat, A.K. Rosas-González, Sarahi Zemmoura, Ilyess Tauber, Clovis Vu, Minh H. Nyholm, Tufve Löfstedt, Tommy Ballestar, Laura Mora Vilaplana, Veronica McHugh, Hugh Talou, Gonzalo Maso Wang, Alan Patel, Jay Chang, Ken Hoebel, Katharina Gidwani, Mishka Arun, Nishanth Gupta, Sharut Aggarwal, Mehak Singh, Praveer Gerstner, Elizabeth R. Kalpathy-Cramer, Jayashree Boutry, Nicolas Huard, Alexis Vidyaratne, Lasitha Rahman, Md Monibor Iftekharuddin, Khan M. Chazalon, Joseph Puybareau, Elodie Tochon, Guillaume Ma, Jun Cabezas, Mariano Llado, Xavier Oliver, Arnau Valencia, Liliana Valverde, Sergi Amian, Mehdi Soltaninejad, Mohammadreza Myronenko, Andriy Hatamizadeh, Ali Feng, Xue Dou, Quan Tustison, Nicholas Meyer, Craig Shah, Nisarg A. Talbar, Sanjay weber, Marc-André Mahajan, Abhishek Jakab, Andras Wiest, Roland Fathallah-Shaykh, Hassan M. Nazeri, Arash Milchenko, Mikhail Marcus, Daniel Kotrotsou, Aikaterini Colen, Rivka Freymann, John Kirby, Justin Davatzikos, Christos Menze, Bjoern Bakas, Spyridon Gal, Yarin Arbel, Tal McGill University MontrealQC Canada Group University of Oxford Oxford United Kingdom University of Pennsylvania PhiladelphiaPA United States Department of Radiology Perelman School of Medicine The University of Pennsylvania PhiladelphiaPA United States Department of Pathology and Laboratory Medicine Perelman School of Medicine University of Pennsylvania PhiladelphiaPA United States University Institute of Diagnostic and Interventional Neuroradiology University of Bern Inselspital Bern University Hospital Bern Switzerland Department of Radiology University of Texas Southwestern Medical Center DallasTX United States Department of Bioengineering University of Texas DallasTX United States Advanced Imaging Research Center University of Texas Southwestern Medical Center DallasTX United States Universidad de los Andes Bogotá Colombia Data Science Institute Imperial College London London United Kingdom NIHR Imperial BRC ITMAT Data Science Group Imperial College London London United Kingdom Department of Brain Sciences Imperial College London London United Kingdom Machine Intelligence Unit Indian Statistical Institute Kolkata India Department of CSE University of Calcutta Kolkata India Department of Information Technology Uppsala University Uppsala Sweden Department of Diagnostic Radiology The University of Pittsburgh Medical Center PittsburghPA United States UMR U1253 iBrain Université de Tours Inserm Tours France Department of Radiation Sciences Umeå University Umeå Sweden Department of Computing Science Umeå University Umeå Sweden Signal Theory and Communications Department Universitat Politècnica de Catalunya Barcelona Tech Barcelona Spain Faculty of Medical and Health Sciences University of Auckland Auckland New Zealand Radiology Department Auckland City Hospital Auckland New Zealand Auckland Bioengineering Institute University of Auckland New Zealand Athinoula A. Martinos Center for Biomedical Imaging Department of Radiology

Deep learning (DL) models have provided state-of-the-art performance in various medical imaging benchmarking challenges, including the Brain Tumor Segmentation (BraTS) challenges. However, the task of focal pathology multi-compartment segmentation (e.g., tumor and lesion sub-regions) is particularly challenging, and potential errors hinder translating DL models into clinical workflows. Quantifying the reliability of DL model predictions in the form of uncertainties could enable clinical review of the most uncertain regions, thereby building trust and paving the way toward clinical translation. Several uncertainty estimation methods have recently been introduced for DL medical image segmentation tasks. Developing scores to evaluate and compare the performance of uncertainty measures will assist the end-user in making more informed decisions. In this study, we explore and evaluate a score developed during the BraTS 2019 and BraTS 2020 task on uncertainty quantification (QU-BraTS) and designed to assess and rank uncertainty estimates for brain tumor multi-compartment segmentation. This score (1) rewards uncertainty estimates that produce high confidence in correct assertions and those that assign low confidence levels at incorrect assertions, and (2) penalizes uncertainty measures that lead to a higher percentage of under-confident correct assertions. We further benchmark the segmentation uncertainties generated by 14 independent participating teams of QU-BraTS 2020, all of which also participated in the main BraTS segmentation task. Overall, our findings confirm the importance and complementary value that uncertainty estimates provide to segmentation algorithms, highlighting the need for uncertainty quantification in medical image analyses. Finally, in favor of transparency and reproducibility, our evaluation code is made publicly available at https://***/RagMeh11/QU-BraTS. © 2021, CC BY.

关键词： Benchmarking