21,209 research outputs found
The Coester Line in Relativistic Mean Field Nuclear Matter
The Walecka model contains essentially two parameters that are associated
with the Lorentz scalar (S) and vector (V) interactions. These parameters are
related to a two-body interaction consisting of S and V, imposing the condition
that the two-body binding energy is fixed. We have obtained a set of different
values for the nuclear matter binding energies at equilibrium densities. We
investigated the existence of a linear correlation between and ,
claimed to be universal for nonrelativistic systems and usually known as the
Coester line, and found an approximate linear correlation only if remains
constant. It is shown that the relativistic content of the model, which is
related to the strength of , is responsible for the shift of the Coester
line to the empirical region of nuclear matter saturation.Comment: 7 pages, 5 figure
Mapping the train model for earthquakes onto the stochastic sandpile model
We perform a computational study of a variant of the ``train'' model for
earthquakes [PRA 46, 6288 (1992)], where we assume a static friction that is a
stochastic function of position rather than being velocity dependent. The model
consists of an array of blocks coupled by springs, with the forces between
neighbouring blocks balanced by static friction. We calculate the probability,
P(s), of the occurrence of avalanches with a size s or greater, finding that
our results are consistent with the phenomenology and also with previous models
which exhibit a power law over a wide range. We show that the train model may
be mapped onto a stochastic sandpile model and study a variant of the latter
for non-spherical grains. We show that, in this case, the model has critical
behaviour only for grains with large aspect ratio, as was already shown in
experiments with real ricepiles. We also demonstrate a way to introduce
randomness in a physically motivated manner into the model.Comment: 14 pages and 6 figures. Accepted in European Physical Journal
Overlap Removal of Dimensionality Reduction Scatterplot Layouts
Dimensionality Reduction (DR) scatterplot layouts have become a ubiquitous
visualization tool for analyzing multidimensional data items with presence in
different areas. Despite its popularity, scatterplots suffer from occlusion,
especially when markers convey information, making it troublesome for users to
estimate items' groups' sizes and, more importantly, potentially obfuscating
critical items for the analysis under execution. Different strategies have been
devised to address this issue, either producing overlap-free layouts, lacking
the powerful capabilities of contemporary DR techniques in uncover interesting
data patterns, or eliminating overlaps as a post-processing strategy. Despite
the good results of post-processing techniques, the best methods typically
expand or distort the scatterplot area, thus reducing markers' size (sometimes)
to unreadable dimensions, defeating the purpose of removing overlaps. This
paper presents a novel post-processing strategy to remove DR layouts' overlaps
that faithfully preserves the original layout's characteristics and markers'
sizes. We show that the proposed strategy surpasses the state-of-the-art in
overlap removal through an extensive comparative evaluation considering
multiple different metrics while it is 2 or 3 orders of magnitude faster for
large datasets.Comment: 11 pages and 9 figure
Exploiting Resolution-based Representations for MaxSAT Solving
Most recent MaxSAT algorithms rely on a succession of calls to a SAT solver
in order to find an optimal solution. In particular, several algorithms take
advantage of the ability of SAT solvers to identify unsatisfiable subformulas.
Usually, these MaxSAT algorithms perform better when small unsatisfiable
subformulas are found early. However, this is not the case in many problem
instances, since the whole formula is given to the SAT solver in each call. In
this paper, we propose to partition the MaxSAT formula using a resolution-based
graph representation. Partitions are then iteratively joined by using a
proximity measure extracted from the graph representation of the formula. The
algorithm ends when only one partition remains and the optimal solution is
found. Experimental results show that this new approach further enhances a
state of the art MaxSAT solver to optimally solve a larger set of industrial
problem instances
Introducing programming to basic schools students using robotics
The present work reports on the development of programming activities with students from the 1st and 2nd cycles of schools in the town of Braga in the northwestern Portuguese region of Minho. These activities of promotion of computer programming were applied in order to promote the programming and innovative practices on science and technology education. The explored interdisciplinary methodologies in STEM teaching-learning processes, stimulate critical thinking and creativity while promoting the benefits of learning in collaborative environments. The active involvement of the students in these robot programming, âhigh techâ and trendy, activities is easy to achieve if the proposed challenges are set at an adequate level of difficulty and appealing enough to the age group and level of cognitive development of the student. Whenever possible to the students is given the possibility of choosing or even defining the problem/subject they will be exploring by programming a robot, which is seen as a mechanical artificial being the students will be able to understand, interact with and use and control. The teacher/educator should be available to provide to the students a proper empowering environment and to provide all support requested by the students giving, as much as possible, not straight answers but yes clues and small hints and examples leading the students to reach, themselves, to a solution to the problem the students face or to an answer to the studentsâ question that satisfy their own critical judgment. Through the programming testing process, it is possible to verify and see the level of perception and proficiency of the students assessing what students have learned and accomplished, creating immediate feedback for students and adjusting or re-orienting the studentsâ focus on a particular task or reasoning process. If well succeeded these activities can develop among the students a sound appreaciation towards Science Technology and Engineering while establishing relevant knowledge, creativity critical reasoning abilities and a large number of other competencies that will be valuable for the future development of the students in their studies and academic life but also in their future careers. The improvement of the self-esteem of the students when they realize they can actually âdo itâ is also a major benefit of this type of activities. As well in what concerns the boost of the self-esteem and selft-appreaciation of their teachers and educators, that often fear to explore this type of innovative approaches
Clustering Properties of Dynamical Dark Energy Models
We provide a generic but physically clear discussion of the clustering
properties of dark energy models. We explicitly show that in quintessence-type
models the dark energy fluctuations, on scales smaller than the Hubble radius,
are of the order of the perturbations to the Newtonian gravitational potential,
hence necessarily small on cosmological scales. Moreover, comparable
fluctuations are associated with different gauge choices. We also demonstrate
that the often used homogeneous approximation is unrealistic, and that the
so-called dark energy mutation is a trivial artifact of an effective, single
fluid description. Finally, we discuss the particular case where the dark
energy fluid is coupled to dark matter.Comment: 5 page
- âŠ