Design of a unified arithmetic processor based on redundant constant-factor CORDIC with merged scaling operation

2000 ◽  
Vol 147 (4) ◽  
pp. 297 ◽  
Author(s):  
S.-F. Hsiao ◽  
C.-Y. Lau
Keyword(s):  
Constant Factor ◽  
Arithmetic Processor

Role and rationale of Kaala in the field of Ayurvedic Pharmaceutics - A Conceptual Approach

2017 ◽  
Vol 2 (4) ◽  
Author(s):  
Vrinda Bhat ◽  
Surekha S. Medikeri ◽  
Shobha G. Hiremath
Keyword(s):  
Dosage Form ◽  
Pharmaceutical Preparation ◽  
Vital Role ◽  
Constant Factor ◽  
Conceptual Approach ◽  
Safety And Efficacy ◽  
Significant Aspect ◽  
Definition Of

Samskara is defined as a process of bringing about a desired modification or establishing a change of property in a drug or group of drugs. In the process of Aushadhi Nirmana, varied number of procedures (Samskaras) are adopted to inculcate the desired dosage form and efficacy to the medicine. Among all Samskaras, Kaala plays a vital role in Ayurvedic pharmaceutics. Kaala is a constant factor which follows incoherently in every step of Aushadhi Nirmana. Active principles of plants vary in every season and at different quarters of the day. After the collection of drugs for a pharmaceutical preparation, Kaala plays its role during Paka of various formulations. The definition of pharmaceutics does not end with mere production of a dosage form but also includes its safety and efficacy. Kaala has the potential to influence both these factors. Thus, our Acharyas have provided meticulous information on Ayurvedic pharmaceutics giving prime importance to a minute, yet very significant aspect called “Kaala”.

scholarly journals Conditions for the validity of a class of optimal Hilbert type multiple integral inequalities with nonhomogeneous kernels

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Bing He ◽  
Yong Hong ◽  
Zhen Li
Keyword(s):  
Integral Inequality ◽  
Function Method ◽  
Sufficient Conditions ◽  
Integral Operators ◽  
Multiple Integral ◽  
Constant Factor ◽  
Best Constant ◽  
Necessary And Sufficient ◽  
Best Constant Factor ◽  
Hilbert Type

AbstractFor the Hilbert type multiple integral inequality $$ \int _{\mathbb{R}_{+}^{n}} \int _{\mathbb{R}_{+}^{m}} K\bigl( \Vert x \Vert _{m,\rho }, \Vert y \Vert _{n, \rho }\bigr) f(x)g(y) \,\mathrm{d} x \,\mathrm{d} y \leq M \Vert f \Vert _{p, \alpha } \Vert g \Vert _{q, \beta } $$ ∫ R + n ∫ R + m K ( ∥ x ∥ m , ρ , ∥ y ∥ n , ρ ) f ( x ) g ( y ) d x d y ≤ M ∥ f ∥ p , α ∥ g ∥ q , β with a nonhomogeneous kernel $K(\|x\|_{m, \rho }, \|y\|_{n, \rho })=G(\|x\|^{\lambda _{1}}_{m, \rho }/ \|y\|^{\lambda _{2}}_{n, \rho })$ K ( ∥ x ∥ m , ρ , ∥ y ∥ n , ρ ) = G ( ∥ x ∥ m , ρ λ 1 / ∥ y ∥ n , ρ λ 2 ) ($\lambda _{1}\lambda _{2}> 0$ λ 1 λ 2 > 0 ), in this paper, by using the weight function method, necessary and sufficient conditions that parameters p, q, $\lambda _{1}$ λ 1 , $\lambda _{2}$ λ 2 , α, β, m, and n should satisfy to make the inequality hold for some constant M are established, and the expression formula of the best constant factor is also obtained. Finally, their applications in operator boundedness and operator norm are also considered, and the norms of several integral operators are discussed.

scholarly journals A reverse Hardy–Hilbert-type integral inequality involving one derivative function

2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Qian Chen ◽  
Bicheng Yang
Keyword(s):  
Integral Inequality ◽  
Beta Function ◽  
Equivalent Form ◽  
Constant Factor ◽  
Weight Functions ◽  
Derivative Function ◽  
The Best Possible Constant ◽  
Type Integral ◽  
Hilbert Type ◽  
Hilbert Integral

AbstractIn this article, by using weight functions, the idea of introducing parameters, the reverse extended Hardy–Hilbert integral inequality and the techniques of real analysis, a reverse Hardy–Hilbert-type integral inequality involving one derivative function and the beta function is obtained. The equivalent statements of the best possible constant factor related to several parameters are considered. The equivalent form, the cases of non-homogeneous kernel and some particular inequalities are also presented.

scholarly journals Empowering the configuration-IP: new PTAS results for scheduling with setup times

2021 ◽  
Author(s):  
Klaus Jansen ◽  
Kim-Manuel Klein ◽  
Marten Maack ◽  
Malin Rau
Keyword(s):  
Approximation Scheme ◽  
Constant Factor ◽  
Setup Times ◽  
Linear Programs ◽  
Scheduling Problems ◽  
Design Of Algorithms ◽  
Packing Problems ◽  
Integer Linear Programs ◽  
One Machine ◽  
Target Locations

