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

EFFICIENT BIT allocation FOR AN ARBITRARY SET OF QUANTIZERS

IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING 1988年第9期36卷 1445-1453页

作者： SHOHAM, Y GERSHO, A UNIV CALIF SANTA BARBARA DEPT ELECT & COMP ENGNSANTA BARBARACA 93106

A bit allocation algorithm that is capable of efficiently allocating a given quota of bits to an arbitrary set of different quantizers is proposed. This algorithm is useful in any coding scheme which uses bit allocation or, more generally, codebook allocation. It produces an optimal or very nearly optimal allocation, while allowing the set of admissible bit allocation values to be constrained to nonnegative integers. It is particularly useful in cases where the quantizer performance versus rate is irregular and changing in time, a situation that cannot be handled by conventional allocation algorithms.

关键词： optimal allocation speech coding quantizer labeling scheme Nonnegative Integers Arbitrary allocation algorithm allocation

来源：评论

学校读者我要写书评

暂无评论

Distributed and robust resource allocation algorithms for multi-agent systems via discrete-time iterations

Distributed and robust resource allocation algorithms for mu...

引用

IEEE Annual Conference on Decision and Control

作者： Eduardo Ramirez-Llanos Sonia Martinez Department of Mechanical and Aerospace Engineering University of California San Diego 9500 Gilman Dr La Jolla CA 92093

ISBN: (纸本)9781479978878

This paper proposes two novel nonlinear discrete-time distributed algorithms to solve a class of resource allocation problems. The proposed algorithms allow an interconnected group of agents to collectively minimize a global cost function subject to equality and inequality constraints. Under some technical conditions, we show that the algorithms converge to the solution in a practical way as long as the stepsize chosen is sufficiently small. Of particular interest is that the proposed algorithms are designed to be robust so that temporary errors in communication or computation do not change their convergence to a neighborhood around the equilibrium, and to this end, agents do not require global knowledge of total resources in the network or any specific procedure for initialization. The convergence of the algorithms is established via second-order convexity theory together with nonsmooth Lyapunov analysis. To illustrate the applicability of our strategies, we study a virus mitigation problem over computer and human networks.

关键词： Resource utilization algorithms Converge discrete-time management of resources TECHNICAL ASPECTS inequality constraint allocation algorithm iterative methods Cost functions Equality Agents

来源：评论

学校读者我要写书评

暂无评论

High-reliability and low-complexity resource allocation for future multicarrier spread spectrum systems

引用

TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES 2018年第10期29卷

作者： Shi, Jia Xiao, Pei Liang, Wei Pan, Gaofeng Li, Zan Xidian Univ State Key Lab Integrated Serv Networks Xian Shaanxi Peoples R China Univ Surrey Innovat Ctr 5G Guildford GU1 2XH Surrey England Northwestern Polytech Univ Dept Commun Engn Xian Shaanxi Peoples R China Southwest Univ Chongqing Peoples R China

In this paper, we investigate resource allocation in the multicarrier spread spectrum systems, especially in the multicell downlink multicarrier direct-sequence code division multiple-access systems. The allocation of resources including subcarriers and spreading codes aims to maximize the system reliability, thereby resulting in the high-reliability mutlicarrier systems. For the sake of achieving low complexity, we develop the novel resource allocation framework. We propose two resource allocation algorithms, which are the simplified heuristic subcarrier- and code-allocation (SHSC) algorithm and the enhanced heuristic subcarrier- and code-allocation (EHSC) algorithm. The two proposed algorithms can find the promising suboptimum solutions to the mixed integer nonconvex resource allocation problem. The SHSC algorithm has lower complexity and demands less backhaul resources than the EHSC algorithm. In return, the EHSC algorithm performs better than the SHSC algorithm. Nevertheless, we show that both algorithms significantly outperform the existing algorithms while approaching the optimal algorithm of high complexity.

关键词： Optimization algorithms allocation algorithm algorithms Resource utilization management of resources SPREAD SPECTRUM Sake Subcarriers

来源：评论

