COMPARATIVE ANALYSIS OF AMERICAN AND SPANISH CRUISE PASSENGERS' BEHAVIORAL INTENTIONS

ABSTRACT Earlier studies of cross-national differences in consumer behavior in different consumption sectors have verified that cultural differences have a strong influence on consumers. Despite the importance of cross-national analysis, no studies in the literature examine the moderating effects of nationality on the construction of behavioral intentions and their antecedents among cruise line passengers. This study investigates the moderating effects of nationality on the relationships between perceived value, satisfaction, trust and behavioral intentions among Spanish and (U.S.) American passengers of cruise lines that use Barcelona as home port and port-of-call. A theoretical model was tested with a total of 968 surveys. Structural equation models (SEMs) were used, by means of a multigroup analysis. Results of this study indicated that Spaniards showed stronger relationships between trust and behavioral intentions, and between emotional value and satisfaction. Americans presented stronger relationships between service quality and satisfaction, and between service quality and behavioral intentions.

Analysis of mediation and reciprocal effects of changes in weight, self-esteem, and exercise in a behavioral weight loss treatment

Improving the treatment of obesity remains a critical challenge. Several health behaviour change models, often based on a social-cognitive framework, have been used to design weight management interventions (Baranowski et al., 2003). However, most interventions have only produced modest weight reductions (Wadden et al., 2002) and socialcognitive variables have shown limited power to predict weight outcomes (Palmeira et al., 2007). Other predictors, and possibl alte nati e e planatory models, are needed to better understand the mechanisms by which weight loss and other obesity treatment-outcomes are brought about (Baranowski, 2006). Self-esteem is one of these possible mechanisms, because is commonly reported to change during the treatment, although these changes are not necessarily associated with weight loss (Blaine et al., 2007; Maciejewski et al., 2005). This possibility should be more evident if the program integrates regular exercise, as it promotes improvements in subjective well-being (Biddle & Mutrie, 2001), with possible influences on long-term behavioral adherence (e.g. diet, exercise). Following the reciprocal effects model tenets (Marsh & Craven, 2006), we expect that the influences between changes in weight, selfesteem and exercise to be reciprocal and might present one of the mechanisms by which obesity treatments can be improved.

Dynamic power- and failure-aware cloud resources allocation for Sets of independent tasks

Cloud computing is increasingly being adopted in different scenarios, like social networking, business applications, scientific experiments, etc. Relying in virtualization technology, the construction of these computing environments targets improvements in the infrastructure, such as power-efficiency and fulfillment of users’ SLA specifications. The methodology usually applied is packing all the virtual machines on the proper physical servers. However, failure occurrences in these networked computing systems can induce substantial negative impact on system performance, deviating the system from ours initial objectives. In this work, we propose adapted algorithms to dynamically map virtual machines to physical hosts, in order to improve cloud infrastructure power-efficiency, with low impact on users’ required performance. Our decision making algorithms leverage proactive fault-tolerance techniques to deal with systems failures, allied with virtual machine technology to share nodes resources in an accurately and controlled manner. The results indicate that our algorithms perform better targeting power-efficiency and SLA fulfillment, in face of cloud infrastructure failures.

A behavioral intervention in a cohort of Japanese-Brazilians at high cardiometabolic risk

OBJECTIVE: To assess the effect of a health promotion program on cardiometabolic risk profile in Japanese-Brazilians. METHODS: A total of 466 subjects from a study on diabetes prevalence conducted in the city of Bauru, southeastern Brazil, in 2000 completed a 1-year intervention program (2005-2006) based on healthy diet counseling and physical activity. Changes in blood pressure and metabolic parameters in the 2005-2006 period were compared with annual changes in these same variables in the 2000-2005 period. RESULTS: During the intervention, there were greater annual reductions in mean (SD) waist circumference [-0.5(3.8) vs. 1.2(1.2) cm per year, p<0.001], systolic blood pressure [-4.6(17.9) vs. 1.8(4.3) mmHg per year, p<0.001], 2-hour plasma glucose [-1.2(2.1) vs. -0.2(0.6) mmol/L per year, p<0.001], LDL-cholesterol [-0.3(0.9) vs. -0.1(0.2) mmol/L per year, p<0.001] and Framingham coronary heart disease risk score [-0.25(3.03) vs. 0.11(0.66) per year, p=0.02] but not in triglycerides [0.2(1.6) vs. 0.1(0.42) mmol/L per year, p<0.001], and fasting insulin level [1.2(5.8) vs. -0.7(2.2) IU/mL per year, p<0.001] compared with the pre-intervention period. Significant reductions in the prevalence of impaired fasting glucose/impaired glucose tolerance and diabetes were seen during the intervention (from 58.4% to 35.4%, p<0.001; and from 30.1% to 21.7%, p= 0.004, respectively). CONCLUSIONS: A one-year community-based health promotion program brings cardiometabolic benefits in a high-risk population of Japanese-Brazilians.

Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors

