798 research outputs found
How Differences in Perceptions of Own and Team Performance Impact Trust and Job Satisfaction in Virtual Teams
Enhancing trust or reducing perceived risk, what matters more when launching a new product?
Using a collection of data among 490 participants from different companies in the field of medical engineering market, we contribute to the role of contact intensity by a business partner when launching new products by introducing trust as a mediator to the concept of perceived risk reduction to enhance the relationship commitment. The findings show that the common concept of risk reduction to enhance the relationship commitment is overrated. In detail, the results show first, that the influence of trust on the relationship commitment is decisive instead of reducing perceived risk by the customer. The contact intensity is only important to enhance trust which influences the relationship commitment in a positive way. Hence, managers should concentrate on the development of trust and not on the reduction of perceived risk of the customer. Second, our findings demonstrate that the attitude whether the customer is averse of affine towards innovations has no influence on the relationship between contact intensity and relationship commitment. This is obviously the opposite of the findings of most researchers in literature who usually state customers need different contacts of the seller to purchase a new product depending on their attitude towards innovations. </jats:p
Legitimacy Strategies in Corporate Environmental Reporting:A Longitudinal Analysis of German DAX Companies’ Disclosed Objectives
Persistent clinical efficacy and safety of anti-tumour necrosis factor \textgreeka therapy with infliximab in patients with ankylosing spondylitis over 5 years: evidence for different types of response
Background: There is insufficient evidence for the long-term efficacy and safety of anti-tumour necrosis factor therapy in patients with ankylosing spondylitis (AS). This is the first report on the treatment with infliximab over 5 years.Methods: As part of a multicentre randomised trial, 69 patients with active AS at baseline (BL) have been continuously treated with infliximab (5 mg/kg i.v. every 6 weeks)---except for a short discontinuation after 3 years (FU1). The primary outcome of this extension was remission according to the ASsessment in Ankylosing Spondylitis (ASAS) criteria at the end of year 5 of the study (FU2).Results: Of the 43 patients who completed year 3, 42 agreed to continue, 38 of which (90.5%) finished year 5 (55% of 69 initially). Partial clinical remission was achieved in 13 of 38 patients (34.2%) at FU1 and FU2. At FU2, the mean Bath Ankylosing Spondylitis Disease Activity Index (BASDAI) was 2.5±1.9 (BL:6.4, FU1:2.5). BASDAI values <4 were seen in 79% of patients at both, FU1 and FU2. ASAS 20% and 40% responses were seen in 32 (84%) and 24 (63%) patients at FU2, respectively. Most patients classified as non-responders at FU2 were part-time responders, as all but one patient achieved an ASAS 20% response at least once within the last 2 years. Three types of responders were identified. No major side effects occurred during years 4 and 5 of infliximab therapy.Conclusions: Infliximab is safe and efficacious in AS patients over 5 years. The majority of the patients remained on treatment and had rather persistent levels of low disease activity. Different response types could be identified
Kommunikation von ökologisch nachhaltiger Unternehmensführung im Energieversorgungssektor – Eine qualitativ-longitudinale Analyse zur Transparenz in der Nachhaltigkeitsberichterstattung
Asynchronous Games over Tree Architectures
We consider the task of controlling in a distributed way a Zielonka
asynchronous automaton. Every process of a controller has access to its causal
past to determine the next set of actions it proposes to play. An action can be
played only if every process controlling this action proposes to play it. We
consider reachability objectives: every process should reach its set of final
states. We show that this control problem is decidable for tree architectures,
where every process can communicate with its parent, its children, and with the
environment. The complexity of our algorithm is l-fold exponential with l being
the height of the tree representing the architecture. We show that this is
unavoidable by showing that even for three processes the problem is
EXPTIME-complete, and that it is non-elementary in general
On the galloping instability of two-dimensional bodies having elliptical cross sections.
Galloping, also known as Den Hartog instability, is the large amplitude, low frequency oscillation of a structure in the direction transverse to the mean wind direction. It normally appears in the case of bodies with small stiffness and structural damping, when they are placed in a flow provided the incident velocity is high enough. Galloping depends on the slope of the lift coefficient versus angle of attack curve, which must be negative. Generally speaking this implies that the body is stalled after boundary layer separation, which, as it is known in non-wedged bodies, is a Reynolds number dependent phenomenon. Wind tunnel experiments have been conducted aiming at establishing the characteristics of the galloping motion of elliptical cross-section bodies when subjected to a uniform flow, the angles of attack ranging from 0° to 90°. The results have been summarized in stability maps, both in the angle of attack versus relative thickness and in the angle of attack versus Reynolds number planes, where galloping instability regions are identified
Local Strategy Improvement for Parity Game Solving
The problem of solving a parity game is at the core of many problems in model
checking, satisfiability checking and program synthesis. Some of the best
algorithms for solving parity game are strategy improvement algorithms. These
are global in nature since they require the entire parity game to be present at
the beginning. This is a distinct disadvantage because in many applications one
only needs to know which winning region a particular node belongs to, and a
witnessing winning strategy may cover only a fractional part of the entire game
graph.
We present a local strategy improvement algorithm which explores the game
graph on-the-fly whilst performing the improvement steps. We also compare it
empirically with existing global strategy improvement algorithms and the
currently only other local algorithm for solving parity games. It turns out
that local strategy improvement can outperform these others by several orders
of magnitude
- …
