WorldWideScience

Sample records for facing full schedule

  1. Analysis of full-duplex relay networks with opportunistic scheduling

    Directory of Open Access Journals (Sweden)

    Lei Shao

    2015-05-01

    Full Text Available This Letter addresses a two-hop decode-and-forward relay system with full-duplex relaying and opportunistic scheduling. Exact expressions for outage probability, average capacity and symbol error rate are presented in an independent identically distributed Rayleigh fading environment. Numerical and simulated results show the validity of the analytical results.

  2. Robust Aircraft Squadron Scheduling in the Face of Absenteeism

    Science.gov (United States)

    2008-03-01

    shows that not much research has been done in this area. Moz and Pato expressed the need for arranging a robust schedule more specifically so that...minimize shift changes with regard to the current one. (Moz& Pato , 2004: 668) While Moz& Pato don’t address robust schedules, the problem they mention...Computers and Operations Research, 32(6), 1451-1476. (2005) (20) Moz, M., & Pato , M. V. “Solving the problem of rerostering nurse schedules with hard

  3. Full-face excavation of large tunnels in difficult conditions

    Directory of Open Access Journals (Sweden)

    Giovanni Barla

    2016-06-01

    Full Text Available Following a few preliminary remarks on the tunneling methods at the beginning of the 20th century, the successful applications of the full-face method also in difficult conditions are underlined. The attention is posed on the use of a systematic reinforcement of the face and of the ground, by means of fiber-glass elements. A selection of tunnels where this method was used successfully is reported with the purpose of illustrating the wide spectrum of ground conditions where it has been applied. Then, following a description of the main concepts behind the method, the attention moves from the so-called “heavy method”, where deformations are restrained, to the “light method”, where deformations are allowed with the intention to decrease the stresses acting on the primary and final linings. The progress in the application of the “light method” is underlined, up to the development of a novel technique, which relies on the use of a yielding support composed of top head steel sets with sliding joints and special deformable elements inserted in the primary lining. The well-known case study of the Saint Martin La Porte access adit, along the Lyon-Turin Base Tunnel, is described. In this tunnel, a yield-control support system combined with full-face excavation has been adopted successfully in order to cope with the large deformations experienced during face advance through the Carboniferous formation. The monitoring results obtained during excavation are illustrated, together with the modeling studies performed when paying attention to the rock mass time-dependent behavior.

  4. Full-face excavation of large tunnels in difficult conditions

    Institute of Scientific and Technical Information of China (English)

    Giovanni Barla

    2016-01-01

    Following a few preliminary remarks on the tunneling methods at the beginning of the 20th century, the successful applications of the full-face method also in difficult conditions are underlined. The attention is posed on the use of a systematic reinforcement of the face and of the ground, by means of fiber-glass elements. A selection of tunnels where this method was used successfully is reported with the pur-pose of illustrating the wide spectrum of ground conditions where it has been applied. Then, following a description of the main concepts behind the method, the attention moves from the so-called “heavy method”, where deformations are restrained, to the “light method”, where deformations are allowed with the intention to decrease the stresses acting on the primary and final linings. The progress in the application of the“light method”is underlined, up to the development of a novel technique, which relies on the use of a yielding support composed of top head steel sets with sliding joints and special deformable elements inserted in the primary lining. The well-known case study of the Saint Martin La Porte access adit, along the Lyon-Turin Base Tunnel, is described. In this tunnel, a yield-control support system combined with full-face excavation has been adopted successfully in order to cope with the large deformations experienced during face advance through the Carboniferous formation. The monitoring results obtained during excavation are illustrated, together with the modeling studies performed when paying attention to the rock mass time-dependent behavior.

  5. 77 FR 12326 - Tapered Roller Bearings From China; Scheduling of a Full Five-Year Review

    Science.gov (United States)

    2012-02-29

    ... From the Federal Register Online via the Government Publishing Office INTERNATIONAL TRADE COMMISSION Tapered Roller Bearings From China; Scheduling of a Full Five- Year Review AGENCY: United States... responses to its notice of institution of the subject five-year review were such that a full review pursuant...

  6. 78 FR 13380 - Silicomanganese From India, Kazakhstan, and Venezuela; Scheduling of Full Five-Year Reviews...

    Science.gov (United States)

    2013-02-27

    ... COMMISSION Silicomanganese From India, Kazakhstan, and Venezuela; Scheduling of Full Five-Year Reviews Concerning the Antidumping Duty Orders on Silicomanganese From India, Kazakhstan, and Venezuela AGENCY... from India, Kazakhstan, and Venezuela would be likely to lead to continuation or recurrence of...

  7. 77 FR 16859 - Tapered Roller Bearings From China; Scheduling of a Full Five-Year Review

    Science.gov (United States)

    2012-03-22

    ... From the Federal Register Online via the Government Publishing Office INTERNATIONAL TRADE COMMISSION Tapered Roller Bearings From China; Scheduling of a Full Five- Year Review AGENCY: United States... Commission determined that responses to its notice of institution of the subject five-year review were such...

  8. Full Glowworm Swarm Optimization Algorithm for Whole-Set Orders Scheduling in Single Machine

    Directory of Open Access Journals (Sweden)

    Zhang Yu

    2013-01-01

    Full Text Available By analyzing the characteristics of whole-set orders problem and combining the theory of glowworm swarm optimization, a new glowworm swarm optimization algorithm for scheduling is proposed. A new hybrid-encoding schema combining with two-dimensional encoding and random-key encoding is given. In order to enhance the capability of optimal searching and speed up the convergence rate, the dynamical changed step strategy is integrated into this algorithm. Furthermore, experimental results prove its feasibility and efficiency.

  9. A comparison between preterm and full-term infants' preference for faces.

    Science.gov (United States)

    Pereira, Silvana A; Pereira Junior, Antônio; Costa, Marcelo F da; Monteiro, Margareth de V; Almeida, Valéria A de; Fonseca Filho, Gentil G da; Arrais, Nívia; Simion, Francesca

    Visual preference for faces at birth is the product of a multimodal sensory experience experienced by the fetus even during the gestational period. The ability to recognize faces allows an ecologically advantageous interaction with the social environment. However, perinatal events such as premature birth, may adversely affect the adequate development of this capacity. In this study, we evaluated the preference for facial stimuli in preterm infants within the first few hours after birth. This is a cross-sectional observational study of 59 newborns, 28 preterm and 31 full-term infants. The babies were assessed in the first hours of life, with two white boards in the shape of a head and neck: one with the drawing of a face similar to the human face (natural face), and one with the drawing of misaligned eyes, mouth and nose (distorted face). After the newborn fixated the eyes on the presented stimulus, it was slowly moved along the visual field. The recognition of the stimulus was considered present when the baby had eye or head movements toward the stimulus. The preterm infants, in addition to showing a lower occurrence of orientation movements for both stimuli, on average (1.8±1.1 to natural faces and 2.0±1.2 for distorted ones) also showed no preference for any of them (p=0.35). Full-term newborns showed a different behavior, in which they showed a preference for natural faces (p=0.002) and a higher number of orientations for the stimulus, for both natural (3.2±0.8) and distorted faces (2.5±0.9). Preterm newborns recognize facial stimuli and disclose no preference for natural faces, different from full-term newborns. Copyright © 2016 Sociedade Brasileira de Pediatria. Published by Elsevier Editora Ltda. All rights reserved.

  10. Comparison between full face and hemifacial CBCT cephalograms in clinically symmetrical patients: a pilot study

    Directory of Open Access Journals (Sweden)

    Cintia Helena Zingaretti Junqueira

    2015-04-01

    Full Text Available INTRODUCTION: One of the advantages of cone-beam computed tomography (CBCT is the possibility of obtaining images of conventional lateral cephalograms derived from partial or complete reconstruction of facial images. OBJECTIVE: This study aimed at comparing full face, right and left hemifacial CBCT cephalograms of orthodontic patients without clinical facial asymmetry. METHODS: The sample comprised nine clinically symmetrical patients who had pretreament full face CBCT. The CBCTs were reconstructed so as to obtain full face, right and left hemifacial cephalograms. Two observers, at two different times, obtained linear and angular measurements for the images using Dolphin 3D software. Dependent and independent t-tests were used to assess the reproducibility of measurements. Analysis of Variance and Kruskal-Wallis tests were used to compare the variables obtained in the CBCT derived cephalometric views. RESULTS: There was good reproducibility for CBCT scans and no statistically significant differences between measurements of full face, right and left hemifacial CBCT scans. CONCLUSIONS: Cephalometric measurements in full face, right and left hemifacial CBCT scans in clinically symmetrical patients are similar.

  11. Comparison between full face and hemifacial CBCT cephalograms in clinically symmetrical patients: a pilot study.

    Science.gov (United States)

    Junqueira, Cintia Helena Zingaretti; Janson, Guilherme; Junqueira, Marisa Helena Zingaretti; Mendes, Lucas Marzullo; Favilla, Eduardo Esberard; Garib, Daniela Gamba

    2015-01-01

    One of the advantages of cone-beam computed tomography (CBCT) is the possibility of obtaining images of conventional lateral cephalograms derived from partial or complete reconstruction of facial images. This study aimed at comparing full face, right and left hemifacial CBCT cephalograms of orthodontic patients without clinical facial asymmetry. The sample comprised nine clinically symmetrical patients who had pretreatment full face CBCT. The CBCTs were reconstructed so as to obtain full face, right and left hemifacial cephalograms. Two observers, at two different times, obtained linear and angular measurements for the images using Dolphin 3D software. Dependent and independent t-tests were used to assess the reproducibility of measurements. Analysis of Variance and Kruskal-Wallis tests were used to compare the variables obtained in the CBCT derived cephalometric views. There was good reproducibility for CBCT scans and no statistically significant differences between measurements of full face, right and left hemifacial CBCT scans. Cephalometric measurements in full face, right and left hemifacial CBCT scans in clinically symmetrical patients are similar.

  12. Application of Approximation Full-Load Distribution Method to Pass Scheduling on Plate Mill With Hydro-Bending System

    Institute of Scientific and Technical Information of China (English)

    HU Xian-lei; ZHANG Qi-sheng; ZHAO Zhong; TIAN Yong; LIU Xiang-hua; WANG Guo-dong

    2006-01-01

    The influence of positive bending system on plate crown control was researched. The approximation full-load distribution method for pass scheduling was put forward. This method can not only make full use of the mill capacity with decreased pass number, but also give quality product of excellent flatness.

  13. 77 FR 38825 - Clad Steel Plate From Japan; Scheduling of a Full Five-Year Review Concerning the Antidumping...

    Science.gov (United States)

    2012-06-29

    ... were such that a full review pursuant to section 751(c)(5) of the Act should proceed (77 FR 37439, June... COMMISSION Clad Steel Plate From Japan; Scheduling of a Full Five-Year Review Concerning the Antidumping Duty Order on Clad Steel Plate From Japan AGENCY: United States International Trade Commission....

  14. 77 FR 6582 - Ferrovanadium and Nitrided Vanadium From Russia; Scheduling of a Full Five-Year Review

    Science.gov (United States)

    2012-02-08

    ... From the Federal Register Online via the Government Publishing Office INTERNATIONAL TRADE COMMISSION Ferrovanadium and Nitrided Vanadium From Russia; Scheduling of a Full Five-Year Review AGENCY... determined that responses to its notice of institution of the subject five-year review were such that a full...

  15. Application of Fuzzy-PID Control System in Full-Mechanized Coal Face

    Institute of Scientific and Technical Information of China (English)

    LU Kui; TANG Pei-rong; YANG Wei-min

    2005-01-01

    The control system, which includes structure, the composition of software and hardware, the form of PID control system and its systematic closed-loop, was used in No.4236 full-mechanized coal face of Xinlongzhuang mine.The typical fuzzy PID control system structure was investigated, and a simplified fuzzy PID control system was taken the place of the complex three-dimension fuzzy controller. Based on the parameter relation between fuzzy controller and normal PID controller, a common method of parameter adjustment of PID controller was summed up and the computer simulation was realized. This system can overcome the problems of large delay, nonlinear, poor running environment and great load change in the full-mechanized coal face. The simulating investigation indicates that the designing method of fuzzy controller is simple and feasible.

  16. En-face full-field optical coherence tomography for fast and efficient fingerprints acquisition

    Science.gov (United States)

    Harms, Fabrice; Dalimier, Eugénie; Boccara, A. Claude

    2014-05-01

    Optical coherence tomography (OCT) has been recently proposed by a number of laboratories as a promising tool for fingerprints acquisitions and for fakes discrimination. Indeed OCT being a non-contact, non-destructive optical method that virtually sections the volume of biological tissues that strongly scatter light it appears obvious to use it for fingerprints. Nevertheless most of the OCT setups have to go through the long acquisition of a full 3D image to isolate an "en-face" image suitable for fingerprint analysis. A few "en-face" OCT approaches have been proposed that use either a complex 2D scanning setup and image processing, or a full-field illumination using a camera and a spatially coherent source that induces crosstalks and degrades the image quality. We show here that Full Field OCT (FFOCT) using a spatially incoherent source is able to provide "en-face" high quality optical sectioning of the fingers skin. Indeed such approach shows a unique spatial resolution able to reveal a number of morphological details of fingerprints that are not seen with competing OCT setups. In particular the cellular structure of the stratum corneum and the epidermis-dermis interface appear clearly. We describe our high-resolution (1 micrometer, isotropic) setup and show our first design to get a large field of view while keeping a good sectioning ability of about 3 micrometers. We display the results obtained using these two setups for fingerprints examination.

  17. HRP facility for fabrication of ITER vertical target divertor full scale plasma facing units

    Energy Technology Data Exchange (ETDEWEB)

    Visca, Eliseo, E-mail: eliseo.visca@enea.it [Unità Tecnica Fusione, ENEA C. R. Frascati, via E. Fermi 45, IT-00044 Frascati (Roma) (Italy); Roccella, S. [Unità Tecnica Fusione, ENEA C. R. Frascati, via E. Fermi 45, IT-00044 Frascati (Roma) (Italy); Candura, D.; Palermo, M. [Ansaldo Nucleare S.p.A., Corso Perrone 25, IT-16152 Genova (Italy); Rossi, P.; Pizzuto, A. [Unità Tecnica Fusione, ENEA C. R. Frascati, via E. Fermi 45, IT-00044 Frascati (Roma) (Italy); Sanguinetti, G.P. [Ansaldo Nucleare S.p.A., Corso Perrone 25, IT-16152 Genova (Italy); Mancini, A.; Verdini, L.; Cacciotti, E.; Cerri, V.; Mugnaini, G.; Reale, A.; Giacomi, G. [Unità Tecnica Fusione, ENEA C. R. Frascati, via E. Fermi 45, IT-00044 Frascati (Roma) (Italy)

    2015-10-15

    Highlights: • R&D activities for the manufacturing of ITER divertor high heat flux plasma-facing components (HHFC). • ENEA and Ansaldo have jointly manufactured several actively cooled monoblock mock-ups and prototypical components. • ENEA and ANSALDO NUCLEARE jointly participate to the European program for the qualification of the manufacturing technology for the ITER divertor IVT. • Successful manufacturing by HRP (Hot Radial Pressing) of first full-scale full-W armored IVT qualification prototype. - Abstract: ENEA and Ansaldo Nucleare S.p.A. (ANN) have being deeply involved in the European development activities for the manufacturing of the ITER Divertor Inner Vertical Target (IVT) plasma-facing components. During normal operation the heat flux deposited on the bottom segment of divertor is 5–10 MW/m{sup 2} but the capability to remove up to 20 MW/m{sup 2} during transient events of 10 s must also be demonstrated. In order to fulfill ITER requirements, ENEA has set up and widely tested a manufacturing process, named Hot Radial Pressing (HRP). The last challenge is now to fabricate full-scale prototypes of the IVT, aimed to be qualified for the next step, i.e. the series production. On the basis of the experience of manufacturing hundreds of small mock-ups, ENEA designed and installed a new suitable HRP facility. The objective of getting a final shaped plasma facing unit (PFU) that satisfies these requirements is an ambitious target because tolerances set by ITER/F4E are very tight. The setting-up of the equipment started with the fabrication of full scale and representative ‘dummies’ in which stainless steel instead of CFC or W was used for monoblocks. The results confirmed that dimensions were compliant with the required tolerances. The paper reports a brief description of the innovative HRP equipment and the dimensional check results after HRP of the first full-scale full-W PFU.

  18. 77 FR 5055 - Certain Lined Paper School Supplies From China, India, and Indonesia; Scheduling of Full Five...

    Science.gov (United States)

    2012-02-01

    ... COMMISSION Certain Lined Paper School Supplies From China, India, and Indonesia; Scheduling of Full Five-Year... on certain lined paper school supplies from India and Indonesia and/or the revocation of the antidumping duty orders on certain lined paper school supplies from China, India, and Indonesia would...

  19. Physical Activity and Sedentary Time among Young Children in Full-Day Kindergarten: Comparing Traditional and Balanced Day Schedules

    Science.gov (United States)

    Vanderloo, Leigh M.; Tucker, Patricia

    2017-01-01

    Objective: To compare physical activity and sedentary time among young children whose schools adhere to traditional (i.e. three outdoor playtimes = 70 minutes) versus balanced day (i.e. two outdoor playtimes = ~55 minutes) schedules in Ontario full-day kindergarten classrooms. Design: The project was part of a larger, 2-year cross-sectional study.…

  20. 78 FR 9937 - Certain Pasta From Italy and Turkey Scheduling of Full Five-Year Reviews Concerning the...

    Science.gov (United States)

    2013-02-12

    ... 751(c)(5) of the Act should proceed (78 FR 959, January 7, 2013). A record of the Commissioners' votes... COMMISSION Certain Pasta From Italy and Turkey Scheduling of Full Five-Year Reviews Concerning the Countervailing and Antidumping Duty Orders on Certain Pasta From Italy and Turkey AGENCY: United...

  1. Physical Activity and Sedentary Time among Young Children in Full-Day Kindergarten: Comparing Traditional and Balanced Day Schedules

    Science.gov (United States)

    Vanderloo, Leigh M.; Tucker, Patricia

    2017-01-01

    Objective: To compare physical activity and sedentary time among young children whose schools adhere to traditional (i.e. three outdoor playtimes = 70 minutes) versus balanced day (i.e. two outdoor playtimes = ~55 minutes) schedules in Ontario full-day kindergarten classrooms. Design: The project was part of a larger, 2-year cross-sectional study.…

  2. 76 FR 23835 - Solid Urea From Russia and Ukraine; Scheduling of Full Five-Year Reviews Concerning the...

    Science.gov (United States)

    2011-04-28

    ... COMMISSION Solid Urea From Russia and Ukraine; Scheduling of Full Five-Year Reviews Concerning the Antidumping Duty Orders on Solid Urea From Russia and Ukraine AGENCY: United States International Trade... whether revocation of the antidumping duty orders on solid urea from Russia and Ukraine would be likely...

  3. 76 FR 43344 - Certain Orange Juice From Brazil; Scheduling of a Full Five-Year Review Concerning the...

    Science.gov (United States)

    2011-07-20

    ... COMMISSION Certain Orange Juice From Brazil; Scheduling of a Full Five-Year Review Concerning the Antidumping Duty Order on Certain Orange Juice From Brazil AGENCY: United States International Trade Commission... revocation of the antidumping duty order on certain orange juice from Brazil would be likely to lead...

  4. 77 FR 72384 - Lemon Juice From Argentina and Mexico; Scheduling of Full Five-Year Reviews Concerning the...

    Science.gov (United States)

    2012-12-05

    ... COMMISSION Lemon Juice From Argentina and Mexico; Scheduling of Full Five- Year Reviews Concerning the Suspended Investigations on Lemon Juice From Argentina and Mexico. AGENCY: International Trade Commission... termination of the suspended investigations on lemon juice from Argentina and Mexico would be likely to...

  5. 76 FR 58299 - Brass Sheet and Strip From France, Germany, Italy, and Japan; Scheduling of a Full Five-Year...

    Science.gov (United States)

    2011-09-20

    ... COMMISSION Brass Sheet and Strip From France, Germany, Italy, and Japan; Scheduling of a Full Five-Year Review Concerning the Antidumping Duty Order on Brass Sheet and Strip From France, Germany, Italy, and... brass sheet and strip from France, Germany, Italy, and Japan would be likely to lead to continuation...

  6. 78 FR 21416 - Low Enriched Uranium From France; Scheduling of a Full Five-year Review Concerning the...

    Science.gov (United States)

    2013-04-10

    ... COMMISSION Low Enriched Uranium From France; Scheduling of a Full Five-year Review Concerning the Antidumping Duty Order on Low Enriched Uranium from France AGENCY: United States International Trade Commission... revocation of the antidumping duty order on low enriched uranium from France would be likely to lead...

  7. 78 FR 76856 - Silicon Metal From Russia; Scheduling of a Full Five-Year Review Concerning the Antidumping Duty...

    Science.gov (United States)

    2013-12-19

    ... COMMISSION Silicon Metal From Russia; Scheduling of a Full Five-Year Review Concerning the Antidumping Duty Order on Silicon Metal From Russia AGENCY: United States International Trade Commission. ACTION: Notice... antidumping duty order on silicon metal from Russia would be likely to lead to continuation or recurrence...

  8. 77 FR 31877 - Corrosion-Resistant Carbon Steel Flat Products From Germany and Korea; Scheduling of Full Five...

    Science.gov (United States)

    2012-05-30

    ... COMMISSION Corrosion-Resistant Carbon Steel Flat Products From Germany and Korea; Scheduling of Full Five... duty order on corrosion-resistant carbon steel flat products from Korea and the antidumping duty orders on corrosion- resistant carbon steel flat products from Germany and Korea would be likely to lead to...

  9. Full Glowworm Swarm Optimization Algorithm for Whole-Set Orders Scheduling in Single Machine

    OpenAIRE

    Zhang Yu; Xiaomei Yang

    2013-01-01

    By analyzing the characteristics of whole-set orders problem and combining the theory of glowworm swarm optimization, a new glowworm swarm optimization algorithm for scheduling is proposed. A new hybrid-encoding schema combining with two-dimensional encoding and random-key encoding is given. In order to enhance the capability of optimal searching and speed up the convergence rate, the dynamical changed step strategy is integrated into this algorithm. Furthermore, experimental results prove it...

  10. Full glowworm swarm optimization algorithm for whole-set orders scheduling in single machine.

    Science.gov (United States)

    Yu, Zhang; Yang, Xiaomei

    2013-01-01

    By analyzing the characteristics of whole-set orders problem and combining the theory of glowworm swarm optimization, a new glowworm swarm optimization algorithm for scheduling is proposed. A new hybrid-encoding schema combining with two-dimensional encoding and random-key encoding is given. In order to enhance the capability of optimal searching and speed up the convergence rate, the dynamical changed step strategy is integrated into this algorithm. Furthermore, experimental results prove its feasibility and efficiency.

  11. Vascular communications between donor and recipient tissues after successful full face transplantation.

    Science.gov (United States)

    Kumamaru, K K; Sisk, G C; Mitsouras, D; Schultz, K; Steigner, M L; George, E; Enterline, D S; Bueno, E M; Pomahac, B; Rybicki, F J

    2014-03-01

    The vascular reorganization after facial transplantation has important implications on future surgical planning. The purpose of this study was to evaluate blood flow (BF) after full face transplantation using wide area-detector computed tomography (CT) techniques. Three subjects with severe craniofacial injury who underwent full face transplantation were included. All subjects underwent a single anastomosis bilaterally of the artery and vein, and the recipient tongue was preserved. Before and after surgery, dynamic volume CT studies were analyzed for vascular anatomy and blood perfusion. Postsurgical CT showed extensive vascular reorganization for external carotid artery (ECA) angiosome; collateral flows from vertebral, ascending pharyngeal or maxillary arteries supplied the branches from the recipient ECAs distal to the ligation. While allograft tissue was slightly less perfused when the facial artery was the only donor artery when compared to an ECA-ECA anastomosis (4.4 ± 0.4% vs. 5.7 ± 0.7%), allograft perfusion was higher than the recipient normal neck tissue. BF for the recipient tongue was maintained from contralateral/donor arteries when the lingual artery was sacrificed. Venous drainage was adequate for all subjects, even when the recipient internal jugular vein was anastomosed in end-to-end fashion on one side. In conclusion, dynamic CT identified adequate BF for facial allografts via extensive vascular reorganization.

  12. Cine computed tomography angiography evaluation of blood flow for full face transplant surgical planning.

    Science.gov (United States)

    Sisk, Geoffroy C; Kumamaru, Kanako K; Schultz, Kurt; Bueno, Ericka M; Diaz-Siso, J Rodrigo; George, Elizabeth; Redjaee, Marta M; Mitsouras, Dimitrios; Steigner, Michael L; Pomahac, Bohdan; Rybicki, Frank J

    2012-01-01

    Screening for full face transplantation candidates includes computed tomographic vascular mapping of the external carotid distribution for potential arterial and venous anastomoses. The purpose of this study is to illustrate the benefits and drawbacks of cine computed tomographic imaging for preoperative vascular mapping compared with best arterial and venous phase static images. Two image data sets were retrospectively created and compared for diagnostic findings. The first set of images was the clinical cine computed tomographic acquisition including all phases. The second set of images was composed of the best arterial and best venous phases extracted from the cine loop and determined by the quality of contrast enhancement. For each patient, the benefits and drawbacks of the cine loop were documented in consensus by a plastic surgeon and a radiologist. Cine loop analysis identified retrograde arterial filling not illustrated on the static images alone. Cine assessment identified most of the major vessels necessary for surgery, whereas the static images depicted small vessels more clearly, particularly in the crowded vessel takeoffs. Cine computed tomographic images provide data on direction of blood flow, which is important for preoperative planning. Combination of cine computed tomographic and the best static images will allow comprehensive vascular assessment necessary for future successful full face transplantation.

  13. Node Scheduling Strategies for Achieving Full-View Area Coverage in Camera Sensor Networks

    Directory of Open Access Journals (Sweden)

    Peng-Fei Wu

    2017-06-01

    Full Text Available Unlike conventional scalar sensors, camera sensors at different positions can capture a variety of views of an object. Based on this intrinsic property, a novel model called full-view coverage was proposed. We study the problem that how to select the minimum number of sensors to guarantee the full-view coverage for the given region of interest (ROI. To tackle this issue, we derive the constraint condition of the sensor positions for full-view neighborhood coverage with the minimum number of nodes around the point. Next, we prove that the full-view area coverage can be approximately guaranteed, as long as the regular hexagons decided by the virtual grid are seamlessly stitched. Then we present two solutions for camera sensor networks in two different deployment strategies. By computing the theoretically optimal length of the virtual grids, we put forward the deployment pattern algorithm (DPA in the deterministic implementation. To reduce the redundancy in random deployment, we come up with a local neighboring-optimal selection algorithm (LNSA for achieving the full-view coverage. Finally, extensive simulation results show the feasibility of our proposed solutions.

  14. DYPES: Vertical differentiation, schedule delay and entry deterrence: Low cost vs. full service airlines

    OpenAIRE

    Jorge Valido; M. Pilar Socorro; Francesca Medda

    2013-01-01

    We consider a market with a full-service (FS) carrier (the incumbent) and a low-cost (LC) carrier (the potential entrant). If the LC carrier enters the market, airlines compete in ticket prices and frequency with vertically differentiated products. The higher the frequency, the lower passenger’s generalized price. Thus, more frequency allows airlines to increase ticket prices without losing demand. In this context, we show that the incumbent may increase the frequency offered in order to dete...

  15. Fractal analysis of en face tomographic images obtained with full field optical coherence tomography

    Energy Technology Data Exchange (ETDEWEB)

    Gao, Wanrong; Zhu, Yue [Department of Optical Engineering, Nanjing University of Science and Technology, Jiangsu (China)

    2017-03-15

    The quantitative modeling of the imaging signal of pathological areas and healthy areas is necessary to improve the specificity of diagnosis with tomographic en face images obtained with full field optical coherence tomography (FFOCT). In this work, we propose to use the depth-resolved change in the fractal parameter as a quantitative specific biomarker of the stages of disease. The idea is based on the fact that tissue is a random medium and only statistical parameters that characterize tissue structure are appropriate. We successfully relate the imaging signal in FFOCT to the tissue structure in terms of the scattering function and the coherent transfer function of the system. The formula is then used to analyze the ratio of the Fourier transforms of the cancerous tissue to the normal tissue. We found that when the tissue changes from the normal to cancerous the ratio of the spectrum of the index inhomogeneities takes the form of an inverse power law and the changes in the fractal parameter can be determined by estimating slopes of the spectra of the ratio plotted on a log-log scale. The fresh normal and cancer liver tissues were imaged to demonstrate the potential diagnostic value of the method at early stages when there are no significant changes in tissue microstructures. (copyright 2016 by WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)

  16. Simultaneous Vehicle and Crew Routing and Scheduling for Partial- and Full-Load Long-Distance Road Transport

    Directory of Open Access Journals (Sweden)

    Michael Drexl

    2013-11-01

    Full Text Available This paper studies a simultaneous vehicle and crew routing and scheduling problem arising in long-distance road transport in Europe: Pickup-and-delivery requests have to be fulfilled over a multi-period planning horizon by a heterogeneous fleet of trucks and drivers. Typically, in the vehicle routing literature, a fixed assignment of a driver to a truck is assumed. In our approach, we abandon this assumption and allow truck/driver changes at geographically dispersed relay stations. This offers greater planning flexibility and allows a better utilization of trucks, but also creates intricate interdependencies between trucks and drivers and requires the synchronization of their routes. A solution heuristic based on a two-stage decomposition of the problem is developed, taking into account European Union social legislation for drivers, and computational experiments using real-world data provided by a major German forwarder are presented and analyzed. The obtained results suggest that for the vehicle and driver cost structure prevalent in Western Europe and for transport requests that are not systematically acquired to complement one another, no cost savings are possible through simultaneous vehicle and crew routing and scheduling, although no formal proof of this fact is possible.

  17. Composite multilobe descriptors for cross-spectral recognition of full and partial face

    Science.gov (United States)

    Cao, Zhicheng; Schmid, Natalia A.; Bourlai, Thirimachos

    2016-08-01

    Cross-spectral image matching is a challenging research problem motivated by various applications, including surveillance, security, and identity management in general. An example of this problem includes cross-spectral matching of active infrared (IR) or thermal IR face images against a dataset of visible light images. A summary of recent developments in the field of cross-spectral face recognition by the authors is presented. In particular, it describes the original form and two variants of a local operator named composite multilobe descriptor (CMLD) for facial feature extraction with the purpose of cross-spectral matching of near-IR, short-wave IR, mid-wave IR, and long-wave IR to a gallery of visible light images. The experiments demonstrate that the variants of CMLD outperform the original CMLD and other recently developed composite operators used for comparison. In addition to different IR spectra, various standoff distances from close-up (1.5 m) to intermediate (50 m) and long (106 m) are also investigated. Performance of CMLD I to III is evaluated for each of the three cases of distances. The newly developed operators, CMLD I to III, are further utilized to conduct a study on cross-spectral partial face recognition where different facial regions are compared in terms of the amount of useful information they contain for the purpose of conducting cross-spectral face recognition. The experimental results show that among three facial regions considered in the experiments the eye region is the most informative for all IR spectra at all standoff distances.

  18. Migration from full-head mask to "open-face" mask for immobilization of patients with head and neck cancer.

    Science.gov (United States)

    Li, Guang; Lovelock, D Michael; Mechalakos, James; Rao, Shyam; Della-Biancia, Cesar; Amols, Howard; Lee, Nancy

    2013-09-06

    To provide an alternative device for immobilization of the head while easing claustrophobia and improving comfort, an "open-face" thermoplastic mask was evaluated using video-based optical surface imaging (OSI) and kilovoltage (kV) X-ray radiography. A three-point thermoplastic head mask with a precut opening and reinforced strips was developed. After molding, it provided sufficient visible facial area as the region of interest for OSI. Using real-time OSI, the head motion of ten volunteers in the new mask was evaluated during mask locking and 15minutes lying on the treatment couch. Using a nose mark with reference to room lasers, forced head movement in open-face and full-head masks (with a nose hole) was compared. Five patients with claustrophobia were immobilized with open-face masks, set up using OSI and kV, and treated in 121 fractions, in which 61 fractions were monitored during treatment using real-time OSI. With the open-face mask, head motion was found to be 1.0 ± 0.6 mm and 0.4° ± 0.2° in volunteers during the experiment, and 0.8 ± 0.3 mm and 0.4° ± 0.2° in patients during treatment. These agree with patient motion calculated from pre-/post-treatment OSI and kV data using different anatomical landmarks. In volunteers, the head shift induced by mask-locking was 2.3 ± 1.7 mm and 1.8° ± 0.6°, and the range of forced movements in the open-face and full-head masks were found to be similar. Most (80%) of the volunteers preferred the open-face mask to the full-head mask, while claustrophobic patients could only tolerate the open-face mask. The open-face mask is characterized for its immobilization capability and can immobilize patients sufficiently (< 2 mm) during radiotherapy. It provides a clinical solution to the immobilization of patients with head and neck (HN) cancer undergoing radiotherapy, and is particularly beneficial for claustrophobic patients. This new open-face mask is readily adopted in radiotherapy clinic as a superior alternative to

  19. Flap prefabrication and stem cell-assisted tissue expansion: how we acquire a monoblock flap for full face resurfacing.

    Science.gov (United States)

    Li, Qingfeng; Zan, Tao; Li, Haizhou; Zhou, Shuangbai; Gu, Bin; Liu, Kai; Xie, Feng; Xie, Yun

    2014-01-01

    Total face skin and soft-tissue defects remain one of the biggest challenges in reconstructive surgery. Reconstruction of the entire face with uniform coverage and delicate features is difficult to achieve. To avoid the patchwork result seen in multiple flaps and skin grafts, 1 monoblock flap that has similar color, texture, and thickness might be an ideal option to minimize the incisional scars and several surgical procedures but is unavailable with current approaches because of the lack of sufficient matched tissue and the unreliable blood supply for such a large flap. To acquire a monoblock flap for full face reconstruction, we combine the prefabricated flaps, skin overexpansion, and bone marrow mononuclear stem cell transplantation for total facial resurfacing. In this article, we present our experience from our case series that provides universally matched skin and near-normal facial contour. It is a reliable and an excellent reconstructive option for massive facial skin defect.

  20. Moving human full body and body parts detection, tracking, and applications on human activity estimation, walking pattern and face recognition

    Science.gov (United States)

    Chen, Hai-Wen; McGurr, Mike

    2016-05-01

    We have developed a new way for detection and tracking of human full-body and body-parts with color (intensity) patch morphological segmentation and adaptive thresholding for security surveillance cameras. An adaptive threshold scheme has been developed for dealing with body size changes, illumination condition changes, and cross camera parameter changes. Tests with the PETS 2009 and 2014 datasets show that we can obtain high probability of detection and low probability of false alarm for full-body. Test results indicate that our human full-body detection method can considerably outperform the current state-of-the-art methods in both detection performance and computational complexity. Furthermore, in this paper, we have developed several methods using color features for detection and tracking of human body-parts (arms, legs, torso, and head, etc.). For example, we have developed a human skin color sub-patch segmentation algorithm by first conducting a RGB to YIQ transformation and then applying a Subtractive I/Q image Fusion with morphological operations. With this method, we can reliably detect and track human skin color related body-parts such as face, neck, arms, and legs. Reliable body-parts (e.g. head) detection allows us to continuously track the individual person even in the case that multiple closely spaced persons are merged. Accordingly, we have developed a new algorithm to split a merged detection blob back to individual detections based on the detected head positions. Detected body-parts also allow us to extract important local constellation features of the body-parts positions and angles related to the full-body. These features are useful for human walking gait pattern recognition and human pose (e.g. standing or falling down) estimation for potential abnormal behavior and accidental event detection, as evidenced with our experimental tests. Furthermore, based on the reliable head (face) tacking, we have applied a super-resolution algorithm to enhance

  1. Ultrasonic Phased Array Inspection of Flaws on Weld Fusion Faces Using Full Matrix Capture

    Science.gov (United States)

    Long, R.; Russell, J.; Cawley, P.; Habgood, N.

    2009-03-01

    Work is being conducted to develop phased array inspection of stainless steel welded pipes. Ideally this uses waves reflected and mode converted at the inner surface of the pipe, but most commercial phased array controllers do not currently provide for this. Our solution was to use Full Matrix Capture (FMC) and process the data ourselves. This paper explains the FMC principle, describes the signal processing algorithms along with introducing the Almost Total Focusing Method (ATFM) and illustrates how the processed data was presented. The inspections were also modeled using the CEA CIVA software and compared to experimental results.

  2. Arc erosion of full metal plasma facing components at the inner baffle region of ASDEX Upgrade

    Directory of Open Access Journals (Sweden)

    V. Rohde

    2016-12-01

    Full Text Available At the inner baffle of the AUG divertor massive polished inserts of tungsten and P92 steel were installed to measure the erosion by arcing. For tungsten most of the traces are less than 0.4µm deep and a similar amount of tungsten is deposited close to the traces. Few craters up to 4µm resulting in an average erosion rate of 2×1013 at cm−2s−1 are observed. The behaviour for P92 steel is quite different: most of the traces are 4µm deep, up to 80µm were observed. An average erosion rate of 400×1013 at cm−2s−1, i.e. more than a factor of hundred higher compared to tungsten, is found. Therefore, erosion by arcing has to be taken into account to determine the optimal material mix for future fusion devices.

  3. From partial to full-face transplantation: total ablation and restoration, a change in the reconstructive paradigm.

    Science.gov (United States)

    Barret, Juan P

    2014-01-01

    The innovation of composite vascularized allotransplantation has provided plastic and reconstructive surgeons with the ultimate tool for those patients that present with facial deformities that cannot be reconstructed with classical or more traditional techniques. Transplanting normal tissues allows for a true restorative surgery. Initial experiences included the substitution of missing anatomy, whereas after the first world's full-face transplant performed in Barcelona in March 2010, a true ablative surgery with a total restoration proved to be effective. We review the world's experience and the performance of our restorative protocol to depict this change in the reconstructive paradigm of facial transplantation. Facial transplants should be performed after a careful analysis of the defect, with a comprehensive ablation plan following esthetic units with sacrifice of all required tissues with a focus of global restoration of anatomy, aesthetics and function, respecting normal functioning muscles. Nowadays, facial transplants following strict esthetic units should restore disfigurement extending to small central areas, whereas major defects may require a total ablation and restoration with full-face transplants.

  4. Heat stress evaluation of two-layer chemical demilitarization ensembles with a full face negative pressure respirator.

    Science.gov (United States)

    Fletcher, Oclla Michele; Guerrina, Ryan; Ashley, Candi D; Bernard, Thomas E

    2014-01-01

    The purpose of this study was to examine the heat stress effects of three protective clothing ensembles: (1) protective apron over cloth coveralls including full face negative pressure respirator (APRON); (2) the apron over cloth coveralls with respirator plus protective pants (APRON+PANTS); and (3) protective coveralls over cloth coveralls with respirator (PROTECTIVE COVERALLS). In addition, there was a no-respirator ensemble (PROTECTIVE COVERALLS-noR), and WORK CLOTHES as a reference ensemble. Four acclimatized male participants completed a full set of five trials, and two of the participants repeated the full set. The progressive heat stress protocol was used to find the critical WBGT (WBGTcrit) and apparent total evaporative resistance (Re,T,a) at the upper limit of thermal equilibrium. The results (WBGTcrit [°C-WBGT] and Re,T,a [kPa m(2) W(-1)]) were WORK CLOTHES (35.5, 0.0115), APRON (31.6, 0.0179), APRON+PANTS (27.7, 0.0244), PROTECTIVE COVERALLS (25.9, 0.0290), and PROTECTIVE COVERALLS-noR (26.2, 0.0296). There were significant differences among the ensembles. Supporting previous studies, there was little evidence to suggest that the respirator contributed to heat stress.

  5. Non-boronized compared with boronized operation of ASDEX Upgrade with full-tungsten plasma facing components

    Science.gov (United States)

    Kallenbach, A.; Dux, R.; Mayer, M.; Neu, R.; Pütterich, T.; Bobkov, V.; Fuchs, J. C.; Eich, T.; Giannone, L.; Gruber, O.; Herrmann, A.; Horton, L. D.; Maggi, C. F.; Meister, H.; Müller, H. W.; Rohde, V.; Sips, A.; Stäbler, A.; Stober, J.; ASDEX Upgrade Team

    2009-04-01

    After completion of the tungsten coating of all plasma facing components, ASDEX Upgrade has been operated without boronization for 1 1/2 experimental campaigns. This has allowed the study of fuel retention under conditions of relatively low D co-deposition with low-Z impurities as well as the operational space of a full-tungsten device for the unfavourable condition of a relatively high intrinsic impurity level. Restrictions in operation were caused by the central accumulation of tungsten in combination with density peaking, resulting in H-L backtransitions induced by too low separatrix power flux. Most important control parameters have been found to be the central heating power, as delivered predominantly by ECRH, and the ELM frequency, most easily controlled by gas puffing. Generally, ELMs exhibit a positive impact, with the effect of impurity flushing out of the pedestal region overbalancing the ELM-induced W source. The restrictions of plasma operation in the unboronized W machine occurred predominantly under low or medium power conditions. Under medium-high power conditions, stable operation with virtually no difference between boronized and unboronized discharges was achieved. Due to the reduced intrinsic radiation with boronization and the limited power handling capability of VPS coated divertor tiles (≈10 MW m-2), boronized operation at high heating powers was possible only with radiative cooling. To enable this, a previously developed feedback system using (thermo-)electric current measurements as approximate sensor for the divertor power flux was introduced into the standard AUG operation. To avoid the problems with reduced ELM frequency due to core plasma radiation, nitrogen was selected as radiating species since its radiative characteristic peaks at lower electron temperatures in comparison with Ne and Ar, favouring SOL and divertor radiative losses. Nitrogen seeding resulted not only in the desired divertor power load reduction but also in improved

  6. 双模式全断面掘进机探讨%Discussion on Dual-mode Full-face Tunnel Boring Machines

    Institute of Scientific and Technical Information of China (English)

    张宁川; 李光

    2013-01-01

    为适应地质的复杂性以及中国国情,探讨双模式全断面掘进机的未来发展趋势,并举例说明双模式全断面掘进机的设计理念,详述其主要结构及适用范围.与单模式掘进机相比,双模式全断面掘进机地质适应性广、设备利用率高、施工成本低,是隧道掘进设备技术发展的主要方向之一,具有良好的发展前景.%The development trend of dual-mode full-face tunnel boring machines is discussed,the design concept of dual-mode full-face tunnel boring machines is presented and the main structure and applicability scope of dual-mode fullface tunnel boring machines are described in detail.The study shows that,compared to single-mode tunnel boring machines,the applicability scope of dual-mode full-face tunnel boring machines is more extensive,the availability of dualmode full-face tunnel boring machines is higher and the tunneling cost of dual-mode full-face tunnel boring machines is lower.Conclusion is drawn that the dual-mode full-face tunnel boring machine,which is the main development trend of tunnel boring machines,has a splendid future.

  7. Tests on full caving of the roof on a mechanised longwall face: face S-9 of Innominada colliery. Ensayo de sutiraje integral por el techo, en frente largo mecanizado. Tajo S-9 de mina Innominada

    Energy Technology Data Exchange (ETDEWEB)

    Ruiz Cano, A.L. (ENDESA, Teruel (Spain))

    1989-11-01

    During 1989, tests were carried out at face S-9 of Innominada colliery (ENDESA) in Andorra (Teruel) using a highly mechanised system of full caving of the roof. The aims of the test were to increase production in the face panel, to take more than 70% of the roof panel and to improve safety and working conditions. The unusual geological characteristics of the surrounding strata and of the coal itself (inconsistency, presence of sand and water, etc) as well as previous experience of mechanisation created the need to design supports suitable for use in this deposit. The new supports which are being tested differ from those currently in use on mechanised longwall faces with caving, both in layout and in the method of removing coal from the caved area. 4 figs.

  8. Scheduling in Engineering, Project, and Production Management

    Directory of Open Access Journals (Sweden)

    Chien-Ho Ko

    2015-01-01

    Full Text Available This issue presents five papers selected from the 2013 (4th International Conference on Engineering, Project, and Production Management (EPPM2013 held in Bangkok, Thailand. Three of the papers deal with scheduling problems faced in project and production management, while the remaining two focus on engineering management issues.

  9. Scheduling for Responsive Grids

    CERN Document Server

    Germain-Renaud, C; Moscicki,JT; Texier, R

    2008-01-01

    Grids are facing the challenge of seamless integration of the Grid power into everyday use. One critical component for this integration is responsiveness, the capacity to support on-demand computing and interactivity. Grid scheduling is involved at two levels in order to provide responsiveness: the policy level and the implementation level. The main contributions of this paper are as follows. First, we present a detailed analysis of the performance of the EGEE Grid with respect to responsiveness. Second, we examine two user-level schedulers located between the general scheduling layer and the application layer. These are the DIANE (distributed analysis environment) framework, a general-purpose overlay system, and a specialized, embedded scheduler for gPTM3D, an interactive medical image analysis application. Finally, we define and demonstrate a virtualization scheme, which achieves guaranteed turnaround time, schedulability analysis, and provides the basis for differentiated services. Both methods target a br...

  10. FUPS-DV: Full-Time Preemption CPU Scheduling for Desktop Virtualization%FUPS- DV:用于桌面虚拟化的全时抢占CPU调度算法

    Institute of Scientific and Technical Information of China (English)

    夏虞斌; 杨春; 程旭

    2011-01-01

    Desktop virtualization usually runs mixed workload,and is mote sensitive to me interactive performance. Current virtual machine scheduler cannot meet the two demands.This paper presents a full-time preemption CPU scheduler. It uses grey-box technology to inspect information inside virtual machine to support virtual machine scheduling, and considers the characteristics of remote desktop workload for optimization. The evaluation results show that when S Windows XP virtual machines running mixed workload concurrently, the display latency of slides presentation is reduced by at least 60% with our optimization.%桌面虚拟化通常运行混合负载,且更注重交互式性能,现有的虚拟机调度算法无法很好适应这两个特点.本文提出了一种全时抢占CPU调度算法,通过灰盒技术探测虚拟机内部信息用于辅助虚拟机调度,并结合远程桌面的负载特性进行优化.评测表明,5台WindowsXP虚拟机同时运行混合负载,优化后播放幻灯片的显示延迟降低了至少60%.

  11. Differential associations between infant affective and cortisol responses during the still face paradigm among infants born very low birth weight versus full-term.

    Science.gov (United States)

    Erickson, Sarah J; Maclean, Peggy; Qualls, Clifford; Lowe, Jean R

    2013-06-01

    Psychological stress responses may have both emotional and cortisol reactivity correlates, but there are limited data addressing the association between generalized negative and positive emotional states and cortisol reactivity to a psychological stressor among infants born very low birth weight (VLBW; cortisol) responses may provide insight into the nature of regulation difficulties identified in infants born VLBW. The purpose of this study was to assess the association between infant affective and cortisol responses to the Still Face paradigm (SF) in a cohort of six- to eight-month old infants born VLBW compared with infants born full-term (N=53 total; N=29 and N=24, respectively). Infant affect was coded in 1-s intervals while mother-infant dyads participated in the SF paradigm, and percent positive affect and percent negative affect were calculated separately for each SF episode. We had hypothesized that because infants born VLBW are at increased risk for dysregulation, they would show, compared to full-term controls, greater dysregulation in the form of less synchrony (i.e., less correlated affective and cortisol responses) across the two SF stressors (episodes 2 and 4). This hypothesis was largely supported: the associations between affective and cortisol responses were different for the two groups across the two stressors for percent positive affect (both stressor episodes 2 and 4) and percent negative affect (episode 4 only). For the full-term group, follow up correlations revealed significant negative associations between percent positive affective and cortisol responses for both stressors. Mothers' responsiveness did not explain the term group association differences between infant affective and cortisol responses across stressors. The (lack of) association of stress reactivity systems may index dysregulation or dysregulation correlates in preterm children. Understanding how this lack of coordination among stress systems relates to greater dysregulation

  12. Refinery scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Magalhaes, Marcus V.; Fraga, Eder T. [PETROBRAS, Rio de Janeiro, RJ (Brazil); Shah, Nilay [Imperial College, London (United Kingdom)

    2004-07-01

    This work addresses the refinery scheduling problem using mathematical programming techniques. The solution adopted was to decompose the entire refinery model into a crude oil scheduling and a product scheduling problem. The envelope for the crude oil scheduling problem is composed of a terminal, a pipeline and the crude area of a refinery, including the crude distillation units. The solution method adopted includes a decomposition technique based on the topology of the system. The envelope for the product scheduling comprises all tanks, process units and products found in a refinery. Once crude scheduling decisions are Also available the product scheduling is solved using a rolling horizon algorithm. All models were tested with real data from PETROBRAS' REFAP refinery, located in Canoas, Southern Brazil. (author)

  13. SCHEDULING PROBLEMS-AN OVERVIEW

    Institute of Scientific and Technical Information of China (English)

    Asmuliardi MULUK; Hasan AKPOLAT; Jichao XU

    2003-01-01

    There seems to be a significant gap between the theoretical and the practical aspects of scheduling problems in the job shop environment. Theoretically, scheduling systems are designed on the basis of an optimum approach to the scheduling model. However in the practice, the optimum that is built into the scheduling applications seems to face some challenges when dealing with the dynamic character of a scheduling system, for instance machine breakdown or change of orders. Scheduling systems have become quite complex in the past few years. Competitive business environments and shorter product life cycles are the imminent challenges being faced by many companies these days.These challenges push companies to anticipate a demand driven supply chain in their business environment. A demand-driven supply chain incorporates the customer view into the supply chain processes. As a consequence of this, scheduling as a core process of the demand-driven supply chain must also reflect the customer view. In addition, other approaches to solving scheduling problems, for instance approaches based on human factors, prefer the scheduling system to be more flexible in both design and implementation. After discussion of these factors, the authors propose the integration of a different set of criteria for the development of scheduling systems which not only appears to have a better flexibility but also increased customer-focus.

  14. About Face

    Medline Plus

    Full Text Available Skip to Content Menu Closed (Tap to Open) Home Videos by Topic Videos by Type Search All ... What is AboutFace? Resources for Professionals Get Help Home Watch Videos by Topic Videos by Type Search ...

  15. About Face

    Medline Plus

    Full Text Available ... Home Videos by Topic Videos by Type Search All Videos PTSD Basics PTSD Treatment What is AboutFace? ... Watch Videos by Topic Videos by Type Search All Videos Learn More PTSD Basics PTSD Treatment What ...

  16. Distributed scheduling

    OpenAIRE

    Toptal, Ayşegül

    1999-01-01

    Ankara : Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent Univ., 1999. Thesis (Master's) -- Bilkent University, 1999. Includes bibliographical references. Distributed Scheduling (DS) is a new paradigm that enables the local decisionmakers make their own schedules by considering local objectives and constraints within the boundaries and the overall objective of the whole system. Local schedules from different parts of the system are...

  17. Personnel scheduling

    OpenAIRE

    Vanden Berghe, Greet

    2012-01-01

    Personnel scheduling can become a particularly difficult optimisation problem due to human factors. And yet: people working in healthcare, transportation and other round the clock service regimes perform their duties based on a schedule that was often manually constructed. The unrewarding manual scheduling task deserves more attention from the timetabling community so as to support computation of fair and good quality results. The present abstract touches upon a set of particular characterist...

  18. Continuous Media Tasks Scheduling Algorithm

    Directory of Open Access Journals (Sweden)

    Myungryun Yoo

    2016-03-01

    Full Text Available In this paper the authors propose modified proportional share scheduling algorithm considering the characteristics of continuous media such as its continuity and time dependency. Proposed scheduling algorithm shows graceful degradation of performance in overloaded situation and decreases the number of context switching. Proposed scheduling algorithm is evaluated using several numerical tests under various conditions, especially overloaded situation.

  19. Scheduling Supercomputers.

    Science.gov (United States)

    1983-02-01

    no task is scheduled with overlap. Let numpi be the total number of preemptions and idle slots of size at most to that are introduced. We see that if...no usable block remains on Qm-*, then numpi < m-k. Otherwise, numpi ! m-k-1. If j>n when this procedure terminates, then all tasks have been scheduled

  20. Effects of Block Scheduling

    Directory of Open Access Journals (Sweden)

    William R. Veal

    1999-09-01

    Full Text Available This study examined the effects of a tri-schedule on the academic achievement of students in a high school. The tri-schedule consists of traditional, 4x4 block, and hybrid schedules running at the same time in the same high school. Effectiveness of the schedules was determined from the state mandated test of basic skills in reading, language, and mathematics. Students who were in a particular schedule their freshman year were tested at the beginning of their sophomore year. A statistical ANCOVA test was performed using the schedule types as independent variables and cognitive skill index and GPA as covariates. For reading and language, there was no statistically significant difference in test results. There was a statistical difference mathematics-computation. Block mathematics is an ideal format for obtaining more credits in mathematics, but the block format does little for mathematics achievement and conceptual understanding. The results have content specific implications for schools, administrations, and school boards who are considering block scheduling adoption.

  1. Visualization and Simulation in Scheduling

    Directory of Open Access Journals (Sweden)

    R. Čapek

    2008-01-01

    Full Text Available This paper deals with the representation of scheduling results and it introduces a new tool for visualization and simulation in time scheduling called VISIS. The purpose of this tool is to provide an environment for visualization, e.g. in production line scheduling. The simulation also proposes a way to simulate the influence of a schedule on a user defined system, e.g. for designing filters in digital signal processing. VISIS arises from representing scheduling results using the well-known Gantt chart. The application is implemented in the Matlab programming environment using Simulink and the Virtual Reality toolbox. 

  2. CPU Scheduling Algorithms: A Survey

    Directory of Open Access Journals (Sweden)

    Imran Qureshi

    2014-01-01

    Full Text Available Scheduling is the fundamental function of operating system. For scheduling, resources of system shared among processes which are going to be executed. CPU scheduling is a technique by which processes are allocating to the CPU for a specific time quantum. In this paper the review of different scheduling algorithms are perform with different parameters, such as running time, burst time and waiting times etc. The reviews algorithms are first come first serve, Shortest Job First, Round Robin, and Priority scheduling algorithm.

  3. Cbs (Contrastrain Based Schedulling Adalah Faktor Penentu Keberhasilan Perusahanan Printing

    Directory of Open Access Journals (Sweden)

    Hendra Achmadi

    2010-06-01

    Full Text Available In a highly competitive industry faces today ranging from small or home-based printing to using machine that can print offset a hundred thousand copies per hour. But, the increasing competition resulted in requiring a faster production time from order entry, print proff until the production process to delivery to customers. Often times in case of orders which will result in the concurrent PPIC will experience vertigo in the setting of production schedules which have concurrent delivery time. Often will end up with no receipt of orders due to difficulties in the production schedule, especially if the orders require the same offset machine and cylinder wear the same length, while the number of cylinders is limited. Therefore, the printing company should be able to do so in the conduct of a penetration timing of production can easily be simulated and implemented on the ground. CBS (Base Constraint scheduling is a technique to do the scheduling of production so that production can be carried out smoothly and quickly that fulfill the promise made to customers. In scheduling, there are several techniques that can be used are: FCFS (First Came First Serve, EDD (Earliest Date, and LCLS (Last Came Last Serve. So, it is required to be able to do way better scheduling to get results quickly in this fast changing schedules.

  4. CBS (CONTRASTRAIN BASED SCHEDULLING ADALAH FAKTOR PENENTU KEBERHASILAN PERUSAHANAN PRINTING

    Directory of Open Access Journals (Sweden)

    Hendra Achmadi

    2010-05-01

    Full Text Available In a highly competitive industry faces today ranging from small or home-based printing to using machine that can print offset a hundred thousand copies per hour. But, the increasing competition resulted in requiring a faster production time from order entry, print proff until the production process to delivery to customers. Often times in case of orders which will result in the concurrent PPIC will experience vertigo in the setting of production schedules which have concurrent delivery time. Often will end up with no receipt of orders due to difficulties in the production schedule, especially if the orders require the same offset machine and cylinder wear the same length, while the number of cylinders is limited. Therefore, the printing company should be able to do so in the conduct of a penetration timing of production can easily be simulated and implemented on the ground. CBS (Base Constraint scheduling is a technique to do the scheduling of production so that production can be carried out smoothly and quickly that fulfill the promise made to customers. In scheduling, there are several techniques that can be used are: FCFS (First Came First Serve, EDD (Earliest Date, and LCLS (Last Came Last Serve. So, it is required to be able to do way better scheduling to get results quickly in this fast changing schedules.

  5. About Face

    Medline Plus

    Full Text Available ... PTSD (posttraumatic stress disorder). Watch the intro This is AboutFace In these videos, Veterans, family members, and ... to hear what they have to say. What is PTSD? → How does PTSD affect loved ones? → Am ...

  6. About Face

    Medline Plus

    Full Text Available ... traumatic event — like combat, an assault, or a disaster — it's normal to feel scared, keyed up, or sad at first. But if it's been months or years since the trauma and you're not feeling better, you may have PTSD (posttraumatic stress disorder). Watch the intro This is AboutFace In ...

  7. USE OF FULL FACE SLURRY SHIELD FOR PIPE JACKING IN HONG KONG'S RECLAIMED LAND%全断面泥浆式盾构在香港填海地区顶管施工中的应用

    Institute of Scientific and Technical Information of China (English)

    应海民; 潘新华

    2003-01-01

    Pipe jacking has become a popular method in drainage construction in Hong Kong. However, the varied ground conditions encountered in reclaimed land may pose severe problems to pipe jacking operation. This paper presents the experience of using the full face slurry shield for pipe jacking in a reclaimed area. The study shows that the full face slurry shield with a rock cutting head performs satisfactorily. To ensure the machine can work effectively in all ground conditions, other factors need to be considered including the rock cutting head being worn away, the hitting of under ground structures, the sustainability of jacked pipes alignment, the associated ground settlement and the damage to the jacked pipes caused by the jacking pressure.

  8. A Scheduling Problem for Hospital Operating Theatre

    CERN Document Server

    Sufahani, Suliadi F; Ismail, Zuhaimy

    2012-01-01

    This paper provides a classification of real scheduling problems. Various ways have been examined and described on the problem. Scheduling problem faces a tremendous challenges and difficulties in order to meet the preferences of the consumer. Dealing with scheduling problem is complicated, inefficient and time-consuming. This study aims to develop a mathematical model for scheduling the operating theatre during peak and off peak time. Scheduling problem is a well known optimization problem and the goal is to find the best possible optimal solution. In this paper, we used integer linear programming technique for scheduling problem in a high level of synthesis. In addition, time and resource constrained scheduling was used. An optimal result was fully obtained by using the software GLPK/AMPL. This model can be adopted to solve other scheduling problems, such as the Lecture Theatre, Cinemas and Work Shift.

  9. Planning and Scheduling for Environmental Sensor Networks

    Science.gov (United States)

    Frank, J. D.

    2005-12-01

    Environmental Sensor Networks are a new way of monitoring the environment. They comprise autonomous sensor nodes in the environment that record real-time data, which is retrieved, analyzed, integrated with other data sets (e.g. satellite images, GIS, process models) and ultimately lead to scientific discoveries. Sensor networks must operate within time and resource constraints. Sensors have limited onboard memory, energy, computational power, communications windows and communications bandwidth. The value of data will depend on when, where and how it was collected, how detailed the data is, how long it takes to integrate the data, and how important the data was to the original scientific question. Planning and scheduling of sensor networks is necessary for effective, safe operations in the face of these constraints. For example, power bus limitations may preclude sensors from simultaneously collecting data and communicating without damaging the sensor; planners and schedulers can ensure these operations are ordered so that they do not happen simultaneously. Planning and scheduling can also ensure best use of the sensor network to maximize the value of collected science data. For example, if data is best recorded using a particular camera angle but it is costly in time and energy to achieve this, planners and schedulers can search for times when time and energy are available to achieve the optimal camera angle. Planning and scheduling can handle uncertainty in the problem specification; planners can be re-run when new information is made available, or can generate plans that include contingencies. For example, if bad weather may prevent the collection of data, a contingent plan can check lighting conditions and turn off data collection to save resources if lighting is not ideal. Both mobile and immobile sensors can benefit from planning and scheduling. For example, data collection on otherwise passive sensors can be halted to preserve limited power and memory

  10. Full scale model experiment of fair- faced concrete construction for Hongkong- Zhuhai- Macao Bridge%港珠澳大桥清水混凝土施工足尺模型试验研究

    Institute of Scientific and Technical Information of China (English)

    孔令磊; 杨润来; 江宪权

    2016-01-01

    为提升整体景观效果,港珠澳大桥岛上段隧道敞开段墙身、挡浪墙及岛上房建采用清水混凝土工艺。由于清水混凝土在国内应用不多,缺乏施工经验,为确保施工品质及工程目标实现,针对清水混凝土施工技术及影响观感的各环节,在现场开展系统的足尺模型试验。通过系统试验,掌握了施工过程中的各项参数,并形成量化指标,以指导现场施工。%In order to enhance the overall landscape effect, fair-faced concrete was used on tunnel walls, wave walls and the buildings on the artificial islands of Hongkong-Zhuhai-Macao Bridge. As fair-faced concrete was not much used in China, the builders had no much experience in construction of the fair-faced concrete.In order to ensure the quality of concrete construction and the project goals, systematic full-scale model testing was carried out on site to assess and ascertain the technology for fair faced concrete construction and various links affecting the external appearance. Through the systematic full scale model tests, various parameters in the process of construction were achieved and transformed into quantitative indicators to guide the construction on site.

  11. Robust and Flexible Scheduling with Evolutionary Computation

    DEFF Research Database (Denmark)

    Jensen, Mikkel T.

    (schedules expected to perform well after some degree of modification when the environment changes). This thesis presents two fundamentally different approaches for scheduling job shops facing machine breakdowns. The first method is called neighbourhood based robustness and is based on an idea of minimising...... environments include machine breakdowns, uncertain processing times, workers getting sick, materials being delayed and the appearance of new jobs. These possible environmental changes mean that a schedule which was optimal for the information available at the time of scheduling can end up being highly...... suboptimal when it is implemented and subjected to the uncertainty of the real world. For this reason it is very important to find methods capable of creating robust schedules (schedules expected to perform well after a minimal amount of modification when the environment changes) or flexible schedules...

  12. Southeast Asia faces full energy agenda

    Energy Technology Data Exchange (ETDEWEB)

    Dang, G.V. (Asian Institute of Technology, Bangkok (Thailand))

    Most governments in Southeast Asia are turning their state-owned electric systems into something more closely resembling private utilities in order to improve their economic performance, says G.V. Dang of the Asian Institute of Technology in Bangkok, Thailand. [open quotes]The bottom line has replaced geographic expansion as the guiding principle behind electricity policy throughout much of Southeast asia,[close quotes] Dang says. Utilities are adopting standard corporate operating strategies; electricity prices are being allowed to rise to more accurately reflect costs; competition from privately owned power suppliers is increasing; and utilities are being forced to seek expansion capital on their own, rather than getting it all from the government. In a region where long-term energy policy traditionally has been shaped largely by immediate political objectives, the reforms now taking hold will better equip the region to meet the energy challenges of the 1990s, Dang says.

  13. Instruction Scheduling Across Control Flow

    Directory of Open Access Journals (Sweden)

    Martin Charles Golumbic

    1993-01-01

    Full Text Available Instruction scheduling algorithms are used in compilers to reduce run-time delays for the compiled code by the reordering or transformation of program statements, usually at the intermediate language or assembly code level. Considerable research has been carried out on scheduling code within the scope of basic blocks, i.e., straight line sections of code, and very effective basic block schedulers are now included in most modern compilers and especially for pipeline processors. In previous work Golumbic and Rainis: IBM J. Res. Dev., Vol. 34, pp.93–97, 1990, we presented code replication techniques for scheduling beyond the scope of basic blocks that provide reasonable improvements of running time of the compiled code, but which still leaves room for further improvement. In this article we present a new method for scheduling beyond basic blocks called SHACOOF. This new technique takes advantage of a conventional, high quality basic block scheduler by first suppressing selected subsequences of instructions and then scheduling the modified sequence of instructions using the basic block scheduler. A candidate subsequence for suppression can be found by identifying a region of a program control flow graph, called an S-region, which has a unique entry and a unique exit and meets predetermined criteria. This enables scheduling of a sequence of instructions beyond basic block boundaries, with only minimal changes to an existing compiler, by identifying beneficial opportunities to cover delays that would otherwise have been beyond its scope.

  14. Nontraditional work schedules for pharmacists.

    Science.gov (United States)

    Mahaney, Lynnae; Sanborn, Michael; Alexander, Emily

    2008-11-15

    Nontraditional work schedules for pharmacists at three institutions are described. The demand for pharmacists and health care in general continues to increase, yet significant material changes are occurring in the pharmacy work force. These changing demographics, coupled with historical vacancy rates and turnover trends for pharmacy staff, require an increased emphasis on workplace changes that can improve staff recruitment and retention. At William S. Middleton Memorial Veterans Affairs Hospital in Madison, Wisconsin, creative pharmacist work schedules and roles are now mainstays to the recruitment and retention of staff. The major challenge that such scheduling presents is the 8 hours needed to prepare a six-week schedule. Baylor Medical Center at Grapevine in Dallas, Texas, has a total of 45 pharmacy employees, and slightly less than half of the 24.5 full-time-equivalent staff work full-time, with most preferring to work one, two, or three days per week. As long as the coverage needs of the facility are met, Envision Telepharmacy in Alpine, Texas, allows almost any scheduling arrangement preferred by individual pharmacists or the pharmacist group covering the facility. Staffing involves a great variety of shift lengths and intervals, with shifts ranging from 2 to 10 hours. Pharmacy leaders must be increasingly aware of opportunities to provide staff with unique scheduling and operational enhancements that can provide for a better work-life balance. Compressed workweeks, job-sharing, and team scheduling were the most common types of alternative work schedules implemented at three different institutions.

  15. Bilevel Fuzzy Chance Constrained Hospital Outpatient Appointment Scheduling Model

    Directory of Open Access Journals (Sweden)

    Xiaoyang Zhou

    2016-01-01

    Full Text Available Hospital outpatient departments operate by selling fixed period appointments for different treatments. The challenge being faced is to improve profit by determining the mix of full time and part time doctors and allocating appointments (which involves scheduling a combination of doctors, patients, and treatments to a time period in a department optimally. In this paper, a bilevel fuzzy chance constrained model is developed to solve the hospital outpatient appointment scheduling problem based on revenue management. In the model, the hospital, the leader in the hierarchy, decides the mix of the hired full time and part time doctors to maximize the total profit; each department, the follower in the hierarchy, makes the decision of the appointment scheduling to maximize its own profit while simultaneously minimizing surplus capacity. Doctor wage and demand are considered as fuzzy variables to better describe the real-life situation. Then we use chance operator to handle the model with fuzzy parameters and equivalently transform the appointment scheduling model into a crisp model. Moreover, interactive algorithm based on satisfaction is employed to convert the bilevel programming into a single level programming, in order to make it solvable. Finally, the numerical experiments were executed to demonstrate the efficiency and effectiveness of the proposed approaches.

  16. Scheduling the Secondary School.

    Science.gov (United States)

    Dempsey, Richard A.; Traverso, Henry P.

    This "how-to-do-it" manual on the intricacies of school scheduling offers both technical information and common sense advice about the process of secondary school scheduling. The first of six chapters provides an overview of scheduling; chapter 2 examines specific considerations for scheduling; chapter 3 surveys the scheduling models and their…

  17. Analysis of the gas gushing source and proportion in the full-seam mining face%一次采全高工作面瓦斯涌出来源及构成比例分析

    Institute of Scientific and Technical Information of China (English)

    丁楠

    2015-01-01

    Based on the theory of the comprehensive mechanized coal mining and gas migration, through the analysis of the gas gushing source and proportion in the full-seam mining face of Duanshi coal mine, divide the gas source into the gas from coal wall, the gas from cutting coal, the gas from gob and the gas from adjacent seam,To provide basic data for gas management, guarantee the safe production of coal mining working face.%基于综合机械化采煤的规律和瓦斯运移理论,通过对端氏煤矿一次采全高某工作面的瓦斯来源及构成比例分析,把瓦斯涌出源分为煤壁的瓦斯涌出、采落煤的瓦斯涌出、采空区的瓦斯涌出和上、下邻近层的瓦斯涌出四部分。为以后瓦斯治理提供了基础数据,保证了采煤工作面的安全生产。

  18. 综采工作面高压自动喷雾降尘技术研究%Research of the automatic high-pressure dust-settling technology by spray for full-mechanized mining faces

    Institute of Scientific and Technical Information of China (English)

    马胜利; 李高峰

    2009-01-01

    In order to effectively reduce the dust concentration in the full-mechanized mining face, the paper designs a set of the automatic inter-frame high-pressure spaying system by high-pressure dust-setting analysis and combination with the automatics. It not only realizes the automatic efficient spray and promotes the dust-setting efficiency,, but also reduces the labor intensity and improves the working conditions.%为了有效降低综采工作面的粉尘浓度,采用高压喷雾降尘机理分析,并结合自动化技术,设计了一套架间高压自动喷雾系统.它不仅实现了高效自动喷雾,提高降尘效率,而且大大降低了工人的劳动强度,改善了工作面的环境.

  19. Application of full-face needle-beam steel formwork in the concrete lining of tunnel%小浪底工程明流洞气减蚀设计研究

    Institute of Scientific and Technical Information of China (English)

    朱春英; 凌霄; 刘杰; 李刚

    2001-01-01

    小浪底枢纽明流洞水头高、流速大,存在空蚀的可能性。为了减免空蚀对建筑物的危害,根据类似工程的经验,结合小浪底工程明流洞的具体情况, 采用了掺气减蚀措施。设计过程中对掺气坎的形式、布置、保护长度等进行了充分的论证,取得了很好的效果%The sections of No.3 and No.4 tunnels for intake head of Water Diversion Project From Yellow River To Shanxi Province are designed as circular section. Its excavation diameter is 6.4 m and the actual diameter after lining is 5.6 m. The total length of No.3 tunnel is 758.3 m, constructed by the steel formwork jack plane. The total length of No.4 tunnel is 1700 m, constructed by full-face needle-beam steel formwork. Analyzed and compared the concrete construction of such two tunnels, it is considered that the full-face needle-beam steel formwork construction has the advantages of low disturbance, good concrete appearance, high utilization rate of resources and labors, low investment and high progress. But its lump-sum investment is much larger than that of steel formwork jack plane, so that it is suitable to the concrete lining of long and fixed-section tunnel.

  20. Comparison of face Recognition Algorithms on Dummy Faces

    Directory of Open Access Journals (Sweden)

    Aruni Singh

    2012-09-01

    Full Text Available In the age of rising crime face recognition is enormously important in the contexts of computer vision, psychology, surveillance, fraud detection, pattern recognition, neural network, content based video processing, etc. Face is a non intrusive strong biometrics for identification and hence criminals always try to hide their facial organs by different artificial means such as plastic surgery, disguise and dummy. The availability of a comprehensive face database is crucial to test the performance of these face recognition algorithms. However, while existing publicly-available face databases contain face images with a wide variety of poses, illumination, gestures and face occlusions but there is no dummy face database is available in public domain. The contributions of this research paper are: i Preparation of dummy face database of 110 subjects ii Comparison of some texture based, feature based and holistic face recognition algorithms on that dummy face database, iii Critical analysis of these types of algorithms on dummy face database.

  1. Face pain

    Science.gov (United States)

    ... begin in other places in the body. Abscessed tooth (ongoing throbbing pain on one side of the lower face that ... face, and aggravated by eating. Call a dentist. Pain is persistent, ... by other unexplained symptoms. Call your primary provider.

  2. List scheduling revisited

    NARCIS (Netherlands)

    Schutten, Johannes M.J.

    1996-01-01

    We consider the problem of scheduling n jobs on m identical parallel machines to minimize a regular cost function. The standard list scheduling algorithm converts a list into a feasible schedule by focusing on the job start times. We prove that list schedules are dominant for this type of problem.

  3. Dynamic Fractional Resource Scheduling vs. Batch Scheduling

    CERN Document Server

    Casanova, Henri; Vivien, Frédéric

    2011-01-01

    We propose a novel job scheduling approach for homogeneous cluster computing platforms. Its key feature is the use of virtual machine technology to share fractional node resources in a precise and controlled manner. Other VM-based scheduling approaches have focused primarily on technical issues or on extensions to existing batch scheduling systems, while we take a more aggressive approach and seek to find heuristics that maximize an objective metric correlated with job performance. We derive absolute performance bounds and develop algorithms for the online, non-clairvoyant version of our scheduling problem. We further evaluate these algorithms in simulation against both synthetic and real-world HPC workloads and compare our algorithms to standard batch scheduling approaches. We find that our approach improves over batch scheduling by orders of magnitude in terms of job stretch, while leading to comparable or better resource utilization. Our results demonstrate that virtualization technology coupled with light...

  4. About (above a face - a face

    Directory of Open Access Journals (Sweden)

    Diego Cervelin

    2009-07-01

    Full Text Available This text intents to unfold some considerations regardind the perception of the image of the Lóri’s face, from the book Uma aprendizagem ou o livro dos prazeres, published by Clarice Lispector in 1969. For that, will be studied the politicians devices who involve the apprehension of the face as a qualifying of the subject and, at the same time, its relation with the lenguage.

  5. Simplified Scheduling for Underwater Acoustic Networks

    Directory of Open Access Journals (Sweden)

    Wouter van Kleunen

    2013-01-01

    Full Text Available The acoustic propagation speed under water poses significant challenges to the design of underwater sensor networks and their medium access control protocols. Similar to the air, scheduling transmissions under water has significant impact on throughput, energy consumption, and reliability. In this paper we present an extended set of simplified scheduling constraints which allows easy scheduling of underwater acoustic communication. We also present two algorithms for scheduling communications, i.e. a centralized scheduling approach and a distributed scheduling approach. The centralized approach achieves the highest throughput while the distributed approach aims to minimize the computation and communication overhead. We further show how the centralized scheduling approach can be extended with transmission dependencies to reduce the end-to-end delay of packets. We evaluate the performance of the centralized and distributed scheduling approaches using simulation. The centralized approach outperforms the distributed approach in terms of throughput, however we also show the distributed approach has significant benefits in terms of communication and computational overhead required to setup the schedule. We propose a novel way of estimating the performance of scheduling approaches using the ratio of modulation time and propagation delay. We show the performance is largely dictated by this ratio, although the number of links to be scheduled also has a minor impact on the performance.

  6. Two-Dimensional Scheduling: A Review

    Directory of Open Access Journals (Sweden)

    Zhuolei Xiao

    2013-07-01

    Full Text Available In this study, we present a literature review, classification schemes and analysis of methodology for scheduling problems on Batch Processing machine (BP with both processing time and job size constraints which is also regarded as Two-Dimensional (TD scheduling. Special attention is given to scheduling problems with non-identical job sizes and processing times, with details of the basic algorithms and other significant results.

  7. 行星刀盘方顶管全断面切削混凝土试验研究%Experimental Study on Full-Face Concrete Cutting by a Rectangular Pipe-jacking Machine with a Planetary Cutterhead

    Institute of Scientific and Technical Information of China (English)

    魏林春

    2014-01-01

    The mining method with soil reinforcement is now mainly adopted in the construction of cross passages of shield tunnels, which is characterized by high risk and complex working conditions. In this paper, based on the adoption of a specially developed rectangular pipe-jacking machine with a planetary cutterhead, full-face cutting tests are carried out on concrete samples of different strength grades. Research on cutting-tool selection and layout, as well as the machinability of pipe-jacking with a planetary cutterhead, are undertaken, providing a technical reference for future cross-passage construction in shield tunnels adopting pipe-jacking to cut concrete composite segments, thereby refraining from exposing the reinforced soil mass due to segment removal, and greatly reducing the construction risk.%目前盾构隧道联络通道主要采用土体加固暗挖法进行施工,但在复杂工况环境下仍存在极大施工风险。文章通过采用专门研制的行星刀盘方顶管对不同强度等级的混凝土试块进行全断面切削试验,对顶管刀具选型及布置、行星刀盘顶管切削性能等进行了研究,可为今后采用顶管法直接切削混凝土复合管片的盾构隧道联络通道的施工提供相应的技术储备,避免移除管片暴露加固土体,以大大降低盾构隧道联络通道施工风险。

  8. Multiuser switched diversity scheduling schemes

    KAUST Repository

    Shaqfeh, Mohammad

    2012-09-01

    Multiuser switched-diversity scheduling schemes were recently proposed in order to overcome the heavy feedback requirements of conventional opportunistic scheduling schemes by applying a threshold-based, distributed, and ordered scheduling mechanism. The main idea behind these schemes is that slight reduction in the prospected multiuser diversity gains is an acceptable trade-off for great savings in terms of required channel-state-information feedback messages. In this work, we characterize the achievable rate region of multiuser switched diversity systems and compare it with the rate region of full feedback multiuser diversity systems. We propose also a novel proportional fair multiuser switched-based scheduling scheme and we demonstrate that it can be optimized using a practical and distributed method to obtain the feedback thresholds. We finally demonstrate by numerical examples that switched-diversity scheduling schemes operate within 0.3 bits/sec/Hz from the ultimate network capacity of full feedback systems in Rayleigh fading conditions. © 2012 IEEE.

  9. Immunization Schedules for Adults

    Science.gov (United States)

    ... Everyone: Easy-to-read Schedules Infants and Children Preteens and Teens Adults Display Immunization Schedules and Quiz ... file Microsoft Word file Microsoft Excel file Audio/Video file Apple Quicktime file RealPlayer file Text file ...

  10. Instant Childhood Immunization Schedule

    Science.gov (United States)

    ... Everyone: Easy-to-read Schedules Infants and Children Preteens and Teens Adults Display Immunization Schedules and Quiz ... file Microsoft Word file Microsoft Excel file Audio/Video file Apple Quicktime file RealPlayer file Text file ...

  11. School Construction Scheduling.

    Science.gov (United States)

    Delaney, J. B.

    1983-01-01

    Explains that favorable market and working conditions influence the scheduling of school construction projects. Facility planners, architects, and contractors are advised to develop a realistic time schedule for the entire project. (MLF)

  12. Reinforcement learning in scheduling

    Science.gov (United States)

    Dietterich, Tom G.; Ok, Dokyeong; Zhang, Wei; Tadepalli, Prasad

    1994-01-01

    The goal of this research is to apply reinforcement learning methods to real-world problems like scheduling. In this preliminary paper, we show that learning to solve scheduling problems such as the Space Shuttle Payload Processing and the Automatic Guided Vehicle (AGV) scheduling can be usefully studied in the reinforcement learning framework. We discuss some of the special challenges posed by the scheduling domain to these methods and propose some possible solutions we plan to implement.

  13. Schedule of factors influencing access to psychiatric treatment in persons with schizophrenia: Validity and pilot testing

    Directory of Open Access Journals (Sweden)

    K Shanivaram Reddy

    2013-01-01

    Full Text Available Background : A substantial proportion of patients with severe mental disorders remain untreated in India. Qualitative research has highlighted the complex interplay of multiple factors that preclude schizophrenia patients in rural Indian settings from accessing treatment. Aims: (a To establish the face and content validities of an interview schedule titled "Schedule of Factors Influencing Access (SOFIAc to Psychiatric Treatment in Persons with Schizophrenia," which comprehensively assesses the factors that prevent schizophrenia patients from accessing psychiatric treatment. (b To assess the feasibility of its administration. Materials and Methods: SOFIAc contains 15 items. This schedule involves three phases of interviewing patients and family members. This was given to 12 experts. They used Likert scales (1=not at all satisfactory to 5=very much satisfactory to rate each item of the schedule. In addition, the experts rated (the same way as above the following five dimensions of the schedule (as a whole separately: A (comprehensiveness of the factors, B (scoring system, C (interviewing method, D (general instructions given to the raters, E (overall schedule. Later on, 10 persons with schizophrenia were interviewed with SOFIAc to test the feasibility of administration. Results: Thirteen items were rated as either satisfactory (score=4 or very much satisfactory (score=5 by all 12 experts; remaining two were rated as 4 or 5 by 11 experts. Regarding comprehensiveness of the factors, scoring methods and general instructions given to the interviewers, all provided scores >4; regarding the method of interviewing, 11 provided the score of >4; with regard to overall interview schedule, all experts provided scores >4. Pilot testing revealed that it took 60 min to administer SOFIAc. Conclusion: SOFIAc has satisfactory face and content validities. It is also feasible to administer SOFIAc.

  14. A Forager Bee’s Intelligence Inspired Dynamic Queue Scheduling for the Internet Traffic

    Directory of Open Access Journals (Sweden)

    M. A. Bhagyaveni

    2012-01-01

    Full Text Available Problem statement: In the present evolution of large scale internet communication, per flow control scheme faces scalability issue due to tremendous number of flows. The aggregation based approaches such as differentiated architecture relieve the storage of state of flows in core router. TCP is the dominating protocol that carries majority of the total internet traffic. Recent internet traffic measurement shows most of the TCP flows are short lived. The performance improvement in the internet traffic can be achieved by the advantages of scheduling algorithms to favor short TCP flows first However long TCP flows competing against short TCP flows starve at some point. Approach: In this study we propose aggregation based scheduling algorithm namely Guaranteed Dynamic Queue Scheduling (G-DQS that estimates the available bandwidth of the network using the forager bee’s intelligence for providing guaranteed throughput. In addition, G-DQS algorithm is proposed to favor the short TCP flows without penalizing the performance of long flows using dynamic scheduling ratio. Results: Simulation of the proposed scheduling method show that mean transmission time of flows and packet loss significantly decrease in comparison with FIFO and RuN2C. Conclusion: Proposed forager bee’s intelligence inspired scheduling approach achieves the guaranteed throughput in the large scale network.

  15. Scheduling with Time Lags

    NARCIS (Netherlands)

    X. Zhang (Xiandong)

    2010-01-01

    textabstractScheduling is essential when activities need to be allocated to scarce resources over time. Motivated by the problem of scheduling barges along container terminals in the Port of Rotterdam, this thesis designs and analyzes algorithms for various on-line and off-line scheduling problems

  16. Parallel scheduling algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Dekel, E.; Sahni, S.

    1983-01-01

    Parallel algorithms are given for scheduling problems such as scheduling to minimize the number of tardy jobs, job sequencing with deadlines, scheduling to minimize earliness and tardiness penalties, channel assignment, and minimizing the mean finish time. The shared memory model of parallel computers is used to obtain fast algorithms. 26 references.

  17. An Improved Round Robin Scheduling Algorithm for CPU scheduling

    Directory of Open Access Journals (Sweden)

    Rakesh Kumar yadav

    2010-07-01

    Full Text Available There are many functions which are provided by operating system like process management, memory management, file management, input/outputmanagement, networking, protection system and command interpreter system. In these functions, the process management is most important function because operating system is a system program that means at the runtime process interact with hardware. Therefore, we can say that for improving the efficiency of a CPU we need to manage all process. For managing the process we use various types scheduling algorithm. There are many algorithm are available for CPU scheduling. But all algorithms have its own deficiency and limitations. In this paper, I proposed a new approach for round robin scheduling algorithm which helps to improve the efficiency of CPU.

  18. An Optimized Round Robin Scheduling Algorithm for CPU Scheduling

    Directory of Open Access Journals (Sweden)

    Ajit Singh

    2010-10-01

    Full Text Available The main objective of this paper is to develop a new approach for round robin scheduling which help to improve the CPU efficiency in real time and time sharing operating system. There are many algorithms available for CPU scheduling. But we cannot implemented in real time operating system because of high context switch rates, large waiting time, large response time, large trn around time and less throughput. The proposed algorithm improves all the drawback of simple round robin architecture. The author have also given comparative analysis of proposed with simple round robin scheduling algorithm. Therefore, the author strongly feel that the proposed architecture solves all the problem encountered in simple round robin architecture by decreasing the performance parameters to desirable extent and thereby increasing the system throughput.

  19. Network-Aware HEFT Scheduling for Grid

    Directory of Open Access Journals (Sweden)

    Muhammad Murtaza Yousaf

    2014-01-01

    Full Text Available We present a network-aware HEFT. The original HEFT does not take care of parallel network flows while designing its schedule for a computational environment where computing nodes are physically at distant locations. In the proposed mechanism, such data transfers are stretched to their realistic completion time. A HEFT schedule with stretched data transfers exhibits the realistic makespan of the schedule. It is shown how misleading a schedule can be if the impact of parallel data transfers that share a bottleneck is ignored. A network-aware HEFT can be used to yield a benefit for Grid applications.

  20. GRID SCHEDULING USING ENHANCED ANT COLONY ALGORITHM

    Directory of Open Access Journals (Sweden)

    P. Mathiyalagan

    2010-10-01

    Full Text Available Grid computing is a high performance computing used to solve larger scale computational demands. Task scheduling is a major issue in grid computing systems. Scheduling of tasks is the NP hard problem. The heuristic approach provides optimal solution for NP hard problems .The ant colony algorithm provides optimal solution. The existing ant colony algorithm takes more time to schedule the tasks. In this paper ant colony algorithm improved by enhancing pheromone updating rule such that it schedules the tasks efficiently and better resource utilization. The simulation results prove that proposed method reduces the execution time of tasks compared to existing ant colony algorithm.

  1. Scheduling By Using Fuzzy Logic in Manufacturing

    Directory of Open Access Journals (Sweden)

    Miss. Ashwini. A. Mate

    2014-07-01

    Full Text Available This paper represents the scheduling process in furniture manufacturing unit. It gives the fuzzy logic application in flexible manufacturing system. Flexible manufacturing systems are production system in furniture manufacturing unit. FMS consist of same multipurpose numerically controlled machines. Here in this project the scheduling has been done in FMS by using fuzzy logic tool in Matlab software. The fuzzy logic based scheduling model in this paper will deals with the job and best alternative route selection with multi-criteria of machine. Here two criteria for job and sequencing and routing with rules. This model is applicable to the scheduling of any manufacturing industry.

  2. Flexible Personnel Scheduling in the Parallel Environment

    Institute of Scientific and Technical Information of China (English)

    XU Ben-zhu; ZHANG Xing-ling

    2014-01-01

    In the view of staff shortages and the huge inventory of products in the current market, we put forward a personnel scheduling model in the target of closing to the delivery date considering the parallelism. Then we designed a scheduling algorithm based on genetic algorithm and proposed a flexible parallel decoding method which take full use of the personal capacity. Case study results indicate that the flexible personnel scheduling considering the order-shop scheduling, machine automatic capabilities and personnel flexible in the target of closing to the delivery date optimize the allocation of human resources, then maximize the efficiency.

  3. Priority Task Scheduling Strategy for Heterogeneous Multi-Datacenters in Cloud Computing

    Directory of Open Access Journals (Sweden)

    Naoufal Er-raji

    2017-02-01

    Full Text Available With the rapid development in science and technology, cloud computing has emerged to be widely adopted in several IT (Information Technology areas. It allows for the companies as well as researchers to use the computing resources as a service over a network as internet without owning the infrastructure. However, Due to increasing demand of cloud computing, the growing number of tasks affects the system load and performance. Scheduling of multitasks with respect SLA (Service Level Agreement can face serious challenges. In order to overcome this problem as well as provide better quality of service, the tasks have to be scheduled in optimal way. In this paper, we address the problem of the priority task scheduling through proposing a global strategy over distributed data-center in cloud computing basing on three parameters: tasks deadline, task age and the task length.

  4. Nurse Scheduling Using Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Komgrit Leksakul

    2014-01-01

    Full Text Available This study applied engineering techniques to develop a nurse scheduling model that, while maintaining the highest level of service, simultaneously minimized hospital-staffing costs and equitably distributed overtime pay. In the mathematical model, the objective function was the sum of the overtime payment to all nurses and the standard deviation of the total overtime payment that each nurse received. Input data distributions were analyzed in order to formulate a simulation model to determine the optimal demand for nurses that met the hospital’s service standards. To obtain the optimal nurse schedule with the number of nurses acquired from the simulation model, we proposed a genetic algorithm (GA with two-point crossover and random mutation. After running the algorithm, we compared the expenses and number of nurses between the existing and our proposed nurse schedules. For January 2013, the nurse schedule obtained by GA could save 12% in staffing expenses per month and 13% in number of nurses when compare with the existing schedule, while more equitably distributing overtime pay between all nurses.

  5. DSN Scheduling Engine

    Science.gov (United States)

    Clement, Bradley; Johnston, Mark; Wax, Allan; Chouinard, Caroline

    2008-01-01

    The DSN (Deep Space Network) Scheduling Engine targets all space missions that use DSN services. It allows clients to issue scheduling, conflict identification, conflict resolution, and status requests in XML over a Java Message Service interface. The scheduling requests may include new requirements that represent a set of tracks to be scheduled under some constraints. This program uses a heuristic local search to schedule a variety of schedule requirements, and is being infused into the Service Scheduling Assembly, a mixed-initiative scheduling application. The engine resolves conflicting schedules of resource allocation according to a range of existing and possible requirement specifications, including optional antennas; start of track and track duration ranges; periodic tracks; locks on track start, duration, and allocated antenna; MSPA (multiple spacecraft per aperture); arraying/VLBI (very long baseline interferometry)/delta DOR (differential one-way ranging); continuous tracks; segmented tracks; gap-to-track ratio; and override or block-out of requirements. The scheduling models now include conflict identification for SOA(start of activity), BOT (beginning of track), RFI (radio frequency interference), and equipment constraints. This software will search through all possible allocations while providing a best-effort solution at any time. The engine reschedules to accommodate individual emergency tracks in 0.2 second, and emergency antenna downtime in 0.2 second. The software handles doubling of one mission's track requests over one week (to 42 total) in 2.7 seconds. Further tests will be performed in the context of actual schedules.

  6. Decoding of faces and face components in face-sensitive human visual cortex

    Directory of Open Access Journals (Sweden)

    David F Nichols

    2010-07-01

    Full Text Available A great challenge to the field of visual neuroscience is to understand how faces are encoded and represented within the human brain. Here we show evidence from functional magnetic resonance imaging (fMRI for spatially distributed processing of the whole face and its components in face-sensitive human visual cortex. We used multi-class linear pattern classifiers constructed with a leave-one-scan-out verification procedure to discriminate brain activation patterns elicited by whole faces, the internal features alone, and the external head outline alone. Furthermore, our results suggest that whole faces are represented disproportionately in the fusiform cortex (FFA whereas the building blocks of faces are represented disproportionately in occipitotemporal cortex (OFA. Faces and face components may therefore be organized with functional clustering within both the FFA and OFA, but with specialization for face components in the OFA and the whole face in the FFA.

  7. Face Forward

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    Last November, surgeons in France successfully performed the world's first face transplant surgery. Ten days later, Chen Huanran in Beijing began soliciting patients who were ready to accept a face transplant, searching for China's first such patient through an advertisement on his website and other channels. Chen, chief orthopedic surgeon at the Plastic Surgery Hospital under the Chinese Academy of Medical Sciences, has conducted more than 300 transsexual operations and was considered one of the top com...

  8. Security and Fault aware Scheduling in Computational Grid

    Directory of Open Access Journals (Sweden)

    Mansour Noshfar

    2013-09-01

    Full Text Available Grid Computation is an issue that has received much attention from researchers in recent years. Its aim is to use the computational power of idle resources which have been distributed in different places and under different policies and security conditions. Therefore, one of the challenges facing this technology is the issue of security of jobs and the computational sites. Distributed jobs in computational sites may become problematic due to some infections and malwares. As a result, the risks and security levels should be considered; computing resources must be evaluated by resource owners for task execution, and scheduling should be based on requested users' security levels. This is the matter that has been ignored in the previous scheduling algorithms, which leads to waste of time and overhead. In this paper, a new method based on a combination of Genetic and Imperialism Competitive algorithm is presented to implement a security-aware scheduling and failure algorithm. The proposed method is compared with the previous methods such as Min-Min, Suffrage and genetic algorithms, has become near optimal and led to reduce the overhead caused by violation of security conditions. Additionally, Due to the usage of fault tolerance mechanisms, the performance of these mechanisms has been evaluated and it was found that the replication mechanism had the lowest failure rate and the check point mechanism had a direct effect on the performance and it should be fully supervised and be smart.

  9. Optimal Workflow Scheduling in Critical Infrastructure Systems with Neural Networks

    Directory of Open Access Journals (Sweden)

    S. Vukmirović

    2012-04-01

    Full Text Available Critical infrastructure systems (CISs, such as power grids, transportation systems, communication networks and water systems are the backbone of a country’s national security and industrial prosperity. These CISs execute large numbers of workflows with very high resource requirements that can span through different systems and last for a long time. The proper functioning and synchronization of these workflows is essential since humanity’s well-being is connected to it. Because of this, the challenge of ensuring availability and reliability of these services in the face of a broad range of operating conditions is very complicated. This paper proposes an architecture which dynamically executes a scheduling algorithm using feedback about the current status of CIS nodes. Different artificial neural networks (ANNs were created in order to solve the scheduling problem. Their performances were compared and as the main result of this paper, an optimal ANN architecture for workflow scheduling in CISs is proposed. A case study is shown for a meter data management system with measurements from a power distribution management system in Serbia. Performance tests show that significant improvement of the overall execution time can be achieved by ANNs.

  10. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    be that the objects routed have an availability time window and a delivery time window or that locations on the path have a service time window. When routing moving transportation objects such as vehicles and vessels schedules are made in connection with the routing. Such schedules represent the time for the presence...... to a destination on a predefined network, the routing and scheduling of vessels in a liner shipping network given a demand forecast to be covered, the routing of manpower and vehicles transporting disabled passengers in an airport and the vehicle routing with time windows where one version studied includes edge...... of a connection between two locations. This could be an urban bus schedule where busses are routed and this routing creates a bus schedule which the passengers between locations use. In this thesis various routing and scheduling problems will be presented. The topics covered will be routing from an origin...

  11. Handbook of Face Recognition

    CERN Document Server

    Li, Stan Z

    2011-01-01

    This highly anticipated new edition provides a comprehensive account of face recognition research and technology, spanning the full range of topics needed for designing operational face recognition systems. After a thorough introductory chapter, each of the following chapters focus on a specific topic, reviewing background information, up-to-date techniques, and recent results, as well as offering challenges and future directions. Features: fully updated, revised and expanded, covering the entire spectrum of concepts, methods, and algorithms for automated face detection and recognition systems

  12. Analyzing Job Aware Scheduling Algorithm in Hadoop for Heterogeneous Cluster

    Directory of Open Access Journals (Sweden)

    Mayuri A Mehta

    2015-12-01

    Full Text Available A scheduling algorithm is required to efficiently manage cluster resources in a Hadoop cluster, thereby to increase resource utilization and to reduce response time. The job aware scheduling algorithm schedules non-local map tasks of jobs based on job execution time, earliest deadline first or workload of the job. In this paper, we present the performance evaluation of the job aware scheduling algorithm using MapReduce WordCount benchmark. The experimental results are compared with matchmaking scheduling algorithm. The results show that the job aware scheduling algorithm reduces average waiting time and memory wastage considerably as compared to matchmaking algorithm.

  13. Widening the Schedulability Hierarchical Scheduling Systems

    DEFF Research Database (Denmark)

    Boudjadar, Jalil; David, Alexandre; Kim, Jin Hyun

    2014-01-01

    the supply of resources in each component. We specifically investigate two different techniques to widen the set of provably schedulable systems: 1) a new supplier model; 2) restricting the potential task offsets. We also provide a way to estimate the minimum resource supply (budget) that a component...

  14. Group Elevator Peak Scheduling Based on Robust Optimization Model

    Directory of Open Access Journals (Sweden)

    ZHANG, J.

    2013-08-01

    Full Text Available Scheduling of Elevator Group Control System (EGCS is a typical combinatorial optimization problem. Uncertain group scheduling under peak traffic flows has become a research focus and difficulty recently. RO (Robust Optimization method is a novel and effective way to deal with uncertain scheduling problem. In this paper, a peak scheduling method based on RO model for multi-elevator system is proposed. The method is immune to the uncertainty of peak traffic flows, optimal scheduling is realized without getting exact numbers of each calling floor's waiting passengers. Specifically, energy-saving oriented multi-objective scheduling price is proposed, RO uncertain peak scheduling model is built to minimize the price. Because RO uncertain model could not be solved directly, RO uncertain model is transformed to RO certain model by elevator scheduling robust counterparts. Because solution space of elevator scheduling is enormous, to solve RO certain model in short time, ant colony solving algorithm for elevator scheduling is proposed. Based on the algorithm, optimal scheduling solutions are found quickly, and group elevators are scheduled according to the solutions. Simulation results show the method could improve scheduling performances effectively in peak pattern. Group elevators' efficient operation is realized by the RO scheduling method.

  15. Interval Scheduling: A Survey

    NARCIS (Netherlands)

    Kolen, A.W.J.; Lenstra, J.K.; Papadimitriou, C.H.; Spieksma, F.C.R.

    2007-01-01

    In interval scheduling, not only the processing times of the jobs but also their starting times are given. This article surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability o

  16. Scheduling: Seven Period Day

    Science.gov (United States)

    Williamson, Ronald

    2010-01-01

    Driven by stable or declining financial resources many school districts are considering the costs and benefits of a seven-period day. While there is limited evidence that any particular scheduling model has a greater impact on student learning than any other, it is clear that the school schedule is a tool that can significantly impact teacher…

  17. Downlink Scheduling in Long Term Evolution

    Directory of Open Access Journals (Sweden)

    Anwar Hossain

    2015-06-01

    Full Text Available This is an investigated research article on resource block scheduling of Long Term Evolution (LTE. LTE is one of the evolutions of the Universal Mobile Telecommunication System (UMTS. It provides internet access to mobile users through smart phone, laptop and other android devices. LTE offers a high speed data and multimedia services. It supports data rates up to 100 Mbps in the downlink and 50 Mbps in the uplink transmission. Our research investigation was aim to the downlink scheduling. We have considered The Best CQI scheduling algorithm and the Round Robin scheduling algorithm. The implementation, analysis and comparison of these scheduling algorithms have been performed through MATLAB simulator. We have analyzed the impact of the scheduling schemes on the throughput and the fairness of both scheduling schemes. Here we have proposed a new scheduling algorithm that achieves a compromise between the throughput and the fairness. Orthogonal Frequency Division Multiplexing (OFDM has been adopted as the downlink transmission scheme. We have considered the impact of the channel delay on the throughput. In addition, MIMO transceiver systems have been implemented to increase the throughput

  18. Reading faces and Facing words

    DEFF Research Database (Denmark)

    Robotham, Julia Emma; Lindegaard, Martin Weis; Delfi, Tzvetelina Shentova

    It has long been argued that perceptual processing of faces and words is largely independent, highly specialised and strongly lateralised. Studies of patients with either pure alexia or prosopagnosia have strongly contributed to this view. The aim of our study was to investigate how visual...

  19. Reading faces and Facing words

    DEFF Research Database (Denmark)

    Robotham, Julia Emma; Lindegaard, Martin Weis; Delfi, Tzvetelina Shentova

    performed within normal range on at least one test of visual categorisation, strongly suggesting that their abnormal performance with words and faces does not represent a generalised visuo-perceptual deficit. Our results suggest that posterior areas in both hemispheres may be critical for both reading...

  20. Quantified Faces

    DEFF Research Database (Denmark)

    Sørensen, Mette-Marie Zacher

    2016-01-01

    Abstract: The article presents three contemporary art projects that, in various ways, thematise questions regarding numerical representation of the human face in relation to the identification of faces, for example through the use of biometric video analysis software, or DNA technology. The Dutch...... and critically examine bias in surveillance technologies, as well as scientific investigations, regarding the stereotyping mode of the human gaze. The American artist Heather Dewey-Hagborg creates three-dimensional portraits of persons she has “identified” from their garbage. Her project from 2013 entitled....... The three works are analysed with perspectives to historical physiognomy and Francis Galton's composite portraits from the 1800s. It is argued that, rather than being a statistical compression like the historical composites, contemporary statistical visual portraits (composites) are irreversible...

  1. Downlink Scheduling for Multiclass Traffic in LTE

    Directory of Open Access Journals (Sweden)

    Madan Ritesh

    2009-01-01

    Full Text Available We present a design of a complete and practical scheduler for the 3GPP Long Term Evolution (LTE downlink by integrating recent results on resource allocation, fast computational algorithms, and scheduling. Our scheduler has low computational complexity. We define the computational architecture and describe the exact computations that need to be done at each time step (1 milliseconds. Our computational framework is very general, and can be used to implement a wide variety of scheduling rules. For LTE, we provide quantitative performance results for our scheduler for full buffer, streaming video (with loose delay constraints, and live video (with tight delay constraints. Simulations are performed by selectively abstracting the PHY layer, accurately modeling the MAC layer, and following established network evaluation methods. The numerical results demonstrate that queue- and channel-aware QoS schedulers can and should be used in an LTE downlink to offer QoS to a diverse mix of traffic, including delay-sensitive flows. Through these results and via theoretical analysis, we illustrate the various design tradeoffs that need to be made in the selection of a specific queue-and-channel-aware scheduling policy. Moreover, the numerical results show that in many scenarios strict prioritization across traffic classes is suboptimal.

  2. NASA Schedule Management Handbook

    Science.gov (United States)

    2011-01-01

    The purpose of schedule management is to provide the framework for time-phasing, resource planning, coordination, and communicating the necessary tasks within a work effort. The intent is to improve schedule management by providing recommended concepts, processes, and techniques used within the Agency and private industry. The intended function of this handbook is two-fold: first, to provide guidance for meeting the scheduling requirements contained in NPR 7120.5, NASA Space Flight Program and Project Management Requirements, NPR 7120.7, NASA Information Technology and Institutional Infrastructure Program and Project Requirements, NPR 7120.8, NASA Research and Technology Program and Project Management Requirements, and NPD 1000.5, Policy for NASA Acquisition. The second function is to describe the schedule management approach and the recommended best practices for carrying out this project control function. With regards to the above project management requirements documents, it should be noted that those space flight projects previously established and approved under the guidance of prior versions of NPR 7120.5 will continue to comply with those requirements until project completion has been achieved. This handbook will be updated as needed, to enhance efficient and effective schedule management across the Agency. It is acknowledged that most, if not all, external organizations participating in NASA programs/projects will have their own internal schedule management documents. Issues that arise from conflicting schedule guidance will be resolved on a case by case basis as contracts and partnering relationships are established. It is also acknowledged and understood that all projects are not the same and may require different levels of schedule visibility, scrutiny and control. Project type, value, and complexity are factors that typically dictate which schedule management practices should be employed.

  3. An Optimal Transportation Schedule of Mobile Equipment

    Directory of Open Access Journals (Sweden)

    S. Guillén-Burguete

    2012-10-01

    Full Text Available Motivated by a problem faced by road construction companies, we develop a new model to obtain an optimaltransportation schedule of mobile machines which have to travel to execute tasks. In this problem, each task ischaracterized by the location where it is to be executed, a work-content in terms of machine-time units, and one ormore time intervals within which it can be performed. The machines can be transported from one location to anotherat any time, thus the problem has an indefinite number of variables. However, this indefinite number of variables canbe reduced to a definite one because, as we prove, the problem has an optimal solution in which the arrivals ofmachines occur only at certain time instants. The objective is to minimize the total transportation cost such that all thetasks are executed within their time intervals. The constraints ensuring that the tasks are processed within theirprescribed time intervals are nonlinear; nevertheless, due to the sets of the possible arrival times of the machinesforming bounded convex polyhedra, our problem can be transformed into a mixed integer linear program by the samedevice used in the decomposition principle of Dantzig-Wolfe.

  4. Multiprocessor Scheduling Using Parallel Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Nourah Al-Angari

    2012-07-01

    Full Text Available Tasks scheduling is the most challenging problem in the parallel computing. Hence, the inappropriate scheduling will reduce or even abort the utilization of the true potential of the parallelization. Genetic algorithm (GA has been successfully applied to solve the scheduling problem. The fitness evaluation is the most time consuming GA operation for the CPU time, which affect the GA performance. The proposed synchronous master-slave algorithm outperforms the sequential algorithm in case of complex and high number of generations problem.

  5. NEWS OF THE NATIONAL IMMUNIZATION SCHEDULE

    Directory of Open Access Journals (Sweden)

    O. V. Shamsheva

    2014-01-01

    Full Text Available The article presents the changes Immunization Schedule Russia introduced in 2014. In new Schedule now is the vaccination against pneumococcal disease for all children of 2 months with revaccination at 4 and 15 months old; excluded from the Schedule second revaccination against tuberculosis. At risk groups to be vaccinated against the flu, entered pregnant women and persons subject to military conscription. Recommendations on use of vaccines containing relevant antigens for the Russian Federation, to provide maximum effectiveness of immunization and vaccines that do not contain preservatives in children under 1 year of age. Offered to create a council of experts in the field of vaccinology and vaccine prevention

  6. TECHNICAL COORDINATION SCHEDULE & INTEGRATION

    CERN Multimedia

    W. Zeuner

    Introduction The endgame of CMS installation in the underground cavern is in full swing, with several major milestones having been passed since the last CMS week. The Tracker was installed inside the Vactank just before the CERN end-of-year shutdown. Shortly after the reopening in 2008, the two remaining endcap disks, YE-2 and YE-1, were lowered, marking the completion of eight years of assembly in the surface building SX5. The remaining tasks, before the detector can be closed for the Cosmic Run At Four Tesla (CRAFT), are the installation of the thermal shields, the cabling of the negative endcap, the cabling of the tracker and the beam pipe installation. In addition to these installation tasks, a test closure of the positive endcap is planned just before the installation of the central beam pipe. The schedule is tight and complicated but the goal to close CMS by the end of May for a cosmic test with magnetic field remains feasible. Safety With all large components now being underground, the shortage...

  7. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

    Hjorth, Katrine; Börjesson, Maria; Engelson, Leonid

    2015-01-01

    Different assumptions about travelers' scheduling preferences yield different measures of the cost of travel time variability. Only few forms of scheduling preferences provide non-trivial measures which are additive over links in transport networks where link travel times are arbitrarily...... of car drivers' route and mode choice under uncertain travel times. Our analysis exposes some important methodological issues related to complex non-linear scheduling models: One issue is identifying the point in time where the marginal utility of being at the destination becomes larger than the marginal...

  8. The shop floor scheduling game

    NARCIS (Netherlands)

    Riezebos, Jan; Slomp, Jannes

    1995-01-01

    The aim of the shop floor scheduling game is getting participants acquainted with: - developing robust planning and scheduling procedures; - accepting orders under uncertainty and competition; - using information from cost accounting in scheduling; - creating an adequate communication structure

  9. 2-Layered Architecture of Vague Logic Based Multilevel Queue Scheduler

    Directory of Open Access Journals (Sweden)

    Supriya Raheja

    2014-01-01

    Full Text Available In operating system the decisions which CPU scheduler makes regarding the sequence and length of time the task may run are not easy ones, as the scheduler has only a limited amount of information about the tasks. A good scheduler should be fair, maximizes throughput, and minimizes response time of system. A scheduler with multilevel queue scheduling partitions the ready queue into multiple queues. While assigning priorities, higher level queues always get more priorities over lower level queues. Unfortunately, sometimes lower priority tasks get starved, as the scheduler assures that the lower priority tasks may be scheduled only after the higher priority tasks. While making decisions scheduler is concerned only with one factor, that is, priority, but ignores other factors which may affect the performance of the system. With this concern, we propose a 2-layered architecture of multilevel queue scheduler based on vague set theory (VMLQ. The VMLQ scheduler handles the impreciseness of data as well as improving the starvation problem of lower priority tasks. This work also optimizes the performance metrics and improves the response time of system. The performance is evaluated through simulation using MatLab. Simulation results prove that the VMLQ scheduler performs better than the classical multilevel queue scheduler and fuzzy based multilevel queue scheduler.

  10. Resource-Driven Scheduling Implementation in Malaysian Construction Industry

    Directory of Open Access Journals (Sweden)

    Aftab Hameed Memon

    2011-07-01

    Full Text Available Resource-driven scheduling techniques focus on resource. Their objective is to schedule activities so that a project dead line is met using predefined resource availability limits. This paper reports about the status of resource-driven scheduling implementation in Malaysian construction industry. An investigation Survey was conducted to determine the level of resource-driven scheduling and factors affecting the concerned implementation. Construction Firm registered under G7 (A Class, G6 (B class and G5 (C class were used in investigation. Data was analyzed by Statistical package SPSS to find the means and rank. Average index method was adapted to for the level of features of resource scheduling implementation and barrier to resource-driven scheduling. It is significant 59.65% firms are implementing resource-driven scheduling as partial. Also methods of project scheduling and resource options adopted were investigated. A Significant majority of construction firms (approximately 65% adopt Microsoft project for scheduling. Study showed that the features of resource scheduling are being implemented at Medium Level. Lack of understanding / awareness of concepts, lack of genuine commitment, lack of coordination of key personnel and Lack of coordination of constructors consultants were found major factors that affect resource-driven scheduling. While, expensive to prepare is most contributing factor, no enforcement on schedules from authority, difficult to prepare and hurdles by personnel/authorities were found as major constraints in implementing resource driven scheduling.

  11. Data analysis with the DIANA meta-scheduling approach

    CERN Document Server

    Anjum, A; Willers, I

    2008-01-01

    The concepts, design and evaluation of the Data Intensive and Network Aware (DIANA) meta-scheduling approach for solving the challenges of data analysis being faced by CERN experiments are discussed in this paper. Our results suggest that data analysis can be made robust by employing fault tolerant and decentralized meta-scheduling algorithms supported in our DIANA meta-scheduler. The DIANA meta-scheduler supports data intensive bulk scheduling, is network aware and follows a policy centric meta-scheduling. In this paper, we demonstrate that a decentralized and dynamic meta-scheduling approach is an effective strategy to cope with increasing numbers of users, jobs and datasets. We present 'quality of service' related statistics for physics analysis through the application of a policy centric fair-share scheduling model. The DIANA meta-schedulers create a peer-to-peer hierarchy of schedulers to accomplish resource management that changes with evolving loads and is dynamic and adapts to the volatile nature of t...

  12. Dynamic Broadcast Scheduling in DDBMS

    Directory of Open Access Journals (Sweden)

    Babu Santhalingam,

    2011-01-01

    Full Text Available This system will address the problem of online scheduling sequential data objects with the principle of periodicity in the context of dynamic information dissemination. Many modern information applications spread dynamically generated data objects and answer the complex query for retrieving multiple data objects. In dynamic environments, data streams need to be online processed rather than being stored and later retrieved to answer queries. Particularly, data objects are produced dynamically by the information providers, interleaved and disseminated efficiently by the broadcasting servers, and associated sequentially in the client sides. The proposed algorithm with a well-specific gain measure function prominently outperforms the FIFO schedule and is able to minimize the mean service access time to the extent close to the theoretical optimum.

  13. Train Stop Scheduling in a High-Speed Rail Network by Utilizing a Two-Stage Approach

    Directory of Open Access Journals (Sweden)

    Huiling Fu

    2012-01-01

    Full Text Available Among the most commonly used methods of scheduling train stops are practical experience and various “one-step” optimal models. These methods face problems of direct transferability and computational complexity when considering a large-scale high-speed rail (HSR network such as the one in China. This paper introduces a two-stage approach for train stop scheduling with a goal of efficiently organizing passenger traffic into a rational train stop pattern combination while retaining features of regularity, connectivity, and rapidity (RCR. Based on a three-level station classification definition, a mixed integer programming model and a train operating tactics descriptive model along with the computing algorithm are developed and presented for the two stages. A real-world numerical example is presented using the Chinese HSR network as the setting. The performance of the train stop schedule and the applicability of the proposed approach are evaluated from the perspective of maintaining RCR.

  14. Familiar Face Recognition in Children with Autism: The Differential Use of Inner and Outer Face Parts

    Science.gov (United States)

    Wilson, Rebecca; Pascalis, Olivier; Blades, Mark

    2007-01-01

    We investigated whether children with autistic spectrum disorders (ASD) have a deficit in recognising familiar faces. Children with ASD were given a forced choice familiar face recognition task with three conditions: full faces, inner face parts and outer face parts. Control groups were children with developmental delay (DD) and typically…

  15. Heuristic Based Task Scheduling In Grid

    Directory of Open Access Journals (Sweden)

    Manpreet Singh

    2012-09-01

    Full Text Available Grid computing is concerned with coordinated resource sharing and problem solving in dynamic, multi-institutional virtual organizations. Efficient scheduling of complex applications in a grid environment reveals several challenges due to its high heterogeneity, dynamic behavior and space shared utilization. Objectives of scheduling algorithms are increase in system throughput, efficiency and reduction in task completion time. The main focus of this paper is to highlight the merits of resource and task selection technique based on certain heuristics.

  16. DMEPOS Fee Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — The list contains the fee schedule amounts, floors, and ceilings for all procedure codes and payment category, jurisdication, and short description assigned to each...

  17. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

    Hjorth, Katrine; Börjesson, Maria; Engelson, Leonid

    time by maximising expected total utility over the day, their departure times are conditional on rates of utility derived at these locations. For forecasting and economic evaluation of planning alternatives, it is desirable to have simple forms of utility rates with few parameters. Several forms...... the travel time is random, Noland and Small (1995) suggested using expected utility theory to derive the reduced form of expected travel time cost that includes the cost of TTV. For the α-β-γ formulation of scheduling preferences and exponential or uniform distribution of travel time, Noland and Small (1995....... The purpose of this paper is to explore how well these scheduling preferences explain behaviour, compared to other possible scheduling models, and whether empirical estimation of the more complex exponential scheduling preferences is feasible. We use data from a stated preference survey conducted among car...

  18. CERN confirms LHC schedule

    CERN Multimedia

    2003-01-01

    The CERN Council held its 125th session on 20 June. Highlights of the meeting included confirmation that the LHC is on schedule for a 2007 start-up, and the announcement of a new organizational structure in 2004.

  19. Decentralized Ground Staff Scheduling

    DEFF Research Database (Denmark)

    Sørensen, M. D.; Clausen, Jens

    2002-01-01

    Typically, ground staff scheduling is centrally planned for each terminal in an airport. The advantage of this is that the staff is efficiently utilized, but a disadvantage is that staff spends considerable time walking between stands. In this paper a decentralized approach for ground staff...... scheduling is investigated. The airport terminal is divided into zones, where each zone consists of a set of stands geographically next to each other. Staff is assigned to work in only one zone and the staff scheduling is planned decentralized for each zone. The advantage of this approach is that the staff...... work in a smaller area of the terminal and thus spends less time walking between stands. When planning decentralized the allocation of stands to flights influences the staff scheduling since the workload in a zone depends on which flights are allocated to stands in the zone. Hence solving the problem...

  20. Clinical Laboratory Fee Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — Outpatient clinical laboratory services are paid based on a fee schedule in accordance with Section 1833(h) of the Social Security Act. The clinical laboratory fee...

  1. Project Schedule Simulation

    DEFF Research Database (Denmark)

    Mizouni, Rabeb; Lazarova-Molnar, Sanja

    2015-01-01

    Despite several attempts to accurately predict duration and cost of software projects, initial plans still do not reflect real-life situations. Since commitments with customers are usually decided based on these initial plans, software companies frequently fail to deliver on time and many projects...... overrun both their budget and time. To improve the quality of initial project plans, we show in this paper the importance of (1) reflecting features’ priorities/risk in task schedules and (2) considering uncertainties related to human factors in plan schedules. To make simulation tasks reflect features......’ priority as well as multimodal team allocation, enhanced project schedules (EPS), where remedial actions scenarios (RAS) are added, were introduced. They reflect potential schedule modifications in case of uncertainties and promote a dynamic sequencing of involved tasks rather than the static conventional...

  2. Estimating exponential scheduling preferences

    DEFF Research Database (Denmark)

    Hjorth, Katrine; Börjesson, Maria; Engelson, Leonid

    time by maximising expected total utility over the day, their departure times are conditional on rates of utility derived at these locations. For forecasting and economic evaluation of planning alternatives, it is desirable to have simple forms of utility rates with few parameters. Several forms...... the travel time is random, Noland and Small (1995) suggested using expected utility theory to derive the reduced form of expected travel time cost that includes the cost of TTV. For the α-β-γ formulation of scheduling preferences and exponential or uniform distribution of travel time, Noland and Small (1995....... The purpose of this paper is to explore how well these scheduling preferences explain behaviour, compared to other possible scheduling models, and whether empirical estimation of the more complex exponential scheduling preferences is feasible. We use data from a stated preference survey conducted among car...

  3. Fee Schedules - General Information

    Data.gov (United States)

    U.S. Department of Health & Human Services — A fee schedule is a complete listing of fees used by Medicare to pay doctors or other providers-suppliers. This comprehensive listing of fee maximums is used to...

  4. Physician Fee Schedule Search

    Data.gov (United States)

    U.S. Department of Health & Human Services — This website is designed to provide information on services covered by the Medicare Physician Fee Schedule (MPFS). It provides more than 10,000 physician services,...

  5. CMS Records Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — The CMS Records Schedule provides disposition authorizations approved by the National Archives and Records Administration (NARA) for CMS program-related records...

  6. Resource Minimization Job Scheduling

    Science.gov (United States)

    Chuzhoy, Julia; Codenotti, Paolo

    Given a set J of jobs, where each job j is associated with release date r j , deadline d j and processing time p j , our goal is to schedule all jobs using the minimum possible number of machines. Scheduling a job j requires selecting an interval of length p j between its release date and deadline, and assigning it to a machine, with the restriction that each machine executes at most one job at any given time. This is one of the basic settings in the resource-minimization job scheduling, and the classical randomized rounding technique of Raghavan and Thompson provides an O(logn/loglogn)-approximation for it. This result has been recently improved to an O(sqrt{log n})-approximation, and moreover an efficient algorithm for scheduling all jobs on O((OPT)^2) machines has been shown. We build on this prior work to obtain a constant factor approximation algorithm for the problem.

  7. PAR Loop Schedule Review

    Energy Technology Data Exchange (ETDEWEB)

    Schaffer, Jr.; W.F.

    1958-04-30

    The schedule for the installation of the PAR slurry loop experiment in the South Facility of the ORR has been reviewed and revised. The design, fabrications and Installation is approximately two weeks behind schedule at this time due to many factors; however, indications are that this time can be made up. Design is estimated to be 75% complete, fabrication 32% complete and installation 12% complete.

  8. ATLAS construction schedule

    CERN Multimedia

    Kotamaki, M

    The goal during the last few months has been to freeze and baseline as much as possible the schedules of various ATLAS systems and activities. The main motivations for the re-baselining of the schedules have been the new LHC schedule aiming at first collisions in early 2006 and the encountered delays in civil engineering as well as in the production of some of the detectors. The process was started by first preparing a new installation schedule that takes into account all the new external constraints and the new ATLAS staging scenario. The installation schedule version 3 was approved in the March EB and it provides the Ready For Installation (RFI) milestones for each system, i.e. the date when the system should be available for the start of the installation. TCn is now interacting with the systems aiming at a more realistic and resource loaded version 4 before the end of the year. Using the new RFI milestones as driving dates a new summary schedule has been prepared, or is under preparation, for each system....

  9. MEDICAL STAFF SCHEDULING USING SIMULATED ANNEALING

    Directory of Open Access Journals (Sweden)

    Ladislav Rosocha

    2015-07-01

    Full Text Available Purpose: The efficiency of medical staff is a fundamental feature of healthcare facilities quality. Therefore the better implementation of their preferences into the scheduling problem might not only rise the work-life balance of doctors and nurses, but also may result into better patient care. This paper focuses on optimization of medical staff preferences considering the scheduling problem.Methodology/Approach: We propose a medical staff scheduling algorithm based on simulated annealing, a well-known method from statistical thermodynamics. We define hard constraints, which are linked to legal and working regulations, and minimize the violations of soft constraints, which are related to the quality of work, psychic, and work-life balance of staff.Findings: On a sample of 60 physicians and nurses from gynecology department we generated monthly schedules and optimized their preferences in terms of soft constraints. Our results indicate that the final value of objective function optimized by proposed algorithm is more than 18-times better in violations of soft constraints than initially generated random schedule that satisfied hard constraints.Research Limitation/implication: Even though the global optimality of final outcome is not guaranteed, desirable solutionwas obtained in reasonable time. Originality/Value of paper: We show that designed algorithm is able to successfully generate schedules regarding hard and soft constraints. Moreover, presented method is significantly faster than standard schedule generation and is able to effectively reschedule due to the local neighborhood search characteristics of simulated annealing.

  10. STATUS OF SCHEDULE TRIBES IN ANDHRA PRADESH

    Directory of Open Access Journals (Sweden)

    Dr. P. Subramanyachary

    2013-01-01

    Full Text Available Schedule Tribes (ST’s are Indian population groups that are explicitly recognized by the constitution of India order 1950. The order lists 744 tribes across 22 states in its first schedule. In Andhra Pradesh 33 types of Schedule Tribes are living in 8 districts. ST’s are 6.6% are in total population of Andhra Pradesh. They have rich heritage along with their innocent life style. As they are living in hill areas and forests they have some peculiar characters like indications of primitive traits, distinctive culture, and shyness of contact with other communities, geographical isolation, backwardness etc. So, for their development central and state governments are implementing different programmes and schemes since 1951. After the Ministry of Tribal affairs were constituted in 1999, there is more focus on development of Schedule Tribes in Indian society especially in Andhra Pradesh. The persisting problems like low literacy and high drop-outs, inadequate health services, lack of nutrition food, extreme poverty, and ineffective implementation of schemes etc are putting them away from economic development. Hence, there should be more commitment by both central and state government and local bodies to develop Schedule Tribes in the society. As literacy is 37% NGO’s and other voluntary organizations have to play key role to bring awareness among schedule tribes regarding programs and scheme for their development. Awareness and participation of Schedule Tribes in the implementation of policies leads to prosperity of ST community in the state as well as country.

  11. FACE RECOGNITION FROM FRONT-VIEW FACE

    Institute of Scientific and Technical Information of China (English)

    WuLifang; ShenLansun

    2003-01-01

    This letter presents a face normalization algorithm based on 2-D face model to rec-ognize faces with variant postures from front-view face.A 2-D face mesh model can be extracted from faces with rotation to left or right and the corresponding front-view mesh model can be estimated according to facial symmetry.Then based on the relationship between the two mesh models,the nrmalized front-view face is formed by gray level mapping.Finally,the face recognition will be finished based on Principal Component Analysis(PCA).Experiments show that better face recognition performance is achieved in this way.

  12. FACE RECOGNITION FROM FRONT-VIEW FACE

    Institute of Scientific and Technical Information of China (English)

    Wu Lifang; Shen Lansun

    2003-01-01

    This letter presents a face normalization algorithm based on 2-D face model to recognize faces with variant postures from front-view face. A 2-D face mesh model can be extracted from faces with rotation to left or right and the corresponding front-view mesh model can be estimated according to the facial symmetry. Then based on the inner relationship between the two mesh models, the normalized front-view face is formed by gray level mapping. Finally, the face recognition will be finished based on Principal Component Analysis (PCA). Experiments show that better face recognition performance is achieved in this way.

  13. Study on Pier Supporting Technology of Gas Drainage Gateway of Full-mechanized Caving Mining Face%高瓦斯综放工作面瓦排巷墩柱支护技术研究

    Institute of Scientific and Technical Information of China (English)

    王吉生; 陈继刚; 王刚

    2015-01-01

    高瓦斯矿井综放工作面采用双“U ”型通风方式解除瓦斯的制约,但外圈巷道受动压影响变形大(底鼓量高达2.0 m),严重影响通风和行人的安全,一般采用木垛进行加强支护,效果不好。为此,提出了用高水速凝材料墩柱代替木垛进行加强支护。 FLAC3D数值模拟及现场矿压观测结果显示,墩柱支护优于木垛支护,并能有效地控制巷道围岩变形,平均每米巷道节约4243元,效益明显,为类似地质条件下巷道支护提供一种行之有效的方案。%The fully mechanized coal face of high-methane coal mine adopting double “U” type ventilation way remove the threat of methane.But the outer roadway affected by the dynamic pressure bringing about severe deformation ( the heaving floor reach up to 2.0 m), seriously affect the ventilation and pedestrians'safety.The general use of the crib timbering to reinforce supporting is unsatis-fied.Therefore, the reinforcement method of high-water and quick-setting pier instead of crib timbering is put forward.FLAC3D nu-merical simulation and field-observation results of rock pressure showed that the supporting can effectively control the deformation of surrounding rock of roadways and better than crib timbering, and save 4 243 yuan per meter roadway , benefit is obvious .This pro-vides an effective support scheme for roadway support in the similar geological conditions.

  14. Abstraction and control techniques for non-stationary scheduling problems

    CERN Document Server

    Innocenti, Giacomo

    2009-01-01

    The paper faces the problem of scheduling from a new perspective, trying to bridge the gap between classical heuristic approaches and system identification and control strategies. To this aim, a complete mathematical formulation of a general scheduling process is derived, beginning from very broad assumptions. This allows a greater freedom of manipulation and guarantee the resolution of the identification (and control) techniques. Both an adaptive and a switching strategies are presented in relation to the performances of a simple Round Robin algorithm.

  15. Intelligent Feedback Scheduling of Control Tasks

    Directory of Open Access Journals (Sweden)

    Fatin I. Telchy

    2014-12-01

    Full Text Available an efficient feedback scheduling scheme based on the proposed Feed Forward Neural Network (FFNN scheme is employed to improve the overall control performance while minimizing the overhead of feedback scheduling which exposed using the optimal solutions obtained offline by mathematical optimization methods. The previously described FFNN is employed to adapt online the sampling periods of concurrent control tasks with respect to changes in computing resource availability. The proposed intelligent scheduler will be examined with different optimization algorithms. An inverted pendulum cost function is used in these experiments. Then, simulation of three inverted pendulums as intelligent Real Time System (RTS is described in details. Numerical simulation results demonstrates that the proposed scheme can reduce the computational overhead significantly while delivering almost the same overall control performance as compared to optimal feedback scheduling

  16. RESOURCE SCHEDULING IN CLOUD ENVIRONMET: A SURVEY

    Directory of Open Access Journals (Sweden)

    Neeraj Mangla

    2016-06-01

    Full Text Available Cloud Computing offers the avant-garde services at a stretch that are too attractive for any cloud user to ignore. With its growing application and popularization, IT companies are rapidly deploying distributed data centers globally, posing numerous challenges in terms of scheduling of resources under different administrative domains. This perspective brings out certain vital factors for efficient scheduling of resources providing a wide genre of characteristics, diversity in context of level of service agreements and that too with user-contingent elasticity. In this paper, a comprehensive survey of research related to various aspects of cloud resource scheduling is provided. A comparative analysis of various resource scheduling techniques focusing on key performance parameters like Energy efficiency, Virtual Machine allocation and migration, Cost-effectiveness and Service-Level Agreement is also presented.

  17. Famous face recognition, face matching, and extraversion.

    Science.gov (United States)

    Lander, Karen; Poyarekar, Siddhi

    2015-01-01

    It has been previously established that extraverts who are skilled at interpersonal interaction perform significantly better than introverts on a face-specific recognition memory task. In our experiment we further investigate the relationship between extraversion and face recognition, focusing on famous face recognition and face matching. Results indicate that more extraverted individuals perform significantly better on an upright famous face recognition task and show significantly larger face inversion effects. However, our results did not find an effect of extraversion on face matching or inverted famous face recognition.

  18. Face-to-face: Perceived personal relevance amplifies face processing.

    Science.gov (United States)

    Bublatzky, Florian; Pittig, Andre; Schupp, Harald T; Alpers, Georg W

    2017-05-01

    The human face conveys emotional and social information, but it is not well understood how these two aspects influence face perception. In order to model a group situation, two faces displaying happy, neutral or angry expressions were presented. Importantly, faces were either facing the observer, or they were presented in profile view directed towards, or looking away from each other. In Experiment 1 (n = 64), face pairs were rated regarding perceived relevance, wish-to-interact, and displayed interactivity, as well as valence and arousal. All variables revealed main effects of facial expression (emotional > neutral), face orientation (facing observer > towards > away) and interactions showed that evaluation of emotional faces strongly varies with their orientation. Experiment 2 (n = 33) examined the temporal dynamics of perceptual-attentional processing of these face constellations with event-related potentials. Processing of emotional and neutral faces differed significantly in N170 amplitudes, early posterior negativity (EPN), and sustained positive potentials. Importantly, selective emotional face processing varied as a function of face orientation, indicating early emotion-specific (N170, EPN) and late threat-specific effects (LPP, sustained positivity). Taken together, perceived personal relevance to the observer-conveyed by facial expression and face direction-amplifies emotional face processing within triadic group situations. © The Author (2017). Published by Oxford University Press.

  19. Priorities of the Nurse Schedule by using MODM Approach: A case Study

    Directory of Open Access Journals (Sweden)

    Seyed Mehdi Abtahi

    2013-07-01

    Full Text Available Scheduling and planning for allocating resources to the activities so that the activities can be done in the best manner and resources allocated appropriately is one of the most important problems of management and operation research. The hospitals are one of the organizations that face with this problem in allocating nurses to the shifts in the most appropriate time period so precisely that the defections could not be eliminated and the goals are achieved. Therefore, the present study was aimed to develop a model for nurse scheduling through goal programing technique. The proposed model includes different purposes as its goals and strives to achieve them. This model can be used for solving similar problems in the urgency units in hospitals. This problem has been solved by Lingo 8 and finally its results have been compared with the results of manual methods.

  20. Automated Scheduling Via Artificial Intelligence

    Science.gov (United States)

    Biefeld, Eric W.; Cooper, Lynne P.

    1991-01-01

    Artificial-intelligence software that automates scheduling developed in Operations Mission Planner (OMP) research project. Software used in both generation of new schedules and modification of existing schedules in view of changes in tasks and/or available resources. Approach based on iterative refinement. Although project focused upon scheduling of operations of scientific instruments and other equipment aboard spacecraft, also applicable to such terrestrial problems as scheduling production in factory.

  1. About Face

    Medline Plus

    Full Text Available ... to you Close Topics Menu Penny Anderson US Army 1985 - 1994, 1996 - 2013 Bosnia, Iraq, United States Tap for Video Jeff Goodrich US Army 1984 - 2006 Afghanistan, Canada, Germany, Iraq, Macedonia, USA ...

  2. About Face

    Medline Plus

    Full Text Available ... Site Veterans Clinicians Family In Depth PTSD Profiles Therapies Previews About PTSD Get Help Menu Closed (Tap ... Veteran Directory Clinician Directory Family Directory PTSD Profiles Therapies Previews About PTSD Get Help Contact Us Home ...

  3. About Face

    Medline Plus

    Full Text Available ... videos, Veterans, family members, and clinicians share their experiences with PTSD and PTSD treatment. Choose a topic ... Treatment Works Follow Veterans as they share their experiences with two types of therapy that are proven ...

  4. About Face

    Medline Plus

    Full Text Available ... Content Home Who's On The Site Veterans Clinicians Family In Depth PTSD Profiles Therapies Previews About PTSD ... How The Site Works Veteran Directory Clinician Directory Family Directory PTSD Profiles Therapies Previews About PTSD Get ...

  5. About Face

    Medline Plus

    Full Text Available ... Macedonia, USA Tap for Video Vince Bryant US Marine Corps 2001 - 2009 Iraq Tap for Video Albert ... present Iraq Tap for Video Brad Seitz US Marine Corps 2002 - 2005 Iraq Tap for Video Leah ...

  6. About Face

    Medline Plus

    Full Text Available ... Menu Closed (Tap to Open) Home Videos by Topic Videos by Type Search All Videos PTSD Basics ... for Professionals Get Help Home Watch Videos by Topic Videos by Type Search All Videos Learn More ...

  7. Comparative Study of Static Task Scheduling Algorithms for Heterogeneous Systems

    Directory of Open Access Journals (Sweden)

    Miss. Kalpana A. Manudhane

    2013-03-01

    Full Text Available On the distributed or parallel heterogeneous computing systems, an application is usually decomposed into several interdependent sets of co-operating subtasks and assigned to a set of available processors for execution. Task scheduling is in general NP-compete problem. Static task scheduling algorithms are categorized as Heuristic based and Guided random search based scheduling algorithms. Heuristic algorithms guaranteed to find near optimal solution in less than polynomial time. Heuristic based list scheduling algorithms are Heterogeneous Earliest Finish Time (HEFT and Critical-Path-On- -Processor (CPOP. Whereas, Guided random search based scheduling algorithms have shown robust performance on verity of schedulingproblems. Typical examples are Multiple Priority Queueing Genetic Algorithm (MPQGA, Tabu Search(TS, Ant Colony System (ACS. This paper gives comparative study of all these static task scheduling algorithms and compares them on the basis of average makespan, schedule length ratio (SLR and speedup and running time of algorithm.

  8. Designing of vague logic based multilevel feedback queue scheduler

    Directory of Open Access Journals (Sweden)

    Supriya Raheja

    2016-03-01

    Full Text Available Multilevel feedback queue scheduler suffers from major issues of scheduling such as starvation for long tasks, fixed number of queues, and static length of time quantum in each queue. These factors directly affect the performance of the scheduler. At many times impreciseness exists in attributes of tasks which make the performance even worse. In this paper, our intent is to improve the performance by providing a solution to these issues. We design a multilevel feedback queue scheduler using a vague set which we call as VMLFQ scheduler. VMLFQ scheduler intelligently handles the impreciseness and defines the optimum number of queues as well as the optimal size of time quantum for each queue. It also resolves the problem of starvation. This paper simulates and analyzes the performance of VMLFQ scheduler with the other multilevel feedback queue techniques using MatLab.

  9. Earth Observation Satellites Scheduling Based on Decomposition Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Feng Yao

    2010-11-01

    Full Text Available A decomposition-based optimization algorithm was proposed for solving Earth Observation Satellites scheduling problem. The problem was decomposed into task assignment main problem and single satellite scheduling sub-problem. In task assignment phase, the tasks were allocated to the satellites, and each satellite would schedule the task respectively in single satellite scheduling phase. We adopted an adaptive ant colony optimization algorithm to search the optimal task assignment scheme. Adaptive parameter adjusting strategy and pheromone trail smoothing strategy were introduced to balance the exploration and the exploitation of search process. A heuristic algorithm and a very fast simulated annealing algorithm were proposed to solve the single satellite scheduling problem. The task assignment scheme was valued by integrating the observation scheduling result of multiple satellites. The result was responded to the ant colony optimization algorithm, which can guide the search process of ant colony optimization. Computation results showed that the approach was effective to the satellites observation scheduling problem.

  10. Optimization Algorithms in School Scheduling Programs: Study, Analysis and Results

    Directory of Open Access Journals (Sweden)

    Lina PUPEIKIENE

    2009-04-01

    Full Text Available To create good and optimal school schedule is very important and practical task. Currently in Lithuania schools are using two programs for making the school schedule at the moment. But none of these programs is very effective. Optimization Department of Lithuanian Institute of Mathematics and Informatics (IMI has created ``School schedule optimization program''. It has three optimization algorithms for making best school schedule. A user can choose not only few optimization options and get few optimal schedules, but some subjective and objectives parameters. The making of initial data file is advanced in this program. XML format is used for creating initial data file and getting all optimal results files. The purpose of this study is to analyze used optimization algorithms used in ``School schedule optimization program'' and to compare results with two most popular commercial school scheduling programs in Lithuania.

  11. Study of Face Recognition Techniques

    Directory of Open Access Journals (Sweden)

    Sangeeta Kaushik

    2014-12-01

    Full Text Available A study of both face recognition and detection techniques is carried out using the algorithms like Principal Component Analysis (PCA, Kernel Principal Component Analysis (KPCA, Linear Discriminant Analysis (LDA and Line Edge Map (LEM. These algorithms show different rates of accuracy under different conditions. The automatic recognition of human faces presents a challenge to the pattern recognition community. Typically, human faces are different in shapes with minor similarity from person to person. Furthermore, lighting condition changes, facial expressions and pose variations further complicate the face recognition task as one of the difficult problems in pattern analysis.

  12. Unconstrained Face Verification using Deep CNN Features

    OpenAIRE

    Chen, Jun-Cheng; Patel, Vishal M.; Chellappa, Rama

    2015-01-01

    In this paper, we present an algorithm for unconstrained face verification based on deep convolutional features and evaluate it on the newly released IARPA Janus Benchmark A (IJB-A) dataset. The IJB-A dataset includes real-world unconstrained faces from 500 subjects with full pose and illumination variations which are much harder than the traditional Labeled Face in the Wild (LFW) and Youtube Face (YTF) datasets. The deep convolutional neural network (DCNN) is trained using the CASIA-WebFace ...

  13. About Face

    Medline Plus

    Full Text Available ... Menu Closed (Tap to Open) How The Site Works Veteran Directory Clinician Directory Family Directory PTSD Profiles Therapies Previews About PTSD Get Help Contact Us Home Learn about posttraumatic stress disorder (PTSD) from Veterans who've experienced it. ...

  14. CMS multicore scheduling strategy

    Energy Technology Data Exchange (ETDEWEB)

    Perez-Calero Yzquierdo, Antonio [Madrid, CIEMAT; Hernandez, Jose [Madrid, CIEMAT; Holzman, Burt [Fermilab; Majewski, Krista [Fermilab; McCrea, Alison [UC, San Diego

    2014-01-01

    In the next years, processor architectures based on much larger numbers of cores will be most likely the model to continue 'Moore's Law' style throughput gains. This not only results in many more jobs in parallel running the LHC Run 1 era monolithic applications, but also the memory requirements of these processes push the workernode architectures to the limit. One solution is parallelizing the application itself, through forking and memory sharing or through threaded frameworks. CMS is following all of these approaches and has a comprehensive strategy to schedule multicore jobs on the GRID based on the glideinWMS submission infrastructure. The main component of the scheduling strategy, a pilot-based model with dynamic partitioning of resources that allows the transition to multicore or whole-node scheduling without disallowing the use of single-core jobs, is described. This contribution also presents the experiences made with the proposed multicore scheduling schema and gives an outlook of further developments working towards the restart of the LHC in 2015.

  15. Model Migration Schedules

    OpenAIRE

    1981-01-01

    This report draws on the fundamental regularity exhibited by age profiles of migration all over the world to develop a system of hypothetical model schedules that can be used in multiregional population analyses carried out in countries that lack adequate migration data.

  16. Personnel Scheduling in Laboratories

    NARCIS (Netherlands)

    Franses, Philip; Post, Gerhard; Burke, Edmund; De Causmaecker, Patrick

    2003-01-01

    We describe an assignment problem particular to the personnel scheduling of organisations such as laboratories. Here we have to assign tasks to employees. We focus on the situation where this assignment problem reduces to constructing maximal matchings in a set of interrelated bipartite graphs. We d

  17. Location-based Scheduling

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    The coordination of activities and resources in order to establish an effective production flow is central to the management of construction projects. The traditional technique for coordination of activities and resources in construction projects is the CPM-scheduling, which has been the predomin......The coordination of activities and resources in order to establish an effective production flow is central to the management of construction projects. The traditional technique for coordination of activities and resources in construction projects is the CPM-scheduling, which has been...... the predominant scheduling method since it was introduced in the late 1950s. Over the years, CPM has proven to be a very powerful technique for planning, scheduling and controlling projects, which among other things is indicated by the development of a large number of CPM-based software applications available...... on the market. However, CPM is primarily an activity based method that takes the activity as the unit of focus and there is criticism raised, specifically in the case of construction projects, on the method for deficient management of construction work and continuous flow of resources. To seek solutions...

  18. Round Robin Schedules.

    Science.gov (United States)

    Iannone, Michael A.

    1983-01-01

    Presented is a computer program written in BASIC that covers round-robin schedules for team matches in competitions. The program was originally created to help teams in a tennis league play one match against every other team. Part of the creation of the program involved use of modulo arithmetic. (MP)

  19. Harmonious personnel scheduling

    NARCIS (Netherlands)

    Fijn van Draat, Laurens; Post, Gerhard; Veltman, Bart; Winkelhuijzen, Wessel

    2006-01-01

    The area of personnel scheduling is very broad. Here we focus on the ‘shift assignment problem’. Our aim is to discuss how ORTEC HARMONY handles this planning problem. In particular we go into the structure of the optimization engine in ORTEC HARMONY, which uses techniques from genetic algorithms, l

  20. Harmonious personnel scheduling

    NARCIS (Netherlands)

    Fijn van Draat, Laurens; Post, Gerhard F.; Veltman, Bart; Winkelhuijzen, Wessel

    2006-01-01

    The area of personnel scheduling is very broad. Here we focus on the ‘shift assignment problem’. Our aim is to discuss how ORTEC HARMONY handles this planning problem. In particular we go into the structure of the optimization engine in ORTEC HARMONY, which uses techniques from genetic algorithms,

  1. Adaptation improves face trustworthiness discrimination

    Directory of Open Access Journals (Sweden)

    Bruce D Keefe

    2013-06-01

    Full Text Available Adaptation to facial characteristics, such as gender and viewpoint, has been shown to both bias our perception of faces and improve facial discrimination. In this study, we examined whether adapting to two levels of face trustworthiness improved sensitivity around the adapted level. Facial trustworthiness was manipulated by morphing between trustworthy and untrustworthy prototypes, each generated by morphing eight trustworthy and eight untrustworthy faces respectively. In the first experiment, just-noticeable differences (JNDs were calculated for an untrustworthy face after participants adapted to an untrustworthy face, a trustworthy face, or did not adapt. In the second experiment, the three conditions were identical, except that JNDs were calculated for a trustworthy face. In the third experiment we examined whether adapting to an untrustworthy male face improved discrimination to an untrustworthy female face. In all experiments, participants completed a two-interval forced-choice adaptive staircase procedure, in which they judged which face was more untrustworthy. JNDs were derived from a psychometric function fitted to the data. Adaptation improved sensitivity to faces conveying the same level of trustworthiness when compared to no adaptation. When adapting to and discriminating around a different level of face trustworthiness there was no improvement in sensitivity and JNDs were equivalent to those in the no adaptation condition. The improvement in sensitivity was found to occur even when adapting to a face with different gender and identity. These results suggest that adaptation to facial trustworthiness can selectively enhance mechanisms underlying the coding of facial trustworthiness to improve perceptual sensitivity. These findings have implications for the role of our visual experience in the decisions we make about the trustworthiness of other individuals.

  2. PROOF OBLIGATIONS AS A SUPPORT TOOL FOR EFFICIENT PROCESS MANAGEMENT IN THE FIELD OF PRODUCTION PLANNING AND SCHEDULING

    Directory of Open Access Journals (Sweden)

    Denisa Hrušecká

    2016-11-01

    Full Text Available Production planning and scheduling is one of the most important business processes that significantly influence the performance of manufacturing companies. There are many information systems supporting production planning and scheduling and some of them are based on very sophisticated planning algorithms. Despite this fact, many companies still face serious problems even while using professional software tools for production planning and scheduling. Obviously, a lot of other changes in form of process innovations are required. This paper deals with the problem of process management in the field of production planning and scheduling. Our study explains reasons for low performance of advanced technologies and provides solution in form of system model of key factors affecting the efficiency of planning software. Research part is based on the study conducted within Czech manufacturing companies in form of questionnaire-based investigation combined with interviews. Proposed solution is extended to the abstract mathematical model based on proof obligations which prove or disprove the correctness of intended algorithms. Our study provides basic example of such an abstract model and describes its functionality and influence to proper production planning and scheduling. It will be processed to the form of complex expert system based on Event B method in the future.

  3. 特厚煤层大采高综放工作面覆岩上层活动规律的相似模拟研究%Analog Simulation Study on Deformation and Failure Laws of Overlying Strata of Full -mechanized Top- coal Caving Face with Large Mining Height in Extra Thick Coal Seam

    Institute of Scientific and Technical Information of China (English)

    陈义东; 李英明

    2011-01-01

    In order to know well the movement pattern of overlying strata and the distribution of abutment pressure in the fullmechanized top - coal caving face with large mining height of the 4# coal seam of which thickness is form 14 m to 20 m, in Liuhuanggou coal mine of Xinjiang Hami Coal Industry (Group)Co.Ltd, physical simulation experiment and studies were carried out.The results showed that a stable arch structure can form in overlying strata of full - mechanized top - coal caving face with large mining height of extra thick coal seam, under the stable arch structure the fractured rock beam becomes a multispan beam structure.The deformation and unstability of the structure in overlying strata of full - mechanized top - coal caving face with large mining height dominate the abutment pressure distribution and strata pressure behavior of coal mining face.%新疆哈密煤业集团硫磺沟矿4号煤层厚度为14~20m,为掌握该特厚煤层综放工作面上覆岩层活动规律以及支承压力分布特点,采用物理相似模拟方法进行了研究,研究结果表明,特厚大采高综放工作面的上位岩层可以形成稳定拱结构,而在稳定拱大结构之下,断裂岩梁形成多跨梁的结构.大采高综放采场上覆岩层的这种结构的变形和失稳将决定采场的支承压力分布和工作面的矿压显现.

  4. Class Schedules--Computer Loaded or Student Self-Scheduled?

    Science.gov (United States)

    Wall, Edward F.

    1979-01-01

    In the two-step process of student scheduling, the initial phase of course selection is the most important. At Chesterton High School in Indiana, student self-scheduling is preferred over computer loading. (Author/MLF)

  5. Ant Colony Optimization for Train Scheduling: An Analysis

    Directory of Open Access Journals (Sweden)

    Sudip Kumar Sahana

    2014-01-01

    Full Text Available This paper deals on cargo train scheduling between source station and destination station in Indian railways scenario. It uses Ant Colony Optimization (ACO technique which is based on ant’s food finding behavior. Iteration wise convergence process and the convergence time for the algorithm are studied and analyzed. Finally, the run time analysis of Ant Colony Optimization Train Scheduling (ACOTS and Standard Train Scheduling (STS algorithm has been performed.

  6. The Novel Heuristic for Data Transmission Dynamic Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Hao Xu

    2013-01-01

    Full Text Available The data transmission dynamic scheduling is a process that allocates the ground stations and available time windows to the data transmission tasks dynamically for improving the resource utilization. A novel heuristic is proposed to solve the data transmission dynamic scheduling problem. The characteristic of this heuristic is the dynamic hybridization of simple rules. Experimental results suggest that the proposed algorithm is correct, feasible, and available. The dynamic hybridization of simple rules can largely improve the efficiency of scheduling.

  7. ALGORITHMIC CONSTRUCTION SCHEDULES IN CONDITIONS OF TIMING CONSTRAINTS

    Directory of Open Access Journals (Sweden)

    Alexey S. Dobrynin

    2014-01-01

    Full Text Available Tasks of time-schedule construction (JSSP in various fields of human activities have an important theoretical and practical significance. The main feature of these tasks is a timing requirement, describing allowed planning time periods and periods of downtime. This article describes implementation variations of the work scheduling algorithm under timing requirements for the tasks of industrial time-schedules construction, and service activities.

  8. Impact of Personnel Flexibility on Job Shop Scheduling

    Directory of Open Access Journals (Sweden)

    Ren Lin

    2016-01-01

    Full Text Available Considering the lack of the research on the relationship between HR flexibility and scheduling effect, a resource-competency matrix-based method was proposed in order to reveal the quantitative relationship between them. Meanwhile, a job shop scheduling model with HR flexibility was established and the improved genetic algorithm was used to solve the model. A case analysis demonstrated significant impact of HR flexibility on the scheduling effect, which provided valuable guidance for building flexible manufacturing systems.

  9. Why Some Students Continue to Value Individual, Face-to- Face Research Consultations in a Technology-Rich World

    Science.gov (United States)

    Magi, Trina J.; Mardeusz, Patricia E.

    2013-01-01

    For decades, academic librarians have provided individual research consultations for students. There is little information, however, about why students schedule consultations, the kinds of assistance students feel are provided by librarians during consultations, and what students find valuable about face-to-face consultations, even with the…

  10. Learning to Discriminate Face Views

    Directory of Open Access Journals (Sweden)

    Fang Fang

    2011-05-01

    Full Text Available Although visual feature leaning has been well studied, we still know little about the mechanisms of perceptual learning of complex object. Here, human perceptual learning in discrimination of in-depth orientation of face view was studied using psychophysics, EEG and fMRI. We trained subjects to discriminate face orientations around a face view (i.e. 30° over eight daily sessions, which resulted in a significant improvement in sensitivity to the face view orientation. This improved sensitivity was highly specific to the trained orientation and persisted up to six months. Different from perceptual learning of simple visual features, this orientation-specific learning effect could completely transfer across changes in face size, visual field and face identity. A complete transfer also occurred between two partial face images that were mutually exclusive but constituted a complete face. However, the transfer of the learning effect between upright and inverted faces and between a face and a paperclip object was very weak. Before and after training, we measured EEG and fMRI BOLD signals responding to both the trained and the untrained face views. Analyses of ERPs and induced gamma activity showed that face view discrimination training led to a larger reduction of N170 latency at the left occipital-temporal area and a concurrent larger decrease of induced gamma activity at the left frontal area with the trained face view, compared with the untrained ones. BOLD signal amplitude and MVPA analyses showed that, in face-selective cortical areas, training did not lead to a significant amplitude change, but induced a more reliable spatial pattern of neural activity in the left FFA. These results suggest that the visual system had learned how to compute face orientation from face configural information more accurately and that a large amount of plastic changes took place at a level of higher visual processing where size-, location-, and identity

  11. Revisiting conjugate schedules.

    Science.gov (United States)

    MacAleese, Kenneth R; Ghezzi, Patrick M; Rapp, John T

    2015-07-01

    The effects of conjugate reinforcement on the responding of 13 college students were examined in three experiments. Conjugate reinforcement was provided via key presses that changed the clarity of pictures displayed on a computer monitor in a manner proportional to the rate of responding. Experiment 1, which included seven parameters of clarity change per response, revealed that responding decreased as the percentage clarity per response increased for all five participants. These results indicate that each participant's responding was sensitive to intensity change, which is a parameter of conjugate reinforcement schedules. Experiment 2 showed that responding increased during conjugate reinforcement phases and decreased during extinction phases for all four participants. Experiment 3 also showed that responding increased during conjugate reinforcement and further showed that responding decreased during a conjugate negative punishment condition for another four participants. Directions for future research with conjugate schedules are briefly discussed.

  12. Multiprocessor scheduling with rejection

    Energy Technology Data Exchange (ETDEWEB)

    Bartal, Y. [Tel-Aviv Univ. (Israel); Leonardi, S.; Marchetti-Spaccamela, A. [Universita di Roma (Italy); Sgall, J. [Mathematical Inst., Zitna (Czechoslovakia)] [and others

    1996-12-31

    We consider a version of multiprocessor scheduling with the special feature that jobs may be rejected for a certain penalty. An instance of the problem is given by m identical parallel machines and a set of n jobs, each job characterized by a processing time and a penalty. In the on-line version the jobs arrive one by one and we have to schedule or reject a job before we have any information about future jobs. The objective is to minimize the makespan of the schedule for accepted jobs plus the sum of the penalties of rejected jobs. The main result is a 1 + {phi} {approx} 2.618 competitive algorithm for the on-line version of the problem, where 0 is the golden ratio. A matching lower bound shows that this is the best possible algorithm working for all m. For fixed m we give improved bounds, in particular for m = 2 we give an optimal {phi} {approx} 1.618 competitive algorithm. For the off-line problem we present a fully polynomial approximation scheme for fixed m and an approximation algorithm which runs in time O(n log n) for arbitrary m and guarantees 2 - 1/m approximation ratio.

  13. CMS Multicore Scheduling Strategy

    CERN Document Server

    Perez-Calero Yzquierdo, Antonio

    2014-01-01

    In the next years, processor architectures based on much larger numbers of cores will be most likely the model to continue Moores Law style throughput gains. This not only results in many more jobs in parallel running the LHC Run 1 era monolithic applications. Also the memory requirements of these processes push the workernode architectures to the limit. One solution is parallelizing the application itself, through forking and memory sharing or through threaded frameworks. CMS is following all of these approaches and has a comprehensive strategy to schedule multi-core jobs on the GRID based on the glideIn WMS submission infrastructure. We will present the individual components of the strategy, from special site specific queues used during provisioning of resources and implications to scheduling; to dynamic partitioning within a single pilot to allow to transition to multi-core or whole-node scheduling on site level without disallowing single-core jobs. In this presentation, we will present the experiences mad...

  14. Customer Appeasement Scheduling

    CERN Document Server

    Nikseresht, Mohammad R; Maheshwari, Anil

    2010-01-01

    Almost all of the current process scheduling algorithms which are used in modern operating systems (OS) have their roots in the classical scheduling paradigms which were developed during the 1970's. But modern computers have different types of software loads and user demands. We think it is important to run what the user wants at the current moment. A user can be a human, sitting in front of a desktop machine, or it can be another machine sending a request to a server through a network connection. We think that OS should become intelligent to distinguish between different processes and allocate resources, including CPU, to those processes which need them most. In this work, as a first step to make the OS aware of the current state of the system, we consider process dependencies and interprocess communications. We are developing a model, which considers the need to satisfy interactive users and other possible remote users or customers, by making scheduling decisions based on process dependencies and interproce...

  15. Scheduling a C-Section

    Science.gov (United States)

    ... Pregnancy > Labor & birth > Scheduling a c-section Scheduling a c-section E-mail to a friend Please fill in all fields. Please enter ... and develop before she’s born. Why can scheduling a c-section for non-medical reasons be a ...

  16. Flexible Scheduling: Making the Transition

    Science.gov (United States)

    Creighton, Peggy Milam

    2008-01-01

    Citing literature that supports the benefits of flexible scheduling on student achievement, the author exhorts readers to campaign for flexible scheduling in their library media centers. She suggests tips drawn from the work of Graziano (2002), McGregor (2006) and Stripling (1997) for making a smooth transition from fixed to flexible scheduling:…

  17. Probabilistic Bisimulation for Realistic Schedulers

    DEFF Research Database (Denmark)

    Eisentraut, Christian; Godskesen, Jens Christian; Hermanns, Holger

    2015-01-01

    . This holds in the classical context of arbitrary schedulers, but it has been argued that this class of schedulers is unrealistically powerful. This paper studies a strictly coarser notion of bisimilarity, which still enjoys these properties in the context of realistic subclasses of schedulers: Trace...

  18. Flexible Software for Flexible Scheduling

    Science.gov (United States)

    Economou, Frossie; Jenness, Tim; Tilanus, Remo P. J.; Hirst, Paul; Adamson, Andy J.; Rippa, Mathew; Delorey, Kynan K.; Isaak, Kate G.

    The JAC Observation Management Project (OMP) provides software for the James Clerk Maxwell (JCMT) and the United Kingdom Infrared (UKIRT) telescopes that manages the life-cycle of flexibly scheduled observations. Its aim is to increase observatory efficiency under flexible (queue) scheduled observing, without depriving the principal investigator (PI) of the flexibility associated with classical scheduling.

  19. Decision support system for vehicle scheduling

    Directory of Open Access Journals (Sweden)

    C. Gaindric

    1999-08-01

    Full Text Available A decision support system (DSS is described to form schedules of traffic from a central warehouse to a set of consumers by cyclic routes. The system may be used by dispatchers at transportation enterprises. The system structure, short description of modules, and algorithms solving the originating problems are presented.

  20. Minimizing the Makespan for Scheduling Problems with General Deterioration Effects

    Directory of Open Access Journals (Sweden)

    Xianyu Yu

    2013-01-01

    Full Text Available This paper investigates the scheduling problems with general deterioration models. By the deterioration models, the actual processing time functions of jobs depend not only on the scheduled position in the job sequence but also on the total weighted normal processing times of the jobs already processed. In this paper, the objective is to minimize the makespan. For the single-machine scheduling problems with general deterioration effects, we show that the considered problems are polynomially solvable. For the flow shop scheduling problems with general deterioration effects, we also show that the problems can be optimally solved in polynomial time under the proposed conditions.

  1. Schedules of controlled substances: temporary placement of three synthetic cathinones in Schedule I. Final Order.

    Science.gov (United States)

    2011-10-21

    The Administrator of the Drug Enforcement Administration (DEA) is issuing this final order to temporarily schedule three synthetic cathinones under the Controlled Substances Act (CSA) pursuant to the temporary scheduling provisions of 21 U.S.C. 811(h). The substances are 4-methyl-N-methylcathinone (mephedrone), 3,4-methylenedioxy-N-methylcathinone (methylone), and 3,4-methylenedioxypyrovalerone (MDPV). This action is based on a finding by the Administrator that the placement of these synthetic cathinones and their salts, isomers, and salts of isomers into Schedule I of the CSA is necessary to avoid an imminent hazard to the public safety. As a result of this order, the full effect of the CSA and its implementing regulations including criminal, civil and administrative penalties, sanctions and regulatory controls of Schedule I substances will be imposed on the manufacture, distribution, possession, importation, and exportation of these synthetic cathinones.

  2. A reduced feedback proportional fair multiuser scheduling scheme

    KAUST Repository

    Shaqfeh, Mohammad

    2011-12-01

    Multiuser switched-diversity scheduling schemes were recently proposed in order to overcome the heavy feedback requirements of conventional opportunistic scheduling schemes by applying a threshold-based, distributed and ordered scheduling mechanism. A slight reduction in the prospected multiuser diversity gains is an acceptable trade-off for great savings in terms of required channel-state-information feedback messages. In this work, we propose a novel proportional fair multiuser switched-diversity scheduling scheme and we demonstrate that it can be optimized using a practical and distributed method to obtain the per-user feedback thresholds. We demonstrate by numerical examples that our reduced feedback proportional fair scheduler operates within 0.3 bits/sec/Hz from the achievable rates by the conventional full feedback proportional fair scheduler in Rayleigh fading conditions. © 2011 IEEE.

  3. Distributed Research Project Scheduling Based on Multi-Agent Methods

    Directory of Open Access Journals (Sweden)

    Constanta Nicoleta Bodea

    2011-01-01

    Full Text Available Different project planning and scheduling approaches have been developed. The Operational Research (OR provides two major planning techniques: CPM (Critical Path Method and PERT (Program Evaluation and Review Technique. Due to projects complexity and difficulty to use classical methods, new approaches were developed. Artificial Intelligence (AI initially promoted the automatic planner concept, but model-based planning and scheduling methods emerged later on. The paper adresses the project scheduling optimization problem, when projects are seen as Complex Adaptive Systems (CAS. Taken into consideration two different approaches for project scheduling optimization: TCPSP (Time- Constrained Project Scheduling and RCPSP (Resource-Constrained Project Scheduling, the paper focuses on a multiagent implementation in MATLAB for TCSP. Using the research project as a case study, the paper includes a comparison between two multi-agent methods: Genetic Algorithm (GA and Ant Colony Algorithm (ACO.

  4. Healthcare Scheduling by Data Mining: Literature Review and Future Directions

    Directory of Open Access Journals (Sweden)

    Maria M. Rinder

    2012-01-01

    Full Text Available This article presents a systematic literature review of the application of industrial engineering methods in healthcare scheduling, with a focus on the role of patient behavior in scheduling. Nine articles that used mathematical programming, data mining, genetic algorithms, and local searches for optimum schedules were obtained from an extensive search of literature. These methods are new approaches to solve the problems in healthcare scheduling. Some are adapted from areas such as manufacturing and transportation. Key findings from these studies include reduced time for scheduling, capability of solving more complex problems, and incorporation of more variables and constraints simultaneously than traditional scheduling methods. However, none of these methods modeled no-show and walk-ins patient behavior. Future research should include more variables related to patient and/or environment.

  5. A-MMLQ Algorithm for Multi-level Queue Scheduling

    Directory of Open Access Journals (Sweden)

    Manupriya Hasija

    2013-07-01

    Full Text Available This being the era of advancement in computing domain, the emphasis is on better resource scheduling. Scheduling is not confined to dealing multiple tasks by a single processor. It’s a dawn with multiprocessing and multitasking. Although multiprocessor systems impose several overheads but still make the concept amazingly interesting. The scheduling field has taken a whirlwind after the notion of multiprocessing. Many of the uniprocessor algorithms do fit well under the multiprocessor systems but, still necessitating a further development aiming solely on multiprocessor scheduling. This paper thus sketches a new idea to modify and extend the well-known multi-level queue scheduling, taking into account the arrival time/ arrival sequence to conceptualize an innovative scheduling algorithm.

  6. Face me I face you

    Directory of Open Access Journals (Sweden)

    Mirka Koro-Ljungberg

    2016-10-01

    Full Text Available This iterative and a-signifying sound experimentation project started from simple wonderings that emerged from undocumented college students’ interview data. As the researchers began to reflect on the data provided by these students, conversations around noise and gossip began to emerge. Over time, the conversations about noise and gossip transmogrified into various soundscapes and audio recordings that extended also beyond noise and gossip. "Let’s work more with the sound and try to extend effects and create affects. Maybe produce another extension of that video in such a way that we would still be working with the thing, whatever the thing was" stated Mirka and Justin. Justin would go on to say, "It's less and less representational and signifying. Our sound encounters produce something different than what we originally intended them to be. Or they work, or function as whatever."

  7. European cinema: face to face with Hollywood

    NARCIS (Netherlands)

    T. Elsaesser

    2005-01-01

    In the face of renewed competition from Hollywood since the early 1980s and the challenges posed to Europe's national cinemas by the fall of the Wall in 1989, independent filmmaking in Europe has begun to re-invent itself. European Cinema: Face to Face with Hollywood re-assesses the different debate

  8. Mapping Teacher-Faces

    Science.gov (United States)

    Thompson, Greg; Cook, Ian

    2013-01-01

    This paper uses Deleuze and Guattari's concept of faciality to analyse the teacher's face. According to Deleuze and Guattari, the teacher-face is a special type of face because it is an "overcoded" face produced in specific landscapes. This paper suggests four limit-faces for teacher faciality that actualise different mixes of significance and…

  9. Levelled bed occupancy and controlled waiting lists using Master surgical schedules

    NARCIS (Netherlands)

    L. Evers (Lanah); J.M. van Oostrum (Jeroen); A.P.M. Wagelmans (Albert)

    2010-01-01

    textabstractScheduling surgical patients is one of the complex organizational tasks hospitals face daily. Master surgical scheduling is one way to optimize utilization of scarce resources and to create a more predictable outflow from the operating room towards subsequent hospital departments. The pa

  10. Levelled bed occupancy and controlled waiting lists using Master surgical schedules

    NARCIS (Netherlands)

    L. Evers (Lanah); J.M. van Oostrum (Jeroen); A.P.M. Wagelmans (Albert)

    2010-01-01

    textabstractScheduling surgical patients is one of the complex organizational tasks hospitals face daily. Master surgical scheduling is one way to optimize utilization of scarce resources and to create a more predictable outflow from the operating room towards subsequent hospital departments. The

  11. Face Gear Technology for Aerospace Power Transmission Progresses

    Science.gov (United States)

    2005-01-01

    the effects of manufacturing process improvements on the operating characteristics of face gears. The program is being conducted with McDonnell Douglas Helicopter Co., Lucas Western Inc., the University of Illinois at Chicago, and a NASA/U.S. Army team. The goal of the project is develop the grinding process, experimentally verify the improvement in face gear fatigue life, and conduct a full-scale helicopter transmission test. The theory and methodology to grind face gears has been completed, and manufacture of the test hardware is ongoing. Experimental verification on test hardware is scheduled to begin in fiscal 1996.

  12. Optimal Scheduling of Domestic Appliances via MILP

    Directory of Open Access Journals (Sweden)

    Zdenek Bradac

    2014-12-01

    Full Text Available This paper analyzes a consumption scheduling mechanism for domestic appliances within a home area network. The aim of the proposed scheduling is to minimize the total energy price paid by the consumer and to reduce power peaks in order to achieve a balanced daily load schedule. An exact and computationally efficient mixed-integer linear programming (MILP formulation of the problem is presented. This model is verified by several problem instances. Realistic scenarios based on the real price tariffs commercially available in the Czech Republic are calculated. The results obtained by solving the optimization problem are compared with a simulation of the ripple control service currently used by many domestic consumers in the Czech Republic.

  13. Effects of 4X4 Block Scheduling

    Directory of Open Access Journals (Sweden)

    R. Brian Cobb

    1999-02-01

    Full Text Available The effects of a 4 X 4 block scheduling program in a middle school on a variety of student measures were investigated. These measures included standardized achievement tests in mathematics, reading, and writing, cumulative and semester grades in middle school and high school, attendance rates, and enrollment rates in advanced high school courses (in mathematics only. The block scheduling program had been in effect for four years allowing analyses of current middle and high school students who had experienced a minimum of one and one-half years of block scheduling while in middle school. The primary research design was a post-test only, matched pairs design. Students were matched on school characteristics, gender, ethnicity, grade level, and 5th grade standardized reading scores. Results were relatively consistent with the extant literature and generally positive.

  14. Distributed job scheduling in MetaCentrum

    Science.gov (United States)

    Tóth, Šimon; Ruda, Miroslav

    2015-05-01

    MetaCentrum - The Czech National Grid provides access to various resources across the Czech Republic. The utilized resource management and scheduling system is based on a heavily modified version of the Torque Batch System. This open source resource manager is maintained in a local fork and was extended to facilitate the requirements of such a large installation. This paper provides an overview of unique features deployed in MetaCentrum. Notably, we describe our distributed setup that encompasses several standalone independent servers while still maintaining full cooperative scheduling across the grid. We also present the benefits of our virtualized infrastructure that enables our schedulers to dynamically request ondemand virtual machines, that are then used to facilitate the varied requirements of users in our system, as well as enabling support for user requested virtual clusters that can be further interconnected using a private VLAN.

  15. Investigating the use of interval algebra to schedule mechanically steered multistatic radars

    CSIR Research Space (South Africa)

    Focke, RW

    2015-02-01

    Full Text Available The findings presented in this thesis support the hypothesis that Interval Algebra (IA), as a temporal reasoning language, should perform scheduling of sensor dwells efficiently and effectively. Scheduling of multistatic radars was identified as a...

  16. Realistic Scheduling Mechanism for Smart Homes

    Directory of Open Access Journals (Sweden)

    Danish Mahmood

    2016-03-01

    Full Text Available In this work, we propose a Realistic Scheduling Mechanism (RSM to reduce user frustration and enhance appliance utility by classifying appliances with respective constraints and their time of use effectively. Algorithms are proposed regarding functioning of home appliances. A 24 hour time slot is divided into four logical sub-time slots, each composed of 360 min or 6 h. In these sub-time slots, only desired appliances (with respect to appliance classification are scheduled to raise appliance utility, restricting power consumption by a dynamically modelled power usage limiter that does not only take the electricity consumer into account but also the electricity supplier. Once appliance, time and power usage limiter modelling is done, we use a nature-inspired heuristic algorithm, Binary Particle Swarm Optimization (BPSO, optimally to form schedules with given constraints representing each sub-time slot. These schedules tend to achieve an equilibrium amongst appliance utility and cost effectiveness. For validation of the proposed RSM, we provide a comparative analysis amongst unscheduled electrical load usage, scheduled directly by BPSO and RSM, reflecting user comfort, which is based upon cost effectiveness and appliance utility.

  17. Hybrid Scheduling Model for Independent Grid Tasks

    Directory of Open Access Journals (Sweden)

    J. Shanthini

    2015-01-01

    Full Text Available Grid computing facilitates the resource sharing through the administrative domains which are geographically distributed. Scheduling in a distributed heterogeneous environment is intrinsically very hard because of the heterogeneous nature of resource collection. Makespan and tardiness are two different measures of scheduling, and many of the previous researches concentrated much on reduction of makespan, which measures the machine utilization. In this paper, we propose a hybrid scheduling algorithm for scheduling independent grid tasks with the objective of reducing total weighted tardiness of grid tasks. Tardiness is to measure the due date performance, which has a direct impact on cost for executing the jobs. In this paper we propose BG_ATC algorithm which is a combination of best gap (BG search and Apparent Tardiness Cost (ATC indexing algorithm. Furthermore, we implemented these two algorithms in two different phases of the scheduling process. In addition to that, the comparison was made on results with various benchmark algorithms and the experimental results show that our algorithm outperforms the benchmark algorithms.

  18. Hybrid stop schedule of urban rail train

    Directory of Open Access Journals (Sweden)

    Zhengmin Tan

    2015-01-01

    Full Text Available Purpose: In order to better serve the transport demand of urban area by rail, target at the Ur-ban Rail Train Stop Schedule problem.Design/methodology/approach: Bi-level mathematical programming model and game relation was used.Findings: A 0-1 bi-level mathematical programming model for urban rail transit hybrid Stop Schedule is developed when game relation between train Stop Schedule and passenger transfer choice is considered.Research limitations/implications: The research is still in progress. Practical implications: ChongQing urban rail line 2 was taken as an example, the practical application of the model has proved its feasibility and efficiency.Originality/value: A 0-1 bi-level mathematical programming model for urban rail transit hybrid Stop Schedule is developed. The upper level model is Stop Schedule targeting at the optimal profit from the operators side. The lower level model is passenger routing aims to minimize total travel time. According to its features, the bi-level model is integrated in order to be directly solvable by optimizing software.

  19. Analysis of Transmissions Scheduling with Packet Fragmentation

    Directory of Open Access Journals (Sweden)

    Nir Menakerman

    2001-12-01

    Full Text Available We investigate a scheduling problem in which packets, or datagrams, may be fragmented. While there are a few applications to scheduling with datagram fragmentation, our model of the problem is derived from a scheduling problem present in data over CATV networks. In the scheduling problem datagrams of variable lengths must be assigned (packed into fixed length time slots. One of the capabilities of the system is the ability to break a datagram into several fragments. When a datagram is fragmented, extra bits are added to the original datagram to enable the reassembly of all the fragments. We convert the scheduling problem into the problem of bin packing with item fragmentation, which we define in the following way: we are asked to pack a list of items into a minimum number of unit capacity bins. Each item may be fragmented in which case overhead units are added to the size of every fragment. The cost associated with fragmentation renders the problem NP-hard, therefore an approximation algorithm is needed. We define a version of the well-known Next-Fit algorithm, capable of fragmenting items, and investigate its performance. We present both worst case and average case results and compare them to the case where fragmentation is not allowed.

  20. Scheduling theory, algorithms, and systems

    CERN Document Server

    Pinedo, Michael L

    2016-01-01

    This new edition of the well-established text Scheduling: Theory, Algorithms, and Systems provides an up-to-date coverage of important theoretical models in the scheduling literature as well as important scheduling problems that appear in the real world. The accompanying website includes supplementary material in the form of slide-shows from industry as well as movies that show actual implementations of scheduling systems. The main structure of the book, as per previous editions, consists of three parts. The first part focuses on deterministic scheduling and the related combinatorial problems. The second part covers probabilistic scheduling models; in this part it is assumed that processing times and other problem data are random and not known in advance. The third part deals with scheduling in practice; it covers heuristics that are popular with practitioners and discusses system design and implementation issues. All three parts of this new edition have been revamped, streamlined, and extended. The reference...

  1. Social cognition in Williams syndrome: face tuning

    Directory of Open Access Journals (Sweden)

    Marina A Pavlova

    2016-08-01

    Full Text Available Many neurological, neurodevelopmental, neuropsychiatric and psychosomatic disorders are characterized by impairments in visual social cognition, body language reading, and facial assessment of a social counterpart. Yet a wealth of research indicates that individuals with Williams syndrome exhibit remarkable concern for social stimuli and face fascination. Here individuals with Williams syndrome were presented with a set of Face-n-Food images composed of food ingredients and in different degree resembling a face (slightly bordering on the Giuseppe Arcimboldo style. The primary advantage of these images is that single components do not explicitly trigger face-specific processing, whereas in face images commonly used for investigating face perception (such as photographs or depictions, the mere occurrence of typical cues already implicates face presence. In a spontaneous recognition task, participants were shown a set of images in a predetermined order from the least to most resembling a face. Strikingly, individuals with Williams syndrome exhibited profound deficits in recognition of the Face-n-Food images as a face: they did not report seeing a face on the images, which typically developing controls effortlessly recognized as a face, and gave overall fewer face responses. This suggests atypical face tuning in Williams syndrome. The outcome is discussed in the light of a general pattern of social cognition in Williams syndrome and brain mechanisms underpinning face processing.

  2. Research on key technology of revolving mining the triangle coal in boundaries of full-mechanized caving mining face with heavy equipment%重型装备综放工作面旋转开采边界三角煤关键技术研究∗

    Institute of Scientific and Technical Information of China (English)

    高维智; 张会军; 张学亮

    2015-01-01

    由于重型装备的综放工作面支架吨位大,前后部刮板输送机与转载机等端头设备搭接关系极其复杂,设备旋转过程中调架、移动管理难度极大,效率较低。因此,从重型设备综放工作面的设备搭接、工艺优化、巷道布置等方面做了详细研究,提出了重型装备综放工作面旋转开采成套关键技术。%The supports in full-mechanized caving mining face with heavy equipment have large tonnage,the lapping relations of end equipment such as scraper conveyer and reversed load-er are extremely complex,the difficulty of support shifting and movement management in process of equipment revolving is great and the efficiency is low. Based on above problems,e-quipment lapping,process optimization and roadway layout were researched,and the complete key technology of revolving mining in full-mechanized caving mining face with heavy equipment was put forward.

  3. The improved relative entropy for face recognition

    Directory of Open Access Journals (Sweden)

    Zhang Qi Rong

    2016-01-01

    Full Text Available The relative entropy is least sensitive to noise. In this paper, we propose the improved relative entropy for face recognition (IRE. The IRE method of recognition rate is far higher than the LDA, LPP method, by experimental results on CMU PIE face database and YALE B face database.

  4. Space Surveillance Network Scheduling Under Uncertainty: Models and Benefits

    Science.gov (United States)

    Valicka, C.; Garcia, D.; Staid, A.; Watson, J.; Rintoul, M.; Hackebeil, G.; Ntaimo, L.

    2016-09-01

    Advances in space technologies continue to reduce the cost of placing satellites in orbit. With more entities operating space vehicles, the number of orbiting vehicles and debris has reached unprecedented levels and the number continues to grow. Sensor operators responsible for maintaining the space catalog and providing space situational awareness face an increasingly complex and demanding scheduling requirements. Despite these trends, a lack of advanced tools continues to prevent sensor planners and operators from fully utilizing space surveillance resources. One key challenge involves optimally selecting sensors from a network of varying capabilities for missions with differing requirements. Another open challenge, the primary focus of our work, is building robust schedules that effectively plan for uncertainties associated with weather, ad hoc collections, and other target uncertainties. Existing tools and techniques are not amenable to rigorous analysis of schedule optimality and do not adequately address the presented challenges. Building on prior research, we have developed stochastic mixed-integer linear optimization models to address uncertainty due to weather's effect on collection quality. By making use of the open source Pyomo optimization modeling software, we have posed and solved sensor network scheduling models addressing both forms of uncertainty. We present herein models that allow for concurrent scheduling of collections with the same sensor configuration and for proactively scheduling against uncertain ad hoc collections. The suitability of stochastic mixed-integer linear optimization for building sensor network schedules under different run-time constraints will be discussed.

  5. An Approach to Face Recognition of 2-D Images Using Eigen Faces and PCA

    Directory of Open Access Journals (Sweden)

    Annapurna Mishra

    2012-04-01

    Full Text Available Face detection is to find any face in a given image. Face recognition is a two-dimension problem used for detecting faces. The information contained in a face can be analysed automatically by this system like identity, gender, expression, age, race and pose. Normally face detection is done for a single image but it can also be extended for video stream. As the face images are normally upright, they can be described by a small set of 2-D characteristics views. Here the face images are projected to a feature space or face space to encode the variation between the known face images. The projected feature space or the face space can be defined as ‘eigenfaces’ and can be formed by eigenvectors of the face image set. The above process can be used to recognize a new face in unsupervised manner. This paper introduces an algorithm which is used for effective face recognition. It takes into consideration not only the face extraction but also the mathematical calculations which enable us to bring the image into a simple and technical form. It can also be implemented in real-time using data acquisition hardware and software interface with the face recognition systems. Face recognition can be applied to various domains including security systems, personal identification, image and film processing and human computer interaction.

  6. 2007 Wholesale Power Rate Schedules : 2007 General Rate Schedule Provisions.

    Energy Technology Data Exchange (ETDEWEB)

    United States. Bonneville Power Administration.

    2006-11-01

    This schedule is available for the contract purchase of Firm Power to be used within the Pacific Northwest (PNW). Priority Firm (PF) Power may be purchased by public bodies, cooperatives, and Federal agencies for resale to ultimate consumers, for direct consumption, and for Construction, Test and Start-Up, and Station Service. Rates in this schedule are in effect beginning October 1, 2006, and apply to purchases under requirements Firm Power sales contracts for a three-year period. The Slice Product is only available for public bodies and cooperatives who have signed Slice contracts for the FY 2002-2011 period. Utilities participating in the Residential Exchange Program (REP) under Section 5(c) of the Northwest Power Act may purchase Priority Firm Power pursuant to the Residential Exchange Program. Rates under contracts that contain charges that escalate based on BPA's Priority Firm Power rates shall be based on the three-year rates listed in this rate schedule in addition to applicable transmission charges. This rate schedule supersedes the PF-02 rate schedule, which went into effect October 1, 2001. Sales under the PF-07 rate schedule are subject to BPA's 2007 General Rate Schedule Provisions (2007 GRSPs). Products available under this rate schedule are defined in the 2007 GRSPs. For sales under this rate schedule, bills shall be rendered and payments due pursuant to BPA's 2007 GRSPs and billing process.

  7. Face recognition increases during saccade preparation.

    Directory of Open Access Journals (Sweden)

    Hai Lin

    Full Text Available Face perception is integral to human perception system as it underlies social interactions. Saccadic eye movements are frequently made to bring interesting visual information, such as faces, onto the fovea for detailed processing. Just before eye movement onset, the processing of some basic features, such as the orientation, of an object improves at the saccade landing point. Interestingly, there is also evidence that indicates faces are processed in early visual processing stages similar to basic features. However, it is not known whether this early enhancement of processing includes face recognition. In this study, three experiments were performed to map the timing of face presentation to the beginning of the eye movement in order to evaluate pre-saccadic face recognition. Faces were found to be similarly processed as simple objects immediately prior to saccadic movements. Starting ∼ 120 ms before a saccade to a target face, independent of whether or not the face was surrounded by other faces, the face recognition gradually improved and the critical spacing of the crowding decreased as saccade onset was approaching. These results suggest that an upcoming saccade prepares the visual system for new information about faces at the saccade landing site and may reduce the background in a crowd to target the intended face. This indicates an important role of pre-saccadic eye movement signals in human face recognition.

  8. A Neuro Fuzzy Technique for Process Grain Scheduling of Parallel Jobs

    Directory of Open Access Journals (Sweden)

    S. V. Sudha

    2011-01-01

    Full Text Available Problem statement: We present development of neural network based fuzzy inference system for scheduling of parallel Jobs with the help of a real life workload data. The performance evaluation of a parallel system mainly depends on how the processes are co scheduled? Various co scheduling techniques available are First Come First Served, Gang Scheduling, Flexible Co Scheduling and Agile Algorithm Approach: In order to use a wide range of objective functions, we used a rule bases scheduling strategy. The rule system depends on scheduling results of the agile algorithm and classifies all possible scheduling states and assigns an appropriate scheduling strategy based on actual state. The rule bases were developed with the help of a real workload data. Results: With the help of rule base results, scheduling was done again, which is compared with the first come first served, gang scheduling, flexible co scheduling and agile algorithm. The results of scheduling showed the optimized results of agile algorithm with the help of neuro fuzzy optimization technique. Conclusion: The study confirmed that the Neuro Fuzzy Technique can be used as a better optimization tool for optimizing any scheduling algorithm, This optimization tool is used for agile algorithm which is further used for process grain scheduling of parallel jobs.

  9. A Model and Solution Method for Solving the Real-world and Complex Problem of Scheduling Visits to Customers

    Directory of Open Access Journals (Sweden)

    M.G. Baldoquin de la Peña

    2014-06-01

    Full Text Available Some of the complex logistical problems faced by companies combine the needs for strategic and tactical decisions concerning the interrelated issues of clustering, scheduling, and routing. Various strategies can be used to solve these problems. We present a problem of this type, involving a company whose fundamental objective is the commercialization of its product in the domestic market. The paper focuses on a model of and method for a solution to the problem of scheduling visits to customers, taking into account the relationship with other phases of product marketing. The model is nonlinear, involves binary and continuous variables, and solved heuristically. Computational experiments show that the proposed solution performed very well for both real-life and theoretical instances.

  10. MULTICRITERIA HYBRID FLOW SHOP SCHEDULING PROBLEM: LITERATURE REVIEW, ANALYSIS, AND FUTURE RESEARCH

    Directory of Open Access Journals (Sweden)

    Marcia de Fatima Morais

    2014-12-01

    Full Text Available This research focuses on the Hybrid Flow Shop production scheduling problem, which is one of the most difficult problems to solve. The literature points to several studies that focus the Hybrid Flow Shop scheduling problem with monocriteria functions. Despite of the fact that, many real world problems involve several objective functions, they can often compete and conflict, leading researchers to concentrate direct their efforts on the development of methods that take consider this variant into consideration. The goal of the study is to review and analyze the methods in order to solve the Hybrid Flow Shop production scheduling problem with multicriteria functions in the literature. The analyses were performed using several papers that have been published over the years, also the parallel machines types, the approach used to develop solution methods, the type of method develop, the objective function, the performance criterion adopted, and the additional constraints considered. The results of the reviewing and analysis of 46 papers showed opportunities for future research on this topic, including the following: (i use uniform and dedicated parallel machines, (ii use exact and metaheuristics approaches, (iv develop lower and uppers bounds, relations of dominance and different search strategies to improve the computational time of the exact methods,  (v develop  other types of metaheuristic, (vi work with anticipatory setups, and (vii add constraints faced by the production systems itself.

  11. The LSST OCS scheduler design

    Science.gov (United States)

    Delgado, Francisco; Schumacher, German

    2014-08-01

    The Large Synoptic Survey Telescope (LSST) is a complex system of systems with demanding performance and operational requirements. The nature of its scientific goals requires a special Observatory Control System (OCS) and particularly a very specialized automatic Scheduler. The OCS Scheduler is an autonomous software component that drives the survey, selecting the detailed sequence of visits in real time, taking into account multiple science programs, the current external and internal conditions, and the history of observations. We have developed a SysML model for the OCS Scheduler that fits coherently in the OCS and LSST integrated model. We have also developed a prototype of the Scheduler that implements the scheduling algorithms in the simulation environment provided by the Operations Simulator, where the environment and the observatory are modeled with real weather data and detailed kinematics parameters. This paper expands on the Scheduler architecture and the proposed algorithms to achieve the survey goals.

  12. DTS: Building custom, intelligent schedulers

    Science.gov (United States)

    Hansson, Othar; Mayer, Andrew

    1994-01-01

    DTS is a decision-theoretic scheduler, built on top of a flexible toolkit -- this paper focuses on how the toolkit might be reused in future NASA mission schedulers. The toolkit includes a user-customizable scheduling interface, and a 'Just-For-You' optimization engine. The customizable interface is built on two metaphors: objects and dynamic graphs. Objects help to structure problem specifications and related data, while dynamic graphs simplify the specification of graphical schedule editors (such as Gantt charts). The interface can be used with any 'back-end' scheduler, through dynamically-loaded code, interprocess communication, or a shared database. The 'Just-For-You' optimization engine includes user-specific utility functions, automatically compiled heuristic evaluations, and a postprocessing facility for enforcing scheduling policies. The optimization engine is based on BPS, the Bayesian Problem-Solver (1,2), which introduced a similar approach to solving single-agent and adversarial graph search problems.

  13. Learning faces: similar comparator faces do not improve performance.

    Directory of Open Access Journals (Sweden)

    Scott P Jones

    Full Text Available Recent evidence indicates that comparison of two similar faces can aid subsequent discrimination between them. However, the fact that discrimination between two faces is facilitated by comparing them directly does not demonstrate that comparison produces a general improvement in the processing of faces. It remains an open question whether the opportunity to compare a "target" face to similar faces can facilitate the discrimination of the exposed target face from other nonexposed faces. In Experiment 1, selection of a target face from an array of novel foils was not facilitated by intermixed exposure to the target and comparators of the same sex. Experiment 2 also found no advantage for similar comparators (morphed towards the target over unmorphed same sex comparators, or over repeated target exposure alone. But all repeated exposure conditions produced better performance than a single brief presentation of the target. Experiment 3 again demonstrated that repeated exposure produced equivalent learning in same sex and different sex comparator conditions, and also showed that increasing the number of same sex or different sex comparators failed to improve identification. In all three experiments, exposure to a target alongside similar comparators failed to support selection of the target from novel test stimuli to a greater degree than exposure alongside dissimilar comparators or repeated target exposure alone. The current results suggest that the facilitatory effects of comparison during exposure may be limited to improving discrimination between exposed stimuli, and thus our results do not support the idea that providing the opportunity for comparison is a practical means for improving face identification.

  14. Multithread Face Recognition in Cloud

    Directory of Open Access Journals (Sweden)

    Dakshina Ranjan Kisku

    2016-01-01

    Full Text Available Faces are highly challenging and dynamic objects that are employed as biometrics evidence in identity verification. Recently, biometrics systems have proven to be an essential security tools, in which bulk matching of enrolled people and watch lists is performed every day. To facilitate this process, organizations with large computing facilities need to maintain these facilities. To minimize the burden of maintaining these costly facilities for enrollment and recognition, multinational companies can transfer this responsibility to third-party vendors who can maintain cloud computing infrastructures for recognition. In this paper, we showcase cloud computing-enabled face recognition, which utilizes PCA-characterized face instances and reduces the number of invariant SIFT points that are extracted from each face. To achieve high interclass and low intraclass variances, a set of six PCA-characterized face instances is computed on columns of each face image by varying the number of principal components. Extracted SIFT keypoints are fused using sum and max fusion rules. A novel cohort selection technique is applied to increase the total performance. The proposed protomodel is tested on BioID and FEI face databases, and the efficacy of the system is proven based on the obtained results. We also compare the proposed method with other well-known methods.

  15. Littoral Combat Ship Crew Scheduling

    Science.gov (United States)

    2015-03-01

    package DON Department of the Navy F&R Fix and Relax GAMS General Algebraic Modeling System LCS Littoral Combat Ship LCSRON Littoral Combat Ship...but that can be acceptable depending on the scheduler needs. F&R produces superior long-term schedules when compared to a similar-length RH schedule...LEFT BLANK 29 IV. MODEL IMPLEMENTATION LCSS is implemented with the General Algebraic Modeling System (GAMS) using the GAMS/CPLEX (GAMS, 2014

  16. Face-Lift

    Science.gov (United States)

    Tests and Procedures Face-lift By Mayo Clinic Staff A face-lift (rhytidectomy) is a cosmetic surgical procedure to improve the look of your face and neck. During a face-lift, facial soft tissues are lifted, excess skin is ...

  17. Design and Implementation of a Two Level Scheduler for HADOOP Data Grids

    Directory of Open Access Journals (Sweden)

    Dr G. Sudha sadhasivam

    2010-03-01

    Full Text Available Hadoop is a large scale distributed processing infrastructure designed to handle data intensive applications. In a commercial large scale cluster framework, a scheduler distributes user jobs evenly among the cluster resources. The proposed work enhances Hadoop’s fair scheduler that queues the jobs for execution in a fine grained manner using task scheduling. In contrast, the proposed approach allows backfilling ofjobs submitted to the scheduler. Thus job level and task level scheduling is enabled by this approach. The jobs are fairly scheduled with fairness among users, pools and priority. The outcome of the proposed work is that short narrow jobs will be executed in the slot if sufficient resource is not available for larger jobs. Thus shorter jobs get executed faster by the scheduler when compared to the existing fair scheduling policy that schedules tasks based on their fairness of remaining execution time. This approach prevents the starvation of smaller jobs if sufficient resources are available.

  18. A Scheduling Algorithm Based on Communication Delay for Wireless Network Control System

    Directory of Open Access Journals (Sweden)

    Jun Wang

    2012-09-01

    Full Text Available In this study, a scheduling algorithm based on communication delay is proposed. This scheduling algorithm can tolerate delay of periodic communication tasks in wireless network control system. It resolves real-time problem of periodic communication tasks in wireless network control system and partly reduces overtime phenomenon of periodic communication tasks caused by delay in wireless network. At the same time, the nonlinear programming model is built for solving scheduling timetable based on the proposed scheduling algorithm. Finally, the performance of the proposed scheduling algorithm is evaluated by an application example. The statistics results show that it is more effective than traditional scheduling algorithms in wireless network control system.

  19. Refrigerator Optimal Scheduling to Minimise the Cost of Operation

    Directory of Open Access Journals (Sweden)

    Bálint Roland

    2016-12-01

    Full Text Available The cost optimal scheduling of a household refrigerator is presented in this work. The fundamental approach is the model predictive control methodology applied to the piecewise affine model of the refrigerator.

  20. Scheduling the powering tests

    CERN Document Server

    Barbero-Soto, E; Casas-Lino, M P; Fernandez-Robles, C; Foraz, K; Pojer, M; Saban, R; Schmidt, R; Solfaroli-Camillocci, M; Vergara-Fernandez, A

    2008-01-01

    The Large Hadron Collider is now entering in its final phase before receiving beam, and the activities at CERN between 2007 and 2008 have shifted from installation work to the commissioning of the technical systems ("hardware commissioning"). Due to the unprecedented complexity of this machine, all the systems are or will be tested as far as possible before the cool-down starts. Systems are firstly tested individually before being globally tested together. The architecture of LHC, which is partitioned into eight cryogenically and electrically independent sectors, allows the commissioning on a sector by sector basis. When a sector reaches nominal cryogenic conditions, commissioning of the magnet powering system to nominal current for all magnets can be performed. This paper briefly describes the different activities to be performed during the powering tests of the superconducting magnet system and presents the scheduling issues raised by co-activities as well as the management of resources.

  1. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    In today’s globalized society, transport contributes to our daily life in many different ways. The production of the parts for a shelf ready product may take place on several continents and our travel between home and work, vacation travel and business trips has increased in distance the last......, the effectiveness of the network is of importance aiming at satisfying as many costumer demands as possible at a low cost. Routing represent a path between locations such as an origin and destination for the object routed. Sometimes routing has a time dimension as well as the physical paths. This may...... to a destination on a predefined network, the routing and scheduling of vessels in a liner shipping network given a demand forecast to be covered, the routing of manpower and vehicles transporting disabled passengers in an airport and the vehicle routing with time windows where one version studied includes edge...

  2. Visually Exploring Transportation Schedules.

    Science.gov (United States)

    Palomo, Cesar; Guo, Zhan; Silva, Cláudio T; Freire, Juliana

    2016-01-01

    Public transportation schedules are designed by agencies to optimize service quality under multiple constraints. However, real service usually deviates from the plan. Therefore, transportation analysts need to identify, compare and explain both eventual and systemic performance issues that must be addressed so that better timetables can be created. The purely statistical tools commonly used by analysts pose many difficulties due to the large number of attributes at trip- and station-level for planned and real service. Also challenging is the need for models at multiple scales to search for patterns at different times and stations, since analysts do not know exactly where or when relevant patterns might emerge and need to compute statistical summaries for multiple attributes at different granularities. To aid in this analysis, we worked in close collaboration with a transportation expert to design TR-EX, a visual exploration tool developed to identify, inspect and compare spatio-temporal patterns for planned and real transportation service. TR-EX combines two new visual encodings inspired by Marey's Train Schedule: Trips Explorer for trip-level analysis of frequency, deviation and speed; and Stops Explorer for station-level study of delay, wait time, reliability and performance deficiencies such as bunching. To tackle overplotting and to provide a robust representation for a large numbers of trips and stops at multiple scales, the system supports variable kernel bandwidths to achieve the level of detail required by users for different tasks. We justify our design decisions based on specific analysis needs of transportation analysts. We provide anecdotal evidence of the efficacy of TR-EX through a series of case studies that explore NYC subway service, which illustrate how TR-EX can be used to confirm hypotheses and derive new insights through visual exploration.

  3. Bracing Zonohedra With Special Faces

    Directory of Open Access Journals (Sweden)

    Nagy Gyula

    2015-12-01

    Full Text Available The analysis of simpler preliminary design gives useful input for more complicated three-dimensional building frame structure. A zonohedron, as a preliminary structure of design, is a convex polyhedron for which each face possesses central symmetry. We considered zonohedron as a special framework with the special assumption that the polygonal faces can be deformed in such a way that faces remain planar and centrally symmetric, moreover the length of all edges remains unchanged. Introducing some diagonal braces we got a new mechanism. This paper deals with the flexibility of this kind of mechanisms, and investigates the rigidity of the braced framework. The flexibility of the framework can be characterized by some vectors, which represent equivalence classes of the edges. A necessary and sufficient condition for the rigidity of the braced rhombic face zonohedra is posed. A real mechanical construction, based on two simple elements, provides a CAD prototype of these new mechanisms.

  4. Face Recognition in Various Illuminations

    Directory of Open Access Journals (Sweden)

    Saurabh D. Parmar,

    2014-05-01

    Full Text Available Face Recognition (FR under various illuminations is very challenging. Normalization technique is useful for removing the dimness and shadow from the facial image which reduces the effect of illumination variations still retaining the necessary information of the face. The robust local feature extractor which is the gray-scale invariant texture called Local Binary Pattern (LBP is helpful for feature extraction. K-Nearest Neighbor classifier is utilized for the purpose of classification and to match the face images from the database. Experimental results were based on Yale-B database with three different sub categories. The proposed method has been tested to robust face recognition in various illumination conditions. Extensive experiment shows that the proposed system can achieve very encouraging performance in various illumination environments.

  5. Covert Face Recognition without Prosopagnosia

    Directory of Open Access Journals (Sweden)

    H. D. Ellis

    1993-01-01

    Full Text Available An experiment is reported where subjects were presented with familiar or unfamiliar faces for supraliminal durations or for durations individually assessed as being below the threshold for recognition. Their electrodermal responses to each stimulus were measured and the results showed higher peak amplitude skin conductance responses for familiar than for unfamiliar faces, regardless of whether they had been displayed supraliminally or subliminally. A parallel is drawn between elevated skin conductance responses to subliminal stimuli and findings of covert recognition of familiar faces in prosopagnosic patients, some of whom show increased electrodermal activity (EDA to previously familiar faces. The supraliminal presentation data also served to replicate similar work by Tranel et al (1985. The results are considered alongside other data indicating the relation between non-conscious, “automatic” aspects of normal visual information processing and abilities which can be found to be preserved without awareness after brain injury.

  6. An Approach to Face Recognition of 2-D Images Using Eigen Faces and PCA

    Directory of Open Access Journals (Sweden)

    Annapurna Mishra

    2012-05-01

    Full Text Available Face detection is to find any face in a given image. Face recognition is a two-dimension problem used fordetecting faces. The information contained in a face can be analysed automatically by this system likeidentity, gender, expression, age, race and pose. Normally face detection is done for a single image but itcan also be extended for video stream. As the face images are normally upright, they can be described by asmall set of 2-D characteristics views. Here the face images are projected to a feature space or face spaceto encode the variation between the known face images. The projected feature space or the face space canbe defined as ‘eigenfaces’ and can be formed by eigenvectors of the face image set. The above process canbe used to recognize a new face in unsupervised manner. This paper introduces an algorithm which is usedfor effective face recognition. It takes into consideration not only the face extraction but also themathematical calculations which enable us to bring the image into a simple and technical form. It can alsobe implemented in real-time using data acquisition hardware and software interface with the facerecognition systems. Face recognition can be applied to various domains including security systems,personal identification, image and film processing and human computer interaction.

  7. Attractive faces temporally modulate visual attention

    Directory of Open Access Journals (Sweden)

    Koyo eNakamura

    2014-06-01

    Full Text Available Facial attractiveness is an important biological and social signal on social interaction. Recent research has demonstrated that an attractive face captures greater spatial attention than an unattractive face does. Little is known, however, about the temporal characteristics of visual attention for facial attractiveness. In this study, we investigated the temporal modulation of visual attention induced by facial attractiveness by using a rapid serial visual presentation (RSVP. Fourteen male faces and two female faces were successively presented for 160 ms respectively, and participants were asked to identify two female faces embedded among a series of multiple male distractor faces. Identification of a second female target (T2 was impaired when a first target (T1 was attractive compared to neutral or unattractive faces, at 320 ms SOA; identification was improved when T1 was attractive compared to unattractive faces at 640 ms SOA. These findings suggest that the spontaneous appraisal of facial attractiveness modulates temporal attention.

  8. Face Recognition Based on Facial Features

    Directory of Open Access Journals (Sweden)

    Muhammad Sharif

    2012-08-01

    Full Text Available Commencing from the last decade several different methods have been planned and developed in the prospect of face recognition that is one of the chief stimulating zone in the area of image processing. Face recognitions processes have various applications in the prospect of security systems and crime investigation systems. The study is basically comprised of three phases, i.e., face detection, facial features extraction and face recognition. The first phase is the face detection process where region of interest i.e., features region is extracted. The 2nd phase is features extraction. Here face features i.e., eyes, nose and lips are extracted out commencing the extracted face area. The last module is the face recognition phase which makes use of the extracted left eye for the recognition purpose by combining features of Eigenfeatures and Fisherfeatures.

  9. Robust Face Image Matching under Illumination Variations

    Directory of Open Access Journals (Sweden)

    Yang Chyuan-Huei Thomas

    2004-01-01

    Full Text Available Face image matching is an essential step for face recognition and face verification. It is difficult to achieve robust face matching under various image acquisition conditions. In this paper, a novel face image matching algorithm robust against illumination variations is proposed. The proposed image matching algorithm is motivated by the characteristics of high image gradient along the face contours. We define a new consistency measure as the inner product between two normalized gradient vectors at the corresponding locations in two images. The normalized gradient is obtained by dividing the computed gradient vector by the corresponding locally maximal gradient magnitude. Then we compute the average consistency measures for all pairs of the corresponding face contour pixels to be the robust matching measure between two face images. To alleviate the problem due to shadow and intensity saturation, we introduce an intensity weighting function for each individual consistency measure to form a weighted average of the consistency measure. This robust consistency measure is further extended to integrate multiple face images of the same person captured under different illumination conditions, thus making our robust face matching algorithm. Experimental results of applying the proposed face image matching algorithm on some well-known face datasets are given in comparison with some existing face recognition methods. The results show that the proposed algorithm consistently outperforms other methods and achieves higher than 93% recognition rate with three reference images for different datasets under different lighting conditions.

  10. New measuring techniques in the drill bit for recording of the full-face cutting rate and consolidation of the roadway sides in the drill bit area; Neue Messverfahren im Bohrkopf zur Erfassung des Vollschnittmaschinenvortriebs und Konsolidierung der Streckenstoesse im Bohrkopfbereich

    Energy Technology Data Exchange (ETDEWEB)

    Kuehnemann, D.

    1990-10-01

    The safety of full-face cutting machines has to be assured also in greater depths. In addition, one wants to attain information about the rock conditions as early as possible in the case of occurring faults. For this reason, new systems were to be developed for monitoring of full-face cutting machines. Numerous measuring systems and monitoring systems were used and examined within the framework of the project works. It soon turned out that new systems had to be developed and tested for precise monitoring. Flexible microprocessor systems, sensors and actuators were developed and tested for the respective specific case of application. After several years of development work a new system was developed, which is continuous and transparently from the drill bit area to the surface area. Excavations in the drill bit area are recognized already immediately behind the drift face. Position and quantity of the excavations are transmitted and processed to a central microprocessor by underground ultrasonic sensors. With the aid of specific technologies and newly developed building materials, these excavations are already consolidated and/or saved in the drill bit in front of the dust shield. The cutting rolls are monitored above ground, and the position of the full-face cutting machine is specified above ground. The automatic control via a laser sensor system is also carried out from above ground. In addition to control and monitoring, all other relevant parameters are transmitted from the underground machine to the surface, where they are indicated and recorded. With the technical data which are available in the computer, the data required for optimal heading are determined and transmitted to the control elements of the microprocessors. (orig./HS). [Deutsch] Um die Sicherheit bei Vollschnittmaschinen mit dem Vordringen in groessere Teufen zu gewaehrleisten und um moeglichst fruehe Kenntnisse der vorhandenen Gebirgsverhaeltnisse bei auftretenden Stoerungen zu erlangen waren

  11. Major Half Served First (MHSF Disk Scheduling Algorithm

    Directory of Open Access Journals (Sweden)

    Manish Kumar Mishra

    2013-01-01

    Full Text Available I/O performance has been improved by proper scheduling of disk accesses since the time movable head disk came into existence. Disk scheduling is the process of carefully examining the pending requests to determine the most efficient way to service the pending requests. Scheduling algorithms generally concentrate on reducing seek times for a set of requests, because seek times tend to be an order of magnitude greater than latency times. Some important scheduling algorithms are First-Come-First-Served (FCFS, Shortest Seek Time First (SSTF, SCAN, Circular Scan (C-SCAN and LOOK. This paper proposes a new disk scheduling algorithm called Major Half Served First (MHSF. Simulation results show that using MHSF the service is fast and seek time has been reduced drastically.

  12. Optimising steel production schedules via a hierarchical genetic algorithm

    Directory of Open Access Journals (Sweden)

    Worapradya, Kiatkajohn

    2014-08-01

    Full Text Available This paper presents an effective scheduling in a steel-making continuous casting (SCC plant. The main contribution of this paper is the formulation of a new optimisation model that more closely represents real-world situations, and a hierarchical genetic algorithm (HGA tailored particularly for searching for an optimal SCC schedule. The optimisation model is developed by integrating two main planning phases of traditional scheduling: (1 planning cast sequence, and (2 scheduling of steel-making and timing of all jobs. A novel procedure is given for genetic algorithm (GA chromosome coding that maps Gantt chart and hierarchical chromosomes. The performance of the proposed methodology is illustrated and compared with a two-phase traditional scheduling and a standard GA toolbox. Both qualitative and quantitative performance measures are investigated.

  13. A Scheduling Algorithm Based on Petri Nets and Simulated Annealing

    Directory of Open Access Journals (Sweden)

    Rachida H. Ghoul

    2007-01-01

    Full Text Available This study aims at presenting a hybrid Flexible Manufacturing System "HFMS" short-term scheduling problem. Based on the art state of general scheduling algorithms, we present the meta-heuristic, we have decided to apply for a given example of HFMS. That was the study of Simulated Annealing Algorithm SA. The HFMS model based on hierarchical Petri nets, was used to represent static and dynamic behavior of the HFMS and design scheduling solutions. Hierarchical Petri nets model was regarded as being made up a set of single timed colored Petri nets models. Each single model represents one process which was composed of many operations and tasks. The complex scheduling problem was decomposed in simple sub-problems. Scheduling algorithm was applied on each sub model in order to resolve conflicts on shared production resources.

  14. Scheduling IT Staff at a Bank: A Mathematical Programming Approach

    Directory of Open Access Journals (Sweden)

    M. Labidi

    2014-01-01

    Full Text Available We address a real-world optimization problem: the scheduling of a Bank Information Technologies (IT staff. This problem can be defined as the process of constructing optimized work schedules for staff. In a general sense, it requires the allocation of suitably qualified staff to specific shifts to meet the demands for services of an organization while observing workplace regulations and attempting to satisfy individual work preferences. A monthly shift schedule is prepared to determine the shift duties of each staff considering shift coverage requirements, seniority-based workload rules, and staff work preferences. Due to the large number of conflicting constraints, a multiobjective programming model has been proposed to automate the schedule generation process. The suggested mathematical model has been implemented using Lingo software. The results indicate that high quality solutions can be obtained within a few seconds compared to the manually prepared schedules.

  15. Second Year Analysis of a Hybrid Schedule High School

    Directory of Open Access Journals (Sweden)

    James B. Schreiber

    2001-11-01

    Full Text Available The current study examined two independent sophomore cohorts from a mid-western high school that had implemented a multi-schedule system (i.e., traditional, block, hybrid. The purpose of the study was to examine differences among the schedule types, gender, and GPA group on a state mandated standardized test. Analysis of covariance was used to examine the differences. Results indicate that a significant difference among schedule types was observed for only one cohort and for only one test (mathematics-computation. Results also indicate that schedule type did not significantly interact with gender or GPA group. The authors conclude that for these cohorts the type of schedule does not negatively or positively influence achievement.

  16. An Iterated Local Search Algorithm for a Place Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Shicheng Hu

    2013-01-01

    Full Text Available We study the place scheduling problem which has many application backgrounds in realities. For the block manufacturing project with special manufacturing platform requirements, we propose a place resource schedule problem. First, the mathematical model for the place resource schedule problem is given. On the basis of resource-constrained project scheduling problem and packing problem, we develop a hybrid heuristic method which combines priority rules and three-dimensional best fit algorithm, in which the priority rules determine the scheduling order and the three-dimensional best fit algorithm solves the placement. After this method is used to get an initial solution, the iterated local search is employed to get an improvement. Finally, we use a set of simulation data to demonstrate the steps of the proposed method and verify its feasibility.

  17. Manufacturing Scheduling Using Colored Petri Nets and Reinforcement Learning

    Directory of Open Access Journals (Sweden)

    Maria Drakaki

    2017-02-01

    Full Text Available Agent-based intelligent manufacturing control systems are capable to efficiently respond and adapt to environmental changes. Manufacturing system adaptation and evolution can be addressed with learning mechanisms that increase the intelligence of agents. In this paper a manufacturing scheduling method is presented based on Timed Colored Petri Nets (CTPNs and reinforcement learning (RL. CTPNs model the manufacturing system and implement the scheduling. In the search for an optimal solution a scheduling agent uses RL and in particular the Q-learning algorithm. A warehouse order-picking scheduling is presented as a case study to illustrate the method. The proposed scheduling method is compared to existing methods. Simulation and state space results are used to evaluate performance and identify system properties.

  18. Performance Analysis of CPU Scheduling Algorithms with Novel OMDRRS Algorithm

    Directory of Open Access Journals (Sweden)

    Neetu Goel

    2016-01-01

    Full Text Available CPU scheduling is one of the most primary and essential part of any operating system. It prioritizes processes to efficiently execute the user requests and help in choosing the appropriate process for execution. Round Robin (RR & Priority Scheduling(PS are one of the most widely used and acceptable CPU scheduling algorithm. But, its performance degrades with respect to turnaround time, waiting time & context switching with each recurrence. A New scheduling algorithm OMDRRS is developed to improve the performance of RR and priority scheduling algorithms. The new algorithm performs better than the popular existing algorithm. Drastic improvement is seen in waiting time, turnaround time, response time and context switching. Comparative analysis of Turn around Time(TAT, Waiting Time(WT, Response Time (RT is shown with the help of ANOVA and t-test.

  19. Job Scheduling with Efficient Resource Monitoring in Cloud Datacenter

    Directory of Open Access Journals (Sweden)

    Shyamala Loganathan

    2015-01-01

    Full Text Available Cloud computing is an on-demand computing model, which uses virtualization technology to provide cloud resources to users in the form of virtual machines through internet. Being an adaptable technology, cloud computing is an excellent alternative for organizations for forming their own private cloud. Since the resources are limited in these private clouds maximizing the utilization of resources and giving the guaranteed service for the user are the ultimate goal. For that, efficient scheduling is needed. This research reports on an efficient data structure for resource management and resource scheduling technique in a private cloud environment and discusses a cloud model. The proposed scheduling algorithm considers the types of jobs and the resource availability in its scheduling decision. Finally, we conducted simulations using CloudSim and compared our algorithm with other existing methods, like V-MCT and priority scheduling algorithms.

  20. Grid Computing based on Game Optimization Theory for Networks Scheduling

    Directory of Open Access Journals (Sweden)

    Peng-fei Zhang

    2014-05-01

    Full Text Available The resource sharing mechanism is introduced into grid computing algorithm so as to solve complex computational tasks in heterogeneous network-computing problem. However, in the Grid environment, it is required for the available resource from network to reasonably schedule and coordinate, which can get a good workflow and an appropriate network performance and network response time. In order to improve the performance of resource allocation and task scheduling in grid computing method, a game model based on non-cooperation game is proposed. Setting the time and cost of user’s resource allocation can increase the performance of networks, and incentive resource of networks uses an optimization scheduling algorithm, which minimizes the time and cost of resource scheduling. Simulation experiment results show the feasibility and suitability of model. In addition, we can see from the experiment result that model-based genetic algorithm is the best resource scheduling algorithm

  1. Study on the Strategy and Model of the Full Scenario Cascade Hydropower Biennial Stochastic Scheduling Considering the End-year Water Level%考虑年末预留水位的全景梯级水电跨年随机调度策略及模型

    Institute of Scientific and Technical Information of China (English)

    张粒子; 杨阳

    2014-01-01

    As for the reservation optimization of the end-year water level for the large cascade hydropower plant, the inflow at risk (IaR) method under the given confidence level was proposed to calculate the dependable inflow of the first year, and a full-scenario biennial stochastic scheduling model of cascade hydropower plant was proposed to maximize the generation profits which will adapt the optimized water level to the constraints under different scenarios in the following year. The conditional value at risk (CVaR) was applied to illustrate the risk of the generation profit, and the bi-level programming combing the economy and the risk of the generation profit was constructed. As for the solution of the proposed mixed-integer linear programming model, the optimal Benders decomposition with the integrated control of the master problem and the subproblems was proposed to solve the model. A 2-cascaded station was utilized to test the proposed model, and the results show that the total generation profit is improved, the average spillage was reduced, and the high efficiency of the optimal Benders decomposition strategy was also proved.%针对大型梯级水电年末预留水位优化问题,提出在给定置信度条件下的来水在险值(inflow at risk,IaR)方法,用以计算第1年可靠来水流量,并构建以发电收益最大化为目标的全景梯级水电跨年随机优化调度模型,使得年末预留水位能够适应第2年多种来水情况下的运行约束。采用条件风险价值(conditional value at risk,CVaR)指标衡量发电收益风险,并建立将发电收益经济性与风险性统一的双层规划模型。针对所建混合整数线性规划模型的解算,提出了主、子问题一体控制的最优奔德斯(Benders)分解方法,并对模型进行求解。对一个2级梯级水电站系统进行仿真分析,结果表明,所提出的全景跨年随机优化调度模型在不同风险偏好下,可以有效提高梯级

  2. The Effectiveness of Block Scheduling.

    Science.gov (United States)

    Creamean, Sharon Lightle; Horvath, Robert Jeffery

    This report describes a program for the exploration of block scheduling. The targeted population consists of high school students in a growing, middle-class community, located in a suburban setting of a large mid-western city. The historical background of block scheduling is documented through data gathered using attendance reports, student…

  3. Astronaut Office Scheduling System Software

    Science.gov (United States)

    Brown, Estevancio

    2010-01-01

    AOSS is a highly efficient scheduling application that uses various tools to schedule astronauts weekly appointment information. This program represents an integration of many technologies into a single application to facilitate schedule sharing and management. It is a Windows-based application developed in Visual Basic. Because the NASA standard office automation load environment is Microsoft-based, Visual Basic provides AO SS developers with the ability to interact with Windows collaboration components by accessing objects models from applications like Outlook and Excel. This also gives developers the ability to create newly customizable components that perform specialized tasks pertaining to scheduling reporting inside the application. With this capability, AOSS can perform various asynchronous tasks, such as gathering/ sending/ managing astronauts schedule information directly to their Outlook calendars at any time.

  4. Probabilistic Anonymity and Admissible Schedulers

    CERN Document Server

    Garcia, Flavio D; Sokolova, Ana

    2007-01-01

    When studying safety properties of (formal) protocol models, it is customary to view the scheduler as an adversary: an entity trying to falsify the safety property. We show that in the context of security protocols, and in particular of anonymizing protocols, this gives the adversary too much power; for instance, the contents of encrypted messages and internal computations by the parties should be considered invisible to the adversary. We restrict the class of schedulers to a class of admissible schedulers which better model adversarial behaviour. These admissible schedulers base their decision solely on the past behaviour of the system that is visible to the adversary. Using this, we propose a definition of anonymity: for all admissible schedulers the identity of the users and the observations of the adversary are independent stochastic variables. We also develop a proof technique for typical cases that can be used to proof anonymity: a system is anonymous if it is possible to `exchange' the behaviour of two...

  5. Original and Mirror Face Images and Minimum Squared Error Classification for Visible Light Face Recognition

    Directory of Open Access Journals (Sweden)

    Rong Wang

    2015-01-01

    Full Text Available In real-world applications, the image of faces varies with illumination, facial expression, and poses. It seems that more training samples are able to reveal possible images of the faces. Though minimum squared error classification (MSEC is a widely used method, its applications on face recognition usually suffer from the problem of a limited number of training samples. In this paper, we improve MSEC by using the mirror faces as virtual training samples. We obtained the mirror faces generated from original training samples and put these two kinds of samples into a new set. The face recognition experiments show that our method does obtain high accuracy performance in classification.

  6. Dissociation between face perception and face memory in adults, but not children, with developmental prosopagnosia

    Directory of Open Access Journals (Sweden)

    Kirsten A. Dalrymple

    2014-10-01

    Full Text Available Cognitive models propose that face recognition is accomplished through a series of discrete stages, including perceptual representation of facial structure, and encoding and retrieval of facial information. This implies that impaired face recognition can result from failures of face perception, face memory, or both. Studies of acquired prosopagnosia, autism spectrum disorders, and the development of normal face recognition support the idea that face perception and face memory are distinct processes, yet this distinction has received little attention in developmental prosopagnosia (DP. To address this issue, we tested the face perception and face memory of children and adults with DP. By definition, face memory is impaired in DP, so memory deficits were present in all participants. However, we found that all children, but only half of the adults had impaired face perception. Thus, results from adults indicate that face perception and face memory are dissociable, while the results from children provide no evidence for this division. Importantly, our findings raise the possibility that DP is qualitatively different in childhood versus adulthood. We discuss theoretical explanations for this developmental pattern and conclude that longitudinal studies are necessary to better understand the developmental trajectory of face perception and face memory deficits in DP.

  7. The GBT Dynamic Scheduling System: A New Scheduling Paradigm

    Science.gov (United States)

    O'Neil, K.; Balser, D.; Bignell, C.; Clark, M.; Condon, J.; McCarty, M.; Marganian, P.; Shelton, A.; Braatz, J.; Harnett, J.; Maddalena, R.; Mello, M.; Sessoms, E.

    2009-09-01

    The Robert C. Byrd Green Bank Telescope (GBT) is implementing a new Dynamic Scheduling System (DSS) designed to maximize the observing efficiency of the telescope while ensuring that none of the flexibility and ease of use of the GBT is harmed and that the data quality of observations is not adversely affected. To accomplish this, the GBT DSS is implementing a dynamic scheduling system which schedules observers, rather than running scripts. The DSS works by breaking each project into one or more sessions which have associated observing criteria such as RA, Dec, and frequency. Potential observers may also enter dates when members of their team will not be available for either on-site or remote observing. The scheduling algorithm uses those data, along with the predicted weather, to determine the most efficient schedule for the GBT. The DSS provides all observers at least 24 hours notice of their upcoming observing. In the uncommon (DSS project, including the ranking and scheduling algorithms for the sessions, the scheduling probabilities generation, the web framework for the system, and an overview of the results from the beta testing which were held from June - September, 2008.

  8. Using Integer Programming for Airport Service Planning in Staff Scheduling

    Directory of Open Access Journals (Sweden)

    W.H. Ip

    2010-09-01

    Full Text Available Reliability and safety in flight is extremely necessary and that depend on the adoption of proper maintenance system. Therefore, it is essential for aircraft maintenance companies to perform the manpower scheduling efficiently. One of the objectives of this paper is to provide an Integer Programming approach to determine the optimal solutions to aircraft maintenance planning and scheduling and hence the planning and scheduling processes can become more efficient and effective. Another objective is to develop a set of computational schedules for maintenance manpower to cover all scheduled flights. In this paper, a sequential methodology consisting of 3 stages is proposed. They are initial maintenance demand schedule, the maintenance pairing and the maintenance group(s assignment. Since scheduling would split up into different stages, different mathematical techniques have been adopted to cater for their own problem characteristics. Microsoft Excel would be used. Results from the first stage and second stage would be inputted into integer programming model using Microsoft Excel Solver to find the optimal solution. Also, Microsoft Excel VBA is used for devising a scheduling system in order to reduce the manual process and provide a user friendly interface. For the results, all can be obtained optimal solution and the computation time is reasonable and acceptable. Besides, the comparison of the peak time and non-peak time is discussed.

  9. The Coordinated Scheduling Support System of Production and Delivery

    Directory of Open Access Journals (Sweden)

    Ming-Feng Yang

    2009-01-01

    Full Text Available Problem statement: Traditional scheduling models which only address the sequence of jobs to be processed at the production stage under some criteria are no longer suitable and should be extended to cope with the distribution stage after production. In a rapidly changing environment, competition among enterprises has a tendency to turn towards competing between supply chain systems instead of competing between individual companies. Emphasizing on the coordination and the integration among various members of a supply chain has become one of the vital strategies for the modern manufacturers to gain competitive advantages. Approach: This research focuses mainly on a class of two-stage scheduling problem, in which jobs need to be delivered to customers by vehicles after the completion of their respective production. It is assumed that the transportation time of a vehicle is constant and jobs to be delivered occupy different physical spaces. Results: The result of this research is to show the scheduling problem with the objective of minimizing total completion time is intractable and to develop a heuristic by incorporating properties inherited in an the optimal schedule. In addition, we take a Decision Support System (DSS view to construct a Scheduling Support System (SSS for solving the scheduling problem with delivery coordination. Conclusion/Recommendations: The scheduling support system with an additional problem management subsystem can provide more useful information for users when the management makes a strategic decision than traditional scheduling methods can. It can give firms a competitive advantage on the global competitive market.

  10. A decentralized scheduling algorithm for time synchronized channel hopping

    Directory of Open Access Journals (Sweden)

    Andrew Tinka

    2011-09-01

    Full Text Available Time Synchronized Channel Hopping (TSCH is an existing Medium Access Control scheme which enables robust communication through channel hopping and high data rates through synchronization. It is based on a time-slotted architecture, and its correct functioning depends on a schedule which is typically computed by a central node. This paper presents, to our knowledge, the first scheduling algorithm for TSCH networks which both is distributed and which copes with mobile nodes. Two variations on scheduling algorithms are presented. Aloha-based scheduling allocates one channel for broadcasting advertisements for new neighbors. Reservation- based scheduling augments Aloha-based scheduling with a dedicated timeslot for targeted advertisements based on gossip information. A mobile ad hoc motorized sensor network with frequent connectivity changes is studied, and the performance of the two proposed algorithms is assessed. This performance analysis uses both simulation results and the results of a field deployment of floating wireless sensors in an estuarial canal environment. Reservation-based scheduling performs significantly better than Aloha-based scheduling, suggesting that the improved network reactivity is worth the increased algorithmic complexity and resource consumption.

  11. Cloud Task Scheduling for Load Balancing based on Intelligent Strategy

    Directory of Open Access Journals (Sweden)

    Arabi E. keshk

    2014-04-01

    Full Text Available Cloud computing is a type of parallel and distributed system consisting of a collection of interconnected and virtual computers. With the increasing demand and benefits of cloud computing infrastructure, different computing can be performed on cloud environment. One of the fundamental issues in this environment is related to task scheduling. Cloud task scheduling is an NP-hard optimization problem, and many meta-heuristic algorithms have been proposed to solve it. A good task scheduler should adapt its scheduling strategy to the changing environment and the types of tasks. In this paper a cloud task scheduling policy based on ant colony optimization algorithm for load balancing compared with different scheduling algorithms has been proposed. Ant Colony Optimization (ACO is random optimization search approach that will be used for allocating the incoming jobs to the virtual machines. The main contribution of our work is to balance the system load while trying to minimizing the make span of a given tasks set. The load balancing factor, related to the job finishing rate, is proposed to make the job finishing rate at different resource being similar and the ability of the load balancing will be improved. The proposed scheduling strategy was simulated using Cloudsim toolkit package. Experimental results showed that, the proposed algorithm outperformed scheduling algorithms that are based on the basic ACO or Modified Ant Colony Optimization (MACO.

  12. Bulletin publication schedule

    CERN Multimedia

    Publications Section, DG-CO Group

    2011-01-01

    The final edition (Nos 51-52/2011 and 1-2-3/2012) of the Bulletin this year will be published on Friday 16 December and will cover events at CERN from 19 December 2011 to 19 January 2012. Announcements for publication in this issue should reach the Communication Group or the Staff Association, as appropriate, by noon on Tuesday 13 December. Bulletin publication schedule for 2012 The table below lists the 2012 publication dates for the paper version of the Bulletin and the corresponding deadlines for the submission of announcements. Please note that all announcements must be submitted by 12.00 noon on Tuesdays at the latest.   Bulletin No. Week number Submission of announcements (before 12.00 midday) Bulletin Web version Bulletin Printed version 4-5   Tuesday 17 January Fridays 20 and 27 January Wednesday25 January 6-7   Tuesday 31 January Fridays 3 and 10 February Wednesday 8 February 8-9 Tuesday 14 February Fridays 17 and 24 february Wednesday 22 Februa...

  13. 高瓦斯煤层综放工作面瓦斯运移规律实测研究%Site Measurement of Methane Migration in Full-mechanized Caving Mining Face in Coal-seam with High Methane Content

    Institute of Scientific and Technical Information of China (English)

    张延斌; 秦子晗; 于新河; 幺洪武; 尹立军

    2015-01-01

    By long-term site measurement and numerical simulation, methane gushing rule of S2205 mining face was re-searched. Different sources of methane and respective proportion was obtained. Methane gushing amount from gob occupied 48. 1% of methane gushing amount by ventilation. On the basis of statistical analysis of methane gushing variation in initial mining phrase and nor-mal mining phrase, it was found that variation of methane gushing amount was directly related with underground pressure behav-ior. Basic roof caving made coal fissure in advance of mining face evolve and extrude gob, which resulted in increasing of methane gushing amount and even exceeding limit. Analyzing methane gushing rule of full-mechanized caving mining face could provide reference for methane prevention.%以某矿S2205综放工作面为例,通过长期现场观测并结合数值模拟对综放工作面的瓦斯涌出规律进行研究,得到S2205工作面瓦斯涌出量的不同来源及各自所占比例,其中采空区内的瓦斯涌出量约占到工作面风排瓦斯涌出量的48.1%。同时对开采初期和正常回采期间的瓦斯涌出变化情况进行了统计和分析,发现瓦斯涌出量的变化与工作面矿压显现有着直接的联系,基本顶的垮落造成工作面前方煤体裂隙扩大和增加,并挤压采空区而导致瓦斯涌入工作面,造成工作面瓦斯涌出量的增大甚至超限。通过对综放工作面瓦斯涌出规律的分析,可以为高瓦斯综放工作面的瓦斯防治提供指导依据。

  14. Energy-Efficient Scheduling Problem Using an Effective Hybrid Multi-Objective Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    Lvjiang Yin

    2016-12-01

    Full Text Available Nowadays, manufacturing enterprises face the challenge of just-in-time (JIT production and energy saving. Therefore, study of JIT production and energy consumption is necessary and important in manufacturing sectors. Moreover, energy saving can be attained by the operational method and turn off/on idle machine method, which also increases the complexity of problem solving. Thus, most researchers still focus on small scale problems with one objective: a single machine environment. However, the scheduling problem is a multi-objective optimization problem in real applications. In this paper, a single machine scheduling model with controllable processing and sequence dependence setup times is developed for minimizing the total earliness/tardiness (E/T, cost, and energy consumption simultaneously. An effective multi-objective evolutionary algorithm called local multi-objective evolutionary algorithm (LMOEA is presented to tackle this multi-objective scheduling problem. To accommodate the characteristic of the problem, a new solution representation is proposed, which can convert discrete combinational problems into continuous problems. Additionally, a multiple local search strategy with self-adaptive mechanism is introduced into the proposed algorithm to enhance the exploitation ability. The performance of the proposed algorithm is evaluated by instances with comparison to other multi-objective meta-heuristics such as Nondominated Sorting Genetic Algorithm II (NSGA-II, Strength Pareto Evolutionary Algorithm 2 (SPEA2, Multiobjective Particle Swarm Optimization (OMOPSO, and Multiobjective Evolutionary Algorithm Based on Decomposition (MOEA/D. Experimental results demonstrate that the proposed LMOEA algorithm outperforms its counterparts for this kind of scheduling problems.

  15. Gain scheduling using the Youla parameterization

    DEFF Research Database (Denmark)

    Niemann, Hans Henrik; Stoustrup, Jakob

    1999-01-01

    Gain scheduling controllers are considered in this paper. The gain scheduling problem where the scheduling parameter vector cannot be measured directly, but needs to be estimated is considered. An estimation of the scheduling vector has been derived by using the Youla parameterization. The use...... in connection with H_inf gain scheduling controllers....

  16. MidSFN Local Scheduling AlgorithmMidSFN Local Scheduling Algorithm for Heterogeneous Grid Environment

    Directory of Open Access Journals (Sweden)

    Dr.G.Sumathi

    2012-05-01

    Full Text Available A grid is a heterogeneous computing and communication system that allows a group of nodes to compass a task. The process of assigning the jobs or subtasks to the nodes present in the heterogeneous grid is known as scheduling. The type of scheduling in which the subtasks are assigned to the nodes is known as Local Scheduling.A significant research problem is how to assign resources to the subtasks and order the execution of the subtasks that are matched to maximize performance criterion of a local grid system. This procedure of scheduling is called mapping or resource allocation. MidSFN adverts to Medium Subtask Fastest Node algorithm which classifies the subtasks into three tier categories, High, Middle and Low based on their priority. In MidSFN algorithm priority is assigned based on the new parameters Computational Complexity and Processing Power. The value for processing power is assigned based on the Performance Factor. The value of the Performance Factor is the product of the number of operations per cycle per processor and the number of instructions processed per second. In MidSFN algorithm the subtask of medium computational complexity and resources exhibiting medium processing power are assigned with a high priority. The subtasks are then mapped to respective processors based on the assigned priority for execution. Compared to other local scheduling algorithms, MidSFN algorithm shows efficient load balancing and better computation with effective usage of resources. The effectiveness of this algorithm is evaluated through simulation results.

  17. Reactive schedule modification in multipurpose batch chemical plants

    Energy Technology Data Exchange (ETDEWEB)

    Kanakamedala, K.B.; Reklaitis, G.V.; Venkatasubramanian, V. (Purdue Univ., West Lafayette, IN (United States). School of Chemical Engineering)

    1994-01-01

    A new scheme is described for reactive schedule modification in the face of unexpected deviations in processing times and unit availabilities of a multipurpose batch plant (MBP). Schedule modification is done using at least impact heuristic beam search which proceeds in two levels: creation of a decision tree which makes use of possible reroutings of the product that is causing a conflict, and heuristic pruning of the search space to contain the combinatorial complexity. The heuristic chooses a path among all possible reroutings for a product such that the impact of each decision on the rest of the schedule is kept as small as possible. This approach has been implemented and tested on a number of simulated deviations in a MBP case study with three products. The proposed least impact heuristic was found to perform better than the earliest finishing unit heuristic in all the cases considered.

  18. Préface

    Directory of Open Access Journals (Sweden)

    Marguerite Mendell

    2008-12-01

    Full Text Available C’est avec grand plaisir que je contribue la préface de ce numéro d’Interventions économiques dédié à la pertinence de la pensée de Karl Polanyi au début du 21ème siècle. Je suis très reconnaissante aux éditeurs, Diane Gabrielle Tremblay, Jean-Marc Fontan et Jean Louis Laville d’avoir pris l’initiative de préparer ce numéro pour le 11ème colloque international de l’Institut Karl Polanyi, qui correspond aussi au 20ème anniversaire de l’Institut, établi à l’Université Concordia en 1988. Interve...

  19. KUBAN REGION RAILROAD DURING THE SECOND FIVE-YEAR PLAN: CHALLENGES OF REARRANGING THE MAINTENANCE SCHEDULE AND LABOUR ACHIEVEMENTS BY THE WORKERS

    Directory of Open Access Journals (Sweden)

    Vladimir Eugenyevich Temlyakov

    2015-01-01

    Full Text Available The paper considered the issues the Kuban Region railroad transportation has faced during the Second Five-Year Plan. The author has brought to light the ways people had to cope with the challenges in rearranging the maintenance schedule at the Northern Caucasus Railroad Dept., and the staffing issue being pressing at that period. The survey has shown the part taken by the Communist Party and pubic administration bodies in implementing tasks the railroad transportation has faced. The paper examined resolutions taken in the 1930-ies by the Krasnodar city CPSU conferences and the Krasnodar city Party activists in relation to challenges the railroad transportation faced. The author made an inference that the new means and labour incentive approaches have taken the main part in increasing the rail traffic flow, and wide spreading of socialist emulation and the raising Stakhanovism on the railroad as well.

  20. About (above) a face - a face

    OpenAIRE

    2009-01-01

    This text intents to unfold some considerations regardind the perception of the image of the Lóri’s face, from the book Uma aprendizagem ou o livro dos prazeres, published by Clarice Lispector in 1969. For that, will be studied the politicians devices who involve the apprehension of the face as a qualifying of the subject and, at the same time, its relation with the lenguage.

  1. Optimal Deadline Scheduling with Commitment

    CERN Document Server

    Chen, Shiyao; He, Ting

    2011-01-01

    We consider an online preemptive scheduling problem where jobs with deadlines arrive sporadically. A commitment requirement is imposed such that the scheduler has to either accept or decline a job immediately upon arrival. The scheduler's decision to accept an arriving job constitutes a contract with the customer; if the accepted job is not completed by its deadline as promised, the scheduler loses the value of the corresponding job and has to pay an additional penalty depending on the amount of unfinished workload. The objective of the online scheduler is to maximize the overall profit, i.e., the total value of the admitted jobs completed before their deadlines less the penalty paid for the admitted jobs that miss their deadlines. We show that the maximum competitive ratio is $3-2\\sqrt{2}$ and propose a simple online algorithm to achieve this competitive ratio. The optimal scheduling includes a threshold admission and a greedy scheduling policies. The proposed algorithm has direct applications to the chargin...

  2. Human faces are slower than chimpanzee faces.

    Directory of Open Access Journals (Sweden)

    Anne M Burrows

    Full Text Available BACKGROUND: While humans (like other primates communicate with facial expressions, the evolution of speech added a new function to the facial muscles (facial expression muscles. The evolution of speech required the development of a coordinated action between visual (movement of the lips and auditory signals in a rhythmic fashion to produce "visemes" (visual movements of the lips that correspond to specific sounds. Visemes depend upon facial muscles to regulate shape of the lips, which themselves act as speech articulators. This movement necessitates a more controlled, sustained muscle contraction than that produced during spontaneous facial expressions which occur rapidly and last only a short period of time. Recently, it was found that human tongue musculature contains a higher proportion of slow-twitch myosin fibers than in rhesus macaques, which is related to the slower, more controlled movements of the human tongue in the production of speech. Are there similar unique, evolutionary physiologic biases found in human facial musculature related to the evolution of speech? METHODOLOGY/PRINICIPAL FINDINGS: Using myosin immunohistochemistry, we tested the hypothesis that human facial musculature has a higher percentage of slow-twitch myosin fibers relative to chimpanzees (Pan troglodytes and rhesus macaques (Macaca mulatta. We sampled the orbicularis oris and zygomaticus major muscles from three cadavers of each species and compared proportions of fiber-types. Results confirmed our hypothesis: humans had the highest proportion of slow-twitch myosin fibers while chimpanzees had the highest proportion of fast-twitch fibers. CONCLUSIONS/SIGNIFICANCE: These findings demonstrate that the human face is slower than that of rhesus macaques and our closest living relative, the chimpanzee. They also support the assertion that human facial musculature and speech co-evolved. Further, these results suggest a unique set of evolutionary selective pressures on

  3. Constraint-based scheduling applying constraint programming to scheduling problems

    CERN Document Server

    Baptiste, Philippe; Nuijten, Wim

    2001-01-01

    Constraint Programming is a problem-solving paradigm that establishes a clear distinction between two pivotal aspects of a problem: (1) a precise definition of the constraints that define the problem to be solved and (2) the algorithms and heuristics enabling the selection of decisions to solve the problem. It is because of these capabilities that Constraint Programming is increasingly being employed as a problem-solving tool to solve scheduling problems. Hence the development of Constraint-Based Scheduling as a field of study. The aim of this book is to provide an overview of the most widely used Constraint-Based Scheduling techniques. Following the principles of Constraint Programming, the book consists of three distinct parts: The first chapter introduces the basic principles of Constraint Programming and provides a model of the constraints that are the most often encountered in scheduling problems. Chapters 2, 3, 4, and 5 are focused on the propagation of resource constraints, which usually are responsibl...

  4. Face Recognition using Eigenfaces and Neural Networks

    Directory of Open Access Journals (Sweden)

    Mohamed Rizon

    2006-01-01

    Full Text Available In this study, we develop a computational model to identify the face of an unknown person’s by applying eigenfaces. The eigenfaces has been applied to extract the basic face of the human face images. The eigenfaces is then projecting onto human faces to identify unique features vectors. This significant features vector can be used to identify an unknown face by using the backpropagation neural network that utilized euclidean distance for classification and recognition. The ORL database for this investigation consists of 40 people with various 400 face images had been used for the learning. The eigenfaces including implemented Jacobi’s method for eigenvalues and eigenvectors has been performed. The classification and recognition using backpropagation neural network showed impressive positive result to classify face images.

  5. Processing of emotional faces in social phobia

    Directory of Open Access Journals (Sweden)

    Nicole Kristjansen Rosenberg

    2011-02-01

    Full Text Available Previous research has found that individuals with social phobia differ from controls in their processing of emotional faces. For instance, people with social phobia show increased attention to briefly presented threatening faces. However, when exposure times are increased, the direction of this attentional bias is more unclear. Studies investigating eye movements have found both increased as well as decreased attention to threatening faces in socially anxious participants. The current study investigated eye movements to emotional faces in eight patients with social phobia and 34 controls. Three different tasks with different exposure durations were used, which allowed for an investigation of the time course of attention. At the early time interval, patients showed a complex pattern of both vigilance and avoidance of threatening faces. At the longest time interval, patients avoided the eyes of sad, disgust, and neutral faces more than controls, whereas there were no group differences for angry faces.

  6. Culture shapes how we look at faces.

    Directory of Open Access Journals (Sweden)

    Caroline Blais

    Full Text Available BACKGROUND: Face processing, amongst many basic visual skills, is thought to be invariant across all humans. From as early as 1965, studies of eye movements have consistently revealed a systematic triangular sequence of fixations over the eyes and the mouth, suggesting that faces elicit a universal, biologically-determined information extraction pattern. METHODOLOGY/PRINCIPAL FINDINGS: Here we monitored the eye movements of Western Caucasian and East Asian observers while they learned, recognized, and categorized by race Western Caucasian and East Asian faces. Western Caucasian observers reproduced a scattered triangular pattern of fixations for faces of both races and across tasks. Contrary to intuition, East Asian observers focused more on the central region of the face. CONCLUSIONS/SIGNIFICANCE: These results demonstrate that face processing can no longer be considered as arising from a universal series of perceptual events. The strategy employed to extract visual information from faces differs across cultures.

  7. Multiuser Scheduling on the Downlink of an LTE Cellular System

    Directory of Open Access Journals (Sweden)

    Raymond Kwan

    2008-01-01

    Full Text Available The challenge of scheduling user transmissions on the downlink of a long-term evolution (LTE cellular communication system is addressed. In particular, a novel optimalmultiuser scheduler is proposed. Numerical results show that the system performance improves with increasing correlation among OFDMA subcarriers. It is found that only a limited amount of feedback information is needed to achieve relatively good performance. A suboptimal reduced-complexity scheduler is also proposed and shown to provide good performance. The suboptimal scheme is especially attractive when the number of users is large, in which case the complexity of the optimal scheme is high.

  8. A DIFFERENTIAL EVOLUTION ALGORITHM DEVELOPED FOR A NURSE SCHEDULING PROBLEM

    Directory of Open Access Journals (Sweden)

    Shahnazari-Shahrezaei, P.

    2012-11-01

    Full Text Available Nurse scheduling is a type of manpower allocation problem that tries to satisfy hospital managers objectives and nurses preferences as much as possible by generating fair shift schedules. This paper presents a nurse scheduling problem based on a real case study, and proposes two meta-heuristics a differential evolution algorithm (DE and a greedy randomised adaptive search procedure (GRASP to solve it. To investigate the efficiency of the proposed algorithms, two problems are solved. Furthermore, some comparison metrics are applied to examine the reliability of the proposed algorithms. The computational results in this paper show that the proposed DE outperforms the GRASP.

  9. Improved Quantum Genetic Algorithm in Application of Scheduling Engineering Personnel

    Directory of Open Access Journals (Sweden)

    Huaixiao Wang

    2014-01-01

    Full Text Available To verify the availability of the improved quantum genetic algorithm in solving the scheduling engineering personnel problem, the following work has been carried out: the characteristics of the scheduling engineering personnel problem are analyzed, the quantum encoding method is proposed, and an improved quantum genetic algorithm is applied to address the issue. Taking the low efficiency and the bad performance of the conventional quantum genetic algorithm into account, a universal improved quantum genetic algorithm is introduced to solve the scheduling engineering personnel problem. Finally, the examples are applied to verify the effectiveness and superiority of the improved quantum genetic algorithm and the rationality of the encoding method.

  10. PRIORITIZED QUEUE WITH ROUND ROBIN SCHEDULER FOR BUFFERED CROSSBAR SWITCHES

    Directory of Open Access Journals (Sweden)

    N. Narayanan Prasanth

    2014-03-01

    Full Text Available Research in high speed switching systems is in greater demand as the internet traffic gets rapid increase. Designing an efficient scheduling algorithm with high throughput and low delay is an open challenge. Most of the algorithms achieve 100% throughput in uniform traffics but failed to attain the same performance under non-uniform traffics. Moreover these algorithms are also suffers from starvation leads to extended waiting time of VOQ. In this paper, Prioritized Queue with Round Robin Scheduler (PQRS is proposed for Buffered Crossbar Switches. We proved that our proposed scheduler can achieve 85% throughput under any non-uniform traffic without starvation.

  11. Scheduling the Belgian soccer league.

    OpenAIRE

    Goossens, Dries; Spieksma, Frederik

    2009-01-01

    Any sports league needs a schedule of play, and such a schedule can be important, as it may influence the outcome of the sports competition itself and since it may have an impact on the interests of all parties involved. As in many other sports leagues and countries, the interest for Belgian soccer has increased over the last years. This paper describes our experiences in scheduling the highest Belgian soccer league. We describe how we automated and improved the way in which the calendar is ...

  12. An empirical investigation of scheduling performance criteria

    NARCIS (Netherlands)

    de Snoo, C.; van Wezel, W.M.C.; Jorna, R.J.J.M.

    Planning and scheduling significantly influence organizational performance, but literature that pays attention to how organizations could or should organize and assess their planning processes is limited. We extend planning and scheduling theory with a categorization of scheduling performance

  13. When greediness fails: examples from stochastic scheduling

    NARCIS (Netherlands)

    Uetz, Marc Jochen

    The purpose of this paper is to present examples for the sometimes surprisingly different behavior of deterministic and stochastic scheduling problems. In particular, it demonstrates some seemingly counterintuitive properties of optimal scheduling policies for stochastic machine scheduling problems.

  14. When greediness fails: examples from stochastic scheduling

    NARCIS (Netherlands)

    Uetz, Marc

    2003-01-01

    The purpose of this paper is to present examples for the sometimes surprisingly different behavior of deterministic and stochastic scheduling problems. In particular, it demonstrates some seemingly counterintuitive properties of optimal scheduling policies for stochastic machine scheduling problems.

  15. The fusiform face area is engaged in holistic, not parts-based, representation of faces.

    Directory of Open Access Journals (Sweden)

    Jiedong Zhang

    Full Text Available Numerous studies with functional magnetic resonance imaging have shown that the fusiform face area (FFA in the human brain plays a key role in face perception. Recent studies have found that both the featural information of faces (e.g., eyes, nose, and mouth and the configural information of faces (i.e., spatial relation among features are encoded in the FFA. However, little is known about whether the featural information is encoded independent of or combined with the configural information in the FFA. Here we used multi-voxel pattern analysis to examine holistic representation of faces in the FFA by correlating spatial patterns of activation with behavioral performance in discriminating face parts with face configurations either present or absent. Behaviorally, the absence of face configurations (versus presence impaired discrimination of face parts, suggesting a holistic representation in the brain. Neurally, spatial patterns of activation in the FFA were more similar among correct than incorrect trials only when face parts were presented in a veridical face configuration. In contrast, spatial patterns of activation in the occipital face area, as well as the object-selective lateral occipital complex, were more similar among correct than incorrect trials regardless of the presence of veridical face configurations. This finding suggests that in the FFA faces are represented not on the basis of individual parts but in terms of the whole that emerges from the parts.

  16. Petri net-based scheduling of time constrained single-arm cluster tools with wafer revisiting

    Directory of Open Access Journals (Sweden)

    ZiCheng Liu

    2016-05-01

    Full Text Available It is very difficult to schedule a single-arm cluster tool with wafer revisiting such that wafer residency time constraints are satisfied. This article conducts a study on this challenging problem for a single-arm cluster tool with atomic layer deposition process. With a so-called p-backward strategy being applied, a Petri net model is developed to describe the dynamic behavior of the system. Based on the model, the existence of a feasible schedule is analyzed, schedulability conditions are derived, and scheduling algorithms are presented if there is a schedule. A schedule is obtained by simply setting the robot waiting time if schedulable, and it is very computationally efficient. The obtained schedule is shown to be optimal. Illustrative examples are given to demonstrate the proposed approach.

  17. Designing of Vague Logic Based 2-Layered Framework for CPU Scheduler

    Directory of Open Access Journals (Sweden)

    Supriya Raheja

    2016-01-01

    Full Text Available Fuzzy based CPU scheduler has become of great interest by operating system because of its ability to handle imprecise information associated with task. This paper introduces an extension to the fuzzy based round robin scheduler to a Vague Logic Based Round Robin (VBRR scheduler. VBRR scheduler works on 2-layered framework. At the first layer, scheduler has a vague inference system which has the ability to handle the impreciseness of task using vague logic. At the second layer, Vague Logic Based Round Robin (VBRR scheduling algorithm works to schedule the tasks. VBRR scheduler has the learning capability based on which scheduler adapts intelligently an optimum length for time quantum. An optimum time quantum reduces the overhead on scheduler by reducing the unnecessary context switches which lead to improve the overall performance of system. The work is simulated using MATLAB and compared with the conventional round robin scheduler and the other two fuzzy based approaches to CPU scheduler. Given simulation analysis and results prove the effectiveness and efficiency of VBRR scheduler.

  18. Face Recognition in Uncontrolled Environment

    Directory of Open Access Journals (Sweden)

    Radhey Shyam

    2016-08-01

    Full Text Available This paper presents a novel method of facial image representation for face recognition in uncontrolled environment. It is named as augmented local binary patterns (A-LBP that works on both, uniform and non-uniform patterns. It replaces the central non-uniform pattern with a majority value of the neighbouring uniform patterns obtained after processing all neighbouring non-uniform patterns. These patterns are finally combined with the neighbouring uniform patterns, in order to extract discriminatory information from the local descriptors. The experimental results indicate the vitality of the proposed method on particular face datasets, where the images are prone to extreme variations of illumination.

  19. A Survey: Face Recognition Techniques

    Directory of Open Access Journals (Sweden)

    Muhammad Sharif

    2012-12-01

    Full Text Available In this study, the existing techniques of face recognition are to be encountered along with their pros and cons to conduct a brief survey. The most general methods include Eigenface (Eigenfeatures, Hidden Markov Model (HMM, geometric based and template matching approaches. This survey actually performs analysis on these approaches in order to constitute face representations which will be discussed as under. In the second phase of the survey, factors affecting the recognition rates and processes are also discussed along with the solutions provided by different authors.

  20. Dissociating Face Identity and Facial Expression Processing Via Visual Adaptation

    Directory of Open Access Journals (Sweden)

    Hong Xu

    2012-10-01

    Full Text Available Face identity and facial expression are processed in two distinct neural pathways. However, most of the existing face adaptation literature studies them separately, despite the fact that they are two aspects from the same face. The current study conducted a systematic comparison between these two aspects by face adaptation, investigating how top- and bottom-half face parts contribute to the processing of face identity and facial expression. A real face (sad, “Adam” and its two size-equivalent face parts (top- and bottom-half were used as the adaptor in separate conditions. For face identity adaptation, the test stimuli were generated by morphing Adam's sad face with another person's sad face (“Sam”. For facial expression adaptation, the test stimuli were created by morphing Adam's sad face with his neutral face and morphing the neutral face with his happy face. In each trial, after exposure to the adaptor, observers indicated the perceived face identity or facial expression of the following test face via a key press. They were also tested in a baseline condition without adaptation. Results show that the top- and bottom-half face each generated a significant face identity aftereffect. However, the aftereffect by top-half face adaptation is much larger than that by the bottom-half face. On the contrary, only the bottom-half face generated a significant facial expression aftereffect. This dissociation of top- and bottom-half face adaptation suggests that face parts play different roles in face identity and facial expression. It thus provides further evidence for the distributed systems of face perception.

  1. A Network Simulation Tool for Task Scheduling

    Directory of Open Access Journals (Sweden)

    Ondřej Votava

    2012-01-01

    Full Text Available Distributed computing may be looked at from many points of view. Task scheduling is the viewpoint, where a distributed application can be described as a Directed Acyclic Graph and every node of the graph is executed independently. There are, however, data dependencies and the nodes have to be executed in a specified order. Hence the parallelism of the execution is limited. The scheduling problem is difficult and therefore heuristics are used. However, many inaccuracies are caused by the model used for the system, in which the heuristics are being tested. In this paper we present a tool for simulating the execution of the distributed application on a “real” computer network, and try to tell how the executionis influenced compared to the model.

  2. Power Efficient Hierarchical Scheduling for DSP Transformations

    Directory of Open Access Journals (Sweden)

    P. K. Merakos

    2002-01-01

    Full Text Available In this paper, the problem of scheduling the computation of partial products in transformational Digital Signal Processing (DSP algorithms, aiming at the minimization of the switching activity in data and address buses, is addressed. The problem is stated as a hierarchical scheduling problem. Two different optimization algorithms, which are based on the Travelling Salesman Problem (TSP, are defined. The proposed optimization algorithms are independent on the target architecture and can be adapted to take into account it. Experimental results obtained from the application of the proposed algorithms in various widely used DSP transformations, like Discrete Cosine Transform (DCT and Discrete Fourier Transform (DFT, show that significant switching activity savings in data and address buses can be achieved, resulting in corresponding power savings. In addition, the differences between the two proposed methods are underlined, providing envisage for their suitable selection for implementation, in particular transformational algorithms and architectures.

  3. Trust level of Clouds by Scheduling

    Directory of Open Access Journals (Sweden)

    Deva Sinha K.

    2015-11-01

    Full Text Available Cloud computing is a virtual storage which is used to store the data and information in secure manner. This project which gives a trustworthy to the cloud user from Admin without knowing the infrastructure and its properties of cloud. Cloud scheduled safety-critical data processing needs are beginning to push back strongly against using cloud computing, users will find that cloud scheduling will be maintained by the user to store their data on the cloud to create trust them . We have overcome this problem; a trusted cloud computing platform (TCCP proposed design. TCCP guarantees the implementation of the guest virtual machines to provide a closed box execution environment as a Service (IaaS providers such as Amazon EC2 allowing infrastructure. To protect a data in a secured way, while cloud user uploading a data it will get encrypted which means non readable format and when cloud user downloading a data it will get decrypted.

  4. Trust level of Clouds by Scheduling

    Directory of Open Access Journals (Sweden)

    Deva Sinha K

    2014-03-01

    Full Text Available Cloud computing is a virtual storage which is used to store the data and information in secure manner. This project which gives a trustworthy to the cloud user from Admin without knowing the infrastructure and its properties of cloud. Cloud scheduled safety-critical data processing needs are beginning to push back strongly against using cloud computing, users will find that cloud scheduling will be maintained by the user to store their data on the cloud to create trust them . We have overcome this problem; a trusted cloud computing platform (TCCP proposed design. TCCP guarantees the implementation of the guest virtual machines to provide a closed box execution environment as a Service (IaaS providers such as Amazon EC2 allowing infrastructure. To protect a data in a secured way, while cloud user uploading a data it will get encrypted which means non readable format and when cloud user downloading a data it will get decrypted.

  5. The composite face illusion.

    Science.gov (United States)

    Murphy, Jennifer; Gray, Katie L H; Cook, Richard

    2017-04-01

    Few findings in cognitive science have proved as influential as the composite face effect. When the top half of one face is aligned with the bottom half of another, and presented upright, the resulting composite arrangement induces a compelling percept of a novel facial configuration. Findings obtained using composite face procedures have contributed significantly to our understanding of holistic face processing, the detrimental effects of face inversion, the development of face perception, and aberrant face perception in clinical populations. Composite paradigms continue to advance our knowledge of face perception, as exemplified by their recent use for investigating the perceptual mechanisms underlying dynamic face processing. However, the paradigm has been the subject of intense scrutiny, particularly over the last decade, and there is a growing sense that the composite face illusion, whilst easy to illustrate, is deceptively difficult to measure and interpret. In this review, we provide a focussed overview of the existing composite face literature, and identify six priorities for future research. Addressing these gaps in our knowledge will aid the evaluation and refinement of theoretical accounts of the illusion.

  6. Improving Face Detection with TOE Cameras

    DEFF Research Database (Denmark)

    Hansen, Dan Witzner; Larsen, Rasmus; Lauze, F

    2007-01-01

    A face detection method based on a boosted classifier using images from a time-of-flight sensor is presented. We show that the performance of face detection can be improved when using both depth and gray scale images and that the common use of integration of hypotheses for verification can...... be relaxed. Based on the detected face we employ an active contour method on depth images for full head segmentation....

  7. Multiagent scheduling models and algorithms

    CERN Document Server

    Agnetis, Alessandro; Gawiejnowicz, Stanisław; Pacciarelli, Dario; Soukhal, Ameur

    2014-01-01

    This book presents multi-agent scheduling models in which subsets of jobs sharing the same resources are evaluated by different criteria. It discusses complexity results, approximation schemes, heuristics and exact algorithms.

  8. Executive Schedule C System (ESCS)

    Data.gov (United States)

    Office of Personnel Management — Used to store information on Federal employees in the Senior Executive Service (SES) and appointed employees in the Schedule C System. Every four years, just after...

  9. The GBT Dynamic Scheduling System

    Science.gov (United States)

    McCarty, M. T.; Balser, D. S.; Braatz, J.; Clark, M. H.; Condon, J.; Creager, R. E.; Maddalena, R. J.; Marganian, P.; O'Neil, K.; Sessoms, E.; Shelton, A. L.

    2012-09-01

    The Robert C. Byrd Green Bank Telescope (GBT) Dynamic Scheduling System (DSS), in use since September, 2009, was designed to maximize observing efficiency while preserving telescope flexibility and data quality without creating undue adversity for the observers. Using observing criteria; observer availability and qualifications for remote observing; three-dimensional weather forecasts; and telescope state, the DSS software optimally schedules observers 24 to 48 hours in advance for a telescope that has a wide-range of capabilities and a geographical location with variable weather patterns. The DSS project was closed October 28, 2011 and will now enter a continuing maintenance and enhancement phase. Recent improvements include a new resource calendar for incorporating telescope maintenance activities, a sensitivity calculator that leverages the scheduling algorithms to facilitate consistent tools for proposal preparation, improved support for monitoring observations, scheduling of high frequency continuum and spectral line observations for both sparse and fully sampled array receivers, and additional session parameters for observations having special requirements.

  10. Schedule Sales Query Raw Data

    Data.gov (United States)

    General Services Administration — Schedule Sales Query presents sales volume figures as reported to GSA by contractors. The reports are generated as quarterly reports for the current year and the...

  11. The control technology of dynamic mine strate pressure of full-mechanized mining face under gob left by room and pillar mining in Shendong mining area%神东矿区房采采空区下综采工作面动载矿压防治技术

    Institute of Scientific and Technical Information of China (English)

    肖剑儒

    2016-01-01

    神东矿区早期由于设备、回采工艺及历史原因等采用了房柱式开采.该工艺回采率低,遗留了大量煤柱,造成下层煤开采时矿压显现剧烈并存在有毒有害气体,严重影响采掘安全.鉴于此,阐述了房柱式采空区下综采工作面动载矿压的形成机理,可概括为3个阶段:①上覆房采煤柱受二次采动影响发生崩解破坏,顶板出现裂隙和弯曲下沉;②下分层综采工作面的破坏裂隙扩展至整个岩层;③上覆残留煤柱的回旋断裂与下分层综采工作面周期来压叠加,形成动载矿压.总结了安全掘进和回采的技术方案,主要包括3方面:①设计初期,合理布置采掘工作面位置;②回采时采用微震监测、矿压监测、地表裂隙与沉降观测的技术措施;③采用的工程措施主要有残留煤柱爆破、地表预裂技术及采空区充填.%Due to equipment ,mining process and historical reasons ,the room and pillar mining had been more widely adopted in Shendong mining area .The process of extraction rate is low ,left a large amount of coal pillar .Violent pressure ,toxic and harmful gases occurred under gob left by room and pillar mining , which seriously affected the mining safety .Given this ,the mechanism of formation is expounded and can be summarized into three stages :the room pillar happened disintegrating failure influenced by second mining coal ,roof cracks and bending down ,damage fracture of lower slice full-mechanized mining face extended to the whole rock formations .The cyclotron fracture of overlying pillar residue and periodic roof pressure of lower slice full-mechanized mining face are superimposed ,forming a dynamic load pressure .Three points are mainly talked about the technical solution of safe driving and extraction:reasonable decorate working face location ,using microseismic monitoring technology ,mine pressure monitoring ,surface crack and subsidence observation ,the engineering measures are mainly

  12. Future aircraft networks and schedules

    Science.gov (United States)

    Shu, Yan

    2011-07-01

    Because of the importance of air transportation scheduling, the emergence of small aircraft and the vision of future fuel-efficient aircraft, this thesis has focused on the study of aircraft scheduling and network design involving multiple types of aircraft and flight services. It develops models and solution algorithms for the schedule design problem and analyzes the computational results. First, based on the current development of small aircraft and on-demand flight services, this thesis expands a business model for integrating on-demand flight services with the traditional scheduled flight services. This thesis proposes a three-step approach to the design of aircraft schedules and networks from scratch under the model. In the first step, both a frequency assignment model for scheduled flights that incorporates a passenger path choice model and a frequency assignment model for on-demand flights that incorporates a passenger mode choice model are created. In the second step, a rough fleet assignment model that determines a set of flight legs, each of which is assigned an aircraft type and a rough departure time is constructed. In the third step, a timetable model that determines an exact departure time for each flight leg is developed. Based on the models proposed in the three steps, this thesis creates schedule design instances that involve almost all the major airports and markets in the United States. The instances of the frequency assignment model created in this thesis are large-scale non-convex mixed-integer programming problems, and this dissertation develops an overall network structure and proposes iterative algorithms for solving these instances. The instances of both the rough fleet assignment model and the timetable model created in this thesis are large-scale mixed-integer programming problems, and this dissertation develops subproblem schemes for solving these instances. Based on these solution algorithms, this dissertation also presents

  13. Optimizing Face Recognition Using PCA

    Directory of Open Access Journals (Sweden)

    Manal Abdullah

    2012-03-01

    Full Text Available Principle Component Analysis PCA is a classical feature extraction and data representation technique widely used in pattern recognition. It is one of the most successful techniques in face recognition. But it has drawback of high computational especially for big size database. This paper conducts a study to optimize the time complexity of PCA (eigenfaces that does not affects the recognition performance. The authors minimize the participated eigenvectors which consequently decreases the computational time. A comparison is done to compare the differences between the recognition time in the original algorithm and in the enhanced algorithm. The performance of the original and the enhanced proposed algorithm is tested on face94 face database. Experimental results show that the recognition time is reduced by 35% by applying our proposed enhanced algorithm. DET Curves are used to illustrate the experimental results.

  14. Optimizing Face Recognition Using PCA

    Directory of Open Access Journals (Sweden)

    Manal Abdullah

    2012-04-01

    Full Text Available Principle Component Analysis PCA is a classical feature extraction and data representation technique widely used in pattern recognition. It is one of the most successful techniques in face recognition. But it has drawback of high computational especially for big size database. This paper conducts a study to optimize the time complexity of PCA (eigenfaces that does not affects the recognition performance. The authorsminimize the participated eigenvectors which consequently decreases the computational time. A comparison is done to compare the differences between the recognition time in the original algorithm and in the enhanced algorithm. The performance of the original and the enhanced proposed algorithm is tested on face94 face database. Experimental results show that the recognition time is reduced by 35% by applying our proposed enhanced algorithm. DET Curves are used to illustrate the experimental results.

  15. Algorithm for complete enumeration based on a stroke graph to solve the supply network configuration and operations scheduling problem

    Directory of Open Access Journals (Sweden)

    Julien Maheut

    2013-07-01

    Full Text Available Purpose: The purpose of this paper is to present an algorithm that solves the supply network configuration and operations scheduling problem in a mass customization company that faces alternative operations for one specific tool machine order in a multiplant context. Design/methodology/approach: To achieve this objective, the supply chain network configuration and operations scheduling problem is presented. A model based on stroke graphs allows the design of an algorithm that enumerates all the feasible solutions. The algorithm considers the arrival of a new customized order proposal which has to be inserted into a scheduled program. A selection function is then used to choose the solutions to be simulated in a specific simulation tool implemented in a Decision Support System. Findings and Originality/value: The algorithm itself proves efficient to find all feasible solutions when alternative operations must be considered. The stroke structure is successfully used to schedule operations when considering more than one manufacturing and supply option in each step. Research limitations/implications: This paper includes only the algorithm structure for a one-by-one, sequenced introduction of new products into the list of units to be manufactured. Therefore, the lotsizing process is done on a lot-per-lot basis. Moreover, the validation analysis is done through a case study and no generalization can be done without risk. Practical implications: The result of this research would help stakeholders to determine all the feasible and practical solutions for their problem. It would also allow to assessing the total costs and delivery times of each solution. Moreover, the Decision Support System proves useful to assess alternative solutions. Originality/value: This research offers a simple algorithm that helps solve the supply network configuration problem and, simultaneously, the scheduling problem by considering alternative operations. The proposed system

  16. Scheduling commercial advertisements for television

    OpenAIRE

    Garcia-Villoria, Alberto; Salhi, Said

    2014-01-01

    The problem of scheduling the commercial advertisements in the television industry is investigated. Each advertiser client demands that the multiple airings of the same brand advertisement should be as spaced as possible over a given time period. Moreover, audience rating requests have to be taken into account in the scheduling. This is the first time this hard decision problem is dealt with in the literature. We design two mixed integer linear programming (MILP) models. Two constructive heur...

  17. Developing a Community of Inquiry in a Face-to-Face Class: How an Online Learning Framework Can Enrich Traditional Classroom Practice

    Science.gov (United States)

    Warner, Alfred G.

    2016-01-01

    Traditional classes are typically bound both in the classroom space and scheduled time. In this article, I show how applying an online learning framework called the Community of Inquiry and an organizational architecture of matrixed teams has worked in a face-to-face capstone class and extended those boundaries. These were introduced as an…

  18. Developing a Community of Inquiry in a Face-to-Face Class: How an Online Learning Framework Can Enrich Traditional Classroom Practice

    Science.gov (United States)

    Warner, Alfred G.

    2016-01-01

    Traditional classes are typically bound both in the classroom space and scheduled time. In this article, I show how applying an online learning framework called the Community of Inquiry and an organizational architecture of matrixed teams has worked in a face-to-face capstone class and extended those boundaries. These were introduced as an…

  19. A Novel Face Segmentation Algorithm from a Video Sequence for Real-Time Face Recognition

    Directory of Open Access Journals (Sweden)

    Sudhaker Samuel RD

    2007-01-01

    Full Text Available The first step in an automatic face recognition system is to localize the face region in a cluttered background and carefully segment the face from each frame of a video sequence. In this paper, we propose a fast and efficient algorithm for segmenting a face suitable for recognition from a video sequence. The cluttered background is first subtracted from each frame, in the foreground regions, a coarse face region is found using skin colour. Then using a dynamic template matching approach the face is efficiently segmented. The proposed algorithm is fast and suitable for real-time video sequence. The algorithm is invariant to large scale and pose variation. The segmented face is then handed over to a recognition algorithm based on principal component analysis and linear discriminant analysis. The online face detection, segmentation, and recognition algorithms take an average of 0.06 second on a 3.2 GHz P4 machine.

  20. Locomotive Schedule Optimization for Da-qin Heavy Haul Railway

    Directory of Open Access Journals (Sweden)

    Ruiye Su

    2015-01-01

    Full Text Available The main difference between locomotive schedule of heavy haul railways and that of regular rail transportation is the number of locomotives utilized for one train. One heavy-loaded train usually has more than one locomotive, but a regular train only has one. This paper develops an optimization model for the multilocomotive scheduling problem (MLSP through analyzing the current locomotive schedule of Da-qin Railway. The objective function of our paper is to minimize the total number of utilized locomotives. The MLSP is nondeterministic polynomial (NP hard. Therefore, we convert the multilocomotive traction problem into a single-locomotive traction problem. Then, the single-locomotive traction problem (SLTP can be converted into an assignment problem. The Hungarian algorithm is applied to solve the model and obtain the optimal locomotive schedule. We use the variance of detention time of locomotives at stations to evaluate the stability of locomotive schedule. In order to evaluate the effectiveness of the proposed optimization model, case studies for 20 kt and 30 kt heavy-loaded combined trains on Da-qin Railway are both conducted. Compared to the current schedules, the optimal schedules from the proposed models can save 62 and 47 locomotives for 20 kt and 30 kt heavy-loaded combined trains, respectively. Therefore, the effectiveness of the proposed model and its solution algorithm are both valid.

  1. Active Shop Scheduling Of Production Process Based On RFID Technology

    Directory of Open Access Journals (Sweden)

    Cuihua Chao

    2016-01-01

    Full Text Available In industry 4.0 environment, intelligent technology is almost applied to all parts of the manufacturing process, such as process design, job shop scheduling, etc.. This paper presents an efficient approach to job shop scheduling actively by using RFID to collect real-time manufacturing data. Identified the workpiece by RFID which needs to be machined, it can “ask for” the resource actively for the following process. With these active asking-for strategy, a double genetically encoded improved genetic algorithm is proposed for achieving active job shop scheduling solution during the actual manufacturing process. A case was used to evaluate its effectiveness. Meanwhile, , it can effectively and actively carry out job shop scheduling and has much better convergence effect comparing with basic genetic algorithm. And the job shop scheduler in management center can use the proposed algorithm to get the satisfied scheduling result timely by reducing waiting time and making begin time earlier during transmission between manufacturing process, which makes the scheduling result feasible and accurate.

  2. Enhanced Utility Accrual Scheduling Algorithms for Adaptive Real Time System

    Directory of Open Access Journals (Sweden)

    Idawaty Ahmad

    2009-01-01

    Full Text Available Problem statement: This study proposed two utility accrual real time scheduling algorithms named as Preemptive Utility Accrual Scheduling (PUAS and Non-preemptive Utility Accrual Scheduling (NUAS algorithms. These algorithms addressed the unnecessary abortion problem that was identified in the existing algorithm known as General Utility Scheduling (GUS. It is observed that GUS is inefficient for independent task model because it simply aborts any task that currently executing a resource with lower utility when a new task with higher utility requests the resource. The scheduling optimality criteria are based on maximizing accrued utility accumulated from execution of all tasks in the system. These criteria are named as Utility Accrual (UA. The UA scheduling algorithms are design for adaptive real time system environment where deadline misses are tolerable and do not have great consequences to the system. Approach: We eliminated the scheduling decision to abort a task in GUS and proposed to preempt a task instead of being aborted if the task is preemptive able. We compared the performances of these algorithms by using discrete event simulation. Results: The proposed PUAS algorithm achieved the highest accrued utility for the entire load range. This is followed by the NUAS and GUS algorithms. Conclusion: Simulation results revealed that the proposed algorithms were more efficient than the existing algorithm, producing with higher accrued utility ratio and less abortion ratio making it more suitable and efficient for real time application domain.

  3. Routing and Scheduling Algorithms for WirelessHARTNetworks: A Survey

    Directory of Open Access Journals (Sweden)

    Marcelo Nobre

    2015-04-01

    Full Text Available Wireless communication is a trend nowadays for the industrial environment. A number of different technologies have emerged as solutions satisfying strict industrial requirements (e.g., WirelessHART, ISA100.11a, WIA-PA. As the industrial environment presents a vast range of applications, adopting an adequate solution for each case is vital to obtain good performance of the system. In this context, the routing and scheduling schemes associated with these technologies have a direct impact on important features, like latency and energy consumption. This situation has led to the development of a vast number of routing and scheduling schemes. In the present paper, we focus on the WirelessHART technology, emphasizing its most important routing and scheduling aspects in order to guide both end users and the developers of new algorithms. Furthermore, we provide a detailed literature review of the newest routing and scheduling techniques forWirelessHART, discussing each of their features. These routing algorithms have been evaluated in terms of their objectives, metrics, the usage of theWirelessHART structures and validation method. In addition, the scheduling algorithms were also evaluated by metrics, validation, objectives and, in addition, by multiple superframe support, as well as by the redundancy method used. Moreover, this paper briefly presents some insights into the main WirelessHART simulation modules available, in order to provide viable test platforms for the routing and scheduling algorithms. Finally, some open issues in WirelessHART routing and scheduling algorithms are discussed.

  4. Flow-shop scheduling problem under uncertainties: Review and trends

    Directory of Open Access Journals (Sweden)

    Eliana María González-Neira

    2017-03-01

    Full Text Available Among the different tasks in production logistics, job scheduling is one of the most important at the operational decision-making level to enable organizations to achieve competiveness. Scheduling consists in the allocation of limited resources to activities over time in order to achieve one or more optimization objectives. Flow-shop (FS scheduling problems encompass the sequencing processes in environments in which the activities or operations are performed in a serial flow. This type of configuration includes assembly lines and the chemical, electronic, food, and metallurgical industries, among others. Scheduling has been mostly investigated for the deterministic cases, in which all parameters are known in advance and do not vary over time. Nevertheless, in real-world situations, events are frequently subject to uncertainties that can affect the decision-making process. Thus, it is important to study scheduling and sequencing activities under uncertainties since they can cause infeasibilities and disturbances. The purpose of this paper is to provide a general overview of the FS scheduling problem under uncertainties and its role in production logistics and to draw up opportunities for further research. To this end, 100 papers about FS and flexible flow-shop scheduling problems published from 2001 to October 2016 were analyzed and classified. Trends in the reviewed literature are presented and finally some research opportunities in the field are proposed.

  5. Recommended immunization schedule for children and adolescents: the Korean Pediatric Society, 2013

    Directory of Open Access Journals (Sweden)

    Dae Sun Jo

    2013-06-01

    Full Text Available This article contains the recommended immunization schedule by the Committee on Infectious Diseases of the Korean Pediatric Society, updated in March 2013, when Haemophilus influenzae type b vaccine is now included in the National Immunization Program in Korea. It also includes catchup immunization schedule for children and adolescents who are behind the recommended schedule. These schedules are a minor revision of the corresponding parts of Immunization Guideline, 7th edition, of the Korean Pediatric Society, released in 2012. Pediatricians should be aware of these schedules to provide adequate immunization to Korean children and adolescents.

  6. A Resource Scheduling Strategy in Cloud Computing Based on Multi-agent Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Wuxue Jiang

    2013-11-01

    Full Text Available Resource scheduling strategies in cloud computing are used either to improve system operating efficiency, or to improve user satisfaction. This paper presents an integrated scheduling strategy considering both resources credibility and user satisfaction. It takes user satisfaction as objective function and resources credibility as a part of the user satisfaction, and realizes optimal scheduling by using genetic algorithm. We integrate this scheduling strategy into Agent subsequently and propose a cloud computing system architecture based on Multi-agent. The numerical results show that this scheduling strategy improves not only the system operating efficiency, but also the user satisfaction.  

  7. Real Time Implementation Of Face Recognition System

    Directory of Open Access Journals (Sweden)

    Megha Manchanda

    2014-10-01

    Full Text Available This paper proposes face recognition method using PCA for real time implementation. Nowadays security is gaining importance as it is becoming necessary for people to keep passwords in their mind and carry cards. Such implementations however, are becoming less secure and practical, also is becoming more problematic thus leading to an increasing interest in techniques related to biometrics systems. Face recognition system is amongst important subjects in biometrics systems. This system is very useful for security in particular and has been widely used and developed in many countries. This study aims to achieve face recognition successfully by detecting human face in real time, based on Principal Component Analysis (PCA algorithm.

  8. Prioritizing sleep for healthy work schedules

    Directory of Open Access Journals (Sweden)

    Takahashi Masaya

    2012-03-01

    Full Text Available Abstract Good sleep is advantageous to the quality of life. Sleep-related benefits are particularly helpful for the working class, since poor or inadequate amounts of sleep degrade work productivity and overall health. This review paper explores the essential role of sleep in healthy work schedules and primarily focuses on the timing of sleep in relation to the work period (that is, before, during and after work. Data from laboratory, field and modeling studies indicate that consistent amounts of sleep prior to work are fundamental to improved performance and alertness in the workplace. In addition, planned naps taken during work maintain appropriate levels of waking function for both daytime and night-time work. Clearly, sufficient sleep after work is vital in promoting recovery from fatigue. Recent data also suggest that the time interval between shifts should be adjusted according to the biological timing of sleep. Although sleep is more likely to be replaced by job and other activities in the real life, research shows that it is worthwhile to revise the work schedules in order to optimize sleep before, sometime during and after the work period. Therefore, we suggest establishing work-sleep balance, similar to work-life balance, as a principle for designing and improving work schedules.

  9. DYNAMIC TASK SCHEDULING ON MULTICORE AUTOMOTIVE ECUS

    Directory of Open Access Journals (Sweden)

    Geetishree Mishra

    2014-12-01

    Full Text Available Automobile manufacturers are controlled by stringent govt. regulations for safety and fuel emissions and motivated towards adding more advanced features and sophisticated applications to the existing electronic system. Ever increasing customer’s demands for high level of comfort also necessitate providing even more sophistication in vehicle electronics system. All these, directly make the vehicle software system more complex and computationally more intensive. In turn, this demands very high computational capability of the microprocessor used in electronic control unit (ECU. In this regard, multicore processors have already been implemented in some of the task rigorous ECUs like, power train, image processing and infotainment. To achieve greater performance from these multicore processors, parallelized ECU software needs to be efficiently scheduled by the underlaying operating system for execution to utilize all the computational cores to the maximum extent possible and meet the real time constraint. In this paper, we propose a dynamic task scheduler for multicore engine control ECU that provides maximum CPU utilization, minimized preemption overhead, minimum average waiting time and all the tasks meet their real time deadlines while compared to the static priority scheduling suggested by Automotive Open Systems Architecture (AUTOSAR

  10. OUTLOOK ON VARIOUS SCHEDULING APPROACHES IN HADOOP

    Directory of Open Access Journals (Sweden)

    P. Amuthabala

    2016-02-01

    Full Text Available MapReduce is used for processing and generating sets large data .A open source framework of MapReduce is Hadoop [1]. MapReduce and Hadoop represent a good alternative for efficient large scale data processing and advanced analytics in an enterprise. In Heterogeneous computing, map or schedule a processor to a single core or different type of processors to a single core or a processor to many cores or many processors to many cores. So the usage of heterogeneous multi-core processors for the efficient performance in map reduce environments is increasing. Therefore the single heterogeneous multi-core processors consists of small and big cores where small cores provide power efficient and big-cores provide high-performance , which includes Inductive Logic Programming and Multilayer Perception to be extracted dynamically. This paper addresses various scheduling approaches that helps in improving the performance in heterogeneous environment. The outcome of this paper shows that traditional approaches used in Hadoop suffers from various issues. This paper will encourage in addressing those issues and discusses various scheduling approaches which helps in big data analysis.

  11. Genetic Algorithms for Satellite Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Fatos Xhafa

    2012-01-01

    Full Text Available Recently there has been a growing interest in mission operations scheduling problem. The problem, in a variety of formulations, arises in management of satellite/space missions requiring efficient allocation of user requests to make possible the communication between operations teams and spacecraft systems. Not only large space agencies, such as ESA (European Space Agency and NASA, but also smaller research institutions and universities can establish nowadays their satellite mission, and thus need intelligent systems to automate the allocation of ground station services to space missions. In this paper, we present some relevant formulations of the satellite scheduling viewed as a family of problems and identify various forms of optimization objectives. The main complexities, due highly constrained nature, windows accessibility and visibility, multi-objectives and conflicting objectives are examined. Then, we discuss the resolution of the problem through different heuristic methods. In particular, we focus on the version of ground station scheduling, for which we present computational results obtained with Genetic Algorithms using the STK simulation toolkit.

  12. Batch Delivery Scheduling with Multiple Decentralized Manufacturers

    Directory of Open Access Journals (Sweden)

    Shi Li

    2014-01-01

    Full Text Available This paper addresses an integrated decision on production scheduling and delivery operations, which is one of the most important issues in supply chain scheduling. We study a model in which a set of jobs ordered by only one customer and a set of decentralized manufacturers located at different locations are considered. Specifically, each job must be assigned to one of the decentralized manufacturers to process on its single machine facility. Then, the job is delivered to the customer directly in batch without intermediate inventory. The objective is to find a joint schedule of production and distribution to optimize the customer service level and delivery cost. In our work, we discuss this problem considering two different situations in terms of the customer service level. In the first one, the customer service is measured by the maximum arrival time, while the customer service is measured by the total arrival time in the second one. For each situation, we develop a dynamic programming algorithm to solve, respectively. Moreover, we identify a special case for the latter situation by introducing its corresponding solutions.

  13. Dynamic Task Scheduling on Multicore Automotive ECUs

    Directory of Open Access Journals (Sweden)

    Geetishree Mishra

    2014-12-01

    Full Text Available Automobile manufacturers are controlled by stringen t govt. regulations for safety and fuel emissions a nd motivated towards adding more advanced features and sophisticated applications to the existing electro nic system. Ever increasing customer’s demands for high level of comfort also necessitate providing even m ore sophistication in vehicle electronics system. All t hese, directly make the vehicle software system mor e complex and computationally more intensive. In turn , this demands very high computational capability o f the microprocessor used in electronic control unit (ECU. In this regard, multicore processors have already been implemented in some of the task rigoro us ECUs like, power train, image processing and infotainment. To achieve greater performance from t hese multicore processors, parallelized ECU softwar e needs to be efficiently scheduled by the underlayin g operating system for execution to utilize all the computational cores to the maximum extent possible and meet the real time constraint. In this paper, w e propose a dynamic task scheduler for multicore engi ne control ECU that provides maximum CPU utilization, minimized preemption overhead, minimum average waiting time and all the tasks meet their real time deadlines while compared to the static pr iority scheduling suggested by Automotive Open Syst ems Architecture (AUTOSAR.

  14. Ant Colony Optimisation for Backward Production Scheduling

    Directory of Open Access Journals (Sweden)

    Leandro Pereira dos Santos

    2012-01-01

    Full Text Available The main objective of a production scheduling system is to assign tasks (orders or jobs to resources and sequence them as efficiently and economically (optimised as possible. Achieving this goal is a difficult task in complex environment where capacity is usually limited. In these scenarios, finding an optimal solution—if possible—demands a large amount of computer time. For this reason, in many cases, a good solution that is quickly found is preferred. In such situations, the use of metaheuristics is an appropriate strategy. In these last two decades, some out-of-the-shelf systems have been developed using such techniques. This paper presents and analyses the development of a shop-floor scheduling system that uses ant colony optimisation (ACO in a backward scheduling problem in a manufacturing scenario with single-stage processing, parallel resources, and flexible routings. This scenario was found in a large food industry where the corresponding author worked as consultant for more than a year. This work demonstrates the applicability of this artificial intelligence technique. In fact, ACO proved to be as efficient as branch-and-bound, however, executing much faster.

  15. Faces in places: humans and machines make similar face detection errors.

    Directory of Open Access Journals (Sweden)

    Bernard Marius 't Hart

    Full Text Available The human visual system seems to be particularly efficient at detecting faces. This efficiency sometimes comes at the cost of wrongfully seeing faces in arbitrary patterns, including famous examples such as a rock configuration on Mars or a toast's roast patterns. In machine vision, face detection has made considerable progress and has become a standard feature of many digital cameras. The arguably most wide-spread algorithm for such applications ("Viola-Jones" algorithm achieves high detection rates at high computational efficiency. To what extent do the patterns that the algorithm mistakenly classifies as faces also fool humans? We selected three kinds of stimuli from real-life, first-person perspective movies based on the algorithm's output: correct detections ("real faces", false positives ("illusory faces" and correctly rejected locations ("non faces". Observers were shown pairs of these for 20 ms and had to direct their gaze to the location of the face. We found that illusory faces were mistaken for faces more frequently than non faces. In addition, rotation of the real face yielded more errors, while rotation of the illusory face yielded fewer errors. Using colored stimuli increases overall performance, but does not change the pattern of results. When replacing the eye movement by a manual response, however, the preference for illusory faces over non faces disappeared. Taken together, our data show that humans make similar face-detection errors as the Viola-Jones algorithm, when directing their gaze to briefly presented stimuli. In particular, the relative spatial arrangement of oriented filters seems of relevance. This suggests that efficient face detection in humans is likely to be pre-attentive and based on rather simple features as those encoded in the early visual system.

  16. Probing the Feature Map for Faces in Visual Search

    Directory of Open Access Journals (Sweden)

    Hua Yang

    2011-05-01

    Full Text Available Controversy surrounds the mechanisms underlying the pop-out effect for faces in visual search. Is there a feature map for faces? If so, does it rely on the categorical distinction between faces and nonfaces, or on image-level face semblance? To probe the feature map, we compared search efficiency for faces, and nonface stimuli with high, low, and no face semblance. First, subjects performed a visual search task with objects as distractors. Only faces popped-out. Moreover, search efficiency for nonfaces correlated with image-level face semblance of the target. In a second experiment, faces were used as distractors but nonfaces did not pop-out. Interestingly, search efficiency for nonfaces was not modulated by face semblance, although searching for a face among faces was particularly difficult, reflecting a categorical boundary between nonfaces and faces. Finally, inversion and contrast negation significantly interacted with the effect of face semblance, ruling out the possibility that search efficiency solely depends on low-level features. Our study supports a parallel search for faces that is perhaps preattentive. Like other features (color, orientation etc., there appears to be a continuous face feature map for visual search. Our results also suggest that this map may include both image-level face semblance and face categoricity.

  17. Oracle ADF Faces cookbook

    CERN Document Server

    Gawish, Amr

    2014-01-01

    This is a cookbook that covers more than 80 different recipes to teach you about different aspects of Oracle ADF Faces. It follows a practical approach and covers how to build your components for reuse in different applications. This book will also help you in tuning the performance of your ADF Faces application. If you are an ADF developer who wants to harness the power of Oracle ADF Faces to create exceptional user interfaces and reactive applications, this book will provide you with the recipes needed to do just that. You will not need to be familiar with Oracle ADF Faces, but you should be

  18. Residency Applicants Prefer Online System for Scheduling Interviews

    Directory of Open Access Journals (Sweden)

    Wills, Charlotte

    2015-03-01

    Full Text Available Introduction: Residency coordinators may be overwhelmed when scheduling residency interviews. Applicants often have to coordinate interviews with multiple programs at once, and relying on verbal or email confirmation may delay the process. Our objective was to determine applicant mean time to schedule and satisfaction using online scheduling. Methods: This pilot study is a retrospective analysis performed on a sample of applicants offered interviews at an urban county emergency medicine residency. Applicants were asked their estimated time to schedule with the online system compared to their average time using other methods. In addition, they were asked on a five-point anchored scale to rate their satisfaction. Results: Of 171 applicants, 121 completed the survey (70.8%. Applicants were scheduling an average of 13.3 interviews. Applicants reported scheduling interviews using the online system in mean of 46.2 minutes (median 10, range 1-1800 from the interview offer as compared with a mean of 320.2 minutes (median 60, range 3-2880 for other programs not using this system. This difference was statistically significant. In addition, applicants were more likely to rate their satisfaction using the online system as “satisfied” (83.5% vs 16.5%. Applicants were also more likely to state that they preferred scheduling their interviews using the online system rather than the way other programs scheduled interviews (74.2% vs 4.1% and that the online system aided them coordinating travel arrangements (52.1% vs 4.1%. Conclusion: An online interview scheduling system is associated with higher satisfaction among applicants both in coordinating travel arrangements and in overall satisfaction. [West J Emerg Med. 2015;16(2:352-354.

  19. Dynamic Scheduling for Cloud Reliability using Transportation Problem

    Directory of Open Access Journals (Sweden)

    P. Balasubramanie

    2012-01-01

    Full Text Available Problem statement: Cloud is purely a dynamic environment and the existing task scheduling algorithms are mostly static and considered various parameters like time, cost, make span, speed, scalability, throughput, resource utilization, scheduling success rate and so on. Available scheduling algorithms are mostly heuristic in nature and more complex, time consuming and does not consider reliability and availability of the cloud computing environment. Therefore there is a need to implement a scheduling algorithm that can improve the availability and reliability in cloud environment. Approach: We propose a new algorithm using modified linear programming problem transportation based task scheduling and resource allocation for decentralized dynamic cloud computing. The Main objective is to improve the reliability of cloud computing environment by considering the resources available and it’s working status of each Cluster periodically and maximizes the profit for the cloud providers by minimizing the total cost for scheduling, allocation and execution cost and minimizing total turn-around, total waiting time and total execution time. Our proposed algorithm also utilizes task historical values such as past success rate, failure rate of task in each Cluster and previous execution time and total cost for various Clusters for each task from Task Info Container (TFC for tasks scheduling resource allocation for near future. Results: Our approach TP Scheduling (Transpotation Problem based responded for various tasks assigned by clients in poisson arrival pattern and achieved the improved reliability in dynamic decentralized cloud environment. Conclusion: With our proposed TP Scheduling algorithn we improve the Reliability of the decentralized dynamic cloud computing.

  20. “Review on Human Face Detection based on Skin Color and Edge Information”

    Directory of Open Access Journals (Sweden)

    Divyesh S. Gondaliya

    2015-01-01

    Full Text Available Human face detection system is gradually used for the tracking a human face. Face detection system is mainly used in face reorganization system for detecting human face. Here in this review paper we have describe how face detection system works and where it is useful in real world environment. We have describes different technique like template matching, skin color and edge information based on face detection from skin region, symmetry based face detection and etc.

  1. Robust Face Recognition through Local Graph Matching

    Directory of Open Access Journals (Sweden)

    Ehsan Fazl-Ersi

    2007-09-01

    Full Text Available A novel face recognition method is proposed, in which face images are represented by a set of local labeled graphs, each containing information about the appearance and geometry of a 3-tuple of face feature points, extracted using Local Feature Analysis (LFA technique. Our method automatically learns a model set and builds a graph space for each individual. A two-stage method for optimal matching between the graphs extracted from a probe image and the trained model graphs is proposed. The recognition of each probe face image is performed by assigning it to the trained individual with the maximum number of references. Our approach achieves perfect result on the ORL face set and an accuracy rate of 98.4% on the FERET face set, which shows the superiority of our method over all considered state-of-the-art methods. I

  2. Anger Superiority in Single-Face Judgements

    Directory of Open Access Journals (Sweden)

    Hiroshi Ashida

    2011-05-01

    Full Text Available We investigated “anger superiority” in single-face judgements. Angry, or threatening, faces are easier to find than smiling ones (Hansen & Hansen, 1988 but it remains controversial whether this reflects emotional effects on the basis of the whole face or rather perceptual effects on the basis of parts. We sought this question differently from most previous studies that used the visual search paradigm. We presented a picture of angry, smiling, or neutral face (extracted from ATR DB99 database that has been confirmed for emotional strength either to the left or to the right of the fixation mark, which was followed by a mask, and the participants were asked to make a forced-choice judgement of anger or smile. The results showed that neutral faces were significantly biased towards anger with upright presentation but not with inverted presentation. Angry and smiling faces were judged equally well with upright presentation, while there was notable reduction of correct responses only for angry face with inverted presentation. Difference between hemifields was not clear. The results suggest that angry faces are judged on the basis of configural processing of the whole face, while smiling faces may be judged more locally on the basis of parts.

  3. A GRASP for Next Generation Sapphire Image Acquisition Scheduling

    Directory of Open Access Journals (Sweden)

    Yang Wang

    2016-01-01

    Full Text Available This paper investigates an image acquisition scheduling problem for a Canadian surveillance-of-space satellite named Sapphire that takes images of deep space Earth-orbiting objects. For a set of resident space objects (RSOs that needs to be imaged within the time horizon of one day, the Sapphire image acquisition scheduling (SIAS problem is to find a schedule that maximizes the “Figure of Merit” of all the scheduled RSO images. To address the problem, we propose an effective GRASP heuristic that alternates between a randomized greedy constructive procedure and a local search procedure. Experimental comparisons with the currently used greedy algorithm are presented to demonstrate the merit of the proposed algorithm in handling the SIAS problem.

  4. Automated Guide Vehicles Dynamic Scheduling Based on Annealing Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Zou Gan

    2013-05-01

    Full Text Available Dispatching automated guided vehicles (AGVs is the common approach for AGVs scheduling in practice, the information about load arrivals in advance was not used to optimize the performance of the automated guided vehicles system (AGVsS. According to the characteristics of the AGVsS, the mathematical model of AGVs scheduling was established. A heuristic algorithm called Annealing Genetic Algorithm (AGA was presented to deal with the AGVs scheduling problem,and applied the algorithm dynamically by using it repeatedly under a combined rolling optimization strategy. the performance of the proposed approach for AGVs scheduling was compared with the dispatching rules by simulation. Results showed that the approach performs significantly better than the dispatching rules and proved that it is really effective for AGVsS.

  5. An Automatic Course Scheduling Approach Using Instructors' Preferences

    Directory of Open Access Journals (Sweden)

    Hossam Faris

    2012-03-01

    Full Text Available University Courses Timetabling problem has been extensively researched in the last decade. Therefore, numerous approaches were proposed to solve UCT problem. This paper proposes a new approach to process a sequence of meetings between instructors, rooms, and students in predefined periods of time with satisfying a set of constraints divided in variety of types. In addition, this paper proposes new representation for courses timetabling and conflict-free for each time slot by mining instructor preferences from previous schedules to avoid undesirable times for instructors. Experiments on different real data showed the approach achieved increased satisfaction degree for each instructor and gives feasible schedule with satisfying all hard constraints in construction operation. The generated schedules have high satisfaction degrees comparing with schedules created manually. The research conducts experiments on collected data gathered from the computer science department and other related departments in Jordan University of Science and Technology- Jordan.

  6. Energy Constrained Hierarchical Task Scheduling Algorithm for Mobile Grids

    Directory of Open Access Journals (Sweden)

    Arjun Singh

    2014-05-01

    Full Text Available In mobile grids, scheduling the computation tasks and the communication transactions onto the target architecture is the important problem when a mobile grid environment and a pre-selected architecture are given. Even though the scheduling problem is a traditional topic, almost all previous work focuses on maximizing the performance through the scheduling process. The algorithms developed this way are not suitable for real-time embedded applications, in which the main objective is to minimize the energy consumption of the system under tight performance constraints. This paper entails an energy constrained hierarchical task scheduling algorithm for Mobile Grids to minimize the power consumption of the mobile nodes. The task is rescheduled when the mobile node moves beyond the transmission range. The performance is estimated based on the average delay and packet delivery ratio based on nodes and flows. The performance metrics are analysed using NS-2 simulator.

  7. A greedy double swap heuristic for nurse scheduling

    Directory of Open Access Journals (Sweden)

    Murphy Choy

    2012-10-01

    Full Text Available One of the key challenges of nurse scheduling problem (NSP is the number of constraints placed on preparing the timetable, both from the regulatory requirements as well as the patients’ demand for the appropriate nursing care specialists. In addition, the preferences of the nursing staffs related to their work schedules add another dimension of complexity. Most solutions proposed for solving nurse scheduling involve the use of mathematical programming and generally considers only the hard constraints. However, the psychological needs of the nurses are ignored and this resulted in subsequent interventions by the nursing staffs to remedy any deficiency and often results in last minute changes to the schedule. In this paper, we present a staff preference optimization framework solved with a greedy double swap heuristic. The heuristic yields good performance in speed at solving the problem. The heuristic is simple and we will demonstrate its performance by implementing it on open source spreadsheet software.

  8. Ergonomic workforce scheduling under complex worker limitation and task requirements:

    Directory of Open Access Journals (Sweden)

    Tanuchporn Wongwien

    2012-11-01

    Full Text Available The ergonomic workforce scheduling problem (WPS is addressed in this paper. Unlike its previous related works, theproblem considers realistic worker limitation and task requirements that include heterogeneous workforce with limited taskflexibility, varying worker team sizes, and pre-defined task operation schedules. Its main objective is to find a daily rotatingwork schedule solution using a minimum number of workers such that all workers’ ergonomics hazard exposures do notexceed a permissible limit. Initially, the ergonomic WPS is explained. Its mathematical model and approximation procedure toobtain the workforce schedule solution are described. From the results of the computation experiment, it can be concludedthat the approximation procedure is both efficient and effective in solving large-sized ergonomic workforce schedulingproblems.

  9. Workload-aware VM Scheduling on Multicore Systems

    Directory of Open Access Journals (Sweden)

    Insoon Jo

    2011-11-01

    Full Text Available In virtualized environments, performance interference between virtual machines (VMs is a key challenge. In order to mitigate resource contention, an efficient VM scheduling is positively necessary.In this paper, we propose a workload-aware VM scheduler on multi-core systems, which finds a systemwide mapping of VMs to physical cores. Our work aims not only at minimizing the number of used hosts,but at maximizing the system throughput. To achieve the first goal, our scheduler dynamically adjusts a set of used hosts. To achieve the second goal, it maps each VM on a physical core where the physical core and its host most sufficiently meet the resource requirements of the VM. Evaluation demonstrates that our scheduling ensures efficient use of data center resources.

  10. Integrated Task Clustering, Mapping and Scheduling for Heterogeneous Computing Systems

    Directory of Open Access Journals (Sweden)

    Yuet Ming Lam

    2012-03-01

    Full Text Available This paper presents a new approach for mapping and scheduling task graphs for heterogeneous hardware/software computing systems using heuristic search. Task mapping and scheduling are vital in hardware/software codesign and previous approaches that treat them separately lead to suboptimal solutions. In this paper, we propose two techniques to enhance the speedup of mapping/scheduling solutions: (1 an integrated technique combining task clustering, mapping, and scheduling, and (2 a multiple neighborhood function strategy. Our approach is demonstrated by case studies involving 40 randomly generated task graphs, as well as six applications. Experimental results show that our proposed approach outperforms a separate approach in terms of speedup by up to 18.3% for a system with a microprocessor, a floating-point digital signal processor, and an FPGA.

  11. Dynamic Extra Buses Scheduling Strategy in Public Transport

    Directory of Open Access Journals (Sweden)

    Bin Yu

    2015-06-01

    Full Text Available This paper presents a dynamic extra buses scheduling strategy to improve the transit service of transit routes. In this strategy, in order to decide when to dispatch an extra bus, the service reliability of transit route is assessed firstly. A model aimed at maximizing the benefit of the extra buses scheduling strategy is constructed to determine how many stops extra buses need to skip from the terminal to accommodate passengers at the following stops. A heuristic algorithm is defined and implemented to estimate the service reliability of transit route and to optimize the initial stop of extra buses scheduling strategy. Finally, the strategy is tested on two examples: a simple and a real-life transit route in the Dalian city in China. The results show that the extra buses scheduling strategy based on terminal stops with a reasonable threshold can save 8.01% waiting time of passengers.

  12. Deadlock-free Production Scheduling with Dynamic Buffers in MES

    Directory of Open Access Journals (Sweden)

    Taiping Mo

    2014-11-01

    Full Text Available In order to enable enterprises to change the production management mode and improve efficiency, MES provides overall solutions to information integration of manufacturing enterprises. Production scheduling is an important functional module in MES, and research of shop scheduling in MES has important significance. The concept deadlock is first put forward by computer science researchers who are engaged in resource allocation in the operation system. Modern manufacturing enterprises need to process complex workpieces with different processing step, so it is easy to produce a deadlock in the production process. A deadlock will bring many serious consequences for the system. Equipping with enough buffers can solve the problem of deadlock. However, it is costly and there is even no way to allocate buffers in some manufacturing industries. Considering the buffer cost and scheduling index, this paper puts forward the dynamic buffers deadlock-free scheduling to reduce cost and lower risk of the enterprise to a minimum.

  13. Design and Realization of the Safety Production Scheduling System

    Directory of Open Access Journals (Sweden)

    Qiang Fan

    2013-01-01

    Full Text Available In this study, we have a research of the design and realization of the Safety Production Scheduling System. Urged by the government departments as well as safety supervising institutions, many coal enterprises are embarking on designing and constructing an information system platform for safety production and scheduling. How to establish a systematic, comprehensive, standardized and scientific management platform for the safety production and scheduling has become a hot issue in the coal industry, which is also an important move to integrate various safety management measures in order to prevent major safety accidents and keep up with the international industry status. Taking a successful, large-scale safety production and scheduling system for example, this study elaborates on its overall design and construction. When the system is completed, it will play an important role in strengthening safety production of the coal mines, preventing accidents as well as increasing the overall safety level of the coal industry.

  14. 75 FR 39629 - FOIA Fee Schedule Update

    Science.gov (United States)

    2010-07-12

    ... 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board. ACTION: Establishment of... Information Act (FOIA) Fee Schedule Update pursuant to 10 CFR 1703.107(b)(6) of the Board's regulations. DATES... update the FOIA Fee Schedule once every 12 months. The previous Fee Schedule Update was published in...

  15. 76 FR 43819 - FOIA Fee Schedule Update

    Science.gov (United States)

    2011-07-22

    ... SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board... publishing its Freedom of Information Act (FOIA) Fee Schedule Update pursuant to the Board's regulations... General Manager will update the FOIA Fee Schedule once every 12 months. The previous Fee Schedule...

  16. Gain scheduling using the youla parameterization

    DEFF Research Database (Denmark)

    Niemann, H.H.; Stoustrup, Jakob

    1999-01-01

    Gain scheduling controllers are considered in this paper. The gain scheduling problem where the scheduling parameter vector theta cannot be measured directly, but needs to be estimated is considered. An estimation of the scheduling vector theta has been derived by using the Youla parameterization...

  17. Schedules of controlled substances: temporary placement of three synthetic cannabinoids into Schedule I. Final order.

    Science.gov (United States)

    2013-05-16

    The Deputy Administrator of the Drug Enforcement Administration (DEA) is issuing this final order to temporarily schedule three synthetic cannabinoids under the Controlled Substances Act (CSA) pursuant to the temporary scheduling provisions of 21 U.S.C. 811(h). The substances are (1-pentyl-1H-indol-3-yl)(2,2,3,3-tetramethylcyclopropyl)methanone (UR-144), [1-(5-fluoro-pentyl)-1H-indol-3-yl](2,2,3,3-tetramethylcyclopropyl)methanone (5-fluoro-UR-144, XLR11) and N-(1-adamantyl)-1-pentyl-1H-indazole-3-carboxamide (APINACA, AKB48). This action is based on a finding by the Deputy Administrator that the placement of these synthetic cannabinoids and their salts, isomers and salts of isomers into Schedule I of the CSA is necessary to avoid an imminent hazard to the public safety. As a result of this order, the full effect of the CSA and the Controlled Substances Import and Export Act (CSIEA) and their implementing regulations including criminal, civil and administrative penalties, sanctions and regulatory controls of Schedule I substances will be imposed on the manufacture, distribution, possession, importation, and exportation of these synthetic cannabinoids.

  18. Efficient schedulability analysis for mixed-criticality systems under deadline-based scheduling

    Directory of Open Access Journals (Sweden)

    Chen Yao

    2014-08-01

    Full Text Available Safety-critical avionics systems which become more complex and tend to integrate multiple functionalities with different levels of criticality for better cost and power efficiency are subject to certifications at various levels of rigorousness. In order to simultaneously guarantee temporal constraints at all different levels of assurance mandated by different criticalities, novel scheduling techniques are in need. In this paper, a mixed-criticality sporadic task model with multiple virtual deadlines is built and a certification-cognizant dynamic scheduling approach referred as earliest virtual-deadline first with mixed-criticality (EVDF-MC is considered, which exploits different relative deadlines of tasks in different criticality modes. As for the corresponding schedulability analysis problem, a sufficient and efficient schedulability test is proposed on the basis of demand-bound functions derived in the mixed-criticality scenario. In addition, a modified simulated annealing (MSA-based heuristic approach is established for virtual deadlines assignment. Experiments performing simulations with randomly generated tasks indicate that the proposed approach is computationally efficient and competes well against the existing approaches.

  19. Batch Scheduling a Fresh Approach

    Science.gov (United States)

    Cardo, Nicholas P.; Woodrow, Thomas (Technical Monitor)

    1994-01-01

    The Network Queueing System (NQS) was designed to schedule jobs based on limits within queues. As systems obtain more memory, the number of queues increased to take advantage of the added memory resource. The problem now becomes too many queues. Having a large number of queues provides users with the capability to gain an unfair advantage over other users by tailoring their job to fit in an empty queue. Additionally, the large number of queues becomes confusing to the user community. The High Speed Processors group at the Numerical Aerodynamics Simulation (NAS) Facility at NASA Ames Research Center developed a new approach to batch job scheduling. This new method reduces the number of queues required by eliminating the need for queues based on resource limits. The scheduler examines each request for necessary resources before initiating the job. Also additional user limits at the complex level were added to provide a fairness to all users. Additional tools which include user job reordering are under development to work with the new scheduler. This paper discusses the objectives, design and implementation results of this new scheduler

  20. Generalization of affective learning about faces to perceptually similar faces.

    Science.gov (United States)

    Verosky, Sara C; Todorov, Alexander

    2010-06-01

    Different individuals have different (and different-looking) significant others, friends, and foes. The objective of this study was to investigate whether these social face environments can shape individual face preferences. First, participants learned to associate faces with positive, neutral, or negative behaviors. Then, they evaluated morphs combining novel faces with the learned faces. The morphs (65% and 80% novel faces) were within the categorical boundary of the novel faces: They were perceived as those faces in a preliminary study. Moreover, a second preliminary study showed that following the learning, the morphs' categorization as similar to the learned faces was indistinguishable from the categorization of actual novel faces. Nevertheless, in the main experiment, participants evaluated morphs of "positive" faces more positively than morphs of "negative" faces. This learning generalization effect increased as a function of the similarity of the novel faces to the learned faces. The findings suggest that general learning mechanisms based on similarity can account for idiosyncratic face preferences.

  1. Eye-tracking analysis of face observing and face recognition

    Directory of Open Access Journals (Sweden)

    Andrej Iskra

    2016-07-01

    Full Text Available Images are one of the key elements of the content of the World Wide Web. One group of web images are also photos of people. When various institutions (universities, research organizations, companies, associations, etc. present their staff, they should include photos of people for the purpose of more informative presentation. The fact is, that there are many specifies how people see face images and how do they remember them. Several methods to investigate person’s behavior during use of web content can be performed and one of the most reliable method among them is eye tracking. It is very common technique, particularly when it comes to observing web images. Our research focused on behavior of observing face images in process of memorizing them. Test participants were presented with face images shown at different time scale. We focused on three main face elements: eyes, mouth and nose. The results of our analysis can help not only in web presentation, which are, in principle, not limited by time observation, but especially in public presentations (conferences, symposia, and meetings.

  2. Integrated Production and Distribution Scheduling Problems Related to Fixed Delivery Departure Dates and Weights of Late Orders

    Directory of Open Access Journals (Sweden)

    Shanlin Li

    2015-01-01

    Full Text Available We consider an integrated production and distribution scheduling problem faced by a typical make-to-order manufacturer which relies on a third-party logistics (3PL provider for finished product delivery to customers. In the beginning of a planning horizon, the manufacturer has received a set of orders to be processed on a single production line. Completed orders are delivered to customers by a finite number of vehicles provided by the 3PL company which follows a fixed daily or weekly shipping schedule such that the vehicles have fixed departure dates which are not part of the decisions. The problem is to find a feasible schedule that minimizes one of the following objective functions when processing times and weights are oppositely ordered: (1 the total weight of late orders and (2 the number of vehicles used subject to the condition that the total weight of late orders is minimum. We show that both problems are solvable in polynomial time.

  3. Strategic information security: facing the cyber impact

    CSIR Research Space (South Africa)

    Grobler, M

    2010-10-01

    Full Text Available necessitate an integrated organisational approach to information security. However, the best information security infrastructure cannot guarantee that cyber attacks and malicious intrusions will not happen. It has become necessary to face the impact...

  4. Feature-based telescope scheduler

    Science.gov (United States)

    Naghib, Elahesadat; Vanderbei, Robert J.; Stubbs, Christopher

    2016-07-01

    Feature-based Scheduler offers a sequencing strategy for ground-based telescopes. This scheduler is designed in the framework of Markovian Decision Process (MDP), and consists of a sub-linear online controller, and an offline supervisory control-optimizer. Online control law is computed at the moment of decision for the next visit, and the supervisory optimizer trains the controller by simulation data. Choice of the Differential Evolution (DE) optimizer, and introducing a reduced state space of the telescope system, offer an efficient and parallelizable optimization algorithm. In this study, we applied the proposed scheduler to the problem of Large Synoptic Survey Telescope (LSST). Preliminary results for a simplified model of LSST is promising in terms of both optimality, and computational cost.

  5. Scheduling Linearly Indexed Assignment Codes

    Science.gov (United States)

    Kailath, Thomas; Roychowdhury, Vwani P.

    1989-05-01

    It has been recently shown that linearly indexed Assignment Codes can be efficiently used for coding several problems especially in signal processing and matrix algebra. In fact, mathematical expressions for many algorithms are directly in the form of linearly indexed codes, and examples include the formulas for matrix multiplication, any m-dimensional convolution/correlation, matrix transposition, and solving matrix Lyapunov's equation. Systematic procedures for converting linearly indexed Assignment Codes to localized algorithms that are closely related to Regular Iterative Algorithms (RIAs) have also been developed. These localized algorithms can be often efficiently scheduled by modeling them as RIAs; however, it is not always efficient to do so. In this paper we shall analyze and develop systematic procedures for determining efficient schedules directly for the linearly indexed ACs and the localized algorithms. We shall also illustrate our procedures by determining schedules for examples such as matrix transposition and Gauss-Jordan elimination algorithm.

  6. Schedulability Analysis for Java Finalizers

    DEFF Research Database (Denmark)

    Bøgholm, Thomas; Hansen, Rene Rydhof; Søndergaard, Hans

    2010-01-01

    Java finalizers perform clean-up and finalisation of objects at garbage collection time. In real-time Java profiles the use of finalizers is either discouraged (RTSJ, Ravenscar Java) or even disallowed (JSR-302), mainly because of the unpredictability of finalizers and in particular their impact...... on the schedulability analysis. In this paper we show that a controlled scoped memory model results in a structured and predictable execution of finalizers, more reminiscent of C++ destructors than Java finalizers. Furthermore, we incorporate finalizers into a (conservative) schedulability analysis for Predictable Java...... programs. Finally, we extend the SARTS tool for automated schedulability analysis of Java bytecode programs to handle finalizers in a fully automated way....

  7. Optimal randomized scheduling by replacement

    Energy Technology Data Exchange (ETDEWEB)

    Saias, I.

    1996-05-01

    In the replacement scheduling problem, a system is composed of n processors drawn from a pool of p. The processors can become faulty while in operation and faulty processors never recover. A report is issued whenever a fault occurs. This report states only the existence of a fault but does not indicate its location. Based on this report, the scheduler can reconfigure the system and choose another set of n processors. The system operates satisfactorily as long as, upon report of a fault, the scheduler chooses n non-faulty processors. We provide a randomized protocol maximizing the expected number of faults the system can sustain before the occurrence of a crash. The optimality of the protocol is established by considering a closely related dual optimization problem. The game-theoretic technical difficulties that we solve in this paper are very general and encountered whenever proving the optimality of a randomized algorithm in parallel and distributed computation.

  8. Schedulability Analysis for Java Finalizers

    DEFF Research Database (Denmark)

    Bøgholm, Thomas; Hansen, Rene Rydhof; Ravn, Anders P.;

    2010-01-01

    Java finalizers perform clean-up and finalisation of objects at garbage collection time. In real-time Java profiles the use of finalizers is either discouraged (RTSJ, Ravenscar Java) or even disallowed (JSR-302), mainly because of the unpredictability of finalizers and in particular their impact ...... programs. Finally, we extend the SARTS tool for automated schedulability analysis of Java bytecode programs to handle finalizers in a fully automated way.......Java finalizers perform clean-up and finalisation of objects at garbage collection time. In real-time Java profiles the use of finalizers is either discouraged (RTSJ, Ravenscar Java) or even disallowed (JSR-302), mainly because of the unpredictability of finalizers and in particular their impact...... on the schedulability analysis. In this paper we show that a controlled scoped memory model results in a structured and predictable execution of finalizers, more reminiscent of C++ destructors than Java finalizers. Furthermore, we incorporate finalizers into a (conservative) schedulability analysis for Predictable Java...

  9. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2010-01-01

    Dynamic models of congestion so far rely on exogenous scheduling preferences of travelers, based for example on disutility of deviation from a preferred departure or arrival time for a trip. This paper provides a more fundamental view in which travelers derive utility just from consumption...... and leisure, but agglomeration economies at home and at work lead to scheduling preferences forming endogenously. Using bottleneck congestion technology, we obtain an equilibrium queuing pattern consistent with a general version of the Vickrey bottleneck model. However, the policy implications are different....... Compared to the predictions of an analyst observing untolled equilibrium and taking scheduling preferences as exogenous, we find that both the optimal capacity and the marginal external cost of congestion have changed. The benefits of tolling are greater, and the optimal time varying toll is different....

  10. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1997-01-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest National Laboratory (PNNL)(a) for the US Department of Energy (DOE). This document contains the planned 1997 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP) and Drinking Water Monitoring Project. In addition, Section 3.0, Biota, also reflects a rotating collection schedule identifying the year a specific sample is scheduled for collection. The purpose of these monitoring projects is to evaluate levels of radioactive and nonradioactive pollutants in the Hanford environs, as required in DOE Order 5400.1, General Environmental Protection Program, and DOE Order 5400.5, Radiation Protection of the Public and the Environment. The sampling methods will be the same as those described in the Environmental Monitoring Plan, US Department of Energy, Richland Operations Office, DOE/RL91-50, Rev. 1, US Department of Energy, Richland, Washington.

  11. A Disk Scheduling Algorithm: SPFF

    Institute of Scientific and Technical Information of China (English)

    HU Ming

    2005-01-01

    We put forward an optimal disk schedule with n disk requests and prove its optimality mathematically. Generalizing the idea of an optimal disk schedule, we remove the limit of n requests and, at the same time, consider the dynamically arrival model of disk requests to obtain an algorithm, shortest path first-fit first (SPFF). This algorithm is based on the shortest path of disk head motion constructed by all the pendent requests. From view of the head-moving distance, it has the stronger globality than SSTF. From view of the head-moving direction, it has the better flexibility than SCAN. Therefore, SPFF keeps the advantage of SCAN and, at the same time, absorbs the strength of SSTF. The algorithm SPFF not only shows the more superiority than other scheduling polices, but also have higher adjustability to meet the computer system's different demands.

  12. Safe self-scheduling: A parallel loop scheduling scheme for shared-memory multiprocessors

    Energy Technology Data Exchange (ETDEWEB)

    Liu, J. [Western Oregon State College, Monmouth, OR (United States); Saletore, V.A. [Oregon State Univ., Corvallis, OR (United States); Lewis, T.G. [Naval Postgraduate School, Monterey, CA (United States)

    1994-12-01

    In this paper we present Safe Self-Scheduling (SSS), a new scheduling scheme that schedules parallel loops with variable length iteration execution times not known at compile time. The scheme assumes a shared memory space. SSS combines static scheduling with dynamic scheduling and draws favorable advantages from each. First, it reduces the dynamic scheduling overhead by statistically scheduling a major portion of loop iterations. Second, the workload is balanced with simple and efficient self-scheduling scheme by applying a new measure, the smallest critical chore size. Experimental results comparing SSS with other scheduling schemes indicate that SSS surpasses other scheduling schemes. In the experiment on Gauss-Jordan, an application that is suitable for static scheduling schemes, SSS is the only self-scheduling scheme that outperforms the static scheduling scheme. This indicates that SSS achieves a balanced workload with a very small amount of overhead.

  13. Facing the Crises

    Directory of Open Access Journals (Sweden)

    Moira Baker

    2014-12-01

    Full Text Available Timely, provocative, and theoretically sophisticated, the essays comprising In the Face of Crises: Anglophone Literature in the Postmodern World situate their work amid several critical global concerns: the devastation wreaked by global capitalism following the worldwide financial crash, the financial sector’s totalizing grip upon the world economy, the challenge to traditional definitions of “human nature” and identity posed by technologies of the body and of warfare, the quest of indigenous communities for healing from the continuing traumatic effects of colonization, and the increasing corporatization of the academy as an apparatus of the neo-liberal state – to specify only a few. Edited by Professors Ljubica Matek and Jasna Poljak Rehlicki, these essays deploy a broad range of contemporary theories, representing recent developments in cultural studies, the new economic criticism, postcolonial film studies, feminism and gender studies, and the new historicism. The eleven essays selected by Matek and Rehlicki offer convincing support for their claim that humanistic research delving into Anglophone literature, far from being a “non-profitable” pursuit in an increasingly technologized society, affords clarifying insights into contemporary “economic, cultural, and social processes in the globalizing and globalized culture of the West” (ix.

  14. Social judgments from faces.

    Science.gov (United States)

    Todorov, Alexander; Mende-Siedlecki, Peter; Dotsch, Ron

    2013-06-01

    People make rapid and consequential social judgments from minimal (non-emotional) facial cues. There has been rapid progress in identifying the perceptual basis of these judgments using data-driven, computational models. In contrast, our understanding of the neural underpinnings of these judgments is rather limited. Meta-analyses of neuroimaging studies find a wide range of seemingly inconsistent responses in the amygdala that co-vary with social judgments from faces. Guided by computational models of social judgments, these responses can be accounted by positing that the amygdala (and posterior face selective regions) tracks face typicality. Atypical faces, whether positively or negatively evaluated, elicit stronger responses in the amygdala. We conclude with the promise of data-driven methods for modeling neural responses to social judgments from faces.

  15. Round robin based Secure-Aware Packet Scheduling in Wireless Networks

    Directory of Open Access Journals (Sweden)

    Arun Raj

    2013-03-01

    Full Text Available Packet scheduling algorithms enhances the packet delivery rate effectively in wireless networks; it helps to improve the quality of service of the wireless networks. Many algorithms had been deployed in the area of packet scheduling in wireless networks but less attention is paid to security. Some algorithms which offer security often compromise performances such as schedulability, this is not desirable. This performance problem will become worse when the system is under heavy load. In this paper we propose Round robin based Secure- Aware Packet Scheduling algorithm (RSAPS for wireless networks which focuses on secure scheduling. RSAPS is an adaptive algorithm which gives priority to scheduling when system is under heavy load. Under light load RSAPS provide maximum security for the incoming packets. Simulation has been performed using the proposed method and compared with existing algorithms SPSS and ISPAS. And it is found that RSAPS shows excellent scheduling quality holding the security levels.

  16. Off-Line and Dynamic Production Scheduling – A Comparative Case Study

    Directory of Open Access Journals (Sweden)

    Bożek Andrzej

    2016-03-01

    Full Text Available A comprehensive case study of manufacturing scheduling solutions development is given. It includes highly generalized scheduling problem as well as a few scheduling modes, methods and problem models. The considered problem combines flexible job shop structure, lot streaming with variable sublots, transport times, setup times, and machine calendars. Tabu search metaheuristic and constraint programming methods have been used for the off-line scheduling. Two dynamic scheduling methods have also been implemented, i.e., dispatching rules for the completely reactive scheduling and a multi-agent system for the predictivereactive scheduling. In these implementations three distinct models of the problem have been used, based on: graph representation, optimal constraint satisfaction, and Petri net formalism. Each of these solutions has been verified in computational experiments. The results are compared and some findings about advantages, disadvantages, and suggestions on using the solutions are formulated.

  17. Micro-Opportunistic Scheduling: The Micro-Boss Factory Scheduler

    Science.gov (United States)

    1994-01-01

    M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Co., 1979. [13] Eliyahu M. Goldratt ...techniques is the one developed by Goldratt and his colleagues within the context of the OPT factory scheduling system [13, 15, 10]. OPT demonstrated

  18. Scheduling to Minimize Energy and Flow Time in Broadcast Scheduling

    CERN Document Server

    Moseley, Benjamin

    2010-01-01

    In this paper we initiate the study of minimizing power consumption in the broadcast scheduling model. In this setting there is a wireless transmitter. Over time requests arrive at the transmitter for pages of information. Multiple requests may be for the same page. When a page is transmitted, all requests for that page receive the transmission simulteneously. The speed the transmitter sends data at can be dynamically scaled to conserve energy. We consider the problem of minimizing flow time plus energy, the most popular scheduling metric considered in the standard scheduling model when the scheduler is energy aware. We will assume that the power consumed is modeled by an arbitrary convex function. For this problem there is a $\\Omega(n)$ lower bound. Due to the lower bound, we consider the resource augmentation model of Gupta \\etal \\cite{GuptaKP10}. Using resource augmentation, we give a scalable algorithm. Our result also gives a scalable non-clairvoyant algorithm for minimizing weighted flow time plus energ...

  19. Hubble Systems Optimize Hospital Schedules

    Science.gov (United States)

    2009-01-01

    Don Rosenthal, a former Ames Research Center computer scientist who helped design the Hubble Space Telescope's scheduling software, co-founded Allocade Inc. of Menlo Park, California, in 2004. Allocade's OnCue software helps hospitals reclaim unused capacity and optimize constantly changing schedules for imaging procedures. After starting to use the software, one medical center soon reported noticeable improvements in efficiency, including a 12 percent increase in procedure volume, 35 percent reduction in staff overtime, and significant reductions in backlog and technician phone time. Allocade now offers versions for outpatient and inpatient magnetic resonance imaging (MRI), ultrasound, interventional radiology, nuclear medicine, Positron Emission Tomography (PET), radiography, radiography-fluoroscopy, and mammography.

  20. Endogenous scheduling preferences and congestion

    DEFF Research Database (Denmark)

    Fosgerau, Mogens; Small, Kenneth

    2010-01-01

    Dynamic models of congestion so far rely on exogenous scheduling preferences of travelers, based for example on disutility of deviation from a preferred departure or arrival time for a trip. This paper provides a more fundamental view in which travelers derive utility just from consumption...... and leisure, but agglomeration economies at home and at work lead to scheduling preferences forming endogenously. Using bottleneck congestion technology, we obtain an equilibrium queuing pattern consistent with a general version of the Vickrey bottleneck model. However, the policy implications are different...

  1. Throughput Optimal Scheduling with Feedback Cost Reduction

    CERN Document Server

    Karaca, Mehmet; Ercetin, Ozgur; Alpcan, Tansu; Boche, Holger

    2012-01-01

    It is well known that opportunistic scheduling algorithms are throughput optimal under full knowledge of channel and network conditions. However, these algorithms achieve a hypothetical achievable rate region which does not take into account the overhead associated with channel probing and feedback required to obtain the full channel state information at every slot. We adopt a channel probing model where $\\beta$ fraction of time slot is consumed for acquiring the channel state information (CSI) of a single channel. In this work, we design a joint scheduling and channel probing algorithm named SDF by considering the overhead of obtaining the channel state information. We analytically prove that when the number of users in the network is greater than 3, then SDF algorithm can achieve $1+\\epsilon$ of the full rate region achieved when all users are probed. We also demonstrate numerically in a realistic simulation setting that this rate region can be achieved by probing only less than 50% of all channels in a CDM...

  2. Embedded Face Detection and Recognition

    Directory of Open Access Journals (Sweden)

    Göksel Günlü

    2012-10-01

    Full Text Available The need to increase security in open or public spaces has in turn given rise to the requirement to monitor these spaces and analyse those images on‐site and on‐time. At this point, the use of smart cameras ‐ of which the popularity has been increasing ‐ is one step ahead. With sensors and Digital Signal Processors (DSPs, smart cameras generate ad hoc results by analysing the numeric images transmitted from the sensor by means of a variety of image‐processing algorithms. Since the images are not transmitted to a distance processing unit but rather are processed inside the camera, it does not necessitate high‐ bandwidth networks or high processor powered systems; it can instantaneously decide on the required access. Nonetheless, on account of restricted memory, processing power and overall power, image processing algorithms need to be developed and optimized for embedded processors. Among these algorithms, one of the most important is for face detection and recognition. A number of face detection and recognition methods have been proposed recently and many of these methods have been tested on general‐purpose processors. In smart cameras ‐ which are real‐life applications of such methods ‐ the widest use is on DSPs. In the present study, the Viola‐Jones face detection method ‐ which was reported to run faster on PCs ‐ was optimized for DSPs; the face recognition method was combined with the developed sub‐region and mask‐based DCT (Discrete Cosine Transform. As the employed DSP is a fixed‐point processor, the processes were performed with integers insofar as it was possible. To enable face recognition, the image was divided into sub‐ regions and from each sub‐region the robust coefficients against disruptive elements ‐ like face expression, illumination, etc. ‐ were selected as the features. The discrimination of the selected features was enhanced via LDA (Linear Discriminant Analysis and then employed for

  3. Embedded Face Detection and Recognition

    Directory of Open Access Journals (Sweden)

    Göksel Günlü

    2012-10-01

    Full Text Available The need to increase security in open or public spaces has in turn given rise to the requirement to monitor these spaces and analyse those images on-site and on-time. At this point, the use of smart cameras – of which the popularity has been increasing – is one step ahead. With sensors and Digital Signal Processors (DSPs, smart cameras generate ad hoc results by analysing the numeric images transmitted from the sensor by means of a variety of image-processing algorithms. Since the images are not transmitted to a distance processing unit but rather are processed inside the camera, it does not necessitate high-bandwidth networks or high processor powered systems; it can instantaneously decide on the required access. Nonetheless, on account of restricted memory, processing power and overall power, image processing algorithms need to be developed and optimized for embedded processors. Among these algorithms, one of the most important is for face detection and recognition. A number of face detection and recognition methods have been proposed recently and many of these methods have been tested on general-purpose processors. In smart cameras – which are real-life applications of such methods – the widest use is on DSPs. In the present study, the Viola-Jones face detection method – which was reported to run faster on PCs – was optimized for DSPs; the face recognition method was combined with the developed sub-region and mask-based DCT (Discrete Cosine Transform. As the employed DSP is a fixed-point processor, the processes were performed with integers insofar as it was possible. To enable face recognition, the image was divided into sub-regions and from each sub-region the robust coefficients against disruptive elements – like face expression, illumination, etc. – were selected as the features. The discrimination of the selected features was enhanced via LDA (Linear Discriminant Analysis and then employed for recognition. Thanks to its

  4. A QoS-Based Dynamic Queue Length Scheduling Algorithm in Multiantenna Heterogeneous Systems

    Directory of Open Access Journals (Sweden)

    Verikoukis Christos

    2010-01-01

    Full Text Available The use of real-time delay-sensitive applications in wireless systems has significantly grown during the last years. Therefore the designers of wireless systems have faced a challenging issue to guarantee the required Quality of Service (QoS. On the other hand, the recent advances and the extensive use of multiple antennas have already been included in several commercial standards, where the multibeam opportunistic transmission beamforming strategies have been proposed to improve the performance of the wireless systems. A cross-layer-based dynamically tuned queue length scheduler is presented in this paper, for the Downlink of multiuser and multiantenna WLAN systems with heterogeneous traffic requirements. To align with modern wireless systems transmission strategies, an opportunistic scheduling algorithm is employed, while a priority to the different traffic classes is applied. A tradeoff between the maximization of the throughput of the system and the guarantee of the maximum allowed delay is obtained. Therefore, the length of the queue is dynamically adjusted to select the appropriate conditions based on the operator requirements.

  5. Maintenance Scheduling of Traffic Light System in Case of Resource Unavailability

    Directory of Open Access Journals (Sweden)

    Nadya Belarfaoui

    2014-01-01

    Full Text Available Due to the increasing number of users of urban roads, congestion and insecurity are a major problem faced by cities, today. To this end, the reliability of road signs has become a crucial concept that combines security and traffic control. This article focuses on the problem of reordering the medium-term maintenance tasks of an automatic signaling system in the event of resource unavailability. The studied system is a remotely controlled centralized system, whose facilities are distributed across multiple sites. We are specifically interested in the case of the existence of a mobile maintenance entity which intervenes in replacements on multiple sites, according to a predetermined scheduling. However, this scheduling suffers from hazards related to resource unavailability. Our goal is to provide the signaling system with the appropriate tools to prevent these contingencies. For this, we propose a methodology based on the use of time Petri nets (TPN for modeling traffic light system studied, and the use of timed automata (TA for analysis and synthesis of results. Thus, we will be able to reschedule maintenance tasks in case of unavailability of resources

  6. Face-to-face or Face-to-screen? Undergraduates’ opinions and test performance in classroom versus online learning

    Directory of Open Access Journals (Sweden)

    Nenagh eKemp

    2014-11-01

    Full Text Available As electronic communication becomes increasingly common, and as students juggle study, work, and family life, many universities are offering their students more flexible learning opportunities. Classes once delivered face-to-face are often replaced by online activities and discussions. However, there is little research comparing students’ experience and learning in these two modalities. The aim of this study was to compare undergraduates’ preference for, and academic performance on, class material and assessment presented online versus in traditional classrooms. Psychology students (N = 71 at an Australian university completed written exercises, a class discussion, and a written test on two academic topics. The activities for one topic were conducted face-to-face, and the other online, with topics counterbalanced across two groups. The results showed that students preferred to complete activities face-to-face rather than online, but there was no significant difference in their test performance in the two modalities. In their written responses, students expressed a strong preference for class discussions to be conducted face-to-face, reporting that they felt more engaged, and received more immediate feedback, than in online discussion. A follow-up study with a separate group confirmed that although students appreciated the convenience of completing written activities online in their own time, they also strongly preferred to discuss course content with peers in the classroom rather than online. It is concluded that online and face-to-face activities can lead to similar levels of academic performance, but that students would rather do written activities online but engage in discussion in person. Course developers could aim to structure classes so that students can benefit from both the flexibility of online learning, and the greater engagement experienced in face-to-face discussion.

  7. Face Detection in Digital Image: A Technical Review

    Directory of Open Access Journals (Sweden)

    Devang C

    2015-01-01

    Full Text Available Face detection is the method of focusing faces in input image is an important part of any face processing system. In Face detection, segmentation plays the major role to detect the face. There are many contests for effective and efficient face detection. The aim of this paper is to present a review on several algorithms and methods used for face detection. We read the various surveys and related various techniques according to how they extract features and what learning algorithms are adopted for. Face detection system has two major phases, first to segment skin region from an image and second to decide these regions cover human face or not. There are number of algorithms used in face detection namely Genetic, Hausdorff Distance etc.

  8. Age Dependent Face Recognition using Eigenface

    Directory of Open Access Journals (Sweden)

    Hlaing Htake Khaung Tin

    2013-10-01

    Full Text Available Face recognition is the most successful form of human surveillance. Face recognition technology, is being used to improve human efficiency when recognition faces, is one of the fastest growing fields in the biometric industry. In the first stage, the age is classified into eleven categories which distinguish the person oldness in terms of age. In the second stage of the process is face recognition based on the predicted age. Age prediction has considerable potential applications in human computer interaction and multimedia communication. In this paper proposes an Eigen based age estimation algorithm for estimate an image from the database. Eigenface has proven to be a useful and robust cue for age prediction, age simulation, face recognition, localization and tracking. The scheme is based on an information theory approach that decomposes face images into a small set of characteristic feature images called eigenfaces, which may be thought of as the principal components of the initial training set of face images. The eigenface approach used in this scheme has advantages over other face recognition methods in its speed, simplicity, learning capability and robustness to small changes in the face image.

  9. Spatial Scheduling Optimization Algorithm for Block Assembly in Shipbuilding

    Directory of Open Access Journals (Sweden)

    Zhengyang Shang

    2017-01-01

    Full Text Available Block assembly consumes the majority of processing time and resources in shipbuilding, and the block spatial scheduling (BSS related to block assembly has been widely studied as the key to improve shipbuilding efficiency. BSS is a complicated NP-hard problem that aims to minimize the makespan. Since each block has specific building time and space constraints, the BSS problem can be hardly found with an acceptable solution by using constant scheduling rules. Thus, in this study, we considered the BSS problem as a time-constrained 3D bin packing mathematical model and proposed an allocation algorithm, best contact algorithm (BCA, that is more suitable for dynamic processes. Then, for global optimization of the BSS problem, we regarded the starting time of each block as a variable and used the genetic algorithm (GA to operate and optimize the block assembly sequence. Finally, we tested the BCA + GA scheduling system with real data from a shipyard and thereby determined the block scheduling status and the daily utilization rate of the work plate. Comparison shows that the proposed algorithm is able to get shorter makespan and better block scheduling effect; it realized the optimization of the block spatial scheduling dynamically.

  10. Scheduling Parallel Jobs Using Migration and Consolidation in the Cloud

    Directory of Open Access Journals (Sweden)

    Xiaocheng Liu

    2012-01-01

    Full Text Available An increasing number of high performance computing parallel applications leverages the power of the cloud for parallel processing. How to schedule the parallel applications to improve the quality of service is the key to the successful host of parallel applications in the cloud. The large scale of the cloud makes the parallel job scheduling more complicated as even simple parallel job scheduling problem is NP-complete. In this paper, we propose a parallel job scheduling algorithm named MEASY. MEASY adopts migration and consolidation to enhance the most popular EASY scheduling algorithm. Our extensive experiments on well-known workloads show that our algorithm takes very good care of the quality of service. For two common parallel job scheduling objectives, our algorithm produces an up to 41.1% and an average of 23.1% improvement on the average response time; an up to 82.9% and an average of 69.3% improvement on the average slowdown. Our algorithm is robust even in terms that it allows inaccurate CPU usage estimation and high migration cost. Our approach involves trivial modification on EASY and requires no additional technique; it is practical and effective in the cloud environment.

  11. Multi-criteria evaluation methods in the production scheduling

    Science.gov (United States)

    Kalinowski, K.; Krenczyk, D.; Paprocka, I.; Kempa, W.; Grabowik, C.

    2016-08-01

    The paper presents a discussion on the practical application of different methods of multi-criteria evaluation in the process of scheduling in manufacturing systems. Among the methods two main groups are specified: methods based on the distance function (using metacriterion) and methods that create a Pareto set of possible solutions. The basic criteria used for scheduling were also described. The overall procedure of evaluation process in production scheduling was presented. It takes into account the actions in the whole scheduling process and human decision maker (HDM) participation. The specified HDM decisions are related to creating and editing a set of evaluation criteria, selection of multi-criteria evaluation method, interaction in the searching process, using informal criteria and making final changes in the schedule for implementation. According to need, process scheduling may be completely or partially automated. Full automatization is possible in case of metacriterion based objective function and if Pareto set is selected - the final decision has to be done by HDM.

  12. Optimized Information Transmission Scheduling Strategy Oriented to Advanced Metering Infrastructure

    Directory of Open Access Journals (Sweden)

    Weiming Tong

    2013-01-01

    Full Text Available Advanced metering infrastructure (AMI is considered to be the first step in constructing smart grid. AMI allows customers to make real-time choices about power utilization and enables power utilities to increase the effectiveness of the regional power grids by managing demand load during peak times and reducing unneeded power generation. These initiatives rely heavily on the prompt information transmission inside AMI. Aiming at the information transmission problem, this paper researches the communication scheduling strategy in AMI at a macroscopic view. First, the information flow of AMI is analyzed, and the power users are classified into several grades by their importance. Then, the defect of conventional information transmission scheduling strategy is analyzed. On this basis, two optimized scheduling strategies are proposed. In the wide area, an optimized scheduling strategy based on user importance and time critical is proposed to guarantee the important power users’ information transmission being handled promptly. In the local area, an optimized scheduling strategy based on device and information importance and time critical is proposed to guarantee the important devices and information in AMI user end system being handled promptly. At last, the two optimized scheduling strategies are simulated. The simulation results show that they can effectively improve the real-time performance and reliability of AMI information transmission.

  13. Item Nonresponse in Face-to-Face Interviews with Children

    Directory of Open Access Journals (Sweden)

    Haunberger Sigrid

    2014-09-01

    Full Text Available This study examined item nonresponse and its respondent and interviewer correlates by means of a population-based, panel survey of children aged 8 to 11 who were surveyed using standardised, face-to-face interviews. Using multilevel, logistic analyses with cross-level interactions, this article aims to examine which effects of item nonresponse are subject to children as respondents or to the interviewers and the interview setting. Depending on the type of question, we found different effects for respondent and interviewer variables, as well as interaction effects between child age/interviewer age as well as child gender/interviewer gender. However, interviewer variance is for the most part not significant.

  14. The CHI 2013 interactive schedule

    DEFF Research Database (Denmark)

    Satyanarayan, Arvind; Strazzulla, Daniel; Klokmose, Clemens Nylandsted

    2013-01-01

    is available. The CHI'13 Interactive Schedule helps attendees navigate this wealth of video content in order to identify events they would like to attend. It consists of a number of large display screens throughout the conference venue which cycle through a video playlist of events. Attendees can interact...

  15. A scheduling model for astronomy

    Science.gov (United States)

    Solar, M.; Michelon, P.; Avarias, J.; Garces, M.

    2016-04-01

    Astronomical scheduling problem has several external conditions that change dynamically at any time during observations, like weather condition (humidity, temperature, wind speed, opacity, etc.), and target visibility conditions (target over the horizon, Sun/Moon blocking the target). Therefore, a dynamic re-scheduling is needed. An astronomical project will be scheduled as one or more Scheduling Blocks (SBs) as an atomic unit of astronomical observations. We propose a mixed integer linear programming (MILP) solution to select the best SBs, favors SBs with high scientific values, and thus maximizing the quantity of completed observation projects. The data content of Atacama Large Millimeter/Submillimeter Array (ALMA) projects of cycle 0 and cycle 1 were analyzed, and a synthetic set of tests of the real instances was created. Two configurations, one of 5000 SBs in a 3 months season and another 10,000 SBs a 6 months season were created. These instances were evaluated with excellent results. Through the testing it is showed that the MILP proposal has optimal solutions.

  16. Lifetime Improvement by Battery Scheduling

    NARCIS (Netherlands)

    Jongerden, M.R.; Schmitt, Jens B.; Haverkort, Boudewijn R.H.M.

    2012-01-01

    The use of mobile devices is often limited by the lifetime of their batteries. For devices that have multiple batteries or that have the option to connect an extra battery, battery scheduling, thereby exploiting the recovery properties of the batteries, can help to extend the system lifetime. Due to

  17. Lifetime improvement by battery scheduling

    NARCIS (Netherlands)

    Jongerden, M.R.; Haverkort, Boudewijn R.H.M.

    2011-01-01

    The use of mobile devices is often limited by the lifetime of its battery. For devices that have multiple batteries or that have the option to connect an extra battery, battery scheduling, thereby exploiting the recovery properties of the batteries, can help to extend the system lifetime. Due to the

  18. Lifetime Improvement by Battery Scheduling

    NARCIS (Netherlands)

    Jongerden, M.R.; Schmitt, Jens B.; Haverkort, Boudewijn R.H.M.

    The use of mobile devices is often limited by the lifetime of their batteries. For devices that have multiple batteries or that have the option to connect an extra battery, battery scheduling, thereby exploiting the recovery properties of the batteries, can help to extend the system lifetime. Due to

  19. Lifetime improvement by battery scheduling

    NARCIS (Netherlands)

    Jongerden, M.R.; Haverkort, Boudewijn R.H.M.

    The use of mobile devices is often limited by the lifetime of its battery. For devices that have multiple batteries or that have the option to connect an extra battery, battery scheduling, thereby exploiting the recovery properties of the batteries, can help to extend the system lifetime. Due to the

  20. CROP UNDER DEFICIT IRRIGATION SCHEDULING

    African Journals Online (AJOL)

    This study presents crop coefficient (Kc) values of TMV 1 -ST maize variety ... given time from planting to the time it is harvested. ... real time irrigation scheduling for high frequent and non-fiequent water .... 10 m, and the average soil bulk density was 1420 kg/m'. ...... Performance Evaluation of Fadama Irrigation Practice.

  1. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1996-02-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest National Laboratory (PNNL) for the US Department of Energy (DOE). This document contains the planned 1996 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP), Drinking Water Project, and Ground-Water Surveillance Project.

  2. Decentralized Real-Time Scheduling

    Science.gov (United States)

    1990-08-01

    917-932, August, 1987. [ Daniels 86] D. C. Daniels and H. F. Wedde. Real-Time Performance of a Completely Distributed Operating System. In Proceedings...imnmediate execuoon The schedule c.-eated by the SeltctPhaseProcfj procedure is an ordere-d lis t of mocl -phnise pairs, each placed according to the

  3. Cooperation in Networks and Scheduling

    NARCIS (Netherlands)

    van Velzen, S.

    2005-01-01

    This thesis deals with various models of cooperation in networks and scheduling. The main focus is how the benefits of this cooperation should be divided among the participating individuals. A major part of this analysis is concerned with stability of the cooperation. In addition, allocation rules a

  4. Modelling a Nurse Shift Schedule with Multiple Preference Ranks for Shifts and Days-Off

    Directory of Open Access Journals (Sweden)

    Chun-Cheng Lin

    2014-01-01

    Full Text Available When it comes to nurse shift schedules, it is found that the nursing staff have diverse preferences about shift rotations and days-off. The previous studies only focused on the most preferred work shift and the number of satisfactory days-off of the schedule at the current schedule period but had few discussions on the previous schedule periods and other preference levels for shifts and days-off, which may affect fairness of shift schedules. As a result, this paper proposes a nurse scheduling model based upon integer programming that takes into account constraints of the schedule, different preference ranks towards each shift, and the historical data of previous schedule periods to maximize the satisfaction of all the nursing staff's preferences about the shift schedule. The main contribution of the proposed model is that we consider that the nursing staff’s satisfaction level is affected by multiple preference ranks and their priority ordering to be scheduled, so that the quality of the generated shift schedule is more reasonable. Numerical results show that the planned shifts and days-off are fair and successfully meet the preferences of all the nursing staff.

  5. Face Search at Scale.

    Science.gov (United States)

    Wang, Dayong; Otto, Charles; Jain, Anil K

    2016-06-20

    rsons of interest among the billions of shared photos on these websites. Despite significant progress in face recognition, searching a large collection of unconstrained face images remains a difficult problem. To address this challenge, we propose a face search system which combines a fast search procedure, coupled with a state-of-the-art commercial off the shelf (COTS) matcher, in a cascaded framework. Given a probe face, we first filter the large gallery of photos to find the top-k most similar faces using features learned by a convolutional neural network. The k retrieved candidates are re-ranked by combining similarities based on deep features and those output by the COTS matcher. We evaluate the proposed face search system on a gallery containing 80 million web-downloaded face images. Experimental results demonstrate that while the deep features perform worse than the COTS matcher on a mugshot dataset (93.7% vs. 98.6% TAR@FAR of 0.01%), fusing the deep features with the COTS matcher improves the overall performance (99.5% TAR@FAR of 0.01%). This shows that the learned deep features provide complementary information over representations used in state-of-the-art face matchers. On the unconstrained face image benchmarks, the performance of the learned deep features is competitive with reported accuracies. LFW database: 98.20% accuracy under the standard protocol and 88.03% TAR@FAR of 0.1% under the BLUFR protocol; IJB-A benchmark: 51.0% TAR@FAR of 0.1% (verification), rank 1 retrieval of 82.2% (closed-set search), 61.5% FNIR@FAR of 1% (open-set search). The proposed face search system offers an excellent trade-off between accuracy and scalability on galleries with millions of images. Additionally, in a face search experiment involving photos of the Tsarnaev brothers, convicted of the Boston Marathon bombing, the proposed cascade face search system could find the younger brother's (Dzhokhar Tsarnaev) photo at rank 1 in 1 second on a 5M gallery and at rank 8 in 7

  6. Contextual modulation of biases in face recognition.

    Directory of Open Access Journals (Sweden)

    Fatima Maria Felisberti

    Full Text Available BACKGROUND: The ability to recognize the faces of potential cooperators and cheaters is fundamental to social exchanges, given that cooperation for mutual benefit is expected. Studies addressing biases in face recognition have so far proved inconclusive, with reports of biases towards faces of cheaters, biases towards faces of cooperators, or no biases at all. This study attempts to uncover possible causes underlying such discrepancies. METHODOLOGY AND FINDINGS: Four experiments were designed to investigate biases in face recognition during social exchanges when behavioral descriptors (prosocial, antisocial or neutral embedded in different scenarios were tagged to faces during memorization. Face recognition, measured as accuracy and response latency, was tested with modified yes-no, forced-choice and recall tasks (N = 174. An enhanced recognition of faces tagged with prosocial descriptors was observed when the encoding scenario involved financial transactions and the rules of the social contract were not explicit (experiments 1 and 2. Such bias was eliminated or attenuated by making participants explicitly aware of "cooperative", "cheating" and "neutral/indifferent" behaviors via a pre-test questionnaire and then adding such tags to behavioral descriptors (experiment 3. Further, in a social judgment scenario with descriptors of salient moral behaviors, recognition of antisocial and prosocial faces was similar, but significantly better than neutral faces (experiment 4. CONCLUSION: The results highlight the relevance of descriptors and scenarios of social exchange in face recognition, when the frequency of prosocial and antisocial individuals in a group is similar. Recognition biases towards prosocial faces emerged when descriptors did not state the rules of a social contract or the moral status of a behavior, and they point to the existence of broad and flexible cognitive abilities finely tuned to minor changes in social context.

  7. The Effects of Non-traditional Teaching Styles on College Mathematics between Face-to-face and Online Students

    Directory of Open Access Journals (Sweden)

    Peter KIRIAKIDIS

    2011-12-01

    Full Text Available Limited research exists on the effects of teaching styles on college mathematics between face-to-face and online students. The purpose of this experimental quantitative research was to examine the effects of teaching styles on college mathematics between face-to-face and online students. The research question was “What are the effects of teaching styles on college mathematics between face-to-face and online students?” The participants were college students who took math classes either face-to-face or online. The participants were taught by the same professors the same math curricula. The findings of this research may shed further light on the effects of teaching styles on college mathematics between face-to-face and online students.

  8. Project management with dynamic scheduling baseline scheduling, risk analysis and project control

    CERN Document Server

    Vanhoucke, Mario

    2013-01-01

    The topic of this book is known as dynamic scheduling, and is used to refer to three dimensions of project management and scheduling: the construction of a baseline schedule and the analysis of a project schedule's risk as preparation of the project control phase during project progress. This dynamic scheduling point of view implicitly assumes that the usability of a project's baseline schedule is rather limited and only acts as a point of reference in the project life cycle.

  9. BEE COLONIES APPLIED TO MULTIPROCESSOR SCHEDULING

    OpenAIRE

    Butt, Nouman

    2009-01-01

    In order to achieve the high performance, we need to have an efficient scheduling of a parallelprogram onto the processors in multiprocessor systems that minimizes the entire executiontime. This problem of multiprocessor scheduling can be stated as finding a schedule for ageneral task graph to be executed on a multiprocessor system so that the schedule length can be minimize [10]. This scheduling problem is known to be NP- Hard.In multi processor task scheduling, we have a number of CPU’s on ...

  10. Visitor schedule management system- an intelligent decision support system

    CERN Document Server

    Nidhra, Srinivas; Ethiraj, Vinay Sudha

    2012-01-01

    Travelling salesman problem is a problem which is of high interest for researchers, industry professionals, and academicians. Visitor or salesman used to face lot of problems with respect to scheduling based on meeting top ranked clients. Even excel sheet made the work tedious. So these flaws propelled us to design an intelligent decision support system. This paper reports the problem definition we tried to address and possible solution to this problem. We even explained the project design and implementation of our visitor schedule management system.. Our system made a major contribution in terms of valuable resources such as time and satisfying high ranked clients efficiently. We used optimization via mathematical programming to solve these issues.

  11. Heuristic algorithm for single resource constrained project scheduling problem based on the dynamic programming

    Directory of Open Access Journals (Sweden)

    Stanimirović Ivan

    2009-01-01

    Full Text Available We introduce a heuristic method for the single resource constrained project scheduling problem, based on the dynamic programming solution of the knapsack problem. This method schedules projects with one type of resources, in the non-preemptive case: once started an activity is not interrupted and runs to completion. We compare the implementation of this method with well-known heuristic scheduling method, called Minimum Slack First (known also as Gray-Kidd algorithm, as well as with Microsoft Project.

  12. An Adaptive Algorithm for Dynamic Priority Based Virtual Machine Scheduling in Cloud

    Directory of Open Access Journals (Sweden)

    Subramanian S

    2012-11-01

    Full Text Available Cloud computing, a relatively new technology, has been gaining immense popularity over the last few years. The number of cloud users has been growing exponentially and apparently scheduling of virtual machines in the cloud becomes an important issue to analyze. This paper throws light on the various scheduling algorithms present for scheduling virtual machines and also proposes a new algorithm that combines the advantages of all the existing algorithms and overcomes their disadvantages.

  13. In your face: Transcendence in embodied interaction

    Directory of Open Access Journals (Sweden)

    Shaun eGallagher

    2014-07-01

    Full Text Available In cognitive psychology, studies concerning the face tend to focus on questions about face recognition, theory of mind and empathy. Questions about the face, however, also fit into a very different set of issues that are central to ethics. Based especially on the work of Levinas, philosophers have come to see that reference to the face of another person can anchor conceptions of moral responsibility and ethical demand. Levinas points to a certain irreducibility and transcendence implicit in the face of the other. In this paper I argue that the notion of transcendence involved in this kind of analysis can be given a naturalistic interpretation by drawing on recent interactive approaches to social cognition found in developmental psychology, phenomenology, and the study of autism.

  14. Congenital asymmetric crying face: a case report

    Directory of Open Access Journals (Sweden)

    Semra Kara

    2011-12-01

    Full Text Available Congenital asymmetric crying face is an anomalia caused by unilateral absence or weakness of depressor anguli oris muscle The major finding of the disease is the absence or weakness in the outer and lower movement of the commissure during crying. The other expression muscles are normal and the face is symmetric at rest. The asymmetry in congenital asymmetric crying face is most evident during infancy but decreases by age. Congenital asymmetric crying face can be associated with cervicofacial, musclebone, respiratory, genitourinary and central nervous system anomalia. It is diagnosed by physical examination. This paper presents a six days old infant with Congenital asymmetric crying face and discusses the case in terms of diagnosis and disease features.

  15. Discriminant Phase Component for Face Recognition

    Directory of Open Access Journals (Sweden)

    Naser Zaeri

    2012-01-01

    Full Text Available Numerous face recognition techniques have been developed owing to the growing number of real-world applications. Most of current algorithms for face recognition involve considerable amount of computations and hence they cannot be used on devices constrained with limited speed and memory. In this paper, we propose a novel solution for efficient face recognition problem for systems that utilize small memory capacities and demand fast performance. The new technique divides the face images into components and finds the discriminant phases of the Fourier transform of these components automatically using the sequential floating forward search method. A thorough study and comprehensive experiments relating time consumption versus system performance are applied to benchmark face image databases. Finally, the proposed technique is compared with other known methods and evaluated through the recognition rate and the computational time, where we achieve a recognition rate of 98.5% with computational time of 6.4 minutes for a database consisting of 2360 images.

  16. Is Face Distinctiveness Gender Based?

    Science.gov (United States)

    Baudouin, Jean-Yves; Gallay, Mathieu

    2006-01-01

    Two experiments were carried out to study the role of gender category in evaluations of face distinctiveness. In Experiment 1, participants had to evaluate the distinctiveness and the femininity-masculinity of real or artificial composite faces. The composite faces were created by blending either faces of the same gender (sexed composite faces,…

  17. How should periods without social interaction be scheduled? Children's preference for practical schedules of positive reinforcement.

    Science.gov (United States)

    Luczynski, Kevin C; Hanley, Gregory P

    2014-01-01

    Several studies have shown that children prefer contingent reinforcement (CR) rather than yoked noncontingent reinforcement (NCR) when continuous reinforcement is programmed in the CR schedule. Preference has not, however, been evaluated for practical schedules that involve CR. In Study 1, we assessed 5 children's preference for obtaining social interaction via a multiple schedule (periods of fixed-ratio 1 reinforcement alternating with periods of extinction), a briefly signaled delayed reinforcement schedule, and an NCR schedule. The multiple schedule promoted the most efficient level of responding. In general, children chose to experience the multiple schedule and avoided the delay and NCR schedules, indicating that they preferred multiple schedules as the means to arrange practical schedules of social interaction. In Study 2, we evaluated potential controlling variables that influenced 1 child's preference for the multiple schedule and found that the strong positive contingency was the primary variable.

  18. Face Detection and Face Recognition in Android Mobile Applications

    Directory of Open Access Journals (Sweden)

    Octavian DOSPINESCU

    2016-01-01

    Full Text Available The quality of the smartphone’s camera enables us to capture high quality pictures at a high resolution, so we can perform different types of recognition on these images. Face detection is one of these types of recognition that is very common in our society. We use it every day on Facebook to tag friends in our pictures. It is also used in video games alongside Kinect concept, or in security to allow the access to private places only to authorized persons. These are just some examples of using facial recognition, because in modern society, detection and facial recognition tend to surround us everywhere. The aim of this article is to create an appli-cation for smartphones that can recognize human faces. The main goal of this application is to grant access to certain areas or rooms only to certain authorized persons. For example, we can speak here of hospitals or educational institutions where there are rooms where only certain employees can enter. Of course, this type of application can cover a wide range of uses, such as helping people suffering from Alzheimer's to recognize the people they loved, to fill gaps persons who can’t remember the names of their relatives or for example to automatically capture the face of our own children when they smile.

  19. Immunization Schedules for Infants and Children

    Science.gov (United States)

    ... Everyone: Easy-to-read Schedules Infants and Children Preteens and Teens Adults Display Immunization Schedules and Quiz ... file Microsoft Word file Microsoft Excel file Audio/Video file Apple Quicktime file RealPlayer file Text file ...

  20. DME Prosthetics Orthotics, and Supplies Fee Schedule

    Data.gov (United States)

    U.S. Department of Health & Human Services — Durable Medical Equipment, Prosthetics-Orthotics, and Supplies Fee Schedule. The list contains the fee schedule amounts, floors, and ceilings for all procedure codes...

  1. GSA eLibrary Schedules and Contracts

    Data.gov (United States)

    General Services Administration — GSA eLibrary (formerly Schedules e-Library) is the online source for the latest contract award information for: GSA Schedules; Department of Veterans Affairs (VA)...

  2. CMS Planning and Scheduling System

    CERN Document Server

    Kotamaki, M

    1998-01-01

    The paper describes the procedures and the system to build and maintain the schedules needed to manage time, resources, and progress of the CMS project. The system is based on the decomposition of the project into work packages, which can be each considered as a complete project with its own structure. The system promotes the distribution of the decision making and responsibilities to lower levels in the organisation by providing a state-of-the-art system to formalise the external commitments of the work packages without limiting their ability to modify their internal schedules to best meet their commitments. The system lets the project management focus on the interfaces between the work packages and alerts the management immediately if a conflict arises. The proposed system simplifies the planning and management process and eliminates the need for a large, centralised project management system.

  3. LDRD Report: Scheduling Irregular Algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Boman, Erik G. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2014-10-01

    This LDRD project was a campus exec fellowship to fund (in part) Donald Nguyen’s PhD research at UT-Austin. His work has focused on parallel programming models, and scheduling irregular algorithms on shared-memory systems using the Galois framework. Galois provides a simple but powerful way for users and applications to automatically obtain good parallel performance using certain supported data containers. The naïve user can write serial code, while advanced users can optimize performance by advanced features, such as specifying the scheduling policy. Galois was used to parallelize two sparse matrix reordering schemes: RCM and Sloan. Such reordering is important in high-performance computing to obtain better data locality and thus reduce run times.

  4. Building Better Nurse Scheduling Algorithms

    CERN Document Server

    Aickelin, Uwe

    2008-01-01

    The aim of this research is twofold: Firstly, to model and solve a complex nurse scheduling problem with an integer programming formulation and evolutionary algorithms. Secondly, to detail a novel statistical method of comparing and hence building better scheduling algorithms by identifying successful algorithm modifications. The comparison method captures the results of algorithms in a single figure that can then be compared using traditional statistical techniques. Thus, the proposed method of comparing algorithms is an objective procedure designed to assist in the process of improving an algorithm. This is achieved even when some results are non-numeric or missing due to infeasibility. The final algorithm outperforms all previous evolutionary algorithms, which relied on human expertise for modification.

  5. How fast is famous face recognition?

    Directory of Open Access Journals (Sweden)

    Gladys eBarragan-Jason

    2012-10-01

    Full Text Available The rapid recognition of familiar faces is crucial for social interactions. However the actual speed with which recognition can be achieved remains largely unknown as most studies have been carried out without any speed constraints. Different paradigms have been used, leading to conflicting results, and although many authors suggest that face recognition is fast, the speed of face recognition has not been directly compared to fast visual tasks. In this study, we sought to overcome these limitations. Subjects performed three tasks, a familiarity categorization task (famous faces among unknown faces, a superordinate categorization task (human faces among animal ones and a gender categorization task. All tasks were performed under speed constraints. The results show that, despite the use of speed constraints, subjects were slow when they had to categorize famous faces: minimum reaction time was 467 ms, which is 180 ms more than during superordinate categorization and 160 ms more than in the gender condition. Our results are compatible with a hierarchy of face processing from the superordinate level to the familiarity level. The processes taking place between detection and recognition need to be investigated in detail.

  6. Component-Based Cartoon Face Generation

    Directory of Open Access Journals (Sweden)

    Saman Sepehri Nejad

    2016-11-01

    Full Text Available In this paper, we present a cartoon face generation method that stands on a component-based facial feature extraction approach. Given a frontal face image as an input, our proposed system has the following stages. First, face features are extracted using an extended Active Shape Model. Outlines of the components are locally modified using edge detection, template matching and Hermit interpolation. This modification enhances the diversity of output and accuracy of the component matching required for cartoon generation. Second, to bring cartoon-specific features such as shadows, highlights and, especially, stylish drawing, an array of various face photographs and corresponding hand-drawn cartoon faces are collected. These cartoon templates are automatically decomposed into cartoon components using our proposed method for parameterizing cartoon samples, which is fast and simple. Then, using shape matching methods, the appropriate cartoon component is selected and deformed to fit the input face. Finally, a cartoon face is rendered in a vector format using the rendering rules of the selected template. Experimental results demonstrate effectiveness of our approach in generating life-like cartoon faces.

  7. Effects of unconscious processing on implicit memory for fearful faces.

    Directory of Open Access Journals (Sweden)

    Jiongjiong Yang

    Full Text Available Emotional stimuli can be processed even when participants perceive them without conscious awareness, but the extent to which unconsciously processed emotional stimuli influence implicit memory after short and long delays is not fully understood. We addressed this issue by measuring a subliminal affective priming effect in Experiment 1 and a long-term priming effect in Experiment 2. In Experiment 1, a flashed fearful or neutral face masked by a scrambled face was presented three times, then a target face (either fearful or neutral was presented and participants were asked to make a fearful/neutral judgment. We found that, relative to a neutral prime face (neutral-fear face, a fearful prime face speeded up participants' reaction to a fearful target (fear-fear face, when they were not aware of the masked prime face. But this response pattern did not apply to the neutral target. In Experiment 2, participants were first presented with a masked faces six times during encoding. Three minutes later, they were asked to make a fearful/neutral judgment for the same face with congruent expression, the same face with incongruent expression or a new face. Participants showed a significant priming effect for the fearful faces but not for the neutral faces, regardless of their awareness of the masked faces during encoding. These results provided evidence that unconsciously processed stimuli could enhance emotional memory after both short and long delays. It indicates that emotion can enhance memory processing whether the stimuli are encoded consciously or unconsciously.

  8. 2D Methods for pose invariant face recognition

    CSIR Research Space (South Africa)

    Mokoena, Ntabiseng

    2016-12-01

    Full Text Available The ability to recognise face images under random pose is a task that is done effortlessly by human beings. However, for a computer system, recognising face images under varying poses still remains an open research area. Face recognition across pose...

  9. HOW GOOD IS A DENSE SHOP SCHEDULE?

    Institute of Scientific and Technical Information of China (English)

    陈礴; 俞文(鱼此)

    2001-01-01

    In this paper, we study a class of simple and easy-to-construct shop schedules, known as dense schedules. We present tight bounds on the maximum deviation in makespan of dense flow-shop and job-shop schedules from their optimal ones. For dense open-shop schedules, we do the same for the special case of four machines and thus add a stronger supporting case for proving a standing conjecture.

  10. Scheduling Coast Guard District Cutters

    Science.gov (United States)

    1992-09-01

    DESCRIPTION ..... ............ .. 14 D. COSTS, PENALTIES, AND MEASURES OF EFFECTIVENESS 15 iv IV . COMPUTATIONAL EXPERIENCE ............ 19 A. TEST PROBLEMS...used. Using the model of Chapter III, computational performance for a year’s worth of actual data from the First District is presented in Chapter IV ...2G, B-2NY, B-2SAR, C); t - week the cutter assumes the patrol status. COSTO - cost of scheduling cutter i to patrol k; (1 if ship i is available for

  11. Environmental surveillance master sampling schedule

    Energy Technology Data Exchange (ETDEWEB)

    Bisping, L.E.

    1995-02-01

    Environmental surveillance of the Hanford Site and surrounding areas is conducted by the Pacific Northwest Laboratory (PNL) for the U.S. Department of Energy (DOE). This document contains the planned 1994 schedules for routine collection of samples for the Surface Environmental Surveillance Project (SESP), Drinking Water Project, and Ground-Water Surveillance Project. Samples are routinely collected for the SESP and analyzed to determine the quality of air, surface water, soil, sediment, wildlife, vegetation, foodstuffs, and farm products at Hanford Site and surrounding communities. The responsibility for monitoring onsite drinking water falls outside the scope of the SESP. PNL conducts the drinking water monitoring project concurrent with the SESP to promote efficiency and consistency, utilize expertise developed over the years, and reduce costs associated with management, procedure development, data management, quality control, and reporting. The ground-water sampling schedule identifies ground-water sampling .events used by PNL for environmental surveillance of the Hanford Site. Sampling is indicated as annual, semi-annual, quarterly, or monthly in the sampling schedule. Some samples are collected and analyzed as part of ground-water monitoring and characterization programs at Hanford (e.g. Resources Conservation and Recovery Act (RCRA), Comprehensive Environmental Response, Compensation, and Liability Act (CERCLA), or Operational). The number of samples planned by other programs are identified in the sampling schedule by a number in the analysis column and a project designation in the Cosample column. Well sampling events may be merged to avoid redundancy in cases where sampling is planned by both-environmental surveillance and another program.

  12. Guidelines of Decommissioning Schedule Establishment

    Energy Technology Data Exchange (ETDEWEB)

    Oh, Jae Yong; Yun, Taesik; Kim, Younggook; Kim, Hee-Geun [KHNP CRI, Daejeon (Korea, Republic of)

    2016-10-15

    Decommissioning has recently become an issue highlighted in Korea due to the Permanent Shutdown (PS) of Kori-1 plant. Since Korea Hydro and Nuclear Power (KHNP) Company decided the PS of Kori-1 instead of further continued operation, Kori-1 will be the first decommissioning plant of the commercial reactors in Korea. Korean regulatory authority demands Initial Decommissioning Plan (IDP) for all the plants in operation and under construction. In addition, decommissioning should be considered for the completion of the life cycle of NPPs. To date, Korea has no experience regarding decommissioning of the commercial reactor and a lot of uncertainties will be expected due to its site-specific factors. However, optimized decommissioning process schedule must be indispensable in the safety and economic efficiency of the project. Differed from USA, Korea has no experience and know-hows of the operation and site management for decommissioning. Hence, in Korea, establishment of decommissioning schedule has to give more weight to safety than precedent cases. More economical and rational schedule will be composed by collecting and analyzing the experience data and site-specific data and information as the decommissioning progresses. In a long-range outlook, KHNP having capability of NPP decommissioning will try to decommissioning business in Korea and foreign countries.

  13. Teaching Time Investment: Does Online Really Take More Time than Face-to-Face?

    Directory of Open Access Journals (Sweden)

    Rebecca Van de Vord

    2012-06-01

    Full Text Available Enrollments in online programs are growing, increasing demand for online courses. The perception that teaching online takes more time than teaching face-to-face creates concerns related to faculty workload. To date, the research on teaching time does not provide a clear answer as to the accuracy of this perception. This study was designed to investigate which aspects, if any, are more time consuming for instructors teaching in the online environment. Time logs were kept by four online instructors (eight classes and six on-campus instructors (six classes through six weeks of the 15-week semester. Results indicated that, overall, face-to-face teaching required more time per student, but certain aspects of online teaching take considerably more time per student than in the face-to-face classroom.

  14. The university student experience of face-to-face and online discussions: coherence, reflection and meaning

    Directory of Open Access Journals (Sweden)

    Robert A. Ellis

    2007-12-01

    Full Text Available This paper reports on an investigation into learning through discussions by undergraduate social work students. Second-year students studying psychology for social work experienced discussions began with face-to-face tutorials, and then continued for some time after online. This study used closed-ended questionnaires to investigate what students thought they were learning through discussions (their concepts, and how they engaged in the discussions face-to-face and online (their approaches. Significant associations were found among students' concepts of discussions, approaches and levels of achievement. The results suggest that students who do not understand how discussions can help them to interrogate, reflect on and revise their ideas tended not to approach either face-to-face or online discussions in ways likely to improve their understanding or their levels of achievement. This type of insight is critical for teacher/designers wishing to create university experiences in which discussion is used to promote learning.

  15. Faces in the dark: Interactive effects of darkness and anxiety on the memory for threatening faces.

    Directory of Open Access Journals (Sweden)

    Satoshi F Nakashima

    2014-10-01

    Full Text Available In the current research, we extend past work on the effects of ambient darkness and threat to the domain of memory for expressive faces. In one study, we examined the effects of ambient darkness and individual differences in state anxiety on memory of unfamiliar expressive faces. Here, participants were seated in either a dark or light room and encoded a set of unfamiliar faces with angry, happy, and neutral facial expressions. A subsequent recognition task revealed an interactive effect of ambient darkness, anxiety, and target expression. Highly anxious participants in ambient darkness had worse memory for angry faces than did low-anxiety participants. On the other hand, the recognition performance for happy faces was affected neither by the darkness nor state anxiety. The results suggest not only that ambient darkness has its strongest effect on anxious perceivers, but also that person x situation effects should be considered in face recognition research.

  16. An exploration into pedagogic frailty: Transitioning from face-to-face to online

    Directory of Open Access Journals (Sweden)

    Irina Niculescu

    2017-09-01

    Full Text Available Pedagogic frailty and concept mapping can simultaneously encourage personal and organisational change by supporting critical reflection and resilience. These ideas are nascent within higher education institutions and currently, at the University of Surrey, are only developed through face-to-face sessions. This revealed the need for a scalable intervention which engages academics with the discourse on introspective and professional development practices. In response, we have created the design for a blended programme of online foundation for concept mapping leading to face-to-face workshops to explore the pedagogic frailty model. This paper will discuss some significant challenges arising from transitioning self-reflective practices from face-to-face to online spaces. In the process, we will consider ways in which learning design can take the learner context into account.

  17. Knowledge retention in capstone experiences: An analysis of online and face-to-face courses

    Directory of Open Access Journals (Sweden)

    John P. Girard

    2016-12-01

    Full Text Available This research chronicles the development of a capstone experience by a regional comprehensive university. The process began with a multi-year project during which the faculty annually reviewed the results with a view to determining if the class provided the deep learning culminating experiences anticipated. A major measure of success was the desire to replicate the deep learning common in face-to-face classes in the online environment. The results of 166 students were analyzed, 82 online and 84 face-to-face, to determine if a difference existed. A one-way ANOVA tested the score differences among 10 sections and determined the students’ scores did not differ significantly. Finally, a two-sample t-test between proportions determined that there was not a significant difference between the online and face-to-face students with respect to the level of assessment scores earned. Given that online and face-to-face students demonstrate the same level of knowledge, does this beg the question, what value does face-to-face class time offer?

  18. Effectiveness of link prediction for face-to-face behavioral networks.

    Directory of Open Access Journals (Sweden)

    Sho Tsugawa

    Full Text Available Research on link prediction for social networks has been actively pursued. In link prediction for a given social network obtained from time-windowed observation, new link formation in the network is predicted from the topology of the obtained network. In contrast, recent advances in sensing technology have made it possible to obtain face-to-face behavioral networks, which are social networks representing face-to-face interactions among people. However, the effectiveness of link prediction techniques for face-to-face behavioral networks has not yet been explored in depth. To clarify this point, here we investigate the accuracy of conventional link prediction techniques for networks obtained from the history of face-to-face interactions among participants at an academic conference. Our findings were (1 that conventional link prediction techniques predict new link formation with a precision of 0.30-0.45 and a recall of 0.10-0.20, (2 that prolonged observation of social networks often degrades the prediction accuracy, (3 that the proposed decaying weight method leads to higher prediction accuracy than can be achieved by observing all records of communication and simply using them unmodified, and (4 that the prediction accuracy for face-to-face behavioral networks is relatively high compared to that for non-social networks, but not as high as for other types of social networks.

  19. Face Tracking in the Compressed Domain

    Directory of Open Access Journals (Sweden)

    Fonseca Pedro Miguel

    2006-01-01

    Full Text Available A compressed domain generic object tracking algorithm offers, in combination with a face detection algorithm, a low-compu-tational-cost solution to the problem of detecting and locating faces in frames of compressed video sequences (such as MPEG-1 or MPEG-2. Objects such as faces can thus be tracked through a compressed video stream using motion information provided by existing forward and backward motion vectors. The described solution requires only low computational resources on CE devices and offers at one and the same time sufficiently good location rates.

  20. Fusing Facial Features for Face Recognition

    Directory of Open Access Journals (Sweden)

    Jamal Ahmad Dargham

    2012-06-01

    Full Text Available Face recognition is an important biometric method because of its potential applications in many fields, such as access control, surveillance, and human-computer interaction. In this paper, a face recognition system that fuses the outputs of three face recognition systems based on Gabor jets is presented. The first system uses the magnitude, the second uses the phase, and the third uses the phase-weighted magnitude of the jets. The jets are generated from facial landmarks selected using three selection methods. It was found out that fusing the facial features gives better recognition rate than either facial feature used individually regardless of the landmark selection method.

  1. 19 CFR 122.63 - Scheduled airlines.

    Science.gov (United States)

    2010-04-01

    ... 19 Customs Duties 1 2010-04-01 2010-04-01 false Scheduled airlines. 122.63 Section 122.63 Customs... AIR COMMERCE REGULATIONS Clearance of Aircraft and Permission To Depart § 122.63 Scheduled airlines... scheduled airlines covered by this subpart. (a) Clearance at other than airport of final departure. Aircraft...

  2. Response Strength in Extreme Multiple Schedules

    Science.gov (United States)

    McLean, Anthony P.; Grace, Randolph C.; Nevin, John A.

    2012-01-01

    Four pigeons were trained in a series of two-component multiple schedules. Reinforcers were scheduled with random-interval schedules. The ratio of arranged reinforcer rates in the two components was varied over 4 log units, a much wider range than previously studied. When performance appeared stable, prefeeding tests were conducted to assess…

  3. Models and algorithms for stochastic online scheduling

    NARCIS (Netherlands)

    Megow, N.; Uetz, Marc Jochen; Vredeveld, T.

    We consider a model for scheduling under uncertainty. In this model, we combine the main characteristics of online and stochastic scheduling in a simple and natural way. Job processing times are assumed to be stochastic, but in contrast to traditional stochastic scheduling models, we assume that

  4. 77 FR 41258 - FOIA Fee Schedule Update

    Science.gov (United States)

    2012-07-13

    ... SAFETY BOARD 10 CFR Part 1703 FOIA Fee Schedule Update AGENCY: Defense Nuclear Facilities Safety Board... publishing its Freedom of Information Act (FOIA) Fee Schedule Update pursuant to the Board's regulations..., the Board's General Manager will update the FOIA Fee Schedule once every 12 months. The previous...

  5. Optimization of Daily Flight Training Schedules

    Science.gov (United States)

    2014-03-01

    training syllabus . 14. SUBJECT TERMS Scheduling, optimization, flight training, Advance Strike Training, pilot 15. NUMBER OF...SKEDSOs that can help them increase throughput of students in the advanced strike training syllabus . vi THIS PAGE INTENTIONALLY LEFT BLANK vii...instructor pilots with student naval aviators to achieve syllabus events. The schedule is built manually each day by squadron scheduling officers (SKEDSOs

  6. Centralized scheduling an unanticipated revenue cycle opportunity.

    Science.gov (United States)

    O'Neill, Daniel P; Kenniff, Peter B

    2007-09-01

    Centralized outpatient scheduling can provide acute care hospitals with accessibility and service levels equal to freestanding facilities, enabling hospitals to recapture lost market share. Two implementation strategies are critical to the success of centralized scheduling: Correctly developing the schedule. Managing the incoming call volume.

  7. An improved scheduling algorithm for linear networks

    KAUST Repository

    Bader, Ahmed

    2017-02-09

    In accordance with the present disclosure, embodiments of an exemplary scheduling controller module or device implement an improved scheduling process such that the targeted reduction in schedule length can be achieve while incurring minimal energy penalty by allowing for a large rate (or duration) selection alphabet.

  8. Response Strength in Extreme Multiple Schedules

    Science.gov (United States)

    McLean, Anthony P.; Grace, Randolph C.; Nevin, John A.

    2012-01-01

    Four pigeons were trained in a series of two-component multiple schedules. Reinforcers were scheduled with random-interval schedules. The ratio of arranged reinforcer rates in the two components was varied over 4 log units, a much wider range than previously studied. When performance appeared stable, prefeeding tests were conducted to assess…

  9. Interval algebra: an effective means of scheduling surveillance radar networks

    CSIR Research Space (South Africa)

    Focke, RW

    2015-05-01

    Full Text Available Interval Algebra provides an effective means to schedule surveillance radar networks, as it is a temporal ordering constraint language. Thus it provides a solution to a part of resource management, which is included in the revised Data Fusion...

  10. Comparison Performance of Genetic Algorithm and Ant Colony Optimization in Course Scheduling Optimizing

    Directory of Open Access Journals (Sweden)

    Imam Ahmad Ashari

    2016-11-01

    Full Text Available Scheduling problems at the university is a complex type of scheduling problems. The scheduling process should be carried out at every turn of the semester's. The core of the problem of scheduling courses at the university is that the number of components that need to be considered in making the schedule, some of the components was made up of students, lecturers, time and a room with due regard to the limits and certain conditions so that no collision in the schedule such as mashed room, mashed lecturer and others. To resolve a scheduling problem most appropriate technique used is the technique of optimization. Optimization techniques can give the best results desired. Metaheuristic algorithm is an algorithm that has a lot of ways to solve the problems to the very limit the optimal solution. In this paper, we use a genetic algorithm and ant colony optimization algorithm is an algorithm metaheuristic to solve the problem of course scheduling. The two algorithm will be tested and compared to get performance is the best. The algorithm was tested using data schedule courses of the university in Semarang. From the experimental results we conclude that the genetic algorithm has better performance than the ant colony optimization  algorithm in solving the case of course scheduling.

  11. Comparison Performance of Genetic Algorithm and Ant Colony Optimization in Course Scheduling Optimizing

    Directory of Open Access Journals (Sweden)

    Imam Ahmad Ashari

    2016-11-01

    Full Text Available Scheduling problems at the university is a complex type of scheduling problems. The scheduling process should be carried out at every turn of the semester's. The core of the problem of scheduling courses at the university is that the number of components that need to be considered in making the schedule, some of the components was made up of students, lecturers, time and a room with due regard to the limits and certain conditions so that no collision in the schedule such as mashed room, mashed lecturer and others. To resolve a scheduling problem most appropriate technique used is the technique of optimization. Optimization techniques can give the best results desired. Metaheuristic algorithm is an algorithm that has a lot of ways to solve the problems to the very limit the optimal solution. In this paper, we use a genetic algorithm and ant colony optimization algorithm is an algorithm metaheuristic to solve the problem of course scheduling. The two algorithm will be tested and compared to get performance is the best. The algorithm was tested using data schedule courses of the university in Semarang. From the experimental results we conclude that the genetic algorithm has better performance than the ant colony optimization  algorithm in solving the case of course scheduling.

  12. Solving University Scheduling Problem Using Hybrid Approach

    Directory of Open Access Journals (Sweden)

    Aftab Ahmed Shaikh

    2011-10-01

    Full Text Available In universities scheduling curriculum activity is an essential job. Primarily, scheduling is a distribution of limited resources under interrelated constraints. The set of hard constraints demand the highest priority and should not to be violated at any cost, while the maximum soft constraints satisfaction mounts the quality scale of solution. In this research paper, a novel bisected approach is introduced that is comprisesd of GA (Genetic Algorithm as well as Backtracking Recursive Search. The employed technique deals with both hard and soft constraints successively. The first phase decisively is focused over elimination of all the hard constraints bounded violations and eventually produces partial solution for subsequent step. The second phase is supposed to draw the best possible solution on the search space. Promising results are obtained by implementation on the real dataset. The key points of the research approach are to get assurance of hard constraints removal from the dataset and minimizing computational time for GA by initializing pre-processed set of chromosomes.

  13. Intelligent Scheduling for Underground Mobile Mining Equipment.

    Directory of Open Access Journals (Sweden)

    Zhen Song

    Full Text Available Many studies have been carried out and many commercial software applications have been developed to improve the performances of surface mining operations, especially for the loader-trucks cycle of surface mining. However, there have been quite few studies aiming to improve the mining process of underground mines. In underground mines, mobile mining equipment is mostly scheduled instinctively, without theoretical support for these decisions. Furthermore, in case of unexpected events, it is hard for miners to rapidly find solutions to reschedule and to adapt the changes. This investigation first introduces the motivation, the technical background, and then the objective of the study. A decision support instrument (i.e. schedule optimizer for mobile mining equipment is proposed and described to address this issue. The method and related algorithms which are used in this instrument are presented and discussed. The proposed method was tested by using a real case of Kittilä mine located in Finland. The result suggests that the proposed method can considerably improve the working efficiency and reduce the working time of the underground mine.

  14. SHIFT SCHEDULING FOR A MAINTENANCE WORKSHOP.

    Directory of Open Access Journals (Sweden)

    M. Sinclair

    2012-01-01

    Full Text Available

    ENGLISH ABSTRACT: A big passenger transport company experienced problems with the utilization of their maintenance crews. Large amounts of overtime were logged, while at the same time a lot of idle time was experienced. This paper describes the development on a microcomputer of a Decision Support System (DSS to improve their shift scheduling. Central to the DSS is a heuristic algorithm which generates shift schedules. This algorithm is easy .to understand and provides good results, while it solves the real life problem rapidly on a microcomputer.

    AFRIKAANSE OPSOMMING: 'n Groot passasiersvervoermaatokappy het probleme ondervind met die benutting van hulle onderhoudspersoneel. Baie oortyd is gewerk en terselfdertyd is baie ledige tyd opgeteken. Hierdie artikel beskryf die ontwikkeling op 'n mikrorekenaar van 'n Besluitnemingsondersteuningstelsel (BOS om hulle skofteskedulering te verbeter. Die belangrikste element van die BOS is 'n heuristiese algoritme wat skofteskedules genereer. Hierdie algoritme is maklik om te verstaan en genereer goeie skedules. Terselfdertyd los dit die maatskappy se probleem vinnig op 'n mikrorekenaar op.

  15. AN INFLATION-BASED MAINTENANCE SCHEDULING MODEL

    Directory of Open Access Journals (Sweden)

    S.A. Oke

    2012-01-01

    Full Text Available

    ENGLISH ABSTRACT: This paper attempts to extend an original Gantt-charting model for optimal maintenance scheduling of multiple facilities in multiple periods credited to Charles- Owaba. In particular, an inflationary factor is incorporated into the period-dependent cost function element of the model. Some computational experimentation on the new model is tested. This work is perhaps the first to advance the extension of the Optimal Gantt Charting (OGC model in terms of inflation. The work presents a wealth of research opportunities and has at least the modest potential to evaluate maintenance scheduling theory into the ranks of major theories of maintenance.

    AFRIKAANSE OPSOMMING: Die artikel poog om inflasie te akkommodeer binne die raamwerk van ‘n Ganttkaartmodel vir die bepaling van optimum skedulering van instandhouding vir meervoudige fasiliteite met die verloop van tyd. Inflasie vorm dus deel van die koste-element van die model. Die model is ook op ‘n beperkte wyse gevalideer met behulp van ‘n rekenaarstudie. Die verkreë resultate toon dat addisionele navorsing gedoen kan word om sodoende die metode te vestig in die voorste rang van instandhoudingsbeplanning

  16. Facing Aggression: Cues Differ for Female versus Male Faces

    Science.gov (United States)

    Geniole, Shawn N.; Keyes, Amanda E.; Mondloch, Catherine J.; Carré, Justin M.; McCormick, Cheryl M.

    2012-01-01

    The facial width-to-height ratio (face ratio), is a sexually dimorphic metric associated with actual aggression in men and with observers' judgements of aggression in male faces. Here, we sought to determine if observers' judgements of aggression were associated with the face ratio in female faces. In three studies, participants rated photographs of female and male faces on aggression, femininity, masculinity, attractiveness, and nurturing. In Studies 1 and 2, for female and male faces, judgements of aggression were associated with the face ratio even when other cues in the face related to masculinity were controlled statistically. Nevertheless, correlations between the face ratio and judgements of aggression were smaller for female than for male faces (F1,36 = 7.43, p = 0.01). In Study 1, there was no significant relationship between judgements of femininity and of aggression in female faces. In Study 2, the association between judgements of masculinity and aggression was weaker in female faces than for male faces in Study 1. The weaker association in female faces may be because aggression and masculinity are stereotypically male traits. Thus, in Study 3, observers rated faces on nurturing (a stereotypically female trait) and on femininity. Judgements of nurturing were associated with femininity (positively) and masculinity (negatively) ratings in both female and male faces. In summary, the perception of aggression differs in female versus male faces. The sex difference was not simply because aggression is a gendered construct; the relationships between masculinity/femininity and nurturing were similar for male and female faces even though nurturing is also a gendered construct. Masculinity and femininity ratings are not associated with aggression ratings nor with the face ratio for female faces. In contrast, all four variables are highly inter-correlated in male faces, likely because these cues in male faces serve as “honest signals”. PMID:22276184

  17. Automatic Choice of Scheduling Heuristics for Parallel/Distributed Computing

    Directory of Open Access Journals (Sweden)

    Clayton S. Ferner

    1999-01-01

    Full Text Available Task mapping and scheduling are two very difficult problems that must be addressed when a sequential program is transformed into a parallel program. Since these problems are NP‐hard, compiler writers have opted to concentrate their efforts on optimizations that produce immediate gains in performance. As a result, current parallelizing compilers either use very simple methods to deal with task scheduling or they simply ignore it altogether. Unfortunately, the programmer does not have this luxury. The burden of repartitioning or rescheduling, should the compiler produce inefficient parallel code, lies entirely with the programmer. We were able to create an algorithm (called a metaheuristic, which automatically chooses a scheduling heuristic for each input program. The metaheuristic produces better schedules in general than the heuristics upon which it is based. This technique was tested on a suite of real scientific programs written in SISAL and simulated on four different network configurations. Averaged over all of the test cases, the metaheuristic out‐performed all eight underlying scheduling algorithms; beating the best one by 2%, 12%, 13%, and 3% on the four separate network configurations. It is able to do this, not always by picking the best heuristic, but rather by avoiding the heuristics when they would produce very poor schedules. For example, while the metaheuristic only picked the best algorithm about 50% of the time for the 100 Gbps Ethernet, its worst decision was only 49% away from optimal. In contrast, the best of the eight scheduling algorithms was optimal 30% of the time, but its worst decision was 844% away from optimal.

  18. Cyclic delivery scheduling to customers with different priorities

    Directory of Open Access Journals (Sweden)

    Katarzyna Zofia Gdowska

    2013-12-01

    Full Text Available Background: In this paper a cyclic delivery scheduling problem for customers with different priorities is presented. Shops, which are provided with deliveries, are occasionally located in places which are crucial for the proper flow of traffic. In such places coordination of deliveries is crucial; therefore it allows to completely eliminate the phenomenon of the simultaneous arrivals of suppliers. Methods: In this paper the cyclic delivery scheduling problem for customers with different priorities was presented. To this theoretical problem a mix integer programming model was developed. Specific approach to the cyclic delivery scheduling problem is inspired by timetabling problem for urban public transport. Results: Mixed integer programming model was employed for solving four cases of cyclic delivery scheduling problem for customers with different priorities. When the value of the synchronization priority assigned to a single customer raised then the total number of synchronizations in the whole network decreased. In order to compare solutions a synchronization rate was utilized. A simple factor was utilized - the proportion of number of synchronizations of deliveries to a given customer to the total number of synchronizations obtained for the whole network. When the value of synchronization priority raised then the value of synchronization rate of this customer improved significantly. Conclusions: The mixed integer programming model for the cyclic delivery scheduling problem for customers with different priorities presented in this paper can be utilized for generating schedules of serving customers located in places where only one delivery can be received and unloaded at one go and where there is no space for other suppliers to wait in a queue. Such a schedule can be very useful for organizing deliveries to small shops united in a franchising network, since they operate in a way that is very similar to the network presented in this paper

  19. Research for Global Coordinating Method of Large Equipment Scheduling in Construction Site

    Directory of Open Access Journals (Sweden)

    Yao Ruojun

    2015-01-01

    Full Text Available Much energy is dissipated when large equipment moves slowly. Generally, equipment scheduling at construction site is supposed to minimize equipment slowdown and deadhead moving. Table methods are always adopted to optimize transfer sequence, but the feasible solution is well disappointing. For the acceptable solution relevant to task points in construction equipment scheduling, transfer table is divided into four regions. After proper augmentation and deflation, the acceptable solution evolves into global coordinating solution of construction scheduling, which contributes to minimizing slowdown and deadhead mileages. This method has been verified in practical engineering and is a significant reference on decision making of construction equipment scheduling.

  20. IMPLEMENTATION OF CENTRAL QUEUE BASED REALTIME SCHEDULER FOR MULTIPLE SOURCE DATA STREAMING

    Directory of Open Access Journals (Sweden)

    V. Kaviha

    2014-01-01

    Full Text Available Real-time data packet sources are required to remain robust against different security threats. This study proposes a real-time secure scheduling strategy for data transmission to enhance the communication throughput and reduce the overheads. The proposed system combines real-time scheduling with security service enhancement, error detection and realtime scheduler based on EDF algorithm using uc/os-II real time operating system, implemented on cortex M3 processor. The scheduling unit uses central queue management model and the security enhancement scheme adopts a blowfish encryption mechanism.

  1. Study on Cloud Computing Resource Scheduling Strategy Based on the Ant Colony Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Lingna He

    2012-09-01

    Full Text Available In order to replace the traditional Internet software usage patterns and enterprise management mode, this paper proposes a new business calculation mode- cloud computing, resources scheduling strategy is the key technology in cloud computing, Based on the study of cloud computing system structure and the mode of operation, The key research for cloud computing the process of the work scheduling and resource allocation problems based on ant colony algorithm , Detailed analysis and design of the specific implementation for cloud resources scheduling . And in CloudSim simulation environment and simulation experiments, the results show that the algorithm has better scheduling performance and load balance than general algorithm.

  2. Review Document: Full Software Trigger

    CERN Document Server

    Albrecht, J; Raven, G

    2014-01-01

    This document presents a trigger system for the upgraded LHCb detector, scheduled to begin operation in 2020. This document serves as input for the internal review towards the "DAQ, online and trigger TDR". The proposed trigger system is implemented entirely in software. In this document we show that track reconstruction of a similar quality to that available in the offline algorithms can be performed on the full inelastic $pp$-collision rate, without prior event selections implemented in custom hardware and without relying upon a partial event reconstruction. A track nding eciency of 98.8 % relative to oine can be achieved for tracks with $p_T >$ 500 MeV/$c$. The CPU time required for this reconstruction is about 40 % of the available budget. Proof-of-principle selections are presented which demonstrate that excellent performance is achievable using an inclusive beauty trigger, in addition to exclusive beauty and charm triggers. Finally, it is shown that exclusive beauty and charm selections that do not intr...

  3. It Is Not Just about the Schedule: Key Factors in Effective Reference Desk Scheduling and Management

    Science.gov (United States)

    Sciammarella, Susan; Fernandes, Maria Isabel; McKay, Devin

    2008-01-01

    Reference desk scheduling is one of the most challenging tasks in the organizational structure of an academic library. The ability to turn this challenge into a workable and effective function lies with the scheduler and indirectly the cooperation of all librarians scheduled for reference desk service. It is the scheduler's sensitivity to such…

  4. Rate-optimal scheduling of recursive DSP algorithms based on the scheduling-range chart

    NARCIS (Netherlands)

    Heemstra de Groot, Sonia M.; Herrmann, Otto E.

    1990-01-01

    A method for rate-optimal scheduling of recursive DSP algorithms is presented. The approach is based on the determination of the scheduling window of each operation and the construction of a scheduling-range chart. The information in the chart is used during scheduling to optimize some quality crite

  5. Design of a Real-Time Face Detection Parallel Architecture Using High-Level Synthesis

    Directory of Open Access Journals (Sweden)

    Yang Fan

    2008-01-01

    Full Text Available Abstract We describe a High-Level Synthesis implementation of a parallel architecture for face detection. The chosen face detection method is the well-known Convolutional Face Finder (CFF algorithm, which consists of a pipeline of convolution operations. We rely on dataflow modelling of the algorithm and we use a high-level synthesis tool in order to specify the local dataflows of our Processing Element (PE, by describing in C language inter-PE communication, fine scheduling of the successive convolutions, and memory distribution and bandwidth. Using this approach, we explore several implementation alternatives in order to find a compromise between processing speed and area of the PE. We then build a parallel architecture composed of a PE ring and a FIFO memory, which constitutes a generic architecture capable of processing images of different sizes. A ring of 25 PEs running at 80 MHz is able to process 127 QVGA images per second or 35 VGA images per second.

  6. Design of a Real-Time Face Detection Parallel Architecture Using High-Level Synthesis

    Directory of Open Access Journals (Sweden)

    2009-02-01

    Full Text Available We describe a High-Level Synthesis implementation of a parallel architecture for face detection. The chosen face detection method is the well-known Convolutional Face Finder (CFF algorithm, which consists of a pipeline of convolution operations. We rely on dataflow modelling of the algorithm and we use a high-level synthesis tool in order to specify the local dataflows of our Processing Element (PE, by describing in C language inter-PE communication, fine scheduling of the successive convolutions, and memory distribution and bandwidth. Using this approach, we explore several implementation alternatives in order to find a compromise between processing speed and area of the PE. We then build a parallel architecture composed of a PE ring and a FIFO memory, which constitutes a generic architecture capable of processing images of different sizes. A ring of 25 PEs running at 80 MHz is able to process 127 QVGA images per second or 35 VGA images per second.

  7. Software Project Scheduling Management by Particle Swarm Optimization

    Directory of Open Access Journals (Sweden)

    Dinesh B. Hanchate

    2014-12-01

    Full Text Available PSO (Particle Swarm Optimization is, like GA, a heuristic global optimization method based on swarm intelligence. In this paper, we present a particle swarm optimization algorithm to solve software project scheduling problem. PSO itself inherits very efficient local search method to find the near optimal and best-known solutions for all instances given as inputs required for SPSM (Software Project Scheduling Management. At last, this paper imparts PSO and research situation with SPSM. The effect of PSO parameter on project cost and time is studied and some better results in terms of minimum SCE (Software Cost Estimation and time as compared to GA and ACO are obtained.

  8. A Novel Hybrid Algorithm for Task Graph Scheduling

    Directory of Open Access Journals (Sweden)

    Vahid Majid Nezhad

    2011-03-01

    Full Text Available One of the important problems in multiprocessor systems is Task Graph Scheduling. Task Graph Scheduling is an NP-Hard problem. Both learning automata and genetic algorithms are search tools which are used for solving many NP-Hard problems. In this paper a new hybrid method based on Genetic Algorithm and Learning Automata is proposed. The proposed algorithm begins with an initial population of randomly generated chromosomes and after some stages, each chromosome maps to an automaton. Experimental results show that superiority of the proposed algorithm over the current approaches.

  9. OPTIMISATION OF JOB SHOP SCHEDULING USING SHIFTING BOTTLENECK TECHNIQUE

    Directory of Open Access Journals (Sweden)

    Katuru Phani Raja Kumar

    2013-07-01

    Full Text Available In manufacturing system the problem of scheduling machines is a difficult task to reach the due date of the productivity. The Job Shop Scheduling have been solved by different algorithms and methods based on the sequence operation constraints and processing times for small size problems. The JSSP with m machines and n jobs is represented to determine an optimal solution by using the shortest processing time technique and Gantt chart is drawn to visually represent the total makespan. The shifting bottleneck method has been used to reduce the total flow time of the JSSP and arrive at an optimal solution.

  10. Application of genetic algorithm to the technological operations scheduling problem

    Directory of Open Access Journals (Sweden)

    Lujić, R.

    2008-04-01

    Full Text Available The basic enterprise task is to satisfy customer requirements: due date, price and quality. Based on experiences from engineers practice of work in Croatian enterprises it could be concluded that enterprises are not able to fulfil obligations to the customer in a way of due dates. One of the basic reasons lies in inappropriate scheduling model that has not had possibility to make plan variants. The paper shows how genetic algorithm could be successfully applied in scheduling model to solve the problem of plan variant. As a basic selection in the paper 3-tournament steady-state selection has been applied.

  11. Facing Sound - Voicing Art

    DEFF Research Database (Denmark)

    Lønstrup, Ansa

    2013-01-01

    This article is based on examples of contemporary audiovisual art, with a special focus on the Tony Oursler exhibition Face to Face at Aarhus Art Museum ARoS in Denmark in March-July 2012. My investigation involves a combination of qualitative interviews with visitors, observations of the audienc......´s interactions with the exhibition and the artwork in the museum space and short analyses of individual works of art based on reception aesthetics and phenomenology and inspired by newer writings on sound, voice and listening....

  12. Data Model Approach And Markov Chain Based Analysis Of Multi-Level Queue Scheduling

    Directory of Open Access Journals (Sweden)

    Diwakar Shukla

    2010-01-01

    Full Text Available There are many CPU scheduling algorithms inliterature like FIFO, Round Robin, Shortest-Job-First and so on.The Multilevel-Queue-Scheduling is superior to these due to itsbetter management of a variety of processes. In this paper, aMarkov chain model is used for a general setup of Multilevelqueue-scheduling and the scheduler is assumed to performrandom movement on queue over the quantum of time.Performance of scheduling is examined through a rowdependent data model. It is found that with increasing value of αand d, the chance of system going over the waiting state reduces.At some of the interesting combinations of α and d, it diminishesto zero, thereby, provides us some clue regarding better choice ofqueues over others for high priority jobs. It is found that ifqueue priorities are added in the scheduling intelligently thenbetter performance could be obtained. Data model helpschoosing appropriate preferences.

  13. AUTOMATING SELECTION OF OPTIMAL PACKET SCHEDULING DURING VOIP-TRAFFIC TRANSMISSION

    Directory of Open Access Journals (Sweden)

    Yuliya A. Balakshina

    2016-11-01

    Full Text Available The usage of various packet scheduling disciplines in computer networking devices as a mechanism to ensure the quality of service is described. Stages for selection of necessary parameters values of packet scheduling during VoIP-traffic transmission in computer networks are defined. VoIP-traffic was set as a research object because there are strict requirements of VoIP-applications to the network transmission parameters. With the aid of training and experimental simulation system the numerous experiments for parameters selection of the most common packet scheduling disciplines were carried out (FIFO, WFQ, non-preemptive priority queueing. The example that illustrates the ability to adjust the weighting coefficients of WFQ packet scheduling discipline is presented. Approximate analytical dependences are obtained and they will significantly reduce system administrators’ efforts to assess and modify the parameters of packet scheduling in network devices. A method of automating selection of the optimal packet scheduling discipline is formulated.

  14. On the Cutting Edge: Face-to-Face and Virtual Professional Development for Current and Future Geoscience Faculty

    Science.gov (United States)

    Macdonald, H.; Manduca, C. A.; Mogk, D. W.; Tewksbury, B. J.; Iverson, E. A.; Kirk, K. B.; Beane, R. J.; McConnell, D.; Wiese, K.; Wysession, M. E.

    2011-12-01

    On the Cutting Edge, a comprehensive, discipline-wide professional development program for current and future geoscience faculty, aims to develop a geoscience professoriate committed to high-quality instruction based on currency in scientific knowledge, good pedagogic practice, and research on learning. Our program provides an integrated workshop series and online teaching resources. Since 2002, we have offered more than 80 face-to-face workshops, virtual workshops and webinars, and hybrid events. Participants come from two-year colleges and four-year colleges and universities. The workshop series is designed to address the needs of faculty in all career stages at the full spectrum of institutions and covering the breadth of the geoscience curriculum. We select timely and compelling topics and create opportunities of interest to faculty. We offer workshops on course design, new geoscience research and pedagogical topics, core geoscience curriculum topics, and introductory courses as well as workshops for early career faculty and for future faculty. Our workshops are designed to model good teaching practice. We set workshop goals that guide workshop planning and evaluation. Workshops are interactive, emphasize participant learning, provide opportunities for participants to interact and share experience/knowledge, provide good resources, give participants time to reflect and to develop action plans, and help transform their ideas about teaching. We emphasize the importance of adaptation in the context of their specific situations. For virtual workshops and webinars we use icebreakers and other structured interactions to build a comfortable workshop community; promote interaction through features on webinar software, chat-aided question and answer, small-group synchronous interactions, and/or discussion boards; plan detailed schedules for workshop events; use asynchronous discussions and recordings of synchronous events given that participants are busy with their

  15. Bayesian Optimisation Algorithm for Nurse Scheduling

    CERN Document Server

    Li, Jingpeng

    2008-01-01

    Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimization Algorithm (BOA) for the nurse scheduling problem that chooses such suitable scheduling rules from a set for each nurses assignment. Based on the idea of using probabilistic models, the BOA builds a Bayesian network for the set of promising solutions and samples these networks to generate new candidate solutions. Computational results from 52 real data instances demonstrate the success of this approach. It is also suggested that the learning mechanism in the proposed algorithm may be suitable for other scheduling problems.

  16. Conjunction Faces Alter Confidence-Accuracy Relations for Old Faces

    Science.gov (United States)

    Reinitz, Mark Tippens; Loftus, Geoffrey R.

    2017-01-01

    The authors used a state-trace methodology to investigate the informational dimensions used to recognize old and conjunction faces (made by combining parts of separately studied faces). Participants in 3 experiments saw faces presented for 1 s each. They then received a recognition test; faces were presented for varying brief durations and…

  17. Pedagogical Characteristics of Online and Face-to-Face Classes

    Science.gov (United States)

    Wuensch, Karl; Aziz, Shahnaz; Ozan, Erol; Kishore, Masao; Tabrizi, M. H. Nassehzadeh

    2008-01-01

    Currently, many students have had experience with both face-to-face and online classes. We asked such students at 46 different universities in the United States to evaluate the pedagogical characteristics of their most recently completed face-to-face class and their most recently completed online class. The results show that students rate online…

  18. Bayesian Face Recognition and Perceptual Narrowing in Face-Space

    Science.gov (United States)

    Balas, Benjamin

    2012-01-01

    During the first year of life, infants' face recognition abilities are subject to "perceptual narrowing", the end result of which is that observers lose the ability to distinguish previously discriminable faces (e.g. other-race faces) from one another. Perceptual narrowing has been reported for faces of different species and different races, in…

  19. Downlink scheduling using non-orthogonal uplink beams

    KAUST Repository

    Eltayeb, Mohammed E.

    2014-04-01

    Opportunistic schedulers rely on the feedback of the channel state information of users in order to perform user selection and downlink scheduling. This feedback increases with the number of users, and can lead to inefficient use of network resources and scheduling delays. We tackle the problem of feedback design, and propose a novel class of nonorthogonal codes to feed back channel state information. Users with favorable channel conditions simultaneously transmit their channel state information via non-orthogonal beams to the base station. The proposed formulation allows the base station to identify the strong users via a simple correlation process. After deriving the minimum required code length and closed-form expressions for the feedback load and downlink capacity, we show that i) the proposed algorithm reduces the feedback load while matching the achievable rate of full feedback algorithms operating over a noiseless feedback channel, and ii) the proposed codes are superior to the Gaussian codes.

  20. User Demand Aware Grid Scheduling Model with Hierarchical Load Balancing

    Directory of Open Access Journals (Sweden)

    P. Suresh

    2013-01-01

    Full Text Available Grid computing is a collection of computational and data resources, providing the means to support both computational intensive applications and data intensive applications. In order to improve the overall performance and efficient utilization of the resources, an efficient load balanced scheduling algorithm has to be implemented. The scheduling approach also needs to consider user demand to improve user satisfaction. This paper proposes a dynamic hierarchical load balancing approach which considers load of each resource and performs load balancing. It minimizes the response time of the jobs and improves the utilization of the resources in grid environment. By considering the user demand of the jobs, the scheduling algorithm also improves the user satisfaction. The experimental results show the improvement of the proposed load balancing method.

  1. Grain Emergency Vehicle Scheduling Problem with Time and Demand Uncertainty

    Directory of Open Access Journals (Sweden)

    Jiang DongQing

    2014-01-01

    Full Text Available Grain transportation plays an important role in many relief and emergency supply chains. In this paper, we take the grain emergency vehicle scheduling model between multiwarehouses as the research object. Under the emergency environment, the aim of the problem is to maximize the utilization of vehicles and minimize the delay time. The randomness of the key parameters in grain emergency vehicle scheduling, such as time and demand, is determined through statistical analysis and the model is solved through robust optimization method. Besides, we apply the numerical examples for experimental analysis. We compare the robust optimization model with classic model to illustrate the differences and similarities between them. The results show that the uncertainty of both time and demand has great influence on the efficiency of grain emergency vehicle scheduling problem.

  2. Scheduling Patients’ Appointments: Allocation of Healthcare Service Using Simulation Optimization

    Directory of Open Access Journals (Sweden)

    Ping-Shun Chen

    2015-01-01

    Full Text Available In the service industry, scheduling medical procedures causes difficulties for both patients and management. Factors such as fluctuations in customer demand and service time affect the appointment scheduling systems’ performance in terms of, for example, patients’ waiting time, idle time of resources, and total cost/profits. This research implements four appointment scheduling policies, i.e., constant arrival, mixed patient arrival, three-section pattern arrival, and irregular arrival, in an ultrasound department of a hospital in Taiwan. By simulating the four implemented policies’ optimization procedures, optimal or near-optimal solutions can be obtained for patients per arrival, patients’ inter-arrival time, and the number of the time slots for arrived patients. Furthermore, three objective functions are tested, and the results are discussed. The managerial implications and discussions are summarized to demonstrate how outcomes can be useful for hospital managers seeking to allocate their healthcare service capacities.

  3. GLOA: A New Job Scheduling Algorithm for Grid Computing

    Directory of Open Access Journals (Sweden)

    Zahra Pooranian

    2013-03-01

    Full Text Available The purpose of grid computing is to produce a virtual supercomputer by using free resources available through widespread networks such as the Internet. This resource distribution, changes in resource availability, and an unreliable communication infrastructure pose a major challenge for efficient resource allocation. Because of the geographical spread of resources and their distributed management, grid scheduling is considered to be a NP-complete problem. It has been shown that evolutionary algorithms offer good performance for grid scheduling. This article uses a new evaluation (distributed algorithm inspired by the effect of leaders in social groups, the group leaders' optimization algorithm (GLOA, to solve the problem of scheduling independent tasks in a grid computing system. Simulation results comparing GLOA with several other evaluation algorithms show that GLOA produces shorter makespans.

  4. Robust Energy Scheduling for Wireless Communication under Harvesting Uncertainty

    Directory of Open Access Journals (Sweden)

    Hua Xiao

    2012-08-01

    Full Text Available In this study, we investigate the energy scheduling problem for wireless communication with energy harvesting devices. We consider wireless transmission systems equipped with energy harvesting devices, which can provide sustainable energy to substitute traditional battery. One of challenging in the system is to efficiently schedule energy consumption to maximize the utility and to adapt to the energy harvesting process. In general, it is difficult to obtain the accurate energy harvesting model parameters. On the other hand, model errors could considerably deteriorate the performances of traditional energy management approaches. We therefore consider robust energy scheduling schemes under the model uncertainty of the energy harvesting process. The problem is formulated as a robust Markov decision process and efficiently solved by robust dynamic programming. Extensive simulation results verify our proposed approaches.

  5. Dynamic scheduling and analysis of real time systems with multiprocessors

    Directory of Open Access Journals (Sweden)

    M.D. Nashid Anjum

    2016-08-01

    Full Text Available This research work considers a scenario of cloud computing job-shop scheduling problems. We consider m realtime jobs with various lengths and n machines with different computational speeds and costs. Each job has a deadline to be met, and the profit of processing a packet of a job differs from other jobs. Moreover, considered deadlines are either hard or soft and a penalty is applied if a deadline is missed where the penalty is considered as an exponential function of time. The scheduling problem has been formulated as a mixed integer non-linear programming problem whose objective is to maximize net-profit. The formulated problem is computationally hard and not solvable in deterministic polynomial time. This research work proposes an algorithm named the Tube-tap algorithm as a solution to this scheduling optimization problem. Extensive simulation shows that the proposed algorithm outperforms existing solutions in terms of maximizing net-profit and preserving deadlines.

  6. Scheduling Issues in ECOFRAME Optical Packet Switched Ring

    Directory of Open Access Journals (Sweden)

    P. Gravey

    2011-06-01

    Full Text Available In the metropolitan area, traditional SONET/SDH circuit switched rings are likely to be replaced with optical packet/burst switching technologies. In this paper we consider a slotted WDM optical packet ring operating without resource reservation mechanisms. In such rings, optical packets in transit have priority over traffic to be inserted by the node. Packets to be inserted are thus queued according to their destination, in order to avoid headof-line blocking. We focus on scheduling policies and compare several MaxWeight scheduling policies, including Oldest Packet First (OPF which emulates FIFO queueing while avoiding head-of-line blocking. We show that there is a trade-off between implementation complexity and fairness, and identify the Largest Virtual Waiting Time First (LVWTF scheduling policy as presenting both a low complexity and a good fairness performance.

  7. Weighted Clustering Based Preemptive Scheduling For Real Time System

    Directory of Open Access Journals (Sweden)

    H.S Behera

    2012-05-01

    Full Text Available In this paper a new improved clustering based scheduling algorithm for a single processor environment is proposed. In the proposed method, processes are organized into non-overlapping clusters.For each process the variance from the median, is calculated and compared with the variance from the means of other clusters. Each process is assigned to the cluster associated with the closest median. The new median of each cluster is calculated and the procedure is repeated until the medians are fixed. Weight is assigned to each cluster using the externally assigned priorities and the burst time. The cluster with highest weight is executed first and jobs are scheduled using the Round Robin algorithm with calculated dynamic time slice.. The experimental study of the proposed scheduling algorithm shows that the high priority jobs can be executed first to meet the deadlines and also prevents starvation of processes at the same time which is crucial in a real time system.

  8. Fatigue Minimization Work Shift Scheduling for Air Traffic Controllers

    Directory of Open Access Journals (Sweden)

    Ta-Chung Wang

    2013-05-01

    Full Text Available It is common for Air Traffic Controllers to control air traffic during the night and to experience fatigue. Although fatigue is not the direct cause of aviation accidents, 21 percent of accidents are fatigue-related. Therefore countries and companies have tried to regulate work hours to avoid extreme fatigue, thus decreasing human error resulting from fatigue. However, these regulations may not reflect that actual fatigue variation and fatigue levels can be decreased still more by scheduling appropriately. This paper focuses on optimal work shift scheduling to reduce air traffic controller fatigue. First, a mathematical model is established to describe fatigue levels. The objective function is to reduce the fatigue peak produced by work shifts as much as possible. Various constraints, such as holidays and manpower requirements are considered. The optimization problem is then solved using integer programming. We take a sample schedule and draw conclusions by comparing our results with the original fatigue levels.

  9. Grid Patient Appointment Template Design to Improve Scheduling Effectiveness

    Directory of Open Access Journals (Sweden)

    Yu-Li Huang

    2015-01-01

    Full Text Available Current outpatient delivery systems have been problematic in their ability to effectively schedule appointments and grant patients access to care. A better appointment system has demonstrated improvement on these issues. The objective of this study is to develop a grid appointment system to further improve the scheduling flexibility by determining the minimum length of appointment slots that optimizes the total costs of patient waiting, physician idling, and overtime. This minimum length is used for the patient type requiring the least amount of treatment time such as return visit (RV, and multiplications of the minimum length are for patient types with longer treatment such as new patients (NP. The results indicated that the proposed grid system adjusts to demand changes at least 15% more cost-effective when grouping two RVs into an NP or dividing an NP into two RVs compared to the base-line scheduling approaches that build around the mean treatment time.

  10. Learning curve-based scheduling in customized assembly lines

    Directory of Open Access Journals (Sweden)

    Michel J. Anzanello

    2011-09-01

    Full Text Available Mass customization implies in large variety of product models and small lot sizes. Human-based activities are highly affected by the learning process as a new model is put into production. That makes estimation of lot processing times difficult and jeopardizes the efficiency of scheduling techniques. The method proposed in this paper integrates information from learning curve modeling and scheduling heuristics, aiming at minimizing the completion time of jobs to be processed. Lot processing time is estimated by means of learning curve modeling and then used in scheduling heuristics for the unrelated parallel workers problem. The completion time generated by the recommended heuristic, determined through simulation, deviates 4.9% from the optimal sequence and yields good work balance among teams of workers. The heuristic is demonstrated in a shoe manufacturing process.

  11. GBT Dynamic Scheduling System: Algorithms, Metrics, and Simulations

    Science.gov (United States)

    Balser, D. S.; Bignell, C.; Braatz, J.; Clark, M.; Condon, J.; Harnett, J.; O'Neil, K.; Maddalena, R.; Marganian, P.; McCarty, M.; Sessoms, E.; Shelton, A.

    2009-09-01

    We discuss the scoring algorithm of the Robert C. Byrd Green Bank Telescope (GBT) Dynamic Scheduling System (DSS). Since the GBT is located in a continental, mid-latitude region where weather is dominated by water vapor and small-scale effects, the weather plays an important role in optimizing the observing efficiency of the GBT. We score observing sessions as a product of many factors. Some are continuous functions while others are binary limits taking values of 0 or 1, any one of which can eliminate a candidate session by forcing the score to zero. Others reflect management decisions to expedite observations by visiting observers, ensure the timely completion of projects, etc. Simulations indicate that dynamic scheduling can increase the effective observing time at frequencies higher than 10 GHz by about 50% over one full year. Beta tests of the DSS during Summer 2008 revealed the significance of various scheduling constraints and telescope overhead time to the overall observing efficiency.

  12. Scheduling Heterogeneous Wireless Systems for Efficient Spectrum Access

    Directory of Open Access Journals (Sweden)

    Liao Shenghui

    2010-01-01

    Full Text Available The spectrum scarcity problem emerged in recent years, due to unbalanced utilization of RF (radio frequency bands in the current state of wireless spectrum allocations. Spectrum access scheduling addresses challenges arising from spectrum sharing by interleaving the channel access among multiple wireless systems in a TDMA fashion. Different from cognitive radio approaches which are opportunistic and noncollaborative in general, spectrum access scheduling proactively structures and interleaves the channel access pattern of heterogeneous wireless systems, using collaborative designs by implementing a crucial architectural component—the base stations on software defined radios (SDRs. We discuss our system design choices for spectrum sharing from multiple perspectives and then present the mechanisms for spectrum sharing and coexistence of GPRS+WiMAX and GPRS+WiFi as use cases, respectively. Simulations were carried out to prove that spectrum access scheduling is an alternative, feasible, and promising approach to the spectrum scarcity problem.

  13. An Integrated Expert System for Linear Scheduling Heavy Earthmoving Operations

    Directory of Open Access Journals (Sweden)

    Nizar Markiz

    2016-01-01

    Full Text Available Heavy earthmoving operations are repetitive in nature and vulnerable to time-related restraints and uncertainties. Therefore, at the conceptual stage, scheduling these operations can take a linear form, known as linear schedule or line of balance (LOB. In such type of work, generating a preliminary line of balance for variable sequencing of activities is crucial. In this paper, an integrated expert system for determining preliminary linear schedules for heavy earthmoving operations at the conceptual stage is presented. The proposed system incorporates numerous factors that influence the analysis of earthmoving operations, which include geological and topographical parameters used to determine productivity rates at the conceptual stage. Also, the proposed system is capable of automatically generating a line of balance based on a stochastic scheduling technique via the metaheuristic simulated annealing intelligent approach to incorporate randomness and uncertainties in performing the associated activities. A parametric analysis is conducted in order to quantify the system’s degree of accuracy. An actual case project is then utilized to illustrate its numerical capabilities. Generating accurate linear schedules for heavy earthmoving operations at the conceptual design stage is anticipated to be of major significance to infrastructure project stakeholders, engineers, and construction managers by detecting schedule’s conflicts early in order to enhance overall operational logistics.

  14. A Heuristic Task Scheduling Algorithm for Heterogeneous Virtual Clusters

    Directory of Open Access Journals (Sweden)

    Weiwei Lin

    2016-01-01

    Full Text Available Cloud computing provides on-demand computing and storage services with high performance and high scalability. However, the rising energy consumption of cloud data centers has become a prominent problem. In this paper, we first introduce an energy-aware framework for task scheduling in virtual clusters. The framework consists of a task resource requirements prediction module, an energy estimate module, and a scheduler with a task buffer. Secondly, based on this framework, we propose a virtual machine power efficiency-aware greedy scheduling algorithm (VPEGS. As a heuristic algorithm, VPEGS estimates task energy by considering factors including task resource demands, VM power efficiency, and server workload before scheduling tasks in a greedy manner. We simulated a heterogeneous VM cluster and conducted experiment to evaluate the effectiveness of VPEGS. Simulation results show that VPEGS effectively reduced total energy consumption by more than 20% without producing large scheduling overheads. With the similar heuristic ideology, it outperformed Min-Min and RASA with respect to energy saving by about 29% and 28%, respectively.

  15. Robust Satellite Scheduling Approach for Dynamic Emergency Tasks

    Directory of Open Access Journals (Sweden)

    Xuejun Zhai

    2015-01-01

    Full Text Available Earth observation satellites play a significant role in rapid responses to emergent events on the Earth’s surface, for example, earthquakes. In this paper, we propose a robust satellite scheduling model to address a sequence of emergency tasks, in which both the profit and robustness of the schedule are simultaneously maximized in each stage. Both the multiobjective genetic algorithm NSGA2 and rule-based heuristic algorithm are employed to obtain solutions of the model. NSGA2 is used to obtain a flexible and highly robust initial schedule. When every set of emergency tasks arrives, a combined algorithm called HA-NSGA2 is used to adjust the initial schedule. The heuristic algorithm (HA is designed to insert these tasks dynamically to the waiting queue of the initial schedule. Then the multiobjective genetic algorithm NSGA2 is employed to find the optimal solution that has maximum revenue and robustness. Meanwhile, to improve the revenue and resource utilization, we adopt a compact task merging strategy considering the duration of task execution in the heuristic algorithm. Several experiments are used to evaluate the performance of HA-NSGA2. All simulation experiments show that the performance of HA-NSGA2 is significantly improved.

  16. Construction management scheduling and control: The familiar historical overview

    Directory of Open Access Journals (Sweden)

    Behnam Ali

    2016-01-01

    Full Text Available The paper suggests that ‘management by exception’ is an historical default control mechanism based on the perception of control as a static process. However, increasingly scholars claim that a dynamic and proactive systems model is a more effective form of project control. These findings are the result of an historical desktop research method that analysed content from a small sample of scheduling methods and control approaches found in online and university library resources. The concept of control has historically influenced both visualization and analytics of different scheduling methods for construction project management. This paper focuses on two control ideals; static and dynamic control mechanisms. The overview begins with the description of early graphical scheduling techniques: Gantt charts and Harmonogram. It continues with examples of contributors to scheduling and control that include: CPM, PERT, LOB, Flowline and Location Based Management. The finding of this simple history suggests that change is the constant element for project control mechanisms. An object-based digital environment such as the data-rich building information modelling (BIM appears to be continuing the change for new scheduling methods and control mechanisms.

  17. Sharing data for production scheduling using the ISA-95 standard

    Directory of Open Access Journals (Sweden)

    Iiro eHarjunkoski

    2014-10-01

    Full Text Available In the development and deployment of production scheduling solutions one major challenge is to establish efficient information sharing with industrial production management systems. Information comprising production orders to be scheduled, processing plant structure, product recipes, available equipment and other resources are necessary for producing a realistic short-term production plan. Currently, a widely-accepted standard for information sharing is missing. This often leads to the implementation of costly custom-tailored interfaces, or in the worst case the scheduling solution will be abandoned. Additionally, it becomes difficult to easily compare different methods on various problem instances, which complicates the re-use of existing scheduling solutions. In order to overcome these hurdles, a platform-independent and holistic approach is needed. Nevertheless, it is difficult for any new solution to gain wide acceptance within industry as new standards are often refused by companies already using a different established interface. From an acceptance point of view, the ISA-95 standard could act as a neutral data-exchange platform. In this paper, we assess if this already widespread standard is simple, yet powerful enough to act as the desired holistic data-exchange for scheduling solutions.

  18. QoS Based User Driven Scheduler for Grid Environment

    Directory of Open Access Journals (Sweden)

    Sanjay Patel

    2011-05-01

    Full Text Available As grids are in essence heterogeneous, dynamic, shared and distributed environments, managing thesekinds of platforms efficiently is extremely complex. A promising scalable approach to deal with theseintricacies is the design of self-managing of autonomic applications. Autonomic applications adapt theirexecution accordingly by considering knowledge about their own behaviour and environmentalconditions.QoS based User Driven scheduling for grid that provides the self-optimizing ability inautonomic applications. Computational grids to provide a user to solve large scale problem by spreadinga single large computation across multiple machines of physical location.QoS based User Driven scheduler for grid also provides reliability of the grid systems and increase theperformance of the grid to reducing the execution time of job by applying scheduling policies defined bythe user. The main aim of this paper is to distribute the computational load among the available gridnodes and to developed a QoS based scheduling algorithm for grid and making grid more reliable.Gridcomputing system is different from conventional distributed computing systems by its focus on large scaleresource sharing, where processors and communication have significant inuence on Grid computingreliability. Reliability capabilities initiated by end users from within applications they submit to the gridfor execution. Reliability of infrastructure and management services that perform essential functionsnecessary for grid systems to operate, such as resource allocation and scheduling.

  19. Prediction Based Proactive Thermal Virtual Machine Scheduling in Green Clouds

    Directory of Open Access Journals (Sweden)

    Supriya Kinger

    2014-01-01

    Full Text Available Cloud computing has rapidly emerged as a widely accepted computing paradigm, but the research on Cloud computing is still at an early stage. Cloud computing provides many advanced features but it still has some shortcomings such as relatively high operating cost and environmental hazards like increasing carbon footprints. These hazards can be reduced up to some extent by efficient scheduling of Cloud resources. Working temperature on which a machine is currently running can be taken as a criterion for Virtual Machine (VM scheduling. This paper proposes a new proactive technique that considers current and maximum threshold temperature of Server Machines (SMs before making scheduling decisions with the help of a temperature predictor, so that maximum temperature is never reached. Different workload scenarios have been taken into consideration. The results obtained show that the proposed system is better than existing systems of VM scheduling, which does not consider current temperature of nodes before making scheduling decisions. Thus, a reduction in need of cooling systems for a Cloud environment has been obtained and validated.

  20. Upper Bound for Queue length in Regulated Burst Service Scheduling

    Directory of Open Access Journals (Sweden)

    Mahmood Daneshvar Farzanegan

    2016-01-01

    Full Text Available Quality of Service (QoS provisioning is very important in next computer/communication networks because of increasing multimedia services. Hence, very investigations are performed in this area. Scheduling algorithms effect QoS provisioning. Lately, a scheduling algorithm called Regulated Burst Service Scheduling (RBSS suggested by author in [1] to provide a better service to bursty and delay sensitive services such as video. One of the most significant feature in RBSS is considering burstiness of arrival traffic in scheduling algorithm. In this paper, an upper bound of queue length or buffer size and service curve are calculated by Network Calculus analysis for RBSS. Because in RBSS queue length is a parameter that is considered in scheduling arbitrator, analysis results a differential inequality to obtain service curve. To simplify, arrival traffic is assumed to be linear that is defined in the paper clearly. This paper help to analysis delay in RBSS for different traffic with different specifications. Therefore, QoS provisioning will be evaluated.