Filters








202,806 Hits in 5.5 sec

Analog-Aware Schematic Synthesis [chapter]

Yuping Wu
2011 Advances in Analog Circuits  
After the functionality analysis and partitioning, new hierarchy is re-constructed; the constraints for schematic generation, circuit and layout optimization are generated; and also the schematics are  ...  with functionality name correctly. All the functionality names are used for functionality analysis of complex high level circuit based on the specified name conventions.  ... 
doi:10.5772/14547 fatcat:7h46ynr5djcb3bklnzpfgjmuoy

Optimization of decision-timing for early termination of SSDA-based block matching

A. Hatabu, T. Miyazaki, I. Kuroda
2003 2003 International Conference on Multimedia and Expo. ICME '03. Proceedings (Cat. No.03TH8698)  
This paper describes an analysis-based method for optimizing the timing of decisions regarding early termination of block matching (BM) in the application of a successive similarity detection algorithm  ...  Here, total costs, including cycles for decisions, are formulated through use of a decision interval, processordependent cost factors, and a function which gives probabilities of BM termination.  ...  CONCLUSION An analysis-based method has been presented for optimizing the interval of termination decisions for SSDA, a fast computation algorithm used in BM.  ... 
doi:10.1109/icme.2003.1221743 dblp:conf/icmcs/HatabuMK03 fatcat:k3qt7gkrmfcg5kxz7ugula7yqm

Page 5887 of Mathematical Reviews Vol. , Issue 86m [page]

1986 Mathematical Reviews  
5887 the objective function becomes a combination of fixed and variable costs.” Ward, James E. (1-PURD); Wendell, Richard E. (1-PITT) Using block norms for location modeling. Oper.  ...  We give the results in explicit form, which enables us to use them for the analysis of approximate methods both nu- merically and analytically.” Nawijn, W. M.  ... 

Near-Optimal Resource Allocation in Cooperative Cellular Networks Using Genetic Algorithms [chapter]

Zihan Luo, Simon Armour, Joe McGeehan
2015 Lecture Notes in Computer Science  
the properly selected termination conditions is used in the same network.  ...  This paper shows how a genetic algorithm can be used as a method of obtaining the near-optimal solution of the resource block scheduling problem in a cooperative cellular network.  ...  Zihan Luo wishes to thank her colleagues in the Communication Systems and Networks Laboratory for the many valuable discussions on aspects of this work.  ... 
doi:10.1007/978-3-319-23440-3_10 fatcat:dzfxlx2hnzfetmyycmk5u6h7pa

Min-max placement for large-scale timing optimization

Andrew B. Kahng, Stefanus Mantik, Igor L. Markov
2002 Proceedings of the 2002 international symposium on Physical design - ISPD '02  
With feature-sizes below 0 25µm, interconnect delays account for over 40% of worst delays [12] .  ...  Transitions to 0 18µm and 0 13µm further increase this figure, and thus the relative importance of timing-driven placement for VLSI.  ...  In addition to pre-assigning cells based on the continuous locations and cell slacks, we re-use those cell locations for more accurate terminal propagation.  ... 
doi:10.1145/505388.505423 dblp:conf/ispd/KahngMM02 fatcat:6j74pwtqkvegbhtgyqb7wqxwgi

Min-max placement for large-scale timing optimization

Andrew B. Kahng, Stefanus Mantik, Igor L. Markov
2002 Proceedings of the 2002 international symposium on Physical design - ISPD '02  
At the 250nm technology node, interconnect delays account for over 40% of worst delays [12] .  ...  Transition to 130nm and below increases this figure, and hence the relative importance of timing-driven placement for VLSI.  ...  This traversal continues until the total area of pre-assigned cells reaches the area limit for the block. We also reuse the continuous cell locations for more accurate terminal propagation.  ... 
doi:10.1145/505418.505423 fatcat:anqw6dkudzhu3j224w6hymbp3u

Page 1146 of Mathematical Reviews Vol. , Issue 93b [page]

1993 Mathematical Reviews  
When the shock process is independent (but not necessarily identically distributed) and the terminal stock is constant (i.e., de- generate random), such optimal policy functions are shown to be semi-Markov  ...  method using a pricing mechanism for min concave cost flow problems with a hierarchical structure.  ... 

Bound Analysis for Whiley Programs

Min-Hsien Weng, Mark Utting, Bernhard Pfahringer
2016 Electronical Notes in Theoretical Computer Science  
This paper presents an abstract interpretation-based bound inference approach along with symbolic analysis for Whiley programs.  ...  Then the bound analyzer is used to analyze the transformed program to make use of primitive integer types rather than third-party infinite integer type (e.g. using GMP arbitrary precision library).  ...  Acknowledgement Thanks for Dr. David J. Pearce's technical support and to Google for some funding support for this project via a grant to Dr Utting.  ... 
doi:10.1016/j.entcs.2016.01.005 fatcat:qjp7rhd3svcdhj2qurbveq5rpu

