Search

Your search keyword '"Mears, Christopher"' showing total 34 results
Start Over Author "Mears, Christopher"
34 results on '"Mears, Christopher"'

1. Modernization compendium of the AFRC (Air Force Reserve Command)--better known as 'requirements to reality', pt 1: Aging aircraft modernization plan

Author

Mears, Christopher C., Col

Subjects
AIR FORCE RESERVE COMMAND - Equipment, RESERVE FORCES - Air Force - United States - Equipment, AIRPLANES, FIGHTER - Modifications, AIRPLANE TYPE - F- 16, AIRPLANE TYPE - A-10
Abstract

illus, Part 1: Aging aircraft modernization plan. v75 no 9 (Oct 1999): p20-22; part 2: PLAID (Precision Location and Identification). v75 no 10 (Nov 1999): p40-42; part 3: C-130 flight simulation and training. v75 no 11 (Dec 1999): p21-23

Published
1999

3. Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs

Author

Dwyer, Tim, Mears, Christopher, Morgan, Kerri, Niven, Todd, Marriott, Kim, and Wallace, Mark

Subjects
Computer Science - Computational Geometry, Computer Science - Human-Computer Interaction
Abstract

Drawings of highly connected (dense) graphs can be very difficult to read. Power Graph Analysis offers an alternate way to draw a graph in which sets of nodes with common neighbours are shown grouped into modules. An edge connected to the module then implies a connection to each member of the module. Thus, the entire graph may be represented with much less clutter and without loss of detail. A recent experimental study has shown that such lossless compression of dense graphs makes it easier to follow paths. However, computing optimal power graphs is difficult. In this paper, we show that computing the optimal power-graph with only one module is NP-hard and therefore likely NP-hard in the general case. We give an ILP model for power graph computation and discuss why ILP and CP techniques are poorly suited to the problem. Instead, we are able to find optimal solutions much more quickly using a custom search method. We also show how to restrict this type of search to allow only limited back-tracking to provide a heuristic that has better speed and better results than previously known heuristics., Comment: Extended technical report accompanying the PacificVis 2013 paper of the same name

Published
2013

4. Learning from Learning Solvers

Author

Shishmarev, Maxim, Mears, Christopher, Tack, Guido, Garcia de la Banda, Maria, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, and Rueher, Michel, editor

Published
2016
Full Text
View/download PDF

6. Modelling with Option Types in MiniZinc

Author

Mears, Christopher, Schutt, Andreas, Stuckey, Peter J., Tack, Guido, Marriott, Kim, Wallace, Mark, Hutchison, David, Editorial Board Member, Kanade, Takeo, Editorial Board Member, Kittler, Josef, Editorial Board Member, Gao, Wen, Editorial Board Member, Kleinberg, Jon M., Editorial Board Member, Kobsa, Alfred, Editorial Board Member, Mattern, Friedemann, Editorial Board Member, Mitchell, John C., Editorial Board Member, Naor, Moni, Editorial Board Member, Nierstrasz, Oscar, Editorial Board Member, Pandu Rangan, C., Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Terzopoulos, Demetri, Editorial Board Member, Tygar, Doug, Editorial Board Member, Weikum, Gerhard, Editorial Board Member, and Simonis, Helmut, editor

Published
2014
Full Text
View/download PDF

7. Globalizing Constraint Models

Author

Leo, Kevin, Mears, Christopher, Tack, Guido, Garcia de la Banda, Maria, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Schulte, Christian, editor

Published
2013
Full Text
View/download PDF

8. Proving Symmetries by Model Transformation

Author

Mears, Christopher, Niven, Todd, Jackson, Marcel, Wallace, Mark, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Lee, Jimmy, editor

Published
2011
Full Text
View/download PDF

9. A Novel Approach For Detecting Symmetries in CSP Models

Author

Mears, Christopher, Garcia de la Banda, Maria, Wallace, Mark, Demoen, Bart, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Perron, Laurent, editor, and Trick, Michael A., editor

Published
2008
Full Text
View/download PDF

19. OASIcs, Volume 58, ICLP'17, Complete Volume

Author

Rocha, Ricardo, Son, Tran Cao, Mears, Christopher, and Saeedloei, Neda

Subjects
Logic Programming, Software/Program Verification, Testing and Debugging, Programming Languages, Language Classifications, Data processing Computer science, ddc:004
Abstract

OASIcs, Volume 58, ICLP'17, Complete Volume, OASIcs, Vol. 58, Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017), pages 0-0

Published
2018

20. Automatic symmetry detection and dynamic symmetry breaking for constraint programming

Author

Mears, Christopher David

Subjects
Uncategorized
Abstract

