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

IEEE Global Communications Conference

作者： Kai Lei Jie Yuan Jiawei Wang Shenzhen Key Lab for Cloud Computing Technology and Applications (SPCCTA) School of Electronics and Computer Engineering Peking University

ISBN: (纸本)9781479959532

Forwarding strategy is the key feature of Named Data Networking (NDN) to realize dynamic, adaptive and intelligent forwarding, but work in this area is still at a very preliminary stage. In this paper, selecting which forwarding interface among multiple alternatives in NDN is defined as a multiple attribute decision making (MADM) problem and a maximizing deviation based probabilistic forwarding (MDPF) strategy is proposed to select forwarding interface on probability. Since multiple network metrics such as interface status, pending Interest numbers are considered together, each alternative interface's availability is obtained more accurately. Thus, better content delivery efficiency can be achieved. In addition, MDPF provides good extensibility, as any appropriate metric can be added to enhance or customize it. We implement the proposal in ndnSIM and compare it with BestRoute and PI-based strategies under various topologies and scenarios. Experimental results show that MDPF strategy is more responsive and sensitive to network changes, and can realize higher throughput, lower drop rate as well as better load balance.

关键词： NDN gene Work area delivery efficiency

来源：评论

学校读者我要写书评

暂无评论

Contracting of web services with constraint handling rules

Contracting of web services with constraint handling rules

引用

2012 IEEE 8th World Congress on Services, SERVICES 2012

作者： Chen, Ruoyu Liao, Lejian Fang, Zhi Beijing Eng. Res. Ctr. of High Vol. Language Information Processing and Cloud Computing Applications Multi-living-agent Information System Key Laboratory Beijing Institute of Technology Beijing 100081 China

ISBN: (纸本)9780769547565

In e-service environment, service contract is important for assurance of business interoperability and quality of services. Combining service contract and process model will facilitate analyzing service process and monitoring service execution. This paper proposes a service modeling approach consists of service contract and process model. Service contracts are used as service advertisement and service request in this approach. The operational semantics of service contract and process model are translated into Constraint Handling Rules(CHR) program by a compiler. Based on this approach, a concept named service contracting is defined as a phase between service discovery and execution, which checks the consistency of service advertisement and process model as well as the the applicability of services w.r.t. the consumer's capabilities. Further, constraint solver centered implementation is designed, the modeling and contracting of web services under this architecture is illustrated. © 2012 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Incorporating language patterns and domain knowledge into feature-opinion extraction

Incorporating language patterns and domain knowledge into fe...

引用

17th International Conference on Text, Speech, and Dialogue, TSD 2014

作者： Zhou, Erqiang Luo, Xi Qin, Zhiguang School of Computer Science and Engineering University of Electronic Science and Technology of China No.2006 Xiyuan Ave Chengdu 611731 Sichuan China Guangdong Key Laboratory of Popular High Performance Computers Shenzhen Key Laboratory of Service Computing and Applications No. 3688 Nanhai Ave Shenzhen 518060 Guangdong China

ISBN: (纸本)9783319108155

We present a hybrid method for aspect-based sentiment analysis of Chinese restaurant reviews. Two main components are employed so as to extract feature-opinion pairs in the proposed method: domain independent language patterns found in Chinese and a lexical base built for restaurant reviews. The language patterns focus on the general knowledge which is implicit contained in Chinese, thus can be used directly by other domains without any modification. The lexical base, on the other hand, targets for particular characteristics of a given domain and acts as a plug-in part in our prototype system, thus does not affect the portability when applying the proposed approach in practice. Empirical evaluation shows that our method performs well and it can gain a progressive result when each component takes into effective. © 2014 Springer International Publishing.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Enhancing ability of fault detection for component systems based on object interactions graph

Enhancing ability of fault detection for component systems b...

引用

2012 International Conference on Emerging Technologies for Information Systems, computing, and Management, ICM 2012

作者： Sun, Fuzhen Liao, Lejian Du, Jianguang Li, Guoqiang Beijing Eng. Res. Ctr. of High Vol. Language Information Processing and Cloud Computing Applications Beijing Key Laboratory of Intelligent Information Technology School of Computer Science Beijing China School of Computer Science and Technology Shandong University of Technology Zibo China

