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

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Chunyang Wei Hongyan Li Kai Lei Tengjiao Wang Key Laboratory of High Confidence Software Technologies Ministry of Education School of Electronics Engineering and Computer Science Peking University Beijing China The Shenzhen Key Laboratory for Cloud Computing Technology and Applications (SPCCTA) Peking University Shenzhen Graduate School Shenzhen China

Data uncertainty is an inherent property in various applications due to reasons such as measurement errors, incompleteness of data and so on. While On-Line Analytical Processing (OLAP) has been a powerful method for analyzing large data warehouse, OLAP over uncertain data has become a valuable and attractive issue because of the increasingly demand for handling uncertainty in multidimensional data. In this paper, we firstly describe our UStar-Schema model that extends the traditional OLAP model to support uncertain dimension attributes in fact table, uncertain measures in fact table and uncertainty in dimension table. Then we extend the processing model of the aggregate queries and cube computing on Ustar-Schema. Secondly, we design a novel index structure called PSI-Index on UStar-Schema to improve efficiency of OLAP quering and cube computing. Furthermore, an advanced index structure called HB-Index and an efficient algorithm are proposed to accelerate iceberg cube computing based on our model using pruning techniques to eliminate huge amounts of useless computations. Finally, extensive experiments are performed to examine the efficiency and effectiveness of our proposed techniques.

关键词： Indexes Aggregates Uncertainty Computational modeling Sensors Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Perfect plane-wave source for a high-order symplectic finite-difference time-domain scheme

引用

Chinese Physics B 2011年第11期20卷 365-370页

作者：王辉黄志祥吴先良任信钢 Key Laboratory of Intelligent Computing & Signal Processing of Ministry of Education Anhui University Department of Physics and Electronic Engineering Hefei Normal University

The method of splitting a plane-wave finite-difference time-domain （SP-FDTD） algorithm is presented for the initiation of plane-wave source in the total-field / scattered-field （TF/SF） formulation of high-order symplectic finite- difference time-domain （SFDTD） scheme for the first time. By splitting the fields on one-dimensional grid and using the nature of numerical plane-wave in finite-difference time-domain （FDTD）, the identical dispersion relation can be obtained and proved between the one-dimensional and three-dimensional grids. An efficient plane-wave source is simulated on one-dimensional grid and a perfect match can be achieved for a plane-wave propagating at any angle forming an integer grid cell ratio. Numerical simulations show that the method is valid for SFDTD and the residual field in SF region is shrinked down to -300 dB.

关键词： splitting plane-wave finite-difference time-domain high-order symplectic finite-differencetime-domain scheme plane-wave source

来源：评论

学校读者我要写书评

暂无评论

An edge matching method based on mean shift and its application in video tracking

引用

International Journal of Advancements in computing Technology 2012年第11期4卷 224-238页

作者： Liu, Yiming Zhou, Shangbo Li, Hua Department of Computer Science and Engineering Chongqing University Chongqing 400030 China Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education Chongqing University Chongqing 400030 China Department of Mathematics and Computer Science University of Lethbridge Canada

An edge matching method based on mean shift algorithm is proposed in this paper. According to the mode of seeking ability in mean shift algorithm, a pre-process is presented in the matching process which adjusts the edge information of target and candidate models to their stable states. In addition, the optimizing solutions to the matching process are presented which include of using combined morphological operations in edge extraction, updating target edge information, limiting the iterations of candidate mean shift, and shifting the initial iterating positions of candidate models through the interfering vector. The proposed method and the optimizing solutions can alleviate the influence of noise interference. In addition, the matching method is applied in an improved particle filter tracking framework. The experiment results indicate the close relationship between the value of interfering coefficient and the tracking performance, and show that the proposed method can increase the robustness of matching and efficiently improve the performance of tracking.

关键词： Target tracking

来源：评论

学校读者我要写书评

暂无评论

A cross-layers service discovery protocol for MANET

引用

Journal of Computational Information Systems 2012年第12期8卷 5085-5092页

