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

2009 4th International Conference on Communications and Networking in China, CHINACOM 2009

作者： Chu, L.W. Zou, S.H. Cheng, S.D. Wang, W.D. Tian, C.Q. State Key Lab. of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Department of Computer Science and Technology Tongji University Shanghai China

ISBN: (纸本)9781424443376

The great challenges of Internet service fault management are uncertainty and noise. To address these challenges, we model the service scenario through a multi-layer management model, and propose an approach using active probing to detect and diagnose faults. This approach uses bipartite Bayesian network as dependency model, binary symmetric channel as noise model, and is composed of two phases: fault detection and fault diagnosis. In first phase, we propose a greedy approximation probe selection algorithm (GAPSA), which selects a minimal set of probes while remaining a high probability of fault detection. In second phase, we propose a fault diagnosis probe selection algorithm (FDPSA), which selects probes to obtain more system information based on symptoms observed in previous phase. Simulation results prove the validity and efficiency of our approach.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

ADAPTIVE MULTI-TASK LEARNING FOR FINE-GRAINED CATEGORIZATION

ADAPTIVE MULTI-TASK LEARNING FOR FINE-GRAINED CATEGORIZATION

引用

IEEE International Conference on Image Processing

作者： Gang Sun Yanyun Chen Xuehui Liu Enhua Wu State Key Lab. of Computer Science Inst. of Software Chinese Academy of Sciences

ISBN: (纸本)9781479983407

Multi-task learning has been proposed to improve the generalization performance by learning multiple tasks jointly. One challenge for this learning paradigm is to effectively seek the shared information across multiple tasks. In this paper, we propose a novel multi-task learning method to adaptively share information. Unlike many existing multi-task learning methods which impose strong assumptions on task relatedness, our method captures the relationships among tasks and identifies the disparities of each task simultaneously, thus can flexibly exploit the shared information. Moreover, we apply it to fine-grained categorization problem, which usually suffers from the difficulties of insufficient training data and high inter-class similarity. The experimental results on two widely used datasets show the superiority of our method compared with some state-of-the-art methods.

关键词： Multi-task learning Fine-grained Image categorization Low-rank Learning methods Religious Missions Learning microparticles PARALLEL PROCESSING (computerS) WWOX gene

来源：评论

学校读者我要写书评

暂无评论

pService: Towards similarity search on peer-to-peer web services discovery

pService: Towards similarity search on peer-to-peer web serv...

引用

1st International Conference on Advances in P2P systems, AP2PS 2009

作者： Zhou, Gang Yu, Jianjun National Digital Switching System Engineering and Technological Research Center 450002 France State Key Lab. of Software Development Environment Beihang University 100191 China Computer Network Information Center Chinese Academy of Sciences 100190 China

ISBN: (纸本)9780769538310

We present the design of pService system for P2P Web services discovery supporting similarity earch with its locality-preserving feature based on modified Skip Graph. In pService, the most important property (e.g. service name) of a service is viewed as the indexing key of a peer node. The other properties are extracted as multiattributes which would be mapped into one-dimensional indices using HSFC (Hilbert Space Filling Curve), and assigned to membership vector of the peer node. These two features help to support similarity search in two aspects: peer nodes with similar indexing keys would be distributed neighborly, peer nodes with similar indices will connect to each other through routing table. Our evaluation showed that the pService performs considerable Web services discovery efficiency. © 2009 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Distributed power and rate allocation with fairness for cognitive radios in wireless ad hoc networks

Distributed power and rate allocation with fairness for cogn...

引用

54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011

作者： Guo, Songtao Zhang, Yunqiang Yang, Yuanyuan State Key Lab. of Power Transmission Equipment and System Security College of Computer Science Chongqing University Chongqing 400044 China Department of Electrical and Computer Engineering Stony Brook University Stony Brook NY 11794 United States

ISBN: (纸本)9781424492688

