This dissertation addresses the development of enhanced formulations for minimax and mixed-integer programming models for certain industrial and logistical systems, along with the design and implementation of efficient algorithmic strategies. We first examine the general class of minimax mixed-integer 0-1 problems of the type that frequently arise in decomposition approaches and in a variety of location and scheduling problems. We conduct an extensive polyhedral analysis of this problem in order to tighten its representation using the Reformulation-Linearization/Convexification Technique (RLT), and demonstrate the benefits of the resulting lifted formulations for several classes of problems. Specifically, we investigate RLT-enhanced Lagrangian dual formulations for the class of minimax mixed-integer 0-1 problems in concert with deflected/conjugate subgradient algorithms. In addition, we propose two general purpose lifting mechanisms for tightening the mathematical programming formulations associated with such minimax optimization problems. Next, we explore novel continuous nonconvex as well as lifted discrete formulations for the notoriously challenging class of job-shop scheduling problems with the objective of minimizing the maximum completion time (i.e., minimizing the makespan). In particular, we develop an RLT-enhanced continuous nonconvex model for the job-shop problem based on a quadratic formulation of the job sequencing constraints on machines. The tight linear programming relaxation that is induced by this formulation is then embedded in a globally convergent branch-and-bound algorithm. Furthermore, we design another novel formulation for the job-shop scheduling problem that possesses a tight continuous relaxation, where the non-overlapping job sequencing constraints on machines are modeled via a lifted asymmetric traveling salesman problem (ATSP) construct, and specific sets of valid inequalities and RLT-based enhancements are incorporated to further tighten the resulting mathematical program. The efficacy of our enhanced models is demonstrated by an extensive computational experiment using classical benchmark problems from the literature. Our results reveal that the LP relaxations produced by the lifted ATSP-based models provide very tight lower bounds, and directly yield a 0\% optimality gap for many benchmark problems, thereby substantially dominating other alternative mixed-integer programming models available for this class of problems. Notably, our lifted ATSP-based formulation produced a 0\% optimality gap via the root node LP relaxation for 50\% of the classical problem instances due to Lawrence. We also investigate enhanced model formulations and specialized, efficient solution methodologies for applications arising in four particular industrial and sports scheduling settings. The first of these was posed to us by a major trucking company (Volvo Logistics North America), and concerns an integrated assembly and routing problem, which is a unique study of its kind in the literature. In this context, we examine the general class of logistical systems where it is desirable to appropriately ascertain the joint composition of the sequences of vehicles that are to be physically connected along with determining their delivery routes. Such assembly-routing problems occur in the truck manufacturing industry where different models of vehicles designed for a network of customers need to be composed into compatible groups (assemblies) and subsequently dispatched via appropriately optimized delivery routes that are restricted by the particular sequence in which the trucks are connected. A similar structure is exhibited in the business of shipping goods via boat-towed barges along inland waterways, or via trains through railroad networks. We present a novel modeling framework and column generation-based optimization approach for this challenging class of joint vehicle assembly-routing problems. In addition, we suggest several extensions to accommodate particular industrial restrictions where assembly sequence-dependent delivery routes are necessary, as well as those where limited driver- and equipment-related resources are available. Computational experience is provided using large-scale realistic data to demonstrate the applicability of our suggested methodology in practice. The second application addressed pertains to a production planning problem faced by a major motorcycle manufacturing firm (Harley-Davidson Motor Company). We consider the problem of partitioning and sequencing the production of different manufactured items in mixed-model assembly lines, where each model has various specific options and designated destinations. We propose a mixed-integer programming formulation (MPSP1) for this problem that sequences the manufactured goods within production batches in order to balance the motorcycle model and destination outputs as well as the load demands on material and labor resources. An alternative (relaxed) formulation (MPSP2) is also presented to model a closely related case where all production decisions and outputs are monitored within a common sequence of batches, which permits an enhanced tighter representation via an additional set of hierarchical symmetry-defeating constraints that impart specific identities amongst batches of products under composition. The latter model inspires a third set partitioning-based formulation in concert with an efficient column generation approach that directly achieves the joint partitioning of jobs into batches along with ascertaining the sequence of jobs within each composed batch. Finally, we investigate a subgradient-based optimization strategy that exploits a non-differentiable optimization formulation, which is prompted by the flexibility in the production process as reflected in the model via several soft-constraints, thereby providing a real-time decision-making tool. Computational experience is presented to demonstrate the relative effectiveness of the different proposed formulations and the associated optimization strategies for solving a set of realistic problem instances. The third application pertains to the problem of matching or assigning subassembly parts in assembly lines, where we seek to minimize the total deviation of the resulting final assemblies from a vector of nominal and mean quality characteristic values. We introduce three symmetry-defeating enhancements for an existing assignment-based model, and highlight the critical importance of using particular types of symmetry-defeating hierarchical constraints that preserve the model structure. We also develop an alternative set partitioning-based formulation in concert with a column generation approach that efficiently exploits the structure of the problem. A special complementary column generation feature is proposed, and we provide insights into its vital role for the proposed column generation strategy, as well as highlight its benefits in the broader context of set partitioning-based formulations that are characterized by columns having relatively dense non-zero values. In addition, we develop several heuristic procedures. Computational experience is presented to demonstrate the relative effectiveness of the different adopted strategies for solving a set of realistic problem instances. Finally, we analyze a doubles tennis scheduling problem in the context of a training tournament as prompted by a tennis club in Virginia, and develop two alternative 0-1 mixed-integer programming models, each with three different objective functions that attempt to balance the partnership and the opponentship pairings among the players. Our analysis and computational experience demonstrate the superiority of one of these models over the other, and reflect the importance of model structure in formulating discrete optimization problems. Furthermore, we design effective symmetry-defeating strategies that impose certain decision hierarchies within the models, which serve to significantly enhance algorithmic performance. In particular, our study provides the insight that the special structure of the mathematical program to which specific tailored symmetry-defeating constraints are appended can greatly influence their pruning effect. We also propose a novel nonpreemptive multi-objective programming strategy in concert with decision hierarchies, and highlight its effectiveness and conceptual value in enhancing problem solvability. Finally, four specialized heuristics are devised and are computationally evaluated along with the exact solution schemes using a set of realistic practical test problems. Aside from the development of specialized effective models and algorithms for particular interesting and challenging applications arising in different assembly, routing, and scheduling contexts, this dissertation makes several broader contributions that emerge from the foregoing studies, which are generally applicable to solving formidable combinatorial optimization problems. First, we have shown that it is of utmost importance to enforce symmetry-defeating constraints that preserve the structure of mathematical programs to which they are adjoined, so that their pruning effects are most efficiently coupled with the branch-and-bound strategies that are orchestrated within mathematical programming software packages. In addition, our work provides the insight that the concept of symmetry compatible formulations plays a crucial role in the effectiveness of implementing any particular symmetry-defeating constraints. In essence, if the root node LP solution of the original formulation does not conform relatively well with the proposed symmetry-defeating hierarchical constraints, then a significant branching effort might be required to identify a good solution that is compatible with the pattern induced by the selected symmetry-defeating constraints. Therefore, it is advisable to enforce decision hierarchies that conform as much as possible with the problem structure as well as with the initial LP relaxation. Second, we have introduced an alternative concept for defeating symmetry via augmented objective functions. This concept prompts the incorporation of objective perturbation terms that discriminate amongst subsets of originally undistinguishable solution structures and, in particular, leads to the development of a nonpreemptive multiobjective programming approach based on, and combined with, symmetry-defeating constraints. Interestingly, nonpreemptive multiobjective programming approaches that accommodate symmetry-defeating hierarchical objective terms induce a root node solution that is compatible with the imposed symmetry-defeating constraints, and hence affords an automated alternative to the aforementioned concept of symmetry compatible formulations. Third, we have proposed a new idea of complementary column generation in the context of column generation approaches that generally provide a versatile framework for analyzing industrial-related, integrated problems that involve the joint optimization of multiple operational decisions, such as assembly and routing, or partitioning and scheduling. In such situations, we have reinforced the insight that assignment-related problems that involve collections of objects (production batches, final assemblies, etc.) whose permutation yields equivalent symmetric solutions may be judiciously formulated as set partitioning models. The latter can then be effectively tackled via column generation approaches, thereby implicitly obviating the foregoing combinatorial symmetric reflections through the dynamic generation of attractive patterns or columns. The complementary column generation feature we have proposed and investigated in this dissertation proves to be particularly valuable for such set partitioning formulations that involve columns having relatively dense non-zero values. The incorporation of this feature guarantees that every LP iteration (involving the solution of a restricted master program and its associated subproblem) systematically produces a consistent set of columns that collectively qualify as a feasible solution to the problem under consideration. Upon solving the problem to optimality as a linear program, the resultant formulation encompasses multiple feasible solutions that generally include optimal or near-optimal solutions to the original integer-restricted set partitioning formulation, thereby yielding a useful representation for designing heuristic methods as well as exact branch-and-price algorithms. In addition, using duality theory and considering set partitioning problems where the number of patterns needed to collectively compose a feasible solution is bounded, we have derived a lower bound on the objective value that is updated at every LP phase iteration. By virtue of this sequence of lower bounds and the availability of upper bounds via the restricted master program at every LP phase iteration, the LP relaxation of the set partitioning problem is efficiently solved as using a pre-specified optimality tolerance. This yields enhanced algorithmic performance due to early termination strategies that successfully mitigate the tailing-off effect that is commonly witnessed for simplex-based column generation approaches. / Ph. D.

