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

IEEE International Conference on Networking, Sensing and Control

作者： GuanJun Liu ChangJun Jiang MengChu Zhou Key Laboratory of the MoE for Embedded System and Service Computing University of Tongji Shanghai China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

Li and Zhou propose an important concept for Petri nets: elementary siphons. They partition siphons into elementary and dependent ones. The controllability of the latter can be ensured by the former's proper control. They give a sufficient condition to decide whether a dependent siphon is controlled by its elementary ones in S 3 PR. However, this condition is so loose that in many cases the controllability of a dependent SMS cannot be determined although it is actually controlled. In this paper, we propose an improved condition to decide the controllability of strongly dependent SMS.

关键词： Controllability System recovery Nickel Flexible manufacturing systems Petri nets Sufficient conditions Control theory

来源：评论

学校读者我要写书评

暂无评论

Upper bounds on lifetime of ordinary clustering ultra wide band sensor networks

引用

Ruan Jian Xue Bao/Journal of Software 2011年第2期22卷 313-322页

作者： Xu, Juan Hong, Yong-Fa Wang, Cheng Bai, Xing-Zhen College of Electronics and Information Engineering Tongji University Shanghai 200092 China Key Laboratory of Embedded System and Service Computing of the Ministry of Education Tongji University Shanghai 200092 China College of Information Science and Engineering Shandong University of Science and Technology Qingdao 266510 China

This paper considers the time hopping impulse radio ultra wide band (TH-IR UWB) sensor networks, with n sensor nodes uniformly and independently located on a square and a Sink. The upper bounds on the lifetime of ordinary clustering dense and extended TH-IR UWB sensor networks are derived respectively. For ordinary clustering networks, the cluster head aggregates data from the nodes within its own cluster, and relays data to other cluster heads. The results indicate that the upper bounds on the lifetime of ordinary clustering dense TH-IR UWB are in proportion with the node density (or the number of nodes), while the upper bounds on the lifetime of extended networks are inversely proportional to the size of the deployment area (or the number of nodes). The results also reveal that the upper bound on the lifetime of dense network in the ideal case are longer than those of the static network by a factor of (n/log n)1/2, and the upper bound on the lifetime of extended network in the ideal case are longer than those of the static network by a factor of (λn/log(λn))1/2. Therefore, sensor nodes, or the Sink moving randomly in the square, can improve the lifetime of ordinary clustering TH-IR UWB sensor network. © 2011 ISCAS.

关键词： Energy dissipation

来源：评论

学校读者我要写书评

暂无评论

Web service Composition Techniques in a Health Care service Platform

Web Service Composition Techniques in a Health Care Service ...

引用

IEEE International Conference on Web services (ICWS)

作者： Pengwei Wang Zhijun Ding Changjun Jiang Mengchu Zhou Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

The information technology has been recognized as one of the most important means to improve health care and curb its ever-increasing cost. However, existing efforts mainly focus on informatization of hospitals or medical institutions within organizations, and few are directly oriented to individuals. The strong demand for various health services from customers calls for the creation of powerful individual-oriented personalized health care service systems. Web service composition (WSC) and related technologies can greatly help one build such systems. This paper aims to present a newly developed platform called a Public oriented Health care Information service Platform (PHISP) and several novel WSC techniques that are used to build it. Among them include WSC techniques that can well support branch and parallel structures.

关键词： Biomedical imaging service oriented architecture Diseases Computer architecture Hospitals

来源：评论

学校读者我要写书评

暂无评论

Optimal cooperative relay deployment strategy in heterogeneous cellular network

引用

Journal of Information and Computational Science 2011年第8期8卷 1457-1470页

作者： Gao, Zhiwei Wang, Ping Liu, Fuqiang Shan, Lianhai Key Laboratory of Embedded Systems and Service Computing Ministry of Education of China College of Electronics and Information Engineering Tongji University Shanghai 201804 China Shanghai Research Center for Wireless Communications 280 Linhong Rd Changning District Shanghai 200335 China Shanghai Key Laboratory of Digital Media Processing and Transmission 800 Dongchuan RD. Minhang District Shanghai 201100 China

