955 Hits in 5.2 sec

A novel methodology for antenna design and optimization: Variable Zo [article]

Richard A. Formato
2011 arXiv   pre-print
This paper describes "Variable Zo," a novel and proprietary approach to antenna design and optimization.  ...  Variable Zo is applicable to any antenna design or optimization methodology. Using it will result in generally better antenna designs across any user-specified set of performance objectives.  ...  An optimized dipole array design using fixed 0 Z is described in [3] .  ... 
arXiv:1107.1437v2 fatcat:ggzk5oax4nfubls3rxihkmwrzm

Accreditation and Certification: Do They Improve Hospital Financial and Quality Performance?

Matthew Brooks, Brad M. Beauvais, Clemens Scott Kruse, Lawrence Fulton, Michael Mileski, Zo Ramamonjiarivelo, Ramalingam Shanmugam, Cristian Lieneck
2021 Healthcare  
Since academic program accreditation is one piece of evidence of high-quality education, and since professional certification is an attestation to the knowledge, skills, and abilities of those who are  ...  Graduates' affiliation with the American College of Healthcare Executives (ACHE) professional healthcare leadership organization was also assessed as an independent variable.  ...  Data Availability Statement: Publicly available datasets were partially compiled with the assistance of the Definitive Healthcare website (found here:  ... 
doi:10.3390/healthcare9070887 fatcat:u4qfpbbjfzeubpmrkxkopijvbm

Grain Sieve Loss Fuzzy Control System in Rice Combine Harvesters

Zhenwei Liang, Yaoming Li, Lizhang Xu
2018 Applied Sciences  
grain sieve loss, a fuzzy control system was developed, which selected S7-1200 PLC as the main control unit to build the lower computer hardware system, utilized ladder language to complete the system compilation  ...  The main working parts of the cleaning device of a rice combine harvester can be controlled by an established control strategy in real time based on the monitored grain sieve loss.  ...  Ladder language was utilized to complete the system compilation.  ... 
doi:10.3390/app9010114 fatcat:gpi5uw25lfay7a6ed4ruhd4r2i

Page 910 of Mathematical Reviews Vol. 55, Issue 3 [page]

1978 Mathematical Reviews  
Then the sample mean ¥=(x,+ ---+.x,)/n is an admissible esti- mator of @ if and only if F(x) is a d.f. of the normal law with zero mean. In the present paper the following result is proved.  ...  Theorem: If two people have the same priors, and their posteriors for an event A are common knowledge, then these posteriors are equal.” I. J. Good (Blacksburg, Va.) 6627 Zinger, A.  ... 

xJsnark: A Framework for Efficient Verifiable Computation

Ahmed Kosba, Charalampos Papamanthou, Elaine Shi
2018 2018 IEEE Symposium on Security and Privacy (SP)  
The former approach is difficult to use but on the other hand allows an expert programmer to perform custom optimizations that minimize the resulting circuit.  ...  In comparison, the latter approach is much more friendly to non-specialist users, but existing compilers often emit suboptimal circuits.  ...  translates applications written in C# into code that produces scalable zero knowledge proofs of knowledge.  ... 
doi:10.1109/sp.2018.00018 dblp:conf/sp/KosbaPS18 fatcat:dbet2sbqb5e7xgfnluzmnuiymi

Back in Black: A Comparative Evaluation of Recent State-Of-The-Art Black-Box Attacks [article]

Kaleel Mahmood, Rigel Mahmood, Ethan Rathbun, Marten van Dijk
2021 arXiv   pre-print
The attack is an iterative algorithm that initializes the image perturbation, , as a matrix of all zeros.  ...  The Square attack reports an attack success rate of 92.2% while the ZO-ADMM reports an attack success rate of 100%.  ... 
arXiv:2109.15031v1 fatcat:a7ifv5wcrng3pbxqneo7wqmcei

Minimizing Drum Latency Time

Donald E. Knuth
1961 Journal of the ACM  
The choices here are made by consulting the availability table and trying to maintain an even distribution among the available locations.  ...  57 t TAu <"t;- BASET” h we we Compiled (optim tupe Hor S ?  ... 
doi:10.1145/321062.321063 fatcat:qfe4yhwbfbfudibb4rg5rxuwu4

Retrieval of mesospheric electron densities using an optimal estimation inverse method

