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

2011 International Symposium on Network Coding(2011网络编码国际会议 NETCOD 2011)

作者： Li Yu Wei Wang Guangxi Zhu Hui Li Dept.of Electronic and Information Engineering Huazhong University of science and Technology Key Lab of Cloud Computing Technology Shenzhen Graduate school Peking University

The method of network coding has been proven a promising solution to fanin conflict problems (traffic flows conflicting at input ports) in multicast switches in previous work. However, this approach is inefficient when applied to frame-based switches because of over-splitting with conventional algorithms. These algorithms do not support the benefits of network coding to be fully realized when ignoring the impact of fanout splitting. In this paper, we employ a self-defined weight for the Maximum Weight Matching (MWM) scheme for multicast switches. The corresponding scheduling algorithm avoids over-splitting to any traffic flow. The so-called Coding-Driven scheduling algorithm can remarkably decrease the minimum time slots required for scheduling, therefore improve the efficiency of network coding method in multicast switches as showed in the empirical results.

关键词： Network coding Optimal scheduling Scheduling Scheduling algorithm Throughput Approximation algorithms Switches

来源：评论

学校读者我要写书评

暂无评论

Exploring the Benefits of Introducing Network Coding into Named Data Networking

Exploring the Benefits of Introducing Network Coding into Na...

引用

IEEE International Conference on Computational Science and Engineering, CSE

作者： Kai Lei Tao Chen Chen Peng Zhi Tan Shenzhen Key Lab for Cloud Computing Technology & Applications (SPCCTA) School of Electronics and Computer Engineering (SECE) Peking University Shenzhen P.R. China GuangDong Poya Information & Technology Co. LTD Guangzhou P.R. China

ISBN: (纸本)9781479979820

In recent years, the focus to optimize network transmission efficiency has evolved to adopt methods that let those intermediate data transferring nodes get involved with routing, forwarding and caching. In other words, the new network architecture designs become in favor of hop-to-hop model, instead of traditional TCP-like end-to-end model. Named data networking is a promising future internet data oriented architecture which uses names instead of addresses and exchanges or forwards interest/data pair packets at each node along the path to route data for delivery. And meanwhile Network coding (NC) is a content oriented and effective method to reduce redundancy, increase network throughput and improve robustness. Nonetheless, due to NDN's current preliminary research, less research has combined these two technologies together. This paper presents some new thoughts to study on the benefits brought by integrating network coding to NDN, which can effectively improve network utilization, strengthen caching privacy, and also promote development of the NDN architecture itself.

关键词： Network coding Security Peer-to-peer computing Communication networks Encoding Bandwidth Internet

来源：评论

学校读者我要写书评

暂无评论

Combining parametric and nonparametric topic model to discover microblog event

Combining parametric and nonparametric topic model to discov...

引用

International Conference on Information Science, Electronics and Electrical Engineering (ISEEE)

作者： Shengbing Liu Li Liu Ruzhong Cheng Peking University Beijing Beijing CN Dept. of Electronic and Computer Engineering South University of Science and Technology of China Shenzhen P.R. China Shenzhen Key Lab for Cloud Computing Technology & Applications (SPCCTA) Peking University Shenzhen P.R. China

Compared with traditional news media, microblog holds overwhelming superiority in fast-diffusion and comprehensive coverage of topics. Microblog becomes an effective, particular and important carrier of affair information and many other text analysis tasks, e.g., event discovering based on microblog have special significance. Common tools of content analysis, such as topic model, however, experience severe data sparsity problems due to short length of microblog. Following previous researchers' idea, such as separating personal interest post from global event post, we further differentiate general topics from event topics and adopt nonparametric method to model the birth and death of event. We conduct experiments on Twitter data set, and the experimental results demonstrate that our method can not only discover event effectively, but also mine higher quality general topics.

关键词： Computational modeling Educational institutions Coherence Media Data models Twitter Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

A NOVEL FRAMEWORK OF ONLINE NETWORK CODING FOR MULTICAST SWITCHES WITH CONSTRAINED BUFFERS

引用

Journal of Electronics(China) 2011年第4期28卷 460-467页

