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

SEISMIC MIGRATION algorithmS ON PARALLEL COMPUTERS

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1991年第7期39卷 1642-1654页

作者： MADISETTI, VK MESSERSCHMITT, DG UNIV CALIF BERKELEY DEPT ELECT ENGN & COMP SCIBERKELEYCA 94720

Seismic signal processing is computationally intensive and sequential algorithms in use do not exploit the concurrency inherent in data migration techniques. In this paper we study seismic migration algorithms with an objective to present a general framework for analyzing such algorithms and propose some medium-grained paradigms for computation on parallel computers. We introduce parallel models for computation and discuss techniques to optimize their performance on distributed concurrently executing processors. The computational and communication requirements of the algorithms are discussed and diverse optimization techniques are proposed. The memory limitation, I/O bottleneck, and computational tradeoffs on hypercube multiprocessors are analyzed.

关键词： Concurrent computing Signal processing algorithms Stacking Partial differential equations algorithm design and analysis Computational modeling Hypercubes Seismic measurements Signal to noise ratio Computer architecture

来源：评论

学校读者我要写书评

暂无评论

A Traffic-Aware Channel and Rate Reassignment algorithm for Wireless Mesh Networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2013年第7期12卷 1335-1348页

作者： Avallone, Stefano Di Stasi, Giovanni Kassler, Andreas Univ Naples Federico II Dept Comp Engn I-80125 Naples Italy Karlstad Univ Dept Comp Sci S-65188 Karlstad Sweden

Channel assignment is among the most challenging issues for multiradio wireless mesh networks, given the variety of objectives that can be pursued and the computational complexity of the resulting problems. The channel assignment problem has been also shown to be interdependent with the routing problem, i.e., the problem to determine the amount of traffic flow to be routed on every link. Such a relationship raises the need to recompute the channel assignment every time the traffic pattern changes. However, channel assignment algorithms designed to assign channels from scratch will likely return a completely different configuration of radios, which would disrupt the network operation for the time required to switch to using the links established on the new channels. As shown by the experiments that we conducted, such a time may not be negligible, due to the resistance of routing protocols designed for wireless ad hoc and mesh networks to rapidly flagging a link as established/lost. Such a consideration, along with the observation that channel assignment algorithms may be suboptimal, led us to the design of a channel reassignment algorithm that takes the current channel assignment into account and attempts to cope with the new traffic pattern in the best manner possible while modifying the channel on a limited number of radios. In this paper, we illustrate such a channel reassignment algorithm and evaluate its performance by means of both simulations and experiments with real hardware.

关键词： Wireless mesh networks channel reassignment algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

algorithm FOR OPTIMIZATION PROBLEMS WITH FUNCTIONAL INEQUALITY CONSTRAINTS

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 1976年第2期21卷 184-193页

作者： POLAK, E MAYNE, DQ IMPERIAL COLL DEPT COMP & CONTROLLONDONENGLAND UNIV CALIF BERKELEY DEPT ELECT ENGN & COMP SCIBERKELEYCA 94720 UNIV CALIF BERKELEY ELECTR RES LABBERKELEYCA 94720

This paper presents an algorithm for minimizing an objective function subject to conventional inequality constraints as well as to inequality constraints of the functional type: \max_{\omega \in \Omega} \phi(z,\omega) \leq 0 , where Ω is a closed interval in R , and z \in R^{n} is the parameter vector to be optimized. The algorithm is motivated by a standard earthquake engineering problem and the problem of designing linear multivariable systems. The stability condition (Nyquist criterion) and disturbance suppression condition for such systems are easily expressed as a functional inequality constraint.

关键词： Constraint optimization Stability algorithm design and analysis MIMO Buildings Military computing Linear matrix inequalities Earthquake engineering Control systems Frequency response

来源：评论

学校读者我要写书评

暂无评论

ENSURING ROBUST CALL THROUGHPUT AND FAIRNESS FOR SCP OVERLOAD CONTROLS

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 1995年第5期3卷 538-548页

作者： SMITH, DE Bellcore Red Bank NJ USA

This paper analyzes the performance of two different types of service control point (SCP) overload control algorithms, table-driven controls and an adaptive control. As performance measures, we use aggregate transaction throughput and fairness (whether the control algorithm allocates SCP capacity to individual traffic sources as desired), We find that, even when parameters are well-matched to source characteristics, table-driven controls do not perform as well as the adaptive control. In addition, the adaptive control is more robust to traffic patterns and SCP internal operation than the table-driven controls.

关键词： Adaptive Control Telecommunication Traffic Channel Capacity Intelligent Networks Telecommunication Congestion Control Robust Call Throughput Fairness SCP Overload Controls Performance Service Control Point Overload Control algorithms Table Driven Controls Adaptive Control Traffic Sources Robust Control Throughput Communication System Traffic Control Adaptive Control Switches Performance analysis algorithm design and analysis Aggregates Intelligent Networks Logic

来源：评论

学校读者我要写书评

暂无评论

RT-level ITC'99 benchmarks and first ATPG results

引用

IEEE design & TEST OF COMPUTERS 2000年第3期17卷 44-53页

作者： Corno, F Reorda, MS Squillero, G Politecn Torino Dipartimento Automat & Informat I-10129 Turin Italy Politecn Torino Dept Comp Sci & Automat I-10129 Turin Italy

New design flows require reducing work at the gate level and perfoming most activities before the synthesis step, including evaluatation of testability of circuits. We propose a suite of RT-level benchmarks that help improve research in high-level ATPG tools. First results on the benchmarks obtained with our prototype tool show the feasibility of the approach.

