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

International Conference on Cloud and Service Computing (CSC)

作者： Huazheng Qin Xing Wu Ji Hou Hanyu Wang Wu Zhang Wanchun Dou School of Computer Engineering and Science Shanghai University Shanghai China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Department of Computer Science and Technology Nanjing University Nanjing China

Cloud computing as a new IT technology is burgeoning and an increasing number of providers are offering various web services related to cloud computing. Meanwhile, the demands of different kinds of users are also rising sharply. In order to maximize the revenue, a proper pricing model is in desperate need. Nowadays, most of the providers are using static pricing which neglects the changes of supply and demand. Since the web services are easy to access and can be used by a large number of users, a dynamic pricing model aimed at maximizing the revenue is proposed. Our dynamic pricing model can automatically adjust the prices of resources according to the demands from users and the pricing for packages is based on Apriori Algorithm. Furthermore, the dynamic pricing model also can be adjusted and optimized by Genetic Annealing Algorithm so as to well adapt to the changes of Supply and demand. Compared with the static pricing model, the dynamic pricing model can increase the revenue to a considerable extent.

关键词： Pricing Biological cells Cloud computing Computational modeling Sociology Statistics Vectors

来源：评论

学校读者我要写书评

暂无评论

A novel segmentation method for convex lesions based on dynamic programming with local intra-class variance 12

A novel segmentation method for convex lesions based on dyna...

引用

27th Annual ACM Symposium on Applied Computing, SAC 2012

作者： Yu, Mali Huang, Qiliang Jin, Renchao Song, Enmin Liu, Hong Hung, Chih-Cheng School of Computer Science Huazhong University of Science and Technology Wuhan China Key Laboratory of Education Ministry for Image Processing and Intelligent Control Wuhan Hubei China Radiology Department Second People's Hospital of Nanning Nanning China School of Computing and Software Engineering Southern Polytechnic State University GA United States

ISBN: (纸本)9781450308571

Lesion segmentation plays an important role in medical image processing and analysis. There exist several successful dynamic programming (DP) based segmentation methods for general images. In those methods, the gradient is used as an important factor in the cost function to attract the contours to the boundaries. Since medical images have their characteristics such as low contrast, blurred edges and high noises, the gradient operator cannot work well enough to achieve a satisfactory performance for boundary detection. We define the local intra-class variance and combine it with the dynamic programming method to replace the traditional gradient operation. Experiments on synthetic and X-ray images are carried out and the results are compared with Canny and fast multilevel fuzzy edge detection (FMFED) algorithms. It is demonstrated that the proposed method performs better on medical images with low contrast, blurred edges and high noises. In addition, 483 regions of interest of mammograms randomly extracted from DDSM of the University of South Florida are used to compare our proposed method with the plane-fitting and dynamic programming method (PFDP), and the normalized cut segmentation method (Ncut). The results demonstrate that our method is more accurate and robust than PFDP and Ncut. © 2012 ACM.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Dual transfer learning

Dual transfer learning

引用

12th SIAM International Conference on Data Mining, SDM 2012

作者： Long, Mingsheng Wang, Jianmin Ding, Guiguang Cheng, Wei Zhang, Xiang Wang, Wei Department of Computer Science and Technology Tsinghua University Beijing 100084 China School of Software Tsinghua University Beijing 100084 China Key Laboratory for Information System Security Ministry of Education United States Department of Computer Science University of North Carolina Chapel Hill NC United States Dept of Electrical Engineering and Computer Science Case Western Reserve University OH United States

ISBN: (纸本)9781611972320

Transfer learning aims to leverage the knowledge in the source domain to facilitate the learning tasks in the tar- get domain. It has attracted extensive research interests recently due to its effectiveness in a wide range of applica- Tions. The general idea of the existing methods is to utilize the common latent structure shared across domains as the bridge for knowledge transfer. These methods usually model the common latent structure by using either the marginal distribution or the conditional distribution. However, with- out exploring the duality between these two distributions, these single bridge methods may not achieve optimal capa- bility of knowledge transfer. In this paper, we propose a novel approach, Dual Transfer Learning (DTL), which simultaneously learns the marginal and conditional distributions, and exploits the du- Ality between them in a principled way. The key idea behind DTL is that learning one distribution can help to learn the other. This duality property leads to mutual reinforcement when adapting both distributions across domains to trans- fer knowledge. The proposed method is formulated as an optimization problem based on joint nonnegative matrix tri- factorizations (NMTF). The two distributions are learned from the decomposed latent factors that exhibit the duality property. An efficient alternating minimization algorithm is developed to solve the optimization problem with con- vergence guarantee. Extensive experimental results demon- strate that DTL is more effective than alternative transfer learning methods. Copyright © 2012 by the Society for Industrial and Applied Mathematics.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Corrigendum: “Provably-secure electronic cash based on certicateless partially-blind signatures”