作者： Zhong, Jiang Geng, Shenghua Weng, Luosheng Li, Xue College of Computer Science Chongqing University Chongqing 400044 China School of Information Technology and Electrical Engineering Queensland University Queensland QLD 4072 Australia Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education Chongqing 400044 China

With the rapid development of Internet, MANET is becoming a popular network organization. Automatic service discovery plays an important role in the appliance of auto-finding and using the resource in the dynamic network environment, and it also can reduce the complexity of system configuration and maintenance. This paper proposes a new service discovery protocol called SCAODV which integrates route protocol and the process of service discovery. SCAODV protocol is based on CAODV protocol. The NS2 Simulation experiments prove that SCAODV protocol not only achieve route discovery and service discovery, but also decrease control packets efficiently and keep lower delay of service discovery. SCAODV protocol also achieve security certificate based on the symmetric encryption technology between service requester and service replier in the process of service. © 2012 Binary Information Press.

关键词： Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Infrared human image segmentation using two-dimensional fuzzy tsallis entropy

引用

ICIC Express Letters 2012年第7期6卷 1733-1739页

作者： Yang, Shuhong Liu, Weining Sun, Dihua Zhao, Min Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education Chongqing University No. 174 Shazhengjie Shapingba Chongqing 400030 China Department of Computer Engineering Guangxi University of Technology No. 268 Donghuan Road Liuzhou 545006 China

Infrared images are by nature fuzzy and thus the segmentation of human targets from them is a challenging task. To handle this ambiguity, a new kind of thresholding method using both the spatial information and fuzziness of image is presented in this paper. We first calculate the 2-D (two-dimensional) histogram of image to make full use of spatial information, and then transform the 2-D histogram into fuzzy domain employing fuzzy membership function. For its excellent capacity in describing nonexten-sive information which widely existed in images, Tsallis entropy is adopted to define a novel 2-D fuzzy entropy, namely 2-D fuzzy Tsallis entropy. And then, the newly defined entropy is applied in the field of image segmentation following maximum entropy principle. The experiments on benchmark images demonstrate the advantages of the proposed method. © 2012 ICIC International.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Maximally permissive control of flexible manufacturing systems with fewest disjunctive constraints

Maximally permissive control of flexible manufacturing syste...

引用

2012 International Conference onAdvanced Mechatronic Systems, ICAMechS 2012

作者： Chen, YuFeng Zhou, MengChu Li, XiaoOu School of Electro-Mechanical Engineering Xidian University Xi'an 710071 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102 United States Departamento de Computación CINVESTAV-IPN Av. IPN 2508 Col. Zacatenco México DF C.P. 07360 Mexico

ISBN: (纸本)9780955529382

For Petri net models whose legal reachability spaces are non-convex, one cannot optimally control them by the conjunctions of linear constraints. This work proposes a method to find a set of linear constraints such that each constraint can forbid all first-met bad markings and every legal marking satisfies at least one constraint. Then, the disjunctions of the obtained constraints can make all legal markings reachable and forbid all first-met bad markings, i.e., the controlled net is live and maximally permissive. The work also develops an integer linear programming model to minimize the number of the constraints. Finally, an example is provided to illustrate the proposed method. © 2012 Intl Jrnal Advanced Mech.

关键词： Flexible manufacturing systems

来源：评论

学校读者我要写书评

暂无评论

A Relational Taxonomy of Services for Large Scale Service Repositories

A Relational Taxonomy of Services for Large Scale Service Re...

引用

IEEE International Conference on Web Services (ICWS)

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

With the rapid development of service-oriented computing (SOC) and service-oriented architecture (SOA), the number of services is rapidly increasing. How to organize and manage services effectively in repositories to improve the efficiency of service discovery and composition is important. This paper proposes three categorization rules to classify services for a large scale repository to form a relational taxonomy. The service retrieve scope can be drastically narrowed by this taxonomy. Therefore, the efficiency of service discovery and service composition can be greatly improved. We evaluate and compare the performance of the proposed method and other related ones via a publicly available test set, ICEBE05. The experimental results validate the effectiveness and high efficiency of the proposed one.

