Multimode biometrics for personal identification

Kulkarni, Sujata

doi:10.1145/1523103.1523176

Cited by 5 publications

(6 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors are grateful to Kulkarni (2006) for a wider discussion of the benefits of this work. He pointed out that the diminished variability resulting from a dynamic approach to workload management may have the ancillary benefit to an equipment manufacturer of making it easier for her to keep to a vendor contract that (say) specifies a minimum number of items for repair over the contract period.…”

Section: Discussionmentioning

confidence: 98%

Allocation Models and Heuristics for the Outsourcing of Repairs for a Dynamic Warranty Population

2008

View full text Add to dashboard Cite

Use policyThe full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-pro t purposes provided that:• a full bibliographic reference is made to the original source • a link is made to the metadata record in DRO • the full-text is not changed in any way The full-text must not be sold in any format or medium without the formal permission of the copyright holders.Please consult the full DRO policy for further details. W e consider a scenario in which a large equipment manufacturer wishes to outsource the work involved in repairing purchased goods while under warranty. Several external service vendors are available for this work. We develop models and analyses to support decisions concerning how responsibility for the warranty population should be divided between them. These also allow the manufacturer to resolve related questions concerning, for example, whether the service capacities of the contracted vendors are sufficient to deliver an effective post-sales service. Static allocation models yield information concerning the proportions of the warranty population for which the vendors should be responsible overall. Dynamic allocation models enable consideration of how such overall workloads might be delivered to the vendors over time in a way which avoids excessive variability in the repair burden. We apply dynamic programming policy improvement to develop an effective dynamic allocation heuristic. This is evaluated numerically and is also used as a yardstick to assess two simple allocation heuristics suggested by static models. A dynamic greedy allocation heuristic is found to perform well. Dividing the workload equally among vendors with different service capacities can lead to serious losses.

show abstract

Section: Discussionmentioning

confidence: 98%

Allocation Models and Heuristics for the Outsourcing of Repairs for a Dynamic Warranty Population

2008

View full text Add to dashboard Cite

show abstract

“…We do not know (any other way of showing) manyone hardness for symmetric determinant. Recently, Kulkarni [Kul07] has observed that symmetric instances are GapL-hard under Turing reductions. The idea is to first use Chinese Remaindering: any determinant can be computed in L if its residues modulo polynomially many primes are available.…”

Section: Computing the Rank For Special Matricesmentioning

confidence: 99%

On the Complexity of Matrix Rank and Rigidity

Mahajan

Sarma

2008

Theory Comput Syst

View full text Add to dashboard Cite

We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In particular, we prove that computing the rank of a class of diagonally dominant matrices is complete for L. We show that computing the permanent and determinant of tridiagonal matrices over Z is in GapNC 1 and is hard for NC 1 . We also initiate the study of computing the rigidity of a matrix: the number of entries that needs to be changed in order to bring the rank of a matrix below a given value. We show that some restricted versions of the problem characterize small complexity classes. We also look at a variant of rigidity where there is a bound on the amount of change allowed. Using ideas from the linear interval equations literature, we show that this problem is NP-hard over Q and that a certain restricted version is NP-complete. Restricting the problem further, we obtain variations which can be computed in PL and are hard for C = L.

show abstract

“…"3 Kulkarni's definition of masking covers both transparent and partial masking, but with unbounded recovery time[32].…”

mentioning

confidence: 99%

Model-based construction and verification of critical systems using composition and partial refinement

Jeffords

Heitmeyer

Archer

et al. 2010

Form Methods Syst Des

View full text Add to dashboard Cite

This article introduces a new model-based method for incrementally constructing critical systems and illustrates its application to the development of fault-tolerant systems. The method relies on a special form of composition to combine software components and a set of proof rules to obtain high confidence of the correctness of the composed system. As in conventional component-based software development, two (or more) components are combined, but in contrast to many component-based approaches used in practice, which combine components consisting of code, our method combines components represented as state machine models. In the first phase of the method, a model is developed of the normal system behavior, and system properties are shown to hold in the model. In the second phase, a model of the required fault-handling behavior is developed and "or-composed" with the original system model to create a fault-tolerant extension which is, by construction, "fully faithful" (every execution possible in the normal system is possible in the fault-tolerant system). To model the fault-handling behavior, the set of states of the normal system model is extended through new state variables and new ranges for some existing state variables, and new fault-handling transitions are defined. Once constructed, the fault-tolerant extension is shown, using a set of property inheritance and compositional proof rules, to satisfy both the overall system properties, typically weakened, and selected fault-tolerance properties. These rules can often be used to verify the properties automatically. To provide a formal foundation for the method, formal notions of or-composition, partial refinement, fault-tolerant extension, and full faithfulness are introduced. To demonstrate and validate the method, we describe its application to a real-world, fault-tolerant avionics system.

show abstract

Multimode biometrics for personal identification

Cited by 5 publications

References 0 publications

Allocation Models and Heuristics for the Outsourcing of Repairs for a Dynamic Warranty Population

Allocation Models and Heuristics for the Outsourcing of Repairs for a Dynamic Warranty Population

On the Complexity of Matrix Rank and Rigidity

Model-based construction and verification of critical systems using composition and partial refinement

Contact Info

Product

Resources

About