Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

159.9:796 --- Psychologie van de sport. Sportpsychologie. Coachen. Mentale training --- 159.9:796 Psychologie van de sport. Sportpsychologie. Coachen. Mentale training --- Athletes --- Reversal theory (Psychology) --- Sports --- Motivation in sports --- Sport psychology --- Sports motivation --- Sports psychology --- Sports sciences --- Psychological reversals --- Reversals, Psychological --- Motivation (Psychology) --- Sports persons --- Sportspeople --- Sportspersons --- Sports personnel --- Counseling of --- Psychological aspects --- Accompagnement individuel --- Motivation --- Psychologie du sport --- Sport --- Stress --- Athletes. --- Théorie du renversement psychologique. --- Athlètes. --- Psychological aspects. --- Aspect psychologique. --- Counseling

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The relationship between an author's and an audience's intentions is complex but need not preclude mutual engagement. This philosophical investigation challenges existing literary and rhetorical perspectives on intention and offers a new framework for understanding the negotiation of meaning. It describes how an audience's intentions affect their interpretations, shows how audiences negotiate meaning when faced with a writer's undecipherable intentions, and defines the scope of understanding within rhetorical situations.Introducing a concept of intention into literary analysis that supersedes existing rhetorical theory, Arabella Lyon shows how the rhetorics of I. A. Richards, Wayne Booth, and Stanley Fish, as well as the hermeneutics of Hans-Georg Gadamer, fail to account for the complex interactions of author and audience. Using Kenneth Burke's concepts of form, motive, and purpose, she builds a more complex notion of intention than those usually found in literary studies, then employs her theory to describe how philosophers read Wittgenstein's narratives, metaphors, and reversals in argument.Lyon argues that our differences in intention prevent consistency in interpretations but do not stop our discussions, deliberations, and actions. She seeks to acknowledge difference and the communicative problems it creates while demonstrating that difference is normal and does not end our engagement with each other.Intentions combines recent work in philosophy, literary criticism, hermeneutics, and rhetoric in a highly imaginative way to construct a theory of intention for a postmodern rhetoric. It recovers and renovates central concepts in rhetorical theory—not only intention but also deliberation, politics, and judgment.

Literature --- History and criticism --- Theory, etc. --- 0-271-02504-2. --- Arabella Lyon. --- Hans Georg Gadamer. --- I. A. Richards. --- Kenneth Burke. --- Literature and Philosophy. --- Stanley Fish. --- Wayne Booth. --- Wittgenstein. --- actions. --- argument. --- audience. --- author. --- deliberation. --- deliberations. --- difference. --- discussions. --- form. --- hermeneutics. --- interpretations. --- judgment. --- literary studies. --- meaning. --- metaphors. --- motive. --- mutual engagement. --- narratives. --- philosophers. --- politics. --- purpose. --- reversals. --- rhetoric.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Discrete optimization is an important area of Applied Mathematics with a broad spectrum of applications in many fields. This book results from a Special Issue in the journal Mathematics entitled ‘Advances and Novel Approaches in Discrete Optimization’. It contains 17 articles covering a broad spectrum of subjects which have been selected from 43 submitted papers after a thorough refereeing process. Among other topics, it includes seven articles dealing with scheduling problems, e.g., online scheduling, batching, dual and inverse scheduling problems, or uncertain scheduling problems. Other subjects are graphs and applications, evacuation planning, the max-cut problem, capacitated lot-sizing, and packing algorithms.