作者： Wang Wei Yu Li Zhu Guangxi Li Hui Wuhan National Laboratory for Optoelectronics Division of Communiction ＆ Intelligent NetworksDepartment of Electronics and Information Engineering Huazhong University of Science and Technology Wuhan 430074 China Shenzhen Key Lab of Cloud Computing Technology ＆ Application Shenzhen Graduate School Peking University Shenzhen 518055 China

Network coding is able to address output conflicts when fanout splitting is allowed for multicast ***,it successfully achieves a larger rate region than non-coding approaches in crossbar ***,network coding requires large coding buffers and a high computational cost on encoding and *** this paper,we propose a novel Online Network Coding framework called Online NC for multicast switches,which is adaptive to constrained ***,it enjoys a much lower decoding complexity by a Vandermonde matrix based approach,as compared to conven-tional randomized network coding Our approach realizes online coding with one coding algo-rithm that synchronizes buffering and ***,we significantly reduce requirements on buffer space,while also sustaining high *** confirm the superior advantages of our contributions using empirical studies.

关键词： Packet switching Multicast Network coding Vandermonde matrix

来源：评论

学校读者我要写书评

暂无评论

Efficient cube computing on an extended multidimensional model over uncertain data

Efficient cube computing on an extended multidimensional mod...

引用

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

来源：评论

学校读者我要写书评

暂无评论

Holistic twig joins based on Sketch Tree

Holistic twig joins based on Sketch Tree

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： JunWen Ji Yue Wang 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

Due to the wide spread of XML and its importance, twig query matching, which has been identified as a core operation in querying XML data, has become a research hotspot. Although a number of algorithms have been proposed recently to process a twig query holistically, existing algorithms can be further improved with the help of the DTD file. In this paper, we (1) proposed the Sketch Tree structure according to the DTD scheme and employed it to translate the queries; (2) proposed a new labeling scheme named Sketch Dewey on the basis of the Sketch Tree to encode not only the elements in XML data but also the query; (3) designed an efficient path matching algorithm called PathCheck and a novel holistic twig join algorithm called TJumperJoin utilizing the Sketch Dewey code. To answer a query, they only need to scan the elements of leaf nodes in the query and benefitting from the Sketch Dewey labeling scheme, they can take advantage of bitwise operation to make acceleration. At last, extensive experiments are performed to examine the efficiency and effectiveness of our proposed techniques.

关键词： XML labeling Algorithm design and analysis Pattern matching Sections Databases Finite element methods

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Self-adapting Algorithm of Redundancy Parameter in TCP-NC

A Dynamic Self-adapting Algorithm of Redundancy Parameter in...

引用

2012 IEEE 14th International Conference on Communication technology

作者： Xudong Fan Hui Li Kai Pan Shenzhen Key Lab for Cloud Computing Technology and Application PKU

ISBN: (纸本)9781467321006

We propose a method of dynamically adjusting redundancy parameter,which can be applied in "Network Coding Meets TCP".It can help solve the packet losses in the TCP layer and be part of the new protocol in the future *** our scheme,we mainly introduce "time-cache" and "time-classification management algorithm" to the network coding layer of the *** analyzing the time difference between the acknowledgements given by the sink,we can give the right value of redundancy parameter using time-classification management algorithm,for choosing a right value of redundancy parameter is very important to mask losses from ***,we give the theoretical analyses of the algorithm and get the optimal solution of redundancy *** a result,network coding can perfectly meet TCP in the lossy links.

关键词： network coding TCP redundancy parameter lossy links

来源：评论

学校读者我要写书评

暂无评论

General Self-repairing Codes for Distributed Storage Systems

General Self-repairing Codes for Distributed Storage Systems

引用

IEEE International Conference on Communications

作者： Hanxu Hou Hui Li Kenneth W. Shum Shenzhen Eng. Lab of Converged Networks Technology Shenzhen Key Lab of Cloud Computing Tech. and App. Shenzhen Graduate School Peking University Shenzhen China Institute of Network Coding The Chinese University of Hong Kong Shatin Hong Kong

