bluuebunny/crossref_metadata_2025 huggingface dataset:
Fast Censored Linear Regression
Authors: Huang Yijian
Published: September 2013

Weighted log‐rank estimating function has become a standard estimation method for the censored linear regression model, or the accelerated failure time model. Well established statistically, the estimator defined as a consistent root has, however, rather poor computational properties because the estimating function is neither continuous nor, in general, monotone. We propose a computationally efficient estimator through an asymptotics‐guided Newton algorithm, in which censored quantile regression methods are tailored to yield an initial consistent estimate and a consistent derivative estimate of the limiting estimating function. We also develop fast interval estimation with a new proposal for sandwich variance estimation. The proposed estimator is asymptotically equivalent to the consistent root estimator and barely distinguishable in samples of practical size. However, computation time is typically reduced by two to three orders of magnitude for point estimation alone. Illustrations with clinical applications are provided.
Intraoccupational Wage Dispersion
Authors: Pryor Frederic L.
Published: September 2013

This note explores the determinants of hourly wage dispersion of four‐digit occupations. Depending on how intraoccupational wage dispersion is measured, the ordinary least squares regression analysis can isolate two or three determinants, the most important of which is the average educational level of those in the occupation. Comparison of overall wage dispersion and the isolated determinants suggest that it seems likely that occupational wage dispersion should increase in coming years.
Texture‐dependent motion signals in primate middle temporal area
Authors: Gharaei Saba , Tailby Chris , Solomon Selina S. , Solomon Samuel G.
Published: September 2013

Key points

The receptive fields of neurons in the middle temporal (MT) area of primate visual cortex are an important stage in motion analysis. Some neurons in MT (pattern cells) can signal motion independent of contour orientation, but others (component cells) cannot; there is no systematic account of how responses in area MT depend on the spatial structure of images.

We measured the extracellular response of neurons in area MT of anaesthetised marmoset monkeys to synthetic textures and natural images.

Direction tuning of pattern cells was broad and largely stable against variation in spatial texture. Direction tuning of component cells was narrower than that of pattern cells when spatial textures contained few orientations, but tuning was not stable against variation in spatial texture.

Response variability in all neurons was lower for rich spatial texture.

Pattern and component cells may provide parallel analyses for motion vision.

Abstract  Neurons in the middle temporal (MT) area of primate cortex provide an important stage in the analysis of visual motion. For simple stimuli such as bars and plaids some neurons in area MT – pattern cells – seem to signal motion independent of contour orientation, but many neurons – component cells – do not. Why area MT supports both types of receptive field is unclear. To address this we made extracellular recordings from single units in area MT of anaesthetised marmoset monkeys and examined responses to two‐dimensional images with a large range of orientations and spatial frequencies. Component and pattern cell response remained distinct during presentation of these complex spatial textures. Direction tuning curves were sharpest in component cells when a texture contained a narrow range of orientations, but were similar across all neurons for textures containing all orientations. Response magnitude of pattern cells, but not component cells, increased with the spatial bandwidth of the texture. In addition, response variability in all neurons was reduced when the stimulus was rich in spatial texture. Fisher information analysis showed that component cells provide more informative responses than pattern cells when a texture contains a narrow range of orientations, but pattern cells had more informative responses for broadband textures. Component cells and pattern cells may therefore coexist because they provide complementary and parallel motion signals.
Are skeletal muscle FNDC5 gene expression and irisin release regulated by exercise and related to health?
Authors: Pekkala Satu , Wiklund Petri K. , Hulmi Juha J. , Ahtiainen Juha P. , Horttanainen Mia , Pöllänen Eija , Mäkelä Kari A. , Kainulainen Heikki , Häkkinen Keijo , Nyman Kai , Alén Markku , Herzig Karl‐Heinz , Cheng Sulin
Published: September 2013

Key points

Contradictory findings have been reported concerning the function of irisin and its precursor gene, skeletal muscle FNDC5, in energy homeostasis and metabolic health, and the associated regulatory role of exercise and PGC‐1α.

We analysed the effects of different short‐ and long‐term exercise regimens on muscle FNDC5 and PGC‐1α, and serum irisin, and studied the associations of irisin and FNDC5 with health parameters.

FNDC5 and serum irisin did not change after acute aerobic, long‐term endurance training or endurance training combined with resistance exercise (RE) training, or associate with metabolic disturbances. A single RE bout increased FNDC5 mRNA in young, but not older men (27 vs. 62 years). Changes in PGC‐1α or serum irisin were not consistently accompanied by changes in FNDC5.

Our data suggest that the effects of exercise on FNDC5 and irisin are not consistent, and that their role in health is questionable. Moreover, the regulatory mechanisms should be studied further.

