Analytical solution of a one-dimensional Ising model with zero temperature dynamics

The one-dimensional Ising model with nearest neighbour interactions and the zero-temperature dynamics recently considered by Lefevre and Dean -J. Phys. A: Math. Gen. {\bf 34}, L213 (2001)- is investigated. By introducing a particle-hole description, in which the holes are associated to the domain walls of the Ising model, an analytical solution is obtained. The result for the asymptotic energy agrees with that found in the mean field approximation.Comment: 6 pages, no figures; accepted in J. Phys. A: Math. Gen. (Letter to the Editor

Phosphoproteomics data classify hematological cancer cell lines according to tumor type and sensitivity to kinase inhibitors

This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited

Linear response of vibrated granular systems to sudden changes in the vibration intensity

The short-term memory effects recently observed in vibration-induced compaction of granular materials are studied. It is shown that they can be explained by means of quite plausible hypothesis about the mesoscopic description of the evolution of the system. The existence of a critical time separating regimes of ``anomalous'' and ``normal'' responses is predicted. A simple model fitting into the general framework is analyzed in the detail. The relationship between this work and previous studies is discussed.Comment: 10 pages, 6 figures; fixed errata, updtated reference

Diffusion-Weighted Imaging: Recent Advances and Applications

Quantitative diffusion imaging techniques enable the characterization of tissue microstructural properties of the human brain “in vivo”, and are widely used in neuroscientific and clinical contexts. In this review, we present the basic physical principles behind diffusion imaging and provide an overview of the current diffusion techniques, including standard and advanced techniques as well as their main clinical applications. Standard diffusion tensor imaging (DTI) offers sensitivity to changes in microstructure due to diseases and enables the characterization of single fiber distributions within a voxel as well as diffusion anisotropy. Nonetheless, its inability to represent complex intravoxel fiber topologies and the limited biological specificity of its metrics motivated the development of several advanced diffusion MRI techniques. For example, high-angular resolution diffusion imaging (HARDI) techniques enabled the characterization of fiber crossing areas and other complex fiber topologies in a single voxel and supported the development of higher-order signal representations aiming to decompose the diffusion MRI signal into distinct microstructure compartments. Biophysical models, often known by their acronym (e.g., CHARMED, WMTI, NODDI, DBSI, DIAMOND) contributed to capture the diffusion properties from each of such tissue compartments, enabling the computation of voxel-wise maps of axonal density and/or morphology that hold promise as clinically viable biomarkers in several neurological and neuroscientific applications; for example, to quantify tissue alterations due to disease or healthy processes. Current challenges and limitations of state-of-the-art models are discussed, including validation efforts. Finally, novel diffusion encoding approaches (e.g., b-tensor or double diffusion encoding) may increase the biological specificity of diffusion metrics towards intra-voxel diffusion heterogeneity in clinical settings, holding promise in neurological applications

Semi-automatic assessment of unrestrained Java code: a Library, a DSL, and a workbench to assess exams and exercises

© ACM 2015. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in http://dx.doi.org/10.1145/2729094.2742615Automated marking of multiple-choice exams is of great interest in university courses with a large number of students. For this reason, it has been systematically implanted in almost all universities. Automatic assessment of source code is however less extended. There are several reasons for that. One reason is that almost all existing systems are based on output comparison with a gold standard. If the output is the expected, the code is correct. Otherwise, it is reported as wrong, even if there is only one typo in the code. Moreover, why it is wrong remains a mystery. In general, assessment tools treat the code as a black box, and they only assess the externally observable behavior. In this work we introduce a new code assessment method that also verifies properties of the code, thus allowing to mark the code even if it is only partially correct. We also report about the use of this system in a real university context, showing that the system automatically assesses around 50% of the work.This work has been partially supported by the EU (FEDER) and the Spanish Ministerio de Economíay Competitividad (Secretaría de Estado de Investigación, Desarrollo e Innovación) under grant TIN2013-44742-C4-1-R and by the Generalitat Valenciana under grant PROMETEOII2015/013. David Insa was partially supported by the Spanish Ministerio de Educación under FPU grant AP2010-4415.Insa Cabrera, D.; Silva, J. (2015). Semi-automatic assessment of unrestrained Java code: a Library, a DSL, and a workbench to assess exams and exercises. ACM. https://doi.org/10.1145/2729094.2742615SK. A Rahman and M. Jan Nordin. A review on the static analysis approach in the automated programming assessment systems. In National Conference on Programming 07, 2007.K. Ala-Mutka. A survey of automated assessment approaches for programming assignments. In Computer Science Education, volume 15, pages 83--102, 2005.C. Beierle, M. Kula, and M. Widera. Automatic analysis of programming assignments. In Proc. der 1. E-Learning Fachtagung Informatik (DeLFI '03), volume P-37, pages 144--153, 2003.J. Biggs and C. Tang. Teaching for Quality Learning at University : What the Student Does (3rd Edition). In Open University Press, 2007.P. Denny, A. Luxton-Reilly, E. Tempero, and J. Hendrickx. CodeWrite: Supporting student-driven practice of java. In Proceedings of the 42nd ACM technical symposium on Computer science education, pages 09--12, 2011.R. Hendriks. Automatic exam correction. 2012.P. Ihantola, T. Ahoniemi, V. Karavirta, and O. Seppala. Review of recent systems for automatic assessment of programming assignments. In Proceedings of the 10th Koli Calling International Conference on Computing Education Research, pages 86--93, 2010.H. Kitaya and U. Inoue. An online automated scoring system for Java programming assignments. In International Journal of Information and Education Technology, volume 6, pages 275--279, 2014.M.-J. Laakso, T. Salakoski, A. Korhonen, and L. Malmi. Automatic assessment of exercises for algorithms and data structures - a case study with TRAKLA2. In Proceedings of Kolin Kolistelut/Koli Calling - Fourth Finnish/Baltic Sea Conference on Computer Science Education, pages 28--36, 2004.Y. Liang, Q. Liu, J. Xu, and D. Wang. The recent development of automated programming assessment. In Computational Intelligence and Software Engineering, pages 1--5, 2009.K. A. Naudé, J. H. Greyling, and D. Vogts. Marking student programs using graph similarity. In Computers & Education, volume 54, pages 545--561, 2010.A. Pears, S. Seidman, C. Eney, P. Kinnunen, and L. Malmi. Constructing a core literature for computing education research. In SIGCSE Bulletin, volume 37, pages 152--161, 2005.F. Prados, I. Boada, J. Soler, and J. Poch. Automatic generation and correction of technical exercices. In International Conference on Engineering and Computer Education (ICECE 2005), 2005.M. Supic, K. Brkic, T. Hrkac, Z. Mihajlovic, and Z. Kalafatic. Automatic recognition of handwritten corrections for multiple-choice exam answer sheets. In Information and Communication Technology, Electronics and Microelectronics (MIPRO), pages 1136--1141, 2014.S. Tung, T. Lin, and Y. Lin. An exercise management system for teaching programming. In Journal of Software, 2013.T. Wang, X. Su, Y. Wang, and P. Ma. Semantic similarity-based grading of student programs. In Information and Software Technology, volume 49, pages 99--107, 2007

Universality of the off-equilibrium response function in the kinetic Ising chain

The off-equilibrium response function $\chi (t,t_w)$ and autocorrelation function $C(t,t_w)$ of an Ising chain with spin-exchange dynamics are studied numerically and compared with the same quantities in the case of spin-flip dynamics. It is found that, even though these quantities are separately different in the two cases, the parametric plot of $\chi (t,t_w)$ versus $C(t,t_w)$ is the same. While this result could be expected in higher dimensionality, where $\chi (C)$ is related to the equilibrium state, it is far from trivial in the one dimensional case where this relation does not hold. The origin of the universality of $\chi(C)$ is traced back to the optimization of domains position with respect to the perturbing external field. This mechanism is investigated resorting to models with a single domain moving in a random environment.Comment: 24 pages, 7 figure

Fast and reproducible in vivo T1 mapping of the human cervical spinal cord

PURPOSE: To develop a fast and robust method for measuring T1 in the whole cervical spinal cord in vivo, and to assess its reproducibility. METHODS: A spatially nonselective adiabatic inversion pulse is combined with zonally oblique-magnified multislice echo-planar imaging to produce a reduced field-of-view inversion-recovery echo-planar imaging protocol. Multi- inversion time data are obtained by cycling slice order throughout sequence repetitions. Measurement of T1 is performed using 12 inversion times for a total protocol duration of 7 min. Reproducibility of regional T1 estimates is assessed in a scan-rescan experiment on five heathy subjects. RESULTS: Regional mean (standard deviation) T1 was: 1108.5 (±77.2) ms for left lateral column, 1110.1 (±83.2) ms for right lateral column, 1150.4 (±102.6) ms for dorsal column, and 1136.4 (±90.8) ms for gray matter. Regional T1 estimates showed good correlation between sessions (Pearson correlation coefficient = 0.89 (P value < 0.01); mean difference = 2 ms, 95% confidence interval ± 20 ms); and high reproducibility (intersession coefficient of variation approximately 1% in all the regions considered, intraclass correlation coefficient = 0.88 (P value < 0.01, confidence interval 0.71-0.95)). CONCLUSIONS: T1 estimates in the cervical spinal cord are reproducible using inversion-recovery zonally oblique-magnified multislice echo-planar imaging. The short acquisition time and large coverage of this method paves the way for accurate T1 mapping for various spinal cord pathologies. Magn Reson Med, 2017. © 2017 The Authors Magnetic Resonance in Medicine published by Wiley Periodicals, Inc. on behalf of International Society for Magnetic Resonance in Medicine. This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited