Simultaneous biosorption of methylene blue and trivalent chromium onto olive stone

In this work, olive stone (OS) was utilized to investigate its capacity as biosorbent for methylene blue (MB) and Cr(III), which are usually present in textile industry effluents. Equilibrium and kinetic experiments were performed in batch experiments. The biosorption process followed pseudo-second-order kinetics. The equilibrium data were fitted with several models, but Langmuir and Sips models best reproduced the experimental results. Maximum biosorption capacities were 3.296 mg/g (0.0116 mmol/g) and 4.990 mg/g (0.0960 mmol/g) for MB and Cr(III), respectively. Several operation variables, such as
biosorbent mass, flow rate, and initial concentration on the removal of dye and metal, were evaluated in column system. The removal efficiency improved as OS mass increased and decreased when flow rate and initial concentration increased. Also, MB uptake was substantially decreased by increasing the initial concentration of Cr(III), ranging from 6.09 to 2.75 mg/g. These results show that the presence of Cr(III) significantly modifies the biosorption capacity of MB by the OS. These results suggest that OS is a potential low-cost food industry waste for textile industry wastewater treatment.

Mechanism of Alizarin Red S and Methylene Blue Biosorption onto Olive Stone: Isotherm study in Single and Binary Systems

The biosorption process of anionic dye Alizarin Red S (ARS) and cationic dye methylene blue (MB) as a function of contact time, initial concentration and solution pH onto olive stone (OS) biomass has been investigated. Equilibrium biosorption isotherms in single and binary systems and kinetics in batch mode were also examined. The kinetic data of the two dyes were better described by the pseudo second-order model. At low concentration, ARS dye appeared to follow a two-step diffusion process, while MB dye followed a three-step diffusion process. The biosorption experimental data for ARS and MB dyes were well suited to the Redlich-Peterson isotherm. The maximum biosorption of ARS dye, qmax = 16.10 mg/g, was obtained at pH 3.28 and the maximum biosorption of MB dye, qmax = 13.20 mg/g, was observed at basic pH values. In the binary system, it was indicated that the MB dye diffuses firstly inside the biosorbent particle and occupies the biosorption sites forming a monodentate complex and then the ARS dye enters and can only bind to untaken sites; forms a tridentate complex with OS active sites.

COS-STAR: a reporting guideline for studies developing core outcome sets (protocol)

BACKGROUND: Core outcome sets can increase the efficiency and value of research and, as a result, there are an increasing number of studies looking to develop core outcome sets (COS). However, the credibility of a COS depends on both the use of sound methodology in its development and clear and transparent reporting of the processes adopted. To date there is no reporting guideline for reporting COS studies. The aim of this programme of research is to develop a reporting guideline for studies developing COS and to highlight some of the important methodological considerations in the process.

METHODS/DESIGN: The study will include a reporting guideline item generation stage which will then be used in a Delphi study. The Delphi study is anticipated to include two rounds. The first round will ask stakeholders to score the items listed and to add any new items they think are relevant. In the second round of the process, participants will be shown the distribution of scores for all stakeholder groups separately and asked to re-score. A final consensus meeting will be held with an expert panel and stakeholder representatives to review the guideline item list. Following the consensus meeting, a reporting guideline will be drafted and review and testing will be undertaken until the guideline is finalised. The final outcome will be the COS-STAR (Core Outcome Set-STAndards for Reporting) guideline for studies developing COS and a supporting explanatory document.

DISCUSSION: To assess the credibility and usefulness of a COS, readers of a COS development report need complete, clear and transparent information on its methodology and proposed core set of outcomes. The COS-STAR guideline will potentially benefit all stakeholders in COS development: COS developers, COS users, e.g. trialists and systematic reviewers, journal editors, policy-makers and patient groups.

Core outcome sets and trial registries

Some reasons for registering trials might be considered as self-serving, such as satisfying the requirements of a journal in which the researchers wish to publish their eventual findings or publicising the trial to boost recruitment. Registry entries also help others, including systematic reviewers, to know about ongoing or unpublished studies and contribute to reducing research waste by making it clear what studies are ongoing. Other sources of research waste include inconsistency in outcome measurement across trials in the same area, missing data on important outcomes from some trials, and selective reporting of outcomes. One way to reduce this waste is through the use of core outcome sets: standardised sets of outcomes for research in specific areas of health and social care. These do not restrict the outcomes that will be measured, but provide the minimum to include if a trial is to be of the most use to potential users. We propose that trial registries, such as ISRCTN, encourage researchers to note their use of a core outcome set in their entry. This will help people searching for trials and those worried about selective reporting in closed trials. Trial registries can facilitate these efforts to make new trials as useful as possible and reduce waste. The outcomes section in the entry could prompt the researcher to consider using a core outcome set and facilitate the specification of that core outcome set and its component outcomes through linking to the original core outcome set. In doing this, registries will contribute to the global effort to ensure that trials answer important uncertainties, can be brought together in systematic reviews, and better serve their ultimate aim of improving health and well-being through improving health and social care.

A Fast Algorithm for Sparse Support Vector Machines for Mobile Computing Applications

This research presents a fast algorithm for projected support vector machines (PSVM) by selecting a basis vector set (BVS) for the kernel-induced feature space, the training points are projected onto the subspace spanned by the selected BVS. A standard linear support vector machine (SVM) is then produced in the subspace with the projected training points. As the dimension of the subspace is determined by the size of the selected basis vector set, the size of the produced SVM expansion can be specified. A two-stage algorithm is derived which selects and refines the basis vector set achieving a locally optimal model. The model expansion coefficients and bias are updated recursively for increase and decrease in the basis set and support vector set. The condition for a point to be classed as outside the current basis vector and selected as a new basis vector is derived and embedded in the recursive procedure. This guarantees the linear independence of the produced basis set. The proposed algorithm is tested and compared with an existing sparse primal SVM (SpSVM) and a standard SVM (LibSVM) on seven public benchmark classification problems. Our new algorithm is designed for use in the application area of human activity recognition using smart devices and embedded sensors where their sometimes limited memory and processing resources must be exploited to the full and the more robust and accurate the classification the more satisfied the user. Experimental results demonstrate the effectiveness and efficiency of the proposed algorithm. This work builds upon a previously published algorithm specifically created for activity recognition within mobile applications for the EU Haptimap project [1]. The algorithms detailed in this paper are more memory and resource efficient making them suitable for use with bigger data sets and more easily trained SVMs.

Inference in Polytrees with Sets of Probabilities

Inferences in directed acyclic graphs associated with probability intervals and sets of probabilities are NP-hard, even for polytrees. We propose: 1) an improvement on Tessem’s A/R algorithm for inferences on polytrees associated with probability intervals; 2) a new algorithm for approximate inferences based on local search; 3) branch-and-bound algorithms that combine the previous techniques. The first two algorithms produce complementary approximate solutions, while branch-and-bound procedures can generate either exact or approximate solutions. We report improvements on existing techniques for inference with probability sets and intervals, in some cases reducing computational effort by several orders of magnitude.