@conference {17789,
	title = {Approximation results for probabilistic survivability},
	booktitle = {Multi-Agent Security and Survivability, 2005 IEEE 2nd Symposium on},
	year = {2005},
	month = {2005/08//},
	pages = {1 - 10},
	abstract = {As multiagent systems (MASs) are increasingly used in industrial applications, the need to make them more robust and resilient against disruption increases dramatically. The author has developed a probabilistic model (assuming complete ignorance of dependencies between node failures) of survivability based on deploying each agent in a MAS on one or more nodes. Finding a deployment that maximizes survivability is highly intractable for two reasons: firstly, computing the survivability of any deployment is intractable, and secondly, going through an exponential number of deployments to find the best one adds another layer of intractability. In this paper, we study what happens when node failures are independent. We show that computing survivability in this environment is still intractable. We propose various heuristics to compute the survivability of a given deployment. We have implemented and tested all these heuristics. We report on the advantages and disadvantages of different heuristics in different environmental settings.},
	keywords = {application;, computing;, failure;, fault, heuristic, heuristics, industrial, model;, multi-agent, multiagent, node, probabilistic, probability;, programming;, survivability;, system;, systems;, testing;, tolerant},
	doi = {10.1109/MASSUR.2005.1507042},
	author = {Zhang,Y. and Manister,E. and Kraus,S. and V.S. Subrahmanian}
}
@conference {14845,
	title = {Using the inner-distance for classification of articulated shapes},
	booktitle = {Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on},
	volume = {2},
	year = {2005},
	month = {2005/06//},
	pages = {719 - 726 vol. 2 - 719 - 726 vol. 2},
	abstract = {We propose using the inner-distance between landmark points to build shape descriptors. The inner-distance is defined as the length of the shortest path between landmark points within the shape silhouette. We show that the inner-distance is articulation insensitive and more effective at capturing complex shapes with part structures than Euclidean distance. To demonstrate this idea, it is used to build a new shape descriptor based on shape contexts. After that, we design a dynamic programming based method for shape matching and comparison. We have tested our approach on a variety of shape databases including an articulated shape dataset, MPEG7 CE-Shape-1, Kimia silhouettes, a Swedish leaf database and a human motion silhouette dataset. In all the experiments, our method demonstrates effective performance compared with other algorithms.},
	keywords = {articulated, CE-Shape-1, classification;, database;, databases;, dataset;, descriptor;, dynamic, human, image, inner-distance;, Kimia, landmark, leaf, matching;, MOTION, MPEG7, points;, programming;, SHAPE, silhouette, silhouette;, Swedish, visual},
	doi = {10.1109/CVPR.2005.362},
	author = {Ling,H. and Jacobs, David W.}
}
@conference {13191,
	title = {VidMAP: video monitoring of activity with Prolog},
	booktitle = {Advanced Video and Signal Based Surveillance, 2005. AVSS 2005. IEEE Conference on},
	year = {2005},
	month = {2005/09//},
	pages = {224 - 229},
	abstract = {This paper describes the architecture of a visual surveillance system that combines real time computer vision algorithms with logic programming to represent and recognize activities involving interactions amongst people, packages and the environments through which they move. The low level computer vision algorithms log primitive events of interest as observed facts, while the higher level Prolog based reasoning engine uses these facts in conjunction with predefined rules to recognize various activities in the input video streams. The system is illustrated in action on a multi-camera surveillance scenario that includes both security and safety violations.},
	keywords = {activities, algorithms;, based, Computer, computerised, engine;, higher, image, level, Logic, monitoring;, multicamera, processing;, programming;, Prolog, PROLOG;, reasoning, recognition;, scenario;, signal, streaming;, streams;, Surveillance, surveillance;, system;, video, VISION, vision;, visual},
	doi = {10.1109/AVSS.2005.1577271},
	author = {Shet,V. D and Harwood,D. and Davis, Larry S.}
}
@article {17798,
	title = {Optimal models of disjunctive logic programs: semantics, complexity, and computation},
	journal = {Knowledge and Data Engineering, IEEE Transactions on},
	volume = {16},
	year = {2004},
	month = {2004/04//},
	pages = {487 - 503},
	abstract = {Almost all semantics for logic programs with negation identify a set, SEM(P), of models of program P, as the intended semantics of P, and any model M in this class is considered a possible meaning of P with regard to the semantics the user has in mind. Thus, for example, in the case of stable models [M. Gelfond et al., (1988)], choice models [D. Sacca et al., (1990)], answer sets [M. Gelfond et al., (1991)], etc., different possible models correspond to different ways of "completing" the incomplete information in the logic program. However, different end-users may have different ideas on which of these different models in SEM(P) is a reasonable one from their point of view. For instance, given SEM(P), user U<sub>1</sub> may prefer model M<sub>1</sub> isin;SEM(P) to model M<sub>2</sub> isin;SEM(P) based on some evaluation criterion that she has. We develop a logic program semantics based on optimal models. This semantics does not add yet another semantics to the logic programming arena - it takes as input an existing semantics SEM(P) and a user-specified objective function Obj, and yields a new semantics Opt(P)_ sube; SEM(P) that realizes the objective function within the framework of preferred models identified already by SEM(P). Thus, the user who may or may not know anything about logic programming has considerable flexibility in making the system reflect her own objectives by building "on top" of existing semantics known to the system. In addition to the declarative semantics, we provide a complete complexity analysis and algorithms to compute optimal models under varied conditions when SEM(P) is the stable model semantics, the minimal models semantics, and the all-models semantics.},
	keywords = {complexity;, computational, disjunctive, function;, knowledge, LANGUAGE, Logic, minimal, model, nonmonotonic, objective, optimisation;, OPTIMIZATION, problems;, program, Programming, programming;, reasoning;, representation;, semantics;, stable, user-specified},
	isbn = {1041-4347},
	doi = {10.1109/TKDE.2004.1269672},
	author = {Leone,N. and Scarcello,F. and V.S. Subrahmanian}
}
@article {12129,
	title = {Eight lessons learned during COTS-based systems maintenance},
	journal = {Software, IEEE},
	volume = {20},
	year = {2003},
	month = {2003/10//sept},
	pages = {94 - 96},
	abstract = {To make better decisions relative to CBSs, we need empirical knowledge. To gain this knowledge, we must more fully understand the lifecycle processes people use when harnessing COTS packages. The initial findings reported here are but the first step in our attempts to capture this empirical knowledge. We plan to continue collecting data and investigating the phenomenology of COTS-based systems.},
	keywords = {COTS, COTS-based, cycle, life, lifecycle, Maintenance, maintenance;, object-oriented, packages;, phase;, processes;, programming;, reusability;, software, systems},
	isbn = {0740-7459},
	doi = {10.1109/MS.2003.1231161},
	author = {Reifer,D.J. and Basili, Victor R. and Boehm,B.W. and Clark,B.}
}
@article {14886,
	title = {Lambertian reflectance and linear subspaces},
	journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on},
	volume = {25},
	year = {2003},
	month = {2003/02//},
	pages = {218 - 233},
	abstract = {We prove that the set of all Lambertian reflectance functions (the mapping from surface normals to intensities) obtained with arbitrary distant light sources lies close to a 9D linear subspace. This implies that, in general, the set of images of a convex Lambertian object obtained under a wide variety of lighting conditions can be approximated accurately by a low-dimensional linear subspace, explaining prior empirical results. We also provide a simple analytic characterization of this linear space. We obtain these results by representing lighting using spherical harmonics and describing the effects of Lambertian materials as the analog of a convolution. These results allow us to construct algorithms for object recognition based on linear methods as well as algorithms that use convex optimization to enforce nonnegative lighting functions. We also show a simple way to enforce nonnegative lighting when the images of an object lie near a 4D linear space. We apply these algorithms to perform face recognition by finding the 3D model that best matches a 2D query image.},
	keywords = {2D, 4D, 9D, analog;, analytic, characterization;, convex, convolution, distant, functions;, harmonics;, image, image;, intensities;, Lambertian, light, lighting, linear, methods;, nonnegative, normals;, object, optimization;, programming;, query, recognition;, reflectance;, reflectivity;, set;, sources;, space;, spherical, subspace;, subspaces;, surface},
	isbn = {0162-8828},
	doi = {10.1109/TPAMI.2003.1177153},
	author = {Basri,R. and Jacobs, David W.}
}
@conference {14839,
	title = {Error propagation in full 3D-from-2D object recognition},
	booktitle = {Computer Vision and Pattern Recognition, 1994. Proceedings CVPR {\textquoteright}94., 1994 IEEE Computer Society Conference on},
	year = {1994},
	month = {1994/06//},
	pages = {892 - 898},
	abstract = {Robust recognition systems require a careful understanding of the effects of error in sensed features. Error in these image features results in uncertainty in the possible image location of each additional model feature. We present an accurate, analytic approximation for this uncertainty when model poses are based on matching three image and model points. This result applies to objects that are fully three-dimensional, where past results considered only two-dimensional objects. Further, we introduce a linear programming algorithm to compute this uncertainty when poses are based on any number of initial matches},
	keywords = {3D-from-2D, algorithm;, error, extraction;, feature, features;, handling;, image, initial, linear, matches;, object, Programming, programming;, propagation;, recognition, recognition;, robust, sequences;, systems;, Uncertainty, uncertainty;},
	doi = {10.1109/CVPR.1994.323920},
	author = {Alter,T. D. and Jacobs, David W.}
}
@conference {14896,
	title = {Finding structurally consistent motion correspondences},
	booktitle = {Pattern Recognition, 1994. Vol. 1 - Conference A: Computer Vision Image Processing., Proceedings of the 12th IAPR International Conference on},
	volume = {1},
	year = {1994},
	month = {1994/10//},
	pages = {650 -653 vol.1 - 650 -653 vol.1},
	abstract = {Much work on deriving scene structure and motion from features assumes as input a set of tracked image features that share a common 3D motion. Producing this input requires segmenting independent motions, and detecting image features that do not correspond to 3D features, originating instead, for example in occlusion boundaries or specularities. We derive a linear program that tells when a set of tracked points might have come from 3D points that share a single motion, assuming affine motion and bounded error. We can also use linear programming to place conservative bounds on the structure of the scene that corresponds to tracked points. We implement and test this algorithm on real images},
	keywords = {3D, boundaries;, common, consistent, correspondences;, estimation;, features;, image, independent, linear, MOTION, motion;, occlusion, programming;, scene, segmentation;, specularities;, structurally, structure;, tracked},
	doi = {10.1109/ICPR.1994.576388},
	author = {Jacobs, David W. and Chennubhotla,C.}
}
@conference {14881,
	title = {Segmenting independently moving, noisy points},
	booktitle = {Motion of Non-Rigid and Articulated Objects, 1994., Proceedings of the 1994 IEEE Workshop on},
	year = {1994},
	month = {1994/11//},
	pages = {96 - 103},
	abstract = {There has been much work on using point features tracked through a video sequence to determine structure and motion. In many situations, to use this work, we must first isolate subsets of points that share a common motion. This is hard because we must distinguish between independent motions and apparent deviations from a single motion due to noise. We propose several methods of searching for point-sets with consistent 3D motions. We analyze the potential sensitivity of each method for detecting independent motions, and experiment with each method on a real image sequence},
	keywords = {3D, common, consistent, estimation;, features;, image, independently, linear, MOTION, motion;, moving, noisy, point, points;, programming;, real, segmentation;, sequence;, sequences;, video},
	doi = {10.1109/MNRAO.1994.346249},
	author = {Jacobs, David W. and Chennubhotla,C.}
}
