A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem

In practice, parallel-machine job-shop scheduling (PMJSS) is very useful in the development of standard modelling approaches and generic solution techniques for many real-world scheduling problems. In this paper, based on the analysis of structural properties in an extended disjunctive graph model, a hybrid shifting bottleneck procedure (HSBP) algorithm combined with Tabu Search metaheuristic algorithm is developed to deal with the PMJSS problem. The original-version SBP algorithm for the job-shop scheduling (JSS) has been significantly improved to solve the PMJSS problem with four novelties: i) a topological-sequence algorithm is proposed to decompose the PMJSS problem into a set of single-machine scheduling (SMS) and/or parallel-machine scheduling (PMS) subproblems; ii) a modified Carlier algorithm based on the proposed lemmas and the proofs is developed to solve the SMS subproblem; iii) the Jackson rule is extended to solve the PMS subproblem; iv) a Tabu Search metaheuristic algorithm is embedded under the framework of SBP to optimise the JSS and PMJSS cases. The computational experiments show that the proposed HSBP is very efficient in solving the JSS and PMJSS problems.

The power of historical causal components involved in engaging at risk youth at three alternative schools

This article addresses the causal powers associated with the social phenomena of alternative schooling for youth at risk. It stems from a doctoral thesis, Alternative Schooling Programs for At Risk Youth – Three Case Studies which addresses wider issues integral to alternative schooling: youth at risk, alternative schooling models, and literacy. This article explores one aspect of alternative schooling: the historical causal factors involved in the establishment and continuance of three alternative case study models in Queensland, Australia. By adhering to Bhaskar’s transformational model of social activity (TMSA) , social structures and individuals will be analytically distinguished to uncover their separate causal powers and how these have effected the establishment and continuance of three alternative schools.

The internetalisation of information, knowledge and interaction components of the firm’s internationalisation process

Transcending traditional national borders, the Internet is an evolving technology that has opened up many new international market opportunities. However, ambiguity remains, with limited research and understanding of how the Internet influences the firm’s internationalisation process components. As a consequence, there has been a call for further investigation of the phenomenon. Thus, the purpose of this study was to investigate the Internet’s impact on the internationalisation process components, specifically, information availability, information usage, interactive communication and international market growth. Analysis was undertaken using structural equation modelling. Findings highlight the mediating impact of the Internet on information and knowledge transference in the internationalisation process. Contributions of the study test conceptualisations and give statistical validation of interrelationships, while illuminating the Internet’s impact on firm internationalisation.

The contribution of seat components to seat hardness and the interface between human occupant and a driver seat

Effective digital human model (DHM) simulation of automotive driver packaging ergonomics, safety and comfort depends on accurate modelling of occupant posture, which is strongly related to the mechanical interaction between human body soft tissue and flexible seat components. This paper comprises: a study investigating the component mechanical behaviour of a spring-suspended, production level seat when indented by SAE J826 type, human thigh-buttock representing hard shell; a model of seated human buttock shape for improved indenter design using a multivariate representation of Australian population thigh-buttock anthropometry; and a finite-element study simulating the deflection of human buttock and thigh soft tissue when seated, based on seated MRI. The results of the three studies provide a description of the mechanical properties of the driver-seat interface, and allow validation of future dynamic simulations, involving multi-body and finite-element (FE) DHM in virtual ergonomic studies.

Machine vision toolbox for MATLAB, release 3 [Software]

The Toolbox, combined with MATLAB ® and a modern workstation computer, is a useful and convenient environment for investigation of machine vision algorithms. For modest image sizes the processing rate can be sufficiently ``real-time'' to allow for closed-loop control. Focus of attention methods such as dynamic windowing (not provided) can be used to increase the processing rate. With input from a firewire or web camera (support provided) and output to a robot (not provided) it would be possible to implement a visual servo system entirely in MATLAB. Provides many functions that are useful in machine vision and vision-based control. Useful for photometry, photogrammetry, colorimetry. It includes over 100 functions spanning operations such as image file reading and writing, acquisition, display, filtering, blob, point and line feature extraction, mathematical morphology, homographies, visual Jacobians, camera calibration and color space conversion.

Catalytic components of proteasomes and the regulation of proteinase activity

