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

arXiv 2025年

作者： Littauer, Richard Wilson, Greg Ainali, Jan AlOmar, Eman Abdullah Arabas, Sylwester Saibene, Yanina Bellini Bubendorfer, Kris Champion, Kaylea Dillon, Clare Helske, Jouni Huybrechts, Pieter Katz, Daniel S. Liao, Chang Lippert, David Liu, Fang Marshall, Pierre McCloy, Daniel R. McInerney, Ian Mkaouer, Mohamed Wiem Ojha, Priyanka Treude, Christoph White, Ethan P. CURIOSS SustainOSS GNOME Foundation Te Herenga Waka Victoria University of Wellington Te Whanganui-a-Tara Aotearoa Wellington New Zealand Third Bit TorontoON Canada Open By Default Italy Department of Systems and Enterprises Stevens Institute of Technology HobokenNJ United States AGH University of Krakow Poland rOpenSci LP Santa Rosa Argentina Te Herenga Waka Victoria University of Wellington Wellington New Zealand Computing and Software Systems University of Washington Bothell BothellWA United States CURIOSS Lero University of Galway Ireland INVEST Research Flagship Centre University of Turku Finland Brussels Belgium University of Illinois Urbana-ChampaignIL United States Pacific Northwest National Laboratory RichlandWA United States Open Source Program Office George Washington University WashingtonDC United States Georgia Institute of Technology GA United States Oxford University United Kingdom Institute for Learning & Brain Sciences University of Washington SeattleWA United States Department of Mechanical Engineering Imperial College London London United Kingdom Department of Computer Science University of Michigan-Flint FlintMI United States Singapore Management University Singapore Department of Wildlife Ecology and Conservation University of Florida GainesvilleFL United States

Loss of key personnel has always been a risk for research software projects. Key members of the team may have to step away due to illness or burnout, to care for a family member, from a loss of financial support, or because their career is going in a new direction. Today, though, political and financial changes are putting large numbers of researchers out of work simultaneously, potentially leaving large amounts of research software abandoned. This article presents ten tips to help researchers ensure that the software they have built will continue to be usable after they have left their present job—whether in the course of voluntary career moves or researcher mobility, but particularly in cases of involuntary departure due to political or institutional changes. © 2025, CC BY-SA.

关键词： Human engineering

来源：评论

学校读者我要写书评

暂无评论

Simultaneous spectral-spatial feature selection and extraction for hyperspectral images

arXiv

引用

arXiv 2019年

作者： Zhang, Lefei Zhang, Qian Du, Bo Huang, Xin Tang, Yuan Yan Tao, Dacheng State Key Laboratory of Software Engineering School of Computer Wuhan University Wuhan430072 China Beijing Samsung Telecom R&D Center Beijing100028 China School of Remote Sensing and Information Engineering Wuhan University Wuhan430072 China Department of Computer and Information Science University of Macau Macau999078 China Centre for Quantum Computation and Intelligent Systems Faculty of Engineering and Information Technology University of Technology SydneyNSW2007 Australia

In hyperspectral remote sensing data mining, it is important to take into account of both spectral and spatial information, such as the spectral signature, texture feature and morphological property, to improve the performances, e.g., the image classification accuracy. In a feature representation point of view, a nature approach to handle this situation is to concatenate the spectral and spatial features into a single but high dimensional vector and then apply a certain dimension reduction technique directly on that concatenated vector before feed it into the subsequent classifier. However, multiple features from various domains definitely have different physical meanings and statistical properties, and thus such concatenation hasn't efficiently explore the complementary properties among different features, which should benefit for boost the feature discriminability. Furthermore, it is also difficult to interpret the transformed results of the concatenated vector. Consequently, finding a physically meaningful consensus low dimensional feature representation of original multiple features is still a challenging task. In order to address the these issues, we propose a novel feature learning framework, i.e., the simultaneous spectral-spatial feature selection and extraction algorithm, for hyperspectral images spectralspatial feature representation and classification. Specifically, the proposed method learns a latent low dimensional subspace by projecting the spectral-spatial feature into a common feature space, where the complementary information has been effectively exploited, and simultaneously, only the most significant original features have been transformed. Encouraging experimental results on three public available hyperspectral remote sensing datasets confirm that our proposed method is effective and efficient. Copyright © 2019, The Authors. All rights reserved.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Cloud workload prediction based on workflow execution time discrepancies

arXiv

引用

arXiv 2018年

作者： Kecskemeti, Gabor Nemeth, Zsolt Kertesz, Attila Ranjan, Rajiv Department of Computer Science Liverpool John Moores University Laboratory of Parallel and Distributed Systems MTA SZTAKI Software Engineering Department University of Szeged School of Computing Newcastle University

