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

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Jie Jin Lei Pan Chongjun Wang Junyuan Xie National Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China

The study of community detection has received more and more attention in recent years, the problem is very difficult and of great importance in many fields such as sociology, biology and computer science. But most of the algorithms proposed so far could not utilize the weight information within weighted networks, and many of them are so time-consuming that they are not fit for the large-scale networks. We propose a new center-based method, which is especially designed for weighted networks. And the method is also suitable for large-scale network because of its low computational complexity. We demonstrate our method on a synthetic network and two real-world networks. The result shows the high efficiency and precision of our method.

关键词： Communities Algorithm design and analysis Image edge detection Educational institutions Social network services Games Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Strong barrier coverage using directional sensors with arbitrarily tunable orientations

Strong barrier coverage using directional sensors with arbit...

引用

2011 7th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2011

作者： Tao, Dan Mao, Xu-Fei Tang, Shao-Jie Zhang, Hai-Tao Ma, Hua-Dong Xie, Hai-Jiang School of Electronic and Information Engineering Beijing Jiaotong University Beijing China Beijing Key Laboratory of Intelligent Telecomm. Software and Multimedia Beijing University of Posts and Telecomm. Beijing China Department of Computer Science Illinois Institute of Technology Chicago IL United States Department of Computer Science and Technology Xi'An JiaoTong University Xi'An China

ISBN: (纸本)9780769546100

Barrier coverage is an important problem for sensor networks to fulfill some given sensing tasks. Barrier coverage guarantees the detection of events happened crossing a barrier of sensors. In majority study of barrier coverage using sensor networks, sensors are assumed to have an isotropic sensing model. However, in many applications such as monitoring an area using video camera, the sensors have directional sensing model. In this paper, we investigate strong barrier coverage using directional sensors, where sensors have arbitrarily tunable orientations to provide good coverage. We investigate the problem of finding appropriate orientations of directional sensors such that they can provide strong barrier coverage. By exploiting geographical relations among directional sensors and deployment region boundaries, we first introduce the concept of virtual node to reduce the solution space from continuous domain to discrete domain. We then construct a directional barrier graph (DBG) to model this barrier coverage question such that we can quickly answer whether there are directional sensors' orientations that can provide strong barrier coverage over a given belt region. If the belt region is strong barrier covered, we then develop energy-efficient solutions to find strong barrier path(s) that will approximately minimize the total or the maximum rotation angles of all directional sensors. Extensive simulations are conducted to verify the effectiveness of our solution. © 2011 IEEE.

关键词： Sensor networks

来源：评论

学校读者我要写书评

暂无评论

Time Petri net model with mixed semantics

引用

Ruan Jian Xue Bao/Journal of software 2011年第6期22卷 1199-1209页

作者： Pan, Li Ding, Zhi-Jun Guo, Guan-Qi School of Information and Communication Engineering Hu'nan Institute of Science and Technology Yueyang 414006 China Department of Computer Science and Technology Tongji University Shanghai 200092 China State Key Laboratory of Software Engineering Wuhan University Wuhan 430072 China

This paper presents a time Petri net (TPN) model with mixed semantics that efficiently addresses the schedulability analysis problem of the existing semantics models. The proposed model associates each firable transition with a mandatory firing point that is set to the least upper bound of the transition and its non-conflicting transitions. This treatment not only eliminates the effect of conflicting transitions on the transition friability and extends the scheduling scope of the TPN model, but also ensures the time limit of the task scheduling. To determine the expressiveness of the mixed model, the study proves that the mixed semantics model has the power of Turing machines and its marking reachability problem is undecidable. The timed expressiveness of three semantics models with respect to timed language acceptance is also compared. A state class approach is then proposed for the scheduling analysis of the mixed model. Finally, a flexible manufacturing system is used as an example to compare the scheduling ability of three semantics models. ©2011 ISCAS.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Detecting Link Communities Based on Local Approach

Detecting Link Communities Based on Local Approach

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Lei Pan Chongjun Wang Junyuan Xie Meilin Liu National Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China Department of Computer Science & Engineering Wright State University Dayton OH USA