Abstract  Recently, contradictory findings have been reported concerning the function of irisin and its precursor gene, skeletal muscle FNDC5, in energy homeostasis, and the associated regulatory role of exercise and PGC‐1α. We therefore evaluated whether muscle FNDC5 mRNA and serum irisin are exercise responsive and whether PGC‐1α expression is associated with FNDC5 expression. The male subjects in the study performed single exercises: (1) 1 h low‐intensity aerobic exercise (AE) (middle‐aged, n= 17), (2) a heavy‐intensity resistance exercise (RE) bout (young n= 10, older n= 11) (27 vs. 62 years), (3) long‐term 21 weeks endurance exercise (EE) training alone (twice a week, middle‐aged, n= 9), or (4) combined EE and RE training (both twice a week, middle‐aged, n= 9). Skeletal muscle mRNA expression was analysed by quantitative PCR and serum irisin by ELISA. No significant changes were observed in skeletal muscle PGC‐1α, FNDC5 and serum irisin after AE, EE training or combined EE + RE training. However, a single RE bout increased PGC‐1α by 4‐fold in young and by 2‐fold in older men, while FNDC5 mRNA only increased in young men post‐RE, by 1.4‐fold. Changes in PGC‐1α or serum irisin were not consistently accompanied by changes in FNDC5. In conclusion, for the most part, neither longer‐term nor single exercise markedly increases skeletal muscle FNDC5 expression or serum irisin. Therefore their changes in response to exercise are probably random and not consistent excluding the confirmation of any definitive link between exercise and FNDC5 expression and irisin release in humans. Moreover, irisin and FNDC5 were not associated with glucose tolerance and being overweight, or with metabolic disturbances, respectively. Finally, factor(s) other than PGC‐1α and transcription may regulate FNDC5 expression.
Optimized MEMS Pirani sensor with increased pressure measurement sensitivity in the fine and high vacuum regime
Authors: Völklein Friedemann , Grau Mario , Meier Andreas , Hemer Grit , Breuer Lars , Woias Peter
Published: September 2013

An optimized microelectromechanical systems Pirani sensor with increased sensitivity for pressure measurements in the fine and high vacuum regime (from 100 to 10−6 Torr) is presented. Theoretical calculations of the signal voltage as a function of pressure are in good agreement with the measured voltage–pressure response. Fabrication technologies, design optimization using thermal modeling and finite element method simulations, and measurement results are presented.
Surface initiated atom transfer radical polymerization grafting of sodium styrene sulfonate from titanium and silicon substrates
Authors: Foster Rami N. , Keefe Andrew J. , Jiang Shaoyi , Castner David G.
Published: September 2013

This study investigates the grafting of poly-sodium styrene sulfonate (pNaSS) from trichlorosilane/10-undecen-1-yl 2-bromo-2-methylpropionate functionalized Si and Ti substrates by atom transfer radical polymerization (ATRP). The composition, molecular structure, thickness, and topography of the grafted pNaSS films were characterized with x-ray photoelectron spectroscopy (XPS), time-of-flight secondary ion mass spectrometry (ToF-SIMS), variable angle spectroscopic ellipsometry (VASE), and atomic force microscopy (AFM), respectively. XPS and ToF-SIMS results were consistent with the successful grafting of a thick and uniform pNaSS film on both substrates. VASE and AFM scratch tests showed the films were between 25 and 49 nm thick on Si, and between 13 and 35 nm thick on Ti. AFM determined root-mean-square roughness values were ∼2 nm on both Si and Ti substrates. Therefore, ATRP grafting is capable of producing relatively smooth, thick, and chemically homogeneous pNaSS films on Si and Ti substrates. These films will be used in subsequent studies to test the hypothesis that pNaSS-grafted Ti implants preferentially adsorb certain plasma proteins in an orientation and conformation that modulates the foreign body response and promotes formation of new bone.
Observation of Partial Wave Resonances in Low-Energy O
2
–H
2
Inelastic Collisions
Authors: Chefdeville Simon , Kalugina Yulia , van de Meerakker Sebastiaan Y. T. , Naulin Christian , Lique François , Costes Michel
Published: September 2013

Quantum Collision Course

Our experience of a world apparently governed by classical physics is a consequence of the fact that quantum mechanical effects average out in size regimes much larger than nanometers. Even at the molecular level, the quantized nature of rotational energy distributions is often obscured by averaging effects.

Chefdeville
et al.

(p.
1094
; see the Perspective by

Casavecchia and Alexander

) have observed a striking manifestation of quantized rotation in the scattering trajectories of colliding H
2
and O
2
molecular beams. The experimentally resolved partial wave resonances show essentially complete agreement with theoretical calculations and deviate starkly from classical collision paradigms.
Mysterious Travelers Revisited
The Avian Migrant
The Biology of Bird Migration

by John H. Rappole

Columbia University Press, New York, 2013. 457 pp. $80, £55. ISBN 9780231146784.
Authors: Bairlein Franz
Published: September 2013

Tapping the extensive literature and his own research, Rappole offers a personal "reflective inquiry" on the ecology and evolution of avian migrants.
The Endoplasmic Reticulum Acts as a Platform for Ubiquitylated Components of Nuclear Factor κB Signaling
Authors: Alexia Catherine , Poalas Konstantinos , Carvalho Gabrielle , Zemirli Naima , Dwyer Julie , Dubois Sonia M. , Hatchi Emeline M. , Cordeiro Nelia , Smith Sherri S. , Castanier Céline , Le Guelte Armelle , Wan Liling , Kang Yibin , Vazquez Aimé , Gavard Julie , Arnoult Damien , Bidère Nicolas
Published: September 2013

The endoplasmic reticulum functions as a key subcellular gateway for NF-κB activation.
Branching Out
Authors: Ferrarelli Leslie K.
Published: September 2013

