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

IEEE Symposium on Intelligent Vehicle

作者： Renjun Lin Xianbin Cao Yanwu Xu Changxia Wu Hong Qiao Key Laboratory of Software in Computing and Communication University of Science and Technology Hefei China University of Manchester Institute of Science and Technology UK Institute of Automation Chinese Academy and Sciences Beijing China

ISBN: (纸本)9781424435036

Urban traffic surveillance, which is designed to improve traffic management, is an important part of intelligent traffic system (ITS). In particular, airborne moving vehicle detection has become a new but hot research area since its wide view and low cost. However, airborne urban traffic surveillance is impacted by many difficulties such as camera vibration, vehicle congestion, background variance, serious thermal noise etc. Therefore, image subtraction and thermal image processing have low detection rate, while the optical flow method cannot meet the real-time application. In this paper, we propose a coarse-to-fine method, which can be divided into two stages of pre-processing and classification inspection. In pre-processing stage, the candidates regions of moving vehicle are obtained by employing Road Detection, Removal of Non-vehicle Regions and Moving Regions Extraction. The speed of this stage is fast but there is still relatively high false-positive-rate. In classification inspection stage, a well-trained cascade classifier, which refines the candidate regions, is designed to maintain a higher detection rate and a lower false alarm rate. Experimental results demonstrate that compared with representative algorithms, our method reach better performance in detection rate and false-positive-rate, while meeting the needs of real-time application.

关键词： Vehicle detection Video surveillance Optical noise Inspection Intelligent systems Costs Cameras Vehicles Background noise Image processing

来源：评论

学校读者我要写书评

暂无评论

A fine-grained algorithm for generating hard-toreverse negative databases

A fine-grained algorithm for generating hard-toreverse negat...

引用

International Workshop on Artificial Immune Systems (AIS)

作者： Dongdong Zhao Wenjian Luo Ran Liu Lihua Yue Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China School of Computer Science China University of Geosciences Wuhan China

The negative database (NDB) is a new technique for privacy preserving and information hiding. It hides information by storing the complementary set instead of the original data. In order to protect the hidden information, NDBs should be hard-to-reverse. In this paper, we propose the K-hidden algorithm for generating hard-to-reverse NDBs (called K-hidden-NDBs). The K-hidden algorithm could be controlled in a more fine-grained manner than existing NDB generation algorithms. Moreover, in terms of the SAT solvers based on the local search strategy, we formally prove that the K-hidden-NDBs could be more hard-to-reverse than the NDBs generated by the typical p-hidden algorithm. Furthermore, we show that the K-hidden-NDB could be more hard-to-reverse (against the local search strategy) than the q-hidden-NDB (NDBs generated by the q-hidden algorithm) when the sizes of NDBs are the same. Finally, as for the Unit Clause heuristic solvers, we prove that the K-hidden-NDB could be the same hard-to-reverse as the q-hidden-NDB.

关键词： Search problems Databases Security Data privacy Algorithm design and analysis Computer science NP-hard problem

来源：评论

学校读者我要写书评

暂无评论

Extending CDFR for Overlapping Community Detection

Extending CDFR for Overlapping Community Detection

引用

International Conference on Data Intelligence and Security (ICDIS)

作者： Nannan Lu Wenjian Luo Li Ni Hao Jiang Weiping Ding Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei China Centre for Artificial Intelligence University of Technology Sydney Broadway NSW Australia

ISBN: (纸本)9781538657638

In many real-world networks, a node often belongs to multiple communities. Therefore, overlapping community detection is an important task in social network analysis. CDFR is an efficient algorithm recently proposed for non-overlapping community detection. In this paper, CDFR is extended for overlapping community detection, and the extended algorithm is called as OCDFR. In OCDFR, CDFR is first called to obtain a non-overlapping community partition. Then, find the kth NGC (k=1, 2, 3,...) node for each node, and record the fuzzy relations between them. Based on the fuzzy relation between a node and its kth NGC, five decision methods are proposed to determine whether it can join the communities to which its kth NGC belongs. Experimental results on real-world networks and synthetic networks demonstrate that OCDFR is effective and highly competitive.

关键词： Heuristic algorithms Social network services Partitioning algorithms Clustering algorithms Nickel Complex networks Security

来源：评论

学校读者我要写书评

暂无评论

Estimating properties of chaotic system based on S-NURBS resampling method

Estimating properties of chaotic system based on S-NURBS res...

引用

International Conference on Measurement, Information and Control (MIC)

