Velocity, energy and helicity of vortex knots and unknots

In this paper we determine the velocity, the energy and estimate writhe and twist helicity contributions of vortex filaments in the shape of torus knots and unknots (toroidal and poloidal coils) in a perfect fluid. Calculations are performed by numerical integration of the Biot-Savart law. Vortex complexity is parametrized by the winding number $w$, given by the ratio of the number of meridian wraps to that of the longitudinal wraps. We find that for $w<1$ vortex knots and toroidal coils move faster and carry more energy than a reference vortex ring of same size and circulation, whereas for $w>1$ knots and poloidal coils have approximately same speed and energy of the reference vortex ring. Helicity is dominated by the writhe contribution. Finally, we confirm the stabilizing effect of the Biot-Savart law for all knots and unknots tested, that are found to be structurally stable over a distance of several diameters. Our results also apply to quantized vortices in superfluid $^4$He.Comment: 17 pages, 8 figures, 2 table

Preliminary findings from a survey on the MD state of the practice

In the context of an Italian research project, this paper reports on an on-line survey, performed with 155 software professionals, with the aim of investigating about their opinions and experiences in modeling during software development and Model-driven engineering usage. The survey focused also on used modeling languages, processes and tools. A preliminary analysis of the results confirmed that Model-driven engineering, and more in general software modeling, are very relevant phenomena. Approximately 68% of the sample use models during software development. Among then, 44% generate code starting from models and 16% execute them directly. The preferred language for modeling is UML but DSLs are used as wel

Deep Learning for the Generation of Heuristics in Answer Set Programming: A Case Study of Graph Coloring

Answer Set Programming (ASP) is a well-established declarative AI formalism for knowledge representation and reasoning. ASP systems were successfully applied to both industrial and academic problems. Nonetheless, their performance can be improved by embedding domain-specific heuristics into their solving process. However, the development of domain-specific heuristics often requires both a deep knowledge of the domain at hand and a good understanding of the fundamental working principles of the ASP solvers. In this paper, we investigate the use of deep learning techniques to automatically generate domain-specific heuristics for ASP solvers targeting the well-known graph coloring problem. Empirical results show that the idea is promising: the performance of the ASP solver wasp can be improved

Physical Activity, Obesity, Family History, and their Associations with Hypertension among The Elderly in Aceh Singkil, Aceh

Background: Hypertension is an important global health challenge due to its high prevalence and resulting cardiovascular disease and chronic kidney disease. This study aimed to examine the associations of physical activity, obesity, family history, with hypertension among the elderly in Aceh Singkil, Aceh. Subjects and Method: This was a case control study carried out in Aceh Singkil, Aceh. A sample of 132 elderly was selected for this study, consisting 66 elderly with hypertension and 66 elderly without hypertension. The dependent variable was hypertension. The independent variables were physical activity, obesity, and family history. Hypertension data was measured by sphygmomanometer. The other data were collected by questionnaire. The data were analyzed by a multiple logistic regression model. Results: Hypertension was associated with physical inactivity (OR= 5.12; 95% CI= 2.41 to 10.86; p<0.001), obesity (OR= 3.30; 95% CI= 1.61 to 6.74; p<0.001), and family history (OR= 7.73; 95% CI= 3.56 to 16.78; p<0.001). Conclusion: Physical inactivity, obesity, and family history, are associated with an increased risk of hypertension. Keywords: physical activity, obesity, family history, hypertensio

Kinetic energy of vortex knots and unknots

New results on the kinetic energy of ideal vortex filaments in the shape of torus knots and unknots are presented. These knots are given by small-amplitude torus knot solutions (Ricca, 1993) to the Localized Induction Approximation (LIA) law. The kinetic energy of different knot and unknot types is calculated and presented for comparison. These results provide new information on relationships between geometry, topology and dynamics of complex vortex systems and help to establish possible connections between aspects of structural complexity of dynamical systems and vortical flows.Comment: 14 pages, 5 figure

Evaluation Techniques and Systems for Answer Set Programming: a Survey

Answer set programming (ASP) is a prominent knowledge representation and reasoning paradigm that found both industrial and scientific applications. The success of ASP is due to the combination of two factors: a rich modeling language and the availability of efficient ASP implementations. In this paper we trace the history of ASP systems, describing the key evaluation techniques and their implementation in actual tools

Neuro-Symbolic techniques for Predictive Maintenance

Predictive maintenance plays a key role in the core business of the industry due to its potential in reducing unexpected machine downtime and related cost. To avoid such issues, it is crucial to devise artificial intelligence models that can effectively predict failures. Predictive maintenance current approaches have several limitations that can be overcome by exploiting hybrid approaches such as Neuro-Symbolic techniques. Neuro-symbolic models combine neural methods with symbolic ones leading to improvements in efficiency, robustness, and explainability. In this work, we propose to exploit hybrid approaches by investigating their advantage over classic predictive maintenance approaches

Algorithms for Stable Matching and Clustering in a Grid

We study a discrete version of a geometric stable marriage problem originally proposed in a continuous setting by Hoffman, Holroyd, and Peres, in which points in the plane are stably matched to cluster centers, as prioritized by their distances, so that each cluster center is apportioned a set of points of equal area. We show that, for a discretization of the problem to an $n\times n$ grid of pixels with $k$ centers, the problem can be solved in time $O(n^2 \log^5 n)$, and we experiment with two slower but more practical algorithms and a hybrid method that switches from one of these algorithms to the other to gain greater efficiency than either algorithm alone. We also show how to combine geometric stable matchings with a $k$-means clustering algorithm, so as to provide a geometric political-districting algorithm that views distance in economic terms, and we experiment with weighted versions of stable $k$-means in order to improve the connectivity of the resulting clusters.Comment: 23 pages, 12 figures. To appear (without the appendices) at the 18th International Workshop on Combinatorial Image Analysis, June 19-21, 2017, Plovdiv, Bulgari