622,312 Hits in 5.2 sec

Using Mixed Integer Programming for Matching in an Observational Study of Kidney Failure After Surgery

José R. Zubizarreta
2012 Journal of the American Statistical Association  
This paper presents a new method for optimal matching in observational studies based on mixed integer programming.  ...  While balancing several of these measures, it is also possible to impose constraints for exact and near-exact matching, and fine and near-fine balance for more than one nominal covariates, whereas network  ...  near-exact matching, and fine and near-fine balance.  ... 
doi:10.1080/01621459.2012.703874 fatcat:m6x4srblzvewrlnnztk7ggwnru

Torque-Matched Aerodynamic Shape Optimization of HAWT Rotor

Ali Al-Abadi, Özgür Ertunç, Florian Beyer, Antonio Delgado
2014 Journal of Physics, Conference Series  
Torque rotor with Betz, BEM & Schmitz Theories at tip speed ratio =7 Chord and pitch angle distribution theoretical optimized turbine with simulation The simulations validates the design and optimization  ...  generator during optimization.  Virtual testing of the rotor by matching the torque to that of a generator.  Validating the theoretical optimized rotor with numerical simulations.  ... 
doi:10.1088/1742-6596/555/1/012003 fatcat:3tsyetq45favbpyhdj5zutf3b4

Degree-Matched Check Node Decoding for Regular and Irregular LDPCs

S.L. Howard, C. Schlegel, V.C. Gaudet
2006 IEEE transactions on circuits and systems - 2, Analog and digital signal processing  
Simulation results show near-sum-product decoding performance for both degree-matched check node approximations, for regular and irregular LDPCs.  ...  Both have low complexity and can be applied to any degree distribution.  ...  The one-step degree-matched check node has 41% the area of a sum-product node and provides near-optimal performance.  ... 
doi:10.1109/tcsii.2006.882204 fatcat:gsfsny5ukzf2zlkgdiqqdt733y

Benchmarks that matter for genetic programming

John Woodward, Simon Martin, Jerry Swan
2014 Proceedings of the 2014 conference companion on Genetic and evolutionary computation companion - GECCO Comp '14  
Output is a (near optimal) bit-string i.e. the solution to the problem instance Optimizer Designer • [(B^n -> R)] -> ((B^n -> R) -> B^n) Input is a list of functions mapping bit-strings of length n to  ...  Aim find a solution with a near-optimal objective value using a search algorithm. ANY QUESTIONS BEFORE NEXT SLIDE? 1. A search space contains the set of all possible solutions. 2.  ...  Matching Metaheuristics to Problem Classes • TRAINING: Given a set of algorithms to choose from, select the best (near optimal) for a set of problem instances (drawn from a probability distribution). •  ... 
doi:10.1145/2598394.2609875 dblp:conf/gecco/WoodwardMS14 fatcat:ujzpqtuxv5calmxsvtppavafbi

Uniform Magnetic Field Characteristics Based UHF RFID Tag for Internet of Things Applications

Abubakar Sharif, Yi Yan, Jun Ouyang, Hassan Tariq Chattha, Kamran Arshad, Khaled Assaleh, Abdullah Alhumaidi Alotabi, Turke Althobaiti, Naeem Ramzan, Qammer Hussain Abbasi, Muhammad Ali Imran
2021 Electronics  
Moreover, the uniformity of current and magnetic field performance is achieved by further optimizing the design using particle swarm optimization (PSO).  ...  Compared to traditional electrically small near-field tags, this tag uses the logarithmic spiral as the radiating structure.  ...  (a) The fitness Curve of PSO-based optimization for proposed near-field tag (b) The optimized tag parameters achieved after implementing PSO algorithm in MATLAB.  ... 
doi:10.3390/electronics10131603 fatcat:a2vqb5lckngolmrezjtnjtasgu

Scaling and universality in continuous length combinatorial optimization

D. Aldous, A. G. Percus
2003 Proceedings of the National Academy of Sciences of the United States of America  
We consider combinatorial optimization problems defined over random ensembles, and study how solution cost increases when the optimal solution undergoes a small perturbation delta.  ...  For the minimum spanning tree, the increase in cost scales as delta^2; for the mean-field and Euclidean minimum matching and traveling salesman problems in dimension d>=2, the increase scales as delta^  ...  Introduce the variable X ϭ length of optimal matching on tree with root Ϫ length of optimal matching on tree without root.  ... 
doi:10.1073/pnas.1635191100 pmid:14504403 pmcid:PMC208736 fatcat:we7o7zsvzfhknntsqsms6jfcra

Learning and inference in the presence of corrupted inputs

Uriel Feige, Yishay Mansour, Robert E. Schapire
2015 Annual Conference Computational Learning Theory  
In this setting we characterize the optimal learner policy as a minimum vertex cover in a given bipartite graph, and the optimal adversary policy as a maximum matching in the same bipartite graph.  ...  We design efficient local algorithms for approximating minimum vertex cover in bipartite graphs, which implies an efficient near optimal algorithm for the learner.  ...  and matching) are indeed a feasible solution (in addition to being near optimal).  ... 
dblp:conf/colt/FeigeMS15 fatcat:yecgacablbgwvhnj4xmf5fqet4

Design of UHF fractal antenna for localized near-field RFID application

