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

IEEE International Symposium on Consumer Electronics (ISCE)

作者： Jun'ichi Shimada Nobumasa Natsui Hitomi Tamura Takeshi Ikenaga Masato Uchida Yuji Oie Graduate School of Computer Sciences & System Engineering Kyushu Institute of Technology Japan Graduate School of Engineering Kyushu Institute of Technology Japan Network Design Research Center Kyushu Institute of Technology Japan

Congestion inherently occurs on the network that are shared among several autonomous users due to traffic concentration on certain links. Such an imbalanced traffic load can be caused by network topological features or frequently and independently changing traffic loads. In terms of the topology, it has recently been demonstrated that the Internet has the scale-free property in its topology, which is defined by a power-law distribution in the number of links per node. In the present paper, we focus on the effect of the scale-free property on the traffic load concentration, and study traffic engineering (TE) scheme to address such issue. We propose a path selection scheme for traffic load distribution, which is a sort of TE scheme, considering the scale-free property of the network topology. The simulation results show that the proposed scheme is very effective in distributing the traffic load over scale-free networks.

关键词： Telecommunication traffic network topology Tellurium Traffic control IP networks Resource management Throughput Consumer electronics computer networks Distributed computing

来源：评论

学校读者我要写书评

暂无评论

Generating the semantic containers for the query interfaces of deep web

Generating the semantic containers for the query interfaces ...

引用

International Conference on Management and Service Science, MASS 2009

作者： Hao, Liang Wanli, Zuo Jian, Chen Yunge, Mao College of Computer Science and Technology Jilin University Changchun 130012 China Department of Information Changchun Taxation College Changchun 130117 China Key Laboratory of Symbol Computation Knowledge Engineering of the Ministry of Education Changchun 130012 China Network Center of Changchun Taxation College Changchun 130117 China

ISBN: (纸本)9781424446391

With the myriad emergence of the online Web Database, the Web is divided into a two layers information platform which is composed of Surface Web and Deep Web. The huge information hidden in the Deep Web is higher in the quality than the Surface Web. This interests the researchers of the traditional Database community. In order to adapt the Web community, the idea of information fusion is further transformed. However, the nature of the Web is great different from the Database in structure, principle and function. Query reformulation is one of the technical challenges. The only accessible method to get the information in the Deep Web is through the query interfaces provided by the Website of Deep Web. There are many semantic restrictions between the attributes in the query interface. Some attributes are co-occurred and the others are exclusive sometimes. To generate a valid query, we have to reconcile the key attributes and their semantic relations. To address the problem, a method based on the HTML codes is presented in this paper. Different kinds of semantic containers can be got through analyzing the codes of the query interface. The experiment is carried out on the famous Dataset of Deep Web to show the feasibility of the method. ©2009 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Overlay routing with Acceptable Waiting Time for unstably fluctuated network environments

Overlay routing with Acceptable Waiting Time for unstably fl...

引用

International Conference on Information networking

作者： Yuya Yamada Hitomi Tamura Masato Uchida Masato Tsuru Yuji Oie Graduate School of Computer Science and Systems Engineering Kyushu Institute of Technology Japan Kyushu Research Center National Institute of Information and Communications Technology Japan Network Design Research Center Kyushu Institute of Technology Japan

ISBN: (纸本)9781424445264

Overlay routing can be used as a Traffic engineering (TE) technique to realize efficient resource utilization and load balancing in the current wired Internet. Conventional overlay routing uses a detour path immediately upon quality degradation of the default path. However, with the widespread use of mobile and wireless communication technologies, conventional overlay routing faces several significant challenges such as intermittent connectivity and high packet loss rate resulting from the instability of network environments. Therefore, this paper proposes a novel TE technique based on overlay routing that has an Acceptable Waiting Time (AWT), which allows the overlay node to await the quality recovery of the default path, instead of employing the detour path immediately upon the quality degradation of the default path. Simulation results show that the proposed scheme can deal with instability of path condition.

关键词： Routing Telecommunication traffic Tellurium Disruption tolerant networking Degradation Design engineering Communications technology IP networks Traffic control computer science

来源：评论

学校读者我要写书评

暂无评论

Research and Design of Internet Public Opinion Analysis System

Research and Design of Internet Public Opinion Analysis Syst...

引用

IITA International Conference on Services Science, Management and engineering, SSME

作者： Quanlong Guan Saizhi Ye Guoxiang Yao Huanming Zhang Linfeng Wei Gazi Song Kejing He Network and Education Technology Center Jinan University Guangzhou China Information Science Technology College Jinan University Guangzhou China School of Computer Science and Engineering South China University of Technology Guangzhou China

