Unsupervised domain adaptive (UDA) person re-identification (re-ID) is a challenging task due to the missing of labels for target data. To handle this problem, some recent works adopt clustering algorithms off-line generate pseudo labels, which can then be used as supervision signal on-line feature learning in domain. However, generated often contain lots noise that significantly hinders discri...

We introduce skipping refinement, a new notion of correctness for reasoning about optimized reactive systems. Reasoning about reactive systems using refinement involves defining an abstract, highlevel specification system and a concrete, low-level implementation system. One then shows that every behavior allowed by the implementation is also allowed by the specification. Due to the difference i...

We propose a mechanism for the vertical refinement of bigraphical reactive systems, based upon a mechanism for limiting observations and utilising the underlying categorical structure of bigraphs. We present a motivating example to demonstrate that the proposed notion of refinement is sensible with respect to the theory of bigraphical reactive systems; and we propose a sufficient condition for ...

Counterexample-guided abstraction refinement (CEGAR) is a commonly-used approach for the automatic construction of an abstract model of a given program. It uses information learned from infeasible error paths to guide the verification process. We address the problem of selecting which information to learn from a given infeasible error path. Previously, we presented a method that can extract a s...

This paper is a thourough survey on the state of the art of action refinement in process algebra, with a historical perspective. (To appear as Chapter XVI of the Handbook of Process Algebra, Elsevier Science, 1999.) 1. Università di Bologna, Dipartimento di Scienze dell’Informazione, Mura Anteo Zamboni 7, 40127 Bologna, Italy. E-mail: [email protected]. 2. University of Twente, Department of...

English) In a policy-based system management, a policy refinement process is requiredto translate abstract policies, which are specified by human, into enforceablepolicies, which are enforced by machine.However, a manual policy refinement process imposes some problems.The first problem is that it requires expert knowledge to perform the policyrefinement process. The second p...

All Rights Reserved 2000 ii For my parents iv Acknowledgements I am very grateful to my advisor, Professor Jonathan Goodman, who did a great job in helping me to find a lot of directions (including directions for mesh refinement, financial help, job). It has been a very enjoyable experience to work and learn from Jonathan. Thanks to Professor Olof Widlund for his useful suggestions on this work...

An adaptive mesh refinement procedure for wrinkling prediction analyses is presented. First the critical values are determined using Hutchinson’s bifurcation functional. A wrinkling risk factor is then defined and used to determined areas of potential wrinkling risk. Finally, a mesh refinement is operated.

Level set functions are widely used for expressing implicit surfaces. In some cases, people are more interested in solution near the surface while global information is also required. The aim of this work is the development of an automatic, adaptive mesh refinement strategy for level set functions. Level set function is defined in adaptive space mesh grid with finer grids close to the surface. ...

This article discusses mutation testing strategies in the context of refinement. Here, a novel generalization of mutation testing techniques is presented to be applied to contracts ranging from formal specifications to programs. It is demonstrated that refinement and its dual abstraction are the key notions leading to a precise and yet simple theory of mutation testing. The refinement calculus ...