Protein buffering in model systems and in whole human saliva

The aim of this study was to quantify the buffer attributes (value, power, range and optimum) of two model systems for whole human resting saliva, the purified proteins from whole human resting saliva and single proteins. Two model systems, the first containing amyloglucosidase and lysozyme, and the second containing amyloglucosidase and alpha-amylase, were shown to provide, in combination with hydrogencarbonate and di-hydrogenphosphate, almost identical buffer attributes as whole human resting saliva. It was further demonstrated that changes in the protein concentration as small as 0.1% may change the buffer value of a buffer solution up to 15 times. Additionally, it was shown that there was a protein concentration change in the same range (0.16%) between saliva samples collected at the time periods of 13:00 and others collected at 9:00 am and 17:00. The mode of the protein expression changed between these samples corresponded to the change in basic buffer power and the change of the buffer value at pH 6.7. Finally, SDS Page and Ruthenium II tris (bathophenantroline disulfonate) staining unveiled a constant protein expression in all samples except for one 50 kDa protein band. As the change in the expression pattern of that 50 kDa protein band corresponded to the change in basic buffer power and the buffer value at pH 6.7, it was reasonable to conclude that this 50 kDa protein band may contain the protein(s) belonging to the protein buffer system of human saliva.

Search for new phenomena in events with three charged leptons at a center-of-mass energy of 7 TeV with the ATLAS detector

A generic search for anomalous production of events with at least three charged leptons is presented. The search uses a pp-collision data sample at a center-of-mass energy of root s = 7 TeV corresponding to 4.6 fb(-1) of integrated luminosity collected in 2011 by the ATLAS detector at the CERN Large Hadron Collider. Events are required to contain at least two electrons or muons, while the third lepton may either be an additional electron or muon, or a hadronically decaying tau lepton. Events are categorized by the presence or absence of a reconstructed tau-lepton or Z-boson candidate decaying to leptons. No significant excess above backgrounds expected from Standard Model processes is observed. Results are presented as upper limits on event yields from non-Standard-Model processes producing at least three prompt, isolated leptons, given as functions of lower bounds on several kinematic variables. Fiducial efficiencies for model testing are also provided. The use of the results is illustrated by setting upper limits on the production of doubly charged Higgs bosons decaying to same-sign lepton pairs.

Search for new phenomena in the W W to ell u ell' u' final state in pp collisions at sqrts=7 TeV with the ATLAS detector

This Letter reports a search for a heavy particle that decays to WW using events produced in pp collisions at root s = 7 TeV. The data were recorded in 2011 by the ATLAS detector and correspond to an integrated luminosity of 4.7 fb(-1). WW -> lvl'v' (l,l' = e or mu) final states are considered and the distribution of the transverse mass of the W W candidates is found to be consistent with Standard Model expectations. Upper limits on the production cross section times branching ratio into W boson pairs are set for Randall-Sundrum and bulk Randall-Sundrum gravitons, which result in observed 95% CL lower limits on the masses of the two particles of 1.23 TeV and 0.84 TeV, respectively.

Search for new phenomena in final states with large jet multiplicities and missing transverse momentum at sqrt(s)=8 TeV proton-proton collisions using the ATLAS experiment

A search is presented for new particles decaying to large numbers (7 to greater or equal to 10) of jets, missing transverse momentum and no isolated electrons or muons. This analysis uses 20.3/fb of pp collision data at sqrt(s)=8 TeV collected by the ATLAS experiment at the Large Hadron Collider. The sensitivity of the search is enhanced by considering the number of b-tagged jets and the scalar sum of masses of large-radius jets in an event. No evidence is found for physics beyond the Standard Model. The results are interpreted in the context of various simplified supersymmetry-inspired models where gluinos are pair produced, as well as a mSUGRA/CMSSM model.

Scheduling in service systems: an application in the event-tourism industry

This paper deals with an event-bus tour booked by Bollywood film fans. During the tour, the participants visit selected locations of famous Bollywood films at various sites in Switzerland. Moreover, the tour includes stops for lunch and shopping. Each day, up to five buses operate the tour; for organizational reasons, two or more buses cannot stay at the same location simultaneously. The planning problem is how to compute a feasible schedule for each bus such that the total waiting time (primary objective) and the total travel time (secondary objective) are minimized. We formulate this problem as a mixed-integer linear program, and we report on computational results obtained with the Gurobi solver.

Overthrowing the Tyranny of Alphabetical Ordering in Documentation Systems

Software developers are often unsure of the exact name of the API method they need to use to invoke the desired behavior. Most state-of-the-art documentation browsers present API artefacts in alphabetical order. Albeit easy to implement, alphabetical order does not help much: if the developer knew the name of the required method, he could have just searched for it in the first place. In a context where multiple projects use the same API, and their source code is available, we can improve the API presentation by organizing the elements in the order in which they are more likely to be used by the developer. Usage frequency data for methods is gathered by analyzing other projects from the same ecosystem and this data is used then to improve tools. We present a preliminary study on the potential of this approach to improve the API presentation by reducing the time it takes to find the method that implements a given feature. We also briefly present our experience with two proof-of-concept tools implemented for Smalltalk and Java.