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

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

来源：评论

学校读者我要写书评

暂无评论

A MapReduce based parallel SVM for large scale spam filtering

A MapReduce based parallel SVM for large scale spam filterin...

引用

2011 8th International Conference on Fuzzy systems and Knowledge Discovery, FSKD 2011, Jointly with the 2011 7th International Conference on Natural Computation, ICNC'11

作者： Caruana, Godwin Li, Maozhen Qi, Man School of Engineering and Design Brunel University Uxbridge Middlesex UB8 3PH United Kingdom Department of Computing Canterbury Christ Church University Canterbury Kent CT1 1QU United Kingdom Key Laboratory of Embedded Systems and Service Computing Ministry of Education Tongji University China

ISBN: (纸本)9781612841816

Spam continues to inflict increased damage. Varying approaches including Support Vector Machine (SVM) based techniques have been proposed for spam classification. However, SVM training is a computationally intensive process. This paper presents a parallel SVM algorithm for scalable spam filtering. By distributing, processing and optimizing the subsets of the training data across multiple participating nodes, the distributed SVM reduces the training time significantly. Ontology based concepts are also employed to minimize the impact of accuracy degradation when distributing the training data amongst the SVM classifiers. © 2011 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On multicast throughput scaling of hybrid wireless networks with general node density

引用

Computer Networks 2011年第15期55卷 3548-3561页

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Yunhao Liu Department of Computer Science and Technology Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education China Department of Computer Science Illinois Institute of Technology Chicago IL 60616 United States TNLIST School of Software Tsinghua University China

In this paper, we consider hybrid wireless networks with a general node density λ ∈ [1, n ], where n ad hoc nodes are uniformly distributed and m base stations (BSs) are regularly placed in a square region A ( n , A ) = 1 , A × 1 , A with A ∈ [1, n ]. We focus on multicast sessions in which each ad hoc node as a user chooses randomly d ad hoc nodes as its destinations. Specifically, when d = 1 (or d = n − 1), a multicast session is essentially a unicast (or broadcast) session. We study the asymptotic multicast throughput for such a hybrid wireless network according to different cases in terms of m ∈ [1, n ] and d ∈ [1, n ], as n → ∞. To be specific, we design two types of multicast schemes, called hybrid scheme and BS - based scheme , respectively. For the hybrid scheme, there are two alternative routing backbones : sparse backbones and dense backbones . Particularly, according to different regimes of the node density λ = n A , we derive the thresholds in terms of m and d . Depending on these thresholds, we determine which scheme is preferred for the better performance of network throughput.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Task assignment in heterogeneous computing systems using an effective iterated greedy algorithm

引用

Journal of systems and Software 2011年第6期84卷 985-992页

作者： Qinma Kang Hong He Huimin Song Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China School of Information Engineering Shandong University at Weihai 180 Wenhua Xilu Weihai 264209 China School of Mathematics and Statistics Shandong University at Weihai Weihai 264209 China

A fundamental issue affecting the performance of a parallel application running on a heterogeneous computing system is the assignment of tasks to the processors in the system. The task assignment problem for more than three processors is known to be NP-hard, and therefore satisfactory suboptimal solutions obtainable in an acceptable amount of time are generally sought. This paper proposes a simple and effective iterative greedy algorithm to deal with the problem with goal of minimizing the total sum of execution and communication costs. The main idea in this algorithm is to improve the quality of the assignment in an iterative manner using results from previous iterations. The algorithm first uses a constructive heuristic to find an initial assignment and iteratively improves it in a greedy way. Through simulations over a wide range of parameters, we have demonstrated the effectiveness of our algorithm by comparing it with recent competing task assignment algorithms in the literature.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Retraction notice to ‘‘Specification and Verification of Dynamic Evolution of Software Architectures” [SYSARC 56 (10) (2010) 523–533]

引用

Journal of systems Architecture 2012年第8期58卷 338-338页

作者： Xu Hongzhen Zeng Guosun Department of Computer Science and Technology Tongji University Shanghai 201804 China Department of Computer Science and Technology East China Institute of Technology Fuzhou Jiangxi Province 344000 China Application of Nuclear Technology Engineering Center of Ministry of Education Nanchang Jiangxi Province 330013 China Embedded System and Service Computing Key Lab of Ministry of Education Shanghai 201804 China

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：