学校读者我要写书评

暂无评论

Multi-Value Models for allocation of Software Component Development Costs Based on Trustworthiness

引用

IEEE ACCESS 2020年 8卷 122673-122684页

作者： Wang, Mengyue Ma, Yanfang Li, Guanru Zhou, Wei Chen, Liang Huaibei Normal Univ Sch Comp Sci & Technol Huaibei 235000 Peoples R China Huaibei Normal Univ Sch Math Sci Huaibei 235000 Peoples R China

The trustworthiness of software is an important attribute. The cost of software development increases with its improvement by software trustworthiness. As one of main methods of software development, component-based software development can reduce development costs to a certain extent. However, it is important to study how to allocate the given development costs to each component so that software trustworthiness can be optimized. First, multi-value models for allocation of software component development costs are established based on different structures of software system. Second, algorithms for allocation of software component development costs can be designed by using dynamic programming. The proposed allocation algorithms can allocate development costs to each component to optimize software trustworthiness. Furthermore, in order to allocate development costs to each component automatically, a web-based software tool for allocating development costs to each component is developed. Finally, a case study of a self-service ticketing system is provided to show the feasibility of the proposed allocation algorithms.

关键词： allocation algorithm component development costs dynamic programming software trustworthiness

来源：评论

学校读者我要写书评

暂无评论

Two-criteria Pareto frontier for virtual network allocation on Edge-as-a-Service networks

引用

COMPUTER COMMUNICATIONS 2017年 102卷 58-66页

作者： Gomes, Rafael L. Bittencourt, Luiz F. Madeira, Edmundo R. M. Cerqueira, Eduardo Gerla, Mario State Univ Ceara UECE Fortaleza Ceara Brazil Univ Calif Los Angeles Los Angeles CA 90095 USA Univ Estadual Campinas UNICAMP Sao Paulo Brazil Fed Univ Para UFPA Belem Para Brazil

Nowadays, the Internet is part of our lives, being an essential way of communication. However, it suffers from limitations that prevent the Internet to guarantee Quality of Service (QoS) for the services to the clients. Recently, the scientific community presented the Edge as a Service (EaaS) paradigm as a possible approach to improve the Internet access service. EaaS is based on the deployment of Virtual Networks (VNs) over Software Defined Networks to ease the management of Internet Service Providers (ISPs) through the supporting of Service Level Agreements (SLAs) and the allocation schemes that consider the network resources. Furthermore, the ISPs aim to maximize their profit by establishing as many SLAs as possible and decrease the energy consumption to deliver their services, where reliability and available bandwidth are key requirements. Thus, the EaaS needs an allocation algorithm to allow the deployment of VNs considering all these points. Within this context, this paper presents the PAreto based on Bandwidth and ENergy (PABEN) algorithm to deploy the VNs based on a Pareto frontier (using bandwidth availability and energy efficiency information), as well as considering a minimum reliability. The results suggest that the proposed algorithm can deploy reliable VNs, while improving bandwidth utilization and energy consumption. (C) 2017 Elsevier B.V. All rights reserved.

关键词： allocation algorithm Pareto frontier Virtual Networks Edge as a Service

来源：评论

学校读者我要写书评

暂无评论

HANDOVER AND DYNAMIC CHANNEL allocation TECHNIQUES IN MOBILE CELLULAR NETWORKS

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 1995年第2期44卷 229-237页

作者： DELRE, E FANTACCI, R GIAMBENE, G Department of Electronic Engineering University of Florence Florence Italy

This paper deals with an efficient Dynamic Channel allocation (DCA) technique applicable to terrestrial mobile cellular networks. A channel (or resource) is a fixed frequency bandwidth (FDMA), a specific time-slot within a frame (TDMA), or a particular code (CDMA), depending on the multiple access technique used, A cost function has been defined by which the optimum channel to be assigned on demand can be selected, In addition, a suitable mobility model has been derived to determine the effects of handovers on network performance, The performance of the proposed DCA technique has been derived by computer simulations in terms of call blocking and handover failure probabilities, Comparisons with the classical Fixed Channel allocation (FCA) technique and other dynamic allocation algorithms recently proposed in the literature have been carried out to validate the proposed technique.