Topic: The relationship between the level of technique skills and performance in small- sided games in U12 football players. Objective: To find the diferences in success of defeating an opponent in small-sided games between three groups of players (devided according to level of technical mastery of defeating an opponent in technical exercise without an opponent). To find the relationship between level of technique skill in defeating an opponent and success of defeating an opponent in real condition in small-sided games in U12 football players. Methods: Evaluation was based on our test. Small-sided games were used for evaluation of success of defeating an opponent in situations 1 on 1. Methods of direct and indirect assessment with help of video were used for assessment of the test as well as the small-sided games. Results: Significant effect size differences were found between groups of players in small-sided games in % success of defeating an opponent and % success of keeping the ball in attempt to defeating an opponent. The results suggests that players with higher level of technical skills in defeating an opponent are more successful in defeating an opponent in real game situations. Nevertheless, the statistically significant results weren't found. Key words: Football, motor skills, small-sided...

The present thesis will provide an overview of how the four humor styles, affiliative, self-enhancing, aggressive, and self-defeating humor, are connected to different brain areas. The thesis will also include an overview of how humor in general, and especially three factors of humor including, processing, appreciation, and comprehension is connected to different brain areas. The present study found a connection between these three factors of humor and activation in the prefrontal cortex (PFC) and inferior frontal gyrus (IFG). The four humor styles were all connected to activity in the midbrain and nucleus accumbens (NAc), though they were found to differ in other parts of the brain. Affiliative humor and self-enhancing humor are humor styles found to share activation of similar brain areas, whereas self-enhancing and aggressive humor was found to the least extent share activation of the same brain areas. No neural differences in relation to the four humor styles have been found between men and woman, or between cultures.

