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

Improving unsupervised domain adaptation by reducing bi-level feature redundancy

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Wang, Mengzhu Zhang, Xiang Lan, Long Wang, Wei Tan, Huibin Luo, Zhigang Science and Technology on Parallel and Distributed Laboratory College of Computer National University of Defense Technology Changsha China Institute for Quantum State Key Laboratory of High Performance Computing National University of Defense Technology Changsha China DUT-RU International School of Information Science & Engineering Dalian University of Technology DalianLiaoning116000 China Department of Science and Technology on Parallel and Distributed Processing National University of Defense Technology Changsha China

Reducing feature redundancy has shown beneficial effects for improving the accuracy of deep learning models, thus it is also indispensable for the models of unsupervised domain adaptation (UDA). Nevertheless, most recent efforts in the field of UDA ignore this point. Moreover, main schemes realizing this in general independent of UDA purely involve a single domain, thus might not be effective for cross-domain tasks. In this paper, we emphasize the significance of reducing feature redundancy for improving UDA in a bi-level way. For the first level, we try to ensure compact domain-specific features with a transferable decorrelated normalization module, which preserves specific domain information whilst easing the side effect of feature redundancy on the sequel domain-invariance. In the second level, domain-invariant feature redundancy caused by domain-shared representation is further mitigated via an alternative brand orthogonality for better generalization. These two novel aspects can be easily plugged into any BN-based backbone neural networks. Specifically, simply applying them to ResNet50 has achieved competitive performance to the state-of-the-arts on five popular benchmarks. Our code will be available at https://***/dreamkily/gUDA. © 2020, CC BY.

关键词： Deep learning

An automatic computer-aided detection system for meniscal tears on magnetic resonance images

学校读者我要写书评

暂无评论

IEEE Transactions on Medical Imaging 2009年第8期28卷 1308-1316页

作者： Ramakrishna, Bharath Liu, Weimin Saiprasad, Ganesh Safdar, Nabile Chang, Chein-I Siddiqui, Khan Kim, W. Siegel, Eliot Chai, Jyh-Wen Chen, Clayton Chi-Chang Lee, San-Kan Remote Sensing Signal and Image Processing Laboratory Department of Computer Science and Electrical Engineering University of Maryland Baltimore MD 21250 United States University of Maryland School of Medicine Baltimore MD 21201 United States Department of Electrical Engineering and Environmental Restoration Disaster Reduction Research Center National Chung Hsing University Taichung 402 Taiwan VA Maryland Health Care System Baltimore MD 21201 United States Hospital of the University of Pennsylvania Philadelphia PA 19104 United States Department of Radiology College of Medicine China Medical University Taichung 404 Taiwan Department of Radiology Taichung Veterans General Hospital Taichung 40705 Taiwan Department of Radiological Technology Central Taiwan University of Science and Technology Taichung 406 Taiwan Department of Radiology Taichung Veterans General Hospital Taichung 407 Taiwan

Knee-related injuries including meniscal tears are common in both young athletes and the aging population, and require accurate diagnosis and surgical intervention when appropriate. With proper techniques and radiologists' experienced skills, confidence in detection of meniscal tears can be quite high. This paper develops a novel computer-aided detection (CAD) diagnostic system for automatic detection of meniscal tears in the knee. Evaluation of this CAD system using an archived database of images from 40 individuals with suspected knee injuries indicates that the sensitivity and specificity of the proposed CAD system are 83.87% and 75.19%, respectively, compared to the mean sensitivity and specificity of 77.41% and 81.39%, respectively, obtained by experienced radiologists in routine diagnosis without using the CAD. The experimental results suggest that the developed CAD system has great potential and promise in automatic detection of both simple and complex meniscal tears of the knee. © 2009 IEEE.

关键词： Magnetic resonance imaging

Trace Bench: An Open Data Set for Trace-Oriented Monitoring

学校读者我要写书评

暂无评论

Trace Bench: An Open Data Set for Trace-Oriented Monitoring

IEEE International Conference on Cloud Computing Technology and science (CloudCom)

作者： Jingwen Zhou Zhenbang Chen Ji Wang Zibin Zheng Michael R. Lyu College of Computer National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China Shenzhen Research Institute The Chinese University of Hong Kong Shenzhen China Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong China

