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

arXiv 2022年

作者： He, Kun Wang, Chunyang Yin, Yitong Institute of Computing Technology Chinese Academy of Sciences No.6 Kexueyuan South Road Zhongguancun Haidian District Beijing China State Key Laboratory for Novel Software Technology Nanjing University 163 Xianlin Avenue Jiangsu Province Nanjing China

We give a simple combinatorial algorithm to deterministically approximately count the number of satisfying assignments of general constraint satisfaction problems (CSPs). Suppose that the CSP has domain size q = O (1), each constraint contains at most κ = O (1) variables, shares variables with at most Δ = O (1) constraints, and is violated with probability at most p by a uniform random assignment. The algorithm returns in polynomial time in an improved local lemma regime: q2 · κ · p · Δ5 ≤ C0 for a suitably small absolute constant C0. Here the key term Δ5 improves the previously best known Δ7 for general CSPs [JPV21b] and Δ5.714 for the special case of κ-CNF [JPV21a, HSW21]. Our deterministic counting algorithm is a derandomization of the very recent fast sampling algorithm in [HWY22]. It departs substantially from all previous deterministic counting Lovász local lemma algorithms which relied on linear programming, and gives a deterministic approximate counting algorithm that straightforwardly derandomizes a fast sampling algorithm, hence unifying the fast sampling and deterministic approximate counting in the same algorithmic framework. To obtain the improved regime, in our analysis we develop a refinement of the {2, 3}-trees that were used in the previous analyses of counting/sampling LLL. Similar techniques can be applied to the previous LP-based algorithms to obtain the same improved regime and may be of independent interests. Copyright © 2022, The Authors. All rights reserved.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Automatic salient object segmentation via shape prior based active contour model

引用

ICIC Express Letters, Part B: Applications 2016年第11期7卷 2491-2496页

作者： Gao, Shangbing Zhang, Youdong Zhou, Jun Zheng, Hao The Key Laboratory for Traffic and Transportation Security of Jiangsu Province Faculty of Computer and Software Engineering No. 1 Meicheng Rd. Huai’an223003 China Jiangsu Provincial Key Laboratory for Advanced Manufacturing Technology Huaiyin Institute of Technology No. 1 Meicheng Rd. Huai’an223003 China Key Laboratory of Trusted Cloud Computing and Big Data Analysis Nanjing Xiaozhuang University No. 3601 Hongjing Ave. Jiangning Dist. Nanjing211171 China

In this paper, we propose a novel model for unsupervised segmentation of viewer's attention object from natural images based on localizing region-based active con-tour (LRAC). Firstly, we proposed the saliency detection model via the multi-scale super-pixel. Then, object-level shape prior is extracted combining saliency with object boundary information. Finally, this contour is improved by the edge-preserving to generate the initial contour for our automatic object segmentation system. In contrast with localiz-ing region-based active contours that require considerable user interaction, the proposed method does not require it, i.e., the segmentation task is ful_lled in a fully automatic manner. Extensive experiments results on a large variety of natural images demonstrate that our algorithm consistently outperforms the popular existing salient object segmenta-tion methods, yielding higher precision and better recall rates. © 2016 ICIC International.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

DarkSAM: Fooling Segment Anything Model to Segment Nothing 38

DarkSAM: Fooling Segment Anything Model to Segment Nothing

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Zhou, Ziqi Song, Yufei Li, Minghui Hu, Shengshan Wang, Xianlong Zhang, Leo Yu Yao, Dezhong Jin, Hai National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Cluster and Grid Computing Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Computer Science and Technology Huazhong University of Science and Technology China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia

Segment Anything Model (SAM) has recently gained much attention for its outstanding generalization to unseen data and tasks. Despite its promising prospect, the vulnerabilities of SAM, especially to universal adversarial perturbation (UAP) have not been thoroughly investigated yet. In this paper, we propose DarkSAM, the first prompt-free universal attack framework against SAM, including a semantic decoupling-based spatial attack and a texture distortion-based frequency attack. We first divide the output of SAM into foreground and background. Then, we design a shadow target strategy to obtain the semantic blueprint of the image as the attack target. DarkSAM is dedicated to fooling SAM by extracting and destroying crucial object features from images in both spatial and frequency domains. In the spatial domain, we disrupt the semantics of both the foreground and background in the image to confuse SAM. In the frequency domain, we further enhance the attack effectiveness by distorting the high-frequency components (i.e., texture information) of the image. Consequently, with a single UAP, DarkSAM renders SAM incapable of segmenting objects across diverse images with varying prompts. Experimental results on four datasets for SAM and its two variant models demonstrate the powerful attack capability and transferability of DarkSAM. Our codes are available at: https://***/CGCL-codes/DarkSAM. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Research on fractional order controller based on best rational approximation approach

