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

2010 2nd International Conference on Signal Processing systems, ICSPS 2010

作者： Yan, Bin Li, Shao-Zi Su, Song-Zhi Dept. of Cognitive Science Xiamen University Fujian 361005 China Fujian Key Lab. of Brain-Like Intelligent System Xiamen Fujian 361005 China Dept. of Computer Science Xiamen University Fujian 361005 China

ISBN: (纸本)9781424468911

Shape context is intended to be a way of describing shapes that allows for measuring shape similarity and recovering point correspondences. It is widely used in object recognition, and gets encouraging performance. But shape context is easily affected by noise points and slightly transition. In image processing, bilinear interpolation is practical and effective, allowing the resulting image appears smoother rather than jagged rendering, and more robust to slightly transition. In this paper, we use the bilinear interpolation to calculate shape context. Experimental result on 20 classes of object containing 500 images shows that robust objects matching can be achieved with our proposed method. © 2010 IEEE.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

A generic model for multi-dimensional separation of concerns at architecture level

A generic model for multi-dimensional separation of concerns...

引用

2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008

作者： Zhang, Lin-Lin Ying, Shi Ni, You-Cong Wen, Jing Zhao, Kai Ye, Peng State Key Lab. of Software Engineering Wuhan University Wuhan China School of Information Science and Engineering Xinjiang University Urumqi China Department of Mathematics and Physics Anhui Institute of Architecture and Industry Hefei China College of Computer Science Wuhan University of Science and Engineering Wuhan China

ISBN: (纸本)9781424421084

software architecture design is an important stage in the whole software development lifecycle. There are so many various concerns at architecture level which relate to all kinds of stakeholders and describe the all facets of problem domain. Unfortunately, they often tangle and scatter in the components and connectors, result in the final architecture solutions uneasy to evolve and reuse. So in this paper, we propose a generic model named "1+X" which can separate the concern at architecture level along multiple dimensions. Also, we provide specification for each dimension and concerns in a dimension. This makes it possible to effectively cope with the crosscutting concerns at architecture level, encapsulate those using aspects or design decisions in the later architecture design activities. © 2008 IEEE.

关键词： software design

来源：评论

学校读者我要写书评

暂无评论

Reach-avoid differential games based on invariant generation

arXiv

引用

arXiv 2018年

作者： Xue, Bai Wang, Qiuye Zhan, Naijun Fränzle, Martin Feng, Shenghua State Key Lab. of Computer Science Institute of Software Cas Carl von Ossietzky Universität Oldenburg

Reach-avoid differential games play an important role in collision avoidance, motion planning and control of aircrafts, and related applications. The central problem is the computation of the set of initial states from which the ego player can enforce the satisfiability of safety specifications over a specified time horizon. Previous methods addressing this problem mostly focus on finite time horizons. We study this problem in the context of the infinite time horizon, where the ego player aims to perpetually force the system to satisfy certain safety specification while the mutual other player attempts to enforce a violation of this safety specification. The problem is studied within the Hamilton-Jacobi reachability framework with unique Lipschitz continuous viscosity solutions. The continuity and uniqueness property of the viscosity solution facilitates the use of contemporary numerical methods to solve this problem with an appropriate number of state variables. An example adopted from a Moore-Greitzer jet-engine model is employed to illustrate our approach. Copyright © 2018, The Authors. All rights reserved.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Evaluating coverage quality through best covered pathes in wireless sensor networks

Evaluating coverage quality through best covered pathes in w...

引用

IEEE/ACM International Symposium on Quality of Service

作者： Tang, ShaoJie Mao, XuFei Li, Xiang-Yang Dai, Guojun Dept. of Computer Science Illinois Institute of Technology Chicago IL United States Beijing Key Lab. of Intelligent Telecommunications Software and Multimedia BUPT Beijing China Institute of Computer Application Technology Hangzhou Dianzi University Hangzhou China

ISBN: (纸本)9781457701030