Constraint satisfaction and optimisation problems occur frequently in industry and are usually computationally expensive to solve. Constraint programming is a technique for solving these difficult problems using specialised algorithms and search heuristics. The presence of symmetries in constraint problems provides an opportunity to reduce the computational effort required to solve these problems. To exploit symmetries, a problem must first be analysed to determine what symmetries are present and then the search algorithm must be modified to use the known symmetries. In this thesis we provide contributions to both the research areas of automatically detecting symmetries and of exploiting them to improve search performance. The automatic detection of symmetries in constraint problems has been studied for some time, but existing methods can handle realistically-sized problems only by sacrificing the number and kinds of symmetry they can find. We contribute to this area in two parts. First, we present a method of automatically detecting the symmetries of a constraint problem that is capable of finding many small problems in a practical amount of time, and prove its correctness. Second, we use this method as the foundation of a framework for finding the symmetries in entire classes of problems. Symmetry detection on classes of problems has been little studied; our approach greatly improves the practicality of automatic symmetry detection as the symmetries found apply to many problem instances, small and large. The exploitation of symmetries for improving search has been the subject of research for many years, but there is yet to be a method that is easy to use and that gives good performance under different search heuristics. We present a method of symmetry breaking, Lightweight Dynamic Symmetry Breaking (LDSB), that seeks to fill this void. We describe how LDSB focuses on common symmetries to maximise performance, and show experimentally that it performs consistently and is competitive with other dynamic symmetry breaking methods. Finally, we show how LDSB can be extended to much more general search techniques. When considered together, these contributions form the components of an automatic system for detecting the symmetries of a problem class, and exploiting those symmetries when solving different instances of that class.

Published
2017
Full Text
View/download PDF

32. A RELIABILITY-BASED MODEL TO MANAGE HUMAN CAPITAL ASSET-RELATED MISSION RISK

Author

Mears, Christopher

Subjects
Knowledge Management, Human Capital, Strategic Management, Asset Management, Risk Management, Reliability Modeling
Abstract

A convergence of two problems creates a challenge for many organizations that will need to be addressed in the near future. The first problem is the increasing demand for a workforce (primarily knowledge-based), not just in the United States but across the majority of the developed and developing world. The significant shift from the traditional agricultural and industrial economies of yesterday to an economy today which depends largely upon production using the knowledge within the organization more so than its physical equipment, facilities, and other resources. This increasing demand for knowledge workers will require organizations to seek all categories of the world’s workforce to meet this demand, to which many regions, nations, governments, and societies have not yet reacted in a substantial manner. The second problem is the pending difficulty with maintaining organizational knowledge. The traditional approach of spending years investing in its knowledge workers to enable the next organizational generation may be impractical going forward. The retirement of the baby boomer generation, with some sectors forecasting a shortage of 50-60% of their workforce impacted by the year 2020, may not have enough time to invest in their entire workforce. This problem is compounded by the additional challenge of the upcoming generation of workers, which may be almost twice as likely to change jobs as previous generations. Not addressing the convergence of these two problems in a systematic manner will directly increase the risks for organizations to successfully accomplish their respective missions. Although many organizations will make statements along the lines of “our people are our greatest assets”, this part of the organization is oftentimes ignored when considering current and future mission risks. By ignoring this component of mission risk, the organization’s strategic and tactical planning will be incomplete, especially for knowledge worker-intensive organizations. The primary purpose of this research is to develop a model to assess the risks posed to an organization’s mission from their human capital assets (the knowledge, education, experience, skills, and abilities of individuals in the organization) using subjective qualitative, objective qualitative, and quantitative approaches, including an application of reliability modeling.

Published
2019

33. Modernization compendium of the AFRC--better known as `requirements to reality'.

Author

Mears, Christopher C.

Subjects
*MILITARY airplane maintenance & repair, *F-16 (Jet fighter plane), *MILITARY reserve forces
Abstract

Focuses on the aircraft modernization program for the United States Air Force Reserve Command. Depot-level modification of F-16 Block 30 jet fighters; Integration of the enhanced location reporting system radio to the F-16; Installation of night vision imaging system.

Published
1999

34. A radiobiology-based inverse treatment planning method for optimisation of permanent l-125 prostate implants in focal brachytherapy.

Author

Haworth A, Mears C, Betts JM, Reynolds HM, Tack G, Leo K, Williams S, and Ebert MA

Subjects
Humans, Iodine Radioisotopes administration & dosage, Male, Radiation Tolerance, Radiopharmaceuticals administration & dosage, Radiotherapy Dosage, Urethra radiation effects, Brachytherapy methods, Drug-Eluting Stents, Iodine Radioisotopes therapeutic use, Prostatic Neoplasms radiotherapy, Radiopharmaceuticals therapeutic use, Radiotherapy Planning, Computer-Assisted methods
Abstract

Treatment plans for ten patients, initially treated with a conventional approach to low dose-rate brachytherapy (LDR, 145 Gy to entire prostate), were compared with plans for the same patients created with an inverse-optimisation planning process utilising a biologically-based objective. The 'biological optimisation' considered a non-uniform distribution of tumour cell density through the prostate based on known and expected locations of the tumour. Using dose planning-objectives derived from our previous biological-model validation study, the volume of the urethra receiving 125% of the conventional prescription (145 Gy) was reduced from a median value of 64% to less than 8% whilst maintaining high values of TCP. On average, the number of planned seeds was reduced from 85 to less than 75. The robustness of plans to random seed displacements needs to be carefully considered when using contemporary seed placement techniques. We conclude that an inverse planning approach to LDR treatments, based on a biological objective, has the potential to maintain high rates of tumour control whilst minimising dose to healthy tissue. In future, the radiobiological model will be informed using multi-parametric MRI to provide a personalised medicine approach.

Published
2016
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results