Research & information: general --- Mathematics & science --- forgotten index --- balaban index --- reclassified the zagreb indices --- ABC4 index --- GA5 index --- HDN3(m) --- THDN3(m) --- RHDN3(m) --- degree of vertex --- extended adjacency index --- scheduling with rejection --- machine non-availability --- operator non-availability --- dynamic programming --- FPTAS --- Transportation --- batching scheduling --- total weighted completion time --- unary NP-hard --- approximation algorithm --- bi-criteria scheduling --- online algorithm --- makespan --- maximum machine cost --- competitive ratio --- network optimization --- dynamic flow --- evacuation planning --- contraflow configuration --- partial lane reversals, algorithms and complexity --- logistic supports --- scheduling algorithm --- release-time --- due-date --- divisible numbers --- lateness --- bin packing --- time complexity --- batch scheduling --- linear deterioration --- job families --- Max-cut problem --- combinatorial optimization --- deep learning --- pointer network --- supervised learning --- reinforcement learning --- capacitated lot sizing --- mixed integer formulation --- retail --- inventory --- shortages --- graph --- join product --- crossing number --- cyclic permutation --- arithmetic mean --- combinatorial generation --- method --- algorithm --- AND/OR tree --- Euler-Catalan's triangle --- labeled Dyck path --- ranking algorithm --- unranking algorithm --- Harris hawks optimizer --- load frequency control --- sensitivity analysis --- smart grid --- particle swarm optimization --- genetic algorithm --- meta-heuristics --- packing --- irregular 3D objects --- quasi-phi-function s --- nonlinear optimization --- single-machine scheduling --- minimization of maximum penalty --- dual problem --- inverse problem --- branch and bound --- LNS --- numerical conversion --- RISC --- FPGA --- embedded systems --- scheduling --- job-shop --- makespan criterion --- uncertain processing times --- forgotten index --- balaban index --- reclassified the zagreb indices --- ABC4 index --- GA5 index --- HDN3(m) --- THDN3(m) --- RHDN3(m) --- degree of vertex --- extended adjacency index --- scheduling with rejection --- machine non-availability --- operator non-availability --- dynamic programming --- FPTAS --- Transportation --- batching scheduling --- total weighted completion time --- unary NP-hard --- approximation algorithm --- bi-criteria scheduling --- online algorithm --- makespan --- maximum machine cost --- competitive ratio --- network optimization --- dynamic flow --- evacuation planning --- contraflow configuration --- partial lane reversals, algorithms and complexity --- logistic supports --- scheduling algorithm --- release-time --- due-date --- divisible numbers --- lateness --- bin packing --- time complexity --- batch scheduling --- linear deterioration --- job families --- Max-cut problem --- combinatorial optimization --- deep learning --- pointer network --- supervised learning --- reinforcement learning --- capacitated lot sizing --- mixed integer formulation --- retail --- inventory --- shortages --- graph --- join product --- crossing number --- cyclic permutation --- arithmetic mean --- combinatorial generation --- method --- algorithm --- AND/OR tree --- Euler-Catalan's triangle --- labeled Dyck path --- ranking algorithm --- unranking algorithm --- Harris hawks optimizer --- load frequency control --- sensitivity analysis --- smart grid --- particle swarm optimization --- genetic algorithm --- meta-heuristics --- packing --- irregular 3D objects --- quasi-phi-function s --- nonlinear optimization --- single-machine scheduling --- minimization of maximum penalty --- dual problem --- inverse problem --- branch and bound --- LNS --- numerical conversion --- RISC --- FPGA --- embedded systems --- scheduling --- job-shop --- makespan criterion --- uncertain processing times

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Discrete optimization is an important area of Applied Mathematics with a broad spectrum of applications in many fields. This book results from a Special Issue in the journal Mathematics entitled ‘Advances and Novel Approaches in Discrete Optimization’. It contains 17 articles covering a broad spectrum of subjects which have been selected from 43 submitted papers after a thorough refereeing process. Among other topics, it includes seven articles dealing with scheduling problems, e.g., online scheduling, batching, dual and inverse scheduling problems, or uncertain scheduling problems. Other subjects are graphs and applications, evacuation planning, the max-cut problem, capacitated lot-sizing, and packing algorithms.

forgotten index --- balaban index --- reclassified the zagreb indices --- ABC4 index --- GA5 index --- HDN3(m) --- THDN3(m) --- RHDN3(m) --- degree of vertex --- extended adjacency index --- scheduling with rejection --- machine non-availability --- operator non-availability --- dynamic programming --- FPTAS --- Transportation --- batching scheduling --- total weighted completion time --- unary NP-hard --- approximation algorithm --- bi-criteria scheduling --- online algorithm --- makespan --- maximum machine cost --- competitive ratio --- network optimization --- dynamic flow --- evacuation planning --- contraflow configuration --- partial lane reversals, algorithms and complexity --- logistic supports --- scheduling algorithm --- release-time --- due-date --- divisible numbers --- lateness --- bin packing --- time complexity --- batch scheduling --- linear deterioration --- job families --- Max-cut problem --- combinatorial optimization --- deep learning --- pointer network --- supervised learning --- reinforcement learning --- capacitated lot sizing --- mixed integer formulation --- retail --- inventory --- shortages --- graph --- join product --- crossing number --- cyclic permutation --- arithmetic mean --- combinatorial generation --- method --- algorithm --- AND/OR tree --- Euler–Catalan’s triangle --- labeled Dyck path --- ranking algorithm --- unranking algorithm --- Harris hawks optimizer --- load frequency control --- sensitivity analysis --- smart grid --- particle swarm optimization --- genetic algorithm --- meta-heuristics --- packing --- irregular 3D objects --- quasi-phi-function s --- nonlinear optimization --- single-machine scheduling --- minimization of maximum penalty --- dual problem --- inverse problem --- branch and bound --- LNS --- numerical conversion --- RISC --- FPGA --- embedded systems --- scheduling --- job-shop --- makespan criterion --- uncertain processing times --- n/a --- Euler-Catalan's triangle