ISBN: (纸本)9781461470090

Test case prioritization is a technique to schedule the test case in order to maximize some objective function. Early fault detection can provide a faster feedback generating a scope for debuggers to carry out their task at an early stage. In this paper, a method is proposed to prioritize the test cases for testing component dependency in a Component Based Software Development (CBSD) environment using Greedy Approach. The OIG (Object Interaction Graph) is traversed to calculate the total number of inter component object interactions and intra component object interactions. Depending upon the number of interactions, the objective function is calculated and the test cases are ordered accordingly. This technique is applied to the components developed in Java for a software system and found to be very effective in early fault detection as compared with non-prioritize approach. © 2013 Springer Science+Business Media New York.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

Nonlinear optical response of niobium telluride and its application for demonstrating pulsed fiber lasers

引用

Journal of Materiomics 2024年第2期10卷 355-365页

作者： Xinxin Shang Yule Zhang Tuo Li Huanian Zhang Xiaofeng Zou S.Wageh Ahmed A.Al-Ghamdi Han Zhang Shuhao Si Dengwang Li Shandong Province Key Laboratory of Medical Physics and Image Processing Technology Shandong Provincial Key Laboratory of Optics and Photonic DeviceSchool of Physics and ElectronicsShandong Normal UniversityJinan250014China Institute of Microscale Optoelectronics College of Physics and Optoelectronic EngineeringShenzhen UniversityShenzhen518060China Shandong Yunhai Guochuang Cloud Computing Equipment Industry Innovation Co. Ltd.JinanShandongChina School of Physics and Optoelectronic Engineering Shandong University of TechnologyZibo255049China Department of Physics Faculty of ScienceKing Abdulaziz UniversityJeddah21589Saudi Arabia

