Results 1  10
of
67
Counterexampleguided Abstraction Refinement
, 2000
"... We present an automatic iterative abstractionrefinement methodology in which the initial abstract model is generated by an automatic analysis of the control structures in the program to be verified. Abstract models may admit erroneous (or "spurious") counterexamples. We devise new symb ..."
Abstract

Cited by 848 (71 self)
 Add to MetaCart
We present an automatic iterative abstractionrefinement methodology in which the initial abstract model is generated by an automatic analysis of the control structures in the program to be verified. Abstract models may admit erroneous (or "spurious") counterexamples. We devise new symbolic techniques which analyze such counterexamples and refine the abstract model correspondingly.
personal communication
, 1997
"... these abstracts from the Eighteenth Annual Scientific Meeting may not present completed work nor were they formally peerreviewed for technical content. Individuals wishing to reference or quote from these abstracts in whole or part should obtain the author's permission. Abstracts were opticall ..."
Abstract

Cited by 51 (2 self)
 Add to MetaCart
(Show Context)
these abstracts from the Eighteenth Annual Scientific Meeting may not present completed work nor were they formally peerreviewed for technical content. Individuals wishing to reference or quote from these abstracts in whole or part should obtain the author's permission. Abstracts were optically scanned and then edited for entry into this compilation. But since the process is not perfect, errors may have been introduced, for which we apologize.
RELAXATIONBASED COARSENING AND MULTISCALE GRAPH ORGANIZATION
"... In this paper we generalize and improve the multiscale organization of graphs by introducing a new measure that quantifies the “closeness” between two nodes. The calculation of the measure is linear in the number of edges in the graph and involves just a small number of relaxation sweeps. A similar ..."
Abstract

Cited by 14 (8 self)
 Add to MetaCart
(Show Context)
In this paper we generalize and improve the multiscale organization of graphs by introducing a new measure that quantifies the “closeness” between two nodes. The calculation of the measure is linear in the number of edges in the graph and involves just a small number of relaxation sweeps. A similar notion of distance is then calculated and used at each coarser level. We demonstrate the use of this measure in multiscale methods for several important combinatorial optimization problems and discuss the multiscale graph organization.
Generalization by Neural Networks
 IEEE Trans. on Knowledge and Data Eng