Thesis (M.S.)--Miami University, Dept. of Family Studies and Social Work, 2006. / Title from first page of PDF document. Includes bibliographical references (p. 26-27).

Den ökade globaliseringen har resulterat i att många organisationer stiger in på denkonkurrenskraftiga internationella marknaden. Detta har influerat organisationer att spridaderas budskap globalt – oftast genom marknadsföring. Tv-reklam är en mediekanal som anseseffektiv när man tillämpar humor som en kommunikationsstrategi då den enligt tidigareforskning genererar högt medvetande hos konsumenterna. Dock, finns det ett behov av attbelysa de kulturella skillnaderna när reklamen riktas internationellt eftersom humor uppfattasolika beroende på kultur, vilken kan generera negativa effekter. Eftersom att de kulturellaskillnaderna i humoristisk reklam tenderar att bli bortsedda så fokuserar denna kvantitativestudie på att belysa dessa skillnader med hjälp av Hofstedes kulturdimensionsteori. Dennakvantitativa studie fokuserar därför på att belysa karaktärerna av de kulturella skillnaderna ihumoristisk reklam, genom att använda Hofstedes kulturdimensionsteori, eftersom de tenderaratt bli översedda. Länderna Sverige och Kina jämfördes genom att betona kulturen motreaktionerna gentemot de olika humorstilarna i tv-reklam kopplat till uppfattade känslor. Föratt kunna identifiera humortyperna, användes Rod Martins fyra humorstilar affiliative humor,self-enhancing humor, aggressive humor och self-defeating humor.Syftet med studien var att upplysa hur viktiga aspekterna av de kulturella skillnaderna är ihumoristisk reklam med betoning på kultur och hur känslor mottas i svensk och kinesiskkultur. Detta för att se hur humor kan tillämpas effektivt i reklam över internationella gränser.Enkäten utfördes på svenska och kinesiska universitetsstudenter vilket genererade i detinsamlade empiriska materialet. Resultatet visade att affiliative humor och aggressive humorapplicerad i reklamfilm tas emot likadant känslomässigt i både kinesisk och svensk kultur ochpåverkar även köpintentionerna på samma sätt. Medan, self-defeating humor och selfenhancinghumor tas känslomässigt emot likadant i båda kulturera, men de kinesiskakonsumenterna är mer villiga att köpa produkten. / The growth of globalization has resulted in more organizations entering the competitiveinternational market which has influenced organizations to disseminate their message globally- commonly through the use of advertising. Television commercial is a media channelconsidered to be highly effective if applied with humor as a communication strategy. Theeffectiveness of this strategy generates in high awareness according to previous studies.However, there is a need of highlighting the cross-cultural distinctions when promoting acrossinternational boarders as humor is perceived differently depending on culture, which cannegatively affect the results. As the cultural characteristics in this matter tend to beoverlooked, this quantitative research is focusing on highlighting the cross-culturalcharacteristics in humorous advertising, through the use of Hofstede’s framework of nationalculture. The countries Sweden and China were compared with emphasize on cultureassociated to the reaction toward different humor styles in television commercials linked toperceived emotions. For identifying the humor types, Rod Martin’s four humor stylesaffiliative humor, self-enhancing humor, aggressive humor, and self-defeating humor, wereused.The purpose of this research was to disseminate the importance of cross-cultural aspects inhumor advertising with emphasize on culture and how emotions are perceived in Swedish andChinese culture. The importance relied within how to effectively apply humor in commercialsover cross-cultural boundaries. The questionnaires were performed by Swedish and Chineseuniversity students that generated in the collection of the empirical chapter. The researchfindings indicated that affiliative humor and aggressive humor used in commercial is equallyperceived emotionally in both Chinese and Swedish culture and also affects the purchaseintention similarly. Whereas self-defeating humor and self-enhancing humor are emotionallyequally perceived in both cultures, but the Chinese consumers are more willing to purchasethe product.