作者： Chenxi Shao Qingqing Liu Tingting Wang Binghong Wang Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology of China Hefei China Computer Science and Technology Department University of Science and Technology of China Hefei China

ISBN: (纸本)9781479913916

Physical properties of the chaotic system play important roles on studying the innate character and deciding the practical predictability of the dynamics. For a short piece of undersampled chaotic signals, it is very hard to abstract the physical properties of the signal source from the sequence. In this paper, we model this type of data with global S-NURBS method to reconstruct a smooth trajectory and resample the trajectory to get enough series. In this way, the problem of estimating the physical properties from small undersampled data is turned to the work of calculating the properties of the resampled time series. The new interpolation method is named as S-NURBS resampling method, and the simulation experiment demonstrates that the new method has a good performance in studying physical systems from the observed time series.

关键词： Time series analysis Interpolation Trajectory Chaos Splines (mathematics) Surface topography Surface reconstruction

来源：评论

学校读者我要写书评

暂无评论

Container-based data-intensive application scheduling in hybrid cloud-edge collaborative environment

Container-based data-intensive application scheduling in hyb...

引用

作者： Tang, Bing Luo, Jincheng Zhang, Jiaming School of Computer Science and Engineering Hunan University of Science and Technology Hunan Xiangtan China Hunan Key Laboratory for Service Computing and Novel Software Technology Hunan University of Science and Technology Hunan Xiangtan China School of Information and Communication Engineering Guangzhou Maritime University Guangdong Guangzhou China School of Information Engineering Wuhan University of Technology Hubei Wuhan China

Container virtualization technology represented by Docker has been widely used in the industry due to its advantages of lightweight, fast deployment, and easy portability. It can bring convenience to system deployment, operation, and maintenance. This article considers the implementation of AI-based IoT applications based on Docker and container technology in a cloud-edge collaborative environment. Three typical data-intensive applications, preprocessing, training, and inference in machine learning, are deployed using Docker containers. For these three types of tasks, this article proposes a container-based data-intensive application scheduling framework. Using an attribute-based data-driven method, a new scheduling approach considering multiple weighting factors is proposed, which is called DICS-OPT. The cloud nodes and edge nodes are scored and sorted uniformly. The container is scheduled to the node with the highest score, and then the task data is transmitted to the node to execute the task. NSGA-III-based genetic algorithm has been proposed to search for the optimal weighting factors. This article introduces the implementation of the prototype system and builds a cloud-edge collaborative testbed consisting of Raspberry Pis and PCs. The performance evaluation results indicates that the proposed scheduling approach outperforms existing approaches. Compared with existing approaches, DICS-OPT improves the average edge resource utilization by 10.05% to 69.04%, and saves the cloud resource cost by 16.02% to 36.68%. © 2023 John Wiley & Sons Ltd.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

Analysis and Design of Mobile Model for DTN

引用

Chinese Journal of Electronics 2023年第4期18卷 635-638页

作者： Zhiting Lin Yugui Qu Yusheng Ji Baohua Zhao Department of Computer Science University of Science and Technology of China Hefei China Province Key Laboratory of Software in Computing and Communication Hefei China Information Systems Architecture Science Research Division National Institute of Informatics Tokyo Japan

Delay tolerant networks may become unexpectedly partitioned due to node mobility or variation in signal strength. However, most widely used models in some relative works are generally very simplistic. In order to exploit intelligent forwarding algorithms, a novel nodal mobile model of delay tolerant networks is presented to map reality with more accuracy. And several approaches are introduced to analyze the network structure, such as n-cliques, n-clans, degree, closeness and betweenness. Our research results showed that the centralizations became smaller when the wireless connections were concerned. It meant that quite a number of nodes became potential relays because of the new structure of networks.

关键词： Wireless communication Analytical models Wireless sensor networks Protocols Social networking (online) Sensitivity analysis Social network theory

来源：评论

学校读者我要写书评

暂无评论

A hybrid active contour model with local Gaussian distribution fitting energy for image segmentation

引用

Journal of Information and Computational Science 2015年第17期12卷 6515-6523页

作者： Zhang, Runru Huang, Zhangjin Gu, Naijie School of Computer Science and Technology University of Science and Technology of China Hefei China Anhui Province Key Laboratory of Computing and Communication Software Hefei China Institute of Advanced Technology University of Science and Technology of China Hefei China