In this paper, we propose a distributed resource allocation framework for cognitive radio networks by using the orthogonal frequency division multiple access (OFDMA) modulation. We jointly consider the constraints of quality of service (QoS), maximum power, and minimum rates in the network to obtain optimal availab.e subcarrier sets and transmission power. The fairness of resource allocation is guaranteed by incorporating the probability that a subcarrier is occupied into the link capacity expression. We present a distributed subcarrier selection and power allocation algorithm and evaluate the algorithm through simulations. Our results confirm that the proposed algorithm outperforms the existing algorithms in terms of throughput, the number of secondary links admitted, and the fairness of resource allocation. © 2011 IEEE.

关键词： Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

On deploying relays for connected indoor sensor networks

引用

Journal of Communications and Networks 2014年第3期16卷 335-343页

作者： Zhu, Yanmin Xue, Cuiyao Cai, Haibin Yu, Jiadi Ni, Lei Li, Minglu Li, Bo Shanghai Key Lab. of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University China Department of Computer Science and Engineering Shanghai Jiao Tong University China Software Engineering Institute East China Normal University China Shanghai Jiao Tong University Hong Kong University of Science and Technology Hong Kong

This paper considers the crucial problem of deploying wireless relays for achieving a connected wireless sensor network in indoor environments, an important aspect related to the management of the sensor network. Several algorithms have been proposed for ensuring full sensing coverage and network connectivity. These algorithms are not applicable to indoor environments because of the complexity of indoor environments, in which a radio signal can be dramatically degraded by obstacles such as walls. We first prove theoretically that the indoor relay placement problem is NP-hard. We then predict the radio coverage of a given relay deployment in indoor environments. We consider two practical scenarios;wire-connected relays and radio-connected relays. For the network with wire-connected relays, we propose an efficient greedy algorithm to compute the deployment locations of relays for achieving the required coverage percentage. This algorithm is proved to provide a Hn factor approximation to the theoretical optimum, where Hn = 1 +1/2+⋯+1/n= ln(n) +1, and n is the number of all grid points. In the network with radio-connected relays, relays have to be connected in an ad hoc mode. We then propose an algorithm based on the previous algorithm for ensuring the connectivity of relays. Experimental results demonstrate that the proposed algorithms achieve better performance than baseline algorithms. © 2014 KICS.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A Multi-Dimensional Assessment Model and Its Application in E-learning Courses of computer science 20

A Multi-Dimensional Assessment Model and Its Application in ...

引用

21st Annual Conference of the Special Interest Group in Information Technology Education, SIGITE 2020

作者： Luo, Jiwen Lu, Feng Wang, Tao Key Lab. of Parallel and Distributed Computing College of Computer National University of Defense Technology Changsha China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781450370455

computer science is a practical discipline. It is always a great challenge to evaluate students' computer practice using computer-aided means for large scale students. We always need to address problems such as suspected plagiarism and deviation of the overall difficulty factor. In this paper, a multi-dimensional assessment model is designed for CS courses based on the detailed practice processing data in an E-learning system. The model comprehensively evaluates the students' learning process and results in three aspects of correctness, originality, and quality detection. Besides, the teacher can easily participate in the assessment according to their needs. The correctness is an essential requirement, and the originality is based on the clustering results of students' behaviors after clone detection to curb homework plagiarism. SonarQube is used to detect code quality and put forward higher requirements for codes. Manual participation intelligence has improved the flexibility and applicability of the model to a certain extent. We applied this model on the EduCoder online education platform and carried out a comprehensive analysis of 485 students in the Parallel Programming Principles and Practice Class of Huazhong University of science and Technology. Experiment results confirm the distinction, rationality, and fairness of the model in assessing student performance. It not only gives students a credible, comprehensive score in large-scale online practical programming courses but also gives teachers and students corresponding suggestions based on the evaluation results. Furthermore, the model can be extended to other online education platforms. © 2020 ACM.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Image-based BRDF design

Image-based BRDF design

引用

2019 Material Appearance Conference, MAAP 2019

作者： Davis, Ezra Shi, Weiqi Rushmeier, Holly Dorsey, Julie Wu, Hongzhi Department of Computer Science Yale University New HavenCT United States State Key Lab. of CAD&CG Zhejiang University Hangzhou China