The overall aim of this thesis is to present a model for rational goal-setting and to illustrate how it can be applied in evaluations of public policies, in particular policies concerning sustainable development and environmental quality. The contents of the thesis are divided into two sections: a theoretical section (Papers I-IV) and an empirical section (Papers V-VII). Paper I identifies a set of rationality criteria for single goals and discusses them in relation to the typical function of goals. It is argued that goals are typically set to enhance goal achievement. A goal that successfully furthers its achievement is “achievement-inducing”. It holds for each of the identified criteria that, ceteris paribus, improved satisfaction of a criterion makes a goal better in the achievement-inducing sense.Paper II contains an analysis of the notion of goal system coherence. It is argued that the coherence of a goal system is determined by the relations that hold among the goals in the system, in particular the relations of operationalization, means and ends, support, and conflict. Paper III investigates the rationality of utopian goals. The paper analyzes four arguments that support the normative criterion of attainability: that utopian goals are (1) too imprecise and (2) too far-reaching to guide action effectively, (3) counterproductive, and (4) morally objectionable. A tentative defence of utopian goal-setting is built on counter-arguments that can be put forward to weaken each of the four objections. Paper IV investigates the nature of self-defeating goals. The paper identifies three types of situations in which self-defeating mechanisms obstruct goal achievement: (1) situations in which the goal itself carries the seeds of its own non-fulfilment (self-defeating goals), (2) situations in which the activity of goal-setting contributes to goal failure (self-defeating goal-setting), and (3) situations in which disclosure of the goal interferes with progress (self-defeating goal disclosure). Paper V provides a brief description of the Swedish system of environmental objectives and a preliminary inventory of the management difficulties that attach to this goal system.Paper VI contains an investigation into the rationality of five Swedish environmental objectives through an application of the rationality criteria identified in Papers I-II. The paper identifies and discusses some difficulties that are associated with management by objectives and the use of goals in environmental policy. Paper VII analyses the rationality of the Swedish environmental quality objective A good built environment. Among the conclusions drawn in the paper are that some of the sub-goals to the objective are formulated in terms that are unnecessarily vague from an action-guiding standpoint and that others are problematic from the viewpoint of evaluability. / QC 20100715