Active contour models have been widely applied in image segmentation with promising results. However, many of them fail to segment images successfully due to intensity inhomogeneity. To address this problem, we propose a hybrid region-based active contour model which fully utilizes local intensity information. This model develops a localized active contour framework and incorporates a local Gaussian distribution fitting energy. In order to increase both the computational efficiency and stability of the proposed model, a multi-resolution strategy is employed and the active contour is evolved in a reinitialization-free way. Extensive experiments demonstrate that our model is effective and efficient in segmenting images with intensity inhomogeneity, and outperforms several state-of-the-art algorithms. © 2015 by Binary Information Press.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Performance research and optimization on CPython's interpreter

Performance research and optimization on CPython's interpret...

引用

Federated Conference on Computer Science and Information Systems (FedCSIS)

作者： Huaxiong Cao Naijie Gu Kaixin Ren Yi Li Anhui Province Key Laboratory of Computing and Communication Software Department of Computer Science and Technology University of Science and Technology of China Institute of Advanced Technology University of Science and Technology of China Hefei China

ISBN: (纸本)9781479967476

In this paper, the performance research on CPython's latest interpreter is presented, concluding that bytecode dispatching takes about 25 percent of total execution time on average. Based on this observation, a novel bytecode dispatching mechanism is proposed to reduce the time spent on this phase to a minimum. With this mechanism, the blocks associated with each kind of bytecodes are rewritten in hand-tuned assembly, their opcodes are renumbered, and their memory spaces are rescheduled. With these preparations, this new bytecode dispatching mechanism replaces the time-consuming memory reading operations with rapid operations on registers. This mechanism is implemented in CPython-3.3.0. Experiments on lots of benchmarks demonstrate its correctness and efficiency. The comparison between original CPython and optimized CPython shows that this new mechanism achieves about 8.5 percent performance improvement on average. For some particular benchmarks, the maximum improvement is up to 18 percentages.

关键词： Dispatching Benchmark testing Binary codes Switches Optimization Registers Instruction sets

来源：评论

学校读者我要写书评

暂无评论

A straightforward method to judge the completeness of a polymorphic gate set

arXiv

引用

arXiv 2017年

作者： Li, Zhifang Luo, Wenjian Yue, Lihua Wang, Xufa School of Computer Science and Technology University of Science and Technology of China Hefei230027 China Anhui Key Laboratory of Software in Computing and Communication University of Science and Technology of China Hefei230027 China

Polymorphic circuits are a special kind of circuits which possess some different build-in functions and these functions are activated by environment parameters, like light and VDD. Some theories have been proposed to guide the design of polymorphic circuits, including the definition of complete polymorphic gate sets and algorithms to judge the completeness of a polymorphic gate set. However, the previous algorithms have to enumerate all the polymorphic signals for judging the completeness of a polymorphic gate set, and it is not easy to be conducted manually. In this paper, a straightforward method is proposed to judge the completeness of a polymorphic gate set. And the correctness of the straightforward method is proved theoretically. Some examples are given to show that the proposed method could be conducted step by step. Its actual computing cost is usually low, and it is suitable for manual operation. Copyright © 2017, The Authors. All rights reserved.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Joint Sink Mobility and Data Diffusion for Lifetime Optimization in Wireless Sensor Networks

Joint Sink Mobility and Data Diffusion for Lifetime Optimiza...

引用

IEEE Asia-Pacific Conference on Services computing (APSCC)

作者： Yu Gu Hengchang Liu Fei Song Baohua Zhao Department of Computer Science Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology Hefei Anhui China Department of Computer Science University of Virginia Charlottesville VA USA

In this paper, we address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularly challenging since we need to consider both mobility scheme and storage constraint. Previous works suggest to use a simple single-hop routing model in which source nodes can only communication with the sink node directly in those mobile networks. However, we notice that this statement is unsuitable for sensor networks with storage constraint because we prove it is a NP-complete problem under single-hop routing model by reducing the traveling salesman problem (TSP) to it in polynomial time. Hence, we try a different way. First we analyze this problem and give a lifetime upperbound, so whether this upperbound is tight is what we concern mostly. Thus, we first construct a 2-approximation O(n 2 ) algorithm to solve the TSP problem, then a novel data diffusion mechanism is built to achieve this upperbound. We prove that under some reasonable assumptions, our algorithm can output this optimal lifetime.

关键词： Wireless sensor networks Routing Computer networks Constraint optimization Computer science Mobile communication NP-complete problem Traveling salesman problems Polynomials Monitoring

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：