The proteasome (multicatalytic proteinase complex) is a large multimeric complex which is found in the nucleus and cytoplasm of eukaryotic cells. It plays a major role in both ubiquitin-dependent and ubiquitin-independent nonlysosomal pathways of protein degradation. Proteasome subunits are encoded by members of the same gene family and can be divided into two groups based on their similarity to the c~ and /3 subunits of the simpler proteasome isolated from Thermoplasma acidophilum. Proteasomes have a cylindrical structure composed of four rings of seven subunits. The 26S form of the proteasome, which is responsible for ubiquitin-dependent proteolysis, contains additional regulatory complexes. Eukaryotic proteasomes have multiple catalytic activities which are catalysed at distinct sites. Since proteasomes are unrelated to other known proteases, there are no clues as to which are the catalytic components from sequence alignments. It has been assumed from studies with yeast mutants that /3-type subunits play a catalytic role. Using a radiolabelled peptidyl chloromethane inhibitor of rat liver proteasomes we have directly identified RC7 as a catalytic component. Interestingly, mutants in Prel, the yeast homologue of RC7, have already been reported to have defective chymotrypsin-like activity. These results taken together confirm a direct catalytic role for these/3-type subunits. Proteasome activities are sensitive to conformational changes and there are several ways in which proteasome function may be modulated in vivo. Our recent studies have shown that in animal cells at least two proteasome subunits can undergo phosphorylation, the level of which is likely to be important for determining proteasome localization, activity or ability to form larger complexes. In addition, we have isolated two isoforms of the 26S proteinase.

ATR-FTIR measurement of biomass components in phosphonium ionic liquids

Qualitative and quantitative measurements of biomass components dissolved in the phosphonium ionic liquids (ILs), trihexyltetradecylphosphonium chloride ([P66614]Cl) and tributylmethylphosphonium methylsulphate ([P4441]MeSO 4), are obtained using attenuated total reflectance-FTIR. Absorption bands related to cellulose, hemicelluloses, and lignin dissolution monitored in situ in biomass-IL mixtures indicate lignin dissolution in both ILs and some holocellulose dissolution in the hydrophilic [P4441]MeSO 4. The kinetics of lignin dissolution reported here indicate that while dissolution in the hydrophobic IL [P66614]Cl appears to follow an accepted mechanism of acid catalyzed -aryl ether cleavage, dissolution in the hydrophilic IL [P4441]MeSO 4 does not appear to follow this mechanism and may not be followed by condensation reactions (initiated by reactive ketones). The measurement of lignin dissolution in phosphonium ILs based on absorbance at 1510 cm 1 has demonstrated utility. When coupled with the gravimetric Klason lignin method, ATR-FTIR study of reaction mixtures can lead to a better understanding of the delignification process. © 2012 Copyright Taylor and Francis Group, LLC.

Clustering composite SaaS components in cloud computing using a grouping genetic algorithm

Recently, Software as a Service (SaaS) in Cloud computing, has become more and more significant among software users and providers. To offer a SaaS with flexible functions at a low cost, SaaS providers have focused on the decomposition of the SaaS functionalities, or known as composite SaaS. This approach has introduced new challenges in SaaS resource management in data centres. One of the challenges is managing the resources allocated to the composite SaaS. Due to the dynamic environment of a Cloud data centre, resources that have been initially allocated to SaaS components may be overloaded or wasted. As such, reconfiguration for the components’ placement is triggered to maintain the performance of the composite SaaS. However, existing approaches often ignore the communication or dependencies between SaaS components in their implementation. In a composite SaaS, it is important to include these elements, as they will directly affect the performance of the SaaS. This paper will propose a Grouping Genetic Algorithm (GGA) for multiple composite SaaS application component clustering in Cloud computing that will address this gap. To the best of our knowledge, this is the first attempt to handle multiple composite SaaS reconfiguration placement in a dynamic Cloud environment. The experimental results demonstrate the feasibility and the scalability of the GGA.

Detecting common dynamics in transitory components

This paper considers VECMs for variables exhibiting cointegration and common features in the transitory components. While the presence of cointegration between the permanent components of series reduces the rank of the long-run multiplier matrix, a common feature among the transitory components leads to a rank reduction in the matrix summarizing short-run dynamics. The common feature also implies that there exists linear combinations of the first-differenced variables in a cointegrated VAR that are white noise and traditional tests focus on testing for this characteristic. An alternative, however, is to test the rank of the short-run dynamics matrix directly. Consequently, we use the literature on testing the rank of a matrix to produce some alternative test statistics. We also show that these are identical to one of the traditional tests. The performance of the different methods is illustrated in a Monte Carlo analysis which is then used to re-examine an existing empirical study. Finally, this approach is applied to provide a check for the presence of common dynamics in DSGE models.