In distributed storage systems, a data file is encoded and distributed to storage nodes, such that the data file can be recovered from some subsets of the nodes. Upon the failure of a storage node, we want to repair it efficiently by contacting and downloading some encoded bits from a small number of surviving nodes. Using projective-geometric self-repairing codes (PSRC), proposed by Oggier and Datta, one can repair a failed node by contacting only two nodes. However, in their construction, the number of storage nodes in the storage system is a large number, and thus the storage efficiency is low. In this paper, we investigate how to be more flexible in the number of storage nodes. The proposed code in this paper is called general projective geometric self-repairing codes (GPSRC). GPSRC reduces high redundancy of PSRC, while retains the basic property of PSRC. We present some methods for repairing a failed node, in which the number of contacted surviving nodes is flexible. These repairing methods provide tradeoff between repair-degree and repair-bandwidth.

关键词： Maintenance engineering Vectors Encoding Finite element analysis Bandwidth Galois fields Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Contextual Embedding Learning to Enhance 2D Networks for Volumetric Image Segmentation

arXiv

引用

arXiv 2024年

作者： Wang, Zhuoyuan Sun, Dong Zeng, Xiangyun Wu, Ruodai Wang, Yi National-Regional Key Technology Engineering Laboratory for Medical Ultrasound Guangdong Key Laboratory for Biomedical Measurements and Ultrasound Imaging School of Biomedical Engineering Shenzhen University Medical School Shenzhen University Shenzhen China Lab Shenzhen China Lab Shenzhen China Huawei Cloud Computing Technologies Company Limited China Department of Radiology Shenzhen University General Hospital Shenzhen University Shenzhen China

The segmentation of organs in volumetric medical images plays an important role in computer-aided diagnosis and treatment/surgery planning. Conventional 2D convolutional neural networks (CNNs) can hardly exploit the spatial correlation of volumetric data. Current 3D CNNs have the advantage to extract more powerful volumetric representations but they usually suffer from occupying excessive memory and computation nevertheless. In this study we aim to enhance the 2D networks with contextual information for better volumetric image segmentation. Accordingly, we propose a contextual embedding learning approach to facilitate 2D CNNs capturing spatial information properly. Our approach leverages the learned embedding and the slice-wisely neighboring matching as a soft cue to guide the network. In such a way, the contextual information can be transfered slice-by-slice thus boosting the volumetric representation of the network. Experiments on challenging prostate MRI dataset (PROMISE12) and abdominal CT dataset (CHAOS) show that our contextual embedding learning can effectively leverage the inter-slice context and improve segmentation performance. The proposed approach is a plug-and-play, and memory-efficient solution to enhance the 2D networks for volumetric segmentation. Our code is publicly available at https://***/JuliusWang-7/CE_Block. Copyright © 2024, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

A novel framework of online network coding for multicast switches with constrained buffers

引用

Journal of Electronics 2011年第4期28卷 460-467页

作者： Wang, Wei Yu, Li Zhu, Guangxi Li, Hui Wuhan National Lab. for Optoelectronics Division of Communiction and Intelligent Networks Department of Electronics and Information Engineering Huazhong University of Science and Technology Wuhan 430074 China Shenzhen Key Lab of Cloud Computing Technology and Application Shenzhen Graduate School Peking University Shenzhen 518055 China Department of Electronics and Information Engineering Huazhong University of Science and Technology Wuhan 430074 China

Network coding is able to address output conflicts when fanout splitting is allowed for multicast switching. Hence, it successfully achieves a larger rate region than non-coding approaches in crossbar switches. However, network coding requires large coding buffers and a high computational cost on encoding and decoding. In this paper, we propose a novel Online Network Coding framework called Online NC for multicast switches, which is adaptive to constrained buffers. Moreover, it enjoys a much lower decoding complexity O(n ²) by a Vandermonde matrix based approach, as compared to conventional randomized network coding O(n ³). Our approach realizes online coding with one coding algorithm that synchronizes buffering and coding. Therefore, we significantly reduce requirements on buffer space, while also sustaining high throughputs. We confirm the superior advantages of our contributions using empirical studies. © 2011 Science Press, Institute of Electronics, CAS and Springer-Verlag Berlin Heidelberg.

关键词： Multicast Network coding Packet switching Vandermonde matrix

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：