The cell-cycle kinase CDK6 promotes two distinct transcriptional pathways that inhibit proliferation or promote angiogenesis.
Culture-Negative Prosthetic Valve Endocarditis with Concomitant Septicemia Due to a Nontoxigenic Corynebacterium diphtheriae Biotype Gravis Isolate in a Patient with Multiple Risk Factors
Authors: Clinton Lani Kai , Bankowski Matthew J. , Shimasaki Teppei , Sae-Ow Wichit , Whelen A. Christian , O'Connor Norman , Kim Wesley , Young Royden
Published: September 2013

A 54-year-old female with a prosthetic mitral valve presented with a 3-day history of dizziness, subjective fever, and chills. Blood cultures were positive for a pleomorphic Gram-positive rod. Initial phenotypic testing could only support the identification of aCorynebacteriumspecies. Nucleic acid sequencing (16S rRNA) and matrix-assisted laser desorption ionization–time of flight mass spectrometry (MALDI-TOF MS) were conclusive forCorynebacterium diphtheriae. Definitive phenotypic testing classified the strain as nontoxigenicC. diphtheriaebiotype Gravis.
Atomic Structure of Cucumber Necrosis Virus and the Role of the Capsid in Vector Transmission
Authors: Li Ming , Kakani Kishore , Katpally Umesh , Johnson Sharnice , Rochon D'Ann , Smith Thomas J.
Published: September 2013

Cucumber Necrosis Virus
(CNV) is a member of the genus
Tombusvirus
and has a monopartite positive-sense RNA genome packaged in a T=3 icosahedral particle. CNV is transmitted in nature via zoospores of the fungus
Olpidium bornovanus
. CNV undergoes a conformational change upon binding to the zoospore that is required for transmission, and specific polysaccharides on the zoospore surface have been implicated in binding. To better understand this transmission process, we have determined the atomic structure of CNV. As expected, being a member of the
Tombusvirus
genus, the core structure of CNV is highly similar to that of
Tomato bushy stunt virus
(TBSV), with major differences lying on the exposed loops. Also, as was seen with TBSV, CNV appears to have a calcium binding site between the subunits around the quasi-3-fold axes. However, unlike TBSV, there appears to be a novel zinc binding site within the β annulus formed by the N termini of the three C subunits at the icosahedral 3-fold axes. Two of the mutations causing defective transmission map immediately around this zinc binding site. The other mutations causing defective transmission and particle formation are mapped onto the CNV structure, and it is likely that a number of the mutations affect zoospore transmission by affecting conformational transitions rather than directly affecting receptor binding.
Seeing the unseen: diagnosing acromegaly in a dental setup
Authors: Agrawal Mamta , Maitin Nitin , Rastogi Khushboo , Bhushan Rajarshi
Published: September 2013

Acromegaly is a rare metabolic condition in adults caused due to over secretion of growth hormone mostly due to pituitary gland adenomas.Disproportionate skeletal, tissue and organ growth are characteristic of acromegaly but the changes may be so insidious that most of the times go unnoticed by the patient and family. Craniofacial soft tissue and skeletal changes including mandibular prognathism and disturbed occlusion are typical manifestations of the disease process. Dental professionals may be the first healthcare providers to be visited by these patients and thereby prove instrumental in early diagnosis. Here we report the diagnosis of a case of acromegaly in a dental setup.
The stages of extrication: a prospective study
Authors: Nutbeam Tim , Fenwick Rob , Hobson Charles , Holland Vikki , Palmer Michael
Published: September 2013

Background

Many patients will require extrication following a motor vehicle collision (MVC). Little information exists on the time taken for the various stages of extrication.

Objective

To report the time taken for the various stages of extrication.

Methods

A prospective, observational study carried out in the West Midland Fire Service's metropolitan area. Time points related to extrication were collected ‘live’ by two-way radio broadcast. Any missing data were actively gathered by fire control within 1 h of completion of extrication. This paper reports an interim analysis conducted after 1 year of data collection following a 3-month run-in and training period: data were analysed from 1 January 2011 to 31 December 2011 inclusive.

Results

During the study period 228 incidents were identified. Seventy-nine were excluded as they met the predetermined exclusion criteria or had incomplete data collection. This left 158 extrications that were suitable for analysis. The median time for extrication was 30 min, IQR 24–38 min.

Conclusions

In patients requiring extrication following an MVC a median time of 8 min is typically required before initial limited patient assessment and intervention. A further 22 min is typically required before full extrication. Prehospital personnel should be aware of these times when planning their approach to a trapped patient.
Cholesteryl ester storage disease: a rare and possibly treatable cause of premature vascular disease and cirrhosis
Authors: Reynolds Tim
Published: September 2013

Cholesteryl ester storage disease (CESD) is an autosomal recessive lysosomal storage disorder caused by a variety of mutations of the LIPA gene. These cause reduced activity of lysosomal acid lipase, which results in accumulation of cholesteryl esters in lysosomes. If enzyme activity is very low/absent, presentation is in infancy with failure to thrive, malabsorption, hepatosplenomegaly and rapid early death (Wolman disease). With higher but still low enzyme activity, presentation is later in life with hepatic fibrosis, dyslipidaemia and early atherosclerosis.Identification of this rare disorder is difficult as it is essential to assay leucocyte acid phosphatase activity. An assay using specific inhibitors has now been developed that facilitates measurement in dried blood spots. Treatment of CESD has until now been limited to management of the dyslipidaemia, but this does not influence the liver effects. A new enzyme replacement therapy (Sebelipase) has now been developed that could change treatment options for the future.
The effect of state preparation in a many-body system
Authors: Chaudhry Adam Zaman , Gong Jiangbin
Published: September 2013

