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

作者： Ewender, Thomas Pfister, Beat Speech Processing Group Computer Engineering and Networks Laboratory ETH Zurich Switzerland

This paper describes a new approach to pitch marking. Unlike other approaches that use the same combination of features for the whole signal, we take into account the signal properties and apply different features according to some heuristic. Basically we use a special type of energy contour for pitch marking. Where the energy information turns out to be not suitable as an indicator we resort to the fundamental wave computed from a contiguous F 0 contour in combination with detailed voicing information. Our experiments demonstrate that the proposed pitch marking algorithm clearly improves the quality of synthe-sised speech generated by a concatenative text-to-speech system that uses TD-PSOLA for prosodic modifications. © 2010 ISCA.

关键词： Speech synthesis

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of elastic optical networks (EONs) switches under unicast traffic

引用

Iran Journal of computer Science 2019年第2期2卷 125-129页

作者： Abkenar, Forough Shirin Rahbar, Akbar Ghaffarpour Shamsi, Mousa Computer Networks Research Laboratory Electrical Engineering Technologies Research Center Sahand University of Technology Tabriz Iran

Bandwidth variable-wavelength cross connect switches (BV-WXCs) play an important role in the routing and spectrum assignment (RSA) problem in elastic optical networks (EONs). These switches, whose structure has been derived from micro electro mechanical systems technology, aim to switch the incoming traffic flexibly such that the existing resources are not wasted and more requests can be served. There exist different quality of service parameters which have to be provided in EON, such as delay, loss, jitter, and so forth. Among these parameters, blocking probability (BP) has been always taken into account in EON and several researches have been done to address it. The main objective of most RSA algorithms is to alleviate BP of requests through efficient usage of resources, such as frequency slots and BV-WXC ports. To show the importance of BV-WXC in routing and resource assignment in EON, its performance is analyzed in this paper. The BP of the BV-WXC is evaluated by means of an analytical model under unicast traffic and the obtained results are compared to the blocking probability results acquired from simulations for different number of input/output ports and available resources. The obtained results show that the analytical model has a good agreement with the simulation results. © Springer Nature Switzerland AG 2019.

关键词： Bandwidth variable-wavelength cross connect switch (BV-WXC) Blocking probability (BP) Elastic optical networks (EONs) Unicast traffic

来源：评论

学校读者我要写书评

暂无评论

Deterministic and Stochastic Simulators for Non-Isotropic V2V-MIMO Wideband Channels

引用

China Communications 2018年第7期15卷 18-29页

作者： Yiran Li Xiang Cheng Nan Zhang State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Engineering and Computer Science Peking University Wireless Algorithm Department Product Research and Development System ZTE Corporation

In this paper, we consider a novel two-dimensional(2D) geometry-based stochastic model(GBSM) for multiple-input multiple-output(MIMO) vehicle-to-vehicle(V2V) wideband fading channels. The proposed model employs the combination of a two-ring model and a multiple confocal ellipses model, where the signal is sum of the line-of-sight(Lo S) component, single-bounced(SB) rays, and double-bounced(DB) rays. Based on the reference model, we derive some expressions of channel statistical properties, including space-time correlation function(STCF), Doppler spectral power density(DPSD), envelope level crossing rate(LCR) and average fade duration(AFD). In addition, corresponding deterministic and stochastic simulation models are developed based on the reference model. Moreover, we compare the statistical properties of the reference model and the two simulation models in different scenarios and investigate the impact of different vehicular traffic densities(VTDs) on the channel statistical properties of the proposed model. Finally, the great agreement between simulation models and the reference model demonstrates not only the utility of simulation models, but also the correctness of theoretical derivations and simulations.

关键词： vehicle-to-vehicle wideband channels simulation model statistical properties

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of the deadline credit scheduling algorithm for soft-real-time applications in distributed video-on-demand systems 2nd

引用

2nd International IFIP-TC6 Networking Conference, NETWORKING 2002

作者： Alexandraki, Adamantia Paterakis, Michael Technical University of Crete Department of Electronics and Computer Engineering Laboratory of Information and Computer Networks ChaniaGR-731-00 Greece

ISBN: (纸本)3540437096