A preliminary version of this paper appeared in Proceedings of the 31st IEEE Real-Time Systems Symposium, 2010, pp. 239–248.

Fieldbus networks: real-time from the perspective of the application tasks

Fieldbus communication networks aim to interconnect sensors, actuators and controllers within distributed computer-controlled systems. Therefore they constitute the foundation upon which real-time applications are to be implemented. A potential leap towards the use of fieldbus in such time-critical applications lies in the evaluation of its temporal behaviour. In the past few years several research works have been performed on a number of fieldbuses. However, these have mostly focused on the message passing mechanisms, without taking into account the communicating application tasks running in those distributed systems. The main contribution of this paper is to provide an approach for engineering real-time fieldbus systems where the schedulability analysis of the distributed system integrates both the characteristics of the application tasks and the characteristics of the message transactions performed by these tasks. In particular, we address the case of system where the Process-Pascal multitasking language is used to develop P-NET based distributed applications

A PTAS for assigning sporadic tasks on two-type heterogeneous multiprocessors

Consider the problem of determining a task-toprocessor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct kinds of processors. We propose a polynomialtime approximation scheme (PTAS) for this problem. It offers the following guarantee: for a given task set and a given platform, if there exists a feasible task-to-processor assignment, then given an input parameter, ϵ, our PTAS succeeds, in polynomial time, in finding such a feasible task-to-processor assignment on a platform in which each processor is 1+3ϵ times faster. In the simulations, our PTAS outperforms the state-of-the-art PTAS [1] and also for the vast majority of task sets, it requires significantly smaller processor speedup than (its upper bound of) 1+3ϵ for successfully determining a feasible task-to-processor assignment.

Energy-conscious tasks partitioning onto a heterogeneous multi-core platform

Modern multicore processors for the embedded market are often heterogeneous in nature. One feature often available are multiple sleep states with varying transition cost for entering and leaving said sleep states. This research effort explores the energy efficient task-mapping on such a heterogeneous multicore platform to reduce overall energy consumption of the system. This is performed in the context of a partitioned scheduling approach and a very realistic power model, which improves over some of the simplifying assumptions often made in the state-of-the-art. The developed heuristic consists of two phases, in the first phase, tasks are allocated to minimise their active energy consumption, while the second phase trades off a higher active energy consumption for an increased ability to exploit savings through more efficient sleep states. Extensive simulations demonstrate the effectiveness of the approach.

Real-time scheduling of parallel tasks in the Linux Kernel

This paper proposes a global multiprocessor scheduling algorithm for the Linux kernel that combines the global EDF scheduler with a priority-aware work-stealing load balancing scheme, enabling parallel real-time tasks to be executed on more than one processor at a given time instant. We state that some priority inversion may actually be acceptable, provided it helps reduce contention, communication, synchronisation and coordination between parallel threads, while still guaranteeing the expected system’s predictability. Experimental results demonstrate the low scheduling overhead of the proposed approach comparatively to an existing real-time deadline-oriented scheduling class for the Linux kernel.

Dynamic global scheduling of parallel real-time tasks