For a quantum system interacting with its environment, the role of state preparation is nontrivial. The reason is that before the state preparation procedure, the system and the environment are correlated. Consequently, the state preparation procedure (which acts on the system) indirectly influences the state of the environment depending on the state preparation. In this paper, we use an experimentally realizable model describing a collection of N two-level atoms coupled to a common environment to investigate the influence of the state preparation procedure. We show that the dynamical map describing the evolution of the open quantum system can depend appreciably on the state preparation procedure. Moreover, this effect can be enhanced by increasing N. Our results should be useful for quantum control and quantum tomography.
Evidence for thermally mediated settlement in lobster larvae (Homarus americanus)
Authors: Annis Eric R. , Wilson Carl J. , Russell Robert , Yund Philip O.
Published: September 2013

We examined the potential for bottom temperatures ≤12 °C to inhibit successful recruitment of planktonic lobster postlarvae to the benthos. In laboratory trials, postlarvae held at 11 °C exhibited higher mortality, slower development, and reduced size increase at molt relative to postlarvae held at 13 °C. We sampled at field sites within Machias Bay, Maine (mean bottom temperature 12.39 °C, 46.1 degree-days ≥12 °C) and at the mouth of the bay (mean bottom temperature 11.57 °C, 5.1 degree-days ≥12 °C), where temperature was influenced by the cold Eastern Maine Coastal Current (EMCC). We found significantly higher settlement at the warm inshore site but, the abundance of competent planktonic postlarvae was not significantly different between sites, indicating a disconnect between postlarval abundance and settlement. Regional sampling of newly settled lobsters revealed a pattern of higher settlement at inshore sites extending across a broader coastal region impacted by the EMCC. Our results suggest that small differences in water temperature may shape settlement patterns through either behavioral avoidance of colder settlement sites or elevated postsettlement mortality of postlarvae settling at colder sites.
MICROSCOPIC ANALYSIS OF SHAPE EVOLUTION IN Mo ISOTOPES
Authors: OUDIH M. R. , FELLAH M. , ALLAL N. H. , BENHAMOUDA N.
Published: September 2013

The shape evolution of even–even Mo isotopes from the line of stability up to the two-neutron drip-line is investigated within the self-consistent Hartree–Fock–Bogoliubov theory in both the axial and triaxial symmetries. The Skyrme energy density functional SLy4 has been considered in the particle-hole channel, while the zero range delta-interaction has been employed in the particle–particle channel. In order to correctly treat the pairing correlations, a particle-number projection was carried out by the Lipkin–Nogami (LN) method. The two-neutron separation energies and root-mean-square (rms) charge radii are investigated and compared with available experimental data. The evolution of the potential energy surfaces in the (β, γ) deformation plane is presented and discussed. In addition, the obtained ground state deformation parameters are compared to those obtained by other models.
COSMOLOGICAL DYNAMICS OF f(R) GRAVITY SCALAR DEGREE OF FREEDOM IN EINSTEIN FRAME
Authors: GOSWAMI UMANANDA DEV , DEKA KABITA
Published: September 2013

f(R) gravity models belong to an important class of modified gravity models where the late time cosmic accelerated expansion is considered as a manifestation of the large scale modification of the force of gravity. f(R) gravity models can be expressed in terms of a scalar degree of freedom by redefinition of model's variable. The conformal transformation of the action from Jordan frame to Einstein frame makes the scalar degree of freedom more explicit and can be studied conveniently. We have investigated the features of the scalar degree of freedoms and the consequent cosmological implications of the power-law (ξRn) and the Starobinsky (disappearing cosmological constant) f(R) gravity models numerically in the Einstein frame. Both the models show interesting behavior of their scalar degree of freedom and could produce the accelerated expansion of the universe in the Einstein frame with the negative equation of state of the scalar field. However, the scalar field potential for the power-law model is the well-behaved function of the field, whereas the potential becomes flat for higher value of field in the case of the Starobinsky model. Moreover, the equation of state of the scalar field for the power-law model is always negative and less than -1/3, which corresponds to the behavior of the dark energy, that produces the accelerated expansion of the universe. This is not always the case for the Starobinsky model. At late times, the Starobinsky model behaves as cosmological constant Λ as behaves by power-law model for the values of n → 2 at all times.
SHORT- AND LONG-RANGE MULTIPLICITY CORRELATIONS IN RELATIVISTIC HEAVY-ION COLLISIONS
Authors: AHMAD SHAKEEL , CHANDRA ANUJ , ZAFAR M. , IRFAN M. , AHMAD A.
Published: September 2013