In this work we investigate a promising scheduling algorithm referred to as the Deadline Credit (DC) algorithm, which exploits the available bandwidth and buffer space in communication networks to serve a diverse class of prerecorded video applications. We provide simulation results when the DC algorithm is applied to a hierarchical architecture distributed VoD network, which fits the existing tree topology used in today’s cable TV systems. The issues investigated via the simulations are: the system utilization, the influence of the buffer space on the delivered QoS, and the fairness of the scheduling mechanism. We examine cases with homogenous and diverse video streams. We also contribute a modification to the DC algorithm so that in cases when the video applications have different displaying periods, the video streams obtain a fair share of the network’s resources. Finally, we validate our results by simulating actual videos encoded in MPEG-4 and H.263 formats. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Globs in the primordial soup: The emergence of connected crowds in mobile wireless networks 10

Globs in the primordial soup: The emergence of connected cro...

引用

11th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2010

作者： Heimlicher, Simon Salamatian, Kavé Computer Engineering and Networks Laboratory ETH Zurich Switzerland LISTIC-PolyTech Université de Savoie France

ISBN: (纸本)9781450301831

In many practical scenarios, nodes gathering at points of interest yield sizable connected components (clusters), which sometimes comprise the majority of nodes. While recent analysis of mobile networks focused on the process governing node encounters ("contacts"), this model is not particularly suitable for gathering behavior. In this paper, we propose a model of stochastic coalescence (merge) and fragmentation (split) of clusters. We implement this process as a Markov chain and derive analytically the exact stationary distribution of cluster size. Further, we prove that, as the number of nodes grows, the clustering behavior converges to a mean field, which is obtained as a closed-form expression. This expression translates the empirical merge and split rate of a scenario, a microscopic property, to an important macroscopic property-the cluster size distribution-with surprising accuracy. We validate all results with synthetic as well as real-world mobility traces from conference visitors and taxicabs with several thousand nodes. Copyright 2010 ACM.

关键词： Taxicabs

来源：评论

学校读者我要写书评

暂无评论

Scheduling with QoS support for multi rate wireless systems with variable channel conditions 12

Scheduling with QoS support for multi rate wireless systems ...

引用

12th European Wireless Conference on Enabling Technologies for Wireless Multimedia Communications, European Wireless 2006

作者： Gougousis, Alexandros Paterakis, Michael Information and Computer Networks Laboratory Dep. of Electronic and Computer Engineering Technical University of Crete Chania Crete73100 Greece

ISBN: (纸本)9783800729616

Scheduling through wireless shared channels is a very challenging problem because of each user's link-state variations through time. The challenge lies in the support of the quality of service (QoS) of each user under the uncertainty of channel behavior. This problem becomes even more difficult for some of the 2.5G and 3.5G network architectures (e.g EDGE,HSDPA, HDR) where the supported transmission rate can take multiple values and the channel can not be modeled by the traditional ON-OFF model. In this paper we propose Expo-pred-wei, a new scheduling algorithm, which take advantage of the channel variations in order to maximize the total cell throughput and at the same time to preserve, in an efficient way, a minimum QoS for each user. In contrast to other proposed algorithms, our algorithm exhibits very good performance in a wide set of traffic scenarios including Real-Time (RT) or Non-Real-Time (NRT) traffic as well as mixed RT and NRT traffic.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Toward Run-time Detecting and Resolving Service Interactions in Parlay-based Next Generation Intelligent Network

引用

电子学报(英文版) 2006年第2期15卷 307-312页

作者： Xu, Jiuyun Yang, Fangchun School of Computer and Communication Engineering China University of Petroleum Dongying 257061 China State Key Laboratory of Switching Technology and Telecommunication Networks Beijing University of Posts ＆ Telecommunications Beijing 100876 China

This paper presents a novel approach to detecting and resolving service interactions in run-time of the Parlay-Based converged network (PCN) with service intentions. In this paper, we focus on feature interactions in the service layer and propose a novel approach of detecting and resolving feature interactions in run-time based on behavior context of services with the Parlay APIs in the Parlay-based Next generation intelligent network (NGIN). Some theory analysis of the approach is given. With the experiment prototype of the architecture of Parlay-based NGIN as well as the two entities of the Telestar application server entity (TASE) and the Telestar parlay gateway entity (TPGE), we extend the TASE of platform with the Service interaction manager (SIM) to manage the service interactions. At last, some experiment results are given.