关键词： Automatic test pattern generation Circuit testing Benchmark testing Circuit synthesis Circuit faults Prototypes Libraries algorithm design and analysis Automatic testing Logic testing

来源：评论

学校读者我要写书评

暂无评论

Computer-aided mechanical design using configuration spaces

引用

COMPUTING IN SCIENCE & ENGINEERING 1999年第6期1卷 14-21页

作者： Joskowicz, L Sacks, E Purdue Univ W Lafayette IN 47907 USA Hebrew Univ Jerusalem Inst Comp Sci IL-91904 Jerusalem Israel

To address difficulties with contact analysis in mechanical design-namely in planar mechanical systems with complex part shapes, tight fits, and contact changes-the authors have developed a general contact-analysis me... 详细信息

关键词： Mechanical systems Shape design engineering Tolerance analysis Biomedical computing Pervasive computing Biomedical engineering Performance analysis algorithm design and analysis Prototypes

来源：评论

学校读者我要写书评

暂无评论

TRANSFORMATION OF NETWORKS CONTAINING MUTUAL INDUCTIVE COUPLINGS INTO EQUIVALENT CIRCUIT SYSTEMS WITH NO MUTUAL COUPLINGS

引用

IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS 1968年第7期PA87卷 1565-&页

作者： ANGELINI, AM University of Rome Rome Italy

A general procedure for the transformation of networks containing mutual inductive couplings into equivalent circuit systems with no mutual couplings for which the ordinary resolution methods apply is illustrated. The proposals are made a) to provide a procedure for the prompt resolution of any problems-no matter how complex-concerning networks which include inductive couplings, b) to render the treatise accessible to a large number of readers; thus, in the analytical developments, only simple algorithms are used, c) to provide the means to apply the results of the procedure without difficulty and without the need for knowledge of the demonstration, and d) to draw the specialists' attention to subjects that offer grounds for further studies and research.

关键词： Mutual coupling Coupling circuits Equivalent circuits Inductance Impedance Proposals algorithm design and analysis Equations Voltage Complex networks

来源：评论

学校读者我要写书评

暂无评论

THE CHALLENGES OF DIGITAL HDTV

引用

IEEE SPECTRUM 1991年第4期28卷 28-&页

作者： JURGEN, RK IEEE Spectrum New York NY USA

Beginning with the announcement of General Instrument Corp.'s DigiCipher all-digital system, US engineers have propelled high-definition television (HDTV) into the digital era. Federal Communications Commission (FCC) chairman Al Sikes is encouraging new technological developments in the terrestrial broadcast arena. Digital HDTV offers certain advantages over analog and hybrid systems, including pictures that are free of atmospheric noise and other interference. However, HDTV also presents some problems, including a tendency to degrade abruptly. Such challenges notwithstanding, all the system proponents plan to have their digital systems ready for testing in accordance with an FCC schedule. The proposed systems share many features, such as the use of so-called taboo VHF or UHF channels. HDTV signals require much wider bandwidths than do conventional broadcast signals, prompting development of a variety of techniques to compress them.

关键词： HDTV FCC TV broadcasting System testing Transmitters Digital systems Degradation Instruments Motion compensation algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

ON THE APPROXIMATION OF THE OUTPUT PROCESS OF MULTIUSER RANDOM-ACCESS COMMUNICATION-NETWORKS

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1990年第2期38卷 172-179页

作者： STAVRAKAKIS, I KAZAKOS, D UNIV VIRGINIA DEPT ELECT ENGNCHARLOTTESVILLEVA 22901

Bernoulli and first-order Markov processes are used to approximate the output process of a class of slotted multiuser random-access communication networks. The output process is defined as the process of the successfully transmitted packets within the network. The parameters of the approximating processes are analytically calculated for a network operating under a specific random access algorithm. The applied methods are general and can be used to calculate these parameters in the case of any random access algorithm within a class. To evaluate the accuracy of the approximations, a star topology of interconnected multiuser random-access communication networks is considered. The mean time that a packet spends in the central node of the star topology is calculated under the proposed approximations of the output processes of the interconnected networks. The results are compared to simulation results of the actual system. It turns out that the memoryless approximation gives satisfactory results up to a certain per network traffic load. Beyond that per network traffic load, the first-order Markov process performs better.< >

关键词： Communication networks Telecommunication traffic Access protocols Markov processes algorithm design and analysis Network topology Multiaccess communication Road accidents Spread spectrum communication Interconnected systems

来源：评论

学校读者我要写书评

暂无评论

Bit-parallel multidelay simulation

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED design OF INTEGRATED CIRCUITS AND SYSTEMS 1996年第12期15卷 1547-1554页

作者： Lee, YS Maurer, PM UNIV S FLORIDA DEPT COMP SCI & ENGNTAMPAFL 33620

The multidelay parallel (MDP) technique is a multidelay logic simulation algorithm that uses no timing wheel, or any other event-sorting mechanism, Instead, wide bit-fields containing net-values for several different times are used to resolve out-of-order events, Bit-parallel operations are performed to simulate;gates at the required times, The MDP technique was originally designed to be implemented in hardware, but the current software version of the algorithm has proven to be competitive with conventional event-driven multidelay simulation, Two versions of the MDP technique are presented in this paper, fixed alignment and variable alignment, The fixed alignment algorithm provides bit-fields that are wide enough to capture any event that could occur during the simulation of an input vector, while the variable alignment algorithm uses a minimum-width bit field which is just wide enough to capture those events that could occur at an individual step in the simulation, A prototype hardware design is discussed briefly.

关键词： Discrete event simulation Hardware Circuit simulation Software algorithms Engines Timing Wheels Logic devices Computational modeling algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：