Micromachined cutting blade formed from {211}-oriented silicon

DOEpatents

Fleming, James G.; Sniegowski, Jeffry J.; Montague, Stephen

2003-09-09

A cutting blade is disclosed fabricated of micromachined silicon. The cutting blade utilizes a monocrystalline silicon substrate having a {211} crystalline orientation to form one or more cutting edges that are defined by the intersection of {211} crystalline planes of silicon with {111} crystalline planes of silicon. This results in a cutting blade which has a shallow cutting-edge angle .theta. of 19.5.degree.. The micromachined cutting blade can be formed using an anisotropic wet etching process which substantially terminates etching upon reaching the {111} crystalline planes of silicon. This allows multiple blades to be batch fabricated on a common substrate and separated for packaging and use. The micromachined cutting blade, which can be mounted to a handle in tension and optionally coated for increased wear resistance and biocompatibility, has multiple applications including eye surgery (LASIK procedure).

Micromachined cutting blade formed from {211}-oriented silicon

DOEpatents

Fleming, James G [Albuquerque, NM; Fleming, legal representative, Carol; Sniegowski, Jeffry J [Tijeras, NM; Montague, Stephen [Albuquerque, NM

2011-08-09

A cutting blade is disclosed fabricated of micromachined silicon. The cutting blade utilizes a monocrystalline silicon substrate having a {211} crystalline orientation to form one or more cutting edges that are defined by the intersection of {211} crystalline planes of silicon with {111} crystalline planes of silicon. This results in a cutting blade which has a shallow cutting-edge angle .theta. of 19.5.degree.. The micromachined cutting blade can be formed using an anisotropic wet etching process which substantially terminates etching upon reaching the {111} crystalline planes of silicon. This allows multiple blades to be batch fabricated on a common substrate and separated for packaging and use. The micromachined cutting blade, which can be mounted to a handle in tension and optionally coated for increased wear resistance and biocompatibility, has multiple applications including eye surgery (LASIK procedure).

Ultra-small-angle neutron scattering with azimuthal asymmetry

DOE PAGES

Gu, X.; Mildner, D. F. R.

2016-05-16

Small-angle neutron scattering (SANS) measurements from thin sections of rock samples such as shales demand as great a scattering vector range as possible because the pores cover a wide range of sizes. The limitation of the scattering vector range for pinhole SANS requires slit-smeared ultra-SANS (USANS) measurements that need to be converted to pinhole geometry. The desmearing algorithm is only successful for azimuthally symmetric data. Scattering from samples cut parallel to the plane of bedding is symmetric, exhibiting circular contours on a two-dimensional detector. Samples cut perpendicular to the bedding show elliptically dependent contours with the long axis corresponding tomore » the normal to the bedding plane. A method is given for converting such asymmetric data collected on a double-crystal diffractometer for concatenation with the usual pinhole-geometry SANS data. Furthermore, the aspect ratio from the SANS data is used to modify the slit-smeared USANS data to produce quasi-symmetric contours. Rotation of the sample about the incident beam may result in symmetric data but cannot extract the same information as obtained from pinhole geometry.« less

Ultra-small-angle neutron scattering with azimuthal asymmetry

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gu, X.; Mildner, D. F. R.

Small-angle neutron scattering (SANS) measurements from thin sections of rock samples such as shales demand as great a scattering vector range as possible because the pores cover a wide range of sizes. The limitation of the scattering vector range for pinhole SANS requires slit-smeared ultra-SANS (USANS) measurements that need to be converted to pinhole geometry. The desmearing algorithm is only successful for azimuthally symmetric data. Scattering from samples cut parallel to the plane of bedding is symmetric, exhibiting circular contours on a two-dimensional detector. Samples cut perpendicular to the bedding show elliptically dependent contours with the long axis corresponding tomore » the normal to the bedding plane. A method is given for converting such asymmetric data collected on a double-crystal diffractometer for concatenation with the usual pinhole-geometry SANS data. Furthermore, the aspect ratio from the SANS data is used to modify the slit-smeared USANS data to produce quasi-symmetric contours. Rotation of the sample about the incident beam may result in symmetric data but cannot extract the same information as obtained from pinhole geometry.« less

Case-related factors affecting cutting errors of the proximal tibia in total knee arthroplasty assessed by computer navigation.

PubMed

Tsukeoka, Tadashi; Tsuneizumi, Yoshikazu; Yoshino, Kensuke; Suzuki, Mashiko

2018-05-01

The aim of this study was to determine factors that contribute to bone cutting errors of conventional instrumentation for tibial resection in total knee arthroplasty (TKA) as assessed by an image-free navigation system. The hypothesis is that preoperative varus alignment is a significant contributory factor to tibial bone cutting errors. This was a prospective study of a consecutive series of 72 TKAs. The amount of the tibial first-cut errors with reference to the planned cutting plane in both coronal and sagittal planes was measured by an image-free computer navigation system. Multiple regression models were developed with the amount of tibial cutting error in the coronal and sagittal planes as dependent variables and sex, age, disease, height, body mass index, preoperative alignment, patellar height (Insall-Salvati ratio) and preoperative flexion angle as independent variables. Multiple regression analysis showed that sex (male gender) (R = 0.25 p = 0.047) and preoperative varus alignment (R = 0.42, p = 0.001) were positively associated with varus tibial cutting errors in the coronal plane. In the sagittal plane, none of the independent variables was significant. When performing TKA in varus deformity, careful confirmation of the bone cutting surface should be performed to avoid varus alignment. The results of this study suggest technical considerations that can help a surgeon achieve more accurate component placement. IV.

Cutting performance orthogonal test of single plane puncture biopsy needle based on puncture force

NASA Astrophysics Data System (ADS)

Xu, Yingqiang; Zhang, Qinhe; Liu, Guowei

2017-04-01

Needle biopsy is a method to extract the cells from the patient's body with a needle for tissue pathological examination. Many factors affect the cutting process of soft tissue, including the geometry of the biopsy needle, the mechanical properties of the soft tissue, the parameters of the puncture process and the interaction between them. This paper conducted orthogonal experiment of main cutting parameters based on single plane puncture biopsy needle, and obtained the cutting force curve of single plane puncture biopsy needle by studying the influence of the inclination angle, diameter and velocity of the single plane puncture biopsy needle on the puncture force of the biopsy needle. Stage analysis of the cutting process of biopsy needle puncture was made to determine the main influencing factors of puncture force during the cutting process, which provides a certain theoretical support for the design of new type of puncture biopsy needle and the operation of puncture biopsy.

Tool Forces and Chip Formation In Orthogonal Cutting Of Loblolly Pine

Treesearch

George E. Woodson; Peter Koch

1970-01-01

Specimens of earlywood and latewood of Pinus taeda L. were excised so that length along the grain was 3 inches and thickness was 0.1 inch. These specimens were cut orthogonally-as with a carpenter's plane-in the three major directions. Cutting velocity was 2 inches per minute. When cutting was in the planing (90-O) direction, thin chips,...

Application of the Finite Element Method to Reveal the Causes of Loss of Planeness of Hot-Rolled Steel Sheets during Laser Cutting

NASA Astrophysics Data System (ADS)

Garber, E. A.; Bolobanova, N. L.; Trusov, K. A.

2018-01-01

A finite element technique is developed to simulate the stresses and the strains during strip flattening to reveal the causes of the cutting-assisted loss of planeness of hot-rolled steel sheets processed in roller levelers. The loss of planeness is found to be caused by a nonuniform distribution of the flattening-induced longitudinal tensile stresses over the strip thickness and width. The application of tensile forces to a strip in a roller leveler decreases this nonuniformity and prevents loss of planeness in cutting.

Anisotropy in Alpedrete granite cutting (Rift, Grain and Hardway directions) and effect on bush hammered heritage ashlars

NASA Astrophysics Data System (ADS)

Freire-Lista, David Martin; Fort, Rafael

2015-04-01

Many monuments and cities that are part of humanity's heritage have been built with carved granite ashlars. This dimension stone is one of the most used due to its abundance and durability. Traditional quarrymen have used anisotropic planes to cut granite blocks in the quarry for improved cutting performance. These planes are called Rift, Grain and Hardway (R, G, H) according to the ease of cutting. The aim of this study is to determine the response of each of the three orthogonal cutting planes R, G and H to the craft styling with bush hammer, based on their decay. Alpedrete granite was selected for this research, it is a monzogranite quarried in the Sierra de Guadarrana (Spanish Central System) foothills, in the province of Madrid, Spain. It is one of the most representative of Madrid's heritage granites. Alpedrete granite is also used as building stone in other European cities. From an Alpedrete granite bush hammered ashlar, three thin sections were cut parallel to the H plane; these thin sections cut R and G bush hammered planes. Also three thin sections have been cut parallel to the R plane at a distance of 2 mm, 10 mm and 30 mm from the bush hammered surface. All thin sections have been treated with fluorescein. In each of the thin sections a micrograph mosaic was performed covering the entire area (about 10 cm2, 300 photomicrographs) and printed with 120 increases. The length and spacing of inter-, intra- and trans-crystalline microcracks were quantified and measured. Microcracks were subdivided based on affected minerals in each R, G and H planes. Through these observations it was found that Alpedrete Granite R plane (easier to cut) is determined by exfoliation microcracks orientation. That is, R plane is parallel to the exfoliations microcracks, which are intra-crystalline and straight. The cutting of stones in the R plane is due to the coalescence of straight microcracks in the plane. This plane minimizes the effort and cost of subsequent carving so it has been used preferably as wall façades in heritage building ashlars. That is, the ashlars exposed surface. In other words, the exfoliation microcracks are oriented vertically in heritage ashlars. R planes bush hammering produces many new microcracks and propagation of exfoliation microcracks, generating significant decay with parallel and oblique microcracks to the bush hammered surface to a depth of more than 10 mm. G and H planes bush hammering generates coalescence and increased length of intra-crystalline exfoliation microcracks in the R plane; although, with less generation of new microcracks and less surface decay. To understand the decay in bush hammered granite ashlars and sculptures it is essential to study the orientation and distribution of exfoliations microcracks, which follow the R orientation stone in the quarry. This orientation should be reproduced when performing artificial accelerated ageing tests, especially with stones used in heritage buildings. Acknowledgements This study was funded by the Community of Madrid under the GEOMATERIALS 2 project (S2013/MIT-2914). The authors are members of the Complutense University of Madrid's Research Group: 'Alteración y Conservación de los Materiales Pétreos del Patrimonio' (ref. 921349)

Miniaturized multiwavelength digital holography sensor for extensive in-machine tool measurement

NASA Astrophysics Data System (ADS)

Seyler, Tobias; Fratz, Markus; Beckmann, Tobias; Bertz, Alexander; Carl, Daniel

2017-06-01

In this paper we present a miniaturized digital holographic sensor (HoloCut) for operation inside a machine tool. With state-of-the-art 3D measurement systems, short-range structures such as tool marks cannot be resolved inside a machine tool chamber. Up to now, measurements had to be conducted outside the machine tool and thus processing data are generated offline. The sensor presented here uses digital multiwavelength holography to get 3D-shape-information of the machined sample. By using three wavelengths, we get a large artificial wavelength with a large unambiguous measurement range of 0.5mm and achieve micron repeatability even in the presence of laser speckles on rough surfaces. In addition, a digital refocusing algorithm based on phase noise is implemented to extend the measurement range beyond the limits of the artificial wavelength and geometrical depth-of-focus. With complex wave field propagation, the focus plane can be shifted after the camera images have been taken and a sharp image with extended depth of focus is constructed consequently. With 20mm x 20mm field of view the sensor enables measurement of both macro- and micro-structure (such as tool marks) with an axial resolution of 1 µm, lateral resolution of 7 µm and consequently allows processing data to be generated online which in turn qualifies it as a machine tool control. To make HoloCut compact enough for operation inside a machining center, the beams are arranged in two planes: The beams are split into reference beam and object beam in the bottom plane and combined onto the camera in the top plane later on. Using a mechanical standard interface according to DIN 69893 and having a very compact size of 235mm x 140mm x 215mm (WxHxD) and a weight of 7.5 kg, HoloCut can be easily integrated into different machine tools and extends no more in height than a typical processing tool.

Ankle mechanics during sidestep cutting implicates need for 2-degrees of freedom powered ankle-foot prostheses.

PubMed

Ficanha, Evandro M; Rastgaar, Mohammad; Kaufman, Kenton R

2015-01-01

The ankle joint of currently available powered prostheses is capable of controlling one degree of freedom (DOF), focusing on improved mobility in the sagittal plane. To increase agility, the requirements of turning in prosthesis design need to be considered. Ankle kinematics and kinetics were studied during sidestep cutting and straight walking. There were no significant differences between the ankle sagittal plane mechanics when comparing sidestep cutting and straight walking; however, significant differences were observed in ankle frontal plane mechanics. During straight walking, the inversion-eversion (IE) angles were smaller than with sidestep cutting. The ankle that initiated the sidestep cutting showed progressively increasing inversion from 2 to 13 degrees while the following contralateral step showed progressively decreasing inversion from 8 to -4 degrees during normal walking speed. The changes in IE kinematics were the most significant during sidestep cutting compared with straight walking. The IE moments of the step that initiated the sidestep cutting were always in eversion, acting as a braking moment opposing the inverting motion. This suggests that an ankle-foot prosthesis with active DOFs in the sagittal and frontal planes will increase the agility of gait for patients with limb loss.

Numerical modelling of orthogonal cutting: application to woodworking with a bench plane.

PubMed

Nairn, John A

2016-06-06

A numerical model for orthogonal cutting using the material point method was applied to woodcutting using a bench plane. The cutting process was modelled by accounting for surface energy associated with wood fracture toughness for crack growth parallel to the grain. By using damping to deal with dynamic crack propagation and modelling all contact between wood and the plane, simulations could initiate chip formation and proceed into steady-state chip propagation including chip curling. Once steady-state conditions were achieved, the cutting forces became constant and could be determined as a function of various simulation variables. The modelling details included a cutting tool, the tool's rake and grinding angles, a chip breaker, a base plate and a mouth opening between the base plate and the tool. The wood was modelled as an anisotropic elastic-plastic material. The simulations were verified by comparison to an analytical model and then used to conduct virtual experiments on wood planing. The virtual experiments showed interactions between depth of cut, chip breaker location and mouth opening. Additional simulations investigated the role of tool grinding angle, tool sharpness and friction.

Study of high speed complex number algorithms. [for determining antenna for field radiation patterns

NASA Technical Reports Server (NTRS)

Heisler, R.

1981-01-01

A method of evaluating the radiation integral on the curved surface of a reflecting antenna is presented. A three dimensional Fourier transform approach is used to generate a two dimensional radiation cross-section along a planer cut at any angle phi through the far field pattern. Salient to the method is an algorithm for evaluating a subset of the total three dimensional discrete Fourier transform results. The subset elements are selectively evaluated to yield data along a geometric plane of constant. The algorithm is extremely efficient so that computation of the induced surface currents via the physical optics approximation dominates the computer time required to compute a radiation pattern. Application to paraboloid reflectors with off-focus feeds in presented, but the method is easily extended to offset antenna systems and reflectors of arbitrary shapes. Numerical results were computed for both gain and phase and are compared with other published work.

Fault Identification by Unsupervised Learning Algorithm

NASA Astrophysics Data System (ADS)

Nandan, S.; Mannu, U.

2012-12-01

Contemporary fault identification techniques predominantly rely on the surface expression of the fault. This biased observation is inadequate to yield detailed fault structures in areas with surface cover like cities deserts vegetation etc and the changes in fault patterns with depth. Furthermore it is difficult to estimate faults structure which do not generate any surface rupture. Many disastrous events have been attributed to these blind faults. Faults and earthquakes are very closely related as earthquakes occur on faults and faults grow by accumulation of coseismic rupture. For a better seismic risk evaluation it is imperative to recognize and map these faults. We implement a novel approach to identify seismically active fault planes from three dimensional hypocenter distribution by making use of unsupervised learning algorithms. We employ K-means clustering algorithm and Expectation Maximization (EM) algorithm modified to identify planar structures in spatial distribution of hypocenter after filtering out isolated events. We examine difference in the faults reconstructed by deterministic assignment in K- means and probabilistic assignment in EM algorithm. The method is conceptually identical to methodologies developed by Ouillion et al (2008, 2010) and has been extensively tested on synthetic data. We determined the sensitivity of the methodology to uncertainties in hypocenter location, density of clustering and cross cutting fault structures. The method has been applied to datasets from two contrasting regions. While Kumaon Himalaya is a convergent plate boundary, Koyna-Warna lies in middle of the Indian Plate but has a history of triggered seismicity. The reconstructed faults were validated by examining the fault orientation of mapped faults and the focal mechanism of these events determined through waveform inversion. The reconstructed faults could be used to solve the fault plane ambiguity in focal mechanism determination and constrain the fault orientations for finite source inversions. The faults produced by the method exhibited good correlation with the fault planes obtained by focal mechanism solutions and previously mapped faults.

Finite pure integer programming algorithms employing only hyperspherically deduced cuts

NASA Technical Reports Server (NTRS)

Young, R. D.

1971-01-01

Three algorithms are developed that may be based exclusively on hyperspherically deduced cuts. The algorithms only apply, therefore, to problems structured so that these cuts are valid. The algorithms are shown to be finite.

Research on cutting path optimization of sheet metal parts based on ant colony algorithm

NASA Astrophysics Data System (ADS)

Wu, Z. Y.; Ling, H.; Li, L.; Wu, L. H.; Liu, N. B.

2017-09-01

In view of the disadvantages of the current cutting path optimization methods of sheet metal parts, a new method based on ant colony algorithm was proposed in this paper. The cutting path optimization problem of sheet metal parts was taken as the research object. The essence and optimization goal of the optimization problem were presented. The traditional serial cutting constraint rule was improved. The cutting constraint rule with cross cutting was proposed. The contour lines of parts were discretized and the mathematical model of cutting path optimization was established. Thus the problem was converted into the selection problem of contour lines of parts. Ant colony algorithm was used to solve the problem. The principle and steps of the algorithm were analyzed.

Navigated total knee arthroplasty: is it error-free?

PubMed

Chua, Kerk Hsiang Zackary; Chen, Yongsheng; Lingaraj, Krishna

2014-03-01

The aim of this study was to determine whether errors do occur in navigated total knee arthroplasty (TKAs) and to study whether errors in bone resection or implantation contribute to these errors. A series of 20 TKAs was studied using computer navigation. The coronal and sagittal alignments of the femoral and tibial cutting guides, the coronal and sagittal alignments of the final tibial implant and the coronal alignment of the final femoral implant were compared with that of the respective bone resections. To determine the post-implantation mechanical alignment of the limb, the coronal alignment of the femoral and tibial implants was combined. The median deviation between the femoral cutting guide and bone resection was 0° (range -0.5° to +0.5°) in the coronal plane and 1.0° (range -2.0° to +1.0°) in the sagittal plane. The median deviation between the tibial cutting guide and bone resection was 0.5° (range -1.0° to +1.5°) in the coronal plane and 1.0° (range -1.0° to +3.5°) in the sagittal plane. The median deviation between the femoral bone resection and the final implant was 0.25° (range -2.0° to 3.0°) in the coronal plane. The median deviation between the tibial bone resection and the final implant was 0.75° (range -3.0° to +1.5°) in the coronal plane and 1.75° (range -4.0° to +2.0°) in the sagittal plane. The median post-implantation mechanical alignment of the limb was 0.25° (range -3.0° to +2.0°). When navigation is used only to guide the positioning of the cutting jig, errors may arise in the manual, non-navigated steps of the procedure. Our study showed increased cutting errors in the sagittal plane for both the femur and the tibia, and following implantation, the greatest error was seen in the sagittal alignment of the tibial component. Computer navigation should be used not only to guide the positioning of the cutting jig, but also to check the bone resection and implant position during TKA. IV.

Optimization of Straight Cylindrical Turning Using Artificial Bee Colony (ABC) Algorithm

NASA Astrophysics Data System (ADS)

Prasanth, Rajanampalli Seshasai Srinivasa; Hans Raj, Kandikonda

2017-04-01

Artificial bee colony (ABC) algorithm, that mimics the intelligent foraging behavior of honey bees, is increasingly gaining acceptance in the field of process optimization, as it is capable of handling nonlinearity, complexity and uncertainty. Straight cylindrical turning is a complex and nonlinear machining process which involves the selection of appropriate cutting parameters that affect the quality of the workpiece. This paper presents the estimation of optimal cutting parameters of the straight cylindrical turning process using the ABC algorithm. The ABC algorithm is first tested on four benchmark problems of numerical optimization and its performance is compared with genetic algorithm (GA) and ant colony optimization (ACO) algorithm. Results indicate that, the rate of convergence of ABC algorithm is better than GA and ACO. Then, the ABC algorithm is used to predict optimal cutting parameters such as cutting speed, feed rate, depth of cut and tool nose radius to achieve good surface finish. Results indicate that, the ABC algorithm estimated a comparable surface finish when compared with real coded genetic algorithm and differential evolution algorithm.

Crystal Orientation Effect on the Subsurface Deformation of Monocrystalline Germanium in Nanometric Cutting.

PubMed

Lai, Min; Zhang, Xiaodong; Fang, Fengzhou

2017-12-01

Molecular dynamics simulations of nanometric cutting on monocrystalline germanium are conducted to investigate the subsurface deformation during and after nanometric cutting. The continuous random network model of amorphous germanium is established by molecular dynamics simulation, and its characteristic parameters are extracted to compare with those of the machined deformed layer. The coordination number distribution and radial distribution function (RDF) show that the machined surface presents the similar amorphous state. The anisotropic subsurface deformation is studied by nanometric cutting on the (010), (101), and (111) crystal planes of germanium, respectively. The deformed structures are prone to extend along the 110 slip system, which leads to the difference in the shape and thickness of the deformed layer on various directions and crystal planes. On machined surface, the greater thickness of subsurface deformed layer induces the greater surface recovery height. In order to get the critical thickness limit of deformed layer on machined surface of germanium, the optimized cutting direction on each crystal plane is suggested according to the relevance of the nanometric cutting to the nanoindentation.

CPU-GPU mixed implementation of virtual node method for real-time interactive cutting of deformable objects using OpenCL.

PubMed

Jia, Shiyu; Zhang, Weizhong; Yu, Xiaokang; Pan, Zhenkuan

2015-09-01

Surgical simulators need to simulate interactive cutting of deformable objects in real time. The goal of this work was to design an interactive cutting algorithm that eliminates traditional cutting state classification and can work simultaneously with real-time GPU-accelerated deformation without affecting its numerical stability. A modified virtual node method for cutting is proposed. Deformable object is modeled as a real tetrahedral mesh embedded in a virtual tetrahedral mesh, and the former is used for graphics rendering and collision, while the latter is used for deformation. Cutting algorithm first subdivides real tetrahedrons to eliminate all face and edge intersections, then splits faces, edges and vertices along cutting tool trajectory to form cut surfaces. Next virtual tetrahedrons containing more than one connected real tetrahedral fragments are duplicated, and connectivity between virtual tetrahedrons is updated. Finally, embedding relationship between real and virtual tetrahedral meshes is updated. Co-rotational linear finite element method is used for deformation. Cutting and collision are processed by CPU, while deformation is carried out by GPU using OpenCL. Efficiency of GPU-accelerated deformation algorithm was tested using block models with varying numbers of tetrahedrons. Effectiveness of our cutting algorithm under multiple cuts and self-intersecting cuts was tested using a block model and a cylinder model. Cutting of a more complex liver model was performed, and detailed performance characteristics of cutting, deformation and collision were measured and analyzed. Our cutting algorithm can produce continuous cut surfaces when traditional minimal element creation algorithm fails. Our GPU-accelerated deformation algorithm remains stable with constant time step under multiple arbitrary cuts and works on both NVIDIA and AMD GPUs. GPU-CPU speed ratio can be as high as 10 for models with 80,000 tetrahedrons. Forty to sixty percent real-time performance and 100-200 Hz simulation rate are achieved for the liver model with 3,101 tetrahedrons. Major bottlenecks for simulation efficiency are cutting, collision processing and CPU-GPU data transfer. Future work needs to improve on these areas.

Finding minimum-quotient cuts in planar graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Park, J.K.; Phillips, C.A.

Given a graph G = (V, E) where each vertex v {element_of} V is assigned a weight w(v) and each edge e {element_of} E is assigned a cost c(e), the quotient of a cut partitioning the vertices of V into sets S and {bar S} is c(S, {bar S})/min{l_brace}w(S), w(S){r_brace}, where c(S, {bar S}) is the sum of the costs of the edges crossing the cut and w(S) and w({bar S}) are the sum of the weights of the vertices in S and {bar S}, respectively. The problem of finding a cut whose quotient is minimum for a graph hasmore » in recent years attracted considerable attention, due in large part to the work of Rao and Leighton and Rao. They have shown that an algorithm (exact or approximation) for the minimum-quotient-cut problem can be used to obtain an approximation algorithm for the more famous minimumb-balanced-cut problem, which requires finding a cut (S,{bar S}) minimizing c(S,{bar S}) subject to the constraint bW {le} w(S) {le} (1 {minus} b)W, where W is the total vertex weight and b is some fixed balance in the range 0 < b {le} {1/2}. Unfortunately, the minimum-quotient-cut problem is strongly NP-hard for general graphs, and the best polynomial-time approximation algorithm known for the general problem guarantees only a cut whose quotient is at mostO(lg n) times optimal, where n is the size of the graph. However, for planar graphs, the minimum-quotient-cut problem appears more tractable, as Rao has developed several efficient approximation algorithms for the planar version of the problem capable of finding a cut whose quotient is at most some constant times optimal. In this paper, we improve Rao`s algorithms, both in terms of accuracy and speed. As our first result, we present two pseudopolynomial-time exact algorithms for the planar minimum-quotient-cut problem. As Rao`s most accurate approximation algorithm for the problem -- also a pseudopolynomial-time algorithm -- guarantees only a 1.5-times-optimal cut, our algorithms represent a significant advance.« less

Finding minimum-quotient cuts in planar graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Park, J.K.; Phillips, C.A.

Given a graph G = (V, E) where each vertex v [element of] V is assigned a weight w(v) and each edge e [element of] E is assigned a cost c(e), the quotient of a cut partitioning the vertices of V into sets S and [bar S] is c(S, [bar S])/min[l brace]w(S), w(S)[r brace], where c(S, [bar S]) is the sum of the costs of the edges crossing the cut and w(S) and w([bar S]) are the sum of the weights of the vertices in S and [bar S], respectively. The problem of finding a cut whose quotient is minimummore » for a graph has in recent years attracted considerable attention, due in large part to the work of Rao and Leighton and Rao. They have shown that an algorithm (exact or approximation) for the minimum-quotient-cut problem can be used to obtain an approximation algorithm for the more famous minimumb-balanced-cut problem, which requires finding a cut (S,[bar S]) minimizing c(S,[bar S]) subject to the constraint bW [le] w(S) [le] (1 [minus] b)W, where W is the total vertex weight and b is some fixed balance in the range 0 < b [le] [1/2]. Unfortunately, the minimum-quotient-cut problem is strongly NP-hard for general graphs, and the best polynomial-time approximation algorithm known for the general problem guarantees only a cut whose quotient is at mostO(lg n) times optimal, where n is the size of the graph. However, for planar graphs, the minimum-quotient-cut problem appears more tractable, as Rao has developed several efficient approximation algorithms for the planar version of the problem capable of finding a cut whose quotient is at most some constant times optimal. In this paper, we improve Rao's algorithms, both in terms of accuracy and speed. As our first result, we present two pseudopolynomial-time exact algorithms for the planar minimum-quotient-cut problem. As Rao's most accurate approximation algorithm for the problem -- also a pseudopolynomial-time algorithm -- guarantees only a 1.5-times-optimal cut, our algorithms represent a significant advance.« less

Anticipatory effects on anterior cruciate ligament loading during sidestep cutting.

PubMed

Weinhandl, Joshua T; Earl-Boehm, Jennifer E; Ebersole, Kyle T; Huddleston, Wendy E; Armstrong, Brian S R; O'Connor, Kristian M

2013-07-01

A key to understanding potential anterior cruciate ligament injury mechanisms is to determine joint loading characteristics associated with an injury-causing event. However, direct measurement of anterior cruciate ligament loading during athletic tasks is invasive. Thus, previous research has been unable to study the association between neuromuscular variables and anterior cruciate ligament loading. Therefore, the purpose of this study was to determine the influence of movement anticipation on anterior cruciate ligament loading using a musculoskeletal modeling approach. Twenty healthy recreationally active females were recruited to perform anticipated and unanticipated sidestep cutting. Three-dimensional kinematics and kinetics of the right leg were calculated. Muscle, joint and anterior cruciate ligament forces were then estimated using a musculoskeletal model. Dependent t-tests were conducted to investigate differences between the two cutting conditions. ACL loading significantly increased during unanticipated sidestep cutting (p<0.05). This increase was primarily due to a significant increase in the sagittal plane ACL loading, which contributed 62% of the total loading. Frontal plane ACL loading contributed 26% and transverse plane ACL loading contributed 12%. These results suggest that anterior cruciate ligament loading resulted from a multifaceted interaction of the sagittal plane shear forces (i.e., quadriceps, hamstrings, and tibiofemoral), as well as the frontal and transverse plane knee moments. Additionally, the results of this study confirm the hypothesis in the current literature that unanticipated movements such as sidestep cutting increase anterior cruciate ligament loading. Copyright © 2013 Elsevier Ltd. All rights reserved.

Hairy Slices: Evaluating the Perceptual Effectiveness of Cutting Plane Glyphs for 3D Vector Fields.

PubMed

Stevens, Andrew H; Butkiewicz, Thomas; Ware, Colin

2017-01-01

Three-dimensional vector fields are common datasets throughout the sciences. Visualizing these fields is inherently difficult due to issues such as visual clutter and self-occlusion. Cutting planes are often used to overcome these issues by presenting more manageable slices of data. The existing literature provides many techniques for visualizing the flow through these cutting planes; however, there is a lack of empirical studies focused on the underlying perceptual cues that make popular techniques successful. This paper presents a quantitative human factors study that evaluates static monoscopic depth and orientation cues in the context of cutting plane glyph designs for exploring and analyzing 3D flow fields. The goal of the study was to ascertain the relative effectiveness of various techniques for portraying the direction of flow through a cutting plane at a given point, and to identify the visual cues and combinations of cues involved, and how they contribute to accurate performance. It was found that increasing the dimensionality of line-based glyphs into tubular structures enhances their ability to convey orientation through shading, and that increasing their diameter intensifies this effect. These tube-based glyphs were also less sensitive to visual clutter issues at higher densities. Adding shadows to lines was also found to increase perception of flow direction. Implications of the experimental results are discussed and extrapolated into a number of guidelines for designing more perceptually effective glyphs for 3D vector field visualizations.

Cross-Grain Knife Planing Improves Surface Quality and Utilization of Aspen

Treesearch

Harold A. Stewart

1971-01-01

Aspen at 6 percent moisture content was planed parallel to the grain and across the grain on a cabinet planer with a 25? rake angle, 1/16- and 1/32-inch depth of cut, and 20 knife marks per inch. Aspen was also cross-grain knife planed with a 45? rake angle, 1/32-, 1/16-, and 1/8-inch depths of cut, and 20, 10, 5, and 2.5 knife marks per inch. Cross-grain knife...

3D templating and patient-specific cutting guides (Knee-Plan) in total knee arthroplasty: postoperative CT-based assessment of implant positioning.

PubMed

Franceschi, J-P; Sbihi, A

2014-10-01

The precision of bone cuts and the positioning of components influence the functionality and longevity of total knee arthroplasty (TKA). The objective of this study was to evaluate the results of TKA, performed after 3D preoperative templating, with the prosthesis implanted using custom cutting guides (Knee-Plan system, Symbios Orthopédie SA). This prospective study investigated 107 TKAs. Three-dimensional preoperative templating was carried out on the surface views and CT views to analyze the deformation of the lower limb and plan the implantation. The components were positioned in an individualized manner to realign the lower limb and provide ligament balance based on bone landmarks. Final component positioning was analyzed in the three planes with a postoperative CT scan. The preoperative and 1 year follow-up IKS and WOMAC scores were collected and compared. All the cutting guides were stable and functional. Femoral component planning was reproduced with 0 ± 2 precision in the frontal plane (94%± 3), 2 ± 3 in the sagittal plane, and 0 ± 2 in the transverse plane. The precision of the tibial component was reproduced with 0 ± 2 precision in the frontal plane (93%± 3) and 0 ± 4 in the sagittal plane. The HKA angle increased from 177 ± 7 preoperatively to 180 ± 3 at 1 year of follow-up. The IKS and WOMAC scores were significantly improved at 1 year (P<0.0001). The Knee-Plan system can be a realistic, simple, and reliable alternative to conventional cutting guides and to computer-assisted surgery for TKA implantation. IV; prospective cohort study. Copyright © 2014. Published by Elsevier Masson SAS.

An Improved Hierarchical Genetic Algorithm for Sheet Cutting Scheduling with Process Constraints

PubMed Central

Rao, Yunqing; Qi, Dezhong; Li, Jinling

2013-01-01

For the first time, an improved hierarchical genetic algorithm for sheet cutting problem which involves n cutting patterns for m non-identical parallel machines with process constraints has been proposed in the integrated cutting stock model. The objective of the cutting scheduling problem is minimizing the weighted completed time. A mathematical model for this problem is presented, an improved hierarchical genetic algorithm (ant colony—hierarchical genetic algorithm) is developed for better solution, and a hierarchical coding method is used based on the characteristics of the problem. Furthermore, to speed up convergence rates and resolve local convergence issues, a kind of adaptive crossover probability and mutation probability is used in this algorithm. The computational result and comparison prove that the presented approach is quite effective for the considered problem. PMID:24489491

An improved hierarchical genetic algorithm for sheet cutting scheduling with process constraints.

PubMed

Rao, Yunqing; Qi, Dezhong; Li, Jinling

2013-01-01

For the first time, an improved hierarchical genetic algorithm for sheet cutting problem which involves n cutting patterns for m non-identical parallel machines with process constraints has been proposed in the integrated cutting stock model. The objective of the cutting scheduling problem is minimizing the weighted completed time. A mathematical model for this problem is presented, an improved hierarchical genetic algorithm (ant colony--hierarchical genetic algorithm) is developed for better solution, and a hierarchical coding method is used based on the characteristics of the problem. Furthermore, to speed up convergence rates and resolve local convergence issues, a kind of adaptive crossover probability and mutation probability is used in this algorithm. The computational result and comparison prove that the presented approach is quite effective for the considered problem.

The Autism Diagnostic Observation Schedule, Module 4: Application of the Revised Algorithms in an Independent, Well-Defined, Dutch Sample (n = 93).

PubMed

de Bildt, Annelies; Sytema, Sjoerd; Meffert, Harma; Bastiaansen, Jojanneke A C J

2016-01-01

This study examined the discriminative ability of the revised Autism Diagnostic Observation Schedule module 4 algorithm (Hus and Lord in J Autism Dev Disord 44(8):1996-2012, 2014) in 93 Dutch males with Autism Spectrum Disorder (ASD), schizophrenia, psychopathy or controls. Discriminative ability of the revised algorithm ASD cut-off resembled the original algorithm ASD cut-off: highly specific for psychopathy and controls, lower sensitivity than Hus and Lord (2014; i.e. ASD .61, AD .53). The revised algorithm AD cut-off improved sensitivity over the original algorithm. Discriminating ASD from schizophrenia was still challenging, but the better-balanced sensitivity (.53) and specificity (.78) of the revised algorithm AD cut-off may aide clinicians' differential diagnosis. Findings support using the revised algorithm, being conceptually conform the other modules, thus improving comparability across the lifespan.

An algorithm based on OmniView technology to reconstruct sagittal and coronal planes of the fetal brain from volume datasets acquired by three-dimensional ultrasound.

PubMed

Rizzo, G; Capponi, A; Pietrolucci, M E; Capece, A; Aiello, E; Mammarella, S; Arduini, D

2011-08-01

To describe a novel algorithm, based on the new display technology 'OmniView', developed to visualize diagnostic sagittal and coronal planes of the fetal brain from volumes obtained by three-dimensional (3D) ultrasonography. We developed an algorithm to image standard neurosonographic planes by drawing dissecting lines through the axial transventricular view of 3D volume datasets acquired transabdominally. The algorithm was tested on 106 normal fetuses at 18-24 weeks of gestation and the visualization rates of brain diagnostic planes were evaluated by two independent reviewers. The algorithm was also applied to nine cases with proven brain defects. The two reviewers, using the algorithm on normal fetuses, found satisfactory images with visualization rates ranging between 71.7% and 96.2% for sagittal planes and between 76.4% and 90.6% for coronal planes. The agreement rate between the two reviewers, as expressed by Cohen's kappa coefficient, was > 0.93 for sagittal planes and > 0.89 for coronal planes. All nine abnormal volumes were identified by a single observer from among a series including normal brains, and eight of these nine cases were diagnosed correctly. This novel algorithm can be used to visualize standard sagittal and coronal planes in the fetal brain. This approach may simplify the examination of the fetal brain and reduce dependency of success on operator skill. Copyright © 2011 ISUOG. Published by John Wiley & Sons, Ltd.

T-L Plane Abstraction-Based Energy-Efficient Real-Time Scheduling for Multi-Core Wireless Sensors.

PubMed

Kim, Youngmin; Lee, Ki-Seong; Pham, Ngoc-Son; Lee, Sun-Ro; Lee, Chan-Gun

2016-07-08

Energy efficiency is considered as a critical requirement for wireless sensor networks. As more wireless sensor nodes are equipped with multi-cores, there are emerging needs for energy-efficient real-time scheduling algorithms. The T-L plane-based scheme is known to be an optimal global scheduling technique for periodic real-time tasks on multi-cores. Unfortunately, there has been a scarcity of studies on extending T-L plane-based scheduling algorithms to exploit energy-saving techniques. In this paper, we propose a new T-L plane-based algorithm enabling energy-efficient real-time scheduling on multi-core sensor nodes with dynamic power management (DPM). Our approach addresses the overhead of processor mode transitions and reduces fragmentations of the idle time, which are inherent in T-L plane-based algorithms. Our experimental results show the effectiveness of the proposed algorithm compared to other energy-aware scheduling methods on T-L plane abstraction.

High pressure water jet mining machine

DOEpatents

Barker, Clark R.

1981-05-05

A high pressure water jet mining machine for the longwall mining of coal is described. The machine is generally in the shape of a plowshare and is advanced in the direction in which the coal is cut. The machine has mounted thereon a plurality of nozzle modules each containing a high pressure water jet nozzle disposed to oscillate in a particular plane. The nozzle modules are oriented to cut in vertical and horizontal planes on the leading edge of the machine and the coal so cut is cleaved off by the wedge-shaped body.

Effects of Varying Epoch Lengths, Wear Time Algorithms, and Activity Cut-Points on Estimates of Child Sedentary Behavior and Physical Activity from Accelerometer Data.

PubMed

Banda, Jorge A; Haydel, K Farish; Davila, Tania; Desai, Manisha; Bryson, Susan; Haskell, William L; Matheson, Donna; Robinson, Thomas N

2016-01-01

To examine the effects of accelerometer epoch lengths, wear time (WT) algorithms, and activity cut-points on estimates of WT, sedentary behavior (SB), and physical activity (PA). 268 7-11 year-olds with BMI ≥ 85th percentile for age and sex wore accelerometers on their right hips for 4-7 days. Data were processed and analyzed at epoch lengths of 1-, 5-, 10-, 15-, 30-, and 60-seconds. For each epoch length, WT minutes/day was determined using three common WT algorithms, and minutes/day and percent time spent in SB, light (LPA), moderate (MPA), and vigorous (VPA) PA were determined using five common activity cut-points. ANOVA tested differences in WT, SB, LPA, MPA, VPA, and MVPA when using the different epoch lengths, WT algorithms, and activity cut-points. WT minutes/day varied significantly by epoch length when using the NHANES WT algorithm (p < .0001), but did not vary significantly by epoch length when using the ≥ 20 minute consecutive zero or Choi WT algorithms. Minutes/day and percent time spent in SB, LPA, MPA, VPA, and MVPA varied significantly by epoch length for all sets of activity cut-points tested with all three WT algorithms (all p < .0001). Across all epoch lengths, minutes/day and percent time spent in SB, LPA, MPA, VPA, and MVPA also varied significantly across all sets of activity cut-points with all three WT algorithms (all p < .0001). The common practice of converting WT algorithms and activity cut-point definitions to match different epoch lengths may introduce significant errors. Estimates of SB and PA from studies that process and analyze data using different epoch lengths, WT algorithms, and/or activity cut-points are not comparable, potentially leading to very different results, interpretations, and conclusions, misleading research and public policy.

Method for 3D noncontact measurements of cut trees package area

NASA Astrophysics Data System (ADS)

Knyaz, Vladimir A.; Vizilter, Yuri V.

2001-02-01

Progress in imaging sensors and computers create the background for numerous 3D imaging application for wide variety of manufacturing activity. Many demands for automated precise measurements are in wood branch of industry. One of them is the accurate volume definition for cut trees carried on the truck. The key point for volume estimation is determination of the front area of the cut tree package. To eliminate slow and inaccurate manual measurements being now in practice the experimental system for automated non-contact wood measurements is developed. The system includes two non-metric CCD video cameras, PC as central processing unit, frame grabbers and original software for image processing and 3D measurements. The proposed method of measurement is based on capturing the stereo pair of front of trees package and performing the image orthotranformation into the front plane. This technique allows to process transformed image for circle shapes recognition and calculating their area. The metric characteristics of the system are provided by special camera calibration procedure. The paper presents the developed method of 3D measurements, describes the hardware used for image acquisition and the software realized the developed algorithms, gives the productivity and precision characteristics of the system.

Efficient algorithm for locating and sizing series compensation devices in large power transmission grids: II. Solutions and applications

DOE PAGES

Frolov, Vladimir; Backhaus, Scott; Chertkov, Misha

2014-10-01

In a companion manuscript, we developed a novel optimization method for placement, sizing, and operation of Flexible Alternating Current Transmission System (FACTS) devices to relieve transmission network congestion. Specifically, we addressed FACTS that provide Series Compensation (SC) via modification of line inductance. In this manuscript, this heuristic algorithm and its solutions are explored on a number of test cases: a 30-bus test network and a realistically-sized model of the Polish grid (~ 2700 nodes and ~ 3300 lines). The results on the 30-bus network are used to study the general properties of the solutions including non-locality and sparsity. The Polishmore » grid is used as a demonstration of the computational efficiency of the heuristics that leverages sequential linearization of power flow constraints and cutting plane methods that take advantage of the sparse nature of the SC placement solutions. Using these approaches, the algorithm is able to solve an instance of Polish grid in tens of seconds. We explore the utility of the algorithm by analyzing transmission networks congested by (a) uniform load growth, (b) multiple overloaded configurations, and (c) sequential generator retirements.« less

Efficient Algorithm for Locating and Sizing Series Compensation Devices in Large Transmission Grids: Solutions and Applications (PART II)

DOE Office of Scientific and Technical Information (OSTI.GOV)

Frolov, Vladimir; Backhaus, Scott N.; Chertkov, Michael

2014-01-14

In a companion manuscript, we developed a novel optimization method for placement, sizing, and operation of Flexible Alternating Current Transmission System (FACTS) devices to relieve transmission network congestion. Specifically, we addressed FACTS that provide Series Compensation (SC) via modification of line inductance. In this manuscript, this heuristic algorithm and its solutions are explored on a number of test cases: a 30-bus test network and a realistically-sized model of the Polish grid (~2700 nodes and ~3300 lines). The results on the 30-bus network are used to study the general properties of the solutions including non-locality and sparsity. The Polish grid ismore » used as a demonstration of the computational efficiency of the heuristics that leverages sequential linearization of power flow constraints and cutting plane methods that take advantage of the sparse nature of the SC placement solutions. Using these approaches, the algorithm is able to solve an instance of Polish grid in tens of seconds. We explore the utility of the algorithm by analyzing transmission networks congested by (a) uniform load growth, (b) multiple overloaded configurations, and (c) sequential generator retirements« less

Apparatus for cutting elastomeric materials

NASA Technical Reports Server (NTRS)

Corbett, A. B.

1974-01-01

Sharp thin cutting edge is held in head of milling machine designed for metal working. Controls of machine are used to position cutting edge in same plane as vibrating specimen. Controls then are operated, making blade come into contact with specimen, to cut it into shapes and sizes desired. Cut surfaces appear mirror-smooth; vibrating mechanism causes no visible striations.

Displaying CFD Solution Parameters on Arbitrary Cut Planes

NASA Technical Reports Server (NTRS)

Pao, S. Paul

2008-01-01

USMC6 is a Fortran 90 computer program for post-processing in support of visualization of flows simulated by computational fluid dynamics (CFD). The name "USMC6" is partly an abbreviation of "TetrUSS - USM3D Solution Cutter," reflecting its origin as a post-processor for use with USM3D - a CFD program that is a component of the Tetrahedral Unstructured Software System and that solves the Navier-Stokes equations on tetrahedral unstructured grids. "Cutter" here refers to a capability to acquire and process solution data on (1) arbitrary planes that cut through grid volumes, or (2) user-selected spheroidal, conical, cylindrical, and/or prismatic domains cut from within grids. Cutting saves time by enabling concentration of post-processing and visualization efforts on smaller solution domains of interest. The user can select from among more than 40 flow functions. The cut planes can be trimmed to circular or rectangular shape. The user specifies cuts and functions in a free-format input file using simple and easy-to-remember keywords. The USMC6 command line is simple enough that the slicing process can readily be embedded in a shell script for assembly-line post-processing. The output of USMC6 is a data file ready for plotting.

Deformation-based augmented reality for hepatic surgery.

PubMed

Haouchine, Nazim; Dequidt, Jérémie; Berger, Marie-Odile; Cotin, Stéphane

2013-01-01

In this paper we introduce a method for augmenting the laparoscopic view during hepatic tumor resection. Using augmented reality techniques, vessels, tumors and cutting planes computed from pre-operative data can be overlaid onto the laparoscopic video. Compared to current techniques, which are limited to a rigid registration of the pre-operative liver anatomy with the intra-operative image, we propose a real-time, physics-based, non-rigid registration. The main strength of our approach is that the deformable model can also be used to regularize the data extracted from the computer vision algorithms. We show preliminary results on a video sequence which clearly highlights the interest of using physics-based model for elastic registration.

T-L Plane Abstraction-Based Energy-Efficient Real-Time Scheduling for Multi-Core Wireless Sensors

PubMed Central

Kim, Youngmin; Lee, Ki-Seong; Pham, Ngoc-Son; Lee, Sun-Ro; Lee, Chan-Gun

2016-01-01

Energy efficiency is considered as a critical requirement for wireless sensor networks. As more wireless sensor nodes are equipped with multi-cores, there are emerging needs for energy-efficient real-time scheduling algorithms. The T-L plane-based scheme is known to be an optimal global scheduling technique for periodic real-time tasks on multi-cores. Unfortunately, there has been a scarcity of studies on extending T-L plane-based scheduling algorithms to exploit energy-saving techniques. In this paper, we propose a new T-L plane-based algorithm enabling energy-efficient real-time scheduling on multi-core sensor nodes with dynamic power management (DPM). Our approach addresses the overhead of processor mode transitions and reduces fragmentations of the idle time, which are inherent in T-L plane-based algorithms. Our experimental results show the effectiveness of the proposed algorithm compared to other energy-aware scheduling methods on T-L plane abstraction. PMID:27399722

6. VIEW WEST, PERSPECTIVE UP INCLINED PLANE FROM MIDSLOPE VICINITY, ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

6. VIEW WEST, PERSPECTIVE UP INCLINED PLANE FROM MID-SLOPE VICINITY, CUT CONFIGURATION - Laurel Hill Quarry, Incline Plane, Both sides of State Route 56, 2.4 miles East of State Route 711, Seward, Westmoreland County, PA

[Improvement of magnetic resonance phase unwrapping method based on Goldstein Branch-cut algorithm].

PubMed

Guo, Lin; Kang, Lili; Wang, Dandan

2013-02-01

The phase information of magnetic resonance (MR) phase image can be used in many MR imaging techniques, but phase wrapping of the images often results in inaccurate phase information and phase unwrapping is essential for MR imaging techniques. In this paper we analyze the causes of errors in phase unwrapping with the commonly used Goldstein Brunch-cut algorithm and propose an improved algorithm. During the unwrapping process, masking, filtering, dipole- remover preprocessor, and the Prim algorithm of the minimum spanning tree were introduced to optimize the residues essential for the Goldstein Brunch-cut algorithm. Experimental results showed that the residues, branch-cuts and continuous unwrapped phase surface were efficiently reduced and the quality of MR phase images was obviously improved with the proposed method.

Neodymium:YAG laser cutting of intraocular lens haptics.

PubMed

Gorn, R A; Steinert, R F

1985-11-01

Neodymium:YAG laser cutting of polymethylmethacrylate and polypropylene anterior chamber and posterior chamber intraocular lens haptics was studied in terms of ease of transection and physical structure of the cut areas as seen by scanning electron microscopy. A marked difference was discovered, with the polymethylmethacrylate cutting easily along transverse planes, whereas the polypropylene resisted cutting along longitudinal fibers. Clinical guidelines are presented.

A lateral guidance algorithm to reduce the post-aerobraking burn requirements for a lift-modulated orbital transfer vehicle. M.S. Thesis

NASA Technical Reports Server (NTRS)

Herman, G. C.

1986-01-01

A lateral guidance algorithm which controls the location of the line of intersection between the actual and desired orbital planes (the hinge line) is developed for the aerobraking phase of a lift-modulated orbital transfer vehicle. The on-board targeting algorithm associated with this lateral guidance algorithm is simple and concise which is very desirable since computation time and space are limited on an on-board flight computer. A variational equation which describes the movement of the hinge line is derived. Simple relationships between the plane error, the desired hinge line position, the position out-of-plane error, and the velocity out-of-plane error are found. A computer simulation is developed to test the lateral guidance algorithm for a variety of operating conditions. The algorithm does reduce the total burn magnitude needed to achieve the desired orbit by allowing the plane correction and perigee-raising burn to be combined in a single maneuver. The algorithm performs well under vacuum perigee dispersions, pot-hole density disturbance, and thick atmospheres. The results for many different operating conditions are presented.

Greater Hip Extension but Not Hip Abduction Explosive Strength Is Associated With Lesser Hip Adduction and Knee Valgus Motion During a Single-Leg Jump-Cut

PubMed Central

Cronin, Baker; Johnson, Samuel T.; Chang, Eunwook; Pollard, Christine D.; Norcross, Marc F.

2016-01-01

Background: The relationships between hip abductor and extensor strength and frontal plane hip and knee motions that are associated with anterior cruciate ligament injury risk are equivocal. However, previous research on these relationships has evaluated relatively low-level movement tasks and peak torque rather than a time-critical strength measure such as the rate of torque development (RTD). Hypothesis: Females with greater hip abduction and extension RTD would exhibit lesser frontal plane hip and knee motion during a single-leg jump-cutting task. Study Design: Descriptive laboratory study. Methods: Forty recreationally active females performed maximal isometric contractions and single-leg jump-cuts. From recorded torque data, hip extension and abduction RTD was calculated from torque onset to 200 ms after onset. Three-dimensional motion analysis was used to quantify frontal plane hip and knee kinematics during the movement task. For each RTD measure, jump-cut biomechanics were compared between participants in the highest (high) and lowest (low) RTD tertiles. Results: No differences in frontal plane hip and knee kinematics were identified between high and low hip abduction RTD groups. However, those in the high hip extension RTD group exhibited lower hip adduction (high, 3.8° ± 3.0°; low, 6.5° ± 3.0°; P = .019) and knee valgus (high, –2.5° ± 2.3°; low, –4.4° ± 3.2°; P = .046) displacements during the jump-cut. Conclusion: In movements such as cutting that are performed with the hip in a relatively abducted and flexed position, the ability of the gluteus medius to control hip adduction may be compromised. However, the gluteus maximus, functioning as a hip abductor, may take on a pivotal role in controlling hip adduction and knee valgus motion during these types of tasks. Clinical Relevance: Training with a specific emphasis on increasing explosive strength of the hip extensors may be a means through which to improve frontal plane hip and knee control during high-risk maneuvers such as cutting. PMID:27104207

Wind velocity profile reconstruction from intensity fluctuations of a plane wave propagating in a turbulent atmosphere.

PubMed

Banakh, V A; Marakasov, D A

2007-08-01

Reconstruction of a wind profile based on the statistics of plane-wave intensity fluctuations in a turbulent atmosphere is considered. The algorithm for wind profile retrieval from the spatiotemporal spectrum of plane-wave weak intensity fluctuations is described, and the results of end-to-end computer experiments on wind profiling based on the developed algorithm are presented. It is shown that the reconstructing algorithm allows retrieval of a wind profile from turbulent plane-wave intensity fluctuations with acceptable accuracy.

Digital Filtering of Three-Dimensional Lower Extremity Kinematics: an Assessment

PubMed Central

Sinclair, Jonathan; Taylor, Paul John; Hobbs, Sarah Jane

2013-01-01

Errors in kinematic data are referred to as noise and are an undesirable portion of any waveform. Noise is typically removed using a low-pass filter which removes the high frequency components of the signal. The selection of an optimal frequency cut-off is very important when processing kinematic information and a number of techniques exists for the determination of an optimal frequency cut-off. Despite the importance of cut-off frequency to the efficacy of kinematic analyses there is currently a paucity of research examining the influence of different cut-off frequencies on the resultant 3-D kinematic waveforms and discrete parameters. Twenty participants ran at 4.0 m•s−1 as lower extremity kinematics in the sagittal, coronal and transverse planes were measured using an eight camera motion analysis system. The data were filtered at a range of cut-off frequencies and the discrete kinematic parameters were examined using repeated measures ANOVA’s. The similarity between the raw and filtered waveforms were examined using intra-class correlations. The results show that the cut-off frequency has a significant influence on the discrete kinematic measure across displacement and derivative information in all three planes of rotation. Furthermore, it was also revealed that as the cut-off frequency decreased the attenuation of the kinematic waveforms became more pronounced, particularly in the coronal and transverse planes at the second derivative. In conclusion, this investigation provides new information regarding the influence of digital filtering on lower extremity kinematics and re-emphasizes the importance of selecting the correct cut-off frequency. PMID:24511338

Determining the phase and amplitude distortion of a wavefront using a plenoptic sensor.

PubMed

Wu, Chensheng; Ko, Jonathan; Davis, Christopher C

2015-05-01

We have designed a plenoptic sensor to retrieve phase and amplitude changes resulting from a laser beam's propagation through atmospheric turbulence. Compared with the commonly restricted domain of (-π,π) in phase reconstruction by interferometers, the reconstructed phase obtained by the plenoptic sensors can be continuous up to a multiple of 2π. When compared with conventional Shack-Hartmann sensors, ambiguities caused by interference or low intensity, such as branch points and branch cuts, are less likely to happen and can be adaptively avoided by our reconstruction algorithm. In the design of our plenoptic sensor, we modified the fundamental structure of a light field camera into a mini Keplerian telescope array by accurately cascading the back focal plane of its object lens with a microlens array's front focal plane and matching the numerical aperture of both components. Unlike light field cameras designed for incoherent imaging purposes, our plenoptic sensor operates on the complex amplitude of the incident beam and distributes it into a matrix of images that are simpler and less subject to interference than a global image of the beam. Then, with the proposed reconstruction algorithms, the plenoptic sensor is able to reconstruct the wavefront and a phase screen at an appropriate depth in the field that causes the equivalent distortion on the beam. The reconstructed results can be used to guide adaptive optics systems in directing beam propagation through atmospheric turbulence. In this paper, we will show the theoretical analysis and experimental results obtained with the plenoptic sensor and its reconstruction algorithms.

Determining the phase and amplitude distortion of a wavefront using a plenoptic sensor

NASA Astrophysics Data System (ADS)

Wu, Chensheng; Ko, Jonathan; Davis, Christopher C.

2015-05-01

We have designed a plenoptic sensor to retrieve phase and amplitude changes resulting from a laser beam's propagation through atmospheric turbulence. Compared with the commonly restricted domain of (-pi, pi) in phase reconstruction by interferometers, the reconstructed phase obtained by the plenoptic sensors can be continuous up to a multiple of 2pi. When compared with conventional Shack-Hartmann sensors, ambiguities caused by interference or low intensity, such as branch points and branch cuts, are less likely to happen and can be adaptively avoided by our reconstruction algorithm. In the design of our plenoptic sensor, we modified the fundamental structure of a light field camera into a mini Keplerian telescope array by accurately cascading the back focal plane of its object lens with a microlens array's front focal plane and matching the numerical aperture of both components. Unlike light field cameras designed for incoherent imaging purposes, our plenoptic sensor operates on the complex amplitude of the incident beam and distributes it into a matrix of images that are simpler and less subject to interference than a global image of the beam. Then, with the proposed reconstruction algorithms, the plenoptic sensor is able to reconstruct the wavefront and a phase screen at an appropriate depth in the field that causes the equivalent distortion on the beam. The reconstructed results can be used to guide adaptive optics systems in directing beam propagation through atmospheric turbulence. In this paper we will show the theoretical analysis and experimental results obtained with the plenoptic sensor and its reconstruction algorithms.

FAST (Four chamber view And Swing Technique) Echo: a Novel and Simple Algorithm to Visualize Standard Fetal Echocardiographic Planes

PubMed Central

Yeo, Lami; Romero, Roberto; Jodicke, Cristiano; Oggè, Giovanna; Lee, Wesley; Kusanovic, Juan Pedro; Vaisbuch, Edi; Hassan, Sonia S.

2010-01-01

Objective To describe a novel and simple algorithm (FAST Echo: Four chamber view And Swing Technique) to visualize standard diagnostic planes of fetal echocardiography from dataset volumes obtained with spatiotemporal image correlation (STIC) and applying a new display technology (OmniView). Methods We developed an algorithm to image standard fetal echocardiographic planes by drawing four dissecting lines through the longitudinal view of the ductal arch contained in a STIC volume dataset. Three of the lines are locked to provide simultaneous visualization of targeted planes, and the fourth line (unlocked) “swings” through the ductal arch image (“swing technique”), providing an infinite number of cardiac planes in sequence. Each line generated the following plane(s): 1) Line 1: three-vessels and trachea view; 2) Line 2: five-chamber view and long axis view of the aorta (obtained by rotation of the five-chamber view on the y-axis); 3) Line 3: four-chamber view; and 4) “Swing” line: three-vessels and trachea view, five-chamber view and/or long axis view of the aorta, four-chamber view, and stomach. The algorithm was then tested in 50 normal hearts (15.3 – 40 weeks of gestation) and visualization rates for cardiac diagnostic planes were calculated. To determine if the algorithm could identify planes that departed from the normal images, we tested the algorithm in 5 cases with proven congenital heart defects. Results In normal cases, the FAST Echo algorithm (3 locked lines and rotation of the five-chamber view on the y-axis) was able to generate the intended planes (longitudinal view of the ductal arch, pulmonary artery, three-vessels and trachea view, five-chamber view, long axis view of the aorta, four-chamber view): 1) individually in 100% of cases [except for the three-vessel and trachea view, which was seen in 98% (49/50)]; and 2) simultaneously in 98% (49/50). The “swing technique” was able to generate the three-vessels and trachea view, five-chamber view and/or long axis view of the aorta, four-chamber view, and stomach in 100% of normal cases. In the abnormal cases, the FAST Echo algorithm demonstrated the cardiac defects and displayed views that deviated from what was expected from the examination of normal hearts. The “swing technique” was useful in demonstrating the specific diagnosis due to visualization of an infinite number of cardiac planes in sequence. Conclusions This novel and simple algorithm can be used to visualize standard fetal echocardiographic planes in normal fetal hearts. The FAST Echo algorithm may simplify examination of the fetal heart and could reduce operator dependency. Using this algorithm, the inability to obtain expected views or the appearance of abnormal views in the generated planes should raise the index of suspicion for congenital heart disease. PMID:20878671

Four-chamber view and 'swing technique' (FAST) echo: a novel and simple algorithm to visualize standard fetal echocardiographic planes.

PubMed

Yeo, L; Romero, R; Jodicke, C; Oggè, G; Lee, W; Kusanovic, J P; Vaisbuch, E; Hassan, S

2011-04-01

To describe a novel and simple algorithm (four-chamber view and 'swing technique' (FAST) echo) for visualization of standard diagnostic planes of fetal echocardiography from dataset volumes obtained with spatiotemporal image correlation (STIC) and applying a new display technology (OmniView). We developed an algorithm to image standard fetal echocardiographic planes by drawing four dissecting lines through the longitudinal view of the ductal arch contained in a STIC volume dataset. Three of the lines are locked to provide simultaneous visualization of targeted planes, and the fourth line (unlocked) 'swings' through the ductal arch image (swing technique), providing an infinite number of cardiac planes in sequence. Each line generates the following plane(s): (a) Line 1: three-vessels and trachea view; (b) Line 2: five-chamber view and long-axis view of the aorta (obtained by rotation of the five-chamber view on the y-axis); (c) Line 3: four-chamber view; and (d) 'swing line': three-vessels and trachea view, five-chamber view and/or long-axis view of the aorta, four-chamber view and stomach. The algorithm was then tested in 50 normal hearts in fetuses at 15.3-40 weeks' gestation and visualization rates for cardiac diagnostic planes were calculated. To determine whether the algorithm could identify planes that departed from the normal images, we tested the algorithm in five cases with proven congenital heart defects. In normal cases, the FAST echo algorithm (three locked lines and rotation of the five-chamber view on the y-axis) was able to generate the intended planes (longitudinal view of the ductal arch, pulmonary artery, three-vessels and trachea view, five-chamber view, long-axis view of the aorta, four-chamber view) individually in 100% of cases (except for the three-vessels and trachea view, which was seen in 98% (49/50)) and simultaneously in 98% (49/50). The swing technique was able to generate the three-vessels and trachea view, five-chamber view and/or long-axis view of the aorta, four-chamber view and stomach in 100% of normal cases. In the abnormal cases, the FAST echo algorithm demonstrated the cardiac defects and displayed views that deviated from what was expected from the examination of normal hearts. The swing technique was useful for demonstrating the specific diagnosis due to visualization of an infinite number of cardiac planes in sequence. This novel and simple algorithm can be used to visualize standard fetal echocardiographic planes in normal fetal hearts. The FAST echo algorithm may simplify examination of the fetal heart and could reduce operator dependency. Using this algorithm, inability to obtain expected views or the appearance of abnormal views in the generated planes should raise the index of suspicion for congenital heart disease. Copyright © 2011 ISUOG. Published by John Wiley & Sons, Ltd.

Optimization of view weighting in tilted-plane-based reconstruction algorithms to minimize helical artifacts in multi-slice helical CT

NASA Astrophysics Data System (ADS)

Tang, Xiangyang

2003-05-01

In multi-slice helical CT, the single-tilted-plane-based reconstruction algorithm has been proposed to combat helical and cone beam artifacts by tilting a reconstruction plane to fit a helical source trajectory optimally. Furthermore, to improve the noise characteristics or dose efficiency of the single-tilted-plane-based reconstruction algorithm, the multi-tilted-plane-based reconstruction algorithm has been proposed, in which the reconstruction plane deviates from the pose globally optimized due to an extra rotation along the 3rd axis. As a result, the capability of suppressing helical and cone beam artifacts in the multi-tilted-plane-based reconstruction algorithm is compromised. An optomized tilted-plane-based reconstruction algorithm is proposed in this paper, in which a matched view weighting strategy is proposed to optimize the capability of suppressing helical and cone beam artifacts and noise characteristics. A helical body phantom is employed to quantitatively evaluate the imaging performance of the matched view weighting approach by tabulating artifact index and noise characteristics, showing that the matched view weighting improves both the helical artifact suppression and noise characteristics or dose efficiency significantly in comparison to the case in which non-matched view weighting is applied. Finally, it is believed that the matched view weighting approach is of practical importance in the development of multi-slive helical CT, because it maintains the computational structure of fan beam filtered backprojection and demands no extra computational services.

7. VIEW WEST, PERSPECTIVE VIEW OF TOP OF INCLINED PLANE ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

7. VIEW WEST, PERSPECTIVE VIEW OF TOP OF INCLINED PLANE AND EAST FACE OF CUT STONE TOWER - Laurel Hill Quarry, Incline Plane, Both sides of State Route 56, 2.4 miles East of State Route 711, Seward, Westmoreland County, PA

An FMS Dynamic Production Scheduling Algorithm Considering Cutting Tool Failure and Cutting Tool Life

NASA Astrophysics Data System (ADS)

Setiawan, A.; Wangsaputra, R.; Martawirya, Y. Y.; Halim, A. H.

2016-02-01

This paper deals with Flexible Manufacturing System (FMS) production rescheduling due to unavailability of cutting tools caused either of cutting tool failure or life time limit. The FMS consists of parallel identical machines integrated with an automatic material handling system and it runs fully automatically. Each machine has a same cutting tool configuration that consists of different geometrical cutting tool types on each tool magazine. The job usually takes two stages. Each stage has sequential operations allocated to machines considering the cutting tool life. In the real situation, the cutting tool can fail before the cutting tool life is reached. The objective in this paper is to develop a dynamic scheduling algorithm when a cutting tool is broken during unmanned and a rescheduling needed. The algorithm consists of four steps. The first step is generating initial schedule, the second step is determination the cutting tool failure time, the third step is determination of system status at cutting tool failure time and the fourth step is the rescheduling for unfinished jobs. The approaches to solve the problem are complete-reactive scheduling and robust-proactive scheduling. The new schedules result differences starting time and completion time of each operations from the initial schedule.

Cutting holes in fabric-faced panels

NASA Technical Reports Server (NTRS)

Peterson, S. A.

1981-01-01

Tool has 2 carbide inserts that bore clean holes through fibrous material with knifelike slicing action. Cutting edge of insert is curved, with plane inner surface at 30 degree angle to tool axis. Drill press or hand-held drill can be used to hold cutting tool.

An Interactive Artificial Cutting Plane Method for Bicriterion Integer Programming Problems

DTIC Science & Technology

1992-08-01

AUTHOR(S) Diane Breivik Allen, 1st Lt 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) 8. PERFORMING ORGANIZATION REPORT NUMBER AFIT Student Attending...INTERACTIVE ARTIFICIAL CUTTING PLANE METHOD FOR BICRITERION INTEGER PROGRAMMING PROBLEMS By Diane Breivik Allen A Thesis Submitted to the Faculty of...ITfiSRA&1 DTIC TAB 0 Unannounced 0 Justirication By BY Diane Breivik Allen Distributlon/ Availability CQdes Avail and/or Dist Special Approved: DTI

Effect of Planning on Trunk Motion and Knee Moments During a Side Step Cut Task

NASA Astrophysics Data System (ADS)

Houck, Jeff; Gorniak, Stacey; Nicholson, Kristen

2004-03-01

Recent studies suggest that alterations in knee biomechanics associated with unanticipated cutting tasks place athletes at higher risk of knee injuries. Besier et al observed alterations in knee moments during unanticipated cutting tasks that were consistent with in-vitro ACL injury mechanisms. During similar tasks, Patla et al observed lateral trunk lean and decreased foot placement, suggesting that full body center of mass control is perturbed during such tasks. The purpose of this study was to compare the trunk and knee frontal plane moments and evaluate a relationship between the two during unanticipated cutting tasks. The results of this study suggest that there is a relationship between the trunk and knee frontal plane moments during the first 200-400ms of the stance phase of gait.

Language study on Spliced Semigraph using Folding techniques

NASA Astrophysics Data System (ADS)

Thiagarajan, K.; Padmashree, J.

2018-04-01

In this paper, we proposed algorithm to identify cut vertices and cut edges for n-Cut Spliced Semigraph and splicing the n-Cut Spliced Semigraph using cut vertices else cut edges or combination of cut vertex and cut edge and applying sequence of folding to the spliced semigraph to obtain the semigraph quadruple η(S)=(2, 1, 1, 1). We observed that the splicing and folding using both cut vertices and cut edges is applicable only for n-Cut Spliced Semigraph where n > 2. Also, we transformed the spliced semigraph into tree structure and studied the language for the semigraph with n+2 vertices and n+1 semivertices using Depth First Edge Sequence algorithm and obtain the language structure with sequence of alphabet ‘a’ and ‘b’.

Enhancement of low power CO2 laser cutting process for injection molded polycarbonate

NASA Astrophysics Data System (ADS)

Moradi, Mahmoud; Mehrabi, Omid; Azdast, Taher; Benyounis, Khaled Y.

2017-11-01

Laser cutting technology is a non-contact process that typically is used for industrial manufacturing applications. Laser cut quality is strongly influenced by the cutting processing parameters. In this research, CO2 laser cutting specifications have been investigated by using design of experiments (DOE) with considering laser cutting speed, laser power and focal plane position as process input parameters and kerf geometry dimensions (i.e. top and bottom kerf width, ratio of the upper kerf to lower kerf, upper heat affected zone (HAZ)) and surface roughness of the kerf wall as process output responses. A 60 Watts CO2 laser cutting machine is used for cutting the injection molded samples of polycarbonate sheet with the thickness of 3.2 mm. Results reveal that by decreasing the laser focal plane position and laser power, the bottom kerf width will be decreased. Also the bottom kerf width decreases by increasing the cutting speed. As a general result, locating the laser spot point in the depth of the workpiece the laser cutting quality increases. Minimum value of the responses (top kerf, heat affected zone, ratio of the upper kerf to lower kerf, and surface roughness) are considered as optimization criteria. Validating the theoretical results using the experimental tests is carried out in order to analyze the results obtained via software.

An Integrated Method Based on PSO and EDA for the Max-Cut Problem.

PubMed

Lin, Geng; Guan, Jian

2016-01-01

The max-cut problem is NP-hard combinatorial optimization problem with many real world applications. In this paper, we propose an integrated method based on particle swarm optimization and estimation of distribution algorithm (PSO-EDA) for solving the max-cut problem. The integrated algorithm overcomes the shortcomings of particle swarm optimization and estimation of distribution algorithm. To enhance the performance of the PSO-EDA, a fast local search procedure is applied. In addition, a path relinking procedure is developed to intensify the search. To evaluate the performance of PSO-EDA, extensive experiments were carried out on two sets of benchmark instances with 800 to 20,000 vertices from the literature. Computational results and comparisons show that PSO-EDA significantly outperforms the existing PSO-based and EDA-based algorithms for the max-cut problem. Compared with other best performing algorithms, PSO-EDA is able to find very competitive results in terms of solution quality.

Simple Common Plane contact detection algorithm for FE/FD methods

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vorobiev, O

2006-07-19

Common-plane (CP) algorithm is widely used in Discrete Element Method (DEM) to model contact forces between interacting particles or blocks. A new simple contact detection algorithm is proposed to model contacts in FE/FD methods which is similar to the CP algorithm. The CP is defined as a plane separating interacting faces of FE/FD mesh instead of blocks or particles in the original CP method. The method does not require iterations. It is very robust and easy to implement both in 2D and 3D case.

Coherent field propagation between tilted planes.

PubMed

Stock, Johannes; Worku, Norman Girma; Gross, Herbert

2017-10-01

Propagating electromagnetic light fields between nonparallel planes is of special importance, e.g., within the design of novel computer-generated holograms or the simulation of optical systems. In contrast to the extensively discussed evaluation between parallel planes, the diffraction-based propagation of light onto a tilted plane is more burdensome, since discrete fast Fourier transforms cannot be applied directly. In this work, we propose a quasi-fast algorithm (O(N 3  log N)) that deals with this problem. Based on a proper decomposition into three rotations, the vectorial field distribution is calculated on a tilted plane using the spectrum of plane waves. The algorithm works on equidistant grids, so neither nonuniform Fourier transforms nor an explicit complex interpolation is necessary. The proposed algorithm is discussed in detail and applied to several examples of practical interest.

A Comparison of Numerical and Analytical Radiative-Transfer Solutions for Plane Albedo of Natural Waters

EPA Science Inventory

Three numerical algorithms were compared to provide a solution of a radiative transfer equation (RTE) for plane albedo (hemispherical reflectance) in semi-infinite one-dimensional plane-parallel layer. Algorithms were based on the invariant imbedding method and two different var...

Effect of the Leveling Conditions on Residual Stress Evolution of Hot Rolled High Strength Steels for Cold Forming

NASA Astrophysics Data System (ADS)

Park, Keecheol; Oh, Kyungsuk

2017-09-01

In order to investigate the effect of leveling conditions on residual stress evolution during the leveling process of hot rolled high strength steels, the in-plane residual stresses of sheet processed under controlled conditions at skin-pass mill and levelers were measured by cutting method. The residual stress was localized near the edge of sheet. As the thickness of sheet was increased, the residual stress occurred region was expanded. The magnitude of residual stress within the sheet was reduced as increasing the deformation occurred during the leveling process. But the residual stress itself was not removed completely. The magnitude of camber occurred at cut plate was able to be predicted by the residual stress distribution. A numerical algorithm was developed for analysing the effect of leveling conditions on residual stress. It was able to implement the effect of plastic deformation in leveling, tension, work roll bending, and initial state of sheet (residual stress and curl distribution). The validity of simulated results was verified from comparison with the experimentally measured residual stress and curl in a sheet.

Gender Differences among Sagittal Plane Knee Kinematic and Ground Reaction Force Characteristics during a Rapid Sprint and Cut Maneuver

ERIC Educational Resources Information Center

James, C. Roger; Sizer, Phillip S.; Starch, David W.; Lockhart, Thurmon E.; Slauterbeck, James

2004-01-01

Women are more prone to anterior cruciate ligament (ACL) injury during cutting sports than men. The purpose of this study was to examine knee kinematic and ground reaction forces (GRF) differences between genders during cutting. Male and female athletes performed cutting trials while force platform and video data were recorded (180 Hz).…

Simple Common Plane contact algorithm for explicit FE/FD methods

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vorobiev, O

2006-12-18

Common-plane (CP) algorithm is widely used in Discrete Element Method (DEM) to model contact forces between interacting particles or blocks. A new simple contact algorithm is proposed to model contacts in FE/FD methods which is similar to the CP algorithm. The CP is defined as a plane separating interacting faces of FE/FD mesh instead of blocks or particles used in the original CP method. The new method does not require iterations even for very stiff contacts. It is very robust and easy to implement both in 2D and 3D parallel codes.

Dynamic knee joint mechanics after anterior cruciate ligament reconstruction.

PubMed

Clarke, Sarah B; Kenny, Ian C; Harrison, Andrew J

2015-01-01

There is scarcity of information on the long-term adaptations in lower limb biomechanics during game-specific movements after anterior cruciate ligament (ACL) reconstruction. Particularly, variables such as knee abduction moments and transverse plane knee motion have not been studied during a game-specific landing and cutting task after ACL reconstruction. The purpose of this study was to compare the hip and knee mechanics between the ACL-reconstructed (ACLr) group and a healthy control group. Thirty-eight reconstructed athletes (18 ACLr, 18 control) participated in the study. Three-dimensional hip, knee, and ankle angles were calculated during a maximal drop jump land from a 0.30-m box and unanticipated cutting task at 45°. During the landing phase, ACLr participants had increased hip flexion (P < 0.003) and transverse plane knee range of motion (P = 0.027). During the cutting phase, the ACLr participant's previously injured limb had increased internal knee abduction moment compared with that of the control group (P = 0.032). No significant differences were reported between the previously injured and contralateral uninjured limb. Previously injured participants demonstrated higher knee abduction moment and transverse plane range of motion when compared with those of control participants during a game-specific landing and cutting task.

Implementation Analysis of Cutting Tool Carbide with Cast Iron Material S45 C on Universal Lathe

NASA Astrophysics Data System (ADS)

Junaidi; hestukoro, Soni; yanie, Ahmad; Jumadi; Eddy

2017-12-01

Cutting tool is the tools lathe. Cutting process tool CARBIDE with Cast Iron Material Universal Lathe which is commonly found at Analysiscutting Process by some aspects numely Cutting force, Cutting Speed, Cutting Power, Cutting Indication Power, Temperature Zone 1 and Temperatur Zone 2. Purpose of this Study was to determine how big the cutting Speed, Cutting Power, electromotor Power,Temperatur Zone 1 and Temperatur Zone 2 that drives the chisel cutting CARBIDE in the Process of tur ning Cast Iron Material. Cutting force obtained from image analysis relationship between the recommended Component Cuting Force with plane of the cut and Cutting Speed obtained from image analysis of relationships between the recommended Cutting Speed Feed rate.

Evaluating tooth restorations: micro-computed tomography in practical training for students in dentistry

NASA Astrophysics Data System (ADS)

Deyhle, Hans; Schmidli, Fredy; Krastl, Gabriel; Müller, Bert

2010-09-01

Direct composite fillings belong to widespread tooth restoration techniques in dental medicine. The procedure consists of successive steps, which include etching of the prepared tooth surface, bonding and placement of composite in incrementally built up layers. Durability and lifespan of the composite inlays strongly depend on the accurate completion of the individual steps to be also realized by students in dental medicine. Improper handling or nonconformity in the bonding procedure often lead to air enclosures (bubbles) as well as to significant gaps between the composite layers or at the margins of the restoration. Traditionally one analyzes the quality of the restoration cutting the tooth in an arbitrarily selected plane and inspecting this plane by conventional optical microscopy. Although the precision of this established method is satisfactory, it is restricted to the selected two-dimensional plane. Rather simple micro computed tomography (μCT) systems, such as SkyScan 1174™, allows for the non-destructive three-dimensional imaging of restored teeth ex vivo and virtually cutting the tomographic data in any desired direction, offering a powerful tool for inspection of the restored tooth with micrometer resolution before cutting and thus also to select a two-dimensional plane with potential defects. In order to study the influence of the individual steps on the resulted tooth restoration, direct composite fillings were placed in mod cavities of extracted teeth. After etching, an adhesive was applied in half of the specimens. From the tomographic datasets, it becomes clear that gaps occur more frequently when bonding is omitted. The visualization of air enclosures offers to determine the probability to find a micrometer-sized defect using an arbitrarily selected cutting plane for inspection.

The distance from the extramedullary cutting guide rod to the skin surface as a reference guide for the tibial slope in total knee arthroplasty.

PubMed

Tsukeoka, Tadashi; Tsuneizumi, Yoshikazu

2016-03-01

Although sagittal tibial alignment in total knee arthroplasty (TKA) is important, no landmarks exist to achieve a reproducible slope. The purpose of this study was to evaluate the clinical usefulness of the distance from the guide rod to the skin surface for the tibial slope in TKA. Computer simulation studies were performed on 100 consecutive knees scheduled for TKA. The angle between the line connecting the most anterior point of the predicted tibial cut surface and the skin surface 20 cm distal to the predicted cut surface (Line S) and the mechanical axis (MA) of the tibia in the sagittal plane was measured. The mean (±SD) absolute angle difference between the Line S and the MA was 0.9°±0.7°. The Line S was almost parallel to the MA in the sagittal plane (95% and 99% within two degrees and three degrees of deviation from MA, respectively). The guide rod orientation is a surrogate for the tibial cut slope because the targeted posterior slope is usually built into the cutting block and ensuring the rod is parallel to the MA in the sagittal plane is recommended. Therefore the distance between the skin surface and the rod can be a useful guide for the tibial slope. II. Copyright © 2015 Elsevier B.V. All rights reserved.

A general algorithm for the construction of contour plots

NASA Technical Reports Server (NTRS)

Johnson, W.; Silva, F.

1981-01-01

An algorithm is described that performs the task of drawing equal level contours on a plane, which requires interpolation in two dimensions based on data prescribed at points distributed irregularly over the plane. The approach is described in detail. The computer program that implements the algorithm is documented and listed.

Heuristic algorithms for solving of the tool routing problem for CNC cutting machines

NASA Astrophysics Data System (ADS)

Chentsov, P. A.; Petunin, A. A.; Sesekin, A. N.; Shipacheva, E. N.; Sholohov, A. E.

2015-11-01

The article is devoted to the problem of minimizing the path of the cutting tool to shape cutting machines began. This problem can be interpreted as a generalized traveling salesman problem. Earlier version of the dynamic programming method to solve this problem was developed. Unfortunately, this method allows to process an amount not exceeding thirty circuits. In this regard, the task of constructing quasi-optimal route becomes relevant. In this paper we propose options for quasi-optimal greedy algorithms. Comparison of the results of exact and approximate algorithms is given.

Operationalizing hippocampal volume as an enrichment biomarker for amnestic MCI trials: effect of algorithm, test-retest variability and cut-point on trial cost, duration and sample size

PubMed Central

Yu, P.; Sun, J.; Wolz, R.; Stephenson, D.; Brewer, J.; Fox, N.C.; Cole, P.E.; Jack, C.R.; Hill, D.L.G.; Schwarz, A.J.

2014-01-01

Objective To evaluate the effect of computational algorithm, measurement variability and cut-point on hippocampal volume (HCV)-based patient selection for clinical trials in mild cognitive impairment (MCI). Methods We used normal control and amnestic MCI subjects from ADNI-1 as normative reference and screening cohorts. We evaluated the enrichment performance of four widely-used hippocampal segmentation algorithms (FreeSurfer, HMAPS, LEAP and NeuroQuant) in terms of two-year changes in MMSE, ADAS-Cog and CDR-SB. We modeled the effect of algorithm, test-retest variability and cut-point on sample size, screen fail rates and trial cost and duration. Results HCV-based patient selection yielded not only reduced sample sizes (by ~40–60%) but also lower trial costs (by ~30–40%) across a wide range of cut-points. Overall, the dependence on the cut-point value was similar for the three clinical instruments considered. Conclusion These results provide a guide to the choice of HCV cut-point for aMCI clinical trials, allowing an informed trade-off between statistical and practical considerations. PMID:24211008

A novel toolpath force prediction algorithm using CAM volumetric data for optimizing robotic arthroplasty.

PubMed

Kianmajd, Babak; Carter, David; Soshi, Masakazu

2016-10-01

Robotic total hip arthroplasty is a procedure in which milling operations are performed on the femur to remove material for the insertion of a prosthetic implant. The robot performs the milling operation by following a sequential list of tool motions, also known as a toolpath, generated by a computer-aided manufacturing (CAM) software. The purpose of this paper is to explain a new toolpath force prediction algorithm that predicts cutting forces, which results in improving the quality and safety of surgical systems. With a custom macro developed in the CAM system's native application programming interface, cutting contact patch volume was extracted from CAM simulations. A time domain cutting force model was then developed through the use of a cutting force prediction algorithm. The second portion validated the algorithm by machining a hip canal in simulated bone using a CNC machine. Average cutting forces were measured during machining using a dynamometer and compared to the values predicted from CAM simulation data using the proposed method. The results showed the predicted forces matched the measured forces in both magnitude and overall pattern shape. However, due to inconsistent motion control, the time duration of the forces was slightly distorted. Nevertheless, the algorithm effectively predicted the forces throughout an entire hip canal procedure. This method provides a fast and easy technique for predicting cutting forces during orthopedic milling by utilizing data within a CAM software.

Thermal stresses in the laser disc from a tetragonal c-cut crystal

NASA Astrophysics Data System (ADS)

Yumashev, K. V.; Loiko, P. A.

2014-12-01

Analytical expressions for thermal stresses and strains, as well as displacements, are obtained for the laser disc from a tetragonal crystal cut along the [0 0 1] axis under plane stress approximation, for the first time, to our knowledge. This study illustrates that, in polar coordinates, the normal stresses, σr and σθ, are angular independent, while the shear one τrθ is zero. The thermal strains, εr and εθ, and displacements, u and υ, depend on both radial and tangential coordinates; this dependence has the shape of a four-leaf rose. For considered crystal cutting with isotropic in-plane thermal expansion, the displacements are not pure radial (υ≠0). The values of stresses, strains and displacements are calculated for the disc from a c-cut yttrium vanadate laser crystal, Nd:YVO4. The thermal fracture issues are analyzed for this crystal.

Characterization and prediction of the backscattered form function of an immersed cylindrical shell using hybrid fuzzy clustering and bio-inspired algorithms.

PubMed

Agounad, Said; Aassif, El Houcein; Khandouch, Younes; Maze, Gérard; Décultot, Dominique

2018-02-01

The acoustic scattering of a plane wave by an elastic cylindrical shell is studied. A new approach is developed to predict the form function of an immersed cylindrical shell of the radius ratio b/a ('b' is the inner radius and 'a' is the outer radius). The prediction of the backscattered form function is investigated by a combined approach between fuzzy clustering algorithms and bio-inspired algorithms. Four famous fuzzy clustering algorithms: the fuzzy c-means (FCM), the Gustafson-Kessel algorithm (GK), the fuzzy c-regression model (FCRM) and the Gath-Geva algorithm (GG) are combined with particle swarm optimization and genetic algorithm. The symmetric and antisymmetric circumferential waves A, S 0 , A 1 , S 1 and S 2 are investigated in a reduced frequency (k 1 a) range extends over 0.1

X-Z-Theta cutting method

DOEpatents

Bieg, Lothar F.

1993-01-12

A method for machining a workpiece. The method includes the use of a rotary cutting tool mounted on the end of a movable arm. The arm is adapted to move in a plane perpendicular to the axis of rotation of the cutting tool. The cutting tool has cutting teeth to cut chips of material off of the workpiece in a predetermined size and shape to facilitate better removal of the chips from the workpiece. The teeth can be of different type and length to permit the tool to both rough cut and finish cut the workpiece during machining. The total depth of cut is divided by the number of tool teeth, so that the longest tool always performs the finishing cut.

A new approach to knee joint arthroplasty.

PubMed

Zarychta, P

2018-04-01

The main aim of this new approach dedicated to knee arthroplasty is to provide an automated method for determining the cutting planes of both the head of femur and the head of tibia in knee replacement surgery. This paper shows a new approach differing from standard procedures associated with manual determination of the mechanical axis of the lower extremity (during surgery) and replacing them with a procedure based on the imprints (with selected cutting planes) of the two heads of bones. Both these imprints have been performed on the basis of the toposcan of the lower limb (before surgery). This methodology has been implemented in MATLAB and tested in clinical CT images of the lower limb in the coronal and transverse planes (61 studies) and in clinical MRI studies of the knee joint in coronal plane (107 studies). Correct results were obtained for about 90% cases. Copyright © 2017 Elsevier Ltd. All rights reserved.

On triangulations of the plane by pencils of conics. II

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lazareva, V B; Shelekhov, A M

2013-06-30

The present work continues our previous paper in which all possible triangulations of the plane using three pencils of circles were listed. In the present article we find all projectively distinct triangulations of the plane by pencils of conics that are obtained by projecting regular three-webs, cut out on a nondegenerate cubic surface by three pencils of planes, whose axes lie on this surface. Bibliography: 6 titles.

Optic axis determination by fibre-based polarization-sensitive swept-source optical coherence tomography

NASA Astrophysics Data System (ADS)

Lu, Zenghai; Kasaragod, Deepa K.; Matcher, Stephen J.

2011-02-01

We describe a fibre-based variable-incidence angle (VIA) polarization-sensitive swept-source optical coherence tomography (PS-SS-OCT) system to determine the 3D optical axis of birefringent biological tissues. Single-plane VIA-PS-OCT is also explored which requires measurement of the absolute fast-axis orientation. A state-of-the-art PS-SS-OCT system with some improvements both in hardware and software was used to determine the apparent optical birefringence of equine tendon for a number of different illumination directions. Polar and azimuthal angles of cut equine tendon were produced by the VIA method and compared with the nominal values. A quarter waveplate (QWP) and equine tendon were used as test targets to validate the fast-axis measurements using the system. Polar and azimuthal angles of cut equine tendon broadly agreed with the expected values within about 8% of the nominal values. A theoretical and experimental analysis of the effect of the sample arm fibre on determination of optical axis orientation using a proposed definition based on the orientation of the eigenpolarization ellipse experimentally confirms that this algorithm only works correctly for special settings of the sample arm fibre. A proposed algorithm based on the angle between Stokes vectors on the Poincaré sphere is confirmed to work for all settings of the sample arm fibre. A calibration procedure is proposed to remove the sign ambiguity of the measured orientation and was confirmed experimentally by using the QWP.

Optic axis determination by fiber-based polarization-sensitive swept-source optical coherence tomography

NASA Astrophysics Data System (ADS)

Lu, Zenghai; Kasaragod, Deepa K.; Matcher, Stephen J.

2011-03-01

We describe a fiber-based variable-incidence-angle (VIA) polarization-sensitive swept-source optical coherence tomography (PS-SS-OCT) system to determine the 3-D optical axis of birefringent biological tissues. Single-plane VIAPS- OCT is also explored which requires measurement of the absolute fast-axis orientation. A state-of-the-art PS-SS-OCT system with some improvements both in hardware and software was used to determine the apparent optical birefringence of equine tendon for a number of different illumination directions. Polar and azimuthal angles of cut equine tendon were produced by VIA method and compared with the nominal values. A quarter waveplate (QWP) and equine tendon were used as test targets to validate the fast-axis measurements using the system. Polar and azimuthal angles of cut equine tendon broadly agreed with the expected values within about 8% of the nominal values. A theoretical and experimental analysis of the effect of the sample arm fiber on determination of optical axis orientation using a proposed definition based on the orientation of the eigenpolarization ellipse experimentally confirms that this algorithm only works correctly for special settings of the sample arm fiber. A proposed algorithm based on the angle between Stokes vectors on the Poincaré sphere is confirmed to work for all settings of the sample arm fiber. A calibration procedure is proposed to remove the sign ambiguity of the measured orientation and was confirmed experimentally by using the QWP.

Evolution of strain localization in variable-width three-dimensional unsaturated laboratory-scale cut slopes

USGS Publications Warehouse

Morse, Michael S.; Lu, Ning; Wayllace, Alexandra; Godt, Jonathan W.

2017-01-01

To experimentally validate a recently developed theory for predicting the stability of cut slopes under unsaturated conditions, the authors measured increasing strain localization in unsaturated slope cuts prior to abrupt failure. Cut slope width and moisture content were controlled and varied in a laboratory, and a sliding door that extended the height of the free face of the slope was lowered until the cut slope failed. A particle image velocimetry tool was used to quantify soil displacement in the x-y">x-y (horizontal) and x-z">x-z (vertical) planes, and strain was calculated from the displacement. Areas of maximum strain localization prior to failure were shown to coincide with the location of the eventual failure plane. Experimental failure heights agreed with the recently developed stability theory for unsaturated cut slopes (within 14.3% relative error) for a range of saturation and cut slope widths. A theoretical threshold for sidewall influence on cut slope failures was also proposed to quantify the relationship between normalized sidewall width and critical height. The proposed relationship was consistent with the cut slope experiment results, and is intended for consideration in future geotechnical experiment design. The experimental data of evolution of strain localization presented herein provide a physical basis from which future numerical models of strain localization can be validated.

C-plane Reconstructions from Sheaf Acquisition for Ultrasound Electrode Vibration Elastography.

PubMed

Ingle, Atul; Varghese, Tomy

2014-09-03

This paper presents a novel algorithm for reconstructing and visualizing ablated volumes using radiofrequency ultrasound echo data acquired with the electrode vibration elastography approach. The ablation needle is vibrated using an actuator to generate shear wave pulses that are tracked in the ultrasound image plane at different locations away from the needle. This data is used for reconstructing shear wave velocity maps for each imaging plane. A C-plane reconstruction algorithm is proposed which estimates shear wave velocity values on a collection of transverse planes that are perpendicular to the imaging planes. The algorithm utilizes shear wave velocity maps from different imaging planes that share a common axis of intersection. These C-planes can be used to generate a 3D visualization of the ablated region. Experimental validation of this approach was carried out using data from a tissue mimicking phantom. The shear wave velocity estimates were within 20% of those obtained from a clinical scanner, and a contrast of over 4 dB was obtained between the stiff and soft regions of the phantom.

Breast mass segmentation in mammography using plane fitting and dynamic programming.

PubMed

Song, Enmin; Jiang, Luan; Jin, Renchao; Zhang, Lin; Yuan, Yuan; Li, Qiang

2009-07-01

Segmentation is an important and challenging task in a computer-aided diagnosis (CAD) system. Accurate segmentation could improve the accuracy in lesion detection and characterization. The objective of this study is to develop and test a new segmentation method that aims at improving the performance level of breast mass segmentation in mammography, which could be used to provide accurate features for classification. This automated segmentation method consists of two main steps and combines the edge gradient, the pixel intensity, as well as the shape characteristics of the lesions to achieve good segmentation results. First, a plane fitting method was applied to a background-trend corrected region-of-interest (ROI) of a mass to obtain the edge candidate points. Second, dynamic programming technique was used to find the "optimal" contour of the mass from the edge candidate points. Area-based similarity measures based on the radiologist's manually marked annotation and the segmented region were employed as criteria to evaluate the performance level of the segmentation method. With the evaluation criteria, the new method was compared with 1) the dynamic programming method developed by Timp and Karssemeijer, and 2) the normalized cut segmentation method, based on 337 ROIs extracted from a publicly available image database. The experimental results indicate that our segmentation method can achieve a higher performance level than the other two methods, and the improvements in segmentation performance level were statistically significant. For instance, the mean overlap percentage for the new algorithm was 0.71, whereas those for Timp's dynamic programming method and the normalized cut segmentation method were 0.63 (P < .001) and 0.61 (P < .001), respectively. We developed a new segmentation method by use of plane fitting and dynamic programming, which achieved a relatively high performance level. The new segmentation method would be useful for improving the accuracy of computerized detection and classification of breast cancer in mammography.

A topology visualization early warning distribution algorithm for large-scale network security incidents.

PubMed

He, Hui; Fan, Guotao; Ye, Jianwei; Zhang, Weizhe

2013-01-01

It is of great significance to research the early warning system for large-scale network security incidents. It can improve the network system's emergency response capabilities, alleviate the cyber attacks' damage, and strengthen the system's counterattack ability. A comprehensive early warning system is presented in this paper, which combines active measurement and anomaly detection. The key visualization algorithm and technology of the system are mainly discussed. The large-scale network system's plane visualization is realized based on the divide and conquer thought. First, the topology of the large-scale network is divided into some small-scale networks by the MLkP/CR algorithm. Second, the sub graph plane visualization algorithm is applied to each small-scale network. Finally, the small-scale networks' topologies are combined into a topology based on the automatic distribution algorithm of force analysis. As the algorithm transforms the large-scale network topology plane visualization problem into a series of small-scale network topology plane visualization and distribution problems, it has higher parallelism and is able to handle the display of ultra-large-scale network topology.

CatSim: a new computer assisted tomography simulation environment

NASA Astrophysics Data System (ADS)

De Man, Bruno; Basu, Samit; Chandra, Naveen; Dunham, Bruce; Edic, Peter; Iatrou, Maria; McOlash, Scott; Sainath, Paavana; Shaughnessy, Charlie; Tower, Brendon; Williams, Eugene

2007-03-01

We present a new simulation environment for X-ray computed tomography, called CatSim. CatSim provides a research platform for GE researchers and collaborators to explore new reconstruction algorithms, CT architectures, and X-ray source or detector technologies. The main requirements for this simulator are accurate physics modeling, low computation times, and geometrical flexibility. CatSim allows simulating complex analytic phantoms, such as the FORBILD phantoms, including boxes, ellipsoids, elliptical cylinders, cones, and cut planes. CatSim incorporates polychromaticity, realistic quantum and electronic noise models, finite focal spot size and shape, finite detector cell size, detector cross-talk, detector lag or afterglow, bowtie filtration, finite detector efficiency, non-linear partial volume, scatter (variance-reduced Monte Carlo), and absorbed dose. We present an overview of CatSim along with a number of validation experiments.

The Dance of the Foci

ERIC Educational Resources Information Center

Seppala-Holtzman, David

2010-01-01

It's well known that slicing a cone with a plane and then allowing the plane to rotate through all possible angles of inclination yields the conic sections. What paths then do the foci of these conics trace out as this cutting plane passes through the different angles? In this article, we derive formulae for these trajectories and generate the…

Weighted graph cuts without eigenvectors a multilevel approach.

PubMed

Dhillon, Inderjit S; Guan, Yuqiang; Kulis, Brian

2007-11-01

A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods. In this paper, we discuss an equivalence between the objective functions used in these seemingly different methods--in particular, a general weighted kernel k-means objective is mathematically equivalent to a weighted graph clustering objective. We exploit this equivalence to develop a fast, high-quality multilevel algorithm that directly optimizes various weighted graph clustering objectives, such as the popular ratio cut, normalized cut, and ratio association criteria. This eliminates the need for any eigenvector computation for graph clustering problems, which can be prohibitive for very large graphs. Previous multilevel graph partitioning methods, such as Metis, have suffered from the restriction of equal-sized clusters; our multilevel algorithm removes this restriction by using kernel k-means to optimize weighted graph cuts. Experimental results show that our multilevel algorithm outperforms a state-of-the-art spectral clustering algorithm in terms of speed, memory usage, and quality. We demonstrate that our algorithm is applicable to large-scale clustering tasks such as image segmentation, social network analysis and gene network analysis.

Multi-scale graph-cut algorithm for efficient water-fat separation.

PubMed

Berglund, Johan; Skorpil, Mikael

2017-09-01

To improve the accuracy and robustness to noise in water-fat separation by unifying the multiscale and graph cut based approaches to B 0 -correction. A previously proposed water-fat separation algorithm that corrects for B 0 field inhomogeneity in 3D by a single quadratic pseudo-Boolean optimization (QPBO) graph cut was incorporated into a multi-scale framework, where field map solutions are propagated from coarse to fine scales for voxels that are not resolved by the graph cut. The accuracy of the single-scale and multi-scale QPBO algorithms was evaluated against benchmark reference datasets. The robustness to noise was evaluated by adding noise to the input data prior to water-fat separation. Both algorithms achieved the highest accuracy when compared with seven previously published methods, while computation times were acceptable for implementation in clinical routine. The multi-scale algorithm was more robust to noise than the single-scale algorithm, while causing only a small increase (+10%) of the reconstruction time. The proposed 3D multi-scale QPBO algorithm offers accurate water-fat separation, robustness to noise, and fast reconstruction. The software implementation is freely available to the research community. Magn Reson Med 78:941-949, 2017. © 2016 International Society for Magnetic Resonance in Medicine. © 2016 International Society for Magnetic Resonance in Medicine.

Implementation of pattern generation algorithm in forming Gilmore and Gomory model for two dimensional cutting stock problem

NASA Astrophysics Data System (ADS)

Octarina, Sisca; Radiana, Mutia; Bangun, Putra B. J.

2018-01-01

Two dimensional cutting stock problem (CSP) is a problem in determining the cutting pattern from a set of stock with standard length and width to fulfill the demand of items. Cutting patterns were determined in order to minimize the usage of stock. This research implemented pattern generation algorithm to formulate Gilmore and Gomory model of two dimensional CSP. The constraints of Gilmore and Gomory model was performed to assure the strips which cut in the first stage will be used in the second stage. Branch and Cut method was used to obtain the optimal solution. Based on the results, it found many patterns combination, if the optimal cutting patterns which correspond to the first stage were combined with the second stage.

Integrand-level reduction of loop amplitudes by computational algebraic geometry methods

NASA Astrophysics Data System (ADS)

Zhang, Yang

2012-09-01

We present an algorithm for the integrand-level reduction of multi-loop amplitudes of renormalizable field theories, based on computational algebraic geometry. This algorithm uses (1) the Gröbner basis method to determine the basis for integrand-level reduction, (2) the primary decomposition of an ideal to classify all inequivalent solutions of unitarity cuts. The resulting basis and cut solutions can be used to reconstruct the integrand from unitarity cuts, via polynomial fitting techniques. The basis determination part of the algorithm has been implemented in the Mathematica package, BasisDet. The primary decomposition part can be readily carried out by algebraic geometry softwares, with the output of the package BasisDet. The algorithm works in both D = 4 and D = 4 - 2 ɛ dimensions, and we present some two and three-loop examples of applications of this algorithm.

Anisotropy of Single-Crystal Silicon in Nanometric Cutting.

PubMed

Wang, Zhiguo; Chen, Jiaxuan; Wang, Guilian; Bai, Qingshun; Liang, Yingchun

2017-12-01

The anisotropy exhibited by single-crystal silicon in nanometric cutting is very significant. In order to profoundly understand the effect of crystal anisotropy on cutting behaviors, a large-scale molecular dynamics model was conducted to simulate the nanometric cutting of single-crystal silicon in the (100)[0-10], (100)[0-1-1], (110)[-110], (110)[00-1], (111)[-101], and (111)[-12-1] crystal directions in this study. The simulation results show the variations of different degrees in chip, subsurface damage, cutting force, and friction coefficient with changes in crystal plane and crystal direction. Shear deformation is the formation mechanism of subsurface damage, and the direction and complexity it forms are the primary causes that result in the anisotropy of subsurface damage. Structurally, chips could be classified into completely amorphous ones and incompletely amorphous ones containing a few crystallites. The formation mechanism of the former is high-pressure phase transformation, while the latter is obtained under the combined action of high-pressure phase transformation and cleavage. Based on an analysis of the material removal mode, it can be found that compared with the other crystal direction on the same crystal plane, the (100)[0-10], (110)[-110], and (111)[-101] directions are more suitable for ductile cutting.

NCC-RANSAC: a fast plane extraction method for 3-D range data segmentation.

PubMed

Qian, Xiangfei; Ye, Cang

2014-12-01

This paper presents a new plane extraction (PE) method based on the random sample consensus (RANSAC) approach. The generic RANSAC-based PE algorithm may over-extract a plane, and it may fail in case of a multistep scene where the RANSAC procedure results in multiple inlier patches that form a slant plane straddling the steps. The CC-RANSAC PE algorithm successfully overcomes the latter limitation if the inlier patches are separate. However, it fails if the inlier patches are connected. A typical scenario is a stairway with a stair wall where the RANSAC plane-fitting procedure results in inliers patches in the tread, riser, and stair wall planes. They connect together and form a plane. The proposed method, called normal-coherence CC-RANSAC (NCC-RANSAC), performs a normal coherence check to all data points of the inlier patches and removes the data points whose normal directions are contradictory to that of the fitted plane. This process results in separate inlier patches, each of which is treated as a candidate plane. A recursive plane clustering process is then executed to grow each of the candidate planes until all planes are extracted in their entireties. The RANSAC plane-fitting and the recursive plane clustering processes are repeated until no more planes are found. A probabilistic model is introduced to predict the success probability of the NCC-RANSAC algorithm and validated with real data of a 3-D time-of-flight camera-SwissRanger SR4000. Experimental results demonstrate that the proposed method extracts more accurate planes with less computational time than the existing RANSAC-based methods.

NCC-RANSAC: A Fast Plane Extraction Method for 3-D Range Data Segmentation

PubMed Central

Qian, Xiangfei; Ye, Cang

2015-01-01

This paper presents a new plane extraction (PE) method based on the random sample consensus (RANSAC) approach. The generic RANSAC-based PE algorithm may over-extract a plane, and it may fail in case of a multistep scene where the RANSAC procedure results in multiple inlier patches that form a slant plane straddling the steps. The CC-RANSAC PE algorithm successfully overcomes the latter limitation if the inlier patches are separate. However, it fails if the inlier patches are connected. A typical scenario is a stairway with a stair wall where the RANSAC plane-fitting procedure results in inliers patches in the tread, riser, and stair wall planes. They connect together and form a plane. The proposed method, called normal-coherence CC-RANSAC (NCC-RANSAC), performs a normal coherence check to all data points of the inlier patches and removes the data points whose normal directions are contradictory to that of the fitted plane. This process results in separate inlier patches, each of which is treated as a candidate plane. A recursive plane clustering process is then executed to grow each of the candidate planes until all planes are extracted in their entireties. The RANSAC plane-fitting and the recursive plane clustering processes are repeated until no more planes are found. A probabilistic model is introduced to predict the success probability of the NCC-RANSAC algorithm and validated with real data of a 3-D time-of-flight camera–SwissRanger SR4000. Experimental results demonstrate that the proposed method extracts more accurate planes with less computational time than the existing RANSAC-based methods. PMID:24771605

Modulation transfer function measurement of microbolometer focal plane array by Lloyd's mirror method

NASA Astrophysics Data System (ADS)

Druart, Guillaume; Rommeluere, Sylvain; Viale, Thibault; Guerineau, Nicolas; Ribet-Mohamed, Isabelle; Crastes, Arnaud; Durand, Alain; Taboury, Jean

2014-05-01

Today, both military and civilian applications require miniaturized and cheap optical systems. One way to achieve this trend consists in decreasing the pixel pitch of focal plane arrays (FPA). In order to evaluate the performance of the overall optical systems, it is necessary to measure the modulation transfer function (MTF) of these pixels. However, small pixels lead to higher cut-off frequencies and therefore, original MTF measurements that are able to extract frequencies up to these high cut-off frequencies, are needed. In this paper, we will present a way to extract 1D MTF at high frequencies by projecting fringes on the FPA. The device uses a Lloyd mirror placed near and perpendicular to the focal plane array. Consequently, an interference pattern of fringes can be projected on the detector. By varying the angle of incidence of the light beam, we can tune the period of the interference fringes and, thus, explore a wide range of spatial frequencies, and mainly around the cut-off frequency of the pixel which is one of the most interesting area. Illustration of this method will be applied to a 640×480 microbolometer focal plane array with a pixel pitch of 17µm in the LWIR spectral region.

Cutting work in thick section cryomicrotomy.

PubMed

Saubermann, A J; Riley, W D; Beeuwkes, R

1977-09-01

The forces during cryosectioning were measured using miniature strain gauges attached to a load cell fitted to the drive arm of the Porter-Blum MT-2 cryomicrotome. Work was calculated and the data normalized to a standard (1 mm X 1 mm X 0.5 micrometer) section. Thermal energy generated was also calculated. Five parameters were studied: cutting angle, thickness, temperature, hardness, and block shape. Force patterns could be divided into three major groups thought to represent cutting (Type I), large fracture planes greater than 10 micrometer in length (Type II), and small fracture planes less than 10 micrometer in length (Type III). Type I and Type II produced satisfactory sections. Work in cutting ranged from an average of 78.4 muJ to 568.8 muJ. Cutting angle and temperature had the greatest effect on sectioning. Heat generated would be sufficient to cause through-section melting for 0.5 micrometer thick sections assuming the worst possible case, namely that all heat went into the section without loss. Presence of a Type II pattern (large fracture pattern) is thought to be presumptive evidence against thawing.

Method and apparatus for optimizing the efficiency and quality of laser material processing

DOEpatents

Susemihl, Ingo

1990-01-01

The efficiency of laser welding and other laser material processing is optimized according to this invention by rotating the plane of polarization of a linearly polarized laser beam in relation to a work piece of the material being processed simultaneously and in synchronization with steering the laser beam over the work piece so as to keep the plane of polarization parallel to either the plane of incidence or the direction of travel of the beam in relation to the work piece. Also, depending to some extent on the particular processing being accomplished, such as welding or fusing, the angle of incidence of the laser beam on the work piece is kept at or near the polarizing or Brewster's angle. The combination of maintaining the plane of polarization parallel to plane of incidence while also maintaining the angle of incidence at or near the polarizing or Brewster's angle results in only minimal, if any, reflection losses during laser welding. Also, coordinating rotation of the plane of polarization with the translation or steering of a work piece under a laser cutting beam maximizes efficiency and kerf geometry, regardless of the direction of cut.

Method and apparatus for optimizing the efficiency and quality of laser material processing

DOEpatents

Susemihl, I.

1990-03-13

The efficiency of laser welding and other laser material processing is optimized according to this invention by rotating the plane of polarization of a linearly polarized laser beam in relation to a work piece of the material being processed simultaneously and in synchronization with steering the laser beam over the work piece so as to keep the plane of polarization parallel to either the plane of incidence or the direction of travel of the beam in relation to the work piece. Also, depending to some extent on the particular processing being accomplished, such as welding or fusing, the angle of incidence of the laser beam on the work piece is kept at or near the polarizing or Brewster's angle. The combination of maintaining the plane of polarization parallel to plane of incidence while also maintaining the angle of incidence at or near the polarizing or Brewster's angle results in only minimal, if any, reflection losses during laser welding. Also, coordinating rotation of the plane of polarization with the translation or steering of a work piece under a laser cutting beam maximizes efficiency and kerf geometry, regardless of the direction of cut. 7 figs.

Analytical Study of different types Of network failure detection and possible remedies

NASA Astrophysics Data System (ADS)

Saxena, Shikha; Chandra, Somnath

2012-07-01

Faults in a network have various causes,such as the failure of one or more routers, fiber-cuts, failure of physical elements at the optical layer, or extraneous causes like power outages. These faults are usually detected as failures of a set of dependent logical entities and the links affected by the failed components. A reliable control plane plays a crucial role in creating high-level services in the next-generation transport network based on the Generalized Multiprotocol Label Switching (GMPLS) or Automatically Switched Optical Networks (ASON) model. In this paper, approaches to control-plane survivability, based on protection and restoration mechanisms, are examined. Procedures for the control plane state recovery are also discussed, including link and node failure recovery and the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An SRLG failure is a failure of multiple links due to a failure of a common resource. MCs (MPs) start and end at same (distinct) monitoring location(s). They are constructed such that any SRLG failure results in the failure of a unique combination of paths and cycles. We derive necessary and sufficient conditions on the set of MCs and MPs needed for localizing an SRLG failure in an arbitrary graph. Procedure of Protection and Restoration of the SRLG failure by backup re-provisioning algorithm have also been discussed.

Analyzing the effect of cutting parameters on surface roughness and tool wear when machining nickel based hastelloy - 276

NASA Astrophysics Data System (ADS)

Khidhir, Basim A.; Mohamed, Bashir

2011-02-01

Machining parameters has an important factor on tool wear and surface finish, for that the manufacturers need to obtain optimal operating parameters with a minimum set of experiments as well as minimizing the simulations in order to reduce machining set up costs. The cutting speed is one of the most important cutting parameter to evaluate, it clearly most influences on one hand, tool life, tool stability, and cutting process quality, and on the other hand controls production flow. Due to more demanding manufacturing systems, the requirements for reliable technological information have increased. For a reliable analysis in cutting, the cutting zone (tip insert-workpiece-chip system) as the mechanics of cutting in this area are very complicated, the chip is formed in the shear plane (entrance the shear zone) and is shape in the sliding plane. The temperature contributed in the primary shear, chamfer and sticking, sliding zones are expressed as a function of unknown shear angle on the rake face and temperature modified flow stress in each zone. The experiments were carried out on a CNC lathe and surface finish and tool tip wear are measured in process. Machining experiments are conducted. Reasonable agreement is observed under turning with high depth of cut. Results of this research help to guide the design of new cutting tool materials and the studies on evaluation of machining parameters to further advance the productivity of nickel based alloy Hastelloy - 276 machining.

A Research Program on the Asymptotic Description of Electromagnetic Pulse Propagation in Spatially Inhomogeneous Temporally Dispersive, Attenuative Media

DTIC Science & Technology

2007-09-01

the right- half of the complex wo- plane . The Sommerfeld precursor then describes the signal front which arrives at 0 = 1 with...resonance Lorentz model dielectric [18], the complex phase function qO(w, 0) is analytic in the w- plane formed by the two branch cuts in the lower half of... the w,- plane symmetrically located about the imaginary axis. In the right half plane , the branch

On size-constrained minimum s–t cut problems and size-constrained dense subgraph problems

DOE PAGES

Chen, Wenbin; Samatova, Nagiza F.; Stallmann, Matthias F.; ...

2015-10-30

In some application cases, the solutions of combinatorial optimization problems on graphs should satisfy an additional vertex size constraint. In this paper, we consider size-constrained minimum s–t cut problems and size-constrained dense subgraph problems. We introduce the minimum s–t cut with at-least-k vertices problem, the minimum s–t cut with at-most-k vertices problem, and the minimum s–t cut with exactly k vertices problem. We prove that they are NP-complete. Thus, they are not polynomially solvable unless P = NP. On the other hand, we also study the densest at-least-k-subgraph problem (DalkS) and the densest at-most-k-subgraph problem (DamkS) introduced by Andersen andmore » Chellapilla [1]. We present a polynomial time algorithm for DalkS when k is bounded by some constant c. We also present two approximation algorithms for DamkS. In conclusion, the first approximation algorithm for DamkS has an approximation ratio of n-1/k-1, where n is the number of vertices in the input graph. The second approximation algorithm for DamkS has an approximation ratio of O (n δ), for some δ < 1/3.« less

A genetic algorithm used for solving one optimization problem

NASA Astrophysics Data System (ADS)

Shipacheva, E. N.; Petunin, A. A.; Berezin, I. M.

2017-12-01

A problem of minimizing the length of the blank run for a cutting tool during cutting of sheet materials into shaped blanks is discussed. This problem arises during the preparation of control programs for computerized numerical control (CNC) machines. A discrete model of the problem is analogous in setting to the generalized travelling salesman problem with limitations in the form of precursor conditions determined by the technological features of cutting. A certain variant of a genetic algorithm for solving this problem is described. The effect of the parameters of the developed algorithm on the solution result for the problem with limitations is investigated.

Blind Deconvolution of Astronomical Images with a Constraint on Bandwidth Determined by the Parameters of the Optical System

NASA Astrophysics Data System (ADS)

Luo, Lin; Fan, Min; Shen, Mang-zuo

2008-01-01

Atmospheric turbulence severely restricts the spatial resolution of astronomical images obtained by a large ground-based telescope. In order to reduce effectively this effect, we propose a method of blind deconvolution, with a bandwidth constraint determined by the parameters of the telescope's optical system based on the principle of maximum likelihood estimation, in which the convolution error function is minimized by using the conjugate gradient algorithm. A relation between the parameters of the telescope optical system and the image's frequency-domain bandwidth is established, and the speed of convergence of the algorithm is improved by using the positivity constraint on the variables and the limited-bandwidth constraint on the point spread function. To avoid the effective Fourier frequencies exceed the cut-off frequency, it is required that each single image element (e.g., the pixel in the CCD imaging) in the sampling focal plane should be smaller than one fourth of the diameter of the diffraction spot. In the algorithm, no object-centered constraint was used, so the proposed method is suitable for the image restoration of a whole field of objects. By the computer simulation and by the restoration of an actually-observed image of α Piscium, the effectiveness of the proposed method is demonstrated.

An adaptive guidance algorithm for an aerodynamically assisted orbital plane change maneuver. M.S. Thesis

NASA Technical Reports Server (NTRS)

Blissit, J. A.

1986-01-01

Using analysis results from the post trajectory optimization program, an adaptive guidance algorithm is developed to compensate for density, aerodynamic and thrust perturbations during an atmospheric orbital plane change maneuver. The maneuver offers increased mission flexibility along with potential fuel savings for future reentry vehicles. Although designed to guide a proposed NASA Entry Research Vehicle, the algorithm is sufficiently generic for a range of future entry vehicles. The plane change analysis provides insight suggesting a straight-forward algorithm based on an optimized nominal command profile. Bank angle, angle of attack, and engine thrust level, ignition and cutoff times are modulated to adjust the vehicle's trajectory to achieve the desired end-conditions. A performance evaluation of the scheme demonstrates a capability to guide to within 0.05 degrees of the desired plane change and five nautical miles of the desired apogee altitude while maintaining heating constraints. The algorithm is tested under off-nominal conditions of + or -30% density biases, two density profile models, + or -15% aerodynamic uncertainty, and a 33% thrust loss and for various combinations of these conditions.

Machining Parameters Optimization using Hybrid Firefly Algorithm and Particle Swarm Optimization

NASA Astrophysics Data System (ADS)

Farahlina Johari, Nur; Zain, Azlan Mohd; Haszlinna Mustaffa, Noorfa; Udin, Amirmudin

2017-09-01

Firefly Algorithm (FA) is a metaheuristic algorithm that is inspired by the flashing behavior of fireflies and the phenomenon of bioluminescent communication and the algorithm is used to optimize the machining parameters (feed rate, depth of cut, and spindle speed) in this research. The algorithm is hybridized with Particle Swarm Optimization (PSO) to discover better solution in exploring the search space. Objective function of previous research is used to optimize the machining parameters in turning operation. The optimal machining cutting parameters estimated by FA that lead to a minimum surface roughness are validated using ANOVA test.

Effect of the focal plane position on CO2 laser beam cutting of injection molded polycarbonate sheets

NASA Astrophysics Data System (ADS)

Moradi, Mahmoud; Mehrabi, Omid; Azdast, Taher; Benyounis, Khaled Y.

2016-11-01

In the present research, the effect of laser beam focal plane position (FPP) on the kerf quality of the polycarbonate laser cutting is investigated. Low power CO2 laser is used as the heat source of the cutting runs. In the experiments, FPP is varied from 0 to -4mm while other processing parameters (i.e. laser power, cutting speed and gas pressure) are considered constant. Upper and lower kerf width, kerf taper, upper heat affected zone and surface roughness of the kerf wall are also considered as the responses. Observations signified that reducing the position of the laser beam focal point from zero to - 3mm reduces the upper and lower kerf width. However reducing FPP below -3mm leads to an increase in the kerf width. Results also reveals that upper heat affected zone value reduces by reduction in FPP. Moreover the best kerf wall surface roughness occurred at FPP= -3mm.

A minimization method on the basis of embedding the feasible set and the epigraph

NASA Astrophysics Data System (ADS)

Zabotin, I. Ya; Shulgina, O. N.; Yarullin, R. S.

2016-11-01

We propose a conditional minimization method of the convex nonsmooth function which belongs to the class of cutting-plane methods. During constructing iteration points a feasible set and an epigraph of the objective function are approximated by the polyhedral sets. In this connection, auxiliary problems of constructing iteration points are linear programming problems. In optimization process there is some opportunity of updating sets which approximate the epigraph. These updates are performed by periodically dropping of cutting planes which form embedding sets. Convergence of the proposed method is proved, some realizations of the method are discussed.

Three Dimensional Sheaf of Ultrasound Planes Reconstruction (SOUPR) of Ablated Volumes

PubMed Central

Ingle, Atul; Varghese, Tomy

2014-01-01

This paper presents an algorithm for three dimensional reconstruction of tumor ablations using ultrasound shear wave imaging with electrode vibration elastography. Radiofrequency ultrasound data frames are acquired over imaging planes that form a subset of a sheaf of planes sharing a common axis of intersection. Shear wave velocity is estimated separately on each imaging plane using a piecewise linear function fitting technique with a fast optimization routine. An interpolation algorithm then computes velocity maps on a fine grid over a set of C-planes that are perpendicular to the axis of the sheaf. A full three dimensional rendering of the ablation can then be created from this stack of C-planes; hence the name “Sheaf Of Ultrasound Planes Reconstruction” or SOUPR. The algorithm is evaluated through numerical simulations and also using data acquired from a tissue mimicking phantom. Reconstruction quality is gauged using contrast and contrast-to-noise ratio measurements and changes in quality from using increasing number of planes in the sheaf are quantified. The highest contrast of 5 dB is seen between the stiffest and softest regions of the phantom. Under certain idealizing assumptions on the true shape of the ablation, good reconstruction quality while maintaining fast processing rate can be obtained with as few as 6 imaging planes suggesting that the method is suited for parsimonious data acquisitions with very few sparsely chosen imaging planes. PMID:24808405

Three-dimensional sheaf of ultrasound planes reconstruction (SOUPR) of ablated volumes.

PubMed

Ingle, Atul; Varghese, Tomy

2014-08-01

This paper presents an algorithm for 3-D reconstruction of tumor ablations using ultrasound shear wave imaging with electrode vibration elastography. Radio-frequency ultrasound data frames are acquired over imaging planes that form a subset of a sheaf of planes sharing a common axis of intersection. Shear wave velocity is estimated separately on each imaging plane using a piecewise linear function fitting technique with a fast optimization routine. An interpolation algorithm then computes velocity maps on a fine grid over a set of C-planes that are perpendicular to the axis of the sheaf. A full 3-D rendering of the ablation can then be created from this stack of C-planes; hence the name "Sheaf Of Ultrasound Planes Reconstruction" or SOUPR. The algorithm is evaluated through numerical simulations and also using data acquired from a tissue mimicking phantom. Reconstruction quality is gauged using contrast and contrast-to-noise ratio measurements and changes in quality from using increasing number of planes in the sheaf are quantified. The highest contrast of 5 dB is seen between the stiffest and softest regions of the phantom. Under certain idealizing assumptions on the true shape of the ablation, good reconstruction quality while maintaining fast processing rate can be obtained with as few as six imaging planes suggesting that the method is suited for parsimonious data acquisitions with very few sparsely chosen imaging planes.

Parallax handling of image stitching using dominant-plane homography

NASA Astrophysics Data System (ADS)

Pang, Zhaofeng; Li, Cheng; Zhao, Baojun; Tang, Linbo

2015-10-01

In this paper, we present a novel image stitching method to handle parallax in practical application. For images with significant amount of parallax, the more effective approach is to align roughly and globally the overlapping regions and then apply a seam-cutting method to composite naturally stitched images. It is well known that images can be modeled by various planes result from the projective parallax under non-ideal imaging condition. The dominant-plane homography has important advantages of warping an image globally and avoiding some local distortions. The proposed method primarily addresses large parallax problem through two steps: (1) selecting matching point pairs located on the dominant plane, by clustering matching correspondences and then measuring the cost of each cluster; and (2) in order to obtain a plausible seam, edge maps of overlapped area incorporation arithmetic is adopted to modify the standard seam-cutting method. Furthermore, our approach is demonstrated to achieve reliable performance of handling parallax through a mass of experimental comparisons with state-of-the-art methods.

A method to determine the acoustic reflection and absorption coefficients of porous media by using modal dispersion in a waveguide.

PubMed

Prisutova, Jevgenija; Horoshenkov, Kirill; Groby, Jean-Philippe; Brouard, Bruno

2014-12-01

The measurement of acoustic material characteristics using a standard impedance tube method is generally limited to the plane wave regime below the tube cut-on frequency. This implies that the size of the tube and, consequently, the size of the material specimen must remain smaller than a half of the wavelength. This paper presents a method that enables the extension of the frequency range beyond the plane wave regime by at least a factor of 3, so that the size of the material specimen can be much larger than the wavelength. The proposed method is based on measuring of the sound pressure at different axial locations and applying the spatial Fourier transform. A normal mode decomposition approach is used together with an optimization algorithm to minimize the discrepancy between the measured and predicted sound pressure spectra. This allows the frequency and angle dependent reflection and absorption coefficients of the material specimen to be calculated in an extended frequency range. The method has been tested successfully on samples of melamine foam and wood fiber. The measured data are in close agreement with the predictions by the equivalent fluid model for the acoustical properties of porous media.

Predictors of Frontal Plane Knee Moments During Side-Step Cutting to 45 and 110 Degrees in Men and Women: Implications for Anterior Cruciate Ligament Injury.

PubMed

Sigward, Susan M; Cesar, Guilherme M; Havens, Kathryn L

2015-11-01

To compare frontal plane knee moments, and kinematics and kinetics associated with knee valgus moments between cutting to 45 and 110 degrees, and to determine the predictive value of kinematics and ground reaction forces (GRFs) on knee valgus moments when cutting to these angles. Also, to determine whether sex differences exist in kinematics and kinetics when cutting to 45 and 110 degrees. Cross-sectional study. Laboratory setting. Forty-five (20 females) healthy young adult soccer athletes aged 16 to 23 years. Kinematic and kinetic variables were compared between randomly cued side-step cutting maneuvers to 45 and 110 degrees. Predictors of knee valgus moment were determined for each task. Kinematic variables: knee valgus angle, hip abduction, and internal rotation angles. Kinetic variables: vertical, posterior, and lateral GRFs, and knee valgus moment. Knee valgus moments were greater when cutting to 110 degrees compared with 45 degrees, and females exhibited greater moments than males. Vertical and lateral GRFs, hip internal rotation angle, and knee valgus angle explained 63% of the variance in knee valgus moment during cutting to 45 degrees. During cutting to 110 degrees, posterior GRF, hip internal rotation angle, and knee valgus angle explained 41% of the variance in knee valgus moment. Cutting tasks with larger redirection demands result in greater knee valgus moments. Similar factors, including shear GRFs, hip internal rotation, and knee valgus position contribute to knee valgus loading during cuts performed to smaller (45 degrees) and larger (110 degrees) angles. Reducing vertical and shear GRFs during cutting maneuvers may reduce knee valgus moments and thereby potentially reduce risk for anterior cruciate ligament injury.

Tool Forces and Chip Types In Orthogonal Cutting Of Southern Hardwoods

Treesearch

G.E. Woodson

1979-01-01

Specimens (l/8 to l/4 inch thick) from 5 trees of each of 22 hardwood species were cut orthogonally at 5 inches per minute. Average parallel and normal cutting forces for various rake angles (50, 60, and 70 degrees for veneer; 10, 20, and 30 degrees for planing; 20, 30, and 40 degrees for crosscutting) were measured at three moisture contents (10 percent, 20 percent,...

Motion-aware stroke volume quantification in 4D PC-MRI data of the human aorta.

PubMed

Köhler, Benjamin; Preim, Uta; Grothoff, Matthias; Gutberlet, Matthias; Fischbach, Katharina; Preim, Bernhard

2016-02-01

4D PC-MRI enables the noninvasive measurement of time-resolved, three-dimensional blood flow data that allow quantification of the hemodynamics. Stroke volumes are essential to assess the cardiac function and evolution of different cardiovascular diseases. The calculation depends on the wall position and vessel orientation, which both change during the cardiac cycle due to the heart muscle contraction and the pumped blood. However, current systems for the quantitative 4D PC-MRI data analysis neglect the dynamic character and instead employ a static 3D vessel approximation. We quantify differences between stroke volumes in the aorta obtained with and without consideration of its dynamics. We describe a method that uses the approximating 3D segmentation to automatically initialize segmentation algorithms that require regions inside and outside the vessel for each temporal position. This enables the use of graph cuts to obtain 4D segmentations, extract vessel surfaces including centerlines for each temporal position and derive motion information. The stroke volume quantification is compared using measuring planes in static (3D) vessels, planes with fixed angulation inside dynamic vessels (this corresponds to the common 2D PC-MRI) and moving planes inside dynamic vessels. Seven datasets with different pathologies such as aneurysms and coarctations were evaluated in close collaboration with radiologists. Compared to the experts' manual stroke volume estimations, motion-aware quantification performs, on average, 1.57% better than calculations without motion consideration. The mean difference between stroke volumes obtained with the different methods is 7.82%. Automatically obtained 4D segmentations overlap by 85.75% with manually generated ones. Incorporating motion information in the stroke volume quantification yields slight but not statistically significant improvements. The presented method is feasible for the clinical routine, since computation times are low and essential parts run fully automatically. The 4D segmentations can be used for other algorithms as well. The simultaneous visualization and quantification may support the understanding and interpretation of cardiac blood flow.

Inclined monochromator for high heat-load synchrotron x-ray radiation

DOEpatents

Khounsary, A.M.

1994-02-15

A double crystal monochromator is described including two identical, parallel crystals, each of which is cut such that the normal to the diffraction planes of interest makes an angle less than 90 degrees with the surface normal. Diffraction is symmetric, regardless of whether the crystals are symmetrically or asymmetrically cut, enabling operation of the monochromator with a fixed plane of diffraction. As a result of the inclination of the crystal surface, an incident beam has a footprint area which is elongated both vertically and horizontally when compared to that of the conventional monochromator, reducing the heat flux of the incident beam and enabling more efficient surface cooling. Because after inclination of the crystal only a fraction of thermal distortion lies in the diffraction plane, slope errors and the resultant misorientation of the diffracted beam are reduced. 11 figures.

Inclined monochromator for high heat-load synchrotron x-ray radiation

DOEpatents

Khounsary, Ali M.

1994-01-01

A double crystal monochromator including two identical, parallel crystals, each of which is cut such that the normal to the diffraction planes of interest makes an angle less than 90 degrees with the surface normal. Diffraction is symmetric, regardless of whether the crystals are symmetrically or asymmetrically cut, enabling operation of the monochromator with a fixed plane of diffraction. As a result of the inclination of the crystal surface, an incident beam has a footprint area which is elongated both vertically and horizontally when compared to that of the conventional monochromator, reducing the heat flux of the incident beam and enabling more efficient surface cooling. Because after inclination of the crystal only a fraction of thermal distortion lies in the diffraction plane, slope errors and the resultant misorientation of the diffracted beam are reduced.

Simultaneous 3D segmentation of three bone compartments on high resolution knee MR images from osteoarthritis initiative (OAI) using graph cuts

NASA Astrophysics Data System (ADS)

Shim, Hackjoon; Kwoh, C. Kent; Yun, Il Dong; Lee, Sang Uk; Bae, Kyongtae

2009-02-01

Osteoarthritis (OA) is associated with degradation of cartilage and related changes in the underlying bone. Quantitative measurement of those changes from MR images is an important biomarker to study the progression of OA and it requires a reliable segmentation of knee bone and cartilage. As the most popular method, manual segmentation of knee joint structures by boundary delineation is highly laborious and subject to user-variation. To overcome these difficulties, we have developed a semi-automated method for segmentation of knee bones, which consisted of two steps: placement of seeds and computation of segmentation. In the first step, seeds were placed by the user on a number of slices and then were propagated automatically to neighboring images. The seed placement could be performed on any of sagittal, coronal, and axial planes. The second step, computation of segmentation, was based on a graph-cuts algorithm where the optimal segmentation is the one that minimizes a cost function, which integrated the seeds specified by the user and both the regional and boundary properties of the regions to be segmented. The algorithm also allows simultaneous segmentation of three compartments of the knee bone (femur, tibia, patella). Our method was tested on the knee MR images of six subjects from the osteoarthritis initiative (OAI). The segmentation processing time (mean+/-SD) was (22+/-4)min, which is much shorter than that by the manual boundary delineation method (typically several hours). With this improved efficiency, our segmentation method will facilitate the quantitative morphologic analysis of changes in knee bones associated with osteoarthritis.

Lower limb kinematics of male and female soccer players during a self-selected cutting maneuver: Effects of prolonged activity.

PubMed

McGovern, Andrew; Dude, Christopher; Munkley, Daniel; Martin, Thomas; Wallace, David; Feinn, Richard; Dione, Donald; Garbalosa, Juan C

2015-12-01

Despite the recent emphasis on injury prevention, anterior cruciate ligament (ACL) injury rates remain high. This study aimed to ascertain the effects of prolonged activity on lower limb kinematics during a self-selected cutting maneuver. Angular kinematics were recorded during an agility test performed until the completion time was greater than the mean plus one SD of baseline trials. Cut type was identified and the hip and knee angles at 33 ms post heel strike were determined. A linear mixed effects model assessed the effects of cut type, gender, and activity status on the hip and knee angles. Males performed sidestep cuts more frequently than females. Females increased the incidence of sidestep cuts after prolonged activity. At the hip, a gender-cut type interaction existed for the transverse (p=0.001) and sagittal (p=0.11) planes. Females showed more internal rotation during sidestep and more external rotation and less flexion during crossover cuts. For the frontal plane, a gender-activity status interaction (p = 0.032) was due to no change within females but greater hip adduction during prolonged activity within males. With prolonged activity, both genders displayed less hip (p=0.29) and knee (p=0.009) flexion and more knee (p=0.001) adduction. Females displayed less hip and knee flexion than men (p=0.001). Sidestep may be more risky than crossover cuts. Both genders place themselves in at-risk postures with prolonged activity due to less hip and knee flexion. Copyright © 2015 Elsevier B.V. All rights reserved.

Combinatorial approximation algorithms for MAXCUT using random walks.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Seshadhri, Comandur; Kale, Satyen

We give the first combinatorial approximation algorithm for MaxCut that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, and easily described. It essentially performs a number of random walks and aggregates the information to provide the partition. We can control the running time to get an approximation factor-running time tradeoff. We show that for any constant b > 1.5, there is an {tilde O}(n{sup b}) algorithm that outputs a (0.5 + {delta})-approximation for MaxCut, where {delta} = {delta}(b) is some positive constant. One of the components of our algorithm is a weakmore » local graph partitioning procedure that may be of independent interest. Given a starting vertex i and a conductance parameter {phi}, unless a random walk of length {ell} = O(log n) starting from i mixes rapidly (in terms of {phi} and {ell}), we can find a cut of conductance at most {phi} close to the vertex. The work done per vertex found in the cut is sublinear in n.« less

[Evaluation of three methods for constructing craniofacial mid-sagittal plane based on the cone beam computed tomography].

PubMed

Wang, S W; Li, M; Yang, H F; Zhao, Y J; Wang, Y; Liu, Y

2016-04-18

To compare the accuracyof interactive closet point (ICP) algorithm, Procrustes analysis (PA) algorithm,and a landmark-independent method to construct the mid-sagittal plane (MSP) of the cone beam computed tomography.To provide theoretical basis for establishing coordinate systemof CBCT images and symmetric analysis. Ten patients were selected and scanned by CBCT before orthodontic treatment.The scan data was imported into Mimics 10.0 to reconstructthree dimensional skulls.And the MSP of each skull was generated by ICP algorithm, PA algorithm and landmark-independent method. MSP extracted by ICP algorithm or PA algorithm involvedthree steps. First, the 3D skull processing was performed by reverse engineering software geomagic studio 2012 to obtain the mirror skull. Then, the original and its mirror skull was registered separately by ICP algorithm in geomagic studio 2012 and PA algorithm in NX Imageware 11.0. Finally, the registered data were united into new data to calculate the MSP of the originaldata in geomagic studio 2012. The mid-sagittal plane was determined by SELLA (S), nasion (N), basion (Ba) as traditional landmark-dependent methodconducted in software InVivoDental 5.0. The distance from 9 pairs of symmetric anatomical marked points to three sagittal plane were measured and calculated to compare the differences of the absolute value. The one-way ANOVA test was used to analyze the variable differences among the 3 MSPs. The pairwise comparison was performed with LSD method. MSPs calculated by the three methods were available for clinic analysis, which could be concluded from the front view.However, there was significant differences among the distances from the 9 pairs of symmetric anatomical marked points to the MSPs (F=10.932,P=0.001).LSD test showed there was no significant difference between the ICP algorithm and landmark-independent method (P=0.11), while there was significant difference between the PA algorithm and landmark-independent methods (P=0.01) . Mid-sagittal plane of 3D skulls could be generated base on ICP algorithm or PA algorithm. There was no significant difference between the ICP algorithm and landmark-independent method. For the subjects with no evident asymmetry, ICP algorithm is feasible in clinical analysis.

Acceleration of planes segmentation using normals from previous frame

NASA Astrophysics Data System (ADS)

Gritsenko, Pavel; Gritsenko, Igor; Seidakhmet, Askar; Abduraimov, Azizbek

2017-12-01

One of the major problem in integration process of robots is to make them able to function in a human environment. In terms of computer vision, the major feature of human made rooms is the presence of planes [1, 2, 20, 21, 23]. In this article, we will present an algorithm dedicated to increase speed of a plane segmentation. The algorithm uses information about location of a plane and its normal vector to speed up the segmentation process in the next frame. In conjunction with it, we will address such aspects of ICP SLAM as performance and map representation.

A reconstruction algorithm for helical CT imaging on PI-planes.

PubMed

Liang, Hongzhu; Zhang, Cishen; Yan, Ming

2006-01-01

In this paper, a Feldkamp type approximate reconstruction algorithm is presented for helical cone-beam Computed Tomography. To effectively suppress artifacts due to large cone angle scanning, it is proposed to reconstruct the object point-wisely on unique customized tilted PI-planes which are close to the data collecting helices of the corresponding points. Such a reconstruction scheme can considerably suppress the artifacts in the cone-angle scanning. Computer simulations show that the proposed algorithm can provide improved imaging performance compared with the existing approximate cone-beam reconstruction algorithms.

A fast bottom-up algorithm for computing the cut sets of noncoherent fault trees

DOE Office of Scientific and Technical Information (OSTI.GOV)

Corynen, G.C.

1987-11-01

An efficient procedure for finding the cut sets of large fault trees has been developed. Designed to address coherent or noncoherent systems, dependent events, shared or common-cause events, the method - called SHORTCUT - is based on a fast algorithm for transforming a noncoherent tree into a quasi-coherent tree (COHERE), and on a new algorithm for reducing cut sets (SUBSET). To assure sufficient clarity and precision, the procedure is discussed in the language of simple sets, which is also developed in this report. Although the new method has not yet been fully implemented on the computer, we report theoretical worst-casemore » estimates of its computational complexity. 12 refs., 10 figs.« less

Variations in the short wavelength cut-off of the solar UV spectra.

PubMed

Parisi, A V; Turner, J

2006-03-01

Cloud and solar zenith angle (SZA) are two major factors that influence the magnitude of the biologically damaging UV (UVBD) irradiances for humans. However, the effect on the short wavelength cut-off due to SZA and due to clouds has not been investigated for biologically damaging UV for cataracts. This research aims to investigate the influence of cloud and SZA on the short wavelength cut-off of the spectral UVBD for cataracts. The spectral biologically damaging UV for cataracts on a horizontal plane was calculated by weighting the spectral UV measured with a spectroradiometer with the action spectrum for the induction of cataracts in a porcine lens. The UV spectra were obtained on an unshaded plane at a latitude of 29.5 degrees S. The cut-off wavelength (lambdac) was defined as the wavelength at which the biologically damaging spectral irradiance was 0.1% of the maximum biologically damaging irradiance for that scan. For the all sky conditions, the short wavelength cut-off ranged by 12 nm for the SZA range of 5 to 80 degrees and the maximum in the spectral UVBD ranged by 15 nm. Similarly, for the cloud free cases, the short wavelength cut-off ranged by 9 nm for the same SZA range. Although, cloud has a large influence on the magnitude of the biologically damaging UV for cataracts, the influence of cloud on the short wavelength cut-off for the biologically damaging UV for cataracts is less than the influence of the solar zenith angle.

Document segmentation via oblique cuts

NASA Astrophysics Data System (ADS)

Svendsen, Jeremy; Branzan-Albu, Alexandra

2013-01-01

This paper presents a novel solution for the layout segmentation of graphical elements in Business Intelligence documents. We propose a generalization of the recursive X-Y cut algorithm, which allows for cutting along arbitrary oblique directions. An intermediate processing step consisting of line and solid region removal is also necessary due to presence of decorative elements. The output of the proposed segmentation is a hierarchical structure which allows for the identification of primitives in pie and bar charts. The algorithm was tested on a database composed of charts from business documents. Results are very promising.

Cutting Solid Figures by Plane--Analytical Solution and Spreadsheet Implementation

ERIC Educational Resources Information Center

Benacka, Jan

2012-01-01

In some secondary mathematics curricula, there is a topic called Stereometry that deals with investigating the position and finding the intersection, angle, and distance of lines and planes defined within a prism or pyramid. Coordinate system is not used. The metric tasks are solved using Pythagoras' theorem, trigonometric functions, and sine and…

75 FR 27991 - Notice of Petitions by Firms for Determination of Eligibility To Apply for Trade Adjustment...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-05-19

..., varnish, glue, inlay, sawing, planing, sanding equipment. Process: Plane and sand wood, cut wood pieces, do inlay, glue, sand, stain, varnish, add hardware, inspect, ship. Sioux Corporation One Sioux Plaza.... Quality Rolling & Deburring Inc....... 135 South Main Street, 5/5/2010 Quality Rolling & Deburring...

Linearized motion estimation for articulated planes.

PubMed

Datta, Ankur; Sheikh, Yaser; Kanade, Takeo

2011-04-01

In this paper, we describe the explicit application of articulation constraints for estimating the motion of a system of articulated planes. We relate articulations to the relative homography between planes and show that these articulations translate into linearized equality constraints on a linear least-squares system, which can be solved efficiently using a Karush-Kuhn-Tucker system. The articulation constraints can be applied for both gradient-based and feature-based motion estimation algorithms and to illustrate this, we describe a gradient-based motion estimation algorithm for an affine camera and a feature-based motion estimation algorithm for a projective camera that explicitly enforces articulation constraints. We show that explicit application of articulation constraints leads to numerically stable estimates of motion. The simultaneous computation of motion estimates for all of the articulated planes in a scene allows us to handle scene areas where there is limited texture information and areas that leave the field of view. Our results demonstrate the wide applicability of the algorithm in a variety of challenging real-world cases such as human body tracking, motion estimation of rigid, piecewise planar scenes, and motion estimation of triangulated meshes.

Development of adaptive noise reduction filter algorithm for pediatric body images in a multi-detector CT

NASA Astrophysics Data System (ADS)

Nishimaru, Eiji; Ichikawa, Katsuhiro; Okita, Izumi; Ninomiya, Yuuji; Tomoshige, Yukihiro; Kurokawa, Takehiro; Ono, Yutaka; Nakamura, Yuko; Suzuki, Masayuki

2008-03-01

Recently, several kinds of post-processing image filters which reduce the noise of computed tomography (CT) images have been proposed. However, these image filters are mostly for adults. Because these are not very effective in small (< 20 cm) display fields of view (FOV), we cannot use them for pediatric body images (e.g., premature babies and infant children). We have developed a new noise reduction filter algorithm for pediatric body CT images. This algorithm is based on a 3D post-processing in which the output pixel values are calculated by nonlinear interpolation in z-directions on original volumetric-data-sets. This algorithm does not need the in-plane (axial plane) processing, so the spatial resolution does not change. From the phantom studies, our algorithm could reduce SD up to 40% without affecting the spatial resolution of x-y plane and z-axis, and improved the CNR up to 30%. This newly developed filter algorithm will be useful for the diagnosis and radiation dose reduction of the pediatric body CT images.

Visualizing Time-Varying Phenomena In Numerical Simulations Of Unsteady Flows

NASA Technical Reports Server (NTRS)

Lane, David A.

1996-01-01

Streamlines, contour lines, vector plots, and volume slices (cutting planes) are commonly used for flow visualization. These techniques are sometimes referred to as instantaneous flow visualization techniques because calculations are based on an instant of the flowfield in time. Although instantaneous flow visualization techniques are effective for depicting phenomena in steady flows,they sometimes do not adequately depict time-varying phenomena in unsteady flows. Streaklines and timelines are effective visualization techniques for depicting vortex shedding, vortex breakdown, and shock waves in unsteady flows. These techniques are examples of time-dependent flow visualization techniques, which are based on many instants of the flowfields in time. This paper describes the algorithms for computing streaklines and timelines. Using numerically simulated unsteady flows, streaklines and timelines are compared with streamlines, contour lines, and vector plots. It is shown that streaklines and timelines reveal vortex shedding and vortex breakdown more clearly than instantaneous flow visualization techniques.

Aeroballistics of Corkscrew Projectiles

DTIC Science & Technology

1978-06-01

obtained by cutting a solid cylinder with a series of six skewed planes to obtain the con- figuration shown in Figure 1. Three skewed planes form the...respect to the cylinder centerline can be varied; however, the angles of the three. nose planes must be the same as well as the angles of the three...b) At low angles of attack, the Magnus forces and moments are small at all spin rates near the configuration twist. This is due to the zero spin

Efficient algorithm for locating and sizing series compensation devices in large power transmission grids: I. Model implementation

NASA Astrophysics Data System (ADS)

Frolov, Vladimir; Backhaus, Scott; Chertkov, Misha

2014-10-01

We explore optimization methods for planning the placement, sizing and operations of flexible alternating current transmission system (FACTS) devices installed to relieve transmission grid congestion. We limit our selection of FACTS devices to series compensation (SC) devices that can be represented by modification of the inductance of transmission lines. Our master optimization problem minimizes the l1 norm of the inductance modification subject to the usual line thermal-limit constraints. We develop heuristics that reduce this non-convex optimization to a succession of linear programs (LP) that are accelerated further using cutting plane methods. The algorithm solves an instance of the MatPower Polish Grid model (3299 lines and 2746 nodes) in 40 seconds per iteration on a standard laptop—a speed that allows the sizing and placement of a family of SC devices to correct a large set of anticipated congestions. We observe that our algorithm finds feasible solutions that are always sparse, i.e., SC devices are placed on only a few lines. In a companion manuscript, we demonstrate our approach on realistically sized networks that suffer congestion from a range of causes, including generator retirement. In this manuscript, we focus on the development of our approach, investigate its structure on a small test system subject to congestion from uniform load growth, and demonstrate computational efficiency on a realistically sized network.

Efficient algorithm for locating and sizing series compensation devices in large power transmission grids: I. Model implementation

DOE PAGES

Frolov, Vladimir; Backhaus, Scott; Chertkov, Misha

2014-10-24

We explore optimization methods for planning the placement, sizing and operations of Flexible Alternating Current Transmission System (FACTS) devices installed to relieve transmission grid congestion. We limit our selection of FACTS devices to Series Compensation (SC) devices that can be represented by modification of the inductance of transmission lines. Our master optimization problem minimizes the l 1 norm of the inductance modification subject to the usual line thermal-limit constraints. We develop heuristics that reduce this non-convex optimization to a succession of Linear Programs (LP) which are accelerated further using cutting plane methods. The algorithm solves an instance of the MatPowermore » Polish Grid model (3299 lines and 2746 nodes) in 40 seconds per iteration on a standard laptop—a speed up that allows the sizing and placement of a family of SC devices to correct a large set of anticipated congestions. We observe that our algorithm finds feasible solutions that are always sparse, i.e., SC devices are placed on only a few lines. In a companion manuscript, we demonstrate our approach on realistically-sized networks that suffer congestion from a range of causes including generator retirement. In this manuscript, we focus on the development of our approach, investigate its structure on a small test system subject to congestion from uniform load growth, and demonstrate computational efficiency on a realistically-sized network.« less

Flux cutting in high- T c superconductors

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vlasko-Vlasov, V.; Koshelev, A.; Glatz, A.

We performed magneto-optical study of flux distributions in a YBCO crystal under various applied crossed- field orientations to elucidate the complex nature of magnetic flux cutting in superconductors. Our study reveals unusual vortex patterns induced by the interplay between flux-cutting and vortex pinning. We observe strong flux penetration anisotropy of the normal flux B⊥ in the presence of an in-plane field H|| and associate the modified flux dynamics with staircase structure of tilted vortices in YBCO and the flux-cutting process. We demonstrate that flux-cutting can effectively delay vortex entry in the direction transverse to H||. Finally, we elucidate details ofmore » the vortex-cutting and reconnection process using time-dependent Ginzburg-Landau simulations.« less

Approximate ground states of the random-field Potts model from graph cuts

NASA Astrophysics Data System (ADS)

Kumar, Manoj; Kumar, Ravinder; Weigel, Martin; Banerjee, Varsha; Janke, Wolfhard; Puri, Sanjay

2018-05-01

While the ground-state problem for the random-field Ising model is polynomial, and can be solved using a number of well-known algorithms for maximum flow or graph cut, the analog random-field Potts model corresponds to a multiterminal flow problem that is known to be NP-hard. Hence an efficient exact algorithm is very unlikely to exist. As we show here, it is nevertheless possible to use an embedding of binary degrees of freedom into the Potts spins in combination with graph-cut methods to solve the corresponding ground-state problem approximately in polynomial time. We benchmark this heuristic algorithm using a set of quasiexact ground states found for small systems from long parallel tempering runs. For a not-too-large number q of Potts states, the method based on graph cuts finds the same solutions in a fraction of the time. We employ the new technique to analyze the breakup length of the random-field Potts model in two dimensions.

Investigation of the Effects of High-Intensity, Intermittent Exercise and Unanticipation on Trunk and Lower Limb Biomechanics During a Side-Cutting Maneuver Using Statistical Parametric Mapping.

PubMed

Whyte, Enda F; Richter, Chris; OʼConnor, Siobhan; Moran, Kieran A

2018-06-01

Whyte, EF, Richter, C, O'Connor, S, and Moran, KA. Investigation of the effects of high-intensity, intermittent exercise and unanticipation on trunk and lower limb biomechanics during a side-cutting maneuver using statistical parametric mapping. J Strength Cond Res 32(6): 1583-1593, 2018-Anterior cruciate ligament (ACL) injuries frequently occur during side-cutting maneuvers when fatigued or reacting to the sporting environment. Trunk and hip biomechanics are proposed to influence ACL loading during these activities. However, the effects of fatigue and unanticipation on the biomechanics of the kinetic chain may be limited by traditional discrete point analysis. We recruited 28 male, varsity, Gaelic footballers (21.7 ± 2.2 years; 178.7 ± 14.6 m; 81.8 ± 11.4 kg) to perform anticipated and unanticipated side-cutting maneuvers before and after a high-intensity, intermittent exercise protocol (HIIP). Statistical parametric mapping (repeated-measures analysis of varience) identified differences in phases of trunk and stance leg biomechanics during weight acceptance. Unanticipation resulted in less trunk flexion (p < 0.001) and greater side flexion away from the direction of cut (p < 0.001). This led to smaller (internal) knee flexor and greater (internal) knee extensor (p = 0.002-0.007), hip adductor (p = 0.005), and hip external rotator (p = 0.007) moments. The HIIP resulted in increased trunk flexion (p < 0.001) and side flexion away from the direction of cut (p = 0.038), resulting in smaller (internal) knee extensor moments (p = 0.006). One interaction effect was noted demonstrating greater hip extensor moments in the unanticipated condition post-HIIP (p = 0.025). Results demonstrate that unanticipation resulted in trunk kinematics considered an ACL injury risk factor. A subsequent increase in frontal and transverse plane hip loading and sagittal plane knee loading was observed, which may increase ACL strain. Conversely, HIIP-induced trunk kinematic alterations resulted in reduced sagittal plane knee and subsequent ACL loading. Therefore, adequate hip and knee control is important during unanticipated side-cutting maneuvers.

Discovering shared segments on the migration route of the bar-headed goose by time-based plane-sweeping trajectory clustering

USGS Publications Warehouse

Luo, Ze; Baoping, Yan; Takekawa, John Y.; Prosser, Diann J.

2012-01-01

We propose a new method to help ornithologists and ecologists discover shared segments on the migratory pathway of the bar-headed geese by time-based plane-sweeping trajectory clustering. We present a density-based time parameterized line segment clustering algorithm, which extends traditional comparable clustering algorithms from temporal and spatial dimensions. We present a time-based plane-sweeping trajectory clustering algorithm to reveal the dynamic evolution of spatial-temporal object clusters and discover common motion patterns of bar-headed geese in the process of migration. Experiments are performed on GPS-based satellite telemetry data from bar-headed geese and results demonstrate our algorithms can correctly discover shared segments of the bar-headed geese migratory pathway. We also present findings on the migratory behavior of bar-headed geese determined from this new analytical approach.

Can CT-based patient-matched instrumentation achieve consistent rotational alignment in knee arthroplasty?

PubMed

Tibesku, C O; Innocenti, B; Wong, P; Salehi, A; Labey, L

2012-02-01

Long-term success of contemporary total knee replacements relies to a large extent on proper implant alignment. This study was undertaken to test whether specimen-matched cutting blocks based on computed axial tomography (CT) scans could provide accurate rotational alignment of the femoral component. CT scans of five fresh frozen full leg cadaver specimens, equipped with infrared reflective markers, were used to produce a specimen-matched femoral cutting block. Using those blocks, the bone cuts were made to implant a bi-compartmental femoral component. Rotational alignment of the components in the horizontal plane was determined using an optical measurement system and compared with all relevant rotational reference axes identified on the CT scans. Average rotational alignment for the bi-compartmental component in the horizontal plane was 1.9° (range 0°-6.3°; standard deviation 2.6°). One specimen that showed the highest deviation from the planned alignment also featured a completely degraded medial articular surface. The CT-based specimen-matched cutting blocks achieved good rotational alignment accuracy except for one specimen with badly damaged cartilage. In such cases, imaging techniques that visualize the cartilage layer might be more suitable to design cutting blocks, as they will provide a better fit and increased surface support.

Axial calibration methods of piezoelectric load sharing dynamometer

NASA Astrophysics Data System (ADS)

Zhang, Jun; Chang, Qingbing; Ren, Zongjin; Shao, Jun; Wang, Xinlei; Tian, Yu

2018-06-01

The relationship between input and output of load sharing dynamometer is seriously non-linear in different loading points of a plane, so it's significant for accutately measuring force to precisely calibrate the non-linear relationship. In this paper, firstly, based on piezoelectric load sharing dynamometer, calibration experiments of different loading points are performed in a plane. And then load sharing testing system is respectively calibrated based on BP algorithm and ELM (Extreme Learning Machine) algorithm. Finally, the results show that the calibration result of ELM is better than BP for calibrating the non-linear relationship between input and output of loading sharing dynamometer in the different loading points of a plane, which verifies that ELM algorithm is feasible in solving force non-linear measurement problem.

High resolution beamforming on large aperture vertical line arrays: Processing synthetic data

NASA Astrophysics Data System (ADS)

Tran, Jean-Marie Q.; Hodgkiss, William S.

1990-09-01

This technical memorandum studies the beamforming of large aperture line arrays deployed vertically in the water column. The work concentrates on the use of high resolution techniques. Two processing strategies are envisioned: (1) full aperture coherent processing which offers in theory the best processing gain; and (2) subaperture processing which consists in extracting subapertures from the array and recombining the angular spectra estimated from these subarrays. The conventional beamformer, the minimum variance distortionless response (MVDR) processor, the multiple signal classification (MUSIC) algorithm and the minimum norm method are used in this study. To validate the various processing techniques, the ATLAS normal mode program is used to generate synthetic data which constitute a realistic signals environment. A deep-water, range-independent sound velocity profile environment, characteristic of the North-East Pacific, is being studied for two different 128 sensor arrays: a very long one cut for 30 Hz and operating at 20 Hz; and a shorter one cut for 107 Hz and operating at 100 Hz. The simulated sound source is 5 m deep. The full aperture and subaperture processing are being implemented with curved and plane wavefront replica vectors. The beamforming results are examined and compared to the ray-theory results produced by the generic sonar model.

Comparison of four methods of surface roughness assessment of corneal stromal bed after lamellar cutting

PubMed Central

Jumelle, Clotilde; Hamri, Alina; Egaud, Gregory; Mauclair, Cyril; Reynaud, Stephanie; Dumas, Virginie; Pereira, Sandrine; Garcin, Thibaud; Gain, Philippe; Thuret, Gilles

2017-01-01

Corneal lamellar cutting with a blade or femtosecond laser (FSL) is commonly used during refractive surgery and corneal grafts. Surface roughness of the cutting plane influences postoperative visual acuity but is difficult to assess reliably. For the first time, we compared chromatic confocal microscopy (CCM) with scanning electron microscopy, atomic force microscopy (AFM) and focus-variation microscopy (FVM) to characterize surfaces of variable roughness after FSL cutting. The small area allowed by AFM hinders conclusive roughness analysis, especially with irregular cuts. FVM does not always differentiate between smooth and rough surfaces. Finally, CCM allows analysis of large surfaces and differentiates between surface states. PMID:29188095

Contourlet domain multiband deblurring based on color correlation for fluid lens cameras.

PubMed

Tzeng, Jack; Liu, Chun-Chen; Nguyen, Truong Q

2010-10-01

Due to the novel fluid optics, unique image processing challenges are presented by the fluidic lens camera system. Developed for surgical applications, unique properties, such as no moving parts while zooming and better miniaturization than traditional glass optics, are advantages of the fluid lens. Despite these abilities, sharp color planes and blurred color planes are created by the nonuniform reaction of the liquid lens to different color wavelengths. Severe axial color aberrations are caused by this reaction. In order to deblur color images without estimating a point spread function, a contourlet filter bank system is proposed. Information from sharp color planes is used by this multiband deblurring method to improve blurred color planes. Compared to traditional Lucy-Richardson and Wiener deconvolution algorithms, significantly improved sharpness and reduced ghosting artifacts are produced by a previous wavelet-based method. Directional filtering is used by the proposed contourlet-based system to adjust to the contours of the image. An image is produced by the proposed method which has a similar level of sharpness to the previous wavelet-based method and has fewer ghosting artifacts. Conditions for when this algorithm will reduce the mean squared error are analyzed. While improving the blue color plane by using information from the green color plane is the primary focus of this paper, these methods could be adjusted to improve the red color plane. Many multiband systems such as global mapping, infrared imaging, and computer assisted surgery are natural extensions of this work. This information sharing algorithm is beneficial to any image set with high edge correlation. Improved results in the areas of deblurring, noise reduction, and resolution enhancement can be produced by the proposed algorithm.

Multiple sclerosis lesion segmentation using an automatic multimodal graph cuts.

PubMed

García-Lorenzo, Daniel; Lecoeur, Jeremy; Arnold, Douglas L; Collins, D Louis; Barillot, Christian

2009-01-01

Graph Cuts have been shown as a powerful interactive segmentation technique in several medical domains. We propose to automate the Graph Cuts in order to automatically segment Multiple Sclerosis (MS) lesions in MRI. We replace the manual interaction with a robust EM-based approach in order to discriminate between MS lesions and the Normal Appearing Brain Tissues (NABT). Evaluation is performed in synthetic and real images showing good agreement between the automatic segmentation and the target segmentation. We compare our algorithm with the state of the art techniques and with several manual segmentations. An advantage of our algorithm over previously published ones is the possibility to semi-automatically improve the segmentation due to the Graph Cuts interactive feature.

"Meniscus Sign" to Identify the Lenticule Edge in Small-Incision Lenticule Extraction.

PubMed

Titiyal, Jeewan S; Kaur, Manpreet; Brar, Anand S; Falera, Ruchita

2018-06-01

To describe our technique of lenticule edge identification in small-incision lenticule extraction using the "meniscus sign" to prevent lenticule misdissection. Femtosecond laser application for small-incision lenticule extraction was performed. A "double ring" was visible, signifying the edge of the cap cut (outer ring) and lenticule cut (inner ring). The anterior and posterior lamellar planes were delineated in 2 different directions. During creation of the posterior lamellar channel, the lenticule edge was slightly pushed away from the surgeon to create a gap between the inner ring (diameter of the lenticule cut) and the lenticule edge. The lenticule edge assumed a frilled wavy appearance, and the meniscus sign was observed as a gap between the lenticule edge and the inner ring. The meniscus-shaped gap served as a landmark to identify the lenticule edge, and the relationship between the frilled lenticule edge and surgical instruments further acted as a guide to identify the correct plane of dissection. This technique was successfully undertaken in 50 eyes of 25 patients. The meniscus sign was observed in all cases, and no case had cap lenticular adhesions. The meniscus sign helps to identify the lenticule edge and correct dissection planes and provides a visual landmark during the entire surgical procedure.

Analytic properties for the honeycomb lattice Green function at the origin

NASA Astrophysics Data System (ADS)

Joyce, G. S.

2018-05-01

The analytic properties of the honeycomb lattice Green function are investigated, where is a complex variable which lies in a plane. This double integral defines a single-valued analytic function provided that a cut is made along the real axis from w  =  ‑3 to . In order to analyse the behaviour of along the edges of the cut it is convenient to define the limit function where . It is shown that and can be evaluated exactly for all in terms of various hypergeometric functions, where the argument function is always real-valued and rational. The second-order linear Fuchsian differential equation satisfied by is also used to derive series expansions for and which are valid in the neighbourhood of the regular singular points and . Integral representations are established for and , where with . In particular, it is proved that where J 0(z) and Y 0(z) denote Bessel functions of the first and second kind, respectively. The results derived in the paper are utilized to evaluate the associated logarithmic integral where w lies in the cut plane. A new set of orthogonal polynomials which are connected with the honeycomb lattice Green function are also briefly discussed. Finally, a link between and the theory of Pearson random walks in a plane is established.

2008 Program of Study: Perspectives and Challenges in GFD (Geophysical Fluid Dynamics)

DTIC Science & Technology

2009-03-01

half of the complex k- plane , and Φ− is similarly well defined in the lower half of 338 PSfrag replacements Im k Re k−i +i Figure 2: Branch cuts in...domains ⊕ and , which include, respectively, the upper and lower half k- planes . The full Fourier transform of φ (and of h, d, etc.) is then well defined in...contour at infinity in the lower half k- plane ; the solution will only contain waves arising from poles located in the

Hip and Wrist Accelerometer Algorithms for Free-Living Behavior Classification.

PubMed

Ellis, Katherine; Kerr, Jacqueline; Godbole, Suneeta; Staudenmayer, John; Lanckriet, Gert

2016-05-01

Accelerometers are a valuable tool for objective measurement of physical activity (PA). Wrist-worn devices may improve compliance over standard hip placement, but more research is needed to evaluate their validity for measuring PA in free-living settings. Traditional cut-point methods for accelerometers can be inaccurate and need testing in free living with wrist-worn devices. In this study, we developed and tested the performance of machine learning (ML) algorithms for classifying PA types from both hip and wrist accelerometer data. Forty overweight or obese women (mean age = 55.2 ± 15.3 yr; BMI = 32.0 ± 3.7) wore two ActiGraph GT3X+ accelerometers (right hip, nondominant wrist; ActiGraph, Pensacola, FL) for seven free-living days. Wearable cameras captured ground truth activity labels. A classifier consisting of a random forest and hidden Markov model classified the accelerometer data into four activities (sitting, standing, walking/running, and riding in a vehicle). Free-living wrist and hip ML classifiers were compared with each other, with traditional accelerometer cut points, and with an algorithm developed in a laboratory setting. The ML classifier obtained average values of 89.4% and 84.6% balanced accuracy over the four activities using the hip and wrist accelerometer, respectively. In our data set with average values of 28.4 min of walking or running per day, the ML classifier predicted average values of 28.5 and 24.5 min of walking or running using the hip and wrist accelerometer, respectively. Intensity-based cut points and the laboratory algorithm significantly underestimated walking minutes. Our results demonstrate the superior performance of our PA-type classification algorithm, particularly in comparison with traditional cut points. Although the hip algorithm performed better, additional compliance achieved with wrist devices might justify using a slightly lower performing algorithm.

Accuracy in planar cutting of bones: an ISO-based evaluation.

PubMed

Cartiaux, Olivier; Paul, Laurent; Docquier, Pierre-Louis; Francq, Bernard G; Raucent, Benoît; Dombre, Etienne; Banse, Xavier

2009-03-01

Computer- and robot-assisted technologies are capable of improving the accuracy of planar cutting in orthopaedic surgery. This study is a first step toward formulating and validating a new evaluation methodology for planar bone cutting, based on the standards from the International Organization for Standardization. Our experimental test bed consisted of a purely geometrical model of the cutting process around a simulated bone. Cuts were performed at three levels of surgical assistance: unassisted, computer-assisted and robot-assisted. We measured three parameters of the standard ISO1101:2004: flatness, parallelism and location of the cut plane. The location was the most relevant parameter for assessing cutting errors. The three levels of assistance were easily distinguished using the location parameter. Our ISO methodology employs the location to obtain all information about translational and rotational cutting errors. Location may be used on any osseous structure to compare the performance of existing assistance technologies.

Close coupling of pre- and post-processing vision stations using inexact algorithms

NASA Astrophysics Data System (ADS)

Shih, Chi-Hsien V.; Sherkat, Nasser; Thomas, Peter D.

1996-02-01

Work has been reported using lasers to cut deformable materials. Although the use of laser reduces material deformation, distortion due to mechanical feed misalignment persists. Changes in the lace patten are also caused by the release of tension in the lace structure as it is cut. To tackle the problem of distortion due to material flexibility, the 2VMethod together with the Piecewise Error Compensation Algorithm incorporating the inexact algorithms, i.e., fuzzy logic, neural networks and neural fuzzy technique, are developed. A spring mounted pen is used to emulate the distortion of the lace pattern caused by tactile cutting and feed misalignment. Using pre- and post-processing vision systems, it is possible to monitor the scalloping process and generate on-line information for the artificial intelligence engines. This overcomes the problems of lace distortion due to the trimming process. Applying the algorithms developed, the system can produce excellent results, much better than a human operator.

Influence of the Regime of Electropulsing-Assisted Machining on the Plastic Deformation of the Layer Being Cut.

PubMed

Hameed, Saqib; González Rojas, Hernán A; Perat Benavides, José I; Nápoles Alberro, Amelia; Sánchez Egea, Antonio J

2018-05-25

In this article, the influence of electropulsing on the machinability of steel S235 and aluminium 6060 has been studied during conventional and electropulsing-assisted turning processes. The machinability indices such as chip compression ratio ξ , shear plane angle ϕ and specific cutting energy (SCE) are investigated by using different cutting parameters such as cutting speed, cutting feed and depth of cut during electrically-assisted turning process. The results and analysis of this work indicated that the electrically-assisted turning process improves the machinability of steel S235, whereas the machinability of aluminium 6060 gets worse. Finally, due to electropluses (EPs), the chip compression ratio ξ increases with the increase in cutting speed during turning of aluminium 6060 and the SCE decreases during turning of steel S235.

Analytical investigation of the dynamics of tethered constellations in Earth orbit, phase 2

NASA Astrophysics Data System (ADS)

Lorenzini, E. C.; Arnold, D. A.; Cosmo, M.; Grossi, M. D.

1986-10-01

The following topics related to the dynamics of the 4-mass tethered system are addressed: (1) the development of damping algorithms for damping the out-of-plane libration of the system and the interaction of the out-of-plane control with the other degrees of freedom; and (2) the development of environmental models to be added to the dynamics simulation computer code. The environmental models are specifically a new drag routine based on the Jacchia's 1977 model, a J(2) model and an accurate thermal model of the wire. Regarding topic (1) a survey of various out-of-plane libration control laws was carried out. Consequently a yo-yo control law with amplitude of the tether length variation proportional to the amplitude of the out-of-game libration has been selected. This control law provides good damping when applied to a (theoretical) two-dimensional system. In the actual 3-dimensional 4-mass tethered system, however, energy is transferred to the least damped degrees of freedom (the out-of-plane lateral deflections are still undamped in the present simulations) in such a way as to decrease the effectiveness of the algorithm for out-of-plane libration control. The addition of damping algorithms for the out-of-plane lateral deflections is therefore necessary.

Analytical investigation of the dynamics of tethered constellations in Earth orbit, phase 2

NASA Technical Reports Server (NTRS)

Lorenzini, E. C.; Arnold, D. A.; Cosmo, M.; Grossi, M. D.

1986-01-01

The following topics related to the dynamics of the 4-mass tethered system are addressed: (1) the development of damping algorithms for damping the out-of-plane libration of the system and the interaction of the out-of-plane control with the other degrees of freedom; and (2) the development of environmental models to be added to the dynamics simulation computer code. The environmental models are specifically a new drag routine based on the Jacchia's 1977 model, a J(2) model and an accurate thermal model of the wire. Regarding topic (1) a survey of various out-of-plane libration control laws was carried out. Consequently a yo-yo control law with amplitude of the tether length variation proportional to the amplitude of the out-of-game libration has been selected. This control law provides good damping when applied to a (theoretical) two-dimensional system. In the actual 3-dimensional 4-mass tethered system, however, energy is transferred to the least damped degrees of freedom (the out-of-plane lateral deflections are still undamped in the present simulations) in such a way as to decrease the effectiveness of the algorithm for out-of-plane libration control. The addition of damping algorithms for the out-of-plane lateral deflections is therefore necessary.

A Plane Target Detection Algorithm in Remote Sensing Images based on Deep Learning Network Technology

NASA Astrophysics Data System (ADS)

Shuxin, Li; Zhilong, Zhang; Biao, Li

2018-01-01

Plane is an important target category in remote sensing targets and it is of great value to detect the plane targets automatically. As remote imaging technology developing continuously, the resolution of the remote sensing image has been very high and we can get more detailed information for detecting the remote sensing targets automatically. Deep learning network technology is the most advanced technology in image target detection and recognition, which provided great performance improvement in the field of target detection and recognition in the everyday scenes. We combined the technology with the application in the remote sensing target detection and proposed an algorithm with end to end deep network, which can learn from the remote sensing images to detect the targets in the new images automatically and robustly. Our experiments shows that the algorithm can capture the feature information of the plane target and has better performance in target detection with the old methods.

Geometrical analysis of circular-cut spiral bevel gears

NASA Technical Reports Server (NTRS)

Huston, R. L.

1983-01-01

Geometrical studies of circular cut spiral bevel gears are reported. Tooth profile changes heel to toe are studied in the transverse plane. Pressure angle changes are determined. The radiuses of curvature of the tooth surfaces generated by various cutter profiles are also determined. The consequences of cutter profile changes are explored. Crown gears are emphasized and the implications for conical gears are discussed.

Computer-assisted oblique single-cut rotation osteotomy to reduce a multidirectional tibia deformity: case report.

PubMed

Dobbe, J G G; du Pré, K J; Blankevoort, L; Streekstra, G J; Kloen, P

2017-08-01

The correction of multiplanar deformity is challenging. We describe preoperative 3-D planning and treatment of a complex tibia malunion using an oblique single-cut rotation osteotomy to correct deformity parameters in the sagittal, coronal and transverse plane. At 5 years postoperatively, the patient ambulates without pain with a well-aligned leg.

Thermal lensing and microchip laser performance of N g-cut Tm3+:KY(WO4)2 crystal

NASA Astrophysics Data System (ADS)

Gaponenko, M. S.; Loiko, P. A.; Gusakova, N. V.; Yumashev, K. V.; Kuleshov, N. V.; Pavlyuk, A. A.

2012-09-01

The thermal lensing effect was characterized in the diode-pumped monoclinic N g-cut Tm:KYW crystal under laser operation conditions at the wavelength of 1.94 μm. The thermal lens was found to be slightly astigmatic; its optical power D being positive for rays lying in all meridional planes. Thermal lens sensitivity factors M= dD/ dP abs equal 11.8 m-1/W and 8.8 m-1/W (with respect to the absorbed pump power P abs) for principal meridional planes containing N p and N m axes. Nearly athermal behavior of N g-cut crystal is associated with the mutual compensation of different impacts to the thermal lens optical power that arise from temperature dependence of the refractive index dn/ dT and anisotropic thermal expansion. It was utilized to produce passively cooled diode-pumped 0.65 W cw Tm:KYW microchip laser with slope efficiency of 44 % and low thermo-optic aberrations.

Variation of Shrinkage Strain within the Depth of Concrete Beams.

PubMed

Jeong, Jong-Hyun; Park, Yeong-Seong; Lee, Yong-Hak

2015-11-16

The variation of shrinkage strain within beam depth was examined through four series of time-dependent laboratory experiments on unreinforced concrete beam specimens. Two types of beam specimens, horizontally cast and vertically cast, were tested; shrinkage variation was observed in the horizontally cast specimens. This indicated that the shrinkage variation within the beam depth was due to water bleeding and tamping during the placement of the fresh concrete. Shrinkage strains were measured within the beam depth by two types of strain gages, surface-attached and embedded. The shrinkage strain distribution within the beam depth showed a consistent tendency for the two types of gages. The test beams were cut into four sections after completion of the test, and the cutting planes were divided into four equal sub-areas to measure the aggregate concentration for each sub-area of the cutting plane. The aggregate concentration increased towards the bottom of the beam. The shrinkage strain distribution was estimated by Hobbs' equation, which accounts for the change of aggregate volume concentration.

Variation of Shrinkage Strain within the Depth of Concrete Beams

PubMed Central

Jeong, Jong-Hyun; Park, Yeong-Seong; Lee, Yong-Hak

2015-01-01

The variation of shrinkage strain within beam depth was examined through four series of time-dependent laboratory experiments on unreinforced concrete beam specimens. Two types of beam specimens, horizontally cast and vertically cast, were tested; shrinkage variation was observed in the horizontally cast specimens. This indicated that the shrinkage variation within the beam depth was due to water bleeding and tamping during the placement of the fresh concrete. Shrinkage strains were measured within the beam depth by two types of strain gages, surface-attached and embedded. The shrinkage strain distribution within the beam depth showed a consistent tendency for the two types of gages. The test beams were cut into four sections after completion of the test, and the cutting planes were divided into four equal sub-areas to measure the aggregate concentration for each sub-area of the cutting plane. The aggregate concentration increased towards the bottom of the beam. The shrinkage strain distribution was estimated by Hobbs’ equation, which accounts for the change of aggregate volume concentration. PMID:28793677

Optimization of cutting parameters for machining time in turning process

NASA Astrophysics Data System (ADS)

Mavliutov, A. R.; Zlotnikov, E. G.

2018-03-01

This paper describes the most effective methods for nonlinear constraint optimization of cutting parameters in the turning process. Among them are Linearization Programming Method with Dual-Simplex algorithm, Interior Point method, and Augmented Lagrangian Genetic Algorithm (ALGA). Every each of them is tested on an actual example – the minimization of production rate in turning process. The computation was conducted in the MATLAB environment. The comparative results obtained from the application of these methods show: The optimal value of the linearized objective and the original function are the same. ALGA gives sufficiently accurate values, however, when the algorithm uses the Hybrid function with Interior Point algorithm, the resulted values have the maximal accuracy.

Biased normalized cuts for target detection in hyperspectral imagery

NASA Astrophysics Data System (ADS)

Zhang, Xuewen; Dorado-Munoz, Leidy P.; Messinger, David W.; Cahill, Nathan D.

2016-05-01

The Biased Normalized Cuts (BNC) algorithm is a useful technique for detecting targets or objects in RGB imagery. In this paper, we propose modifying BNC for the purpose of target detection in hyperspectral imagery. As opposed to other target detection algorithms that typically encode target information prior to dimensionality reduction, our proposed algorithm encodes target information after dimensionality reduction, enabling a user to detect different targets in interactive mode. To assess the proposed BNC algorithm, we utilize hyperspectral imagery (HSI) from the SHARE 2012 data campaign, and we explore the relationship between the number and the position of expert-provided target labels and the precision/recall of the remaining targets in the scene.

Description and performance analysis of a generalized optimal algorithm for aerobraking guidance

NASA Technical Reports Server (NTRS)

Evans, Steven W.; Dukeman, Greg A.

1993-01-01

A practical real-time guidance algorithm has been developed for aerobraking vehicles which nearly minimizes the maximum heating rate, the maximum structural loads, and the post-aeropass delta V requirement for orbit insertion. The algorithm is general and reusable in the sense that a minimum of assumptions are made, thus greatly reducing the number of parameters that must be determined prior to a given mission. A particularly interesting feature is that in-plane guidance performance is tuned by adjusting one mission-dependent, the bank margin; similarly, the out-of-plane guidance performance is tuned by adjusting a plane controller time constant. Other features of the algorithm are simplicity, efficiency and ease of use. The trimmed vehicle with bank angle modulation as the method of trajectory control. Performance of this guidance algorithm is examined by its use in an aerobraking testbed program. The performance inquiry extends to a wide range of entry speeds covering a number of potential mission applications. Favorable results have been obtained with a minimum of development effort, and directions for improvement of performance are indicated.

Wave propagation in piezoelectric layered structures of film bulk acoustic resonators.

PubMed

Zhu, Feng; Qian, Zheng-Hua; Wang, Bin

2016-04-01

In this paper, we studied the wave propagation in a piezoelectric layered plate consisting of a piezoelectric thin film on an electroded elastic substrate with or without a driving electrode. Both plane-strain and anti-plane waves were taken into account for the sake of completeness. Numerical results on dispersion relations, cut-off frequencies and vibration distributions of selected modes were given. The effects of mass ratio of driving electrode layer to film layer on the dispersion curve patterns and cut-off frequencies of the plane-strain waves were discussed in detail. Results show that the mass ratio does not change the trend of dispersion curves but larger mass ratio lowers corresponding frequency at a fixed wave number and may extend the frequency range for energy trapping. Those results are of fundamental importance and can be used as a reference to develop effective two-dimensional plate equations for structural analysis and design of film bulk acoustic resonators. Copyright © 2016 Elsevier B.V. All rights reserved.

Miniaturized printed K shaped monopole antenna with truncated ground plane for 2.4/5.2/5.5/5.8 wireless lan applications

NASA Astrophysics Data System (ADS)

Chandan, Bharti, Gagandeep; Srivastava, Toolika; Rai, B. S.

2018-04-01

A novel truncated ground plane monopole antenna is proposed for wide band wireless local area network (WLAN) applications. The antenna contains a rectangular patch with a rectangular ring, a circular slot and a truncated ground plane printed on opposite sides of a low cost substrate FR4. The operating frequency bands for the antenna are band1 (2.4-2.88 GHz) and band 2 (4.8-6.3 GHz) with ≤ - 10 dB return loss which covers 2.4/5.2/5.5/5.8 GHz WLAN bands. The antenna is compact with overall dimension 26×40×0.8 mmł and with the dimension of patch 16×16×0.8 mm3. The two bands of antenna is obtained by cutting a rectangular ring and a circular slot in the patch and return loss is improved by cutting two rectangular slot in the ground plane. Performance measures of the antenna are shown in terms of return loss, current distribution, radiation pattern and gain. To verify the simulated results, the antenna is also fabricated and tested. The simulated and fabricated results have been found in good agreement.

A New Algorithm with Plane Waves and Wavelets for Random Velocity Fields with Many Spatial Scales

NASA Astrophysics Data System (ADS)

Elliott, Frank W.; Majda, Andrew J.

1995-03-01

A new Monte Carlo algorithm for constructing and sampling stationary isotropic Gaussian random fields with power-law energy spectrum, infrared divergence, and fractal self-similar scaling is developed here. The theoretical basis for this algorithm involves the fact that such a random field is well approximated by a superposition of random one-dimensional plane waves involving a fixed finite number of directions. In general each one-dimensional plane wave is the sum of a random shear layer and a random acoustical wave. These one-dimensional random plane waves are then simulated by a wavelet Monte Carlo method for a single space variable developed recently by the authors. The computational results reported in this paper demonstrate remarkable low variance and economical representation of such Gaussian random fields through this new algorithm. In particular, the velocity structure function for an imcorepressible isotropic Gaussian random field in two space dimensions with the Kolmogoroff spectrum can be simulated accurately over 12 decades with only 100 realizations of the algorithm with the scaling exponent accurate to 1.1% and the constant prefactor accurate to 6%; in fact, the exponent of the velocity structure function can be computed over 12 decades within 3.3% with only 10 realizations. Furthermore, only 46,592 active computational elements are utilized in each realization to achieve these results for 12 decades of scaling behavior.

Effect of planar cuts' orientation on the perceived surface layout and object's shape.

PubMed

Bocheva, Nadejda

2009-07-01

The effect of the orientation of the cutting planes producing planar curves over the surface of an object on its perceived pose and shape was investigated for line drawings representing three-dimensional objects. The results suggest that the orientational flow produced by the surface curves introduces an apparent object rotation in depth and in the image plane and changes in its perceived elongation. The apparent location of the nearest points is determined by the points of maximal view-dependent unsigned curvature of the surface curves. The data are discussed in relation to the interaction of the shape-from-silhouette system and shape-from-contour system and its effect on the interpretation of the surface contours with respect to the surface geometry.

Plane-Based Sampling for Ray Casting Algorithm in Sequential Medical Images

PubMed Central

Lin, Lili; Chen, Shengyong; Shao, Yan; Gu, Zichun

2013-01-01

This paper proposes a plane-based sampling method to improve the traditional Ray Casting Algorithm (RCA) for the fast reconstruction of a three-dimensional biomedical model from sequential images. In the novel method, the optical properties of all sampling points depend on the intersection points when a ray travels through an equidistant parallel plan cluster of the volume dataset. The results show that the method improves the rendering speed at over three times compared with the conventional algorithm and the image quality is well guaranteed. PMID:23424608

Optimal plane search method in blood flow measurements by magnetic resonance imaging

NASA Astrophysics Data System (ADS)

Bargiel, Pawel; Orkisz, Maciej; Przelaskowski, Artur; Piatkowska-Janko, Ewa; Bogorodzki, Piotr; Wolak, Tomasz

2004-07-01

This paper offers an algorithm for determining the blood flow parameters in the neck vessel segments using a single (optimal) measurement plane instead of the usual approach involving four planes orthogonal to the artery axis. This new approach aims at significantly shortening the time required to complete measurements using Nuclear Magnetic Resonance techniques. Based on a defined error function, the algorithm scans the solution space to find the minimum of the error function, and thus to determine a single plane characterized by a minimum measurement error, which allows for an accurate measurement of blood flow in the four carotid arteries. The paper also comprises a practical implementation of this method (as a module of a larger imaging-measuring system), including preliminary research results.

Performance of thigh-mounted triaxial accelerometer algorithms in objective quantification of sedentary behaviour and physical activity in older adults

PubMed Central

Verschueren, Sabine M. P.; Degens, Hans; Morse, Christopher I.; Onambélé, Gladys L.

2017-01-01

Accurate monitoring of sedentary behaviour and physical activity is key to investigate their exact role in healthy ageing. To date, accelerometers using cut-off point models are most preferred for this, however, machine learning seems a highly promising future alternative. Hence, the current study compared between cut-off point and machine learning algorithms, for optimal quantification of sedentary behaviour and physical activity intensities in the elderly. Thus, in a heterogeneous sample of forty participants (aged ≥60 years, 50% female) energy expenditure during laboratory-based activities (ranging from sedentary behaviour through to moderate-to-vigorous physical activity) was estimated by indirect calorimetry, whilst wearing triaxial thigh-mounted accelerometers. Three cut-off point algorithms and a Random Forest machine learning model were developed and cross-validated using the collected data. Detailed analyses were performed to check algorithm robustness, and examine and benchmark both overall and participant-specific balanced accuracies. This revealed that the four models can at least be used to confidently monitor sedentary behaviour and moderate-to-vigorous physical activity. Nevertheless, the machine learning algorithm outperformed the cut-off point models by being robust for all individual’s physiological and non-physiological characteristics and showing more performance of an acceptable level over the whole range of physical activity intensities. Therefore, we propose that Random Forest machine learning may be optimal for objective assessment of sedentary behaviour and physical activity in older adults using thigh-mounted triaxial accelerometry. PMID:29155839

Performance of thigh-mounted triaxial accelerometer algorithms in objective quantification of sedentary behaviour and physical activity in older adults.

PubMed

Wullems, Jorgen A; Verschueren, Sabine M P; Degens, Hans; Morse, Christopher I; Onambélé, Gladys L

2017-01-01

Accurate monitoring of sedentary behaviour and physical activity is key to investigate their exact role in healthy ageing. To date, accelerometers using cut-off point models are most preferred for this, however, machine learning seems a highly promising future alternative. Hence, the current study compared between cut-off point and machine learning algorithms, for optimal quantification of sedentary behaviour and physical activity intensities in the elderly. Thus, in a heterogeneous sample of forty participants (aged ≥60 years, 50% female) energy expenditure during laboratory-based activities (ranging from sedentary behaviour through to moderate-to-vigorous physical activity) was estimated by indirect calorimetry, whilst wearing triaxial thigh-mounted accelerometers. Three cut-off point algorithms and a Random Forest machine learning model were developed and cross-validated using the collected data. Detailed analyses were performed to check algorithm robustness, and examine and benchmark both overall and participant-specific balanced accuracies. This revealed that the four models can at least be used to confidently monitor sedentary behaviour and moderate-to-vigorous physical activity. Nevertheless, the machine learning algorithm outperformed the cut-off point models by being robust for all individual's physiological and non-physiological characteristics and showing more performance of an acceptable level over the whole range of physical activity intensities. Therefore, we propose that Random Forest machine learning may be optimal for objective assessment of sedentary behaviour and physical activity in older adults using thigh-mounted triaxial accelerometry.

Phase unwrapping with graph cuts optimization and dual decomposition acceleration for 3D high-resolution MRI data.

PubMed

Dong, Jianwu; Chen, Feng; Zhou, Dong; Liu, Tian; Yu, Zhaofei; Wang, Yi

2017-03-01

Existence of low SNR regions and rapid-phase variations pose challenges to spatial phase unwrapping algorithms. Global optimization-based phase unwrapping methods are widely used, but are significantly slower than greedy methods. In this paper, dual decomposition acceleration is introduced to speed up a three-dimensional graph cut-based phase unwrapping algorithm. The phase unwrapping problem is formulated as a global discrete energy minimization problem, whereas the technique of dual decomposition is used to increase the computational efficiency by splitting the full problem into overlapping subproblems and enforcing the congruence of overlapping variables. Using three dimensional (3D) multiecho gradient echo images from an agarose phantom and five brain hemorrhage patients, we compared this proposed method with an unaccelerated graph cut-based method. Experimental results show up to 18-fold acceleration in computation time. Dual decomposition significantly improves the computational efficiency of 3D graph cut-based phase unwrapping algorithms. Magn Reson Med 77:1353-1358, 2017. © 2016 International Society for Magnetic Resonance in Medicine. © 2016 International Society for Magnetic Resonance in Medicine.

Cut set-based risk and reliability analysis for arbitrarily interconnected networks

DOEpatents

Wyss, Gregory D.

2000-01-01

Method for computing all-terminal reliability for arbitrarily interconnected networks such as the United States public switched telephone network. The method includes an efficient search algorithm to generate minimal cut sets for nonhierarchical networks directly from the network connectivity diagram. Efficiency of the search algorithm stems in part from its basis on only link failures. The method also includes a novel quantification scheme that likewise reduces computational effort associated with assessing network reliability based on traditional risk importance measures. Vast reductions in computational effort are realized since combinatorial expansion and subsequent Boolean reduction steps are eliminated through analysis of network segmentations using a technique of assuming node failures to occur on only one side of a break in the network, and repeating the technique for all minimal cut sets generated with the search algorithm. The method functions equally well for planar and non-planar networks.

Nonuniformity correction algorithm with efficient pixel offset estimation for infrared focal plane arrays.

PubMed

Orżanowski, Tomasz

2016-01-01

This paper presents an infrared focal plane array (IRFPA) response nonuniformity correction (NUC) algorithm which is easy to implement by hardware. The proposed NUC algorithm is based on the linear correction scheme with the useful method of pixel offset correction coefficients update. The new approach to IRFPA response nonuniformity correction consists in the use of pixel response change determined at the actual operating conditions in relation to the reference ones by means of shutter to compensate a pixel offset temporal drift. Moreover, it permits to remove any optics shading effect in the output image as well. To show efficiency of the proposed NUC algorithm some test results for microbolometer IRFPA are presented.

Analysis of a new phase and height algorithm in phase measurement profilometry

NASA Astrophysics Data System (ADS)

Bian, Xintian; Zuo, Fen; Cheng, Ju

2018-04-01

Traditional phase measurement profilometry adopts divergent illumination to obtain the height distribution of a measured object accurately. However, the mapping relation between reference plane coordinates and phase distribution must be calculated before measurement. Data are then stored in a computer in the form of a data sheet for standby applications. This study improved the distribution of projected fringes and deducted the phase-height mapping algorithm when the two pupils of the projection and imaging systems are of unequal heights and when the projection and imaging axes are on different planes. With the algorithm, calculating the mapping relation between reference plane coordinates and phase distribution prior to measurement is unnecessary. Thus, the measurement process is simplified, and the construction of an experimental system is made easy. Computer simulation and experimental results confirm the effectiveness of the method.

Pattern-set generation algorithm for the one-dimensional multiple stock sizes cutting stock problem

NASA Astrophysics Data System (ADS)

Cui, Yaodong; Cui, Yi-Ping; Zhao, Zhigang

2015-09-01

A pattern-set generation algorithm (PSG) for the one-dimensional multiple stock sizes cutting stock problem (1DMSSCSP) is presented. The solution process contains two stages. In the first stage, the PSG solves the residual problems repeatedly to generate the patterns in the pattern set, where each residual problem is solved by the column-generation approach, and each pattern is generated by solving a single large object placement problem. In the second stage, the integer linear programming model of the 1DMSSCSP is solved using a commercial solver, where only the patterns in the pattern set are considered. The computational results of benchmark instances indicate that the PSG outperforms existing heuristic algorithms and rivals the exact algorithm in solution quality.

Discrimination methods of biological contamination on fresh-cut lettuce based on VNIR and NIR hyperspectral imaging

USDA-ARS?s Scientific Manuscript database

Multispectral imaging algorithms were developed using visible-near-infrared (VNIR) and near-infrared (NIR) hyperspectral imaging (HSI) techniques to detect worms on fresh-cut lettuce. The optimal wavebands that detect worm on fresh-cut lettuce for each type of HSI were investigated using the one-way...

High-luminosity primary vertex selection in top-quark studies using the Collider Detector at Fermilab

DOE Office of Scientific and Technical Information (OSTI.GOV)

Buzatu, Adrian; /McGill U.

2006-08-01

Improving our ability to identify the top quark pair (t{bar t}) primary vertex (PV) on an event-by-event basis is essential for many analyses in the lepton-plus-jets channel performed by the Collider Detector at Fermilab (CDF) Collaboration. We compare the algorithm currently used by CDF (A1) with another algorithm (A2) using Monte Carlo simulation at high instantaneous luminosities. We confirm that A1 is more efficient than A2 at selecting the t{bar t} PV at all PV multiplicities, both with efficiencies larger than 99%. Event selection rejects events with a distance larger than 5 cm along the proton beam between the t{barmore » t} PV and the charged lepton. We find flat distributions for the signal over background significance of this cut for all cut values larger than 1 cm, for all PV multiplicities and for both algorithms. We conclude that any cut value larger than 1 cm is acceptable for both algorithms under the Tevatron's expected instantaneous luminosity improvements.« less

IndeCut evaluates performance of network motif discovery algorithms.

PubMed

Ansariola, Mitra; Megraw, Molly; Koslicki, David

2018-05-01

Genomic networks represent a complex map of molecular interactions which are descriptive of the biological processes occurring in living cells. Identifying the small over-represented circuitry patterns in these networks helps generate hypotheses about the functional basis of such complex processes. Network motif discovery is a systematic way of achieving this goal. However, a reliable network motif discovery outcome requires generating random background networks which are the result of a uniform and independent graph sampling method. To date, there has been no method to numerically evaluate whether any network motif discovery algorithm performs as intended on realistically sized datasets-thus it was not possible to assess the validity of resulting network motifs. In this work, we present IndeCut, the first method to date that characterizes network motif finding algorithm performance in terms of uniform sampling on realistically sized networks. We demonstrate that it is critical to use IndeCut prior to running any network motif finder for two reasons. First, IndeCut indicates the number of samples needed for a tool to produce an outcome that is both reproducible and accurate. Second, IndeCut allows users to choose the tool that generates samples in the most independent fashion for their network of interest among many available options. The open source software package is available at https://github.com/megrawlab/IndeCut. megrawm@science.oregonstate.edu or david.koslicki@math.oregonstate.edu. Supplementary data are available at Bioinformatics online.

Morphological spot counting from stacked images for automated analysis of gene copy numbers by fluorescence in situ hybridization.

PubMed

Grigoryan, Artyom M; Dougherty, Edward R; Kononen, Juha; Bubendorf, Lukas; Hostetter, Galen; Kallioniemi, Olli

2002-01-01

Fluorescence in situ hybridization (FISH) is a molecular diagnostic technique in which a fluorescent labeled probe hybridizes to a target nucleotide sequence of deoxyribose nucleic acid. Upon excitation, each chromosome containing the target sequence produces a fluorescent signal (spot). Because fluorescent spot counting is tedious and often subjective, automated digital algorithms to count spots are desirable. New technology provides a stack of images on multiple focal planes throughout a tissue sample. Multiple-focal-plane imaging helps overcome the biases and imprecision inherent in single-focal-plane methods. This paper proposes an algorithm for global spot counting in stacked three-dimensional slice FISH images without the necessity of nuclei segmentation. It is designed to work in complex backgrounds, when there are agglomerated nuclei, and in the presence of illumination gradients. It is based on the morphological top-hat transform, which locates intensity spikes on irregular backgrounds. After finding signals in the slice images, the algorithm groups these together to form three-dimensional spots. Filters are employed to separate legitimate spots from fluorescent noise. The algorithm is set in a comprehensive toolbox that provides visualization and analytic facilities. It includes simulation software that allows examination of algorithm performance for various image and algorithm parameter settings, including signal size, signal density, and the number of slices.

A gradient based algorithm to solve inverse plane bimodular problems of identification

NASA Astrophysics Data System (ADS)

Ran, Chunjiang; Yang, Haitian; Zhang, Guoqing

2018-02-01

This paper presents a gradient based algorithm to solve inverse plane bimodular problems of identifying constitutive parameters, including tensile/compressive moduli and tensile/compressive Poisson's ratios. For the forward bimodular problem, a FE tangent stiffness matrix is derived facilitating the implementation of gradient based algorithms, for the inverse bimodular problem of identification, a two-level sensitivity analysis based strategy is proposed. Numerical verification in term of accuracy and efficiency is provided, and the impacts of initial guess, number of measurement points, regional inhomogeneity, and noisy data on the identification are taken into accounts.

Determining Plane-Sweep Sampling Points in Image Space Using the Cross-Ratio for Image-Based Depth Estimation

NASA Astrophysics Data System (ADS)

Ruf, B.; Erdnuess, B.; Weinmann, M.

2017-08-01

With the emergence of small consumer Unmanned Aerial Vehicles (UAVs), the importance and interest of image-based depth estimation and model generation from aerial images has greatly increased in the photogrammetric society. In our work, we focus on algorithms that allow an online image-based dense depth estimation from video sequences, which enables the direct and live structural analysis of the depicted scene. Therefore, we use a multi-view plane-sweep algorithm with a semi-global matching (SGM) optimization which is parallelized for general purpose computation on a GPU (GPGPU), reaching sufficient performance to keep up with the key-frames of input sequences. One important aspect to reach good performance is the way to sample the scene space, creating plane hypotheses. A small step size between consecutive planes, which is needed to reconstruct details in the near vicinity of the camera may lead to ambiguities in distant regions, due to the perspective projection of the camera. Furthermore, an equidistant sampling with a small step size produces a large number of plane hypotheses, leading to high computational effort. To overcome these problems, we present a novel methodology to directly determine the sampling points of plane-sweep algorithms in image space. The use of the perspective invariant cross-ratio allows us to derive the location of the sampling planes directly from the image data. With this, we efficiently sample the scene space, achieving higher sampling density in areas which are close to the camera and a lower density in distant regions. We evaluate our approach on a synthetic benchmark dataset for quantitative evaluation and on a real-image dataset consisting of aerial imagery. The experiments reveal that an inverse sampling achieves equal and better results than a linear sampling, with less sampling points and thus less runtime. Our algorithm allows an online computation of depth maps for subsequences of five frames, provided that the relative poses between all frames are given.

Glenoid morphology and the safe zone for protecting the suprascapular nerve during baseplate fixation in reverse shoulder arthroplasty.

PubMed

Yang, Yuhui; Zuo, Jianlin; Liu, Tong; Shao, Pu; Wu, Haihe; Gao, Zhongli; Xiao, Jianlin

2018-03-01

The purpose of this study was to investigate glenoid morphology and define the safe zone for protecting the suprascapular nerve baseplate screw during baseplate fixation in reverse shoulder arthroplasty (RSA) in a Chinese population. Shoulder computed tomography (CT) scans from 56 subjects were retrospectively reviewed. Three-dimensional (3D) reconstruction was performed using Mimics software, and corresponding bony references were used to evaluate glenoid morphology. To standardize evaluation, the coronal scapular plane was defined. Safe fixation distances and screw placements were investigated by constructing a simulated cutting plane of the baseplate during RSA. Mean glenoid height was 35.83 ± 2.95 mm, and width was 27.32 ± 2.78 mm, with significant sexual dimorphism (p < 0.01). According to the cutting plane morphology, the average baseplate radius was 13.84 ± 1.34 mm. The distances from the suprascapular notch and from two bony reference points at the base of the scapular spine to the cutting plane were 30.27 ± 2.77 mm, 18.39 ± 1.67 mm and 16.52 ± 1.52 mm, respectively, with a gender-related difference. Based on the clock face indication system, the danger zone caused by the suprascapular nerve projection was oriented between the two o'clock and eight o'clock positions in reference to the right shoulder. Glenoid size and the safe zone for screw fixation during RSA were characterized in a Chinese population. Careful consideration of baseplate fixation and avoidance of suprascapular nerve injury are important for improved clinical outcome.

The computation of all plane/surface intersections for CAD/CAM applications

NASA Technical Reports Server (NTRS)

Hoitsma, D. H., Jr.; Roche, M.

1984-01-01

The problem of the computation and display of all intersections of a given plane with a rational bicubic surface patch for use on an interactive CAD/CAM system is examined. The general problem of calculating all intersections of a plane and a surface consisting of rational bicubic patches is reduced to the case of a single generic patch by applying a rejection algorithm which excludes all patches that do not intersect the plane. For each pertinent patch the algorithm presented computed the intersection curves by locating an initial point on each curve, and computes successive points on the curve using a tolerance step equation. A single cubic equation solver is used to compute the initial curve points lying on the boundary of a surface patch, and the method of resultants as applied to curve theory is used to determine critical points which, in turn, are used to locate initial points that lie on intersection curves which are in the interior of the patch. Examples are given to illustrate the ability of this algorithm to produce all intersection curves.

Ultrasonography to Measure Swallowing Muscle Mass and Quality in Older Patients With Sarcopenic Dysphagia.

PubMed

Ogawa, Nami; Mori, Takashi; Fujishima, Ichiro; Wakabayashi, Hidetaka; Itoda, Masataka; Kunieda, Kenjiro; Shigematsu, Takashi; Nishioka, Shinta; Tohara, Haruka; Yamada, Minoru; Ogawa, Sumito

2018-06-01

Sarcopenic dysphagia is characterized by difficulty swallowing due to a loss of whole-body skeletal and swallowing muscle mass and function. However, no study has reported on swallowing muscle mass and quality in patients with sarcopenic dysphagia. To compare the differences in swallowing muscle mass and quality between sarcopenic and nonsarcopenic dysphagia. A cross-sectional study was performed in 55 older patients, who had been recommended to undergo dysphagia assessment and/or rehabilitation. Sarcopenic dysphagia was diagnosed using a diagnostic algorithm for sarcopenic dysphagia. The thickness and area of tongue muscle and geniohyoid muscle (coronal plane and sagittal plane), and the echo-intensity of the tongue and geniohyoid muscles were examined by ultrasound. The study participants included 31 males and 24 females (mean age of 82 ± 7 years), with 14 having possible sarcopenic dysphagia, 22 probable sarcopenic dysphagia, and 19 without sarcopenic dysphagia. The group with sarcopenic dysphagia had a significantly lower cross-sectional area and area of brightness of the tongue muscle than that observed in the group without sarcopenic dysphagia. The most specific factor for identifying the presence of sarcopenic dysphagia was tongue muscle area (sensitivity, 0.389; specificity, 0.947; cut-off value, 1536.0), while the factor with the highest sensitivity was geniohyoid muscle area brightness in sagittal sections (sensitivity, 0.806; specificity, 0.632; cut-off value, 20.1). Multivariate logistic regression analysis showed that the area of the tongue muscle and its area of brightness were independent risk factors for sarcopenic dysphagia. However, geniohyoid sagittal muscle area and area of brightness showed no significant independent association with sarcopenic dysphagia. Tongue muscle mass in patients with sarcopenic dysphagia was smaller than that in patients without the condition. Sarcopenic dysphagia was also associated with increased intensity of the tongue muscle. Copyright © 2017 AMDA – The Society for Post-Acute and Long-Term Care Medicine. Published by Elsevier Inc. All rights reserved.

Identification of Shearer Cutting Patterns Using Vibration Signals Based on a Least Squares Support Vector Machine with an Improved Fruit Fly Optimization Algorithm

PubMed Central

Si, Lei; Wang, Zhongbin; Liu, Xinhua; Tan, Chao; Liu, Ze; Xu, Jing

2016-01-01

Shearers play an important role in fully mechanized coal mining face and accurately identifying their cutting pattern is very helpful for improving the automation level of shearers and ensuring the safety of coal mining. The least squares support vector machine (LSSVM) has been proven to offer strong potential in prediction and classification issues, particularly by employing an appropriate meta-heuristic algorithm to determine the values of its two parameters. However, these meta-heuristic algorithms have the drawbacks of being hard to understand and reaching the global optimal solution slowly. In this paper, an improved fly optimization algorithm (IFOA) to optimize the parameters of LSSVM was presented and the LSSVM coupled with IFOA (IFOA-LSSVM) was used to identify the shearer cutting pattern. The vibration acceleration signals of five cutting patterns were collected and the special state features were extracted based on the ensemble empirical mode decomposition (EEMD) and the kernel function. Some examples on the IFOA-LSSVM model were further presented and the results were compared with LSSVM, PSO-LSSVM, GA-LSSVM and FOA-LSSVM models in detail. The comparison results indicate that the proposed approach was feasible, efficient and outperformed the others. Finally, an industrial application example at the coal mining face was demonstrated to specify the effect of the proposed system. PMID:26771615

About some types of constraints in problems of routing

NASA Astrophysics Data System (ADS)

Petunin, A. A.; Polishuk, E. G.; Chentsov, A. G.; Chentsov, P. A.; Ukolov, S. S.

2016-12-01

Many routing problems arising in different applications can be interpreted as a discrete optimization problem with additional constraints. The latter include generalized travelling salesman problem (GTSP), to which task of tool routing for CNC thermal cutting machines is sometimes reduced. Technological requirements bound to thermal fields distribution during cutting process are of great importance when developing algorithms for this task solution. These requirements give rise to some specific constraints for GTSP. This paper provides a mathematical formulation for the problem of thermal fields calculating during metal sheet thermal cutting. Corresponding algorithm with its programmatic implementation is considered. The mathematical model allowing taking such constraints into account considering other routing problems is discussed either.

Dynamic graph cuts for efficient inference in Markov Random Fields.

PubMed

Kohli, Pushmeet; Torr, Philip H S

2007-12-01

Abstract-In this paper we present a fast new fully dynamic algorithm for the st-mincut/max-flow problem. We show how this algorithm can be used to efficiently compute MAP solutions for certain dynamically changing MRF models in computer vision such as image segmentation. Specifically, given the solution of the max-flow problem on a graph, the dynamic algorithm efficiently computes the maximum flow in a modified version of the graph. The time taken by it is roughly proportional to the total amount of change in the edge weights of the graph. Our experiments show that, when the number of changes in the graph is small, the dynamic algorithm is significantly faster than the best known static graph cut algorithm. We test the performance of our algorithm on one particular problem: the object-background segmentation problem for video. It should be noted that the application of our algorithm is not limited to the above problem, the algorithm is generic and can be used to yield similar improvements in many other cases that involve dynamic change.

Secure Oblivious Hiding, Authentication, Tamper Proofing, and Verification Techniques

DTIC Science & Technology

2002-08-01

compressing the bit- planes. The algorithm always starts with inspecting the 5th LSB plane. For color images , all three color-channels are compressed...use classical encryption engines, such as IDEA or DES . These algorithms have a fixed encryption block size, and, depending on the image dimensions, we...information can be stored either in a separate file, in the image header, or embedded in the image itself utilizing the modern concepts of steganography

Scattering of targets over layered half space using a semi-analytic method in conjunction with FDTD algorithm.

PubMed

Cao, Le; Wei, Bing

2014-08-25

Finite-difference time-domain (FDTD) algorithm with a new method of plane wave excitation is used to investigate the RCS (Radar Cross Section) characteristics of targets over layered half space. Compare with the traditional excitation plane wave method, the calculation memory and time requirement is greatly decreased. The FDTD calculation is performed with a plane wave incidence, and the RCS of far field is obtained by extrapolating the currently calculated data on the output boundary. However, methods available for extrapolating have to evaluate the half space Green function. In this paper, a new method which avoids using the complex and time-consuming half space Green function is proposed. Numerical results show that this method is in good agreement with classic algorithm and it can be used in the fast calculation of scattering and radiation of targets over layered half space.

Video-based depression detection using local Curvelet binary patterns in pairwise orthogonal planes.

PubMed

Pampouchidou, Anastasia; Marias, Kostas; Tsiknakis, Manolis; Simos, Panagiotis; Fan Yang; Lemaitre, Guillaume; Meriaudeau, Fabrice

2016-08-01

Depression is an increasingly prevalent mood disorder. This is the reason why the field of computer-based depression assessment has been gaining the attention of the research community during the past couple of years. The present work proposes two algorithms for depression detection, one Frame-based and the second Video-based, both employing Curvelet transform and Local Binary Patterns. The main advantage of these methods is that they have significantly lower computational requirements, as the extracted features are of very low dimensionality. This is achieved by modifying the previously proposed algorithm which considers Three-Orthogonal-Planes, to only Pairwise-Orthogonal-Planes. Performance of the algorithms was tested on the benchmark dataset provided by the Audio/Visual Emotion Challenge 2014, with the person-specific system achieving 97.6% classification accuracy, and the person-independed one yielding promising preliminary results of 74.5% accuracy. The paper concludes with open issues, proposed solutions, and future plans.

Video Shot Boundary Detection Using QR-Decomposition and Gaussian Transition Detection

NASA Astrophysics Data System (ADS)

Amiri, Ali; Fathy, Mahmood

2010-12-01

This article explores the problem of video shot boundary detection and examines a novel shot boundary detection algorithm by using QR-decomposition and modeling of gradual transitions by Gaussian functions. Specifically, the authors attend to the challenges of detecting gradual shots and extracting appropriate spatiotemporal features that affect the ability of algorithms to efficiently detect shot boundaries. The algorithm utilizes the properties of QR-decomposition and extracts a block-wise probability function that illustrates the probability of video frames to be in shot transitions. The probability function has abrupt changes in hard cut transitions, and semi-Gaussian behavior in gradual transitions. The algorithm detects these transitions by analyzing the probability function. Finally, we will report the results of the experiments using large-scale test sets provided by the TRECVID 2006, which has assessments for hard cut and gradual shot boundary detection. These results confirm the high performance of the proposed algorithm.

Autofocus algorithm using one-dimensional Fourier transform and Pearson correlation

NASA Astrophysics Data System (ADS)

Bueno Mario, A.; Alvarez-Borrego, Josue; Acho, L.

2004-10-01

A new autofocus algorithm based on one-dimensional Fourier transform and Pearson correlation for Z automatized microscope is proposed. Our goal is to determine in fast response time and accuracy, the best focused plane through an algorithm. We capture in bright and dark field several images set at different Z distances from biological organism sample. The algorithm uses the one-dimensional Fourier transform to obtain the image frequency content of a vectors pattern previously defined comparing the Pearson correlation of these frequency vectors versus the reference image frequency vector, the most out of focus image, we find the best focusing. Experimental results showed the algorithm has fast response time and accuracy in getting the best focus plane from captured images. In conclusions, the algorithm can be implemented in real time systems due fast response time, accuracy and robustness. The algorithm can be used to get focused images in bright and dark field and it can be extended to include fusion techniques to construct multifocus final images beyond of this paper.

Normalized Cut Algorithm for Automated Assignment of Protein Domains

NASA Technical Reports Server (NTRS)

Samanta, M. P.; Liang, S.; Zha, H.; Biegel, Bryan A. (Technical Monitor)

2002-01-01

We present a novel computational method for automatic assignment of protein domains from structural data. At the core of our algorithm lies a recently proposed clustering technique that has been very successful for image-partitioning applications. This grap.,l-theory based clustering method uses the notion of a normalized cut to partition. an undirected graph into its strongly-connected components. Computer implementation of our method tested on the standard comparison set of proteins from the literature shows a high success rate (84%), better than most existing alternative In addition, several other features of our algorithm, such as reliance on few adjustable parameters, linear run-time with respect to the size of the protein and reduced complexity compared to other graph-theory based algorithms, would make it an attractive tool for structural biologists.

Research on NC laser combined cutting optimization model of sheet metal parts

NASA Astrophysics Data System (ADS)

Wu, Z. Y.; Zhang, Y. L.; Li, L.; Wu, L. H.; Liu, N. B.

2017-09-01

The optimization problem for NC laser combined cutting of sheet metal parts was taken as the research object in this paper. The problem included two contents: combined packing optimization and combined cutting path optimization. In the problem of combined packing optimization, the method of “genetic algorithm + gravity center NFP + geometric transformation” was used to optimize the packing of sheet metal parts. In the problem of combined cutting path optimization, the mathematical model of cutting path optimization was established based on the parts cutting constraint rules of internal contour priority and cross cutting. The model played an important role in the optimization calculation of NC laser combined cutting.

Phonon cross-plane transport and thermal boundary resistance: effect of heat source size and thermal boundary resistance on phonon characteristics

NASA Astrophysics Data System (ADS)

Ali, H.; Yilbas, B. S.

2016-09-01

Phonon cross-plane transport across silicon and diamond thin films pair is considered, and thermal boundary resistance across the films pair interface is examined incorporating the cut-off mismatch and diffusive mismatch models. In the cut-off mismatch model, phonon frequency mismatch for each acoustic branch is incorporated across the interface of the silicon and diamond films pair in line with the dispersion relations of both films. The frequency-dependent and transient solution of the Boltzmann transport equation is presented, and the equilibrium phonon intensity ratios at the silicon and diamond film edges are predicted across the interface for each phonon acoustic branch. Temperature disturbance across the edges of the films pair is incorporated to assess the phonon transport characteristics due to cut-off and diffusive mismatch models across the interface. The effect of heat source size, which is allocated at high-temperature (301 K) edge of the silicon film, on the phonon transport characteristics at the films pair interface is also investigated. It is found that cut-off mismatch model predicts higher values of the thermal boundary resistance across the films pair interface as compared to that of the diffusive mismatch model. The ratio of equilibrium phonon intensity due to the cut-off mismatch over the diffusive mismatch models remains >1 at the silicon edge, while it becomes <1 at the diamond edge for all acoustic branches.

Accuracy assessment of surgical planning and three-dimensional-printed patient-specific guides for orthopaedic osteotomies.

PubMed

Sys, Gwen; Eykens, Hannelore; Lenaerts, Gerlinde; Shumelinsky, Felix; Robbrecht, Cedric; Poffyn, Bart

2017-06-01

This study analyses the accuracy of three-dimensional pre-operative planning and patient-specific guides for orthopaedic osteotomies. To this end, patient-specific guides were compared to the classical freehand method in an experimental setup with saw bones in two phases. In the first phase, the effect of guide design and oscillating versus reciprocating saws was analysed. The difference between target and performed cuts was quantified by the average distance deviation and average angular deviations in the sagittal and coronal planes for the different osteotomies. The results indicated that for one model osteotomy, the use of guides resulted in a more accurate cut when compared to the freehand technique. Reciprocating saws and slot guides improved accuracy in all planes, while oscillating saws and open guides lead to larger deviations from the planned cut. In the second phase, the accuracy of transfer of the planning to the surgical field with slot guides and a reciprocating saw was assessed and compared to the classical planning and freehand cutting method. The pre-operative plan was transferred with high accuracy. Three-dimensional-printed patient-specific guides improve the accuracy of osteotomies and bony resections in an experimental setup compared to conventional freehand methods. The improved accuracy is related to (1) a detailed and qualitative pre-operative plan and (2) an accurate transfer of the planning to the operation room with patient-specific guides by an accurate guidance of the surgical tools to perform the desired cuts.

Two Procedures to Flag Radio Frequency Interference in the UV Plane

NASA Astrophysics Data System (ADS)

Sekhar, Srikrishna; Athreya, Ramana

2018-07-01

We present two algorithms to identify and flag radio frequency interference (RFI) in radio interferometric imaging data. The first algorithm utilizes the redundancy of visibilities inside a UV cell in the visibility plane to identify corrupted data, while varying the detection threshold in accordance with the observed reduction in noise with radial UV distance. In the second algorithm, we propose a scheme to detect faint RFI in the visibility time-channel (TC) plane of baselines. The efficacy of identifying RFI in the residual visibilities is reduced by the presence of ripples due to inaccurate subtraction of the strongest sources. This can be due to several reasons including primary beam asymmetries and other direction-dependent calibration errors. We eliminated these ripples by clipping the corresponding peaks in the associated Fourier plane. RFI was detected in the ripple-free TC plane but was flagged in the original visibilities. Application of these two algorithms to five different 150 MHz data sets from the GMRT resulted in a reduction in image noise of 20%–50% throughout the field along with a reduction in systematics and a corresponding increase in the number of detected sources. However, in comparing the mean flux densities before and after flagging RFI, we find a differential change with the fainter sources (25σ < S < 100 mJy) showing a change of ‑6% to +1% relative to the stronger sources (S > 100 mJy). We are unable to explain this effect, but it could be related to the CLEAN bias known for interferometers.

Learning locality preserving graph from data.

PubMed

Zhang, Yan-Ming; Huang, Kaizhu; Hou, Xinwen; Liu, Cheng-Lin

2014-11-01

Machine learning based on graph representation, or manifold learning, has attracted great interest in recent years. As the discrete approximation of data manifold, the graph plays a crucial role in these kinds of learning approaches. In this paper, we propose a novel learning method for graph construction, which is distinct from previous methods in that it solves an optimization problem with the aim of directly preserving the local information of the original data set. We show that the proposed objective has close connections with the popular Laplacian Eigenmap problem, and is hence well justified. The optimization turns out to be a quadratic programming problem with n(n-1)/2 variables (n is the number of data points). Exploiting the sparsity of the graph, we further propose a more efficient cutting plane algorithm to solve the problem, making the method better scalable in practice. In the context of clustering and semi-supervised learning, we demonstrated the advantages of our proposed method by experiments.

RNA Graph Partitioning for the Discovery of RNA Modularity: A Novel Application of Graph Partition Algorithm to Biology

PubMed Central

Elmetwaly, Shereef; Schlick, Tamar

2014-01-01

Graph representations have been widely used to analyze and design various economic, social, military, political, and biological networks. In systems biology, networks of cells and organs are useful for understanding disease and medical treatments and, in structural biology, structures of molecules can be described, including RNA structures. In our RNA-As-Graphs (RAG) framework, we represent RNA structures as tree graphs by translating unpaired regions into vertices and helices into edges. Here we explore the modularity of RNA structures by applying graph partitioning known in graph theory to divide an RNA graph into subgraphs. To our knowledge, this is the first application of graph partitioning to biology, and the results suggest a systematic approach for modular design in general. The graph partitioning algorithms utilize mathematical properties of the Laplacian eigenvector (µ2) corresponding to the second eigenvalues (λ2) associated with the topology matrix defining the graph: λ2 describes the overall topology, and the sum of µ2′s components is zero. The three types of algorithms, termed median, sign, and gap cuts, divide a graph by determining nodes of cut by median, zero, and largest gap of µ2′s components, respectively. We apply these algorithms to 45 graphs corresponding to all solved RNA structures up through 11 vertices (∼220 nucleotides). While we observe that the median cut divides a graph into two similar-sized subgraphs, the sign and gap cuts partition a graph into two topologically-distinct subgraphs. We find that the gap cut produces the best biologically-relevant partitioning for RNA because it divides RNAs at less stable connections while maintaining junctions intact. The iterative gap cuts suggest basic modules and assembly protocols to design large RNA structures. Our graph substructuring thus suggests a systematic approach to explore the modularity of biological networks. In our applications to RNA structures, subgraphs also suggest design strategies for novel RNA motifs. PMID:25188578

Counterbalance of cutting force for advanced milling operations

NASA Astrophysics Data System (ADS)

Tsai, Nan-Chyuan; Shih, Li-Wen; Lee, Rong-Mao

2010-05-01

The goal of this work is to concurrently counterbalance the dynamic cutting force and regulate the spindle position deviation under various milling conditions by integrating active magnetic bearing (AMB) technique, fuzzy logic algorithm and an adaptive self-tuning feedback loop. Since the dynamics of milling system is highly determined by a few operation conditions, such as speed of spindle, cut depth and feedrate, therefore the dynamic model for cutting process is more appropriate to be constructed by experiments, instead of using theoretical approach. The experimental data, either for idle or cutting, are utilized to establish the database of milling dynamics so that the system parameters can be on-line estimated by employing the proposed fuzzy logic algorithm as the cutting mission is engaged. Based on the estimated milling system model and preset operation conditions, i.e., spindle speed, cut depth and feedrate, the current cutting force can be numerically estimated. Once the current cutting force can be real-time estimated, the corresponding compensation force can be exerted by the equipped AMB to counterbalance the cutting force, in addition to the spindle position regulation by feedback of spindle position. On the other hand, for the magnetic force is nonlinear with respect to the applied electric current and air gap, the characteristics of the employed AMB is investigated also by experiments and a nonlinear mathematic model, in terms of air gap between spindle and electromagnetic pole and coil current, is developed. At the end, the experimental simulations on realistic milling are presented to verify the efficacy of the fuzzy controller for spindle position regulation and the capability of the dynamic cutting force counterbalance.

Cutting process simulation of flat drill

NASA Astrophysics Data System (ADS)

Tamura, Shoichi; Matsumura, Takashi

2018-05-01

Flat drills at a point angle of 180 deg. have recently been developed for drilling of automobile parts with the inclination of the workpiece surfaces. The paper studies the cutting processes of the flat drills in the analytical simulation. A predictive force model is applied to simulation of the cutting force with the chip flow direction. The chip flow model is piled up with orthogonal cuttings in the plane containing the cutting velocities and the chip flow velocities, in which the chip flow direction is determined to minimize the cutting energy. Then, the cutting force is predicted in the determined in the chip flow model. The typical cutting force of the flat drill is discussed with comparing to that of the standard drill. The typical differences are confirmed in the cutting force change during the tool engagement and disengagement. The cutting force, then, is simulated in drilling for an inclined workpiece with a flat drill. The horizontal components in the cutting forces are simulated with changing the inclination angle of the plate. The horizontal force component in the flat drilling is stable to be controlled in terms of the machining accuracy and the tool breakage.

Study on observation planning of LAMOST focal plane positioning system and its simulation

NASA Astrophysics Data System (ADS)

Zhai, Chao; Jin, Yi; Peng, Xiaobo; Xing, Xiaozheng

2006-06-01

Fiber Positioning System of LAMOST focal plane based on subarea thinking, adopts a parallel controllable positioning plan, the structure is designed as a round area and overlapped each other in order to eliminate the un-observation region. But it also makes the observation efficiency of the system become an important problem. In this paper According to the system, the model of LAMOST focal plane Observation Planning including 4000 fiber positioning units is built, Stars are allocated using netflow algorithm and mechanical collisions are diminished through the retreat algorithm, then the simulation of the system's observation efficiency is carried out. The problem of observation efficiency of LAMOST focal plane is analysed systemic and all-sided from the aspect of overlapped region, fiber positioning units, observation radius, collisions and so on. The observation efficiency of the system in theory is describes and the simulation indicates that the system's observation efficiency is acceptable. The analyses play an indicative role on the design of the LAMOST focal plane structure.

Computational Efficiency of the Simplex Embedding Method in Convex Nondifferentiable Optimization

NASA Astrophysics Data System (ADS)

Kolosnitsyn, A. V.

2018-02-01

The simplex embedding method for solving convex nondifferentiable optimization problems is considered. A description of modifications of this method based on a shift of the cutting plane intended for cutting off the maximum number of simplex vertices is given. These modification speed up the problem solution. A numerical comparison of the efficiency of the proposed modifications based on the numerical solution of benchmark convex nondifferentiable optimization problems is presented.

A novel color image encryption algorithm based on genetic recombination and the four-dimensional memristive hyperchaotic system

NASA Astrophysics Data System (ADS)

Chai, Xiu-Li; Gan, Zhi-Hua; Lu, Yang; Zhang, Miao-Hui; Chen, Yi-Ran

2016-10-01

Recently, many image encryption algorithms based on chaos have been proposed. Most of the previous algorithms encrypt components R, G, and B of color images independently and neglect the high correlation between them. In the paper, a novel color image encryption algorithm is introduced. The 24 bit planes of components R, G, and B of the color plain image are obtained and recombined into 4 compound bit planes, and this can make the three components affect each other. A four-dimensional (4D) memristive hyperchaotic system generates the pseudorandom key streams and its initial values come from the SHA 256 hash value of the color plain image. The compound bit planes and key streams are confused according to the principles of genetic recombination, then confusion and diffusion as a union are applied to the bit planes, and the color cipher image is obtained. Experimental results and security analyses demonstrate that the proposed algorithm is secure and effective so that it may be adopted for secure communication. Project supported by the National Natural Science Foundation of China (Grant Nos. 61203094 and 61305042), the Natural Science Foundation of the United States (Grant Nos. CNS-1253424 and ECCS-1202225), the Science and Technology Foundation of Henan Province, China (Grant No. 152102210048), the Foundation and Frontier Project of Henan Province, China (Grant No. 162300410196), the Natural Science Foundation of Educational Committee of Henan Province, China (Grant No. 14A413015), and the Research Foundation of Henan University, China (Grant No. xxjc20140006).

Knee joint kinematics and kinetics during the hop and cut after soft tissue artifact suppression: Time to reconsider ACL injury mechanisms?

PubMed

Smale, Kenneth B; Potvin, Brigitte M; Shourijeh, Mohammad S; Benoit, Daniel L

2017-09-06

The recent development of a soft tissue artifact (STA) suppression method allows us to re-evaluate the tibiofemoral kinematics currently linked to non-contact knee injuries. The purpose of this study was therefore to evaluate knee joint kinematics and kinetics in six degrees of freedom (DoF) during the loading phases of a jump lunge and side cut using this in silico method. Thirty-five healthy adults completed these movements and their surface marker trajectories were then scaled and processed with OpenSim's inverse kinematics (IK) and inverse dynamics tools. Knee flexion angle-dependent kinematic constraints defined based on previous bone pin (BP) marker trajectories were then applied to the OpenSim model during IK and these constrained results were then processed with the standard inverse dynamics tool. Significant differences for all hip, knee, and ankle DoF were observed after STA suppression for both the jump lunge and side cut. Using clinically relevant effect size estimates, we conclude that STA contamination had led to misclassifications in hip transverse plane angles, knee frontal and transverse plane angles, medial/lateral and distractive/compressive knee translations, and knee frontal plane moments between the NoBP and the BP IK solutions. Our results have substantial clinical implications since past research has used joint kinematics and kinetics contaminated by STA to identify risk factors for musculoskeletal injuries. Copyright © 2017 Elsevier Ltd. All rights reserved.

Traffic routing for multicomputer networks with virtual cut-through capability

NASA Technical Reports Server (NTRS)

Kandlur, Dilip D.; Shin, Kang G.

1992-01-01

Consideration is given to the problem of selecting routes for interprocess communication in a network with virtual cut-through capability, while balancing the network load and minimizing the number of times that a message gets buffered. An approach is proposed that formulates the route selection problem as a minimization problem with a link cost function that depends upon the traffic through the link. The form of this cost function is derived using the probability of establishing a virtual cut-through route. The route selection problem is shown to be NP-hard, and an algorithm is developed to incrementally reduce the cost by rerouting the traffic. The performance of this algorithm is exemplified by two network topologies: the hypercube and the C-wrapped hexagonal mesh.

Figure-ground segmentation based on class-independent shape priors

NASA Astrophysics Data System (ADS)

Li, Yang; Liu, Yang; Liu, Guojun; Guo, Maozu

2018-01-01

We propose a method to generate figure-ground segmentation by incorporating shape priors into the graph-cuts algorithm. Given an image, we first obtain a linear representation of an image and then apply directional chamfer matching to generate class-independent, nonparametric shape priors, which provide shape clues for the graph-cuts algorithm. We then enforce shape priors in a graph-cuts energy function to produce object segmentation. In contrast to previous segmentation methods, the proposed method shares shape knowledge for different semantic classes and does not require class-specific model training. Therefore, the approach obtains high-quality segmentation for objects. We experimentally validate that the proposed method outperforms previous approaches using the challenging PASCAL VOC 2010/2012 and Berkeley (BSD300) segmentation datasets.

Real-time out-of-plane artifact subtraction tomosynthesis imaging using prior CT for scanning beam digital x-ray system

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wu, Meng, E-mail: mengwu@stanford.edu; Fahrig, Rebecca

2014-11-01

Purpose: The scanning beam digital x-ray system (SBDX) is an inverse geometry fluoroscopic system with high dose efficiency and the ability to perform continuous real-time tomosynthesis in multiple planes. This system could be used for image guidance during lung nodule biopsy. However, the reconstructed images suffer from strong out-of-plane artifact due to the small tomographic angle of the system. Methods: The authors propose an out-of-plane artifact subtraction tomosynthesis (OPAST) algorithm that utilizes a prior CT volume to augment the run-time image processing. A blur-and-add (BAA) analytical model, derived from the project-to-backproject physical model, permits the generation of tomosynthesis images thatmore » are a good approximation to the shift-and-add (SAA) reconstructed image. A computationally practical algorithm is proposed to simulate images and out-of-plane artifacts from patient-specific prior CT volumes using the BAA model. A 3D image registration algorithm to align the simulated and reconstructed images is described. The accuracy of the BAA analytical model and the OPAST algorithm was evaluated using three lung cancer patients’ CT data. The OPAST and image registration algorithms were also tested with added nonrigid respiratory motions. Results: Image similarity measurements, including the correlation coefficient, mean squared error, and structural similarity index, indicated that the BAA model is very accurate in simulating the SAA images from the prior CT for the SBDX system. The shift-variant effect of the BAA model can be ignored when the shifts between SBDX images and CT volumes are within ±10 mm in the x and y directions. The nodule visibility and depth resolution are improved by subtracting simulated artifacts from the reconstructions. The image registration and OPAST are robust in the presence of added respiratory motions. The dominant artifacts in the subtraction images are caused by the mismatches between the real object and the prior CT volume. Conclusions: Their proposed prior CT-augmented OPAST reconstruction algorithm improves lung nodule visibility and depth resolution for the SBDX system.« less

Mathematical simulation and optimization of cutting mode in turning of workpieces made of nickel-based heat-resistant alloy

NASA Astrophysics Data System (ADS)

Bogoljubova, M. N.; Afonasov, A. I.; Kozlov, B. N.; Shavdurov, D. E.

2018-05-01

A predictive simulation technique of optimal cutting modes in the turning of workpieces made of nickel-based heat-resistant alloys, different from the well-known ones, is proposed. The impact of various factors on the cutting process with the purpose of determining optimal parameters of machining in concordance with certain effectiveness criteria is analyzed in the paper. A mathematical model of optimization, algorithms and computer programmes, visual graphical forms reflecting dependences of the effectiveness criteria – productivity, net cost, and tool life on parameters of the technological process - have been worked out. A nonlinear model for multidimensional functions, “solution of the equation with multiple unknowns”, “a coordinate descent method” and heuristic algorithms are accepted to solve the problem of optimization of cutting mode parameters. Research shows that in machining of workpieces made from heat-resistant alloy AISI N07263, the highest possible productivity will be achieved with the following parameters: cutting speed v = 22.1 m/min., feed rate s=0.26 mm/rev; tool life T = 18 min.; net cost – 2.45 per hour.

Bit-level plane image encryption based on coupled map lattice with time-varying delay

NASA Astrophysics Data System (ADS)

Lv, Xiupin; Liao, Xiaofeng; Yang, Bo

2018-04-01

Most of the existing image encryption algorithms had two basic properties: confusion and diffusion in a pixel-level plane based on various chaotic systems. Actually, permutation in a pixel-level plane could not change the statistical characteristics of an image, and many of the existing color image encryption schemes utilized the same method to encrypt R, G and B components, which means that the three color components of a color image are processed three times independently. Additionally, dynamical performance of a single chaotic system degrades greatly with finite precisions in computer simulations. In this paper, a novel coupled map lattice with time-varying delay therefore is applied in color images bit-level plane encryption to solve the above issues. Spatiotemporal chaotic system with both much longer period in digitalization and much excellent performances in cryptography is recommended. Time-varying delay embedded in coupled map lattice enhances dynamical behaviors of the system. Bit-level plane image encryption algorithm has greatly reduced the statistical characteristics of an image through the scrambling processing. The R, G and B components cross and mix with one another, which reduces the correlation among the three components. Finally, simulations are carried out and all the experimental results illustrate that the proposed image encryption algorithm is highly secure, and at the same time, also demonstrates superior performance.

Use of a tissue sectioner to expose internal structures of biological samples for scanning electron microscopy.

PubMed

Brown, M F; Brotzman, H G; Kinden, D A

1976-09-01

A procedure yielding sections of unembedded biological samples for observation by scanning electron microscopy is described. Sections of samples, fixed and hardened in OsO4, were obtained in quantity with a tissue sectioner. Subsequent treatments to osmium-coat cut surfaces were employed prior to critical point drying. The procedure yields cleanly cut surfaces through cells and cytoplasmic organelles which are retained in their normal position. Sections of apple leaf and mouse kidney are illustrated. Sections can be readily cut in a desired plane with less structural damage than is typically encountered by other sectioning or dissection techniques.

Point-Wise Phase Matching for Nonlinear Frequency Generation in Dielectric Resonators

NASA Technical Reports Server (NTRS)

Yu, Nan (Inventor); Strekalov, Dmitry V. (Inventor); Lin, Guoping (Inventor)

2016-01-01

An optical resonator fabricated from a uniaxial birefringent crystal, such as beta barium borate. The crystal is cut with the optical axis not perpendicular to a face of the cut crystal. In some cases the optical axis lies in the plane of the cut crystal face. An incident (input) electromagnetic signal (which can range from the infrared through the visible to the ultraviolet) is applied to the resonator. An output signal is recovered which has a frequency that is an integer multiple of the frequency of the input signal. In some cases a prism is used to evanescently couple the input and the output signals to the resonator.

Determining residual reduction algorithm kinematic tracking weights for a sidestep cut via numerical optimization.

PubMed

Samaan, Michael A; Weinhandl, Joshua T; Bawab, Sebastian Y; Ringleb, Stacie I

2016-12-01

Musculoskeletal modeling allows for the determination of various parameters during dynamic maneuvers by using in vivo kinematic and ground reaction force (GRF) data as inputs. Differences between experimental and model marker data and inconsistencies in the GRFs applied to these musculoskeletal models may not produce accurate simulations. Therefore, residual forces and moments are applied to these models in order to reduce these differences. Numerical optimization techniques can be used to determine optimal tracking weights of each degree of freedom of a musculoskeletal model in order to reduce differences between the experimental and model marker data as well as residual forces and moments. In this study, the particle swarm optimization (PSO) and simplex simulated annealing (SIMPSA) algorithms were used to determine optimal tracking weights for the simulation of a sidestep cut. The PSO and SIMPSA algorithms were able to produce model kinematics that were within 1.4° of experimental kinematics with residual forces and moments of less than 10 N and 18 Nm, respectively. The PSO algorithm was able to replicate the experimental kinematic data more closely and produce more dynamically consistent kinematic data for a sidestep cut compared to the SIMPSA algorithm. Future studies should use external optimization routines to determine dynamically consistent kinematic data and report the differences between experimental and model data for these musculoskeletal simulations.

Cellular automata segmentation of the boundary between the compacta of vertebral bodies and surrounding structures

NASA Astrophysics Data System (ADS)

Egger, Jan; Nimsky, Christopher

2016-03-01

Due to the aging population, spinal diseases get more and more common nowadays; e.g., lifetime risk of osteoporotic fracture is 40% for white women and 13% for white men in the United States. Thus the numbers of surgical spinal procedures are also increasing with the aging population and precise diagnosis plays a vital role in reducing complication and recurrence of symptoms. Spinal imaging of vertebral column is a tedious process subjected to interpretation errors. In this contribution, we aim to reduce time and error for vertebral interpretation by applying and studying the GrowCut - algorithm for boundary segmentation between vertebral body compacta and surrounding structures. GrowCut is a competitive region growing algorithm using cellular automata. For our study, vertebral T2-weighted Magnetic Resonance Imaging (MRI) scans were first manually outlined by neurosurgeons. Then, the vertebral bodies were segmented in the medical images by a GrowCut-trained physician using the semi-automated GrowCut-algorithm. Afterwards, results of both segmentation processes were compared using the Dice Similarity Coefficient (DSC) and the Hausdorff Distance (HD) which yielded to a DSC of 82.99+/-5.03% and a HD of 18.91+/-7.2 voxel, respectively. In addition, the times have been measured during the manual and the GrowCut segmentations, showing that a GrowCutsegmentation - with an average time of less than six minutes (5.77+/-0.73) - is significantly shorter than a pure manual outlining.

Operationalizing hippocampal volume as an enrichment biomarker for amnestic mild cognitive impairment trials: effect of algorithm, test-retest variability, and cut point on trial cost, duration, and sample size.

PubMed

Yu, Peng; Sun, Jia; Wolz, Robin; Stephenson, Diane; Brewer, James; Fox, Nick C; Cole, Patricia E; Jack, Clifford R; Hill, Derek L G; Schwarz, Adam J

2014-04-01

The objective of this study was to evaluate the effect of computational algorithm, measurement variability, and cut point on hippocampal volume (HCV)-based patient selection for clinical trials in mild cognitive impairment (MCI). We used normal control and amnestic MCI subjects from the Alzheimer's Disease Neuroimaging Initiative 1 (ADNI-1) as normative reference and screening cohorts. We evaluated the enrichment performance of 4 widely used hippocampal segmentation algorithms (FreeSurfer, Hippocampus Multi-Atlas Propagation and Segmentation (HMAPS), Learning Embeddings Atlas Propagation (LEAP), and NeuroQuant) in terms of 2-year changes in Mini-Mental State Examination (MMSE), Alzheimer's Disease Assessment Scale-Cognitive Subscale (ADAS-Cog), and Clinical Dementia Rating Sum of Boxes (CDR-SB). We modeled the implications for sample size, screen fail rates, and trial cost and duration. HCV based patient selection yielded reduced sample sizes (by ∼40%-60%) and lower trial costs (by ∼30%-40%) across a wide range of cut points. These results provide a guide to the choice of HCV cut point for amnestic MCI clinical trials, allowing an informed tradeoff between statistical and practical considerations. Copyright © 2014 Elsevier Inc. All rights reserved.

A GENERAL ALGORITHM FOR THE CONSTRUCTION OF CONTOUR PLOTS

NASA Technical Reports Server (NTRS)

Johnson, W.

1994-01-01

The graphical presentation of experimentally or theoretically generated data sets frequently involves the construction of contour plots. A general computer algorithm has been developed for the construction of contour plots. The algorithm provides for efficient and accurate contouring with a modular approach which allows flexibility in modifying the algorithm for special applications. The algorithm accepts as input data values at a set of points irregularly distributed over a plane. The algorithm is based on an interpolation scheme in which the points in the plane are connected by straight line segments to form a set of triangles. In general, the data is smoothed using a least-squares-error fit of the data to a bivariate polynomial. To construct the contours, interpolation along the edges of the triangles is performed, using the bivariable polynomial if data smoothing was performed. Once the contour points have been located, the contour may be drawn. This program is written in FORTRAN IV for batch execution and has been implemented on an IBM 360 series computer with a central memory requirement of approximately 100K of 8-bit bytes. This computer algorithm was developed in 1981.

[Validation of cut points of skeletal muscle mass index for identifying sarcopenia in Chilean older people].

PubMed

Lera, Lydia; Ángel, Bárbara; Sánchez, Hugo; Picrin, Yaisy; Hormazabal, María José; Quiero, Andrea; Albala, Cecilia

2014-09-28

To estimate and validate cut-off points of skeletal muscle mass index (SMI) in Chilean population, for using in an algorithm for a diagnosis of sarcopenia developed by European Working Group on Sarcopenia in Older People (EWGSOP). Secondary analysis of Cross-sectional data in 440 Chilean older subjects to estimate cut-off points of SMI determined by DEXA and predicted by an anthropometric equation. Afterward a cross-sectional validation in a sample of 164 older people was performed. Anthropometric measures, self-reported health status, physical performance tests and DEXA were carried out. Decreased muscle strength was defined as handgrip strength <15 kg in women and <27 kg in male. Cut-off points of SMI were defined as values under 20th percentile for DEXA measures and estimated through ROC curves for the anthropometric model. Biological validity of the algorithm was tested by contrasting the diagnosis with physical performance tests and functionality. Cut-off points of SMI obtained by DEXA were 7.19 kg/m² in men and 5.77 kg/m² in women and 7.45 kg/ m² and 5.88 kg/m², respectively for the predicted by the model. Sensibility and specificity of estimations vs DEXA measures were 80% and 92% in men and 77% and 89% in women. We obtained cut-off points of SMI for DEXA and for a prediction equation for older adults Chilean, with good sensibility and specificity for the measurement by DEXA. It will allow to apply the EWGSOP algorithm to the early diagnosis of sarcopenia and to develop programs for prevention, delay or reversion this syndrome. Copyright AULA MEDICA EDICIONES 2014. Published by AULA MEDICA. All rights reserved.

densityCut: an efficient and versatile topological approach for automatic clustering of biological data

PubMed Central

Ding, Jiarui; Shah, Sohrab; Condon, Anne

2016-01-01

Motivation: Many biological data processing problems can be formalized as clustering problems to partition data points into sensible and biologically interpretable groups. Results: This article introduces densityCut, a novel density-based clustering algorithm, which is both time- and space-efficient and proceeds as follows: densityCut first roughly estimates the densities of data points from a K-nearest neighbour graph and then refines the densities via a random walk. A cluster consists of points falling into the basin of attraction of an estimated mode of the underlining density function. A post-processing step merges clusters and generates a hierarchical cluster tree. The number of clusters is selected from the most stable clustering in the hierarchical cluster tree. Experimental results on ten synthetic benchmark datasets and two microarray gene expression datasets demonstrate that densityCut performs better than state-of-the-art algorithms for clustering biological datasets. For applications, we focus on the recent cancer mutation clustering and single cell data analyses, namely to cluster variant allele frequencies of somatic mutations to reveal clonal architectures of individual tumours, to cluster single-cell gene expression data to uncover cell population compositions, and to cluster single-cell mass cytometry data to detect communities of cells of the same functional states or types. densityCut performs better than competing algorithms and is scalable to large datasets. Availability and Implementation: Data and the densityCut R package is available from https://bitbucket.org/jerry00/densitycut_dev. Contact: condon@cs.ubc.ca or sshah@bccrc.ca or jiaruid@cs.ubc.ca Supplementary information: Supplementary data are available at Bioinformatics online. PMID:27153661

Which population groups should be targeted for cardiovascular prevention? A modelling study based on the Norwegian Hordaland Health Study (HUSK).

PubMed

Brekke, Mette; Rekdal, Magne; Straand, Jørund

2007-06-01

To assess level of cardiovascular risk factors in a non-selected, middle-aged population. To estimate the proportion target for risk intervention according to present guidelines and according to different cut-off levels for two risk algorithms. Population survey, modelling study. The Norwegian Hordaland Health Study (HUSK) 1997-99. A total of 22 289 persons born in 1950-57. Own and relatives' cardiovascular morbidity, antihypertensive and lipid-lowering treatment, smoking, blood pressure, cholesterol. Framingham and Systematic Coronary Risk Evaluation (SCORE) algorithms. The European guidelines on CVD prevention in clinical practice were applied to estimate size of risk groups. Some 9.7% of men and 7.6% of women had CVD, diabetes mellitus, a high level of one specific risk factor, or received lipid-lowering or antihypertensive treatment. Applying a SCORE (60 years) cut-off level at 5% to the rest of the population selected 52.4% of men and 0.8% of women into a primary prevention group, while a cut-off level at 8% included 22.0% and 0.06% respectively. A cut-off level for the Framingham score (60 years) of 20% selected 43.6% of men and 4.7% of women, while a cut-off level of 25% selected 25.6% of men and 1.8% of women. The findings illustrate how choices regarding risk estimation highly affect the size of the target population. Modelling studies are important when preparing guidelines, to address implications for resource allocation and risk of medicalization. The population share to be targeted for primary prevention ought to be estimated, including the impact of various cut-off points for risk algorithms on the size of the risk population.

Optimal Control of Electrodynamic Tethers

DTIC Science & Technology

2008-06-01

the out-of- plane component of the magnetic field which produces the required in- track thrust is reduced (see Eq. as th sp lo e a (4... the same orbital plane using an EDT. For the sake of testing the algorithm against a known solution we seek the maximum altitude an EDT can reach...be incl planes co gnetic equatorial plane ent of latit and m mi ains constant as the EDT ity the Eart e tilted with respect to the

Locating Critical Circular and Unconstrained Failure Surface in Slope Stability Analysis with Tailored Genetic Algorithm

NASA Astrophysics Data System (ADS)

Pasik, Tomasz; van der Meij, Raymond

2017-12-01

This article presents an efficient search method for representative circular and unconstrained slip surfaces with the use of the tailored genetic algorithm. Searches for unconstrained slip planes with rigid equilibrium methods are yet uncommon in engineering practice, and little publications regarding truly free slip planes exist. The proposed method presents an effective procedure being the result of the right combination of initial population type, selection, crossover and mutation method. The procedure needs little computational effort to find the optimum, unconstrained slip plane. The methodology described in this paper is implemented using Mathematica. The implementation, along with further explanations, is fully presented so the results can be reproduced. Sample slope stability calculations are performed for four cases, along with a detailed result interpretation. Two cases are compared with analyses described in earlier publications. The remaining two are practical cases of slope stability analyses of dikes in Netherlands. These four cases show the benefits of analyzing slope stability with a rigid equilibrium method combined with a genetic algorithm. The paper concludes by describing possibilities and limitations of using the genetic algorithm in the context of the slope stability problem.

Mathematical Foundation for Plane Covering Using Hexagons

NASA Technical Reports Server (NTRS)

Johnson, Gordon G.

1999-01-01

This work is to indicate the development and mathematical underpinnings of the algorithms previously developed for covering the plane and the addressing of the elements of the covering. The algorithms are of interest in that they provides a simple systematic way of increasing or decreasing resolution, in the sense that if we have the covering in place and there is an image superimposed upon the covering, then we may view the image in a rough form or in a very detailed form with minimal effort. Such ability allows for quick searches of crude forms to determine a class in which to make a detailed search. In addition, the addressing algorithms provide an efficient way to process large data sets that have related subsets. The algorithms produced were based in part upon the work of D. Lucas "A Multiplication in N Space" which suggested a set of three vectors, any two of which would serve as a bases for the plane and also that the hexagon is the natural geometric object to be used in a covering with a suggested bases. The second portion is a refinement of the eyeball vision system, the globular viewer.

Political science. Exposure to ideologically diverse news and opinion on Facebook.

PubMed

Bakshy, Eytan; Messing, Solomon; Adamic, Lada A

2015-06-05

Exposure to news, opinion, and civic information increasingly occurs through social media. How do these online networks influence exposure to perspectives that cut across ideological lines? Using deidentified data, we examined how 10.1 million U.S. Facebook users interact with socially shared news. We directly measured ideological homophily in friend networks and examined the extent to which heterogeneous friends could potentially expose individuals to cross-cutting content. We then quantified the extent to which individuals encounter comparatively more or less diverse content while interacting via Facebook's algorithmically ranked News Feed and further studied users' choices to click through to ideologically discordant content. Compared with algorithmic ranking, individuals' choices played a stronger role in limiting exposure to cross-cutting content. Copyright © 2015, American Association for the Advancement of Science.

Optimizing event selection with the random grid search

NASA Astrophysics Data System (ADS)

Bhat, Pushpalatha C.; Prosper, Harrison B.; Sekmen, Sezen; Stewart, Chip

2018-07-01

The random grid search (RGS) is a simple, but efficient, stochastic algorithm to find optimal cuts that was developed in the context of the search for the top quark at Fermilab in the mid-1990s. The algorithm, and associated code, have been enhanced recently with the introduction of two new cut types, one of which has been successfully used in searches for supersymmetry at the Large Hadron Collider. The RGS optimization algorithm is described along with the recent developments, which are illustrated with two examples from particle physics. One explores the optimization of the selection of vector boson fusion events in the four-lepton decay mode of the Higgs boson and the other optimizes SUSY searches using boosted objects and the razor variables.

Polarization-sensitive electro-optic detection of terahertz wave using three different types of crystal symmetry: Toward broadband polarization spectroscopy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Oguchi, Kenichi; Iwasaki, Hotsumi; Okano, Makoto

2016-01-04

We investigated polarization-sensitive electro-optic (EO) detection of terahertz (THz) waves by using two uniaxial crystals: a c-cut gallium selenide and a c-cut lithium niobate crystals. We formulated a general frequency-domain description of EO detection by in-plane isotropic EO crystals, which holds regardless of the frequency. Based on this description, the polarization of THz waves can be derived by analyzing EO sampling signals measured with two orthogonal configurations of the in-plane isotropic EO crystals as well as typical (111) zinc-blende EO crystals. In addition, we experimentally demonstrated that the frequency-dependent polarization of THz waves can be reproducibly retrieved using three EOmore » crystals with different crystal symmetries and with different phase matching conditions. Our description provides essential information for practical polarization sensing in the THz frequency range as well as in the mid-infrared range.« less

Parametric optimization of multiple quality characteristics in laser cutting of Inconel-718 by using hybrid approach of multiple regression analysis and genetic algorithm

NASA Astrophysics Data System (ADS)

Shrivastava, Prashant Kumar; Pandey, Arun Kumar

2018-06-01

Inconel-718 has found high demand in different industries due to their superior mechanical properties. The traditional cutting methods are facing difficulties for cutting these alloys due to their low thermal potential, lower elasticity and high chemical compatibility at inflated temperature. The challenges of machining and/or finishing of unusual shapes and/or sizes in these materials have also faced by traditional machining. Laser beam cutting may be applied for the miniaturization and ultra-precision cutting and/or finishing by appropriate control of different process parameter. This paper present multi-objective optimization the kerf deviation, kerf width and kerf taper in the laser cutting of Incone-718 sheet. The second order regression models have been developed for different quality characteristics by using the experimental data obtained through experimentation. The regression models have been used as objective function for multi-objective optimization based on the hybrid approach of multiple regression analysis and genetic algorithm. The comparison of optimization results to experimental results shows an improvement of 88%, 10.63% and 42.15% in kerf deviation, kerf width and kerf taper, respectively. Finally, the effects of different process parameters on quality characteristics have also been discussed.

Characterization of a defective PbWO4 crystal cut along the a-c crystallographic plane: structural assessment and a novel photoelastic stress analysis

NASA Astrophysics Data System (ADS)

Montalto, L.; Natali, P. P.; Daví, F.; Mengucci., P.; Paone, N.; Rinaldi, D.

2017-12-01

Among scintillators, the PWO is one of the most widely used, for instance in CMS calorimeter at CERN and PANDA project. Crystallographic structure and chemical composition as well as residual stress condition, are indicators of homogeneity and good quality of the crystal. In this paper, structural characterization of a defective PbWO4 (PWO) crystal has been performed by X-ray Diffraction (XRD), Energy Dispersive Spectroscopy (EDS) and Photoelasticity in the unusual (a, c) crystallographic plane. XRD and EDS analysis have been used to investigate crystallographic orientation and chemical composition, while stress distribution, which indicates macroscopic inhomogeneities and defects, has been obtained by photoelastic approaches, in Conoscopic and Sphenoscopic configuration. Since the sample is cut along the (a, c) crystallographic plane, a new method is proposed for the interpretation of the fringe pattern. The structural analysis has detected odds from the nominal lattice dimension, which can be attributed to the strong presence of Pb and W. A strong inhomogeneity over the crystal sample has been revealed by the photoelastic inspection. The results give reliability to the proposed procedure which is exploitable in crystals with other structures.

Out-of-Focus Projector Calibration Method with Distortion Correction on the Projection Plane in the Structured Light Three-Dimensional Measurement System.

PubMed

Zhang, Jiarui; Zhang, Yingjie; Chen, Bo

2017-12-20

The three-dimensional measurement system with a binary defocusing technique is widely applied in diverse fields. The measurement accuracy is mainly determined by out-of-focus projector calibration accuracy. In this paper, a high-precision out-of-focus projector calibration method that is based on distortion correction on the projection plane and nonlinear optimization algorithm is proposed. To this end, the paper experimentally presents the principle that the projector has noticeable distortions outside its focus plane. In terms of this principle, the proposed method uses a high-order radial and tangential lens distortion representation on the projection plane to correct the calibration residuals caused by projection distortion. The final accuracy parameters of out-of-focus projector were obtained using a nonlinear optimization algorithm with good initial values, which were provided by coarsely calibrating the parameters of the out-of-focus projector on the focal and projection planes. Finally, the experimental results demonstrated that the proposed method can accuracy calibrate an out-of-focus projector, regardless of the amount of defocusing.

Predicting chroma from luma with frequency domain intra prediction

NASA Astrophysics Data System (ADS)

Egge, Nathan E.; Valin, Jean-Marc

2015-03-01

This paper describes a technique for performing intra prediction of the chroma planes based on the reconstructed luma plane in the frequency domain. This prediction exploits the fact that while RGB to YUV color conversion has the property that it decorrelates the color planes globally across an image, there is still some correlation locally at the block level.1 Previous proposals compute a linear model of the spatial relationship between the luma plane (Y) and the two chroma planes (U and V).2 In codecs that use lapped transforms this is not possible since transform support extends across the block boundaries3 and thus neighboring blocks are unavailable during intra- prediction. We design a frequency domain intra predictor for chroma that exploits the same local correlation with lower complexity than the spatial predictor and which works with lapped transforms. We then describe a low- complexity algorithm that directly uses luma coefficients as a chroma predictor based on gain-shape quantization and band partitioning. An experiment is performed that compares these two techniques inside the experimental Daala video codec and shows the lower complexity algorithm to be a better chroma predictor.

Rock sampling. [method for controlling particle size distribution

NASA Technical Reports Server (NTRS)

Blum, P. (Inventor)

1971-01-01

A method for sampling rock and other brittle materials and for controlling resultant particle sizes is described. The method involves cutting grooves in the rock surface to provide a grouping of parallel ridges and subsequently machining the ridges to provide a powder specimen. The machining step may comprise milling, drilling, lathe cutting or the like; but a planing step is advantageous. Control of the particle size distribution is effected primarily by changing the height and width of these ridges. This control exceeds that obtainable by conventional grinding.

Coronal CT scan measurements and hearing evolution in enlarged vestibular aqueduct syndrome.

PubMed

Saliba, Issam; Gingras-Charland, Marie-Eve; St-Cyr, Karine; Décarie, Jean-Claude

2012-04-01

To assess the correlation between the enlarged vestibular aqueduct (EVA) diameter and (1) the hearing loss level (mild, moderate, severe and profound and (2) the hearing evolution. The secondary objective was to obtain measurement limits on the coronal plane of the temporal bone CT scan for the diagnosis of EVA. Retrospective study in a tertiary pediatric center. Mastoid CT scans were reviewed to measure the VA diameter at its midpoint and operculum on axial and coronal planes in a pathologic and normal population. We used their serial audiograms to assess the evolution of hearing. 101 EVA was identified out of 1812 temporal bones CT scan from our radiologic database in 8 years. Bone conduction was stable after a mean follow-up of 40.9 ± 32.9 months. PTA has been the most affected in time by the EVA (p=0.006). No correlation was identified between impedancemetry and the diameter of the EVA. On the diagnostic audiogram, 61% of hearing loss were in the mild and moderate hearing levels; at the end of the follow-up 64% of hearing loss are still in the mild and moderate hearing levels. The cut-off values for the coronal midpoint and operculum planes on the CT scan to diagnose an EVA are 2.4 mm and 4.34 mm respectively. Conductive or mixed hearing loss might be the first manifestation of EVA. Coronal CT scan cuts can provide additional information to evaluate EVA especially when axial cuts are not conclusive. Copyright © 2012 Elsevier Ireland Ltd. All rights reserved.

An Observation of Repeating Events at local asperities during a Laboratory Stick-slip Experiment of a Saw-cut Cylindrical Lucite Sample

NASA Astrophysics Data System (ADS)

Gu, C.; Mighani, S.; Prieto, G. A.; Mok, U.; Evans, J. B.; Hager, B. H.; Toksoz, M. N.

2017-12-01

Repeating earthquakes have been found in subduction zones and interpreted as repeated ruptures of small local asperities. Repeating earthquakes have also been found in oil/gas fields, interpreted as the reactivation of pre-existing faults due to fluid injection/extraction. To mimic the fault rupture of a fault with local asperities, we designed a "stick-slip" experiment using a saw-cut cylindrical Lucite sample, which had sharp localized ridges parallel to the strike of the fault plane. The sample was subjected to conventional triaxial loading with a constant confining pressure of 10 MPa. The axial load was then increased to 6 MPa at a constant rate of 0.12 MPa/sec until the sliding occurred along the fault plane. Ultrasonic acoustic emissions (AEs) were monitored with eight PZT sensors. Two cycles of AEs were detected with the occurrence rate that decreased from the beginning to the end of each cycle, while the relative magnitudes increased. Correlation analysis indicated that these AEs were clustered into two groups - those with frequency content between 200-300kHz and a second group with frequency content between 10-50kHz. The locations of the high-frequency events, with almost identical waveforms, show that these events are from the sharp localized ridges on the saw-cut plane. The locations of the low-frequency events show an approaching process to the high-frequency events for each cycle. In this single experiment, there was a correlation of the proximity of the low-frequency events with the subsequent triggering of large high-frequency repeating events.

Left ventricle segmentation via graph cut distribution matching.

PubMed

Ben Ayed, Ismail; Punithakumar, Kumaradevan; Li, Shuo; Islam, Ali; Chong, Jaron

2009-01-01

We present a discrete kernel density matching energy for segmenting the left ventricle cavity in cardiac magnetic resonance sequences. The energy and its graph cut optimization based on an original first-order approximation of the Bhattacharyya measure have not been proposed previously, and yield competitive results in nearly real-time. The algorithm seeks a region within each frame by optimization of two priors, one geometric (distance-based) and the other photometric, each measuring a distribution similarity between the region and a model learned from the first frame. Based on global rather than pixelwise information, the proposed algorithm does not require complex training and optimization with respect to geometric transformations. Unlike related active contour methods, it does not compute iterative updates of computationally expensive kernel densities. Furthermore, the proposed first-order analysis can be used for other intractable energies and, therefore, can lead to segmentation algorithms which share the flexibility of active contours and computational advantages of graph cuts. Quantitative evaluations over 2280 images acquired from 20 subjects demonstrated that the results correlate well with independent manual segmentations by an expert.

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory.

PubMed

Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A

2016-08-25

There are several applications in computational biophysics that require the optimization of discrete interacting states, for example, amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of "maximum flow-minimum cut" graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.

Brain tumor segmentation in MR slices using improved GrowCut algorithm

NASA Astrophysics Data System (ADS)

Ji, Chunhong; Yu, Jinhua; Wang, Yuanyuan; Chen, Liang; Shi, Zhifeng; Mao, Ying

2015-12-01

The detection of brain tumor from MR images is very significant for medical diagnosis and treatment. However, the existing methods are mostly based on manual or semiautomatic segmentation which are awkward when dealing with a large amount of MR slices. In this paper, a new fully automatic method for the segmentation of brain tumors in MR slices is presented. Based on the hypothesis of the symmetric brain structure, the method improves the interactive GrowCut algorithm by further using the bounding box algorithm in the pre-processing step. More importantly, local reflectional symmetry is used to make up the deficiency of the bounding box method. After segmentation, 3D tumor image is reconstructed. We evaluate the accuracy of the proposed method on MR slices with synthetic tumors and actual clinical MR images. Result of the proposed method is compared with the actual position of simulated 3D tumor qualitatively and quantitatively. In addition, our automatic method produces equivalent performance as manual segmentation and the interactive GrowCut with manual interference while providing fully automatic segmentation.

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Purvine, Emilie AH; Monson, Kyle E.; Jurrus, Elizabeth R.

There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of maximum flow-minimum cut graph analysis. The interaction energy graph, a graph in which verticesmore » (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.« less

Cumulative area of peaks in a multidimensional high performance liquid chromatogram.

PubMed

Stevenson, Paul G; Guiochon, Georges

2013-09-20

An algorithm was developed to recognize peaks in a multidimensional separation and calculate their cumulative peak area. To find the retention times of peaks in a one dimensional chromatogram, the Savitzky-Golay smoothing filter was used to smooth and find the first through third derivatives of the experimental profiles. Close examination of the shape of these curves informs on the number of peaks that are present and provides starting values for fitting theoretical profiles. Due to the nature of comprehensive multidimensional HPLC, adjacent cut fractions may contain compounds common to more than one cut fraction. The algorithm determines which components were common in adjacent cuts and subsequently calculates the area of a two-dimensional peak profile by interpolating the surface of the 2D peaks between adjacent peaks. This algorithm was tested by calculating the cumulative peak area of a series of 2D-HPLC separations of alkylbenzenes, phenol and caffeine with varied concentrations. A good relationship was found between the concentration and the cumulative peak area. Copyright © 2013 Elsevier B.V. All rights reserved.

An Experimental Study of an Ultra-Mobile Vehicle for Off-Road Transportation.

DTIC Science & Technology

1984-09-01

commenced with the * aluminum plate from which the links will be fabricated having been cut out. Welding of the leg links is-in progress. The leg boxes , which...Control forkoulh-Ternain Locomotion i Multilegged Robot Vehicle, TEX di s~s- rt o n, March, 1984.- 28. Ozguner, F. and Kao, M.L., "A Multimicroprocessor...efficient structure. 3.3.1 Body Model The body is modelled as a hexahedral box with the top plane wider than the bottom plane, which allows the abduction

Image registration under translation and rotation in two-dimensional planes using Fourier slice theorem.

PubMed

Pohit, M; Sharma, J

2015-05-10

Image recognition in the presence of both rotation and translation is a longstanding problem in correlation pattern recognition. Use of log polar transform gives a solution to this problem, but at a cost of losing the vital phase information from the image. The main objective of this paper is to develop an algorithm based on Fourier slice theorem for measuring the simultaneous rotation and translation of an object in a 2D plane. The algorithm is applicable for any arbitrary object shift for full 180° rotation.

Computer simulation of solutions of polyharmonic equations in plane domain

NASA Astrophysics Data System (ADS)

Kazakova, A. O.

2018-05-01

A systematic study of plane problems of the theory of polyharmonic functions is presented. A method of reducing boundary problems for polyharmonic functions to the system of integral equations on the boundary of the domain is given and a numerical algorithm for simulation of solutions of this system is suggested. Particular attention is paid to the numerical solution of the main tasks when the values of the function and its derivatives are given. Test examples are considered that confirm the effectiveness and accuracy of the suggested algorithm.

How Hierarchical Topics Evolve in Large Text Corpora.

PubMed

Cui, Weiwei; Liu, Shixia; Wu, Zhuofeng; Wei, Hao

2014-12-01

Using a sequence of topic trees to organize documents is a popular way to represent hierarchical and evolving topics in text corpora. However, following evolving topics in the context of topic trees remains difficult for users. To address this issue, we present an interactive visual text analysis approach to allow users to progressively explore and analyze the complex evolutionary patterns of hierarchical topics. The key idea behind our approach is to exploit a tree cut to approximate each tree and allow users to interactively modify the tree cuts based on their interests. In particular, we propose an incremental evolutionary tree cut algorithm with the goal of balancing 1) the fitness of each tree cut and the smoothness between adjacent tree cuts; 2) the historical and new information related to user interests. A time-based visualization is designed to illustrate the evolving topics over time. To preserve the mental map, we develop a stable layout algorithm. As a result, our approach can quickly guide users to progressively gain profound insights into evolving hierarchical topics. We evaluate the effectiveness of the proposed method on Amazon's Mechanical Turk and real-world news data. The results show that users are able to successfully analyze evolving topics in text data.

Discrimination methods for biological contaminants in fresh-cut lettuce based on VNIR and NIR hyperspectral imaging

NASA Astrophysics Data System (ADS)

Mo, Changyeun; Kim, Giyoung; Kim, Moon S.; Lim, Jongguk; Lee, Seung Hyun; Lee, Hong-Seok; Cho, Byoung-Kwan

2017-09-01

The rapid detection of biological contaminants such as worms in fresh-cut vegetables is necessary to improve the efficiency of visual inspections carried out by workers. Multispectral imaging algorithms were developed using visible-near-infrared (VNIR) and near-infrared (NIR) hyperspectral imaging (HSI) techniques to detect worms in fresh-cut lettuce. The optimal wavebands that can detect worms in fresh-cut lettuce were investigated for each type of HSI using one-way ANOVA. Worm-detection imaging algorithms for VNIR and NIR imaging exhibited prediction accuracies of 97.00% (RI547/945) and 100.0% (RI1064/1176, SI1064-1176, RSI-I(1064-1173)/1064, and RSI-II(1064-1176)/(1064+1176)), respectively. The two HSI techniques revealed that spectral images with a pixel size of 1 × 1 mm or 2 × 2 mm had the best classification accuracy for worms. The results demonstrate that hyperspectral reflectance imaging techniques have the potential to detect worms in fresh-cut lettuce. Future research relating to this work will focus on a real-time sorting system for lettuce that can simultaneously detect various defects such as browning, worms, and slugs.

Optimization of coronagraph design for segmented aperture telescopes

NASA Astrophysics Data System (ADS)

Jewell, Jeffrey; Ruane, Garreth; Shaklan, Stuart; Mawet, Dimitri; Redding, Dave

2017-09-01

The goal of directly imaging Earth-like planets in the habitable zone of other stars has motivated the design of coronagraphs for use with large segmented aperture space telescopes. In order to achieve an optimal trade-off between planet light throughput and diffracted starlight suppression, we consider coronagraphs comprised of a stage of phase control implemented with deformable mirrors (or other optical elements), pupil plane apodization masks (gray scale or complex valued), and focal plane masks (either amplitude only or complex-valued, including phase only such as the vector vortex coronagraph). The optimization of these optical elements, with the goal of achieving 10 or more orders of magnitude in the suppression of on-axis (starlight) diffracted light, represents a challenging non-convex optimization problem with a nonlinear dependence on control degrees of freedom. We develop a new algorithmic approach to the design optimization problem, which we call the "Auxiliary Field Optimization" (AFO) algorithm. The central idea of the algorithm is to embed the original optimization problem, for either phase or amplitude (apodization) in various planes of the coronagraph, into a problem containing additional degrees of freedom, specifically fictitious "auxiliary" electric fields which serve as targets to inform the variation of our phase or amplitude parameters leading to good feasible designs. We present the algorithm, discuss details of its numerical implementation, and prove convergence to local minima of the objective function (here taken to be the intensity of the on-axis source in a "dark hole" region in the science focal plane). Finally, we present results showing application of the algorithm to both unobscured off-axis and obscured on-axis segmented telescope aperture designs. The application of the AFO algorithm to the coronagraph design problem has produced solutions which are capable of directly imaging planets in the habitable zone, provided end-to-end telescope system stability requirements can be met. Ongoing work includes advances of the AFO algorithm reported here to design in additional robustness to a resolved star, and other phase or amplitude aberrations to be encountered in a real segmented aperture space telescope.

Learning in fully recurrent neural networks by approaching tangent planes to constraint surfaces.

PubMed

May, P; Zhou, E; Lee, C W

2012-10-01

In this paper we present a new variant of the online real time recurrent learning algorithm proposed by Williams and Zipser (1989). Whilst the original algorithm utilises gradient information to guide the search towards the minimum training error, it is very slow in most applications and often gets stuck in local minima of the search space. It is also sensitive to the choice of learning rate and requires careful tuning. The new variant adjusts weights by moving to the tangent planes to constraint surfaces. It is simple to implement and requires no parameters to be set manually. Experimental results show that this new algorithm gives significantly faster convergence whilst avoiding problems like local minima. Copyright © 2012 Elsevier Ltd. All rights reserved.

On the Optimization of Aerospace Plane Ascent Trajectory

NASA Astrophysics Data System (ADS)

Al-Garni, Ahmed; Kassem, Ayman Hamdy

A hybrid heuristic optimization technique based on genetic algorithms and particle swarm optimization has been developed and tested for trajectory optimization problems with multi-constraints and a multi-objective cost function. The technique is used to calculate control settings for two types for ascending trajectories (constant dynamic pressure and minimum-fuel-minimum-heat) for a two-dimensional model of an aerospace plane. A thorough statistical analysis is done on the hybrid technique to make comparisons with both basic genetic algorithms and particle swarm optimization techniques with respect to convergence and execution time. Genetic algorithm optimization showed better execution time performance while particle swarm optimization showed better convergence performance. The hybrid optimization technique, benefiting from both techniques, showed superior robust performance compromising convergence trends and execution time.

Materials, devices, techniques, and applications for Z-plane focal plane array technology II; Proceedings of the Meeting, San Diego, CA, July 12, 13, 1990

NASA Astrophysics Data System (ADS)

Carson, John C.

1990-11-01

Various papers on materials, devices, techniques, and applications for X-plane focal plane array technology are presented. Individual topics addressed include: application of Z-plane technology to the remote sensing of the earth from GEO, applications of smart neuromorphic focal planes, image-processing of Z-plane technology, neural network Z-plane implementation with very high interconnection rates, using a small IR surveillance satellite for tactical applications, establishing requirements for homing applications, Z-plane technology. Also discussed are: on-array spike suppression signal processing, algorithms for on-focal-plane gamma circumvention and time-delay integration, current HYMOSS Z-technology, packaging of electrons for on- and off-FPA signal processing, space/performance qualification of tape automated bonded devices, automation in tape automated bonding, high-speed/high-volume radiometric testing of Z-technology focal planes, 128-layer HYMOSS-module fabrication issues, automation of IRFPA production processes.

Online hyperspectral imaging system for evaluating quality of agricultural products

NASA Astrophysics Data System (ADS)

Mo, Changyeun; Kim, Giyoung; Lim, Jongguk

2017-06-01

The consumption of fresh-cut agricultural produce in Korea has been growing. The browning of fresh-cut vegetables that occurs during storage and foreign substances such as worms and slugs are some of the main causes of consumers' concerns with respect to safety and hygiene. The purpose of this study is to develop an on-line system for evaluating quality of agricultural products using hyperspectral imaging technology. The online evaluation system with single visible-near infrared hyperspectral camera in the range of 400 nm to 1000 nm that can assess quality of both surfaces of agricultural products such as fresh-cut lettuce was designed. Algorithms to detect browning surface were developed for this system. The optimal wavebands for discriminating between browning and sound lettuce as well as between browning lettuce and the conveyor belt were investigated using the correlation analysis and the one-way analysis of variance method. The imaging algorithms to discriminate the browning lettuces were developed using the optimal wavebands. The ratio image (RI) algorithm of the 533 nm and 697 nm images (RI533/697) for abaxial surface lettuce and the ratio image algorithm (RI533/697) and subtraction image (SI) algorithm (SI538-697) for adaxial surface lettuce had the highest classification accuracies. The classification accuracy of browning and sound lettuce was 100.0% and above 96.0%, respectively, for the both surfaces. The overall results show that the online hyperspectral imaging system could potentially be used to assess quality of agricultural products.

Testing of the on-board attitude determination and control algorithms for SAMPEX

NASA Technical Reports Server (NTRS)

Mccullough, Jon D.; Flatley, Thomas W.; Henretty, Debra A.; Markley, F. Landis; San, Josephine K.

1993-01-01

Algorithms for on-board attitude determination and control of the Solar, Anomalous, and Magnetospheric Particle Explorer (SAMPEX) have been expanded to include a constant gain Kalman filter for the spacecraft angular momentum, pulse width modulation for the reaction wheel command, an algorithm to avoid pointing the Heavy Ion Large Telescope (HILT) instrument boresight along the spacecraft velocity vector, and the addition of digital sun sensor (DSS) failure detection logic. These improved algorithms were tested in a closed-loop environment for three orbit geometries, one with the sun perpendicular to the orbit plane, and two with the sun near the orbit plane - at Autumnal Equinox and at Winter Solstice. The closed-loop simulator was enhanced and used as a truth model for the control systems' performance evaluation and sensor/actuator contingency analysis. The simulations were performed on a VAX 8830 using a prototype version of the on-board software.

Noise-cancellation-based nonuniformity correction algorithm for infrared focal-plane arrays.

PubMed

Godoy, Sebastián E; Pezoa, Jorge E; Torres, Sergio N

2008-10-10

The spatial fixed-pattern noise (FPN) inherently generated in infrared (IR) imaging systems compromises severely the quality of the acquired imagery, even making such images inappropriate for some applications. The FPN refers to the inability of the photodetectors in the focal-plane array to render a uniform output image when a uniform-intensity scene is being imaged. We present a noise-cancellation-based algorithm that compensates for the additive component of the FPN. The proposed method relies on the assumption that a source of noise correlated to the additive FPN is available to the IR camera. An important feature of the algorithm is that all the calculations are reduced to a simple equation, which allows for the bias compensation of the raw imagery. The algorithm performance is tested using real IR image sequences and is compared to some classical methodologies. (c) 2008 Optical Society of America

Optimizing event selection with the random grid search

DOE PAGES

Bhat, Pushpalatha C.; Prosper, Harrison B.; Sekmen, Sezen; ...

2018-02-27

In this paper, the random grid search (RGS) is a simple, but efficient, stochastic algorithm to find optimal cuts that was developed in the context of the search for the top quark at Fermilab in the mid-1990s. The algorithm, and associated code, have been enhanced recently with the introduction of two new cut types, one of which has been successfully used in searches for supersymmetry at the Large Hadron Collider. The RGS optimization algorithm is described along with the recent developments, which are illustrated with two examples from particle physics. One explores the optimization of the selection of vector bosonmore » fusion events in the four-lepton decay mode of the Higgs boson and the other optimizes SUSY searches using boosted objects and the razor variables.« less

Optimizing Event Selection with the Random Grid Search

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bhat, Pushpalatha C.; Prosper, Harrison B.; Sekmen, Sezen

2017-06-29

The random grid search (RGS) is a simple, but efficient, stochastic algorithm to find optimal cuts that was developed in the context of the search for the top quark at Fermilab in the mid-1990s. The algorithm, and associated code, have been enhanced recently with the introduction of two new cut types, one of which has been successfully used in searches for supersymmetry at the Large Hadron Collider. The RGS optimization algorithm is described along with the recent developments, which are illustrated with two examples from particle physics. One explores the optimization of the selection of vector boson fusion events inmore » the four-lepton decay mode of the Higgs boson and the other optimizes SUSY searches using boosted objects and the razor variables.« less

Optimizing event selection with the random grid search

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bhat, Pushpalatha C.; Prosper, Harrison B.; Sekmen, Sezen

In this paper, the random grid search (RGS) is a simple, but efficient, stochastic algorithm to find optimal cuts that was developed in the context of the search for the top quark at Fermilab in the mid-1990s. The algorithm, and associated code, have been enhanced recently with the introduction of two new cut types, one of which has been successfully used in searches for supersymmetry at the Large Hadron Collider. The RGS optimization algorithm is described along with the recent developments, which are illustrated with two examples from particle physics. One explores the optimization of the selection of vector bosonmore » fusion events in the four-lepton decay mode of the Higgs boson and the other optimizes SUSY searches using boosted objects and the razor variables.« less

Blind restoration method of three-dimensional microscope image based on RL algorithm

NASA Astrophysics Data System (ADS)

Yao, Jin-li; Tian, Si; Wang, Xiang-rong; Wang, Jing-li

2013-08-01

Thin specimens of biological tissue appear three dimensional transparent under a microscope. The optic slice images can be captured by moving the focal planes at the different locations of the specimen. The captured image has low resolution due to the influence of the out-of-focus information comes from the planes adjacent to the local plane. Using traditional methods can remove the blur in the images at a certain degree, but it needs to know the point spread function (PSF) of the imaging system accurately. The accuracy degree of PSF influences the restoration result greatly. In fact, it is difficult to obtain the accurate PSF of the imaging system. In order to restore the original appearance of the specimen under the conditions of the imaging system parameters are unknown or there is noise and spherical aberration in the system, a blind restoration methods of three-dimensional microscope based on the R-L algorithm is proposed in this paper. On the basis of the exhaustive study of the two-dimension R-L algorithm, according to the theory of the microscopy imaging and the wavelet transform denoising pretreatment, we expand the R-L algorithm to three-dimension space. It is a nonlinear restoration method with the maximum entropy constraint. The method doesn't need to know the PSF of the microscopy imaging system precisely to recover the blur image. The image and PSF converge to the optimum solutions by many alterative iterations and corrections. The matlab simulation and experiments results show that the expansion algorithm is better in visual indicators, peak signal to noise ratio and improved signal to noise ratio when compared with the PML algorithm, and the proposed algorithm can suppress noise, restore more details of target, increase image resolution.

Graph cuts with invariant object-interaction priors: application to intervertebral disc segmentation.

PubMed

Ben Ayed, Ismail; Punithakumar, Kumaradevan; Garvin, Gregory; Romano, Walter; Li, Shuo

2011-01-01

This study investigates novel object-interaction priors for graph cut image segmentation with application to intervertebral disc delineation in magnetic resonance (MR) lumbar spine images. The algorithm optimizes an original cost function which constrains the solution with learned prior knowledge about the geometric interactions between different objects in the image. Based on a global measure of similarity between distributions, the proposed priors are intrinsically invariant with respect to translation and rotation. We further introduce a scale variable from which we derive an original fixed-point equation (FPE), thereby achieving scale-invariance with only few fast computations. The proposed priors relax the need of costly pose estimation (or registration) procedures and large training sets (we used a single subject for training), and can tolerate shape deformations, unlike template-based priors. Our formulation leads to an NP-hard problem which does not afford a form directly amenable to graph cut optimization. We proceeded to a relaxation of the problem via an auxiliary function, thereby obtaining a nearly real-time solution with few graph cuts. Quantitative evaluations over 60 intervertebral discs acquired from 10 subjects demonstrated that the proposed algorithm yields a high correlation with independent manual segmentations by an expert. We further demonstrate experimentally the invariance of the proposed geometric attributes. This supports the fact that a single subject is sufficient for training our algorithm, and confirms the relevance of the proposed priors to disc segmentation.

Automatic Recognition of Fetal Facial Standard Plane in Ultrasound Image via Fisher Vector.

PubMed

Lei, Baiying; Tan, Ee-Leng; Chen, Siping; Zhuo, Liu; Li, Shengli; Ni, Dong; Wang, Tianfu

2015-01-01

Acquisition of the standard plane is the prerequisite of biometric measurement and diagnosis during the ultrasound (US) examination. In this paper, a new algorithm is developed for the automatic recognition of the fetal facial standard planes (FFSPs) such as the axial, coronal, and sagittal planes. Specifically, densely sampled root scale invariant feature transform (RootSIFT) features are extracted and then encoded by Fisher vector (FV). The Fisher network with multi-layer design is also developed to extract spatial information to boost the classification performance. Finally, automatic recognition of the FFSPs is implemented by support vector machine (SVM) classifier based on the stochastic dual coordinate ascent (SDCA) algorithm. Experimental results using our dataset demonstrate that the proposed method achieves an accuracy of 93.27% and a mean average precision (mAP) of 99.19% in recognizing different FFSPs. Furthermore, the comparative analyses reveal the superiority of the proposed method based on FV over the traditional methods.

Cryogenically cooled detector pin mount

DOEpatents

Hunt, Jr., William E; Chrisp, Michael P

2014-06-03

A focal plane assembly facilitates a molybdenum base plate being mounted to another plate made from aluminum. The molybdenum pin is an interference fit (press fit) in the aluminum base plate. An annular cut out area in the base plate forms two annular flexures.

Capacity of non-invasive hepatic fibrosis algorithms to replace transient elastography to exclude cirrhosis in people with hepatitis C virus infection: A multi-centre observational study

PubMed Central

Riordan, Stephen M.; Bopage, Rohan; Lloyd, Andrew R.

2018-01-01

Introduction Achievement of the 2030 World Health Organisation (WHO) global hepatitis C virus (HCV) elimination targets will be underpinned by scale-up of testing and use of direct-acting antiviral treatments. In Australia, despite publically-funded testing and treatment, less than 15% of patients were treated in the first year of treatment access, highlighting the need for greater efficiency of health service delivery. To this end, non-invasive fibrosis algorithms were examined to reduce reliance on transient elastography (TE) which is currently utilised for the assessment of cirrhosis in most Australian clinical settings. Materials and methods This retrospective and prospective study, with derivation and validation cohorts, examined consecutive patients in a tertiary referral centre, a sexual health clinic, and a prison-based hepatitis program. The negative predictive value (NPV) of seven non-invasive algorithms were measured using published and newly derived cut-offs. The number of TEs avoided for each algorithm, or combination of algorithms, was determined. Results The 850 patients included 780 (92%) with HCV mono-infection, and 70 (8%) co-infected with HIV or hepatitis B. The mono-infected cohort included 612 men (79%), with an overall prevalence of cirrhosis of 16% (125/780). An ‘APRI’ algorithm cut-off of 1.0 had a 94% NPV (95%CI: 91–96%). Newly derived cut-offs of ‘APRI’ (0.49), ‘FIB-4’ (0.93) and ‘GUCI’ (0.5) algorithms each had NPVs of 99% (95%CI: 97–100%), allowing avoidance of TE in 40% (315/780), 40% (310/780) and 40% (298/749) respectively. When used in combination, NPV was retained and TE avoidance reached 54% (405/749), regardless of gender or co-infection. Conclusions Non-invasive algorithms can reliably exclude cirrhosis in many patients, allowing improved efficiency of HCV assessment services in Australia and worldwide. PMID:29438397

Capacity of non-invasive hepatic fibrosis algorithms to replace transient elastography to exclude cirrhosis in people with hepatitis C virus infection: A multi-centre observational study.

PubMed

Kelly, Melissa Louise; Riordan, Stephen M; Bopage, Rohan; Lloyd, Andrew R; Post, Jeffrey John

2018-01-01

Achievement of the 2030 World Health Organisation (WHO) global hepatitis C virus (HCV) elimination targets will be underpinned by scale-up of testing and use of direct-acting antiviral treatments. In Australia, despite publically-funded testing and treatment, less than 15% of patients were treated in the first year of treatment access, highlighting the need for greater efficiency of health service delivery. To this end, non-invasive fibrosis algorithms were examined to reduce reliance on transient elastography (TE) which is currently utilised for the assessment of cirrhosis in most Australian clinical settings. This retrospective and prospective study, with derivation and validation cohorts, examined consecutive patients in a tertiary referral centre, a sexual health clinic, and a prison-based hepatitis program. The negative predictive value (NPV) of seven non-invasive algorithms were measured using published and newly derived cut-offs. The number of TEs avoided for each algorithm, or combination of algorithms, was determined. The 850 patients included 780 (92%) with HCV mono-infection, and 70 (8%) co-infected with HIV or hepatitis B. The mono-infected cohort included 612 men (79%), with an overall prevalence of cirrhosis of 16% (125/780). An 'APRI' algorithm cut-off of 1.0 had a 94% NPV (95%CI: 91-96%). Newly derived cut-offs of 'APRI' (0.49), 'FIB-4' (0.93) and 'GUCI' (0.5) algorithms each had NPVs of 99% (95%CI: 97-100%), allowing avoidance of TE in 40% (315/780), 40% (310/780) and 40% (298/749) respectively. When used in combination, NPV was retained and TE avoidance reached 54% (405/749), regardless of gender or co-infection. Non-invasive algorithms can reliably exclude cirrhosis in many patients, allowing improved efficiency of HCV assessment services in Australia and worldwide.

Intra-operative adjustment of standard planes in C-arm CT image data.

PubMed

Brehler, Michael; Görres, Joseph; Franke, Jochen; Barth, Karl; Vetter, Sven Y; Grützner, Paul A; Meinzer, Hans-Peter; Wolf, Ivo; Nabers, Diana

2016-03-01

With the help of an intra-operative mobile C-arm CT, medical interventions can be verified and corrected, avoiding the need for a post-operative CT and a second intervention. An exact adjustment of standard plane positions is necessary for the best possible assessment of the anatomical regions of interest but the mobility of the C-arm causes the need for a time-consuming manual adjustment. In this article, we present an automatic plane adjustment at the example of calcaneal fractures. We developed two feature detection methods (2D and pseudo-3D) based on SURF key points and also transferred the SURF approach to 3D. Combined with an atlas-based registration, our algorithm adjusts the standard planes of the calcaneal C-arm images automatically. The robustness of the algorithms is evaluated using a clinical data set. Additionally, we tested the algorithm's performance for two registration approaches, two resolutions of C-arm images and two methods for metal artifact reduction. For the feature extraction, the novel 3D-SURF approach performs best. As expected, a higher resolution ([Formula: see text] voxel) leads also to more robust feature points and is therefore slightly better than the [Formula: see text] voxel images (standard setting of device). Our comparison of two different artifact reduction methods and the complete removal of metal in the images shows that our approach is highly robust against artifacts and the number and position of metal implants. By introducing our fast algorithmic processing pipeline, we developed the first steps for a fully automatic assistance system for the assessment of C-arm CT images.

A geometric method for computing ocular kinematics and classifying gaze events using monocular remote eye tracking in a robotic environment.

PubMed

Singh, Tarkeshwar; Perry, Christopher M; Herter, Troy M

2016-01-26

Robotic and virtual-reality systems offer tremendous potential for improving assessment and rehabilitation of neurological disorders affecting the upper extremity. A key feature of these systems is that visual stimuli are often presented within the same workspace as the hands (i.e., peripersonal space). Integrating video-based remote eye tracking with robotic and virtual-reality systems can provide an additional tool for investigating how cognitive processes influence visuomotor learning and rehabilitation of the upper extremity. However, remote eye tracking systems typically compute ocular kinematics by assuming eye movements are made in a plane with constant depth (e.g. frontal plane). When visual stimuli are presented at variable depths (e.g. transverse plane), eye movements have a vergence component that may influence reliable detection of gaze events (fixations, smooth pursuits and saccades). To our knowledge, there are no available methods to classify gaze events in the transverse plane for monocular remote eye tracking systems. Here we present a geometrical method to compute ocular kinematics from a monocular remote eye tracking system when visual stimuli are presented in the transverse plane. We then use the obtained kinematics to compute velocity-based thresholds that allow us to accurately identify onsets and offsets of fixations, saccades and smooth pursuits. Finally, we validate our algorithm by comparing the gaze events computed by the algorithm with those obtained from the eye-tracking software and manual digitization. Within the transverse plane, our algorithm reliably differentiates saccades from fixations (static visual stimuli) and smooth pursuits from saccades and fixations when visual stimuli are dynamic. The proposed methods provide advancements for examining eye movements in robotic and virtual-reality systems. Our methods can also be used with other video-based or tablet-based systems in which eye movements are performed in a peripersonal plane with variable depth.

Effects of light refraction on the accuracy of camera calibration and reconstruction in underwater motion analysis.

PubMed

Kwon, Young-Hoo; Casebolt, Jeffrey B

2006-01-01

One of the most serious obstacles to accurate quantification of the underwater motion of a swimmer's body is image deformation caused by refraction. Refraction occurs at the water-air interface plane (glass) owing to the density difference. Camera calibration-reconstruction algorithms commonly used in aquatic research do not have the capability to correct this refraction-induced nonlinear image deformation and produce large reconstruction errors. The aim of this paper is to provide a through review of: the nature of the refraction-induced image deformation and its behaviour in underwater object-space plane reconstruction; the intrinsic shortcomings of the Direct Linear Transformation (DLT) method in underwater motion analysis; experimental conditions that interact with refraction; and alternative algorithms and strategies that can be used to improve the calibration-reconstruction accuracy. Although it is impossible to remove the refraction error completely in conventional camera calibration-reconstruction methods, it is possible to improve the accuracy to some extent by manipulating experimental conditions or calibration frame characteristics. Alternative algorithms, such as the localized DLT and the double-plane method are also available for error reduction. The ultimate solution for the refraction problem is to develop underwater camera calibration and reconstruction algorithms that have the capability to correct refraction.

Effects of light refraction on the accuracy of camera calibration and reconstruction in underwater motion analysis.

PubMed

Kwon, Young-Hoo; Casebolt, Jeffrey B

2006-07-01

One of the most serious obstacles to accurate quantification of the underwater motion of a swimmer's body is image deformation caused by refraction. Refraction occurs at the water-air interface plane (glass) owing to the density difference. Camera calibration-reconstruction algorithms commonly used in aquatic research do not have the capability to correct this refraction-induced nonlinear image deformation and produce large reconstruction errors. The aim of this paper is to provide a thorough review of: the nature of the refraction-induced image deformation and its behaviour in underwater object-space plane reconstruction; the intrinsic shortcomings of the Direct Linear Transformation (DLT) method in underwater motion analysis; experimental conditions that interact with refraction; and alternative algorithms and strategies that can be used to improve the calibration-reconstruction accuracy. Although it is impossible to remove the refraction error completely in conventional camera calibration-reconstruction methods, it is possible to improve the accuracy to some extent by manipulating experimental conditions or calibration frame characteristics. Alternative algorithms, such as the localized DLT and the double-plane method are also available for error reduction. The ultimate solution for the refraction problem is to develop underwater camera calibration and reconstruction algorithms that have the capability to correct refraction.

An improved three-dimension reconstruction method based on guided filter and Delaunay

NASA Astrophysics Data System (ADS)

Liu, Yilin; Su, Xiu; Liang, Haitao; Xu, Huaiyuan; Wang, Yi; Chen, Xiaodong

2018-01-01

Binocular stereo vision is becoming a research hotspot in the area of image processing. Based on traditional adaptive-weight stereo matching algorithm, we improve the cost volume by averaging the AD (Absolute Difference) of RGB color channels and adding x-derivative of the grayscale image to get the cost volume. Then we use guided filter in the cost aggregation step and weighted median filter for post-processing to address the edge problem. In order to get the location in real space, we combine the deep information with the camera calibration to project each pixel in 2D image to 3D coordinate matrix. We add the concept of projection to region-growing algorithm for surface reconstruction, its specific operation is to project all the points to a 2D plane through the normals of clouds and return the results back to 3D space according to these connection relationship among the points in 2D plane. During the triangulation in 2D plane, we use Delaunay algorithm because it has optimal quality of mesh. We configure OpenCV and pcl on Visual Studio for testing, and the experimental results show that the proposed algorithm have higher computational accuracy of disparity and can realize the details of the real mesh model.

Precise positioning of an intraoral distractor using augmented reality in patients with hemifacial microsomia.

PubMed

Qu, Miao; Hou, Yikang; Xu, Yourong; Shen, Congcong; Zhu, Ming; Xie, Le; Wang, Hao; Zhang, Yan; Chai, Gang

2015-01-01

Through three-dimensional real time imaging, augmented reality (AR) can provide an overlay of the anatomical structure, or visual cues for specific landmarks. In this study, an AR Toolkit was used for distraction osteogenesis with hemifacial microsomia to define the mandibular osteotomy line and assist with intraoral distractor placement. 20 patients with hemifacial microsomia were studied and were randomly assigned to experimental and control groups. Pre-operative computed tomography was used in both groups, whereas AR was used in the experimental group. Afterwards, pre- and post-operative computed tomographic scans of both groups were superimposed, and several measurements were made and analysed. Both the conventional method and AR technique achieved proper positioning of the osteotomy planes, although the AR was more accurate. The difference in average vertical distance from the coronoid and condyle process to the pre- and post-operative cutting planes was significant (p < 0.01) between the two groups, whereas no significant difference (p > 0.05) was observed in the average angle between the two planes. The difference in deviations between the intersection points of the overlaid mandible across two cutting planes was also significant (p < 0.01). This study reports on an efficient approach for guiding intraoperative distraction osteogenesis. Augmented reality tools such as the AR Toolkit may be helpful for precise positioning of intraoral distractors in patients with hemifacial microsomia in craniofacial surgery. Copyright © 2014 European Association for Cranio-Maxillo-Facial Surgery. Published by Elsevier Ltd. All rights reserved.

[Mathematical model of oblique three-dimensional intertrochanteric detorsion varus-forming osteotomy of the femur by the Bernbeck method in surgical treatment of congenital hip dysplasia in children].

PubMed

Bohatyrewicz, A

1992-01-01

Whenever the conservative procedure fails to bring about congruence of the dysplastic hip joint, an operative procedure becomes indispensable. In Orthopaedic Clinic of the Pomeranian Medical Academy in Szczecin we implement the oblique three-dimensional intertrochanteric detorsion and varus forming osteotomy after Bernbeck in order to correct the proximal end of the femoral bone. Precise determination of the plane to be cut, prior to the operative procedure, simplifies and shortens the operation itself and facilitates the achieving of the planned angular values in all three planes. Mathematical model of osteotomy according to Bernbeck considering required angles of correction as well as angles determining the plane of osteotomy was worked out. In collaboration of the Szczecin Technical University, a simple computer program was elaborated which allowed the presentation of the results in the form of tables. With the help of tables the optimal cutting plane was chosen and created correct biomechanical and anatomical conditions as well as optimal conditions for stable osteosynthesis of dissected fragments of the femoral bone. That type of osteotomy is useful in most operative correcrions of the dysplastic hip joint (not great varus formation connected with relatively extensive detorsion). The achieved congruence in the 22 dysplastic hip joints operated on was the most important condition for their later physiological development. Short post-operative observations confirm the value of described mathematic model.

Fracture mechanics of shear crack propagation and dissection in the healthy bovine descending aortic media.

PubMed

Haslach, Henry W; Siddiqui, Ahmed; Weerasooriya, Amanda; Nguyen, Ryan; Roshgadol, Jacob; Monforte, Noel; McMahon, Eileen

2018-03-01

This experimental study adopts a fracture mechanics strategy to investigate the mechanical cause of aortic dissection. Inflation of excised healthy bovine aortic rings with a cut longitudinal notch that extends into the media from the intima suggests that an intimal tear may propagate a nearly circumferential-longitudinal rupture surface that is similar to the delamination that occurs in aortic dissection. Radial and 45°-from-radial cut notch orientations, as seen in the thickness surface, produce similar circumferential crack propagation morphologies. Partial cut notches, whose longitudinal length is half the width of the ring, measure the influence of longitudinal material on crack propagation. Such specimens also produce circumferential cracks from the notch root that are visible in the thickness circumferential-radial plane, and often propagate a secondary crack from the base of the notch, visible in the intimal circumferential-longitudinal plane. Inflation of rings with pairs of cut notches demonstrates that a second notch modifies the propagation created in a specimen with a single notch. The circumferential crack propagation is likely a consequence of the laminar medial structure. These fracture surfaces are probably due to non-uniform circumferential shear deformation in the heterogeneous media as the aortic wall expands. The qualitative deformation morphology around the root of the cut notch during inflation is evidence for such shear deformation. The shear apparently results from relative slip in the circumferential direction of collagen fibers. The slip may produce shear in the longitudinal-circumferential plane between medial layers or in the radial-circumferential plane within a medial lamina in an idealized model. Circumferential crack propagation in the media is then a shear mechanical process that might be facilitated by disease of the tissue. An intimal tear of an apparently healthy aortic wall near the aortic arch is life-threatening because it may lead to full rupture or to wall dissection in which delamination of the medial layer extends around most of the aortic circumference. The mechanical events underlying dissection are not definitively established. This experimental fracture mechanics study provides evidence that shear rupture is the main mechanical process underlying aortic dissection. The commonly performed tensile strength tests of aortic tissue are not clinically useful to predict or describe aortic dissection. One implication of the study is that shear tests might produce more fruitful simple assessments of the aortic wall strength. A clinical implication is that when presented with an intimal tear, those who guide care might recommend steps to reduce the shear load on the aorta. Copyright © 2017 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Electromagnetic Wave Excitation by a Longitudinal Slot in a Broad Wall of Rectangular Waveguide in the Presence of Passive Impedance Vibrators Outside the Waveguide

NASA Astrophysics Data System (ADS)

Berdnik, S. L.; Katrich, V. A.; Nesterenko, M. V.; Penkin, Yu. M.

2016-09-01

Purpose: A problem of electromagnetic wave diffraction by a longitudinal slot cut in a waveguide wide wall is solved. The slot is cut in a wide wall of a rectangular waveguide and radiates in a half-space above a perfectly conducting plane where two vertical impedance monopoles with arbitrary lengths placed with their bases placed on the plane. The paper is aimed at studying the electrodynamic characteristics of vibratorwaveguide-slot structures which allow to form the emission fields as that in a Clavin element with two identical passive ideally conducting monopoles of a fixed length located on a set distance from a slot center on both sides of a narrow halfwave slot. Design/methodology/approach: The problem is solved by a generalized method of induced electromotive and magnetomotive forces in approximation of electric currents in the vibrators and equivalent magnetic current in the slot by the functions obtained by the asymptotic averaging method. Findings: The influence of geometric parameters of the structure on the directional characteristics of Clavin type element is analyzed on the assumption of simultaneous account for relative level of sidelobes in the E-plane and beamwidth differences at -3 dB level in the main planes. It is shown that the directional characteristics and energy characteristics of the radiators: radiation and reflection coefficients, antenna directivity and gain can be varied within wide limits by changing the electrical length and/or distributed surface impedances of the vibrators, providing at that a low level of radiation within a slot plane. Conclusions: The results obtained can be useful when designing both small-size and multi-element antenna arrays with Clavin elements.

Single-intensity-recording optical encryption technique based on phase retrieval algorithm and QR code

NASA Astrophysics Data System (ADS)

Wang, Zhi-peng; Zhang, Shuai; Liu, Hong-zhao; Qin, Yi

2014-12-01

Based on phase retrieval algorithm and QR code, a new optical encryption technology that only needs to record one intensity distribution is proposed. In this encryption process, firstly, the QR code is generated from the information to be encrypted; and then the generated QR code is placed in the input plane of 4-f system to have a double random phase encryption. For only one intensity distribution in the output plane is recorded as the ciphertext, the encryption process is greatly simplified. In the decryption process, the corresponding QR code is retrieved using phase retrieval algorithm. A priori information about QR code is used as support constraint in the input plane, which helps solve the stagnation problem. The original information can be recovered without distortion by scanning the QR code. The encryption process can be implemented either optically or digitally, and the decryption process uses digital method. In addition, the security of the proposed optical encryption technology is analyzed. Theoretical analysis and computer simulations show that this optical encryption system is invulnerable to various attacks, and suitable for harsh transmission conditions.

A robust approach to chance constrained optimal power flow with renewable generation

DOE PAGES

Lubin, Miles; Dvorkin, Yury; Backhaus, Scott N.

2016-09-01

Optimal Power Flow (OPF) dispatches controllable generation at minimum cost subject to operational constraints on generation and transmission assets. The uncertainty and variability of intermittent renewable generation is challenging current deterministic OPF approaches. Recent formulations of OPF use chance constraints to limit the risk from renewable generation uncertainty, however, these new approaches typically assume the probability distributions which characterize the uncertainty and variability are known exactly. We formulate a robust chance constrained (RCC) OPF that accounts for uncertainty in the parameters of these probability distributions by allowing them to be within an uncertainty set. The RCC OPF is solved usingmore » a cutting-plane algorithm that scales to large power systems. We demonstrate the RRC OPF on a modified model of the Bonneville Power Administration network, which includes 2209 buses and 176 controllable generators. In conclusion, deterministic, chance constrained (CC), and RCC OPF formulations are compared using several metrics including cost of generation, area control error, ramping of controllable generators, and occurrence of transmission line overloads as well as the respective computational performance.« less

Reconfigurable manufacturing execution system for pipe cutting

NASA Astrophysics Data System (ADS)

Yin, Y. H.; Xie, J. Y.

2011-08-01

This article presents a reconfigurable manufacturing execution system (RMES) filling the gap between enterprise resource planning and resource layer for pipe-cutting production with mass customisation and rapid adaptation to dynamic market, which consists of planning and scheduling layer and executive control layer. Starting from customer's task and process requirements, the cutting trajectories are planned under generalised mathematical model able to reconfigure in accordance with various intersecting types' joint, and all tasks are scheduled by nesting algorithm to maximise the utilisation rate of rough material. This RMES for pipe cutting has been effectively implemented in more than 100 companies.

Use of One Time Pad Algorithm for Bit Plane Security Improvement

NASA Astrophysics Data System (ADS)

Suhardi; Suwilo, Saib; Budhiarti Nababan, Erna

2017-12-01

BPCS (Bit-Plane Complexity Segmentation) which is one of the steganography techniques that utilizes the human vision characteristics that cannot see the change in binary patterns that occur in the image. This technique performs message insertion by making a switch to a high-complexity bit-plane or noise-like regions with bits of secret messages. Bit messages that were previously stored precisely result the message extraction process to be done easily by rearranging a set of previously stored characters in noise-like region in the image. Therefore the secret message becomes easily known by others. In this research, the process of replacing bit plane with message bits is modified by utilizing One Time Pad cryptography technique which aims to increase security in bit plane. In the tests performed, the combination of One Time Pad cryptographic algorithm to the steganography technique of BPCS works well in the insertion of messages into the vessel image, although in insertion into low-dimensional images is poor. The comparison of the original image with the stegoimage looks identical and produces a good quality image with a mean value of PSNR above 30db when using a largedimensional image as the cover messages.

Robust numerical electromagnetic eigenfunction expansion algorithms

NASA Astrophysics Data System (ADS)

Sainath, Kamalesh

This thesis summarizes developments in rigorous, full-wave, numerical spectral-domain (integral plane wave eigenfunction expansion [PWE]) evaluation algorithms concerning time-harmonic electromagnetic (EM) fields radiated by generally-oriented and positioned sources within planar and tilted-planar layered media exhibiting general anisotropy, thickness, layer number, and loss characteristics. The work is motivated by the need to accurately and rapidly model EM fields radiated by subsurface geophysical exploration sensors probing layered, conductive media, where complex geophysical and man-made processes can lead to micro-laminate and micro-fractured geophysical formations exhibiting, at the lower (sub-2MHz) frequencies typically employed for deep EM wave penetration through conductive geophysical media, bulk-scale anisotropic (i.e., directional) electrical conductivity characteristics. When the planar-layered approximation (layers of piecewise-constant material variation and transversely-infinite spatial extent) is locally, near the sensor region, considered valid, numerical spectral-domain algorithms are suitable due to their strong low-frequency stability characteristic, and ability to numerically predict time-harmonic EM field propagation in media with response characterized by arbitrarily lossy and (diagonalizable) dense, anisotropic tensors. If certain practical limitations are addressed, PWE can robustly model sensors with general position and orientation that probe generally numerous, anisotropic, lossy, and thick layers. The main thesis contributions, leading to a sensor and geophysical environment-robust numerical modeling algorithm, are as follows: (1) Simple, rapid estimator of the region (within the complex plane) containing poles, branch points, and branch cuts (critical points) (Chapter 2), (2) Sensor and material-adaptive azimuthal coordinate rotation, integration contour deformation, integration domain sub-region partition and sub-region-dependent integration order (Chapter 3), (3) Integration partition-extrapolation-based (Chapter 3) and Gauss-Laguerre Quadrature (GLQ)-based (Chapter 4) evaluations of the deformed, semi-infinite-length integration contour tails, (4) Robust in-situ-based (i.e., at the spectral-domain integrand level) direct/homogeneous-medium field contribution subtraction and analytical curbing of the source current spatial spectrum function's ill behavior (Chapter 5), and (5) Analytical re-casting of the direct-field expressions when the source is embedded within a NBAM, short for non-birefringent anisotropic medium (Chapter 6). The benefits of these contributions are, respectively, (1) Avoiding computationally intensive critical-point location and tracking (computation time savings), (2) Sensor and material-robust curbing of the integrand's oscillatory and slow decay behavior, as well as preventing undesirable critical-point migration within the complex plane (computation speed, precision, and instability-avoidance benefits), (3) sensor and material-robust reduction (or, for GLQ, elimination) of integral truncation error, (4) robustly stable modeling of scattered fields and/or fields radiated from current sources modeled as spatially distributed (10 to 1000-fold compute-speed acceleration also realized for distributed-source computations), and (5) numerically stable modeling of fields radiated from sources within NBAM layers. Having addressed these limitations, are PWE algorithms applicable to modeling EM waves in tilted planar-layered geometries too? This question is explored in Chapter 7 using a Transformation Optics-based approach, allowing one to model wave propagation through layered media that (in the sensor's vicinity) possess tilted planar interfaces. The technique leads to spurious wave scattering however, whose induced computation accuracy degradation requires analysis. Mathematical exhibition, and exhaustive simulation-based study and analysis of the limitations of, this novel tilted-layer modeling formulation is Chapter 7's main contribution.

CHEMINFORMATICS TOOLS FOR TOXICANT CHARACTERIZATION

EPA Science Inventory

• Continued development of the Shape Signatures method is planed.  This effort will include further development of the Shape Signatures database of PDB-extracted ligands and of the clustering algorithm.

• In addition, we plan to develop an...

• Improved neural network based scene-adaptive nonuniformity correction method for infrared focal plane arrays.

  PubMed

  Lai, Rui; Yang, Yin-tang; Zhou, Duan; Li, Yue-jin

  2008-08-20

  An improved scene-adaptive nonuniformity correction (NUC) algorithm for infrared focal plane arrays (IRFPAs) is proposed. This method simultaneously estimates the infrared detectors' parameters and eliminates the nonuniformity causing fixed pattern noise (FPN) by using a neural network (NN) approach. In the learning process of neuron parameter estimation, the traditional LMS algorithm is substituted with the newly presented variable step size (VSS) normalized least-mean square (NLMS) based adaptive filtering algorithm, which yields faster convergence, smaller misadjustment, and lower computational cost. In addition, a new NN structure is designed to estimate the desired target value, which promotes the calibration precision considerably. The proposed NUC method reaches high correction performance, which is validated by the experimental results quantitatively tested with a simulative testing sequence and a real infrared image sequence.

• Padé approximations for Painlevé I and II transcendents

  NASA Astrophysics Data System (ADS)

  Novokshenov, V. Yu.

  2009-06-01

  We use a version of the Fair-Luke algorithm to find the Padé approximate solutions of the Painlevé I and II equations. We find the distributions of poles for the well-known Ablowitz-Segur and Hastings-McLeod solutions of the Painlevé II equation. We show that the Boutroux tritronquée solution of the Painleé I equation has poles only in the critical sector of the complex plane. The algorithm allows checking other analytic properties of the Painlevé transcendents, such as the asymptotic behavior at infinity in the complex plane.

• Structural Stability of Mathematical Models of National Economy

  NASA Astrophysics Data System (ADS)

  Ashimov, Abdykappar A.; Sultanov, Bahyt T.; Borovskiy, Yuriy V.; Adilov, Zheksenbek M.; Ashimov, Askar A.

  2011-12-01

  In the paper we test robustness of particular dynamic systems in a compact regions of a plane and a weak structural stability of one dynamic system of high order in a compact region of its phase space. The test was carried out based on the fundamental theory of dynamical systems on a plane and based on the conditions for weak structural stability of high order dynamic systems. A numerical algorithm for testing the weak structural stability of high order dynamic systems has been proposed. Based on this algorithm we assess the weak structural stability of one computable general equilibrium model.

• Segmentation of large periapical lesions toward dental computer-aided diagnosis in cone-beam CT scans

  NASA Astrophysics Data System (ADS)

  Rysavy, Steven; Flores, Arturo; Enciso, Reyes; Okada, Kazunori

  2008-03-01

  This paper presents an experimental study for assessing the applicability of general-purpose 3D segmentation algorithms for analyzing dental periapical lesions in cone-beam computed tomography (CBCT) scans. In the field of Endodontics, clinical studies have been unable to determine if a periapical granuloma can heal with non-surgical methods. Addressing this issue, Simon et al. recently proposed a diagnostic technique which non-invasively classifies target lesions using CBCT. Manual segmentation exploited in their study, however, is too time consuming and unreliable for real world adoption. On the other hand, many technically advanced algorithms have been proposed to address segmentation problems in various biomedical and non-biomedical contexts, but they have not yet been applied to the field of dentistry. Presented in this paper is a novel application of such segmentation algorithms to the clinically-significant dental problem. This study evaluates three state-of-the-art graph-based algorithms: a normalized cut algorithm based on a generalized eigen-value problem, a graph cut algorithm implementing energy minimization techniques, and a random walks algorithm derived from discrete electrical potential theory. In this paper, we extend the original 2D formulation of the above algorithms to segment 3D images directly and apply the resulting algorithms to the dental CBCT images. We experimentally evaluate quality of the segmentation results for 3D CBCT images, as well as their 2D cross sections. The benefits and pitfalls of each algorithm are highlighted.

• Differential and relaxed image foresting transform for graph-cut segmentation of multiple 3D objects.

  PubMed

  Moya, Nikolas; Falcão, Alexandre X; Ciesielski, Krzysztof C; Udupa, Jayaram K

  2014-01-01

  Graph-cut algorithms have been extensively investigated for interactive binary segmentation, when the simultaneous delineation of multiple objects can save considerable user's time. We present an algorithm (named DRIFT) for 3D multiple object segmentation based on seed voxels and Differential Image Foresting Transforms (DIFTs) with relaxation. DRIFT stands behind efficient implementations of some state-of-the-art methods. The user can add/remove markers (seed voxels) along a sequence of executions of the DRIFT algorithm to improve segmentation. Its first execution takes linear time with the image's size, while the subsequent executions for corrections take sublinear time in practice. At each execution, DRIFT first runs the DIFT algorithm, then it applies diffusion filtering to smooth boundaries between objects (and background) and, finally, it corrects possible objects' disconnection occurrences with respect to their seeds. We evaluate DRIFT in 3D CT-images of the thorax for segmenting the arterial system, esophagus, left pleural cavity, right pleural cavity, trachea and bronchi, and the venous system.

• Algorithms for extraction of structural attitudes from 3D outcrop models

  NASA Astrophysics Data System (ADS)

  Duelis Viana, Camila; Endlein, Arthur; Ademar da Cruz Campanha, Ginaldo; Henrique Grohmann, Carlos

  2016-05-01

  The acquisition of geological attitudes on rock cuts using traditional field compass survey can be a time consuming, dangerous, or even impossible task depending on the conditions and location of outcrops. The importance of this type of data in rock-mass classifications and structural geology has led to the development of new techniques, in which the application of photogrammetric 3D digital models has had an increasing use. In this paper we present two algorithms for extraction of attitudes of geological discontinuities from virtual outcrop models: ply2atti and scanline, implemented with the Python programming language. The ply2atti algorithm allows for the virtual sampling of planar discontinuities appearing on the 3D model as individual exposed surfaces, while the scanline algorithm allows the sampling of discontinuities (surfaces and traces) along a virtual scanline. Application to digital models of a simplified test setup and a rock cut demonstrated a good correlation between the surveys undertaken using traditional field compass reading and virtual sampling on 3D digital models.

• The effect of workstation and task variables on forces applied during simulated meat cutting.

  PubMed

  McGorry, Raymond W; Dempsey, Patrick G; O'Brien, Niall V

  2004-12-01

  The purpose of the study was to investigate factors related to force and postural exposure during a simulated meat cutting task. The hypothesis was that workstation, tool and task variables would affect the dependent kinetic variables of gripping force, cutting moment and the dependent kinematic variables of elbow elevation and wrist angular displacement in the flexion/extension and radial/ulnar deviation planes. To evaluate this hypothesis a 3 x 3 x 2 x 2 x 2 (surface orientation by surface height by blade angle by cut complexity by work pace) within-subject factorial design was conducted with 12 participants. The results indicated that the variables can act and interact to modify the kinematics and kinetics of a cutting task. Participants used greater grip force and cutting moment when working at a pace based on productivity. The interactions of the work surface height and orientation indicated that the use of an adjustable workstation could minimize wrist deviation from neutral and improve shoulder posture during cutting operations. Angling the knife blade also interacted with workstation variables to improve wrist and upper extremity posture, but this benefit must be weighed against the potential for small increases in force exposure.

Deeper Insights into the Circumgalactic Medium using Multivariate Analysis Methods

NASA Astrophysics Data System (ADS)

Lewis, James; Churchill, Christopher W.; Nielsen, Nikole M.; Kacprzak, Glenn

2017-01-01

Drawing from a database of galaxies whose surrounding gas has absorption from MgII, called the MgII-Absorbing Galaxy Catalog (MAGIICAT, Neilsen et al 2013), we studied the circumgalactic medium (CGM) for a sample of 47 galaxies. Using multivariate analysis, in particular the k-means clustering algorithm, we determined that simultaneously examining column density (N), rest-frame B-K color, virial mass, and azimuthal angle (the projected angle between the galaxy major axis and the quasar line of sight) yields two distinct populations: (1) bluer, lower mass galaxies with higher column density along the minor axis, and (2) redder, higher mass galaxies with lower column density along the major axis. We support this grouping by running (i) two-sample, two-dimensional Kolmogorov-Smirnov (KS) tests on each of the six bivariate planes and (ii) two-sample KS tests on each of the four variables to show that the galaxies significantly cluster into two independent populations. To account for the fact that 16 of our 47 galaxies have upper limits on N, we performed Monte-Carlo tests whereby we replaced upper limits with random deviates drawn from a Schechter distribution fit, f(N). These tests strengthen the results of the KS tests. We examined the behavior of the MgII λ2796 absorption line equivalent width and velocity width for each galaxy population. We find that equivalent width and velocity width do not show similar characteristic distinctions between the two galaxy populations. We discuss the k-means clustering algorithm for optimizing the analysis of populations within datasets as opposed to using arbitrary bivariate subsample cuts. We also discuss the power of the k-means clustering algorithm in extracting deeper physical insight into the CGM in relationship to host galaxies.

Computer-aided design of bevel gear tooth surfaces

NASA Technical Reports Server (NTRS)

Shuo, Hung Chang; Huston, Ronald L.; Coy, John J.

1989-01-01

This paper presents a computer-aided design procedure for generating bevel gears. The development is based on examining a perfectly plastic, cone-shaped gear blank rolling over a cutting tooth on a plane crown rack. The resulting impression on the plastic gear blank is the envelope of the cutting tooth. This impression and envelope thus form a conjugate tooth surface. Equations are presented for the locus of points on the tooth surface. The same procedures are then extended to simulate the generation of a spiral bevel gear. The corresponding governing equations are presented.

Computer aided design of bevel gear tooth surfaces

NASA Technical Reports Server (NTRS)

Chang, S. H.; Huston, R. L.; Coy, J. J.

1989-01-01

This paper presents a computer-aided design procedure for generating bevel gears. The development is based on examining a perfectly plastic, cone-shaped gear blank rolling over a cutting tooth on a plane crown rack. The resulting impression on the plastic gear blank is the envelope of the cutting tooth. This impression and envelope thus form a conjugate tooth surface. Equations are presented for the locus of points on the tooth surface. The same procedures are then extended to simulate the generation of a spiral bevel gear. The corresponding governing equations are presented.

Rapid near-optimal aerospace plane trajectory generation and guidance

NASA Technical Reports Server (NTRS)

Calise, A. J.; Corban, J. E.; Markopoulos, N.

1991-01-01

Effort was directed toward the problems of the real time trajectory optimization and guidance law development for the National Aerospace Plane (NASP) applications. In particular, singular perturbation methods were used to develop guidance algorithms suitable for onboard, real time implementation. The progress made in this research effort is reported.

Patch-based iterative conditional geostatistical simulation using graph cuts

NASA Astrophysics Data System (ADS)

Li, Xue; Mariethoz, Gregoire; Lu, DeTang; Linde, Niklas

2016-08-01

Training image-based geostatistical methods are increasingly popular in groundwater hydrology even if existing algorithms present limitations that often make real-world applications difficult. These limitations include a computational cost that can be prohibitive for high-resolution 3-D applications, the presence of visual artifacts in the model realizations, and a low variability between model realizations due to the limited pool of patterns available in a finite-size training image. In this paper, we address these issues by proposing an iterative patch-based algorithm which adapts a graph cuts methodology that is widely used in computer graphics. Our adapted graph cuts method optimally cuts patches of pixel values borrowed from the training image and assembles them successively, each time accounting for the information of previously stitched patches. The initial simulation result might display artifacts, which are identified as regions of high cost. These artifacts are reduced by iteratively placing new patches in high-cost regions. In contrast to most patch-based algorithms, the proposed scheme can also efficiently address point conditioning. An advantage of the method is that the cut process results in the creation of new patterns that are not present in the training image, thereby increasing pattern variability. To quantify this effect, a new measure of variability is developed, the merging index, quantifies the pattern variability in the realizations with respect to the training image. A series of sensitivity analyses demonstrates the stability of the proposed graph cuts approach, which produces satisfying simulations for a wide range of parameters values. Applications to 2-D and 3-D cases are compared to state-of-the-art multiple-point methods. The results show that the proposed approach obtains significant speedups and increases variability between realizations. Connectivity functions applied to 2-D models transport simulations in 3-D models are used to demonstrate that pattern continuity is preserved.

The artificial-free technique along the objective direction for the simplex algorithm

NASA Astrophysics Data System (ADS)

Boonperm, Aua-aree; Sinapiromsaran, Krung

2014-03-01

The simplex algorithm is a popular algorithm for solving linear programming problems. If the origin point satisfies all constraints then the simplex can be started. Otherwise, artificial variables will be introduced to start the simplex algorithm. If we can start the simplex algorithm without using artificial variables then the simplex iterate will require less time. In this paper, we present the artificial-free technique for the simplex algorithm by mapping the problem into the objective plane and splitting constraints into three groups. In the objective plane, one of variables which has a nonzero coefficient of the objective function is fixed in terms of another variable. Then it can split constraints into three groups: the positive coefficient group, the negative coefficient group and the zero coefficient group. Along the objective direction, some constraints from the positive coefficient group will form the optimal solution. If the positive coefficient group is nonempty, the algorithm starts with relaxing constraints from the negative coefficient group and the zero coefficient group. We guarantee the feasible region obtained from the positive coefficient group to be nonempty. The transformed problem is solved using the simplex algorithm. Additional constraints from the negative coefficient group and the zero coefficient group will be added to the solved problem and use the dual simplex method to determine the new optimal solution. An example shows the effectiveness of our algorithm.

Speedup of minimum discontinuity phase unwrapping algorithm with a reference phase distribution

NASA Astrophysics Data System (ADS)

Liu, Yihang; Han, Yu; Li, Fengjiao; Zhang, Qican

2018-06-01

In three-dimensional (3D) shape measurement based on phase analysis, the phase analysis process usually produces a wrapped phase map ranging from - π to π with some 2 π discontinuities, and thus a phase unwrapping algorithm is necessary to recover the continuous and nature phase map from which 3D height distribution can be restored. Usually, the minimum discontinuity phase unwrapping algorithm can be used to solve many different kinds of phase unwrapping problems, but its main drawback is that it requires a large amount of computations and has low efficiency in searching for the improving loop within the phase's discontinuity area. To overcome this drawback, an improvement to speedup of the minimum discontinuity phase unwrapping algorithm by using the phase distribution on reference plane is proposed. In this improved algorithm, before the minimum discontinuity phase unwrapping algorithm is carried out to unwrap phase, an integer number K was calculated from the ratio of the wrapped phase to the nature phase on a reference plane. And then the jump counts of the unwrapped phase can be reduced by adding 2K π, so the efficiency of the minimum discontinuity phase unwrapping algorithm is significantly improved. Both simulated and experimental data results verify the feasibility of the proposed improved algorithm, and both of them clearly show that the algorithm works very well and has high efficiency.

Experimental test of theory for the stability of partially saturated vertical cut slopes

USGS Publications Warehouse

Morse, Michael M.; Lu, N.; Wayllace, Alexandra; Godt, Jonathan W.; Take, W.A.

2014-01-01

This paper extends Culmann's vertical-cut analysis to unsaturated soils. To test the extended theory, unsaturated sand was compacted to a uniform porosity and moisture content in a laboratory apparatus. A sliding door that extended the height of the free face of the slope was lowered until the vertical cut failed. Digital images of the slope cross section and upper surface were acquired concurrently. A recently developed particle image velocimetry (PIV) tool was used to quantify soil displacement. The PIV analysis showed strain localization at varying distances from the sliding door prior to failure. The areas of localized strain were coincident with the location of the slope crest after failure. Shear-strength and soil-water-characteristic parameters of the sand were independently tested for use in extended analyses of the vertical-cut stability and of the failure plane angle. Experimental failure heights were within 22.3% of the heights predicted using the extended theory.

Bladder segmentation in MR images with watershed segmentation and graph cut algorithm

NASA Astrophysics Data System (ADS)

Blaffert, Thomas; Renisch, Steffen; Schadewaldt, Nicole; Schulz, Heinrich; Wiemker, Rafael

2014-03-01

Prostate and cervix cancer diagnosis and treatment planning that is based on MR images benefit from superior soft tissue contrast compared to CT images. For these images an automatic delineation of the prostate or cervix and the organs at risk such as the bladder is highly desirable. This paper describes a method for bladder segmentation that is based on a watershed transform on high image gradient values and gray value valleys together with the classification of watershed regions into bladder contents and tissue by a graph cut algorithm. The obtained results are superior if compared to a simple region-after-region classification.

Fat water decomposition using globally optimal surface estimation (GOOSE) algorithm.

PubMed

Cui, Chen; Wu, Xiaodong; Newell, John D; Jacob, Mathews

2015-03-01

This article focuses on developing a novel noniterative fat water decomposition algorithm more robust to fat water swaps and related ambiguities. Field map estimation is reformulated as a constrained surface estimation problem to exploit the spatial smoothness of the field, thus minimizing the ambiguities in the recovery. Specifically, the differences in the field map-induced frequency shift between adjacent voxels are constrained to be in a finite range. The discretization of the above problem yields a graph optimization scheme, where each node of the graph is only connected with few other nodes. Thanks to the low graph connectivity, the problem is solved efficiently using a noniterative graph cut algorithm. The global minimum of the constrained optimization problem is guaranteed. The performance of the algorithm is compared with that of state-of-the-art schemes. Quantitative comparisons are also made against reference data. The proposed algorithm is observed to yield more robust fat water estimates with fewer fat water swaps and better quantitative results than other state-of-the-art algorithms in a range of challenging applications. The proposed algorithm is capable of considerably reducing the swaps in challenging fat water decomposition problems. The experiments demonstrate the benefit of using explicit smoothness constraints in field map estimation and solving the problem using a globally convergent graph-cut optimization algorithm. © 2014 Wiley Periodicals, Inc.

Optimization process planning using hybrid genetic algorithm and intelligent search for job shop machining.

PubMed

Salehi, Mojtaba; Bahreininejad, Ardeshir

2011-08-01

Optimization of process planning is considered as the key technology for computer-aided process planning which is a rather complex and difficult procedure. A good process plan of a part is built up based on two elements: (1) the optimized sequence of the operations of the part; and (2) the optimized selection of the machine, cutting tool and Tool Access Direction (TAD) for each operation. In the present work, the process planning is divided into preliminary planning, and secondary/detailed planning. In the preliminary stage, based on the analysis of order and clustering constraints as a compulsive constraint aggregation in operation sequencing and using an intelligent searching strategy, the feasible sequences are generated. Then, in the detailed planning stage, using the genetic algorithm which prunes the initial feasible sequences, the optimized operation sequence and the optimized selection of the machine, cutting tool and TAD for each operation based on optimization constraints as an additive constraint aggregation are obtained. The main contribution of this work is the optimization of sequence of the operations of the part, and optimization of machine selection, cutting tool and TAD for each operation using the intelligent search and genetic algorithm simultaneously.

Optimization process planning using hybrid genetic algorithm and intelligent search for job shop machining

PubMed Central

Salehi, Mojtaba

2010-01-01

Optimization of process planning is considered as the key technology for computer-aided process planning which is a rather complex and difficult procedure. A good process plan of a part is built up based on two elements: (1) the optimized sequence of the operations of the part; and (2) the optimized selection of the machine, cutting tool and Tool Access Direction (TAD) for each operation. In the present work, the process planning is divided into preliminary planning, and secondary/detailed planning. In the preliminary stage, based on the analysis of order and clustering constraints as a compulsive constraint aggregation in operation sequencing and using an intelligent searching strategy, the feasible sequences are generated. Then, in the detailed planning stage, using the genetic algorithm which prunes the initial feasible sequences, the optimized operation sequence and the optimized selection of the machine, cutting tool and TAD for each operation based on optimization constraints as an additive constraint aggregation are obtained. The main contribution of this work is the optimization of sequence of the operations of the part, and optimization of machine selection, cutting tool and TAD for each operation using the intelligent search and genetic algorithm simultaneously. PMID:21845020

Proposed algorithm to improve job shop production scheduling using ant colony optimization method

NASA Astrophysics Data System (ADS)

Pakpahan, Eka KA; Kristina, Sonna; Setiawan, Ari

2017-12-01

This paper deals with the determination of job shop production schedule on an automatic environment. On this particular environment, machines and material handling system are integrated and controlled by a computer center where schedule were created and then used to dictate the movement of parts and the operations at each machine. This setting is usually designed to have an unmanned production process for a specified interval time. We consider here parts with various operations requirement. Each operation requires specific cutting tools. These parts are to be scheduled on machines each having identical capability, meaning that each machine is equipped with a similar set of cutting tools therefore is capable of processing any operation. The availability of a particular machine to process a particular operation is determined by the remaining life time of its cutting tools. We proposed an algorithm based on the ant colony optimization method and embedded them on matlab software to generate production schedule which minimize the total processing time of the parts (makespan). We test the algorithm on data provided by real industry and the process shows a very short computation time. This contributes a lot to the flexibility and timelines targeted on an automatic environment.

WMSA for wireless communication applications

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vats, Monika; Agarwal, Alok, E-mail: alokagarwal26@yahoo.com; Kumar, Ravindra

2016-03-09

Modified rectangular compact microstrip patch antenna having finite ground plane is proposed in this paper. Wideband Microstrip Antenna (WMSA) is achieved by corner cut and inserting air gaps inside the edges of the radiating patch having finite ground plane. The obtained impedance bandwidth for 10 dB return loss for the operating frequency f{sub 0} = 2.09 GHz is 28.7 % (600 MHz), which is very high as compared to the bandwidth obtained for the conventional microstrip antenna. Compactness with wide bandwidth of this antenna is practically useful for the wireless communication systems.

Sonographic investigation of anatomical specimens of infant hip joints.

PubMed

Falliner, Axel; Hahne, Hans-Jürgen; Hassenpflug, Joachim

2002-07-01

The anatomical foundations of infant hip sonography techniques are ill-defined. We investigated anatomical specimens of infant hip joints in a water bath, with Graf's and Terjesen's methods. Acetabular position was varied in defined increments, with respect to the ultrasound beam. The alpha angles and the femoral head coverage were measured. Plastic acetabular casts were sawn along the sonographic section planes, and the cut sections compared with the sonographic sections. For images to be obtained, which were analysable by the two methods, the ultrasound beam had to intersect with the acetabular inlet plane at defined angles. The acetabular notch had to be anteriorly rotated from the ultrasound beam plane by at least 20 degrees. Beam entry within a 50 degrees sector posterior to the perpendicular on the inlet plane gave analysable images. The alpha angles and femoral head coverage were much affected by coronal-plane transducer tilt. Caudad tilts were associated with lesser values, a fact that should be borne in mind in clinical ultrasound investigations.

Heterogeneous upper-bound finite element limit analysis of masonry walls out-of-plane loaded

NASA Astrophysics Data System (ADS)

Milani, G.; Zuccarello, F. A.; Olivito, R. S.; Tralli, A.

2007-11-01

A heterogeneous approach for FE upper bound limit analyses of out-of-plane loaded masonry panels is presented. Under the assumption of associated plasticity for the constituent materials, mortar joints are reduced to interfaces with a Mohr Coulomb failure criterion with tension cut-off and cap in compression, whereas for bricks both limited and unlimited strength are taken into account. At each interface, plastic dissipation can occur as a combination of out-of-plane shear, bending and torsion. In order to test the reliability of the model proposed, several examples of dry-joint panels out-of-plane loaded tested at the University of Calabria (Italy) are discussed. Numerical results are compared with experimental data for three different series of walls at different values of the in-plane compressive vertical loads applied. The comparisons show that reliable predictions of both collapse loads and failure mechanisms can be obtained by means of the numerical procedure employed.

Teaching learning algorithm based optimization of kerf deviations in pulsed Nd:YAG laser cutting of Kevlar-29 composite laminates

NASA Astrophysics Data System (ADS)

Gautam, Girish Dutt; Pandey, Arun Kumar

2018-03-01

Kevlar is the most popular aramid fiber and most commonly used in different technologically advanced industries for various applications. But the precise cutting of Kevlar composite laminates is a difficult task. The conventional cutting methods face various defects such as delamination, burr formation, fiber pullout with poor surface quality and their mechanical performance is greatly affected by these defects. The laser beam machining may be an alternative of the conventional cutting processes due to its non-contact nature, requirement of low specific energy with higher production rate. But this process also faces some problems that may be minimized by operating the machine at optimum parameters levels. This research paper examines the effective utilization of the Nd:YAG laser cutting system on difficult-to-cut Kevlar-29 composite laminates. The objective of the proposed work is to find the optimum process parameters settings for getting the minimum kerf deviations at both sides. The experiments have been conducted on Kevlar-29 composite laminates having thickness 1.25 mm by using Box-Benkhen design with two center points. The experimental data have been used for the optimization by using the proposed methodology. For the optimization, Teaching learning Algorithm based approach has been employed to obtain the minimum kerf deviation at bottom and top sides. A self coded Matlab program has been developed by using the proposed methodology and this program has been used for the optimization. Finally, the confirmation tests have been performed to compare the experimental and optimum results obtained by the proposed methodology. The comparison results show that the machining performance in the laser beam cutting process has been remarkably improved through proposed approach. Finally, the influence of different laser cutting parameters such as lamp current, pulse frequency, pulse width, compressed air pressure and cutting speed on top kerf deviation and bottom kerf deviation during the Nd:YAG laser cutting of Kevlar-29 laminates have been discussed.

Shoe collar height effect on athletic performance, ankle joint kinematics and kinetics during unanticipated maximum-effort side-cutting performance.

PubMed

Lam, Gilbert Wing Kai; Park, Eun Jung; Lee, Ki-Kwang; Cheung, Jason Tak-Man

2015-01-01

Side-step cutting manoeuvres comprise the coordination between planting and non-planting legs. Increased shoe collar height is expected to influence ankle biomechanics of both legs and possibly respective cutting performance. This study examined the shoe collar height effect on kinematics and kinetics of planting and non-planting legs during an unanticipated side-step cutting. Fifteen university basketball players performed maximum-effort side-step cutting to the left 45° direction or a straight ahead run in response to a random light signal. Seven successful cutting trials were collected for each condition. Athletic performance, ground reaction force, ankle kinematics and kinetics of both legs were analysed using paired t-tests. Results indicated that high-collar shoes resulted in less ankle inversion and external rotation during initial contact for the planting leg. The high-collar shoes also exhibited a smaller ankle range of motion in the sagittal and transverse planes for both legs, respectively. However, no collar effect was found for ankle moments and performance indicators including cutting performance time, ground contact time, propulsion ground reaction forces and impulses. These findings indicated that high-collar shoes altered ankle positioning and restricted ankle joint freedom movements in both legs, while no negative effect was found for athletic cutting performance.

Observations of premonitory acoustic emission and slip nucleation during a stick slip experiment in smooth faulted Westerly granite

USGS Publications Warehouse

Thompson, B.D.; Young, R.P.; Lockner, D.A.

2005-01-01

To investigate laboratory earthquakes, stick-slip events were induced on a saw-cut Westerly granite sample by triaxial loading at 150 MPa confining pressure. Acoustic emissions (AE) were monitored using an innovative continuous waveform recorder. The first motion of each stick slip was recorded as a large-amplitude AE signal. These events source locate onto the saw-cut fault plane, implying that they represent the nucleation sites of the dynamic failure stick-slip events. The precise location of nucleation varied between events and was probably controlled by heterogeneity of stress or surface conditions on the fault. The initial nucleation diameter of each dynamic instability was inferred to be less than 3 mm. A small number of AE were recorded prior to each macro slip event. For the second and third slip events, premonitory AE source mechanisms mimic the large scale fault plane geometry. Copyright 2005 by the American Geophysical Union.

The Autism Diagnostic Observation Schedule, Module 4: Application of the Revised Algorithms in an Independent, Well-Defined, Dutch Sample (N = 93)

ERIC Educational Resources Information Center

de Bildt, Annelies; Sytema, Sjoerd; Meffert, Harma; Bastiaansen, Jojanneke A. C. J.

2016-01-01

This study examined the discriminative ability of the revised Autism Diagnostic Observation Schedule module 4 algorithm (Hus and Lord in "J Autism Dev Disord" 44(8):1996-2012, 2014) in 93 Dutch males with Autism Spectrum Disorder (ASD), schizophrenia, psychopathy or controls. Discriminative ability of the revised algorithm ASD cut-off…

Low-Angle-Incidence Microchannel Epitaxy of a-Plane GaN Grown by Ammonia-Based Metal-Organic Molecular Beam Epitaxy

NASA Astrophysics Data System (ADS)

Lin, Chia-Hung; Uchiyama, Shota; Maruyama, Takahiro; Naritsuka, Shigeya

2012-04-01

Low-angle-incidence microchannel epitaxy (LAIMCE) of a-plane GaN was performed using ammonia-based metal-organic molecular beam epitaxy to obtain wide and thin lateral overgrowth over a SiO2 mask. Trimethylgallium (TMG) was supplied perpendicular to the openings cut in the mask with a low incident angle of 5° relative to the substrate plane. The [NH3]/[TMG] ratio (R) dependence of GaN LAIMCE was optimized by varying R from 5 to 30. A wide lateral overgrowth of 3.7 µm with a dislocation density below the transmission electron microscope detection limit was obtained at R=15 for a thickness of 520 nm.

AE Source Orientation by Plate Wave Analysis

NASA Technical Reports Server (NTRS)

Gorman, Michael R.; Prosser, William H.

1991-01-01

Lead breaks (Hsu-Neilsen source) were used to generate simulated acoustic emission signals in an aluminum plate at angles of 0, 30, 60, and 90 degrees with respect to the plane of the plate. This was accomplished by breaking the lead on slots cut into the plate at the respective angles. The out-of-plane and in-plane displacement components of the resulting signals were detected by broad band transducers and digitized. Analysis of the waveforms showed them to consist of the extensional and flexural plate modes. The amplitude of both components of the two modes was dependent on the source orientation angle. This suggests that plate wave analysis may be used to determine the source orientation of acoustic emission sources.

Crack Growth Prediction Methodology for Multi-Site Damage: Layered Analysis and Growth During Plasticity

NASA Technical Reports Server (NTRS)

James, Mark Anthony

1999-01-01

A finite element program has been developed to perform quasi-static, elastic-plastic crack growth simulations. The model provides a general framework for mixed-mode I/II elastic-plastic fracture analysis using small strain assumptions and plane stress, plane strain, and axisymmetric finite elements. Cracks are modeled explicitly in the mesh. As the cracks propagate, automatic remeshing algorithms delete the mesh local to the crack tip, extend the crack, and build a new mesh around the new tip. State variable mapping algorithms transfer stresses and displacements from the old mesh to the new mesh. The von Mises material model is implemented in the context of a non-linear Newton solution scheme. The fracture criterion is the critical crack tip opening displacement, and crack direction is predicted by the maximum tensile stress criterion at the crack tip. The implementation can accommodate multiple curving and interacting cracks. An additional fracture algorithm based on nodal release can be used to simulate fracture along a horizontal plane of symmetry. A core of plane strain elements can be used with the nodal release algorithm to simulate the triaxial state of stress near the crack tip. Verification and validation studies compare analysis results with experimental data and published three-dimensional analysis results. Fracture predictions using nodal release for compact tension, middle-crack tension, and multi-site damage test specimens produced accurate results for residual strength and link-up loads. Curving crack predictions using remeshing/mapping were compared with experimental data for an Arcan mixed-mode specimen. Loading angles from 0 degrees to 90 degrees were analyzed. The maximum tensile stress criterion was able to predict the crack direction and path for all loading angles in which the material failed in tension. Residual strength was also accurately predicted for these cases.

Cutting solid figures by plane - analytical solution and spreadsheet implementation

NASA Astrophysics Data System (ADS)

Benacka, Jan

2012-07-01

In some secondary mathematics curricula, there is a topic called Stereometry that deals with investigating the position and finding the intersection, angle, and distance of lines and planes defined within a prism or pyramid. Coordinate system is not used. The metric tasks are solved using Pythagoras' theorem, trigonometric functions, and sine and cosine rules. The basic problem is to find the section of the figure by a plane that is defined by three points related to the figure. In this article, a formula is derived that gives the positions of the intersection points of such a plane and the figure edges, that is, the vertices of the section polygon. Spreadsheet implementations of the formula for cuboid and right rectangular pyramids are presented. The user can check his/her graphical solution, or proceed if he/she is not able to complete the section.

Exploiting Inherent Robustness and Natural Dynamics in the Control of Bipedal Walking Robots

DTIC Science & Technology

2000-06-01

physical models of bipedal walking. The insight gained from these models is used in the development of three planar (motion only in the sagittal plane ...ground is implemented and tested in simulation. The dynamics of the sagittal plane are suffciently decoupled from the dynamics of the frontal and...transverse planes such that control of each can be treated separately. We achieve three-dimensional walking by adding lateral balance to the planar algorithms

Axial Cone-Beam Reconstruction by Weighted BPF/DBPF and Orthogonal Butterfly Filtering.

PubMed

Tang, Shaojie; Tang, Xiangyang

2016-09-01

The backprojection-filtration (BPF) and the derivative backprojection filtered (DBPF) algorithms, in which Hilbert filtering is the common algorithmic feature, are originally derived for exact helical reconstruction from cone-beam (CB) scan data and axial reconstruction from fan beam data, respectively. These two algorithms can be heuristically extended for image reconstruction from axial CB scan data, but induce severe artifacts in images located away from the central plane, determined by the circular source trajectory. We propose an algorithmic solution herein to eliminate the artifacts. The solution is an integration of three-dimensional (3-D) weighted axial CB-BPF/DBPF algorithm with orthogonal butterfly filtering, namely axial CB-BPF/DBPF cascaded with orthogonal butterfly filtering. Using the computer simulated Forbild head and thoracic phantoms that are rigorous in inspecting the reconstruction accuracy, and an anthropomorphic thoracic phantom with projection data acquired by a CT scanner, we evaluate the performance of the proposed algorithm. Preliminary results show that the orthogonal butterfly filtering can eliminate the severe streak artifacts existing in the images reconstructed by the 3-D weighted axial CB-BPF/DBPF algorithm located at off-central planes. Integrated with orthogonal butterfly filtering, the 3-D weighted CB-BPF/DBPF algorithm can perform at least as well as the 3-D weighted CB-FBP algorithm in image reconstruction from axial CB scan data. The proposed 3-D weighted axial CB-BPF/DBPF cascaded with orthogonal butterfly filtering can be an algorithmic solution for CT imaging in extensive clinical and preclinical applications.

An Aircraft Separation Algorithm with Feedback and Perturbation

NASA Technical Reports Server (NTRS)

White, Allan L.

2010-01-01

A separation algorithm is a set of rules that tell aircraft how to maneuver in order to maintain a minimum distance between them. This paper investigates demonstrating that separation algorithms satisfy the FAA requirement for the occurrence of incidents by means of simulation. Any demonstration that a separation algorithm, or any other aspect of flight, satisfies the FAA requirement is a challenge because of the stringent nature of the requirement and the complexity of airspace operations. The paper begins with a probability and statistical analysis of both the FAA requirement and demonstrating meeting it by a Monte Carlo approach. It considers the geometry of maintaining separation when one plane must change its flight path. It then develops a simple feedback control law that guides the planes on their paths. The presence of feedback control permits the introduction of perturbations, and the stochastic nature of the chosen perturbation is examined. The simulation program is described. This paper is an early effort in the realistic demonstration of a stringent requirement. Much remains to be done.

The complexity of identifying Ryu-Takayanagi surfaces in AdS 3/CFT 2

DOE PAGES

Bao, Ning; Chatwin-Davies, A.

2016-11-07

Here, we present a constructive algorithm for the determination of Ryu-Takayanagi surfaces in AdS 3/CFT 2 which exploits previously noted connections between holographic entanglement entropy and max-flow/min-cut. We then characterize its complexity as a polynomial time algorithm.

Vision-based algorithms for near-host object detection and multilane sensing

NASA Astrophysics Data System (ADS)

Kenue, Surender K.

1995-01-01

Vision-based sensing can be used for lane sensing, adaptive cruise control, collision warning, and driver performance monitoring functions of intelligent vehicles. Current computer vision algorithms are not robust for handling multiple vehicles in highway scenarios. Several new algorithms are proposed for multi-lane sensing, near-host object detection, vehicle cut-in situations, and specifying regions of interest for object tracking. These algorithms were tested successfully on more than 6000 images taken from real-highway scenes under different daytime lighting conditions.

Scene-based nonuniformity correction for focal plane arrays by the method of the inverse covariance form.

PubMed

Torres, Sergio N; Pezoa, Jorge E; Hayat, Majeed M

2003-10-10

What is to our knowledge a new scene-based algorithm for nonuniformity correction in infrared focal-plane array sensors has been developed. The technique is based on the inverse covariance form of the Kalman filter (KF), which has been reported previously and used in estimating the gain and bias of each detector in the array from scene data. The gain and the bias of each detector in the focal-plane array are assumed constant within a given sequence of frames, corresponding to a certain time and operational conditions, but they are allowed to randomly drift from one sequence to another following a discrete-time Gauss-Markov process. The inverse covariance form filter estimates the gain and the bias of each detector in the focal-plane array and optimally updates them as they drift in time. The estimation is performed with considerably higher computational efficiency than the equivalent KF. The ability of the algorithm in compensating for fixed-pattern noise in infrared imagery and in reducing the computational complexity is demonstrated by use of both simulated and real data.

gpICA: A Novel Nonlinear ICA Algorithm Using Geometric Linearization

NASA Astrophysics Data System (ADS)

Nguyen, Thang Viet; Patra, Jagdish Chandra; Emmanuel, Sabu

2006-12-01

A new geometric approach for nonlinear independent component analysis (ICA) is presented in this paper. Nonlinear environment is modeled by the popular post nonlinear (PNL) scheme. To eliminate the nonlinearity in the observed signals, a novel linearizing method named as geometric post nonlinear ICA (gpICA) is introduced. Thereafter, a basic linear ICA is applied on these linearized signals to estimate the unknown sources. The proposed method is motivated by the fact that in a multidimensional space, a nonlinear mixture is represented by a nonlinear surface while a linear mixture is represented by a plane, a special form of the surface. Therefore, by geometrically transforming the surface representing a nonlinear mixture into a plane, the mixture can be linearized. Through simulations on different data sets, superior performance of gpICA algorithm has been shown with respect to other algorithms.

Polynomial interpretation of multipole vectors

NASA Astrophysics Data System (ADS)

Katz, Gabriel; Weeks, Jeff

2004-09-01

Copi, Huterer, Starkman, and Schwarz introduced multipole vectors in a tensor context and used them to demonstrate that the first-year Wilkinson microwave anisotropy probe (WMAP) quadrupole and octopole planes align at roughly the 99.9% confidence level. In the present article, the language of polynomials provides a new and independent derivation of the multipole vector concept. Bézout’s theorem supports an elementary proof that the multipole vectors exist and are unique (up to rescaling). The constructive nature of the proof leads to a fast, practical algorithm for computing multipole vectors. We illustrate the algorithm by finding exact solutions for some simple toy examples and numerical solutions for the first-year WMAP quadrupole and octopole. We then apply our algorithm to Monte Carlo skies to independently reconfirm the estimate that the WMAP quadrupole and octopole planes align at the 99.9% level.

SAND: an automated VLBI imaging and analysing pipeline - I. Stripping component trajectories

NASA Astrophysics Data System (ADS)

Zhang, M.; Collioud, A.; Charlot, P.

2018-02-01

We present our implementation of an automated very long baseline interferometry (VLBI) data-reduction pipeline that is dedicated to interferometric data imaging and analysis. The pipeline can handle massive VLBI data efficiently, which makes it an appropriate tool to investigate multi-epoch multiband VLBI data. Compared to traditional manual data reduction, our pipeline provides more objective results as less human interference is involved. The source extraction is carried out in the image plane, while deconvolution and model fitting are performed in both the image plane and the uv plane for parallel comparison. The output from the pipeline includes catalogues of CLEANed images and reconstructed models, polarization maps, proper motion estimates, core light curves and multiband spectra. We have developed a regression STRIP algorithm to automatically detect linear or non-linear patterns in the jet component trajectories. This algorithm offers an objective method to match jet components at different epochs and to determine their proper motions.

3D EIT image reconstruction with GREIT.

PubMed

Grychtol, Bartłomiej; Müller, Beat; Adler, Andy

2016-06-01

Most applications of thoracic EIT use a single plane of electrodes on the chest from which a transverse image 'slice' is calculated. However, interpretation of EIT images is made difficult by the large region above and below the electrode plane to which EIT is sensitive. Volumetric EIT images using two (or more) electrode planes should help compensate, but are little used currently. The Graz consensus reconstruction algorithm for EIT (GREIT) has become popular in lung EIT. One shortcoming of the original formulation of GREIT is its restriction to reconstruction onto a 2D planar image. We present an extension of the GREIT algorithm to 3D and develop open-source tools to evaluate its performance as a function of the choice of stimulation and measurement pattern. Results show 3D GREIT using two electrode layers has significantly more uniform sensitivity profiles through the chest region. Overall, the advantages of 3D EIT are compelling.

Numerical study and ex vivo assessment of HIFU treatment time reduction through optimization of focal point trajectory

NASA Astrophysics Data System (ADS)

Grisey, A.; Yon, S.; Pechoux, T.; Letort, V.; Lafitte, P.

2017-03-01

Treatment time reduction is a key issue to expand the use of high intensity focused ultrasound (HIFU) surgery, especially for benign pathologies. This study aims at quantitatively assessing the potential reduction of the treatment time arising from moving the focal point during long pulses. In this context, the optimization of the focal point trajectory is crucial to achieve a uniform thermal dose repartition and avoid boiling. At first, a numerical optimization algorithm was used to generate efficient trajectories. Thermal conduction was simulated in 3D with a finite difference code and damages to the tissue were modeled using the thermal dose formula. Given an initial trajectory, the thermal dose field was first computed, then, making use of Pontryagin's maximum principle, the trajectory was iteratively refined. Several initial trajectories were tested. Then, an ex vivo study was conducted in order to validate the efficicency of the resulting optimized strategies. Single pulses were performed at 3MHz on fresh veal liver samples with an Echopulse and the size of each unitary lesion was assessed by cutting each sample along three orthogonal planes and measuring the dimension of the whitened area based on photographs. We propose a promising approach to significantly shorten HIFU treatment time: the numerical optimization algorithm was shown to provide a reliable insight on trajectories that can improve treatment strategies. The model must now be improved in order to take in vivo conditions into account and extensively validated.

Preventing facial recognition when rendering MR images of the head in three dimensions.

PubMed

Budin, François; Zeng, Donglin; Ghosh, Arpita; Bullitt, Elizabeth

2008-06-01

In the United States it is not allowed to make public any patient-specific information without the patient's consent. This ruling has led to difficulty for those interested in sharing three-dimensional (3D) images of the head and brain since a patient's face might be recognized from a 3D rendering of the skin surface. Approaches employed to date have included brain stripping and total removal of the face anterior to a cut plane, each of which lose potentially important anatomical information about the skull surface, air sinuses, and orbits. This paper describes a new approach that involves (a) definition of a plane anterior to which the face lies, and (b) an adjustable level of deformation of the skin surface anterior to that plane. On the basis of a user performance study using forced choices, we conclude that approximately 30% of individuals are at risk of recognition from 3D renderings of unaltered images and that truncation of the face below the level of the nose does not preclude facial recognition. Removal of the face anterior to a cut plane may interfere with accurate registration and may delete important anatomical information. Our new method alters little of the underlying anatomy and does not prevent effective registration into a common coordinate system. Although the methods presented here were not fully effective (one subject was consistently recognized under the forced choice study design even at the maximum deformation level employed) this paper may point a way toward solution of a difficult problem that has received little attention in the literature.

Preventing Facial Recognition When Rendering MR Images of the Head in Three Dimensions

PubMed Central

Budin, François; Zeng, Donglin; Ghosh, Arpita; Bullitt, Elizabeth

2008-01-01

In the United States it is not allowed to make public any patient-specific information without the patient's consent. This ruling has led to difficulty for those interested in sharing three-dimensional (3D) images of the head and brain since a patient's face might be recognized from a 3D rendering of the skin surface. Approaches employed to date have included brain stripping and total removal of the face anterior to a cut plane, each of which lose potentially important anatomical information about the skull surface, air sinuses, and orbits. This paper describes a new approach that involves a) definition of a plane anterior to which the face lies, and b) an adjustable level of deformation of the skin surface anterior to that plane. On the basis of a user performance study using forced choices, we conclude that approximately 30% of individuals are at risk of recognition from 3D renderings of unaltered images and that truncation of the face below the level of the nose does not preclude facial recognition. Removal of the face anterior to a cut plane may interfere with accurate registration and may delete important anatomical information. Our new method alters little of the underlying anatomy and does not prevent effective registration into a common coordinate system. Although the methods presented here were not fully effective (one subject was consistently recognized under the forced choice study design even at the maximum deformation level employed) this paper may point a way toward solution of a difficult problem that has received little attention in the literature. PMID:18069044

UAV Mission Planning under Uncertainty

DTIC Science & Technology

2006-06-01

algorithm , adapted from [13] . 57 4-5 Robust Optimization considers only a subset of the feasible region . 61 5-1 Overview of simulation with parameter...incorporates the robust optimization method suggested by Bertsimas and Sim [12], and is solved with a standard Branch- and-Cut algorithm . The chapter... algorithms , and the heuristic methods of Local Search methods and Simulated Annealing. With each method, we attempt to give a review of research that has

Practical algorithms for simulation and reconstruction of digital in-line holograms.

PubMed

Latychevskaia, Tatiana; Fink, Hans-Werner

2015-03-20

Here we present practical methods for simulation and reconstruction of in-line digital holograms recorded with plane and spherical waves. The algorithms described here are applicable to holographic imaging of an object exhibiting absorption as well as phase-shifting properties. Optimal parameters, related to distances, sampling rate, and other factors for successful simulation and reconstruction of holograms are evaluated and criteria for the achievable resolution are worked out. Moreover, we show that the numerical procedures for the reconstruction of holograms recorded with plane and spherical waves are identical under certain conditions. Experimental examples of holograms and their reconstructions are also discussed.

Fourier transform magnetic resonance current density imaging (FT-MRCDI) from one component of magnetic flux density.

PubMed

Ider, Yusuf Ziya; Birgul, Ozlem; Oran, Omer Faruk; Arikan, Orhan; Hamamura, Mark J; Muftuler, L Tugan

2010-06-07

Fourier transform (FT)-based algorithms for magnetic resonance current density imaging (MRCDI) from one component of magnetic flux density have been developed for 2D and 3D problems. For 2D problems, where current is confined to the xy-plane and z-component of the magnetic flux density is measured also on the xy-plane inside the object, an iterative FT-MRCDI algorithm is developed by which both the current distribution inside the object and the z-component of the magnetic flux density on the xy-plane outside the object are reconstructed. The method is applied to simulated as well as actual data from phantoms. The effect of measurement error on the spatial resolution of the current density reconstruction is also investigated. For 3D objects an iterative FT-based algorithm is developed whereby the projected current is reconstructed on any slice using as data the Laplacian of the z-component of magnetic flux density measured for that slice. In an injected current MRCDI scenario, the current is not divergence free on the boundary of the object. The method developed in this study also handles this situation.

Global Contrast Based Salient Region Detection.

PubMed

Cheng, Ming-Ming; Mitra, Niloy J; Huang, Xiaolei; Torr, Philip H S; Hu, Shi-Min

2015-03-01

Automatic estimation of salient object regions across images, without any prior assumption or knowledge of the contents of the corresponding scenes, enhances many computer vision and computer graphics applications. We introduce a regional contrast based salient object detection algorithm, which simultaneously evaluates global contrast differences and spatial weighted coherence scores. The proposed algorithm is simple, efficient, naturally multi-scale, and produces full-resolution, high-quality saliency maps. These saliency maps are further used to initialize a novel iterative version of GrabCut, namely SaliencyCut, for high quality unsupervised salient object segmentation. We extensively evaluated our algorithm using traditional salient object detection datasets, as well as a more challenging Internet image dataset. Our experimental results demonstrate that our algorithm consistently outperforms 15 existing salient object detection and segmentation methods, yielding higher precision and better recall rates. We also show that our algorithm can be used to efficiently extract salient object masks from Internet images, enabling effective sketch-based image retrieval (SBIR) via simple shape comparisons. Despite such noisy internet images, where the saliency regions are ambiguous, our saliency guided image retrieval achieves a superior retrieval rate compared with state-of-the-art SBIR methods, and additionally provides important target object region information.

An algorithm developed in Matlab for the automatic selection of cut-off frequencies, in the correction of strong motion data

NASA Astrophysics Data System (ADS)

Sakkas, Georgios; Sakellariou, Nikolaos

2018-05-01

Strong motion recordings are the key in many earthquake engineering applications and are also fundamental for seismic design. The present study focuses on the automated correction of accelerograms, analog and digital. The main feature of the proposed algorithm is the automatic selection for the cut-off frequencies based on a minimum spectral value in a predefined frequency bandwidth, instead of the typical signal-to-noise approach. The algorithm follows the basic steps of the correction procedure (instrument correction, baseline correction and appropriate filtering). Besides the corrected time histories, Peak Ground Acceleration, Peak Ground Velocity, Peak Ground Displacement values and the corrected Fourier Spectra are also calculated as well as the response spectra. The algorithm is written in Matlab environment, is fast enough and can be used for batch processing or in real-time applications. In addition, the possibility to also perform a signal-to-noise ratio is added as well as to perform causal or acausal filtering. The algorithm has been tested in six significant earthquakes (Kozani-Grevena 1995, Aigio 1995, Athens 1999, Lefkada 2003 and Kefalonia 2014) of the Greek territory with analog and digital accelerograms.

High performance genetic algorithm for VLSI circuit partitioning

NASA Astrophysics Data System (ADS)

Dinu, Simona

2016-12-01

Partitioning is one of the biggest challenges in computer-aided design for VLSI circuits (very large-scale integrated circuits). This work address the min-cut balanced circuit partitioning problem- dividing the graph that models the circuit into almost equal sized k sub-graphs while minimizing the number of edges cut i.e. minimizing the number of edges connecting the sub-graphs. The problem may be formulated as a combinatorial optimization problem. Experimental studies in the literature have shown the problem to be NP-hard and thus it is important to design an efficient heuristic algorithm to solve it. The approach proposed in this study is a parallel implementation of a genetic algorithm, namely an island model. The information exchange between the evolving subpopulations is modeled using a fuzzy controller, which determines an optimal balance between exploration and exploitation of the solution space. The results of simulations show that the proposed algorithm outperforms the standard sequential genetic algorithm both in terms of solution quality and convergence speed. As a direction for future study, this research can be further extended to incorporate local search operators which should include problem-specific knowledge. In addition, the adaptive configuration of mutation and crossover rates is another guidance for future research.

Effects of Two Football Stud Types on Knee and Ankle Kinetics of Single-Leg Land-Cut and 180° Cut Movements on Infilled Synthetic Turf.

PubMed

Bennett, Hunter J; Brock, Elizabeth; Brosnan, James T; Sorochan, John C; Zhang, Songning

2015-10-01

Higher ACL injury rates have been recorded in cleats with higher torsional resistance in American football, which warrants better understanding of shoe/stud-dependent joint kinetics. The purpose of this study was to determine differences in knee and ankle kinetics during single-leg land cuts and 180° cuts on synthetic infilled turf while wearing 3 types of shoes. Fourteen recreational football players performed single-leg land cuts and 180° cuts in nonstudded running shoes (RS) and in football shoes with natural (NTS) and synthetic turf studs (STS). Knee and ankle kinetic variables were analyzed with a 3 × 2 (shoe × movement) repeated-measures ANOVA (P < .05). A significant shoe-by-movement interaction was found in loading response peak knee adduction moments, with NTS producing smaller moments compared with both STS and RS only in 180° cuts. Reduced peak negative plantar flexor powers were also found in NTS compared with STS. The single-leg land cut produced greater loading response and push-off peak knee extensor moments, as well as peak negative and positive extensor and plantar flexor powers, but smaller loading peak knee adduction moments and push-off peak ankle eversion moments than 180° cuts. Overall, the STS and 180° cuts resulted in greater frontal plane knee loading and should be monitored for possible increased ACL injury risks.

Intelligent scanning: automated standard plane selection and biometric measurement of early gestational sac in routine ultrasound examination.

PubMed

Zhang, Ling; Chen, Siping; Chin, Chien Ting; Wang, Tianfu; Li, Shengli

2012-08-01

To assist radiologists and decrease interobserver variability when using 2D ultrasonography (US) to locate the standardized plane of early gestational sac (SPGS) and to perform gestational sac (GS) biometric measurements. In this paper, the authors report the design of the first automatic solution, called "intelligent scanning" (IS), for selecting SPGS and performing biometric measurements using real-time 2D US. First, the GS is efficiently and precisely located in each ultrasound frame by exploiting a coarse to fine detection scheme based on the training of two cascade AdaBoost classifiers. Next, the SPGS are automatically selected by eliminating false positives. This is accomplished using local context information based on the relative position of anatomies in the image sequence. Finally, a database-guided multiscale normalized cuts algorithm is proposed to generate the initial contour of the GS, based on which the GS is automatically segmented for measurement by a modified snake model. This system was validated on 31 ultrasound videos involving 31 pregnant volunteers. The differences between system performance and radiologist performance with respect to SPGS selection and length and depth (diameter) measurements are 7.5% ± 5.0%, 5.5% ± 5.2%, and 6.5% ± 4.6%, respectively. Additional validations prove that the IS precision is in the range of interobserver variability. Our system can display the SPGS along with biometric measurements in approximately three seconds after the video ends, when using a 1.9 GHz dual-core computer. IS of the GS from 2D real-time US is a practical, reproducible, and reliable approach.

Yet one more dwell time algorithm

NASA Astrophysics Data System (ADS)

Haberl, Alexander; Rascher, Rolf

2017-06-01

The current demand of even more powerful and efficient microprocessors, for e.g. deep learning, has led to an ongoing trend of reducing the feature size of the integrated circuits. These processors are patterned with EUV-lithography which enables 7 nm chips [1]. To produce mirrors which satisfy the needed requirements is a challenging task. Not only increasing requirements on the imaging properties, but also new lens shapes, such as aspheres or lenses with free-form surfaces, require innovative production processes. However, these lenses need new deterministic sub-aperture polishing methods that have been established in the past few years. These polishing methods are characterized, by an empirically determined TIF and local stock removal. Such a deterministic polishing method is ion-beam-figuring (IBF). The beam profile of an ion beam is adjusted to a nearly ideal Gaussian shape by various parameters. With the known removal function, a dwell time profile can be generated for each measured error profile. Such a profile is always generated pixel-accurately to the predetermined error profile, with the aim always of minimizing the existing surface structures up to the cut-off frequency of the tool used [2]. The processing success of a correction-polishing run depends decisively on the accuracy of the previously computed dwell-time profile. So the used algorithm to calculate the dwell time has to accurately reflect the reality. But furthermore the machine operator should have no influence on the dwell-time calculation. Conclusively there mustn't be any parameters which have an influence on the calculation result. And lastly it should take a minimum of machining time to get a minimum of remaining error structures. Unfortunately current dwell time algorithm calculations are divergent, user-dependent, tending to create high processing times and need several parameters to bet set. This paper describes an, realistic, convergent and user independent dwell time algorithm. The typical processing times are reduced to about 80 % up to 50 % compared to conventional algorithms (Lucy-Richardson, Van-Cittert …) as used in established machines. To verify its effectiveness a plane surface was machined on an IBF.

Panel cutting method: new approach to generate panels on a hull in Rankine source potential approximation

NASA Astrophysics Data System (ADS)

Choi, Hee-Jong; Chun, Ho-Hwan; Park, Il-Ryong; Kim, Jin

2011-12-01

In the present study, a new hull panel generation algorithm, namely panel cutting method, was developed to predict flow phenomena around a ship using the Rankine source potential based panel method, where the iterative method was used to satisfy the nonlinear free surface condition and the trim and sinkage of the ship was taken into account. Numerical computations were performed to investigate the validity of the proposed hull panel generation algorithm for Series 60 (CB=0.60) hull and KRISO container ship (KCS), a container ship designed by Maritime and Ocean Engineering Research Institute (MOERI). The computational results were validated by comparing with the existing experimental data.

Unzip instabilities: Straight to oscillatory transitions in the cutting of thin polymer sheets

NASA Astrophysics Data System (ADS)

Reis, P. M.; Kumar, A.; Shattuck, M. D.; Roman, B.

2008-06-01

We report an experimental investigation of the cutting of a thin brittle polymer sheet with a blunt tool. It was recently shown that the fracture path becomes oscillatory when the tool is much wider than the sheet thickness. Here we uncover two novel transitions from straight to oscillatory fracture by varying either the tilt angle of the tool or the speed of cutting, respectively. We denote these by angle and speed unzip instabilities and analyze them by quantifying both the dynamics of the crack tip and the final shapes of the fracture paths. Moreover, for the speed unzip instability, the straight crack lip obtained at low speeds exhibits out-of-plane buckling undulations (as opposed to being flat above the instability threshold) suggesting a transition from ductile to brittle fracture.

Metal Flow in Friction Stir Welding

NASA Technical Reports Server (NTRS)

Nunes, Arthur C., Jr.

2006-01-01

The plastic deformation field in Friction Stir Welding (FSW) is compared to that in metal cutting. A shear surface around the FSW tool analogous to the metal cutting shear plane is identified and comprises the basis of the "rotating plug" flow field model and the "wiping" model of tool interaction with weld metal. Within the context of these models: The FSW shear rate is estimated to be comparable to metal cutting shear rates. The effect of tool geometry on the FSW shear surface is discussed and related to published torque measurements. Various FS W structural features are explained, including a difference in structure of bimetallic welds when alloys on the advancing and retreating sides of the weld seam are exchanged. The joining mechanism and critical parameters of the FSW process are made clear.

Mechanisms and FEM Simulation of Chip Formation in Orthogonal Cutting In-Situ TiB₂/7050Al MMC.

PubMed

Xiong, Yifeng; Wang, Wenhu; Jiang, Ruisong; Lin, Kunyang; Shao, Mingwei

2018-04-15

The in-situ TiB₂/7050Al composite is a new kind of Al-based metal matrix composite (MMC) with super properties, such as low density, improved strength, and wear resistance. This paper, for a deep insight into its cutting performance, involves a study of the chip formation process and finite element simulation during orthogonal cutting in-situ TiB₂/7050Al MMC. With chips, material properties, cutting forces, and tool geometry parameters, the Johnson-Cook (J-C) constitutive equation of in-situ TiB₂/7050Al composite was established. Then, the cutting simulation model was established by applying the Abaqus-Explicit method, and the serrated chip, shear plane, strain rate, and temperature were analyzed. The experimental and simulation results showed that the obtained material's constitutive equation was of high reliability, and the saw-tooth chips occurred commonly under either low or high cutting speed and small or large feed rate. From result analysis, it was found that the mechanisms of chip formation included plastic deformation, adiabatic shear, shearing slip, and crack extension. In addition, it was found that the existence of small, hard particles reduced the ductility of the MMC and resulted in segmental chips.

Real-time haptic cutting of high-resolution soft tissues.

PubMed

Wu, Jun; Westermann, Rüdiger; Dick, Christian

2014-01-01

We present our systematic efforts in advancing the computational performance of physically accurate soft tissue cutting simulation, which is at the core of surgery simulators in general. We demonstrate a real-time performance of 15 simulation frames per second for haptic soft tissue cutting of a deformable body at an effective resolution of 170,000 finite elements. This is achieved by the following innovative components: (1) a linked octree discretization of the deformable body, which allows for fast and robust topological modifications of the simulation domain, (2) a composite finite element formulation, which thoroughly reduces the number of simulation degrees of freedom and thus enables to carefully balance simulation performance and accuracy, (3) a highly efficient geometric multigrid solver for solving the linear systems of equations arising from implicit time integration, (4) an efficient collision detection algorithm that effectively exploits the composition structure, and (5) a stable haptic rendering algorithm for computing the feedback forces. Considering that our method increases the finite element resolution for physically accurate real-time soft tissue cutting simulation by an order of magnitude, our technique has a high potential to significantly advance the realism of surgery simulators.

Accuracy of methods for calculating volumetric wear from coordinate measuring machine data of retrieved metal-on-metal hip joint implants.

PubMed

Lu, Zhen; McKellop, Harry A

2014-03-01

This study compared the accuracy and sensitivity of several numerical methods employing spherical or plane triangles for calculating the volumetric wear of retrieved metal-on-metal hip joint implants from coordinate measuring machine measurements. Five methods, one using spherical triangles and four using plane triangles to represent the bearing and the best-fit surfaces, were assessed and compared on a perfect hemisphere model and a hemi-ellipsoid model (i.e. unworn models), computer-generated wear models and wear-tested femoral balls, with point spacings of 0.5, 1, 2 and 3 mm. The results showed that the algorithm (Method 1) employing spherical triangles to represent the bearing surface and to scale the mesh to the best-fit surfaces produced adequate accuracy for the wear volume with point spacings of 0.5, 1, 2 and 3 mm. The algorithms (Methods 2-4) using plane triangles to represent the bearing surface and to scale the mesh to the best-fit surface also produced accuracies that were comparable to that with spherical triangles. In contrast, if the bearing surface was represented with a mesh of plane triangles and the best-fit surface was taken as a smooth surface without discretization (Method 5), the algorithm produced much lower accuracy with a point spacing of 0.5 mm than Methods 1-4 with a point spacing of 3 mm.

Automatic Monitoring of Tunnel Deformation Based on High Density Point Clouds Data

NASA Astrophysics Data System (ADS)

Du, L.; Zhong, R.; Sun, H.; Wu, Q.

2017-09-01

An automated method for tunnel deformation monitoring using high density point clouds data is presented. Firstly, the 3D point clouds data are converted to two-dimensional surface by projection on the XOY plane, the projection point set of central axis on XOY plane named Uxoy is calculated by combining the Alpha Shape algorithm with RANSAC (Random Sampling Consistency) algorithm, and then the projection point set of central axis on YOZ plane named Uyoz is obtained by highest and lowest points which are extracted by intersecting straight lines that through each point of Uxoy and perpendicular to the two -dimensional surface with the tunnel point clouds, Uxoy and Uyoz together form the 3D center axis finally. Secondly, the buffer of each cross section is calculated by K-Nearest neighbor algorithm, and the initial cross-sectional point set is quickly constructed by projection method. Finally, the cross sections are denoised and the section lines are fitted using the method of iterative ellipse fitting. In order to improve the accuracy of the cross section, a fine adjustment method is proposed to rotate the initial sectional plane around the intercept point in the horizontal and vertical direction within the buffer. The proposed method is used in Shanghai subway tunnel, and the deformation of each section in the direction of 0 to 360 degrees is calculated. The result shows that the cross sections becomes flat circles from regular circles due to the great pressure at the top of the tunnel

Method and apparatus for automatically tracking a workpiece surface. [Patents

DOEpatents

Not Available

1981-02-03

Laser cutting concepts and apparatus have been developed for cutting the shroud of the core fuel subassemblies. However, much care must be taken in the accuracy of the cutting since the fuel rods within the shroud often become warped and are forced into direct contact with the shroud in random regions. Thus, in order to cut the nuclear fuel rod shroud accurately so as not to puncture the cladding of the fuel rods, and to insure optimal cutting efficiency and performance, the focal point of beam need be maintained accurately at the workpiece surface. It becomes necessary to detect deviations in the level of the workpiece surface accurately in connection with the cutting process. Therefore, a method and apparatus for tracking the surface of a workpiece being cut by a laser beam coming from a focus head assembly is disclosed which includes two collimated laser beams directed onto the work-piece surface at spaced points by beam directing optics in generally parallel planes of incidence. A shift in spacing between the two points is detected by means of a video camera system and processed by a computer to yield a workpiece surface displacement signal which is input to a motor which raises or lowers the beam focus head accordingly.

Spectroscopy of the Schwarzschild black hole at arbitrary frequencies.

PubMed

Casals, Marc; Ottewill, Adrian

2012-09-14

Linear field perturbations of a black hole are described by the Green function of the wave equation that they obey. After Fourier decomposing the Green function, its two natural contributions are given by poles (quasinormal modes) and a largely unexplored branch cut in the complex frequency plane. We present new analytic methods for calculating the branch cut on a Schwarzschild black hole for arbitrary values of the frequency. The branch cut yields a power-law tail decay for late times in the response of a black hole to an initial perturbation. We determine explicitly the first three orders in the power-law and show that the branch cut also yields a new logarithmic behavior T(-2ℓ-5)lnT for late times. Before the tail sets in, the quasinormal modes dominate the black hole response. For electromagnetic perturbations, the quasinormal mode frequencies approach the branch cut at large overtone index n. We determine these frequencies up to n(-5/2) and, formally, to arbitrary order. Highly damped quasinormal modes are of particular interest in that they have been linked to quantum properties of black holes.

Radiometric calibration of an ultra-compact microbolometer thermal imaging module

NASA Astrophysics Data System (ADS)

Riesland, David W.; Nugent, Paul W.; Laurie, Seth; Shaw, Joseph A.

2017-05-01

As microbolometer focal plane array formats are steadily decreasing, new challenges arise in correcting for thermal drift in the calibration coefficients. As the thermal mass of the cameras decrease the focal plane becomes more sensitive to external thermal inputs. This paper shows results from a temperature compensation algorithm for characterizing and radiometrically calibrating a FLIR Lepton camera.

UAS Collision Avoidance Algorithm that Minimizes the Impact on Route Surveillance

DTIC Science & Technology

2009-03-01

Appendix A: Collision Avoidance Algorithm/Virtual Cockpit Interface .......................124 Appendix B : Collision Cone Boundary Rates... b ) Split Cone (c) Multiple Intruders, Single and Split Cones [27] ........................................................ 27 3-3: Collision Cone...Approach in the Vertical Plane (a) Single Cone ( b ) Multiple Intruders, Single and Split Cone [27

A genetic graph-based approach for partitional clustering.

PubMed

Menéndez, Héctor D; Barrero, David F; Camacho, David

2014-05-01

Clustering is one of the most versatile tools for data analysis. In the recent years, clustering that seeks the continuity of data (in opposition to classical centroid-based approaches) has attracted an increasing research interest. It is a challenging problem with a remarkable practical interest. The most popular continuity clustering method is the spectral clustering (SC) algorithm, which is based on graph cut: It initially generates a similarity graph using a distance measure and then studies its graph spectrum to find the best cut. This approach is sensitive to the parameters of the metric, and a correct parameter choice is critical to the quality of the cluster. This work proposes a new algorithm, inspired by SC, that reduces the parameter dependency while maintaining the quality of the solution. The new algorithm, named genetic graph-based clustering (GGC), takes an evolutionary approach introducing a genetic algorithm (GA) to cluster the similarity graph. The experimental validation shows that GGC increases robustness of SC and has competitive performance in comparison with classical clustering methods, at least, in the synthetic and real dataset used in the experiments.

Approximate labeling via graph cuts based on linear programming.

PubMed

Komodakis, Nikos; Tziritas, Georgios

2007-08-01

A new framework is presented for both understanding and developing graph-cut-based combinatorial algorithms suitable for the approximate optimization of a very wide class of Markov Random Fields (MRFs) that are frequently encountered in computer vision. The proposed framework utilizes tools from the duality theory of linear programming in order to provide an alternative and more general view of state-of-the-art techniques like the \\alpha-expansion algorithm, which is included merely as a special case. Moreover, contrary to \\alpha-expansion, the derived algorithms generate solutions with guaranteed optimality properties for a much wider class of problems, for example, even for MRFs with nonmetric potentials. In addition, they are capable of providing per-instance suboptimality bounds in all occasions, including discrete MRFs with an arbitrary potential function. These bounds prove to be very tight in practice (that is, very close to 1), which means that the resulting solutions are almost optimal. Our algorithms' effectiveness is demonstrated by presenting experimental results on a variety of low-level vision tasks, such as stereo matching, image restoration, image completion, and optical flow estimation, as well as on synthetic problems.

A simple X-ray source of two orthogonal beams for small samples imaging

NASA Astrophysics Data System (ADS)

Hrdý, J.

2018-04-01

A simple method for simultaneous imaging of small samples by two orthogonal beams is proposed. The method is based on one channel-cut crystal which is oriented such that the beam is diffracted on two crystallographic planes simultaneously. These planes are symmetrically inclined to the crystal surface. The beams are three times diffracted. After the first diffraction the beam is split. After the second diffraction the split beams become parallel. Finally, after the third diffraction the beams become convergent and may be used for imaging. The corresponding angular relations to obtain orthogonal beams are derived.

Programming of the complex logarithm function in the solution of the cracked anisotropic plate loaded by a point force

NASA Astrophysics Data System (ADS)

Zaal, K. J. J. M.

1991-06-01

In programming solutions of complex function theory, the complex logarithm function is replaced by the complex logarithmic function, introducing a discontinuity along the branch cut into the programmed solution which was not present in the mathematical solution. Recently, Liaw and Kamel presented their solution of the infinite anisotropic centrally cracked plate loaded by an arbitrary point force, which they used as Green's function in a boundary element method intended to evaluate the stress intensity factor at the tip of a crack originating from an elliptical home. Their solution may be used as Green's function of many more numerical methods involving anisotropic elasticity. In programming applications of Liaw and Kamel's solution, the standard definition of the logarithmic function with the branch cut at the nonpositive real axis cannot provide a reliable computation of the displacement field for Liaw and Kamel's solution. Either the branch cut should be redefined outside the domain of the logarithmic function, after proving that the domain is limited to a part of the plane, or the logarithmic function should be defined on its Riemann surface. A two dimensional line fractal can provide the link between all mesh points on the plane essential to evaluate the logarithm function on its Riemann surface. As an example, a two dimensional line fractal is defined for a mesh once used by Erdogan and Arin.

Landslide assessment of Newell Creek Canyon, Oregon City, Oregon

DOE Office of Scientific and Technical Information (OSTI.GOV)

Growney, L.; Burris, L.; Garletts, D.

1993-04-01

A study has been conducted in Newell Creek Canyon near Oregon City, Oregon, T3S, T2S, R2E. A landslide inventory has located 53 landslides in the 2.8 km[sup 2] area. The landslides range in area from approximately 15,000m[sup 2] to 10m[sup 2]. Past slides cover an approximate 7% of the canyon area. Landslide processes include: slump, slump-translational, slump-earthflow and earthflow. Hard, impermeable clay-rich layers in the Troutdale Formation form the failure planes for most of the slides. Slopes composed of Troutdale material may seem to be stable, but when cuts and fills are produced, slope failure is common because of themore » perched water tables and impermeable failure planes. Good examples of cut and fill failures are present on Highway 213 which passes through Newell Creek Canyon. Almost every cut and fill has failed since the road construction began. The latest failure is in the fill located at mile-post 2.1. From data gathered, a slope stability risk map was generated. Stability risk ratings are divided into three groups: high, moderate and low. High risk of slope instability is designated to all landslides mapped in the slide inventory. Moderate risk is designated to slopes in the Troutdale Formation greater than 8[degree]. Low risk is designated to slopes in the Troutdale Formation less than 8[degree].« less

Quantitative analysis of airway abnormalities in CT

NASA Astrophysics Data System (ADS)

Petersen, Jens; Lo, Pechin; Nielsen, Mads; Edula, Goutham; Ashraf, Haseem; Dirksen, Asger; de Bruijne, Marleen

2010-03-01

A coupled surface graph cut algorithm for airway wall segmentation from Computed Tomography (CT) images is presented. Using cost functions that highlight both inner and outer wall borders, the method combines the search for both borders into one graph cut. The proposed method is evaluated on 173 manually segmented images extracted from 15 different subjects and shown to give accurate results, with 37% less errors than the Full Width at Half Maximum (FWHM) algorithm and 62% less than a similar graph cut method without coupled surfaces. Common measures of airway wall thickness such as the Interior Area (IA) and Wall Area percentage (WA%) was measured by the proposed method on a total of 723 CT scans from a lung cancer screening study. These measures were significantly different for participants with Chronic Obstructive Pulmonary Disease (COPD) compared to asymptomatic participants. Furthermore, reproducibility was good as confirmed by repeat scans and the measures correlated well with the outcomes of pulmonary function tests, demonstrating the use of the algorithm as a COPD diagnostic tool. Additionally, a new measure of airway wall thickness is proposed, Normalized Wall Intensity Sum (NWIS). NWIS is shown to correlate better with lung function test values and to be more reproducible than previous measures IA, WA% and airway wall thickness at a lumen perimeter of 10 mm (PI10).

Novel E-Field Sensor for Projectile Detection

DTIC Science & Technology

2012-10-22

aircrafts. They used an array of three plate induction sensors and a simple algorithm to deter mine the direction of the planes [9]. In more recent...publications [10, 11, 12] researchers present increasingly more advanced algorithms and sensors. The techniques developed thus far have not received...the electric field pulse is being detected by a group of sensors in array with known distances between the sensors, so triangulation algorithms could

Constrained minimization of smooth functions using a genetic algorithm

NASA Technical Reports Server (NTRS)

Moerder, Daniel D.; Pamadi, Bandu N.

1994-01-01

The use of genetic algorithms for minimization of differentiable functions that are subject to differentiable constraints is considered. A technique is demonstrated for converting the solution of the necessary conditions for a constrained minimum into an unconstrained function minimization. This technique is extended as a global constrained optimization algorithm. The theory is applied to calculating minimum-fuel ascent control settings for an energy state model of an aerospace plane.

Axial Cone Beam Reconstruction by Weighted BPF/DBPF and Orthogonal Butterfly Filtering

PubMed Central

Tang, Shaojie; Tang, Xiangyang

2016-01-01

Goal The backprojection-filtration (BPF) and the derivative backprojection filtered (DBPF) algorithms, in which Hilbert filtering is the common algorithmic feature, are originally derived for exact helical reconstruction from cone beam (CB) scan data and axial reconstruction from fan beam data, respectively. These two algorithms can be heuristically extended for image reconstruction from axial CB scan data, but induce severe artifacts in images located away from the central plane determined by the circular source trajectory. We propose an algorithmic solution herein to eliminate the artifacts. Methods The solution is an integration of three-dimensional (3D) weighted axial CB-BPF/ DBPF algorithm with orthogonal butterfly filtering, namely axial CB-BPF/DBPF cascaded with orthogonal butterfly filtering. Using the computer simulated Forbild head and thoracic phantoms that are rigorous in inspecting reconstruction accuracy and an anthropomorphic thoracic phantom with projection data acquired by a CT scanner, we evaluate performance of the proposed algorithm. Results Preliminary results show that the orthogonal butterfly filtering can eliminate the severe streak artifacts existing in the images reconstructed by the 3D weighted axial CB-BPF/DBPF algorithm located at off-central planes. Conclusion Integrated with orthogonal butterfly filtering, the 3D weighted CB-BPF/DBPF algorithm can perform at least as well as the 3D weighted CB-FBP algorithm in image reconstruction from axial CB scan data. Significance The proposed 3D weighted axial CB-BPF/DBPF cascaded with orthogonal butterfly filtering can be an algorithmic solution for CT imaging in extensive clinical and preclinical applications. PMID:26660512

First trimester PAPP-A in the detection of non-Down syndrome aneuploidy.

PubMed

Ochshorn, Y; Kupferminc, M J; Wolman, I; Orr-Urtreger, A; Jaffa, A J; Yaron, Y

2001-07-01

Combined first trimester screening using pregnancy associated plasma protein-A (PAPP-A), free beta-human chorionic gonadotrophin, and nuchal translucency (NT), is currently accepted as probably the best combination for the detection of Down syndrome (DS). Current first trimester algorithms provide computed risks only for DS. However, low PAPP-A is also associated with other chromosome anomalies such as trisomy 13, 18, and sex chromosome aneuploidy. Thus, using currently available algorithms, some chromosome anomalies may not be detected. The purpose of the present study was to establish a low-end cut-off value for PAPP-A that would increase the detection rates for non-DS chromosome anomalies. The study included 1408 patients who underwent combined first trimester screening. To determine a low-end cut-off value for PAPP-A, a Receiver-Operator Characteristic (ROC) curve analysis was performed. In the entire study group there were 18 cases of chromosome anomalies (trisomy 21, 13, 18, sex chromosome anomalies), 14 of which were among screen-positive patients, a detection rate of 77.7% for all chromosome anomalies (95% CI: 55.7-99.7%). ROC curve analysis detected a statistically significant cut-off for PAPP-A at 0.25 MoM. If the definition of screen-positive were to also include patients with PAPP-A<0.25 MoM, the detection rate would increase to 88.8% for all chromosome anomalies (95% CI: 71.6-106%). This low cut-off value may be used until specific algorithms are implemented for non-Down syndrome aneuploidy. Copyright 2001 John Wiley & Sons, Ltd.

On dealing with multiple correlation peaks in PIV

NASA Astrophysics Data System (ADS)

Masullo, A.; Theunissen, R.

2018-05-01

A novel algorithm to analyse PIV images in the presence of strong in-plane displacement gradients and reduce sub-grid filtering is proposed in this paper. Interrogation windows subjected to strong in-plane displacement gradients often produce correlation maps presenting multiple peaks. Standard multi-grid procedures discard such ambiguous correlation windows using a signal to noise (SNR) filter. The proposed algorithm improves the standard multi-grid algorithm allowing the detection of splintered peaks in a correlation map through an automatic threshold, producing multiple displacement vectors for each correlation area. Vector locations are chosen by translating images according to the peak displacements and by selecting the areas with the strongest match. The method is assessed on synthetic images of a boundary layer of varying intensity and a sinusoidal displacement field of changing wavelength. An experimental case of a flow exhibiting strong velocity gradients is also provided to show the improvements brought by this technique.

An algebraic algorithm for nonuniformity correction in focal-plane arrays.

PubMed

Ratliff, Bradley M; Hayat, Majeed M; Hardie, Russell C

2002-09-01

A scene-based algorithm is developed to compensate for bias nonuniformity in focal-plane arrays. Nonuniformity can be extremely problematic, especially for mid- to far-infrared imaging systems. The technique is based on use of estimates of interframe subpixel shifts in an image sequence, in conjunction with a linear-interpolation model for the motion, to extract information on the bias nonuniformity algebraically. The performance of the proposed algorithm is analyzed by using real infrared and simulated data. One advantage of this technique is its simplicity; it requires relatively few frames to generate an effective correction matrix, thereby permitting the execution of frequent on-the-fly nonuniformity correction as drift occurs. Additionally, the performance is shown to exhibit considerable robustness with respect to lack of the common types of temporal and spatial irradiance diversity that are typically required by statistical scene-based nonuniformity correction techniques.

A one-time pad color image cryptosystem based on SHA-3 and multiple chaotic systems

NASA Astrophysics Data System (ADS)

Wang, Xingyuan; Wang, Siwei; Zhang, Yingqian; Luo, Chao

2018-04-01

A novel image encryption algorithm is proposed that combines the SHA-3 hash function and two chaotic systems: the hyper-chaotic Lorenz and Chen systems. First, 384 bit keystream hash values are obtained by applying SHA-3 to plaintext. The sensitivity of the SHA-3 algorithm and chaotic systems ensures the effect of a one-time pad. Second, the color image is expanded into three-dimensional space. During permutation, it undergoes plane-plane displacements in the x, y and z dimensions. During diffusion, we use the adjacent pixel dataset and corresponding chaotic value to encrypt each pixel. Finally, the structure of alternating between permutation and diffusion is applied to enhance the level of security. Furthermore, we design techniques to improve the algorithm's encryption speed. Our experimental simulations show that the proposed cryptosystem achieves excellent encryption performance and can resist brute-force, statistical, and chosen-plaintext attacks.

Comparative study of 2D ultrasound imaging methods in the f-k domain and evaluation of their performances in a realistic NDT configuration

NASA Astrophysics Data System (ADS)

Merabet, Lucas; Robert, Sébastien; Prada, Claire

2018-04-01

In this paper, we present two frequency-domain algorithms for 2D imaging with plane wave emissions, namely Stolt's migration and Lu's method. The theoretical background is first presented, followed by an analysis of the algorithm complexities. The frequency-domain methods are then compared to the time-domain plane wave imaging in a realistic inspection configuration where the array elements are not in contact with the specimen. Imaging defects located far away from the array aperture is assessed and computation times for the three methods are presented as a function of the number of pixels of the reconstructed image. We show that Lu's method provides a time gain of up to 33 compared to the time-domain algorithm, and demonstrate the limitations of Stolt's migration for defects far away from the aperture.

A Cartesian cut cell method for rarefied flow simulations around moving obstacles

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dechristé, G., E-mail: Guillaume.Dechriste@math.u-bordeaux1.fr; CNRS, IMB, UMR 5251, F-33400 Talence; Mieussens, L., E-mail: Luc.Mieussens@math.u-bordeaux1.fr

2016-06-01

For accurate simulations of rarefied gas flows around moving obstacles, we propose a cut cell method on Cartesian grids: it allows exact conservation and accurate treatment of boundary conditions. Our approach is designed to treat Cartesian cells and various kinds of cut cells by the same algorithm, with no need to identify the specific shape of each cut cell. This makes the implementation quite simple, and allows a direct extension to 3D problems. Such simulations are also made possible by using an adaptive mesh refinement technique and a hybrid parallel implementation. This is illustrated by several test cases, including amore » 3D unsteady simulation of the Crookes radiometer.« less

Learning-based scan plane identification from fetal head ultrasound images

NASA Astrophysics Data System (ADS)

Liu, Xiaoming; Annangi, Pavan; Gupta, Mithun; Yu, Bing; Padfield, Dirk; Banerjee, Jyotirmoy; Krishnan, Kajoli

2012-03-01

Acquisition of a clinically acceptable scan plane is a pre-requisite for ultrasonic measurement of anatomical features from B-mode images. In obstetric ultrasound, measurement of gestational age predictors, such as biparietal diameter and head circumference, is performed at the level of the thalami and cavum septum pelucidi. In an accurate scan plane, the head can be modeled as an ellipse, the thalami looks like a butterfly, the cavum appears like an empty box and the falx is a straight line along the major axis of a symmetric ellipse inclined either parallel to or at small angles to the probe surface. Arriving at the correct probe placement on the mother's belly to obtain an accurate scan plane is a task of considerable challenge especially for a new user of ultrasound. In this work, we present a novel automated learning-based algorithm to identify an acceptable fetal head scan plane. We divide the problem into cranium detection and a template matching to capture the composite "butterfly" structure present inside the head, which mimics the visual cues used by an expert. The algorithm uses the stateof- the-art Active Appearance Models techniques from the image processing and computer vision literature and tie them to presence or absence of the inclusions within the head to automatically compute a score to represent the goodness of a scan plane. This automated technique can be potentially used to train and aid new users of ultrasound.

SAR-based change detection using hypothesis testing and Markov random field modelling

NASA Astrophysics Data System (ADS)

Cao, W.; Martinis, S.

2015-04-01

The objective of this study is to automatically detect changed areas caused by natural disasters from bi-temporal co-registered and calibrated TerraSAR-X data. The technique in this paper consists of two steps: Firstly, an automatic coarse detection step is applied based on a statistical hypothesis test for initializing the classification. The original analytical formula as proposed in the constant false alarm rate (CFAR) edge detector is reviewed and rewritten in a compact form of the incomplete beta function, which is a builtin routine in commercial scientific software such as MATLAB and IDL. Secondly, a post-classification step is introduced to optimize the noisy classification result in the previous step. Generally, an optimization problem can be formulated as a Markov random field (MRF) on which the quality of a classification is measured by an energy function. The optimal classification based on the MRF is related to the lowest energy value. Previous studies provide methods for the optimization problem using MRFs, such as the iterated conditional modes (ICM) algorithm. Recently, a novel algorithm was presented based on graph-cut theory. This method transforms a MRF to an equivalent graph and solves the optimization problem by a max-flow/min-cut algorithm on the graph. In this study this graph-cut algorithm is applied iteratively to improve the coarse classification. At each iteration the parameters of the energy function for the current classification are set by the logarithmic probability density function (PDF). The relevant parameters are estimated by the method of logarithmic cumulants (MoLC). Experiments are performed using two flood events in Germany and Australia in 2011 and a forest fire on La Palma in 2009 using pre- and post-event TerraSAR-X data. The results show convincing coarse classifications and considerable improvement by the graph-cut post-classification step.

Effects of an age-specific anterior cruciate ligament injury prevention program on lower extremity biomechanics in children.

PubMed

DiStefano, Lindsay J; Blackburn, J Troy; Marshall, Stephen W; Guskiewicz, Kevin M; Garrett, William E; Padua, Darin A

2011-05-01

Implementing an anterior cruciate ligament injury prevention program to athletes before the age at which the greatest injury risk occurs (15-17 years) is important from a prevention standpoint. However, it is unknown whether standard programs can modify lower extremity biomechanics in pediatric populations or if specialized training is required. To compare the effects of traditional and age-specific pediatric anterior cruciate ligament injury prevention programs on lower extremity biomechanics during a cutting task in youth athletes. The authors hypothesized that the age-specific pediatric program would result in greater sagittal plane motion (ie, hip and knee flexion) and less motion in the transverse and frontal plane (ie, knee valgus, knee and hip rotation) as compared with the traditional program. Randomized controlled trial; Level of evidence, 1. Sixty-five youth soccer athletes (38 boys, 27 girls) volunteered to participate. The mean age of participants was 10 ± 1 years. Teams (n, 7) were cluster randomized to a pediatric injury prevention program, a traditional injury prevention program, or a control group. The pediatric program was modified from the traditional program to include more feedback, progressions, and variety. Teams performed their programs as part of their normal warm-up routine. Three-dimensional lower extremity biomechanics were assessed during a sidestep cutting task before and after completion of the 9-week intervention period. The pediatric program reduced the amount of knee external rotation at initial ground contact during the cutting task, F ((2,62)) = 3.79, P = .03 (change: pediatric, 7.73° ± 10.71°; control, -0.35° ± 7.76°), as compared with the control group after the intervention period. No other changes were observed. The injury prevention program designed for a pediatric population modified only knee rotation during the cutting task, whereas the traditional program did not result in any changes in cutting biomechanics. These findings suggest limited effectiveness of both programs for athletes younger than 12 years of age in terms of biomechanics during a cutting task.

Investigation of the Effect of Tool Edge Geometry upon Cutting Variables, Tool Wear and Burr Formation Using Finite Element Simulation — A Progress Report

NASA Astrophysics Data System (ADS)

Sartkulvanich, Partchapol; Al-Zkeri, Ibrahim; Yen, Yung-Chang; Altan, Taylan

2004-06-01

This paper summarizes some of the progress made on FEM simulations of metal cutting processes conducted at the Engineering Research Center (ERC/NSM). Presented research focuses on the performance of various cutting edge geometries (hone and chamfer edges) for different tool materials and specifically on: 1) the effect of round and chamfer edge geometries on the cutting variables in machining carbon steels and 2) the effect of the edge hone size upon the flank wear and burr formation behavior in face milling of A356-T6 aluminum alloy. In the second task, an innovative design of edge preparation with varying hone size around the tool nose is also explored using FEM. In order to model three-dimensional conventional turning and face milling with two-dimensional orthogonal cutting simulations, 2D simulation cross-sections consisting of the cutting speed direction and chip flow direction are selected at different locations along the tool nose radius. Then the geometries of the hone and chamfer edges and their associated tool angles as well as uncut chip thickness are determined on these planes and employed in cutting simulations. The chip flow direction on the tool rake face are obtained by examining the wear grooves on the experimental inserts or estimated by using Oxley's approximation theory of oblique cutting. Simulation results are compared with the available experimental results (e.g. cutting forces) both qualitatively and quantitatively.

The best of both worlds: automated CMP polishing of channel-cut monochromators

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kasman, Elina; Erdmann, Mark; Stoupin, Stanislav

2015-09-03

The use of a channel-cut monochromator is the most straightforward method to ensure that the two reflection surfaces maintain alignment between crystallographic planes without the need for complicated alignment mechanisms. Three basic characteristics that affect monochromator performance are: subsurface damage which contaminates spectral purity; surface roughness which reduces efficiency due to scattering; and surface figure error which imparts intensity structure and coherence distortion in the beam. Standard chemical-mechanical polishing processes and equipment are used when the diffracting surface is easily accessible, such as for single-bounce monochromators. Due to the inaccessibly of the surfaces inside a channel-cut monochromator for polishing, thesemore » optics are generally wet-etched for their final processing. This results in minimal subsurface damage, but very poor roughness and figure error. A new CMP channel polishing instrument design is presented which allows the internal diffracting surface quality of channel-cut crystals to approach that of conventional single-bounce monochromators« less

A satellite digital controller or 'play that PID tune again, Sam'. [Position, Integral, Derivative feedback control algorithm for design strategy

NASA Technical Reports Server (NTRS)

Seltzer, S. M.

1976-01-01

The problem discussed is to design a digital controller for a typical satellite. The controlled plant is considered to be a rigid body acting in a plane. The controller is assumed to be a digital computer which, when combined with the proposed control algorithm, can be represented as a sampled-data system. The objective is to present a design strategy and technique for selecting numerical values for the control gains (assuming position, integral, and derivative feedback) and the sample rate. The technique is based on the parameter plane method and requires that the system be amenable to z-transform analysis.

Joint Transform Correlation for face tracking: elderly fall detection application

NASA Astrophysics Data System (ADS)

Katz, Philippe; Aron, Michael; Alfalou, Ayman

2013-03-01

In this paper, an iterative tracking algorithm based on a non-linear JTC (Joint Transform Correlator) architecture and enhanced by a digital image processing method is proposed and validated. This algorithm is based on the computation of a correlation plane where the reference image is updated at each frame. For that purpose, we use the JTC technique in real time to track a patient (target image) in a room fitted with a video camera. The correlation plane is used to localize the target image in the current video frame (frame i). Then, the reference image to be exploited in the next frame (frame i+1) is updated according to the previous one (frame i). In an effort to validate our algorithm, our work is divided into two parts: (i) a large study based on different sequences with several situations and different JTC parameters is achieved in order to quantify their effects on the tracking performances (decimation, non-linearity coefficient, size of the correlation plane, size of the region of interest...). (ii) the tracking algorithm is integrated into an application of elderly fall detection. The first reference image is a face detected by means of Haar descriptors, and then localized into the new video image thanks to our tracking method. In order to avoid a bad update of the reference frame, a method based on a comparison of image intensity histograms is proposed and integrated in our algorithm. This step ensures a robust tracking of the reference frame. This article focuses on face tracking step optimisation and evalutation. A supplementary step of fall detection, based on vertical acceleration and position, will be added and studied in further work.

Secret shared multiple-image encryption based on row scanning compressive ghost imaging and phase retrieval in the Fresnel domain

NASA Astrophysics Data System (ADS)

Li, Xianye; Meng, Xiangfeng; Wang, Yurong; Yang, Xiulun; Yin, Yongkai; Peng, Xiang; He, Wenqi; Dong, Guoyan; Chen, Hongyi

2017-09-01

A multiple-image encryption method is proposed that is based on row scanning compressive ghost imaging, (t, n) threshold secret sharing, and phase retrieval in the Fresnel domain. In the encryption process, after wavelet transform and Arnold transform of the target image, the ciphertext matrix can be first detected using a bucket detector. Based on a (t, n) threshold secret sharing algorithm, the measurement key used in the row scanning compressive ghost imaging can be decomposed and shared into two pairs of sub-keys, which are then reconstructed using two phase-only mask (POM) keys with fixed pixel values, placed in the input plane and transform plane 2 of the phase retrieval scheme, respectively; and the other POM key in the transform plane 1 can be generated and updated by the iterative encoding of each plaintext image. In each iteration, the target image acts as the input amplitude constraint in the input plane. During decryption, each plaintext image possessing all the correct keys can be successfully decrypted by measurement key regeneration, compression algorithm reconstruction, inverse wavelet transformation, and Fresnel transformation. Theoretical analysis and numerical simulations both verify the feasibility of the proposed method.

Influence of Iterative Reconstruction Algorithms on PET Image Resolution

NASA Astrophysics Data System (ADS)

Karpetas, G. E.; Michail, C. M.; Fountos, G. P.; Valais, I. G.; Nikolopoulos, D.; Kandarakis, I. S.; Panayiotakis, G. S.

2015-09-01

The aim of the present study was to assess image quality of PET scanners through a thin layer chromatography (TLC) plane source. The source was simulated using a previously validated Monte Carlo model. The model was developed by using the GATE MC package and reconstructed images obtained with the STIR software for tomographic image reconstruction. The simulated PET scanner was the GE DiscoveryST. A plane source consisted of a TLC plate, was simulated by a layer of silica gel on aluminum (Al) foil substrates, immersed in 18F-FDG bath solution (1MBq). Image quality was assessed in terms of the modulation transfer function (MTF). MTF curves were estimated from transverse reconstructed images of the plane source. Images were reconstructed by the maximum likelihood estimation (MLE)-OSMAPOSL, the ordered subsets separable paraboloidal surrogate (OSSPS), the median root prior (MRP) and OSMAPOSL with quadratic prior, algorithms. OSMAPOSL reconstruction was assessed by using fixed subsets and various iterations, as well as by using various beta (hyper) parameter values. MTF values were found to increase with increasing iterations. MTF also improves by using lower beta values. The simulated PET evaluation method, based on the TLC plane source, can be useful in the resolution assessment of PET scanners.

On Finding Shortest Paths on Convex Polyhedra.

DTIC Science & Technology

1985-05-01

versi ty of N laryhrid ml Collge :IJR-. M T) 207-12 COMPUTER SCIENCE TECHNICAL REPR SERWS .UE TE UNIVERSITY OF MARYLAND COLLEGE PARK, MARYLAND S 20742...planar layout can be physically interpreted as cutting the polyhedron along the ridges and unfolding the resulting object onto the plane. o% 4e.. ~16 A o

Direction of Radio Finding via MUSIC (Multiple Signal Classification) Algorithm for Hardware Design System

NASA Astrophysics Data System (ADS)

Zhang, Zheng

2017-10-01

Concept of radio direction finding systems, which use radio direction finding is based on digital signal processing algorithms. Thus, the radio direction finding system becomes capable to locate and track signals by the both. Performance of radio direction finding significantly depends on effectiveness of digital signal processing algorithms. The algorithm uses the Direction of Arrival (DOA) algorithms to estimate the number of incidents plane waves on the antenna array and their angle of incidence. This manuscript investigates implementation of the DOA algorithms (MUSIC) on the uniform linear array in the presence of white noise. The experiment results exhibit that MUSIC algorithm changed well with the radio direction.

Two-component duality and flavoring in the P+f model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dash, J.W.; Jones, S.T.; Martin, A.

We show that modern Regge fits to rising ..pi..N total cross sections sigma/sub piN/ using the Harari-Freund P+f model of diffraction are not consistent with two-component duality. If a conventional Pomeron is chosen (dominant j-plane pole plus weak cuts), the resulting f is ''dual'' to the resonances plus one-half the background. Conversely, constraining the f-pole amplitude by duality does not allow a reasonable fit to sigma/sub piN/. In contrast, the P-f identity model of diffraction is shown to satisfy a modified form of two-component duality. We show that by incorporating flavoring renormalization, the P+f picture can be made consistent withmore » duality. The unflavored P intercept is 0.91 and the flavored P intercept is 1.1. Significant absorptive j-plane cuts are also required, though these are small enough to be consistent with dominant short-range order. Thus flavoring, which is so essential in P-f identity phenomenology, seems to play a positive role in diffraction scattering generally.« less

Fabrication of a Cryogenic Bias Filter for Ultrasensitive Focal Plane

NASA Technical Reports Server (NTRS)

Chervenak, James; Wollack, Edward

2012-01-01

A fabrication process has been developed for cryogenic in-line filtering for the bias and readout of ultrasensitive cryogenic bolometers for millimeter and submillimeter wavelengths. The design is a microstripline filter that cuts out, or strongly attenuates, frequencies (10 50 GHz) that can be carried by wiring staged at cryogenic temperatures. The filter must have 100-percent transmission at DC and low frequencies where the bias and readout lines will carry signal. The fabrication requires the encapsulation of superconducting wiring in a dielectric-metal envelope with precise electrical characteristics. Sufficiently thick insulation layers with high-conductivity metal layers fully surrounding a patterned superconducting wire in arrayable formats have been demonstrated. A degenerately doped silicon wafer has been chosen to provide a metallic ground plane. A metallic seed layer is patterned to enable attachment to the ground plane. Thick silicon dioxide films are deposited at low temperatures to provide tunable dielectric isolation without degrading the metallic seed layer. Superconducting wiring is deposited and patterned using microstripline filtering techniques to cut out the relevant frequencies. A low Tc superconductor is used so that it will attenuate power strongly above the gap frequency. Thick dielectric is deposited on top of the circuit, and then vias are patterned through both dielectric layers. A thick conductive film is deposited conformally over the entire circuit, except for the contact pads for the signal and bias attachments to complete the encapsulating ground plane. Filters are high-aspect- ratio rectangles, allowing close packing in one direction, while enabling the chip to feed through the wall of a copper enclosure. The chip is secured in the copper wall using a soft metal seal to make good thermal and electrical contact to the outer shield.

Scene-based nonuniformity correction technique that exploits knowledge of the focal-plane array readout architecture.

PubMed

Narayanan, Balaji; Hardie, Russell C; Muse, Robert A

2005-06-10

Spatial fixed-pattern noise is a common and major problem in modern infrared imagers owing to the nonuniform response of the photodiodes in the focal plane array of the imaging system. In addition, the nonuniform response of the readout and digitization electronics, which are involved in multiplexing the signals from the photodiodes, causes further nonuniformity. We describe a novel scene based on a nonuniformity correction algorithm that treats the aggregate nonuniformity in separate stages. First, the nonuniformity from the readout amplifiers is corrected by use of knowledge of the readout architecture of the imaging system. Second, the nonuniformity resulting from the individual detectors is corrected with a nonlinear filter-based method. We demonstrate the performance of the proposed algorithm by applying it to simulated imagery and real infrared data. Quantitative results in terms of the mean absolute error and the signal-to-noise ratio are also presented to demonstrate the efficacy of the proposed algorithm. One advantage of the proposed algorithm is that it requires only a few frames to obtain high-quality corrections.

Recognition of plant parts with problem-specific algorithms

NASA Astrophysics Data System (ADS)

Schwanke, Joerg; Brendel, Thorsten; Jensch, Peter F.; Megnet, Roland

1994-06-01

Automatic micropropagation is necessary to produce cost-effective high amounts of biomass. Juvenile plants are dissected in clean- room environment on particular points on the stem or the leaves. A vision-system detects possible cutting points and controls a specialized robot. This contribution is directed to the pattern- recognition algorithms to detect structural parts of the plant.

Technological support of tool wear resistant qualities and cost saving of process of planetary grinding of flat parts

NASA Astrophysics Data System (ADS)

Ivanova, T. N.; Lyupa, D. C.; Revenko, N. F.; Berkutova, T. A.; Silivanova, O. A.

2018-03-01

A lot of factors varied in time lead to instability of the grinding process. Besides, the method of grinding influences significantly the productivity and quality of processing. In this regard a creation of processes of intensive defect-free grinding on the basis of new constructive and technology solutions represents the scientific problem which is of great importance. One of such solutions is application of planetary face grinding which allows simultaneously changing the kinematics of movement, implementing discontinuous grinding. The distinctive features of such grinding are decreasing the heat release rate in a contact zone; ensuring intermittence of the process with a solid grinding wheel; reverse grinding; cutting by different edges of an abrasive grain; stabilization of working parameters of a grinding wheel; ensuring work of a grinding wheel in a self-sharpening mode. The design of the planetary grinding tool was developed for plane surface processing for implementation of the specified distinctive features of planetary grinding. The kinematics of shaping a surface by flat face diamond grinding has been investigated; manufacturing capabilities of planetary face grinding have been revealed, and ways of improvement of quality and productivity have been offered. The algorithm and the program to define the motion path of a grain depending on the given set of grinding factors were received. Optimization of the process of face diamond grinding using the planetary grinding device has been confirmed with the developed program and techniques to choose cutting conditions of planetary grinding and characteristics of grinding wheels for processing different materials. While studying the process of planetary grinding, special attention was paid to the research how processing conditions influence microgeometry of the processed surface made of steel 4X5M (Russian State Standard (GOST)). As a result of the executed research, it was established that surface roughness parameter Ra during the processing using the planetary grinding device is 35 - 40% less than when using the tool with the solid cutting surface. This phenomenon can be accounted for more uniform work of the cutting grains of the planetary grinding tool as the number of meetings of diamond grains with the surface being processed increases. At the same time, it should be noted that during the planetary grinding more intensive smoothing of tops of microroughnesses is observed that provides the creation of steadier cutting shape. The given method of calculation of cost value of grinding operation allows solving various manufacturing problems: to compare cost value of grinding different materials, grinding wheels of different parameters; to define the optimum grinding conditions.

Mechanical and electrical strain response of a piezoelectric auxetic PZT lattice structure

NASA Astrophysics Data System (ADS)

Fey, Tobias; Eichhorn, Franziska; Han, Guifang; Ebert, Kathrin; Wegener, Moritz; Roosen, Andreas; Kakimoto, Ken-ichi; Greil, Peter

2016-01-01

A two-dimensional auxetic lattice structure was fabricated from a PZT piezoceramic. Tape casted and sintered sheets with a thickness of 530 μm were laser cut into inverted honeycomb lattice structure with re-entrant cell geometry (θ = -25°) and poling direction oriented perpendicular to the lattice plane. The in-plane strain response upon applying an uniaxial compression load as well as an electric field perpendicular to the lattice plane were analyzed by a 2D image data detection analysis. The auxetic lattice structure exhibits orthotropic deformation behavior with a negative in-plane Poisson’s ratio of -2.05. Compared to PZT bulk material the piezoelectric auxetic lattice revealed a strain amplification by a factor of 30-70. Effective transversal coupling coefficients {{d}al}31 of the PZT lattice exceeding 4 × 103 pm V-1 were determined which result in an effective hydrostatic coefficient {{d}al}h 66 times larger than that of bulk PZT.

[A plane-based hand-eye calibration method for surgical robots].

PubMed

Zeng, Bowei; Meng, Fanle; Ding, Hui; Liu, Wenbo; Wu, Di; Wang, Guangzhi

2017-04-01

In order to calibrate the hand-eye transformation of the surgical robot and laser range finder (LRF), a calibration algorithm based on a planar template was designed. A mathematical model of the planar template had been given and the approach to address the equations had been derived. Aiming at the problems of the measurement error in a practical system, we proposed a new algorithm for selecting coplanar data. This algorithm can effectively eliminate considerable measurement error data to improve the calibration accuracy. Furthermore, three orthogonal planes were used to improve the calibration accuracy, in which a nonlinear optimization for hand-eye calibration was used. With the purpose of verifying the calibration precision, we used the LRF to measure some fixed points in different directions and a cuboid's surfaces. Experimental results indicated that the precision of a single planar template method was (1.37±0.24) mm, and that of the three orthogonal planes method was (0.37±0.05) mm. Moreover, the mean FRE of three-dimensional (3D) points was 0.24 mm and mean TRE was 0.26 mm. The maximum angle measurement error was 0.4 degree. Experimental results show that the method presented in this paper is effective with high accuracy and can meet the requirements of surgical robot precise location.

A synthetic visual plane algorithm for visibility computation in consideration of accuracy and efficiency

NASA Astrophysics Data System (ADS)

Yu, Jieqing; Wu, Lixin; Hu, Qingsong; Yan, Zhigang; Zhang, Shaoliang

2017-12-01

Visibility computation is of great interest to location optimization, environmental planning, ecology, and tourism. Many algorithms have been developed for visibility computation. In this paper, we propose a novel method of visibility computation, called synthetic visual plane (SVP), to achieve better performance with respect to efficiency, accuracy, or both. The method uses a global horizon, which is a synthesis of line-of-sight information of all nearer points, to determine the visibility of a point, which makes it an accurate visibility method. We used discretization of horizon to gain a good performance in efficiency. After discretization, the accuracy and efficiency of SVP depends on the scale of discretization (i.e., zone width). The method is more accurate at smaller zone widths, but this requires a longer operating time. Users must strike a balance between accuracy and efficiency at their discretion. According to our experiments, SVP is less accurate but more efficient than R2 if the zone width is set to one grid. However, SVP becomes more accurate than R2 when the zone width is set to 1/24 grid, while it continues to perform as fast or faster than R2. Although SVP performs worse than reference plane and depth map with respect to efficiency, it is superior in accuracy to these other two algorithms.

A simple and inclusive method to determine the habit plane in transmission electron microscope based on accurate measurement of foil thickness

DOE Office of Scientific and Technical Information (OSTI.GOV)

Qiu, Dong, E-mail: d.qiu@uq.edu.au; Zhang, Mingxing

2014-08-15

A simple and inclusive method is proposed for accurate determination of the habit plane between bicrystals in transmission electron microscope. Whilst this method can be regarded as a variant of surface trace analysis, the major innovation lies in the improved accuracy and efficiency of foil thickness measurement, which involves a simple tilt of the thin foil about a permanent tilting axis of the specimen holder, rather than cumbersome tilt about the surface trace of the habit plane. Experimental study has been done to validate this proposed method in determining the habit plane between lamellar α{sub 2} plates and γ matrixmore » in a Ti–Al–Nb alloy. Both high accuracy (± 1°) and high precision (± 1°) have been achieved by using the new method. The source of the experimental errors as well as the applicability of this method is discussed. Some tips to minimise the experimental errors are also suggested. - Highlights: • An improved algorithm is formulated to measure the foil thickness. • Habit plane can be determined with a single tilt holder based on the new algorithm. • Better accuracy and precision within ± 1° are achievable using the proposed method. • The data for multi-facet determination can be collected simultaneously.« less

Joint graph cut and relative fuzzy connectedness image segmentation algorithm.

PubMed

Ciesielski, Krzysztof Chris; Miranda, Paulo A V; Falcão, Alexandre X; Udupa, Jayaram K

2013-12-01

We introduce an image segmentation algorithm, called GC(sum)(max), which combines, in novel manner, the strengths of two popular algorithms: Relative Fuzzy Connectedness (RFC) and (standard) Graph Cut (GC). We show, both theoretically and experimentally, that GC(sum)(max) preserves robustness of RFC with respect to the seed choice (thus, avoiding "shrinking problem" of GC), while keeping GC's stronger control over the problem of "leaking though poorly defined boundary segments." The analysis of GC(sum)(max) is greatly facilitated by our recent theoretical results that RFC can be described within the framework of Generalized GC (GGC) segmentation algorithms. In our implementation of GC(sum)(max) we use, as a subroutine, a version of RFC algorithm (based on Image Forest Transform) that runs (provably) in linear time with respect to the image size. This results in GC(sum)(max) running in a time close to linear. Experimental comparison of GC(sum)(max) to GC, an iterative version of RFC (IRFC), and power watershed (PW), based on a variety medical and non-medical images, indicates superior accuracy performance of GC(sum)(max) over these other methods, resulting in a rank ordering of GC(sum)(max)>PW∼IRFC>GC. Copyright © 2013 Elsevier B.V. All rights reserved.

Probabilistic fusion of stereo with color and contrast for bilayer segmentation.

PubMed

Kolmogorov, Vladimir; Criminisi, Antonio; Blake, Andrew; Cross, Geoffrey; Rother, Carsten

2006-09-01

This paper describes models and algorithms for the real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from color/contrast or from stereo alone is known to be error-prone. Here, color, contrast, and stereo matching information are fused to infer layers accurately and efficiently. The first algorithm, Layered Dynamic Programming (LDP), solves stereo in an extended six-state space that represents both foreground/background layers and occluded regions. The stereo-match likelihood is then fused with a contrast-sensitive color model that is learned on-the-fly and stereo disparities are obtained by dynamic programming. The second algorithm, Layered Graph Cut (LGC), does not directly solve stereo. Instead, the stereo match likelihood is marginalized over disparities to evaluate foreground and background hypotheses and then fused with a contrast-sensitive color model like the one used in LDP. Segmentation is solved efficiently by ternary graph cut. Both algorithms are evaluated with respect to ground truth data and found to have similar performance, substantially better than either stereo or color/ contrast alone. However, their characteristics with respect to computational efficiency are rather different. The algorithms are demonstrated in the application of background substitution and shown to give good quality composite video output.

The Bolocam Galactic Plane Survey: Survey Description and Data Reduction

NASA Astrophysics Data System (ADS)

Aguirre, James E.; Ginsburg, Adam G.; Dunham, Miranda K.; Drosback, Meredith M.; Bally, John; Battersby, Cara; Bradley, Eric Todd; Cyganowski, Claudia; Dowell, Darren; Evans, Neal J., II; Glenn, Jason; Harvey, Paul; Rosolowsky, Erik; Stringfellow, Guy S.; Walawender, Josh; Williams, Jonathan P.

2011-01-01

We present the Bolocam Galactic Plane Survey (BGPS), a 1.1 mm continuum survey at 33'' effective resolution of 170 deg2 of the Galactic Plane visible from the northern hemisphere. The BGPS is one of the first large area, systematic surveys of the Galactic Plane in the millimeter continuum without pre-selected targets. The survey is contiguous over the range -10.5 <= l <= 90.5, |b| <= 0.5. Toward the Cygnus X spiral arm, the coverage was flared to |b| <= 1.5 for 75.5 <= l <= 87.5. In addition, cross-cuts to |b| <= 1.5 were made at l= 3, 15, 30, and 31. The total area of this section is 133 deg2. With the exception of the increase in latitude, no pre-selection criteria were applied to the coverage in this region. In addition to the contiguous region, four targeted regions in the outer Galaxy were observed: IC1396 (9 deg2, 97.5 <= l <= 100.5, 2.25 <= b <= 5.25), a region toward the Perseus Arm (4 deg2 centered on l = 111, b = 0 near NGC 7538), W3/4/5 (18 deg2, 132.5 <= l <= 138.5), and Gem OB1 (6 deg2, 187.5 <= l <= 193.5). The survey has detected approximately 8400 clumps over the entire area to a limiting non-uniform 1σ noise level in the range 11-53 mJy beam-1 in the inner Galaxy. The BGPS source catalog is presented in a previously published companion paper. This paper details the survey observations and data reduction methods for the images. We discuss in detail the determination of astrometric and flux density calibration uncertainties and compare our results to the literature. Data processing algorithms that separate astronomical signals from time-variable atmospheric fluctuations in the data timestream are presented. These algorithms reproduce the structure of the astronomical sky over a limited range of angular scales and produce artifacts in the vicinity of bright sources. Based on simulations, we find that extended emission on scales larger than about 5farcm9 is nearly completely attenuated (>90%) and the linear scale at which the attenuation reaches 50% is 3farcm8. Comparison with other millimeter-wave data sets implies a possible systematic offset in flux calibration, for which no cause has been discovered. This presentation serves as a companion and guide to the public data release (http://irsa.ipac.caltech.edu/Missions/bolocam.html) through NASA's Infrared Processing and Analysis Center (IPAC) Infrared Science Archive (IRSA). New data releases will be provided through IPAC-IRSA with any future improvements in the reduction. The BGPS provides a complementary long-wavelength spectral band for the ongoing ATLASGAL and Herschel-SPIRE surveys, and an important database and context for imminent observations with SCUBA-2 and ALMA.

Determining the maximum diameter for holes in the shoe without compromising shoe integrity when using a multi-segment foot model.

PubMed

Shultz, Rebecca; Jenkyn, Thomas

2012-01-01

Measuring individual foot joint motions requires a multi-segment foot model, even when the subject is wearing a shoe. Each foot segment must be tracked with at least three skin-mounted markers, but for these markers to be visible to an optical motion capture system holes or 'windows' must be cut into the structure of the shoe. The holes must be sufficiently large avoiding interfering with the markers, but small enough that they do not compromise the shoe's structural integrity. The objective of this study was to determine the maximum size of hole that could be cut into a running shoe upper without significantly compromising its structural integrity or changing the kinematics of the foot within the shoe. Three shoe designs were tested: (1) neutral cushioning, (2) motion control and (3) stability shoes. Holes were cut progressively larger, with four sizes tested in all. Foot joint motions were measured: (1) hindfoot with respect to midfoot in the frontal plane, (2) forefoot twist with respect to midfoot in the frontal plane, (3) the height-to-length ratio of the medial longitudinal arch and (4) the hallux angle with respect to first metatarsal in the sagittal plane. A single subject performed level walking at her preferred pace in each of the three shoes with ten repetitions for each hole size. The largest hole that did not disrupt shoe integrity was an oval of 1.7cm×2.5cm. The smallest shoe deformations were seen with the motion control shoe. The least change in foot joint motion was forefoot twist in both the neutral shoe and stability shoe for any size hole. This study demonstrates that for a hole smaller than this size, optical motion capture with a cluster-based multi-segment foot model is feasible for measure foot in shoe kinematics in vivo. Copyright © 2011. Published by Elsevier Ltd.

An improved graph cut segmentation method for cervical lymph nodes on sonograms and its relationship with node's shape assessment.

PubMed

Zhang, Junhua; Wang, Yuanyuan; Shi, Xinling

2009-12-01

A modified graph cut was proposed under the elliptical shape constraint to segment cervical lymph nodes on sonograms, and its effect on the measurement of short axis to long axis ratio (S/L) was investigated by using the relative ultimate measurement accuracy (RUMA). Under the same user inputs, the proposed algorithm successfully segmented all 60 sonograms tested, while the traditional graph cut failed. The mean RUMA resulted from the developed method was comparable to that resulted from the manual segmentation. Results indicated that utilizing the elliptical shape prior could appreciably improve the graph cut for nodes segmentation, and the proposed method satisfied the accuracy requirement of S/L measurement.

PENTACLE: Parallelized particle-particle particle-tree code for planet formation

NASA Astrophysics Data System (ADS)

Iwasawa, Masaki; Oshino, Shoichi; Fujii, Michiko S.; Hori, Yasunori

2017-10-01

We have newly developed a parallelized particle-particle particle-tree code for planet formation, PENTACLE, which is a parallelized hybrid N-body integrator executed on a CPU-based (super)computer. PENTACLE uses a fourth-order Hermite algorithm to calculate gravitational interactions between particles within a cut-off radius and a Barnes-Hut tree method for gravity from particles beyond. It also implements an open-source library designed for full automatic parallelization of particle simulations, FDPS (Framework for Developing Particle Simulator), to parallelize a Barnes-Hut tree algorithm for a memory-distributed supercomputer. These allow us to handle 1-10 million particles in a high-resolution N-body simulation on CPU clusters for collisional dynamics, including physical collisions in a planetesimal disc. In this paper, we show the performance and the accuracy of PENTACLE in terms of \\tilde{R}_cut and a time-step Δt. It turns out that the accuracy of a hybrid N-body simulation is controlled through Δ t / \\tilde{R}_cut and Δ t / \\tilde{R}_cut ˜ 0.1 is necessary to simulate accurately the accretion process of a planet for ≥106 yr. For all those interested in large-scale particle simulations, PENTACLE, customized for planet formation, will be freely available from https://github.com/PENTACLE-Team/PENTACLE under the MIT licence.

Mechanisms and FEM Simulation of Chip Formation in Orthogonal Cutting In-Situ TiB2/7050Al MMC

PubMed Central

Wang, Wenhu; Jiang, Ruisong; Lin, Kunyang; Shao, Mingwei

2018-01-01

The in-situ TiB2/7050Al composite is a new kind of Al-based metal matrix composite (MMC) with super properties, such as low density, improved strength, and wear resistance. This paper, for a deep insight into its cutting performance, involves a study of the chip formation process and finite element simulation during orthogonal cutting in-situ TiB2/7050Al MMC. With chips, material properties, cutting forces, and tool geometry parameters, the Johnson–Cook (J–C) constitutive equation of in-situ TiB2/7050Al composite was established. Then, the cutting simulation model was established by applying the Abaqus–Explicit method, and the serrated chip, shear plane, strain rate, and temperature were analyzed. The experimental and simulation results showed that the obtained material’s constitutive equation was of high reliability, and the saw-tooth chips occurred commonly under either low or high cutting speed and small or large feed rate. From result analysis, it was found that the mechanisms of chip formation included plastic deformation, adiabatic shear, shearing slip, and crack extension. In addition, it was found that the existence of small, hard particles reduced the ductility of the MMC and resulted in segmental chips. PMID:29662047

An accurate algorithm for the detection of DNA fragments from dilution pool sequencing experiments.

PubMed

Bansal, Vikas

2018-01-01

The short read lengths of current high-throughput sequencing technologies limit the ability to recover long-range haplotype information. Dilution pool methods for preparing DNA sequencing libraries from high molecular weight DNA fragments enable the recovery of long DNA fragments from short sequence reads. These approaches require computational methods for identifying the DNA fragments using aligned sequence reads and assembling the fragments into long haplotypes. Although a number of computational methods have been developed for haplotype assembly, the problem of identifying DNA fragments from dilution pool sequence data has not received much attention. We formulate the problem of detecting DNA fragments from dilution pool sequencing experiments as a genome segmentation problem and develop an algorithm that uses dynamic programming to optimize a likelihood function derived from a generative model for the sequence reads. This algorithm uses an iterative approach to automatically infer the mean background read depth and the number of fragments in each pool. Using simulated data, we demonstrate that our method, FragmentCut, has 25-30% greater sensitivity compared with an HMM based method for fragment detection and can also detect overlapping fragments. On a whole-genome human fosmid pool dataset, the haplotypes assembled using the fragments identified by FragmentCut had greater N50 length, 16.2% lower switch error rate and 35.8% lower mismatch error rate compared with two existing methods. We further demonstrate the greater accuracy of our method using two additional dilution pool datasets. FragmentCut is available from https://bansal-lab.github.io/software/FragmentCut. vibansal@ucsd.edu. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

The determination of temperature stability of silver nanotubes by the molecular dynamics simulation

NASA Astrophysics Data System (ADS)

Filatov, O.; Soldatenko, S.; Soldatenko, O.

2018-04-01

Molecular dynamics simulation using the embedded-atom method is applied to study thermal stability of silver nanotubes and its coefficient of linear thermal expansion. The correspondence of face centered cubic structure potential for this task is tested. Three types of nanotubes are modelled: scrolled from graphene-like plane, scrolled from plane with cubic structure and cut from cylinder. It is established that only the last two of them are stable. The last one describes in details. There is critical temperature when free ends of the nanotube close but the interior surface retains. At higher temperatures, the interior surface collapses and the nanotube is unstable.

Electrical impedance tomography in 3D using two electrode planes: characterization and evaluation.

PubMed

Wagenaar, Justin; Adler, Andy

2016-06-01

Electrical impedance tomography (EIT) uses body surface electrical stimulation and measurements to create conductivity images; it shows promise as a non-invasive technology to monitor the distribution of lung ventilation. Most applications of EIT have placed electrodes in a 2D ring around the thorax, and thus produced 2D cross-sectional images. These images are unable to distinguish out-of-plane contributions, or to image volumetric effects. Volumetric EIT can be calculated using multiple electrode planes and a 3D reconstruction algorithm. However, while 3D reconstruction algorithms are available, little has been done to understand the performance of 3D EIT in terms of the measurement configurations available. The goal of this paper is to characterize the phantom and in vivo performance of 3D EIT with two electrode planes. First, phantom measurements are used to measure the reconstruction characteristics of seven stimulation and measurement configurations. Measurements were then performed on eight healthy volunteers as a function of body posture, postures, and with various electrode configurations. Phantom results indicate that 3D EIT using two rings of electrodes provides reasonable resolution in the electrode plane but low vertical resolution. For volunteers, functional EIT images are created from inhalation curve features to analyze the effect of posture (standing, sitting, supine and decline) on regional lung behaviour. An ability to detect vertical changes in lung volume distribution was shown for two electrode configurations. Based on tank and volunteer results, we recommend the use of the 'square' stimulation and measurement pattern for two electrode plane EIT.

Nonuniformity correction based on focal plane array temperature in uncooled long-wave infrared cameras without a shutter.

PubMed

Liang, Kun; Yang, Cailan; Peng, Li; Zhou, Bo

2017-02-01

In uncooled long-wave IR camera systems, the temperature of a focal plane array (FPA) is variable along with the environmental temperature as well as the operating time. The spatial nonuniformity of the FPA, which is partly affected by the FPA temperature, obviously changes as well, resulting in reduced image quality. This study presents a real-time nonuniformity correction algorithm based on FPA temperature to compensate for nonuniformity caused by FPA temperature fluctuation. First, gain coefficients are calculated using a two-point correction technique. Then offset parameters at different FPA temperatures are obtained and stored in tables. When the camera operates, the offset tables are called to update the current offset parameters via a temperature-dependent interpolation. Finally, the gain coefficients and offset parameters are used to correct the output of the IR camera in real time. The proposed algorithm is evaluated and compared with two representative shutterless algorithms [minimizing the sum of the squares of errors algorithm (MSSE), template-based solution algorithm (TBS)] using IR images captured by a 384×288 pixel uncooled IR camera with a 17 μm pitch. Experimental results show that this method can quickly trace the response drift of the detector units when the FPA temperature changes. The quality of the proposed algorithm is as good as MSSE, while the processing time is as short as TBS, which means the proposed algorithm is good for real-time control and at the same time has a high correction effect.

Traveling salesman problems with PageRank Distance on complex networks reveal community structure

NASA Astrophysics Data System (ADS)

Jiang, Zhongzhou; Liu, Jing; Wang, Shuai

2016-12-01

In this paper, we propose a new algorithm for community detection problems (CDPs) based on traveling salesman problems (TSPs), labeled as TSP-CDA. Since TSPs need to find a tour with minimum cost, cities close to each other are usually clustered in the tour. This inspired us to model CDPs as TSPs by taking each vertex as a city. Then, in the final tour, the vertices in the same community tend to cluster together, and the community structure can be obtained by cutting the tour into a couple of paths. There are two challenges. The first is to define a suitable distance between each pair of vertices which can reflect the probability that they belong to the same community. The second is to design a suitable strategy to cut the final tour into paths which can form communities. In TSP-CDA, we deal with these two challenges by defining a PageRank Distance and an automatic threshold-based cutting strategy. The PageRank Distance is designed with the intrinsic properties of CDPs in mind, and can be calculated efficiently. In the experiments, benchmark networks with 1000-10,000 nodes and varying structures are used to test the performance of TSP-CDA. A comparison is also made between TSP-CDA and two well-established community detection algorithms. The results show that TSP-CDA can find accurate community structure efficiently and outperforms the two existing algorithms.

Measurement of the penetration depth and coherence length of MgB 2 in all directions using transmission electron microscopy

NASA Astrophysics Data System (ADS)

Loudon, J. C.; Yazdi, S.; Kasama, T.; Zhigadlo, N. D.; Karpinski, J.

2015-02-01

We demonstrate that images of flux vortices in a superconductor taken with a transmission electron microscope can be used to measure the penetration depth and coherence length in all directions at the same temperature and magnetic field. This is particularly useful for MgB 2, where these quantities vary with the applied magnetic field and values are difficult to obtain at low field or in the c direction. We obtained images of flux vortices from a MgB 2 single crystal cut in the a c plane by focused ion beam milling and tilted to 45∘ with respect to the electron beam about the crystallographic a axis. A new method was developed to simulate these images that accounted for vortices with a nonzero core in a thin, anisotropic superconductor and a simplex algorithm was used to make a quantitative comparison between the images and simulations to measure the penetration depths and coherence lengths. This gave penetration depths Λa b=100 ±35 nm and Λc=120 ±15 nm at 10.8 K in a field of 4.8 mT. The large error in Λa b is a consequence of tilting the sample about a and had it been tilted about c , the errors on Λa b and Λc would be reversed. Thus obtaining the most precise values requires taking images of the flux lattice with the sample tilted in more than one direction. In a previous paper [J. C. Loudon et al., Phys. Rev. B 87, 144515 (2013), 10.1103/PhysRevB.87.144515], we obtained a more precise value for Λa b using a sample cut in the a b plane. Using this value gives Λa b=107 ±8 nm, Λc=120 ±15 nm, ξa b=39 ±11 nm, and ξc=35 ±10 nm, which agree well with measurements made using other techniques. The experiment required two days to conduct and does not require large-scale facilities. It was performed on a very small sample, 30 ×15 μ m and 200-nm thick, so this method could prove useful for superconductors where only small single crystals are available, as is the case for some iron-based superconductors.

Virtual reality in the operating room of the future.

PubMed

Müller, W; Grosskopf, S; Hildebrand, A; Malkewitz, R; Ziegler, R

1997-01-01

In cooperation with the Max-Delbrück-Centrum/Robert-Rössle-Klinik (MDC/RRK) in Berlin, the Fraunhofer Institute for Computer Graphics is currently designing and developing a scenario for the operating room of the future. The goal of this project is to integrate new analysis, visualization and interaction tools in order to optimize and refine tumor diagnostics and therapy in combination with laser technology and remote stereoscopic video transfer. Hence, a human 3-D reference model is reconstructed using CT, MR, and anatomical cryosection images from the National Library of Medicine's Visible Human Project. Applying segmentation algorithms and surface-polygonization methods a 3-D representation is obtained. In addition, a "fly-through" the virtual patient is realized using 3-D input devices (data glove, tracking system, 6-DOF mouse). In this way, the surgeon can experience really new perspectives of the human anatomy. Moreover, using a virtual cutting plane any cut of the CT volume can be interactively placed and visualized in realtime. In conclusion, this project delivers visions for the application of effective visualization and VR systems. Commonly known as Virtual Prototyping and applied by the automotive industry long ago, this project shows, that the use of VR techniques can also prototype an operating room. After evaluating design and functionality of the virtual operating room, MDC plans to build real ORs in the near future. The use of VR techniques provides a more natural interface for the surgeon in the OR (e.g., controlling interactions by voice input). Besides preoperative planning future work will focus on supporting the surgeon in performing surgical interventions. An optimal synthesis of real and synthetic data, and the inclusion of visual, aural, and tactile senses in virtual environments can meet these requirements. This Augmented Reality could represent the environment for the surgeons of tomorrow.

Automatic image analysis and spot classification for detection of pathogenic Escherichia coli on glass slide DNA microarrays

USDA-ARS?s Scientific Manuscript database

A computer algorithm was created to inspect scanned images from DNA microarray slides developed to rapidly detect and genotype E. Coli O157 virulent strains. The algorithm computes centroid locations for signal and background pixels in RGB space and defines a plane perpendicular to the line connect...

Equilibrium Sampling in Biomolecular Simulation

PubMed Central

2015-01-01

Equilibrium sampling of biomolecules remains an unmet challenge after more than 30 years of atomistic simulation. Efforts to enhance sampling capability, which are reviewed here, range from the development of new algorithms to parallelization to novel uses of hardware. Special focus is placed on classifying algorithms — most of which are underpinned by a few key ideas — in order to understand their fundamental strengths and limitations. Although algorithms have proliferated, progress resulting from novel hardware use appears to be more clear-cut than from algorithms alone, partly due to the lack of widely used sampling measures. PMID:21370970

Video segmentation for post-production

NASA Astrophysics Data System (ADS)

Wills, Ciaran

2001-12-01

Specialist post-production is an industry that has much to gain from the application of content-based video analysis techniques. However the types of material handled in specialist post-production, such as television commercials, pop music videos and special effects are quite different in nature from the typical broadcast material which many video analysis techniques are designed to work with; shots are short and highly dynamic, and the transitions are often novel or ambiguous. We address the problem of scene change detection and develop a new algorithm which tackles some of the common aspects of post-production material that cause difficulties for past algorithms, such as illumination changes and jump cuts. Operating in the compressed domain on Motion JPEG compressed video, our algorithm detects cuts and fades by analyzing each JPEG macroblock in the context of its temporal and spatial neighbors. Analyzing the DCT coefficients directly we can extract the mean color of a block and an approximate detail level. We can also perform an approximated cross-correlation between two blocks. The algorithm is part of a set of tools being developed to work with an automated asset management system designed specifically for use in post-production facilities.

Interferometric synthetic aperture radar phase unwrapping based on sparse Markov random fields by graph cuts

NASA Astrophysics Data System (ADS)

Zhou, Lifan; Chai, Dengfeng; Xia, Yu; Ma, Peifeng; Lin, Hui

2018-01-01

Phase unwrapping (PU) is one of the key processes in reconstructing the digital elevation model of a scene from its interferometric synthetic aperture radar (InSAR) data. It is known that two-dimensional (2-D) PU problems can be formulated as maximum a posteriori estimation of Markov random fields (MRFs). However, considering that the traditional MRF algorithm is usually defined on a rectangular grid, it fails easily if large parts of the wrapped data are dominated by noise caused by large low-coherence area or rapid-topography variation. A PU solution based on sparse MRF is presented to extend the traditional MRF algorithm to deal with sparse data, which allows the unwrapping of InSAR data dominated by high phase noise. To speed up the graph cuts algorithm for sparse MRF, we designed dual elementary graphs and merged them to obtain the Delaunay triangle graph, which is used to minimize the energy function efficiently. The experiments on simulated and real data, compared with other existing algorithms, both confirm the effectiveness of the proposed MRF approach, which suffers less from decorrelation effects caused by large low-coherence area or rapid-topography variation.

Evaluation of excitation strategy with multi-plane electrical capacitance tomography sensor

NASA Astrophysics Data System (ADS)

Mao, Mingxu; Ye, Jiamin; Wang, Haigang; Zhang, Jiaolong; Yang, Wuqiang

2016-11-01

Electrical capacitance tomography (ECT) is an imaging technique for measuring the permittivity change of materials. Using a multi-plane ECT sensor, three-dimensional (3D) distribution of permittivity may be represented. In this paper, three excitation strategies, including single-electrode excitation, dual-electrode excitation in the same plane, and dual-electrode excitation in different planes are investigated by numerical simulation and experiment for two three-plane ECT sensors with 12 electrodes in total. In one sensor, the electrodes on the middle plane are in line with the others. In the other sensor, they are rotated 45° with reference to the other two planes. A linear back projection algorithm is used to reconstruct the images and a correlation coefficient is used to evaluate the image quality. The capacitance data and sensitivity distribution with each measurement strategy and sensor model are analyzed. Based on simulation and experimental results using noise-free and noisy capacitance data, the performance of the three strategies is evaluated.

Development of a Numerical Model for Orthogonal Cutting. Discussion about the Sensitivity to Friction Problem

NASA Astrophysics Data System (ADS)

San Juan, M.; de la Iglesia, J. M.; Martín, O.; Santos, F. J.

2009-11-01

In despite of the important progresses achieved in the knowledge of cutting processes, the study of certain aspects has undergone the very limitations of the experimental means: temperature gradients, frictions, contact, etc… Therefore, the development of numerical models is a valid tool as a first approach to study of those problems. In the present work, a calculation model under Abaqus Explicit code is developed to represent the orthogonal cutting of AISI 4140 steel. A bidimensional simulation under plane strain conditions, which is considered as adiabatic due to the high speed of the material flow, is chosen. The chip separation is defined by means of a fracture law that allows complex simulations of tool penetration in the workpiece. The strong influence of friction on cutting is proved, therefore a very good definition of materials behaviour laws could be obtained, but an erroneous value of friction coefficient could notably reduce the reliability. Considering the difficulty of checking the friction models used in the simulation, from the tests carried out habitually, the most efficacious way to characterize the friction would be to combine simulation models with cutting tests.

Phase retrieval based wavefront sensing experimental implementation and wavefront sensing accuracy calibration

NASA Astrophysics Data System (ADS)

Mao, Heng; Wang, Xiao; Zhao, Dazun

2009-05-01

As a wavefront sensing (WFS) tool, Baseline algorithm, which is classified as the iterative-transform algorithm of phase retrieval, estimates the phase distribution at pupil from some known PSFs at defocus planes. By using multiple phase diversities and appropriate phase unwrapping methods, this algorithm can accomplish reliable unique solution and high dynamic phase measurement. In the paper, a Baseline algorithm based wavefront sensing experiment with modification of phase unwrapping has been implemented, and corresponding Graphical User Interfaces (GUI) software has also been given. The adaptability and repeatability of Baseline algorithm have been validated in experiments. Moreover, referring to the ZYGO interferometric results, the WFS accuracy of this algorithm has been exactly calibrated.

Detection of defects on apple using B-spline lighting correction method

NASA Astrophysics Data System (ADS)

Li, Jiangbo; Huang, Wenqian; Guo, Zhiming

To effectively extract defective areas in fruits, the uneven intensity distribution that was produced by the lighting system or by part of the vision system in the image must be corrected. A methodology was used to convert non-uniform intensity distribution on spherical objects into a uniform intensity distribution. A basically plane image with the defective area having a lower gray level than this plane was obtained by using proposed algorithms. Then, the defective areas can be easily extracted by a global threshold value. The experimental results with a 94.0% classification rate based on 100 apple images showed that the proposed algorithm was simple and effective. This proposed method can be applied to other spherical fruits.

Torsion effect of swing frame on the measurement of horizontal two-plane balancing machine

NASA Astrophysics Data System (ADS)

Wang, Qiuxiao; Wang, Dequan; He, Bin; Jiang, Pan; Wu, Zhaofu; Fu, Xiaoyan

2017-03-01

In this paper, the vibration model of swing frame of two-plane balancing machine is established to calculate the vibration center position of swing frame first. The torsional stiffness formula of spring plate twisting around the vibration center is then deduced by using superposition principle. Finally, the dynamic balancing experiments prove the irrationality of A-B-C algorithm which ignores the torsion effect, and show that the torsional stiffness deduced by experiments is consistent with the torsional stiffness calculated by theory. The experimental datas show the influence of the torsion effect of swing frame on the separation ratio of sided balancing machines, which reveals the sources of measurement error and assesses the application scope of A-B-C algorithm.

MCT-Based LWIR and VLWIR 2D Focal Plane Detector Arrays for Low Dark Current Applications at AIM

NASA Astrophysics Data System (ADS)

Hanna, S.; Eich, D.; Mahlein, K.-M.; Fick, W.; Schirmacher, W.; Thöt, R.; Wendler, J.; Figgemeier, H.

2016-09-01

We present our latest results on n-on- p as well as on p-on- n low dark current planar mercury cadmium telluride (MCT) photodiode technology long wavelength infrared (LWIR) and very long wavelength infrared (VLWIR) two-dimensional focal plane arrays (FPAs) with quantum efficiency (QE) cut-off wavelength >11 μm at 80 K and a 512 × 640 pixel format FPA at 20 μm pitch stitched from two 512 × 320 pixel photodiode arrays. Significantly reduced dark currents as compared with Tennant's "Rule 07" are demonstrated in both polarities while retaining good detection efficiency ≥60% for operating temperatures between 30 K and 100 K. This allows for the same dark current performance at 20 K higher operating temperature than with previous AIM INFRAROT-MODULE GmbH (AIM) technology. For p-on- n LWIR MCT FPAs, broadband photoresponse nonuniformity of only about 1.2% is achieved at 55 K with low defective pixel numbers. For an n-on- p VLWIR MCT FPA with 13.6 μm cut-off at 55 K, excellent photoresponse nonuniformity of about 3.1% is achieved at moderate defective pixel numbers. This advancement in detector technology paves the way for outstanding signal-to-noise ratio performance infrared detection, enabling cutting-edge next-generation LWIR/VLWIR detectors for space instruments and devices with higher operating temperature and low size, weight, and power for field applications.

Exploring Conics: Why Does B Squared - 4AC Matter?

ERIC Educational Resources Information Center

Herman, Marlena

2012-01-01

The Ancient Greeks studied conic sections from a geometric point of view--by cutting a cone with a plane. Later, Apollonius (ca. 262-190 BCE) obtained the conic sections from one right double cone. The modern approach to the study of conics can be considered "analytic geometry," in which conic sections are defined in terms of distance…

On the measurement of fiber orientation in fiberboard

Treesearch

Otto Suchsland; Charles W. McMillin

1983-01-01

An attempt to measure the vertical component of fiber orientation in fiberboard is described. The experiment is based on the obvious reduction of the furnish fiber length which occurs by cutting thin microtome sections of the board parallel to the board plane. Only when no vertical fiber orientation component is present will the fibers contained in these sections have...

Interleaved diffusion-weighted EPI improved by adaptive partial-Fourier and multi-band multiplexed sensitivity-encoding reconstruction

PubMed Central

Chang, Hing-Chiu; Guhaniyogi, Shayan; Chen, Nan-kuei

2014-01-01

Purpose We report a series of techniques to reliably eliminate artifacts in interleaved echo-planar imaging (EPI) based diffusion weighted imaging (DWI). Methods First, we integrate the previously reported multiplexed sensitivity encoding (MUSE) algorithm with a new adaptive Homodyne partial-Fourier reconstruction algorithm, so that images reconstructed from interleaved partial-Fourier DWI data are free from artifacts even in the presence of either a) motion-induced k-space energy peak displacement, or b) susceptibility field gradient induced fast phase changes. Second, we generalize the previously reported single-band MUSE framework to multi-band MUSE, so that both through-plane and in-plane aliasing artifacts in multi-band multi-shot interleaved DWI data can be effectively eliminated. Results The new adaptive Homodyne-MUSE reconstruction algorithm reliably produces high-quality and high-resolution DWI, eliminating residual artifacts in images reconstructed with previously reported methods. Furthermore, the generalized MUSE algorithm is compatible with multi-band and high-throughput DWI. Conclusion The integration of the multi-band and adaptive Homodyne-MUSE algorithms significantly improves the spatial-resolution, image quality, and scan throughput of interleaved DWI. We expect that the reported reconstruction framework will play an important role in enabling high-resolution DWI for both neuroscience research and clinical uses. PMID:24925000

Real-time trajectory optimization on parallel processors

NASA Technical Reports Server (NTRS)

Psiaki, Mark L.

1993-01-01

A parallel algorithm has been developed for rapidly solving trajectory optimization problems. The goal of the work has been to develop an algorithm that is suitable to do real-time, on-line optimal guidance through repeated solution of a trajectory optimization problem. The algorithm has been developed on an INTEL iPSC/860 message passing parallel processor. It uses a zero-order-hold discretization of a continuous-time problem and solves the resulting nonlinear programming problem using a custom-designed augmented Lagrangian nonlinear programming algorithm. The algorithm achieves parallelism of function, derivative, and search direction calculations through the principle of domain decomposition applied along the time axis. It has been encoded and tested on 3 example problems, the Goddard problem, the acceleration-limited, planar minimum-time to the origin problem, and a National Aerospace Plane minimum-fuel ascent guidance problem. Execution times as fast as 118 sec of wall clock time have been achieved for a 128-stage Goddard problem solved on 32 processors. A 32-stage minimum-time problem has been solved in 151 sec on 32 processors. A 32-stage National Aerospace Plane problem required 2 hours when solved on 32 processors. A speed-up factor of 7.2 has been achieved by using 32-nodes instead of 1-node to solve a 64-stage Goddard problem.

Using a focal-plane array to estimate antenna pointing errors

NASA Technical Reports Server (NTRS)

Zohar, S.; Vilnrotter, V. A.

1991-01-01

The use of extra collecting horns in the focal plane of an antenna as a means of determining the Direction of Arrival (DOA) of the signal impinging on it, provided it is within the antenna beam, is considered. Our analysis yields a relatively simple algorithm to extract the DOA from the horns' outputs. An algorithm which, in effect, measures the thermal noise of the horns' signals and determines its effect on the uncertainty of the extracted DOA parameters is developed. Both algorithms were implemented in software and tested in simulated data. Based on these tests, it is concluded that this is a viable approach to the DOA determination. Though the results obtained are of general applicability, the particular motivation for the present work is their application to the pointing of a mechanically deformed antenna. It is anticipated that the pointing algorithm developed for a deformed antenna could be obtained as a small perturbation of the algorithm developed for an undeformed antenna. In this context, it should be pointed out that, with a deformed antenna, the array of horns and its associated circuitry constitute the main part of the deformation-compensation system. In this case, the pointing system proposed may be viewed as an additional task carried out by the deformation-compensation hardware.

Time-frequency analysis of time-varying modulated signals based on improved energy separation by iterative generalized demodulation

NASA Astrophysics Data System (ADS)

Feng, Zhipeng; Chu, Fulei; Zuo, Ming J.

2011-03-01

Energy separation algorithm is good at tracking instantaneous changes in frequency and amplitude of modulated signals, but it is subject to the constraints of mono-component and narrow band. In most cases, time-varying modulated vibration signals of machinery consist of multiple components, and have so complicated instantaneous frequency trajectories on time-frequency plane that they overlap in frequency domain. For such signals, conventional filters fail to obtain mono-components of narrow band, and their rectangular decomposition of time-frequency plane may split instantaneous frequency trajectories thus resulting in information loss. Regarding the advantage of generalized demodulation method in decomposing multi-component signals into mono-components, an iterative generalized demodulation method is used as a preprocessing tool to separate signals into mono-components, so as to satisfy the requirements by energy separation algorithm. By this improvement, energy separation algorithm can be generalized to a broad range of signals, as long as the instantaneous frequency trajectories of signal components do not intersect on time-frequency plane. Due to the good adaptability of energy separation algorithm to instantaneous changes in signals and the mono-component decomposition nature of generalized demodulation, the derived time-frequency energy distribution has fine resolution and is free from cross term interferences. The good performance of the proposed time-frequency analysis is illustrated by analyses of a simulated signal and the on-site recorded nonstationary vibration signal of a hydroturbine rotor during a shut-down transient process, showing that it has potential to analyze time-varying modulated signals of multi-components.

Superpixel-based graph cuts for accurate stereo matching

NASA Astrophysics Data System (ADS)

Feng, Liting; Qin, Kaihuai

2017-06-01

Estimating the surface normal vector and disparity of a pixel simultaneously, also known as three-dimensional label method, has been widely used in recent continuous stereo matching problem to achieve sub-pixel accuracy. However, due to the infinite label space, it’s extremely hard to assign each pixel an appropriate label. In this paper, we present an accurate and efficient algorithm, integrating patchmatch with graph cuts, to approach this critical computational problem. Besides, to get robust and precise matching cost, we use a convolutional neural network to learn a similarity measure on small image patches. Compared with other MRF related methods, our method has several advantages: its sub-modular property ensures a sub-problem optimality which is easy to perform in parallel; graph cuts can simultaneously update multiple pixels, avoiding local minima caused by sequential optimizers like belief propagation; it uses segmentation results for better local expansion move; local propagation and randomization can easily generate the initial solution without using external methods. Middlebury experiments show that our method can get higher accuracy than other MRF-based algorithms.

Estimation of tool wear length in finish milling using a fuzzy inference algorithm

NASA Astrophysics Data System (ADS)

Ko, Tae Jo; Cho, Dong Woo

1993-10-01

The geometric accuracy and surface roughness are mainly affected by the flank wear at the minor cutting edge in finish machining. A fuzzy estimator obtained by a fuzzy inference algorithm with a max-min composition rule to evaluate the minor flank wear length in finish milling is introduced. The features sensitive to minor flank wear are extracted from the dispersion analysis of a time series AR model of the feed directional acceleration of the spindle housing. Linguistic rules for fuzzy estimation are constructed using these features, and then fuzzy inferences are carried out with test data sets under various cutting conditions. The proposed system turns out to be effective for estimating minor flank wear length, and its mean error is less than 12%.

Lathe leveler

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lovelady, III, Michael W.J.

A lathe leveler for centering a cutting tool in relation to a cylindrical work piece includes a first leveling arm having a first contact point disposed adjacent a distal end of the first leveling arm, a second leveling arm having a second contact point disposed adjacent a distal end of the second leveling arm, a leveling gage, and a leveling plate having a cutting tool receiving surface positioned parallel to a horizontal axis of the leveling gage and on a same plane as a midpoint of the first contact point and the second contact point. The leveling arms and levelingmore » plate are dimensioned and configured such that the cutting tool receiving surface is centered in relation to the work piece when the first and second contact points are in contact with one of the inner surface and outer surface of the cylindrical work piece and the leveling gage is centered.« less

Scene-based nonuniformity correction technique for infrared focal-plane arrays.

PubMed

Liu, Yong-Jin; Zhu, Hong; Zhao, Yi-Gong

2009-04-20

A scene-based nonuniformity correction algorithm is presented to compensate for the gain and bias nonuniformity in infrared focal-plane array sensors, which can be separated into three parts. First, an interframe-prediction method is used to estimate the true scene, since nonuniformity correction is a typical blind-estimation problem and both scene values and detector parameters are unavailable. Second, the estimated scene, along with its corresponding observed data obtained by detectors, is employed to update the gain and the bias by means of a line-fitting technique. Finally, with these nonuniformity parameters, the compensated output of each detector is obtained by computing a very simple formula. The advantages of the proposed algorithm lie in its low computational complexity and storage requirements and ability to capture temporal drifts in the nonuniformity parameters. The performance of every module is demonstrated with simulated and real infrared image sequences. Experimental results indicate that the proposed algorithm exhibits a superior correction effect.

A real-time photogrammetric algorithm for sensor and synthetic image fusion with application to aviation combined vision

NASA Astrophysics Data System (ADS)

Lebedev, M. A.; Stepaniants, D. G.; Komarov, D. V.; Vygolov, O. V.; Vizilter, Yu. V.; Zheltov, S. Yu.

2014-08-01

The paper addresses a promising visualization concept related to combination of sensor and synthetic images in order to enhance situation awareness of a pilot during an aircraft landing. A real-time algorithm for a fusion of a sensor image, acquired by an onboard camera, and a synthetic 3D image of the external view, generated in an onboard computer, is proposed. The pixel correspondence between the sensor and the synthetic images is obtained by an exterior orientation of a "virtual" camera using runway points as a geospatial reference. The runway points are detected by the Projective Hough Transform, which idea is to project the edge map onto a horizontal plane in the object space (the runway plane) and then to calculate intensity projections of edge pixels on different directions of intensity gradient. The performed experiments on simulated images show that on a base glide path the algorithm provides image fusion with pixel accuracy, even in the case of significant navigation errors.

Simulation of subwavelength metallic gratings using a new implementation of the recursive convolution finite-difference time-domain algorithm.

PubMed

Banerjee, Saswatee; Hoshino, Tetsuya; Cole, James B

2008-08-01

We introduce a new implementation of the finite-difference time-domain (FDTD) algorithm with recursive convolution (RC) for first-order Drude metals. We implemented RC for both Maxwell's equations for light polarized in the plane of incidence (TM mode) and the wave equation for light polarized normal to the plane of incidence (TE mode). We computed the Drude parameters at each wavelength using the measured value of the dielectric constant as a function of the spatial and temporal discretization to ensure both the accuracy of the material model and algorithm stability. For the TE mode, where Maxwell's equations reduce to the wave equation (even in a region of nonuniform permittivity) we introduced a wave equation formulation of RC-FDTD. This greatly reduces the computational cost. We used our methods to compute the diffraction characteristics of metallic gratings in the visible wavelength band and compared our results with frequency-domain calculations.

Towards a PTAS for the generalized TSP in grid clusters

NASA Astrophysics Data System (ADS)

Khachay, Michael; Neznakhina, Katherine

2016-10-01

The Generalized Traveling Salesman Problem (GTSP) is a combinatorial optimization problem, which is to find a minimum cost cycle visiting one point (city) from each cluster exactly. We consider a geometric case of this problem, where n nodes are given inside the integer grid (in the Euclidean plane), each grid cell is a unit square. Clusters are induced by cells `populated' by nodes of the given instance. Even in this special setting, the GTSP remains intractable enclosing the classic Euclidean TSP on the plane. Recently, it was shown that the problem has (1.5+8√2+ɛ)-approximation algorithm with complexity bound depending on n and k polynomially, where k is the number of clusters. In this paper, we propose two approximation algorithms for the Euclidean GTSP on grid clusters. For any fixed k, both algorithms are PTAS. Time complexity of the first one remains polynomial for k = O(log n) while the second one is a PTAS, when k = n - O(log n).

Globally Convergent Inverse Reconstruction Algorithm for Detection of IEDs via Imaging of Spatially Distributed Dielectric Constants using Microwave

DTIC Science & Technology

2010-04-27

Dirichlet boundary data DP̃ (x, y) at the entire plane P̃ . Then one can solve the following boundary value problem in the half space below P̃ ∆w − s2w...which we wanted to be a plane wave when reaching the bottom side of the prism of Figure 1, where measurements were conducted. But actually this 14 was a...initializing wave field is a plane wave. On the other hand, a visual inspection of the output experimental data has revealed to us that actually we had a

Automatic graph-cut based segmentation of bones from knee magnetic resonance images for osteoarthritis research.

PubMed

Ababneh, Sufyan Y; Prescott, Jeff W; Gurcan, Metin N

2011-08-01

In this paper, a new, fully automated, content-based system is proposed for knee bone segmentation from magnetic resonance images (MRI). The purpose of the bone segmentation is to support the discovery and characterization of imaging biomarkers for the incidence and progression of osteoarthritis, a debilitating joint disease, which affects a large portion of the aging population. The segmentation algorithm includes a novel content-based, two-pass disjoint block discovery mechanism, which is designed to support automation, segmentation initialization, and post-processing. The block discovery is achieved by classifying the image content to bone and background blocks according to their similarity to the categories in the training data collected from typical bone structures. The classified blocks are then used to design an efficient graph-cut based segmentation algorithm. This algorithm requires constructing a graph using image pixel data followed by applying a maximum-flow algorithm which generates a minimum graph-cut that corresponds to an initial image segmentation. Content-based refinements and morphological operations are then applied to obtain the final segmentation. The proposed segmentation technique does not require any user interaction and can distinguish between bone and highly similar adjacent structures, such as fat tissues with high accuracy. The performance of the proposed system is evaluated by testing it on 376 MR images from the Osteoarthritis Initiative (OAI) database. This database included a selection of single images containing the femur and tibia from 200 subjects with varying levels of osteoarthritis severity. Additionally, a full three-dimensional segmentation of the bones from ten subjects with 14 slices each, and synthetic images with background having intensity and spatial characteristics similar to those of bone are used to assess the robustness and consistency of the developed algorithm. The results show an automatic bone detection rate of 0.99 and an average segmentation accuracy of 0.95 using the Dice similarity index. Copyright © 2011 Elsevier B.V. All rights reserved.

Clinical evaluation of semi-automatic open-source algorithmic software segmentation of the mandibular bone: Practical feasibility and assessment of a new course of action.

PubMed

Wallner, Jürgen; Hochegger, Kerstin; Chen, Xiaojun; Mischak, Irene; Reinbacher, Knut; Pau, Mauro; Zrnc, Tomislav; Schwenzer-Zimmerer, Katja; Zemann, Wolfgang; Schmalstieg, Dieter; Egger, Jan

2018-01-01

Computer assisted technologies based on algorithmic software segmentation are an increasing topic of interest in complex surgical cases. However-due to functional instability, time consuming software processes, personnel resources or licensed-based financial costs many segmentation processes are often outsourced from clinical centers to third parties and the industry. Therefore, the aim of this trial was to assess the practical feasibility of an easy available, functional stable and licensed-free segmentation approach to be used in the clinical practice. In this retrospective, randomized, controlled trail the accuracy and accordance of the open-source based segmentation algorithm GrowCut was assessed through the comparison to the manually generated ground truth of the same anatomy using 10 CT lower jaw data-sets from the clinical routine. Assessment parameters were the segmentation time, the volume, the voxel number, the Dice Score and the Hausdorff distance. Overall semi-automatic GrowCut segmentation times were about one minute. Mean Dice Score values of over 85% and Hausdorff Distances below 33.5 voxel could be achieved between the algorithmic GrowCut-based segmentations and the manual generated ground truth schemes. Statistical differences between the assessment parameters were not significant (p<0.05) and correlation coefficients were close to the value one (r > 0.94) for any of the comparison made between the two groups. Complete functional stable and time saving segmentations with high accuracy and high positive correlation could be performed by the presented interactive open-source based approach. In the cranio-maxillofacial complex the used method could represent an algorithmic alternative for image-based segmentation in the clinical practice for e.g. surgical treatment planning or visualization of postoperative results and offers several advantages. Due to an open-source basis the used method could be further developed by other groups or specialists. Systematic comparisons to other segmentation approaches or with a greater data amount are areas of future works.

Robust Notion Vision For A Vehicle Moving On A Plane

NASA Astrophysics Data System (ADS)

Moni, Shankar; Weldon, E. J.

1987-05-01

A vehicle equipped with a cemputer vision system moves on a plane. We show that subject to certain constraints, the system can determine the motion of the vehicle (one rotational and two translational degrees of freedom) and the depth of the scene in front of the vehicle. The constraints include limits on the speed of the vehicle, presence of texture on the plane and absence of pitch and roll in the vehicular motion. It is possible to decouple the problems of finding the vehicle's motion and the depth of the scene in front of the vehicle by using two rigidly connected cameras. One views a field with known depth (i.e. the ground plane) and estimates the motion parameters and the other determines the depth map knowing the motion parameters. The motion is constrained to be planar to increase robustness. We use a least squares method of fitting the vehicle motion to observer brightness gradients. With this method, no correspondence between image points needs to be established and information fran the entire image is used in calculating notion. The algorithm performs very reliably on real image sequences and these results have been included. The results compare favourably to the performance of the algorithm of Negandaripour and Horn [2] where six degrees of freedom are assumed.

Smart Cutting Tools and Smart Machining: Development Approaches, and Their Implementation and Application Perspectives

NASA Astrophysics Data System (ADS)

Cheng, Kai; Niu, Zhi-Chao; Wang, Robin C.; Rakowski, Richard; Bateman, Richard

2017-09-01

Smart machining has tremendous potential and is becoming one of new generation high value precision manufacturing technologies in line with the advance of Industry 4.0 concepts. This paper presents some innovative design concepts and, in particular, the development of four types of smart cutting tools, including a force-based smart cutting tool, a temperature-based internally-cooled cutting tool, a fast tool servo (FTS) and smart collets for ultraprecision and micro manufacturing purposes. Implementation and application perspectives of these smart cutting tools are explored and discussed particularly for smart machining against a number of industrial application requirements. They are contamination-free machining, machining of tool-wear-prone Si-based infra-red devices and medical applications, high speed micro milling and micro drilling, etc. Furthermore, implementation techniques are presented focusing on: (a) plug-and-produce design principle and the associated smart control algorithms, (b) piezoelectric film and surface acoustic wave transducers to measure cutting forces in process, (c) critical cutting temperature control in real-time machining, (d) in-process calibration through machining trials, (e) FE-based design and analysis of smart cutting tools, and (f) application exemplars on adaptive smart machining.

Multi-element array signal reconstruction with adaptive least-squares algorithms

NASA Technical Reports Server (NTRS)

Kumar, R.

1992-01-01

Two versions of the adaptive least-squares algorithm are presented for combining signals from multiple feeds placed in the focal plane of a mechanical antenna whose reflector surface is distorted due to various deformations. Coherent signal combining techniques based on the adaptive least-squares algorithm are examined for nearly optimally and adaptively combining the outputs of the feeds. The performance of the two versions is evaluated by simulations. It is demonstrated for the example considered that both of the adaptive least-squares algorithms are capable of offsetting most of the loss in the antenna gain incurred due to reflector surface deformations.

High-order integral equation methods for problems of scattering by bumps and cavities on half-planes.

PubMed

Pérez-Arancibia, Carlos; Bruno, Oscar P

2014-08-01

This paper presents high-order integral equation methods for the evaluation of electromagnetic wave scattering by dielectric bumps and dielectric cavities on perfectly conducting or dielectric half-planes. In detail, the algorithms introduced in this paper apply to eight classical scattering problems, namely, scattering by a dielectric bump on a perfectly conducting or a dielectric half-plane, and scattering by a filled, overfilled, or void dielectric cavity on a perfectly conducting or a dielectric half-plane. In all cases field representations based on single-layer potentials for appropriately chosen Green functions are used. The numerical far fields and near fields exhibit excellent convergence as discretizations are refined-even at and around points where singular fields and infinite currents exist.

Graph cuts and neural networks for segmentation and porosity quantification in Synchrotron Radiation X-ray μCT of an igneous rock sample.

PubMed

Meneses, Anderson Alvarenga de Moura; Palheta, Dayara Bastos; Pinheiro, Christiano Jorge Gomes; Barroso, Regina Cely Rodrigues

2018-03-01

X-ray Synchrotron Radiation Micro-Computed Tomography (SR-µCT) allows a better visualization in three dimensions with a higher spatial resolution, contributing for the discovery of aspects that could not be observable through conventional radiography. The automatic segmentation of SR-µCT scans is highly valuable due to its innumerous applications in geological sciences, especially for morphology, typology, and characterization of rocks. For a great number of µCT scan slices, a manual process of segmentation would be impractical, either for the time expended and for the accuracy of results. Aiming the automatic segmentation of SR-µCT geological sample images, we applied and compared Energy Minimization via Graph Cuts (GC) algorithms and Artificial Neural Networks (ANNs), as well as the well-known K-means and Fuzzy C-Means algorithms. The Dice Similarity Coefficient (DSC), Sensitivity and Precision were the metrics used for comparison. Kruskal-Wallis and Dunn's tests were applied and the best methods were the GC algorithms and ANNs (with Levenberg-Marquardt and Bayesian Regularization). For those algorithms, an approximate Dice Similarity Coefficient of 95% was achieved. Our results confirm the possibility of usage of those algorithms for segmentation and posterior quantification of porosity of an igneous rock sample SR-µCT scan. Copyright © 2017 Elsevier Ltd. All rights reserved.

Non-Equilibrium Turbulence Modeling for High Lift Aerodynamics

NASA Technical Reports Server (NTRS)

Durbin, P. A.

1998-01-01

This phase is discussed in ('Non linear kappa - epsilon - upsilon(sup 2) modeling with application to high lift', Application of the kappa - epsilon -upsilon(sup 2) model to multi-component airfoils'). Further results are presented in 'Non-linear upsilon(sup 2) - f modeling with application to high-lift' The ADI solution method in the initial implementation was very slow to converge on multi-zone chimera meshes. I modified the INS implementation to use GMRES. This provided improved convergence and less need for user intervention in the solution process. There were some difficulties with implementation into the NASA compressible codes, due to their use of approximate factorization. The Helmholtz equation for f is not an evolution equation, so it is not of the form assumed by the approximate factorization method. Although The Kalitzin implementation involved a new solution algorithm ('An implementation of the upsilon(sup 2) - f model with application to transonic flows'). The algorithm involves introducing a relaxation term in the f-equation so that it can be factored. The factorization can be into a plane and a line, with GMRES used in the plane. The NASA code already evaluated coefficients in planes, so no additional memory is required except that associated the the GMRES algorithm. So the scope of this project has expanded via these interactions. . The high-lift work has dovetailed into turbine applications.

Fully 3D refraction correction dosimetry system.

PubMed

Manjappa, Rakesh; Makki, S Sharath; Kumar, Rajesh; Vasu, Ram Mohan; Kanhirodan, Rajan

2016-02-21

The irradiation of selective regions in a polymer gel dosimeter results in an increase in optical density and refractive index (RI) at those regions. An optical tomography-based dosimeter depends on rayline path through the dosimeter to estimate and reconstruct the dose distribution. The refraction of light passing through a dose region results in artefacts in the reconstructed images. These refraction errors are dependant on the scanning geometry and collection optics. We developed a fully 3D image reconstruction algorithm, algebraic reconstruction technique-refraction correction (ART-rc) that corrects for the refractive index mismatches present in a gel dosimeter scanner not only at the boundary, but also for any rayline refraction due to multiple dose regions inside the dosimeter. In this study, simulation and experimental studies have been carried out to reconstruct a 3D dose volume using 2D CCD measurements taken for various views. The study also focuses on the effectiveness of using different refractive-index matching media surrounding the gel dosimeter. Since the optical density is assumed to be low for a dosimeter, the filtered backprojection is routinely used for reconstruction. We carry out the reconstructions using conventional algebraic reconstruction (ART) and refractive index corrected ART (ART-rc) algorithms. The reconstructions based on FDK algorithm for cone-beam tomography has also been carried out for comparison. Line scanners and point detectors, are used to obtain reconstructions plane by plane. The rays passing through dose region with a RI mismatch does not reach the detector in the same plane depending on the angle of incidence and RI. In the fully 3D scanning setup using 2D array detectors, light rays that undergo refraction are still collected and hence can still be accounted for in the reconstruction algorithm. It is found that, for the central region of the dosimeter, the usable radius using ART-rc algorithm with water as RI matched medium is 71.8%, an increase of 6.4% compared to that achieved using conventional ART algorithm. Smaller diameter dosimeters are scanned with dry air scanning by using a wide-angle lens that collects refracted light. The images reconstructed using cone beam geometry is seen to deteriorate in some planes as those regions are not scanned. Refraction correction is important and needs to be taken in to consideration to achieve quantitatively accurate dose reconstructions. Refraction modeling is crucial in array based scanners as it is not possible to identify refracted rays in the sinogram space.

Predicting drug-disease interactions by semi-supervised graph cut algorithm and three-layer data integration.

PubMed

Wu, Guangsheng; Liu, Juan; Wang, Caihua

2017-12-28

Prediction of drug-disease interactions is promising for either drug repositioning or disease treatment fields. The discovery of novel drug-disease interactions, on one hand can help to find novel indictions for the approved drugs; on the other hand can provide new therapeutic approaches for the diseases. Recently, computational methods for finding drug-disease interactions have attracted lots of attention because of their far more higher efficiency and lower cost than the traditional wet experiment methods. However, they still face several challenges, such as the organization of the heterogeneous data, the performance of the model, and so on. In this work, we present to hierarchically integrate the heterogeneous data into three layers. The drug-drug and disease-disease similarities are first calculated separately in each layer, and then the similarities from three layers are linearly fused into comprehensive drug similarities and disease similarities, which can then be used to measure the similarities between two drug-disease pairs. We construct a novel weighted drug-disease pair network, where a node is a drug-disease pair with known or unknown treatment relation, an edge represents the node-node relation which is weighted with the similarity score between two pairs. Now that similar drug-disease pairs are supposed to show similar treatment patterns, we can find the optimal graph cut of the network. The drug-disease pair with unknown relation can then be considered to have similar treatment relation with that within the same cut. Therefore, we develop a semi-supervised graph cut algorithm, SSGC, to find the optimal graph cut, based on which we can identify the potential drug-disease treatment interactions. By comparing with three representative network-based methods, SSGC achieves the highest performances, in terms of both AUC score and the identification rates of true drug-disease pairs. The experiments with different integration strategies also demonstrate that considering several sources of data can improve the performances of the predictors. Further case studies on four diseases, the top-ranked drug-disease associations have been confirmed by KEGG, CTD database and the literature, illustrating the usefulness of SSGC. The proposed comprehensive similarity scores from multi-views and multiple layers and the graph-cut based algorithm can greatly improve the prediction performances of drug-disease associations.

Anticipatory Effects on Lower Extremity Neuromechanics During a Cutting Task.

PubMed

Meinerz, Carolyn M; Malloy, Philip; Geiser, Christopher F; Kipp, Kristof

2015-09-01

Continued research into the mechanism of noncontact anterior cruciate ligament injury helps to improve clinical interventions and injury-prevention strategies. A better understanding of the effects of anticipation on landing neuromechanics may benefit training interventions. To determine the effects of anticipation on lower extremity neuromechanics during a single-legged land-and-cut task. Controlled laboratory study. University biomechanics laboratory. Eighteen female National Collegiate Athletic Association Division I collegiate soccer players (age = 19.7 ± 0.8 years, height = 167.3 ± 6.0 cm, mass = 66.1 ± 2.1 kg). Participants performed a single-legged land-and-cut task under anticipated and unanticipated conditions. Three-dimensional initial contact angles, peak joint angles, and peak internal joint moments and peak vertical ground reaction forces and sagittal-plane energy absorption of the 3 lower extremity joints; muscle activation of selected hip- and knee-joint muscles. Unanticipated cuts resulted in less knee flexion at initial contact and greater ankle toe-in displacement. Unanticipated cuts were also characterized by greater internal hip-abductor and external-rotator moments and smaller internal knee-extensor and external-rotator moments. Muscle-activation profiles during unanticipated cuts were associated with greater activation of the gluteus maximus during the precontact and landing phases. Performing a cutting task under unanticipated conditions changed lower extremity neuromechanics compared with anticipated conditions. Most of the observed changes in lower extremity neuromechanics indicated the adoption of a hip-focused strategy during the unanticipated condition.

An investigation of force components in orthogonal cutting of medical grade cobalt-chromium alloy (ASTM F1537).

PubMed

Baron, Szymon; Ahearne, Eamonn

2017-04-01

An ageing population, increased physical activity and obesity are identified as lifestyle changes that are contributing to the ongoing growth in the use of in-vivo prosthetics for total hip and knee arthroplasty. Cobalt-chromium-molybdenum (Co-Cr-Mo) alloys, due to their mechanical properties and excellent biocompatibility, qualify as a class of materials that meet the stringent functional requirements of these devices. To cost effectively assure the required dimensional and geometric tolerances, manufacturers rely on high-precision machining. However, a comprehensive literature review has shown that there has been limited research into the fundamental mechanisms in mechanical cutting of these alloys. This article reports on the determination of the basic cutting-force coefficients in orthogonal cutting of medical grade Co-Cr-Mo alloy ASTM F1537 over an extended range of cutting speeds ([Formula: see text]) and levels of undeformed chip thickness ([Formula: see text]). A detailed characterisation of the segmented chip morphology over this range is also reported, allowing for an estimation of the shear plane angle and, overall, providing a basis for macro-mechanic modelling of more complex cutting processes. The results are compared with a baseline medical grade titanium alloy, Ti-6Al-4V ASTM F136, and it is shown that the tangential and thrust-force components generated were, respectively, ≈35% and ≈84% higher, depending primarily on undeformed chip thickness but with some influence of the cutting speed.

Hydromechanical planer with cutting and breaking heads

DOE Office of Scientific and Technical Information (OSTI.GOV)

Goris, H.; Gunther, R.; Ogorek, K.

1980-12-16

A hydromatic planer particularly for mining materials in a mining seam is comprised of a planer housing which advantageously has a cutting and breaking head on each end thereof, each of which includes a substantially identical construction. Each cutting head includes a vertically arranged support member which is mounted on the housing of the planer by a parallel linkage so that it may be moved upwardly and downwardly under the control of an adjustment means such as a fluid pressure operated piston and cylinder combination. Each cutting and breaking head also includes a first substantially vertically arranged support member whichmore » is connected by the linkage for upward and downward movement relative to the housing and a second support member which is movable relative to the first and mounted on this first in vertical guides for upward and downward movement. A second fluid pressure operated piston and cylinder combination is connected between first and second support members so that they may be shifted relative to each other. A second support member advantageously carries a cutting and breaking wedge which is oriented to engage the mining seam, for example, on a side thereof, and which may be adjusted relative to a similarly oriented cutting and breaking wedge carried by the first member. In addition, a separate cutting and breaking wedge is carried by the first member and it may be engaged for example against the floor thereof in a plane different from the other two wedges.« less

Buckling-Induced Kirigami

NASA Astrophysics Data System (ADS)

Rafsanjani, Ahmad; Bertoldi, Katia

2017-02-01

We investigate the mechanical response of thin sheets perforated with a square array of mutually orthogonal cuts, which leaves a network of squares connected by small ligaments. Our combined analytical, experimental and numerical results indicate that under uniaxial tension the ligaments buckle out of plane, inducing the formation of 3D patterns whose morphology is controlled by the load direction. We also find that by largely stretching the buckled perforated sheets, plastic strains develop in the ligaments. This gives rise to the formation of kirigami sheets comprising periodic distribution of cuts and permanent folds. As such, the proposed buckling-induced pop-up strategy points to a simple route for manufacturing complex morphable structures out of flat perforated sheets.

Force-frequency effect of Y-cut langanite and Y-cut langatate.

PubMed

Kim, Yoonkee; Ballato, Arthur

2003-12-01

Most recently, langasite and its isomorphs (LGX) have been advanced as potential substitutes for quartz, owing to their extremely high-quality (Q) factors. At least twice higher Q value of LGX than that of quartz has been reported. High Q translates into potentially greater stability. In order to make such materials practical, the environmental sensitivities must be addressed. One of such sensitivities is the force-frequency effect, which relates the sensitiveness of a resonator to shock and vibration via the third-order (non-Hookean) elastic constants. In this paper, we report measured force-frequency coefficients of a Y-cut langanite (LGN) resonator and a Y-cut langatate (LGT) resonator as a function of the azimuthal angle, which is the angle between the crystalline x-axis of a resonator plate and the direction of in-plane diametric force applied to the periphery of the resonator. It was found that the LGN and the LGT behave like AT-cut quartz in the polarity of the frequency changes and the existence of zero-coefficient angle. The maximum magnitudes of the coefficients of the LGN and the LGT are five and seven times smaller than that of stress-compensated cut (SC-cut) quartz, respectively (or, 7 and 10 times smaller comparing to AT-cut quartz). The coefficients of planar-stress, which represent the superposition of a continuous distribution of periphery stresses, also were obtained as 0.52 X 10(-15) m x s/N and 0.38 X 10(-15) m x s/N for the LGN and the LGT, respectively.

Artificial Intelligence Based Selection of Optimal Cutting Tool and Process Parameters for Effective Turning and Milling Operations

NASA Astrophysics Data System (ADS)

Saranya, Kunaparaju; John Rozario Jegaraj, J.; Ramesh Kumar, Katta; Venkateshwara Rao, Ghanta

2016-06-01

With the increased trend in automation of modern manufacturing industry, the human intervention in routine, repetitive and data specific activities of manufacturing is greatly reduced. In this paper, an attempt has been made to reduce the human intervention in selection of optimal cutting tool and process parameters for metal cutting applications, using Artificial Intelligence techniques. Generally, the selection of appropriate cutting tool and parameters in metal cutting is carried out by experienced technician/cutting tool expert based on his knowledge base or extensive search from huge cutting tool database. The present proposed approach replaces the existing practice of physical search for tools from the databooks/tool catalogues with intelligent knowledge-based selection system. This system employs artificial intelligence based techniques such as artificial neural networks, fuzzy logic and genetic algorithm for decision making and optimization. This intelligence based optimal tool selection strategy is developed using Mathworks Matlab Version 7.11.0 and implemented. The cutting tool database was obtained from the tool catalogues of different tool manufacturers. This paper discusses in detail, the methodology and strategies employed for selection of appropriate cutting tool and optimization of process parameters based on multi-objective optimization criteria considering material removal rate, tool life and tool cost.

High-accuracy optical extensometer based on coordinate transform in two-dimensional digital image correlation

NASA Astrophysics Data System (ADS)

Lv, Zeqian; Xu, Xiaohai; Yan, Tianhao; Cai, Yulong; Su, Yong; Zhang, Qingchuan

2018-01-01

In the measurement of plate specimens, traditional two-dimensional (2D) digital image correlation (DIC) is challenged by two aspects: (1) the slant optical axis (misalignment of the optical camera axis and the object surface) and (2) out-of-plane motions (including translations and rotations) of the specimens. There are measurement errors in the results measured by 2D DIC, especially when the out-of-plane motions are big enough. To solve this problem, a novel compensation method has been proposed to correct the unsatisfactory results. The proposed compensation method consists of three main parts: 1) a pre-calibration step is used to determine the intrinsic parameters and lens distortions; 2) a compensation panel (a rigid panel with several markers located at known positions) is mounted to the specimen to track the specimen's motion so that the relative coordinate transformation between the compensation panel and the 2D DIC setup can be calculated using the coordinate transform algorithm; 3) three-dimensional world coordinates of measuring points on the specimen can be reconstructed via the coordinate transform algorithm and used to calculate deformations. Simulations have been carried out to validate the proposed compensation method. Results come out that when the extensometer length is 400 pixels, the strain accuracy reaches 10 με no matter out-of-plane translations (less than 1/200 of the object distance) nor out-of-plane rotations (rotation angle less than 5°) occur. The proposed compensation method leads to good results even when the out-of-plane translation reaches several percents of the object distance or the out-of-plane rotation angle reaches tens of degrees. The proposed compensation method has been applied in tensile experiments to obtain high-accuracy results as well.

Stress singularities in a model of a wood disk under sinusoidal pressure

Treesearch

Jay A. Johnson; John C. Hermanson; Steven M. Cramer; Charles Amundson

2005-01-01

A thin, solid, circular wood disk, cut from the transverse plane of a tree stem, can be modeled as a cylindrically orthotropic elastic material. It is known that a stress singularity can occur at the center of a cylindrically orthotropic disk subjected to uniform pressure. If a solid cylindrically orthotropic disk is subjected to sinusoidal pressure distributions, then...

An Ellipse Morphs to a Cosine Graph!

ERIC Educational Resources Information Center

King, L .R.

2013-01-01

We produce a continuum of curves all of the same length, beginning with an ellipse and ending with a cosine graph. The curves in the continuum are made by cutting and unrolling circular cones whose section is the ellipse; the initial cone is degenerate (it is the plane of the ellipse); the final cone is a circular cylinder. The curves of the…

On the Hilbert-Huang Transform Theoretical Foundation

NASA Technical Reports Server (NTRS)

Kizhner, Semion; Blank, Karin; Huang, Norden E.

2004-01-01

The Hilbert-Huang Transform [HHT] is a novel empirical method for spectrum analysis of non-linear and non-stationary signals. The HHT is a recent development and much remains to be done to establish the theoretical foundation of the HHT algorithms. This paper develops the theoretical foundation for the convergence of the HHT sifting algorithm and it proves that the finest spectrum scale will always be the first generated by the HHT Empirical Mode Decomposition (EMD) algorithm. The theoretical foundation for cutting an extrema data points set into two parts is also developed. This then allows parallel signal processing for the HHT computationally complex sifting algorithm and its optimization in hardware.

Restricted Modal Analysis Applied to Internal Annular Combustor Autospectra and Cross-Spectra Measurements

NASA Technical Reports Server (NTRS)

Miles, Jeffrey Hilton

2007-01-01

A treatment of the modal decomposition of the pressure field in a combustor as determined by two pressure time history measurements is developed herein. It is applied to a Pratt and Whitney PW4098 engine combustor over a range of operating conditions. For modes other than the plane wave the assumption is made that there are distinct frequency bands in which the individual modes, including the plane wave mode, overlap such that if circumferential mode m and circumferential mode m-1 are present then circumferential mode m-2 is not. In the analysis used herein at frequencies above the first cutoff mode frequency, only pairs of circumferential modes are individually present at each frequency. Consequently, this is a restricted modal analysis. As part of the analysis one specifies mode cut-on frequencies. This creates a set of frequencies that each mode spans. One finding was the successful use of the same modal span frequencies over a range of operating conditions for this particular engine. This suggests that for this case the cut-on frequencies are in proximity at each operating condition. Consequently, the combustion noise spectrum related to the circumferential modes might not change much with operating condition.

Technology for pressure-instrumented thin airfoil models, phase 1

NASA Technical Reports Server (NTRS)

Wigley, D. A.

1985-01-01

A network of channels was chemically milled into one surface of a pair of matched plates having bond planes which were neither planar or profiled to match the contour of the trailing edge of a supercritical airfoil for testing in cryogenic wind tunnels. Vacuum brazing bonded the plates together to create a network of pressure passages without blockages or cross leaks. The greatest success was achieved with the smaller samples and planar bonding surfaces. In larger samples, problems were encountered due to warpage created by the relief of residual stresses. Successful bonds were formed by brazing A286, Nitronic 40 and 300 series stainless steels at 1065 C using AMS 4777B brazing alloy, but excessive grain growth occurred in samples of 200 grade 18 nickel maraging steels. Good bonds were obtained with maraging steel using a 47 percent Nickel-47 percent Palladium-6 percent Silicon alloy and brazing at 927 C. Electro-Discharge-Machining was an effective method of cutting profiled bond planes and airfoil contours. Orifices of good definition were obtained when the EDM wire cut passed through predrilled holes. Possible configurations for joints between small segments and the larger main wing were also studied.

Initial rigid response and softening transition of highly stretchable kirigami sheet materials.

PubMed

Isobe, Midori; Okumura, Ko

2016-04-27

We study, experimentally and theoretically, the mechanical response of sheet materials on which line cracks or cuts are arranged in a simple pattern. Such sheet materials, often called kirigami (the Japanese words, kiri and gami, stand for cut and paper, respectively), demonstrate a unique mechanical response promising for various engineering applications such as stretchable batteries: kirigami sheets possess a mechanical regime in which sheets are highly stretchable and very soft compared with the original sheets without line cracks, by virtue of out-of-plane deformation. However, this regime starts after a transition from an initial stiff regime governed by in-plane deformation. In other words, the softness of the kirigami structure emerges as a result of a transition from the two-dimensional to three-dimensional deformation, i.e., from stretching to bending. We clarify the physical origins of the transition and mechanical regimes, which are revealed to be governed by simple scaling laws. The results could be useful for controlling and designing the mechanical response of sheet materials including cell sheets for medical regeneration and relevant to the development of materials with tunable stiffness and mechanical force sensors.

Fully-automated approach to hippocampus segmentation using a graph-cuts algorithm combined with atlas-based segmentation and morphological opening.

PubMed

Kwak, Kichang; Yoon, Uicheul; Lee, Dong-Kyun; Kim, Geon Ha; Seo, Sang Won; Na, Duk L; Shim, Hack-Joon; Lee, Jong-Min

2013-09-01

The hippocampus has been known to be an important structure as a biomarker for Alzheimer's disease (AD) and other neurological and psychiatric diseases. However, it requires accurate, robust and reproducible delineation of hippocampal structures. In this study, an automated hippocampal segmentation method based on a graph-cuts algorithm combined with atlas-based segmentation and morphological opening was proposed. First of all, the atlas-based segmentation was applied to define initial hippocampal region for a priori information on graph-cuts. The definition of initial seeds was further elaborated by incorporating estimation of partial volume probabilities at each voxel. Finally, morphological opening was applied to reduce false positive of the result processed by graph-cuts. In the experiments with twenty-seven healthy normal subjects, the proposed method showed more reliable results (similarity index=0.81±0.03) than the conventional atlas-based segmentation method (0.72±0.04). Also as for segmentation accuracy which is measured in terms of the ratios of false positive and false negative, the proposed method (precision=0.76±0.04, recall=0.86±0.05) produced lower ratios than the conventional methods (0.73±0.05, 0.72±0.06) demonstrating its plausibility for accurate, robust and reliable segmentation of hippocampus. Copyright © 2013 Elsevier Inc. All rights reserved.

Combination of Ultrasonic Vibration and Cryogenic Cooling for Cutting Performance Improvement of Inconel 718 Turning

NASA Astrophysics Data System (ADS)

Lin, S. Y.; Chung, C. T.; Cheng, Y. Y.

2011-01-01

The main objective of this study is to develop a thermo-elastic-plastic coupling model, based on a combination skill of ultrasonically assisted cutting and cryogenic cooling, under large deformation for Inconel 718 alloy machining process. The improvement extent on cutting performance and tool life promotion may be examined from this investigation. The critical value of the strain energy density of the workpiece will be utilized as the chip separation and the discontinuous chip segmentation criteria. The forced convection cooling and a hydrodynamic lubrication model will be considered and formulated in the model. Finite element method will be applied to create a complete numerical solution for this ultrasonic vibration cutting model. During the analysis, the cutting tool is incrementally advanced forward with superimposed ultrasonic vibration in a back and forth step-by-step manner, from an incipient stage of tool-workpiece engagement to a steady state of chip formation, a whole simulation of orthogonal cutting process under plane strain deformation is thus undertaken. High shear strength induces a fluctuation phenomenon of shear angle, high shear strain rate, variation of chip types and chip morphology, tool-chip contact length variation, the temperature distributions within the workpiece, chip and tool, periodic fluctuation in cutting forces can be determined from the developed model. A complete comparison of machining characteristics between some different combinations of ultrasonically assisted cutting and cryogenic cooling with conventional cutting operation can be acquired. Finally, the high-speed turning experiment for Inconel 718 alloy will be taken in the laboratory to validate the accuracy of the model, and the progressive flank wear, crater wear, notching and chipping of the tool edge can also be measured in the experiments.

Fast computation of the kurtogram for the detection of transient faults

NASA Astrophysics Data System (ADS)

Antoni, Jérôme

2007-01-01

The kurtogram is a fourth-order spectral analysis tool recently introduced for detecting and characterising non-stationarities in a signal. The paradigm relies on the assertion that each type of transient is associated with an optimal (frequency/frequency resolution) dyad { f,Δf} which maximises its kurtosis, and hence its detection. However, the complete exploration of the whole plane ( f,Δf) is a formidable task hardly amenable to on-line industrial applications. In this communication we describe a fast algorithm for computing the kurtogram over a grid that finely samples the ( f,Δf) plane. Its complexity is on the order of N log N, similarly to the FFT. The efficiency of the algorithm is then illustrated on several industrial cases concerned with the detection of incipient transient faults.

Kinematic model for the space-variant image motion of star sensors under dynamical conditions

NASA Astrophysics Data System (ADS)

Liu, Chao-Shan; Hu, Lai-Hong; Liu, Guang-Bin; Yang, Bo; Li, Ai-Jun

2015-06-01

A kinematic description of a star spot in the focal plane is presented for star sensors under dynamical conditions, which involves all necessary parameters such as the image motion, velocity, and attitude parameters of the vehicle. Stars at different locations of the focal plane correspond to the slightly different orientation and extent of motion blur, which characterize the space-variant point spread function. Finally, the image motion, the energy distribution, and centroid extraction are numerically investigated using the kinematic model under dynamic conditions. A centroid error of eight successive iterations <0.002 pixel is used as the termination criterion for the Richardson-Lucy deconvolution algorithm. The kinematic model of a star sensor is useful for evaluating the compensation algorithms of motion-blurred images.

Generating Fiducial Cuts for CLAS E5

NASA Astrophysics Data System (ADS)

Greenholt, Kristen

2005-04-01

The Thomas Jefferson National Accelerator Facility, located in Newport News, Virginia, is home to CLAS (CEBAF Large Acceptance Spectrometer) which observes the scattering effects of high-energy collisions of an electron beam and a proton or deuteron target. When data are collected with CLAS, one of the properties measured is the cross-section, which is proportional to the number of events and the efficiency and inversely proportional to the solid angle. The efficiency, or acceptance of the detector, is the ratio between the data one expects to observe in an ideal detector and the data that we actually measure with the real CLAS detector. In outlying azimuthal regions, the efficiency is less clearly understood, which leads to measurements which are reliant on the conditions of the detector itself. In order to analyze data which fall in regions of stable and well-understood efficiency, we generated fiducial cuts on CLAS. Our fiducial cuts fit a function to the edges of regions of stable efficiency. These cuts enable us to focus on the data with good acceptance/efficiency. When examining at the fiducial cuts, we required stable efficiency, or flat regions, a good visual fit, a minimized chi squared, and a reasonable behavior in each in azimuthal versus polar angle plane for each electron-momentum bin. Generating these fiducial cuts enables us to focus on data from CLAS where the efficiency of the detector is well understood.

Artist's Concept of X-37 Re-entry

NASA Technical Reports Server (NTRS)

1999-01-01

Pictured is an artist's concept of the experimental X-37 Reusable Launch Vehicle re-entering Earth`s atmosphere. NASA and the Boeing Company entered a cooperative agreement to develop and fly a new experimental space plane called the X-37 that would be ferried into orbit to test new technologies. The reusable space plane incorporated technologies aimed at significantly cutting the cost of space flight. The X-37 would be carried into orbit by the Space Shuttle or be launched by an expendable rocket. After the X-37 was deployed, it would remain in orbit up to 21 days, performing a variety of experiments before re-entering the Earth's atmosphere and landing. The X-37 program was discontinued in 2003.

Fish scale terrace GaInN/GaN light-emitting diodes with enhanced light extraction

NASA Astrophysics Data System (ADS)

Stark, Christoph J. M.; Detchprohm, Theeradetch; Zhao, Liang; Paskova, Tanya; Preble, Edward A.; Wetzel, Christian

2012-12-01

Non-planar GaInN/GaN light-emitting diodes were epitaxially grown to exhibit steps for enhanced light emission. By means of a large off-cut of the epitaxial growth plane from the c-plane (0.06° to 2.24°), surface morphologies of steps and inclined terraces that resemble fish scale patterns could controllably be achieved. These patterns penetrate the active region without deteriorating the electrical device performance. We find conditions leading to a large increase in light-output power over the virtually on-axis device and over planar sapphire references. The process is found suitable to enhance light extraction even without post-growth processing.

S-Wave Dispersion Relations: Exact Left Hand E-Plane Discontinuity from the Born Series

NASA Technical Reports Server (NTRS)

Bessis, D.; Temkin, A.

1999-01-01

We show, for a superposition of Yukawa potentials, that the left hand cut discontinuity in the complex E plane of the (S-wave) scattering amplitude is given exactly, in an interval depending on n, by the discontinuity of the Born series stopped at order n. This also establishes an inverse and unexpected correspondence of the Born series at positive high energies and negative low energies. We can thus construct a viable dispersion relation (DR) for the partial (S-) wave amplitude. The high numerical precision achievable by the DR is demonstrated for the exponential potential at zero scattering energy. We also briefly discuss the extension of our results to Field Theory.

Advanced Concept

NASA Image and Video Library

1999-08-13

Pictured is an artist's concept of the experimental X-37 Reusable Launch Vehicle re-entering Earth‘s atmosphere. NASA and the Boeing Company entered a cooperative agreement to develop and fly a new experimental space plane called the X-37 that would be ferried into orbit to test new technologies. The reusable space plane incorporated technologies aimed at significantly cutting the cost of space flight. The X-37 would be carried into orbit by the Space Shuttle or be launched by an expendable rocket. After the X-37 was deployed, it would remain in orbit up to 21 days, performing a variety of experiments before re-entering the Earth's atmosphere and landing. The X-37 program was discontinued in 2003.

A real-time algorithm for integrating differential satellite and inertial navigation information during helicopter approach. M.S. Thesis

NASA Technical Reports Server (NTRS)

Hoang, TY

1994-01-01

A real-time, high-rate precision navigation Kalman filter algorithm is developed and analyzed. This Navigation algorithm blends various navigation data collected during terminal area approach of an instrumented helicopter. Navigation data collected include helicopter position and velocity from a global position system in differential mode (DGPS) as well as helicopter velocity and attitude from an inertial navigation system (INS). The goal of the Navigation algorithm is to increase the DGPS accuracy while producing navigational data at the 64 Hertz INS update rate. It is important to note that while the data was post flight processed, the Navigation algorithm was designed for real-time analysis. The design of the Navigation algorithm resulted in a nine-state Kalman filter. The Kalman filter's state matrix contains position, velocity, and velocity bias components. The filter updates positional readings with DGPS position, INS velocity, and velocity bias information. In addition, the filter incorporates a sporadic data rejection scheme. This relatively simple model met and exceeded the ten meter absolute positional requirement. The Navigation algorithm results were compared with truth data derived from a laser tracker. The helicopter flight profile included terminal glideslope angles of 3, 6, and 9 degrees. Two flight segments extracted during each terminal approach were used to evaluate the Navigation algorithm. The first segment recorded small dynamic maneuver in the lateral plane while motion in the vertical plane was recorded by the second segment. The longitudinal, lateral, and vertical averaged positional accuracies for all three glideslope approaches are as follows (mean plus or minus two standard deviations in meters): longitudinal (-0.03 plus or minus 1.41), lateral (-1.29 plus or minus 2.36), and vertical (-0.76 plus or minus 2.05).

On the optimal two-impulse maneuver

NASA Technical Reports Server (NTRS)

Bonneau, F. G.; Diarra, C. M.

1992-01-01

An algorithm and a solution to the optimal two-impulse maneuver for the Ulysses spacecraft is presented. The option in which both maneuvers are designed using the critical plane strategy, which further reduces the propellant budget, is included. Results show savings of 12.4 and 16.7 m/s for full targeting and critical plane strategy, respectively. It is argued that this software will play an important role in the area of multimission maneuver design.

Combining watershed and graph cuts methods to segment organs at risk in radiotherapy

NASA Astrophysics Data System (ADS)

Dolz, Jose; Kirisli, Hortense A.; Viard, Romain; Massoptier, Laurent

2014-03-01

Computer-aided segmentation of anatomical structures in medical images is a valuable tool for efficient radiation therapy planning (RTP). As delineation errors highly affect the radiation oncology treatment, it is crucial to delineate geometric structures accurately. In this paper, a semi-automatic segmentation approach for computed tomography (CT) images, based on watershed and graph-cuts methods, is presented. The watershed pre-segmentation groups small areas of similar intensities in homogeneous labels, which are subsequently used as input for the graph-cuts algorithm. This methodology does not require of prior knowledge of the structure to be segmented; even so, it performs well with complex shapes and low intensity. The presented method also allows the user to add foreground and background strokes in any of the three standard orthogonal views - axial, sagittal or coronal - making the interaction with the algorithm easy and fast. Hence, the segmentation information is propagated within the whole volume, providing a spatially coherent result. The proposed algorithm has been evaluated using 9 CT volumes, by comparing its segmentation performance over several organs - lungs, liver, spleen, heart and aorta - to those of manual delineation from experts. A Dicés coefficient higher than 0.89 was achieved in every case. That demonstrates that the proposed approach works well for all the anatomical structures analyzed. Due to the quality of the results, the introduction of the proposed approach in the RTP process will be a helpful tool for organs at risk (OARs) segmentation.

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory

PubMed Central

Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A.

2016-01-01

There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of “maximum flow-minimum cut” graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered. PMID:27089174

Optimized Waterspace Management and Scheduling Using Mixed-Integer Linear Programming

DTIC Science & Technology

2016-01-01

Complete [30]. Proposition 4.1 satisfies the first criterion. For the second criterion, we will use the Traveling Salesman Problem (TSP), which has been...A branch and cut algorithm for the symmetric generalized traveling salesman problem , Operations Research 45 (1997) 378–394. [33] J. Silberholz, B...Golden, The generalized traveling salesman problem : A new genetic algorithm ap- proach, Extended Horizons: Advances in Computing, Optimization, and

Texture classification using autoregressive filtering

NASA Technical Reports Server (NTRS)

Lawton, W. M.; Lee, M.

1984-01-01

A general theory of image texture models is proposed and its applicability to the problem of scene segmentation using texture classification is discussed. An algorithm, based on half-plane autoregressive filtering, which optimally utilizes second order statistics to discriminate between texture classes represented by arbitrary wide sense stationary random fields is described. Empirical results of applying this algorithm to natural and sysnthesized scenes are presented and future research is outlined.

Fluorescence hyperspectral imaging technique for foreign substance detection on fresh-cut lettuce.

PubMed

Mo, Changyeun; Kim, Giyoung; Kim, Moon S; Lim, Jongguk; Cho, Hyunjeong; Barnaby, Jinyoung Yang; Cho, Byoung-Kwan

2017-09-01

Non-destructive methods based on fluorescence hyperspectral imaging (HSI) techniques were developed to detect worms on fresh-cut lettuce. The optimal wavebands for detecting the worms were investigated using the one-way ANOVA and correlation analyses. The worm detection imaging algorithms, RSI-I (492-626)/492 , provided a prediction accuracy of 99.0%. The fluorescence HSI techniques indicated that the spectral images with a pixel size of 1 × 1 mm had the best classification accuracy for worms. The overall results demonstrate that fluorescence HSI techniques have the potential to detect worms on fresh-cut lettuce. In the future, we will focus on developing a multi-spectral imaging system to detect foreign substances such as worms, slugs and earthworms on fresh-cut lettuce. © 2017 Society of Chemical Industry. © 2017 Society of Chemical Industry.

Rapid Process to Generate Beam Envelopes for Optical System Analysis

NASA Technical Reports Server (NTRS)

Howard, Joseph; Seals, Lenward

2012-01-01

The task of evaluating obstructions in the optical throughput of an optical system requires the use of two disciplines, and hence, two models: optical models for the details of optical propagation, and mechanical models for determining the actual structure that exists in the optical system. Previous analysis methods for creating beam envelopes (or cones of light) for use in this obstruction analysis were found to be cumbersome to calculate and take significant time and resources to complete. A new process was developed that takes less time to complete beam envelope analysis, is more accurate and less dependent upon manual node tracking to create the beam envelopes, and eases the burden on the mechanical CAD (computer-aided design) designers to form the beam solids. This algorithm allows rapid generation of beam envelopes for optical system obstruction analysis. Ray trace information is taken from optical design software and used to generate CAD objects that represent the boundary of the beam envelopes for detailed analysis in mechanical CAD software. Matlab is used to call ray trace data from the optical model for all fields and entrance pupil points of interest. These are chosen to be the edge of each space, so that these rays produce the bounding volume for the beam. The x and y global coordinate data is collected on the surface planes of interest, typically an image of the field and entrance pupil internal of the optical system. This x and y coordinate data is then evaluated using a convex hull algorithm, which removes any internal points, which are unnecessary to produce the bounding volume of interest. At this point, tolerances can be applied to expand the size of either the field or aperture, depending on the allocations. Once this minimum set of coordinates on the pupil and field is obtained, a new set of rays is generated between the field plane and aperture plane (or vice-versa). These rays are then evaluated at planes between the aperture and field, at a desired number of steps perceived necessary to build up the bounding volume or cone shape. At each plane, the ray coordinates are again evaluated using the convex hull algorithm to reduce the data to a minimal set. When all of the coordinates of interest are obtained for every plane of the propagation, the data is formatted into an xyz file suitable for FRED optical analysis software to import and create a STEP file of the data. This results in a spiral-like structure that is easily imported by mechanical CAD users who can then use an automated algorithm to wrap a skin around it and create a solid that represents the beam.

Random phase encoding for optical security

NASA Astrophysics Data System (ADS)

Wang, RuiKang K.; Watson, Ian A.; Chatwin, Christopher R.

1996-09-01

A new optical encoding method for security applications is proposed. The encoded image (encrypted into the security products) is merely a random phase image statistically and randomly generated by a random number generator using a computer, which contains no information from the reference pattern (stored for verification) or the frequency plane filter (a phase-only function for decoding). The phase function in the frequency plane is obtained using a modified phase retrieval algorithm. The proposed method uses two phase-only functions (images) at both the input and frequency planes of the optical processor leading to maximum optical efficiency. Computer simulation shows that the proposed method is robust for optical security applications.

Analysis about diamond tool wear in nano-metric cutting of single crystal silicon using molecular dynamics method

NASA Astrophysics Data System (ADS)

Wang, Zhiguo; Liang, Yingchun; Chen, Mingjun; Tong, Zhen; Chen, Jiaxuan

2010-10-01

Tool wear not only changes its geometry accuracy and integrity, but also decrease machining precision and surface integrity of workpiece that affect using performance and service life of workpiece in ultra-precision machining. Scholars made a lot of experimental researches and stimulant analyses, but there is a great difference on the wear mechanism, especially on the nano-scale wear mechanism. In this paper, the three-dimensional simulation model is built to simulate nano-metric cutting of a single crystal silicon with a non-rigid right-angle diamond tool with 0 rake angle and 0 clearance angle by the molecular dynamics (MD) simulation approach, which is used to investigate the diamond tool wear during the nano-metric cutting process. A Tersoff potential is employed for the interaction between carbon-carbon atoms, silicon-silicon atoms and carbon-silicon atoms. The tool gets the high alternating shear stress, the tool wear firstly presents at the cutting edge where intension is low. At the corner the tool is splitted along the {1 1 1} crystal plane, which forms the tipping. The wear at the flank face is the structure transformation of diamond that the diamond structure transforms into the sheet graphite structure. Owing to the tool wear the cutting force increases.

The effects of fatigue and anticipation on the mechanics of the knee during cutting in female athletes.

PubMed

Collins, Joseph D; Almonroeder, Thomas G; Ebersole, Kyle T; O'Connor, Kristian M

2016-06-01

Unanticipated cutting tasks which do not allow for pre-planning of a movement have been reported to promote knee mechanics which may increase the risk of anterior cruciate ligament injury. Fatigue has also been reported to have similar effects. Athletes must often perform unanticipated tasks when they are fatigued. Previous studies have reported that the effects of anticipation become more prominent as an athlete progresses through a fatigue protocol. However, the protocols previously utilized may not mimic the demands of sports participation. Three-dimensional knee joint kinematics and kinetics were collected from 13 female athletes while they performed a run-and-cut task, before and after completion of an intermittent shuttle run. Trials were further divided (pre-planned, unanticipated) to assess the effects of anticipation. There were no significant interactions between the effects of fatigue and anticipation for the peak knee angles or moments of the knee joint in any plane. Subjects did demonstrate a 68% increase in their peak knee abduction angles following completion of the intermittent shuttle run. Anticipation also had a significant effect on the mechanics of the knee in all planes. Most notably, there was a 23% increase in peak knee abduction angles and a 33% increase in the peak internal knee adduction moments. Both fatigue and anticipation promoted knee mechanics which are associated with an increased risk of knee injury. However, it does not appear that their effects combine when athletes are at a level of fatigue which is thought to reflect sports participation. Copyright © 2016 Elsevier Ltd. All rights reserved.

Neural network control of a parallel hybrid-electric propulsion system for a small unmanned aerial vehicle

NASA Astrophysics Data System (ADS)

Harmon, Frederick G.

2005-11-01

Parallel hybrid-electric propulsion systems would be beneficial for small unmanned aerial vehicles (UAVs) used for military, homeland security, and disaster-monitoring missions. The benefits, due to the hybrid and electric-only modes, include increased time-on-station and greater range as compared to electric-powered UAVs and stealth modes not available with gasoline-powered UAVs. This dissertation contributes to the research fields of small unmanned aerial vehicles, hybrid-electric propulsion system control, and intelligent control. A conceptual design of a small UAV with a parallel hybrid-electric propulsion system is provided. The UAV is intended for intelligence, surveillance, and reconnaissance (ISR) missions. A conceptual design reveals the trade-offs that must be considered to take advantage of the hybrid-electric propulsion system. The resulting hybrid-electric propulsion system is a two-point design that includes an engine primarily sized for cruise speed and an electric motor and battery pack that are primarily sized for a slower endurance speed. The electric motor provides additional power for take-off, climbing, and acceleration and also serves as a generator during charge-sustaining operation or regeneration. The intelligent control of the hybrid-electric propulsion system is based on an instantaneous optimization algorithm that generates a hyper-plane from the nonlinear efficiency maps for the internal combustion engine, electric motor, and lithium-ion battery pack. The hyper-plane incorporates charge-depletion and charge-sustaining strategies. The optimization algorithm is flexible and allows the operator/user to assign relative importance between the use of gasoline, electricity, and recharging depending on the intended mission. A MATLAB/Simulink model was developed to test the control algorithms. The Cerebellar Model Arithmetic Computer (CMAC) associative memory neural network is applied to the control of the UAVs parallel hybrid-electric propulsion system. The CMAC neural network approximates the hyper-plane generated from the instantaneous optimization algorithm and produces torque commands for the internal combustion engine and electric motor. The CMAC neural network controller saves on the required memory as compared to a large look-up table by two orders of magnitude. The CMAC controller also prevents the need to compute a hyper-plane or complex logic every time step.

Improving semi-automated segmentation by integrating learning with active sampling

NASA Astrophysics Data System (ADS)

Huo, Jing; Okada, Kazunori; Brown, Matthew

2012-02-01

Interactive segmentation algorithms such as GrowCut usually require quite a few user interactions to perform well, and have poor repeatability. In this study, we developed a novel technique to boost the performance of the interactive segmentation method GrowCut involving: 1) a novel "focused sampling" approach for supervised learning, as opposed to conventional random sampling; 2) boosting GrowCut using the machine learned results. We applied the proposed technique to the glioblastoma multiforme (GBM) brain tumor segmentation, and evaluated on a dataset of ten cases from a multiple center pharmaceutical drug trial. The results showed that the proposed system has the potential to reduce user interaction while maintaining similar segmentation accuracy.

Liver vessels segmentation using a hybrid geometrical moments/graph cuts method

PubMed Central

Esneault, Simon; Lafon, Cyril; Dillenseger, Jean-Louis

2010-01-01

This paper describes a fast and fully-automatic method for liver vessel segmentation on CT scan pre-operative images. The basis of this method is the introduction of a 3-D geometrical moment-based detector of cylindrical shapes within the min-cut/max-flow energy minimization framework. This method represents an original way to introduce a data term as a constraint into the widely used Boykov’s graph cuts algorithm and hence, to automate the segmentation. The method is evaluated and compared with others on a synthetic dataset. Finally, the relevancy of our method regarding the planning of a -necessarily accurate- percutaneous high intensity focused ultrasound surgical operation is demonstrated with some examples. PMID:19783500

Short-cut Methods versus Rigorous Methods for Performance-evaluation of Distillation Configurations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ramapriya, Gautham Madenoor; Selvarajah, Ajiththaa; Jimenez Cucaita, Luis Eduardo

Here, this study demonstrates the efficacy of a short-cut method such as the Global Minimization Algorithm (GMA), that uses assumptions of ideal mixtures, constant molar overflow (CMO) and pinched columns, in pruning the search-space of distillation column configurations for zeotropic multicomponent separation, to provide a small subset of attractive configurations with low minimum heat duties. The short-cut method, due to its simplifying assumptions, is computationally efficient, yet reliable in identifying the small subset of useful configurations for further detailed process evaluation. This two-tier approach allows expedient search of the configuration space containing hundreds to thousands of candidate configurations for amore » given application.« less

Short-cut Methods versus Rigorous Methods for Performance-evaluation of Distillation Configurations

DOE PAGES

Ramapriya, Gautham Madenoor; Selvarajah, Ajiththaa; Jimenez Cucaita, Luis Eduardo; ...

2018-05-17

Here, this study demonstrates the efficacy of a short-cut method such as the Global Minimization Algorithm (GMA), that uses assumptions of ideal mixtures, constant molar overflow (CMO) and pinched columns, in pruning the search-space of distillation column configurations for zeotropic multicomponent separation, to provide a small subset of attractive configurations with low minimum heat duties. The short-cut method, due to its simplifying assumptions, is computationally efficient, yet reliable in identifying the small subset of useful configurations for further detailed process evaluation. This two-tier approach allows expedient search of the configuration space containing hundreds to thousands of candidate configurations for amore » given application.« less

Club position relative to the golfer's swing plane meaningfully affects swing dynamics.

PubMed

MacKenzie, Sasho J

2012-06-01

Previous research indicates that the motion of the golf club is not planar and that the plane traced out by the club is different than that of the golfer's hands. The aim of the present study was to investigate how the position of the club, relative to the golfer's swing plane, influences the motion of the club by using a four-segment (torso, upper arm, forearm, and club), three-dimensional forward dynamics model. A genetic algorithm optimized the coordination of the model's four muscular torque generators to produce the best golf swings possible under six different conditions. The series of simulations were designed to demonstrate the effect of positioning the club above, and below, the golfer's swing plane as well as the effect of changing the steepness of the golfer's swing plane. The simulation results suggest that positioning the club below the golfer's swing plane, early in the downswing, will facilitate the squaring of the clubface for impact, while positioning the club above the plane will have the opposite effect. It was also demonstrated that changing the steepness of the golfer's swing plane by 10 degrees can have little effect on the delivery of the clubhead to the ball.

Optimized path planning for soft tissue resection via laser vaporization

NASA Astrophysics Data System (ADS)

Ross, Weston; Cornwell, Neil; Tucker, Matthew; Mann, Brian; Codd, Patrick

2018-02-01

Robotic and robotic-assisted surgeries are becoming more prevalent with the promise of improving surgical outcomes through increased precision, reduced operating times, and minimally invasive procedures. The handheld laser scalpel in neurosurgery has been shown to provide a more gentle approach to tissue manipulation on or near critical structures over classical tooling, though difficulties of control have prevented large scale adoption of the tool. This paper presents a novel approach to generating a cutting path for the volumetric resection of tissue using a computer-guided laser scalpel. A soft tissue ablation simulator is developed and used in conjunction with an optimization routine to select parameters which maximize the total resection of target tissue while minimizing the damage to surrounding tissue. The simulator predicts the ablative properties of tissue from an interrogation cut for tuning and simulates the removal of a tumorous tissue embedded on the surface of healthy tissue using a laser scalpel. We demonstrate the ability to control depth and smoothness of cut using genetic algorithms to optimize the ablation parameters and cutting path. The laser power level, cutting rate and spacing between cuts are optimized over multiple surface cuts to achieve the desired resection volumes.

Fan filters, the 3-D Radon transform, and image sequence analysis.

PubMed

Marzetta, T L

1994-01-01

This paper develops a theory for the application of fan filters to moving objects. In contrast to previous treatments of the subject based on the 3-D Fourier transform, simplicity and insight are achieved by using the 3-D Radon transform. With this point of view, the Radon transform decomposes the image sequence into a set of plane waves that are parameterized by a two-component slowness vector. Fan filtering is equivalent to a multiplication in the Radon transform domain by a slowness response function, followed by an inverse Radon transform. The plane wave representation of a moving object involves only a restricted set of slownesses such that the inner product of the plane wave slowness vector and the moving object velocity vector is equal to one. All of the complexity in the application of fan filters to image sequences results from the velocity-slowness mapping not being one-to-one; therefore, the filter response cannot be independently specified at all velocities. A key contribution of this paper is to elucidate both the power and the limitations of fan filtering in this new application. A potential application of 3-D fan filters is in the detection of moving targets in clutter and noise. For example, an appropriately designed fan filter can reject perfectly all moving objects whose speed, irrespective of heading, is less than a specified cut-off speed, with only minor attenuation of significantly faster objects. A simple geometric construction determines the response of the filter for speeds greater than the cut-off speed.

Real-time slicing algorithm for Stereolithography (STL) CAD model applied in additive manufacturing industry

NASA Astrophysics Data System (ADS)

Adnan, F. A.; Romlay, F. R. M.; Shafiq, M.

2018-04-01

Owing to the advent of the industrial revolution 4.0, the need for further evaluating processes applied in the additive manufacturing application particularly the computational process for slicing is non-trivial. This paper evaluates a real-time slicing algorithm for slicing an STL formatted computer-aided design (CAD). A line-plane intersection equation was applied to perform the slicing procedure at any given height. The application of this algorithm has found to provide a better computational time regardless the number of facet in the STL model. The performance of this algorithm is evaluated by comparing the results of the computational time for different geometry.

Aircraft target detection algorithm based on high resolution spaceborne SAR imagery

NASA Astrophysics Data System (ADS)

Zhang, Hui; Hao, Mengxi; Zhang, Cong; Su, Xiaojing

2018-03-01

In this paper, an image classification algorithm for airport area is proposed, which based on the statistical features of synthetic aperture radar (SAR) images and the spatial information of pixels. The algorithm combines Gamma mixture model and MRF. The algorithm using Gamma mixture model to obtain the initial classification result. Pixel space correlation based on the classification results are optimized by the MRF technique. Additionally, morphology methods are employed to extract airport (ROI) region where the suspected aircraft target samples are clarified to reduce the false alarm and increase the detection performance. Finally, this paper presents the plane target detection, which have been verified by simulation test.

Functionality limit of classical simulated annealing

NASA Astrophysics Data System (ADS)

Hasegawa, M.

2015-09-01

By analyzing the system dynamics in the landscape paradigm, optimization function of classical simulated annealing is reviewed on the random traveling salesman problems. The properly functioning region of the algorithm is experimentally determined in the size-time plane and the influence of its boundary on the scalability test is examined in the standard framework of this method. From both results, an empirical choice of temperature length is plausibly explained as a minimum requirement that the algorithm maintains its scalability within its functionality limit. The study exemplifies the applicability of computational physics analysis to the optimization algorithm research.

Characterising Dynamic Instability in High Water-Cut Oil-Water Flows Using High-Resolution Microwave Sensor Signals

NASA Astrophysics Data System (ADS)

Liu, Weixin; Jin, Ningde; Han, Yunfeng; Ma, Jing

2018-06-01

In the present study, multi-scale entropy algorithm was used to characterise the complex flow phenomena of turbulent droplets in high water-cut oil-water two-phase flow. First, we compared multi-scale weighted permutation entropy (MWPE), multi-scale approximate entropy (MAE), multi-scale sample entropy (MSE) and multi-scale complexity measure (MCM) for typical nonlinear systems. The results show that MWPE presents satisfied variability with scale and anti-noise ability. Accordingly, we conducted an experiment of vertical upward oil-water two-phase flow with high water-cut and collected the signals of a high-resolution microwave resonant sensor, based on which two indexes, the entropy rate and mean value of MWPE, were extracted. Besides, the effects of total flow rate and water-cut on these two indexes were analysed. Our researches show that MWPE is an effective method to uncover the dynamic instability of oil-water two-phase flow with high water-cut.

Detection of Cutting Tool Wear using Statistical Analysis and Regression Model

NASA Astrophysics Data System (ADS)

Ghani, Jaharah A.; Rizal, Muhammad; Nuawi, Mohd Zaki; Haron, Che Hassan Che; Ramli, Rizauddin

2010-10-01

This study presents a new method for detecting the cutting tool wear based on the measured cutting force signals. A statistical-based method called Integrated Kurtosis-based Algorithm for Z-Filter technique, called I-kaz was used for developing a regression model and 3D graphic presentation of I-kaz 3D coefficient during machining process. The machining tests were carried out using a CNC turning machine Colchester Master Tornado T4 in dry cutting condition. A Kistler 9255B dynamometer was used to measure the cutting force signals, which were transmitted, analyzed, and displayed in the DasyLab software. Various force signals from machining operation were analyzed, and each has its own I-kaz 3D coefficient. This coefficient was examined and its relationship with flank wear lands (VB) was determined. A regression model was developed due to this relationship, and results of the regression model shows that the I-kaz 3D coefficient value decreases as tool wear increases. The result then is used for real time tool wear monitoring.

Cutting Pattern Identification for Coal Mining Shearer through a Swarm Intelligence–Based Variable Translation Wavelet Neural Network

PubMed Central

Xu, Jing; Wang, Zhongbin; Tan, Chao; Liu, Xinhua

2018-01-01

As a sound signal has the advantages of non-contacted measurement, compact structure, and low power consumption, it has resulted in much attention in many fields. In this paper, the sound signal of the coal mining shearer is analyzed to realize the accurate online cutting pattern identification and guarantee the safety quality of the working face. The original acoustic signal is first collected through an industrial microphone and decomposed by adaptive ensemble empirical mode decomposition (EEMD). A 13-dimensional set composed by the normalized energy of each level is extracted as the feature vector in the next step. Then, a swarm intelligence optimization algorithm inspired by bat foraging behavior is applied to determine key parameters of the traditional variable translation wavelet neural network (VTWNN). Moreover, a disturbance coefficient is introduced into the basic bat algorithm (BA) to overcome the disadvantage of easily falling into local extremum and limited exploration ability. The VTWNN optimized by the modified BA (VTWNN-MBA) is used as the cutting pattern recognizer. Finally, a simulation example, with an accuracy of 95.25%, and a series of comparisons are conducted to prove the effectiveness and superiority of the proposed method. PMID:29382120

Graph cuts for curvature based image denoising.

PubMed

Bae, Egil; Shi, Juan; Tai, Xue-Cheng

2011-05-01

Minimization of total variation (TV) is a well-known method for image denoising. Recently, the relationship between TV minimization problems and binary MRF models has been much explored. This has resulted in some very efficient combinatorial optimization algorithms for the TV minimization problem in the discrete setting via graph cuts. To overcome limitations, such as staircasing effects, of the relatively simple TV model, variational models based upon higher order derivatives have been proposed. The Euler's elastica model is one such higher order model of central importance, which minimizes the curvature of all level lines in the image. Traditional numerical methods for minimizing the energy in such higher order models are complicated and computationally complex. In this paper, we will present an efficient minimization algorithm based upon graph cuts for minimizing the energy in the Euler's elastica model, by simplifying the problem to that of solving a sequence of easy graph representable problems. This sequence has connections to the gradient flow of the energy function, and converges to a minimum point. The numerical experiments show that our new approach is more effective in maintaining smooth visual results while preserving sharp features better than TV models.

Use of hyperspectral imaging technology to develop a diagnostic support system for gastric cancer

NASA Astrophysics Data System (ADS)

Goto, Atsushi; Nishikawa, Jun; Kiyotoki, Shu; Nakamura, Munetaka; Nishimura, Junichi; Okamoto, Takeshi; Ogihara, Hiroyuki; Fujita, Yusuke; Hamamoto, Yoshihiko; Sakaida, Isao

2015-01-01

Hyperspectral imaging (HSI) is a new technology that obtains spectroscopic information and renders it in image form. This study examined the difference in the spectral reflectance (SR) of gastric tumors and normal mucosa recorded with a hyperspectral camera equipped with HSI technology and attempted to determine the specific wavelength that is useful for the diagnosis of gastric cancer. A total of 104 gastric tumors removed by endoscopic submucosal dissection from 96 patients at Yamaguchi University Hospital were recorded using a hyperspectral camera. We determined the optimal wavelength and the cut-off value for differentiating tumors from normal mucosa to establish a diagnostic algorithm. We also attempted to highlight tumors by image processing using the hyperspectral camera's analysis software. A wavelength of 770 nm and a cut-off value of 1/4 the corrected SR were selected as the respective optimal wavelength and cut-off values. The rates of sensitivity, specificity, and accuracy of the algorithm's diagnostic capability were 71%, 98%, and 85%, respectively. It was possible to enhance tumors by image processing at the 770-nm wavelength. HSI can be used to measure the SR in gastric tumors and to differentiate between tumorous and normal mucosa.

Research on auto-calibration technology of the image plane's center of 360-degree and all round looking camera

NASA Astrophysics Data System (ADS)

Zhang, Shaojun; Xu, Xiping

2015-10-01

The 360-degree and all round looking camera, as its characteristics of suitable for automatic analysis and judgment on the ambient environment of the carrier by image recognition algorithm, is usually applied to opto-electronic radar of robots and smart cars. In order to ensure the stability and consistency of image processing results of mass production, it is necessary to make sure the centers of image planes of different cameras are coincident, which requires to calibrate the position of the image plane's center. The traditional mechanical calibration method and electronic adjusting mode of inputting the offsets manually, both exist the problem of relying on human eyes, inefficiency and large range of error distribution. In this paper, an approach of auto- calibration of the image plane of this camera is presented. The imaging of the 360-degree and all round looking camera is a ring-shaped image consisting of two concentric circles, the center of the image is a smaller circle and the outside is a bigger circle. The realization of the technology is just to exploit the above characteristics. Recognizing the two circles through HOUGH TRANSFORM algorithm and calculating the center position, we can get the accurate center of image, that the deviation of the central location of the optic axis and image sensor. The program will set up the image sensor chip through I2C bus automatically, we can adjusting the center of the image plane automatically and accurately. The technique has been applied to practice, promotes productivity and guarantees the consistent quality of products.

Computation of Bound Orbits in the Plane of a Galaxy with a Flat Rotation Curve

ERIC Educational Resources Information Center

Bacon, M. E.; Sharrar, Amber

2010-01-01

A standard topic in an advanced undergraduate classical mechanics course is the determination of the orbits in a gravitational field. In the present paper we report on the calculation of bound orbits in the gravitational field of a spiral galaxy. Calculations such as these could serve to focus attention on an area of cutting edge astrophysics and…

Numerical simulation of damage and progressive failures in composite laminates using the layerwise plate theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Reddy, Y.S.

1992-01-01

The failure behavior of composite laminates is modeled numerically using the Generalized Layerwise Plate Theory (GLPT) of Reddy and a progressive failure algorithm. The Layerwise Theory of Reddy assumes a piecewise continuous displacement field through the thickness of the laminate and therefore has the ability to capture the interlaminar stress fields near the free edges and cut outs more accurately. The progressive failure algorithm is based on the assumption that the material behaves like a stable progressively fracturing solid. A three-dimensional stiffness reduction scheme is developed and implemented to study progressive failures in composite laminates. The effect of various parametersmore » such as out-of-plane material properties, boundary conditions, and stiffness reduction methods on the failure stresses and strains of a quasi-isotropic composite laminate with free edges subjected to tensile loading is studied. The ultimate stresses and strains predicted by the Generalized Layerwise Plate Theory (GLPT) and the more widely used First Order Shear Deformation Theory (FSDT) are compared with experimental results. The predictions of the GLPT are found to be in good agreement with the experimental results both qualitatively and quantitatively, while the predictions of FSDT are found to be different from experimental results both qualitatively and quantitatively. The predictive ability of various phenomenological failure criteria is evaluated with reference to the experimental results available in the literature. The effect of geometry of the test specimen and the displacement boundary conditions at the grips on the ultimate stresses and strains of a composite laminate under compressive loading is studied. The ultimate stresses and strains are found to be quite sensitive to the geometry of the test specimen and the displacement boundary conditions at the grips. The degree of sensitivity is observed to depend strongly on the lamination sequence.« less

Research on sparse feature matching of improved RANSAC algorithm

NASA Astrophysics Data System (ADS)

Kong, Xiangsi; Zhao, Xian

2018-04-01

In this paper, a sparse feature matching method based on modified RANSAC algorithm is proposed to improve the precision and speed. Firstly, the feature points of the images are extracted using the SIFT algorithm. Then, the image pair is matched roughly by generating SIFT feature descriptor. At last, the precision of image matching is optimized by the modified RANSAC algorithm,. The RANSAC algorithm is improved from three aspects: instead of the homography matrix, this paper uses the fundamental matrix generated by the 8 point algorithm as the model; the sample is selected by a random block selecting method, which ensures the uniform distribution and the accuracy; adds sequential probability ratio test(SPRT) on the basis of standard RANSAC, which cut down the overall running time of the algorithm. The experimental results show that this method can not only get higher matching accuracy, but also greatly reduce the computation and improve the matching speed.

Optimization lighting layout based on gene density improved genetic algorithm for indoor visible light communications

NASA Astrophysics Data System (ADS)

Liu, Huanlin; Wang, Xin; Chen, Yong; Kong, Deqian; Xia, Peijie

2017-05-01

For indoor visible light communication system, the layout of LED lamps affects the uniformity of the received power on communication plane. In order to find an optimized lighting layout that meets both the lighting needs and communication needs, a gene density genetic algorithm (GDGA) is proposed. In GDGA, a gene indicates a pair of abscissa and ordinate of a LED, and an individual represents a LED layout in the room. The segmented crossover operation and gene mutation strategy based on gene density are put forward to make the received power on communication plane more uniform and increase the population's diversity. A weighted differences function between individuals is designed as the fitness function of GDGA for reserving the population having the useful LED layout genetic information and ensuring the global convergence of GDGA. Comparing square layout and circular layout, with the optimized layout achieved by the GDGA, the power uniformity increases by 83.3%, 83.1% and 55.4%, respectively. Furthermore, the convergence of GDGA is verified compared with evolutionary algorithm (EA). Experimental results show that GDGA can quickly find an approximation of optimal layout.

Improvement of resolution in full-view linear-array photoacoustic computed tomography using a novel adaptive weighting method

NASA Astrophysics Data System (ADS)

Omidi, Parsa; Diop, Mamadou; Carson, Jeffrey; Nasiriavanaki, Mohammadreza

2017-03-01

Linear-array-based photoacoustic computed tomography is a popular methodology for deep and high resolution imaging. However, issues such as phase aberration, side-lobe effects, and propagation limitations deteriorate the resolution. The effect of phase aberration due to acoustic attenuation and constant assumption of the speed of sound (SoS) can be reduced by applying an adaptive weighting method such as the coherence factor (CF). Utilizing an adaptive beamforming algorithm such as the minimum variance (MV) can improve the resolution at the focal point by eliminating the side-lobes. Moreover, invisibility of directional objects emitting parallel to the detection plane, such as vessels and other absorbing structures stretched in the direction perpendicular to the detection plane can degrade resolution. In this study, we propose a full-view array level weighting algorithm in which different weighs are assigned to different positions of the linear array based on an orientation algorithm which uses the histogram of oriented gradient (HOG). Simulation results obtained from a synthetic phantom show the superior performance of the proposed method over the existing reconstruction methods.

Noise reduction in digital holography based on a filtering algorithm

NASA Astrophysics Data System (ADS)

Zhang, Wenhui; Cao, Liangcai; Zhang, Hua; Jin, Guofan; Brady, David

2018-02-01

Holography is a tool to record the object wavefront by interference. Complex amplitude of the object wave is coded into a two dimensional hologram. Unfortunately, the conjugate wave and background wave would also appear at the object plane during reconstruction, as noise, which blurs the reconstructed object. From the perspective of wave, we propose a filtering algorithm to get a noise-reduced reconstruction. Due to the fact that the hologram is a kind of amplitude grating, three waves would appear when reconstruction, which are object wave, conjugate wave and background wave. The background is easy to eliminate by frequency domain filtering. The object wave and conjugate wave are signals to be dealt with. These two waves, as a whole, propagate in the space. However, when detected at the original object plane, the object wave would diffract into a sparse pattern while the conjugate wave would diffract into a diffused pattern forming the noise. Hence, the noise can be reduced based on these difference with a filtering algorithm. Both amplitude and phase distributions are truthfully retrieved in our simulation and experimental demonstration.

Computer generated hologram from point cloud using graphics processor.

PubMed

Chen, Rick H-Y; Wilkinson, Timothy D

2009-12-20

Computer generated holography is an extremely demanding and complex task when it comes to providing realistic reconstructions with full parallax, occlusion, and shadowing. We present an algorithm designed for data-parallel computing on modern graphics processing units to alleviate the computational burden. We apply Gaussian interpolation to create a continuous surface representation from discrete input object points. The algorithm maintains a potential occluder list for each individual hologram plane sample to keep the number of visibility tests to a minimum. We experimented with two approximations that simplify and accelerate occlusion computation. It is observed that letting several neighboring hologram plane samples share visibility information on object points leads to significantly faster computation without causing noticeable artifacts in the reconstructed images. Computing a reduced sample set via nonuniform sampling is also found to be an effective acceleration technique.

DD3MAT - a code for yield criteria anisotropy parameters identification.

NASA Astrophysics Data System (ADS)

Barros, P. D.; Carvalho, P. D.; Alves, J. L.; Oliveira, M. C.; Menezes, L. F.

2016-08-01

This work presents the main strategies and algorithms adopted in the DD3MAT inhouse code, specifically developed for identifying the anisotropy parameters. The algorithm adopted is based on the minimization of an error function, using a downhill simplex method. The set of experimental values can consider yield stresses and r -values obtained from in-plane tension, for different angles with the rolling direction (RD), yield stress and r -value obtained for biaxial stress state, and yield stresses from shear tests performed also for different angles to RD. All these values can be defined for a specific value of plastic work. Moreover, it can also include the yield stresses obtained from in-plane compression tests. The anisotropy parameters are identified for an AA2090-T3 aluminium alloy, highlighting the importance of the user intervention to improve the numerical fit.

[Alternatives to femtosecond laser technology: subnanosecond UV pulse and ring foci for creation of LASIK flaps].

PubMed

Vogel, A; Freidank, S; Linz, N

2014-06-01

In refractive corneal surgery femtosecond (fs) lasers are used for creating LASIK flaps, dissecting lenticules and for astigmatism correction by limbal incisions. Femtosecond laser systems are complex and expensive and cutting precision is compromised by the large focal length associated with the commonly used infrared (IR) wavelengths. Based on investigations of the cutting dynamics, novel approaches for corneal dissection using ultraviolet A (UVA) picosecond (ps) pulses and ring foci from vortex beams are presented. Laser-induced bubble formation in corneal stroma was investigated by high-speed photography at 1-50 million frames/s. Using Gaussian and vortex beams of UVA pulses with durations between 200 and 850 ps the laser energy needed for easy removal of flaps created in porcine corneas was determined and the quality of the cuts by scanning electron microscopy was documented. Cutting parameters for 850 ps are reported also for rabbit eyes. The UV-induced and mechanical stress were evaluated for Gaussian and vortex beams. The results show that UVA picosecond lasers provide better cutting precision than IR femtosecond lasers, with similar processing times. Cutting energy decreases by >50 % when the laser pulse duration is reduced to 200 ps. Vortex beams produce a short, donut-shaped focus allowing efficient and precise dissection along the corneal lamellae which results in a dramatic reduction of the absorbed energy needed for cutting and of mechanical side effects as well as in less bubble formation in the cutting plane. A combination of novel approaches for corneal dissection provides the option to replace femtosecond lasers by compact UVA microchip laser technology. Ring foci are also of interest for femtosecond laser surgery, especially for improved lenticule excision.

Maxwell Strata and Cut Locus in the Sub-Riemannian Problem on the Engel Group

NASA Astrophysics Data System (ADS)

Ardentov, Andrei A.; Sachkov, Yuri L.

2017-12-01

We consider the nilpotent left-invariant sub-Riemannian structure on the Engel group. This structure gives a fundamental local approximation of a generic rank 2 sub-Riemannian structure on a 4-manifold near a generic point (in particular, of the kinematic models of a car with a trailer). On the other hand, this is the simplest sub-Riemannian structure of step three. We describe the global structure of the cut locus (the set of points where geodesics lose their global optimality), the Maxwell set (the set of points that admit more than one minimizer), and the intersection of the cut locus with the caustic (the set of conjugate points along all geodesics). The group of symmetries of the cut locus is described: it is generated by a one-parameter group of dilations R+ and a discrete group of reflections Z2 × Z2 × Z2. The cut locus admits a stratification with 6 three-dimensional strata, 12 two-dimensional strata, and 2 one-dimensional strata. Three-dimensional strata of the cut locus are Maxwell strata of multiplicity 2 (for each point there are 2 minimizers). Two-dimensional strata of the cut locus consist of conjugate points. Finally, one-dimensional strata are Maxwell strata of infinite multiplicity, they consist of conjugate points as well. Projections of sub-Riemannian geodesics to the 2-dimensional plane of the distribution are Euler elasticae. For each point of the cut locus, we describe the Euler elasticae corresponding to minimizers coming to this point. Finally, we describe the structure of the optimal synthesis, i. e., the set of minimizers for each terminal point in the Engel group.