J. Grant, R.G. Grainger, B.N. Lawrence, G.J. Fraser, H.A. von Biel, D.N. Heuff, G.E. Plank
2004 Journal of Atmospheric and Solar-Terrestrial Physics  
The technique uses an optimal estimation inverse method and retrieves both an electron density proÿle and a gradient electron density proÿle.  ...  by retrieving both the "width" and Ne of an assumed Gaussian distribution of Ne values within the height interval.  ...  Retrieval overview An explicit description of the underlying mathematical principles and general notation for the optimal estimation (OE) retrieval is given by Rodgers (2000) .  ... 
doi:10.1016/j.jastp.2003.12.006 fatcat:bk4cfdmdkrc3dhczqwetmx7enm

Reviews and Descriptions of Tables and Books

1965 Mathematics of Computation  
Another improvement over the earlier editions is the inclusion of a glossary of symbols and an index of numerical tables, as well as an appropriately enlarged subject index.  ...  additional tables have been included in this new edition: one of these, which constitutes part of Table 32 , contains 4D square roots of certain common fractions; the other gives 3D values of the x2 distribution  ...  Linear tapered aperture, fiz) -i + | (« -zo), 2o -ß~l ^ z S zo + ß'\ = 0, -00 g z ^ Zo -ß~\ = 1, zo + ß'1 á z. II.  ... 
doi:10.1090/s0025-5718-65-99244-6 fatcat:havfmbmrfvervd32hxoatnb5ou

Computational aspects of optics design and simulation: COSY INFINITY

Martin Berz
1990 Nuclear Instruments and Methods in Physics Research Section A : Accelerators, Spectrometers, Detectors and Associated Equipment  
Grouping of elements as well as structures for optimization and study are readily available through the features of the language .  ...  The compiler of the language is written in Fortran 77 to guarantee wide portability. The language was used to write a very general beam optics code, COSY INFINITY .  ...  (7) and (14) and zo e (17) have been used.  ... 
doi:10.1016/0168-9002(90)90649-q fatcat:y6mpr5yc4rgdjnbafn5bq5p2fu

TELPACK: an advanced teletraffic analysis package

N. Akar, N.C. Oguz, K. Sohraby
1998 IEEE Communications Magazine  
All that is required to get it running is a UNIX box and a C compiler.  ...  Among these outputs are the stationary queue probabilities, the factorial moments of the queue occupancy distribution, an estimated error of the solution, and the key matrix and vector elements characterizing  ... 
doi:10.1109/35.707821 fatcat:v5hijrv7s5divhpkd2pvd2fbtm

Artificial neural network control system for spacecraff attitude stabilization

C.M. Segura, J.B. Burl
1989 Twenty-Third Asilomar Conference on Signals, Systems and Computers, 1989.  
This plot indicates that the zero-trace of the neural network function is not coincident with the desired optimal control zero-trace.  ...  the knowledge of the correct answer.  ... 
doi:10.1109/acssc.1989.1200810 fatcat:l5jlulyxiffs3dluetpwgbcfwe

Reviews and Descriptions of Tables and Books

1957 Mathematics of Computation  
may be done by the insertion of a single card in the optimizing deck.  ...  Therefore a sequential program may easily be optimized for several different values of n and modulus in order to test the best mode of optimizing for the particular routine.  ...  The maximal deviation from zero in / is A. For an account of these functions see H. Piloty [3P].-T.  ... 
doi:10.1090/s0025-5718-57-99297-9 fatcat:56otdxz3bnfq7lboppyaiaqmki

Caching Mechanism in Peer-to-Peer Networks through Active XML

Abdullah Alrefae, Eric Pardede, Binh Viet Phan
2012 Journal of Software  
We have analyzed the survey results to compile an improved catalogue.  ...  inhibitor arc(i=1,2)} is called the set of zero-one transitions(ZO ) of , and let 0i = 0 ∩ i , if t ∈ 0i , t is called a ZO of i as well.  ...  A properly designed DSS is an interactive software-based system intended to help decision makers compile useful information from a combination of raw data, documents, personal knowledge, or business models  ... 
doi:10.4304/jsw.7.3.508-515 fatcat:6vlsijzaxjbohh3ti5toew7rmi

An exact ceiling point algorithm for general integer linear programming

Robert M. Saltzman, Frederick S. Hillier
1991 Naval Research Logistics  
Therefore, if V < z, the problem is solved with xi as an optimal solution for (ILP).  ...  Their integer coefficients were generated from a uniform distribution over the intervals shown in the For algorithms which solve the (LPR) associated with (ILP), an alternative to simply reporting CPU  ...  One key theorem therein demonstrates that all optimal solutions for an (ILP) whose feasible region is non-empty and bounded are feasible 1-ceiling points.  ... 
doi:10.1002/1520-6750(199102)38:1<53::aid-nav3220380107>;2-d fatcat:cgjrkwfdhvba3ke2mt6uvnzpgy
« Previous Showing results 1 — 15 out of 955 results