A user-centered interface for scheduling problem definition

In this paper we present a user-centered interface for a scheduling system. The purpose of this interface is to provide graphical and interactive ways of defining a scheduling problem. To create such user interface an evaluation-centered user interaction development method was adopted: the star life cycle. The created prototype comprises the Task Module and the Scheduling Problem Module. The first one allows users to define a sequence of operations, i.e., a task. The second one enables a scheduling problem definition, which consists in a set of tasks. Both modules are equipped with a set of real time validations to assure the correct definition of the necessary data input for the scheduling module of the system. The usability evaluation allowed us to measure the ease of interaction and observe the different forms of interaction provided by each participant, namely the reactions to the real time validation mechanism.

CuxSnSx+1 (x = 2, 3) thin films grown by sulfurization of metallic precursors deposited by dc magnetron sputtering

We report the results of the growth of Cu-Sn-S ternary chalcogenide compounds by sulfurization of dc magnetron sputtered metallic precursors. Tetragonal Cu2SnS3 forms for a maximum sulfurization temperature of 350 ºC. Cubic Cu2SnS3 is obtained at sulfurization temperatures above 400 ºC. These results are supported by XRD analysis and Raman spectroscopy measurements. The latter analysis shows peaks at 336 cm-1, 351 cm-1 for tetragonal Cu2SnS3, and 303 cm-1, 355 cm-1 for cubic Cu2SnS3. Optical analysis shows that this phase change lowers the band gap from 1.35 eV to 0.98 eV. At higher sulfurization temperatures increased loss of Sn is expected in the sulphide form. As a consequence, higher Cu content ternary compounds like Cu3SnS4 grow. In these conditions, XRD and Raman analysis only detected orthorhombic (Pmn21) phase (petrukite). This compound has Raman peaks at 318 cm-1, 348 cm-1 and 295 cm-1. For a sulfurization temperature of 450 ºC the samples present a multi-phase structure mainly composed by cubic Cu2SnS3 and orthorhombic (Pmn21) Cu3SnS4. For higher temperatures, the samples are single phase and constituted by orthorhombic (Pmn21) Cu3SnS4. Transmittance and reflectance measurements were used to estimate a band gap of 1.60 eV. For comparison we also include the results for Cu2ZnSnS4 obtained using similar growth conditions.

Analysis of the domain of applicability of an algorithm for a resources system selection problem for Distributed/Agile/Virtual Enterprises integration

The process of resources systems selection takes an important part in Distributed/Agile/Virtual Enterprises (D/A/V Es) integration. However, the resources systems selection is still a difficult matter to solve in a D/A/VE, as it is pointed out in this paper. Globally, we can say that the selection problem has been equated from different aspects, originating different kinds of models/algorithms to solve it. In order to assist the development of a web prototype tool (broker tool), intelligent and flexible, that integrates all the selection model activities and tools, and with the capacity to adequate to each D/A/V E project or instance (this is the major goal of our final project), we intend in this paper to show: a formulation of a kind of resources selection problem and the limitations of the algorithms proposed to solve it. We formulate a particular case of the problem as an integer programming, which is solved using simplex and branch and bound algorithms, and identify their performance limitations (in terms of processing time) based on simulation results. These limitations depend on the number of processing tasks and on the number of pre-selected resources per processing tasks, defining the domain of applicability of the algorithms for the problem studied. The limitations detected open the necessity of the application of other kind of algorithms (approximate solution algorithms) outside the domain of applicability founded for the algorithms simulated. However, for a broker tool it is very important the knowledge of algorithms limitations, in order to, based on problem features, develop and select the most suitable algorithm that guarantees a good performance.

A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions

The container loading problem (CLP) is a combinatorial optimization problem for the spatial arrangement of cargo inside containers so as to maximize the usage of space. The algorithms for this problem are of limited practical applicability if real-world constraints are not considered, one of the most important of which is deemed to be stability. This paper addresses static stability, as opposed to dynamic stability, looking at the stability of the cargo during container loading. This paper proposes two algorithms. The first is a static stability algorithm based on static mechanical equilibrium conditions that can be used as a stability evaluation function embedded in CLP algorithms (e.g. constructive heuristics, metaheuristics). The second proposed algorithm is a physical packing sequence algorithm that, given a container loading arrangement, generates the actual sequence by which each box is placed inside the container, considering static stability and loading operation efficiency constraints.

Riesz potential versus fractional Laplacian

This paper starts by introducing the Grünwald–Letnikov derivative, the Riesz potential and the problem of generalizing the Laplacian. Based on these ideas, the generalizations of the Laplacian for 1D and 2D cases are studied. It is presented as a fractional version of the Cauchy–Riemann conditions and, finally, it is discussed with the n-dimensional Laplacian.