Internet is becoming a spreading platform for the public opinion. It is important to grasp the Internet public opinion in time and understand the trends of their opinion correctly. Text classification plays a fundamental role in a number of information management and retrieval tasks. But Web-page classification is much more difficult than pure-text classification due to a large variety of noisy information embedded in Web pages. In this paper, we propose a system scheme for the analysis of the Internet public opinion (IPO). We apply Web-page classification through summarization to extract the most relevant content from the Web pages and then pass them to standard text classification algorithms (NB or SVM). We comprehensive use text classification and text clustering algorithms, which have been shown to be efficient and effective for singly using. Through the result of the experiment,we have proved the superiority of the system systempsilas architecture in the system design.

关键词： Internet Text categorization Web pages Clustering algorithms Information management Information retrieval Data mining Classification algorithms Niobium Support vector machines

来源：评论

学校读者我要写书评

暂无评论

An Efficient Mesh Simplification Algorithm

An Efficient Mesh Simplification Algorithm

引用

International Conference on Internet Computing in Science and engineering (ICICSE)

作者： Hailing Wang Guisheng Yin Jing Zhang Decai Wang Jian Wang National Defence Key Laboratory of Autonomous Underwater Vehicle Technology Harbin Engineering of Technology Harbin Heilongjiang China Harbin Engineering University Harbin Heilongjiang CN College of Computer Science and Technology Harbin Engineering of Technology Harbin Heilongjiang China Network and Information center Harbin Engineering of Technology Harbin Heilongjiang China

This paper presents a new mesh simplification algorithm based on edge collapse, it combines surface curvature and quadric error metric, the position of a new vertex for edge collapse depends on multiple-weighted approach. The new algorithm can improve simplification rationality in procedure and preserve important features after simplification. In an addition, we do some experiments with comparing different simplified models, the results show that the new algorithm not only maintains the overall appearance for models, but also obtains better effectiveness.

关键词： Automotive engineering Maintenance engineering computer errors Solid modeling Iterative algorithms IP networks computer networks Laboratories Underwater vehicles Educational institutions

来源：评论

学校读者我要写书评

暂无评论

K-way tree classification based on semi-greedy structure applied to multisource remote sensing images

K-way tree classification based on semi-greedy structure app...

引用

IEEE International Symposium on Geoscience and Remote Sensing (IGARSS)

作者： Yang-Lang Chang Zhi-Ming Chen Jyh-Perng Fang Wei-Lieh Hsu Wen-Yew Liang Tung-Ju Hsieh Hsuan Ren Kun-Shan Chen Department of Electrical Engineering National Taipei University of Technology Taipei Taiwan Department of Computer Science and Information Engineering National Taipei University of Technology Taipei Taiwan Department of Computer Information and Network Engineering Lunghwa University of Science and Technology Taouan Taiwan Center of Space and Remote Sensing Research National Central University Chungli Taiwan

In this paper we present a new supervised classification method, referred to as the k-way tree semi-greedy (KTSG) classifier, for the classification of multisource remote sensing images. The generalized positive Boolean function (GPBF) classifier scheme is recently proposed based on minimum classification error (MCE) criteria to improve classification performance. It makes use of MCE criteria to apply positive and negative samples as training parameters. Unfortunately, the classification performance of GPBF is limited when the number of classes increases. This is occurred in training phase by the unbalanced numbers of positive and negative samples caused by the use of a large number of classes. The proposed KTSG overcomes this drawback by modifying the scheme from the perception of pattern-node based semi-greedy (bottom-up scheme used in GPBF) to the conception of region-based semi-greedy (also known as the top-down scheme in KTSG). It is organized by a k-way tree in which every node is composed of a set of k-dimensional positive and negative labeled samples as represented as a percentage, i.e. the corresponding ratio of number of a specific (positive) class samples to the total number of the other (negative) classes. It iteratively divides the d-dimensional hyperplane into 2 d subspaces according to the centroids of the labeled (training) samples of all classes. The statistical ratios between different classes are then compared as a basis for stopping the new subspace separation and identifying which subspace belongs to which class. By delivering both positive and negative samples of different classes to KTSG learning modules, KTSG outperforms GPBF and traditional classifiers in terms of classification accuracies. The effectiveness of the proposed KTSG is evaluated by fusing MODIS/ASTER airborne simulator (MASTER) hyperspectral images and airborne synthetic aperture radar (AIRSAR) images for land cover classification during the Pacrim II campaign.

关键词： Classification tree analysis Remote sensing Space technology Boolean functions Hyperspectral sensors Hyperspectral imaging Error analysis computer science computer networks MODIS

来源：评论

学校读者我要写书评

暂无评论

Spigot: Fragment-Level File Sharing and Consistency on Grids

Spigot: Fragment-Level File Sharing and Consistency on Grids

引用

International Conference on Advanced Information networking and Applications (AINA)