引用

Electronic Commerce Research and Applications 2013年第1期12卷 60-60页

作者： Lei Zhang Futai Zhang Bo Qin Shubo Liu East China Normal University Software Engineering Institute Shanghai Key Laboratory of Trustworthy Computing Shanghai China Universitat Rovira i Virgili Department of Computer Engineering and Mathematics UNESCO Chair in Data Privacy Tarragona Catalonia Spain Nanjing Normal University School of Computer Science and Technology China Xi’an University of Technology School of Science Department of Maths China Wuhan University School of Computer Science Wuhan China

来源：评论

学校读者我要写书评

暂无评论

A framework for service-based business process collaboration

引用

Journal of Computational Information Systems 2012年第4期8卷 1791-1803页

作者： Hu, Haiyang Hu, Hua Chiu, Dickson K.W. College of Computer Science Hangzhou Dianzi University China State Key Laboratory for Novel Software Technology Nanjing University China Department of Computer Science and Engineering Chinese University of Hong Kong Hong Kong Hong Kong

Nowadays, Web services-based systems have gained the attention of researchers, and it enables business process system to automatically discover and invocate suitable Web services at run time. Further with portable terminals, it has become more and more popular for mobile users to do their business management in modern business process system. This demands a new framework for system requirements elicitation and design in order to support this new application. In this paper, we introduce a framework for the elicitation of function and performance aware adaptation requirements. In this framework, we present rule for verifying and evaluating the behavior of the collaboration system, and the overall reliability of the system from its architecture. We also propose a process mining method to help reconstruct the architecture of business process from execution logs. An agent-based mechanism to support mobile users completing their remote tasks is also discussed. © 2011 by Binary Information Press.

关键词： software reliability

来源：评论

学校读者我要写书评

暂无评论

Scaling Laws of Multicast Capacity for Power-Constrained Wireless Networks under Gaussian Channel Model

引用

IEEE Transactions on computers 2012年第5期61卷 713-725页

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Shaojie Tang Yuan He Xufei Mao Yunhao Liu Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science and Engineering Building of Electronics and Information Engineering University of Tongji Shanghai China Department of Computer Science Illinois Institute of Technology Chicago IL USA Tsinghua National Laboratory for Information Science and Technology (TNLIST) Tsinghua University Beijing China Department of Computer Science and Engineering University of Tongji China Department of Computer Science Hong Kong University of Science and Technology Kowloon Hong Kong China Tsinghua National Laboratory for Information Science and Technology (TNLIST) School of Software Tsinghua University Beijing China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing China

We study the asymptotic networking-theoretic multicast capacity bounds for random extended networks (REN) under Gaussian channel model, in which all wireless nodes are individually power-constrained. During the transmission, the power decays along path with attenuation exponent α >; 2. In REN, n nodes are randomly distributed in the square region of side length √n. There are n s randomly and independently chosen multicast sessions. Each multicast session has n d + 1 randomly chosen terminals, including one source and n d destinations. By effectively combining two types of routing and scheduling strategies, we analyze the asymptotic achievable throughput for all n s = ω(1) and nd. As a special case of our results, we show that for n s = Θ(n), the per-session multicast capacity for REN is of order Θ(1/√n d n) when nd = O(n/(log n) a+1 ) and is of order Θ(1/n d · (log n) -n/2 ) when n d = Ω(n/log n).

关键词： Lattices Throughput Upper bound Road transportation Receivers Interference Routing

来源：评论

学校读者我要写书评

暂无评论

A layer-based routing protocol for heterogeneous wireless sensor networks

A layer-based routing protocol for heterogeneous wireless se...

引用

IEEE International Conference on Communications (ICC)

作者： Xiao Chen Zanxun Dai Wenzhong Li Hongchi Shi Department of Computer Science Texas State University San Marcos San Marcos TX USA State Key Laboratory for Novel Software Technology Nanjing University China

Due to requirements in different applications, sensors with various capacities are deployed. Data routing in such heterogeneous wireless sensor networks (HWSNs) poses challenges. First, the heterogeneous features create asymmetric links in the communication graphs which are not dealt with by conventional routing algorithms using undirected graphs. Second, it is important to provide an assured delivery rate for mission critical applications since sensors communicate with each other through lossy asymmetric links. In this paper, we propose LayHet: a layer-based routing protocol for HWSNs, which takes advantage of the asymmetric links to deliver messages to the sink with an assured delivery rate. Simulation results show that LayHet outperforms previous routing methods in terms of average delivery ratio, average hops, average packet replication and average control message overhead.