Coverage quality is one critical metric to evaluate the Quality of Service (QoS) provided by wireless sensor networks. In this paper, we address maximum support coverage problem (a.k.a. best case coverage) in wireless sensor networks. Most of the existing work assume that the coverage degree is 1, i.e. every point on the resultant path should fall within the sensing range of at least one sensor node. Here we study the k-coverage problem, in which every point on the resultant path is covered by at least k sensors while optimizing certain objectives. We present tackle this problem under both centralized and distributed setting. The time complexity is bounded by O(k2 n log n) where n is the number of deployed sensor nodes. To the best of our knowledge, this is the first work that presents polynomial time algorithms that find optimal k-support paths for a general k. © 2011 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

An insightful program performance tuning chain for GPU computing

An insightful program performance tuning chain for GPU compu...

引用

12th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2012

作者： Jia, Haipeng Zhang, Yunquan Long, Guoping Yan, Shengen Lab. of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences China College of Information Science and Engineering Ocean University of China China State Key Laboratory of Computing Science Chinese Academy of Sciences China Graduate University of Chinese Academy of Sciences China

ISBN: (纸本)9783642330773

It is challenging to optimize GPU kernels because this progress requires deep technical knowledge of the underlying hardware. Modern GPU architectures are becoming more and more diversified, which further exacerbates the already difficult problem of performance optimization. This paper presents an insightful performance tuning chain for GPUs. The goal is to help non-expert programmers with limited knowledge of GPU architectures implement high performance GPU kernels directly. We achieve it by providing performance information to identify GPU program performance bottlenecks and decide which optimization methods should be adopted, so as to facilitate the best match between algorithm features and underlying hardware characteristics. To demonstrate the usage of tuning chain, we optimize three representative GPU kernels with different compute intensity: Matrix Transpose, Laplace Transform and Integral on both NVIDIA and AMD GPUs. Experimental results demonstrate that under the guidance of our tuning chain, performance of those kernels achieves 7.8~42.4 times speedup compared to their naïve implementations on both NVIDIA and AMD GPU platforms. © 2012 Springer-Verlag.

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

Success factors in Mobile Social Networking application development: Case study of instagram 14

Success factors in Mobile Social Networking application deve...

引用

29th Annual ACM Symposium on Applied Computing, SAC 2014

作者： Peng, Rong Sun, Dong Tsai, Wei-Tek State Key Lab. of Software Engineering School of Computer Wuhan University Wuhan City Hubei Province 470032 China School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ 85287 United States

ISBN: (纸本)9781450324694

The distinguished features of mobile computing bring both opportunities and challenges to the development of Mobile Social Networking (MSN) applications. Learning the successful experiences from existing MSN applications is valuable to both industry and academy. The paper aims at identifying the success factors of Instagram, a well-known MSN application. By performing a historical case study, rapid development and reaction, continuous focus on system scalab.lity on demand, and creating a good external environment are regarded as the three important success factors. To achieve those success factors, 1) using existing mature Open Source software (OSS) extensively and consulting resident experts at websites when necessary are the secrets to develop and react to new requirements rapidly;2) monitoring the status of the system by tools and focusing on scalab.lity in both architecture design and detail optimization are vital to guarantee the system scalab.e on demand;and 3) creating appropriate social networks for different type of stakeholders using right popular social media tools is important to create a good external environment effectively. Based on these insights, the development methodology of Instagram has been extracted, that can be used to guide the MSN application development. At the end, the validation, reliability and generalizability of the information gathered from the case study are discussed thoroughly. Copyright 2014 ACM.

关键词： computer software reusability

来源：评论

学校读者我要写书评

暂无评论

Energy and thermal aware mapping for mesh-based NoC architectures using multi-objective ant colony algorithm

Energy and thermal aware mapping for mesh-based NoC architec...

引用

IEEE International Conference on computer Research and Development

作者： Liu, Yanhua Ruan, Ying Lai, Zongsheng Jing, Weiping Dept. of Electronic Computer and Software Systems Institute of Microelectronics Circuit and System East China Normal University Shanghai China Dept. of Electronic Engineering Jiangsu Provincial Key Lab. of ASIC Design Nantong University Nantong China