Detecting communities from networks has been given great attention these years. The traditional approaches were always focusing on the node community, while some recent studies have shown great advantage of link community approach which partitions links instead of nodes into communities. We proposed a novel algorithm LBLC (local based link community) to detect link communities in the network based on local information. A local link community can be detected by maximizing a local link fitness function from a seed link, which was ranked by another algorithm previously. The proposed LBLC algorithm has been tested on both synthetic and real world networks, and it has been compared with other link community detecting algorithm. The experimental results showed LBLC achieves significant improvement on link community structure.

关键词： Communities Image edge detection Educational institutions Social network services Physics Equations Dolphins

来源：评论

学校读者我要写书评

暂无评论

Multi-population principal component analysis based on spectral graph technique for data analysis

Multi-population principal component analysis based on spect...

引用

International Workshop on Computational Transportation science

作者： Wang, Haijuan Han, Lixin Zhen, Zhilong Zeng, Xiaoqin College of Computer and Information Engineering Hohai University Nanjing 210098 China Department of Mathematics Tonghua Normal University Tonghua 134002 China State Key Laboratory of Novel Software Technology Nanjing University Nanjing 210093 China

ISBN: (纸本)9780769543352

Principal component analysis is a multivariate statistical method that makes the complex cross-correlation between the variables simpler. The basic idea of principal component analysis is to project the original observation data into a new low-dimensional space in the sense of information loss minimization and then to solve the problem with a significantly reduced size, but the classical principal component analysis does not take the category information into account in data analysis. In this paper, a multi-population principal component analysis approach based on spectral graph technique is proposed. The novel approach incorporates the category information from samples to construct an adjacency undirected graph to handle the case of many groups, which puts the problem into solving eigenvalue and eigenvector of a matrix. Experimental results on two data sets show that the ratio of cumulative variance contributions of new approach outperforms that of classical method. The proposed method is feasible and effective. © 2011 IEEE.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Low Overhead Dynamic Spectrum Reallocation in Opportunistic Spectrum Access Networks

Low Overhead Dynamic Spectrum Reallocation in Opportunistic ...

引用

International Conference on computer Communications and Networks (ICCCN)

作者： Yu Tian Wenzhong Li Zhuo Li Sanglu Lu Xiaoming Fu State Key Laboratory for Novel Software Technology Department of Computer Science Nanjing University China Institute of Computer Science Georg-August-University of Goettingen Germany

Opportunistic spectrum access, which allows secondary users opportunistically access unused licensed channels to exploit instantaneous spectrum availability, is a promising approach to achieve efficient spectrum utilization and mitigate spectrum scarcity. To address the challenge of dynamic spectrum access, one of the most important issues is cooperative spectrum reallocation among secondary users to minimize spectrum handoffs. In this paper, we present a low-complexity approach based on conflict graph to optimize spectrum reallocation by local coordination. In order to reduce communication overhead, we propose two heuristic spectrum selection methods named local observation and metric maximum. Experimental results show two benefits of the proposed schemes. On one hand, the coordination approach can dynamically improve the total system throughput (approximately doubled at most). On the other hand, our heuristic strategies decrease the number of spectrum handoff by up to 20% compared with existing strategies.

关键词： Throughput Measurement Resource management Interference Heuristic algorithms OFDM

来源：评论

学校读者我要写书评

暂无评论

An Approach to Handling Failure Recovery in Service Composition and Its Analysis

An Approach to Handling Failure Recovery in Service Composit...

引用

Theoretical Aspects of software Engineering (TASE)

作者： Guisheng Fan Huiqun Yu Liqiong Chen Chunhua Gu Department of Computer Science and Engineering East China University of Science and Technology Shanghai China State Key Laboratory for Novel Software Technology Nanjing University China Department of Computer Science and Information Engineering Shanghai Institute of Technology Shanghai China

Service composition is an effective way to build complex Web service applications. However, it is a challenge to handle failure recovery due to the uncertainty of service in distributed and heterogeneous environment. This paper proposes an approach to handling failure recovery in service composition. Petri nets are used to model the different components of service composition, failure recovery rules and service selection strategies are given. Based on these, aspect-orientation is used to weave failure recovery concern into service composition, which includes failure warning concern, service selection concern and recovery concern, the weaving mechanism dynamically integrates these schemas into a failure recovery model. The operation semantics and related theories of Petri nets help prove its effectiveness and correctness. A case study and experimental results demonstrate the approach can simplify the failure recovery process, and improve the design quality of service composition.