关键词： Routing Routing protocols Wireless sensor networks Broadcasting

来源：评论

学校读者我要写书评

暂无评论

Priv-Code: Preserving privacy against traffic analysis through network coding for multihop wireless networks

Priv-Code: Preserving privacy against traffic analysis throu...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Zhiguo Wan Kai Xing Yunhao Liu MOE Key Laboratory for Information System Security School of Software Tsinghua National Laboratory for Information Science and Technology Tsinghua University China School of Computer Science and Technology University of Science and Technology China Department of Computer Science and Engineering HKUST Hong Kong China

ISBN: (纸本)9781467307734

Traffic analysis presents a serious threat to wireless network privacy due to the open nature of wireless medium. Traditional solutions are mainly based on the mix mechanism proposed by David Chaum, but the main drawback is its low network performance due to mixing and cryptographic operations. We propose a novel privacy preserving scheme based on network coding called Priv-Code to counter against traffic analysis attacks for wireless communications. Priv-Code is able to provide strong privacy protection for wireless networks as the mix system because of its intrinsic mixing feature, and moreover, it can achieve better network performance owing to the advantage of network coding. We first construct a hypergraph-based network coding model for wireless networks, under which we formalize an optimization problem whose objective function is to make each node have identical transmission rate. Then we provide a decentralized algorithm for this optimization problem. After that we develop an information theoretic metric for privacy measurement using entropy, and based on this metric we demonstrate that Priv-Code achieves stronger privacy protection than the mix system while achieving better network performance.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

FTrack: Infrastructure-free floor localization via mobile phone sensing

FTrack: Infrastructure-free floor localization via mobile ph...

引用

IEEE International Conference on Pervasive Computing and Communications (PerCom)

作者： Haibo Ye Tao Gu Xiaorui Zhu Jinwei Xu Xianping Tao Jian Lu Ning Jin State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Department of Mathematics and Computer Science University of Southern Denmark Odense M Denmark

ISBN: (纸本)9781467302562

Mobile phone localization plays a key role in the fast-growing Location Based Applications domain. Most of the existing localization schemes rely on infrastructure support such as GSM, WiFi or GPS. In this paper, we present FTrack, a novel floor localization system to identify the floor level in a multi-floor building on which a mobile user is located. FTrack uses the mobile phone's accelerometer only without any infrastructure support. It does not require any prior knowledge of the building such as floor height. By capturing user encounters and analyzing user trails, FTrack finds the mapping from the traveling time (when taking the elevator) or the step counts (when walking on the stairs) between any two floors to the number of floor levels. The mapping can then be used for mobile users to pinpoint their current floor levels. We conduct both simulation and field studies to demonstrate the effectiveness of FTrack. Our field trial in a 10-floor building shows that FTrack achieves an accuracy of over 90% after two hours in our experiment.

关键词： Elevators Mobile communication Legged locomotion Acceleration Merging Servers

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Stochastic Target Coverage in Sensor Surveillance Systems

Energy-Efficient Stochastic Target Coverage in Sensor Survei...

引用

International Conference on computer Communications and Networks (ICCCN)

作者： Pan Wu Xiang Cao Xiaobing Wu Guihai Chen State Key Laboratory for Novel Software Technology Nanjing University China Department of Computer Science and Engineering University of Minnesota Twin city USA Department of Computer Science and Engineering Shanghai Jiaotong University China

In many sensor surveillance systems such as environment and habitat monitoring, sensors are deployed in an area to monitor several important locations where targets appear. As the sensor nodes are often powered by non-rechargeable batteries, it is crucial to extend the lifetime of sensor surveillance systems. How to cover multiple random targets and extend the system lifetime at the same time is a challenge. Previous studies show that data fusion improve coverage by exploiting the collaboration among sensors. However, they assume that targets deterministically appear at some specific locations and do not consider the randomness of the appearance of the targets. Considering both the high cost of the sensor surveillance system and various reliability requirements in practice, we explore the tradeoff between the system lifetime and the system reliability in this paper. We formulate the stochastic target coverage problem as probabilistic set covering. After showing its NP-Completeness, we design a PSC-based heuristic algorithm in the data fusion model. Extensive simulations show that the system lifetime can be extended dramatically with a small loss to the system reliability.

关键词： Surveillance Reliability Stochastic processes Data models Sensors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：