The Impacts of Worktime Control in Context

Abstract

This article examines the relationships between workers' control over their working time and their well-being, looking at how these relationships differ across a set of health care occupations that are stratified by class, gender, and race (physicians, nurses, emergency medical technicians [EMTs], and certified nursing assistants [CNAs]). Across occupations, workers' ability to control their schedules decreases their job-related stress. The results show that different dimensions of worktime control (WTC) affect workers in different occupations in distinctive ways, offering a corrective to prior work that combines workers who occupy different locations in the system of social stratification. Among nursing assistants-the most socially marginalized group in the study-the relationships between particular aspects of WTC and job stress were distinct from those associations among the other three occupations, reinforcing the importance of examining these relationships in occupationally specific contexts. This kind of comparative perspective illuminates the ways distributions of intangible resources such as WTC both emerge from and reinforce existing patterns of social stratification. The implications of these differences for research and policy are discussed.

Proof of a Conjecture of Graham and Lovasz concerning Unimodality of Coefficients of the Distance Characteristic Polynomial of a Tree

“…Note that Conjecture 1.2 says that the peak location is between 0.5n and roughly 0.5528n . Computations on Sage [10,11] confirm this conjecture for all trees of order at most 20. In this section we show that the peak location is at most 0.6667n for all trees of order n, and at least n−2 1+d for a tree of diameter d and order n. Furthermore, the upper bound we establish is better for a "star-like" tree, that is, when the tree has a high fraction of the number of paths of length 2 in a star (which attains the maximum possible number of paths of length 2).…”

Eigenvalues of the k‐th power of a graph

“…By SageMath [12], we have check that the result holds in (3.11) for n = 5, 6 with − δ ≤ 3. This completes the proof.…”

How to Manipulate Curve Standards: A White Paper for the Black Hat http://bada55.cr.yp.to

“…Our attack is implemented using the Sage computer algebra system [50]. We took 0x5AFEBADA55ECC5AFEBADA55ECC5AFEBADA55ECC5AFEBADA55ECC5AFEBADA55EC as the start value for b and incremented b until we found a curve that meets the public security criteria.…”

“…We now switch from considering rho attacks against arbitrary curves to considering twist attacks against curves with cofactor 1. For a twist attack to fit into 2 50 elliptic-curve operations, the largest prime dividing p+1+t must be below 2 100 , but also the second-largest prime dividing p + 1 + t must be below 2 50 ; see generally [9]. In other words, p + 1 + t must be (2 100 , 2 50 )-semismooth.…”