Forward–backward (FB) charge correlations are investigated by analyzing experimental data on 16 O – AgBr interactions at 14.5A, 60A and 200A GeV . Findings are compared with the predictions of Monte Carlo model, heavy-ion jet interaction generater (HIJING). The results reveal that the observed correlations are mainly of short-range type, which arise due to the decay of clusters and/or resonances produced in the central rapidity region. The range of FB correlations are observed to extend with increasing beam energy. However, there is no evidence for the presence of long-range correlations even at the highest incident energy considered.
FLEXIBLE DETERMINISTIC JOINT REMOTE STATE PREPARATION OF SOME STATES
Authors: PENG JIA-YIN , LUO MING-XING , MO ZHI-WEN , LIU HAO-WEN
Published: September 2013

We provide a new joint remote preparation scheme for some states. By designing some appropriate measurement bases, two separate parties can jointly prepare a three-qubit state for a remote receiver. The receiver may be assigned during the remote preparation progress. This scheme is extended to M > 2 senders for special two-qubit state. Our scheme succeeds with unit probability and is applicable to a certain realistic situation.
ONE-STEP SYNTHESIS OF BIOCOMPATIBLE CHITOSAN/NaGdF4:Eu3+ NANOCOMPOSITE WITH FLUORESCENT AND MAGNETIC PROPERTIES FOR BIOIMAGING
Authors: LI HUI , WANG CHUANXI , JIANG YINGNAN , CUI ZHANCHEN , LIN QUAN
Published: September 2013

Lanthanide-doped luminescent nanoscale materials have great potential applications in biological researches. Herein, we reported a novel and mild method for one-step synthesis of chitosan/ NaGdF 4: Eu 3+ nanocomposites. The luminescent Eu 3+ ions and magnetic resonance imaging (MRI) contrast agent Gd 3+ ions were incorporated to these biocompatible nanocomposites. The resultant nanocomposites exhibited strong fluorescence and attractive magnetic features. The nanocomposites also have pure hexagonal phase with uniform size of about 65 nm. FT-IR spectra revealed that these nanocomposites were successfully coated by hydrophilic chitosan, whose amine groups conferred the nanocomposites excellent dispensability in aqueous solution. Besides, the MTT assay and laser confocal microscopy images have confirmed the good biocompatibility of the nanocomposites. These results indicated that the as-prepared nanocomposites could be used as an excellent targeted imaging agent in biological fields.
MUTUAL ARTIFICIAL BEE COLONY ALGORITHM FOR MOLECULAR DOCKING
Authors: MA RUIXIN , XU XIUJUAN , ZHAO LEI , CAO REN , FANG QIANG
Published: September 2013

Molecular docking method plays an important role on the quest of potential drug candidates, which has been proven to be a valuable tool for virtual screening. Molecular docking is commonly referred to as a parameter optimization problem. During the last decade, some optimization algorithms have been introduced, such as Lamarckian genetic algorithm (LGA) and SODOCK embedded in the AutoDock program. On the basis of the latest docking software AutoDock4.2, we present a novel docking program ABCDock, which incorporates mutual artificial bee colony (MutualABC) into AutoDock. Computer simulation results demonstrate that ABCDock takes precedence over AutoDock and SODOCK, in terms of convergence performance, accuracy, and the lowest energy, especially for highly flexible ligands. It is noteworthy that ABCDock yields a higher success rate. Also, in comparison with the other state-of-the-art docking methods, namely GOLD, DOCK and FlexX, ABCDock provides the smallest RMSD in 27 of 37 cases.
SPARSE APPROXIMATION AND FIT OF INTRADAY LOAD CURVES IN A HIGH DIMENSIONAL FRAMEWORK
Authors: MOUGEOT MATHILDE , PICARD DOMINIQUE , TRIBOULEY KARINE , LEFIEUX VINCENT , MAILLARD-TEYSSIER LAURENCE
Published: September 2013

An important perspective in electric consumption obviously is the forecasting. A crucial step in the forecasting process is the modeling. It is commonly admitted that many variables are influential for the prediction in this context. On the other hand, a prediction, to be robust and efficient, has necessarily to rely on a small number of well chosen predictors. We are typically in a situation where sparse multidimensional modeling can bring an essential input, and this paper is an attempt to prove it. In this perspective, we shall address the question of providing a sparse representation of the intraday load curves, with good approximation properties.

One difficulty is that we have here a large set of potential predictors among climate variables and shape "patterns", and even if high dimensional sparse methods have clearly as objective to select among a large number of covariates, they are especially efficient when the predictors are not too correlated. So our task is twofold: first we need to operate a preselection of the predictors, and then use an appropriate sparse method.

The first part and especially when shape patterns are concerned is not simple. We solve this aspect using a pre-processing in three steps process. We first provide a sparse modeling of the intraday load curves as functions of the time. Then, using the sparse representation of each load curve, we define clusters of consumption, which yield finally typical profiles, the group centroids or patterns of consumption.

Then we investigate the modeling of the intraday load curves using both exogenous climate variables and endogenous consumption variables as previously designed. We exhibit, as a result, sparse models relying just on few variables and also characterized by very good approximation performances. We end by explaining how sparse approximation is a first step towards clustering. The sparse approximation is here obtained by performing a robust and simple algorithm, LOLA, presented at the end of the paper.
Effect of petroleum coke expanding by perchloric acid on the performance of the resulted activated carbon
Authors: Deng Mei-Gen , Wang Ren-Qing
Published: September 2013

