In this work, we mostly concentrate on the hidden shift problem for non-injective functions. It is worthwhile to know that the query complexity of the non-injective hidden shift problem is exponential in the worst case by the well known bounds on the unstructured search problem. Hence, we can make this problem more tractable by imposing additional constraints on the problem. Perhaps the first constraint that comes to mind is to address the average case problem. In this work, we show that the average case non-injective hidden shift problem can be reduced to the injective hidden shift problem by giving one such reduction. The reduction is based on a tool we developed called injectivization. The result is strong in the sense that the underlying group can be any finite group and that the non-injective functions for which we have defined the hidden shift problem can have range in an arbitrary finite set. Using this tool, we simplify the main result of a recent paper by about the hidden shift problem for Boolean-valued functions by reducing that problem to Simon's problem. They also posed an open question which is subject to personal interpretation. We answer the seemingly most general interpretation of the question. However, we use our own techniques in doing so (the authors ask if their techniques can be used for addressing that problem). Another constraint that one can consider is to have a promise on the structure of the functions. In this work we consider the hidden shift problem for c-almost generalized bent functions. A class of functions which we defined that includes the generalized bent functions. Then we turn our attention toward the generalized hidden shift problem which is easier than injective hidden shift problem and hence more tractable. We state some of our observations about this problem. Finally we show that the average classical query complexity of the non-injective hidden shift problem over groups of form (Z/mZ)^n when m is a constant is exponential, which also immediately implies that the classical average query complexity of the non-injective hidden shift problem is exponential. We also show that the worst-case classical query complexity of the generalized injective hidden shift problem over the same group is high, which implies that the classical query complexity of the hidden shift problem is high.

Scientific symbol in title. / Thesis (Ph. D.)--University of Hawaii at Manoa, 1995. / Includes bibliographical references (leaves 118-124). / Microfiche. / xi, 124 leaves, bound ill. 29 cm

Thesis (Ph. D.)--University of Hawaii at Manoa, 2004. / Includes bibliographical references. / Also available by subscription via World Wide Web / xxxiii, 335 leaves, bound ill. 29 cm

Increasingly, it is being recognized that the fatigue associated with the irregular duty schedules of pilots and doctors can have a negative impact on safety-critical flight and clinical operations. The studies of this thesis were designed to examine the impact of irregular duty schedules on commercial pilots' and anaesthetic registrars' sleep/wake behaviiour and operational performance (i.e., complex decision-making). / Thesis (PhD)--University of South Australia, 2007.

Expectations from industry and the community ensure that we live in a 24-hour society. Increased demand for flexibility, capital utilisation and competition have initiated or extended shiftwork operations in many industry sectors such as mining, transport, defence, healthcare, manufacturing and security. The most common problems reported by shiftworkers are disturbed sleep and sleepiness. From a biological perspective this is not surprising because shiftworkers are often required to work at times when their mind and body are driven toward sleep. Shiftworkers may therefore be required to attempt sleep during the day; a time at which their mind and body are programmed to be awake and active. When sufficient recovery doesn't occur regularly, sleepiness and fatigue can accumulate. Traditionally, shiftwork and the work-related fatigue that it can create have been 'managed' by limiting the length of shifts and total number of hours worked per week, month or year. However, this approach fails to acknowledge key factors such as the time-of-day of work. Thus, the aim of this thesis is to provide the background, components and preliminary validations of a model to assess hours-of-work and fatigue in a scientifically appropriate manner. / thesis (PhD)--University of South Australia, 1999.

Generating employee rosters on a 24 hour, 7 day per week basis taking into account fluctuating demand for employees, employee skills, working conditions, training and employee preferences, while ensuring efficiency and equity between the employees is a very difficult task due to the very large number of possible rostering combinations available. The research done in this thesis sets to solve this exact problem for CS Energy's Swanbank Power Station located in Queensland, Australia. / thesis (PhDMathematics)--University of South Australia, 2002.

Thesis (M.S.)--Ohio University, June, 2002. / Title from PDF t.p. Includes bibliographical references (leaves 47-48).

Thesis (Ph. D.)--University of Adelaide, Dept. of Obstetrics and Gynaecology, 1999. / Includes bibliographical references (leaves 242-268).

Thesis (M. P. A.)--Texas State University-San Marcos, 2007. / "Fall 2007." Includes bibliographical references (leaves 62-67).

Thesis (D. Psych.)--Victoria University (Melbourne, Vic.), 2007. / Includes bibliographical references.