Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Addressing the Dependency Problem in Access Security System Architecture Design (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Risk analysis 16 (1996), S. 0 
    Details
    ISSN: 1539-6924
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Energy, Environment Protection, Nuclear Power Engineering
    Notes: The objective of this research is to present a method for evaluating the performance of access control security systems, such as airport security operations. This requires the examination of security system architectures, which involve security technology devices and the algorithms that coordinate their operations. Dependence between device responses in multiple-device systems is a critical practical issue in assessing the performance of such architectures, though no results on this problem have appeared in the literature. This paper presents a method for evaluating when multipledevice security systems with overlapping capabilities are cost-effective. This is achieved using a dependency structure for security system devices to quantify how various technologies interact and to measure the impact of device dependence on system error probabilities. A measure of device response dependence for a two-device system is defined and its properties are explored, including bounds on the dependency measure. The effect of dependence on the system Type I and Type II error probabilities is examined for the two-device system. System performance is compared for independent vs. dependent device responses and desirable dependence relationships are identified. Results are also presented for a cascading sequence of devices. An example is presented to illustrate the results for the two-device system. Implications of these results are discussed, such as how they can be used to identify the optimal use of security devices and to determine whether new technologies warrant investment.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1539-6924.1996.tb00831.x
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Analyzing the Cost of Screening Selectee and Non-Selectee Baggage (2003)
    350 Main Street , Malden , MA 02148 , USA , and 9600 Garsington Road , Oxford OX4 2DQ , UK . : Blackwell Publishing, Inc.
    Risk analysis 23 (2003), S. 0 
    Details
    ISSN: 1539-6924
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Energy, Environment Protection, Nuclear Power Engineering
    Notes: Determining how to effectively operate security devices is as important to overall system performance as developing more sensitive security devices. In light of recent federal mandates for 100% screening of all checked baggage, this research studies the trade-offs between screening only selectee checked baggage and screening both selectee and non-selectee checked baggage for a single baggage screening security device deployed at an airport. This trade-off is represented using a cost model that incorporates the cost of the baggage screening security device, the volume of checked baggage processed through the device, and the outcomes that occur when the device is used. The cost model captures the cost of deploying, maintaining, and operating a single baggage screening security device over a one-year period. The study concludes that as excess baggage screening capacity is used to screen non-selectee checked bags, the expected annual cost increases, the expected annual cost per checked bag screened decreases, and the expected annual cost per expected number of threats detected in the checked bags screened increases. These results indicate that the marginal increase in security per dollar spent is significantly lower when non-selectee checked bags are screened than when only selectee checked bags are screened.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/1539-6924.00367
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Second derivative estimation using harmonic analysis (1994)
    Springer
    Annals of operations research 53 (1994), S. 507-531 
    Details
    ISSN: 1572-9338
    Keywords: Simulation ; derivative estimators ; Hessian estimators ; harmonic analysis ; simulation optimization ; sensitivity analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Simulation sensitivity analysis is an important problem for simulation practitioners analyzing complex systems. The significance of this problem has resulted in the development of various gradient estimators that can be used to address this issue. Although higher derivative estimators have been discussed concurrently, less attention has been given to assess the efficiency and feasibility of computing such estimators. In this paper, two second derivative estimators are presented. The first estimators, called the HFD estimators, combine harmonic gradient estimators with finite differences second derivative estimators. The resulting hybrid estimators requireO(p) fewer simulation runs to implement compared to the straightforward finite differences approach, wherep is the number of input parameters in the simulation model. The second estimators, called the HA estimators, incorporate harmonic analysis directly, requiring one or two simulation runs to implement, depending on whether a control variate simulation run is made. Expressions for the bias and the variance of the HFD and the HA estimators (with and without variance reduction techniques) are derived. Optimal mean squared error convergence rates are also discussed. In particular, the convergence rates for both these estimators are shown to be the same, though the computational performance of the HFD estimators is better than that for the HA estimators on anM/M/1 queue simulation model. Computational results for the HFD estimators on an (s, S) inventory system simulation model are also included.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02136841
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    An integer programming model for vaccine procurement and delivery for childhood immunization: a pilot study (1999)
    Springer
    Health care management science 2 (1999), S. 1-9 
    Details
    ISSN: 1572-9389
    Keywords: mathematical programming ; integer programming model health‐care applications ; vaccines ; economics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Notes: Abstract The National Immunization Program of the Centers for Disease Control and Prevention has identified several challenges that must be faced in childhood immunization programs to deliver and procure vaccines to protect against the common preventable diseases. The biomedical challenge is how to combine and formulate products to take advantage of new vaccines without requiring additional injections. A programmatic challenge is to incorporate them into already crowded immunization schedules. The economic challenge is to make wise procurement choices from among a growing number of competing products. This paper reports the results of a pilot study using operations research methodologies to address the third of these challenges. The pilot is an integer programming model for procuring vaccines for a set of childhood diseases. The model is studied under various scenarios (minimum total cost, next lowest total cost, maximum total cost, minimum total cost with all manufacturers represented). The results of this pilot study demonstrate how a practical set of operations research tools can be developed to guide vaccine selection and procurement, which might stimulate the development of innovations in new vaccines to meet the challenges of disease control through immunization.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1019011106198
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Metaheuristics for a Flexible Assembly System Design Problem (1997)
    Springer
    Journal of heuristics 3 (1997), S. 139-159 
    Details
    ISSN: 1572-9397
    Keywords: flexible assembly systems ; tabu search ; simulated annealing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Flexibility has become an important priority in the formulation and implementation of manufacturing strategies. This in turn has opened up a new class of design problems for such systems. Flexible assembly systems (FAS), consisting of a variety of processors and operations, provide the opportunity for improving product manufacturing flexibility, hence gaining competitive advantages. This paper considers a particular design decision problem for FAS. A matrix-based, polynomial-time lower bound algorithm is presented. Simulated annealing and tabu search metaheuristics are formulated to address the problems. Computational experience with these metaheuristics is reported.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009679413948
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Ordinal Hill Climbing Algorithms for Discrete Manufacturing Process Design Optimization Problems (2000)
    Springer
    Discrete event dynamic systems 10 (2000), S. 307-324 
    Details
    ISSN: 1573-7594
    Keywords: stochastic algorithms ; ordinal optimization ; optimization ; hill climbing ; genetic algorithms ; manufacturing process design
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Thispaper introduces ordinal hill climbing algorithms for addressingdiscrete manufacturing process design optimization problems usingcomputer simulation models. Ordinal hill climbing algorithmscombine the search space reduction feature of ordinal optimizationwith the global search feature of generalized hill climbing algorithms.By iteratively applying the ordinal optimization strategy withinthe generalized hill climbing algorithm framework, the resultinghybrid algorithm can be applied to intractable discrete optimizationproblems. Computational results on an integrated blade rotormanufacturing process design problem are presented to illustratethe application of the ordinal hill climbing algorithm. The relationshipbetween ordinal hill climbing algorithms and genetic algorithmsis also discussed. This discussion provides a framework for howthe ordinal hill climbing algorithm fits into currently appliedalgorithms, as well as to introduce a bridge between the twoalgorithms.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008302003857
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    The effectiveness of finite improvement algorithms for finding global optima (1993)
    Springer
    Mathematical methods of operations research 37 (1993), S. 257-272 
    Details
    ISSN: 1432-5217
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper investigates the effectiveness of using finite improvement algorithms for solving decision, search, and optimization problems. Finite improvement algorithms operate in a finite number of iterations, each taking a polynomial amount of work, where strict improvement is required from iteration to iteration. The hardware, software, and way of measuring complexity found in the polynomial setting are modified to identify the concept of repetition and define the new classes of decision problems,FI andNFI. A firstNFI-complete problem is given using the idea ofFI-transformations. Results relating these new classes toP, NP, andNP-complete are given. It is shown that if an optimization problem in a new classPGS isNP-hard, thenNP=co-NP. TwoPGS problems are given for which no polynomial algorithms are known to exist.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01415994
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    A harmonic analysis approach to simulation sensitivity analysis (1999)
    Springer
    IIE transactions 31 (1999), S. 231-243 
    Details
    ISSN: 1573-9724
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract Simulation sensitivity analysis is an issue faced by simulation practitioners analyzing complex systems. This paper presents steady-state simulation expected response gradient and Hessian estimators, using harmonic analysis. These estimators exploit the orthogonality of the harmonic basis and require just one simulation run, independent of the number of input parameters. Convergence properties and implementation issues for the estimators are discussed. Examples are included to illustrate the performance of the estimators.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1007697705552
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    The complexity of rapid learning in discrete event simulation (1997)
    Springer
    IIE transactions 29 (1997), S. 783-790 
    Details
    ISSN: 1573-9724
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract Sensitivity analysis and optimization of discrete event simulation models require the ability to efficiently estimate performance measures under different parameter settings. One technique, termed rapid learning, aims at enumerating all possible sample paths of such models. There are two necessary conditions for this capability: observability and constructability. This paper shows that the verification of the observability condition is an NP-hard search problem; this result encourages the development of heuristic procedures to validate the applicability of rapid learning. Further implications are also discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018594723463
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...