For the purpose of reducing energy consumption and increasing spatial reuse, relay node deployment strategies have been studied widely in wireless network planning. In this paper, we propose a new deploy strategy when cooperative relay transmission protocol is adopted in the heterogeneous network environment. The existence of cooperative relay nodes introduces more interference in the cellular domain. First, we introduce the hetero-interference models which have great influence on heterogeneous access performance. Then, outage probability and symbol error rate models are derived for heterogeneous relay based network. On this basis, several relay deployment strategies are introduced to analyze cooperative network. Furthermore, the multi-objective solution is used to optimize cooperative relay deployment strategy. Numerical results show that such kind deployment strategy can improve the cellular outage probability and symbol error rate as compared with fixed deployment strategy and Nearest-Neighbor algorithm. © 2011 Binary Information Press.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Construction-and-extraction based index for images retrieval

IEEJ Transactions on Electronics, Information and Systems

引用

IEEJ Transactions on Electronics, Information and systems 2011年第7期131卷 1377-1383页

作者： Zhang, Junqi Ni, Lina Tian, Chunqi Gao, Shangce Tang, Zheng Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Tongji University Shanghai 200092 China College of Info Sci and Engi Shandong University of Science and Technology Qingdao 266510 China Department of Intellectual Information Systems Engineering University of Toyama Toyama-shi 930-8555 Japan

The past recent years have witnessed more and more applications on image retrieval. As searching a large image database is often costly, to improve the efficiency, high dimensional indexes may help. This paper proposes an adaptive hybrid index (AHI) supported by a construction-and-extraction technique to support image retrieval. First, the image clusters are further partitioned into sub-clusters to reduce the overlap between clusters and indexed into an iDistance index. Then, the query sampling statistically extracts some sub-cluster from the iDistance index into a sequential file. Finally, the users' queries are accurately returned by searching both the iDistance index and the sequential file. It's proved that the proposed AHI never performs worse than the sequential scan. Particularly, the experimental results demonstrate that the proposed index AHI is beneficial and achieves better performance than some exiting methods. It is about 2 times faster than iDistance, almost three times than Omni-sequential, more than four times faster than sequential file and more than 10 times faster than M-tree on the benchmark images set. The effect of the proposed AHI is also investigated by our implemented content based images retrieval system. © 2011 The Institute of Electrical Engineers of Japan.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

A top-down algorithm for finding principal curves from complex patterns data

引用

ICIC Express Letters 2011年第3期5卷 797-802页

作者： Zhang, Hongyun Miao, Duoqian Xie, Chen Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University No. 1239 Siping Road Shanghai 201804 China School of Electronic and Information Engineering Tongji University No. 1239 Siping Road Shanghai 201804 China

Principal curves are a well established tool in data analysis and processing, but for complex pattern data with high curvature, high dispersion and self-intersecting, such as spiral-shaped curves, existing methods did not perform well. To solve the problem, a top-down strategy is introduced to extract principal curves from complex pattern data. Firstly, the thinning-based method is used to create rudimentary principal graph of data set, and then merging the contiguous vertices. Finally, the fitting-and-smoothing step introduced by Kégl is improved to optimize the principal graph, and Kégl's restructuring step is used to rectify imperfections of principal graph. This algorithm has been not only tested on simulated data sets but also applied to image skeletonization. Experimental results indicate the effectiveness of the proposed method on finding principal curves from complex pattern data sets. © 2011 ISSN 1881-803X.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Solving the maximum planar subgraph problem using a two-part permutation encoding genetic approach

引用

ICIC Express Letters 2011年第11期5卷 4107-4113页

作者： Li, Sheng Chen, Huiqin Gao, Shangce Tang, Zheng Graduate School of Innovation Life Science University of Toyama Gofuku 930-8555 Toyama-shi Japan Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University No. 1239 Siping Road Shanghai 200092 China