Niobium telluride(NbTe_(2)),a kind of few-layer two-dimensional(2D)transition metal dichalcogenides(TMDs)material,has been theoretically predicted with nonlinear absorption properties and excellent optical ***,we experimentally demonstrated an Er-doped fiber(EDF)laser based NbTe_(2)as saturable absorber(SA).Few-layer NbTe_(2)nanosheets were successfully prepared by adopting the commonly used liquid-phase exfoliation(LPE)*** nonlinear optical response of highly stable few-layer NbTe_(2)was investigated through an open-aperture Z-scan laser measurement,the nonlinear absorption coefficient was 2.45×10^(-11)m/*** Q-switched and mode-locked operation centered at 1559 nm were recorded based on NbTe_(2)*** pulse duration was varied from 4.88 ms to 1.75 ms,and the adjustable range of repetition frequency is changed from 44.01 kHz to 64.12 kHz in passively Q-switched ***,a constant repetition rate of 5.33 MHz and pulse width of 2.67 ps were observed in mode-locked *** experimental results fully reveal the nonlinear optical prop-erties of NbTe_(2)used in pulsed fiber lasers and broaden its ultrafast applications in the optics field.

关键词： Niobium telluride Saturable absorber Z-scan Mode-locked pulse Fiber laser

来源：评论

学校读者我要写书评

暂无评论

G-MAP: General Memory-Augmented Pre-trained Language Model for Domain Tasks

G-MAP: General Memory-Augmented Pre-trained Language Model f...

引用

2022 Conference on Empirical Methods in Natural Language Processing, EMNLP 2022

作者： Wan, Zhongwei Yin, Yichun Zhang, Wei Shi, Jiaxin Shang, Lifeng Chen, Guangyong Jiang, Xin Liu, Qun Guangdong Provincial Key Laboratory of Computer Vision and Virtual Reality Technology Shenzhen Institute of Advanced Technology Chinese Academy of Science China University of Chinese Academy of Sciences China Huawei Noah's Ark Lab Huawei Cloud Computing Zhejiang Lab China

Recently, domain-specific PLMs have been proposed to boost the task performance of specific domains (e.g., biomedical and computer science) by continuing to pre-train general PLMs with domain-specific corpora. However, this Domain-Adaptive Pre-Training (DAPT;Gururangan et al. (2020)) tends to forget the previous general knowledge acquired by general PLMs, which leads to a catastrophic forgetting phenomenon and sub-optimal performance. To alleviate this problem, we propose a new framework of General Memory-Augmented Pre-trained Language Model (G-MAP), which augments the domain-specific PLM by a memory representation built from the frozen general PLM without losing any general knowledge. Specifically, we propose a new memory-augmented layer, and based on it, different augmented strategies are explored to build the memory representation and then adaptively fuse it into the domain-specific PLM. We demonstrate the effectiveness of G-MAP on various domains (biomedical and computer science publications, news, and reviews) and different kinds (text classification, QA, NER) of tasks, and the extensive results show that the proposed G-MAP can achieve SOTA results on all tasks. © 2022 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Entropy-based Probabilistic Forwarding Strategy in Named Data Networking

An Entropy-based Probabilistic Forwarding Strategy in Named ...

引用

IEEE International Conference on Communications

作者： Kai Lei Jiawei Wang Jie Yuan Institute of Big Data Technologies Shenzhen Key Lab for Cloud Computing Technology & Applications School of Electronics and Computer Engineering (SECE) Peking University

ISBN: (纸本)9781467364300

The forwarding strategy is the key to the resiliency and efficiency of Named Data Networking (NDN), which is a new and fundamental research area. For forwarding strategy, dynamically selecting an optimal interface from multiple alternative interfaces to forward an Interest packet is indeed a multiple attribute decision making (MADM) problem. In this paper, an entropy-based probabilistic forwarding (EPF) strategy is proposed to make a stochastic interface selection based on the combination of interfaces' dynamic availabilities and static routing information, which achieves better load balance in comparison with deterministic interface selection. By objectively assigning weights to attributes and considering multiple real-time network condition metrics, EPF can obtain the availabilities of interfaces more accurately and comprehensively. Since additional network metrics can be easily added and integrated into interfaces' assessment model, EPF provides good extensibility. In addition, we innovatively define two parameters (γ, δ) which can be used to trade off the effect factors between static routing information and dynamic running status of interfaces to customize EPF strategy for different network and application scenarios. Experiments show that EPF can realize preferable load balance and achieve higher throughput compared to the representative BestRoute forwarding strategy.

关键词： Entropy Throughput Routing Probabilistic logic Load modeling Packet loss

来源：评论

学校读者我要写书评

暂无评论

IFS-RL: An intelligent forwarding strategy based on reinforcement learning in named-data networking

IFS-RL: An intelligent forwarding strategy based on reinforc...

引用

2018 ACM SIGCOMM Workshop on Network Meets AI and ML, NetAI 2018

作者： Zhang, Yi Xu, Kuai Bai, Bo Lei, Kai Shenzhen Key Lab for Cloud Computing Technology and Applications School of Electronic and Computer Engineering Peking University Shenzhen China School of Mathematical and Natural Sciences Arizona State University Arizona United States Future Network Theory Lab 2012 Labs Huawei Technologies Co. Ltd. Shatin N.T. Hong Kong

ISBN: (纸本)9781450359115

Named-Data Networking (NDN) is a new communication paradigm where network primitives are based on named-data rather than host identifiers. Compared with IP, NDN has a unique feature that forwarding plane enables each router to select the next forwarding hop independently without relying on routing. Therefore, forwarding strategies play a significant role for adaptive and efficient data transmission in NDN. Most of the existing forwarding strategies use fixed control rules based on simplified or inaccurate models of the deployment environment. As a result, existing schemes inevitably fail to achieve optimal performance across a broad set of network conditions and application demands. In this paper, We propose IFS-RL, an intelligent forwarding strategy based on reinforcement learning. IFS-RL trains a neural network model which chooses appropriate interfaces for the forwarding of Interest based on observations collected by routing node. Not relying on pre-programmed models, IFS-RL learns to make decisions solely through observations of the resulting performance of past decisions. Therefore, IFS-RL can implement intelligent forwrarding which adapt to a wide range of network conditions. Besides, we also researches the learning granularity and the enhancement for network topology change. We compare IFS-RL to state-of-the-art forwarding strategies in ndnSIM. Experimental results show that IFS-RL can achieve higher throughput and lower packet drop rates. © 2018 Association for computing Machinery.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：