High-level parallel languages offer a simple way for application programmers to specify parallelism in a form that easily scales with problem size, leaving the scheduling of the tasks onto processors to be performed at runtime. Therefore, if the underlying system cannot efficiently execute those applications on the available cores, the benefits will be lost. In this paper, we consider how to schedule highly heterogenous parallel applications that require real-time performance guarantees on multicore processors. The paper proposes a novel scheduling approach that combines the global Earliest Deadline First (EDF) scheduler with a priority-aware work-stealing load balancing scheme, which enables parallel realtime tasks to be executed on more than one processor at a given time instant. Experimental results demonstrate the better scalability and lower scheduling overhead of the proposed approach comparatively to an existing real-time deadline-oriented scheduling class for the Linux kernel.

Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound

Known algorithms capable of scheduling implicit-deadline sporadic tasks over identical processors at up to 100% utilisation invariably involve numerous preemptions and migrations. To the challenge of devising a scheduling scheme with as few preemptions and migrations as possible, for a given guaranteed utilisation bound, we respond with the algorithm NPS-F. It is configurable with a parameter, trading off guaranteed schedulable utilisation (up to 100%) vs preemptions. For any possible configuration, NPS-F introduces fewer preemptions than any other known algorithm matching its utilisation bound. A clustered variant of the algorithm, for systems made of multicore chips, eliminates (costly) off-chip task migrations, by dividing processors into disjoint clusters, formed by cores on the same chip (with the cluster size being a parameter). Clusters are independently scheduled (each, using non-clustered NPS-F). The utilisation bound is only moderately affected. We also formulate an important extension (applicable to both clustered and non-clustered NPS-F) which optimises the supply of processing time to executing tasks and makes it more granular. This reduces processing capacity requirements for schedulability without increasing preemptions.

Server-based scheduling of parallel real-time tasks

Multicore platforms have transformed parallelism into a main concern. Parallel programming models are being put forward to provide a better approach for application programmers to expose the opportunities for parallelism by pointing out potentially parallel regions within tasks, leaving the actual and dynamic scheduling of these regions onto processors to be performed at runtime, exploiting the maximum amount of parallelism. It is in this context that this paper proposes a scheduling approach that combines the constant-bandwidth server abstraction with a priority-aware work-stealing load balancing scheme which, while ensuring isolation among tasks, enables parallel tasks to be executed on more than one processor at a given time instant.

A preliminary idea for an 8-competitive, log2 DMAX + log2 log2 1/U asymptotic-space, interface generation algorithm for two-level hierarchical scheduling of constrained-deadline sporadic tasks on a uniprocessor

Consider a single processor and a software system. The software system comprises components and interfaces where each component has an associated interface and each component comprises a set of constrained-deadline sporadic tasks. A scheduling algorithm (called global scheduler) determines at each instant which component is active. The active component uses another scheduling algorithm (called local scheduler) to determine which task is selected for execution on the processor. The interface of a component makes certain information about a component visible to other components; the interfaces of all components are used for schedulability analysis. We address the problem of generating an interface for a component based on the tasks inside the component. We desire to (i) incur only a small loss in schedulability analysis due to the interface and (ii) ensure that the amount of space (counted in bits) of the interface is small; this is because such an interface hides as much details of the component as possible. We present an algorithm for generating such an interface.

Provably good scheduling of sporadic tasks with resource sharing on a two-type heterogeneous multiprocessor platform

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform where a task may request at most one of |R| shared resources. There are m1 processors of type-1 and m2 processors of type-2. Tasks may migrate only when requesting or releasing resources. We present a new algorithm, FF-3C-vpr, which offers a guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that only allows tasks to migrate when requesting or releasing a resource, then FF-3Cvpr also meets deadlines if given processors 4+6*ceil(|R|/min(m1,m2)) times as fast. As far as we know, it is the first result for resource sharing on heterogeneous platforms with provable performance.

Intra-type migrative scheduling of implicit-deadline sporadic tasks on two- type heterogeneous multiprocessor

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform. Each processor is either of type-1 or type-2 with each task having different execution time on each processor type. Jobs can migrate between processors of same type (referred to as intra-type migration) but cannot migrate between processors of different types. We present a new scheduling algorithm namely, LP-Relax(THR) which offers a guarantee that if a task set can be scheduled to meet deadlines by an optimal task assignment scheme that allows intra-type migration then LP-Relax(THR) meets deadlines as well with intra-type migration if given processors 1/THR as fast (referred to as speed competitive ratio) where THR <= 2/3.