Genetic algorithms (GAs) have been shown to be very useful in a variety of search and optimization problems. In this paper, we present a new genetic algorithm for the maximum planar subgraph problem (MPSP). Previous studies investigated solving the MPSP with genetic algorithms using standard bit string chromosomes. This paper proposes a new two-part permutation encoding with a greedy heuristic decoding to represent the chromosomes. The first part represents the ordering of the edges in the graph, while the second part deals with the starting vertex based on which a vertex sequence can be determined. Computational testing shows the new approach produces better solutions than previous techniques. © 2011 ICIC International.

关键词： Chromosomes

来源：评论

学校读者我要写书评

暂无评论

Verification of web service protocols by logic of knowledge

引用

Journal of Information and Computational Science 2011年第6期8卷 921-932页

作者： Chen, Qingliang Su, Kaile Cao, Ying Liu, Chanjuan School of Electronics Engineering and Computer Science Peking University Beijing 100871 China Department of Computer Science Jinan University Guangzhou 510632 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200000 China Institute for Integrated and Intelligent Systems Griffith University Brisbane Australia

Web services is a popular distributed systems technology and its effectiveness and efficiency rely badly on the underlying protocols. And web service protocols are designed in XML formats so the message structures within are quite different from the conventional ones. Therefore, the well-established formal verification techniques for conventional protocols, which have gained substantial achievements in practice, cannot be applied directly to them because of the inherently different syntax. In this paper, we propose a justification-oriented and automatic formal approach to verify, in the standard Dolev-Yao model, concerned security properties expressed as epistemic notions, i. e., logic of knowledge, for web service protocols, based on a fault-preserving mapping tool called SuD (SOAP under Dolev-Yao). Our approach is significant because, instead of finding flaws in finite number of protocol sessions, the specifications we are to verify can hold in arbitrary number of sessions. © 2011 Binary Information Press.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Reader Activation Scheduling in Multi-reader RFID systems: A Study of General Case

Reader Activation Scheduling in Multi-reader RFID Systems: A...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Shaojie Tang Cheng Wang Xiang-Yang Li Changjun Jiang Department of Computer Science Illinois Institute of Technology Chicago IL USA Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science University of Tongji Shanghai China

Radio frequency identification (RFID) is a technology where a reader device can "sense'' the presence of a close by object by reading a tag device attached to the object. To guarantee the coverage quality, multiple RFID readers can be deployed in the given region. In this paper, we consider the problem of activation schedule for readers in a multi-reader environment. In particular, we try to design a schedule for readers to maximize the number of served tags per time-slot while avoiding various interferences. We first develop a centralized algorithm under the assumption that different readers may have different interference and interrogation radius. Next, we propose a novel algorithm which does not need any location information of the readers. Finally, we extend the previous algorithm in distributed manner in order to suit the case where no central entity exists. We conduct extensive simulations to study the performances of our proposed algorithm. And our evaluation results corroborate our theoretical analysis.

关键词： Interference Radiofrequency identification Schedules Scheduling Processor scheduling Geometry Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A three-stage method to find refining schedules of crude oil operations in refinery

A three-stage method to find refining schedules of crude oil...

引用

IEEE International Conference on service Operations and Logistics, and Informatics, SOLI

作者： Naiqi Wu LiPing Bai MengChu Zhou School of Mechatronics Engineering Guangdong University of Technology Guangzhou China MoE Key Laboratory of Embedded System and Service Computing University of Tongji Shanghai China ECE New Jersey Institute of Technology Newark NJ USA

A short-term scheduling problem for crude oil operations is highly challenging. There lack efficient techniques and software tools for its solution. Our prior research shows that it may be solved in a hierarchical way. At the upper level, we find a realizable refining schedule to optimize concerned objectives. At the lower level, a detailed schedule is obtained to realize it. This work attempts to present a three-stage method to solve the the upper level problem from a control perspective. The first stage solves a linear programming problem to determine the maximal production rate. The second one solves a transportation problem to optimally assign crude oil types and volume to the distillers. The last one adjusts and sequences oil parcels. Consequently, the proposed method is computationally efficient. An industrial case study is presented to show the result.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：