关键词：服务交互作用智能网络系统网关运行时间

来源：评论

学校读者我要写书评

暂无评论

Local approximation schemes for ad hoc and sensor networks 05

Local approximation schemes for ad hoc and sensor networks

引用

Proceedings of the 2005 joint workshop on Foundations of mobile computing

作者： Kuhn, Fabian Nieberg, Tim Moscibroda, Thomas Wattenhofer, Roger Computer Engineering and Networks Laboratory ETH Zurich Switzerland Department of Applied Mathematics Universiteit Twente Netherlands

ISBN: (纸本)9781595930927

We present two local approaches that yield polynomial-time approximation schemes (PTAS) for the Maximum Independent Set and Minimum Dominating Set problem in unit disk graphs. The algorithms run locally in each node and compute a (1 + Ε)-approximation to the problems at hand for any given Ε > 0. The time complexity of both algorithms is O(TMIS + log*n/ΕO(1)), where TMIS is the time required to compute a maximal independent set in the graph, and n denotes the number of nodes. We then extend these results to a more general class of graphs in which the maximum number of pair-wise independent nodes in every r-neighborhood is at most polynomial in r. Such graphs of polynomially bounded growth are introduced as a more realistic model for wireless networks and they generalize existing models, such as unit disk graphs or coverage area graphs. Copyright 2005 ACM.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

Equal opportunity fairness in resilient packet rings

Equal opportunity fairness in resilient packet rings

引用

2006 IEEE International Conference on Communications, ICC 2006

作者： Khorsandi, Siavash Shokrani, Arash Lambadaris, Ioannis Department of Computer Engineering Amirkabir University of Technology Tehran Iran Broadband Networks Laboratory Department of Systems and Computer Engineering Carleton University Ottawa Canada

ISBN: (纸本)1424403553

Ring Ingress Aggregated with Spatial Reuse (RIAS) has been proposed as a fairness model for Resilient Packet Rings (RPR) where available bandwidth is allocated among traffic flows in max-min sense. In this paper, we show that in a feedback controlled system such as RPR, this may cause severe under-allocation for long-haul flows and may also result in degradation of total ring throughput. To overcome this problem, we introduce the concept of Equal Opportunity (EO) fairness. Application of this model for bandwidth management in RPR is studied and a new stateful distributed algorithm to calculate per-destination fair rates is developed. The proposed scheme is studied both analytically and through simulations. The simulation results show that using the proposed algorithm, intra-station fairness among local flows at every station is significantly improved. In some cases, imbalances up to 55% between long and short flows are completely removed. An improvement of up to 20% in total ring utilization is also observed. © 2006 IEEE.

关键词： Packet networks

来源：评论

学校读者我要写书评

暂无评论

An accurate model for fair rate calculation in resilient packet rings

An accurate model for fair rate calculation in resilient pac...

引用

Canadian Conference on Electrical and computer engineering 2005

作者： Shokrani, Arash Lambadaris, Ioannis Talim, Jérôme Broadband Networks Laboratory Department of Systems and Computer Engineering Carleton University Ottawa Ont. Canada

Resilient Packet Ring (RPR), which is being standardized as IEEE 802.17, is a new Medium Access Control (MAC) protocol for high-speed metro-area ring networks. RPR supports spatial reuse and therefore requires to ensure fairness among different nodes competing for the ring bandwidth. In order to achieve fairness among nodes, a fairness algorithm is employed at each RPR node. In case of congestion, the fairness algorithm calculates and advertises a fair rate to all upstream nodes contributing to the congestion point. Consequently, the congested node will be able to insert its local traffic into the ring. In this paper, we develop an accurate model for fair rate calculation in the standard RPR fairness algorithm. We first ignore the link propagation delay and model the system using a non-linear discrete-time low-pass filter. We then consider link propagation delay and develop a more realistic model. We verify our model by simulation results and analyze the effect of system parameters on the calculated fair rate. This model can be used to evaluate performance of the RPR standard fairness algorithm in terms of stability and convergence time. © 2005 IEEE.

关键词： Packet networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：