Infrastructure as a service clouds hide the complexity of maintaining the physical infrastructure with a slight disadvantage: they also hide their internal working details. Should users need knowledge about these details e.g., to increase the reliability or performance of their applications, they would need solutions to detect behavioural changes in the underlying system. Existing runtime solutions for such purposes offer limited capabilities as they are mostly restricted to revealing weekly or yearly behavioural periodicity in the infrastructure. This article proposes a technique for predicting generic background workload by means of simulations that are capable of providing additional knowledge of the underlying private cloud systems in order to support activities like cloud orchestration or workflow enactment. Our technique uses long-running scientific workflows and their behaviour discrepancies and tries to replicate these in a simulated cloud with known (trace-based) workloads. We argue that the better we can mimic the current discrepancies the better we can tell expected workloads in the near future on the real life cloud. We evaluated the proposed prediction approach with a biochemical application on both real and simulated cloud infrastructures. The proposed algorithm has shown to produce significantly (∼20%) better workload predictions for the future of simulated clouds than random workload selection. Copyright © 2018, The Authors. All rights reserved.

关键词： Infrastructure as a service (IaaS)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A fine-grained data set and analysis of tangling in bug fixing commits

arXiv

引用

arXiv 2020年

作者： Herbold, Steffen Trautsch, Alexander Ledel, Benjamin Aghamohammadi, Alireza Ghaleb, Taher Ahmed Chahal, Kuljit Kaur Bossenmaier, Tim Nagaria, Bhaveet Makedonski, Philip Ahmadabadi, Matin Nili Szabados, Kristof Spieker, Helge Madeja, Matej Hoy, Nathaniel G. Lenarduzzi, Valentina Wang, Shangwen Rodríguez-Pérez, Gema Colomo-Palacios, Ricardo Verdecchia, Roberto Singh, Paramvir Qin, Yihao Chakroborti, Debasish Davis, Willard Walunj, Vijay Wu, Hongjun Marcilio, Diego Alam, Omar Aldaeej, Abdullah Amit, Idan Turhan, Burak Eismann, Simon Wickert, Anna-Katharina Malavolta, Ivano Sulír, Matúš Fard, Fatemeh Henley, Austin Z. Kourtzanidis, Stratos Tuzun, Eray Treude, Christoph Shamasbi, Simin Maleki Pashchenko, Ivan Wyrich, Marvin Davis, James C. Serebrenik, Alexander Albrecht, Ella Aktas, Ethem Utku Strüber, Daniel Erbel, Johannes Institute for Software and Systems Engineering TU Clausthal Clausthal-Zellefeld Germany Institute of Computer Science University of Goettingen Goettingen Germany Department of Computer Engineering Sharif University of Technology Tehran Iran School of Computing Queen's University Kingston Canada Department of Computer Science Guru Nanak Dev University Amritsar India Karlsruhe Germany Brunel University London Uxbridge United Kingdom Institute of Computer Science University of Goettingen Germany University of Tehran Tehran Iran Ericsson Hungary Ltd. Budapest Hungary Simula Research Laboratory Fornebu Norway Technical University of Košice Košice Slovakia LUT University Finland National University of Defense Technology Changsha China University of British Columbia Kelowna Canada Østfold University College Halden Norway Vrije Universiteit Amsterdam Amsterdam Netherlands University of Auckland Auckland New Zealand University of Saskatchewan Saskatoon Canada IBM Boulder United States University of Missouri-Kansas City Kansas City United States Università della Svizzera italiana Lugano Switzerland Trent University Peterborough Canada University of Maryland Baltimore County United States Imam Abdulrahman Bin Faisal University Saudi Arabia The Hebrew University Acumen Jerusalem Israel University of Oulu Oulu Finland Monash University Melbourne Australia University of Würzburg Würzburg Germany Technische Universität Darmstadt Darmstadt Germany University of Tennessee Knoxville United States University of Macedonia Thessaloniki Greece Department of Computer Engineering Bilkent University Ankara Turkey University of Melbourne Melbourne Australia Independent Researcher Tehran Iran University of Trento Trento Italy University of Stuttgart Stuttgart Germany Purdue University West LafayetteIN United States Eindhoven University of Technology Eindhoven Netherlands Softtech Inc. Research and Development Center Istanbul34947 Turkey Radboud Universi