Petroleum coke (PC) was expanded by using KMnO 4 as oxidant and HClO 4 as intercalator so as to decrease the amount of KOH needed for the successive activation. Activated carbon (AC) was prepared by activation of the expanded PC (EPC) at KOH /coke mass ratio of 3:1 (denoted as EAC-3). As a comparison, AC was also made by activation of PC at KOH /coke mass ratio of 3:1, 4:1 and 5:1 (denoted as AC-3, AC-4 and AC-5). Influence of expanding modification on the structure and performance of PC and AC was investigated. The results revealed that the expanding treatment increased the interplanar distance of PC microcrystalline from 0.344 to 0.362 nm and decreased the microcrystalline thickness from 2.34 to 1.57 nm. The specific surface area of EAC-3 and AC-5 was 3461 and 3291 m2⋅g-1, respectively. The average pore size of EAC-3 was 2.19 nm, which is 0.11 nm larger than that of AC-5. At a scan rate of 0.5 mV⋅s-1, EAC-3 and AC-5 achieved a specific gravimetric capacitance of 486 and 429 F⋅g-1, respectively. Supercapacitor based on EAC-3 possessed lower resistance and better power performance.
MINING POSETS FROM LINEAR ORDERS
Authors: FERNANDEZ PROCESO L. , HEATH LENWOOD S. , RAMAKRISHNAN NAREN , TAN MICHAEL , VERGARA JOHN PAUL C.
Published: September 2013

There has been much research on the combinatorial problem of generating the linear extensions of a given poset. This paper focuses on the reverse of that problem, where the input is a set of linear orders, and the goal is to construct a poset or set of posets that generates the input. Such a problem finds applications in computational neuroscience, systems biology, paleontology, and physical plant engineering. In this paper, two algorithms are presented for efficiently finding a single poset, if, such a poset exists whose linear extensions are exactly the same as the input set of linear orders. The variation of the problem where a minimum set of posets that cover the input is also explored. This variation is shown to be polynomially solvable for one class of simple posets (kite(2) posets) but NP-complete for a related class (hammock(2,2,2) posets).
THE MAXIMUM COMMUNITY PARTITION PROBLEM IN NETWORKS
Authors: LU ZAIXIN , WU WEILI , CHEN WEIDONG , ZHONG JIAOFEI , BI YUANJUN , GAO ZHENG
Published: September 2013

The community structure detection is an important problem in many areas such as biology network, computer network and social network. The objective of this problem is to analyze the relationships among data via the network topology. In the literature, many works have been done for partitioning a network into communities or clustering data into groups. In this paper, we define a series of conditions for communities and formulate the community detection problem into a combinatorial optimization problem which aims at partitioning a given network into disjoint communities such that all the communities satisfy the community conditions. We show that the maximization version of this problem is [Formula: see text]-hard for general networks under some natural conditions, and we develop a greedy heuristic algorithm for it. We also develop a refine algorithm to improve the modularity score of a community partition, subject to the community conditions.
Repeated inversion and collapse in the Late Cretaceous–Cenozoic northern Vøring Basin, offshore Norway
Authors: Lundin Erik R. , Doré Anthony G. , Rønning Kristin , Kyrkjebø Rune
Published: September 2013

The Norwegian Atlantic margin, although frequently described as passive, has seen several significant and highly variable deformation events prior to and after early Cenozoic break-up. This chronology is strongly exemplified in the northern Vøring Basin, where deformation resulted in significant vertical motions, including deep erosion and sediment reworking.

Post-break-up compressional deformation is well documented in the NE Atlantic margins, and is represented in the north Vøring Basin by the Vema and Naglfar domes. A prominent Maastrichtian–Paleocene pre-break-up phase of compression inverted the northern prolongation of the latest Turonian Vigrid Syncline. This syncline was the fairway for the approximately 1 km-thick Santonian–Campanian Nise Formation sandstone, shed from NE Greenland and/or the western Barents Sea margin. The inversion focused on the Vigrid Syncline axis, forming an anticline here referred to as the Vema–Nyk Anticline. The anticline may have been a major trap but was breached by erosion prior to collapse due to Late Paleocene extension. The remnant eastern half of the anticline is the Nyk High. The associated flanking syncline, the Någrind Syncline, also remains preserved. The collapsed side of the anticline is the Hel Graben, which itself was inverted in the Middle Miocene time forming the Naglfar and Vema domes.

More speculatively, the development of the Vigrid Syncline and its bounding structural highs, the Gjallar Ridge and Utgard High, may also represent folds, marking the onset of compressional buckling in the mid-Norwegian–NE Greenland rift system.

The repeated compressional deformation, as well as the extensional collapse, was focused on the area subjected to Early Cretaceous hyperextension. Compressional buckling under relatively low stress levels is proposed to have been due to significant lithosphere weakening caused by the hyperextension, whereby both high attenuation of the crystalline crust and serpentinization of the upper mantle contribute to the weakening. The Late Cenozoic compression post-dated the hyperextension by approximately 110 Ma, which suggests that the weakening is long-lived and that lithosphere has not been strengthened significantly through time.
Constraint Propagation for First-Order Logic and Inductive Definitions
Authors: Wittocx Johan , Denecker Marc , Bruynooghe Maurice
Published: September 2013