关键词： Weaving Web services Petri nets Semantics Analytical models Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Aggregation-Friendly Data Collection Protocol of Wireless Sensor Networks for PoI Monitoring

Aggregation-Friendly Data Collection Protocol of Wireless Se...

引用

International Conference on computer Communications and Networks (ICCCN)

作者： Xiaobing Wu Shen Li Guihai Chen State Key Laboratory for Novel Software Technology Nanjing University China Department of Computer Science University of Illinois Urbana-Champaign USA

Point of Interest (PoI) coverage problem has been discussed lately. Both practical strategies and theoretical analysis have been proposed. We however argue that coverage solution alone is not enough. In real applications, data from the covered area need to be collected and sent back to the sink. We notice that existing protocols are for general purpose use and not specially designed for PoI monitoring. Accordingly, we propose Smaller tree Collection Protocol (SCP) for data collection in this kind of applications. SCP is a distributed approximation for building a minimum Steiner tree connecting all PoI nodes and the sink. SCP aims to activate minimum relay nodes and supports data aggregation better than other collection protocol, e.g., Collection Tree Protocol (CTP), Backpressure Collection Protocol (BCP) and opportunistic routing protocols. We also design low cost distributed mechanisms to handle PoI dynamics. Extensive simulations have been performed to evaluate the proposed protocol.

关键词： Protocols Wireless sensor networks Monitoring Routing Relays Receivers Steiner trees

来源：评论

学校读者我要写书评

暂无评论

Multi-keyframe abstraction from videos

Multi-keyframe abstraction from videos

引用

IEEE International Conference on Image Processing

作者： Ping Li Yanwen Guo Hanqiu Sun Department of Computer Science and Engineering CUHK Hong Kong China State Key Laboratory for Novel Software Technology Nanjing University China

This paper presents a method for abstracting multi-keyframe from video datasets. Existing video abstraction methods focused on simple view videos, and the results will be unacceptable if applied to overlapping views directly due to limitations like unavoidable redundancy and complicated inner correlations. We propose a correlation map to naturally model the correlations with various attributes among multi-keyframe, keyframe importance and weighted correlations are then computed to construct the map. The weighted correlations, unlike the unweighted ones, not only model probabilistic relationship among keyframes but also address the temporal and visual similarity. We facilitate the abstraction process via SVM classification and keyframes reduction using rough set. The multi-keyframe correlation map, which serially assembles event-centered keyframes in temporal order, is presented for displaying the abstraction, which shows the correlations and improves the browsability of video datasets.

关键词： Videos Correlation Visualization Noise Feature extraction Probabilistic logic Semantics

来源：评论

学校读者我要写书评

暂无评论

A real-time rescue system: Towards practical implementation of robotic sensor network

A real-time rescue system: Towards practical implementation ...

引用

IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON)

作者： Jing Yuan Shao-Jie Tang Cheng Wang Debraj De Xiang-Yang Li Wen-Zhan Song Guihai Chen State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Department of Computer Science Illinois Institute of Technology Chicago IL USA Department of Computer Science University of Tongji Shanghai China Department of Computer Science Georgia State University USA

A real-time monitor and rescue system must be able to both quickly and reliably detect the event happening in its monitoring region. Furthermore, it is required to fulfill certain rescue mission, e.g., navigate victims to exit through safe path in case of emergency. Current monitor and rescue approaches generally rely on either teleoperated robots, or teams of wireless robots. Typically the robots used in these systems tend to have high cost which make them unpractical in large scale deployment and applications. In this work, we present a realtime monitor and rescue system, TelosW-Bot Net, utilizing integrated networks. The integrated network is an integration of stationary sensor networks and robots: static sensor networks comprised of large numbers of small, simple, and inexpensive wireless sensors, and the robots which can communicate and controlled by sensor nodes. We demonstrate the efficacy of our system in real test bed composed of 46 sensors, which is one of the largest robotic sensor network to our knowledge, providing empirical results.

关键词： Robot sensing systems Navigation Monitoring Hardware Accuracy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：