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

analysis and design of Optimal Admission Control Policies in Multiservice Cellular Networks

IEEE Latin America Transactions 2004年第1期2卷 10-18页

作者： V.P. Bosca V.C. Giner Departmento de Communicaciones Universidad Politécnica de Valencia Valencia Spain

Forthcoming cellular networks will provide multimedia services along with QoS guarantees. In this context admission control is a key aspect in the design and operation of such systems. In this paper we consider several admission control policies together with appropriate algorithms for their analysis and design. We conclude that the family of randomized stationary policies provide the required versatility to adapt to several goals for both network planning and operation. Appropriate algorithms stem from the fact that randomized stationary policies can be suitably analyzed and adjusted by means of Markov decision processes theory and linear programming techniques.

关键词： Admission control Intelligent networks Land mobile radio cellular systems algorithm design and analysis Linear programming Programmable logic arrays Land mobile radio Markov processes Multimedia systems Optimal control

来源：评论

学校读者我要写书评

暂无评论

Comments on "An analysis of design conditions for a phase-inverter speaker system with a drone cone"

引用

IEEE Transactions on Acoustics, Speech, and Signal Processing 1974年第5期22卷 389-391页

作者： H. Olson RCA Laboratories Princeton N.J.

The last sentence on p. 405 in the above paper states: "This paper ... shows that the low-frequency response of the drone-cone system is a little inferior to that of the bass-reflex system, ... ." The exposition of this correspondence shows that a properly designed drone cone for a phase-inverter loudspeaker will provide performance superior to that of the same loudspeaker with a port.

关键词： Loudspeakers Frequency measurement Phase measurement algorithm design and analysis Frequency response Fourier transforms Signal processing algorithms Speech processing Acoustic signal processing Circuits

来源：评论

学校读者我要写书评

暂无评论

Fast and scalable routing protocols for data center networks

引用

Digital Communications and Networks 2023年第6期9卷 1340-1350页

作者： Mihailo Vesovic Aleksandra Smiljanic Dusan Kostic School of Electrical Engineering University of Belgrade11120BelgradeSerbia Amazon Web Services(AWS) ZurichSwitzerland

Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link *** are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize *** such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive *** routing protocols were proposed to overcome this problem by focusing on network utilization rather than ***,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing ***,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data *** aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose *** propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.

关键词： Routing protocols Data center networks Parallel algorithms Distributed algorithms algorithm design and analysis Shortest-path problem Scalability

来源：评论

学校读者我要写书评

暂无评论

A Novel Iterative Velocity Control algorithm and Its FPGA Implementation Based on Trigonometric Function

引用

Chinese Journal of Electronics 2019年第2期28卷 237-245页

作者： WEN Quangang LIANG Yanchun Adriano Tavares Ricardo Teixeira WU Chunguo Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Zhuhai Laboratory of Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Zhuhai College of Jilin University Department of Industrial Electronics University of Minho Campus de Azurm

The servo motor’s flexible acceleration/deceleration(acc/dec) control is an emerging research topic in the automation field. A velocity control algorithm based on trigonometric function is proposed in this *** required parameters, it transforms trigonometric calculations into elementary mathematical operations and calculates the velocity controlling values iteratively, which could avoid trigonometric calculation and reduce the computation time. Experimental results show that the proposed algorithm is suitable for implementation on field programmable gate arrays and achieves a flexible controlling, enhancing both the equipment’s stability and reliability. It is promising to significantly improve the high-speed computerized numerical control equipment’s controlling accuracy, without a huge hardware resource consumption.

关键词： Acceleration Velocity control algorithm design and analysis Field programmable gate arrays Servomotors

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithm for Bottleneck Steiner Tree Problem in the Euclidean Plane

引用

Journal of Computer Science & Technology 2004年第6期19卷 791-794页

作者： Zi-MaoLi Da-MingZhu Shao-HanMa SchoolofComputerScienceandTechnology ShandongUniversityJinan250061P.R.China

A special case of the bottleneck Steiner tree problem in the Euclidean plane was considered in this paper. The problem has applications in the design of wireless communication networks, multifacility location, VLSI routing and network routing. For the special case which requires that there should be no edge connecting any two Steiner points in the optimal solution, a 3-restricted Steiner tree can be found indicating the existence of the performance ratio root2. In this paper, the special case of the problem is proved to be NP-hard and cannot be approximated within ratio root2. First a simple polynomial time approximation algorithm with performance ratio root3 is presented. Then based on this algorithm and the existence of the 3-restricted Steiner tree, a polynomial time approximation algorithm with performance ratio-root2 + epsilon is proposed, for any epsilon > 0.

关键词： bottleneck Steiner tree approximation algorithm performance ratio algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

What Is the Distance Between Objects in a Data Set?

引用

IEEE PULSE 2016年第2期7卷 41-47页

作者： Abou-Moustafa, Karim Concordia Univ Ctr Pattern Recognit & Machine Intelligence Montreal PQ Canada Univ Montreal Lab Informat & Syst Adapt Montreal PQ H3C 3J7 Canada Carnegie Mellon Univ Inst Robot Pittsburgh PA 15213 USA Univ Alberta Dept Comp Sci Edmonton AB T6G 2M7 Canada