In Constraint Programming, constraint propagation is a basic component of constraint satisfaction solvers. Here we study constraint propagation as a basic form of inference in the context of first-order logic (FO) and extensions with inductive definitions (FO(ID)) and aggregates (FO(AGG)). In a first, semantic approach, a theory of propagators and constraint propagation is developed for theories in the context of three-valued interpretations. We present an algorithm with polynomial-time data complexity. We show that constraint propagation in this manner can be represented by a datalog program. In a second, symbolic approach, the semantic algorithm is lifted to a constraint propagation algorithm in
symbolic structures
, symbolic representations of classes of structures. The third part of the article is an overview of existing and potential applications of constraint propagation for model generation, grounding, interactive search problems, approximate methods for ∃∀SO problems, and approximate query answering in incomplete databases.
Parameterized Complexity of DPLL Search Procedures
Authors: Beyersdorff Olaf , Galesi Nicola , Lauria Massimo
Published: September 2013

We study the performance of DPLL algorithms on parameterized problems. In particular, we investigate how difficult it is to decide whether small solutions exist for satisfiability and other combinatorial problems. For this purpose we develop a Prover-Delayer game that models the running time of DPLL procedures and we establish an information-theoretic method to obtain lower bounds to the running time of parameterized DPLL procedures. We illustrate this technique by showing lower bounds to the parameterized pigeonhole principle and to the ordering principle. As our main application we study the DPLL procedure for the problem of deciding whether a graph has a small clique. We show that proving the absence of a
k
-clique requires
n
Ω(k)
steps for a nontrivial distribution of graphs close to the critical threshold. For the restricted case of tree-like Parameterized Resolution, this result answers a question asked by Beyersdorff et al. [2012] of understanding the Resolution complexity of this family of formulas.
On the Inference of Resource Usage Upper and Lower Bounds
Authors: Albert Elvira , Genaim Samir , Masud Abu Naser
Published: September 2013

Cost analysis
aims at determining the amount of resources required to run a program in terms of its input data sizes. The most challenging step is to infer the cost of executing the
loops
in the program. This requires bounding the number of iterations of each loop and finding tight bounds for the cost of each of its iterations. This article presents a novel approach to infer
upper
and
lower
bounds from
cost relations
. These relations are an extended form of standard
recurrence equations
that can be nondeterministic, contain inexact size constraints and have multiple arguments that increase and/or decrease. We propose novel techniques to automatically transform cost relations into
worst-case
and
best-case
deterministic one-argument recurrence relations. The solution of each recursive relation provides a precise upper-bound and lower-bound for executing a corresponding loop in the program. Importantly, since the approach is developed at the level of the cost equations, our techniques are programming language independent.
Cellular-genetic test data generation
Authors: Bhasin Harsh , Singla Neha
Published: September 2013

Test Data Generation is the soul of automated testing. The dream of having efficient and robust automated testing software can be fulfilled only if the task of designing a robust automated test data generator can be accomplished. In the work we explore the gaps in the existing techniques and intend to fill these gaps by proposing new algorithms. The following work presents algorithms that handle almost all the constructs of procedural programming languages. The proposed technique uses cellular automata as its base. The use of Cellular Automata brings a blend of artificial life to the work. The work is a continuation of our earlier attempt to amalgamate Cellular Automata based algorithms to generate test data. The technique has been applied to C programs and is currently being tested on a financial enterprise resource planning system. Since, the solution of most of the problems can be found by observing nature, we must explore artificial nature to accomplish the above task.
System dynamics model for simulation of the software inspection process
Authors: De Sousa Coelho Jailton Jr. , Braga José Luis , Ambrósio Bernardo Giori
Published: September 2013

Repairing a defect in the late phases of software development can be a hundred times more expensive than finding and fixing it during the requirements and design phase. Software inspection is a technique that may be used to aid in the identification of defects during early stages of the process and avoid propagation of such defects to later phases. The cost-benefit of inspections may be significant if they are efficiently performed. Since this process is affected by several quality factors, the analysis of the overall context of inspection may become complex. Project managers are reluctant to introduce inspection due to uncertainty regarding its real benefits. This paper presents a system dynamics model, which is a descriptive technique for systems modeling and simulation and involves several variables that strongly influence inspection efficiency. The influence levels of model variables are quantified based on real or empirical experiments reported in the literature, in order to approximate model results to values that would be obtained in the real world. The model allows the reproduction of scenarios without paying the costs and facing the risks of a real project implementation. Therefore, it enables the analysis of inspection effects on the software development process.
Critical components testing using hybrid genetic algorithm
Authors: Jeya Mala D. , Sabari Nathan K. , Balamurugan S.
Published: September 2013