, 1992
"... Neural networks have traditionally been applied to recognition problems, and most learning algorithms are tailored to those problems. We discuss the requirements of learning for generalization, where the traditional methods based on gradient descent have limited success. We present a new stochast ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
(Show Context)
Neural networks have traditionally been applied to recognition problems, and most learning algorithms are tailored to those problems. We discuss the requirements of learning for generalization, where the traditional methods based on gradient descent have limited success. We present a new stochastic learning algorithm based on simulated annealing in weight space. We verify the convergence properties and feasibility of the algorithm. We also describe an implementation of the algorithm and validation experiments. 1. Introduction Neural networks are being applied to a wide variety of applications from speech generation[1], to handwriting recognition[2]. Last decade has seen great advances in design of neural networks for a class of problems called recognition problems, and in design of learning algorithms[35, 57]. The learning of weights for neural network for many recognition problem is no longer a difficult task. However, designing a neural network for generalization problem is ...
3D Reconstruction of a Smooth Articulated Trajectory from a Monocular Image Sequence ∗
"... An articulated trajectory is defined as a trajectory that remains at a fixed distance with respect to a parent trajectory. In this paper, we present a method to reconstruct an articulated trajectory in three dimensions given the two dimensional projection of the articulated trajectory, the 3D parent ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
(Show Context)
An articulated trajectory is defined as a trajectory that remains at a fixed distance with respect to a parent trajectory. In this paper, we present a method to reconstruct an articulated trajectory in three dimensions given the two dimensional projection of the articulated trajectory, the 3D parent trajectory, and the camera pose at each time instant. This is a core challenge in reconstructing the 3D motion of articulated structures such as the human body because endpoints of each limb form articulated trajectories. We simultaneously apply activityindependent spatial and temporal constraints, in the form of fixed 3D distance to the parent trajectory and smooth 3D motion. There exist two solutions that satisfy each instantaneous 2D projection and articulation constraint (a ray intersects a sphere at up to two locations) and we show that resolving this ambiguity by enforcing smoothness is equivalent to solving a binary quadratic programming problem. A geometric analysis of the reconstruction of articulated trajectories is also presented and a measure of the reconstructibility of an articulated trajectory is proposed. 1.
Finding syntactic similarities between XML documents
 In Proceedings of the International Conference on Database and Expert Systems Applications (DEXA
, 2006
"... � � � � � � � �Æ � � � � � � � � � � Categories and Subject Descriptors ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
� � � � � � � �Æ � � � � � � � � � � Categories and Subject Descriptors
Multiobjective network design for realistic traffic models
 In Proceedings of generic and evolutionary computation conference (GECCO’07
, 2007
"... Network topology design problems find application in several real life scenarios. However, most designs in the past either optimize for a single criterion like delay or assume simplistic traffic models like Poisson. Such assumptions make the solutions inapplicable in the practical world. In this pap ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
(Show Context)
Network topology design problems find application in several real life scenarios. However, most designs in the past either optimize for a single criterion like delay or assume simplistic traffic models like Poisson. Such assumptions make the solutions inapplicable in the practical world. In this paper, we formulate and solve a multiobjective network topology design problem for a realistic Internet traffic model which is assumed to be self similar. We optimize for the average packet delivery delay and network layout cost to construct realistic network topologies. We present a multiobjective evolutionary algorithm (MOEA) to obtain the diverse nearoptimal network topologies. For fair comparison, we design a multiobjective deterministic heuristic based on branch exchange – we call the heuristic Pareto Branch Exchange (PBE). We empirically show that the MOEA used performs well for real networks of various sizes, and generated topologies are quite different with significantly larger delays for the self similar traffic model.
Multicriteria network design using evolutionary algorithm
 Proc. Genetic and Evolutionary Computations Conference (GECCO), Lecture Notes in Computer Sciences
, 2003
"... Abstract. In this paper, we revisit a general class of multicriteria multiconstrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A major challenge to solving such problems is to capture possibly all the (representative) equivalent and diverse ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper, we revisit a general class of multicriteria multiconstrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A major challenge to solving such problems is to capture possibly all the (representative) equivalent and diverse solutions. In this work, we formulate, without loss of generality, a bicriteria bi constrained communication network topological design problem. Two of the primary objectives to be optimized are network delay and cost subject to satisfaction of reliability and flowconstraints. This is a NPhard problem so we use a hybrid approach (for initialization of the population) along with EA. Furthermore, the twoobjective optimal solution front is not known a priori. Therefore, we use a multiobjective EA which produces diverse solution space and monitors convergence; the EA has been demonstrated to work effectively across complex problems of unknown nature. We tested this approach for designing networks of different sizes and found that the approach scales well with larger networks. Results thus obtained are compared with those obtained by two traditional approaches namely, the exhaustive search and branch exchange heuristics. 1
Manytoone boundary labeling
 In Proc. Asia Pacific Symposium on Information Visualisation (APVIS2007), IEEE
, 2007
"... In boundary labeling, each point site is uniquely connected to a label placed on the boundary of an enclosing rectangle by a leader, which may be a rectilinear or straight line segment. To our knowledge, all the results reported in the literature for boundary labeling deal with the socalled oneto ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
(Show Context)
In boundary labeling, each point site is uniquely connected to a label placed on the boundary of an enclosing rectangle by a leader, which may be a rectilinear or straight line segment. To our knowledge, all the results reported in the literature for boundary labeling deal with the socalled onetoone boundary labeling, i.e., different sites are labelled differently. In certain applications of boundary labeling, however, more than one site may be required to be connected to a common label. In this case, the presence of crossings among leaders often becomes inevitable. Minimizing the total number of crossings in boundary labeling becomes a critical design issue as crossing is often regarded as the main source of confusion in visualization. In this paper, we consider the crossing minimization problem for multisitetoonelabel boundary labeling, i.e., finding the placements of labels and leaders such that the total number of crossings among leaders is minimized. We show the crossing minimization problem to be NPcomplete under certain oneside and twoside labeling schemes. Subsequently, approximation algorithms or heuristics are derived for the above intractable problems.
Resourceefficient routing and scheduling of timeconstrained networkonchip communication
 In DSD’06, Proc
, 2006
"... Abstract. Networkonchipbased multiprocessor systemsonchip are considered as future embedded systems platforms. One of the steps in mapping an application onto such a parallel platform involves scheduling the communication on the networkonchip. This paper presents different scheduling strategies ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Networkonchipbased multiprocessor systemsonchip are considered as future embedded systems platforms. One of the steps in mapping an application onto such a parallel platform involves scheduling the communication on the networkonchip. This paper presents different scheduling strategies that minimize resource usage by exploiting all scheduling freedom offered by networksonchip. It also introduces a technique to take the dynamism in applications into account when scheduling the communication of an application on the networkonchip while minimizing the resource usage. Our experiments show that resourceutilization is improved when compared to existing techniques. 1.