All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher.

This paper investigates the local labor supply effects of changes to the minimum wage by examining the response of low-skilled immigrants' location decisions. Canonical models emphasize the importance of labor mobility when evaluating the employment effects of the minimum wage; yet few studies address this outcome directly. Low-skilled immigrant populations shift toward labor markets with stagn...

The annotation of video tampering dataset is a boring task that takes a lot of manpower and financial resources. At present, there is no published literature which is capable to improve the annotation efficiency of forged videos. We presented a computer-aided annotation method for video tampering dataset in this paper. This annotation method can be utilized to label the frames of forged video s...

In this paper, we study the robustness of a groupdelay-based method for determining the instants of significant excitation in speech signals. These instants correspond to the instants of glottal closure for voiced speech. The method uses the properties of the global phase characteristics of minimum phase signals. Robustness of the method against noise and distortion is due to the fact that the ...

It is shown that strict resolutions of Fn by F–limit groups have length bounded by 3n. As an application we show that the abelian analysis lattice of a limit group L has height bounded by 3 rk(L).

We prove an O(n(k + 1)1/3) upper bound for planar k-sets. This is the first considerable improvement on this bound after its early solution approximately 27 years ago. Our proof technique also applies to improve the current bounds on the combinatorial complexities of k-levels in the arrangement of line segments, k convex polygons in the union of n lines, parametric minimum spanning trees, and p...

In this paper we consider the three-dimensional layout of hypercube networks. Namely, we study the problem of laying hypercube networks out on the three-dimensional grid with the properties that all nodes are represented as rectangular slices and lie on two opposite sides of the bounding box of the layout volume. We present both a lower bound and a layout method providing an upper bound on the ...

We classify the finite dimensional indecomposable sl(m/n)-modules with at least a typical or singly atypical primitive weight. We do this classification not only for weight modules, but also for generalized weight modules. We obtain that such a generalized weight module is simply a module obtained by “linking” sub-quotient modules of generalized Kac-modules. By applying our results to sl(m/1), ...

...............................................................................................................................iii Acknowledgements.............................................................................................................. iv Table of