As quality of software plays a vital role in real time systems, it is essential to identify the crucial parts in the system and to test them effectively. In the proposed approach, the critical components are identified by means of mutation based impact analysis. The next task is to test the critical components using the Hybrid Genetic Algorithm (HGA) based test case generation and optimization approach. The mutants are automatically generated by seeding faults into each method of all the components in the Software Under Test (SUT). The initial set of test cases is generated using randomized test data. The generated test cases are executed over the original and the mutant to identify whether the test case detects the error or not. Based on the results, the Mutation Score (MS) is calculated, which always lies between 0 and 1. The best test cases are chosen based on having higher mutation scores and are executed on mutants to analyze how each component affects the other components in the SUT. Based on the analysis, the critical components are identified and they need rigorous testing using the test cases generated by the HGA. The algorithm uses the RemoveTop and LocalBest improvement heuristics to achieve near optimal solutions. In unit testing, the test cases are executed against the original and the mutant. The test case optimization is done by evaluating the effectiveness of test suites using the Mutation Score and the Branch Coverage Value (BCV). In pair-wise testing, the effective test cases are selected based on the higher mutation scores and branch coverage values. The components are executed against these test cases and the execution traces are recorded. The traced results are compared against the expected outputs which were previously stored in the repository and the statuses are updated. Based on the statuses, the faulty methods are revealed. The efficiency of the proposed approach is compared with Genetic Algorithm (GA) and we concluded that the final test suite size and the total execution time are reduced in the proposed approach. Finally various graphs and PDF reports are generated for visualization purposes.
Tool for generating code metrics for C# source code using abstract syntax tree technique
Authors: Singh Pavitdeep , Singh Satwinder , Kaur Jatinder
Published: September 2013

Software maintenance is one of the key activities in any software engineering process in which source code analysis plays a crucial role. Due to the high cost of maintenance, it has become quite necessary to produce high quality software. Over time, numerous analyses have been performed on source code to determine complexity and other metrics. Lots of papers have been published for object oriented languages but mostly concentrating on C++ and Java, very few has been published for more modern languages like C#. This paper proposes a Software Quality Assurance Tool for measuring the different code metrics for the object oriented language C# at the class and method levels. The technique consists of generating the abstract syntax tree of the source code using Nfactory libraries. The Interface is built using the Win Form application which provides an impressive GUI for the tool.
Decomposing combinatorial auctions and set packing problems
Authors: Gottlob Georg , Greco Gianluigi
Published: September 2013

Combinatorial auctions allow bidders to bid on bundles of items rather than just on single items. The winner determination problem in combinatorial auctions is the problem of determining the allocation of items to bidders such that the sum of the accepted bid prices is maximized. This problem is equivalent to the well-known maximum-weight set packing problem. Even though these problems are NP-hard in general, they can be solved in polynomial time on instances whose associated item graphs have bounded treewidth (called structured item graphs). However, the tractability of determining whether for a given problem instance a structured item graph of fixed treewidth exists (and if so, computing one efficiently) was an open problem.

In this article, we solve this problem by proving that deciding the existence of structured item graphs is computationally intractable, even for treewidth 3. Motivated by this unfavorable complexity result, we investigate other structural restrictions, and we show that the notion of hypertree decomposition, a well-studied measure of hypergraph cyclicity, turns out to be most useful here. Indeed, we show that the winner determination problem is solvable in polynomial time on instances whose dual auction hypergraphs have bounded hypertree width. Our solution method is based on encoding winner determination via a constraint satisfaction optimization problem and on exhibiting an algorithm to solve this latter problem efficiently for such structurally restricted instances. The class of tractable instances identified by our approach, while being efficiently recognizable, properly contains the class of instances having a structured item graph. Moreover, on the larger class, our method solves winner determination with the same asymptotic complexity as the best algorithm proposed in the literature for the subclass of structured item graphs. Hypertree decompositions can equally profitably be applied to the maximum-weight independent set problem, which is the dual problem of maximum-weight set packing.
All-pairs shortest paths in
O
(
n
2
) time with high probability
Authors: Peres Yuval , Sotnikov Dmitry , Sudakov Benny , Zwick Uri
Published: September 2013

We present an all-pairs shortest path algorithm whose running time on a complete directed graph on
n
vertices whose edge weights are chosen independently and uniformly at random from [0,1] is
O
(
n
2
), in expectation and with high probability. This resolves a long-standing open problem. The algorithm is a variant of the dynamic all-pairs shortest paths algorithm of Demetrescu and Italiano [2006]. The analysis relies on a proof that the number of
locally shortest paths
in such randomly weighted graphs is
O
(
n
2
), in expectation and with high probability. We also present a dynamic version of the algorithm that recomputes all shortest paths after a random edge update in
O
(log
2
n
) expected time.
YOUQMON
Authors: Casas Pedro , Seufert Michael , Schatz Raimund
Published: September 2013

YouTube is changing the way operators manage network performance monitoring. In this paper we introduce YOUQMON, a novel on-line monitoring system for assessing the Quality of Experience (QoE) undergone by HSPA/3G customers watching YouTube videos, using network-layer measurements only. YOUQMON combines passive traffic analysis techniques to detect stalling events in YouTube video streams, with a QoE model to map stallings into a Mean Opinion Score reflecting the end-user experience. We evaluate the stalling detection performance of YOUQMON with hundreds of YouTube video streams, and present results showing the feasibility of performing real-time YouTube QoE monitoring in an operational mobile broadband network.
An asymptotically optimal real-time locking protocol for clustered scheduling under suspension-aware analysis
Authors: Brandenburg Björn B.
Published: September 2013

The purpose of real-time locking protocols is to limit
priority inversions
[5], which, intuitively, occur when a high-priority task is delayed by a lower-priority task. Such locking-related delay, also called
priority inversion blocking
(
pi-blocking
), is problematic in real-time systems because it can result in deadline misses. However, some pi-blocking is unavoidable when using locks and thus must be bounded and accounted for during schedulability analysis.