Design aspects of satellite-cellular hybrid wireless systems

Tamer ElBatt, Anthony Ephremides
2002 International journal of satellite communications  
For a small hybrid system, we characterized the optimum re-assignment policies that minimize the blocking probability, dropping probability, and a weighted cost function of these probabilities.  ...  We emphasize the blocking-forced termination probabilities trade-o for pure cellular and satellite-cellular hybrid systems.  ...  Figure 13 : 13 Call Blocking Performance of the Optimal Re-Assignment P olicy for min.  ... 
doi:10.1002/sat.715 fatcat:5js7gjvmbjakbipb6zrvpxrcyy

Analysis of Cognitive Radio Spectrum Access with Optimal Channel Reservation

Xiaorong Zhu, Lianfeng Shen, Tak-shing Yum
2007 IEEE Communications Letters  
A Markov chain analysis for spectrum access in licensed bands for cognitive radios is presented and forced termination probability, blocking probability and traffic throughput are derived.  ...  In addition, a channel reservation scheme for cognitive radio spectrum handoff is proposed. This scheme allows the tradeoff between forced termination and blocking according to QoS requirements.  ...  The optimal value r * =1 should be used for λ a <14 and r * =0 for λ a ≥14.  ... 
doi:10.1109/lcom.2007.348282 fatcat:oyjgov4l3ve2xjus5sg7s3iav4

Dimensionality Reduction for Distributed Estimation in the Infinite Dimensional Regime

Olivier Roy, Martin Vetterli
2008 IEEE Transactions on Information Theory  
This naturally leads to an iterative algorithm whose optimality properties are exemplified using a simple though illustrative correlation model. The stationarity issue is also investigated.  ...  Our derivation relies on a variation of the Toeplitz distribution theorem, which allows us to provide a reverse "water-filling" perspective to the problem of optimal dimensionality reduction.  ...  Gastpar for the fruitful discussions and the three anonymous reviewers for their insightful comments.  ... 
doi:10.1109/tit.2008.917635 fatcat:ei4ws3mdrzeelitzfdtf5qikqa

Abstracts

1973 IBM Systems Journal  
Compiling optimized code from decision tables, H. J. Myers, /BM Journal of Re- search and Development 16, No. 5, 489-503 (September 1972).  ...  The expected percentage of terminals connected to the processing center is used as a measure of network reliability.  ... 
doi:10.1147/sj.121.0108 fatcat:j4pizrxmcvcytjxpkm3e54zmhe

DESIGN OF AN ULTRA-WIDEBAND, LOW-NOISE AMPLIFIER USING A SINGLE TRANSISTOR: A TYPICAL APPLICATION EXAMPLE

Salih Demirel, Filiz Gunes, Ufuk Ozkaya
2009 Progress in Electromagnetics Research B  
For this purpose, the compatible (Noise F , Input VSWR V i , Gain G T ) triplets and their (Z S , Z L ) terminations of a microwave transistor are exploited for the feasible design target space with the  ...  Furthermore the performances of the synthesized amplifiers are compared using an analysis programme in MATLAB code and a microwave system simulator and verified to agree with each other.  ...  the linear arrays using the ant colony optimization [18] .  ... 
doi:10.2528/pierb09062302 fatcat:szfeeob2fncyheaghoo56jrooe

A Novel Search Algorithm Based on Particle Swarm Optimization and Simplex Method for Block Motion Estimation

ZHANG Ping, WEI Ping, YU Hongyang, FEI Chun
2011 International Journal of Digital Content Technology and its Applications  
Meanwhile, based on the feature of static macro blocks, the proposed algorithm intelligently uses early termination strategies.  ...  To improve the performance of motion estimation in video coding, we propose a novel block matching algorithm, which utilize the global search ability of particle swarm optimization (PSO) with mutation  ...  Step2: Calculate the velocity and position for each point. Step3: Calculate the fitness function (SAD) for each point, and if early termination is not met, go to Step 4, otherwise, terminate.  ... 
doi:10.4156/jdcta.vol5.issue1.9 fatcat:hw574ig77nfkhjwmhajlo6xeti

Creating a standardized, quantitative training protocol for upper limb bypass prostheses

Conor Bloomer, Sophie Wang, Kimberly Kontson
2018 Physical Medicine and Rehabilitation Research  
Optimal training lengths were found to be three and six sessions for modified Southampton Hand Assessment Procedure and Box and Blocks Test results respectively, with support from effect size calculations  ...  To assess prepositioning, scores were normalized and grouped by a measure of terminal device rotations. Scores then underwent a linear regression analysis.  ...  The funders had no role in data collection and analysis, decision to publish, or preparation of the manuscript.  ... 
pmid:31172033 pmcid:PMC6547834 fatcat:bvopqjw2szaglhbh3skaeplp5m
« Previous Showing results 1 — 15 out of 202,806 results