Years of psychotherapy practice at university, state, and military hospitals developed the author's interest in the presentation of love relationship problems. Mood and anxiety disorders, as the most prevalent pathologies, were often co-morbid with or secondary to partner relationship issues. Most vexing for clients was a situation of repeated dysfunctional partner selections in which similar problems arose each time. This incubated the idea of a process, probably outside of awareness, that functioned to perpetuate self-defeating partner selection patterns. The author was introduced to Money's `lovemap' concept during studies and identified readily with its principles and mechanisms. The lovemap is defined as a highly individualised, developed, mental template or cognitive blueprint of the ideal lover. It is assumed that every person has a lovemap, and would be able to describe it if asked the right questions. The concept promised to be a useful vehicle for studying self-defeating partner selection patterns, as `errors' might be coded into the lovemap that are expressed in such a presentation. The author identified the need to ground the lovemap concept in recognised psychological theory in order to motivate for its relevance. Kelly's theory of cognitive constructs provided robust links for lovemap as a sophisticated construction system, and the developmental theories of Freud and Erikson situated lovemap genesis within recognised periods of emerging human capacities to love and relate sexually; the stages of puberty to young adulthood. Lovemaps are assumed to function optimally when love and lust co-operate in pairbonding, or the capacity to couple. Extensive literature reviews cover the research fields of romantic love, human sexuality, and pairbonding, affording hypotheses as to lovemap pathology. A qualitative, Phenomenological research design of case studies with six adult persons, who had experienced radical contradictions of original lovemaps, identified when and how lovemap change took place. Thematic analysis of the attributions for change distilled a number of implications for therapy that would encourage certain indicated change processes. An integrative psychotherapy model recognises the cognitively- and socially constructed nature of lovemaps and proposes intervention components that blend cognitive-behavioural and narrative approaches. This model will be tested extensively with a suitable client population. / Psychology / D. Litt. ET Phil. (Psychology)

Years of psychotherapy practice at university, state, and military hospitals developed the author's interest in the presentation of love relationship problems. Mood and anxiety disorders, as the most prevalent pathologies, were often co-morbid with or secondary to partner relationship issues. Most vexing for clients was a situation of repeated dysfunctional partner selections in which similar problems arose each time. This incubated the idea of a process, probably outside of awareness, that functioned to perpetuate self-defeating partner selection patterns. The author was introduced to Money's `lovemap' concept during studies and identified readily with its principles and mechanisms. The lovemap is defined as a highly individualised, developed, mental template or cognitive blueprint of the ideal lover. It is assumed that every person has a lovemap, and would be able to describe it if asked the right questions. The concept promised to be a useful vehicle for studying self-defeating partner selection patterns, as `errors' might be coded into the lovemap that are expressed in such a presentation. The author identified the need to ground the lovemap concept in recognised psychological theory in order to motivate for its relevance. Kelly's theory of cognitive constructs provided robust links for lovemap as a sophisticated construction system, and the developmental theories of Freud and Erikson situated lovemap genesis within recognised periods of emerging human capacities to love and relate sexually; the stages of puberty to young adulthood. Lovemaps are assumed to function optimally when love and lust co-operate in pairbonding, or the capacity to couple. Extensive literature reviews cover the research fields of romantic love, human sexuality, and pairbonding, affording hypotheses as to lovemap pathology. A qualitative, Phenomenological research design of case studies with six adult persons, who had experienced radical contradictions of original lovemaps, identified when and how lovemap change took place. Thematic analysis of the attributions for change distilled a number of implications for therapy that would encourage certain indicated change processes. An integrative psychotherapy model recognises the cognitively- and socially constructed nature of lovemaps and proposes intervention components that blend cognitive-behavioural and narrative approaches. This model will be tested extensively with a suitable client population. / Psychology / D. Litt. ET Phil. (Psychology)