Search results for "Opera"

showing 10 items of 8665 documents

An interactive approach to multiple criteria optimization with multiple decision-makers

1986

In this article we propose a formal man-machine interactive approach to multiple criteria optimization with multiple decision makers. The approach is based on some of our earlier research findings in multiple criteria decision making. A discrete decision space is assumed. The same framework may readily be used for multiple criteria mathematical programming problems. To test the approach two experiments were conducted using undergraduate Business School students as subjects in Finland and in the United States. The context was, respectively, a high-level Finnish labor-management problem and the management-union collective bargaining game developed at the Krannert Graduate School of Management…

Collective bargainingOperations researchManagement scienceComputer scienceDecision theoryGeneral EngineeringMultiple criteriaContext (language use)Social decisionSpace (commercial competition)Research findingsTest (assessment)Naval Research Logistics Quarterly
researchProduct

The Influence of Collective Behavior on Pacing in Endurance Competitions

2015

A number of theoretical models have been proposed in recent years to explain pacing strategies observed in individual competitive endurance events. These have typically related to the internal regulatory processes that inform the making of decisions relating to muscular work rate. Despite a substantial body of research which has investigated the influence of collective group dynamics on individual behaviors in various animal species, this issue has not been comprehensively studied in individual athletic events. This is somewhat surprising given that athletes often directly compete in close proximity to one another, and that collective behavior has also been observed in other human environme…

Collective behaviorOperations researchPhysiologyCompromisemedia_common.quotation_subjectMental fatigueTheoretical modelsWork rateendurance performancelcsh:PhysiologyPhysiology (medical)Medicinecomplex systemsAnimal speciesmedia_commonlcsh:QP1-981biologyAthletesbusiness.industryCognitiondecision-makingMental Fatiguebiology.organism_classificationQPPerspectivesportbusinessCognitive psychologyFrontiers in Physiology
researchProduct

Collective Intentionality, Language, and Normativity: A Problem and a Possible Solution for the Analysis of Cooperation

2015

In this paper I discuss Searle's analysis of social ontology in the light of his account of the sources of normativity as rooted in the logical structure of language. I conclude that, though his theory of normativity may appear to be inconsistent with his theory collective intentionality, it is really our Background sense of the other that creates a sense of community even before the actual functioning of collective intentionality and language, thereby escaping the dilemma between individualism and collectivism.

Collective intentionality Individualism Collectivism Normativity Background Commitment CooperationSettore M-FIL/06 - Storia Della Filosofia
researchProduct

Predictors of surgical outcomes of minimally invasive right colectomy: the MERCY study

2022

PURPOSE: The optimal approach for minimally invasive (MIS) right colectomy remains under debate. This study aimed to describe surgical trends in the treatment of nonmetastatic right colon cancer and to identify predictors of short-term surgical outcomes. METHODS: A retrospective multicenter cohort study of Minimally-invasivE surgery for oncologic Right ColectomY (MERCY) was conducted on patients who underwent laparoscopic or robotic right colectomy between 2014 and 2020. Classification tree approach was used to describe the extracorporeal (EA) or intracorporeal (IA) anastomosis choice. Mixed-model regressions were used to identify patient- and surgery-related factors predictive of postopera…

Colonic NeoplasmAnastomosisAnastomosis SurgicalOperative TimeGastroenterologyRight colectomyIntracorporeal anastomosisRobotic surgeryIntracorporeal anastomosiColon cancerCohort StudiesTreatment OutcomeRobotic Surgical ProceduresRetrospective StudieMinimally invasive surgerySurgicalColonic NeoplasmsColon cancer; Intracorporeal anastomosis; Laparoscopy; Minimally invasive surgery; Right colectomy; Robotic surgery; Anastomosis Surgical; Cohort Studies; Colectomy; Humans; Operative Time; Retrospective Studies; Treatment Outcome; Colonic Neoplasms; Laparoscopy; Robotic Surgical ProceduresHumansLaparoscopyCohort StudieColectomyHumanRetrospective Studies
researchProduct