关键词： multiple access Cellular networks Cost functions Handover Computer Simulation Access to technology Mobile Dynamic Channel allocation (DCA) allocation algorithm

来源：评论

学校读者我要写书评

暂无评论

Burst-by-burst dynamic bandwidth allocation for XG-PONs

引用

IET NETWORKS 2016年第3期5卷 47-55页

作者： Gravalos, Ilias Yiannopoulos, Kostas Papadimitriou, Georgios Varvarigos, Emmanuel A. Comp Technol Inst & Press Diophantus Rion 26500 Greece Univ Patras Comp Engn & Informat Dept Rion 26500 Greece Univ Peloponnese Dept Informat & Telecommun Tripoli 22100 Greece Aristotle Univ Thessaloniki Dept Informat Thessaloniki 54124 Greece

The authors propose and evaluate the performance of a dynamic bandwidth allocation algorithm, namely burst-by-bUrst dynamic bandwidth allocation (BUDA), which enables the fair and efficient utilisation of the available upstream resources in 10-Gigabit-capable passive optical networks (XG-PONs). The proposed algorithm emulates a bit-by-bit burst multiplexing process based on the fair queuing scheduling principle to fairly allocate the available upstream bandwidth among several end-users with varying traffic demands. The fair queuing approach is well-suited to the strictly synchronous communication model of XG-PONs, where fixed duration downstream and upstream frames are utilised to delineate transmissions, and the authors demonstrate via simulations that BUDA achieves low and bounded latency, as well as resource allocation fairness over a set of different traffic loads. Furthermore, BUDA is compared with well-known bandwidth allocation algorithms and a significant latency and fairness benefit is demonstrated.

关键词： dynamic bandwidth allocation transmission bandwidth allocation Upstream Writers Queue allocation algorithm End users

来源：评论

学校读者我要写书评

暂无评论

Prospective Validation of a New Priority allocation Model for Liver Transplant Candidates: An Interim Analysis

引用

TRANSPLANTATION PROCEEDINGS 2009年第4期41卷 1092-1095页

作者： Vitale, A. Saracino, E. D'Amico, F. E. Grigoletto, F. Burra, P. Angeli, P. Boccagni, P. Brolese, A. Zanus, G. Neri, D. Gringeri, E. D'Amico, F. Valmasoni, M. Carraro, A. Gambato, M. Feltracco, P. Romano, A. Buggio, M. D'Amico, D. F. Cillo, U. Univ Padua Unita Chirurg Epatobiliare & Trapianto Epat Dipartimento Chirurg Gen & Trapianti Organo Azienda Osped Padua Italy IRCCS Ist Oncol Veneto Unita Chirurg Oncol Padua Italy Univ Padua Unita Biostat & Epidemiol Dipartimento Med Ambientale & Sanita Pubbl Padua Italy Univ Padua Div Gastroenterol Dipartimento Sci Chirurg & Gastroenterol Padua Italy Univ Padua Clin Med V Dipartimento Med Clin & Sperimentale Padua Italy Univ Padua Dipartimento Farmacol & Anestesiol Azienda Padua Italy Univ Naples Federico 2 Dipartimento Med & Clin Sperimentale Naples Italy