Material appearance design usually requires an unintuitive selection of parameters for an analytical BRDF (bidirectional reflectance distribution functions) formula or time consuming acquisition of a BRDF table from a physical material sample. We propose a material design system that can take visual input in the form of images of an object with known geometry and lighting and produce a plausible BRDF table within a class of BRDFs. We use the principal components of a large dataset of BRDFs to reconstruct a full BRDF table from a sparse input of BRDF values at pairs of incoming and outgoing light directions. To get visual user input, we allow the user to provide their own object and then generate guide images with selected lighting directions. Once the user shades the guide images, we construct the reflectance table and allow the user to iteratively refine the material appearance. We present preliminary results for image-based design, and discuss the open issues remaining to make the approach practical for mainstream use. © 2019, Society for Imaging science and Technology.

关键词： Lighting

来源：评论

学校读者我要写书评

暂无评论

Visualization of large hierarchical data by circle packing 06

Visualization of large hierarchical data by circle packing

引用

CHI 2006: Conference on Human Factors in Computing systems

作者： Wang, Weixin Wang, Hui Dai, Guozhong Wang, Hongan Intelligence Engineering Lab. Institute of Software Chinese Academy of Sciences 4# S. Fourth Street Zhong Guan Cun Beijing 100080 China State Key Lab. of Computer Science 4# S. Fourth Street Zhong Guan Cun Beijing 100080 China

ISBN: (纸本)1595931783

In this paper a novel approach is described for tree visualization using nested circles. The brother nodes at the same level are represented by externally tangent circles;the tree nodes at different levels are displayed by using 2D nested circles or 3D nested cylinders. A new layout algorithm for tree structure is described. It provides a good overview for large data sets. It is easy to see all the branches and leaves of the tree. The new method has been applied to the visualization of file systems. Copyright 2006 ACM.

关键词： Data reduction

来源：评论

学校读者我要写书评

暂无评论

A new approach for line recognition in large-size images using hough transform

A new approach for line recognition in large-size images usi...

引用

16th International Conference on Pattern Recognition, ICPR 2002

作者： Song, Jiqiang Cai, Min Lyu, Michael R. Cai, Shijie Dept. Computer Science and Engineering Chinese University of Hong Kong Hong Kong Hong Kong State Key Lab. of Novel Software Technology Nanjing University Nanjing China

ISBN: (纸本)0769516963

Applications of the Hough Transform (HT) have been limited to small-size images for a long time. For large-size images, peak detection and line verification become much more time-consuming. Many HT-based line detection methods are not able to detect line width. This paper proposes a new approach for detecting line segments using HT, with applicability to large size images, especially for those situations where line width is critical. Our approach applies a boundary recorder to eliminate redundant analyses, and employs an image-analysis-based line-verification method to overcome the difficulty of using a threshold to distinguish short lines from noise. It avoids overlapping lines by removing the pixels of detected line segments, a method which is more robust than only clearing the N×N neighborhood. This approach could be easily extended to improved HT methods that perform global accumulation. Experimental results show that this approach is very time efficient for large-size images. © 2002 IEEE.

关键词： Hough transforms

来源：评论

学校读者我要写书评

暂无评论

Graphics recognition from binary images: One step or two steps

Graphics recognition from binary images: One step or two ste...

引用

16th International Conference on Pattern Recognition, ICPR 2002

ISBN: (纸本)0769516963

Recognizing graphic objects from binary images is an important task in many real-life applications. Generally, there are two ways to do the graphics recognition: onestep methods and two-step methods. The former recognizes graphic objects from binary images directly, while the latter consists of vectorization and postprocessing. Neither of them is perfect enough to handle all difficulties. This paper first reviews popular graphics recognition methods to understand their advantages and disadvantages. Next, the performance comparison between two classes of methods is made in two important aspects: the time efficiency and the graphics quality, and the experimental results of time-efficiency comparison of 7 popular methods are also reported. Finally, we propose a new hybrid graphics-recognition paradigm to integrate the advantages of both one-step methods and two-step methods and minimize their disadvantages. The proposed paradigm is capable of recognizing straight lines, arcs, circles and curves efficiently, and is helpful for extracting text images in text-graphics touching cases. © 2002 IEEE.

关键词： Binary images

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：