Context: Tangled commits are changes to software that address multiple concerns at once. For researchers interested in bugs, tangled commits mean that they actually study not only bugs, but also other concerns irrelevant for the study of bugs. Objective: We want to improve our understanding of the prevalence of tangling and the types of changes that are tangled within bug fixing commits. Methods: We use a crowd sourcing approach for manual labeling to validate which changes contribute to bug fixes for each line in bug fixing commits. Each line is labeled by four participants. If at least three participants agree on the same label, we have consensus. Results: We estimate that between 17% and 32% of all changes in bug fixing commits modify the source code to fix the underlying problem. However, when we only consider changes to the production code files this ratio increases to 66% to 87%. We find that about 11% of lines are hard to label leading to active disagreements between participants. Due to confirmed tangling and the uncertainty in our data, we estimate that 3% to 47% of data is noisy without manual untangling, depending on the use case. Conclusion: Tangled commits have a high prevalence in bug fixes and can lead to a large amount of noise in the data. Prior research indicates that this noise may alter results. As researchers, we should be skeptics and assume that unvalidated data is likely very noisy, until proven otherwise. Copyright © 2020, The Authors. All rights reserved.

关键词： Uncertainty analysis

来源：评论

学校读者我要写书评

暂无评论

Reverse Furthest Neighbors Query in Road Networks

引用

Journal of computer science & Technology 2017年第1期32卷 155-167页

作者： Xiao-Jun Xu Jin-Song Bao Bin Yao Jing-Yu Zhou Fei-Long Tang Min-Yi Guo Jian-Qiu Xu School of Software Beijing Institute of Technology Beijing 100081 China First Research Institute of Ministry of Public Security Beijing 100048 China College of Mechanical Engineering Donghua University Shanghai 200051 China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai 200240 China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing 210016 China

Given a road network G = （V, E）, where V（E） denotes the set of vertices（edges） in G, a set of points of interest P and a query point q residing in G, the reverse furthest neighbors （RFNR） query in road networks fetches a set of points p ∈ P that take q as their furthest neighbor compared with all points in P ∪ {q}. This is the monochromatic RFNR （MRFNR） query. Another interesting version of RFNR query is the bichromatic reverse furthest neighbor （BRFNR） query. Given two sets of points P and Q, and a query point q ∈ Q, a BRFNR query fetches a set of points p ∈ P that take q as their furthest neighbor compared with all points in Q. This paper presents efficient algorithms for both MRFNR and BRFNR queries, which utilize landmarks and partitioning-based techniques. Experiments on real datasets confirm the efficiency and scalability of proposed algorithms.

关键词： reverse furthest neighbor road network landmark hierarchical partition

来源：评论

学校读者我要写书评

暂无评论

A Direct Proof of Improved Biased Random Walk with Gastric Cancer Dataset

A Direct Proof of Improved Biased Random Walk with Gastric C...

引用

International Conference on Applied Mathematics & computer science

作者： Choon Sen Seah Shahreen Kasim Mohd Farhan Md Fudzee Mohd Saberi Mohamad Rd Rohmat Saedudin Deden Witarsyah Rohayanti Hassan Mohd Arfian Ismail Rodziah Atan Soft Computing and Data Mining Centre Faculty of Computer Sciences and Information Technology Universiti Tun Hussein Onn Malaysia Faculty of Creative Technology and Heritage Universiti Malaysia Kelantan School of Industrial Engineering Telkom University Laboratory of Biodiversity and Bioinformatics Universiti Teknologi Malaysia Faculty of Computer Systems and Software Engineering Universiti Malaysia Pahang Department of Software Engineering & Information System Faculty of Computer Science and Information Technology University Putra Malaysia (UPM)

ISBN: (数字)9781728132587

ISBN: (纸本)9781728132594

The relationship between the weight of a single genes and the connection between the genes had been studied. Chemistry and physical sciences have proved the attraction between molecules. Molecules are attracted to each other by bond. This paper is presented to disclose the relationship between weight and connectivity of nodes with biased random walk. An equation of biased random walk which named as significant directed random walk is formed to enhance the connectivity of nodes in directed graph via weigh. To be completely biased to the random walk, references data is implement as directed graph. Weight of genes will be used as one of the parameter in the formula. While the adjacency matrix is further enhanced by Warshall's algorithm to increases the accessibility of nodes via vector. The evolution of random walk is disclosed in this paper as well. Significant directed random walk will be used to prove the importance of weight in this paper. Comparison of the result between biased random walk is presented to prove the enhancement of random walk.

关键词： Biased random walk Cancer classification Gene expression dataset Random walk cancer classification Biased Ganglia one-parameter Mentoring Physical science

来源：评论

学校读者我要写书评

暂无评论

Multi-view hybrid embedding: A divide-and-conquer approach

arXiv

引用

arXiv 2018年