Background. The system that controls the waiting list (WL) and organ allocation for liver transplantation (OLT) seeks to achieve 3 main goals: objectivity, low dropout risks and good post-OLT results. We sought to prospectively validate a priority allocation model that is believed to achieve objectivity without penalizing dropout risk and post-OLT results. Methods. We evaluated a study group of 272 patients enrolled in 2006-2007. WL candidates were divided into 2 categories: cirrhotic patients classified according to Model for End-Stage Liver Disease (MELD) score (MELD list and patients with hepatocellular carcinoma (HCC) organized according to a specific score (non-MELD list). The allocation algorithm for donor-recipient match assigned an optimal graft to the first MELD candidate with a MELD score of;!:20;a suboptimal graft, to the first non-MELD patient. A respective control group of 327 patients transplanted from 2003-2006 was characterized by a unique WL with a free allocation policy. We performed an interim analysis of this prospectively controlled study. Results. Although the study group showed a lower percentage of OLT (P < .05) than the control group (37% vs 45%), it selected patients for OLT based on a higher MELD score (P < .05), thus obtaining similar dropout, post-OLT survivals, and intention-to-treat (ITT) survival probabilities as the controls. Among MELD patients, we observed a significantly reduced dropout and better ITT survival profiles than those of the control group (P = .02), whereas the similar results were delivered among non-MELD patients (P > .05). Among patients with a MELD score of :20, the prevalences of suboptimal grafts (0% vs 48%) and of early graft losses (0% vs 21%) were lower in the study than in the control group (P < .05). Conclusions. We prospectively validated a priority allocation model based on objective criteria that achieved high ITT survival rates.

关键词： allocation algorithm Patients WORKING LEVEL Objectivity precedence Neutrality liver transplant value freedom allocation model Optical Line Terminal

来源：评论

学校读者我要写书评

暂无评论

Vehicle Dynamics Control in Challenging Driving Situations using Nonlinear Model Predictive Control allocation

Vehicle Dynamics Control in Challenging Driving Situations u...

引用

IEEE Conference on Control Applications (CCA)

作者： Baechle, Thomas Graichen, Knut Buchholz, Michael Dietmayer, Klaus Univ Ulm Inst Measurement Control & Microtechnol D-89081 Ulm Germany

ISBN: (纸本)9781479974092

This contribution proposes a nonlinear model predictive control allocation algorithm for control of an over-actuated electric vehicle in challenging driving situations. Based on a recently published gradient-based real-time solver, the proposed scheme allows to implement a hierarchical control strategy for lateral and longitudinal control while optimally allocating wheel torques adhering to wheel slip and rate constraints. Incorporating nonlinear tire models enables the decoupled control of vehicle yaw moment and traction force. The performance is demonstrated on a comprehensive vehicle dynamics model.

关键词： Force Real-time systems Resource management Tires Vehicle dynamics Vehicles Wheels Vehicle dynamics Wheels real-time systems vehicle management of resources nonlinear model predictive control Force tyres decoupling control LONGITUDINAL CONTROL allocation algorithm Wheel slip

来源：评论

学校读者我要写书评

暂无评论

Liver graft allocation for hepatocellular carcinoma patients: Is a forced ablate-and-wait protocol nationally applicable?

引用

LIVER TRANSPLANTATION 2014年第5期20卷 629-630页

作者： Bazerbachi, Fateh Aby, Elizabeth Lake, John Univ Minnesota Dept Med Minneapolis MN 55455 USA

In the original article, Mehta et al.~2 identified a specific cohort of hepatocellular carcinoma (HCC) patients with T2 tumors whose risk of wait-list dropout was very low, and they suggested that such patients should not receive the same allocation advantage as higher risk groups (ie, those not meeting their criteria). In our editorial, we raised the issue of whether using such data to inform a new allocation algorithm might lead to worsening outcomes through the selection of recipients with a higher risk of tumor recurrence for liver transplantation (LT). The authors have now provided outcome data to supplement their study and compared the identified outcomes of transplantation for their low-risk subgroup with those for the remaining HCC patients. Although the recurrence rates did not appear different, the non–low-risk recipients had worse 5-year patient survival, with HCC recurrence representing the most common cause of death. We disagree with their conclusion that “excluding patients with a very low risk of wait-list dropout from LT does not mean that we would instead perform transplantation for patients with a high risk of posttransplant HCC recurrence and poor survival,” and here we will focus on 2 primary issues.

关键词： Hepatocellular Forced Protocol Nationally Level Trigger Transplantation High risk tumor Cause of Death Liver Transplantation Population at Risk Forced allocation algorithm Relapse Hepatocellular Cancer Recipients Human-centered computing Recurrent Neoplasm Patients

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：