Fast track pathway for perforated appendicitis.

Science.gov (United States)

Frazee, Richard; Abernathy, Stephen; Davis, Matthew; Isbell, Travis; Regner, Justin; Smith, Randall

2017-04-01

Perforated appendicitis is associated with an increased morbidity and length of stay. "Fast track" protocols have demonstrated success in shortening hospitalization without increasing morbidity for a variety of surgical processes. This study evaluates a fast track pathway for perforated appendicitis. In 2013, a treatment pathway for perforated appendicitis was adopted by the Acute Care Surgery Service for patients having surgical management of perforated appendicitis. Interval appendectomy was excluded. Patients were treated initially with intravenous antibiotics and transitioned to oral antibiotics and dismissed when medically stable and tolerating oral intake. A retrospective review of patients managed on the fast track pathway was undertaken to analyze length of stay, morbidity, and readmissions. Thirty-four males and twenty-one females with an average age of 46.8 years underwent laparoscopic appendectomy for perforated appendicitis between January 2013 and December 2014. Pre-existing comorbidities included hypertension 42%, diabetes mellitus 11%, COPD 5% and heart disease 2%. No patient had conversion to open appendectomy. Average length of stay was 2.67 days and ranged from 1 to 12 days (median 2 days). Postoperative morbidity was 20% and included abscess (6 patients), prolonged ileus (3 patients), pneumonia (1 patient), and congestive heart failure (1 patient). Five patients were readmitted for abscess (3 patients), congestive heart failure (1 patient), and pneumonia (1 patient). A fast track pathway for perforated appendicitis produced shorter length of stay and acceptable postoperative morbidity and readmission. This offers the potential for significant cost savings over current national practice patterns. Copyright © 2016 Elsevier Inc. All rights reserved.

SU-F-T-370: A Fast Monte Carlo Dose Engine for Gamma Knife

Energy Technology Data Exchange (ETDEWEB)

Song, T; Zhou, L [Southern Medical University, Guangzhou, Guangdong (China); Li, Y [Beihang University, Beijing, Beijing (China)

2016-06-15

Purpose: To develop a fast Monte Carlo dose calculation algorithm for Gamma Knife. Methods: To make the simulation more efficient, we implemented the track repeating technique on GPU. We first use EGSnrc to pre-calculate the photon and secondary electron tracks in water from two mono-energy photons of 60Co. The total photon mean free paths for different materials and energies are obtained from NIST. During simulation, each entire photon track was first loaded to shared memory for each block, the incident original photon was then splitted to Nthread sub-photons, each thread transport one sub-photon, the Russian roulette technique was applied for scattered and bremsstrahlung photons. The resultant electrons from photon interactions are simulated by repeating the recorded electron tracks. The electron step length is stretched/shrunk proportionally based on the local density and stopping power ratios of the local material. Energy deposition in a voxel is proportional to the fraction of the equivalent step length in that voxel. To evaluate its accuracy, dose deposition in a 300mm*300mm*300mm water phantom is calculated, and compared to EGSnrc results. Results: Both PDD and OAR showed great agreements (within 0.5%) between our dose engine result and the EGSnrc result. It only takes less than 1 min for every simulation, being reduced up to ∼40 times compared to EGSnrc simulations. Conclusion: We have successfully developed a fast Monte Carlo dose engine for Gamma Knife.

Fast parallel algorithms for the x-ray transform and its adjoint.

Science.gov (United States)

Gao, Hao

2012-11-01

Iterative reconstruction methods often offer better imaging quality and allow for reconstructions with lower imaging dose than classical methods in computed tomography. However, the computational speed is a major concern for these iterative methods, for which the x-ray transform and its adjoint are two most time-consuming components. The speed issue becomes even notable for the 3D imaging such as cone beam scans or helical scans, since the x-ray transform and its adjoint are frequently computed as there is usually not enough computer memory to save the corresponding system matrix. The purpose of this paper is to optimize the algorithm for computing the x-ray transform and its adjoint, and their parallel computation. The fast and highly parallelizable algorithms for the x-ray transform and its adjoint are proposed for the infinitely narrow beam in both 2D and 3D. The extension of these fast algorithms to the finite-size beam is proposed in 2D and discussed in 3D. The CPU and GPU codes are available at https://sites.google.com/site/fastxraytransform. The proposed algorithm is faster than Siddon's algorithm for computing the x-ray transform. In particular, the improvement for the parallel computation can be an order of magnitude. The authors have proposed fast and highly parallelizable algorithms for the x-ray transform and its adjoint, which are extendable for the finite-size beam. The proposed algorithms are suitable for parallel computing in the sense that the computational cost per parallel thread is O(1).

Fast algorithm of track reconstruction for the Delphy TPC

International Nuclear Information System (INIS)

Maillard, J.

1984-01-01

We describe a simple geometrical method (polar inversion) to reconstruct tracks. When the magnetic field is constant in magnitude and direction. This method uses geometrical properties of the trajectories. In the case of the DELPHI apparatus, the track reconstruction is done using TPC informations. After explaining the algorithm, we give results on ''GEANT'' simulated events using the ''Lund'' generator. Today we get a computer time of the order of 1.2 milliseconds on a CDC 7600 and an efficiency of 98% [fr

Fast neural-net based fake track rejection in the LHCb reconstruction

CERN Document Server

De Cian, Michel; Seyfert, Paul; Stahl, Sascha

2017-01-01

A neural-network based algorithm to identify fake tracks in the LHCb pattern recognition is presented. This algorithm, called ghost probability, retains more than 99 % of well reconstructed tracks while reducing the number of fake tracks by 60 %. It is fast enough to fit into the CPU time budget of the software trigger farm and thus reduces the combinatorics of the decay reconstructions, as well as the number of tracks that need to be processed by the particle identification algorithms. As a result, it strongly contributes to the achievement of having the same reconstruction online and offline in the LHCb experiment in Run II of the LHC.

Hard Ware Implementation of Diamond Search Algorithm for Motion Estimation and Object Tracking

International Nuclear Information System (INIS)

Hashimaa, S.M.; Mahmoud, I.I.; Elazm, A.A.

2009-01-01

Object tracking is very important task in computer vision. Fast search algorithms emerged as important search technique to achieve real time tracking results. To enhance the performance of these algorithms, we advocate the hardware implementation of such algorithms. Diamond search block matching motion estimation has been proposed recently to reduce the complexity of motion estimation. In this paper we selected the diamond search algorithm (DS) for implementation using FPGA. This is due to its fundamental role in all fast search patterns. The proposed architecture is simulated and synthesized using Xilinix and modelsim soft wares. The results agree with the algorithm implementation in Matlab environment.

IMPLEMENTATION OF OBJECT TRACKING ALGORITHMS ON THE BASIS OF CUDA TECHNOLOGY

Directory of Open Access Journals (Sweden)

B. A. Zalesky

2014-01-01

Full Text Available A fast version of correlation algorithm to track objects on video-sequences made by a nonstabilized camcorder is presented. The algorithm is based on comparison of local correlations of the object image and regions of video-frames. The algorithm is implemented in programming technology CUDA. Application of CUDA allowed to attain real time execution of the algorithm. To improve its precision and stability, a robust version of the Kalman filter has been incorporated into the flowchart. Tests showed applicability of the algorithm to practical object tracking.

Fast track-hoftealloplastik

DEFF Research Database (Denmark)

Hansen, Torben Bæk; Gromov, Kirill; Kristensen, Billy B

2017-01-01

Fast-track surgery implies a coordinated perioperative approach aimed at reducing surgical stress and facilitating post-operative recovery. The fast-track programme has reduced post-operative length of stay and has led to shorter convalescence with more rapid functional recovery and decreased...... morbidity and mortality in total hip arthroplasty. It should now be a standard total hip arthroplasty patient pathway, but fine tuning of the multiple factors in the fast-track pathway is still needed in patients with special needs or high comorbidity burden....

Electron dose map inversion based on several algorithms

International Nuclear Information System (INIS)

Li Gui; Zheng Huaqing; Wu Yican; Fds Team

2010-01-01

The reconstruction to the electron dose map in radiation therapy was investigated by constructing the inversion model of electron dose map with different algorithms. The inversion model of electron dose map based on nonlinear programming was used, and this model was applied the penetration dose map to invert the total space one. The realization of this inversion model was by several inversion algorithms. The test results with seven samples show that except the NMinimize algorithm, which worked for just one sample, with great error,though,all the inversion algorithms could be realized to our inversion model rapidly and accurately. The Levenberg-Marquardt algorithm, having the greatest accuracy and speed, could be considered as the first choice in electron dose map inversion.Further tests show that more error would be created when the data close to the electron range was used (tail error). The tail error might be caused by the approximation of mean energy spectra, and this should be considered to improve the method. The time-saving and accurate algorithms could be used to achieve real-time dose map inversion. By selecting the best inversion algorithm, the clinical need in real-time dose verification can be satisfied. (authors)

Fast in vivo volume dose reconstruction via reference dose perturbation

International Nuclear Information System (INIS)

Lu, Weiguo; Chen, Mingli; Mo, Xiaohu; Parnell, Donald; Olivera, Gustavo; Galmarini, Daniel

2014-01-01

Purpose: Accurate on-line reconstruction of in-vivo volume dose that accounts for both machine and patient discrepancy is not clinically available. We present a simple reference-dose-perturbation algorithm that reconstructs in-vivo volume dose fast and accurately. Methods: We modelled the volume dose as a function of the fluence map and density image. Machine (output variation, jaw/leaf position errors, etc.) and patient (setup error, weight loss, etc.) discrepancies between the plan and delivery were modelled as perturbation of the fluence map and density image, respectively. Delivered dose is modelled as perturbation of the reference dose due to change of the fluence map and density image. We used both simulated and clinical data to validate the algorithm. The planned dose was used as the reference. The reconstruction was perturbed from the reference and accounted for output-variations and the registered daily image. The reconstruction was compared with the ground truth via isodose lines and the Gamma Index. Results: For various plans and geometries, the volume doses were reconstructed in few seconds. The reconstruction generally matched well with the ground truth. For the 3%/3mm criteria, the Gamma pass rates were 98% for simulations and 95% for clinical data. The differences mainly appeared on the surface of the phantom/patient. Conclusions: A novel reference-dose-perturbation dose reconstruction model is presented. The model accounts for machine and patient discrepancy from planning. The algorithm is simple, fast, yet accurate, which makes online in-vivo 3D dose reconstruction clinically feasible.

Fast regional readout CMOS Image Sensor for dynamic MLC tracking

Science.gov (United States)

Zin, H.; Harris, E.; Osmond, J.; Evans, P.

2014-03-01

Advanced radiotherapy techniques such as volumetric modulated arc therapy (VMAT) require verification of the complex beam delivery including tracking of multileaf collimators (MLC) and monitoring the dose rate. This work explores the feasibility of a prototype Complementary metal-oxide semiconductor Image Sensor (CIS) for tracking these complex treatments by utilising fast, region of interest (ROI) read out functionality. An automatic edge tracking algorithm was used to locate the MLC leaves edges moving at various speeds (from a moving triangle field shape) and imaged with various sensor frame rates. The CIS demonstrates successful edge detection of the dynamic MLC motion within accuracy of 1.0 mm. This demonstrates the feasibility of the sensor to verify treatment delivery involving dynamic MLC up to ~400 frames per second (equivalent to the linac pulse rate), which is superior to any current techniques such as using electronic portal imaging devices (EPID). CIS provides the basis to an essential real-time verification tool, useful in accessing accurate delivery of complex high energy radiation to the tumour and ultimately to achieve better cure rates for cancer patients.

Fast regional readout CMOS image sensor for dynamic MLC tracking

International Nuclear Information System (INIS)

Zin, H; Harris, E; Osmond, J; Evans, P

2014-01-01

Advanced radiotherapy techniques such as volumetric modulated arc therapy (VMAT) require verification of the complex beam delivery including tracking of multileaf collimators (MLC) and monitoring the dose rate. This work explores the feasibility of a prototype Complementary metal-oxide semiconductor Image Sensor (CIS) for tracking these complex treatments by utilising fast, region of interest (ROI) read out functionality. An automatic edge tracking algorithm was used to locate the MLC leaves edges moving at various speeds (from a moving triangle field shape) and imaged with various sensor frame rates. The CIS demonstrates successful edge detection of the dynamic MLC motion within accuracy of 1.0 mm. This demonstrates the feasibility of the sensor to verify treatment delivery involving dynamic MLC up to ∼400 frames per second (equivalent to the linac pulse rate), which is superior to any current techniques such as using electronic portal imaging devices (EPID). CIS provides the basis to an essential real-time verification tool, useful in accessing accurate delivery of complex high energy radiation to the tumour and ultimately to achieve better cure rates for cancer patients.

A maximum power point tracking algorithm for buoy-rope-drum wave energy converters

Science.gov (United States)

Wang, J. Q.; Zhang, X. C.; Zhou, Y.; Cui, Z. C.; Zhu, L. S.

2016-08-01

The maximum power point tracking control is the key link to improve the energy conversion efficiency of wave energy converters (WEC). This paper presents a novel variable step size Perturb and Observe maximum power point tracking algorithm with a power classification standard for control of a buoy-rope-drum WEC. The algorithm and simulation model of the buoy-rope-drum WEC are presented in details, as well as simulation experiment results. The results show that the algorithm tracks the maximum power point of the WEC fast and accurately.

Fast-track totalknæalloplastik

DEFF Research Database (Denmark)

Gromov, Kirill; Kristensen, Billy B; Jørgensen, Christoffer Calov

2017-01-01

patients are eligible for fast-track TKA, and hence the fast-track concept should be standard at all joint replacement facilities. Future challenges of fast-track TKA include safe introduction of outpatient protocols, acute and chronic pain after surgery and optimal utilization of post......Fast-track total knee arthroplasty (TKA) is a well-established concept including optimized logistics and evidence-based treatment, focusing on minimizing surgical stress and improved post-operative recovery, thus leading to lower mortality and morbidity as well as high patient satisfaction. All...

Fast Compressive Tracking.

Science.gov (United States)

Zhang, Kaihua; Zhang, Lei; Yang, Ming-Hsuan

2014-10-01

It is a challenging task to develop effective and efficient appearance models for robust object tracking due to factors such as pose variation, illumination change, occlusion, and motion blur. Existing online tracking algorithms often update models with samples from observations in recent frames. Despite much success has been demonstrated, numerous issues remain to be addressed. First, while these adaptive appearance models are data-dependent, there does not exist sufficient amount of data for online algorithms to learn at the outset. Second, online tracking algorithms often encounter the drift problems. As a result of self-taught learning, misaligned samples are likely to be added and degrade the appearance models. In this paper, we propose a simple yet effective and efficient tracking algorithm with an appearance model based on features extracted from a multiscale image feature space with data-independent basis. The proposed appearance model employs non-adaptive random projections that preserve the structure of the image feature space of objects. A very sparse measurement matrix is constructed to efficiently extract the features for the appearance model. We compress sample images of the foreground target and the background using the same sparse measurement matrix. The tracking task is formulated as a binary classification via a naive Bayes classifier with online update in the compressed domain. A coarse-to-fine search strategy is adopted to further reduce the computational complexity in the detection procedure. The proposed compressive tracking algorithm runs in real-time and performs favorably against state-of-the-art methods on challenging sequences in terms of efficiency, accuracy and robustness.

Second Generation of a Fast-track Liver Resection Programme

DEFF Research Database (Denmark)

Schultz, Nicolai A; Larsen, Peter N; Klarskov, B

2018-01-01

was given to all patients before surgery, catheters and drains were systematically removed early, and patients were mobilized and started eating and drinking from the day of surgery. An opioid-sparing multimodal pain treatment was given for the first week. The discharge criteria were (1) pain sufficiently....... The readmission rate was 6% and the 30-day mortality zero. The LOS decreased compared to our first-generation fast-track programme with LOS 5 days. CONCLUSIONS: Fast-track principles for perioperative care and early discharge are safe even after major liver resection. The introduction of high-dose steroids...

Fast weighted centroid algorithm for single particle localization near the information limit.

Science.gov (United States)

Fish, Jeremie; Scrimgeour, Jan

2015-07-10

A simple weighting scheme that enhances the localization precision of center of mass calculations for radially symmetric intensity distributions is presented. The algorithm effectively removes the biasing that is common in such center of mass calculations. Localization precision compares favorably with other localization algorithms used in super-resolution microscopy and particle tracking, while significantly reducing the processing time and memory usage. We expect that the algorithm presented will be of significant utility when fast computationally lightweight particle localization or tracking is desired.

Maximum power point tracking: a cost saving necessity in solar energy systems

Energy Technology Data Exchange (ETDEWEB)

Enslin, J H.R. [Stellenbosch Univ. (South Africa). Dept. of Electrical and Electronic Engineering

1992-12-01

A well engineered renewable remote energy system, utilizing the principal of Maximum Power Point Tracking (MPPT) can improve cost effectiveness, has a higher reliability and can improve the quality of life in remote areas. A high-efficient power electronic converter, for converting the output voltage of a solar panel, or wind generator, to the required DC battery bus voltage has been realized. The converter is controlled to track the maximum power point of the input source under varying input and output parameters. Maximum power point tracking for relative small systems is achieved by maximization of the output current in a battery charging regulator, using an optimized hill-climbing, inexpensive microprocessor based algorithm. Through practical field measurements it is shown that a minimum input source saving of between 15 and 25% on 3-5 kWh/day systems can easily be achieved. A total cost saving of at least 10-15% on the capital cost of these systems are achievable for relative small rating Remote Area Power Supply (RAPS) systems. The advantages at large temperature variations and high power rated systems are much higher. Other advantages include optimal sizing and system monitor and control. (author).

Surface ablation with iris recognition and dynamic rotational eye tracking-based tissue saving treatment with the Technolas 217z excimer laser.

Science.gov (United States)

Prakash, Gaurav; Agarwal, Amar; Kumar, Dhivya Ashok; Jacob, Soosan; Agarwal, Athiya; Maity, Amrita

2011-03-01

To evaluate the visual and refractive outcomes and expected benefits of Tissue Saving Treatment algorithm-guided surface ablation with iris recognition and dynamic rotational eye tracking. This prospective, interventional case series comprised 122 eyes (70 patients). Pre- and postoperative assessment included uncorrected distance visual acuity (UDVA), corrected distance visual acuity (CDVA), refraction, and higher order aberrations. All patients underwent Tissue Saving Treatment algorithm-guided surface ablation with iris recognition and dynamic rotational eye tracking using the Technolas 217z 100-Hz excimer platform (Technolas Perfect Vision GmbH). Follow-up was performed up to 6 months postoperatively. Theoretical benefit analysis was performed to evaluate the algorithm's outcomes compared to others. Preoperative spherocylindrical power was sphere -3.62 ± 1.60 diopters (D) (range: 0 to -6.75 D), cylinder -1.15 ± 1.00 D (range: 0 to -3.50 D), and spherical equivalent -4.19 ± 1.60 D (range: -7.75 to -2.00 D). At 6 months, 91% (111/122) of eyes were within ± 0.50 D of attempted correction. Postoperative UDVA was comparable to preoperative CDVA at 1 month (P=.47) and progressively improved at 6 months (P=.004). Two eyes lost one line of CDVA at 6 months. Theoretical benefit analysis revealed that of 101 eyes with astigmatism, 29 would have had cyclotorsion-induced astigmatism of ≥ 10% if iris recognition and dynamic rotational eye tracking were not used. Furthermore, the mean percentage decrease in maximum depth of ablation by using the Tissue Saving Treatment was 11.8 ± 2.9% over Aspheric, 17.8 ± 6.2% over Personalized, and 18.2 ± 2.8% over Planoscan algorithms. Tissue saving surface ablation with iris recognition and dynamic rotational eye tracking was safe and effective in this series of eyes. Copyright 2011, SLACK Incorporated.

Fast Neutron Dose Distribution in a Linac Radiotherapy Facility

International Nuclear Information System (INIS)

Al-Othmany, D.Sh.; Abdul-Majid, S.; Kadi, M.W.

2011-01-01

CR-39 plastic detectors were used for fast neutron dose mapping in the radiotherapy facility at King AbdulAziz University Hospital (KAUH). Detectors were calibrated using a 252 Cf neutron source and a neutron dosimeter. After exposure chemical etching was performed using 6N NaOH solution at 70 degree C. Tracks were counted using an optical microscope and the number of tracks/cm 2 was converted to a neutron dose. 15 track detectors were distributed inside and outside the therapy room and were left for 32 days. The average neutron doses were 142.3 mSv on the accelerator head, 28.5 mSv on inside walls, 1.4 mSv beyond the beam shield, and 1 mSv in the control room

Fast neutron dosimetry using CR-39 track detectors with polyethylene as radiator

International Nuclear Information System (INIS)

Castillo, F.; Espinosa, G.; Golzarri, J.I.; Osorio, D.; Rangel, J.; Reyes, P.G.; Herrera, J.J.E.

2013-01-01

The chemical etching parameters (etching time, temperature, normality of etchant, etc.) for the use of CR-39 (allyl diglycol carbonate – Lantrack ® ) as a fast neutron dosimeter have been optimized. The CR-39 chips, placed under a 1.5 mm polyethylene radiator, were exposed for calibration to an 241 Am-Be source at different time intervals for a given neutron fluence. After several chemical etching processes of the detectors with different conditions, the optimum characteristics for the chemical etching were found at 6N KOH solution, 60 ± 1 °C, for 12 h. An accurate relationship between the dose and fluence calculations was obtained as a function of the track density. - Highlights: ► Optimum etching time for fast neutron irradiated CR-39 track detectors is found. ► Relationship between dose and fluence obtained as a function of the track density. ► Results are consistent with those reported elsewhere, and extend the dose range

Percentage of Fast-Track Receipts

Data.gov (United States)

Social Security Administration — The dataset provides the percentage of fast-track receipts by state during the reporting fiscal year. Fast-tracked cases consist of those cases identified as Quick...

Large scale tracking algorithms

Energy Technology Data Exchange (ETDEWEB)

Hansen, Ross L. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Love, Joshua Alan [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Melgaard, David Kennett [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Karelitz, David B. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Pitts, Todd Alan [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Zollweg, Joshua David [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Anderson, Dylan Z. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Nandy, Prabal [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Whitlow, Gary L. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Bender, Daniel A. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Byrne, Raymond Harry [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2015-01-01

Low signal-to-noise data processing algorithms for improved detection, tracking, discrimination and situational threat assessment are a key research challenge. As sensor technologies progress, the number of pixels will increase signi cantly. This will result in increased resolution, which could improve object discrimination, but unfortunately, will also result in a significant increase in the number of potential targets to track. Many tracking techniques, like multi-hypothesis trackers, suffer from a combinatorial explosion as the number of potential targets increase. As the resolution increases, the phenomenology applied towards detection algorithms also changes. For low resolution sensors, "blob" tracking is the norm. For higher resolution data, additional information may be employed in the detection and classfication steps. The most challenging scenarios are those where the targets cannot be fully resolved, yet must be tracked and distinguished for neighboring closely spaced objects. Tracking vehicles in an urban environment is an example of such a challenging scenario. This report evaluates several potential tracking algorithms for large-scale tracking in an urban environment.

A fast fiducial marker tracking model for fully automatic alignment in electron tomography

KAUST Repository

Han, Renmin; Zhang, Fa; Gao, Xin

2017-01-01

Automatic alignment, especially fiducial marker-based alignment, has become increasingly important due to the high demand of subtomogram averaging and the rapid development of large-field electron microscopy. Among the alignment steps, fiducial marker tracking is a crucial one that determines the quality of the final alignment. Yet, it is still a challenging problem to track the fiducial markers accurately and effectively in a fully automatic manner.In this paper, we propose a robust and efficient scheme for fiducial marker tracking. Firstly, we theoretically prove the upper bound of the transformation deviation of aligning the positions of fiducial markers on two micrographs by affine transformation. Secondly, we design an automatic algorithm based on the Gaussian mixture model to accelerate the procedure of fiducial marker tracking. Thirdly, we propose a divide-and-conquer strategy against lens distortions to ensure the reliability of our scheme. To our knowledge, this is the first attempt that theoretically relates the projection model with the tracking model. The real-world experimental results further support our theoretical bound and demonstrate the effectiveness of our algorithm. This work facilitates the fully automatic tracking for datasets with a massive number of fiducial markers.The C/C ++ source code that implements the fast fiducial marker tracking is available at https://github.com/icthrm/gmm-marker-tracking. Markerauto 1.6 version or later (also integrated in the AuTom platform at http://ear.ict.ac.cn/) offers a complete implementation for fast alignment, in which fast fiducial marker tracking is available by the

A fast fiducial marker tracking model for fully automatic alignment in electron tomography

KAUST Repository

Han, Renmin

2017-10-20

Automatic alignment, especially fiducial marker-based alignment, has become increasingly important due to the high demand of subtomogram averaging and the rapid development of large-field electron microscopy. Among the alignment steps, fiducial marker tracking is a crucial one that determines the quality of the final alignment. Yet, it is still a challenging problem to track the fiducial markers accurately and effectively in a fully automatic manner.In this paper, we propose a robust and efficient scheme for fiducial marker tracking. Firstly, we theoretically prove the upper bound of the transformation deviation of aligning the positions of fiducial markers on two micrographs by affine transformation. Secondly, we design an automatic algorithm based on the Gaussian mixture model to accelerate the procedure of fiducial marker tracking. Thirdly, we propose a divide-and-conquer strategy against lens distortions to ensure the reliability of our scheme. To our knowledge, this is the first attempt that theoretically relates the projection model with the tracking model. The real-world experimental results further support our theoretical bound and demonstrate the effectiveness of our algorithm. This work facilitates the fully automatic tracking for datasets with a massive number of fiducial markers.The C/C ++ source code that implements the fast fiducial marker tracking is available at https://github.com/icthrm/gmm-marker-tracking. Markerauto 1.6 version or later (also integrated in the AuTom platform at http://ear.ict.ac.cn/) offers a complete implementation for fast alignment, in which fast fiducial marker tracking is available by the

A numerically stable, finite memory, fast array recursive least squares algorithm for broadband active noise control

NARCIS (Netherlands)

van Ophem, S.; Berkhoff, Arthur P.

2016-01-01

For broadband active noise control applications with a rapidly changing primary path, it is desirable to find algorithms with a rapid convergence, a fast tracking performance, and a low computational cost. Recently, a promising algorithm has been presented, called the fast-array Kalman filter, which

Fast track segment finding in the Monitored Drift Tubes of the ATLAS Muon Spectrometer using a Legendre transform algorithm

CERN Document Server

Ntekas, Konstantinos; The ATLAS collaboration

2018-01-01

The upgrade of the ATLAS first-level muon trigger for High- Luminosity LHC foresees incorporating the precise tracking of the Monitored Drift Tubes in the current system based on Resistive Plate Chambers and Thin Gap Chambers to improve the accuracy in the transverse momentum measurement and control the single muon trigger rate by suppressing low quality fake triggers. The core of the MDT trigger algorithm is the segment identification and reconstruction which is performed per MDT chamber. The reconstructed segment positions and directions are then combined to extract the muon candidate’s transverse momentum. A fast pattern recognition segment finding algorithm, called the Legendre transform, is proposed to be used for the MDT trigger, implemented in a FPGA housed on a ATCA blade.

Fast-track hip and knee arthroplasty

DEFF Research Database (Denmark)

Husted, Henrik

2012-01-01

Fast-track hip and knee arthroplasty aims at giving the patients the best available treatment at all times, being a dynamic entity. Fast-track combines evidence-based, clinical features with organizational optimization including a revision of traditions resulting in a streamlined pathway from...... on clinical and organizational aspects of fast-track hip and knee arthroplasty (I–IX). A detailed description of the fast-track set-up and its components is provided. Major results include identification of patient characteristics to predict length of stay and satisfaction with different aspects...... of the hospital stay (I); how to optimize analgesia by using a compression bandage in total knee arthroplasty (II); the clinical and organizational set-up facilitating or acting as barriers for early discharge (III); safety aspects following fast-track in the form of few readmissions in general (IV) and few...

Fast-track revision knee arthroplasty

DEFF Research Database (Denmark)

Husted, Henrik; Otte, Niels Kristian Stahl; Kristensen, Billy B

2011-01-01

Abstract Background and purpose Fast-track surgery has reduced the length of hospital stay (LOS), morbidity, and convalescence in primary hip and knee arthroplasty (TKA). We assessed whether patients undergoing revision TKA for non-septic indications might also benefit from fast-track surgery....... Methods 29 patients were operated with 30 revision arthroplasties. Median age was 67 (34-84) years. All patients followed a standardized fast-track set-up designed for primary TKA. We determined the outcome regarding LOS, morbidity, mortality, and satisfaction. Results Median LOS was 2 (1-4) days...

A fast method to emulate an iterative POCS image reconstruction algorithm.

Science.gov (United States)

Zeng, Gengsheng L

2017-10-01

Iterative image reconstruction algorithms are commonly used to optimize an objective function, especially when the objective function is nonquadratic. Generally speaking, the iterative algorithms are computationally inefficient. This paper presents a fast algorithm that has one backprojection and no forward projection. This paper derives a new method to solve an optimization problem. The nonquadratic constraint, for example, an edge-preserving denoising constraint is implemented as a nonlinear filter. The algorithm is derived based on the POCS (projections onto projections onto convex sets) approach. A windowed FBP (filtered backprojection) algorithm enforces the data fidelity. An iterative procedure, divided into segments, enforces edge-enhancement denoising. Each segment performs nonlinear filtering. The derived iterative algorithm is computationally efficient. It contains only one backprojection and no forward projection. Low-dose CT data are used for algorithm feasibility studies. The nonlinearity is implemented as an edge-enhancing noise-smoothing filter. The patient studies results demonstrate its effectiveness in processing low-dose x ray CT data. This fast algorithm can be used to replace many iterative algorithms. © 2017 American Association of Physicists in Medicine.

Fast-track revision knee arthroplasty

DEFF Research Database (Denmark)

Husted, Henrik; Otte, Niels Kristian Stahl; Kristensen, Billy B

2011-01-01

Abstract Background and purpose Fast-track surgery has reduced the length of hospital stay (LOS), morbidity, and convalescence in primary hip and knee arthroplasty (TKA). We assessed whether patients undergoing revision TKA for non-septic indications might also benefit from fast-track surgery...

An efficient central DOA tracking algorithm for multiple incoherently distributed sources

Science.gov (United States)

Hassen, Sonia Ben; Samet, Abdelaziz

2015-12-01

In this paper, we develop a new tracking method for the direction of arrival (DOA) parameters assuming multiple incoherently distributed (ID) sources. The new approach is based on a simple covariance fitting optimization technique exploiting the central and noncentral moments of the source angular power densities to estimate the central DOAs. The current estimates are treated as measurements provided to the Kalman filter that model the dynamic property of directional changes for the moving sources. Then, the covariance-fitting-based algorithm and the Kalman filtering theory are combined to formulate an adaptive tracking algorithm. Our algorithm is compared to the fast approximated power iteration-total least square-estimation of signal parameters via rotational invariance technique (FAPI-TLS-ESPRIT) algorithm using the TLS-ESPRIT method and the subspace updating via FAPI-algorithm. It will be shown that the proposed algorithm offers an excellent DOA tracking performance and outperforms the FAPI-TLS-ESPRIT method especially at low signal-to-noise ratio (SNR) values. Moreover, the performances of the two methods increase as the SNR values increase. This increase is more prominent with the FAPI-TLS-ESPRIT method. However, their performances degrade when the number of sources increases. It will be also proved that our method depends on the form of the angular distribution function when tracking the central DOAs. Finally, it will be shown that the more the sources are spaced, the more the proposed method can exactly track the DOAs.

Saving doses by outage planning strategy and architectural arrangements

International Nuclear Information System (INIS)

Wahlstroem, B.

1993-01-01

All radiation doses come out as a result of dose rate and exposure time, and the main part of the occupational exposure is caused during outages. While every reasonable attempt should be made to lower the dose rates, the other factor, the exposure time, may not be forgotten. The paper presents possible ways of saving man-hours in the controlled zone by outage planning strategy. And every saved man-hour means a saved radiation dose. At Loviisa NPS also some special architectural arrangements contribute to shortening the outage time, thus saving doses

Two-dimensional Fast ESPRIT Algorithm for Linear Array SAR Imaging

Directory of Open Access Journals (Sweden)

Zhao Yi-chao

2015-10-01

Full Text Available The linear array Synthetic Aperture Radar (SAR system is a popular research tool, because it can realize three-dimensional imaging. However, owning to limitations of the aircraft platform and actual conditions, resolution improvement is difficult in cross-track and along-track directions. In this study, a twodimensional fast Estimation of Signal Parameters by Rotational Invariance Technique (ESPRIT algorithm for linear array SAR imaging is proposed to overcome these limitations. This approach combines the Gerschgorin disks method and the ESPRIT algorithm to estimate the positions of scatterers in cross and along-rack directions. Moreover, the reflectivity of scatterers is obtained by a modified pairing method based on “region growing”, replacing the least-squares method. The simulation results demonstrate the applicability of the algorithm with high resolution, quick calculation, and good real-time response.

Overview of fast algorithm in 3D dynamic holographic display

Science.gov (United States)

Liu, Juan; Jia, Jia; Pan, Yijie; Wang, Yongtian

2013-08-01

3D dynamic holographic display is one of the most attractive techniques for achieving real 3D vision with full depth cue without any extra devices. However, huge 3D information and data should be preceded and be computed in real time for generating the hologram in 3D dynamic holographic display, and it is a challenge even for the most advanced computer. Many fast algorithms are proposed for speeding the calculation and reducing the memory usage, such as:look-up table (LUT), compressed look-up table (C-LUT), split look-up table (S-LUT), and novel look-up table (N-LUT) based on the point-based method, and full analytical polygon-based methods, one-step polygon-based method based on the polygon-based method. In this presentation, we overview various fast algorithms based on the point-based method and the polygon-based method, and focus on the fast algorithm with low memory usage, the C-LUT, and one-step polygon-based method by the 2D Fourier analysis of the 3D affine transformation. The numerical simulations and the optical experiments are presented, and several other algorithms are compared. The results show that the C-LUT algorithm and the one-step polygon-based method are efficient methods for saving calculation time. It is believed that those methods could be used in the real-time 3D holographic display in future.

Enhanced object-based tracking algorithm for convective rain storms and cells

Science.gov (United States)

Muñoz, Carlos; Wang, Li-Pen; Willems, Patrick

2018-03-01

This paper proposes a new object-based storm tracking algorithm, based upon TITAN (Thunderstorm Identification, Tracking, Analysis and Nowcasting). TITAN is a widely-used convective storm tracking algorithm but has limitations in handling small-scale yet high-intensity storm entities due to its single-threshold identification approach. It also has difficulties to effectively track fast-moving storms because of the employed matching approach that largely relies on the overlapping areas between successive storm entities. To address these deficiencies, a number of modifications are proposed and tested in this paper. These include a two-stage multi-threshold storm identification, a new formulation for characterizing storm's physical features, and an enhanced matching technique in synergy with an optical-flow storm field tracker, as well as, according to these modifications, a more complex merging and splitting scheme. High-resolution (5-min and 529-m) radar reflectivity data for 18 storm events over Belgium are used to calibrate and evaluate the algorithm. The performance of the proposed algorithm is compared with that of the original TITAN. The results suggest that the proposed algorithm can better isolate and match convective rainfall entities, as well as to provide more reliable and detailed motion estimates. Furthermore, the improvement is found to be more significant for higher rainfall intensities. The new algorithm has the potential to serve as a basis for further applications, such as storm nowcasting and long-term stochastic spatial and temporal rainfall generation.

Inverse planning anatomy-based dose optimization for HDR-brachytherapy of the prostate using fast simulated annealing algorithm and dedicated objective function

International Nuclear Information System (INIS)

Lessard, Etienne; Pouliot, Jean

2001-01-01

An anatomy-based dose optimization algorithm is developed to automatically and rapidly produce a highly conformal dose coverage of the target volume while minimizing urethra, bladder, and rectal doses in the delivery of an high dose-rate (HDR) brachytherapy boost for the treatment of prostate cancer. The dwell times are optimized using an inverse planning simulated annealing algorithm (IPSA) governed entirely from the anatomy extracted from a CT and by a dedicated objective function (cost function) reflecting clinical prescription and constraints. With this inverse planning approach, the focus is on the physician's prescription and constraint instead of on the technical limitations. Consequently, the physician's control on the treatment is improved. The capacity of this algorithm to represent the physician's prescription is presented for a clinical prostate case. The computation time (CPU) for IPSA optimization is less than 1 min (41 s for 142 915 iterations) for a typical clinical case, allowing fast and practical dose optimization. The achievement of highly conformal dose coverage to the target volume opens the possibility to deliver a higher dose to the prostate without inducing overdosage of urethra and normal tissues surrounding the prostate. Moreover, using the same concept, it will be possible to deliver a boost dose to a delimited tumor volume within the prostate. Finally, this method can be easily extended to other anatomical sites

SU-E-T-91: Accuracy of Dose Calculation Algorithms for Patients Undergoing Stereotactic Ablative Radiotherapy

Energy Technology Data Exchange (ETDEWEB)

Tajaldeen, A [RMIT university, Docklands, Vic (Australia); Ramachandran, P [Peter MacCallum Cancer Centre, Bendigo (Australia); Geso, M [RMIT University, Bundoora, Melbourne (Australia)

2015-06-15

Purpose: The purpose of this study was to investigate and quantify the variation in dose distributions in small field lung cancer radiotherapy using seven different dose calculation algorithms. Methods: The study was performed in 21 lung cancer patients who underwent Stereotactic Ablative Body Radiotherapy (SABR). Two different methods (i) Same dose coverage to the target volume (named as same dose method) (ii) Same monitor units in all algorithms (named as same monitor units) were used for studying the performance of seven different dose calculation algorithms in XiO and Eclipse treatment planning systems. The seven dose calculation algorithms include Superposition, Fast superposition, Fast Fourier Transform ( FFT) Convolution, Clarkson, Anisotropic Analytic Algorithm (AAA), Acurous XB and pencil beam (PB) algorithms. Prior to this, a phantom study was performed to assess the accuracy of these algorithms. Superposition algorithm was used as a reference algorithm in this study. The treatment plans were compared using different dosimetric parameters including conformity, heterogeneity and dose fall off index. In addition to this, the dose to critical structures like lungs, heart, oesophagus and spinal cord were also studied. Statistical analysis was performed using Prism software. Results: The mean±stdev with conformity index for Superposition, Fast superposition, Clarkson and FFT convolution algorithms were 1.29±0.13, 1.31±0.16, 2.2±0.7 and 2.17±0.59 respectively whereas for AAA, pencil beam and Acurous XB were 1.4±0.27, 1.66±0.27 and 1.35±0.24 respectively. Conclusion: Our study showed significant variations among the seven different algorithms. Superposition and AcurosXB algorithms showed similar values for most of the dosimetric parameters. Clarkson, FFT convolution and pencil beam algorithms showed large differences as compared to superposition algorithms. Based on our study, we recommend Superposition and AcurosXB algorithms as the first choice of

SU-E-T-91: Accuracy of Dose Calculation Algorithms for Patients Undergoing Stereotactic Ablative Radiotherapy

International Nuclear Information System (INIS)

Tajaldeen, A; Ramachandran, P; Geso, M

2015-01-01

Purpose: The purpose of this study was to investigate and quantify the variation in dose distributions in small field lung cancer radiotherapy using seven different dose calculation algorithms. Methods: The study was performed in 21 lung cancer patients who underwent Stereotactic Ablative Body Radiotherapy (SABR). Two different methods (i) Same dose coverage to the target volume (named as same dose method) (ii) Same monitor units in all algorithms (named as same monitor units) were used for studying the performance of seven different dose calculation algorithms in XiO and Eclipse treatment planning systems. The seven dose calculation algorithms include Superposition, Fast superposition, Fast Fourier Transform ( FFT) Convolution, Clarkson, Anisotropic Analytic Algorithm (AAA), Acurous XB and pencil beam (PB) algorithms. Prior to this, a phantom study was performed to assess the accuracy of these algorithms. Superposition algorithm was used as a reference algorithm in this study. The treatment plans were compared using different dosimetric parameters including conformity, heterogeneity and dose fall off index. In addition to this, the dose to critical structures like lungs, heart, oesophagus and spinal cord were also studied. Statistical analysis was performed using Prism software. Results: The mean±stdev with conformity index for Superposition, Fast superposition, Clarkson and FFT convolution algorithms were 1.29±0.13, 1.31±0.16, 2.2±0.7 and 2.17±0.59 respectively whereas for AAA, pencil beam and Acurous XB were 1.4±0.27, 1.66±0.27 and 1.35±0.24 respectively. Conclusion: Our study showed significant variations among the seven different algorithms. Superposition and AcurosXB algorithms showed similar values for most of the dosimetric parameters. Clarkson, FFT convolution and pencil beam algorithms showed large differences as compared to superposition algorithms. Based on our study, we recommend Superposition and AcurosXB algorithms as the first choice of

Fuzzy Tracking and Control Algorithm for an SSVEP-Based BCI System

Directory of Open Access Journals (Sweden)

Yeou-Jiunn Chen

2016-09-01

Full Text Available Subjects with amyotrophic lateral sclerosis (ALS consistently experience decreasing quality of life because of this distinctive disease. Thus, a practical brain-computer interface (BCI application can effectively help subjects with ALS to participate in communication or entertainment. In this study, a fuzzy tracking and control algorithm is proposed for developing a BCI remote control system. To represent the characteristics of the measured electroencephalography (EEG signals after visual stimulation, a fast Fourier transform is applied to extract the EEG features. A self-developed fuzzy tracking algorithm quickly traces the changes of EEG signals. The accuracy and stability of a BCI system can be greatly improved by using a fuzzy control algorithm. Fifteen subjects were asked to attend a performance test of this BCI system. The canonical correlation analysis (CCA was adopted to compare the proposed approach, and the average recognition rates are 96.97% and 94.49% for proposed approach and CCA, respectively. The experimental results showed that the proposed approach is preferable to CCA. Overall, the proposed fuzzy tracking and control algorithm applied in the BCI system can profoundly help subjects with ALS to control air swimmer drone vehicles for entertainment purposes.

Multiple feature fusion via covariance matrix for visual tracking

Science.gov (United States)

Jin, Zefenfen; Hou, Zhiqiang; Yu, Wangsheng; Wang, Xin; Sun, Hui

2018-04-01

Aiming at the problem of complicated dynamic scenes in visual target tracking, a multi-feature fusion tracking algorithm based on covariance matrix is proposed to improve the robustness of the tracking algorithm. In the frame-work of quantum genetic algorithm, this paper uses the region covariance descriptor to fuse the color, edge and texture features. It also uses a fast covariance intersection algorithm to update the model. The low dimension of region covariance descriptor, the fast convergence speed and strong global optimization ability of quantum genetic algorithm, and the fast computation of fast covariance intersection algorithm are used to improve the computational efficiency of fusion, matching, and updating process, so that the algorithm achieves a fast and effective multi-feature fusion tracking. The experiments prove that the proposed algorithm can not only achieve fast and robust tracking but also effectively handle interference of occlusion, rotation, deformation, motion blur and so on.

Neural network fusion capabilities for efficient implementation of tracking algorithms

Science.gov (United States)

Sundareshan, Malur K.; Amoozegar, Farid

1997-03-01

The ability to efficiently fuse information of different forms to facilitate intelligent decision making is one of the major capabilities of trained multilayer neural networks that is now being recognized. While development of innovative adaptive control algorithms for nonlinear dynamical plants that attempt to exploit these capabilities seems to be more popular, a corresponding development of nonlinear estimation algorithms using these approaches, particularly for application in target surveillance and guidance operations, has not received similar attention. We describe the capabilities and functionality of neural network algorithms for data fusion and implementation of tracking filters. To discuss details and to serve as a vehicle for quantitative performance evaluations, the illustrative case of estimating the position and velocity of surveillance targets is considered. Efficient target- tracking algorithms that can utilize data from a host of sensing modalities and are capable of reliably tracking even uncooperative targets executing fast and complex maneuvers are of interest in a number of applications. The primary motivation for employing neural networks in these applications comes from the efficiency with which more features extracted from different sensor measurements can be utilized as inputs for estimating target maneuvers. A system architecture that efficiently integrates the fusion capabilities of a trained multilayer neural net with the tracking performance of a Kalman filter is described. The innovation lies in the way the fusion of multisensor data is accomplished to facilitate improved estimation without increasing the computational complexity of the dynamical state estimator itself.

IMPLEMENTATION OF IMAGE PROCESSING ALGORITHMS AND GLVQ TO TRACK AN OBJECT USING AR.DRONE CAMERA

Directory of Open Access Journals (Sweden)

Muhammad Nanda Kurniawan

2014-08-01

Full Text Available Abstract In this research, Parrot AR.Drone as an Unmanned Aerial Vehicle (UAV was used to track an object from above. Development of this system utilized some functions from OpenCV library and Robot Operating System (ROS. Techniques that were implemented in the system are image processing al-gorithm (Centroid-Contour Distance (CCD, feature extraction algorithm (Principal Component Analysis (PCA and an artificial neural network algorithm (Generalized Learning Vector Quantization (GLVQ. The final result of this research is a program for AR.Drone to track a moving object on the floor in fast response time that is under 1 second.

Cardiac surgery fast-track treatment in a postanesthetic care unit: six-month results of the Leipzig fast-track concept.

Science.gov (United States)

Ender, Joerg; Borger, Michael Andrew; Scholz, Markus; Funkat, Anne-Kathrin; Anwar, Nadeem; Sommer, Marcus; Mohr, Friedrich Wilhelm; Fassl, Jens

2008-07-01

The authors compared the safety and efficacy of a newly developed fast-track concept at their center, including implementation of a direct admission postanesthetic care unit, to standard perioperative management. All fast-track patients treated within the first 6 months of implementation of our direct admission postanesthetic care unit were matched via propensity scores and compared with a historical control group of patients who underwent cardiac surgery prior to fast-track implementation. A total of 421 fast-track patients were matched successfully to 421 control patients. The two groups of patients had a similar age (64 +/- 13 vs. 64 +/- 12 yr for fast-track vs. control, P = 0.45) and European System for Cardiac Operative Risk Evaluation-predicted risk of mortality (4.8 +/- 6.1% vs. 4.6 +/- 5.1%, P = 0.97). Fast-track patients had significantly shorter times to extubation (75 min [45-110] vs. 900 min [600-1140]), as well as shorter lengths of stay in the postanesthetic or intensive care unit (4 h [3.0-5] vs. 20 h [16-25]), intermediate care unit (21 h [17-39] vs. 26 h [19-49]), and hospital (10 days [8-12] vs. 11 days [9-14]) (expressed as median and interquartile range, all P operations.

FPGA helix tracking algorithm for PANDA

Energy Technology Data Exchange (ETDEWEB)

Liang, Yutie; Galuska, Martin; Gessler, Thomas; Kuehn, Wolfgang; Lange, Jens Soeren; Muenchow, David [II. Physikalisches Institut, University of Giessen (Germany); Ye, Hua [Institute of High Energy Physics, CAS (China); Collaboration: PANDA-Collaboration

2016-07-01

The PANDA detector is a general-purpose detector for physics with high luminosity cooled antiproton beams, planed to operate at the FAIR facility in Darmstadt, Germany. The central detector includes a silicon Micro Vertex Detector (MVD) and a Straw Tube Tracker (STT). Without any hardware trigger, large amounts of raw data are streaming into the data acquisition system. The data reduction task is performed in the online system by reconstruction algorithms programmed on FPGAs (Field Programmable Gate Arrays) as first level and on a farm of GPUs or PCs as a second level. One important part in the system is the online track reconstruction. In this presentation, an online tracking algorithm for helix tracking reconstruction in the solenoidal field is shown. The VHDL-based algorithm is tested with different types of events, at different event rate. Furthermore, a study of T0 extraction from the tracking algorithm is performed. A concept of simultaneous tracking and T0 determination is presented.

SIFT based algorithm for point feature tracking

Directory of Open Access Journals (Sweden)

Adrian BURLACU

2007-12-01

Full Text Available In this paper a tracking algorithm for SIFT features in image sequences is developed. For each point feature extracted using SIFT algorithm a descriptor is computed using information from its neighborhood. Using an algorithm based on minimizing the distance between two descriptors tracking point features throughout image sequences is engaged. Experimental results, obtained from image sequences that capture scaling of different geometrical type object, reveal the performances of the tracking algorithm.

A difference tracking algorithm based on discrete sine transform

Science.gov (United States)

Liu, HaoPeng; Yao, Yong; Lei, HeBing; Wu, HaoKun

2018-04-01

Target tracking is an important field of computer vision. The template matching tracking algorithm based on squared difference matching (SSD) and standard correlation coefficient (NCC) matching is very sensitive to the gray change of image. When the brightness or gray change, the tracking algorithm will be affected by high-frequency information. Tracking accuracy is reduced, resulting in loss of tracking target. In this paper, a differential tracking algorithm based on discrete sine transform is proposed to reduce the influence of image gray or brightness change. The algorithm that combines the discrete sine transform and the difference algorithm maps the target image into a image digital sequence. The Kalman filter predicts the target position. Using the Hamming distance determines the degree of similarity between the target and the template. The window closest to the template is determined the target to be tracked. The target to be tracked updates the template. Based on the above achieve target tracking. The algorithm is tested in this paper. Compared with SSD and NCC template matching algorithms, the algorithm tracks target stably when image gray or brightness change. And the tracking speed can meet the read-time requirement.

Fast geometric algorithms

International Nuclear Information System (INIS)

Noga, M.T.

1984-01-01

This thesis addresses a number of important problems that fall within the framework of the new discipline of Computational Geometry. The list of topics covered includes sorting and selection, convex hull algorithms, the L 1 hull, determination of the minimum encasing rectangle of a set of points, the Euclidean and L 1 diameter of a set of points, the metric traveling salesman problem, and finding the superrange of star-shaped and monotype polygons. The main theme of all the work was to develop a set of very fast state-of-the-art algorithms that supersede any rivals in terms of speed and ease of implementation. In some cases existing algorithms were refined; for others new techniques were developed that add to the present database of fast adaptive geometric algorithms. What emerges is a collection of techniques that is successful at merging modern tools developed in analysis of algorithms with those of classical geometry

An enhanced block matching algorithm for fast elastic registration in adaptive radiotherapy

International Nuclear Information System (INIS)

Malsch, U; Thieke, C; Huber, P E; Bendl, R

2006-01-01

Image registration has many medical applications in diagnosis, therapy planning and therapy. Especially for time-adaptive radiotherapy, an efficient and accurate elastic registration of images acquired for treatment planning, and at the time of the actual treatment, is highly desirable. Therefore, we developed a fully automatic and fast block matching algorithm which identifies a set of anatomical landmarks in a 3D CT dataset and relocates them in another CT dataset by maximization of local correlation coefficients in the frequency domain. To transform the complete dataset, a smooth interpolation between the landmarks is calculated by modified thin-plate splines with local impact. The concept of the algorithm allows separate processing of image discontinuities like temporally changing air cavities in the intestinal track or rectum. The result is a fully transformed 3D planning dataset (planning CT as well as delineations of tumour and organs at risk) to a verification CT, allowing evaluation and, if necessary, changes of the treatment plan based on the current patient anatomy without time-consuming manual re-contouring. Typically the total calculation time is less than 5 min, which allows the use of the registration tool between acquiring the verification images and delivering the dose fraction for online corrections. We present verifications of the algorithm for five different patient datasets with different tumour locations (prostate, paraspinal and head-and-neck) by comparing the results with manually selected landmarks, visual assessment and consistency testing. It turns out that the mean error of the registration is better than the voxel resolution (2 x 2 x 3 mm 3 ). In conclusion, we present an algorithm for fully automatic elastic image registration that is precise and fast enough for online corrections in an adaptive fractionated radiation treatment course

Multisensor Distributed Track Fusion AlgorithmBased on Strong Tracking Filter and Feedback Integration1）

Institute of Scientific and Technical Information of China (English)

YANGGuo-Sheng; WENCheng-Lin; TANMin

2004-01-01

A new multisensor distributed track fusion algorithm is put forward based on combiningthe feedback integration with the strong tracking Kalman filter. Firstly, an effective tracking gateis constructed by taking the intersection of the tracking gates formed before and after feedback.Secondly, on the basis of the constructed effective tracking gate, probabilistic data association andstrong tracking Kalman filter are combined to form the new multisensor distributed track fusionalgorithm. At last, simulation is performed on the original algorithm and the algorithm presented.

Algorithms for the optimization of RBE-weighted dose in particle therapy.

Science.gov (United States)

Horcicka, M; Meyer, C; Buschbacher, A; Durante, M; Krämer, M

2013-01-21

We report on various algorithms used for the nonlinear optimization of RBE-weighted dose in particle therapy. Concerning the dose calculation carbon ions are considered and biological effects are calculated by the Local Effect Model. Taking biological effects fully into account requires iterative methods to solve the optimization problem. We implemented several additional algorithms into GSI's treatment planning system TRiP98, like the BFGS-algorithm and the method of conjugated gradients, in order to investigate their computational performance. We modified textbook iteration procedures to improve the convergence speed. The performance of the algorithms is presented by convergence in terms of iterations and computation time. We found that the Fletcher-Reeves variant of the method of conjugated gradients is the algorithm with the best computational performance. With this algorithm we could speed up computation times by a factor of 4 compared to the method of steepest descent, which was used before. With our new methods it is possible to optimize complex treatment plans in a few minutes leading to good dose distributions. At the end we discuss future goals concerning dose optimization issues in particle therapy which might benefit from fast optimization solvers.

Common barrel and forward CA tracking algorithm

Energy Technology Data Exchange (ETDEWEB)

Mykhailo, Pugach [Goethe-Universitaet, Frankfurt (Germany); Frankfurt Institute for Advanced Studies, Frankfurt (Germany); KINR, Kyiv (Ukraine); Gorbunov, Sergey; Kisel, Ivan [Goethe-Universitaet, Frankfurt (Germany); Frankfurt Institute for Advanced Studies, Frankfurt (Germany); Collaboration: PANDA-Collaboration

2016-07-01

There are complex detector setups which consist of barrel (cylindrical) and forward parts, and such systems require a special approach in the registered charged particles track finding procedure. Currently the tracking procedure might be performed in both parts of such detector independently from each other, but the final goal on this direction is a creation of a combined tracking, which will work in both parts of the detector simultaneously. The basic algorithm is based on Kalman Filter (KF) and Cellular Automata (CA). And the tracking procedure in such a complex system is rather extraordinary as far as it requires 2 different models to describe the state vector of segments of the reconstructed track in the mathematical apparatus of the KF-algorithm. To overcome this specifics a mathematical apparatus of transition matrices must be developed and implemented, so that one can transfer from one track model to another. Afterwards the work of the CA is performed, which reduces to segments sorting, their union into track-candidates and selection of the best candidates by the chi-square criteria after fitting of the track-candidate by the KF. In this report the algorithm, status and perspectives of such combined tracking are described.

Fast-track video-assisted thoracoscopic surgery

DEFF Research Database (Denmark)

Holbek, Bo Laksafoss; Petersen, René Horsleben; Kehlet, Henrik

2016-01-01

Objectives To provide a short overview of fast-track video-assisted thoracoscopic surgery (VATS) and to identify areas requiring further research. Design A literature search was made using key words including: fast-track, enhanced recovery, video-assisted thoracoscopic surgery, robot......-assisted thoracoscopic surgery (RATS), robotic, thoracotomy, single-incision, uniportal, natural orifice transluminal endoscopic surgery (NOTES), chest tube, air-leak, digital drainage, pain management, analgesia, perioperative management, anaesthesia and non-intubated. References from articles were screened for further...

Environmental Impact Assessment of Kathmandu Terai Fast-Track

Directory of Open Access Journals (Sweden)

Padam Kanta Dahal

2014-12-01

whole. It is estimated that NRs 4.5 billion will be saved annually of the transport cost. Therefore, Kathmandu Terai Fast Track Project can be considered as the single most important prospect for the improvement of traffic conditions and the creation of a major economic impact in Nepal over the coming decade.DOI: http://dx.doi.org/10.3126/ije.v3i4.11726      International Journal of EnvironmentVol. 3, No. 4, 2014Page: 1-11  

FPGA helix tracking algorithm for PANDA

Energy Technology Data Exchange (ETDEWEB)

Liang, Yutie; Galuska, Martin; Gessler, Thomas; Kuehn, Wolfgang; Lange, Jens Soeren; Muenchow, David; Spruck, Bjoern [II. Physikalisches Institut, Giessen University (Germany); Ye, Hua [Institute of High Energy Physics, Beijing (China); Collaboration: PANDA-Collaboration

2015-07-01

The PANDA detector is a general-purpose detector for physics with high luminosity cooled antiproton beams, planed to operate at the FAIR facility in Darmstadt, Germany. The central detector includes a silicon Micro Vertex Detector (MVD) and a Straw Tube Tracker (STT). Without any hardware trigger, large amounts of raw data are streaming into the data acquisition system. The data reduction task is performed in the online system by reconstruction algorithms programmed on FPGAs (Field Programmable Gate Arrays) as first level and on a farm of GPUs or PCs as a second level. One important part in the system is the online track reconstruction. In this presentation, an online tracking algorithm for helix tracking reconstruction in the solenoidal field is shown. The tracking algorithm is composed by two parts, a road finding module followed by an iterative helix parameter calculation module. A performance study using C++ and the status of the VHDL implementation are presented.

[Fast-track treatment--second revolution of colorectal surgery].

Science.gov (United States)

Kellokumpu, Ilmo

2012-01-01

The fast-track treatment model can be regarded as the second revolution of colorectal surgery after the introduction of laparoscopic surgery. In the gastro-surgical unit of the Central Hospital of Central Finland, results equivalent to international studies in colorectal surgery have been achieved by using fast-track model. In a study setting, this treatment model has resulted in significant decrease of total treatment costs and speeded up discharge of the patients from the hospital. The fast-track treatment model requires both a motivated, trained medical team and a motivated patient.

Impact of Mobile Dose-Tracking Technology on Medication Distribution at an Academic Medical Center.

Science.gov (United States)

Kelm, Matthew; Campbell, Udobi

2016-05-01

Medication dose-tracking technologies have the potential to improve efficiency and reduce costs associated with re-dispensing doses reported as missing. Data describing this technology and its impact on the medication use process are limited. The purpose of this study is to assess the impact of dose-tracking technology on pharmacy workload and drug expense at an academic, acute care medical center. Dose-tracking technology was implemented in June 2014. Pre-implementation data were collected from February to April 2014. Post-implementation data were collected from July to September 2014. The primary endpoint was the percent of re-dispensed oral syringe and compounded sterile product (CSP) doses within the pre- and post-implementation periods per 1,000 discharges. Secondary endpoints included pharmaceutical expense generated from re-dispensing doses, labor costs, and staff satisfaction with the medication distribution process. We observed an average 6% decrease in re-dispensing of oral syringe and CSP doses from pre- to post-implementation (15,440 vs 14,547 doses; p = .047). However, when values were adjusted per 1,000 discharges, this trend did not reach statistical significance (p = .074). Pharmaceutical expense generated from re-dispensing doses was significantly reduced from pre- to post-implementation ($834,830 vs $746,466 [savings of $88,364]; p = .047). We estimated that $2,563 worth of technician labor was avoided in re-dispensing missing doses. We also saw significant improvement in staff perception of technology assisting in reducing missing doses (p = .0003), as well as improvement in effectiveness of resolving or minimizing missing doses (p = .01). The use of mobile dose-tracking technology demonstrated meaningful reductions in both the number of doses re-dispensed and cost of pharmaceuticals dispensed.

Four-dimensional dose distributions of step-and-shoot IMRT delivered with real-time tumor tracking for patients with irregular breathing: Constant dose rate vs dose rate regulation

International Nuclear Information System (INIS)

Yang Xiaocheng; Han-Oh, Sarah; Gui Minzhi; Niu Ying; Yu, Cedric X.; Yi Byongyong

2012-01-01

Purpose: Dose-rate-regulated tracking (DRRT) is a tumor tracking strategy that programs the MLC to track the tumor under regular breathing and adapts to breathing irregularities during delivery using dose rate regulation. Constant-dose-rate tracking (CDRT) is a strategy that dynamically repositions the beam to account for intrafractional 3D target motion according to real-time information of target location obtained from an independent position monitoring system. The purpose of this study is to illustrate the differences in the effectiveness and delivery accuracy between these two tracking methods in the presence of breathing irregularities. Methods: Step-and-shoot IMRT plans optimized at a reference phase were extended to remaining phases to generate 10-phased 4D-IMRT plans using segment aperture morphing (SAM) algorithm, where both tumor displacement and deformation were considered. A SAM-based 4D plan has been demonstrated to provide better plan quality than plans not considering target deformation. However, delivering such a plan requires preprogramming of the MLC aperture sequence. Deliveries of the 4D plans using DRRT and CDRT tracking approaches were simulated assuming the breathing period is either shorter or longer than the planning day, for 4 IMRT cases: two lung and two pancreatic cases with maximum GTV centroid motion greater than 1 cm were selected. In DRRT, dose rate was regulated to speed up or slow down delivery as needed such that each planned segment is delivered at the planned breathing phase. In CDRT, MLC is separately controlled to follow the tumor motion, but dose rate was kept constant. In addition to breathing period change, effect of breathing amplitude variation on target and critical tissue dose distribution is also evaluated. Results: Delivery of preprogrammed 4D plans by the CDRT method resulted in an average of 5% increase in target dose and noticeable increase in organs at risk (OAR) dose when patient breathing is either 10% faster or

Study of dose calculation and beam parameters optimization with genetic algorithm in IMRT

International Nuclear Information System (INIS)

Chen Chaomin; Tang Mutao; Zhou Linghong; Lv Qingwen; Wang Zhuoyu; Chen Guangjie

2006-01-01

Objective: To study the construction of dose calculation model and the method of automatic beam parameters selection in IMRT. Methods: The three-dimension convolution dose calculation model of photon was constructed with the methods of Fast Fourier Transform. The objective function based on dose constrain was used to evaluate the fitness of individuals. The beam weights were optimized with genetic algorithm. Results: After 100 iterative analyses, the treatment planning system produced highly conformal and homogeneous dose distributions. Conclusion: the throe-dimension convolution dose calculation model of photon gave more accurate results than the conventional models; genetic algorithm is valid and efficient in IMRT beam parameters optimization. (authors)

Fast Poisson Solvers for Self-Consistent Beam-Beam and Space-Charge Field Computation in Multiparticle Tracking Simulations

CERN Document Server

Florio, Adrien; Pieloni, Tatiana; CERN. Geneva. ATS Department

2015-01-01

We present two different approaches to solve the 2-dimensional electrostatic problem with open boundary conditions to be used in fast tracking codes for beam-beam and space charge simulations in high energy accelerators. We compare a fast multipoles method with a hybrid Poisson solver based on the fast Fourier transform and finite differences in polar coordinates. We show that the latter outperforms the first in terms of execution time and precision, allowing for a reduction of the noise in the tracking simulation. Furthermore the new algorithm is shown to scale linearly on parallel architectures with shared memory. We conclude by effectively replacing the HFMM by the new Poisson solver in the COMBI code.

Standardising fast-track surgical nursing care in Denmark

DEFF Research Database (Denmark)

Hjort Jakobsen, Dorthe; Rud, Kirsten; Kehlet, Henrik

2014-01-01

guidelines based on the principles of fast-track surgery-i.e. patient information, surgical stress reduction, effective analgesia, early mobilisation and rapid return to normal eating. Fast-track surgery was introduced systematically in Denmark by the establishment of the Unit of Perioperative Nursing (UPN...

Developing the fuzzy c-means clustering algorithm based on maximum entropy for multitarget tracking in a cluttered environment

Science.gov (United States)

Chen, Xiao; Li, Yaan; Yu, Jing; Li, Yuxing

2018-01-01

For fast and more effective implementation of tracking multiple targets in a cluttered environment, we propose a multiple targets tracking (MTT) algorithm called maximum entropy fuzzy c-means clustering joint probabilistic data association that combines fuzzy c-means clustering and the joint probabilistic data association (PDA) algorithm. The algorithm uses the membership value to express the probability of the target originating from measurement. The membership value is obtained through fuzzy c-means clustering objective function optimized by the maximum entropy principle. When considering the effect of the public measurement, we use a correction factor to adjust the association probability matrix to estimate the state of the target. As this algorithm avoids confirmation matrix splitting, it can solve the high computational load problem of the joint PDA algorithm. The results of simulations and analysis conducted for tracking neighbor parallel targets and cross targets in a different density cluttered environment show that the proposed algorithm can realize MTT quickly and efficiently in a cluttered environment. Further, the performance of the proposed algorithm remains constant with increasing process noise variance. The proposed algorithm has the advantages of efficiency and low computational load, which can ensure optimum performance when tracking multiple targets in a dense cluttered environment.

Simulation of dose deposition in stereotactic synchrotron radiation therapy: a fast approach combining Monte Carlo and deterministic algorithms

Energy Technology Data Exchange (ETDEWEB)

Smekens, F; Freud, N; Letang, J M; Babot, D [CNDRI (Nondestructive Testing using Ionizing Radiations) Laboratory, INSA-Lyon, 69621 Villeurbanne Cedex (France); Adam, J-F; Elleaume, H; Esteve, F [INSERM U-836, Equipe 6 ' Rayonnement Synchrotron et Recherche Medicale' , Institut des Neurosciences de Grenoble (France); Ferrero, C; Bravin, A [European Synchrotron Radiation Facility, Grenoble (France)], E-mail: francois.smekens@insa-lyon.fr

2009-08-07

A hybrid approach, combining deterministic and Monte Carlo (MC) calculations, is proposed to compute the distribution of dose deposited during stereotactic synchrotron radiation therapy treatment. The proposed approach divides the computation into two parts: (i) the dose deposited by primary radiation (coming directly from the incident x-ray beam) is calculated in a deterministic way using ray casting techniques and energy-absorption coefficient tables and (ii) the dose deposited by secondary radiation (Rayleigh and Compton scattering, fluorescence) is computed using a hybrid algorithm combining MC and deterministic calculations. In the MC part, a small number of particle histories are simulated. Every time a scattering or fluorescence event takes place, a splitting mechanism is applied, so that multiple secondary photons are generated with a reduced weight. The secondary events are further processed in a deterministic way, using ray casting techniques. The whole simulation, carried out within the framework of the Monte Carlo code Geant4, is shown to converge towards the same results as the full MC simulation. The speed of convergence is found to depend notably on the splitting multiplicity, which can easily be optimized. To assess the performance of the proposed algorithm, we compare it to state-of-the-art MC simulations, accelerated by the track length estimator technique (TLE), considering a clinically realistic test case. It is found that the hybrid approach is significantly faster than the MC/TLE method. The gain in speed in a test case was about 25 for a constant precision. Therefore, this method appears to be suitable for treatment planning applications.

An improved multi-domain convolution tracking algorithm

Science.gov (United States)

Sun, Xin; Wang, Haiying; Zeng, Yingsen

2018-04-01

Along with the wide application of the Deep Learning in the field of Computer vision, Deep learning has become a mainstream direction in the field of object tracking. The tracking algorithm in this paper is based on the improved multidomain convolution neural network, and the VOT video set is pre-trained on the network by multi-domain training strategy. In the process of online tracking, the network evaluates candidate targets sampled from vicinity of the prediction target in the previous with Gaussian distribution, and the candidate target with the highest score is recognized as the prediction target of this frame. The Bounding Box Regression model is introduced to make the prediction target closer to the ground-truths target box of the test set. Grouping-update strategy is involved to extract and select useful update samples in each frame, which can effectively prevent over fitting. And adapt to changes in both target and environment. To improve the speed of the algorithm while maintaining the performance, the number of candidate target succeed in adjusting dynamically with the help of Self-adaption parameter Strategy. Finally, the algorithm is tested by OTB set, compared with other high-performance tracking algorithms, and the plot of success rate and the accuracy are drawn. which illustrates outstanding performance of the tracking algorithm in this paper.

Online track reconstruction at hadron colliders

International Nuclear Information System (INIS)

Amerio, Silvia; Bettini, Marco; Nicoletto, Marino; Crescioli, Francesco; Bucciantonio, Martina; DELL'ORSO, Mauro; Piendibene, Marco; VOLPI, Guido; Annovi, Alberto; Catastini, Pierluigi; Giannetti, Paola; Lucchesi, Donatella

2010-01-01

Real time event reconstruction plays a fundamental role in High Energy Physics experiments. Reducing the rate of data to be saved on tape from millions to hundreds per second is critical. In order to increase the purity of the collected samples, rate reduction has to be coupled with the capability to simultaneously perform a first selection of the most interesting events. A fast and efficient online track reconstruction is important to effectively trigger on leptons and/or displaced tracks from b-quark decays. This talk will be an overview of online tracking techniques in different HEP environments: we will show how H1 experiment at HERA faced the challenges of online track reconstruction implementing pattern matching and track linking algorithms on CAMs and FPGAs in the Fast Track Processor (FTT). The pattern recognition technique is also at the basis of the Silicon Vertex Trigger (SVT) at the CDF experiment at Tevatron: coupled to a very fast fitting phase, SVT allows to trigger on displaced tracks, thus greatly increasing the efficiency for the hadronic B decay modes. A recent upgrade of the SVT track fitter, the Giga-fitter, can perform more than 1 fit/ns and further improves the CDF online trigger capabilities at high luminosity. At SLHC, where luminosities will be 2 orders of magnitude greater than Tevatron, online tracking will be much more challenging: we will describe CMS future plans for a Level-1 track trigger and the Fast Tracker (FTK) processor at the ATLAS experiment, based on the Giga-fitter architecture and designed to provide high quality tracks reconstructed over the entire detector in time for a Level-2 trigger decision.luminosity. At SLHC, where luminosities will be 2 orders of magnitude greater than Tevatron, online tracking will be much more challenging: we will describe CMS future plans for a Level-1 track trigger and the Fast Tracker (FTK) processor at the Atlas experiment, based on the Giga-fitter architecture and designed to provide high

Fast decoding algorithms for coded aperture systems

International Nuclear Information System (INIS)

Byard, Kevin

2014-01-01

Fast decoding algorithms are described for a number of established coded aperture systems. The fast decoding algorithms for all these systems offer significant reductions in the number of calculations required when reconstructing images formed by a coded aperture system and hence require less computation time to produce the images. The algorithms may therefore be of use in applications that require fast image reconstruction, such as near real-time nuclear medicine and location of hazardous radioactive spillage. Experimental tests confirm the efficacy of the fast decoding techniques

Delirium after fast-track hip and knee arthroplasty

DEFF Research Database (Denmark)

Krenk, Lene; Rasmussen, L S; Hansen, T B

2012-01-01

hospital stay and medical morbidity. No data on PD are available in fast-track surgery. The aim of this study was to evaluate the incidence of PD after fast-track hip (THA) and knee arthroplasty (TKA) with anticipated length of stay (LOS) of In a prospective multicentre study to evaluate postoperative...

FAST-TRACK HIP AND KNEE ARTHROPLASTY (LITERATURE REVIEW

Directory of Open Access Journals (Sweden)

A. M. Ageenko

2017-01-01

Full Text Available In the present paper the authors discuss the history of fast-track formation, its development and current status. Fast-track advantages in comparison to other rehabilitation options are analyzed. The focus is placed on methods of accelerated rehabilitation after total hip and knee arthroplasty in the leading European and American clinics. Fast-track protocols of surgical centers of Denmark and Hospital for special surgery in the US are described, factors that determine time of hospital stay after total hip and knee arthroplasty are considered, predictors of hospital stay and patients satisfaction after the surgery are examined. The paper reflects the results of the comparison of frequency of thromboembolic and other complications as well as readmission rate after traditional rehabilitation and after fast-track. The paper considers fast-track in bilateral total knee replacement. The authors conclude that further research on acceleration of rehabilitation and reduction of hospital stay after total hip and knee arthroplasty needs to be focused on the optimization of pain relief, especially after discharge, blood preservation techniques, supplementation of fluids loss and strengthening of muscles. Literature analysis demonstrated that the implementation of the Protocol for accelerated recovery after joint arthroplasty in Russia is at an insufficient level. Data of foreign multicenter studies during recent years indicate a high efficacy and safety of this technique in different groups of patients.

High-pitch computed tomography coronary angiography-a new dose-saving algorithm: estimation of radiation exposure.

Science.gov (United States)

Ketelsen, Dominik; Buchgeister, Markus; Korn, Andreas; Fenchel, Michael; Schmidt, Bernhard; Flohr, Thomas G; Thomas, Christoph; Schabel, Christoph; Tsiflikas, Ilias; Syha, Roland; Claussen, Claus D; Heuschmid, Martin

2012-01-01

Purpose. To estimate effective dose and organ equivalent doses of prospective ECG-triggered high-pitch CTCA. Materials and Methods. For dose measurements, an Alderson-Rando phantom equipped with thermoluminescent dosimeters was used. The effective dose was calculated according to ICRP 103. Exposure was performed on a second-generation dual-source scanner (SOMATOM Definition Flash, Siemens Medical Solutions, Germany). The following scan parameters were used: 320 mAs per rotation, 100 and 120 kV, pitch 3.4 for prospectively ECG-triggered high-pitch CTCA, scan range of 13.5 cm, collimation 64 × 2 × 0.6 mm with z-flying focal spot, gantry rotation time 280 ms, and simulated heart rate of 60 beats per minute. Results. Depending on the applied tube potential, the effective whole-body dose of the cardiac scan ranged from 1.1 mSv to 1.6 mSv and from 1.2 to 1.8 mSv for males and females, respectively. The radiosensitive breast tissue in the range of the primary beam caused an increased female-specific effective dose of 8.6%±0.3% compared to males. Decreasing the tube potential, a significant reduction of the effective dose of 35.8% and 36.0% can be achieved for males and females, respectively (P < 0.001). Conclusion. The radiologist and the CT technician should be aware of this new dose-saving strategy to keep the radiation exposure as low as reasonablly achievable.

A multi-frame particle tracking algorithm robust against input noise

International Nuclear Information System (INIS)

Li, Dongning; Zhang, Yuanhui; Sun, Yigang; Yan, Wei

2008-01-01

The performance of a particle tracking algorithm which detects particle trajectories from discretely recorded particle positions could be substantially hindered by the input noise. In this paper, a particle tracking algorithm is developed which is robust against input noise. This algorithm employs the regression method instead of the extrapolation method usually employed by existing algorithms to predict future particle positions. If a trajectory cannot be linked to a particle at a frame, the algorithm can still proceed by trying to find a candidate at the next frame. The connectivity of tracked trajectories is inspected to remove the false ones. The algorithm is validated with synthetic data. The result shows that the algorithm is superior to traditional algorithms in the aspect of tracking long trajectories

Image processing algorithm for robot tracking in reactor vessel

International Nuclear Information System (INIS)

Kim, Tae Won; Choi, Young Soo; Lee, Sung Uk; Jeong, Kyung Min; Kim, Nam Kyun

2011-01-01

In this paper, we proposed an image processing algorithm to find the position of an underwater robot in the reactor vessel. Proposed algorithm is composed of Modified SURF(Speeded Up Robust Feature) based on Mean-Shift and CAMSHIFT(Continuously Adaptive Mean Shift Algorithm) based on color tracking algorithm. Noise filtering using luminosity blend method and color clipping are preprocessed. Initial tracking area for the CAMSHIFT is determined by using modified SURF. And then extracting the contour and corner points in the area of target tracked by CAMSHIFT method. Experiments are performed at the reactor vessel mockup and verified to use in the control of robot by visual tracking

Particle filters for object tracking: enhanced algorithm and efficient implementations

International Nuclear Information System (INIS)

Abd El-Halym, H.A.

2010-01-01

Object tracking and recognition is a hot research topic. In spite of the extensive research efforts expended, the development of a robust and efficient object tracking algorithm remains unsolved due to the inherent difficulty of the tracking problem. Particle filters (PFs) were recently introduced as a powerful, post-Kalman filter, estimation tool that provides a general framework for estimation of nonlinear/ non-Gaussian dynamic systems. Particle filters were advanced for building robust object trackers capable of operation under severe conditions (small image size, noisy background, occlusions, fast object maneuvers ..etc.). The heavy computational load of the particle filter remains a major obstacle towards its wide use.In this thesis, an Excitation Particle Filter (EPF) is introduced for object tracking. A new likelihood model is proposed. It depends on multiple functions: position likelihood; gray level intensity likelihood and similarity likelihood. Also, we modified the PF as a robust estimator to overcome the well-known sample impoverishment problem of the PF. This modification is based on re-exciting the particles if their weights fall below a memorized weight value. The proposed enhanced PF is implemented in software and evaluated. Its results are compared with a single likelihood function PF tracker, Particle Swarm Optimization (PSO) tracker, a correlation tracker, as well as, an edge tracker. The experimental results demonstrated the superior performance of the proposed tracker in terms of accuracy, robustness, and occlusion compared with other methods Efficient novel hardware architectures of the Sample Important Re sample Filter (SIRF) and the EPF are implemented. Three novel hardware architectures of the SIRF for object tracking are introduced. The first architecture is a two-step sequential PF machine, where particle generation, weight calculation and normalization are carried out in parallel during the first step followed by a sequential re

Technical Note: A novel leaf sequencing optimization algorithm which considers previous underdose and overdose events for MLC tracking radiotherapy

Energy Technology Data Exchange (ETDEWEB)

Wisotzky, Eric, E-mail: eric.wisotzky@charite.de, E-mail: eric.wisotzky@ipk.fraunhofer.de; O’Brien, Ricky; Keall, Paul J., E-mail: paul.keall@sydney.edu.au [Radiation Physics Laboratory, Sydney Medical School, University of Sydney, Sydney, NSW 2006 (Australia)

2016-01-15

Purpose: Multileaf collimator (MLC) tracking radiotherapy is complex as the beam pattern needs to be modified due to the planned intensity modulation as well as the real-time target motion. The target motion cannot be planned; therefore, the modified beam pattern differs from the original plan and the MLC sequence needs to be recomputed online. Current MLC tracking algorithms use a greedy heuristic in that they optimize for a given time, but ignore past errors. To overcome this problem, the authors have developed and improved an algorithm that minimizes large underdose and overdose regions. Additionally, previous underdose and overdose events are taken into account to avoid regions with high quantity of dose events. Methods: The authors improved the existing MLC motion control algorithm by introducing a cumulative underdose/overdose map. This map represents the actual projection of the planned tumor shape and logs occurring dose events at each specific regions. These events have an impact on the dose cost calculation and reduce recurrence of dose events at each region. The authors studied the improvement of the new temporal optimization algorithm in terms of the L1-norm minimization of the sum of overdose and underdose compared to not accounting for previous dose events. For evaluation, the authors simulated the delivery of 5 conformal and 14 intensity-modulated radiotherapy (IMRT)-plans with 7 3D patient measured tumor motion traces. Results: Simulations with conformal shapes showed an improvement of L1-norm up to 8.5% after 100 MLC modification steps. Experiments showed comparable improvements with the same type of treatment plans. Conclusions: A novel leaf sequencing optimization algorithm which considers previous dose events for MLC tracking radiotherapy has been developed and investigated. Reductions in underdose/overdose are observed for conformal and IMRT delivery.

Fast-Track Teacher Recruitment.

Science.gov (United States)

Grant, Franklin Dean

2001-01-01

Schools need a Renaissance human-resources director to implement strategic staffing and fast-track teacher-recruitment plans. The HR director must attend to customer satisfaction, candidate supply, web-based recruitment possibilities, stabilization of newly hired staff, retention of veteran staff, utilization of retired employees, and latest…

Opportune acquisition and tracking time for the fast-moving targets in a ground-based telescope

Science.gov (United States)

Chen, Juan; Wang, Jianli; Chen, Tao

2004-10-01

Acquisition is defined as identification for a fixed target in the related field of sight (FOS), while tracking means the sway of the telescope's axis of sight (AOS). The automatic acquisition and tracking is a process in which the operating way of the telescope should be switched from guiding to automatic tracking. There are some kinds of method to improve the acquisition and tracking ability for fast moving targets: to extend the acquisition and tracking FOS with memory and storage information of the sensor system; the multimode control to improve the dynamic property of the servo system; to choose an opportune time for acquisition and tracking; to select the control regulator parameter in every working states. If the processor of the CCD sensor can temporarily remember and save the information of the target before it moves out of the FOS, correspondingly, the FOS may be extended. The data forecast technology is used to store the target information. The automatic interception experiments are carried out to verify the control strategy.

Seismic noise attenuation using an online subspace tracking algorithm

NARCIS (Netherlands)

Zhou, Yatong; Li, Shuhua; Zhang, D.; Chen, Yangkang

2018-01-01

We propose a new low-rank based noise attenuation method using an efficient algorithm for tracking subspaces from highly corrupted seismic observations. The subspace tracking algorithm requires only basic linear algebraic manipulations. The algorithm is derived by analysing incremental gradient

Fast-Track Management of Patients Undergoing Proximal Pancreatic Resection

Science.gov (United States)

French, JJ; Mansfield, SD; Jaques, K; Jaques, BC; Manas, DM; Charnley, RM

2009-01-01

INTRODUCTION To avoid the risk of complications of biliary drainage, a feasibility study was carried out to determine whether it might be possible to fast-track surgical treatment, with resection before biliary drainage, in jaundiced patients with proximal pancreatic/peri-ampullary malignancy. PATIENTS AND METHODS Over an 18-month period, based on their presenting bilirubin levels and other logistical factors, all jaundiced patients who might be suitable for fast-track management were identified. Data on complications and hospital stay were compared with those patients in whom a conventional pathway (with biliary drainage) was used during the same time period. Data were also compared with a group of patients from the preceding 6 months. RESULTS Nine patients were fast-tracked and 49 patients treated in the conventional pathway. Fast-track patients mean (SD) serum bilirubin level was 265 μmol/l (81.6) at the time of the operation compared to 43 μmol/l (51.3; P ≥ 0.0001) in conventional patients. Mean (SD) of time from referral to operation, 14 days (9) versus 59 days (36.9), was significantly shorter in fast-track patients than conventional patients (P ≤ 0.0001). Length of hospital stay mean (SD) at 17 (6) days versus 22 days (19.6; P = 0.2114), surgical complications and mortality in fast-track patients were similar to conventional patients. Prior to surgery, the 49 conventional patients underwent a total of 73 biliary drainage procedures resulting in seven major complications. Comparison with the group of patients from the previous 6 months indicated that the conventional group were not disadvantaged. CONCLUSIONS Fast-track management by resection without biliary drainage of selected patients with distal biliary strictures is safe and has the potential to reduce the waiting time to surgery, overall numbers of biliary drainage procedures and the complications thereof. PMID:19220943

Fast tracking in paediatric cardiac anaesthesia : an update.

Directory of Open Access Journals (Sweden)

Lake Carol

2002-01-01

Full Text Available A care plan in which cardiac surgical patients progress quickly through the perioperative course to hospital discharge is often referred to as a Fast Track. Such care plans have been used extensively in adult cardiac patients but are also applicable to paediatric patients. Although no randomised controlled trials are available to document a reduction in hospital costs and avoidance of iatrogenic complications with paediatric fast tracks, many healthcare administrators encourage their use. Fast Track clinical guidelines usually include same day surgery, use of short- acting anaesthetic drugs, early extubation, effective pain management, and reduced intensive care unit stays. These protocols are certainly appropriate for simple procedures such as repair of atrial or ventricular septal defects or ligation of a patent ductus arteriosus. However, many paediatric cardiac anaesthesiologists consider that all paediatric patients without significant pulmonary or residual cardiac pathology can be managed using expedited postoperative protocols. Essential components in a "fast track" protocol include use of minimally invasive surgical techniques, modified ultrafiltration during cardiopulmonary bypass, transoesophageal echocardiography to evaluate the cardiac repair, and postoperative pain control. Using such techniques, 80-90% of paediatric patients can be extubated in the operating room or within 2-4 hours postoperatively. Despite the opinions of recognised experts, an appropriately sized and powered multicentre, controlled, randomised, prospective study is still needed to conclusively document the efficiency and effectiveness of the Fast Track in paediatric cardiac patients.

Evidence Basis for Regional Anesthesia in Multidisciplinary Fast-Track Surgical Care Pathways

DEFF Research Database (Denmark)

Carli, Francesco; Kehlet, Henrik; Baldini, Gabriele

2011-01-01

Fast-track programs have been developed with the aim to reduce perioperative surgical stress and facilitate patient's recovery after surgery. Potentially, regional anesthesia and analgesia techniques may offer physiological advantages to support fast-track methodologies in different type of surge......Fast-track programs have been developed with the aim to reduce perioperative surgical stress and facilitate patient's recovery after surgery. Potentially, regional anesthesia and analgesia techniques may offer physiological advantages to support fast-track methodologies in different type...... of surgeries. The aim of this article was to identify and discuss potential advantages offerred by regional anesthesia and analgesia techniques to fast-track programs. In the first section, the impact of regional anesthesia on the main elements of fast-track surgery is addressed. In the second section......, procedure-specific fast-track programs for colorectal, hernia, esophageal, cardiac, vascular, and orthopedic surgeries are presented. For each, regional anesthesia and analgesia techniques more frequently used are discussed. Furthermore, clinical studies, which included regional techniques as elements...

Fast and accurate algorithm for the computation of complex linear canonical transforms.

Science.gov (United States)

Koç, Aykut; Ozaktas, Haldun M; Hesselink, Lambertus

2010-09-01

A fast and accurate algorithm is developed for the numerical computation of the family of complex linear canonical transforms (CLCTs), which represent the input-output relationship of complex quadratic-phase systems. Allowing the linear canonical transform parameters to be complex numbers makes it possible to represent paraxial optical systems that involve complex parameters. These include lossy systems such as Gaussian apertures, Gaussian ducts, or complex graded-index media, as well as lossless thin lenses and sections of free space and any arbitrary combinations of them. Complex-ordered fractional Fourier transforms (CFRTs) are a special case of CLCTs, and therefore a fast and accurate algorithm to compute CFRTs is included as a special case of the presented algorithm. The algorithm is based on decomposition of an arbitrary CLCT matrix into real and complex chirp multiplications and Fourier transforms. The samples of the output are obtained from the samples of the input in approximately N log N time, where N is the number of input samples. A space-bandwidth product tracking formalism is developed to ensure that the number of samples is information-theoretically sufficient to reconstruct the continuous transform, but not unnecessarily redundant.

Sufentanil Vs Fentanyl for Fast-Track Cardiac Anaesthesia

Directory of Open Access Journals (Sweden)

C M Deshpande

2009-01-01

Full Text Available A perioperative anaesthetic management that aims to facilitate tracheal extubation of patients within 1-6 hrs after cardiac surgery is called "fast-track′. Main advantage of ′fast-track" method is better usage of medical resources and lowering hospital costs without increasing morbidity and mortality of the patients. Standard fast-track protocols contain short acting anaesthetic agents, smaller incisions and decreased pump times without hypothermia. In this study we compared two short acting opioid drugs, fentanyl versus Sufentanil when used as a part of the balanced anaesthesia technique for fast track in cardiac surgery patients& evaluated the time taken for extubation, haemodynamic stability, analgesia requirements& incidence of awareness. The results from the study show thatboth agents provide good haemodynamic stability and postoperative analgesia. Although Sufentanil provides earlier extuba-tion, both agents reduce the ICU stay equally. In conclusion both agents can be used effectively for fasttrack cardiac anaesthesia.

Experiments with conjugate gradient algorithms for homotopy curve tracking

Science.gov (United States)

Irani, Kashmira M.; Ribbens, Calvin J.; Watson, Layne T.; Kamat, Manohar P.; Walker, Homer F.

1991-01-01

There are algorithms for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for almost all starting points, i.e., with probability one. The essence of all such algorithms is the construction of an appropriate homotopy map and then tracking some smooth curve in the zero set of this homotopy map. HOMPACK is a mathematical software package implementing globally convergent homotopy algorithms with three different techniques for tracking a homotopy zero curve, and has separate routines for dense and sparse Jacobian matrices. The HOMPACK algorithms for sparse Jacobian matrices use a preconditioned conjugate gradient algorithm for the computation of the kernel of the homotopy Jacobian matrix, a required linear algebra step for homotopy curve tracking. Here, variants of the conjugate gradient algorithm are implemented in the context of homotopy curve tracking and compared with Craig's preconditioned conjugate gradient method used in HOMPACK. The test problems used include actual large scale, sparse structural mechanics problems.

FTK: a Fast Track Trigger for ATLAS

International Nuclear Information System (INIS)

Anderson, J; Auerbach, B; Blair, R; Andreani, A; Andreazza, A; Citterio, M; Annovi, A; Beretta, M; Castegnaro, A; Atkinson, M; Cavaliere, V; Chang, P; Bevacqua, V; Crescioli, F; Blazey, G; Bogdan, M; Boveia, A; Canelli, F; Cheng, Y; Cervigni, F

2012-01-01

We describe the design and expected performance of a the Fast Tracker Trigger (FTK) system for the ATLAS detector at the Large Hadron Collider. The FTK is a highly parallel hardware system designed to operate at the Level 1 trigger output rate. It is designed to provide global tracks reconstructed in the inner detector with resolution comparable to the full offline reconstruction as input of the Level 2 trigger processing. The hardware system is based on associative memories for pattern recognition and fast FPGAs for track reconstruction. The FTK is expected to dramatically improve the performance of track based isolation and b-tagging with little to no dependencies of pile-up interactions.

Delirium in the fast-track surgery setting

DEFF Research Database (Denmark)

Krenk, Lene; Rasmussen, Lars S; Kehlet, Henrik

2012-01-01

Postoperative delirium (PD) and postoperative cognitive dysfunction (POCD) are two separate syndromes of cognitive decline after major surgery, especially in the elderly. Pathogenesis is multifactorial with some common risk factors, and to reduce the risk, a multimodal approach is necessary. The ....... In conclusion, the fast-track methodology may reduce the incidence of postoperative cognitive decline after surgery........ The fast-track methodology is becoming a well-established perioperative care regime with possible preventive effects for postoperative cognitive decline, including reduced pain and use of opioids, and early mobilisation with early discharge (≤3 days) to preoperative environment after total hip....../knee arthroplasty (THA/TKA). The fast-track set-up seems to be associated with a lower frequency of PD and early POCD after THA/TKA. Thus, in a series of 225 patients ≥60 years, no cases of PD were seen and the incidence of POCD was reduced by more than 50% at 1 week postoperatively compared to previous studies...

Patient radiation exposure and dose tracking: a perspective.

Science.gov (United States)

Rehani, Madan M

2017-07-01

Much of the emphasis on radiation protection about 2 decades ago accrued from the need for protection of radiation workers and collective doses to populations from medical exposures. With the realization that individual patient doses were rising and becoming an issue, the author had propagated the concept of a smart card for radiation exposure history of individual patients. During the last 7 years, much has happened wherein radiation exposure and the dose history of individual patients has become a reality in many countries. In addition to dealing with overarching questions, such as "Why track, what to track, and how to track?," this review elaborates on a number of points such as attitudes toward tracking, review of practices in large parts of the world, description of various elements for exposure and dose tracking, how to use the information available from tracking, achievements and stumbling blocks in implementation to date, templates for implementation of tracking at different levels of health care, the role of picture archiving and communication systems and eHealth, the role of tracking in justification and optimization of protection, comments on cumulative dose, how referrers can use this information, current provisions in international standards, and future actions.

Fast-track knee arthroplasty – status and future challenges

DEFF Research Database (Denmark)

Kehlet, Henrik; Thienpont, Emmanuel

2013-01-01

Fast-track programs have been developed for different surgical procedures leading to higher patient satisfaction and lower morbidity. This concept has been extended to knee arthroplasty in recent years. The purpose of this narrative review was to discuss the different aspects of fast-track knee...... arthroplasty....

Latent uncertainties of the precalculated track Monte Carlo method

Energy Technology Data Exchange (ETDEWEB)

Renaud, Marc-André; Seuntjens, Jan [Medical Physics Unit, McGill University, Montreal, Quebec H3G 1A4 (Canada); Roberge, David [Département de radio-oncologie, Centre Hospitalier de l’Université de Montréal, Montreal, Quebec H2L 4M1 (Canada)

2015-01-15

Purpose: While significant progress has been made in speeding up Monte Carlo (MC) dose calculation methods, they remain too time-consuming for the purpose of inverse planning. To achieve clinically usable calculation speeds, a precalculated Monte Carlo (PMC) algorithm for proton and electron transport was developed to run on graphics processing units (GPUs). The algorithm utilizes pregenerated particle track data from conventional MC codes for different materials such as water, bone, and lung to produce dose distributions in voxelized phantoms. While PMC methods have been described in the past, an explicit quantification of the latent uncertainty arising from the limited number of unique tracks in the pregenerated track bank is missing from the paper. With a proper uncertainty analysis, an optimal number of tracks in the pregenerated track bank can be selected for a desired dose calculation uncertainty. Methods: Particle tracks were pregenerated for electrons and protons using EGSnrc and GEANT4 and saved in a database. The PMC algorithm for track selection, rotation, and transport was implemented on the Compute Unified Device Architecture (CUDA) 4.0 programming framework. PMC dose distributions were calculated in a variety of media and compared to benchmark dose distributions simulated from the corresponding general-purpose MC codes in the same conditions. A latent uncertainty metric was defined and analysis was performed by varying the pregenerated track bank size and the number of simulated primary particle histories and comparing dose values to a “ground truth” benchmark dose distribution calculated to 0.04% average uncertainty in voxels with dose greater than 20% of D{sub max}. Efficiency metrics were calculated against benchmark MC codes on a single CPU core with no variance reduction. Results: Dose distributions generated using PMC and benchmark MC codes were compared and found to be within 2% of each other in voxels with dose values greater than 20% of

Latent uncertainties of the precalculated track Monte Carlo method

International Nuclear Information System (INIS)

Renaud, Marc-André; Seuntjens, Jan; Roberge, David

2015-01-01

Purpose: While significant progress has been made in speeding up Monte Carlo (MC) dose calculation methods, they remain too time-consuming for the purpose of inverse planning. To achieve clinically usable calculation speeds, a precalculated Monte Carlo (PMC) algorithm for proton and electron transport was developed to run on graphics processing units (GPUs). The algorithm utilizes pregenerated particle track data from conventional MC codes for different materials such as water, bone, and lung to produce dose distributions in voxelized phantoms. While PMC methods have been described in the past, an explicit quantification of the latent uncertainty arising from the limited number of unique tracks in the pregenerated track bank is missing from the paper. With a proper uncertainty analysis, an optimal number of tracks in the pregenerated track bank can be selected for a desired dose calculation uncertainty. Methods: Particle tracks were pregenerated for electrons and protons using EGSnrc and GEANT4 and saved in a database. The PMC algorithm for track selection, rotation, and transport was implemented on the Compute Unified Device Architecture (CUDA) 4.0 programming framework. PMC dose distributions were calculated in a variety of media and compared to benchmark dose distributions simulated from the corresponding general-purpose MC codes in the same conditions. A latent uncertainty metric was defined and analysis was performed by varying the pregenerated track bank size and the number of simulated primary particle histories and comparing dose values to a “ground truth” benchmark dose distribution calculated to 0.04% average uncertainty in voxels with dose greater than 20% of D max . Efficiency metrics were calculated against benchmark MC codes on a single CPU core with no variance reduction. Results: Dose distributions generated using PMC and benchmark MC codes were compared and found to be within 2% of each other in voxels with dose values greater than 20% of the

Fast-track surgery: Toward comprehensive peri-operative care.

Science.gov (United States)

Nanavati, Aditya J; Prabhakar, S

2014-01-01

Fast-track surgery is a multimodal approach to patient care using a combination of several evidence-based peri-operative interventions to expedite recovery after surgery. It is an extension of the critical pathway that integrates modalities in surgery, anesthesia, and nutrition, enforces early mobilization and feeding, and emphasizes reduction of the surgical stress response. It entails a great partnership between a surgeon and an anesthesiologist with several other specialists to form a multi-disciplinary team, which may then engage in patient care. The practice of fast-track surgery has yielded excellent results and there has been a significant reduction in hospital stay without a rise in complications or re-admissions. The effective implementation begins with the formulation of a protocol, carrying out each intervention and gathering outcome data. The care of a patient is divided into three phases: Before, during, and after surgery. Each stage needs active participation of few or all the members of the multi-disciplinary team. Other than surgical technique, anesthetic drugs, and techniques form the cornerstone in the ability of the surgeon to carry out a fast-track surgery safely. It is also the role of this team to keep abreast with the latest development in fast-track methodology and make appropriate changes to policy. In the Indian healthcare system, there is a huge benefit that may be achieved by the successful implementation of a fast-track surgery program at an institutional level. The lack of awareness regarding this concept, fear and apprehension regarding its implementation are the main barriers that need to be overcome.

Orchestrating care through the fast-track perspective: A qualitative content analysis of the provision of individualised nursing care in orthopaedic fast-track programmes.

Science.gov (United States)

Berthelsen, Connie Bøttcher; Frederiksen, Kirsten

2017-02-01

The lack of individualised care in orthopaedic regimes is often explained by the extended use of patient pathways and clinical guidelines. The aim of this study was to illuminate orthopaedic nurses' perceptions and experiences of providing individual nursing care for older patients in standardised fast-track programmes after total hip or knee replacement. Ten semi-structured interviews were conducted with orthopaedic nurses in orthopaedic wards at three Danish hospitals between April and June of 2015. Data were analysed using manifest and latent content analysis according to Graneheim and Lundman. The main theme of the overall interpretation was Orchestrating care through the fast-track perspective, accompanied by three sub-themes: Identifying and legitimising relevant individual care in the fast-track programme, Struggling to fit all patients in the fast-track programme and Justifying individualised care-related actions in the fast-track programme. The study concluded that, even though the nurses struggled to comply with the programme, they still found themselves compromising their nursing care and ethics to follow the standardised regime. There is a need to establish more specific inclusion criteria to maintain the effective elements in the programme and to facilitate nurses' opportunities to offer individual care, thereby ensuring that fragile patients have access to other possibilities. Copyright © 2016 Elsevier Ltd. All rights reserved.

Design of a tracking device for on-line dose monitoring in hadrontherapy

Energy Technology Data Exchange (ETDEWEB)

Battistoni, G. [INFN Sezione di Milano, Milano (Italy); Collamati, F.; De Lucia, E. [Laboratori Nazionali di Frascati dell' INFN, Frascati (Italy); Faccini, R. [Dipartimento di Fisica, “La Sapienza” Università di Roma, Roma (Italy); INFN Sezione di Roma, Roma (Italy); Marafini, M. [INFN Sezione di Roma, Roma (Italy); Museo Storico della Fisica e Centro Studi e Ricerche “E. Fermi”, Roma (Italy); Mattei, I. [INFN Sezione di Milano, Milano (Italy); Muraro, S., E-mail: silvia.muraro@mi.infn.it [INFN Sezione di Milano, Milano (Italy); Paramatti, R. [INFN Sezione di Roma, Roma (Italy); Patera, V. [INFN Sezione di Roma, Roma (Italy); Museo Storico della Fisica e Centro Studi e Ricerche “E. Fermi”, Roma (Italy); Dipartimento di Scienze di Base e Applicate per Ingegneria, “La Sapienza” Università di Roma, Roma (Italy); Pinci, D. [INFN Sezione di Roma, Roma (Italy); Rucinski, A. [INFN Sezione di Roma, Roma (Italy); Dipartimento di Scienze di Base e Applicate per Ingegneria, “La Sapienza” Università di Roma, Roma (Italy); Russomando, A. [Dipartimento di Fisica, “La Sapienza” Università di Roma, Roma (Italy); INFN Sezione di Roma, Roma (Italy); Center for Life Nano Science@Sapienza, Istituto Italiano di Tecnologia, Roma (Italy); and others

2017-02-11

Hadrontherapy is a technique for cancer treatment that exploits ion beams (mostly protons and carbons). A critical issue is the accuracy that is achievable when monitoring the dose released by the beam to the tumor and to the surrounding tissues. We present the design of a tracking device, developed in the framework of the INSIDE project , capable of monitoring in real time the longitudinal profile of the dose delivered in the patient. This is possible by detecting the secondary particles produced by the interaction of the beam in the tissues. The position of the Bragg peak can be correlated to the charged particles emission point distribution measurement. The tracking device will be able to provide a fast response on the dose pattern by tracking the secondary charged fragments. The tracks are detected using 6 planes of scintillating fibers, providing the 3D coordinates of the track intersection with each plane. The fibers planes are followed by a plastic scintillator and by a small calorimeter built with a pixelated Lutetium Fine Silicate (LFS) crystal. A complete detector simulation, followed by the event reconstruction, has been performed to determine the achievable monitoring spatial resolution. - Highlights: • On-line range monitoring in hadrontherapy. • New approach: detection of charged secondary particles escaping the patient. • Correlation of longitudinal emission profile of secondaries with the beam range. • New detector integrated in a multi-modal system to be tested in clinical operation.

Target-type probability combining algorithms for multisensor tracking

Science.gov (United States)

Wigren, Torbjorn

2001-08-01

Algorithms for the handing of target type information in an operational multi-sensor tracking system are presented. The paper discusses recursive target type estimation, computation of crosses from passive data (strobe track triangulation), as well as the computation of the quality of the crosses for deghosting purposes. The focus is on Bayesian algorithms that operate in the discrete target type probability space, and on the approximations introduced for computational complexity reduction. The centralized algorithms are able to fuse discrete data from a variety of sensors and information sources, including IFF equipment, ESM's, IRST's as well as flight envelopes estimated from track data. All algorithms are asynchronous and can be tuned to handle clutter, erroneous associations as well as missed and erroneous detections. A key to obtain this ability is the inclusion of data forgetting by a procedure for propagation of target type probability states between measurement time instances. Other important properties of the algorithms are their abilities to handle ambiguous data and scenarios. The above aspects are illustrated in a simulations study. The simulation setup includes 46 air targets of 6 different types that are tracked by 5 airborne sensor platforms using ESM's and IRST's as data sources.

Fast-track surgery for breast cancer is possible

DEFF Research Database (Denmark)

Mertz, Birgitte G; Kroman, Niels; Williams, Helene

2013-01-01

INTRODUCTION: Breast cancer is common among Danish women with more than 4,100 new cases annually. In 2008 the concept of fast-track surgery was introduced at the Department of Breast Surgery at Rigshospitalet, Copenhagen. The aim of this study is to describe the new clinical pathway for breast...... to provide immediate advice and support. CONCLUSION: The results confirm that a short stay can be successfully carried out for breast cancer patients. Implementing the fast-track programme involved the introduction of a clear clinical pathway for the patients and more effective daily routines. Patients felt...... cancer patients after implementation of a fast-track surgery programme. MATERIAL AND METHODS: A clinical pathway of all involved disciplines was developed including anaesthetic, analgesics, nausea and vomiting, drain and wound management, discharge assessment and psychosocial support. RESULTS...

Fast Track Finding in the ILC's Silicon Detector, SiD01

International Nuclear Information System (INIS)

Baker, David E.

2007-01-01

A fast track finder is presented which, unlike its more efficient, more computationally costly O(n3) time counterparts, tracks particles in O(n) time (for n being the number of hits). Developed as a tool for processing data from the ILC's proposed SiD detector, development of this fast track finder began with that proposed by Pablo Yepes in 1996 and adjusted to accommodate the changes in geometry of the SiD detector. First, space within the detector is voxellated, with hits assigned to voxels according to their r, φ, and η coordinates. A hit on the outermost layer is selected, and a 'sample space' is built from the hits in the selected hit's surrounding voxels. The hit in the sample space with the smallest distance to the first is then selected, and the sample space recalculated for this hit. This process continues until the list of hits becomes large enough, at which point the helical circle in the x, y plane is conformally mapped to a line in the x', y' plane, and hits are chosen from the sample spaces of the previous fit by selecting the hits which fit a line to the previously selected points with the smallest χ 2 . Track finding terminates when the innermost layer has been reached or no hit in the sample space fits those previously selected to an acceptable χ 2 . Again, a hit on the outermost layer is selected and the process repeats until no assignable hits remain. The algorithm proved to be very efficient on artificial diagnostic events, such as one hundred muons scattered at momenta of 1 GeV/c to 10 GeV/c. Unfortunately, when tracking simulated events corresponding to actual physics, the track finder's efficiency decreased drastically (mostly due to signal noise), though future data cleaning programs could noticeably increase its efficiency on these events

Short Hospital Stay after Laparoscopic Colorectal Surgery without Fast Track

DEFF Research Database (Denmark)

Burgdorf, Stefan K; Rosenberg, Jacob

2012-01-01

Purpose. Short hospital stay and equal or reduced complication rates have been demonstrated after fast track open colonic surgery. However, fast track principles of perioperative care can be difficult to implement and often require increased nursing staff because of more concentrated nursing tasks...... care, that is, without implementing fast track principles, on length of stay after colorectal resection for cancer. Methods. Records of all patients operated for colorectal cancer from November 2004 to December 2008 in our department were reviewed. No specific patients were selected for laparoscopic...... in our department resulted in shorter hospital stay without using fast track principles for peri- and postoperative care in patients not receiving a stoma during the operation. Consequently, we aimed to reduce hospitalisation without increasing cost in nursing staff per hospital bed. Length of stay...

Fast treatment plan modification with an over-relaxed Cimmino algorithm

International Nuclear Information System (INIS)

Wu Chuan; Jeraj, Robert; Lu Weiguo; Mackie, Thomas R.

2004-01-01

A method to quickly modify a treatment plan in adaptive radiotherapy was proposed and studied. The method is based on a Cimmino-type algorithm in linear programming. The fast convergence speed is achieved by over-relaxing the algorithm relaxation parameter from its sufficient convergence range of (0, 2) to (0, ∞). The algorithm parameters are selected so that the over-relaxed Cimmino (ORC) algorithm can effectively approximate an unconstrained re-optimization process in adaptive radiotherapy. To demonstrate the effectiveness and flexibility of the proposed method in adaptive radiotherapy, two scenarios with different organ motion/deformation of one nasopharyngeal case were presented with comparisons made between this method and the re-optimization method. In both scenarios, the ORC algorithm modified treatment plans have dose distributions that are similar to those given by the re-optimized treatment plans. It takes us using the ORC algorithm to finish a treatment plan modification at least three times faster than the re-optimization procedure compared

FPGA Online Tracking Algorithm for the PANDA Straw Tube Tracker

Science.gov (United States)

Liang, Yutie; Ye, Hua; Galuska, Martin J.; Gessler, Thomas; Kuhn, Wolfgang; Lange, Jens Soren; Wagner, Milan N.; Liu, Zhen'an; Zhao, Jingzhou

2017-06-01

A novel FPGA based online tracking algorithm for helix track reconstruction in a solenoidal field, developed for the PANDA spectrometer, is described. Employing the Straw Tube Tracker detector with 4636 straw tubes, the algorithm includes a complex track finder, and a track fitter. Implemented in VHDL, the algorithm is tested on a Xilinx Virtex-4 FX60 FPGA chip with different types of events, at different event rates. A processing time of 7 $\\mu$s per event for an average of 6 charged tracks is obtained. The momentum resolution is about 3\\% (4\\%) for $p_t$ ($p_z$) at 1 GeV/c. Comparing to the algorithm running on a CPU chip (single core Intel Xeon E5520 at 2.26 GHz), an improvement of 3 orders of magnitude in processing time is obtained. The algorithm can handle severe overlapping of events which are typical for interaction rates above 10 MHz.

Computationally Efficient DOA Tracking Algorithm in Monostatic MIMO Radar with Automatic Association

Directory of Open Access Journals (Sweden)

Huaxin Yu

2014-01-01

Full Text Available We consider the problem of tracking the direction of arrivals (DOA of multiple moving targets in monostatic multiple-input multiple-output (MIMO radar. A low-complexity DOA tracking algorithm in monostatic MIMO radar is proposed. The proposed algorithm obtains DOA estimation via the difference between previous and current covariance matrix of the reduced-dimension transformation signal, and it reduces the computational complexity and realizes automatic association in DOA tracking. Error analysis and Cramér-Rao lower bound (CRLB of DOA tracking are derived in the paper. The proposed algorithm not only can be regarded as an extension of array-signal-processing DOA tracking algorithm in (Zhang et al. (2008, but also is an improved version of the DOA tracking algorithm in (Zhang et al. (2008. Furthermore, the proposed algorithm has better DOA tracking performance than the DOA tracking algorithm in (Zhang et al. (2008. The simulation results demonstrate effectiveness of the proposed algorithm. Our work provides the technical support for the practical application of MIMO radar.

Models and Algorithms for Tracking Target with Coordinated Turn Motion

Directory of Open Access Journals (Sweden)

Xianghui Yuan

2014-01-01

Full Text Available Tracking target with coordinated turn (CT motion is highly dependent on the models and algorithms. First, the widely used models are compared in this paper—coordinated turn (CT model with known turn rate, augmented coordinated turn (ACT model with Cartesian velocity, ACT model with polar velocity, CT model using a kinematic constraint, and maneuver centered circular motion model. Then, in the single model tracking framework, the tracking algorithms for the last four models are compared and the suggestions on the choice of models for different practical target tracking problems are given. Finally, in the multiple models (MM framework, the algorithm based on expectation maximization (EM algorithm is derived, including both the batch form and the recursive form. Compared with the widely used interacting multiple model (IMM algorithm, the EM algorithm shows its effectiveness.

Fast-track Orthognathic Surgery: An Evidence-based Review

Science.gov (United States)

Otero, Joel Joshi; Detriche, Olivier; Mommaerts, Maurice Yves

2017-01-01

The aim of this study was to establish a fast-track protocol for bimaxillary orthognathic surgery (OGS). Fast-track surgery (FTS) is a multidisciplinary approach where the pre-, intra-, and postoperative management is focusing maximally on a quick patient recovery and early discharge. To enable this, the patients’ presurgical stress and postsurgical discomfort should be maximally reduced. Both referral patterns and expenses within the health-care system are positively influenced by FTS. University hospital-literature review through Medline, Embase, and the Cochrane Library (January 2000–July 2016) using the following words – “fast track, enhanced recovery, multimodal, and perioperative care” – to define a protocol evidence based for OGS, as well as evidenced-based medicine search of every term added to the protocol during the same period. The process has resulted in an OGS protocol that may improve the outcome of the patient through several nonoperative and operative measures such as preoperative patient education and intra/postoperative measures that should improve overall patient satisfaction, decrease morbidity such as postoperative nausea, headache, dizziness, pain, and intubation discomfort, and shorten hospital stay. A literature review allowed us to fine-tune a fast-track protocol for uncomplicated OGS that can be prospectively studied against currently applied ones. PMID:29264281

Optimization in radiotherapy treatment planning thanks to a fast dose calculation method

International Nuclear Information System (INIS)

Yang, Mingchao

2014-01-01

This thesis deals with the radiotherapy treatments planning issue which need a fast and reliable treatment planning system (TPS). The TPS is composed of a dose calculation algorithm and an optimization method. The objective is to design a plan to deliver the dose to the tumor while preserving the surrounding healthy and sensitive tissues. The treatment planning aims to determine the best suited radiation parameters for each patient's treatment. In this thesis, the parameters of treatment with IMRT (Intensity modulated radiation therapy) are the beam angle and the beam intensity. The objective function is multi-criteria with linear constraints. The main objective of this thesis is to demonstrate the feasibility of a treatment planning optimization method based on a fast dose-calculation technique developed by (Blanpain, 2009). This technique proposes to compute the dose by segmenting the patient's phantom into homogeneous meshes. The dose computation is divided into two steps. The first step impacts the meshes: projections and weights are set according to physical and geometrical criteria. The second step impacts the voxels: the dose is computed by evaluating the functions previously associated to their mesh. A reformulation of this technique makes possible to solve the optimization problem by the gradient descent algorithm. The main advantage of this method is that the beam angle parameters could be optimized continuously in 3 dimensions. The obtained results in this thesis offer many opportunities in the field of radiotherapy treatment planning optimization. (author) [fr

Evidence Basis for Regional Anesthesia in Multidisciplinary Fast-Track Surgical Care Pathways

DEFF Research Database (Denmark)

Carli, Francesco; Kehlet, Henrik; Baldini, Gabriele

2011-01-01

Fast-track programs have been developed with the aim to reduce perioperative surgical stress and facilitate patient's recovery after surgery. Potentially, regional anesthesia and analgesia techniques may offer physiological advantages to support fast-track methodologies in different type...... of surgeries. The aim of this article was to identify and discuss potential advantages offerred by regional anesthesia and analgesia techniques to fast-track programs. In the first section, the impact of regional anesthesia on the main elements of fast-track surgery is addressed. In the second section......, procedure-specific fast-track programs for colorectal, hernia, esophageal, cardiac, vascular, and orthopedic surgeries are presented. For each, regional anesthesia and analgesia techniques more frequently used are discussed. Furthermore, clinical studies, which included regional techniques as elements...

Testbeam results of the first real-time embedded tracking system with artificial retina

Energy Technology Data Exchange (ETDEWEB)

Neri, N., E-mail: nicola.neri@mi.infn.it; Abba, A.; Caponio, F.; Citterio, M.; Coelli, S.; Fu, J.; Merli, A.; Monti, M.; Petruzzo, M.

2017-02-11

We present the testbeam results of the first real-time embedded tracking system based on artificial retina algorithm. The tracking system prototype is capable of fast track reconstruction with a latency of the response below 1 μs and track parameter resolutions that are comparable with the offline results. The artificial retina algorithm was implemented in hardware in a custom data acquisition board based on commercial FPGA. The system was tested successfully using a 180 GeV/c proton beam at the CERN SPS with a maximum track rate of about 280 kHz. Online track parameters were found in good agreement with offline results and with the simulated response. - Highlights: • First real-time tracking system based on artificial retina algorithm tested on beam. • Fast track reconstruction within one microsecond latency and offline like quality. • Fast tracking algorithm implemented in commercial FPGAs.

Superficial dose evaluation of four dose calculation algorithms

Science.gov (United States)

Cao, Ying; Yang, Xiaoyu; Yang, Zhen; Qiu, Xiaoping; Lv, Zhiping; Lei, Mingjun; Liu, Gui; Zhang, Zijian; Hu, Yongmei

2017-08-01

Accurate superficial dose calculation is of major importance because of the skin toxicity in radiotherapy, especially within the initial 2 mm depth being considered more clinically relevant. The aim of this study is to evaluate superficial dose calculation accuracy of four commonly used algorithms in commercially available treatment planning systems (TPS) by Monte Carlo (MC) simulation and film measurements. The superficial dose in a simple geometrical phantom with size of 30 cm×30 cm×30 cm was calculated by PBC (Pencil Beam Convolution), AAA (Analytical Anisotropic Algorithm), AXB (Acuros XB) in Eclipse system and CCC (Collapsed Cone Convolution) in Raystation system under the conditions of source to surface distance (SSD) of 100 cm and field size (FS) of 10×10 cm2. EGSnrc (BEAMnrc/DOSXYZnrc) program was performed to simulate the central axis dose distribution of Varian Trilogy accelerator, combined with measurements of superficial dose distribution by an extrapolation method of multilayer radiochromic films, to estimate the dose calculation accuracy of four algorithms in the superficial region which was recommended in detail by the ICRU (International Commission on Radiation Units and Measurement) and the ICRP (International Commission on Radiological Protection). In superficial region, good agreement was achieved between MC simulation and film extrapolation method, with the mean differences less than 1%, 2% and 5% for 0°, 30° and 60°, respectively. The relative skin dose errors were 0.84%, 1.88% and 3.90%; the mean dose discrepancies (0°, 30° and 60°) between each of four algorithms and MC simulation were (2.41±1.55%, 3.11±2.40%, and 1.53±1.05%), (3.09±3.00%, 3.10±3.01%, and 3.77±3.59%), (3.16±1.50%, 8.70±2.84%, and 18.20±4.10%) and (14.45±4.66%, 10.74±4.54%, and 3.34±3.26%) for AXB, CCC, AAA and PBC respectively. Monte Carlo simulation verified the feasibility of the superficial dose measurements by multilayer Gafchromic films. And the rank

A Fast Algorithm to Simulate Droplet Motions in Oil/Water Two Phase Flow

KAUST Repository

Zhang, Tao

2017-06-09

To improve the research methods in petroleum industry, we develop a fast algorithm to simulate droplet motions in oil and water two phase flow, using phase field model to describe the phase distribution in the flow process. An efficient partial difference equation solver—Shift-Matrix method is applied here, to speed up the calculation coding in high-level language, i.e. Matlab and R. An analytical solution of order parameter is derived, to define the initial condition of phase distribution. The upwind scheme is applied in our algorithm, to make it energy decay stable, which results in the fast speed of calculation. To make it more clear and understandable, we provide the specific code for forming the coefficient matrix used in Shift-Matrix Method. Our algorithm is compared with other methods in different scales, including Front Tracking and VOSET method in macroscopic and LBM method using RK model in mesoscopic scale. In addition, we compare the result of droplet motion under gravity using our algorithm with the empirical formula common used in industry. The result proves the high efficiency and robustness of our algorithm and it’s then used to simulate the motions of multiple droplets under gravity and cross-direction forces, which is more practical in industry and can be extended to wider application.

A constrained tracking algorithm to optimize plug patterns in multiple isocenter Gamma Knife radiosurgery planning

International Nuclear Information System (INIS)

Li Kaile; Ma Lijun

2005-01-01

We developed a source blocking optimization algorithm for Gamma Knife radiosurgery, which is based on tracking individual source contributions to arbitrarily shaped target and critical structure volumes. A scalar objective function and a direct search algorithm were used to produce near real-time calculation results. The algorithm allows the user to set and vary the total number of plugs for each shot to limit the total beam-on time. We implemented and tested the algorithm for several multiple-isocenter Gamma Knife cases. It was found that the use of limited number of plugs significantly lowered the integral dose to the critical structures such as an optical chiasm in pituitary adenoma cases. The main effect of the source blocking is the faster dose falloff in the junction area between the target and the critical structure. In summary, we demonstrated a useful source-plugging algorithm for improving complex multi-isocenter Gamma Knife treatment planning cases

A fast fractional difference algorithm

DEFF Research Database (Denmark)

Jensen, Andreas Noack; Nielsen, Morten Ørregaard

2014-01-01

We provide a fast algorithm for calculating the fractional difference of a time series. In standard implementations, the calculation speed (number of arithmetic operations) is of order T 2, where T is the length of the time series. Our algorithm allows calculation speed of order T log...

A Fast Fractional Difference Algorithm

DEFF Research Database (Denmark)

Jensen, Andreas Noack; Nielsen, Morten Ørregaard

We provide a fast algorithm for calculating the fractional difference of a time series. In standard implementations, the calculation speed (number of arithmetic operations) is of order T 2, where T is the length of the time series. Our algorithm allows calculation speed of order T log...

Safety of fast track surgery in pancreaticoduodenectomy: a Meta-analysis

Directory of Open Access Journals (Sweden)

LI Weinan

2017-01-01

Full Text Available ObjectiveTo investigate the safety and clinical effect of fast track surgery in pancreaticoduodenectomy, one of the most complex surgeries in general surgery. MethodsThe Chinese and foreign databases were searched for articles on the application of fast tract surgery in pancreaticoduodenectomy published from January 1994 to April 2016. Two researchers evaluated the quality of the articles which met the inclusion criteria and extracted related data. Stata 12.0 software was used to analyze the overall incidence rate of complications and the incidence rates of pancreatic leakage and gastrointestinal emptying disorder, and the Begg rank correlation test and Egger linear regression method were used to investigate publication bias. ResultsThe fast track surgery group had a significantly lower overall incidence rate of complications than the conventional group (RR=0.748, 95%CI: 0.680-0.824, P＜0.001. There was no significant difference in the incidence rate of pancreatic leakage between the two groups (RR=0.894, 95%CI:0.734-1.089, P=0.266. The fast track surgery group had a significantly lower incidence rate of gastrointestinal emptying disorder than the conventional group (RR=0.520, 95%CI:0.400-0.670, P＜0.001. ConclusionFast track surgery is safe and effective in pancreaticoduodenectomy, but the application of some measures in fast track surgery still needs more medical evidence.

Two-dimensional pencil beam scaling: an improved proton dose algorithm for heterogeneous media

International Nuclear Information System (INIS)

Szymanowski, Hanitra; Oelfke, Uwe

2002-01-01

New dose delivery techniques with proton beams, such as beam spot scanning or raster scanning, require fast and accurate dose algorithms which can be applied for treatment plan optimization in clinically acceptable timescales. The clinically required accuracy is particularly difficult to achieve for the irradiation of complex, heterogeneous regions of the patient's anatomy. Currently applied fast pencil beam dose calculations based on the standard inhomogeneity correction of pathlength scaling often cannot provide the accuracy required for clinically acceptable dose distributions. This could be achieved with sophisticated Monte Carlo simulations which are still unacceptably time consuming for use as dose engines in optimization calculations. We therefore present a new algorithm for proton dose calculations which aims to resolve the inherent problem between calculation speed and required clinical accuracy. First, a detailed derivation of the new concept, which is based on an additional scaling of the lateral proton fluence is provided. Then, the newly devised two-dimensional (2D) scaling method is tested for various geometries of different phantom materials. These include standard biological tissues such as bone, muscle and fat as well as air. A detailed comparison of the new 2D pencil beam scaling with the current standard pencil beam approach and Monte Carlo simulations, performed with GEANT, is presented. It was found that the new concept proposed allows calculation of absorbed dose with an accuracy almost equal to that achievable with Monte Carlo simulations while requiring only modestly increased calculation times in comparison to the standard pencil beam approach. It is believed that this new proton dose algorithm has the potential to significantly improve the treatment planning outcome for many clinical cases encountered in highly conformal proton therapy. (author)

A New Track Reconstruction Algorithm suitable for Parallel Processing based on Hit Triplets and Broken Lines

Directory of Open Access Journals (Sweden)

Schöning André

2016-01-01

Full Text Available Track reconstruction in high track multiplicity environments at current and future high rate particle physics experiments is a big challenge and very time consuming. The search for track seeds and the fitting of track candidates are usually the most time consuming steps in the track reconstruction. Here, a new and fast track reconstruction method based on hit triplets is proposed which exploits a three-dimensional fit model including multiple scattering and hit uncertainties from the very start, including the search for track seeds. The hit triplet based reconstruction method assumes a homogeneous magnetic field which allows to give an analytical solutions for the triplet fit result. This method is highly parallelizable, needs fewer operations than other standard track reconstruction methods and is therefore ideal for the implementation on parallel computing architectures. The proposed track reconstruction algorithm has been studied in the context of the Mu3e-experiment and a typical LHC experiment.

Dose Calculation Accuracy of the Monte Carlo Algorithm for CyberKnife Compared with Other Commercially Available Dose Calculation Algorithms

International Nuclear Information System (INIS)

Sharma, Subhash; Ott, Joseph; Williams, Jamone; Dickow, Danny

2011-01-01

Monte Carlo dose calculation algorithms have the potential for greater accuracy than traditional model-based algorithms. This enhanced accuracy is particularly evident in regions of lateral scatter disequilibrium, which can develop during treatments incorporating small field sizes and low-density tissue. A heterogeneous slab phantom was used to evaluate the accuracy of several commercially available dose calculation algorithms, including Monte Carlo dose calculation for CyberKnife, Analytical Anisotropic Algorithm and Pencil Beam convolution for the Eclipse planning system, and convolution-superposition for the Xio planning system. The phantom accommodated slabs of varying density; comparisons between planned and measured dose distributions were accomplished with radiochromic film. The Monte Carlo algorithm provided the most accurate comparison between planned and measured dose distributions. In each phantom irradiation, the Monte Carlo predictions resulted in gamma analysis comparisons >97%, using acceptance criteria of 3% dose and 3-mm distance to agreement. In general, the gamma analysis comparisons for the other algorithms were <95%. The Monte Carlo dose calculation algorithm for CyberKnife provides more accurate dose distribution calculations in regions of lateral electron disequilibrium than commercially available model-based algorithms. This is primarily because of the ability of Monte Carlo algorithms to implicitly account for tissue heterogeneities, density scaling functions; and/or effective depth correction factors are not required.

FPGA helix tracking algorithm for PANDA

Energy Technology Data Exchange (ETDEWEB)

Liang, Yutie; Galuska, Martin; Gessler, Thomas; Hu, Jifeng; Kuehn, Wolfgang; Lange, Jens Soeren; Muenchow, David; Spruck, Bjoern [II. Physikalisches, Giessen University (Germany); Ye, Hua [II. Physikalisches, Giessen University (Germany); Institute of High Energy Physics, Beijing (China); Collaboration: PANDA-Collaboration

2014-07-01

The PANDA detector is a general-purpose detector for physics with high luminosity cooled antiproton beams, planed to operate at the FAIR facility in Darmstadt, Germany. The central detector includes a silicon Micro Vertex Detector (MVD) and a Straw Tube Tracker (STT). Without any hardware trigger, large amounts of raw data are streaming into the data acquisition system. The data reduction task is performed in the online system by reconstruction algorithms programmed in VHDL (Very High Speed Integrated Circuit Hardware Description Language) on FPGAs (Field Programmable Gate Arrays) as first level and on a farm of GPUs or PCs as a second level. One important part in the system is the online track reconstruction. In this presentation, an online tracking finding algorithm for helix track reconstruction in the solenoidal field is shown. A performance study using C++ and the status of the VHDL implementation are presented.

Bilateral simultaneous total hip arthroplasty in a fast track setting

DEFF Research Database (Denmark)

Otte, Kristian S; Husted, Henrik; Ørsnes, Thue

2011-01-01

and low complication rates when performed in a fast-track setting. We believed it would be useful to assess hip arthroplasty in this context, and we report 50 consecutive fast-track simultaneous bilateral hip arthroplasty procedures. The median length of stay was 4 days. Mortality within 90 days was 4......% and 8% required a further operative procedure. The overall complication rate was 22%. 55% of the complications were considered to be caused by failures in surgical technique and 45% by other factors. Bilateral simultaneous hip arthroplasty may have a high complication rate in a fast-track setting...

Fast decoding algorithms for geometric coded apertures

International Nuclear Information System (INIS)

Byard, Kevin

2015-01-01

Fast decoding algorithms are described for the class of coded aperture designs known as geometric coded apertures which were introduced by Gourlay and Stephen. When compared to the direct decoding method, the algorithms significantly reduce the number of calculations required when performing the decoding for these apertures and hence speed up the decoding process. Experimental tests confirm the efficacy of these fast algorithms, demonstrating a speed up of approximately two to three orders of magnitude over direct decoding.

Radiation dose of CT coronary angiography in clinical practice: Objective evaluation of strategies for dose optimization

International Nuclear Information System (INIS)

Yerramasu, Ajay; Venuraju, Shreenidhi; Atwal, Satvir; Goodman, Dennis; Lipkin, David; Lahiri, Avijit

2012-01-01

Background: CT coronary angiography (CTCA) is an evolving modality for the diagnosis of coronary artery disease. Radiation burden associated with CTCA has been a major concern in the wider application of this technique. It is important to reduce the radiation dose without compromising the image quality. Objectives: To estimate the radiation dose of CTCA in clinical practice and evaluate the effect of dose-saving algorithms on radiation dose and image quality. Methods: Effective radiation dose was measured from the dose-length product in 616 consecutive patients (mean age 58 ± 12 years; 70% males) who underwent clinically indicated CTCA at our institution over 1 year. Image quality was assessed subjectively using a 4-point scale and objectively by measuring the signal- and contrast-to-noise ratios in the coronary arteries. Multivariate linear regression analysis was used to identify factors independently associated with radiation dose. Results: Mean effective radiation dose of CTCA was 6.6 ± 3.3 mSv. Radiation dose was significantly reduced by dose saving algorithms such as 100 kV imaging (−47%; 95% CI, −44% to −50%), prospective gating (−35%; 95% CI, −29% to −40%) and ECG controlled tube current modulation (−23%; 95% CI, −9% to −34%). None of the dose saving algorithms were associated with a significant reduction in mean image quality or the frequency of diagnostic scans (P = non-significant for all comparisons). Conclusion: Careful application of radiation-dose saving algorithms in appropriately selected patients can reduce the radiation burden of CTCA significantly, without compromising the image quality.

Evaluation of dose calculation algorithms using the treatment planning system Xi O with tissue heterogeneity correction turned on

International Nuclear Information System (INIS)

Fairbanks, Leandro R.; Barbi, Gustavo L.; Silva, Wiliam T.; Reis, Eduardo G.F.; Borges, Leandro F.; Bertucci, Edenyse C.; Maciel, Marina F.; Amaral, Leonardo L.

2011-01-01

Since the cross-section for various radiation interactions is dependent upon tissue material, the presence of heterogeneities affects the final dose delivered. This paper aims to analyze how different treatment planning algorithms (Fast Fourier Transform, Convolution, Superposition, Fast Superposition and Clarkson) work when heterogeneity corrections are used. To that end, a farmer-type ionization chamber was positioned reproducibly (during the time of CT as well as irradiation) inside several phantoms made of aluminum, bone, cork and solid water slabs. The percent difference between the dose measured and calculated by the various algorithms was less than 5%.The convolution method shows better results for high density materials (difference ∼1 %), whereas the Superposition algorithm is more accurate for low densities (around 1,1%). (author)

Fast compact algorithms and software for spline smoothing

CERN Document Server

Weinert, Howard L

2012-01-01

Fast Compact Algorithms and Software for Spline Smoothing investigates algorithmic alternatives for computing cubic smoothing splines when the amount of smoothing is determined automatically by minimizing the generalized cross-validation score. These algorithms are based on Cholesky factorization, QR factorization, or the fast Fourier transform. All algorithms are implemented in MATLAB and are compared based on speed, memory use, and accuracy. An overall best algorithm is identified, which allows very large data sets to be processed quickly on a personal computer.

Care principles at four fast-track arthroplasty departments in Denmark

DEFF Research Database (Denmark)

Husted, Henrik; Solgaard, Søren; Hansen, Torben B

2010-01-01

The goal of this study was to describe the logistic and clinical set-up at four Danish arthroplasty departments offering fast-track surgery.......The goal of this study was to describe the logistic and clinical set-up at four Danish arthroplasty departments offering fast-track surgery....

SU-E-T-806: Very Fast GPU-Based IMPT Dose Computation

Energy Technology Data Exchange (ETDEWEB)

Sullivan, A; Brand, M [Mitsubishi Electric Research Lab, Cambridge, MA (United States)

2015-06-15

Purpose: Designing particle therapy treatment plans is a dosimetrist-in-the-loop optimization wherein the conflicting constraints of achieving a desired tumor dose distribution must be balanced against the need to minimize the dose to nearby OARs. IMPT introduces an additional, inner, numerical optimization step in which the dosimetrist’s current set of constraints are used to determine the weighting of beam spots. Very fast dose calculations are needed to enable the dosimetrist to perform many iterations of the outer optimization in a commercially reasonable time. Methods: We have developed a GPU-based convolution-type dose computation algorithm that more accurately handles heterogeneities than earlier algorithms by redistributing energy from dose computed in a water volume. The depth dependence of the beam size is handled by pre-processing Bragg curves using a weighted superposition of Gaussian bases. Additionally, scattering, the orientation of treatment ports, and the non-parallel propagation of beams are handled by large, but sparse, energy-redistribution matrices that implement affine transforms. Results: We tested our algorithm using a brain tumor dataset with 1 mm voxels and a single treatment port from the patient’s anterior through the sinuses. The resulting dose volume is 100 × 100 × 230 mm with 66,200 beam spots on a 3 × 3 × 2 mm grid. The dose computation takes <1 msec on a GeForce GTX Titan GPU with the Gamma passing rate for 2mm/2% criterion of 99.1% compared to dose calculated by an alternative dose algorithm based on pencil beams. We will present comparisons to Monte Carlo dose calculations. Conclusion: Our high-speed dose computation method enables the IMPT spot weights to be optimized in <1 second, resulting in a nearly instantaneous response to user changes to dose constraints. This permits the creation of higher quality plans by allowing the dosimetrist to evaluate more alternatives in a short period of time.

ATLAS FTK Fast Track Trigger

CERN Document Server

Iizawa, T; The ATLAS collaboration

2014-01-01

The Fast TracKer (FTK) will perform global track reconstruction after each Level-1 trigger accept signal to enable the software-based higher level trigger to have early access to tracking information. FTK is a dedicated processor based on a mixture of advanced technologies. Modern, powerful Field Programmable Gate Arrays (FPGAs) form an important part of the system architecture, and the large level of computing power required for pattern recognition is provided by incorporating standard-cell ASICs named Associative Memory (AM). Motivation and the architecture of the FTK system will be presented, and the status of hardware and simulation will be following.

Nursing care in fast-track surgery strategy

Directory of Open Access Journals (Sweden)

Dorota Kozieł

2015-10-01

Full Text Available In recent years, many study results have been published confirming an improvement in the outcomes of treatment related with management of patients within the fast-track surgery programme. Early postoperative rehabilitation is possible provided there is engagement of a multi-disciplinary team, including well-educated nurses. Today, a diversion can be observed from traditional nursing on behalf of a coordinated, holistic approach, while more attention is paid to the, thus far marginalised, psychosocial aspects of care. The objective of the study is to discuss the basic assumptions of fast track surgery with respect to nursing care, with particular emphasis placed on the educational function. Modern nursing within the short-track surgery programme should focus on the provision of patients with care consisting of preliminary information concerning the perioperative period, social and psychological support, counselling in the area of home convalescence, and procedures in the case of complications.

Microdosimetry calculations for monoenergetic electrons using Geant4-DNA combined with a weighted track sampling algorithm.

Science.gov (United States)

Famulari, Gabriel; Pater, Piotr; Enger, Shirin A

2017-07-07

The aim of this study was to calculate microdosimetric distributions for low energy electrons simulated using the Monte Carlo track structure code Geant4-DNA. Tracks for monoenergetic electrons with kinetic energies ranging from 100 eV to 1 MeV were simulated in an infinite spherical water phantom using the Geant4-DNA extension included in Geant4 toolkit version 10.2 (patch 02). The microdosimetric distributions were obtained through random sampling of transfer points and overlaying scoring volumes within the associated volume of the tracks. Relative frequency distributions of energy deposition f(>E)/f(>0) and dose mean lineal energy ([Formula: see text]) values were calculated in nanometer-sized spherical and cylindrical targets. The effects of scoring volume and scoring techniques were examined. The results were compared with published data generated using MOCA8B and KURBUC. Geant4-DNA produces a lower frequency of higher energy deposits than MOCA8B. The [Formula: see text] values calculated with Geant4-DNA are smaller than those calculated using MOCA8B and KURBUC. The differences are mainly due to the lower ionization and excitation cross sections of Geant4-DNA for low energy electrons. To a lesser extent, discrepancies can also be attributed to the implementation in this study of a new and fast scoring technique that differs from that used in previous studies. For the same mean chord length ([Formula: see text]), the [Formula: see text] calculated in cylindrical volumes are larger than those calculated in spherical volumes. The discrepancies due to cross sections and scoring geometries increase with decreasing scoring site dimensions. A new set of [Formula: see text] values has been presented for monoenergetic electrons using a fast track sampling algorithm and the most recent physics models implemented in Geant4-DNA. This dataset can be combined with primary electron spectra to predict the radiation quality of photon and electron beams.

Decontaminate feature for tracking: adaptive tracking via evolutionary feature subset

Science.gov (United States)

Liu, Qiaoyuan; Wang, Yuru; Yin, Minghao; Ren, Jinchang; Li, Ruizhi

2017-11-01

Although various visual tracking algorithms have been proposed in the last 2-3 decades, it remains a challenging problem for effective tracking with fast motion, deformation, occlusion, etc. Under complex tracking conditions, most tracking models are not discriminative and adaptive enough. When the combined feature vectors are inputted to the visual models, this may lead to redundancy causing low efficiency and ambiguity causing poor performance. An effective tracking algorithm is proposed to decontaminate features for each video sequence adaptively, where the visual modeling is treated as an optimization problem from the perspective of evolution. Every feature vector is compared to a biological individual and then decontaminated via classical evolutionary algorithms. With the optimized subsets of features, the "curse of dimensionality" has been avoided while the accuracy of the visual model has been improved. The proposed algorithm has been tested on several publicly available datasets with various tracking challenges and benchmarked with a number of state-of-the-art approaches. The comprehensive experiments have demonstrated the efficacy of the proposed methodology.

Multi-User Identification-Based Eye-Tracking Algorithm Using Position Estimation

Directory of Open Access Journals (Sweden)

Suk-Ju Kang

2016-12-01

Full Text Available This paper proposes a new multi-user eye-tracking algorithm using position estimation. Conventional eye-tracking algorithms are typically suitable only for a single user, and thereby cannot be used for a multi-user system. Even though they can be used to track the eyes of multiple users, their detection accuracy is low and they cannot identify multiple users individually. The proposed algorithm solves these problems and enhances the detection accuracy. Specifically, the proposed algorithm adopts a classifier to detect faces for the red, green, and blue (RGB and depth images. Then, it calculates features based on the histogram of the oriented gradient for the detected facial region to identify multiple users, and selects the template that best matches the users from a pre-determined face database. Finally, the proposed algorithm extracts the final eye positions based on anatomical proportions. Simulation results show that the proposed algorithm improved the average F1 score by up to 0.490, compared with benchmark algorithms.

Articulated Human Motion Tracking Using Sequential Immune Genetic Algorithm

Directory of Open Access Journals (Sweden)

Yi Li

2013-01-01

Full Text Available We formulate human motion tracking as a high-dimensional constrained optimization problem. A novel generative method is proposed for human motion tracking in the framework of evolutionary computation. The main contribution is that we introduce immune genetic algorithm (IGA for pose optimization in latent space of human motion. Firstly, we perform human motion analysis in the learnt latent space of human motion. As the latent space is low dimensional and contents the prior knowledge of human motion, it makes pose analysis more efficient and accurate. Then, in the search strategy, we apply IGA for pose optimization. Compared with genetic algorithm and other evolutionary methods, its main advantage is the ability to use the prior knowledge of human motion. We design an IGA-based method to estimate human pose from static images for initialization of motion tracking. And we propose a sequential IGA (S-IGA algorithm for motion tracking by incorporating the temporal continuity information into the traditional IGA. Experimental results on different videos of different motion types show that our IGA-based pose estimation method can be used for initialization of motion tracking. The S-IGA-based motion tracking method can achieve accurate and stable tracking of 3D human motion.

Which fast track elements predict early recovery after colon cancer surgery?

NARCIS (Netherlands)

Vlug, M. S.; Bartels, S. A. L.; Wind, J.; Ubbink, D. T.; Hollmann, M. W.; Bemelman, W. A.; Sprangers, Mirjam; Preckel, Benedikt; Bossuyt, Patrick; Gouma, Dirk; van Berge Henegouwen, Mark; Fuhring, Jan; Lenthe, Ineke Picard-van; Bakker, Chris; King-Kalimanis, Bellinda; Hofland, Jan; Dejong, Cornelis; van Dam, Ronald; Cuesta, Miguel; van der Peet, Donald; van Zalingen, Edith; Noordhuis, Astrid; de Jong, Dick; Engel, Alexander; Goei, T. Hauwy; de Stoppelaar, Erica; van den Dongen, Marjon; van Wagensveld, Bart; van Tets, Willem; van den Elsen, Maarten; Swart, Annemiek; Gerhards, Michael; de Wit, Laurens; Siepel, Muriel; Molly, Glaresa; Gasthuis, Onze Lieve Vrouwe; van Geloven, Anna; Juttmann, Jan; Clevers, Wilfred; Bieleman, Andrea; van der Zaag, Edwin; Coenen, Ludo; Bonekamp, Elly; Cense, Huib; van Abeelen, Jacobus; van Iterson-de Jong, Diana; Krombeen, Margriet

2012-01-01

Aim It is questioned whether all separate fast track elements are essential for enhanced postoperative recovery. We aimed to determine which baseline characteristics and which fast track elements are independent predictors of faster postoperative recovery in patients undergoing resection for colon

First results of the silicon telescope using an 'artificial retina' for fast track finding

Energy Technology Data Exchange (ETDEWEB)

Neri, N. [Istituto Nazionale di Fisica Nucleare - INFN, Sezione di Milano, Milano (Italy); Abba, A.; Caponio, F.; Geraci, A.; Grizzuti, M.; Lusardi, N. [INFN Milano and Politecnico di Milano, Milano (Italy); Citterio, M.; Coelli, S.; Fu, J.; Monti, M.; Petruzzo, M. [INFN Milano, Milano (Italy); Bedeschi, F.; Ninci, D.; Piucci, A.; Spinella, F.; Walsh, J. [INFN Pisa, Pisa (Italy); Cenci, R.; Marino, P.; Morello, M. J.; Stracka, S. [INFN Pisa and Scuola Normale Superiore di Pisa, Pisa (Italy); Punzi, G. [INFN Pisa and Universita di Pisa, Pisa (Italy); Tonelli, D. [CERN, Geneva (Switzerland); Ristori, L. [INFN Pisa, Pisa (Italy); Fermilab, Batavia, Illinois (United States)

2015-07-01

We present the first results of the prototype of a silicon tracker with trigger capabilities based on a novel approach for fast track finding. The working principle of the 'artificial retina' is inspired by the processing of visual images by the brain and it is based on extensive parallelization of data distribution and pattern recognition. The algorithm has been implemented in commercial FPGAs in three main logic modules: a switch for the routing of the detector hits, a pool of engines for the digital processing of the hits, and a block for the calculation of the track parameters. The architecture is fully pipelined and allows the reconstruction of real-time tracks with a latency less then 100 clock cycles, corresponding to 0.25 microsecond at 400 MHz clock. The silicon telescope consists of 8 layers of single-sided silicon strip detectors with 512 strips each. The detector size is about 10 cm x 10 cm and the strip pitch is 183 μm. The detectors are read out by the Beetle chip, a custom ASICs developed for LHCb, which provides the measurement of the hit position and pulse height of 128 channels. The 'artificial retina' algorithm has been implemented on custom data acquisition boards based on FPGAs Xilinx Kintex 7 lx160. The parameters of the tracks detected are finally transferred to host PC via USB 3.0. The boards manage the read-out ASICs and the sampling of the analog channels. The read-out is performed at 40 MHz on 4 channels for each ASIC that corresponds to a decoding of the telescope information at 1.1 MHz. We report on the first results of the fast tracking device and compare with simulations. (authors)

A novel robust and efficient algorithm for charge particle tracking in high background flux

International Nuclear Information System (INIS)

Fanelli, C; Cisbani, E; Dotto, A Del

2015-01-01

The high luminosity that will be reached in the new generation of High Energy Particle and Nuclear physics experiments implies large high background rate and large tracker occupancy, representing therefore a new challenge for particle tracking algorithms. For instance, at Jefferson Laboratory (JLab) (VA,USA), one of the most demanding experiment in this respect, performed with a 12 GeV electron beam, is characterized by a luminosity up to 10 39 cm -2 s -1 . To this scope, Gaseous Electron Multiplier (GEM) based trackers are under development for a new spectrometer that will operate at these high rates in the Hall A of JLab. Within this context, we developed a new tracking algorithm, based on a multistep approach: (i) all hardware - time and charge - information are exploited to minimize the number of hits to associate; (ii) a dedicated Neural Network (NN) has been designed for a fast and efficient association of the hits measured by the GEM detector; (iii) the measurements of the associated hits are further improved in resolution through the application of Kalman filter and Rauch- Tung-Striebel smoother. The algorithm is shortly presented along with a discussion of the promising first results. (paper)

A Fast General-Purpose Clustering Algorithm Based on FPGAs for High-Throughput Data Processing

CERN Document Server

Annovi, A; The ATLAS collaboration; Castegnaro, A; Gatta, M

2012-01-01

We present a fast general-purpose algorithm for high-throughput clustering of data ”with a two dimensional organization”. The algorithm is designed to be implemented with FPGAs or custom electronics. The key feature is a processing time that scales linearly with the amount of data to be processed. This means that clustering can be performed in pipeline with the readout, without suffering from combinatorial delays due to looping multiple times through all the data. This feature makes this algorithm especially well suited for problems where the data has high density, e.g. in the case of tracking devices working under high-luminosity condition such as those of LHC or Super-LHC. The algorithm is organized in two steps: the first step (core) clusters the data; the second step analyzes each cluster of data to extract the desired information. The current algorithm is developed as a clustering device for modern high-energy physics pixel detectors. However, the algorithm has much broader field of applications. In ...

Multiple Object Tracking Using the Shortest Path Faster Association Algorithm

Directory of Open Access Journals (Sweden)

Zhenghao Xi

2014-01-01

Full Text Available To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time.

The fast tracker processor for hadron collider triggers

CERN Document Server

Annovi, A; Bardi, A; Carosi, R; Dell'Orso, Mauro; D'Onofrio, M; Giannetti, P; Iannaccone, G; Morsani, E; Pietri, M; Varotto, G

2001-01-01

Perspectives for precise and fast track reconstruction in future hadron collider experiments are addressed. We discuss the feasibility of a pipelined highly parallel processor dedicated to the implementation of a very fast tracking algorithm. The algorithm is based on the use of a large bank of pre-stored combinations of trajectory points, called patterns, for extremely complex tracking systems. The CMS experiment at LHC is used as a benchmark. Tracking data from the events selected by the level-1 trigger are sorted and filtered by the Fast Tracker processor at an input rate of 100 kHz. This data organization allows the level-2 trigger logic to reconstruct full resolution tracks with transverse momentum above a few GeV and search for secondary vertices within typical level-2 times. (15 refs).

An artificial retina for fast track finding

International Nuclear Information System (INIS)

Ristori, Luciano

2000-01-01

A new approach is proposed for fast track finding in position-sensitive detectors. The basic working principle is modeled on what is widely believed to be the low-level mechanism used by the eye to recognize straight edges. A number of receptors are tuned such that each one responds to a different range of track orientations, each track actually fires several receptors and an estimate of the orientation is obtained through interpolation. The feasibility of a practical device based on this principle and its possible implementation using currently available digital logic is discussed

PREDICTING A FAST-TRACK MARITIME CAREER: CHARACTERISTICS OF SUCCESSFUL OFFICERS DURING TEENAGE YEARS

Directory of Open Access Journals (Sweden)

Manuel Joaquín Fernández González

2017-12-01

Full Text Available Fast-track maritime career is a topical question worldwide due to the shortage of seafarers in maritime industry. Assuming that the fast-track career officers’ relevant common characteristics in adolescence could predict future maritime career speed, the research questions of this research are: What were the common characteristics of fast-track career officers when they were 16-18? Were there any statistically significant differences between the fast-track career groups and the officers with a slower career at that age? A questionnaire survey involving 175 maritime officers was conducted in Latvia in January – October 2016, regarding officers’ family context, school achievement, involvement in sports, and personality traits when they were 16-18. Fast-track career officers perceived themselves as more conscientious, calm and more leadership oriented than the whole group in adolescence. Statistically significant differences among career-speed groups were found regarding family socioeconomic status, family atmosphere and family career support at that age. Based on those communalities among maritime officers with a fast-track carrier when they were 16-18, maritime education and training institutions could better find and give appropriate career guidance to prospective maritime officers. Even if maritime career speed is a very individualized phenomenon, family characteristics could be studied further as a potential good predictor of fast-track maritime career.

A benchmark for comparison of cell tracking algorithms

NARCIS (Netherlands)

M. Maška (Martin); V. Ulman (Vladimír); K. Svoboda; P. Matula (Pavel); P. Matula (Petr); C. Ederra (Cristina); A. Urbiola (Ainhoa); T. España (Tomás); R. Venkatesan (Rajkumar); D.M.W. Balak (Deepak); P. Karas (Pavel); T. Bolcková (Tereza); M. Štreitová (Markéta); C. Carthel (Craig); S. Coraluppi (Stefano); N. Harder (Nathalie); K. Rohr (Karl); K.E.G. Magnusson (Klas E.); J. Jaldén (Joakim); H.M. Blau (Helen); O.M. Dzyubachyk (Oleh); P. Křížek (Pavel); G.M. Hagen (Guy); D. Pastor-Escuredo (David); D. Jimenez-Carretero (Daniel); M.J. Ledesma-Carbayo (Maria); A. Muñoz-Barrutia (Arrate); E. Meijering (Erik); M. Kozubek (Michal); C. Ortiz-De-Solorzano (Carlos)

2014-01-01

textabstractMotivation: Automatic tracking of cells in multidimensional time-lapse fluorescence microscopy is an important task in many biomedical applications. A novel framework for objective evaluation of cell tracking algorithms has been established under the auspices of the IEEE International

"Fast Track" and "Traditional Path" Coaches: Affordances, Agency and Social Capital

Science.gov (United States)

Rynne, Steven

2014-01-01

A recent development in large-scale coach accreditation (certification) structures has been the "fast tracking" of former elite athletes. Former elite athletes are often exempted from entry-level qualifications and are generally granted access to fast track courses that are shortened versions of the accreditation courses undertaken by…

The track finding algorithm of the Belle II vertex detectors

Directory of Open Access Journals (Sweden)

Bilka Tadeas

2017-01-01

Full Text Available The Belle II experiment is a high energy multi purpose particle detector operated at the asymmetric e+e− - collider SuperKEKB in Tsukuba (Japan. In this work we describe the algorithm performing the pattern recognition for inner tracking detector which consists of two layers of pixel detectors and four layers of double sided silicon strip detectors arranged around the interaction region. The track finding algorithm will be used both during the High Level Trigger on-line track reconstruction and during the off-line full reconstruction. It must provide good efficiency down to momenta as low as 50 MeV/c where material effects are sizeable even in an extremely thin detector as the VXD. In addition it has to be able to cope with the high occupancy of the Belle II detectors due to the background. The underlying concept of the track finding algorithm, as well as details of the implementation are outlined. The algorithm is proven to run with good performance on simulated ϒ(4S → BB̄ events with an efficiency for reconstructing tracks of above 90% over a wide range of momentum.

A guidance and control algorithm for scent tracking micro-robotic vehicle swarms

International Nuclear Information System (INIS)

Dohner, J.L.

1998-03-01

Cooperative micro-robotic scent tracking vehicles are designed to collectively sniff out locations of high scent concentrations in unknown, geometrically complex environments. These vehicles are programmed with guidance and control algorithms that allow inter cooperation among vehicles. In this paper a cooperative guidance and control algorithm for scent tracking micro-robotic vehicles is presented. This algorithm is comprised of a sensory compensation sub-algorithm using point source cancellation, a guidance sub-algorithm using gradient descent tracking, and a control sub-algorithm using proportional feedback. The concepts of social rank and point source cancellation are new concepts introduced within. Simulation results for cooperative vehicles swarms are given. Limitations are discussed

A guidance and control algorithm for scent tracking micro-robotic vehicle swarms

Energy Technology Data Exchange (ETDEWEB)

Dohner, J.L. [Sandia National Labs., Albuquerque, NM (United States). Structural Dynamics Dept.

1998-03-01

Cooperative micro-robotic scent tracking vehicles are designed to collectively sniff out locations of high scent concentrations in unknown, geometrically complex environments. These vehicles are programmed with guidance and control algorithms that allow inter cooperation among vehicles. In this paper a cooperative guidance and control algorithm for scent tracking micro-robotic vehicles is presented. This algorithm is comprised of a sensory compensation sub-algorithm using point source cancellation, a guidance sub-algorithm using gradient descent tracking, and a control sub-algorithm using proportional feedback. The concepts of social rank and point source cancellation are new concepts introduced within. Simulation results for cooperative vehicles swarms are given. Limitations are discussed.

Development of target-tracking algorithms using neural network

Energy Technology Data Exchange (ETDEWEB)

Park, Dong Sun; Lee, Joon Whaoan; Yoon, Sook; Baek, Seong Hyun; Lee, Myung Jae [Chonbuk National University, Chonjoo (Korea)

1998-04-01

The utilization of remote-control robot system in atomic power plants or nuclear-related facilities grows rapidly, to protect workers form high radiation environments. Such applications require complete stability of the robot system, so that precisely tracking the robot is essential for the whole system. This research is to accomplish the goal by developing appropriate algorithms for remote-control robot systems. A neural network tracking system is designed and experimented to trace a robot Endpoint. This model is aimed to utilized the excellent capabilities of neural networks; nonlinear mapping between inputs and outputs, learning capability, and generalization capability. The neural tracker consists of two networks for position detection and prediction. Tracking algorithms are developed and experimented for the two models. Results of the experiments show that both models are promising as real-time target-tracking systems for remote-control robot systems. (author). 10 refs., 47 figs.

Electrochemical etching amplification of low-let recoil particle tracks in polymers for fast neutron dosimetry

International Nuclear Information System (INIS)

Sohrabi, M.; Morgan, K.Z.

1975-11-01

An electrochemical etching method for the amplification of fast-neutron-induced recoil particle tracks in polymers was investigated. The technique gave superior results over those obtained by conventional etching methods especially when polycarbonate foils were used for recoil particle track amplification. Electrochemical etching systems capable of multi-foil processing were designed and constructed to demonstrate the feasibility of the techniques for large-scale neutron dosimetry. Electrochemical etching parameters were studied including the nature or type of the polymer foil used, foil thickness and its effect on etching time, the applied voltage and its frequency, the chemical composition, concentration, and temperature of the etchant, distance and angle between the electrodes, and the type of particles such as recoil particles including protons. Recoil particle track density, mean track diameter, and optical density as functions of the mentioned parameters were determined. Each parameter was found to have a distinct effect on the etching results in terms of the measured responses. Several new characteristics of this fast neutron dosimetry method were studied especially for personnel dosimetry using various radiation sources such as nuclear reactors, medical cyclotrons, and isotopic neutron sources. The dose range, neutron energy dependence, directional response, fading characteristics, neutron threshold energy, etc. were investigated

Track reconstruction algorithms for the CBM experiment at FAIR

International Nuclear Information System (INIS)

Lebedev, Andrey; Hoehne, Claudia; Kisel, Ivan; Ososkov, Gennady

2010-01-01

The Compressed Baryonic Matter (CBM) experiment at the future FAIR accelerator complex at Darmstadt is being designed for a comprehensive measurement of hadron and lepton production in heavy-ion collisions from 8-45 AGeV beam energy, producing events with large track multiplicity and high hit density. The setup consists of several detectors including as tracking detectors the silicon tracking system (STS), the muon detector (MUCH) or alternatively a set of Transition Radiation Detectors (TRD). In this contribution, the status of the track reconstruction software including track finding, fitting and propagation is presented for the MUCH and TRD detectors. The track propagation algorithm takes into account an inhomogeneous magnetic field and includes accurate calculation of multiple scattering and energy losses in the detector material. Track parameters and covariance matrices are estimated using the Kalman filter method and a Kalman filter modification by assigning weights to hits and using simulated annealing. Three different track finder algorithms based on track following have been developed which either allow for track branches, just select nearest hits or use the mentioned weighting method. The track reconstruction efficiency for central Au+Au collisions at 25 AGeV beam energy using events from the UrQMD model is at the level of 93-95% for both detectors.

Fast-track surgery-an update on physiological care principles to enhance recovery

DEFF Research Database (Denmark)

Kehlet, Henrik

2011-01-01

INTRODUCTION: The concept of fast-track surgery (enhanced recovery programs) has been evolved and been documented to be successful by decreasing length of stay, morbidity and convalescence across procedures. FUTURE STRATEGIES: However, there are several possibilities for further improvement of mo...... of the components of fast-track surgery, where surgical stress, fluid and pain management are key factors. There is an urgent need for better design of studies, especially in minimal invasive surgery to achieve maximal outcome effects when integrated into the fast-track methodology....

Multiobjective anatomy-based dose optimization for HDR-brachytherapy with constraint free deterministic algorithms

International Nuclear Information System (INIS)

Milickovic, N.; Lahanas, M.; Papagiannopoulou, M.; Zamboglou, N.; Baltas, D.

2002-01-01

In high dose rate (HDR) brachytherapy, conventional dose optimization algorithms consider multiple objectives in the form of an aggregate function that transforms the multiobjective problem into a single-objective problem. As a result, there is a loss of information on the available alternative possible solutions. This method assumes that the treatment planner exactly understands the correlation between competing objectives and knows the physical constraints. This knowledge is provided by the Pareto trade-off set obtained by single-objective optimization algorithms with a repeated optimization with different importance vectors. A mapping technique avoids non-feasible solutions with negative dwell weights and allows the use of constraint free gradient-based deterministic algorithms. We compare various such algorithms and methods which could improve their performance. This finally allows us to generate a large number of solutions in a few minutes. We use objectives expressed in terms of dose variances obtained from a few hundred sampling points in the planning target volume (PTV) and in organs at risk (OAR). We compare two- to four-dimensional Pareto fronts obtained with the deterministic algorithms and with a fast-simulated annealing algorithm. For PTV-based objectives, due to the convex objective functions, the obtained solutions are global optimal. If OARs are included, then the solutions found are also global optimal, although local minima may be present as suggested. (author)

A Novel Energy Saving Algorithm with Frame Response Delay Constraint in IEEE 802.16e

Science.gov (United States)

Nga, Dinh Thi Thuy; Kim, Mingon; Kang, Minho

Sleep-mode operation of a Mobile Subscriber Station (MSS) in IEEE 802.16e effectively saves energy consumption; however, it induces frame response delay. In this letter, we propose an algorithm to quickly find the optimal value of the final sleep interval in sleep-mode in order to minimize energy consumption with respect to a given frame response delay constraint. The validations of our proposed algorithm through analytical results and simulation results suggest that our algorithm provide a potential guidance to energy saving.

Postoperative morbidity after fast-track laparoscopic resection of rectal cancer

DEFF Research Database (Denmark)

Stottmeier, S; Harling, H; Wille-Jørgensen, Peer Anders

2012-01-01

Aim: Analysis was carried out of the nature and chronological order of early complications after fast-track laparoscopic rectal surgery with a view to optimize the short-time outcome of rectal cancer surgery. Method: 102 consecutive patients who underwent elective fast-track laparoscopic rectal......: Postoperative morbidity remains a significant problem even in the fast-track era, even in experienced surgical hands. Our results suggest that besides improvement of surgical technique further improvement of outcome lies in early recognition and proper treatment of complications and the perioperative...... cancer surgery were analysed prospectively from the Danish Colorectal Cancer Database supplemented by data from the medical records. We studied in detail the nature and chronological order of postoperative morbidity and reason for prolonged stay (>5 days). Results: Twenty-five patients (25 per cent) had...

PixTrig: a Level 2 track finding algorithm based on pixel detector

CERN Document Server

Baratella, A; Morettini, P; Parodi, F

2000-01-01

This note describes an algorithm for track search at Level 2 based on pixel detector. Using three pixel clusters we can produce a reconstruction of the track parameter in both z and R-phi plane. These track segments can be used as seed for more sophisticated track finding algorithms or used directly, especially when impact parameter resolution is crucial. The algorithm efficiency is close to 90% for pt > 1 GeV/c and the processing time is small enough to allow a complete detector reconstruction (non RoI guided) within the Level 2 processing.

Major cost savings associated with biologic dose reduction in patients with inflammatory arthritis.

LENUS (Irish Health Repository)

Murphy, C L

2015-01-01

The purpose of this study was to explore whether patients with Inflammatory Arthritis (IA) (Rheumatoid Arthritis (RA), Psoriatic Arthritis (PsA) or Ankylosing Spondylitis (AS)) would remain in remission following a reduction in biologic dosing frequency and to calculate the cost savings associated with dose reduction. This prospective non-blinded non-randomised study commenced in 2010. Patients with Inflammatory Arthritis being treated with a biologic agent were screened for disease activity. A cohort of those in remission according to standardized disease activity indices (DAS28 < 2.6, BASDAI < 4) was offered a reduction in dosing frequency of two commonly used biologic therapies (etanercept 50 mg once per fortnight instead of weekly, adalimumab 40 mg once per month instead of fortnightly). Patients were assessed for disease activity at 3, 6, 12, 18 and 24 months following reduction in dosing frequency. Cost saving was calculated. 79 patients with inflammatory arthritis in remission were recruited. 57% had rheumatoid arthritis (n = 45), 13% psoriatic arthritis (n = 10) and 30% ankylosing spondylitis (n = 24). 57% (n = 45) were taking etanercept and 43% (n = 34) adalimumab. The percentage of patients in remission at 24 months was 56% (n = 44). This resulted in an actual saving to the state of approximately 600,000 euro over two years. This study demonstrates the reduction in biologic dosing frequency is feasible in Inflammatory Arthritis. There was a considerable cost saving at two years. The potential for major cost savings in biologic usage should be pursued further.

A fast, robust algorithm for power line interference cancellation in neural recording

Science.gov (United States)

Keshtkaran, Mohammad Reza; Yang, Zhi

2014-04-01

Objective. Power line interference may severely corrupt neural recordings at 50/60 Hz and harmonic frequencies. The interference is usually non-stationary and can vary in frequency, amplitude and phase. To retrieve the gamma-band oscillations at the contaminated frequencies, it is desired to remove the interference without compromising the actual neural signals at the interference frequency bands. In this paper, we present a robust and computationally efficient algorithm for removing power line interference from neural recordings. Approach. The algorithm includes four steps. First, an adaptive notch filter is used to estimate the fundamental frequency of the interference. Subsequently, based on the estimated frequency, harmonics are generated by using discrete-time oscillators, and then the amplitude and phase of each harmonic are estimated by using a modified recursive least squares algorithm. Finally, the estimated interference is subtracted from the recorded data. Main results. The algorithm does not require any reference signal, and can track the frequency, phase and amplitude of each harmonic. When benchmarked with other popular approaches, our algorithm performs better in terms of noise immunity, convergence speed and output signal-to-noise ratio (SNR). While minimally affecting the signal bands of interest, the algorithm consistently yields fast convergence (30 dB) in different conditions of interference strengths (input SNR from -30 to 30 dB), power line frequencies (45-65 Hz) and phase and amplitude drifts. In addition, the algorithm features a straightforward parameter adjustment since the parameters are independent of the input SNR, input signal power and the sampling rate. A hardware prototype was fabricated in a 65 nm CMOS process and tested. Software implementation of the algorithm has been made available for open access at https://github.com/mrezak/removePLI. Significance. The proposed algorithm features a highly robust operation, fast adaptation to

Fast algorithm for Morphological Filters

International Nuclear Information System (INIS)

Lou Shan; Jiang Xiangqian; Scott, Paul J

2011-01-01

In surface metrology, morphological filters, which evolved from the envelope filtering system (E-system) work well for functional prediction of surface finish in the analysis of surfaces in contact. The naive algorithms are time consuming, especially for areal data, and not generally adopted in real practice. A fast algorithm is proposed based on the alpha shape. The hull obtained by rolling the alpha ball is equivalent to the morphological opening/closing in theory. The algorithm depends on Delaunay triangulation with time complexity O(nlogn). In comparison to the naive algorithms it generates the opening and closing envelope without combining dilation and erosion. Edge distortion is corrected by reflective padding for open profiles/surfaces. Spikes in the sample data are detected and points interpolated to prevent singularities. The proposed algorithm works well both for morphological profile and area filters. Examples are presented to demonstrate the validity and superiority on efficiency of this algorithm over the naive algorithm.

Dose Calibration of the ISS-RAD Fast Neutron Detector

Science.gov (United States)

Zeitlin, C.

2015-01-01

The ISS-RAD instrument has been fabricated by Southwest Research Institute and delivered to NASA for flight to the ISS in late 2015 or early 2016. ISS-RAD is essentially two instruments that share a common interface to ISS. The two instruments are the Charged Particle Detector (CPD), which is very similar to the MSL-RAD detector on Mars, and the Fast Neutron Detector (FND), which is a boron-loaded plastic scintillator with readout optimized for the 0.5 to 10 MeV energy range. As the FND is completely new, it has been necessary to develop methodology to allow it to be used to measure the neutron dose and dose equivalent. This talk will focus on the methods developed and their implementation using calibration data obtained in quasi-monoenergetic (QMN) neutron fields at the PTB facility in Braunschweig, Germany. The QMN data allow us to determine an approximate response function, from which we estimate dose and dose equivalent contributions per detected neutron as a function of the pulse height. We refer to these as the "pSv per count" curves for dose equivalent and the "pGy per count" curves for dose. The FND is required to provide a dose equivalent measurement with an accuracy of ?10% of the known value in a calibrated AmBe field. Four variants of the analysis method were developed, corresponding to two different approximations of the pSv per count curve, and two different implementations, one for real-time analysis onboard ISS and one for ground analysis. We will show that the preferred method, when applied in either real-time or ground analysis, yields good accuracy for the AmBe field. We find that the real-time algorithm is more susceptible to chance-coincidence background than is the algorithm used in ground analysis, so that the best estimates will come from the latter.

A combinational fast algorithm for image reconstruction

International Nuclear Information System (INIS)

Wu Zhongquan

1987-01-01

A combinational fast algorithm has been developed in order to increase the speed of reconstruction. First, an interpolation method based on B-spline functions is used in image reconstruction. Next, the influence of the boundary conditions assumed here on the interpolation of filtered projections and on the image reconstruction is discussed. It is shown that this boundary condition has almost no influence on the image in the central region of the image space, because the error of interpolation rapidly decreases by a factor of ten in shifting two pixels from the edge toward the center. In addition, a fast algorithm for computing the detecting angle has been used with the mentioned interpolation algorithm, and the cost for detecting angle computaton is reduced by a factor of two. The implementation results show that in the same subjective and objective fidelity, the computational cost for the interpolation using this algorithm is about one-twelfth of the conventional algorithm

A Fast Algorithm of Cartographic Sounding Selection

Institute of Scientific and Technical Information of China (English)

SUI Haigang; HUA Li; ZHAO Haitao; ZHANG Yongli

2005-01-01

An effective strategy and framework that adequately integrate the automated and manual processes for fast cartographic sounding selection is presented. The important submarine topographic features are extracted for important soundings selection, and an improved "influence circle" algorithm is introduced for sounding selection. For automatic configuration of soundings distribution pattern, a special algorithm considering multi-factors is employed. A semi-automatic method for solving the ambiguous conflicts is described. On the basis of the algorithms and strategies a system named HGIS for fast cartographic sounding selection is developed and applied in Chinese Marine Safety Administration Bureau (CMSAB). The application experiments show that the system is effective and reliable. At last some conclusions and the future work are given.

Orchestrating care through the fast-track perspective: Orthopaedic nurses’ perceptions and experiences of providing individualised nursing care in older patients’ standardised fast-track programmes after total hip or knee replacement

DEFF Research Database (Denmark)

Bøttcher Berthelsen, Connie; Frederiksen, Kirsten

2017-01-01

The lack of individualised care in orthopaedic regimes is often explained by the extended use of patient pathways and clinical guidelines. The aim of this study was to illuminate orthopaedic nurses' perceptions and experiences of providing individual nursing care for older patients in standardised...... fast-track programmes after total hip or knee replacement. Ten semi-structured interviews were conducted with orthopaedic nurses in orthopaedic wards at three Danish hospitals between April and June of 2015. Data were analysed using manifest and latent content analysis according to Graneheim...... and Lundman. The main theme of the overall interpretation was Orchestrating care through the fast-track perspective, accompanied by three sub-themes: Identifying and legitimising relevant individual care in the fast-track programme, Struggling to fit all patients in the fast-track programme and Justifying...

Response of cellulose nitrate track detectors to electron doses

CERN Document Server

Segovia, N; Moreno, A; Vazquez-Polo, G; Santamaría, T; Aranda, P; Hernández, A

1999-01-01

In order to study alternative dose determination methods, the bulk etching velocity and the latent track annealing of LR 115 track detectors was studied during electron irradiation runs from a Pelletron accelerator. For this purpose alpha irradiated and blank detectors were exposed to increasing electron doses from 10.5 to 317.5 kGy. After the irradiation with electrons the detectors were etched under routine conditions, except for the etching time, that was varied for each electron dose in order to reach a fixed residual thickness. The variation of the bulk etching velocity as a function of each one of the electron doses supplied, was interpolated in order to obtain dosimetric response curves. The observed annealing effect on the latent tracks is discussed as a function of the total electron doses supplied and the temperature.

Monte Carlo evaluation of a photon pencil kernel algorithm applied to fast neutron therapy treatment planning

Science.gov (United States)

Söderberg, Jonas; Alm Carlsson, Gudrun; Ahnesjö, Anders

2003-10-01

When dedicated software is lacking, treatment planning for fast neutron therapy is sometimes performed using dose calculation algorithms designed for photon beam therapy. In this work Monte Carlo derived neutron pencil kernels in water were parametrized using the photon dose algorithm implemented in the Nucletron TMS (treatment management system) treatment planning system. A rectangular fast-neutron fluence spectrum with energies 0-40 MeV (resembling a polyethylene filtered p(41)+ Be spectrum) was used. Central axis depth doses and lateral dose distributions were calculated and compared with the corresponding dose distributions from Monte Carlo calculations for homogeneous water and heterogeneous slab phantoms. All absorbed doses were normalized to the reference dose at 10 cm depth for a field of radius 5.6 cm in a 30 × 40 × 20 cm3 water test phantom. Agreement to within 7% was found in both the lateral and the depth dose distributions. The deviations could be explained as due to differences in size between the test phantom and that used in deriving the pencil kernel (radius 200 cm, thickness 50 cm). In the heterogeneous phantom, the TMS, with a directly applied neutron pencil kernel, and Monte Carlo calculated absorbed doses agree approximately for muscle but show large deviations for media such as adipose or bone. For the latter media, agreement was substantially improved by correcting the absorbed doses calculated in TMS with the neutron kerma factor ratio and the stopping power ratio between tissue and water. The multipurpose Monte Carlo code FLUKA was used both in calculating the pencil kernel and in direct calculations of absorbed dose in the phantom.

Fast track segment finding in the Monitored Drift Tubes (MDT) of the ATLAS Muon Spectrometer using a Legendre transform algorithm

CERN Document Server

Ntekas, Konstantinos; The ATLAS collaboration

2018-01-01

Many of the physics goals of ATLAS in the High Luminosity LHC era, including precision studies of the Higgs boson, require an unprescaled single muon trigger with a 20 GeV threshold. The selectivity of the current ATLAS first-level muon trigger is limited by the moderate spatial resolution of the muon trigger chambers. By incorporating the precise tracking of the MDT, the muon transverse momentum can be measured with an accuracy close to that of the offline reconstruction at the trigger level, sharpening the trigger turn-on curves and reducing the single muon trigger rate. A novel algorithm is proposed which reconstructs segments from MDT hits in an FPGA and find tracks within the tight latency constraints of the ATLAS first-level muon trigger. The algorithm represents MDT drift circles as curves in the Legendre space and returns one or more segment lines tangent to the maximum possible number of drift circles.  This algorithm is implemented without the need of resource and time consuming hit position calcul...

TRACKING TESTS FOR THE SNS FAST INJECTION BUMP POWER SUPPLY

International Nuclear Information System (INIS)

ENG, W.; CUTLER, R.; DEWAN, S.

2004-01-01

The tracking requirement of the SNS Fast Injection Bump power supplies is described. In addition to the usual tracking between the load current and the input reference of a power supply, these power supplies must also track between pairs of units under slightly different loads. This paper describes the use of a current-null test to measure tracking performances. For the actual tests, a single dummy magnet load was used to measure the tracking between the first two production units at the manufacturer's facility. Using the Yokogawa WE7000 waveform. PC-based measurement instrument, input and output waveforms are digitized and stored in data files. A program written for this application is then used to extract data from these files to construct, analyze the waveforms and characterize the power supply performance. Results of the measurements of two SNS Fast Injection Bump power supplies will be presented in this paper

Transmission dose estimation algorithm for in vivo dosimetry

International Nuclear Information System (INIS)

Yun, Hyong Geun; Shin, Kyo Chul; Huh, Soon Nyung; Woo, Hong Gyun; Ha, Sung Whan; Lee, Hyoung Koo

2002-01-01

Measurement of transmission dose is useful for in vivo dosimetry of QA purpose. The objective of this study is to develope an algorithm for estimation of tumor dose using measured transmission dose for open radiation field. Transmission dose was measured with various field size (FS), phantom thickness (Tp), and phantom chamber distance (PCD) with an acrylic phantom for 6 MV and 10 MV X-ray. Source to chamber distance (SCD) was set to 150 cm. Measurement was conducted with a 0.6 cc Farmer type ion chamber. Using measured data and regression analysis, an algorithm was developed for estimation of expected reading of transmission dose. Accuracy of the algorithm was tested with flat solid phantom with various settings. The algorithm consisted of quadratic function of log(A/P) (where A/P is area-perimeter ratio) and tertiary function of PCD. The algorithm could estimate dose with very high accuracy for open square field, with errors within ±0.5%. For elongated radiation field, the errors were limited to ±1.0%. The developed algorithm can accurately estimate the transmission dose in open radiation fields with various treatment settings

Transmission dose estimation algorithm for in vivo dosimetry

Energy Technology Data Exchange (ETDEWEB)

Yun, Hyong Geun; Shin, Kyo Chul [Dankook Univ., Seoul (Korea, Republic of); Huh, Soon Nyung; Woo, Hong Gyun; Ha, Sung Whan [Seoul National Univ., Seoul (Korea, Republic of); Lee, Hyoung Koo [Catholic Univ., Seoul (Korea, Republic of)

2002-07-01

Measurement of transmission dose is useful for in vivo dosimetry of QA purpose. The objective of this study is to develope an algorithm for estimation of tumor dose using measured transmission dose for open radiation field. Transmission dose was measured with various field size (FS), phantom thickness (Tp), and phantom chamber distance (PCD) with an acrylic phantom for 6 MV and 10 MV X-ray. Source to chamber distance (SCD) was set to 150 cm. Measurement was conducted with a 0.6 cc Farmer type ion chamber. Using measured data and regression analysis, an algorithm was developed for estimation of expected reading of transmission dose. Accuracy of the algorithm was tested with flat solid phantom with various settings. The algorithm consisted of quadratic function of log(A/P) (where A/P is area-perimeter ratio) and tertiary function of PCD. The algorithm could estimate dose with very high accuracy for open square field, with errors within {+-}0.5%. For elongated radiation field, the errors were limited to {+-}1.0%. The developed algorithm can accurately estimate the transmission dose in open radiation fields with various treatment settings.

A blueprint for multidisciplinary fast track gastrointestinal oncology care

NARCIS (Netherlands)

Basta, Y.L.

2017-01-01

In this thesis, we have evaluated the implementation of two key concepts of the Gastro Intestinal oncology Center Amsterdam (GIOCA): multidisciplinary teams (MDT) and the fast delivery of care in fast track clinics (FTC). The first part of this thesis investigates the value of multidisciplinary

Effect of an Emergency Department Fast Track on Press-Ganey Patient Satisfaction Scores

Directory of Open Access Journals (Sweden)

Hwang, Calvin E.

2014-12-01

Full Text Available Introduction: Mandated patient surveys have become an integral part of Medicare remuneration, putting hundreds of millions of dollars in funding at risk. The Centers for Medicare & Medicaid Services (CMS recently announced a patient experience survey for the emergency department (ED. Development of an ED Fast Track, where lower acuity patients are rapidly seen, has been shown to improve many of the metrics that CMS examines. This is the first study examining if ED Fast Track implementation affects Press-Ganey scores of patient satisfaction. Methods: We analyzed returned Press-Ganey questionnaires from all ESI 4 and 5 patients seen 11AM - 11PM, August-December 2011 (pre-fast track, and during the identical hours of fast track, August-December 2012. Raw ordinal scores were converted to continuous scores for paired student t-test analysis. We calculated an odds ratio with 100% satisfaction considered a positive response. Results: An academic ED with 52,000 annual visits had 140 pre-fast track and 85 fast track respondents. Implementation of a fast track significantly increased patient satisfaction with the following: wait times (68% satisfaction to 88%, OR 4.13, 95% CI [2.32-7.33], doctor courtesy (90% to 95%, OR 1.97, 95% CI [1.04-3.73], nurse courtesy (87% to 95%, OR 2.75, 95% CI [1.46-5.15], pain control (79% to 87%, OR 2.13, 95% CI [1.16-3.92], likelihood to recommend (81% to 90%, OR 2.62, 95% CI [1.42-4.83], staff caring (82% to 91%, OR 2.82, 95% CI [1.54-5.19], and staying informed about delays (66% to 83%, OR 3.00, 95% CI [1.65-5.44]. Conclusion: Implementation of an ED Fast Track more than doubled the odds of significant improvements in Press-Ganey patient satisfaction metrics and may play an important role in improving ED performance on CMS benchmarks. [West J Emerg Med. 2015;16(1:34–38.

Evidence-based surgical care and the evolution of fast-track surgery

DEFF Research Database (Denmark)

Kehlet, H.; Wilmore, D.W.

2008-01-01

, randomized studies, and meta-analyses, the concept of the "fast-track methodology" has uniformly provided a major enhancement in recovery leading to decreased hospital stay and with an apparent reduction in medical morbidity but unaltered "surgery-specific" morbidity in a variety of procedures. However......BACKGROUND: Optimization of postoperative outcome requires the application of evidence-based principles of care carefully integrated into a multimodal rehabilitation program. OBJECTIVE: To assess, synthesize, and discuss implementation of "fast-track" recovery programs. DATA SOURCES: Medline MBASE...... (January 1966-May 2007) and the Cochrane library (January 1966-May 2007) were searched using the following keywords: fast-track, enhanced recovery, accelerated rehabilitation, and multimodal and perioperative care. In addition, the synthesis on the many specific interventions and organizational...

The Danish Head and Neck Cancer fast-track program

DEFF Research Database (Denmark)

Roennegaard, Anders B.; Rosenberg, Tine; Bjørndal, Kristine

2018-01-01

-track clinical pathway solutions. Objectives: The objectives of this study were 1) to present the setup of the head and neck cancer (HNC) fast-track program at Odense University Hospital (OUH) as an example of the Danish model and 2) to present patient characteristics, diagnostic outcome, cancer detection rate...

MO-E-17A-05: Individualized Patient Dosimetry in CT Using the Patient Dose (PATDOSE) Algorithm

Energy Technology Data Exchange (ETDEWEB)

Hernandez, A; Boone, J [UC Davis Medical Center, Sacramento, CA (United States)

2014-06-15

Purpose: Radiation dose to the patient undergoing a CT examination has been the focus of many recent studies. While CTDIvol and SSDE-based methods are important tools for patient dose management, the CT image data provides important information with respect to CT dose and its distribution. Coupled with the known geometry and output factors (kV, mAs, pitch, etc.) of the CT scanner, the CT dataset can be used directly for computing absorbed dose. Methods: The HU numbers in a patient's CT data set can be converted to linear attenuation coefficients (LACs) with some assumptions. With this (PAT-DOSE) method, which is not Monte Carlo-based, the primary and scatter dose are computed separately. The primary dose is computed directly from the geometry of the scanner, x-ray spectrum, and the known patient LACs. Once the primary dose has been computed to all voxels in the patient, the scatter dose algorithm redistributes a fraction of the absorbed primary dose (based on the HU number of each source voxel), and the methods here invoke both tissue attenuation and absorption and solid angle geometry. The scatter dose algorithm can be run N times to include Nth-scatter redistribution. PAT-DOSE was deployed using simple PMMA phantoms, to validate its performance against Monte Carlo-derived dose distributions. Results: Comparison between PAT-DOSE and MCNPX primary dose distributions showed excellent agreement for several scan lengths. The 1st-scatter dose distributions showed relatively higher-amplitude, long-range scatter tails for the PAT-DOSE algorithm then for MCNPX simulations. Conclusion: The PAT-DOSE algorithm provides a fast, deterministic assessment of the 3-D dose distribution in CT, making use of scanner geometry and the patient image data set. The preliminary implementation of the algorithm produces accurate primary dose distributions however achieving scatter distribution agreement is more challenging. Addressing the polyenergetic x-ray spectrum and spatially

A TLD dose algorithm using artificial neural networks

International Nuclear Information System (INIS)

Moscovitch, M.; Rotunda, J.E.; Tawil, R.A.; Rathbone, B.A.

1995-01-01

An artificial neural network was designed and used to develop a dose algorithm for a multi-element thermoluminescence dosimeter (TLD). The neural network architecture is based on the concept of functional links network (FLN). Neural network is an information processing method inspired by the biological nervous system. A dose algorithm based on neural networks is fundamentally different as compared to conventional algorithms, as it has the capability to learn from its own experience. The neural network algorithm is shown the expected dose values (output) associated with given responses of a multi-element dosimeter (input) many times. The algorithm, being trained that way, eventually is capable to produce its own unique solution to similar (but not exactly the same) dose calculation problems. For personal dosimetry, the output consists of the desired dose components: deep dose, shallow dose and eye dose. The input consists of the TL data obtained from the readout of a multi-element dosimeter. The neural network approach was applied to the Harshaw Type 8825 TLD, and was shown to significantly improve the performance of this dosimeter, well within the U.S. accreditation requirements for personnel dosimeters

TH-AB-202-03: A Novel Tool for Computing Deliverable Doses in Dynamic MLC Tracking Treatments

Energy Technology Data Exchange (ETDEWEB)

Fast, M; Kamerling, C; Menten, M; Nill, S; Oelfke, U [The Institute of Cancer Research and The Royal Marsden NHS Foundation Trust, London (United Kingdom); Crijns, S; Raaymakers, B [University Medical Center Utrecht, Utrecht (Netherlands)

2016-06-15

Purpose: In tracked dynamic multi-leaf collimator (MLC) treatments, segments are continuously adapted to the target centroid motion in beams-eye-view. On-the-fly segment adaptation, however, potentially induces dosimetric errors due to the finite MLC leaf width and non-rigid target motion. In this study, we outline a novel tool for computing the 4d dose of lung SBRT plans delivered with MLC tracking. Methods: The following automated workflow was developed: A) centroid tracking, where the initial segments are morphed to each 4dCT phase based on the beams-eye-view GTV shift (followed by a dose calculation on each phase); B) re-optimized tracking, in which all morphed initial plans from (A) are further optimised (“warm-started”) in each 4dCT phase using the initial optimisation parameters but phase-specific volume definitions. Finally, both dose sets are accumulated to the reference phase using deformable image registration. Initial plans were generated according to the RTOG-1021 guideline (54Gy, 3-Fx, equidistant 9-beam IMRT) on the peak-exhale (reference) phase of a phase-binned 4dCT. Treatment planning and delivery simulations were performed in RayStation (research v4.6) using our in-house segment-morphing algorithm, which directly links to RayStation through a native C++ interface. Results: Computing the tracking plans and 4d dose distributions via the in-house interface takes 5 and 8 minutes respectively for centroid and re-optimized tracking. For a sample lung SBRT patient with 14mm peak-to-peak motion in sup-inf direction, mainly perpendicular leaf motion (0-collimator) resulted in small dose changes for PTV-D95 (−13cGy) and GTV-D98 (+18cGy) for the centroid tracking case compared to the initial plan. Modest reductions of OAR doses (e.g. spinal cord D2: −11cGy) were achieved in the idealized tracking case. Conclusion: This study presents an automated “1-click” workflow for computing deliverable MLC tracking doses in RayStation. Adding a non

TH-AB-202-03: A Novel Tool for Computing Deliverable Doses in Dynamic MLC Tracking Treatments

International Nuclear Information System (INIS)

Fast, M; Kamerling, C; Menten, M; Nill, S; Oelfke, U; Crijns, S; Raaymakers, B

2016-01-01

Purpose: In tracked dynamic multi-leaf collimator (MLC) treatments, segments are continuously adapted to the target centroid motion in beams-eye-view. On-the-fly segment adaptation, however, potentially induces dosimetric errors due to the finite MLC leaf width and non-rigid target motion. In this study, we outline a novel tool for computing the 4d dose of lung SBRT plans delivered with MLC tracking. Methods: The following automated workflow was developed: A) centroid tracking, where the initial segments are morphed to each 4dCT phase based on the beams-eye-view GTV shift (followed by a dose calculation on each phase); B) re-optimized tracking, in which all morphed initial plans from (A) are further optimised (“warm-started”) in each 4dCT phase using the initial optimisation parameters but phase-specific volume definitions. Finally, both dose sets are accumulated to the reference phase using deformable image registration. Initial plans were generated according to the RTOG-1021 guideline (54Gy, 3-Fx, equidistant 9-beam IMRT) on the peak-exhale (reference) phase of a phase-binned 4dCT. Treatment planning and delivery simulations were performed in RayStation (research v4.6) using our in-house segment-morphing algorithm, which directly links to RayStation through a native C++ interface. Results: Computing the tracking plans and 4d dose distributions via the in-house interface takes 5 and 8 minutes respectively for centroid and re-optimized tracking. For a sample lung SBRT patient with 14mm peak-to-peak motion in sup-inf direction, mainly perpendicular leaf motion (0-collimator) resulted in small dose changes for PTV-D95 (−13cGy) and GTV-D98 (+18cGy) for the centroid tracking case compared to the initial plan. Modest reductions of OAR doses (e.g. spinal cord D2: −11cGy) were achieved in the idealized tracking case. Conclusion: This study presents an automated “1-click” workflow for computing deliverable MLC tracking doses in RayStation. Adding a non

The fast tracker processor for hadronic collider triggers

CERN Document Server

Annovi, A; Bardi, A; Carosi, R; Dell'Orso, Mauro; D'Onofrio, M; Giannetti, P; Iannaccone, G; Morsani, F; Pietri, M; Varotto, G

2000-01-01

Perspective for precise and fast track reconstruction in future hadronic collider experiments are addressed. We discuss the feasibility of a pipelined highly parallelized processor dedicated to the implementation of a very fast algorithm. The algorithm is based on the use of a large bank of pre-stored combinations of trajectory points (patterns) for extremely complex tracking systems. The CMS experiment at LHC is used as a benchmark. Tracking data from the events selected by the level-1 trigger are sorted and filtered by the Fast Tracker processor at a rate of 100 kHz. This data organization allows the level-2 trigger logic to reconstruct full resolution traces with transverse momentum above few GeV and search secondary vertexes within typical level-2 times. 15 Refs.

An Improvement of a Fuzzy Logic-Controlled Maximum Power Point Tracking Algorithm for Photovoltic Applications

Directory of Open Access Journals (Sweden)

Woonki Na

2017-03-01

Full Text Available This paper presents an improved maximum power point tracking (MPPT algorithm using a fuzzy logic controller (FLC in order to extract potential maximum power from photovoltaic cells. The objectives of the proposed algorithm are to improve the tracking speed, and to simultaneously solve the inherent drawbacks such as slow tracking in the conventional perturb and observe (P and O algorithm. The performances of the conventional P and O algorithm and the proposed algorithm are compared by using MATLAB/Simulink in terms of the tracking speed and steady-state oscillations. Additionally, both algorithms were experimentally validated through a digital signal processor (DSP-based controlled-boost DC-DC converter. The experimental results show that the proposed algorithm performs with a shorter tracking time, smaller output power oscillation, and higher efficiency, compared with the conventional P and O algorithm.

An Algorithm to Automate Yeast Segmentation and Tracking

Science.gov (United States)

Doncic, Andreas; Eser, Umut; Atay, Oguzhan; Skotheim, Jan M.

2013-01-01

Our understanding of dynamic cellular processes has been greatly enhanced by rapid advances in quantitative fluorescence microscopy. Imaging single cells has emphasized the prevalence of phenomena that can be difficult to infer from population measurements, such as all-or-none cellular decisions, cell-to-cell variability, and oscillations. Examination of these phenomena requires segmenting and tracking individual cells over long periods of time. However, accurate segmentation and tracking of cells is difficult and is often the rate-limiting step in an experimental pipeline. Here, we present an algorithm that accomplishes fully automated segmentation and tracking of budding yeast cells within growing colonies. The algorithm incorporates prior information of yeast-specific traits, such as immobility and growth rate, to segment an image using a set of threshold values rather than one specific optimized threshold. Results from the entire set of thresholds are then used to perform a robust final segmentation. PMID:23520484

Scalable force directed graph layout algorithms using fast multipole methods

KAUST Repository

Yunis, Enas Abdulrahman; Yokota, Rio; Ahmadia, Aron

2012-01-01

We present an extension to ExaFMM, a Fast Multipole Method library, as a generalized approach for fast and scalable execution of the Force-Directed Graph Layout algorithm. The Force-Directed Graph Layout algorithm is a physics-based approach

Fast-Acquisition/Weak-Signal-Tracking GPS Receiver for HEO

Science.gov (United States)

Wintemitz, Luke; Boegner, Greg; Sirotzky, Steve

2004-01-01

A report discusses the technical background and design of the Navigator Global Positioning System (GPS) receiver -- . a radiation-hardened receiver intended for use aboard spacecraft. Navigator is capable of weak signal acquisition and tracking as well as much faster acquisition of strong or weak signals with no a priori knowledge or external aiding. Weak-signal acquisition and tracking enables GPS use in high Earth orbits (HEO), and fast acquisition allows for the receiver to remain without power until needed in any orbit. Signal acquisition and signal tracking are, respectively, the processes of finding and demodulating a signal. Acquisition is the more computationally difficult process. Previous GPS receivers employ the method of sequentially searching the two-dimensional signal parameter space (code phase and Doppler). Navigator exploits properties of the Fourier transform in a massively parallel search for the GPS signal. This method results in far faster acquisition times [in the lab, 12 GPS satellites have been acquired with no a priori knowledge in a Low-Earth-Orbit (LEO) scenario in less than one second]. Modeling has shown that Navigator will be capable of acquiring signals down to 25 dB-Hz, appropriate for HEO missions. Navigator is built using the radiation-hardened ColdFire microprocessor and housing the most computationally intense functions in dedicated field-programmable gate arrays. The high performance of the algorithm and of the receiver as a whole are made possible by optimizing computational efficiency and carefully weighing tradeoffs among the sampling rate, data format, and data-path bit width.

A parallel algorithm for 3D particle tracking and Lagrangian trajectory reconstruction

International Nuclear Information System (INIS)

Barker, Douglas; Zhang, Yuanhui; Lifflander, Jonathan; Arya, Anshu

2012-01-01

Particle-tracking methods are widely used in fluid mechanics and multi-target tracking research because of their unique ability to reconstruct long trajectories with high spatial and temporal resolution. Researchers have recently demonstrated 3D tracking of several objects in real time, but as the number of objects is increased, real-time tracking becomes impossible due to data transfer and processing bottlenecks. This problem may be solved by using parallel processing. In this paper, a parallel-processing framework has been developed based on frame decomposition and is programmed using the asynchronous object-oriented Charm++ paradigm. This framework can be a key step in achieving a scalable Lagrangian measurement system for particle-tracking velocimetry and may lead to real-time measurement capabilities. The parallel tracking algorithm was evaluated with three data sets including the particle image velocimetry standard 3D images data set #352, a uniform data set for optimal parallel performance and a computational-fluid-dynamics-generated non-uniform data set to test trajectory reconstruction accuracy, consistency with the sequential version and scalability to more than 500 processors. The algorithm showed strong scaling up to 512 processors and no inherent limits of scalability were seen. Ultimately, up to a 200-fold speedup is observed compared to the serial algorithm when 256 processors were used. The parallel algorithm is adaptable and could be easily modified to use any sequential tracking algorithm, which inputs frames of 3D particle location data and outputs particle trajectories

Pathogenesis of morbidity after fast-track laparoscopic colonic cancer surgery

DEFF Research Database (Denmark)

Stottmeier, S; Harling, H; Wille-Jørgensen, P

2011-01-01

AIM: Analysis of the nature and time course of early complications after laparoscopic colonic surgery is required to allow rational strategies for their prevention and management. METHOD: One hundred and four consecutive patients who underwent elective fast-track laparoscopic colonic cancer surgery...... occurred in 14 patients, of which four were preceded by medical complications. Three patients had only medical complications. Median length of stay was 3 days (range 1-44). CONCLUSION: Further improvement of outcomes after fast-track laparoscopic colonic surgery might be obtained by improved surgical...

Fast-track rehabilitation in elective colorectal surgery patients: a prospective clinical and immunological single-centre study.

Science.gov (United States)

Wichmann, Matthias W; Eben, Ricarda; Angele, Martin K; Brandenburg, Franzis; Goetz, Alwin E; Jauch, Karl-Walter

2007-07-01

Recent clinical data indicate that fast-track surgery (multimodal rehabilitation) leads to shorter postoperative length of hospital stay, faster recovery of gastrointestinal function as well as reduced morbidity and mortality rates. To date, no study has focused on the effects of fast-track surgery on postoperative immune function. This study was initiated to determine whether fast-track rehabilitation results in improved clinical and immunological outcome of patients undergoing colorectal surgery. Forty patients underwent either conventional or fast-track rehabilitation after colorectal surgery. In addition to clinical parameters (return of gastrointestinal function, food intake, pain score, complication rates and postoperative length of stay), we determined parameters of perioperative immunity by flow cytometry (lymphocyte subgroups) and enzyme-linked immunosorbent assay (interleukin-6). Our findings indicate a better-preserved cell-mediated immune function (T cells, T-helper cells, natural killer cells) after fast-track rehabilitation, whereas the pro-inflammatory response (C-reactive protein, interleukin-6) was unchanged in both study groups. Furthermore, we detected a significantly faster return of gastrointestinal function (first bowel movement P<0.001, food intake P<0.05), significantly reduced pain scores in the postoperative course (P < 0.05) and a significantly shorter length of postoperative stay (P<0.001) in patients undergoing fast-track rehabilitation. Fast-track rehabilitation after colorectal surgery results in better-preserved cell-mediated immunity when compared with conventional postoperative care. Furthermore, patients undergoing fast-track rehabilitation suffer from less pain and have a faster return of gastrointestinal function in the postoperative course. In addition, postoperative length of hospital stay was significantly shorter in fast-track patients.

A novel evolutionary algorithm for dynamic economic dispatch with energy saving and emission reduction in power system integrated wind power

International Nuclear Information System (INIS)

Liao, Gwo-Ching

2011-01-01

An optimization algorithm is proposed in this paper to solve the economic dispatch problem that includes wind farm using the Chaotic Quantum Genetic Algorithm (CQGA). In addition to the detailed models of economic dispatch introduction and their associated constraints, the wind power effect is also included in this paper. The chaotic quantum genetic algorithm used to solve the economic dispatch process and discussed with real scenarios used for the simulation tests. After comparing the proposed algorithm with several other algorithms commonly used to solve optimization problems, the results show that the proposed algorithm is able to find the optimal solution quickly and accurately (i.e. to obtain the minimum cost for power generation in the shortest time). At the end, the impact to the total cost savings for power generation after adding (or not adding) wind power generation is also discussed. The actual implementation results prove that the proposed algorithm is economical, fast and practical. They are quite valuable for further research. -- Research highlights: → Quantum Genetic Algorithm can effectively improve the global search ability. → It can achieve the real objective of the global optimal solutions. → The CPU computation time is less than that other algorithms adopted in this paper.

Through-Wall Multiple Targets Vital Signs Tracking Based on VMD Algorithm

Directory of Open Access Journals (Sweden)

Jiaming Yan

2016-08-01

Full Text Available Targets located at the same distance are easily neglected in most through-wall multiple targets detecting applications which use the single-input single-output (SISO ultra-wideband (UWB radar system. In this paper, a novel multiple targets vital signs tracking algorithm for through-wall detection using SISO UWB radar has been proposed. Taking advantage of the high-resolution decomposition of the Variational Mode Decomposition (VMD based algorithm, the respiration signals of different targets can be decomposed into different sub-signals, and then, we can track the time-varying respiration signals accurately when human targets located in the same distance. Intensive evaluation has been conducted to show the effectiveness of our scheme with a 0.15 m thick concrete brick wall. Constant, piecewise-constant and time-varying vital signs could be separated and tracked successfully with the proposed VMD based algorithm for two targets, even up to three targets. For the multiple targets’ vital signs tracking issues like urban search and rescue missions, our algorithm has superior capability in most detection applications.

GPU-based fast pencil beam algorithm for proton therapy

International Nuclear Information System (INIS)

Fujimoto, Rintaro; Nagamine, Yoshihiko; Kurihara, Tsuneya

2011-01-01

Performance of a treatment planning system is an essential factor in making sophisticated plans. The dose calculation is a major time-consuming process in planning operations. The standard algorithm for proton dose calculations is the pencil beam algorithm which produces relatively accurate results, but is time consuming. In order to shorten the computational time, we have developed a GPU (graphics processing unit)-based pencil beam algorithm. We have implemented this algorithm and calculated dose distributions in the case of a water phantom. The results were compared to those obtained by a traditional method with respect to the computational time and discrepancy between the two methods. The new algorithm shows 5-20 times faster performance using the NVIDIA GeForce GTX 480 card in comparison with the Intel Core-i7 920 processor. The maximum discrepancy of the dose distribution is within 0.2%. Our results show that GPUs are effective for proton dose calculations.

The Type-2 Fuzzy Logic Controller-Based Maximum Power Point Tracking Algorithm and the Quadratic Boost Converter for Pv System

Science.gov (United States)

Altin, Necmi

2018-05-01

An interval type-2 fuzzy logic controller-based maximum power point tracking algorithm and direct current-direct current (DC-DC) converter topology are proposed for photovoltaic (PV) systems. The proposed maximum power point tracking algorithm is designed based on an interval type-2 fuzzy logic controller that has an ability to handle uncertainties. The change in PV power and the change in PV voltage are determined as inputs of the proposed controller, while the change in duty cycle is determined as the output of the controller. Seven interval type-2 fuzzy sets are determined and used as membership functions for input and output variables. The quadratic boost converter provides high voltage step-up ability without any reduction in performance and stability of the system. The performance of the proposed system is validated through MATLAB/Simulink simulations. It is seen that the proposed system provides high maximum power point tracking speed and accuracy even for fast changing atmospheric conditions and high voltage step-up requirements.

New time-saving predictor algorithm for multiple breath washout in adolescents

DEFF Research Database (Denmark)

Grønbæk, Jonathan; Hallas, Henrik Wegener; Arianto, Lambang

2016-01-01

BACKGROUND: Multiple breath washout (MBW) is an informative but time-consuming test. This study evaluates the uncertainty of a time-saving predictor algorithm in adolescents. METHODS: Adolescents were recruited from the Copenhagen Prospective Study on Asthma in Childhood (COPSAC2000) birth cohort...

Object Tracking via 2DPCA and l2-Regularization

Directory of Open Access Journals (Sweden)

Haijun Wang

2016-01-01

Full Text Available We present a fast and robust object tracking algorithm by using 2DPCA and l2-regularization in a Bayesian inference framework. Firstly, we model the challenging appearance of the tracked object using 2DPCA bases, which exploit the strength of subspace representation. Secondly, we adopt the l2-regularization to solve the proposed presentation model and remove the trivial templates from the sparse tracking method which can provide a more fast tracking performance. Finally, we present a novel likelihood function that considers the reconstruction error, which is concluded from the orthogonal left-projection matrix and the orthogonal right-projection matrix. Experimental results on several challenging image sequences demonstrate that the proposed method can achieve more favorable performance against state-of-the-art tracking algorithms.

The role of pain for early rehabilitation in fast track total knee arthroplasty

DEFF Research Database (Denmark)

Holm, Bente; Kristensen, Morten Tange; Myhrmann, Lis

2010-01-01

To investigate the relationship between early functional mobility and pain intensity in a fast track program after total knee arthroplasty (TKA).......To investigate the relationship between early functional mobility and pain intensity in a fast track program after total knee arthroplasty (TKA)....

Intermediate and fast neutron absorbed doses in fast neutron field at the RB reactor

International Nuclear Information System (INIS)

Sokcic-Kostic, M.; Pesic, M.; Antic, D.

1987-10-01

The experimental fuel channel EFC is created as one of the fast neutron fields at the RB reactor. The intermediate and fast neutron spectra in EFC are measured by activation technique. The intermediate and fast neutron absorbed doses are computed on the basis of these experimental results. At the end the obtained doses are compared. (author)

Fast algorithm for computing complex number-theoretic transforms

Science.gov (United States)

Reed, I. S.; Liu, K. Y.; Truong, T. K.

1977-01-01

A high-radix FFT algorithm for computing transforms over FFT, where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional FFT.

A Cost-Effective Tracking Algorithm for Hypersonic Glide Vehicle Maneuver Based on Modified Aerodynamic Model

Directory of Open Access Journals (Sweden)

Yu Fan

2016-10-01

Full Text Available In order to defend the hypersonic glide vehicle (HGV, a cost-effective single-model tracking algorithm using Cubature Kalman filter (CKF is proposed in this paper based on modified aerodynamic model (MAM as process equation and radar measurement model as measurement equation. In the existing aerodynamic model, the two control variables attack angle and bank angle cannot be measured by the existing radar equipment and their control laws cannot be known by defenders. To establish the process equation, the MAM for HGV tracking is proposed by using additive white noise to model the rates of change of the two control variables. For the ease of comparison several multiple model algorithms based on CKF are presented, including interacting multiple model (IMM algorithm, adaptive grid interacting multiple model (AGIMM algorithm and hybrid grid multiple model (HGMM algorithm. The performances of these algorithms are compared and analyzed according to the simulation results. The simulation results indicate that the proposed tracking algorithm based on modified aerodynamic model has the best tracking performance with the best accuracy and least computational cost among all tracking algorithms in this paper. The proposed algorithm is cost-effective for HGV tracking.

Restoring integrity—A grounded theory of coping with a fast track surgery programme

Directory of Open Access Journals (Sweden)

Lene Bastrup Jørgensen

2016-01-01

Full Text Available Aims and objectives: The aim of this study was to generate a theory conceptualizing and explaining behavioural processes involved in coping in order to identify the predominant coping types and coping type-specific features. Background: Patients undergoing fast track procedures do not experience a higher risk of complications, readmission, or mortality. However, such programmes presuppose an increasing degree of patient involvement, placing high educational, physical, and mental demands on the patients. There is a lack of knowledge about how patients understand and cope with fast track programmes. Design: The study design used classical grounded theory. Methods: The study used a multimodal approach with qualitative and quantitative data sets from 14 patients. Results: Four predominant types of coping, with distinct physiological, cognitive, affective, and psychosocial features, existed among patients going through a fast track total hip replacement programme. These patients’ main concern was to restore their physical and psychosocial integrity, which had been compromised by reduced function and mobility in daily life. To restore integrity they economized their mental resources, while striving to fulfil the expectations of the fast track programme. This goal was achieved by being mentally proactive and physically active. Three out of the four predominant types of coping matched the expectations expressed in the fast track programme. The non-matching behaviour was seen among the most nervous patients, who claimed the right to diverge from the programme. Conclusion: In theory, four predominant types of coping with distinct physiological, cognitive, affective, and psychosocial features occur among patients going through a fast track total hip arthroplasty programme.

Restoring integrity--A grounded theory of coping with a fast track surgery programme.

Science.gov (United States)

Jørgensen, Lene Bastrup; Fridlund, Bengt

2016-01-01

The aim of this study was to generate a theory conceptualizing and explaining behavioural processes involved in coping in order to identify the predominant coping types and coping type-specific features. Patients undergoing fast track procedures do not experience a higher risk of complications, readmission, or mortality. However, such programmes presuppose an increasing degree of patient involvement, placing high educational, physical, and mental demands on the patients. There is a lack of knowledge about how patients understand and cope with fast track programmes. The study design used classical grounded theory. The study used a multimodal approach with qualitative and quantitative data sets from 14 patients. Four predominant types of coping, with distinct physiological, cognitive, affective, and psychosocial features, existed among patients going through a fast track total hip replacement programme. These patients' main concern was to restore their physical and psychosocial integrity, which had been compromised by reduced function and mobility in daily life. To restore integrity they economized their mental resources, while striving to fulfil the expectations of the fast track programme. This goal was achieved by being mentally proactive and physically active. Three out of the four predominant types of coping matched the expectations expressed in the fast track programme. The non-matching behaviour was seen among the most nervous patients, who claimed the right to diverge from the programme. In theory, four predominant types of coping with distinct physiological, cognitive, affective, and psychosocial features occur among patients going through a fast track total hip arthroplasty programme.

Restoring integrity—A grounded theory of coping with a fast track surgery programme

Science.gov (United States)

Jørgensen, Lene Bastrup; Fridlund, Bengt

2016-01-01

Aims and objectives The aim of this study was to generate a theory conceptualizing and explaining behavioural processes involved in coping in order to identify the predominant coping types and coping type-specific features. Background Patients undergoing fast track procedures do not experience a higher risk of complications, readmission, or mortality. However, such programmes presuppose an increasing degree of patient involvement, placing high educational, physical, and mental demands on the patients. There is a lack of knowledge about how patients understand and cope with fast track programmes. Design The study design used classical grounded theory. Methods The study used a multimodal approach with qualitative and quantitative data sets from 14 patients. Results Four predominant types of coping, with distinct physiological, cognitive, affective, and psychosocial features, existed among patients going through a fast track total hip replacement programme. These patients’ main concern was to restore their physical and psychosocial integrity, which had been compromised by reduced function and mobility in daily life. To restore integrity they economized their mental resources, while striving to fulfil the expectations of the fast track programme. This goal was achieved by being mentally proactive and physically active. Three out of the four predominant types of coping matched the expectations expressed in the fast track programme. The non-matching behaviour was seen among the most nervous patients, who claimed the right to diverge from the programme. Conclusion In theory, four predominant types of coping with distinct physiological, cognitive, affective, and psychosocial features occur among patients going through a fast track total hip arthroplasty programme. PMID:26751199

An algorithm to track laboratory zebrafish shoals.

Science.gov (United States)

Feijó, Gregory de Oliveira; Sangalli, Vicenzo Abichequer; da Silva, Isaac Newton Lima; Pinho, Márcio Sarroglia

2018-05-01

In this paper, a semi-automatic multi-object tracking method to track a group of unmarked zebrafish is proposed. This method can handle partial occlusion cases, maintaining the correct identity of each individual. For every object, we extracted a set of geometric features to be used in the two main stages of the algorithm. The first stage selected the best candidate, based both on the blobs identified in the image and the estimate generated by a Kalman Filter instance. In the second stage, if the same candidate-blob is selected by two or more instances, a blob-partitioning algorithm takes place in order to split this blob and reestablish the instances' identities. If the algorithm cannot determine the identity of a blob, a manual intervention is required. This procedure was compared against a manual labeled ground truth on four video sequences with different numbers of fish and spatial resolution. The performance of the proposed method is then compared against two well-known zebrafish tracking methods found in the literature: one that treats occlusion scenarios and one that only track fish that are not in occlusion. Based on the data set used, the proposed method outperforms the first method in correctly separating fish in occlusion, increasing its efficiency by at least 8.15% of the cases. As for the second, the proposed method's overall performance outperformed the second in some of the tested videos, especially those with lower image quality, because the second method requires high-spatial resolution images, which is not a requirement for the proposed method. Yet, the proposed method was able to separate fish involved in occlusion and correctly assign its identity in up to 87.85% of the cases, without accounting for user intervention. Copyright © 2018 Elsevier Ltd. All rights reserved.

Fast emulation of track reconstruction in the CMS simulation

CERN Document Server

Komm, Matthias

2017-01-01

Simulated samples of various physics processes are a key ingredient within analyses to unlock the physics behind LHC collision data. Samples with more and more statistics are required to keep up with the increasing amounts of recorded data. During sample generation, significant computing time is spent on the reconstruction of charged particle tracks from energy deposits which additionally scales with the pileup conditions. In CMS, the FastSimulation package is developed for providing a fast alternative to the standard simulation and reconstruction workflow. It employs various techniques to emulate track reconstruction effects in particle collision events. Several analysis groups in CMS are utilizing the package, in particular those requiring many samples to scan the parameter space of physics models (e.g. SUSY) or for the purpose of estimating systematic uncertainties. The strategies for and recent developments in this emulation are presented, including a novel, flexible implementation of tracking emulation w...

An algorithm to automate yeast segmentation and tracking.

Directory of Open Access Journals (Sweden)

Andreas Doncic

Full Text Available Our understanding of dynamic cellular processes has been greatly enhanced by rapid advances in quantitative fluorescence microscopy. Imaging single cells has emphasized the prevalence of phenomena that can be difficult to infer from population measurements, such as all-or-none cellular decisions, cell-to-cell variability, and oscillations. Examination of these phenomena requires segmenting and tracking individual cells over long periods of time. However, accurate segmentation and tracking of cells is difficult and is often the rate-limiting step in an experimental pipeline. Here, we present an algorithm that accomplishes fully automated segmentation and tracking of budding yeast cells within growing colonies. The algorithm incorporates prior information of yeast-specific traits, such as immobility and growth rate, to segment an image using a set of threshold values rather than one specific optimized threshold. Results from the entire set of thresholds are then used to perform a robust final segmentation.

Accelerated Leadership Development: Fast Tracking School Leaders

Science.gov (United States)

Earley, Peter; Jones, Jeff

2010-01-01

"Accelerated Leadership Development" captures and communicates the lessons learned from successful fast-track leadership programmes in the private and public sector, and provides a model which schools can follow and customize as they plan their own leadership development strategies. As large numbers of headteachers and other senior staff…

Research on fast Fourier transforms algorithm of huge remote sensing image technology with GPU and partitioning technology.

Science.gov (United States)

Yang, Xue; Li, Xue-You; Li, Jia-Guo; Ma, Jun; Zhang, Li; Yang, Jan; Du, Quan-Ye

2014-02-01

Fast Fourier transforms (FFT) is a basic approach to remote sensing image processing. With the improvement of capacity of remote sensing image capture with the features of hyperspectrum, high spatial resolution and high temporal resolution, how to use FFT technology to efficiently process huge remote sensing image becomes the critical step and research hot spot of current image processing technology. FFT algorithm, one of the basic algorithms of image processing, can be used for stripe noise removal, image compression, image registration, etc. in processing remote sensing image. CUFFT function library is the FFT algorithm library based on CPU and FFTW. FFTW is a FFT algorithm developed based on CPU in PC platform, and is currently the fastest CPU based FFT algorithm function library. However there is a common problem that once the available memory or memory is less than the capacity of image, there will be out of memory or memory overflow when using the above two methods to realize image FFT arithmetic. To address this problem, a CPU and partitioning technology based Huge Remote Fast Fourier Transform (HRFFT) algorithm is proposed in this paper. By improving the FFT algorithm in CUFFT function library, the problem of out of memory and memory overflow is solved. Moreover, this method is proved rational by experiment combined with the CCD image of HJ-1A satellite. When applied to practical image processing, it improves effect of the image processing, speeds up the processing, which saves the time of computation and achieves sound result.

ATLAS FTK: The Fast Tracker

CERN Document Server

T, Iizawa; The ATLAS collaboration

2014-01-01

The Fast TracKer (FTK) will perform global track reconstruction after each Level-1 trigger accept to enable the software-based High Level Trigger to have early access to tracking information. FTK is a dedicated processor based on a mixture of advanced technologies. Modern, powerful Field Programmable Gate Arrays (FPGAs) form an important part of the system architecture, and the large level of computing power required for pattern recognition is provided by incorporating standard-cell ASICs named Associative Memory (AM). FTK provides global track reconstruction in the full inner silicon detector in approximately 100 microseconds with resolution comparable to the offline algorithms. It allows a fast and precise detection of the primary and secondary vertex information. The track and vertex information is then used by the High Level Trigger algorithms, allowing highly improved trigger performance for the important signatures such as b-jets. In this paper, the architecture and the hardware development status of FT...

Object tracking system using a VSW algorithm based on color and point features

Directory of Open Access Journals (Sweden)

Lim Hye-Youn

2011-01-01

Full Text Available Abstract An object tracking system using a variable search window (VSW algorithm based on color and feature points is proposed. A meanshift algorithm is an object tracking technique that works according to color probability distributions. An advantage of this algorithm based on color is that it is robust to specific color objects; however, a disadvantage is that it is sensitive to non-specific color objects due to illumination and noise. Therefore, to offset this weakness, it presents the VSW algorithm based on robust feature points for the accurate tracking of moving objects. The proposed method extracts the feature points of a detected object which is the region of interest (ROI, and generates a VSW using the given information which is the positions of extracted feature points. The goal of this paper is to achieve an efficient and effective object tracking system that meets the accurate tracking of moving objects. Through experiments, the object tracking system is implemented that it performs more precisely than existing techniques.

Fast-track program vs traditional care in surgery for gastric cancer.

Science.gov (United States)

Chen, Zhi-Xing; Liu, Ae-Huey Jennifer; Cen, Ying

2014-01-14

To systematically review the evidence for the effectiveness of fast-track program vs traditional care in laparoscopic or open surgery for gastric cancer. PubMed, Embase and the Cochrane library databases were electronically searched for published studies between January 1995 and April 2013, and only randomized trials were included. The references of relevant studies were manually searched for further studies that may have been missed. Search terms included "gastric cancer", "fast track" and "enhanced recovery". Five outcome variables were considered most suitable for analysis: postoperative hospital stay, medical cost, duration to first flatus, C-reactive protein (CRP) level and complications. Postoperative hospital stay was calculated from the date of operation to the date of discharge. Fixed effects model was used for meta-analysis. Compared with traditional care, fast-track program could significantly decrease the postoperative hospital stay [weighted mean difference (WMD) = -1.19, 95%CI: -1.79--0.60, P = 0.0001, fixed model], duration to first flatus (WMD = -6.82, 95%CI: -11.51--2.13, P = 0.004), medical costs (WMD = -2590, 95%CI: -4054--1126, P = 0.001), and the level of CRP (WMD = -17.78, 95%CI: -32.22--3.35, P = 0.0001) in laparoscopic surgery for gastric cancer. In open surgery for gastric cancer, fast-track program could also significantly decrease the postoperative hospital stay (WMD = -1.99, 95%CI: -2.09--1.89, P = 0.0001), duration to first flatus (WMD = -12.0, 95%CI: -18.89--5.11, P = 0.001), medical cost (WMD = -3674, 95%CI: -5025--2323, P = 0.0001), and the level of CRP (WMD = -27.34, 95%CI: -35.42--19.26, P = 0.0001). Furthermore, fast-track program did not significantly increase the incidence of complication (RR = 1.39, 95%CI: 0.77-2.51, P = 0.27, for laparoscopic surgery; and RR = 1.52, 95%CI: 0.90-2.56, P = 0.12, for open surgery). Our overall results suggested that compared with traditional care, fast-track program could result in shorter

Encoding color information for visual tracking: Algorithms and benchmark.

Science.gov (United States)

Liang, Pengpeng; Blasch, Erik; Ling, Haibin

2015-12-01

While color information is known to provide rich discriminative clues for visual inference, most modern visual trackers limit themselves to the grayscale realm. Despite recent efforts to integrate color in tracking, there is a lack of comprehensive understanding of the role color information can play. In this paper, we attack this problem by conducting a systematic study from both the algorithm and benchmark perspectives. On the algorithm side, we comprehensively encode 10 chromatic models into 16 carefully selected state-of-the-art visual trackers. On the benchmark side, we compile a large set of 128 color sequences with ground truth and challenge factor annotations (e.g., occlusion). A thorough evaluation is conducted by running all the color-encoded trackers, together with two recently proposed color trackers. A further validation is conducted on an RGBD tracking benchmark. The results clearly show the benefit of encoding color information for tracking. We also perform detailed analysis on several issues, including the behavior of various combinations between color model and visual tracker, the degree of difficulty of each sequence for tracking, and how different challenge factors affect the tracking performance. We expect the study to provide the guidance, motivation, and benchmark for future work on encoding color in visual tracking.

A Hardware Fast Tracker for the ATLAS Trigger: The Fast TracKer (FTK) Project.

CERN Document Server

Asbah, Nedaa; The ATLAS collaboration

2015-01-01

The trigger system of the ATLAS experiment is designed to reduce the event rate from the LHC nominal bunch crossing at 40 MHz to about 1 kHz, at the design luminosity of 10^{34} cm^{-2} s{-1}. After a successful period of data taking from 2010 to early 2013, the LHC is restarting in 2015 with much higher instantaneous luminosity and this will increase the load on High Level Trigger system, the second stage of the selection based on software algorithms. More sophisticated algorithms will be needed to achieve higher background rejection while maintaining good efficiency for interesting physics signals. The Fast TracKer is part of the ATLAS trigger upgrade project; it is a hardware processor that will provide, at every level-1 accept (100 kHz) and within 100 microseconds, full tracking information for tracks with momentum as low as 1 GeV. Providing fast extensive access to tracking information, with resolution comparable to the offline reconstruction, the Fast Tracker will for example help the High Level Trigger...

Successful integration of fast track projects into turnarounds

Energy Technology Data Exchange (ETDEWEB)

Williams, J. Patrick; Loureiro, Ramon C. [KBC Advanced Technologies, Surrey (United Kingdom)

2012-07-01

Fast track projects can provide quick wins and competitive advantage. However, in most cases the implementation of these projects requires a shutdown for installing the necessary tie-ins or integration into an upcoming turnaround (TA). Depending on the nature of the project and complexity of the TA, the integration can be seamless or result in cost or duration overruns and safety incidents. The risk of such overruns and safety incidents increases with the amount of project work to be integrated into the operations, maintenance and inspection schedules to be executed during the TA. The risk further increases with TA size and other factors. If not planned and scheduled properly and in a timely fashion, capital projects, in particular fast track projects trying to take advantage of an upcoming TA, can severely impact both TA performance, and the safety and reliability of the facility until the next opportunity for eliminating the defects introduced during the TA. Successful TAs are those delivered in a safe, on time, on budget manner, and with the quality standards needed for a leak-free start-up and a safe and reliable operation over the next run cycle. This paper discusses the key elements that are required to minimize the TA risks derived from the inclusion of fast track projects and how to establish the cut off criteria to either cancel or defer the project, or delay the TA in order to balance TA scope freeze and the case for compelling economics.(author)

Combination TLD/TED dose assessment

International Nuclear Information System (INIS)

Parkhurst, M.A.

1992-11-01

During the early 1980s, an appraisal of dosimetry programs at US Department of Energy (DOE) facilities identified a significant weakness in dose assessment in fast neutron environments. Basing neutron dose equivalent on thermoluminescence dosimeters (TLDS) was not entirely satisfactory for environments that had not been well characterized. In most operational situations, the dosimeters overrespond to neutrons, and this overresponse could be further exaggerated with changes in the neutron quality factor (Q). Because TLDs are energy dependent with an excellent response to thermal and low-energy neutrons but a weak response to fast neutrons, calibrating the dosimetry system to account for mixed and moderated neutron energy fields is a difficult and seldom satisfactory exercise. To increase the detection of fast neutrons and help improve the accuracy of dose equivalent determinations, a combination dosimeter was developed using TLDs to detect thermal and low-energy neutrons and a track-etch detector (TED) to detect fast neutrons. By combining the albedo energy response function of the TLDs with the track detector elements, the dosimeter can nearly match the fluence-to-dose equivalent conversion curve. The polymer CR-39 has neutron detection characteristics superior to other materials tested. The CR-39 track detector is beta and gamma insensitive and does not require backscatter (albedo) from the body to detect the exposure. As part of DOE's Personnel Neutron and Upgrade Program, we have been developing a R-39 track detector over the past decade to address detection and measurement of fast neutrons. Using CR-39 TEDs in combination with TLDs will now allow us to detect the wide spectrum of occupational neutron energies and assign dose equivalents much more confidently

Interacting with target tracking algorithms in a gaze-enhanced motion video analysis system

Science.gov (United States)

Hild, Jutta; Krüger, Wolfgang; Heinze, Norbert; Peinsipp-Byma, Elisabeth; Beyerer, Jürgen

2016-05-01

Motion video analysis is a challenging task, particularly if real-time analysis is required. It is therefore an important issue how to provide suitable assistance for the human operator. Given that the use of customized video analysis systems is more and more established, one supporting measure is to provide system functions which perform subtasks of the analysis. Recent progress in the development of automated image exploitation algorithms allow, e.g., real-time moving target tracking. Another supporting measure is to provide a user interface which strives to reduce the perceptual, cognitive and motor load of the human operator for example by incorporating the operator's visual focus of attention. A gaze-enhanced user interface is able to help here. This work extends prior work on automated target recognition, segmentation, and tracking algorithms as well as about the benefits of a gaze-enhanced user interface for interaction with moving targets. We also propose a prototypical system design aiming to combine both the qualities of the human observer's perception and the automated algorithms in order to improve the overall performance of a real-time video analysis system. In this contribution, we address two novel issues analyzing gaze-based interaction with target tracking algorithms. The first issue extends the gaze-based triggering of a target tracking process, e.g., investigating how to best relaunch in the case of track loss. The second issue addresses the initialization of tracking algorithms without motion segmentation where the operator has to provide the system with the object's image region in order to start the tracking algorithm.

An efficient and fast detection algorithm for multimode FBG sensing

DEFF Research Database (Denmark)

Ganziy, Denis; Jespersen, O.; Rose, B.

2015-01-01

We propose a novel dynamic gate algorithm (DGA) for fast and accurate peak detection. The algorithm uses threshold determined detection window and Center of gravity algorithm with bias compensation. We analyze the wavelength fit resolution of the DGA for different values of signal to noise ratio...... and different typical peak shapes. Our simulations and experiments demonstrate that the DGA method is fast and robust with higher stability and accuracy compared to conventional algorithms. This makes it very attractive for future implementation in sensing systems especially based on multimode fiber Bragg...

Face pose tracking using the four-point algorithm

Science.gov (United States)

Fung, Ho Yin; Wong, Kin Hong; Yu, Ying Kin; Tsui, Kwan Pang; Kam, Ho Chuen

2017-06-01

In this paper, we have developed an algorithm to track the pose of a human face robustly and efficiently. Face pose estimation is very useful in many applications such as building virtual reality systems and creating an alternative input method for the disabled. Firstly, we have modified a face detection toolbox called DLib for the detection of a face in front of a camera. The detected face features are passed to a pose estimation method, known as the four-point algorithm, for pose computation. The theory applied and the technical problems encountered during system development are discussed in the paper. It is demonstrated that the system is able to track the pose of a face in real time using a consumer grade laptop computer.

Fast and Practical Head Tracking in Brain Imaging with Time-of-Flight Camera

DEFF Research Database (Denmark)

Wilm, Jakob; Olesen, Oline Vinter; Jensen, Rasmus Ramsbøl

2013-01-01

scanners. Particularly in MRI and PET, the newest generation of TOF cameras could become a method of tracking small and large scale patient movement in a fast and user friendly way required in clinical environments. We present a novel methodology for fast tracking from TOF point clouds without the need...

Target tracking using DMLC for volumetric modulated arc therapy: A simulation study

Energy Technology Data Exchange (ETDEWEB)

Sun Baozhou; Rangaraj, Dharanipathy; Papiez, Lech; Oddiraju, Swetha; Yang Deshan; Li, H. Harold [Department of Radiation Oncology, School of Medicine, Washington University, 4921 Parkview Place, St. Louis, Missouri 63110 (United States); Department of Radiation Oncology, Southwestern Medical Center, University of Texas, Dallas, Texas 75390 (United States); Department of Radiation Oncology, School of Medicine, Washington University, 4921 Parkview Place, St. Louis, Missouri 63110 (United States)

2010-12-15

Purpose: Target tracking using dynamic multileaf collimator (DMLC) is a promising approach for intrafraction motion management in radiation therapy. The purpose of this work is to develop a DMLC tracking algorithm capable of delivering volumetric-modulated arc therapy (VMAT) to the targets that experience two-dimensional (2D) rigid motion in the beam's eye view. Methods: The problem of VMAT delivery to moving targets is formulated as a control problem with constraints. The relationships between gantry speed, gantry acceleration, MLC leaf-velocity, dose rate, and target motion are derived. An iterative search algorithm is developed to find numerical solutions for efficient delivery of a specific VMAT plan to the moving target using 2D DMLC tracking. The delivery of five VMAT lung plans is simulated. The planned and delivered fluence maps in the target-reference frame are calculated and compared. Results: The simulation demonstrates that the 2D tracking algorithm is capable of delivering the VMAT plan to a moving target fast and accurately without violating the machine constraints and the integrity of the treatment plan. The average delivery time is only 29 s longer than that of no-tracking delivery, 101 versus 72 s, respectively. The fluence maps are normalized to 200 MU and the average root-mean-square error between the desired and the delivered fluence is 2.1 MU, compared to 14.8 MU for no-tracking and 3.6 MU for one-dimensional tracking. Conclusions: A locally optimal MLC tracking algorithm for VMAT delivery is proposed, aiming at shortest delivery time while maintaining treatment plan invariant. The inconsequential increase of treatment time due to DMLC tracking is clinically desirable, which makes VMAT with DMLC tracking attractive in treating moving tumors.

Two algorithms for event track filtration in the ''road guidance'' regime

International Nuclear Information System (INIS)

Volkov, B.S.; Dikushin, Yu.V.; Matveev, V.A.; Fedotov, O.P.

1977-01-01

For final filtration of the tracks of events in bubble chambers are designed the HADRON and ELLIN programs for hydrogen and xenon bubble chambers respectively. The algorithm of the HADRON program is based on the assumption that the track trace coinciding with the desired track contains a maximum number of points. The program is written on the FORTRAN language for the BESM-6 computer. Processing time of one track is about 0.8 s. The algorithm of the ELLIN program is based on the criteria of the local association and smoothness of the track without any assumptions concerning its shape. The program is executed in two steps. During the first step the local associations are determined with adjacent elements for all the elements of the track trace. The second step deals with searching the chain of the locally associated elements satisfying the criteria of the desired track. The program is written on the ASSEMBLER-2 and FORTRAN-4 languages for the ES-1010 computer. Processing time of the track takes about 5 s

The application of artificial neural networks to TLD dose algorithm

International Nuclear Information System (INIS)

Moscovitch, M.

1997-01-01

We review the application of feed forward neural networks to multi element thermoluminescence dosimetry (TLD) dose algorithm development. A Neural Network is an information processing method inspired by the biological nervous system. A dose algorithm based on a neural network is a fundamentally different approach from conventional algorithms, as it has the capability to learn from its own experience. The neural network algorithm is shown the expected dose values (output) associated with a given response of a multi-element dosimeter (input) many times.The algorithm, being trained that way, eventually is able to produce its own unique solution to similar (but not exactly the same) dose calculation problems. For personnel dosimetry, the output consists of the desired dose components: deep dose, shallow dose, and eye dose. The input consists of the TL data obtained from the readout of a multi-element dosimeter. For this application, a neural network architecture was developed based on the concept of functional links network (FLN). The FLN concept allowed an increase in the dimensionality of the input space and construction of a neural network without any hidden layers. This simplifies the problem and results in a relatively simple and reliable dose calculation algorithm. Overall, the neural network dose algorithm approach has been shown to significantly improve the precision and accuracy of dose calculations. (authors)

Does fast-neutron radiotherapy merely reduce the radiation dose

International Nuclear Information System (INIS)

Ando, Koichi

1984-01-01

We examined whether fast-neutron radiotherapy is superior to low-LET radiotherpy by comparing the relationship between cell survival and tumor control probabilities after exposure of tumor-bearing (species) to the two modalities. Analysis based on TCD 50 assay and lung colony assay indicated that single dose of fast neutron achieved animal cures at higher survival rates than other radiation modalities including single and fractionated γ-ray doses, fractionated doses of fast neutron, and the mixed-beam scheme with a sequence of N-γ-γ-γ-N. We conclude that fast-neutron radiotherapy cured animal tumors with lower cell killing rates other radiation modalities. (author)

Serious renal and urological complications in fast-track primary total hip and knee arthroplasty

DEFF Research Database (Denmark)

Bjerregaard, Lars S; Jorgensen, Christoffer C; Kehlet, Henrik

2016-01-01

of stay > 4 days or 30-day readmissions after fast-track THA and TKA, we conducted a detailed observational study based upon prospectively collected pre-operative data and a complete 30-day follow-up on complications and re-admissions in a unselected cohort of 8,804 consecutive fast-track THAs and TKAs......BACKGROUND: Overall medical complications have been reduced after fast-track total hip (THA) and knee arthroplasty (TKA), but data on specific renal and urological (RU) complications are limited. METHODS: To describe the incidence and consequences of serious RU complications resulting in length...

PUC fast track nips returns

International Nuclear Information System (INIS)

Anon.

1990-01-01

In the first of what it says will be annual cost-of-capital proceedings to set returns on equity and rates of return on rate base for electric utilities, the California Public Utilities Commission (PUC) lowered from 1989 levels the 1990 returns on common equity (ROE) and rates of return (ROR) for the state's four major investor-owned electric utilities. Under this fast-track procedure, by May 8 of every year, utilities will have to file an application for rate adjustments that reflect their projected costs of capital for the following year

Trevino Project: a fast-track approach for a small construction project

International Nuclear Information System (INIS)

Schick, C.J.; Lynn, N.S.

1982-01-01

The approach to a construction project can vary according to the size, location, and degree of difficulty associated with the project. This paper deals with one approach that can be taken to a small construction project, the fast-track approach. A small construction project can be defined as a project having less than $20 million capital cost or a project with a low degree of difficulty. This approach is very applicable to in-situ leaching uranium projects, small precious metal operations, etc. The approach to the small project is that of fast-tracking the project in order to minimize the time over which capital expenditure occurs and also to reduce the indirect costs of field expense, construction supplies, construction equipment, etc. In order to fast-track a project it is necessary to do a very precise job on the preliminary phases of the project such as preliminary engineering, plant site location, environmental permits, etc. 2 figures, 2 tables

The risk of manipulation under anesthesia due to unsatisfactory knee flexion after fast-track total knee arthroplasty

DEFF Research Database (Denmark)

Wied, Christian; Thomsen, Morten G; Kallemose, Thomas

2015-01-01

BACKGROUND: Fast-track TKA has significantly shortened the time available for physiotherapists to optimize knee ROM before discharge. Safety aspects concerning knee stiffness and the need for manipulation in a fast-track setting need to be illuminated. The study aims were to analyze if fast-track...

On the Cooley-Turkey Fast Fourier algorithm for arbitrary factors ...

African Journals Online (AJOL)

Atonuje and Okonta in [1] developed the Cooley-Turkey Fast Fourier transform algorithm and its application to the Fourier transform of discretely sampled data points N, expressed in terms of a power y of 2. In this paper, we extend the formalism of [1] Cookey-Turkey Fast Fourier transform algorithm. The method is developed ...

A new fast algorithm for computing a complex number: Theoretic transforms

Science.gov (United States)

Reed, I. S.; Liu, K. Y.; Truong, T. K.

1977-01-01

A high-radix fast Fourier transformation (FFT) algorithm for computing transforms over GF(sq q), where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional FFT.

Time-driven Activity-based Cost of Fast-Track Total Hip and Knee Arthroplasty

DEFF Research Database (Denmark)

Andreasen, Signe E; Holm, Henriette B; Jørgensen, Mira

2017-01-01

this between 2 departments with different logistical set-ups. METHODS: Prospective data collection was analyzed using the time-driven activity-based costing method (TDABC) on time consumed by different staff members involved in patient treatment in the perioperative period of fast-track THA and TKA in 2 Danish...... orthopedic departments with standardized fast-track settings, but different logistical set-ups. RESULTS: Length of stay was median 2 days in both departments. TDABC revealed minor differences in the perioperative settings between departments, but the total cost excluding the prosthesis was similar at USD......-track methodology, the result could be a more cost-effective pathway altogether. As THA and TKA are potentially costly procedures and the numbers are increasing in an economical limited environment, the aim of this study is to present baseline detailed economical calculations of fast-track THA and TKA and compare...

Readmissions after fast-track hip and knee arthroplasty

DEFF Research Database (Denmark)

Husted, Henrik; Otte, Niels Kristian Stahl; Kristensen, Billy B

2010-01-01

With the implementation of fast-track surgery with optimization of both logistical and clinical features, the postoperative convalescence has been reduced as functional milestones have been achieved earlier and consequently length of stay (LOS) in hospital has been reduced. However, it has been...

Fast-Track Cleanup at Closing DoD Installations

Science.gov (United States)

The Fast-Track Cleanup program strives to make parcels available for reuse as quickly as possible by the transfer of uncontaminated or remediated parcels, the lease of contaminated parcels where cleanup is underway, or the 'early transfer' of contaminated property undergoing cleanup.

Patient-reported outcome after fast-track knee arthroplasty

DEFF Research Database (Denmark)

Larsen, Kristian; Hansen, Torben B; Søballe, Kjeld

2012-01-01

PURPOSE: The purpose of this study was to describe patient-related functional outcomes after fast-track total knee arthroplasty and unicompartmental knee arthroplasty. Furthermore, we wanted to assess physical areas where an additional need for rehabilitation could be identified, and finally, we...

Online dose reconstruction for tracked volumetric arc therapy: Real-time implementation and offline quality assurance for prostate SBRT.

Science.gov (United States)

Kamerling, Cornelis Ph; Fast, Martin F; Ziegenhein, Peter; Menten, Martin J; Nill, Simeon; Oelfke, Uwe

2017-11-01

Firstly, this study provides a real-time implementation of online dose reconstruction for tracked volumetric arc therapy (VMAT). Secondly, this study describes a novel offline quality assurance tool, based on commercial dose calculation algorithms. Online dose reconstruction for VMAT is a computationally challenging task in terms of computer memory usage and calculation speed. To potentially reduce the amount of memory used, we analyzed the impact of beam angle sampling for dose calculation on the accuracy of the dose distribution. To establish the performance of the method, we planned two single-arc VMAT prostate stereotactic body radiation therapy cases for delivery with dynamic MLC tracking. For quality assurance of our online dose reconstruction method we have also developed a stand-alone offline dose reconstruction tool, which utilizes the RayStation treatment planning system to calculate dose. For the online reconstructed dose distributions of the tracked deliveries, we could establish strong resemblance for 72 and 36 beam co-planar equidistant beam samples with less than 1.2% deviation for the assessed dose-volume indicators (clinical target volume D98 and D2, and rectum D2). We could achieve average runtimes of 28-31 ms per reported MLC aperture for both dose computation and accumulation, meeting our real-time requirement. To cross-validate the offline tool, we have compared the planned dose to the offline reconstructed dose for static deliveries and found excellent agreement (3%/3 mm global gamma passing rates of 99.8%-100%). Being able to reconstruct dose during delivery enables online quality assurance and online replanning strategies for VMAT. The offline quality assurance tool provides the means to validate novel online dose reconstruction applications using a commercial dose calculation engine. © 2017 The Authors. Medical Physics published by Wiley Periodicals, Inc. on behalf of American Association of Physicists in Medicine.

Comparison of tracking algorithms implemented in OpenCV

Directory of Open Access Journals (Sweden)

Janku Peter

2016-01-01

Full Text Available Computer vision is very progressive and modern part of computer science. From scientific point of view, theoretical aspects of computer vision algorithms prevail in many papers and publications. The underlying theory is really important, but on the other hand, the final implementation of an algorithm significantly affects its performance and robustness. For this reason, this paper tries to compare real implementation of tracking algorithms (one part of computer vision problem, which can be found in the very popular library OpenCV. Moreover, the possibilities of optimizations are discussed.

Three dimensional implementation of anisotropy corrected fast fourier transform dose calculation around brachytherapy seeds

International Nuclear Information System (INIS)

Kyeremeh, P.O.

2011-01-01

Current-available brachytherapy dose computation algorithms ignore heterogeneities such as tissue-air interfaces, shielded gynaecological colpostats, and tissue-composition variations in source implants despite dose computation errors as large as 40%. A convolution kernel, which takes into consideration anisotropy of the dose distribution around a brachytherapy source, and to compute dose in the presence of tissue and applicator heterogeneities, has been established. Resulting from the convolution kernel are functions with polynomial and exponential terms. the solution to the convolution integral was represented by the Fast Fourier transform. The Fast Fourier transform has shown enough potency in accounting for errors due to these heterogeneities and the versatility of this Fast Fourier transform is evident from its capability of switching in between fields. Thus successful procedures in external beam could be adopted in brachytherapy to a yield similar effect. A dose deposition kernel was developed for a 64x64x64 matrix size with wrap around ordering and convoluted with the distribution of the sources in 3D. With MatLab's inverse Fast Fourier transform, dose rate distribution for a given array of interstitial sources, typical of brachytherapy was calculated. The shape of the dose rate distribution peaks appeared comparable with the output expected from computerized treatment planning systems for brachytherapy. Subsequently, the study confirmed the speed and accuracy of dose computation using the FFT convolution as well juxtaposed. Although, dose rate peaks from both the FFT convolution and the TPS(TG43) did not compare quantitatively, which was mainly due to the TPS(TG43) initiation computations from the origin (0,0,0) unlike the FFT convolution which uses sampling points; N=1,2,3..., there is a strong basis for establishing parity since the dose rate peaks compared qualitatively. With both modes compared, the discrepancies in the dose rates ranged between 3.6% to

High speed railway track dynamics models, algorithms and applications

CERN Document Server

Lei, Xiaoyan

2017-01-01

This book systematically summarizes the latest research findings on high-speed railway track dynamics, made by the author and his research team over the past decade. It explores cutting-edge issues concerning the basic theory of high-speed railways, covering the dynamic theories, models, algorithms and engineering applications of the high-speed train and track coupling system. Presenting original concepts, systematic theories and advanced algorithms, the book places great emphasis on the precision and completeness of its content. The chapters are interrelated yet largely self-contained, allowing readers to either read through the book as a whole or focus on specific topics. It also combines theories with practice to effectively introduce readers to the latest research findings and developments in high-speed railway track dynamics. It offers a valuable resource for researchers, postgraduates and engineers in the fields of civil engineering, transportation, highway & railway engineering.

Development of Ultra-Fast Silicon Detectors for 4D tracking

Science.gov (United States)

Staiano, A.; Arcidiacono, R.; Boscardin, M.; Dalla Betta, G. F.; Cartiglia, N.; Cenna, F.; Ferrero, M.; Ficorella, F.; Mandurrino, M.; Obertino, M.; Pancheri, L.; Paternoster, G.; Sola, V.

2017-12-01

In this contribution we review the progress towards the development of a novel type of silicon detectors suited for tracking with a picosecond timing resolution, the so called Ultra-Fast Silicon Detectors. The goal is to create a new family of particle detectors merging excellent position and timing resolution with GHz counting capabilities, very low material budget, radiation resistance, fine granularity, low power, insensitivity to magnetic field, and affordability. We aim to achieve concurrent precisions of ~ 10 ps and ~ 10 μm with a 50 μm thick sensor. Ultra-Fast Silicon Detectors are based on the concept of Low-Gain Avalanche Detectors, which are silicon detectors with an internal multiplication mechanism so that they generate a signal which is factor ~10 larger than standard silicon detectors. The basic design of UFSD consists of a thin silicon sensor with moderate internal gain and pixelated electrodes coupled to full custom VLSI chip. An overview of test beam data on time resolution and the impact on this measurement of radiation doses at the level of those expected at HL-LHC is presented. First I-V and C-V measurements on a new FBK sensor production of UFSD, 50 μm thick, with B and Ga, activated at two diffusion temperatures, with and without C co-implantation (in Low and High concentrations), and with different effective doping concentrations in the Gain layer, are shown. Perspectives on current use of UFSD in HEP experiments (UFSD detectors have been installed in the CMS-TOTEM Precision Protons Spectrometer for the forward physics tracking, and are currently taking data) and proposed applications for a MIP timing layer in the HL-LHC upgrade are briefly discussed.

Realization of 3D evaluation algorithm in dose-guided radiotherapy

International Nuclear Information System (INIS)

Wang Yu; Li Gui; Wang Dong; Wu Yican; FDS Team

2012-01-01

3D evaluation algorithm instead of 2D evaluation method of clinical dose verification is highly needed for dose evaluation in Dose-guided Radiotherapy. 3D evaluation algorithm of three evaluation methods, including Dose Difference, Distance-To-Agreement and 7 Analysis, was realized by the tool of Visual C++ according to the formula. Two plans were designed to test the algorithm, plan 1 was radiation on equivalent water using square field for the verification of the algorithm's correctness; plan 2 was radiation on the emulation head phantom using conformal field for the verification of the algorithm's practicality. For plan 1, the dose difference, in the tolerance range has a pass rate of 100%, the Distance-To-Agreement and 7 analysis was of a pass rate of 100% in the tolerance range, and a pass rate of 99±1% at the boundary of range. For plan 2, the pass rate of algorithm were 88.35%, 100%, 95.07% for the three evaluation methods, respectively. It can be concluded that the 3D evaluation algorithm is feasible and could be used to evaluate 3D dose distributions in Dose-guided Radiotherapy. (authors)

Design of a Hardware Track Finder (Fast Tracker) for the ATLAS Trigger

CERN Document Server

AUTHOR|(INSPIRE)INSPIRE-00010976; Albicocco, P.; Alison, J.; Ancu, L.S.; Anderson, J.; Andari, N.; Andreani, A.; Andreazza, A.; Annovi, A.; Antonelli, M.; Asbah, N.; Atkinson, M.; Baines, J.; Barberio, E.; Beccherle, R.; Beretta, M.; Bertolucci, F.; Biesuz, N.V.; Blair, R.; Bogdan, M.; Boveia, A.; Britzger, D.; Bryant, P.; Burghgrave, B.; Calderini, G.; Camplani, A.; Cavasinni, V.; Chakraborty, D.; Chang, P.; Cheng, Y.; Citraro, S.; Citterio, M.; Crescioli, F.; Dawe, N.; Dell'Orso, M.; Donati, S.; Dondero, P.; Drake, G.; Gadomski, S.; Gatta, M.; Gentsos, C.; Giannetti, P.; Gkaitatzis, S.; Gramling, J.; Howarth, J.W.; Iizawa, T.; Ilic, N.; Jiang, Z.; Kaji, T.; Kasten, M.; Kawaguchi, Y.; Kim, Y.K.; Kimura, N.; Klimkovich, T.; Kolb, M.; Kordas, K.; Krizka, K.; Kubota, T.; Lanza, A.; Li, H.L.; Liberali, V.; Lisovyi, M.; Liu, L.; Love, J.; Luciano, P.; Luongo, C.; Magalotti, D.; Maznas, I.; Meroni, C.; Mitani, T.; Nasimi, H.; Negri, A.; Neroutsos, P.; Neubauer, M.; Nikolaidis, S.; Okumura, Y.; Pandini, C.; Petridou, C.; Piendibene, M.; Proudfoot, J.; Rados, P.; Roda, C.; Rossi, E.; Sakurai, Y.; Sampsonidis, D.; Saxon, J.; Schmitt, S.; Schoening, A.; Shochet, M.; Shojaii, S.; Soltveit, H.; Sotiropoulou, C.L.; Stabile, A.; Swiatlowski, M.; Tang, F.; Taylor, P.T.; Testa, M.; Tompkins, L.; Vercesi, V.; Volpi, G.; Wang, R.; Watari, R.; Webster, J.; Wu, X.; Yorita, K.; Yurkewicz, A.; Zeng, J.C.; Zhang, J.; Zou, R.

2016-01-01

The use of tracking information at the trigger level in the LHC Run II period is crucial for the trigger an data acquisition (TDAQ) system and will be even more so as contemporary collisions that occur at every bunch crossing will increase in Run III. The Fast TracKer (FTK) is part of the ATLAS trigger upgrade project; it is a hardware processor that will provide every Level-1 accepted event (100 kHz) and within 100$\\mu$s, full tracking information for tracks with momentum as low as 1 GeV. Providing fast, extensive access to tracking information, with resolution comparable to the offline reconstruction, FTK will help in precise detection of the primary and secondary vertices to ensure robust selections and improve the trigger performance.

An energy-saving nonlinear position control strategy for electro-hydraulic servo systems.

Science.gov (United States)

Baghestan, Keivan; Rezaei, Seyed Mehdi; Talebi, Heidar Ali; Zareinejad, Mohammad

2015-11-01

The electro-hydraulic servo system (EHSS) demonstrates numerous advantages in size and performance compared to other actuation methods. Oftentimes, its utilization in industrial and machinery settings is limited by its inferior efficiency. In this paper, a nonlinear backstepping control algorithm with an energy-saving approach is proposed for position control in the EHSS. To achieve improved efficiency, two control valves including a proportional directional valve (PDV) and a proportional relief valve (PRV) are used to achieve the control objectives. To design the control algorithm, the state space model equations of the system are transformed to their normal form and the control law through the PDV is designed using a backstepping approach for position tracking. Then, another nonlinear set of laws is derived to achieve energy-saving through the PRV input. This control design method, based on the normal form representation, imposes internal dynamics on the closed-loop system. The stability of the internal dynamics is analyzed in special cases of operation. Experimental results verify that both tracking and energy-saving objectives are satisfied for the closed-loop system. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Convalescence after colonic resection with fast-track versus conventional care

DEFF Research Database (Denmark)

Hjort Jakobsen, D; Sonne, E; Basse, L

2004-01-01

BACKGROUND: Multi-modal rehabilitation programmes may improve early postoperative body composition, pulmonary function, exercise capacity, and reduce hospital stay. So far, no data are available on convalescence after discharge. AIM: The objectives were to compare convalescence data (fatigue, sleep...... vs. 8 days in the fast-track vs. conventional care group, respectively (p sleep were increased in the conventional care group when compared with the fast-track group (p ... results in earlier resumption of normal activities with reduced fatigue and need for sleep postoperatively compared to conventional care, and without increased need for nursing care or visits to general practitioners. However, readmissions may occur more frequently....

A Hybrid Maximum Power Point Tracking Approach for Photovoltaic Systems under Partial Shading Conditions Using a Modified Genetic Algorithm and the Firefly Algorithm

Directory of Open Access Journals (Sweden)

Yu-Pei Huang

2018-01-01

Full Text Available This paper proposes a modified maximum power point tracking (MPPT algorithm for photovoltaic systems under rapidly changing partial shading conditions (PSCs. The proposed algorithm integrates a genetic algorithm (GA and the firefly algorithm (FA and further improves its calculation process via a differential evolution (DE algorithm. The conventional GA is not advisable for MPPT because of its complicated calculations and low accuracy under PSCs. In this study, we simplified the GA calculations with the integration of the DE mutation process and FA attractive process. Results from both the simulation and evaluation verify that the proposed algorithm provides rapid response time and high accuracy due to the simplified processing. For instance, evaluation results demonstrate that when compared to the conventional GA, the execution time and tracking accuracy of the proposed algorithm can be, respectively, improved around 69.4% and 4.16%. In addition, in comparison to FA, the tracking speed and tracking accuracy of the proposed algorithm can be improved around 42.9% and 1.85%, respectively. Consequently, the major improvement of the proposed method when evaluated against the conventional GA and FA is tracking speed. Moreover, this research provides a framework to integrate multiple nature-inspired algorithms for MPPT. Furthermore, the proposed method is adaptable to different types of solar panels and different system formats with specifically designed equations, the advantages of which are rapid tracking speed with high accuracy under PSCs.

Using Genetic Algorithm for Eye Detection and Tracking in Video Sequence

Directory of Open Access Journals (Sweden)

Takuya Akashi

2007-04-01

Full Text Available We propose a high-speed size and orientation invariant eye tracking method, which can acquire numerical parameters to represent the size and orientation of the eye. In this paper, we discuss that high tolerance in human head movement and real-time processing that are needed for many applications, such as eye gaze tracking. The generality of the method is also important. We use template matching with genetic algorithm, in order to overcome these problems. A high speed and accuracy tracking scheme using Evolutionary Video Processing for eye detection and tracking is proposed. Usually, a genetic algorithm is unsuitable for a real-time processing, however, we achieved real-time processing. The generality of this proposed method is provided by the artificial iris template used. In our simulations, an eye tracking accuracy is 97.9% and, an average processing time of 28 milliseconds per frame.

A motion-compensated image filter for low-dose fluoroscopy in a real-time tumor-tracking radiotherapy system

International Nuclear Information System (INIS)

Miyamoto, Naoki; Ishikawa, Masayori; Sutherland, Kenneth

2015-01-01

In the real-time tumor-tracking radiotherapy system, a surrogate fiducial marker inserted in or near the tumor is detected by fluoroscopy to realize respiratory-gated radiotherapy. The imaging dose caused by fluoroscopy should be minimized. In this work, an image processing technique is proposed for tracing a moving marker in low-dose imaging. The proposed tracking technique is a combination of a motion-compensated recursive filter and template pattern matching. The proposed image filter can reduce motion artifacts resulting from the recursive process based on the determination of the region of interest for the next frame according to the current marker position in the fluoroscopic images. The effectiveness of the proposed technique and the expected clinical benefit were examined by phantom experimental studies with actual tumor trajectories generated from clinical patient data. It was demonstrated that the marker motion could be traced in low-dose imaging by applying the proposed algorithm with acceptable registration error and high pattern recognition score in all trajectories, although some trajectories were not able to be tracked with the conventional spatial filters or without image filters. The positional accuracy is expected to be kept within ±2 mm. The total computation time required to determine the marker position is a few milliseconds. The proposed image processing technique is applicable for imaging dose reduction. (author)

Evaluation of dose calculation algorithms using the treatment planning system Xi O with tissue heterogeneity correction turned on; Validacao dos algoritmos de calculo de dose do sistema de planejamento Xi O considerando as correcoes para heterogeneidade dos tecidos

Energy Technology Data Exchange (ETDEWEB)

Fairbanks, Leandro R.; Barbi, Gustavo L.; Silva, Wiliam T.; Reis, Eduardo G.F.; Borges, Leandro F.; Bertucci, Edenyse C.; Maciel, Marina F.; Amaral, Leonardo L., E-mail: lefairbanks@yahoo.com.b [Universidade de Sao Paulo (HCRP/USP), Ribeirao Preto, SP (Brazil). Hospital das Clinicas. Servico de Radioterapia

2011-07-01

Since the cross-section for various radiation interactions is dependent upon tissue material, the presence of heterogeneities affects the final dose delivered. This paper aims to analyze how different treatment planning algorithms (Fast Fourier Transform, Convolution, Superposition, Fast Superposition and Clarkson) work when heterogeneity corrections are used. To that end, a farmer-type ionization chamber was positioned reproducibly (during the time of CT as well as irradiation) inside several phantoms made of aluminum, bone, cork and solid water slabs. The percent difference between the dose measured and calculated by the various algorithms was less than 5%.The convolution method shows better results for high density materials (difference {approx}1 %), whereas the Superposition algorithm is more accurate for low densities (around 1,1%). (author)

Why still in hospital after fast-track hip and knee arthroplasty?

DEFF Research Database (Denmark)

Husted, Henrik; Lunn, Troels H; Troelsen, Anders

2011-01-01

Background and purpose Length of stay (LOS) following total hip and knee arthroplasty (THA and TKA) has been reduced to about 3 days in fast-track setups with functional discharge criteria. Earlier studies have identified patient characteristics predicting LOS, but little is known about specific...... reasons for being hospitalized following fast-track THA and TKA. Patients and methods To determine clinical and logistical factors that keep patients in hospital for the first postoperative 24-72 hours, we performed a cohort study of consecutive, unselected patients undergoing unilateral primary THA (n...

[Comparison of dose calculation algorithms in stereotactic radiation therapy in lung].

Science.gov (United States)

Tomiyama, Yuki; Araki, Fujio; Kanetake, Nagisa; Shimohigashi, Yoshinobu; Tominaga, Hirofumi; Sakata, Jyunichi; Oono, Takeshi; Kouno, Tomohiro; Hioki, Kazunari

2013-06-01

Dose calculation algorithms in radiation treatment planning systems (RTPSs) play a crucial role in stereotactic body radiation therapy (SBRT) in the lung with heterogeneous media. This study investigated the performance and accuracy of dose calculation for three algorithms: analytical anisotropic algorithm (AAA), pencil beam convolution (PBC) and Acuros XB (AXB) in Eclipse (Varian Medical Systems), by comparison against the Voxel Monte Carlo algorithm (VMC) in iPlan (BrainLab). The dose calculations were performed with clinical lung treatments under identical planning conditions, and the dose distributions and the dose volume histogram (DVH) were compared among algorithms. AAA underestimated the dose in the planning target volume (PTV) compared to VMC and AXB in most clinical plans. In contrast, PBC overestimated the PTV dose. AXB tended to slightly overestimate the PTV dose compared to VMC but the discrepancy was within 3%. The discrepancy in the PTV dose between VMC and AXB appears to be due to differences in physical material assignments, material voxelization methods, and an energy cut-off for electron interactions. The dose distributions in lung treatments varied significantly according to the calculation accuracy of the algorithms. VMC and AXB are better algorithms than AAA for SBRT.

Usefulness of Guided Breathing for Dose Rate-Regulated Tracking

International Nuclear Information System (INIS)

Han-Oh, Sarah; Yi, Byong Yong; Berman, Barry L.; Lerma, Fritz; Yu, Cedric

2009-01-01

Purpose: To evaluate the usefulness of guided breathing for dose rate-regulated tracking (DRRT), a new technique to compensate for intrafraction tumor motion. Methods and Materials: DRRT uses a preprogrammed multileaf collimator sequence that tracks the tumor motion derived from four-dimensional computed tomography and the corresponding breathing signals measured before treatment. Because the multileaf collimator speed can be controlled by adjusting the dose rate, the multileaf collimator positions are adjusted in real time during treatment by dose rate regulation, thereby maintaining synchrony with the tumor motion. DRRT treatment was simulated with free, audio-guided, and audiovisual-guided breathing signals acquired from 23 lung cancer patients. The tracking error and duty cycle for each patient were determined as a function of the system time delay (range, 0-1.0 s). Results: The tracking error and duty cycle averaged for all 23 patients was 1.9 ± 0.8 mm and 92% ± 5%, 1.9 ± 1.0 mm and 93% ± 6%, and 1.8 ± 0.7 mm and 92% ± 6% for the free, audio-guided, and audiovisual-guided breathing, respectively, for a time delay of 0.35 s. The small differences in both the tracking error and the duty cycle with guided breathing were not statistically significant. Conclusion: DRRT by its nature adapts well to variations in breathing frequency, which is also the motivation for guided-breathing techniques. Because of this redundancy, guided breathing does not result in significant improvements for either the tracking error or the duty cycle when DRRT is used for real-time tumor tracking

An Extended Kalman Filter-Based Attitude Tracking Algorithm for Star Sensors.

Science.gov (United States)

Li, Jian; Wei, Xinguo; Zhang, Guangjun

2017-08-21

Efficiency and reliability are key issues when a star sensor operates in tracking mode. In the case of high attitude dynamics, the performance of existing attitude tracking algorithms degenerates rapidly. In this paper an extended Kalman filtering-based attitude tracking algorithm is presented. The star sensor is modeled as a nonlinear stochastic system with the state estimate providing the three degree-of-freedom attitude quaternion and angular velocity. The star positions in the star image are predicted and measured to estimate the optimal attitude. Furthermore, all the cataloged stars observed in the sensor field-of-view according the predicted image motion are accessed using a catalog partition table to speed up the tracking, called star mapping. Software simulation and night-sky experiment are performed to validate the efficiency and reliability of the proposed method.

Robust perception algorithms for road and track autonomous following

Science.gov (United States)

Marion, Vincent; Lecointe, Olivier; Lewandowski, Cecile; Morillon, Joel G.; Aufrere, Romuald; Marcotegui, Beatrix; Chapuis, Roland; Beucher, Serge

2004-09-01

The French Military Robotic Study Program (introduced in Aerosense 2003), sponsored by the French Defense Procurement Agency and managed by Thales Airborne Systems as the prime contractor, focuses on about 15 robotic themes, which can provide an immediate "operational add-on value." The paper details the "road and track following" theme (named AUT2), which main purpose was to develop a vision based sub-system to automatically detect roadsides of an extended range of roads and tracks suitable to military missions. To achieve the goal, efforts focused on three main areas: (1) Improvement of images quality at algorithms inputs, thanks to the selection of adapted video cameras, and the development of a THALES patented algorithm: it removes in real time most of the disturbing shadows in images taken in natural environments, enhances contrast and lowers reflection effect due to films of water. (2) Selection and improvement of two complementary algorithms (one is segment oriented, the other region based) (3) Development of a fusion process between both algorithms, which feeds in real time a road model with the best available data. Each previous step has been developed so that the global perception process is reliable and safe: as an example, the process continuously evaluates itself and outputs confidence criteria qualifying roadside detection. The paper presents the processes in details, and the results got from passed military acceptance tests, which trigger the next step: autonomous track following (named AUT3).

Online Tracking Algorithms on GPUs for the P̅ANDA Experiment at FAIR

Science.gov (United States)

Bianchi, L.; Herten, A.; Ritman, J.; Stockmanns, T.; Adinetz, A.; Kraus, J.; Pleiter, D.

2015-12-01

P̅ANDA is a future hadron and nuclear physics experiment at the FAIR facility in construction in Darmstadt, Germany. In contrast to the majority of current experiments, PANDA's strategy for data acquisition is based on event reconstruction from free-streaming data, performed in real time entirely by software algorithms using global detector information. This paper reports the status of the development of algorithms for the reconstruction of charged particle tracks, optimized online data processing applications, using General-Purpose Graphic Processing Units (GPU). Two algorithms for trackfinding, the Triplet Finder and the Circle Hough, are described, and details of their GPU implementations are highlighted. Average track reconstruction times of less than 100 ns are obtained running the Triplet Finder on state-of- the-art GPU cards. In addition, a proof-of-concept system for the dispatch of data to tracking algorithms using Message Queues is presented.

Artificial Neural Network In Maximum Power Point Tracking Algorithm Of Photovoltaic Systems

Directory of Open Access Journals (Sweden)

Modestas Pikutis

2014-05-01

Full Text Available Scientists are looking for ways to improve the efficiency of solar cells all the time. The efficiency of solar cells which are available to the general public is up to 20%. Part of the solar energy is unused and a capacity of solar power plant is significantly reduced – if slow controller or controller which cannot stay at maximum power point of solar modules is used. Various algorithms of maximum power point tracking were created, but mostly algorithms are slow or make mistakes. In the literature more and more oftenartificial neural networks (ANN in maximum power point tracking process are mentioned, in order to improve performance of the controller. Self-learner artificial neural network and IncCond algorithm were used for maximum power point tracking in created solar power plant model. The algorithm for control was created. Solar power plant model is implemented in Matlab/Simulink environment.

An innovative strategy to increase a professional workforce: the fast track initiative for health visitors in England.

Science.gov (United States)

Sayer, Lynn; Barriball, K Louise; Bliss, Julie; Bakhshi, Savita; While, Alison E

2016-04-01

Fast tracking is one strategy that organizations use to ameliorate workforce shortfalls by attracting new recruits, and accelerating their skills development and experience. In response to the Government's target of rapidly expanding the number of health visitors in England's National Health Service, the fast track initiative was launched to recruit newly qualified (fast track) as well as experienced (standard entry) nurses and midwives onto health visiting programmes. This paper evaluates the fast track initiative, from the perspective of fast track and standard entry students, practice teachers and health visitor managers. A mixed methods design was used comprising a questionnaire survey (n = 71 students), semi-structured interviews (n = 37 students), telephone interviews (n = 13 managers) and six focus groups (n = 24 practice teachers). Data were collected between April 2012 and July 2013. Descriptive statistics, t-tests and the Pearson Chi-square test were used to analyse the quantitative data. The qualitative data were analysed thematically. Motivations for health visiting as a career choice were similar for fast track and standard entry students, with career progression and interest in health promotion being key motivators. There was consensus that personal qualities and characteristics were more important than experience or qualifications. However, fast track students were significantly less confident about their public health competencies in leadership and management (p communication (p  0.5). Fast tracking offers a useful recruitment strategy in order to expand the health visitor workforce, but longitudinal research is needed to confirm benefits such as retention and career trajectories. © The Author(s) 2015.

Controlling type I error rate for fast track drug development programmes.

Science.gov (United States)

Shih, Weichung J; Ouyang, Peter; Quan, Hui; Lin, Yong; Michiels, Bart; Bijnens, Luc

2003-03-15

The U.S. Food and Drug Administration (FDA) Modernization Act of 1997 has a Section (No. 112) entitled 'Expediting Study and Approval of Fast Track Drugs' (the Act). In 1998, the FDA issued a 'Guidance for Industry: the Fast Track Drug Development Programs' (the FTDD programmes) to meet the requirement of the Act. The purpose of FTDD programmes is to 'facilitate the development and expedite the review of new drugs that are intended to treat serious or life-threatening conditions and that demonstrate the potential to address unmet medical needs'. Since then many health products have reached patients who suffered from AIDS, cancer, osteoporosis, and many other diseases, sooner by utilizing the Fast Track Act and the FTDD programmes. In the meantime several scientific issues have also surfaced when following the FTDD programmes. In this paper we will discuss the concept of two kinds of type I errors, namely, the 'conditional approval' and the 'final approval' type I errors, and propose statistical methods for controlling them in a new drug submission process. Copyright 2003 John Wiley & Sons, Ltd.

Fast tracking in adult cardiac surgery at Pakistan Institute of Medical Sciences

International Nuclear Information System (INIS)

Ahmed, N.; Khan, F.; Zahoor, M.; Rafique, M.; Faisal, M.

2010-01-01

Background: Early extubation after cardiac operation is an important aspect of fast-track cardiac anaesthesia. The length of stay in ICU limits utilisation of operation theatre in cardiac surgery. Increasing cost, limited resources, and newer surgical strategies have stimulated effectiveness of all routines in cardiac surgery, anaesthesia, and intensive care. Aim of this study was to determine the feasibility of fast-tracking in adult cardiac surgery and its effects on post operative recovery in our setup. Methods: This descriptive study was conducted over 14 months between Jul 16, 2007 to Sep 16, 2008. All the open heart cases were included unless absolute contraindications were there. We applied the rapid recovery protocol adopted from Oslo Hospital Norway in an attempt to achieve fast-tracking in our setup. Results: Two-hundred-seventy-four consecutive cases out of 400 operated cases were included in this study. Mean age was 47.69 +- 15.11 years, 27.7% were females, 5.8% were emergency cases, 5.1% were COPD, 11.1% were atrial fibrillation, and 6.9% were NYHA class-III cases. CABG was done in 66.1% cases and mean CPB-time was 75.92 +- 16.20 min. Mean Ventilation-time was 4.47+-4.48 hrs., 86% patients were fast-tracked to be extubated within 6 hours, and 85.4% patients remained free of post-op complications. Six (2.2%) re-intubatIions, 2.6% arrhythmias, 6.6% pleural effusions and 2.2% consolidation were observed post-operatively. Mean ICU stay was 2.49 +- 0.95 days and in-hospital mortality was 2.2%. Conclusion: Fast-tracking with extubation within 6 hours is feasible approach which minimises the post-operative complications significantly in adult cardiac surgical patients. (author)

A real-time regional adaptive exposure method for saving dose-area product in x-ray fluoroscopy

International Nuclear Information System (INIS)

Burion, Steve; Funk, Tobias; Speidel, Michael A.

2013-01-01

Purpose: Reduction of radiation dose in x-ray imaging has been recognized as a high priority in the medical community. Here the authors show that a regional adaptive exposure method can reduce dose-area product (DAP) in x-ray fluoroscopy. The authors' method is particularly geared toward providing dose savings for the pediatric population. Methods: The scanning beam digital x-ray system uses a large-area x-ray source with 8000 focal spots in combination with a small photon-counting detector. An imaging frame is obtained by acquiring and reconstructing up to 8000 detector images, each viewing only a small portion of the patient. Regional adaptive exposure was implemented by varying the exposure of the detector images depending on the local opacity of the object. A family of phantoms ranging in size from infant to obese adult was imaged in anteroposterior view with and without adaptive exposure. The DAP delivered to each phantom was measured in each case, and noise performance was compared by generating noise arrays to represent regional noise in the images. These noise arrays were generated by dividing the image into regions of about 6 mm 2 , calculating the relative noise in each region, and placing the relative noise value of each region in a one-dimensional array (noise array) sorted from highest to lowest. Dose-area product savings were calculated as the difference between the ratio of DAP with adaptive exposure to DAP without adaptive exposure. The authors modified this value by a correction factor that matches the noise arrays where relative noise is the highest to report a final dose-area product savings. Results: The average dose-area product saving across the phantom family was (42 ± 8)% with the highest dose-area product saving in the child-sized phantom (50%) and the lowest in the phantom mimicking an obese adult (23%). Conclusions: Phantom measurements indicate that a regional adaptive exposure method can produce large DAP savings without compromising

3D head pose estimation and tracking using particle filtering and ICP algorithm

KAUST Repository

Ben Ghorbel, Mahdi; Baklouti, Malek; Couvet, Serge

2010-01-01

This paper addresses the issue of 3D head pose estimation and tracking. Existing approaches generally need huge database, training procedure, manual initialization or use face feature extraction manually extracted. We propose a framework for estimating the 3D head pose in its fine level and tracking it continuously across multiple Degrees of Freedom (DOF) based on ICP and particle filtering. We propose to approach the problem, using 3D computational techniques, by aligning a face model to the 3D dense estimation computed by a stereo vision method, and propose a particle filter algorithm to refine and track the posteriori estimate of the position of the face. This work comes with two contributions: the first concerns the alignment part where we propose an extended ICP algorithm using an anisotropic scale transformation. The second contribution concerns the tracking part. We propose the use of the particle filtering algorithm and propose to constrain the search space using ICP algorithm in the propagation step. The results show that the system is able to fit and track the head properly, and keeps accurate the results on new individuals without a manual adaptation or training. © Springer-Verlag Berlin Heidelberg 2010.

Transatlantic Comparison of CT Radiation Doses in the Era of Radiation Dose-Tracking Software.

Science.gov (United States)

Parakh, Anushri; Euler, Andre; Szucs-Farkas, Zsolt; Schindera, Sebastian T

2017-12-01

The purpose of this study is to compare diagnostic reference levels from a local European CT dose registry, using radiation-tracking software from a large patient sample, with preexisting European and North American diagnostic reference levels. Data (n = 43,761 CT scans obtained over the course of 2 years) for the European local CT dose registry were obtained from eight CT scanners at six institutions. Means, medians, and interquartile ranges of volumetric CT dose index (CTDI vol ), dose-length product (DLP), size-specific dose estimate, and effective dose values for CT examinations of the head, paranasal sinuses, thorax, pulmonary angiogram, abdomen-pelvis, renal-colic, thorax-abdomen-pelvis, and thoracoabdominal angiogram were obtained using radiation-tracking software. Metrics from this registry were compared with diagnostic reference levels from Canada and California (published in 2015), the American College of Radiology (ACR) dose index registry (2015), and national diagnostic reference levels from local CT dose registries in Switzerland (2010), the United Kingdom (2011), and Portugal (2015). Our local registry had a lower 75th percentile CTDI vol for all protocols than did the individual internationally sourced data. Compared with our study, the ACR dose index registry had higher 75th percentile CTDI vol values by 55% for head, 240% for thorax, 28% for abdomen-pelvis, 42% for thorax-abdomen-pelvis, 128% for pulmonary angiogram, 138% for renal-colic, and 58% for paranasal sinus studies. Our local registry had lower diagnostic reference level values than did existing European and North American diagnostic reference levels. Automated radiation-tracking software could be used to establish and update existing diagnostic reference levels because they are capable of analyzing large datasets meaningfully.

SU-E-T-183: Clinical Quality Assurance Workflow for Dynamic Tumor Tracking Radiation Dose Delivery

International Nuclear Information System (INIS)

Mamalui-Hunter, M; Su, Z; Li, Z

2015-01-01

Purpose: One of the most important aspects of implementation of new treatment modalities is an ‘end-to-end’ verification of the treatment process. Radiation treatment based on dynamic tracking of a tumor is highly patient-specific, therefore, special attention should be paid to quality assurance of the treatment delivery. Our goal was to design the clinical workflow that ensures accurate delivery of the planned dose using the Dynamic Target Tracking option of VeroTM (BrainLab,MHI) linac. Methods: A patient simulation is designed to include a pre-treatment session to verify whether the system can reliably track the motion of the implanted marker and build the 4D model of the target motion. The external surrogate and target motion patterns are recorded in the ExactracTM log files. In this work, a spectrum of custom marker and external surrogate motion trajectories closely resembling the patient specific motion patterns was used. 1mm thick/11mm long VisicoilTM marker was placed 15 and 20mm from the center of the spherical tissue equivalent target (centroid to centroid distance) in the 4D motion phantom (CIRSTM). 3D conformal (3 mm block margin) SBRT plans were delivered to 2 moving targets in the phantom: 1) 20mm diameter target that allows ion chamber dose measurement and 2) 25mm target that allows using film to measure CAX dose (GafchromicTM EBT3 used). The measured dose was compared to the iPlanTM TPS results using MonteCarlo algorithm (1% variance, Dose-to-water). Results: On average, film shows 98.9% pass using gamma criterion for 2% and 2mm DTA, 94.3% match for 2% and 1 mm DTA, 98% pass for 1% and 2 mm DTA however only 88% points passing for 1% and 1 mm DTA. Ion chamber measurements agreed with the calculation within 1.5%. Conclusion: The clinical QA workflow was designed for SBRT delivery using real-time tumor tracking on VeroTM linac

A fast algorithm for identifying friends-of-friends halos

Science.gov (United States)

Feng, Y.; Modi, C.

2017-07-01

We describe a simple and fast algorithm for identifying friends-of-friends features and prove its correctness. The algorithm avoids unnecessary expensive neighbor queries, uses minimal memory overhead, and rejects slowdown in high over-density regions. We define our algorithm formally based on pair enumeration, a problem that has been heavily studied in fast 2-point correlation codes and our reference implementation employs a dual KD-tree correlation function code. We construct features in a hierarchical tree structure, and use a splay operation to reduce the average cost of identifying the root of a feature from O [ log L ] to O [ 1 ] (L is the size of a feature) without additional memory costs. This reduces the overall time complexity of merging trees from O [ L log L ] to O [ L ] , reducing the number of operations per splay by orders of magnitude. We next introduce a pruning operation that skips merge operations between two fully self-connected KD-tree nodes. This improves the robustness of the algorithm, reducing the number of merge operations in high density peaks from O [δ2 ] to O [ δ ] . We show that for cosmological data set the algorithm eliminates more than half of merge operations for typically used linking lengths b ∼ 0 . 2 (relative to mean separation). Furthermore, our algorithm is extremely simple and easy to implement on top of an existing pair enumeration code, reusing the optimization effort that has been invested in fast correlation function codes.

Evaluation of dose prediction errors and optimization convergence errors of deliverable-based head-and-neck IMRT plans computed with a superposition/convolution dose algorithm

International Nuclear Information System (INIS)

Mihaylov, I. B.; Siebers, J. V.

2008-01-01

The purpose of this study is to evaluate dose prediction errors (DPEs) and optimization convergence errors (OCEs) resulting from use of a superposition/convolution dose calculation algorithm in deliverable intensity-modulated radiation therapy (IMRT) optimization for head-and-neck (HN) patients. Thirteen HN IMRT patient plans were retrospectively reoptimized. The IMRT optimization was performed in three sequential steps: (1) fast optimization in which an initial nondeliverable IMRT solution was achieved and then converted to multileaf collimator (MLC) leaf sequences; (2) mixed deliverable optimization that used a Monte Carlo (MC) algorithm to account for the incident photon fluence modulation by the MLC, whereas a superposition/convolution (SC) dose calculation algorithm was utilized for the patient dose calculations; and (3) MC deliverable-based optimization in which both fluence and patient dose calculations were performed with a MC algorithm. DPEs of the mixed method were quantified by evaluating the differences between the mixed optimization SC dose result and a MC dose recalculation of the mixed optimization solution. OCEs of the mixed method were quantified by evaluating the differences between the MC recalculation of the mixed optimization solution and the final MC optimization solution. The results were analyzed through dose volume indices derived from the cumulative dose-volume histograms for selected anatomic structures. Statistical equivalence tests were used to determine the significance of the DPEs and the OCEs. Furthermore, a correlation analysis between DPEs and OCEs was performed. The evaluated DPEs were within ±2.8% while the OCEs were within 5.5%, indicating that OCEs can be clinically significant even when DPEs are clinically insignificant. The full MC-dose-based optimization reduced normal tissue dose by as much as 8.5% compared with the mixed-method optimization results. The DPEs and the OCEs in the targets had correlation coefficients greater

A fast neutron detector with IP by track measurement

International Nuclear Information System (INIS)

Miao Zhengqiang; Yang Jun; Zhang Qiang; Zhao Xiangfeng; Wang Daohua

2004-01-01

Imaging Plate(IP) is very sensitive to electric particles, especially to heavy ions. As we know, the recoiling protons are produced while fast neutrons scattered in light material containing hydrogen. When the recoiling proton enters in the sensitive layer of IP, a track will be recorded by IP. In this paper, a fast neutron detector based on IP and (n, p) reaction is described in detail, the detector's efficiency is studied also. (authors)

Fast track trigger processor for the OPAL detector at LEP

Energy Technology Data Exchange (ETDEWEB)

Carter, A A; Carter, J R; Ward, D R; Heuer, R D; Jaroslawski, S; Wagner, A

1986-09-20

A fast hardware track trigger processor being built for the OPAL experiment is described. The processor will analyse data from the central drift chambers of OPAL to determine whether any tracks come from the interaction region, and thereby eliminate background events. The processor will find tracks over a large angular range, vertical strokecos thetavertical stroke < or approx. 0.95. The design of the processor is described, together with a brief account of its hardware implementation for OPAL. The results of feasibility studies are also presented.

The ATLAS Fast Tracker Processing Units - track finding and fitting

CERN Document Server

AUTHOR|(INSPIRE)INSPIRE-00384270; The ATLAS collaboration; Alison, John; Ancu, Lucian Stefan; Andreani, Alessandro; Annovi, Alberto; Beccherle, Roberto; Beretta, Matteo; Biesuz, Nicolo Vladi; Bogdan, Mircea Arghir; Bryant, Patrick; Calabro, Domenico; Citraro, Saverio; Crescioli, Francesco; Dell'Orso, Mauro; Donati, Simone; Gentsos, Christos; Giannetti, Paola; Gkaitatzis, Stamatios; Gramling, Johanna; Greco, Virginia; Horyn, Lesya Anna; Iovene, Alessandro; Kalaitzidis, Panagiotis; Kim, Young-Kee; Kimura, Naoki; Kordas, Kostantinos; Kubota, Takashi; Lanza, Agostino; Liberali, Valentino; Luciano, Pierluigi; Magnin, Betty; Sakellariou, Andreas; Sampsonidis, Dimitrios; Saxon, James; Shojaii, Seyed Ruhollah; Sotiropoulou, Calliope Louisa; Stabile, Alberto; Swiatlowski, Maximilian; Volpi, Guido; Zou, Rui; Shochet, Mel

2016-01-01

The Fast Tracker is a hardware upgrade to the ATLAS trigger and data-acquisition system, with the goal of providing global track reconstruction by the start of the High Level Trigger starts. The Fast Tracker can process incoming data from the whole inner detector at full first level trigger rate, up to 100 kHz, using custom electronic boards. At the core of the system is a Processing Unit installed in a VMEbus crate, formed by two sets of boards: the Associative Memory Board and a powerful rear transition module called the Auxiliary card, while the second set is the Second Stage board. The associative memories perform the pattern matching looking for correlations within the incoming data, compatible with track candidates at coarse resolution. The pattern matching task is performed using custom application specific integrated circuits, called associative memory chips. The auxiliary card prepares the input and reject bad track candidates obtained from from the Associative Memory Board using the full precision a...

The Resource Mapping Algorithm of Wireless Virtualized Networks for Saving Energy in Ultradense Small Cells

Directory of Open Access Journals (Sweden)

Sai Zou

2015-01-01

Full Text Available As the current network is designed for peak loads, it results in insufficient resource utilization and energy waste. Virtualized technology makes it possible that intelligent energy perception network could be deployed and resource sharing could become an effective energy saving technology. How to make more small cells into sleeping state for energy saving in ultradense small cell system has become a research hot spot. Based on the mapping feature of virtualized network, a new wireless resource mapping algorithm for saving energy in ultradense small cells has been put forward when wireless resource amount is satisfied in every small cell. First of all, the method divides the virtual cells. Again through the alternate updating between small cell mapping and wireless resource allocation, least amount of small cells is used and other small cells turn into sleeping state on the premise of guaranteeing users’ QoS. Next, the energy consumption of the wireless access system, wireless resource utilization, and the convergence of the proposed algorithm are analyzed in theory. Finally, the simulation results demonstrate that the algorithm can effectively reduce the system energy consumption and required wireless resource amount under the condition of satisfying users’ QoS.

Fast algorithm of adaptive Fourier series

Science.gov (United States)

Gao, You; Ku, Min; Qian, Tao

2018-05-01

Adaptive Fourier decomposition (AFD, precisely 1-D AFD or Core-AFD) was originated for the goal of positive frequency representations of signals. It achieved the goal and at the same time offered fast decompositions of signals. There then arose several types of AFDs. AFD merged with the greedy algorithm idea, and in particular, motivated the so-called pre-orthogonal greedy algorithm (Pre-OGA) that was proven to be the most efficient greedy algorithm. The cost of the advantages of the AFD type decompositions is, however, the high computational complexity due to the involvement of maximal selections of the dictionary parameters. The present paper offers one formulation of the 1-D AFD algorithm by building the FFT algorithm into it. Accordingly, the algorithm complexity is reduced, from the original $\\mathcal{O}(M N^2)$ to $\\mathcal{O}(M N\\log_2 N)$, where $N$ denotes the number of the discretization points on the unit circle and $M$ denotes the number of points in $[0,1)$. This greatly enhances the applicability of AFD. Experiments are carried out to show the high efficiency of the proposed algorithm.

A hand tracking algorithm with particle filter and improved GVF snake model

Science.gov (United States)

Sun, Yi-qi; Wu, Ai-guo; Dong, Na; Shao, Yi-zhe

2017-07-01

To solve the problem that the accurate information of hand cannot be obtained by particle filter, a hand tracking algorithm based on particle filter combined with skin-color adaptive gradient vector flow (GVF) snake model is proposed. Adaptive GVF and skin color adaptive external guidance force are introduced to the traditional GVF snake model, guiding the curve to quickly converge to the deep concave region of hand contour and obtaining the complex hand contour accurately. This algorithm realizes a real-time correction of the particle filter parameters, avoiding the particle drift phenomenon. Experimental results show that the proposed algorithm can reduce the root mean square error of the hand tracking by 53%, and improve the accuracy of hand tracking in the case of complex and moving background, even with a large range of occlusion.

Multi-sensor fusion using an adaptive multi-hypothesis tracking algorithm

NARCIS (Netherlands)

Kester, L.J.H.M.

2003-01-01

The purpose of a tracking algorithm is to associate data measured by one or more (moving) sensors to moving objects in the environment. The state of these objects that can be estimated with the tracking process depends on the type of data that is provided by these sensors. It is discussed how the

Enhancement of tracking performance in electro-optical system based on servo control algorithm

Science.gov (United States)

Choi, WooJin; Kim, SungSu; Jung, DaeYoon; Seo, HyoungKyu

2017-10-01

Modern electro-optical surveillance and reconnaissance systems require tracking capability to get exact images of target or to accurately direct the line of sight to target which is moving or still. This leads to the tracking system composed of image based tracking algorithm and servo control algorithm. In this study, we focus on the servo control function to minimize the overshoot in the tracking motion and do not miss the target. The scheme is to limit acceleration and velocity parameters in the tracking controller, depending on the target state information in the image. We implement the proposed techniques by creating a system model of DIRCM and simulate the same environment, validate the performance on the actual equipment.

Implementation of the scientific evidence into daily practice - example from fast-track colonic cancer surgery

DEFF Research Database (Denmark)

Hammer, J.; Harling, H.; Wille-Jorgensen, P.

2008-01-01

Objective To report the implementation and results of fast-track surgery for colonic cancer in the daily routine. Method A total of 131 consecutive patients scheduled for elective colonic cancer resections entered a fast-track perioperative course after thorough information. The regimen contained...

Evaluation of dose calculation algorithms using the treatment planning system XiO with tissue heterogeneity correction turned on; Validacao dos algoritmos de calculo de dose do sistema de planejamento XiO considerando as correcoes para heterogeneidade dos tecidos

Energy Technology Data Exchange (ETDEWEB)

Fairbanks, L.R.; Barbi, G.L.; Silva, W.T. da; Reis, E.G.F. dos; Borges, L.F.; Bertucci, E.C.; Maciel, M.F.; Amaral, L.L. do, E-mail: lefairbanks@yahoo.com.b [Universidade de Sao Paulo (USP), Ribeirao Preto, SP (Brazil). Hospital das Clinicas. Servico de Radioterapia

2010-07-01

Since the cross-section for various radiation interactions is dependent upon tissue material, the presence of heterogeneities affects the final dose delivered. This paper aims to analyze how different treatment planning algorithms (Fast Fourier Transform, Convolution, Superposition, Fast Superposition and Clarkson) work when heterogeneity corrections are used. To that end, a farmer-type ionization chamber was positioned reproducibly (during the time of CT as well as irradiation) inside several phantoms made of aluminum, bone, cork and solid water slabs. The percent difference between the dose measured and calculated by the various algorithms was less than 5%; This is in accordance with the recommendation of several references.The convolution method shows better results for high density materials (difference {approx}1 %), whereas the Superposition algorithm is more accurate for low densities (around 1,1%).

头部多角度人脸快速跟踪算法DSP实现%Fast face tracking algorithm of head multi-position based on DSP

Institute of Scientific and Technical Information of China (English)

姜俊金; 王增才; 朱淑亮

2012-01-01

针对传统驾驶员疲劳检测人脸跟踪算法复杂,DSP实现时实时性不强,不能有效地实现多角度人脸跟踪的问题,提出了一种快速人脸跟踪算法.该算法通过对YCbCr肤色模型进行图像预处理、肤色检测,提取人脸区域,通过对亮度信号Y进行统计运算,判断人脸边界,再进行相似度判断,从而实现人脸区域的跟踪.实验结果表明,该方法简单、鲁棒性强,能够快速地实现彩色图像人脸多角度跟踪.%In the field of real-time human face tracking for driver fatigue detection, the classic algorithms are so complex that the DSP system can not track the face in multi-angle state quickly and exactly, so a new face tracking algorithm is presented. In YCbCr human face color model, the image is preprocessed first, then the face region is extracted through the face color detec-tion. Through calculating the brightness signal Y, the face edge can be detected. Then a symmetry similarity measure is used to check the factuality of the face tracking. In this way, the face region can be tracked Experimental results indicate that this algo-rithm is so simple and can realize the tracking of face in multi-angle of color image.

Improving GPU-accelerated adaptive IDW interpolation algorithm using fast kNN search.

Science.gov (United States)

Mei, Gang; Xu, Nengxiong; Xu, Liangliang

2016-01-01

This paper presents an efficient parallel Adaptive Inverse Distance Weighting (AIDW) interpolation algorithm on modern Graphics Processing Unit (GPU). The presented algorithm is an improvement of our previous GPU-accelerated AIDW algorithm by adopting fast k-nearest neighbors (kNN) search. In AIDW, it needs to find several nearest neighboring data points for each interpolated point to adaptively determine the power parameter; and then the desired prediction value of the interpolated point is obtained by weighted interpolating using the power parameter. In this work, we develop a fast kNN search approach based on the space-partitioning data structure, even grid, to improve the previous GPU-accelerated AIDW algorithm. The improved algorithm is composed of the stages of kNN search and weighted interpolating. To evaluate the performance of the improved algorithm, we perform five groups of experimental tests. The experimental results indicate: (1) the improved algorithm can achieve a speedup of up to 1017 over the corresponding serial algorithm; (2) the improved algorithm is at least two times faster than our previous GPU-accelerated AIDW algorithm; and (3) the utilization of fast kNN search can significantly improve the computational efficiency of the entire GPU-accelerated AIDW algorithm.

A very fast implementation of 2D iterative reconstruction algorithms

DEFF Research Database (Denmark)

Toft, Peter Aundal; Jensen, Peter James

1996-01-01

that iterative reconstruction algorithms can be implemented and run almost as fast as direct reconstruction algorithms. The method has been implemented in a software package that is available for free, providing reconstruction algorithms using ART, EM, and the Least Squares Conjugate Gradient Method...

On the Impact of Localization and Density Control Algorithms in Target Tracking Applications for Wireless Sensor Networks

Science.gov (United States)

Campos, Andre N.; Souza, Efren L.; Nakamura, Fabiola G.; Nakamura, Eduardo F.; Rodrigues, Joel J. P. C.

2012-01-01

Target tracking is an important application of wireless sensor networks. The networks' ability to locate and track an object is directed linked to the nodes' ability to locate themselves. Consequently, localization systems are essential for target tracking applications. In addition, sensor networks are often deployed in remote or hostile environments. Therefore, density control algorithms are used to increase network lifetime while maintaining its sensing capabilities. In this work, we analyze the impact of localization algorithms (RPE and DPE) and density control algorithms (GAF, A3 and OGDC) on target tracking applications. We adapt the density control algorithms to address the k-coverage problem. In addition, we analyze the impact of network density, residual integration with density control, and k-coverage on both target tracking accuracy and network lifetime. Our results show that DPE is a better choice for target tracking applications than RPE. Moreover, among the evaluated density control algorithms, OGDC is the best option among the three. Although the choice of the density control algorithm has little impact on the tracking precision, OGDC outperforms GAF and A3 in terms of tracking time. PMID:22969329

Pose Tracking Algorithm of an Endoscopic Surgery Robot Wrist

International Nuclear Information System (INIS)

Wang, L; Yin, H L; Meng, Q

2006-01-01

In recent two decades, more and more research on the endoscopic surgery has been carried out [2]. Most of the work focuses on the development of the robot in the field of robotics and the navigation of the surgery tools based on computer graphics. But the tracking and locating of the EndoWrist is also a very important aspect. This paper deals with the the tracking algorithm of the EndoWrist's pose (position and orientation). The linear tracking of the position is handled by the Kalman Filter. The quaternion-based nonlinear orientation tracking is implemented with the Extended Kalman Filter. The most innovative point of this paper is the parameterization of the motion model of the Extended Kalman Filter

ATLAS Fast Tracker Status and Tracking at High luminosity LHC

CERN Document Server

Ilic, Nikolina; The ATLAS collaboration

2018-01-01

The LHC’s increase in centre of mass energy and luminosity in 2015 makes controlling trigger rates with high efficiency challenging. The ATLAS Fast TracKer (FTK) is a hardware processor built to reconstruct tracks at a rate of up to 100 kHz and provide them to the high level trigger. The FTK reconstructs tracks by matching incoming detector hits with pre-defined track patterns stored in associative memory on custom ASICs. Inner detector hits are fit to these track patterns using modern FPGAs. This talk describes the electronics system used for the FTK’s massive parallelization. The installation, commissioning and running of the system is happening in 2016, and is detailed in this talk. Tracking at High luminosity LHC is also presented.

A tracking algorithm for the reconstruction of the daughters of long-lived particles in LHCb

CERN Document Server

Dendek, Adam Mateusz

2018-01-01

A tracking algorithm for the reconstruction of the daughters of long-lived particles in LHCb 5 Jun 2018, 16:00 1h 30m Library, Centro San Domenico () LHC experiments Posters session Speaker Katharina Mueller (Universitaet Zuerich (CH)) Description The LHCb experiment at CERN operates a high precision and robust tracking system to reach its physics goals, including precise measurements of CP-violation phenomena in the heavy flavour quark sector and searches for New Physics beyond the Standard Model. The track reconstruction procedure is performed by a number of algorithms. One of these, PatLongLivedTracking, is optimised to reconstruct "downstream tracks", which are tracks originating from decays outside the LHCb vertex detector of long-lived particles, such as Ks or Λ0. After an overview of the LHCb tracking system, we provide a detailed description of the LHCb downstream track reconstruction algorithm. Its computational intelligence part is described in details, including the adaptation of the employed...

Evidence of dose saving in routine CT practice using iterative reconstruction derived from a national diagnostic reference level survey.

Science.gov (United States)

Thomas, P; Hayton, A; Beveridge, T; Marks, P; Wallace, A

2015-09-01

To assess the influence and significance of the use of iterative reconstruction (IR) algorithms on patient dose in CT in Australia. We examined survey data submitted to the Australian Radiation Protection and Nuclear Safety Agency (ARPANSA) National Diagnostic Reference Level Service (NDRLS) during 2013 and 2014. We compared median survey dose metrics with categorization by scan region and use of IR. The use of IR results in a reduction in volume CT dose index of between 17% and 44% and a reduction in dose-length product of between 14% and 34% depending on the specific scan region. The reduction was highly significant (p sum test) for all six scan regions included in the NDRLS. Overall, 69% (806/1167) of surveys included in the analysis used IR. The use of IR in CT is achieving dose savings of 20-30% in routine practice in Australia. IR appears to be widely used by participants in the ARPANSA NDRLS with approximately 70% of surveys submitted employing this technique. This study examines the impact of the use of IR on patient dose in CT on a national scale.

A maximum power point tracking algorithm for photovoltaic applications

Science.gov (United States)

Nelatury, Sudarshan R.; Gray, Robert

2013-05-01

The voltage and current characteristic of a photovoltaic (PV) cell is highly nonlinear and operating a PV cell for maximum power transfer has been a challenge for a long time. Several techniques have been proposed to estimate and track the maximum power point (MPP) in order to improve the overall efficiency of a PV panel. A strategic use of the mean value theorem permits obtaining an analytical expression for a point that lies in a close neighborhood of the true MPP. But hitherto, an exact solution in closed form for the MPP is not published. This problem can be formulated analytically as a constrained optimization, which can be solved using the Lagrange method. This method results in a system of simultaneous nonlinear equations. Solving them directly is quite difficult. However, we can employ a recursive algorithm to yield a reasonably good solution. In graphical terms, suppose the voltage current characteristic and the constant power contours are plotted on the same voltage current plane, the point of tangency between the device characteristic and the constant power contours is the sought for MPP. It is subject to change with the incident irradiation and temperature and hence the algorithm that attempts to maintain the MPP should be adaptive in nature and is supposed to have fast convergence and the least misadjustment. There are two parts in its implementation. First, one needs to estimate the MPP. The second task is to have a DC-DC converter to match the given load to the MPP thus obtained. Availability of power electronics circuits made it possible to design efficient converters. In this paper although we do not show the results from a real circuit, we use MATLAB to obtain the MPP and a buck-boost converter to match the load. Under varying conditions of load resistance and irradiance we demonstrate MPP tracking in case of a commercially available solar panel MSX-60. The power electronics circuit is simulated by PSIM software.

A novel standalone track reconstruction algorithm for the LHCb upgrade

CERN Multimedia

Quagliani, Renato

2018-01-01

During the LHC Run III, starting in 2020, the instantaneous luminosity of LHCb will be increased up to 2×1033 cm−2 s−1, five times larger than in Run II. The LHCb detector will then have to be upgraded in 2019. In fact, a full software event reconstruction will be performed at the full bunch crossing rate by the trigger, in order to profit of the higher instantaneous luminosity provided by the accelerator. In addition, all the tracking devices will be replaced and, in particular, a scintillating fiber tracker (SciFi) will be installed after the magnet, allowing to cope with the higher occupancy. The new running conditions, and the tighter timing constraints in the software trigger, represent a big challenge for the track reconstruction. This talk presents the design and performance of a novel algorithm that has been developed to reconstruct track segments using solely hits from the SciFi. This algorithm is crucial for the reconstruction of tracks originating from long-lived particles such as KS and Λ. ...

Scalable force directed graph layout algorithms using fast multipole methods

KAUST Repository

Yunis, Enas Abdulrahman

2012-06-01

We present an extension to ExaFMM, a Fast Multipole Method library, as a generalized approach for fast and scalable execution of the Force-Directed Graph Layout algorithm. The Force-Directed Graph Layout algorithm is a physics-based approach to graph layout that treats the vertices V as repelling charged particles with the edges E connecting them acting as springs. Traditionally, the amount of work required in applying the Force-Directed Graph Layout algorithm is O(|V|2 + |E|) using direct calculations and O(|V| log |V| + |E|) using truncation, filtering, and/or multi-level techniques. Correct application of the Fast Multipole Method allows us to maintain a lower complexity of O(|V| + |E|) while regaining most of the precision lost in other techniques. Solving layout problems for truly large graphs with millions of vertices still requires a scalable algorithm and implementation. We have been able to leverage the scalability and architectural adaptability of the ExaFMM library to create a Force-Directed Graph Layout implementation that runs efficiently on distributed multicore and multi-GPU architectures. © 2012 IEEE.

Low manipulation prevalence following fast-track total knee arthroplasty

DEFF Research Database (Denmark)

Husted, Henrik; Jørgensen, Christoffer C.; Gromov, Kirill

2015-01-01

BACKGROUND AND PURPOSE: Postoperative joint stiffness following total knee arthroplasty (TKA) may compromise the outcome and necessitate manipulation. Previous studies have not been in a fast-track setting with optimized pain treatment, early mobilization, and short length of stay (LOS), which ma...

After colonic surgery: The lived experience of participating in a fast-track programme

DEFF Research Database (Denmark)

Norlyk, Annelise; Harder, Ingegerd

2009-01-01

Postoperative recovery can be accelerated and hospitalization reduced through fast-track programmes. However, documented knowledge is limited and primarily focusing on a medical perspective whereas the patients' perspective lacks documentation. This study describes the lived experience of partici......Postoperative recovery can be accelerated and hospitalization reduced through fast-track programmes. However, documented knowledge is limited and primarily focusing on a medical perspective whereas the patients' perspective lacks documentation. This study describes the lived experience...

Fast neutron radiation inactivation of Bacillus subtilis: Absorbed dose determination

International Nuclear Information System (INIS)

Song Lingli; Zheng Chun; Ai Zihui; Li Junjie; Dai Shaofeng

2011-01-01

In this paper, fast neutron inactivation effects of Bacillus subtilis were investigated with fission fast neutrons from CFBR-II reactor of INPC (Institute of Nuclear Physics and Chemistry) and mono-energetic neutrons from the Van de Graaff accelerator at Peking University. The method for determining the absorbed dose in the Bacillus subtilis suspension contained in test tubes is introduced. The absorbed dose, on account of its dependence on the volume and the form of confined state, was determined by combined experiments and Monte Carlo method. Using the calculation results of absorbed dose, the fast neutron inactivation effects on Bacillus subtilis were studied. The survival rates and absorbed dose curve was constructed. (authors)

FAST-PT: a novel algorithm to calculate convolution integrals in cosmological perturbation theory

Energy Technology Data Exchange (ETDEWEB)

McEwen, Joseph E.; Fang, Xiao; Hirata, Christopher M.; Blazek, Jonathan A., E-mail: mcewen.24@osu.edu, E-mail: fang.307@osu.edu, E-mail: hirata.10@osu.edu, E-mail: blazek@berkeley.edu [Center for Cosmology and AstroParticle Physics, Department of Physics, The Ohio State University, 191 W Woodruff Ave, Columbus OH 43210 (United States)

2016-09-01

We present a novel algorithm, FAST-PT, for performing convolution or mode-coupling integrals that appear in nonlinear cosmological perturbation theory. The algorithm uses several properties of gravitational structure formation—the locality of the dark matter equations and the scale invariance of the problem—as well as Fast Fourier Transforms to describe the input power spectrum as a superposition of power laws. This yields extremely fast performance, enabling mode-coupling integral computations fast enough to embed in Monte Carlo Markov Chain parameter estimation. We describe the algorithm and demonstrate its application to calculating nonlinear corrections to the matter power spectrum, including one-loop standard perturbation theory and the renormalization group approach. We also describe our public code (in Python) to implement this algorithm. The code, along with a user manual and example implementations, is available at https://github.com/JoeMcEwen/FAST-PT.

Pose Tracking Algorithm of an Endoscopic Surgery Robot Wrist

Energy Technology Data Exchange (ETDEWEB)

Wang, L [Chinese-German Institute of Automatic Control Engineering, Tongji University (China); Yin, H L [Chinese-German Institute of Automatic Control Engineering, Tongji University (China); Meng, Q [Shanghai University of Electric Power (China)

2006-10-15

In recent two decades, more and more research on the endoscopic surgery has been carried out [2]. Most of the work focuses on the development of the robot in the field of robotics and the navigation of the surgery tools based on computer graphics. But the tracking and locating of the EndoWrist is also a very important aspect. This paper deals with the the tracking algorithm of the EndoWrist's pose (position and orientation). The linear tracking of the position is handled by the Kalman Filter. The quaternion-based nonlinear orientation tracking is implemented with the Extended Kalman Filter. The most innovative point of this paper is the parameterization of the motion model of the Extended Kalman Filter.

Online Tracking Algorithms on GPUs for the P-barANDA Experiment at FAIR

International Nuclear Information System (INIS)

Bianchi, L; Herten, A; Ritman, J; Stockmanns, T; Adinetz, A.; Pleiter, D; Kraus, J

2015-01-01

P-barANDA is a future hadron and nuclear physics experiment at the FAIR facility in construction in Darmstadt, Germany. In contrast to the majority of current experiments, PANDA's strategy for data acquisition is based on event reconstruction from free-streaming data, performed in real time entirely by software algorithms using global detector information. This paper reports the status of the development of algorithms for the reconstruction of charged particle tracks, optimized online data processing applications, using General-Purpose Graphic Processing Units (GPU). Two algorithms for trackfinding, the Triplet Finder and the Circle Hough, are described, and details of their GPU implementations are highlighted. Average track reconstruction times of less than 100 ns are obtained running the Triplet Finder on state-of- the-art GPU cards. In addition, a proof-of-concept system for the dispatch of data to tracking algorithms using Message Queues is presented. (paper)

Improved FHT Algorithms for Fast Computation of the Discrete Hartley Transform

Directory of Open Access Journals (Sweden)

M. T. Hamood

2013-05-01

Full Text Available In this paper, by using the symmetrical properties of the discrete Hartley transform (DHT, an improved radix-2 fast Hartley transform (FHT algorithm with arithmetic complexity comparable to that of the real-valued fast Fourier transform (RFFT is developed. It has a simple and regular butterfly structure and possesses the in-place computation property. Furthermore, using the same principles, the development can be extended to more efficient radix-based FHT algorithms. An example for the improved radix-4 FHT algorithm is given to show the validity of the presented method. The arithmetic complexity for the new algorithms are computed and then compared with the existing FHT algorithms. The results of these comparisons have shown that the developed algorithms reduce the number of multiplications and additions considerably.

An Integral Model for Target Tracking Based on the Use of a WSN

Directory of Open Access Journals (Sweden)

Pietro Manzoni

2013-06-01

Full Text Available The use of wireless sensor networks (WSN in tracking applications is growing at a fast pace. In these applications, the sensor nodes discover, monitor and track an event or target object. A significant number of proposals relating the use of WSNs for target tracking have been published to date. However, they either focus on the tracking algorithm or on the communication protocol, and none of them address the problem integrally. In this paper, a comprehensive proposal for target detection and tracking is discussed. We introduce a tracking algorithm to detect and estimate a target location. Moreover, we introduce a low-overhead routing protocol to be used along with our tracking algorithm. The proposed algorithm has low computational complexity and has been designed considering the use of a mobile sink while generating minimal delay and packet loss. We also discuss the results of the evaluation of the proposed algorithms.

An Improved Perturb and Observe Algorithm for Photovoltaic Motion Carriers

Science.gov (United States)

Peng, Lele; Xu, Wei; Li, Liming; Zheng, Shubin

2018-03-01

An improved perturbation and observation algorithm for photovoltaic motion carriers is proposed in this paper. The model of the proposed algorithm is given by using Lambert W function and tangent error method. Moreover, by using matlab and experiment of photovoltaic system, the tracking performance of the proposed algorithm is tested. And the results demonstrate that the improved algorithm has fast tracking speed and high efficiency. Furthermore, the energy conversion efficiency by the improved method has increased by nearly 8.2%.

Fast numerical algorithm for the linear canonical transform.

Science.gov (United States)

Hennelly, Bryan M; Sheridan, John T

2005-05-01

The linear canonical transform (LCT) describes the effect of any quadratic phase system (QPS) on an input optical wave field. Special cases of the LCT include the fractional Fourier transform (FRT), the Fourier transform (FT), and the Fresnel transform (FST) describing free-space propagation. Currently there are numerous efficient algorithms used (for purposes of numerical simulation in the area of optical signal processing) to calculate the discrete FT, FRT, and FST. All of these algorithms are based on the use of the fast Fourier transform (FFT). In this paper we develop theory for the discrete linear canonical transform (DLCT), which is to the LCT what the discrete Fourier transform (DFT) is to the FT. We then derive the fast linear canonical transform (FLCT), an N log N algorithm for its numerical implementation by an approach similar to that used in deriving the FFT from the DFT. Our algorithm is significantly different from the FFT, is based purely on the properties of the LCT, and can be used for FFT, FRT, and FST calculations and, in the most general case, for the rapid calculation of the effect of any QPS.

A High-Speed Vision-Based Sensor for Dynamic Vibration Analysis Using Fast Motion Extraction Algorithms

Directory of Open Access Journals (Sweden)

Dashan Zhang

2016-04-01

Full Text Available The development of image sensor and optics enables the application of vision-based techniques to the non-contact dynamic vibration analysis of large-scale structures. As an emerging technology, a vision-based approach allows for remote measuring and does not bring any additional mass to the measuring object compared with traditional contact measurements. In this study, a high-speed vision-based sensor system is developed to extract structure vibration signals in real time. A fast motion extraction algorithm is required for this system because the maximum sampling frequency of the charge-coupled device (CCD sensor can reach up to 1000 Hz. Two efficient subpixel level motion extraction algorithms, namely the modified Taylor approximation refinement algorithm and the localization refinement algorithm, are integrated into the proposed vision sensor. Quantitative analysis shows that both of the two modified algorithms are at least five times faster than conventional upsampled cross-correlation approaches and achieve satisfactory error performance. The practicability of the developed sensor is evaluated by an experiment in a laboratory environment and a field test. Experimental results indicate that the developed high-speed vision-based sensor system can extract accurate dynamic structure vibration signals by tracking either artificial targets or natural features.

A modified fast-track program for pancreatic surgery: a prospective single-center experience.

Science.gov (United States)

di Sebastiano, Pierluigi; Festa, Leonardina; De Bonis, Antonio; Ciuffreda, Andrea; Valvano, Maria Rosa; Andriulli, Angelo; di Mola, F Francesco

2011-03-01

The objective of this study is to evaluate the impact of a fast-track protocol in a high-volume center for patients with pancreatic disorders. The concept of fast-track surgery allowing accelerated postoperative recovery is accepted in colorectal surgery, but efficacy data are only preliminary for patients undergoing major pancreatic surgery. We aimed to evaluate the impact of a modified fast-track protocol in a high-volume center for patients with pancreatic disorders. Between February 2005 and January 2010, 145 subjects had resective pancreatic surgery and were enrolled in the program. Essential features of the program were no preanaesthetic medication, upper and lower air-warming device, avoidance of excessive i.v. fluids perioperatively, effective control of pain, early reinstitution of oral feeding, and immediate mobilization and restoration of bowel function following surgery. Outcome measures were postoperative complications such as pancreatic fistula, delayed gastric emptying, biliary leak, intra-abdominal abscess, post-pancreatectomy hemorrhage, acute pancreatitis, wound infection, 30-day mortality, postoperative hospital stay, and readmission rates. On average, patients were discharged on postoperative day 10 (range 6-69), with a 30-day readmission rate of 6.2%. Percentage of patients with at least one complication was 38.6%. Pancreatic anastomotic leakage occurred in seven of 101 pancreatico-jejunostomies, and biliary leak in three of 109 biliary jejunostomies. Postoperative hemorrhage occurred in ten (6.9%) patients and wound infection in nine (6.2%) cases. In-hospital mortality was 2.7%. Fast-track parameters, such as normal food and first stool, correlated significantly with early discharge (jaundice, and resumption of normal diet by the 5th postoperative day were independent factors of early discharge. Fast-track programs are feasible, easy, and also applicable for patients undergoing a major surgery such as pancreatic resection.

Advective isotope transport by mixing cell and particle tracking algorithms

International Nuclear Information System (INIS)

Tezcan, L.; Meric, T.

1999-01-01

The 'mixing cell' algorithm of the environmental isotope data evaluation is integrated with the three dimensional finite difference ground water flow model (MODFLOW) to simulate the advective isotope transport and the approach is compared with the 'particle tracking' algorithm of the MOC3D, that simulates three-dimensional solute transport with the method of characteristics technique

The implementation of an automated tracking algorithm for the track detection of migratory anticyclones affecting the Mediterranean

Science.gov (United States)

Hatzaki, Maria; Flocas, Elena A.; Simmonds, Ian; Kouroutzoglou, John; Keay, Kevin; Rudeva, Irina

2013-04-01

Migratory cyclones and anticyclones mainly account for the short-term weather variations in extra-tropical regions. By contrast to cyclones that have drawn major scientific attention due to their direct link to active weather and precipitation, climatological studies on anticyclones are limited, even though they also are associated with extreme weather phenomena and play an important role in global and regional climate. This is especially true for the Mediterranean, a region particularly vulnerable to climate change, and the little research which has been done is essentially confined to the manual analysis of synoptic charts. For the construction of a comprehensive climatology of migratory anticyclonic systems in the Mediterranean using an objective methodology, the Melbourne University automatic tracking algorithm is applied, based to the ERA-Interim reanalysis mean sea level pressure database. The algorithm's reliability in accurately capturing the weather patterns and synoptic climatology of the transient activity has been widely proven. This algorithm has been extensively applied for cyclone studies worldwide and it has been also successfully applied for the Mediterranean, though its use for anticyclone tracking is limited to the Southern Hemisphere. In this study the performance of the tracking algorithm under different data resolutions and different choices of parameter settings in the scheme is examined. Our focus is on the appropriate modification of the algorithm in order to efficiently capture the individual characteristics of the anticyclonic tracks in the Mediterranean, a closed basin with complex topography. We show that the number of the detected anticyclonic centers and the resulting tracks largely depend upon the data resolution and the search radius. We also find that different scale anticyclones and secondary centers that lie within larger anticyclone structures can be adequately represented; this is important, since the extensions of major

GTV-based prescription in SBRT for lung lesions using advanced dose calculation algorithms

International Nuclear Information System (INIS)

Lacornerie, Thomas; Lisbona, Albert; Mirabel, Xavier; Lartigau, Eric; Reynaert, Nick

2014-01-01

The aim of current study was to investigate the way dose is prescribed to lung lesions during SBRT using advanced dose calculation algorithms that take into account electron transport (type B algorithms). As type A algorithms do not take into account secondary electron transport, they overestimate the dose to lung lesions. Type B algorithms are more accurate but still no consensus is reached regarding dose prescription. The positive clinical results obtained using type A algorithms should be used as a starting point. In current work a dose-calculation experiment is performed, presenting different prescription methods. Three cases with three different sizes of peripheral lung lesions were planned using three different treatment platforms. For each individual case 60 Gy to the PTV was prescribed using a type A algorithm and the dose distribution was recalculated using a type B algorithm in order to evaluate the impact of the secondary electron transport. Secondly, for each case a type B algorithm was used to prescribe 48 Gy to the PTV, and the resulting doses to the GTV were analyzed. Finally, prescriptions based on specific GTV dose volumes were evaluated. When using a type A algorithm to prescribe the same dose to the PTV, the differences regarding median GTV doses among platforms and cases were always less than 10% of the prescription dose. The prescription to the PTV based on type B algorithms, leads to a more important variability of the median GTV dose among cases and among platforms, (respectively 24%, and 28%). However, when 54 Gy was prescribed as median GTV dose, using a type B algorithm, the variability observed was minimal. Normalizing the prescription dose to the median GTV dose for lung lesions avoids variability among different cases and treatment platforms of SBRT when type B algorithms are used to calculate the dose. The combination of using a type A algorithm to optimize a homogeneous dose in the PTV and using a type B algorithm to prescribe the

Performance analysis of visual tracking algorithms for motion-based user interfaces on mobile devices

Science.gov (United States)

Winkler, Stefan; Rangaswamy, Karthik; Tedjokusumo, Jefry; Zhou, ZhiYing

2008-02-01

Determining the self-motion of a camera is useful for many applications. A number of visual motion-tracking algorithms have been developed till date, each with their own advantages and restrictions. Some of them have also made their foray into the mobile world, powering augmented reality-based applications on phones with inbuilt cameras. In this paper, we compare the performances of three feature or landmark-guided motion tracking algorithms, namely marker-based tracking with MXRToolkit, face tracking based on CamShift, and MonoSLAM. We analyze and compare the complexity, accuracy, sensitivity, robustness and restrictions of each of the above methods. Our performance tests are conducted over two stages: The first stage of testing uses video sequences created with simulated camera movements along the six degrees of freedom in order to compare accuracy in tracking, while the second stage analyzes the robustness of the algorithms by testing for manipulative factors like image scaling and frame-skipping.

Orthostatic intolerance during early mobilization after fast-track hip arthroplasty

DEFF Research Database (Denmark)

Jans, O; Bundgaard-Nielsen, M; Solgaard, S

2012-01-01

has not been established after THA. This study evaluated the cardiovascular response and tissue oxygenation to mobilization before and after surgery in relation to OI in fast-track THA patients. METHODS: /st>OI and the cardiovascular response to standing were evaluated with a standardized mobilization......BACKGROUND: /st>Early postoperative mobilization is a cornerstone in fast-track total hip arthroplasty (THA), but postoperative orthostatic intolerance (OI) may delay early recovery or lead to fainting, falls, and prosthesis dislocation or fracture. However, the prevalence and pathophysiology of OI...... protocol, before, 6, and 24 h after surgery in 26 patients undergoing THA with spinal anaesthesia and an opioid-sparing analgesic regime. Haemoglobin, fluid balance, and opioid use were recorded. Systolic (SAP) and diastolic (DAP) arterial pressure, heart rate (HR), stroke volume (SV), cardiac output (CO...

A fast autofocus algorithm for synthetic aperture radar processing

DEFF Research Database (Denmark)

Dall, Jørgen

1992-01-01

High-resolution synthetic aperture radar (SAR) imaging requires the motion of the radar platform to be known very accurately. Otherwise, phase errors are induced in the processing of the raw SAR data, and bad focusing results. In particular, a constant error in the measured along-track velocity o...... of magnitude lower than that of other algorithms providing comparable accuracies is presented. The algorithm has been tested on data from the Danish Airborne SAR, and the performance is compared with that of the traditional map drift algorithm...

Algorithm of search and track of static and moving large-scale objects

Directory of Open Access Journals (Sweden)

Kalyaev Anatoly

2017-01-01

Full Text Available We suggest an algorithm for processing of a sequence, which contains images of search and track of static and moving large-scale objects. The possible software implementation of the algorithm, based on multithread CUDA processing, is suggested. Experimental analysis of the suggested algorithm implementation is performed.

Fast algorithm for probabilistic bone edge detection (FAPBED)

Science.gov (United States)

Scepanovic, Danilo; Kirshtein, Joshua; Jain, Ameet K.; Taylor, Russell H.

2005-04-01

The registration of preoperative CT to intra-operative reality systems is a crucial step in Computer Assisted Orthopedic Surgery (CAOS). The intra-operative sensors include 3D digitizers, fiducials, X-rays and Ultrasound (US). FAPBED is designed to process CT volumes for registration to tracked US data. Tracked US is advantageous because it is real time, noninvasive, and non-ionizing, but it is also known to have inherent inaccuracies which create the need to develop a framework that is robust to various uncertainties, and can be useful in US-CT registration. Furthermore, conventional registration methods depend on accurate and absolute segmentation. Our proposed probabilistic framework addresses the segmentation-registration duality, wherein exact segmentation is not a prerequisite to achieve accurate registration. In this paper, we develop a method for fast and automatic probabilistic bone surface (edge) detection in CT images. Various features that influence the likelihood of the surface at each spatial coordinate are combined using a simple probabilistic framework, which strikes a fair balance between a high-level understanding of features in an image and the low-level number crunching of standard image processing techniques. The algorithm evaluates different features for detecting the probability of a bone surface at each voxel, and compounds the results of these methods to yield a final, low-noise, probability map of bone surfaces in the volume. Such a probability map can then be used in conjunction with a similar map from tracked intra-operative US to achieve accurate registration. Eight sample pelvic CT scans were used to extract feature parameters and validate the final probability maps. An un-optimized fully automatic Matlab code runs in five minutes per CT volume on average, and was validated by comparison against hand-segmented gold standards. The mean probability assigned to nonzero surface points was 0.8, while nonzero non-surface points had a mean

Evidence-based algorithm for heparin dosing before cardiopulmonary bypass. Part 1: Development of the algorithm.

Science.gov (United States)

McKinney, Mark C; Riley, Jeffrey B

2007-12-01

The incidence of heparin resistance during adult cardiac surgery with cardiopulmonary bypass has been reported at 15%-20%. The consistent use of a clinical decision-making algorithm may increase the consistency of patient care and likely reduce the total required heparin dose and other problems associated with heparin dosing. After a directed survey of practicing perfusionists regarding treatment of heparin resistance and a literature search for high-level evidence regarding the diagnosis and treatment of heparin resistance, an evidence-based decision-making algorithm was constructed. The face validity of the algorithm decisive steps and logic was confirmed by a second survey of practicing perfusionists. The algorithm begins with review of the patient history to identify predictors for heparin resistance. The definition for heparin resistance contained in the algorithm is an activated clotting time 450 IU/kg heparin loading dose. Based on the literature, the treatment for heparin resistance used in the algorithm is anti-thrombin III supplement. The algorithm seems to be valid and is supported by high-level evidence and clinician opinion. The next step is a human randomized clinical trial to test the clinical procedure guideline algorithm vs. current standard clinical practice.

Fast pattern recognition with the ATLAS L1Track trigger for HL-LHC

CERN Document Server

AUTHOR|(INSPIRE)INSPIRE-00530554; The ATLAS collaboration

2017-01-01

A fast hardware based track trigger is being developed in ATLAS for the High Luminosity upgrade of the Large Hadron Collider. The goal is to achieve trigger levels in the high pile-up conditions of the High Luminosity Large Hadron Collider that are similar or better than those achieved at low pile-up conditions by adding tracking information to the ATLAS hardware trigger. A method for fast pattern recognition using the Hough transform is investigated. In this method, detector hits are mapped onto a 2D parameter space with one parameter related to the transverse momentum and one to the initial track direction. The performance of the Hough transform is studied at different pile-up values. It is also compared, using full event simulation of events with average pile-up of 200, with a method based on matching detector hits to pattern banks of simulated tracks stored in a custom made Associative Memory ASICs. The pattern recognition is followed by a track fitting step which calculates the track parameters. The spee...

Hardware-based tracking at trigger level for ATLAS: The Fast Tracker (FTK) Project

CERN Document Server

Gramling, Johanna; The ATLAS collaboration

2015-01-01

Physics collisions at 13 TeV are expected at the LHC with an average of 40-50 proton-proton collisions per bunch crossing. Tracking at trigger level is an essential tool to control the rate in high-pileup conditions while maintaining a good efficiency for relevant physics processes. The Fast TracKer (FTK) is an integral part of the trigger upgrade for the ATLAS detector. For every event passing the Level 1 trigger (at a maximum rate of 100 kHz) the FTK receives data from the 80 million channels of the silicon detectors, providing tracking information to the High Level Trigger in order to ensure a selection robust against pile-up. The FTK performs a hardware-based track reconstruction, using associative memory (AM) that is based on the use of a custom chip, designed to perform pattern matching at very high speed. It finds track candidates at low resolution (roads) that seed a full-resolution track fitting done by FPGAs. Narrow roads permit a fast track fitting but need many patterns stored in the AM to ensure ...

Fast-track, ambulatory ultrasound-guided Tru-Cut liver biopsy is feasible and cost-efficient

DEFF Research Database (Denmark)

Huang, Chenxi; Lorentzen, Torben; Skjoldbye, Bjørn

2015-01-01

INTRODUCTION: Most institutions perform percutaneous liver biopsy with a post-biopsy patient observation period lasting up to eight hours, which is resource-demanding. This study aimed to evaluate the safety of liver biopsy performed in a fast-track set-up with an only one-hour post......-biopsy observation time. METHODS: Patients referred to our institution underwent fast-track ultrasound-guided 18-gauge Tru-Cut liver biopsy procedures. Each single biopsy procedure was followed by a post-procedure observational period of one hour and an additional focused assessment with sonography for trauma before...... safely discharged from our institution. No fatality or long-term complications were found during this study. CONCLUSION: The fast-track approach reported herein is a feasible option when adequate patient information is given. Besides the obvious, positive effect on patient logistics and departmental...

Fast pattern recognition with the ATLAS L1 track trigger for the HL-LHC

CERN Document Server

Martensson, Mikael; The ATLAS collaboration

2016-01-01

A fast hardware based track trigger for high luminosity upgrade of the Large Hadron Collider (HL- LHC) is being developed in ATLAS. The goal is to achieve trigger levels in high pileup collisions that are similar or even better than those achieved at low pile-up running of LHC by adding tracking information to the ATLAS hardware trigger which is currently based on information from calorimeters and muon trigger chambers only. Two methods for fast pattern recognition are investigated. The first is based on matching tracker hits to pattern banks of simulated high momentum tracks which are stored in a custom made Associative Memory (AM) ASIC. The second is based on the Hough transform where detector hits are transformed into 2D Hough space with one variable related to track pt and one to track direction. Hits found by pattern recognition will be sent to a track fitting step which calculates the track parameters . The speed and precision of the track fitting depends on the quality of the hits selected by the patte...

Comparison of fast neutron-induced tracks in plastics using the electrochemical etching method

International Nuclear Information System (INIS)

Cotter, S.J.; Gammage, R.B.; Thorngate, J.H.; Ziemer, P.L.

1979-01-01

Four plastics were examined by the electrochemical etching method for their suitability in registering fast neutron-induced recoil particle tracks. The plastics were cellulose acetate, cellulose triacetate, cellulose acetobutyrate and polycarbonate. Cellulose acetate and triacetate displayed high levels of water absorptivity during etching while the acetobutyrate foils cracked due to electromechanical stresses at high frequencies (>500 Hz). The clarity of the etched track was superior in the polycarbonate foils, suggesting the latter as the generally preferred dosimeter for fast neutrons. (author)

Real Time Optima Tracking Using Harvesting Models of the Genetic Algorithm

Science.gov (United States)

Baskaran, Subbiah; Noever, D.

1999-01-01

Tracking optima in real time propulsion control, particularly for non-stationary optimization problems is a challenging task. Several approaches have been put forward for such a study including the numerical method called the genetic algorithm. In brief, this approach is built upon Darwinian-style competition between numerical alternatives displayed in the form of binary strings, or by analogy to 'pseudogenes'. Breeding of improved solution is an often cited parallel to natural selection in.evolutionary or soft computing. In this report we present our results of applying a novel model of a genetic algorithm for tracking optima in propulsion engineering and in real time control. We specialize the algorithm to mission profiling and planning optimizations, both to select reduced propulsion needs through trajectory planning and to explore time or fuel conservation strategies.

A fast track trigger processor for the OPAL detector at LEP

International Nuclear Information System (INIS)

Carter, A.A.; Jaroslawski, S.; Wagner, A.

1986-01-01

A fast hardware track trigger processor being built for the OPAL experiment is described. The processor will analyse data from the central drift chambers of OPAL to determine whether any tracks come from the interaction region, and thereby eliminate background events. The processor will find tracks over a large angular range, vertical strokecos thetavertical stroke < or approx. 0.95. The design of the processor is described, together with a brief account of its hardware implementation for OPAL. The results of feasibility studies are also presented. (orig.)

Optimal Dynamic Strategies for Index Tracking and Algorithmic Trading

Science.gov (United States)

Ward, Brian

In this thesis we study dynamic strategies for index tracking and algorithmic trading. Tracking problems have become ever more important in Financial Engineering as investors seek to precisely control their portfolio risks and exposures over different time horizons. This thesis analyzes various tracking problems and elucidates the tracking errors and strategies one can employ to minimize those errors and maximize profit. In Chapters 2 and 3, we study the empirical tracking properties of exchange traded funds (ETFs), leveraged ETFs (LETFs), and futures products related to spot gold and the Chicago Board Option Exchange (CBOE) Volatility Index (VIX), respectively. These two markets provide interesting and differing examples for understanding index tracking. We find that static strategies work well in the nonleveraged case for gold, but fail to track well in the corresponding leveraged case. For VIX, tracking via neither ETFs, nor futures\\ portfolios succeeds, even in the nonleveraged case. This motivates the need for dynamic strategies, some of which we construct in these two chapters and further expand on in Chapter 4. There, we analyze a framework for index tracking and risk exposure control through financial derivatives. We derive a tracking condition that restricts our exposure choices and also define a slippage process that characterizes the deviations from the index over longer horizons. The framework is applied to a number of models, for example, Black Scholes model and Heston model for equity index tracking, as well as the Square Root (SQR) model and the Concatenated Square Root (CSQR) model for VIX tracking. By specifying how each of these models fall into our framework, we are able to understand the tracking errors in each of these models. Finally, Chapter 5 analyzes a tracking problem of a different kind that arises in algorithmic trading: schedule following for optimal execution. We formulate and solve a stochastic control problem to obtain the optimal

An Improved Brain-Inspired Emotional Learning Algorithm for Fast Classification

Directory of Open Access Journals (Sweden)

Ying Mei

2017-06-01

Full Text Available Classification is an important task of machine intelligence in the field of information. The artificial neural network (ANN is widely used for classification. However, the traditional ANN shows slow training speed, and it is hard to meet the real-time requirement for large-scale applications. In this paper, an improved brain-inspired emotional learning (BEL algorithm is proposed for fast classification. The BEL algorithm was put forward to mimic the high speed of the emotional learning mechanism in mammalian brain, which has the superior features of fast learning and low computational complexity. To improve the accuracy of BEL in classification, the genetic algorithm (GA is adopted for optimally tuning the weights and biases of amygdala and orbitofrontal cortex in the BEL neural network. The combinational algorithm named as GA-BEL has been tested on eight University of California at Irvine (UCI datasets and two well-known databases (Japanese Female Facial Expression, Cohn–Kanade. The comparisons of experiments indicate that the proposed GA-BEL is more accurate than the original BEL algorithm, and it is much faster than the traditional algorithm.

A configurable tracking algorithm to detect cosmic muon tracks for the CMS-RPC based technical trigger

CERN Document Server

Rajan, R T; Loddo, F; Maggi, M; Ranieri, A; Abbrescia, M; Guida, R; Iaselli, G; Nuzzo, S; Pugliese, G; Roselli, G; Trentadue, R; Tupputi, b, S; Benussi, L; Bertani, M; Bianco, S; Fabbri, F; Cavallo, N; Cimmino, e, A; Lomidze, D; Noli, P; Paolucci, P; Piccolo, D; Polese, G; Sciacca, C; Baesso, g, P; Belli, G; Necchi, M; Ratti, S P; Pagano, D; Vitulo, P; Viviani, C; Dimitrov, A; Litov, L; Pavlov, B; Petkov, P; Genchev, V; Iaydjiev, P; Bunkowski, K; Kierzkowski, K; Konecki, M; Kudla, I; Pietrusinski, M; Pozniak, K

2009-01-01

In the CERN CMS experiment at LHC Collider special trigger signals called Technical Triggers will be used for the purpose of test and calibration. The Resistive Plate Chambers (RPC) based Technical Trigger system is a part of the CMS muon trigger system and is designed to detect cosmic muon tracks. It is based on two boards, namely RBC (RPC Balcony Collector) and TTU (Technical Trigger Unit). The proposed tracking algorithm (TA) written in VHDL and implemented in the TTU board detects single or multiple cosmic muon tracks at every bunch crossing along with their track lengths and corresponding chamber coordinates. The TA implementation in VHDL and its preliminary simulation results are presented.

A self seeded first level track trigger for ATLAS

International Nuclear Information System (INIS)

Schöning, A

2012-01-01

For the planned high luminosity upgrade of the Large Hadron Collider, aiming to increase the instantaneous luminosity to 5 × 10 34 cm −2 s −1 , the implementation of a first level track trigger has been proposed. This trigger could be installed in the year ∼ 2021 along with the complete renewal of the ATLAS inner detector. The fast readout of the hit information from the Inner Detector is considered as the main challenge of such a track trigger. Different concepts for the implementation of a first level trigger are currently studied within the ATLAS collaboration. The so called 'Self Seeded' track trigger concept exploits fast frontend filtering algorithms based on cluster size reconstruction and fast vector tracking to select hits associated to high momentum tracks. Simulation studies have been performed and results on efficiencies, purities and trigger rates are presented for different layouts.

Maximum power point tracking

International Nuclear Information System (INIS)

Enslin, J.H.R.

1990-01-01

A well engineered renewable remote energy system, utilizing the principal of Maximum Power Point Tracking can be m ore cost effective, has a higher reliability and can improve the quality of life in remote areas. This paper reports that a high-efficient power electronic converter, for converting the output voltage of a solar panel, or wind generator, to the required DC battery bus voltage has been realized. The converter is controlled to track the maximum power point of the input source under varying input and output parameters. Maximum power point tracking for relative small systems is achieved by maximization of the output current in a battery charging regulator, using an optimized hill-climbing, inexpensive microprocessor based algorithm. Through practical field measurements it is shown that a minimum input source saving of 15% on 3-5 kWh/day systems can easily be achieved. A total cost saving of at least 10-15% on the capital cost of these systems are achievable for relative small rating Remote Area Power Supply systems. The advantages at larger temperature variations and larger power rated systems are much higher. Other advantages include optimal sizing and system monitor and control

Fast simulation of the forward tracking detector of HPLUS

International Nuclear Information System (INIS)

Zhang Yapeng; Fan Ruirui; Fu Fen; Yue Ke; Yuan Xiaohua; Xu Huagen; Chinese Academy of Sciences, Beijing; Yao Nan; Xu Hushan; Jin Genming; Liang Jinjie; Chen Ruofu; Sun Zhiyu; Duan Limin; Xiao Zhigang; Tsinghua Univ., Beijing

2008-01-01

The necessity of installing a forward tracking detector stack is discussed for the Hadron Physics Lanzhou Spectrometer(HPLUS). A local tracker is developed to solve the multi-track finding problem. The track candidates are searched iteratively via Hough Transform. The fake tracks are removed by a least square fitting process. With this tracker we have studied the feasibility of pp→pp+φ(→K + K - ), a typical physical channel proposed on HPLUS. The single track momentum resolution due to the uncertainty of the positioning in FTD is 1.3%. The multiple scattering effect contributes about 20% to the momentum resolution in the FTD coverage. The width and the signal-to-background ratio of the reconstructed φ are 1.51 MeV and 4.36, respectively, taking into account the direct Kaon channel pp→pp+K + K - as background. The geometry coverage of FTD for qb events is about 85.4%. Based on the current fast simulation and estimation, the geometrical configuration of FTD meets the physical requirement of HPLUS under the current luminosity and multiplicity conditions. The tracker is applicable in the full simulation coming next and is extendable to other tracking component of HPLUS. (authors)

Developing an eye-tracking algorithm as a potential tool for early diagnosis of autism spectrum disorder in children.

Directory of Open Access Journals (Sweden)

Natalia I Vargas-Cuentas

Full Text Available Autism spectrum disorder (ASD currently affects nearly 1 in 160 children worldwide. In over two-thirds of evaluations, no validated diagnostics are used and gold standard diagnostic tools are used in less than 5% of evaluations. Currently, the diagnosis of ASD requires lengthy and expensive tests, in addition to clinical confirmation. Therefore, fast, cheap, portable, and easy-to-administer screening instruments for ASD are required. Several studies have shown that children with ASD have a lower preference for social scenes compared with children without ASD. Based on this, eye-tracking and measurement of gaze preference for social scenes has been used as a screening tool for ASD. Currently available eye-tracking software requires intensive calibration, training, or holding of the head to prevent interference with gaze recognition limiting its use in children with ASD.In this study, we designed a simple eye-tracking algorithm that does not require calibration or head holding, as a platform for future validation of a cost-effective ASD potential screening instrument. This system operates on a portable and inexpensive tablet to measure gaze preference of children for social compared to abstract scenes. A child watches a one-minute stimulus video composed of a social scene projected on the left side and an abstract scene projected on the right side of the tablet's screen. We designed five stimulus videos by changing the social/abstract scenes. Every child observed all the five videos in random order. We developed an eye-tracking algorithm that calculates the child's gaze preference for the social and abstract scenes, estimated as the percentage of the accumulated time that the child observes the left or right side of the screen, respectively. Twenty-three children without a prior history of ASD and 8 children with a clinical diagnosis of ASD were evaluated. The recorded video of the child´s eye movement was analyzed both manually by an observer

Warfarin Dosing Algorithms Underpredict Dose Requirements in Patients Requiring ≥7 mg Daily: A Systematic Review and Meta-analysis.

Science.gov (United States)

Saffian, S M; Duffull, S B; Wright, Dfb

2017-08-01

There is preliminary evidence to suggest that some published warfarin dosing algorithms produce biased maintenance dose predictions in patients who require higher than average doses. We conducted a meta-analysis of warfarin dosing algorithms to determine if there exists a systematic under- or overprediction of dose requirements for patients requiring ≥7 mg/day across published algorithms. Medline and Embase databases were searched up to September 2015. We quantified the proportion of over- and underpredicted doses in patients whose observed maintenance dose was ≥7 mg/day. The meta-analysis included 47 evaluations of 22 different warfarin dosing algorithms from 16 studies. The meta-analysis included data from 1,492 patients who required warfarin doses of ≥7 mg/day. All 22 algorithms were found to underpredict warfarin dosing requirements in patients who required ≥7 mg/day by an average of 2.3 mg/day with a pooled estimate of underpredicted doses of 92.3% (95% confidence interval 90.3-94.1, I 2 = 24%). © 2017 American Society for Clinical Pharmacology and Therapeutics.

Delirium in fast-track colonic surgery

DEFF Research Database (Denmark)

Kurbegovic, Sorel; Andersen, Jens; Krenk, Lene

2015-01-01

BACKGROUND: Postoperative delirium (PD) is a common but serious problem after major surgery with a multifactorial pathogenesis including age, pain, opioid use, sleep disturbances and the surgical stress response. These factors have been minimised by the "fast-track methodology" previously...... demonstrated to enhance recovery and reduce morbidity. METHODS: Clinical symptoms of PD were routinely collected three times daily from preoperatively until discharge in a well-defined enhanced recovery program after colonic surgery in 247 consecutive patients. RESULTS: Total median length of hospital stay...... postoperative recovery program may decrease the risk and duration of PD after colonic surgery....

The yield of colorectal cancer among fast track patients with normocytic and microcytic anaemia.

Science.gov (United States)

Panagiotopoulou, I G; Fitzrol, D; Parker, R A; Kuzhively, J; Luscombe, N; Wells, A D; Menon, M; Bajwa, F M; Watson, M A

2014-05-01

We receive fast track referrals on the basis of iron deficiency anaemia (IDA) for patients with normocytic anaemia or for patients with no iron studies. This study examined the yield of colorectal cancer (CRC) among fast track patients to ascertain whether awaiting confirmation of IDA is necessary prior to performing bowel investigations. A review was undertaken of 321 and 930 consecutive fast track referrals from Centre A and Centre B respectively. Contingency tables were analysed using Fisher's exact test. Logistic regression analyses were performed to investigate significant predictors of CRC. Overall, 229 patients were included from Centre A and 689 from Centre B. The odds ratio for microcytic anaemia versus normocytic anaemia in the outcome of CRC was 1.3 (95% confidence interval [CI]: 0.5-3.9) for Centre A and 1.6 (95% CI: 0.8-3.3) for Centre B. In a logistic regression analysis (Centre B only), no significant difference in CRC rates was seen between microcytic and normocytic anaemia (adjusted odds ratio: 1.9, 95% CI: 0.9-3.9). There was no statistically significant difference in the yield of CRC between microcytic and normocytic anaemia (p=0.515, Fisher's exact test) in patients with anaemia only and no colorectal symptoms. Finally, CRC cases were seen in both microcytic and normocytic groups with or without low ferritin. There is no significant difference in the yield of CRC between fast track patients with microcytic and normocytic anaemia. This study provides insufficient evidence to support awaiting confirmation of IDA in fast track patients with normocytic anaemia prior to requesting bowel investigations.

The ATLAS Fast Tracker and Tracking at the High-Luminosity LHC

CERN Document Server

AUTHOR|(INSPIRE)INSPIRE-00236423; The ATLAS collaboration

2016-01-01

The LHC’s increase in centre of mass energy and luminosity in 2015 makes controlling trigger rates with high efficiency challenging. The ATLAS Fast TracKer (FTK) is a hardware processor built to reconstruct tracks at a rate of up to 100 kHz and provide them to the high level trigger. The FTK reconstructs tracks by matching incoming detector hits with pre-defined track patterns stored in associative memory on custom ASICs. Inner detector hits are fit to these track patterns using modern FPGAs. These procedings describe the electronics system used for the FTK’s massive parallelization. An overview of the installation, commissioning and running of the system is given. The ATLAS upgrades planned to enable tracking at the High Luminosity LHC are also discussed.

A fast butterfly algorithm for generalized Radon transforms

KAUST Repository

Hu, Jingwei; Fomel, Sergey; Demanet, Laurent; Ying, Lexing

2013-01-01

Generalized Radon transforms, such as the hyperbolic Radon transform, cannot be implemented as efficiently in the frequency domain as convolutions, thus limiting their use in seismic data processing. We have devised a fast butterfly algorithm

Global track finder for Belle II experiment

Energy Technology Data Exchange (ETDEWEB)

Trusov, Viktor; Feindt, Michael; Heck, Martin; Kuhr, Thomas; Goldenzweig, Pablo [Karlsruhe Institute of Technology, IEKP (Germany); Collaboration: Belle II-Collaboration

2015-07-01

We present an implementation of a method based on the Legendre transformation for reconstruction charged particle tracks in the central drift chamber of the Belle II experiment. The method is designed for fast track finding and restoring circular patterns of track hits in transverse plane. It is done by searching for common tangents to drift circles of hits in the conformal space. With known transverse trajectories longitudinal momentum estimation performed by assigning stereo hits followed by determination of the track parameters. The method includes algorithms responsible for track quality estimation and reduction of rate of fakes. The work is targeting at increasing the efficiency and reducing the execution time because the computing power available to the experiment is limited. The algorithm is developed within the Belle II software environment with using Monte-Carlo simulation for probing its efficiency.

A Robust Vision-based Runway Detection and Tracking Algorithm for Automatic UAV Landing

KAUST Repository

Abu Jbara, Khaled F.

2015-05-01

This work presents a novel real-time algorithm for runway detection and tracking applied to the automatic takeoff and landing of Unmanned Aerial Vehicles (UAVs). The algorithm is based on a combination of segmentation based region competition and the minimization of a specific energy function to detect and identify the runway edges from streaming video data. The resulting video-based runway position estimates are updated using a Kalman Filter, which can integrate other sensory information such as position and attitude angle estimates to allow a more robust tracking of the runway under turbulence. We illustrate the performance of the proposed lane detection and tracking scheme on various experimental UAV flights conducted by the Saudi Aerospace Research Center. Results show an accurate tracking of the runway edges during the landing phase under various lighting conditions. Also, it suggests that such positional estimates would greatly improve the positional accuracy of the UAV during takeoff and landing phases. The robustness of the proposed algorithm is further validated using Hardware in the Loop simulations with diverse takeoff and landing videos generated using a commercial flight simulator.

Fast algorithms for transport models. Final report, June 1, 1993--May 31, 1994

International Nuclear Information System (INIS)

Manteuffel, T.

1994-12-01

The focus of this project is the study of multigrid and multilevel algorithms for the numerical solution of Boltzmann models of the transport of neutral and charged particles. In previous work a fast multigrid algorithm was developed for the numerical solution of the Boltzmann model of neutral particle transport in slab geometry assuming isotropic scattering. The new algorithm is extremely fast in the thick diffusion limit; the multigrid v-cycle convergence factor approaches zero as the mean-free-path between collisions approaches zero, independent of the mesh. Also, a fast multilevel method was developed for the numerical solution of the Boltzmann model of charged particle transport in the thick Fokker-Plank limit for slab geometry. Parallel implementations were developed for both algorithms

A Single Phase Doubly Grounded Semi-Z-Source Inverter for Photovoltaic (PV Systems with Maximum Power Point Tracking (MPPT

Directory of Open Access Journals (Sweden)

Tofael Ahmed

2014-06-01

Full Text Available In this paper, a single phase doubly grounded semi-Z-source inverter with maximum power point tracking (MPPT is proposed for photovoltaic (PV systems. This proposed system utilizes a single-ended primary inductor (SEPIC converter as DC-DC converter to implement the MPPT algorithm for tracking the maximum power from a PV array and a single phase semi-Z-source inverter for integrating the PV with AC power utilities. The MPPT controller utilizes a fast-converging algorithm to track the maximum power point (MPP and the semi-Z-source inverter utilizes a nonlinear SPWM to produce sinusoidal voltage at the output. The proposed system is able to track the MPP of PV arrays and produce an AC voltage at its output by utilizing only three switches. Experimental results show that the fast-converging MPPT algorithm has fast tracking response with appreciable MPP efficiency. In addition, the inverter shows the minimization of common mode leakage current with its ground sharing feature and reduction of the THD as well as DC current components at the output during DC-AC conversion.

Short Hospital Stay after Laparoscopic Colorectal Surgery without Fast Track

Directory of Open Access Journals (Sweden)

Stefan K. Burgdorf

2012-01-01

Full Text Available Purpose. Short hospital stay and equal or reduced complication rates have been demonstrated after fast track open colonic surgery. However, fast track principles of perioperative care can be difficult to implement and often require increased nursing staff because of more concentrated nursing tasks during the shorter hospital stay. Specific data on nursing requirements after laparoscopic surgery are lacking. The purpose of the study was to evaluate the effect of operative technique (open versus laparoscopic operation, but without changing nurse staffing or principles for peri- or postoperative care, that is, without implementing fast track principles, on length of stay after colorectal resection for cancer. Methods. Records of all patients operated for colorectal cancer from November 2004 to December 2008 in our department were reviewed. No specific patients were selected for laparoscopic repair, which was solely dependent on the presence of two specific surgeons at the same time. Thus, the patients were not selected for laparoscopic repair based on patient-related factors, but only on the simultaneous presence of two specific surgeons on the day of the operation. Results. Of a total of 540 included patients, 213 (39% were operated by a laparoscopic approach. The median hospital stay for patients with a primary anastomosis was significantly shorter after laparoscopic than after conventional open surgery (5 versus 8 days, while there was no difference in patients receiving a stoma (10 versus 10 days, ns, with no changes in the perioperative care regimens. Furthermore there were significant lower blood loss (50 versus 200 mL, and lower complication rate (21% versus 32%, in the laparoscopic group. Conclusion. Implementing laparoscopic colorectal surgery in our department resulted in shorter hospital stay without using fast track principles for peri- and postoperative care in patients not receiving a stoma during the operation. Consequently, we

Particle Filter-Based Target Tracking Algorithm for Magnetic Resonance-Guided Respiratory Compensation : Robustness and Accuracy Assessment

NARCIS (Netherlands)

Bourque, Alexandra E; Bedwani, Stéphane; Carrier, Jean-François; Ménard, Cynthia; Borman, Pim; Bos, Clemens; Raaymakers, Bas W; Mickevicius, Nikolai; Paulson, Eric; Tijssen, Rob H N

PURPOSE: To assess overall robustness and accuracy of a modified particle filter-based tracking algorithm for magnetic resonance (MR)-guided radiation therapy treatments. METHODS AND MATERIALS: An improved particle filter-based tracking algorithm was implemented, which used a normalized

A numerically stable, finite memory, fast array recursive least squares filter for broadband active noise control

NARCIS (Netherlands)

Ophem, S. van; Berkhoff, A.P.

2016-01-01

Summary For broadband active noise control applications with a rapidly changing primary path, it is desirable to find algorithms with a rapid convergence, a fast tracking performance, and a low computational cost. Recently, a promising algorithm has been presented, called the fast-array Kalman

SU-G-JeP1-12: Head-To-Head Performance Characterization of Two Multileaf Collimator Tracking Algorithms for Radiotherapy

International Nuclear Information System (INIS)

Caillet, V; Colvill, E; O’Brien, R; Keall, P; Poulsen, P; Moore, D; Booth, J; Sawant, A

2016-01-01

Purpose: Multi-leaf collimator (MLC) tracking is being clinically pioneered to continuously compensate for thoracic and abdominal motion during radiotherapy. The purpose of this work is to characterize the performance of two MLC tracking algorithms for cancer radiotherapy, based on a direct optimization and a piecewise leaf fitting approach respectively. Methods: To test the algorithms, both physical and in silico experiments were performed. Previously published high and low modulation VMAT plans for lung and prostate cancer cases were used along with eight patient-measured organ-specific trajectories. For both MLC tracking algorithm, the plans were run with their corresponding patient trajectories. The physical experiments were performed on a Trilogy Varian linac and a programmable phantom (HexaMotion platform). For each MLC tracking algorithm, plan and patient trajectory, the tracking accuracy was quantified as the difference in aperture area between ideal and fitted MLC. To compare algorithms, the average cumulative tracking error area for each experiment was calculated. The two-sample Kolmogorov-Smirnov (KS) test was used to evaluate the cumulative tracking errors between algorithms. Results: Comparison of tracking errors for the physical and in silico experiments showed minor differences between the two algorithms. The KS D-statistics for the physical experiments were below 0.05 denoting no significant differences between the two distributions pattern and the average error area (direct optimization/piecewise leaf-fitting) were comparable (66.64 cm2/65.65 cm2). For the in silico experiments, the KS D-statistics were below 0.05 and the average errors area were also equivalent (49.38 cm2/48.98 cm2). Conclusion: The comparison between the two leaf fittings algorithms demonstrated no significant differences in tracking errors, neither in a clinically realistic environment nor in silico. The similarities in the two independent algorithms give confidence in the use

SU-G-JeP1-12: Head-To-Head Performance Characterization of Two Multileaf Collimator Tracking Algorithms for Radiotherapy

Energy Technology Data Exchange (ETDEWEB)

Caillet, V; Colvill, E [School of Medecine, The University of Sydney, Sydney, NSW (Australia); Royal North Shore Hospital, St Leonards, Sydney (Australia); O’Brien, R; Keall, P [School of Medecine, The University of Sydney, Sydney, NSW (Australia); Poulsen, P [Aarhus University Hospital, Aarhus (Denmark); Moore, D [UT Southwestern Medical Center, Dallas, TX (United States); University of Maryland School of Medicine, Baltimore, MD (United States); Booth, J [Royal North Shore Hospital, St Leonards, Sydney (Australia); Sawant, A [University of Maryland School of Medicine, Baltimore, MD (United States)

2016-06-15

Purpose: Multi-leaf collimator (MLC) tracking is being clinically pioneered to continuously compensate for thoracic and abdominal motion during radiotherapy. The purpose of this work is to characterize the performance of two MLC tracking algorithms for cancer radiotherapy, based on a direct optimization and a piecewise leaf fitting approach respectively. Methods: To test the algorithms, both physical and in silico experiments were performed. Previously published high and low modulation VMAT plans for lung and prostate cancer cases were used along with eight patient-measured organ-specific trajectories. For both MLC tracking algorithm, the plans were run with their corresponding patient trajectories. The physical experiments were performed on a Trilogy Varian linac and a programmable phantom (HexaMotion platform). For each MLC tracking algorithm, plan and patient trajectory, the tracking accuracy was quantified as the difference in aperture area between ideal and fitted MLC. To compare algorithms, the average cumulative tracking error area for each experiment was calculated. The two-sample Kolmogorov-Smirnov (KS) test was used to evaluate the cumulative tracking errors between algorithms. Results: Comparison of tracking errors for the physical and in silico experiments showed minor differences between the two algorithms. The KS D-statistics for the physical experiments were below 0.05 denoting no significant differences between the two distributions pattern and the average error area (direct optimization/piecewise leaf-fitting) were comparable (66.64 cm2/65.65 cm2). For the in silico experiments, the KS D-statistics were below 0.05 and the average errors area were also equivalent (49.38 cm2/48.98 cm2). Conclusion: The comparison between the two leaf fittings algorithms demonstrated no significant differences in tracking errors, neither in a clinically realistic environment nor in silico. The similarities in the two independent algorithms give confidence in the use

Tracking Positioning Algorithm for Direction of Arrival Based on Direction Lock Loop

Directory of Open Access Journals (Sweden)

Xiu-Zhi Cheng

2015-06-01

Full Text Available In order to solve the problem of poor real-time performance, low accuracy and high computational complexity in the traditional process of locating and tracking of Direction of Arrival (DOA of moving targets, this paper proposes a DOA algorithm based on the Direction Lock Loop (DILL which adopts Lock Loop structure to realize the estimation and location of DOA and can adjust the direction automatically along with the changes of a signal’s angular variation to track the position of the signal. Meanwhile, to reduce the influence of nonlinearity and noise on its performance, the UKF filter is designed for eliminating interference of the estimated target signal to improve accuracy of the signal tracking and stability of the system. Simulation results prove that the algorithm can not only get a high resolution DOA estimate signal, but can also locate and track multiple mobile targets effectively with enhanced accuracy, efficiency and stability.

SU-E-I-36: A KWIC and Dirty Look at Dose Savings and Perfusion Metrics in Simulated CT Neuro Perfusion Exams

International Nuclear Information System (INIS)

Hoffman, J; Martin, T; Young, S; McNitt-Gray, M; Wang, D

2015-01-01

Purpose: CT neuro perfusion scans are one of the highest dose exams. Methods to reduce dose include decreasing the number of projections acquired per gantry rotation, however conventional reconstruction of such scans leads to sampling artifacts. In this study we investigated a projection view-sharing reconstruction algorithm used in dynamic MRI – “K-space Weighted Image Contrast” (KWIC) – applied to simulated perfusion exams and evaluated dose savings and impacts on perfusion metrics. Methods: A FORBILD head phantom containing simulated time-varying objects was developed and a set of parallel-beam CT projection data was created. The simulated scans were 60 seconds long, 1152 projections per turn, with a rotation time of one second. No noise was simulated. 5mm, 10mm, and 50mm objects were modeled in the brain. A baseline, “full dose” simulation used all projections and reduced dose cases were simulated by downsampling the number of projections per turn from 1152 to 576 (50% dose), 288 (25% dose), and 144 (12.5% dose). KWIC was further evaluated at 72 projections per rotation (6.25%). One image per second was reconstructed using filtered backprojection (FBP) and KWIC. KWIC reconstructions utilized view cores of 36, 72, 144, and 288 views and 16, 8, 4, and 2 subapertures respectively. From the reconstructed images, time-to-peak (TTP), cerebral blood flow (CBF) and the FWHM of the perfusion curve were calculated and compared against reference values from the full-dose FBP data. Results: TTP, CBF, and the FWHM were unaffected by dose reduction (to 12.5%) and reconstruction method, however image quality was improved when using KWIC. Conclusion: This pilot study suggests that KWIC preserves image quality and perfusion metrics when under-sampling projections and that the unique contrast weighting of KWIC could provided substantial dose-savings for perfusion CT scans. Evaluation of KWIC in clinical CT data will be performed in the near future. R01 EB014922, NCI

SU-E-I-36: A KWIC and Dirty Look at Dose Savings and Perfusion Metrics in Simulated CT Neuro Perfusion Exams

Energy Technology Data Exchange (ETDEWEB)

Hoffman, J; Martin, T; Young, S; McNitt-Gray, M; Wang, D [UCLA School of Medicine, Los Angeles, CA (United States)

2015-06-15

Purpose: CT neuro perfusion scans are one of the highest dose exams. Methods to reduce dose include decreasing the number of projections acquired per gantry rotation, however conventional reconstruction of such scans leads to sampling artifacts. In this study we investigated a projection view-sharing reconstruction algorithm used in dynamic MRI – “K-space Weighted Image Contrast” (KWIC) – applied to simulated perfusion exams and evaluated dose savings and impacts on perfusion metrics. Methods: A FORBILD head phantom containing simulated time-varying objects was developed and a set of parallel-beam CT projection data was created. The simulated scans were 60 seconds long, 1152 projections per turn, with a rotation time of one second. No noise was simulated. 5mm, 10mm, and 50mm objects were modeled in the brain. A baseline, “full dose” simulation used all projections and reduced dose cases were simulated by downsampling the number of projections per turn from 1152 to 576 (50% dose), 288 (25% dose), and 144 (12.5% dose). KWIC was further evaluated at 72 projections per rotation (6.25%). One image per second was reconstructed using filtered backprojection (FBP) and KWIC. KWIC reconstructions utilized view cores of 36, 72, 144, and 288 views and 16, 8, 4, and 2 subapertures respectively. From the reconstructed images, time-to-peak (TTP), cerebral blood flow (CBF) and the FWHM of the perfusion curve were calculated and compared against reference values from the full-dose FBP data. Results: TTP, CBF, and the FWHM were unaffected by dose reduction (to 12.5%) and reconstruction method, however image quality was improved when using KWIC. Conclusion: This pilot study suggests that KWIC preserves image quality and perfusion metrics when under-sampling projections and that the unique contrast weighting of KWIC could provided substantial dose-savings for perfusion CT scans. Evaluation of KWIC in clinical CT data will be performed in the near future. R01 EB014922, NCI

A-Track: Detecting Moving Objects in FITS images

Science.gov (United States)

Atay, T.; Kaplan, M.; Kilic, Y.; Karapinar, N.

2017-04-01

A-Track is a fast, open-source, cross-platform pipeline for detecting moving objects (asteroids and comets) in sequential telescope images in FITS format. The moving objects are detected using a modified line detection algorithm.

[Laparoscopic "fast-track" sigmoidectomy for diverticulitis disease in Germany. Results of a prospective quality assurance program].

Science.gov (United States)

Tsilimparis, N; Haase, O; Wendling, P; Kipfmüller, K; Schmid, M; Engemann, R; Schwenk, W

2010-09-01

The natural course of sigmoid colon diverticulitis during conservative therapy and the assessment of the perioperative morbidity after sigmoid colon resection are differently evaluated by surgeons and gastroenterologists. The "fast-track" rehabilitation accelerates the reconvalescence and reduces the rate of postoperative general complications after colorectal surgery. The results of the laparoscopic "Fast-track" sigmoidectomy should be examined within a quality assurance program to better evaluate the perioperative risks following surgical management of diverticulitis. A prospective data collection within the voluntary quality assurance program "fast-track" Kolon II was performed. All participating clinics agreed on a multimodal, evidence-based standard perioperative treatment in terms of a "fast-track" rehabilitation for elective operations for sigmoid diverticulitis. Data from 846 patients undergoing laparoscopic "fast-track" sigmoid colon resection in 23 surgical departments in Germany were collected and evaluated. The mean age of the patients was 63 years (range 23 - 91). 203 patients (24 %) had severe co-morbidities (ASA classification III - IV). A conversion to conventional open surgery was necessary in 51 cases (6 %). Complications occurred in 93 patients (11 %). 76 patients suffered a surgical complication (8.9 %) and 32 patients (3.8 %) a general complication. Two patients died postoperatively due to multi-organ failure following anastomotic leaks. The patients took solid food in median on day 1 after surgery (range, 0 - 5) and passed stool on day 2 (range, 0 - 22). Predefined discharge criteria (free of pain on oral medication, normal oral feeding, stool) were met on day 4 (range, 1 - 58) and the patients were discharged on day 7 (range, 3 - 72). The 30-day re-admission rate was 3.9 %. Patients undergoing laparoscopic "fast-track" sigmoidectomy had a low rate of general complications and had a rapid reconvalescence with a short postoperative in

Laparoscopic surgery contributes more to nutritional and immunologic recovery than fast-track care in colorectal cancer.

Science.gov (United States)

Xu, Dong; Li, Jun; Song, Yongmao; Zhou, Jiaojiao; Sun, Fangfang; Wang, Jianwei; Duan, Yin; Hu, Yeting; Liu, Yue; Wang, Xiaochen; Sun, Lifeng; Wu, Linshan; Ding, Kefeng

2015-02-04

Many clinical trials had repeatedly shown that fast-track perioperative care and laparoscopic surgery are both preferred in the treatment of colorectal cancer. But few studies were designed to explore the diverse biochemical impacts of the two counterparts on human immunologic and nutritional status. Ninety-two cases of colorectal cancer patients meeting the inclusion criteria were randomized to four groups: laparoscopy with fast-track treatment (LAFT); open surgery with fast-track treatment (OSFT); laparoscopy with conventional treatment (LAC); open surgery with conventional treatment (OSC). Peripheral blood tests including nutritional factors (albumin, prealbumin, and transferrin), humoral immunologic factors (IgG, IgM, and IgA), and cellular immunologic factors (T and NK cells) were evaluated. Blood samples were collected preoperatively (baseline) and 12 and 96 h after surgery (indicated as POH12 and POH96, respectively). Albumin, transferrin, prealbumin, and IgG levels were the highest in the LAFT group for both POH12 and POH96 time intervals. Repeated measures (two-way ANOVA) indicated that the difference of albumin, transferrin, and IgG level were attributed to surgery type (P  0.05). Only in the laparoscopy-included groups, the relative albumin and IgG levels of POH96 were obviously higher than that of POH12. Laparoscopic surgery accelerated postoperative nutrition and immune levels rising again while fast-track treatment retarded the drop of postoperative nutrition and immune levels. Laparoscopic surgery might play a more important role than fast-track treatment in the earlier postoperative recovery of nutritional and immunologic status. Combined laparoscopic surgery with fast-track treatment provided best postoperative recovery of nutrition and immune status. These results should be further compared with the clinical outcomes of our FTMDT trial (clinicaltrials.gov: NCT01080547).

Object Detection and Tracking using Modified Diamond Search Block Matching Motion Estimation Algorithm

Directory of Open Access Journals (Sweden)

Apurva Samdurkar

2018-06-01

Full Text Available Object tracking is one of the main fields within computer vision. Amongst various methods/ approaches for object detection and tracking, the background subtraction approach makes the detection of object easier. To the detected object, apply the proposed block matching algorithm for generating the motion vectors. The existing diamond search (DS and cross diamond search algorithms (CDS are studied and experiments are carried out on various standard video data sets and user defined data sets. Based on the study and analysis of these two existing algorithms a modified diamond search pattern (MDS algorithm is proposed using small diamond shape search pattern in initial step and large diamond shape (LDS in further steps for motion estimation. The initial search pattern consists of five points in small diamond shape pattern and gradually grows into a large diamond shape pattern, based on the point with minimum cost function. The algorithm ends with the small shape pattern at last. The proposed MDS algorithm finds the smaller motion vectors and fewer searching points than the existing DS and CDS algorithms. Further, object detection is carried out by using background subtraction approach and finally, MDS motion estimation algorithm is used for tracking the object in color video sequences. The experiments are carried out by using different video data sets containing a single object. The results are evaluated and compared by using the evaluation parameters like average searching points per frame and average computational time per frame. The experimental results show that the MDS performs better than DS and CDS on average search point and average computation time.

Fast Track Open Partial Nephrectomy: Reduced Postoperative Length of Stay with a Goal-Directed Pathway Does Not Compromise Outcome

Directory of Open Access Journals (Sweden)

Bilal Chughtai

2008-01-01

Full Text Available Introduction. The aim of this study is to examine the feasibility of reducing postoperative hospital stay following open partial nephrectomy through the implementation of a goal directed clinical management pathway. Materials and Methods. A fast track clinical pathway for open partial nephrectomy was introduced in July 2006 at our institution. The pathway has daily goals and targets discharge for all patients on the 3rd postoperative day (POD. Defined goals are (1 ambulation and liquid diet on the evening of the operative day; (2 out of bed (OOB at least 4 times on POD 1; (3 removal of Foley catheter on the morning of POD 2; (4 removal of Jackson Pratt drain on the afternoon of POD 2; (4 discharge to home on POD 3. Patients and family are instructed in the fast track protocol preoperatively. Demographic data, tumor size, length of stay, and complications were captured in a prospective database, and compared to a control group managed consecutively immediately preceding the institution of the fast track clinical pathway. Results. Data on 33 consecutive patients managed on the fast track clinical pathway was compared to that of 25 control patients. Twenty two (61% out of 36 fast track patients and 4 (16% out of 25 control patients achieved discharge on POD 3. Overall, fast track patients had a shorter hospital stay than controls (median, 3 versus 4 days; P = .012. Age (median, 55 versus 57 years, tumor size (median, 2.5 versus 2.5 cm, readmission within 30 days (5.5% versus 5.1%, and complications (10.2% versus 13.8% were similar in the fast track patients and control, respectively. Conclusions. In the present series, a fast track clinical pathway after open partial nephrectomy reduced the postoperative length of hospital stay and did not appear to increase the postoperative complication rate.

Improved Optical Flow Algorithm for a Intelligent Traffic Tracking System

Directory of Open Access Journals (Sweden)

Xia Yupeng

2013-05-01

Full Text Available It is known that to get the contours and segmentations of moving cars is the essential step of image processing in intelligent traffic tracking systems. As an effective way, the optical flow algorithm is widely used for this kind of applications. But in traditional gradient-based approaches, in order to make the data responding to the edges of moving objects expand to the area, which gray level is flat, it needs to keep the iteration times large enough. It takes a large amount of calculation time, and the accuracy of the result is not as good as expected. In order to improve the numerical reliability of image gradient data, Hessian matrix distinguishing, Gaussian filtering standard deviation amending, mean model amending and multi-image comparing, the four algorithms were investigated by applying them to track moving objects. From the experimental results, it is shown that both the calculation convergence speed and accuracy of our methods have greatly improved comparing with traditional algorithms, the feasibility and validity of those methods were confirmed.

Multichannel algorithm for fast 3D reconstruction

International Nuclear Information System (INIS)

Rodet, Thomas; Grangeat, Pierre; Desbat, Laurent

2002-01-01

Some recent medical imaging applications such as functional imaging (PET and SPECT) or interventional imaging (CT fluoroscopy) involve increasing amounts of data. In order to reduce the image reconstruction time, we develop a new fast 3D reconstruction algorithm based on a divide and conquer approach. The proposed multichannel algorithm performs an indirect frequential subband decomposition of the image f to be reconstructed (f=Σf j ) through the filtering of the projections Rf. The subband images f j are reconstructed on a downsampled grid without information suppression. In order to reduce the computation time, we do not backproject the null filtered projections and we downsample the number of projections according to the Shannon conditions associated with the subband image. Our algorithm is based on filtering and backprojection operators. Using the same algorithms for these basic operators, our approach is three and a half times faster than a classical FBP algorithm for a 2D image 512x512 and six times faster for a 3D image 32x512x512. (author)

Hardware-based Tracking at Trigger Level for ATLAS: The Fast TracKer (FTK) Project

CERN Document Server

Gramling, Johanna; The ATLAS collaboration

2015-01-01

Physics collisions at 13 TeV are expected at the LHC with an average of 40-50 proton-proton collisions per bunch crossing. Tracking at trigger level is an essential tool to control the rate in high-pileup conditions while maintaining a good efficiency for relevant physics processes. The Fast TracKer (FTK) is an integral part of the trigger upgrade for the ATLAS detector. For every event passing the Level 1 trigger (at a maximum rate of 100 kHz) the FTK receives data from the 80 million channels of the silicon detectors, providing tracking information to the High Level Trigger in order to ensure a selection robust against pile-up. The FTK performs a hardware- based track reconstruction, using associative memory (AM) that is based on the use of a custom chip, designed to perform pattern matching at very high speed. It finds track candidates at low resolution (roads) that seed a full-resolution track fitting done by FPGAs. Narrow roads permit a fast track fitting but need many patterns stored in the AM to ensure...

An improved fast and elitist multi-objective genetic algorithm-ANSGA-II for multi-objective optimization of inverse radiotherapy treatment planning

International Nuclear Information System (INIS)

Cao Ruifen; Li Guoli; Song Gang; Zhao Pan; Lin Hui; Wu Aidong; Huang Chenyu; Wu Yican

2007-01-01

Objective: To provide a fast and effective multi-objective optimization algorithm for inverse radiotherapy treatment planning system. Methods: Non-dominated Sorting Genetic Algorithm-NSGA-II is a representative of multi-objective evolutionary optimization algorithms and excels the others. The paper produces ANSGA-II that makes use of advantage of NSGA-II, and uses adaptive crossover and mutation to improve its flexibility; according the character of inverse radiotherapy treatment planning, the paper uses the pre-known knowledge to generate individuals of every generation in the course of optimization, which enhances the convergent speed and improves efficiency. Results: The example of optimizing average dose of a sheet of CT, including PTV, OAR, NT, proves the algorithm could find satisfied solutions in several minutes. Conclusions: The algorithm could provide clinic inverse radiotherapy treatment planning system with selection of optimization algorithms. (authors)

Non-destructive fast charging algorithm of lithium-ion batteries based on the control-oriented electrochemical model

International Nuclear Information System (INIS)

Chu, Zhengyu; Feng, Xuning; Lu, Languang; Li, Jianqiu; Han, Xuebing; Ouyang, Minggao

2017-01-01

Highlights: •A novel non-destructive fast charging algorithm of lithium-ion batteries is proposed. •A close-loop observer of lithium deposition status is constructed based on the SP2D model. •The charging current is modified online using the feedback of the lithium deposition status. •The algorithm can shorten the charging time and can be used for charging from different initial SOCs. •The post-mortem observation and degradation tests show that no lithium deposition occurs during fast charging. -- Abstract: Fast charging is critical for the application of lithium-ion batteries in electric vehicles. Conventional fast charging algorithms may shorten the cycle life of lithium-ion batteries and induce safety problems, such as internal short circuit caused by lithium deposition at the negative electrode. In this paper, a novel, non-destructive model-based fast charging algorithm is proposed. The fast charging algorithm is composed of two closed loops. The first loop includes an anode over-potential observer that can observe the status of lithium deposition online, whereas the second loop includes a feedback structure that can modify the current based on the observed status of lithium deposition. The charging algorithm enhances the charging current to maintain the observed anode over-potential near the preset threshold potential. Therefore, the fast charging algorithm can decrease the charging time while protecting the health of the battery. The fast charging algorithm is validated on a commercial large-format nickel cobalt manganese/graphite cell. The results showed that 96.8% of the battery capacity can be charged within 52 min. The post-mortem observation of the surface of the negative electrode and degradation tests revealed that the fast charging algorithm proposed here protected the battery from lithium deposition.

Fast and Rigorous Assignment Algorithm Multiple Preference and Calculation

Directory of Open Access Journals (Sweden)

Ümit Çiftçi

2010-03-01

Full Text Available The goal of paper is to develop an algorithm that evaluates students then places them depending on their desired choices according to dependant preferences. The developed algorithm is also used to implement software. The success and accuracy of the software as well as the algorithm are tested by applying it to ability test at Beykent University. This ability test is repeated several times in order to fill all available places at Fine Art Faculty departments in every academic year. It has been shown that this algorithm is very fast and rigorous after application of 2008-2009 and 2009-20010 academic years.Key Words: Assignment algorithm, student placement, ability test

Fast image matching algorithm based on projection characteristics

Science.gov (United States)

Zhou, Lijuan; Yue, Xiaobo; Zhou, Lijun

2011-06-01

Based on analyzing the traditional template matching algorithm, this paper identified the key factors restricting the speed of matching and put forward a brand new fast matching algorithm based on projection. Projecting the grayscale image, this algorithm converts the two-dimensional information of the image into one-dimensional one, and then matches and identifies through one-dimensional correlation, meanwhile, because of normalization has been done, when the image brightness or signal amplitude increasing in proportion, it could also perform correct matching. Experimental results show that the projection characteristics based image registration method proposed in this article could greatly improve the matching speed, which ensuring the matching accuracy as well.

Fast Algorithms for Fitting Active Appearance Models to Unconstrained Images

NARCIS (Netherlands)

Tzimiropoulos, Georgios; Pantic, Maja

2016-01-01

Fitting algorithms for Active Appearance Models (AAMs) are usually considered to be robust but slow or fast but less able to generalize well to unseen variations. In this paper, we look into AAM fitting algorithms and make the following orthogonal contributions: We present a simple “project-out‿

MATLAB tensor classes for fast algorithm prototyping.

Energy Technology Data Exchange (ETDEWEB)

Bader, Brett William; Kolda, Tamara Gibson (Sandia National Laboratories, Livermore, CA)

2004-10-01

Tensors (also known as mutidimensional arrays or N-way arrays) are used in a variety of applications ranging from chemometrics to psychometrics. We describe four MATLAB classes for tensor manipulations that can be used for fast algorithm prototyping. The tensor class extends the functionality of MATLAB's multidimensional arrays by supporting additional operations such as tensor multiplication. The tensor as matrix class supports the 'matricization' of a tensor, i.e., the conversion of a tensor to a matrix (and vice versa), a commonly used operation in many algorithms. Two additional classes represent tensors stored in decomposed formats: cp tensor and tucker tensor. We descibe all of these classes and then demonstrate their use by showing how to implement several tensor algorithms that have appeared in the literature.

Fast neutron flux and intracranial dose distribution at a neutron irradiation facility

International Nuclear Information System (INIS)

Matsumoto, Tetsuo; Aizawa, Otohiko; Nozaki, Tetsuya

1981-01-01

A head phantom filled with water was used to measure the fast neutron flux using 115 In(n, n')sup(115m)In and 103 Rh(n, n')sup(103m)Rh reactions. γ-ray from sup(115m)In and x-ray from sup(103m)Rh were detected by a Ge(Li) and a Na(Tl)I counter, respectively. TLD was used to investigate the γ-dose rate distribution inside the phantom. Flux of fast neutron inside the phantom was about 1 x 10 6 n/cm 2 sec, which was 3 order smaller than that of thermal neutron. The fast neutron flux decreased to 1/10 at 15 cm depth, and γ-dose rate was about 200 R/h at 100 kW inside the phantom. Total dose at the surface was 350 rad/h, to which, fast neutrons contributed more than γ-rays. The rate of fast neutron dose was about 10% of thermal neutron's in Kerma dose unit (rad), however, the rate was highly dependent on RBE value. (Nakanishi, T.)

Research on Precision Tracking on Fast Steering Mirror and Control Strategy

Science.gov (United States)

Di, Lin; Yi-ming, Wu; Fan, Zhu

2018-01-01

Fast steering mirror is a device used for controlling the beam direction precisely. Due to the short travel of the push-pull FSM, a compound fast steering mirror system driven by both limited-angle voice coil motor and push-pull FSM together is proposed. In the compound FSM system, limited-angle voice coil motor quickly swings at wide angle, while the push-pull FSM do high frequency movement in a small range, which provides the system with the high bandwidth and long travel. In the control strategy, the method of combining feed-forward control in Kalman filtering with auto-disturbance rejection control is used to improve trajectory tracking accuracy. The simulation result shows that tracking accuracy measured by the compound method can be improved by more than 5 times than that of the conventional PID.

An energy and direction independent fast neutron dosemeter based on electrochemically etched CR-39 nuclear track detectors

International Nuclear Information System (INIS)

James, K.; Matiullah; Durrani, S.A.

1987-01-01

A computer-based model is presented, which simulates the dose equivalent response of electrochemically etched CR-39 to fast neutrons of various energies and angles of incidence. Most previous calculations of the response of CR-39 have neglected the production of recoiling oxygen and carbon nuclei as well as α particles in the CR-39. We calculate that these 'heavy recoils' and α particles are the major source of electrochemically etchable tracks in bare CR-39 at neutron energies above approx. 2 MeV under typical etching conditions. Our calculations have been extended to predict the response of CR-39 used in conjunction with various combinations of polymeric front radiators and we have determined the radiator stack configuration with produces the most energy independent response. Again, the heavy recoils and α particles cannot be neglected and, for energies above approx. 2 MeV, these produce typically about 20% of the total response of our optimum stack. This type of fast neutron dosemeter is, however, strongly direction dependent. We have integrated the response over all appropriate angles to predict the dose equivalent response for two representative neutron fields, and we suggest a method for minimising the angular dependence. (author)

Patient-reported outcome after fast-track hip arthroplasty: a prospective cohort study

Directory of Open Access Journals (Sweden)

Hansen Torben B

2010-11-01

Full Text Available Abstract Background A fast-track intervention with a short preoperative optimization period and short postoperative hospitalization has a potential for reduced convalescence and thereby a reduced need for postoperative rehabilitation. The purpose of this study was to describe patient-related outcomes, the need for additional rehabilitation after a fast-track total hip arthroplasty (THA, and the association between generic and disease specific outcomes. Methods The study consisted of 196 consecutive patients of which none received additional rehabilitation beyond an instructional exercise plan at discharge, which was adjusted at one in-patient visit. The patients filled in 3 questionnaires to measure health-related quality-of-life (HRQOL and hip specific function (EQ-5 D, SF36, and Harris Hip Score (HHS at 2 time points pre- and 2 time points postoperatively. The observed results were compared to normative population data for EQ-5 D, SF36, and HHS. Results 3-months postoperatively patients had reached a HRQOL level of 0.84 (SD, 0.14, which was similar to the population norm (P = 0.33, whereas they exceeded the population norm at 12 months postoperatively (P P P = 0.35. For HHS, patients never reached the population norm within 12 months postoperatively. Generic and disease specific outcomes were strongly associated. Conclusions If HRQOL is considered the primary outcome after THA, the need for additional postoperative rehabilitation for all THA patients following a fast-track intervention is questionable. However, a pre- or early postoperative physical intervention seems relevant if the PF of the population norm should be reached at 3 months. If disease specific outcome is considered the primary outcome after fast-track THA, clear goals for the rehabilitation must be established before patient selection, intervention type and timing of intervention can be made.

FAST: A fully asynchronous and status-tracking pattern for geoprocessing services orchestration

Science.gov (United States)

Wu, Huayi; You, Lan; Gui, Zhipeng; Gao, Shuang; Li, Zhenqiang; Yu, Jingmin

2014-09-01

Geoprocessing service orchestration (GSO) provides a unified and flexible way to implement cross-application, long-lived, and multi-step geoprocessing service workflows by coordinating geoprocessing services collaboratively. Usually, geoprocessing services and geoprocessing service workflows are data and/or computing intensive. The intensity feature may make the execution process of a workflow time-consuming. Since it initials an execution request without blocking other interactions on the client side, an asynchronous mechanism is especially appropriate for GSO workflows. Many critical problems remain to be solved in existing asynchronous patterns for GSO including difficulties in improving performance, status tracking, and clarifying the workflow structure. These problems are a challenge when orchestrating performance efficiency, making statuses instantly available, and constructing clearly structured GSO workflows. A Fully Asynchronous and Status-Tracking (FAST) pattern that adopts asynchronous interactions throughout the whole communication tier of a workflow is proposed for GSO. The proposed FAST pattern includes a mechanism that actively pushes the latest status to clients instantly and economically. An independent proxy was designed to isolate the status tracking logic from the geoprocessing business logic, which assists the formation of a clear GSO workflow structure. A workflow was implemented in the FAST pattern to simulate the flooding process in the Poyang Lake region. Experimental results show that the proposed FAST pattern can efficiently tackle data/computing intensive geoprocessing tasks. The performance of all collaborative partners was improved due to the asynchronous mechanism throughout communication tier. A status-tracking mechanism helps users retrieve the latest running status of a GSO workflow in an efficient and instant way. The clear structure of the GSO workflow lowers the barriers for geospatial domain experts and model designers to

Measured and calculated absorptance of tracks of fast heavy ions in Ilford G5 nuclear emulsion

International Nuclear Information System (INIS)

Jensen, M.; Mathiesen, O.

1975-04-01

A modified form of the delta-ray theory of track formation developed by Katz and coworkers has been used to calculate the absorptance of tracks of fast heavy ions in Ilford G5 nuclear emulsion. The theoretical data have been compared with results of different photometrical investigations reported in the literature. In most cases the theoretical predictions are found to be in good agreement with experiments. This suggests that the theory can be used in the planning and execution of future experiments, i.e. to optimize the geometry of the photometer and to obtain an absolute charge calibration of the detector. It is shown that the basic photometrical properties of an emulsion stack can be described by a single quantity which can be determined from measurements. Knowing this quantity it is possible to predict the response of the emulsion stack for different types of photometers. The practical limits of the use of the modified theory at high and low levels of energy dose are discussed. (Auth.)

Measured and calculated absorptance of tracks of fast heavy ions in Ilford G5 nuclear emulsion

International Nuclear Information System (INIS)

Jensen, M.; Mathiesen, O.

1976-01-01

A modified form of the delta-ray theory of track formation developed by Katz and coworkers has been used to calculate the absorptance of tracks of fast heavy ions in Ilford G5 nuclear emulsion. The theoretical data have been compared with results of different photometrical investigations reported in the literature. In most cases the theoretical predictions are found to be in good agreement with experiments. This suggests that the theory can be used in the planning and execution of future experiments, i.e. to optimize the geometry of the photometer and to obtain an absolute charge calibration of the detector. It is shown that the basic photometrical properties of an emulsion stack can be described by a single quantity which can be determined from measurements. Knowing this quantity it is possible to predict the response of the detector system, for different types of photometers. The practical limits of the use of the modified theory at high and low levels of energy dose are discussed. (Auth.)

Analysis of Radiation Treatment Planning by Dose Calculation and Optimization Algorithm

Energy Technology Data Exchange (ETDEWEB)

Kim, Dae Sup; Yoon, In Ha; Lee, Woo Seok; Baek, Geum Mun [Dept. of Radiation Oncology, Asan Medical Center, Seoul (Korea, Republic of)

2012-09-15

Analyze the Effectiveness of Radiation Treatment Planning by dose calculation and optimization algorithm, apply consideration of actual treatment planning, and then suggest the best way to treatment planning protocol. The treatment planning system use Eclipse 10.0. (Varian, USA). PBC (Pencil Beam Convolution) and AAA (Anisotropic Analytical Algorithm) Apply to Dose calculation, DVO (Dose Volume Optimizer 10.0.28) used for optimized algorithm of Intensity Modulated Radiation Therapy (IMRT), PRO II (Progressive Resolution Optimizer V 8.9.17) and PRO III (Progressive Resolution Optimizer V 10.0.28) used for optimized algorithm of VAMT. A phantom for experiment virtually created at treatment planning system, 30x30x30 cm sized, homogeneous density (HU: 0) and heterogeneous density that inserted air assumed material (HU: -1,000). Apply to clinical treatment planning on the basis of general treatment planning feature analyzed with Phantom planning. In homogeneous density phantom, PBC and AAA show 65.2% PDD (6 MV, 10 cm) both, In heterogeneous density phantom, also show similar PDD value before meet with low density material, but they show different dose curve in air territory, PDD 10 cm showed 75%, 73% each after penetrate phantom. 3D treatment plan in same MU, AAA treatment planning shows low dose at Lung included area. 2D POP treatment plan with 15 MV of cervical vertebral region include trachea and lung area, Conformity Index (ICRU 62) is 0.95 in PBC calculation and 0.93 in AAA. DVO DVH and Dose calculation DVH are showed equal value in IMRT treatment plan. But AAA calculation shows lack of dose compared with DVO result which is satisfactory condition. Optimizing VMAT treatment plans using PRO II obtained results were satisfactory, but lower density area showed lack of dose in dose calculations. PRO III, but optimizing the dose calculation results were similar with optimized the same conditions once more. In this study, do not judge the rightness of the dose

Analysis of Radiation Treatment Planning by Dose Calculation and Optimization Algorithm

International Nuclear Information System (INIS)

Kim, Dae Sup; Yoon, In Ha; Lee, Woo Seok; Baek, Geum Mun

2012-01-01

Analyze the Effectiveness of Radiation Treatment Planning by dose calculation and optimization algorithm, apply consideration of actual treatment planning, and then suggest the best way to treatment planning protocol. The treatment planning system use Eclipse 10.0. (Varian, USA). PBC (Pencil Beam Convolution) and AAA (Anisotropic Analytical Algorithm) Apply to Dose calculation, DVO (Dose Volume Optimizer 10.0.28) used for optimized algorithm of Intensity Modulated Radiation Therapy (IMRT), PRO II (Progressive Resolution Optimizer V 8.9.17) and PRO III (Progressive Resolution Optimizer V 10.0.28) used for optimized algorithm of VAMT. A phantom for experiment virtually created at treatment planning system, 30x30x30 cm sized, homogeneous density (HU: 0) and heterogeneous density that inserted air assumed material (HU: -1,000). Apply to clinical treatment planning on the basis of general treatment planning feature analyzed with Phantom planning. In homogeneous density phantom, PBC and AAA show 65.2% PDD (6 MV, 10 cm) both, In heterogeneous density phantom, also show similar PDD value before meet with low density material, but they show different dose curve in air territory, PDD 10 cm showed 75%, 73% each after penetrate phantom. 3D treatment plan in same MU, AAA treatment planning shows low dose at Lung included area. 2D POP treatment plan with 15 MV of cervical vertebral region include trachea and lung area, Conformity Index (ICRU 62) is 0.95 in PBC calculation and 0.93 in AAA. DVO DVH and Dose calculation DVH are showed equal value in IMRT treatment plan. But AAA calculation shows lack of dose compared with DVO result which is satisfactory condition. Optimizing VMAT treatment plans using PRO II obtained results were satisfactory, but lower density area showed lack of dose in dose calculations. PRO III, but optimizing the dose calculation results were similar with optimized the same conditions once more. In this study, do not judge the rightness of the dose

An automated dose tracking system for adaptive radiation therapy.

Science.gov (United States)

Liu, Chang; Kim, Jinkoo; Kumarasiri, Akila; Mayyas, Essa; Brown, Stephen L; Wen, Ning; Siddiqui, Farzan; Chetty, Indrin J

2018-02-01

The implementation of adaptive radiation therapy (ART) into routine clinical practice is technically challenging and requires significant resources to perform and validate each process step. The objective of this report is to identify the key components of ART, to illustrate how a specific automated procedure improves efficiency, and to facilitate the routine clinical application of ART. Data was used from patient images, exported from a clinical database and converted to an intermediate format for point-wise dose tracking and accumulation. The process was automated using in-house developed software containing three modularized components: an ART engine, user interactive tools, and integration tools. The ART engine conducts computing tasks using the following modules: data importing, image pre-processing, dose mapping, dose accumulation, and reporting. In addition, custom graphical user interfaces (GUIs) were developed to allow user interaction with select processes such as deformable image registration (DIR). A commercial scripting application programming interface was used to incorporate automated dose calculation for application in routine treatment planning. Each module was considered an independent program, written in C++or C#, running in a distributed Windows environment, scheduled and monitored by integration tools. The automated tracking system was retrospectively evaluated for 20 patients with prostate cancer and 96 patients with head and neck cancer, under institutional review board (IRB) approval. In addition, the system was evaluated prospectively using 4 patients with head and neck cancer. Altogether 780 prostate dose fractions and 2586 head and neck cancer dose fractions went processed, including DIR and dose mapping. On average, daily cumulative dose was computed in 3 h and the manual work was limited to 13 min per case with approximately 10% of cases requiring an additional 10 min for image registration refinement. An efficient and convenient

Fast, Distributed Algorithms in Deep Networks

Science.gov (United States)

2016-05-11

shallow networks, additional work will need to be done in order to allow for the application of ADMM to deep nets. The ADMM method allows for quick...Quock V Le, et al. Large scale distributed deep networks. In Advances in Neural Information Processing Systems, pages 1223–1231, 2012. [11] Ken-Ichi...A TRIDENT SCHOLAR PROJECT REPORT NO. 446 Fast, Distributed Algorithms in Deep Networks by Midshipman 1/C Ryan J. Burmeister, USN

An independent dose calculation algorithm for MLC-based stereotactic radiotherapy

International Nuclear Information System (INIS)

Lorenz, Friedlieb; Killoran, Joseph H.; Wenz, Frederik; Zygmanski, Piotr

2007-01-01

We have developed an algorithm to calculate dose in a homogeneous phantom for radiotherapy fields defined by multi-leaf collimator (MLC) for both static and dynamic MLC delivery. The algorithm was developed to supplement the dose algorithms of the commercial treatment planning systems (TPS). The motivation for this work is to provide an independent dose calculation primarily for quality assurance (QA) and secondarily for the development of static MLC field based inverse planning. The dose calculation utilizes a pencil-beam kernel. However, an explicit analytical integration results in a closed form for rectangular-shaped beamlets, defined by single leaf pairs. This approach reduces spatial integration to summation, and leads to a simple method of determination of model parameters. The total dose for any static or dynamic MLC field is obtained by summing over all individual rectangles from each segment which offers faster speed to calculate two-dimensional dose distributions at any depth in the phantom. Standard beam data used in the commissioning of the TPS was used as input data for the algorithm. The calculated results were compared with the TPS and measurements for static and dynamic MLC. The agreement was very good (<2.5%) for all tested cases except for very small static MLC sizes of 0.6 cmx0.6 cm (<6%) and some ion chamber measurements in a high gradient region (<4.4%). This finding enables us to use the algorithm for routine QA as well as for research developments

Multirobot FastSLAM Algorithm Based on Landmark Consistency Correction

Directory of Open Access Journals (Sweden)

Shi-Ming Chen

2014-01-01

Full Text Available Considering the influence of uncertain map information on multirobot SLAM problem, a multirobot FastSLAM algorithm based on landmark consistency correction is proposed. Firstly, electromagnetism-like mechanism is introduced to the resampling procedure in single-robot FastSLAM, where we assume that each sampling particle is looked at as a charged electron and attraction-repulsion mechanism in electromagnetism field is used to simulate interactive force between the particles to improve the distribution of particles. Secondly, when multiple robots observe the same landmarks, every robot is regarded as one node and Kalman-Consensus Filter is proposed to update landmark information, which further improves the accuracy of localization and mapping. Finally, the simulation results show that the algorithm is suitable and effective.

Perioperative strategy in colonic surgery; LAparoscopy and/or FAst track multimodal management versus standard care (LAFA trial

Directory of Open Access Journals (Sweden)

Swart Annemiek

2006-11-01

Full Text Available Abstract Background Recent developments in large bowel surgery are the introduction of laparoscopic surgery and the implementation of multimodal fast track recovery programs. Both focus on a faster recovery and shorter hospital stay. The randomized controlled multicenter LAFA-trial (LAparoscopy and/or FAst track multimodal management versus standard care was conceived to determine whether laparoscopic surgery, fast track perioperative care or a combination of both is to be preferred over open surgery with standard care in patients having segmental colectomy for malignant disease. Methods/design The LAFA-trial is a double blinded, multicenter trial with a 2 × 2 balanced factorial design. Patients eligible for segmental colectomy for malignant colorectal disease i.e. right and left colectomy and anterior resection will be randomized to either open or laparoscopic colectomy, and to either standard care or the fast track program. This factorial design produces four treatment groups; open colectomy with standard care (a, open colectomy with fast track program (b, laparoscopic colectomy with standard care (c, and laparoscopic surgery with fast track program (d. Primary outcome parameter is postoperative hospital length of stay including readmission within 30 days. Secondary outcome parameters are quality of life two and four weeks after surgery, overall hospital costs, morbidity, patient satisfaction and readmission rate. Based on a mean postoperative hospital stay of 9 +/- 2.5 days a group size of 400 patients (100 each arm can reliably detect a minimum difference of 1 day between the four arms (alfa = 0.95, beta = 0.8. With 100 patients in each arm a difference of 10% in subscales of the Short Form 36 (SF-36 questionnaire and social functioning can be detected. Discussion The LAFA-trial is a randomized controlled multicenter trial that will provide evidence on the merits of fast track perioperative care and laparoscopic colorectal surgery in

Fast neutron irradiation effects on CR-39 nuclear track detector for dosimetric applications

International Nuclear Information System (INIS)

Kader, M.H.

2005-01-01

The effect of neutron irradiation on the dosimetric properties of CR-39 solid-state nuclear track detector have been investigated. CR-39 samples were irradiated with neutrons of energies follow a Maxwellian distribution centered about 2 MeV. These samples were irradiated with different doses in the range 0.1-1 Sv. The background and track density were measured as a function of etching time. In addition, the dependence of sensitivity of CR-39 detector on the neutrons dose has been investigated. The results show that the Sensitivity started to increase at 0.4 Sv neutrons dose, so this sample were chosen to be a subject for further study to investigate the effect of gamma dose on its properties. The sample irradiated with 0.4 Sv were exposed to different doses of gamma rays at levels between 10 and 80 kGy. The effect of gamma doses on the bulk etching rate VB, the track diameter and the sensitivity of the CR-39 samples was investigated. The results show that the dosimetric properties of CR-39 SSNTD are greatly affected by both neutron and gamma irradiation

An improved VSS NLMS algorithm for active noise cancellation

Science.gov (United States)

Sun, Yunzhuo; Wang, Mingjiang; Han, Yufei; Zhang, Congyan

2017-08-01

In this paper, an improved variable step size NLMS algorithm is proposed. NLMS has fast convergence rate and low steady state error compared to other traditional adaptive filtering algorithm. But there is a contradiction between the convergence speed and steady state error that affect the performance of the NLMS algorithm. Now, we propose a new variable step size NLMS algorithm. It dynamically changes the step size according to current error and iteration times. The proposed algorithm has simple formulation and easily setting parameters, and effectively solves the contradiction in NLMS. The simulation results show that the proposed algorithm has a good tracking ability, fast convergence rate and low steady state error simultaneously.

A Fast Elitism Gaussian Estimation of Distribution Algorithm and Application for PID Optimization

Directory of Open Access Journals (Sweden)

Qingyang Xu

2014-01-01

Full Text Available Estimation of distribution algorithm (EDA is an intelligent optimization algorithm based on the probability statistics theory. A fast elitism Gaussian estimation of distribution algorithm (FEGEDA is proposed in this paper. The Gaussian probability model is used to model the solution distribution. The parameters of Gaussian come from the statistical information of the best individuals by fast learning rule. A fast learning rule is used to enhance the efficiency of the algorithm, and an elitism strategy is used to maintain the convergent performance. The performances of the algorithm are examined based upon several benchmarks. In the simulations, a one-dimensional benchmark is used to visualize the optimization process and probability model learning process during the evolution, and several two-dimensional and higher dimensional benchmarks are used to testify the performance of FEGEDA. The experimental results indicate the capability of FEGEDA, especially in the higher dimensional problems, and the FEGEDA exhibits a better performance than some other algorithms and EDAs. Finally, FEGEDA is used in PID controller optimization of PMSM and compared with the classical-PID and GA.

A fast elitism Gaussian estimation of distribution algorithm and application for PID optimization.

Science.gov (United States)

Xu, Qingyang; Zhang, Chengjin; Zhang, Li

2014-01-01

Estimation of distribution algorithm (EDA) is an intelligent optimization algorithm based on the probability statistics theory. A fast elitism Gaussian estimation of distribution algorithm (FEGEDA) is proposed in this paper. The Gaussian probability model is used to model the solution distribution. The parameters of Gaussian come from the statistical information of the best individuals by fast learning rule. A fast learning rule is used to enhance the efficiency of the algorithm, and an elitism strategy is used to maintain the convergent performance. The performances of the algorithm are examined based upon several benchmarks. In the simulations, a one-dimensional benchmark is used to visualize the optimization process and probability model learning process during the evolution, and several two-dimensional and higher dimensional benchmarks are used to testify the performance of FEGEDA. The experimental results indicate the capability of FEGEDA, especially in the higher dimensional problems, and the FEGEDA exhibits a better performance than some other algorithms and EDAs. Finally, FEGEDA is used in PID controller optimization of PMSM and compared with the classical-PID and GA.

Lightning Jump Algorithm and Relation to Thunderstorm Cell Tracking, GLM Proxy and Other Meteorological Measurements

Science.gov (United States)

Schultz, Christopher J.; Carey, Lawrence D.; Cecil, Daniel J.; Bateman, Monte

2012-01-01

The lightning jump algorithm has a robust history in correlating upward trends in lightning to severe and hazardous weather occurrence. The algorithm uses the correlation between the physical principles that govern an updraft's ability to produce microphysical and kinematic conditions conducive for electrification and its role in the development of severe weather conditions. Recent work has demonstrated that the lightning jump algorithm concept holds significant promise in the operational realm, aiding in the identification of thunderstorms that have potential to produce severe or hazardous weather. However, a large amount of work still needs to be completed in spite of these positive results. The total lightning jump algorithm is not a stand-alone concept that can be used independent of other meteorological measurements, parameters, and techniques. For example, the algorithm is highly dependent upon thunderstorm tracking to build lightning histories on convective cells. Current tracking methods show that thunderstorm cell tracking is most reliable and cell histories are most accurate when radar information is incorporated with lightning data. In the absence of radar data, the cell tracking is a bit less reliable but the value added by the lightning information is much greater. For optimal application, the algorithm should be integrated with other measurements that assess storm scale properties (e.g., satellite, radar). Therefore, the recent focus of this research effort has been assessing the lightning jump's relation to thunderstorm tracking, meteorological parameters, and its potential uses in operational meteorology. Furthermore, the algorithm must be tailored for the optically-based GOES-R Geostationary Lightning Mapper (GLM), as what has been observed using Very High Frequency Lightning Mapping Array (VHF LMA) measurements will not exactly translate to what will be observed by GLM due to resolution and other instrument differences. Herein, we present some of

Blind Extraction of Chaotic Signals by Using the Fast Independent Component Analysis Algorithm

International Nuclear Information System (INIS)

Hong-Bin, Chen; Jiu-Chao, Feng; Yong, Fang

2008-01-01

We report the results of using the fast independent component analysis (FastICA) algorithm to realize blind extraction of chaotic signals. Two cases are taken into consideration: namely, the mixture is noiseless or contaminated by noise. Pre-whitening is employed to reduce the effect of noise before using the FastICA algorithm. The correlation coefficient criterion is adopted to evaluate the performance, and the success rate is defined as a new criterion to indicate the performance with respect to noise or different mixing matrices. Simulation results show that the FastICA algorithm can extract the chaotic signals effectively. The impact of noise, the length of a signal frame, the number of sources and the number of observed mixtures on the performance is investigated in detail. It is also shown that regarding a noise as an independent source is not always correct

Avoiding ICU Admission by Using a Fast-Track Protocol Is Safe in Selected Adult-to-Adult Live Donor Liver Transplant Recipients

Directory of Open Access Journals (Sweden)

Juan Echeverri, MD

2017-10-01

Full Text Available Background. We evaluated patient characteristics of live donor liver transplant (LDLT recipients undergoing a fast-track protocol without intensive care unit (ICU admission versus LDLT patients receiving posttransplant ICU care. Methods. Of the 153 LDLT recipients, 46 patients were included in our fast-track protocol without ICU admission. Both, fast-tracked patients and ICU-admitted patients were compared regarding donor and patient characteristics, perioperative characteristics, and postoperative outcomes and complications. In a subgroup analysis, we compared fast-tracked patients with patients who were admitted in the ICU for less than 24 hours. Results. Fast-tracked versus ICU patients had a lower model for end-stage liver disease score (13 ± 4 vs 18 ± 7; P < 0.0001, lower preoperative bilirubin levels (51 ± 50 μmol/L vs 119.4 ± 137.3 μmol/L; P < 0.001, required fewer units of packed red blood cells (1.7 ± 1.78 vs 4.4 ± 4; P < 0.0001, and less fresh-frozen plasma (2.7 ± 2 vs 5.8 ± 5; P < 0.0001 during transplantation. Regarding postoperative outcomes, fast-tracked patients presented fewer bacterial infections within 30 days (6.5% [3] vs 29% [28]; P = 0.002, no episodes of pneumonia (0% vs 11.3% [11]; P = 0.02, and less biliary complications within the first year (6% [3] vs 26% [25]; P = 0.001. Also, fast-tracked patients had a shorter posttransplant hospital stay (10.8 ± 5 vs 21.3 ± 29; P = 0.002. In the subgroup analysis, fast-tracked vs ICU patients admitted for less than 24 hours had lower requirements of packed red blood cells (1.7 ± 1.78 vs 3.9 ± 4; P = 0.001 and fresh-frozen plasma (2.7 ± 2 vs 5.8 ± 4.5; P = 0.0001. Conclusions. Fast-track of selected patients after LDLT is safe and feasible. An objective score to perioperatively select LDLT recipients amenable to fast track is yet to be determined.

Evaluation of Real-Time Hand Motion Tracking Using a Range Camera and the Mean-Shift Algorithm

Science.gov (United States)

Lahamy, H.; Lichti, D.

2011-09-01

Several sensors have been tested for improving the interaction between humans and machines including traditional web cameras, special gloves, haptic devices, cameras providing stereo pairs of images and range cameras. Meanwhile, several methods are described in the literature for tracking hand motion: the Kalman filter, the mean-shift algorithm and the condensation algorithm. In this research, the combination of a range camera and the simple version of the mean-shift algorithm has been evaluated for its capability for hand motion tracking. The evaluation was assessed in terms of position accuracy of the tracking trajectory in x, y and z directions in the camera space and the time difference between image acquisition and image display. Three parameters have been analyzed regarding their influence on the tracking process: the speed of the hand movement, the distance between the camera and the hand and finally the integration time of the camera. Prior to the evaluation, the required warm-up time of the camera has been measured. This study has demonstrated the suitability of the range camera used in combination with the mean-shift algorithm for real-time hand motion tracking but for very high speed hand movement in the traverse plane with respect to the camera, the tracking accuracy is low and requires improvement.

Tracking algorithms for multi-hexagonal assemblies (2D and 3D)

International Nuclear Information System (INIS)

Prabha, Hem; Marleau, Guy; Hébert, Alain

2014-01-01

Highlights: • We present the method of computations of 2D and 3D fluxes in hexagonal assemblies. • Computation of fluxes requires computation of track lengths. • Equations are developed (in 2D and 3D) and are implemented in a program HX7. • The program HX7 is implemented in the NXT module of the code DRAGON. • The tracks are plotted and fluxes are compared with the EXCELT module of DRAGON. - Abstract: Background: There has been a continuous effort to design new reactors and study these reactors under different conditions. Some of these reactors have fuel pins arranged in hexagonal pitch. To study these reactors, development of computational methods and computer codes is required. For this purpose, we have developed algorithms to track two dimensional and three dimensional cluster geometries. These algorithms have been implemented in a subprogram HX7, that is implemented in the code DRAGON (Version 3.06F) to compute neutron flux distributions in these systems. Methods: Computation of the neutron flux distribution requires solution of neutron transport equation. While solving this equation, by using Carlvik’s method of collision probabilities, computation of tracks in the hexagonal geometries is required. In this paper we present equations that we have developed for the computation of tracks in two dimensional (2D) and three dimensional (3D) multi-hexagonal assemblies (with two rotational orientations). These equations have been implemented in a subprogram HX7, to compute tracks in seven hexagonal assemblies. The subprogram HX7 has been implemented in the NXT module of the DRAGON code, where tracks in the pins are computed. Results: The results of our algorithms NXT(+HX7) have been compared with the results obtained by the EXCELT module of DRAGON (Version 3.06F). Conclusions: We find that all the fluxes in 2D and fluxes in the outer pin (3D) are converging to their 3rd decimal places, in both the modules EXCELT and NXT(+HX7). For other regions 3D fluxes

Application of Genetic Algorithm to the Design Optimization of Complex Energy Saving Glass Coating Structure

Science.gov (United States)

Johar, F. M.; Azmin, F. A.; Shibghatullah, A. S.; Suaidi, M. K.; Ahmad, B. H.; Abd Aziz, M. Z. A.; Salleh, S. N.; Shukor, M. Md

2014-04-01

Attenuation of GSM, GPS and personal communication signal leads to poor communication inside the building using regular shapes of energy saving glass coating. Thus, the transmission is very low. A brand new type of band pass frequency selective surface (FSS) for energy saving glass application is presented in this paper for one unit cell. Numerical Periodic Method of Moment approach according to a previous study has been applied to determine the new optimum design of one unit cell energy saving glass coating structure. Optimization technique based on the Genetic Algorithm (GA) is used to obtain an improved in return loss and transmission signal. The unit cell of FSS is designed and simulated using the CST Microwave Studio software at based on industrial, scientific and medical bands (ISM). A unique and irregular shape of an energy saving glass coating structure is obtained with lower return loss and improved transmission coefficient.

Application of genetic algorithm to the design optimization of complex energy saving glass coating structure

International Nuclear Information System (INIS)

Johar, F M; Azmin, F A; Suaidi, M K; Ahmad, B H; Aziz, M Z A Abd; Salleh, S N; Shukor, M Md; Shibghatullah, A S

2014-01-01

Attenuation of GSM, GPS and personal communication signal leads to poor communication inside the building using regular shapes of energy saving glass coating. Thus, the transmission is very low. A brand new type of band pass frequency selective surface (FSS) for energy saving glass application is presented in this paper for one unit cell. Numerical Periodic Method of Moment approach according to a previous study has been applied to determine the new optimum design of one unit cell energy saving glass coating structure. Optimization technique based on the Genetic Algorithm (GA) is used to obtain an improved in return loss and transmission signal. The unit cell of FSS is designed and simulated using the CST Microwave Studio software at based on industrial, scientific and medical bands (ISM). A unique and irregular shape of an energy saving glass coating structure is obtained with lower return loss and improved transmission coefficient.