作者： Xu, Jiamiao Yu, Shujian You, Xinge Leng, Mengjun Jing, Xiao-Yuan Chen, C. L. Philip School of Electronic Information and Communications Huazhong University of Science and Technology Wuhan430074 China Department of Electrical and Computer Engineering University of Florida GainesvilleFL32611 United States Department of Computer Science University of Houston HoustonTX77204 United States State Key Laboratory of Software Engineering School of Computer Wuhan University China Department of Computer and Information Science Faculty of Science and Technology University of Macau Macau99999 China Dalian Maritime University Dalian116026 China State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100080 China

We present a novel cross-view classification algorithm where the gallery and probe data come from different views. A popular approach to tackle this problem is the multiview subspace learning (MvSL) that aims to learn a latent subspace shared by multi-view data. Despite promising results obtained on some applications, the performance of existing methods deteriorates dramatically when the multi-view data is sampled from nonlinear manifolds or suffers from heavy outliers. To circumvent this drawback, motivated by the Divideand-Conquer strategy, we propose Multi-view Hybrid Embedding (MvHE), a unique method of dividing the problem of cross-view classification into three subproblems and building one model for each subproblem. Specifically, the first model is designed to remove view discrepancy, whereas the second and third models attempt to discover the intrinsic nonlinear structure and to increase discriminability in intra-view and interview samples respectively. The kernel extension is conducted to further boost the representation power of MvHE. Extensive experiments are conducted on four benchmark datasets. Our methods demonstrate overwhelming advantages against the stateof-the-art MvSL based cross-view classification approaches in terms of classification accuracy and robustness. Copyright © 2018, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Guest Editorial Special Issue on Security and Privacy in Cyber-Physical systems

引用

IEEE Internet of Things Journal 2017年第6期4卷 1798-1800页

作者： Yu, Wei Fu, Xinwen Song, Houbing Economides, Anastasios A. Jo, Minho Zhao, Wei Department of Computer and Information Sciences Towson University TowsonMD21252 United States Department of Computer Science University of Central Florida OrlandoFL32816 United States Department of Electrical Computer Software and Systems Engineering Embry-Riddle Aeronautical University Daytona BeachFL32114 United States Computer Networks and Telematic Applications Laboratory University of Macedonia Thessaloniki546 36 Greece Department of Computer Convergence Software Korea University Seoul Korea Republic of University of Macau China

A typical cyber-physical system (CPS) refers to a system that features a tight integration of computation, networking, and physical elements for interactions between cyber and physical spaces. The Internet of Things (IoT) is considered to be the networking infrastructure of CPS. Applications of CPS cover numerous smart-world research areas that our daily life depends upon, including smart transportation, smart electrical power grid, smart cities, smart medical systems, smart manufacturing systems, and others. While major research on improving the efficiency and reliability of CPS by using advanced information and communication technologies has been conducted, the risks of cyberspace security and privacy breaches in CPS need to be seriously investigated before a massive deployment of CPS technologies can or should be realized.

关键词： Special issues and sections Cyber-physical systems Smart cities Smart grids Manufacturing processes

来源：评论

学校读者我要写书评

暂无评论

Multi-classification of Parkinson's Disease via Sparse Low-Rank Learning

Multi-classification of Parkinson's Disease via Sparse Low-R...

引用

International Conference on Pattern Recognition

作者： Haijun Lei Yujia Zhao Zhongwei Huang Feng Zhou Limin Huang Baiying Lei College of Computer Science & Software Engineering Guangdong Province Key Laboratory of Popular High-Performance Computers Shenzhen China Department of Industrial and Manufacturing Systems Engineering University of Michigan Dearborn Michigan USA The Operations Center of Shenzhen People's Hospital Shenzhen China School of Biomedical Engineering Guangdong Key Laboratory for Biomedical Measurements and Ultrasound Imaging Shenzhen China

Neuroimaging techniques have been widely applied to various neurodegenerative disease analysis to reveal the intricate brain structure. The high dimensional neuroimaging features and limited sample size are the main challenges for the diagnosis task due to the unbalanced input data. To handle it, a sparse low-rank learning framework is proposed, which unveils the underlying relationships between input data and output targets by building a matrix-regularized feature network. Then we obtain the feature weight from the network based on local clustering coefficients. By discarding the irrelevant features and preserving the discriminative structured features, our proposed method can select the most relevant features and identify different stages of Parkinson's disease (PD) from normal controls. Extensive experimental results evaluated on the Parkinson's progression markers initiative (PPMI) dataset demonstrate that the proposed method achieves promising classification performance and outperforms the conventional algorithms. Furthermore, it can detect potential brain regions related to PD for future medical analysis.

关键词： Sparse matrices Feature extraction Diseases Neuroimaging Diffusion tensor imaging Support vector machines

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：