AbstractInteger linear programs of configurations, or configuration IPs, are a classical tool in the design of algorithms for scheduling and packing problems where a set of items has to be placed in multiple target locations. Herein, a configuration describes a possible placement on one of the target locations, and the IP is used to choose suitable configurations covering the items. We give an augmented IP formulation, which we call the module configuration IP. It can be described within the framework of n-fold integer programming and, therefore, be solved efficiently. As an application, we consider scheduling problems with setup times in which a set of jobs has to be scheduled on a set of identical machines with the objective of minimizing the makespan. For instance, we investigate the case that jobs can be split and scheduled on multiple machines. However, before a part of a job can be processed, an uninterrupted setup depending on the job has to be paid. For both of the variants that jobs can be executed in parallel or not, we obtain an efficient polynomial time approximation scheme (EPTAS) of running time $$f(1/\varepsilon )\cdot \mathrm {poly}(|I|)$$ f ( 1 / ε ) · poly ( | I | ) . Previously, only constant factor approximations of 5/3 and $$4/3 + \varepsilon $$ 4 / 3 + ε , respectively, were known. Furthermore, we present an EPTAS for a problem where classes of (non-splittable) jobs are given, and a setup has to be paid for each class of jobs being executed on one machine.

scholarly journals On a more accurate Hilbert-type inequality in the whole plane with the general homogeneous kernel

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Xingshou Huang ◽  
Bicheng Yang
Keyword(s):  
Equivalent Form ◽  
Type Inequality ◽  
Constant Factor ◽  
Real Analysis ◽  
Homogeneous Kernel ◽  
Hilbert’S Inequality ◽  
The Best Possible Constant ◽  
Hilbert Type ◽  
Weight Coefficients

AbstractBy the use of the weight coefficients, the idea of introduced parameters and the technique of real analysis, a more accurate Hilbert-type inequality in the whole plane with the general homogeneous kernel is given, which is an extension of the more accurate Hardy–Hilbert’s inequality. An equivalent form is obtained. The equivalent statements of the best possible constant factor related to several parameters, the operator expressions and a few particular cases are considered.

scholarly journals Constant factor approximation algorithm for TSP satisfying a biased triangle inequality

2017 ◽  
Vol 657 ◽  
pp. 111-126 ◽  
Author(s):  
Usha Mohan ◽  
Sivaramakrishnan Ramani ◽  
Sounaka Mishra
Keyword(s):  
Approximation Algorithm ◽  
Triangle Inequality ◽  
Constant Factor

scholarly journals PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES

2007 ◽  
Vol 17 (01) ◽  
pp. 1-30 ◽  
Author(s):  
DANIEL A. SPIELMAN ◽  
SHANG-HUA TENG ◽  
ALPER ÜNGÖR
Keyword(s):  
Mesh Size ◽  
Constant Factor ◽  
Two Dimensions ◽  
Three Dimensions ◽  
Delaunay Refinement ◽  
Steiner Points ◽  
Input Domain ◽  
Set Of Points ◽  
Refinement Algorithm

We present a parallel Delaunay refinement algorithm for generating well-shaped meshes in both two and three dimensions. Like its sequential counterparts, the parallel algorithm iteratively improves the quality of a mesh by inserting new points, the Steiner points, into the input domain while maintaining the Delaunay triangulation. The Steiner points are carefully chosen from a set of candidates that includes the circumcenters of poorly-shaped triangular elements. We introduce a notion of independence among possible Steiner points that can be inserted simultaneously during Delaunay refinements and show that such a set of independent points can be constructed efficiently and that the number of parallel iterations is O( log 2Δ), where Δ is the spread of the input — the ratio of the longest to the shortest pairwise distances among input features. In addition, we show that the parallel insertion of these set of points can be realized by sequential Delaunay refinement algorithms such as by Ruppert's algorithm in two dimensions and Shewchuk's algorithm in three dimensions. Therefore, our parallel Delaunay refinement algorithm provides the same shape quality and mesh-size guarantees as these sequential algorithms. For generating quasi-uniform meshes, such as those produced by Chew's algorithms, the number of parallel iterations is in fact O( log Δ). To the best of our knowledge, our algorithm is the first provably polylog(Δ) time parallel Delaunay-refinement algorithm that generates well-shaped meshes of size within a constant factor of the best possible.

Swept wing boundary-layer receptivity to localized surface roughness

2012 ◽  
Vol 711 ◽  
pp. 516-544 ◽  
Author(s):  
David Tempelmann ◽  
Lars-Uve Schrader ◽  
Ardeshir Hanifi ◽  
Luca Brandt ◽  
Dan S. Henningson
Keyword(s):  
Boundary Layer ◽  
Surface Roughness ◽  
Practical Interest ◽  
Leading Edge ◽  
Constant Factor ◽  
Computationally Efficient ◽  
Swept Wing ◽  
Predictive Tool ◽  
Free Stream Turbulence ◽  
Streamwise Location

AbstractThe receptivity to localized surface roughness of a swept-wing boundary layer is studied by direct numerical simulation (DNS) and computations using the parabolized stability equations (PSEs). The DNS is laid out to reproduce wind tunnel experiments performed by Saric and coworkers, where micron-sized cylinders were used to trigger steady crossflow modes. The amplitudes of the roughness-induced fundamental crossflow wave and its superharmonics obtained from nonlinear PSE solutions agree excellently with the DNS results. A receptivity model using the direct and adjoint PSEs is shown to provide reliable predictions of the receptivity to roughness cylinders of different heights and chordwise locations. Being robust and computationally efficient, the model is well suited as a predictive tool of receptivity in flows of practical interest. The crossflow mode amplitudes obtained based on both DNS and PSE methods are 40 % of those measured in the experiments. Additional comparisons between experimental and PSE data for various disturbance wavelengths reveal that the measured disturbance amplitudes are consistently larger than those predicted by the PSE-based receptivity model by a nearly constant factor. Supplementary DNS and PSE computations suggest that possible natural leading-edge roughness and free-stream turbulence in the experiments are unlikely to account for this discrepancy. It is more likely that experimental uncertainties in the streamwise location of the roughness array and cylinder height are responsible for the additional receptivity observed in the experiments.

Sign in / Sign up

Export Citation Format

Share Document