Yonghui Tao, Erfu Yang, Yaxian Dong, Gang Wang
2017 Microwave and optical technology letters (Print)  
Gang (2017) Design of UHF fractal antenna for localized near-field RFID application. Microwave and Optical Technology Letters, 59 (6).  ...  Fig. 3 Fig. 4 Fig. 5 345 Optimized center-fed Koch fractal antenna structure and its current distribution.  ...  By optimizing the fractal structure, reading nulls should be avoided in the entire covered near-field region.  ... 
doi:10.1002/mop.30546 fatcat:qpyunc4iwfahlejesnzo3zkbvi

Inverse-Designed Meta-Optics with Spectral-Spatial Engineered Response to Mimic Color Perception [article]

Chris Munley, Wenchao Ma, Johannes E. Fröch, Quentin A. A. Tanguy, Elyas Bayati, Karl F. Böhringer, Zin Lin, Raphaël Pestourie, Steven G. Johnson, Arka Majumdar
2022 arXiv   pre-print
Thus, both spatial and spectral properties of the meta-optics are optimized, resulting in spectra that mimic the color matching functions of the CIE 1931 XYZ color space, which links the distributions  ...  We thus obtain a surrogate model that quickly evaluates the near field above the meta-optic and hence facilitates the optimization.  ...  Optimization with a large c tends to result in high intensities at the specified far-field region but often leads to a poor match with the target function.  ... 
arXiv:2204.13520v1 fatcat:epx7bbiusvarvavewp2iqq7mum

Optimal Matching with Minimal Deviation from Fine Balance in a Study of Obesity and Surgical Outcomes

Dan Yang, Dylan S. Small, Jeffrey H. Silber, Paul R. Rosenbaum
2011 Biometrics  
In multivariate matching, fine balance constrains the marginal distributions of a nominal variable in treated and matched control groups to be identical without constraining who is matched to whom.  ...  Fine balance is not always possible; that is, it is a constraint on an optimization problem, but the constraint is not always feasible.  ...  Optimal near-fine matching with L 1 may be solved as a special case of optimal near-fine pair matching.  ... 
doi:10.1111/j.1541-0420.2011.01691.x pmid:22008180 pmcid:PMC3966214 fatcat:b3qkmamrxjaqdebr5t4bverghm

Interactive Inverse Design Optimization of Fuselage Shape for Low-Boom Supersonic Concepts

W. Li, E. Shields, D. Le
2008 Journal of Aircraft  
Past attempts indicated that no feasible aircraft configuration with nacelles and tails would have a total equivalent area distribution matching one of the equivalent area distributions corresponding to  ...  low-boom characteristics, (ii) construct new "realizable" target equivalent area distributions (or near-field pressure distributions) that result in shaped boom ground signatures, and (iii) develop new  ...  by matching a target near-field pressure distribution.  ... 
doi:10.2514/1.35543 fatcat:zx2ijd5vkbcg3k5sz6ymtpibve

Closed-Form Delay and Slew Metrics Made Easy

C.J. Alpert, F. Liu, C. Kashyap, A. Devgan
2004 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
Our metrics are derived from matching circuit moments to the lognormal distribution. From a single table, one can easily implement the metrics for delay and slew for both step and ramp inputs.  ...  For optimizations like physical synthesis and static timing analysis, efficient interconnect delay and slew computation is critical.  ...  Instead of matching to the gamma distribution, Liu et al. [14] recently proposed matching to the Weibull distribution.  ... 
doi:10.1109/tcad.2004.837727 fatcat:fwhep6lf4vg75a6vxaznbr2l6m

Exploiting locality in distributed SDN control

Stefan Schmid, Jukka Suomela
2013 Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking - HotSDN '13  
Vision:  Control becomes distributed  Controllers become near-sighted (control part of network or flow space) Why:  Enables wide-area SDN networks  Administrative: Alice and Bob  Admin. domains, local  ...  vs Bob Distributed control in two dimensions!  ...  ., The good news: Near-optimal semi-matchings can be found efficiently and locally! Runtime independent of graph size and local communication only. (How? Paper!  ) U = 6 = 5 ??  ... 
doi:10.1145/2491185.2491198 dblp:conf/sigcomm/SchmidS13 fatcat:wzulolvmgvcfdcqdo3co2zokky

Robust Online Matching with User Arrival Distribution Drift

Yu-Hang Zhou, Chen Liang, Nan Li, Cheng Yang, Shenghuo Zhu, Rong Jin
set on the underlying user distribution.  ...  Recently, online matching problems have attracted much attention due to its emerging applications in internet advertising.  ...  When C.R. of an online algorithm approaches to 1, we call it a near-optimal algorithm.  ... 
doi:10.1609/aaai.v33i01.3301459 fatcat:566sw4t5ljc6fdwlpq6aw4twb4

Retail Price Optimization from Sparse Demand Data

Philip Thomas, Alec Chrystal
2013 American Journal of Industrial and Business Management  
This alternative way of interpreting retail demand data provides insights into the optimal price as a central measure of a demand distribution.  ...  Modeling individuals' variability in their maximum acceptable price using a near-exhaustive set of "demand densities", it will be established that the optimal price will be close both to the mean of the  ...  Estimating the Optimal Retail Price with Minimum Market Testing The fact that the matched Rectangular mean gives a good approximation to the optimal price for a near-exhaustive range of demand densities  ... 
doi:10.4236/ajibm.2013.33035 fatcat:nzc5tw2agjclhgs2jktst34t4e
« Previous Showing results 1 — 15 out of 622,312 results