引用

Journal of Convergence Information Technology 2012年第4期7卷 50-58页

作者： Zhao, Huimin Nie, Bing Li, Wen Deng, Wu Software Institute Dalian Jiaotong University Dalian 116028 China Key Laboratory of Numerical Simulation in the Sichuan Provincial College Neijiang Normal University Neijiang 641112 China Artificial Intelligence Key Laboratory of Sichuan Province Sichuan University of Science and Engineering Zigong 643000 China State Key Laboratory of Power Transmission Equipment and System Security and New Technology College of Electrical Engineering Chongqing University Chongqing 400044 China Key Laboratory of advanced Design and Intelligent Computing Dalian University Ministry of Education Dalian 116622 China

Introduce the basic concept of best rational approximation and constructing procedure of the best rational approximation function in Laplace domain. By an illustrative example the design method of FOC based on best rational approximation is discussed. The performance comparison of transfer functions between the FOC obtained by best rational approximation method and conventional PID shows that it is effective to apply the method in design of FOC, which can guarantee maximum absolute error of amplitude frequency characteristic of approximation function in a given error tolerance.

关键词： Rational functions

来源：评论

学校读者我要写书评

暂无评论

Self-adaptive method dealing with the end issue of EMD

引用

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2007年第10期35卷 1944-1948页

作者： Shao, Chen-Xi Wang, Jian Fan, Jin-Feng Yang, Ming Wang, Zi-Cai MOE-Microsoft Key Laboratory of Multimedia Computing and Communication University of Science and Technology of China Hefei 230026 China Department of Computer Science and Technology University of Science and Technology of China Hefei 230026 China Control and Simulation Center Harbin Institute of Technology Harbin 150001 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei 230027 China

The empirical mode decomposition (EMD) developed by Huang etc. of NASA is an advanced method for signal analysis. But there is an involved end issue in the course of getting two envelops of the data using spline interpolation. A self-adaptive method to dealing with the end issue is proposed. Generally, it extends the externa sequence near the ends of the data by the most suited sequence in the inner data. For the chosen inner sequence has the most similarity of tendency with the ends, the data extension is reasonable. After the extension, the spline does not swing at both ends of the data. The result of experiment proved that the method can be used to solve the end issue effectively.

关键词： Signal analysis

来源：评论

学校读者我要写书评

暂无评论

DETECTING THE RUN TIME ATTACKS IN THE CLOUD WITH AN EVIDENCE COLLECTION BASED APPROACH

DETECTING THE RUN TIME ATTACKS IN THE CLOUD WITH AN EVIDENCE...

引用

2014 IEEE 3rd International Conference on Cloud computing and Intelligence Systems

作者： Jie lin Chuanyi Liu Zhichun Ning Binxing Fang School of Computer Science Beijing University of Posts and Telecommunications Key Laboratory of Trustworthy Distributed Computing and Service(BUPT) Ministry of Education School of Software Engineering Beijing University of Posts and Telecommunications School of Information and Communication Engineering Beijing University of Posts and Telecommunications

As the impacts of security threats are amplified and spread quickly in the cloud,especially with the attribute of large-scale *** of researches focus on monitoring the network ***,these methods don't check how the attack happened and what damage the attack caused for the virtual *** paper presents a logging method to analyze the potential attacks out of VM and a prototype was *** experimental results show that this method can detect the real world attacks effectively and the performance overhead is acceptable.

关键词： Virtual machine Cloud Security Control

来源：评论

学校读者我要写书评

暂无评论

Fast Collection of Target Tags Information for Large-Scale RFID Systems

Fast Collection of Target Tags Information for Large-Scale R...

引用

International Conference on Wavelet Active Media Technology and Information Processing (ICWAMTIP)

作者： Chu Chu Ning Fu Rui Xu College of Computer Science Sichuan Normal University Chengdu China The Visual Computing and Virtual Reality Key Laboratory of Sichuan Province Chengdu China School of Network and Communication Engineering Chengdu Technological University Chengdu China School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu China