作者： Po-Cheng Chen Jyh-Biau Chang Jia-Hao Yang Yi-Chang Zhuang Ce-Kuen Shieh Department of Electrical Engineering National Cheng Kung University Taiwan Department of Computer Science and Applications Leader University Taiwan Home Network Technology Center Industrial Technology Research Institute/South Taiwan

Conventional data grid systems require the application to access remote data through explicit APIs, consequently sacrificing user transparency. Thus, some systems enable the application to transparently access remote data by copying the entire file to a userpsilas local storage before executing the application, even when only a tiny file fragment is required. Such an approach consumes unnecessary transmission time and storage space, with the additional problem of maintaining replica synchronization. Traditionally, replica consistency treats shared files as read-only, consequently sacrificing guaranteed replica consistency. This paper presents a DSM-based fragment-level file sharing framework called ldquoSpigotrdquo. Spigot allows the users to design their applications with the POSIX I/O interface. Moreover, Spigot transfers only the necessary file fragments on user demand, thereby reducing transmission time, wasted network bandwidth and required storage space. Data waiting time is further reduced by overlapping data transmission and data analysis. The DSM concept maintains replica synchronization. Real experiments show reduced turnaround times in data-intensive applications.

关键词： Peer to peer computing Application software Grid computing Data communication Computational modeling File servers computer networks Home computing computer science Home automation

来源：评论

学校读者我要写书评

暂无评论

Study and implementation of cw algorithm based on multi-constraint

引用

ICIC Express Letters 2009年第2期3卷 201-206页

作者： Zhang, Cheng Zhang, Jing Li, Jijnhijai Wang, Pengkai Ren, Linyijan School of Computer Science and Engineering Xi'an University of Technology Xi'an 710048 China Network Center Yan'an University Yan'an 716000 China Department of Mathematics and Physics Xi'an Technological University Xi'an 710032 China

How to satisfy demands of the clients in an accurate and efficient way demonstrates to be an essential factor for the prestige of the enterprises. Currently, the ratio between overhead expenses of logistics and GDP in China still exceeds 2.3%, while it is only 0.4% in America and Japan. In order to saving transportation cost and satisfying requirements of clients, this paper illustrates the algorithm of service-dispatching. And due to superior advantages of CW algorithm, this paper revises the original CW algorithm which is only suitable in an ideal condition to solve VRP, and proposes the saving CW algorithm that imports some constraint conditions and the coefficients to resolve the vehicle-dispatching problem. Then this algorithm is further illustrated by a flow chart of the revised CW algorithm. Finally, on the basis of our revised algorithm, a practical instance is analyzed and implemented which demonstrates a superior performance than the original. © 2009 ISSN.

关键词： CW algorithm Enterprise service Vehicle-dispatching VRP

来源：评论

学校读者我要写书评

暂无评论

Criminal behavior analysis based on Complex networks theory

Criminal behavior analysis based on Complex Networks theory

引用

IEEE International Symposium on Information (IT) in Medicine and Education, ITME

作者： Hong Wang Zhao-wen Wang Jian-bo Li Qiu-hong Wei Institute of Information Science and Engineering ShanDong Normal University China Institute of Computer Science and Technology ShanDong University JiNan China Network Information Center Shandong Jianzhu University JiNan China

A criminal location relationship network model based on complex networks theory is set up in this paper. By the research of this criminal location relationships network, a real weighted network, a number of methods and knowledge which are ignored by experts and scholars in their research are found here. Firstly, the criminal location relationship network model is built by using a considerable number of real data. Then, the criminal location relationship network is projected to other weighted networks: the criminal-location-case relationship network and the criminal-location-number relationship network. Finally, the two weighted networks above are simulated and analyzed.

关键词： Complex networks Analytical models Collaboration Humans Information science computer science Costs Psychology Stress Biological system modeling

来源：评论

学校读者我要写书评

暂无评论

Characterizing Transactions on Multi-server Systems

Characterizing Transactions on Multi-server Systems

引用

International Conference on Intelligent networking and Collaborative Systems (INCOS)

作者： Dirceu Cavendish Yuji Oie Hiroshi Koide Mario Gerla Network Design Research Center Kyushu Institute of Technology Iizuka Japan Department of CS and Systems Engineering Kyushu Institute of Technology Iizuka Japan Computer Science Department University of California Los Angeles Los Angeles USA

In this paper, we demonstrate how to characterize transactions executed on multi-server systems. The characterization is performed with the help of readily available open source components, and is used to build a mean value analysis model in order to estimate transaction response times for arbitrary loads, as well as system capacity. Although an e-commerce system is used, the characterization method described is applicable to any multi-server system.

关键词： Web server Delay Protocols Performance analysis Routing Filtering Intelligent networks International collaboration Design engineering Systems engineering and theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：