ISBN: (纸本)9781612848372

Where IP cores to be mapped must be carefully solved for any given application in order to optimize different performance metrics in Network-on-Chip (NoC) design flow. The optimization of different performance metrics simultaneously may cause a negative effect on each other because of the strong correlation between these performance metrics. In this paper, we propose a multi-objective ant colony algorithm (MOACA) that maps IP cores onto mesh-based NoC architectures. This algorithm is an efficient way to find the pareto-optimal front which optimizes energy consumption and hotspot temperature of NoC. The algorithm has been implemented and evaluated for synthetic generated benchmarks. Experimental results confirm the efficiency, accuracy and scalab.lity of the algorithm. © 2011 IEEE.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

Anomaly detection by clustering in the network

Anomaly detection by clustering in the network

引用

2009 International Conference on Computational Intelligence and software Engineering, CiSE 2009

作者： Guo, Feng Yang, Yingzhen Duan, Lian Pervasive Computing Lab. College of Computer Science Zhejiang University Hangzhou China State Key Lab. of CAD and CG Zhejiang University Iowa City IA United States Department of Management Science Henry B. Tippie College of Business University of Iowa Iowa City IA United States

ISBN: (纸本)9781424445073

Intrusions impose serious security threat to network environment, so it is necessary to detect and cope with them. Many intrusion detection methods focus on signature detection, where models are built to recognize known attacks. However, signature detection, limited by its nature, cannot detect novel attacks. New intrusion types, of which detection systems may not even be aware, are difficult to detect. Anomaly detection focuses on modeling the normal behavior and identifying significant deviations, which could be novel attacks. In this paper we present a clustering algorithm to identify outliers. It performs clustering on feature vectors collected from the network and can automatically detect new types of intrusions without need of manual classification of training data. Experimental results show that our system achieves a satisfactory intrusions detection rate while keeping the false positive rate reasonably low. ©2009 IEEE.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Reduction criteria for probabilistic models with spatial restrictions on states

Reduction criteria for probabilistic models with spatial res...

引用

2nd International Conference on Networks Security, Wireless Communications and Trusted Computing, NSWCTC 2010

作者： Jun, Niu Zeng, Guosun Department of Computer Science and Technology Tongji University Shanghai China College of Information Engineering Zhejiang Business Technology Institute Ningbo China Embedded System and Service Computing Key Lab. of Ministry of Education Shanghai China

ISBN: (纸本)9780769540115

Partial order reduction techniques have been used to combat the state explosion problem in model checking procedures for concurrent systems with probabilistic behaviors. There are some results that give criteria on applying partial order reduction for verifying quantitative time properties and reward-based properties on actions. However, there are many situations that reward-based properties are expressed on states rather than on actions because actions are triggered in no time and the quantities can not be obtained easily. This paper presents reduction criteria for a probabilistic temporal logic that allows specification of restrictions on quantitative measures given by spatial resources function for the states of the considered system and provides the proof of the correctness. © 2010 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

An integrated algorithm based on artificial bee colony and particle swarm optimization

An integrated algorithm based on artificial bee colony and p...

引用

International Conference on Natural Computation

作者： Shi, Xiaohu Li, Yanwen Li, Haijun Guan, Renchu Wang, Liupu Liang, Yanchun College of Computer Science and Technology Jilin University Jilin Changchun 130012 China State Key Lab. for Novel Software Technology Nanjing University Jiangsu Nanjing 210093 China College of Computer Northeast Normal University Changchun 130117 China School of Computer Science Yantai University Shandong Yantai 264005 China

ISBN: (纸本)9781424459612

Based on particle swarm optimization (PSO) and artificial bee colony (ABC), a novel hybrid swarm intelligent algorithm is developed in this paper. Two information exchanging processes are introduced to share valuable information mutually between particle swarm and bee colony. Numerical results show that the proposed method is effective and performs better than both PSO and ABC. © 2010 IEEE.

关键词： Swarm intelligence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：