Impact of the introduction of machine gaming in Queensland on minor and major bingo

Material for this paper comes from as report commissioned by the Department of Family Services, Aboriginal and Islander Affairs. The report is the result of a multi strategy research project designed to assess the impact of gaming machines on the fundraising capacity of charitable and community organisations in Queensland. The study was conducted during the 1993 calendar year. The first Queensland gaming machine was commissioned on the 11 February, 1992 at 11.30 am in Brisbane at the Kedron Wavell Services Club. Eighteen more clubs followed that week. Six months later there were gaming machines in 335 clubs, and 250 hotels and taverns, representing a state wide total of 7,974 machines in operation. The 10,000 gaming machine was commissioned on the 18 March, 1993 and the 1,000 operational gaming machine site was opened on 18th February, 1994.

Performance analysis of PTP components for IEC 61850 process bus applications

New substation automation applications, such as sampled value process buses and synchrophasors, require sampling accuracy of 1 µs or better. The Precision Time Protocol (PTP), IEEE Std 1588, achieves this level of performance and integrates well into Ethernet based substation networks. This paper takes a systematic approach to the performance evaluation of commercially available PTP devices (grandmaster, slave, transparent and boundary clocks) from a variety of manufacturers. The ``error budget'' is set by the performance requirements of each application. The ``expenditure'' of this error budget by each component is valuable information for a system designer. The component information is used to design a synchronization system that meets the overall functional requirements. The quantitative performance data presented shows that this testing is effective and informative. Results from testing PTP performance in the presence of sampled value process bus traffic demonstrate the benefit of a ``bottom up'' component testing approach combined with ``top down'' system verification tests. A test method that uses a precision Ethernet capture card, rather than dedicated PTP test sets, to determine the Correction Field Error of transparent clocks is presented. This test is particularly relevant for highly loaded Ethernet networks with stringent timing requirements. The methods presented can be used for development purposes by manufacturers, or by system integrators for acceptance testing. A sampled value process bus was used as the test application for the systematic approach described in this paper. The test approach was applied, components were selected, and the system performance verified to meet the application's requirements. Systematic testing, as presented in this paper, is applicable to a range of industries that use, rather than develop, PTP for time transfer.

A penalty-based grouping genetic algorithm for multiple composite SaaS components clustering in Cloud

Software as a Service (SaaS) in Cloud is getting more and more significant among software users and providers recently. A SaaS that is delivered as composite application has many benefits including reduced delivery costs, flexible offers of the SaaS functions and decreased subscription cost for users. However, this approach has introduced a new problem in managing the resources allocated to the composite SaaS. The resource allocation that has been done at the initial stage may be overloaded or wasted due to the dynamic environment of a Cloud. A typical data center resource management usually triggers a placement reconfiguration for the SaaS in order to maintain its performance as well as to minimize the resource used. Existing approaches for this problem often ignore the underlying dependencies between SaaS components. In addition, the reconfiguration also has to comply with SaaS constraints in terms of its resource requirements, placement requirement as well as its SLA. To tackle the problem, this paper proposes a penalty-based Grouping Genetic Algorithm for multiple composite SaaS components clustering in Cloud. The main objective is to minimize the resource used by the SaaS by clustering its component without violating any constraint. Experimental results demonstrate the feasibility and the scalability of the proposed algorithm.

A simulated annealing algorithm for energy efficient virtual machine placement

Improving energy efficiency has become increasingly important in data centers in recent years to reduce the rapidly growing tremendous amounts of electricity consumption. The power dissipation of the physical servers is the root cause of power usage of other systems, such as cooling systems. Many efforts have been made to make data centers more energy efficient. One of them is to minimize the total power consumption of these servers in a data center through virtual machine consolidation, which is implemented by virtual machine placement. The placement problem is often modeled as a bin packing problem. Due to the NP-hard nature of the problem, heuristic solutions such as First Fit and Best Fit algorithms have been often used and have generally good results. However, their performance leaves room for further improvement. In this paper we propose a Simulated Annealing based algorithm, which aims at further improvement from any feasible placement. This is the first published attempt of using SA to solve the VM placement problem to optimize the power consumption. Experimental results show that this SA algorithm can generate better results, saving up to 25 percentage more energy than First Fit Decreasing in an acceptable time frame.