Training an object class detector typically requires a large set of images annotated with bounding-boxes, which is expensive and time consuming to create. We propose novel approach to annotate object locations which can substantially reduce annotation time. We first track the eye movements of annotators instructed to find the object and then propose a technique for deriving object bounding-boxe...

A formalism to determine coexistence points by means of Monte Carlo simulations is presented. The general idea of the method is to perform a simulation simultaneously in several unconnected boxes which can exchange particles. At equilibrium, most of the boxes will be occupied by a homogeneous phase. The compositions of these boxes yield coexisting points on the binodal. However, since the overa...

This paper has studied the game rules, victory or defeat rules, and the key techniques of Dots-and-Boxes, and has designed and realized one 6×6 Dots-and-Boxes based on the representing method of Strings and Coins. By corresponding Dots-and-Boxes chessboard to strings and coins chessboard, the proposed representing method is not only intuitive and convenient in chessboard representation, but als...

Resilient substitution boxes (S-boxes) with high nonlinearity are important cryptographic primitives in the design of certain encryption algorithms. There are several trade-offs between the most important cryptographic parameters and their simultaneous optimization is regarded as a difficult task. In this paper we provide a construction technique to obtain resilient S-boxes with so-called stric...

This paper deals with the problem of approximating a convex polytope in any finite dimension by a collection of (hyper)boxes. More exactly, given a polytope P by a system of linear inequalities, we look for two collections I and E of boxes with non-overlapping interiors such that the union of all boxes in I is contained in P and the union of all boxes in E contains P . We propose and test sever...

The Mycobacterium tuberculosis oriC (the origin of chromosomal replication) region contains 13 non-perfect DnaA boxes. The M. tuberculosis initiator protein, DnaA, was overexpressed in Escherichia coli as a soluble His-tagged fusion protein. The purified protein His6MtDnaA was investigated for its binding properties to DnaA boxes from the oriC region. Gel retardation demonstrated that the DnaA ...

The control of Vibrio cholerae phoBR expression by PhoB involves its binding to Pho boxes at -35 (box 1), -60 (box 2), and -80 (box 3) from the putative phoB translation start site. These loci were located in the sense (box 1) and antisense (boxes 2 and 3) strands of the phoBR regulatory region, and PhoB binds to these individual boxes with distinct affinities. Fusions of sequences containing d...

We deene a notion of equivalence for designs containing black boxes. This notion is applicable to both gate-level designs, as well as designs operating on integer variables. Using this notion, we describe a sound and complete methodology for optimizing designs containing black boxes, i.e. components whose functionality is not known; these arise naturally in the course of hierarchical design.

This report describes systems which combine the structural and reactive motifs of a dinucleating terpyridine-aminomethylpyridine ligand, L, with the coordination preferences and flexibilities of particular divalent metal ions to form a series of closely related box structures in a deliberate fashion. The ligand also produces unprecedented decanickel wheel complexes. Halogen to aromatic hydrogen...

Abstract. Call the set S1 × · · · × St t–dimensional m–box if |Si| = m for every i = 1, . . . , t. Let Rt(m, r) be the smallest integer R such that for every r–coloring of t–fold cartesian product of [R] one can find a monochromatic t–dimensional m–box. We give a lower and an upper bound for Rt(m, r). We also consider the discrepancy problem connected to this set-system. Among other bounds we p...