Saffron Stigma Separation by Oscillating Seperator and Wind Tunnel
نویسندگان
چکیده
منابع مشابه
separation of saffron stigma from stamen and petal in a vertical wind tunnel and evaluation by fuzzy logic
in this paper the separation of saffron stigma from stamen and petal in a vertical wind tunnel has been evaluated. a wind tunnel with adjustable speed of 0.1 m s-1 intervals has been developed and used for the experiments. floating velocities of flower components (petal, stigma and stamen) were measured at one, eight, 38 and 60 hours after harvesting. subsequently, the separation was tested by ...
متن کاملSpace charge generated by wind tunnel fires
Ž . Plume clouds resulting from wildland fires pyrocumulus sometimes produce lightning discharges to ground. These discharges were found to carry positive charge to ground exclusively in several cases. Emission of space charge was observed from woody materials burned in the presence of an external electric field. Measurements done in a large wind tunnel for this study confirm and extend measure...
متن کاملSeparation of STIGMA STEROL using magnetic molecularly imprinted nanopolymer fabricated by sol-gel method
Background & Aims: Magnetically molecularly imprinted polymers (MMIPs) are assumed as kind of sorbent polymers ‎which can separate or determine bioactive compounds from environment fast and specifically. ‎Magnetic properties, stability at various conditions (temperature , ionic strength and pH) and selective ‎function are among the advantages of these polymers in determin...
متن کامل11-Foot Transonic Wind Tunnel
This paper describes a modeling method and a new optimal control approach to investigate a Mach number control problem for the NASA Ames 11-Foot Transonic Wind Tunnel. The flow in the wind tunnel is modeled by the 1-D unsteady Euler equations whose boundary conditions prescribe a controlling action by a compressor. The boundary control inputs to the compressor are in turn controlled by a drive ...
متن کاملOptimization on Seperator Trees
Given a chordal graph G, and a class of subgraphs H of G, we investigate the problem of finding an element H ∈ H which minimizes a function f : H → R. We show that when f satisfies a decomposability criterion, and when H admits what we call an efficiently decomposable configuration space with respect to f , then this optimization problem can be solved in polynomial time. We give a dynamic progr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Modern Applied Science
سال: 2012
ISSN: 1913-1852,1913-1844
DOI: 10.5539/mas.v6n7p101