Radio Frequency Identification (RFID) technology is greatly supporting a variety of life and industry. Enhanced by sensors, RFID tags can monitor real-time information about attached objects and the environment, making efficient collection of tag information an important task. However, most works focus on collecting all tags but lack effective mechanisms to avoid interfering from irrelevant tags when the application only cares about a part of the tags in some cases. Besides, in more common scenarios with multiple RFID readers, existing works fail to effectively determine the surrounding tags for each reader, increasing the execution time. To conquer these defects, we propose a new solution called the efficient Vector-based target tag Information Collection (VIC) protocol to accelerate the collection rate. First, we introduce a composite vector to silence irrelevant tags and determine the local tags. During this process, the expected empty slots are skipped and the useless information transmitted by tags is reduced. Second, we use an allocation vector to collect tag information by resolving tag collision, thus improving the time efficiency. Finally, we provide theoretical analyses to optimize the parameter settings. Extensive experiments prove that VIC outperforms existing solutions by up to 32% increase in time efficiency.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Implementing the Matrix Multiplication with DFC on Kunlun Small Scale Computer

Implementing the Matrix Multiplication with DFC on Kunlun Sm...

引用

IEEE International Conference on Parallel and Distributed computing, Applications and Technologies (PDCAT)

作者： Zheng Du Jing Zhang Shihao Sha Qiuming Luo Department of Computer Science and Technology Tsinghua University NHPCC/Guangdong Key Laboratory of popular UPC & Guangdong Province Engineering Center of China-made High Performance Data Computing System in College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (数字)9781728126166

ISBN: (纸本)9781728126173

In this paper, we demonstrate a new dataflow platform of DFC, which can handle the successive dataflow computing passes with tagged data. By implementing the matrix multiplication in DFC, we show that DFC can exploit the parallelism automatically with a much simple dataflow graph constructed by DF functions of DFC. Different from the other dataflow execution platform, DFC support multiple worker threads for one dataflow node of DF functions. By running the matrix multiplication program of DFC on Kunlun system, it was verified that DFC get a reasonable speedup for large scale computing for thread number up to 512.

关键词： Distributed computing Handheld computers

来源：评论

学校读者我要写书评

暂无评论

An Efficient and Slight Convolutional Neural Network for Vehicle Type Classification

引用

Journal of Physics: Conference Series 2018年第1期1069卷

作者： Haibo Zheng Naijie Gu Xiaoci Zhang Anhui Province Key Laboratory of Computing and Communication Software School of Computer and Technology University of Science and Technology of China Hefei China

With the popularity of small storage embedded devices, recent researches on deep convolutional neural networks no longer only focus on improving the classification accuracy but start to attach great importance to the size of convolutional neural networks. This paper proposes a small deep convolutional neural network for vehicle type classification, based on the Fire module and the residual module. The Fire module is applied to maintain a small number of parameters. The residual module is employed to accelerate the training process and improves the classification accuracy. Experimental results show that our model achieves 95.57% accuracy of vehicle type classification on an open source dataset BIT-Vehicle. This outperforms previous researches and some classical convolutional neural networks such as AlexNet, ResNet-32 and SqueezeNet. What is more, the size of our model is only 5.3 MB, which has 40X fewer parameters than AlexNet and has 15X fewer parameters than ResNet-32.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Master stability functions for complete, intralayer, and interlayer synchronization in multiplex networks of coupled Rössler oscillators

引用

Physical Review E 2019年第1期99卷 012304-012304页

作者： Longkun Tang Xiaoqun Wu Jinhu Lü Jun-an Lu Raissa M. D'Souza Fujian Province University Key Laboratory of Computation Science School of Mathematical Science Huaqiao University Quanzhou 362021 China School of Mathematics and Statistics Wuhan University Wuhan 430072 China Department of Computer Science University of California Davis California 95616 USA School of Automation Science and Electrical Engineering State Key Laboratory of Software Development Environment and Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing 100191 China

Synchronization phenomena are of broad interest across disciplines and increasingly of interest in a multiplex network setting. For the multiplex network of coupled Rössler oscillators, here we show how the master stability function, a celebrated framework for analyzing synchronization on a single network, can be extended to certain classes of multiplex networks with different intralayer and interlayer coupling functions. We derive three master stability equations that determine, respectively, the necessary regions of complete synchronization, intralayer synchronization, and interlayer synchronization. We calculate these three regions explicitly for the case of a two-layer network of Rössler oscillators and show that the overlap of the regions determines the type of synchronization achieved. In particular, if the interlayer or intralayer coupling function is such that the interlayer or intralayer synchronization region is empty, complete synchronization cannot be achieved regardless of the coupling strength. Furthermore, for any network structure, the occurrence of intralayer and interlayer synchronization depends mainly on the coupling functions of nodes within a layer and across layers, respectively. Our mathematical analysis requires that the intralayer and interlayer supra-Laplacians commute. But, we show this is only a sufficient, and not necessary, condition and that the results can be applied more generally.

关键词： Collective dynamics Synchronization Synchronization transition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：