User request trace-oriented monitoring is an effective method to improve the reliability of cloud systems. However, there are some difficulties in getting traces in practice, which hinder the development of trace-oriented monitoring research. In this paper, we release a fine-grained user request-centric open trace data set, called Trace Bench, collected on a real world cloud storage system deployed in a real environment. During collecting, many aspects are considered to simulate different scenarios, including cluster size, request type, workload speed, etc. Besides recording the traces when the monitored system is running normally, we also collect the traces under the situation with faults injected. With a mature injection tool, 14 faults are introduced, including function faults and performance faults. The traces in Trace Bench are clustered in different files, where each file corresponds to a certain scenario. The whole collection work lasted for more than half a year, resulting in more than 360, 000 traces in 361 files. In addition, we also employ several applications based on Trace Bench, which validate the helpfulness of Trace Bench for the field of trace-oriented monitoring.

关键词： Monitoring Servers Educational institutions Instruments Cloud computing Context Fault diagnosis

Recent Advance in Content-based Image Retrieval: A literature survey

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Zhou, Wengang Li, Houqiang Fellow, Tian I.E.E.E. CAS Key Laboratory of Technology in Geo-spatial Information Processing and Application System Department of Electronic Engineering and Information Science University of Science and Technology of China Hefei230027 China Department of Computer Science University of Texas San Antonio San AntonioTX78249 United States

—The explosive increase and ubiquitous accessibility of visual data on the Web have led to the prosperity of research activity in image search or retrieval. With the ignorance of visual content as a ranking clue, methods with text search techniques for visual retrieval may suffer inconsistency between the text words and visual content. Content-based image retrieval (CBIR), which makes use of the representation of visual content to identify relevant images, has attracted sustained attention in recent two decades. Such a problem is challenging due to the intention gap and the semantic gap problems. Numerous techniques have been developed for content-based image retrieval in the last decade. The purpose of this paper is to categorize and evaluate those algorithms proposed during the period of 2003 to 2016. We conclude with several promising directions for future research. Copyright © 2017, The Authors. All rights reserved.

关键词： Content based retrieval

Isoform Function Prediction Based on Heterogeneous Graph Attention Networks

学校读者我要写书评

暂无评论

Isoform Function Prediction Based on Heterogeneous Graph Att...

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Kuo Guo Yifan Li Hao Chen Hong-Bin Shen Yang Yang Department of Computer Science and Engineering Shanghai Jiao Tong University and Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University and Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Computational Biology Department School of Computer Science Carnegie Mellon University Pittsburgh PA USA

Isoforms refer to different mRNA molecules transcribed from the same gene, which can be translated into proteins with varying structures and functions. Predicting the functions of isoforms is an essential topic in bioinformatics as it can provide valuable insights into the intricate mechanisms of gene regulation and biological processes. Conventionally, gene function labels are standardized in Gene Ontology (GO) terms. However, traditional methods for predicting isoform function are largely limited by the absence of isoform-specific labels, sparse annotations, and the vast number of GO terms. To address these issues, we propose HANIso, a deep learning-based method for isoform function prediction. HANIso leverages a pretrained protein language model to extract features from protein sequences. It also integrates heterogeneous information, such as isoform sequence features, GO annotations, and isoform interaction data, using a Heterogeneous Graph Attention Network (HAN). This allows the model to learn the importance of different sources of information and their semantic relationships through the attention mechanism. Our method can predict function labels at both the gene level and isoform level. We conduct experiments on two species datasets, and the results demonstrate that our method outperforms existing methods on both AUROC and AUPRC. HANIso has the potential to overcome the limitations of traditional methods and provide a more accurate and comprehensive understanding of isoform function.

关键词：

Signal Temporal Logic Control Synthesis among Uncontrollable Dynamic Agents with Conformal Prediction

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Yu, Xinyi Zhao, Yiqi Yin, Xiang Lindemann, Lars Thomas Lord Department of Computer Science University of Southern California Los AngelesCA90089 United States Department of Automation Key Laboratory of System Control and Information Processing Shanghai Jiao Tong University Shanghai200240 China

The control of dynamical systems under temporal logic specifications among uncontrollable dynamic agents is challenging due to the agents’ a-priori unknown behavior. Existing works have considered the problem where either all agents are controllable, the agent models are deterministic and known, or no safety guarantees are provided. We propose a predictive control synthesis framework that guarantees, with high probability, the satisfaction of signal temporal logic (STL) tasks that are defined over a controllable system in the presence of uncontrollable stochastic agents. We use trajectory predictors and conformal prediction to construct probabilistic prediction regions for each uncontrollable agent that are valid over multiple future time steps. Specifically, we construct a normalized prediction region over all agents and time steps to reduce conservatism and increase data efficiency. We then formulate a worst-case bilevel mixed integer program (MIP) that accounts for all agent realizations within the prediction region to obtain an open-loop controller that provably guarantee task satisfaction with high probability. To efficiently solve this bilevel MIP, we propose an equivalent MIP program based on KKT conditions of the original bilevel formulation. Building upon this, we design a closed-loop controller, where both recursive feasibility and task satisfaction can be guaranteed with high probability. We illustrate our control synthesis framework on two case studies. Copyright © 2023, The Authors. All rights reserved.