Energy-aware task mapping onto heterogeneous platforms using DVFS and sleep states

Heterogeneous multicore platforms are becoming an interesting alternative for embedded computing systems with limited power supply as they can execute specific tasks in an efficient manner. Nonetheless, one of the main challenges of such platforms consists of optimising the energy consumption in the presence of temporal constraints. This paper addresses the problem of task-to-core allocation onto heterogeneous multicore platforms such that the overall energy consumption of the system is minimised. To this end, we propose a two-phase approach that considers both dynamic and leakage energy consumption: (i) the first phase allocates tasks to the cores such that the dynamic energy consumption is reduced; (ii) the second phase refines the allocation performed in the first phase in order to achieve better sleep states by trading off the dynamic energy consumption with the reduction in leakage energy consumption. This hybrid approach considers core frequency set-points, tasks energy consumption and sleep states of the cores to reduce the energy consumption of the system. Major value has been placed on a realistic power model which increases the practical relevance of the proposed approach. Finally, extensive simulations have been carried out to demonstrate the effectiveness of the proposed algorithm. In the best-case, savings up to 18% of energy are reached over the first fit algorithm, which has shown, in previous works, to perform better than other bin-packing heuristics for the target heterogeneous multicore platform.

Riesz potential versus fractional Laplacian

This paper starts by introducing the Grünwald–Letnikov derivative, the Riesz potential and the problem of generalizing the Laplacian. Based on these ideas, the generalizations of the Laplacian for 1D and 2D cases are studied. It is presented as a fractional version of the Cauchy–Riemann conditions and, finally, it is discussed with the n-dimensional Laplacian.

P-SOCRATES: A parallel software framework for time-critical many-core systems

Article in Press, Corrected Proof

Wii-Workouts on Chronic Pain, Physical Capabilities and Mood of Older Women: A Randomized Controlled Double Blind Trial

Chronic Low Back Pain (CLBP) is a public health problem and older women have higher incidence of this symptom, which affect body balance, functional capacity and behavior. The purpose of this study was to verifying the effect of exercises with Nintendo Wii on CLBP, functional capacity and mood of elderly. Thirty older women (68 ± 4 years; 68 ± 12 kg; 154 ± 5 cm) with CLBP participated in this study. Elderly individuals were divided into a Control Exercise Group (n = 14) and an Experimental Wii Group (n = 16). Control Exercise Group did strength exercises and core training, while Experimental Wii Group did ones additionally to exercises with Wii. CLBP, balance, functional capacity and mood were assessed pre and post training by the numeric pain scale, Wii Balance Board, sit to stand test and Profile of Mood States, respectively. Training lasted eight weeks and sessions were performed three times weekly. MANOVA 2 x 2 showed no interaction on pain, siting, stand-up and mood (P = 0.53). However, there was significant difference within groups (P = 0.0001). ANOVA 2 x 2 showed no interaction for each variable (P > 0.05). However, there were significant differences within groups in these variables (P < 0.05). Tukey's post-hoc test showed significant difference in pain on both groups (P = 0.0001). Wilcoxon and Mann-Whitney tests identified no significant differences on balance (P > 0.01). Capacity to Sit improved only in Experimental Wii Group (P = 0.04). In conclusion, physical exercises with Nintendo Wii Fit Plus additional to strength and core training were effective only for sitting capacity, but effect size was small.

Dynamic stability metrics for the container loading problem

The Container Loading Problem (CLP) literature has traditionally evaluated the dynamic stability of cargo by applying two metrics to box arrangements: the mean number of boxes supporting the items excluding those placed directly on the floor (M1) and the percentage of boxes with insufficient lateral support (M2). However, these metrics, that aim to be proxies for cargo stability during transportation, fail to translate real-world cargo conditions of dynamic stability. In this paper two new performance indicators are proposed to evaluate the dynamic stability of cargo arrangements: the number of fallen boxes (NFB) and the number of boxes within the Damage Boundary Curve fragility test (NB_DBC). Using 1500 solutions for well-known problem instances found in the literature, these new performance indicators are evaluated using a physics simulation tool (StableCargo), replacing the real-world transportation by a truck with a simulation of the dynamic behaviour of container loading arrangements. Two new dynamic stability metrics that can be integrated within any container loading algorithm are also proposed. The metrics are analytical models of the proposed stability performance indicators, computed by multiple linear regression. Pearson’s r correlation coefficient was used as an evaluation parameter for the performance of the models. The extensive computational results show that the proposed metrics are better proxies for dynamic stability in the CLP than the previous widely used metrics.