Differential and single group validity, and test fairness, and test utility : deposition of Frank L. Schmidt, Ph.D. in Charles H. Boles et al vs. Union Camp Corporation et al.

Mode of access: Internet.

Vision Working Group report and scenarios /

"July 2010."

Comparison of employment trends for women and minorities in forty-five selected Federal agencies, 1980 /

"July 1980."

The new psychology for leadership, based on researches in group dynamics and human relations,

Mode of access: Internet.

Group leadership in the present emergency; a study document addressed to board and committee members, executives, supervisors, group leaders, and other persons actively related to agencies engaged in recreation and informal education,

Mode of access: Internet.

Progress of women and minorities in the Illinois workforce /

Title from cover.

The effects of group composition and work situation upon peer leadership /

"Funded by the Office of Naval Research, Group Psychology Programs, under contract no. N00014-67-A-0181-0013, NR 170-719/7-29-68 (Code 452)."

The 1986 women and minorities in Maine's labor force /

Cover title.

Fundamental Rights and Reverse Discrimination

Reverse discrimination – whereby member states may treat their own nationals worse than nationals of other member states by invoking a “purely internal situation” in which European law does not apply – has long been a problem within the European Economic Community turned European Union. Using as a touchstone the Zambrano case, to be decided shortly, this paper argues that introducing citizenship alters the status of individuals vis-à-vis their governments, implies equality of treatment among citizens, and should eliminate reverse discrimination. Raising examples from the United States and Canada, I show how the introduction of federal rights empowered individuals and redrew the relationship between the governments of the center and the units. Citizenship limits the power of member states to treat their own nationals worse than nationals of other member states. This does not eliminate the tension between center and unit (or federal and regional; EU and member state) law but should give extra weight to former over the latter. Jurisdictional issues remain, but the rise of Union citizenship means that EU law should grow to encompass any right protected or promoted by shared citizenship.

Elliptic curves, group law, and efficient computation

This thesis is about the derivation of the addition law on an arbitrary elliptic curve and efficiently adding points on this elliptic curve using the derived addition law. The outcomes of this research guarantee practical speedups in higher level operations which depend on point additions. In particular, the contributions immediately find applications in cryptology. Mastered by the 19th century mathematicians, the study of the theory of elliptic curves has been active for decades. Elliptic curves over finite fields made their way into public key cryptography in late 1980’s with independent proposals by Miller [Mil86] and Koblitz [Kob87]. Elliptic Curve Cryptography (ECC), following Miller’s and Koblitz’s proposals, employs the group of rational points on an elliptic curve in building discrete logarithm based public key cryptosystems. Starting from late 1990’s, the emergence of the ECC market has boosted the research in computational aspects of elliptic curves. This thesis falls into this same area of research where the main aim is to speed up the additions of rational points on an arbitrary elliptic curve (over a field of large characteristic). The outcomes of this work can be used to speed up applications which are based on elliptic curves, including cryptographic applications in ECC. The aforementioned goals of this thesis are achieved in five main steps. As the first step, this thesis brings together several algebraic tools in order to derive the unique group law of an elliptic curve. This step also includes an investigation of recent computer algebra packages relating to their capabilities. Although the group law is unique, its evaluation can be performed using abundant (in fact infinitely many) formulae. As the second step, this thesis progresses the finding of the best formulae for efficient addition of points. In the third step, the group law is stated explicitly by handling all possible summands. The fourth step presents the algorithms to be used for efficient point additions. In the fifth and final step, optimized software implementations of the proposed algorithms are presented in order to show that theoretical speedups of step four can be practically obtained. In each of the five steps, this thesis focuses on five forms of elliptic curves over finite fields of large characteristic. A list of these forms and their defining equations are given as follows: (a) Short Weierstrass form, y2 = x3 + ax + b, (b) Extended Jacobi quartic form, y2 = dx4 + 2ax2 + 1, (c) Twisted Hessian form, ax3 + y3 + 1 = dxy, (d) Twisted Edwards form, ax2 + y2 = 1 + dx2y2, (e) Twisted Jacobi intersection form, bs2 + c2 = 1, as2 + d2 = 1, These forms are the most promising candidates for efficient computations and thus considered in this work. Nevertheless, the methods employed in this thesis are capable of handling arbitrary elliptic curves. From a high level point of view, the following outcomes are achieved in this thesis. - Related literature results are brought together and further revisited. For most of the cases several missed formulae, algorithms, and efficient point representations are discovered. - Analogies are made among all studied forms. For instance, it is shown that two sets of affine addition formulae are sufficient to cover all possible affine inputs as long as the output is also an affine point in any of these forms. In the literature, many special cases, especially interactions with points at infinity were omitted from discussion. This thesis handles all of the possibilities. - Several new point doubling/addition formulae and algorithms are introduced, which are more efficient than the existing alternatives in the literature. Most notably, the speed of extended Jacobi quartic, twisted Edwards, and Jacobi intersection forms are improved. New unified addition formulae are proposed for short Weierstrass form. New coordinate systems are studied for the first time. - An optimized implementation is developed using a combination of generic x86-64 assembly instructions and the plain C language. The practical advantages of the proposed algorithms are supported by computer experiments. - All formulae, presented in the body of this thesis, are checked for correctness using computer algebra scripts together with details on register allocations.

Crowd counting using group tracking and local features

In public venues, crowd size is a key indicator of crowd safety and stability. In this paper we propose a crowd counting algorithm that uses tracking and local features to count the number of people in each group as represented by a foreground blob segment, so that the total crowd estimate is the sum of the group sizes. Tracking is employed to improve the robustness of the estimate, by analysing the history of each group, including splitting and merging events. A simplified ground truth annotation strategy results in an approach with minimal setup requirements that is highly accurate.