关键词： Stochastic systems

High Performance Distributed Control Law for Large-Scale Linear systems: A Partitioned Distributed Observer Approach

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Xu, Haotian Liu, Shuai Shi, Ling Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology Hong Kong

In recent years, the distributed-observer-based distributed control law has shown powerful ability to arbitrarily approximate the centralized control performance. However, the traditional distributed observer requires each local observer to reconstruct the state information of the whole system, which is unrealistic for large-scale scenarios. To fill this gap, this paper develops a greedy-idea-based large-scale system partition algorithm, which can significantly reduce the dimension of local observers. Then, the partitioned distributed observer for large-scale systems is proposed to overcome the problem that the system dynamics are difficult to estimate due to the coupling between partitions. Furthermore, the two-layer Lyapunov analysis method is adopted and the dynamic transformation lemma of compact errors is proved, which solves the problem of analyzing stability of the error dynamic of the partitioned distributed observer. Finally, it is proved that the distributed control law based on the partitioned distributed observer can also arbitrarily approximate the control performance of the centralized control law, and the dimension of the local observer is greatly reduced compared with the traditional method. The simulation results show that when the similarity between the physical network and the communication network is about 80%, the local observer dimension is greatly reduced by 90% and the relative error between the performance of the distributed control law and that of the centralized control law is less than 1%. © 2024, CC BY.

关键词： Continuous time systems

Abstraction-Based Synthesis of Controllers for Approximate Opacity

学校读者我要写书评

暂无评论

Abstraction-Based Synthesis of Controllers for Approximate O...

IEEE Conference on Decision and Control

作者： Junyao Hou Siyuan Liu Xiang Yin Majid Zamani Department of Automation Key Laboratory of System Control and Information Processing Shanghai Jiao Tong University Shanghai China Division of Decision and Control Systems KTH Royal Institute of Technology Stockholm Sweden Department of Computer Science University of Colorado Boulder CO USA Department of Computer Science LMU Munich Munich Germany

Opacity is an important information-flow security property which characterizes the plausible deniability of certain “secret behaviors” in dynamical systems. In this paper, we study the problem of synthesizing controllers enforcing a notion of opacity over discrete-time control systems with continuous state sets. In this paper, we develop an abstraction-based approach to tackle the controller synthesis problem. Specifically, we adopt a notion of approximate opacity which is suitable for continuous-space control systems. We propose a notion of approximate initial-state opacity preserving alternating simulation relation which characterizes the closeness between two systems in terms of opacity preservation. We show that, based on this new notion of system relation, one can synthesize an opacity-enforcing controller for the abstract system which is finite and then refine it back to enforce opacity over the original control system. Finally, we present a method for constructing opacity-preserving finite abstractions for discrete-time control systems under some stability properties. Our results are illustrated on a two-room temperature control problem.

关键词：

Efficient STL Control Synthesis under Asynchronous Temporal Robustness Constraints

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Yu, Xinyi Yin, Xiang Lindemann, Lars Department of Automation Key Laboratory of System Control and Information Processing Shanghai Jiao Tong University Shanghai200240 China Thomas Lord Department of Computer Science University of Southern California Los AngelesCA90089 United States

In time-critical systems, such as air traffic control systems, it is crucial to design control policies that are robust to timing uncertainty. Recently, the notion of Asynchronous Temporal Robustness (ATR) was proposed to capture the robustness of a system trajectory against individual time shifts in its sub-trajectories. In a multi-robot system, this may correspond to individual robots being delayed or early. Control synthesis under ATR constraints is challenging and has not yet been addressed. In this paper, we propose an efficient control synthesis method under ATR constraints which are defined with respect to simple safety or complex signal temporal logic specifications. Given an ATR bound, we compute a sequence of control inputs so that the specification is satisfied by the system as long as each sub-trajectory is shifted not more than the ATR bound. We avoid combinatorially exploring all shifted sub-trajectories by first identifying redundancy between them. We capture this insight by the notion of instant-shift pair sets, and then propose an optimization program that enforces the specification only over the instant-shift pair sets. We show soundness and completeness of our method and analyze its computational complexity. Finally, we present various illustrative case studies. Copyright © 2023, The Authors. All rights reserved.

关键词： Trajectories