Tabu search for min-max edge crossing in graphs

2020

Abstract Graph drawing is a key issue in the field of data analysis, given the ever-growing amount of information available today that require the use of automatic tools to represent it. Graph Drawing Problems (GDP) are hard combinatorial problems whose applications have been widely relevant in fields such as social network analysis and project management. While classically in GDPs the main aesthetic concern is related to the minimization of the total sum of crossing in the graph (min-sum), in this paper we focus on a particular variant of the problem, the Min-Max GDP, consisting in the minimization of the maximum crossing among all egdes. Recently proposed in scientific literature, the Min…

Combinatorial optimizationTheoretical computer scienceGeneral Computer ScienceComputer scienceHeuristic (computer science)ComputationMetaheuristicsManagement Science and Operations ResearchTabu searchGraphGraph drawingGraph drawingModeling and SimulationHeuristicsComputers & Operations Research
researchProduct

Bounded Bi-ideals and Linear Recurrence

2013

Bounded bi-ideals are a subclass of uniformly recurrent words. We introduce the notion of completely bounded bi-ideals by imposing a restriction on their generating base sequences. We prove that a bounded bi-ideal is linearly recurrent if and only if it is completely bounded.

CombinatoricsCombinatorics on wordsMathematics::Commutative AlgebraBounded setBounded functionBase (topology)Bounded inverse theoremBounded operatorMathematics2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
researchProduct

On norm attaining polynomials

2003

We show that for every Banach space X the set of 2-homogeneous continuous polynomials whose canonical extension to X∗∗ attain their norm is a dense subset of the space of all 2-homogeneous continuous polynomials P(2X).

CombinatoricsDense setGeneral MathematicsNorm (mathematics)Banach spaceOperator normMathematicsPublications of the Research Institute for Mathematical Sciences
researchProduct

Estimating norms inC*-algebras of discrete groups

1976

LetG be a discrete group, letK be a finite subset ofG and let χ K be the characteristic function ofK. Then χ K acts by convolution as a bounded operator onL2(G). We will prove that the norm |||χ K ||| of this operator always satisfies the following estimate: $$|||\chi _{\rm K} |||^2 \leqq k + 2\sqrt {w\left( {k - 1} \right)\left( {k - w} \right)} + \left( {k - 2} \right)\left( {k - w} \right)$$ . Here .

CombinatoricsDiscrete mathematicsCharacteristic function (probability theory)Discrete groupGeneral MathematicsOperator (physics)ConvolutionBounded operatorMathematicsMathematische Annalen
researchProduct

A note on lower bounds of norms of averaging operators

2000

For any natural number n we obtain some examples of continuous onto maps $\phi : S\,\,\longrightarrow\, \,T$ for which Ditor's set $\Delta _\phi ^2(2, 2)$ is empty but every averaging operator for $\phi $ has norm greater or equal to 2n + 1.

CombinatoricsDiscrete mathematicsOperator (computer programming)General MathematicsNorm (mathematics)Natural numberMathematicsArchiv der Mathematik
researchProduct

The Minimum Amount of Useful Space: New Results and New Directions

2014

We consider minimal space requirements when using memory with restricted access policy (pushdown - hence giving pushdown automata (PDAs), and counter - hence giving counter automata (CAs)) in connection with two-way and realtime head motion. The main results are that: (i) loglogn is a tight space lower bound for accepting general nonregular languages on weak realtime PDAs, (ii) there exist unary nonregular languages accepted by realtime alternating CAs within weak logn space, (iii) there exist nonregular languages accepted by two-way DPADs within strong loglogn space, and, (iv) there exist unary nonregular languages accepted by two-way CAs with quantum and classical states within middle log…

CombinatoricsDiscrete mathematicsRegular languageUnary operationQuantum registerUnary languagePushdown automatonSpace (mathematics)Upper and lower boundsAutomatonMathematics
researchProduct