Digitally recorded data have become another critical natural resource in our current research environment. This reality is one of the tremendous victories for decades of research in computer engineering, computer science, electronics, and communications. While this scenario will continue to be the case in the future, our current era has also marked the beginning of another unstoppable activity that is intimately related to digitally stored data: extracting knowledge and information from such data. Digital data are recorded in different forms and at unprecedented scales. Examples include database tables in every business entity; Tweets; e-mails and text documents; audio and speech signals; seismic data (recorded as temporal multidimensional tensors); video data (possibly stored with other modalities such as audio and captions); graphs representing relations and interactions among different entities (links among web documents, users on social networks, devices on computer networks, or gene interaction networks); and images, including functional magnetic resonance imaging (fMRI) and more. Because of their different forms and structures, throughout this article, each datum in a data set will be referred to as an *** recorded data have become another critical natural resource in our current research environment. This reality is one of the tremendous victories for decades of research in computer engineering, computer science, electronics, and communications. While this scenario will continue to be the case in the future, our current era has also marked the beginning of another unstoppable activity that is intimately related to digitally stored data: extracting knowledge and information from such data. Digital data are recorded in different forms and at unprecedented scales. Examples include database tables in every business entity; Tweets; e-mails and text documents; audio and speech signals; seismic data (recorded as temporal multidimensional tensors); video

关键词： Feature extraction algorithm design and analysis Machine learning algorithms Unsupervised learning Prediction algorithms Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

Kolmogorov n-widths and wavelet representations for signal classes

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1996年第7期44卷 1693-1703页

作者： Liang, J Parks, TW CORNELL UNIV SCH ELECT ENGNITHACANY 14853

We address the problem of basis selection and wavelet representations for two important signal classes: the ellipsoidal signal class and the bounded cone class. We define time-frequency concentrated signals in this paper as the class of signals whose Wigner distributions are concentrated in some region of the Wigner domain, We use the concept of the Kolmogorov n-width and the constrained n-width to quantitatively measure the ability of a basis to represent a signal class, We select the best wavelet representation by comparing the constrained n-widths of different wavelet bases. Explicit formulas are given to compute the Kolmogorov n-width for both signal models. A globally convergent algorithm is proposed to calculate the constrained n-width for a given basis.

关键词： Signal processing algorithms Matching pursuit algorithms Entropy Time frequency analysis algorithm design and analysis Upper bound Libraries Wavelet packets Filter bank Wavelet coefficients

来源：评论

学校读者我要写书评

暂无评论

OPTIMALITY IN THE CHOICE OF THE CONVERGENCE FACTOR FOR GRADIENT-BASED ADAPTIVE algorithmS

引用

IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING 1987年第1期35卷 48-59页

作者： YASSA, FF Research and Development Center General Electric Company Limited Schenectady NY USA

The convergence and the adaptation speed of gradient-based adaptive algorithms are controlled by the chosen value for the convergence factor μ. In this paper, the existence of an optimal value for this convergence factor is investigated for two classes of algorithms. A proof is first presented for the general case of the complex adaptive-linear-combiner (ALC). The results are applied to the complex and real LMS algorithms. This is followed by a second proof for algorithms which are linear only in a subset of their adaptive coefficients. These cases are found in IIR applications such as the hybrid-recursive, lattice-recursive, and recursive algorithms using the direct realization IIR. For each case, the optimal value is shown to be generated using instantaneous signal estimates. The resulting adaptive algorithms become self-optimizing in terms of their convergence factor, and dependence on incoming training signal levels is reduced. Moreover, a correction factor is introduced in each case to regulate the adaptation process and accommodate practical applications where additive signals are present with the desired signal.

关键词： Convergence Adaptive algorithm Least squares approximation Automatic logic units Signal processing algorithm design and analysis Optimal control Signal generators Finite impulse response filter Statistics

来源：评论

学校读者我要写书评

暂无评论

EQUIVALENT LINEAR-ARRAY APPROACH TO ARRAY PATTERN SYNTHESIS

引用

IEEE JOURNAL OF OCEANIC ENGINEERING 1993年第1期18卷 6-14页

作者： WU, LX ZIELINSKI, A Department of Electrical and Computer Engineering University of Victoria Victoria BC Canada

A new and effective method for array radiation pattern synthesis is presented. The method allows formulation of the synthesis of a desired pattern as an optimization problem. The solution proposed involves matrix operations based on the equivalent linear array approach which leads to an easy and effective computation. The advantage of this approach is that it does not involve any numerical optimization routines only ordinary matrix operations are required. Illustrations are presented to highlight the various aspects of the method. The proposed algorithm can be used to design arrays of uniformly spaced elements with nonisotropic and unequal radiation patterns.

关键词： Optimization methods Linear matrix inequalities algorithm design and analysis Hilbert space

来源：评论

学校读者我要写书评

暂无评论

GATE MATRIX PARTITIONING

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED design OF INTEGRATED CIRCUITS AND SYSTEMS 1989年第7期8卷 756-767页

作者： HUANG, S WING, O COLUMBIA UNIV DEPT ELECT ENGNNEW YORKNY 10027

An algorithm is presented which partitions a gate matrix into a number of matrices such that the total area and the aspect ratio of the circumscribing rectangle are improved. The algorithm is based on the min-cut algorithm. The gain function and the balance condition are redefined for the gate matrix problem. The time complexity of the algorithm is O(t)+O( mod N/sub I/ mod /sup 2/), where t is the number of gate-net intersections, and N/sub I/ the subset of nets that intersect long gates. A novel gate-sequencing algorithm, designed for assigning gates in the partitioned gate matrices simultaneously, is introduced. By using the simultaneous-gate-sequencing algorithm, the partitioned gate matrices are connected by sharing gates. Since the same column is used for a gate shared by adjacent matrices, the layout does not require extra routing area. Experimental results show significant improvement over the layout without partition. For the three examples used in a previous paper, the area reduction ranges from 11-41%. The aspect ratio improves from 2.63, 4.00, and 2.59 to 1.04, 1.22, and 1.28, respectively.< >

关键词： Partitioning algorithms Routing algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：