关键词： Taxonomy Web services educational institutions System-on-a-chip Quality of service Conferences Computers

来源：评论

学校读者我要写书评

暂无评论

Multicast Capacity Scaling Laws for Multihop Cognitive Networks

引用

IEEE Transactions on Mobile computing 2012年第11期11卷 1627-1639页

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

In this paper, we study multicast capacity for cognitive networks. We consider the cognitive network model consisting of two overlapping ad hoc networks, called the primary ad hoc network (PaN) and secondary ad hoc network (SaN), respectively. PaN and SaN operate on the same space and spectrum. For PaN (or SaN, respectively), we assume that primary (or secondary, respectively) nodes are placed according to a Poisson point process of intensity n (or m, respectively) over a unit square region. We randomly choose n s (or m s , respectively) nodes as the sources of multicast sessions in PaN (or SaN, respectively), and for each primary source vp (or secondary source v s , respectively), we pick uniformly at random nd primary nodes (or md secondary nodes, respectively) as the destinations of v p (or v s , respectively). Above all, we assume that PaN can adopt the optimal protocol in terms of the throughput. Our main work is to design the multicast strategy for SaN by which the optimal throughput can be achieved, without any negative impact on the throughput for PaN in order sense. Depending on nd and n, we choose the optimal one for PaN from two strategies called percolation strategy and connectivity strategy, respectively. Subsequently, we design the corresponding throughput-optimal strategy for SaN. We derive the regimes in terms of n, n d , m, and m d in which the upper bounds on multicast capacities for PaN and SaN can be achieved simultaneously. Unicast and broadcast capacities for the cognitive network can be derived by our results as the special cases by letting n d = 1 (or m d = 1) and n d = n - 1 (or m d = m - 1), respectively, which enhances the generality of this work.

关键词： Throughput Ad hoc networks Road transportation Slabs Routing Lattices Mobile computing

来源：评论

学校读者我要写书评

暂无评论

Petri net-based real-time scheduling of time-constrained single-arm cluster tools with activity time variation

Petri net-based real-time scheduling of time-constrained sin...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Yan Qiao NaiQi Wu MengChu Zhou Department of Industrial Engineering School of Mechatronics Engineering Guangdong University of Technology Guangzhou China The 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

It is challenging to schedule time-constrained cluster tools subject to activity time variation. With the help of their Petri net model, a real-time control policy is used to offset the activity time variation. Based on it, the schedulability conditions and scheduling algorithms are presented for single-arm cluster tools. The schedulability conditions can be analytically checked. Algorithms are developed based on analytical expressions such that it is also computationally efficient. The schedule obtained by the scheduling algorithms together with a real-time control policy forms the real-time schedule. It is optimal in terms of cycle time.

关键词： Robots Semiconductor device modeling Schedules Load modeling Real time systems Manganese Bismuth

来源：评论

学校读者我要写书评

暂无评论

Reconstructing 3D human poses from uncalibrated monocular images with strong perspective effects

引用

Journal of Computational Information Systems 2012年第15期8卷 6437-6445页

作者： Chen, Shu Peng, Xiaoning School of Information Engineering Xiangtan Universtiy Xiangtan 411105 China Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Xiangtan 411105 China School of Information Science and Engineering Central South University Changsha 410083 China Department of Computer Science and Technology Huaihua College Huaihua 418008 China

This paper present a geometric method to reconstruct human motion pose from 2D point correspondences obtained from uncalibrated monocular images. The proposed algorithm can handle images with very strong perspective effects, which is guaranteed by the fact that only one scale factor corresponding to the root joint in the skeleton model is required estimating. To take fully advantage of this fact, a system of two nonlinear equations with two variables to estimate the scale factor of the root joint is established, and the scale factor of the root joint is optimized by the Gauss-Newton iterative scheme. At last, a framework to reconstruct human motion pose is presented. Quantitive analysis of the experiment results based on several real monocular video sequences shows the accuracy of the scale factor as well as the accuracy of the pose reconstruction. © 2012 Binary Information Press.

关键词： Nonlinear equations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：