Miracle-dz/UniFAR-FTUs huggingface dataset:
ChaMP Serendipitous Galaxy Cluster Survey

We present a survey of serendipitous extended X-ray sources and optical cluster candidates from the Chandra Multiwavelength Project (ChaMP). Our main goal is to make an unbiased comparison of X-ray and optical cluster detection methods. In 130 archival Chandra pointings covering 13 deg2, we use a wavelet decomposition technique to detect 55 extended sources, of which 6 are nearby single galaxies. Our X-ray cluster catalog reaches a typical flux limit of about ~10-14 ergs cm-2 s-1, with a median cluster core radius of 21′′. For 56 of the 130 X-ray fields, we use the ChaMP's deep NOAO 4 m MOSAIC g′, r′, and i′ imaging to independently detect cluster candidates using a Voronoi tessellation and percolation (VTP) method. Red-sequence filtering decreases the galaxy fore- and background contamination and provides photometric redshifts to z ~ 0.7. From the overlapping 6.1 deg2 X-ray/optical imaging, we find 115 optical clusters (of which 11% are in the X-ray catalog) and 28 X-ray clusters (of which 46% are in the optical VTP catalog). The median redshift of the 13 X-ray/optical clusters is 0.41, and their median X-ray luminosity (0.5-2 keV) is LX = × 1043 ergs s-1. The clusters in our sample that are only detected in our optical data are poorer on average (~4 σ) than the X-ray/optically matched clusters, which may partially explain the difference in the detection fractions.
Multilayer Processing of Spatiotemporal Spike Patterns in a Neuron with Active Dendrites

With the advent of new experimental evidence showing that dendrites play an active role in processing a neuron's inputs, we revisit the question of a suitable abstraction for the computing function of a neuron in processing spatiotemporal input patterns. Although the integrative role of a neuron in relation to the spatial clustering of synaptic inputs can be described by a two-layer neural network, no corresponding abstraction has yet been described for how a neuron processes temporal input patterns on the dendrites. We address this void using a real-time aVLSI (analog very-large-scale-integrated) dendritic compartmental model, which incorporates two widely studied classes of regenerative event mechanisms: one is mediated by voltage-gated ion channels and the other by transmitter-gated NMDA channels. From this model, we find that the response of a dendritic compartment can be described as a nonlinear sigmoidal function of both the degree of input temporal synchrony and the synaptic input spatial clustering. We propose that a neuron with active dendrites can be modeled as a multilayer network that selectively amplifies responses to relevant spatiotemporal input spike patterns.
Predictability of earliest deadline zero laxity algorithm for multiprocessor real-time systems

Validation methods for hard real-time jobs are usually performed based on the maximum execution time. The actual execution time of jobs are assumed to be known only when the jobs arrive or not known until they finish. A predictable algorithm must guarantee that it can generate a schedule for any set of jobs such that the finish time for the actual execution time is no later than the finish time for the maximum execution time. It is known that any job-level fixed priority algorithm (such as earliest deadline first) is predictable. However, job-level dynamic priority algorithms (such as least laxity first) may or may not. In this paper, we investigate the predictability of a job-level dynamic priority algorithm EDZL (earliest deadline zero laxity). We show that EDZL is predictable on the domain of integers regardless of the knowledge of the actual execution times. Based on this result, furthermore, we also show that EDZL can successfully schedule any periodic task set if the total utilization is not greater than (m + 1)/2, where m is the number of processors
IndoWordNet and its Linking with Ontology

Reasoning about natural language requires combining semantically rich lexical resources with world knowledge, provided by ontologies. In this paper, we describe linking of WordNets of Indian languages with an upper ontology SUMO (Suggested Upper Merged Ontology). This creates multilingual resource for Indian languages which can be used in various natural language processing applications. This paper presents the architecture of IndoWordNet- Linking of WordNets of seventeen different Indian languages and provides a method to link it with upper ontology SUMO. Two different systems: IndoWordNet navigator and SIGMAKEE interface for Indian languages are developed to access this resource.
An Empirical Evaluation of Automatic Conversion from Constituency to Dependency in Hungarian

In this paper, we investigate the differences between Hungarian sentence parses based on automatically converted and manually annotated dependency trees. We also train constituency parsers on the manually annotated constituency treebank and then convert their output to dependency trees. We argue for the importance of training on gold standard corpora, and we also demonstrate that although the results obtained by training on the constituency treebank and converting the output to dependency format and those obtained by training on the automatically converted dependency treebank are similar in terms of accuracy scores, the typical errors made by different systems differ from each other.
Vehicle localization by matching triangulated point patterns

We consider the problem of localizing a moving vehicle based on landmarks that were detected with a vehicle-mounted sensor. Landmarks are represented as points; correspondences of these points with the ones in a reference database are searched based on their geometric configurations. More specifically, we triangulate the landmark points and we match the obtained triangles with triangles in a reference database according to their geometric similarity. We maximize the number of triangle matches while considering the topological relations between different triangles, for example, if two triangles share an edge then the corresponding reference triangles must share an edge. Our method exploits that the observed points typically form a certain configuration: They appear at a limited distance from the vehicle's trajectory, thus the typical point pattern has a large extent in the driving direction and a relatively small lateral extent. This characteristic allows us to triangulate the observed point set such that we obtain a triangle strip (a sequence of triangles) in which each two consecutive triangles share one edge and each triangle connects three points that are relatively close to each other, that is, the triangle strip appropriately defines a neighborhood relationship for the landmarks. The adjacency graph of the triangles becomes a path; this allows for an efficient solution of our matching problem by dynamic programming. We present results of our method with data acquired with a mobile laser scanning system. The landmarks are objects of cylindric shape, for example, poles of traffic signs, which can be easily detected with the employed sensor. We tested the method with respect to its running time and its robustness when imposing different types of errors on the data. In particular, we tested the effect of non-rigid distortions of the observed point set, which are typically encountered during dead reckoning. Our matching approach copes well with such errors since it is based on local similarity measures of triangles, that is, we do not assume that a global non-rigid transformation between the observed point set and the reference point set exists.
European Efforts in Nanoinformatics Research Applied to Nanomedicine

Nanomedicine and nanoinformatics are emerging disciplines with substantial challenges ahead. For instance, nanomedicine involves complex and massive data analysis. Nanoinformatics could expand previous experiences in Biomedical Informatics with new features required to study different scientific biological and physical characteristics at a different level of complexity. ACTION-Grid is a project, funded by the European Commission, which aims to the creation of a collaborative environment in biomedical and nanomedical research among countries in Europe, Western Balkans, Latin America and North Africa. In this paper, we briefly review the concepts of nanomedicine and nanoinformatics and then we describe the activities of some of the ACTION-Grid consortium members considering those initiatives related to nanomedicine.
New insights into Chroococcus (Cyanobacteria) and two related genera: Cryptococcum gen. nov. and Inacoccus gen. nov.

ABSTRACT Many cyanobacterial morphospecies with hemispherical cells have been assigned to the genus Chroococcus, but increasingly genetic information has shown that the genus is polyphyletic. Here we describe two new genera based on two new species, Inacoccus gen. nov. based on Inacoccus carmineus sp. nov. and Cryptococcum gen. nov. based on Cryptococcum brasiliense sp. nov. Both genera have morphological features typical of the genus Chroococcus and are based on strains isolated from terrestrial habitats of the Brazilian Atlantic Forest. Inacoccus differs from Chroococcus in forming nanocytes and by producing an intensely red-coloured sheath. Cryptococcum is a cryptic genus and two species, C. brasiliense and C. komarkovaum, have been recognized by a molecular approach (16 rRNA and 16S-23S ITS sequences). The 16S rRNA gene sequence phylogeny indicates that these proposed genera form monophyletic clades apart from the Chroococcus sensu stricto cluster. Additionally, the tropical species Chroococcus subviolaceus was studied by molecular methods for the first time. The results confirmed a vast phylogenetic diversity hidden under the simple morphology of Chroococcus morphotypes, and show that terrestrial environments are a promising field of research.
Multi-Sensory Fusion for Mobile Robot Self-Localization

In this paper, a novel computation method named MMK (Multi-sensory Markov-Kalman) localization, is proposed for self-localization of mobile robots in polygonal environments. The method combines multimodal robust Markov localization and unimodal efficient KF method, and is much improved by utilizing multi-sensory information. The localization process requires less memory and lower resolution discretization of the pose space. Both efficiency and precision can be improved by using information from sonar and visual sensors. Experiments are conducted to demonstrate the validity of the proposed approach
Evaluating the influence of subject-related variables on EMG-based hand gesture classification

In this study we evaluated the effect of subject-related variables, i.e. hand dominance, gender and experience in using, on the performances of an EMG-based system for virtual upper limb and prosthesis control. The proposed system consists in a low density EMG sensors arrangement, a purpose-built signal-conditioning electronic circuitry and a software able to classify the gestures and to replicate them via avatars. The classification algorithm was optimized in terms of feature extraction and dimensionality reduction. In its optimal configuration, the system allows to accurately discriminate five different hand gestures (accuracy = 88.85 ± 7.19%). Statistical analysis demonstrated no significant difference in classification accuracy related to hand-dominance (handedness) and to gender. In addition, maximum accuracy in dominant hand is achieved since first use of the system, whilst accuracy in classifying gestures of the non-dominant hand significantly increases with experience. These results indicate that this system can be potentially used by every trans-radial upper-limb amputee for virtual/real limb control.
DSZOOM--Low Latency Software-Based Shared Memory

Software-implementations of shared memory are still far behind the performance of hardwarebased shared memory implementations and are not viable options for most fine-grain sharedmemory applications. The major source for their inefficiency comes from the cost of interruptbased asynchronous protocol processing, not from the actual network latency. As the raw hardware latency of inter-node communication decreases, the asynchronous overhead in the communication becomes more dominant. Elaborate schemes, involving dedicated hardware and/or dedicated protocol processors, have been suggested to cut the overhead. This paper describes how all the asynchronous overhead can be completely removed by instead running the entire coherence protocol in the requesting processor. This not only removes the asynchronous overhead, but also makes use of a processor that otherwise would stall. The technique is applicable to both page-based and fine-grain software shared memory. Our proof-of-concept implementation—DSZOOM-EMU—is a fine-grained software-based shared memory. It demonstrates a protocol-handling overhead below a microsecond for all the actions involved in a remote load operation, to be compared to the fastest implementation to date of around ten microseconds. The all-software protocol is implemented assuming only some basic low-level primitives in the cluster interconnect. Based on a remote atomic and simple remote put/get operations the requesting processor can assume the role of the directory agent, traditionally assumed by a remote protocol agent in the home node in other implementations. The implementation is thread-safe and allows all processors in a node to simultaneously perform remote operations.
H i OBSERVATIONS OF FIVE GROUPS OF GALAXIES

We present the results of H i observations of five groups of galaxies spanning a range of velocity dispersion and spiral fraction (brightest optical group member in parenthesis): NGC 7582 (NGC 7552), USGC U207 (NGC 2759), USGC U070 (NGC 664), USGC U412 (NGC 3822), USGC U451 (NGC 4065). Neutral intragroup gas is detected in three of the five groups. We present the discovery of a previously uncataloged galaxy in the USGC U070 group at α(2000) = 01h45m27s, δ(2000) = +0436′19″, which we are designating FSW J014526.92+043619.1. We compile an H i mass function for the group environment and find that the faint-end slope is consistent with being flat.
Development and testing of TraumaGameplay: an iterative experimental approach using the trauma film paradigm

ABSTRACT Background: Vivid trauma-related intrusions are a hallmark symptom of posttraumatic stress disorder (PTSD), and may be involved in its onset. Effective interventions to reduce intrusions and to potentially prevent the onset of subsequent PTSD are scarce. Studies suggest that playing the videogame Tetris, shortly after watching aversive film clips, reduces subsequent intrusions. Other studies have shown that taxing working memory (WM) while retrieving an emotional memory reduces the memory’s vividness and emotionality. Objective: We developed TraumaGameplay (TGP), a gaming app designed to reduce intrusions. This paper describes two successive experiments to determine whether playing TGP without memory retrieval (regular TGP) or TGP with memory retrieval (dual-task TGP) reduces intrusion frequency at one week compared to a no-game control. Method: For both experiments, healthy university students were recruited. Experiment 1: 92 participants were exposed to a trauma film and randomized to (1) regular TGP1 (n = 31), (2) dual-task TGP1 (n = 31) or (3) control (n = 30). In experiment 2, 120 healthy students were exposed to a trauma film and randomized to (1) regular TGP2 (n = 30), (2) dual-task TGP2 (n = 29), (3) recall only (n = 31) or (4) control (n = 30). Results: We found no significant difference between conditions on the number of intrusions for either playing regular TGP or dual-task TGP in both experiment 1 and experiment 2. Conclusion: Our results could not replicate earlier promising findings from preceding experimental research. Several reasons may underpin this difference ranging from the visuospatial videogame used in our experiments to the method of the experiment to the difficulties of replicability in general.
A Novel Memetic Algorithm Using Modified Particle Swarm Optimization and Mesh Adaptive Direct Search for PMSM Design

In this paper, we propose a novel memetic algorithm, which is explorative particle swarm optimization (ePSO), combined with mesh adaptive direct search and apply it to the design of a permanent magnet synchronous machine (PMSM). The ePSO, which is modified from the PSO, drastically improves search time and iteration number at an exploration search stage. Unlike the existing methods, the proposed rule of start point selection takes an advantage of minimizing the search time. By applying the proposed algorithm to PMSM, we clarify the effectiveness of the proposed algorithm.
Genetic Algorithm Assisted Dual Diversity Smart Antenna with Triple-COLD Array for QPSK Communication System

A dual (polarization and spatial) diversity smart antenna using Triple co-centered orthogonal loop and dipole (Triple-COLD) array is presented. It exploits polarization diversity to support more users in spatial diversity scenario when users are very close to each other in terms of their arrival angles. There are six co-located elements in a single Triple-COLD element, which provide six polarization degrees of freedom with space saving. Array weights are determined directly to minimize the bit error rate (BER) using genetic algorithm (GA) alternate to conjugate gradient (CG) method, using adaptive minimum BER approach, for QPSK modulation scheme. GA is capable of approaching the MBER solution at a lower complexity than CG algorithm.
Activation Energy of Aggregation-Disaggregation Self-Oscillation of Polymer Chain

In this paper, we investigated the activation energies of the aggregation–disaggregation self-oscillation induced by the Belousov-Zhabotinsky (BZ) reaction by utilizing the nonthermoresponsive polymer chain in a wide temperature range. This is because the conventional type self-oscillating polymer chain, with thermoresponsive poly(Nisopropylacrylamide) (poly(NIPAAm) main-chain covalently bonded to the ruthenium catalyst (Ru(bpy)3) of the BZ reaction, cannot evaluate the activation energy over the lower critical solution temperature (LCST). The nonthermoresponsive self-oscillating polymer chain is composed of a poly-vinylpyrrolidone (PVP) main-chain with the ruthenium catalyst (Ru(bpy)3). As a result, we clarified that the activation energy of the aggregation–disaggregation self-oscillation of the polymer chain is hardly affected by the concentrations of the BZ substrates. In addition, the activation energy of the nonthermoresponsive self-oscillating polymer chain was found to be almost the same value as normal BZ reaction, i.e., not including the self-oscillating polymer system with Ru moiety.
What causes attention deficit hyperactivity disorder?

Attention deficit hyperactivity disorder (ADHD) affects around 1–3% of children. There is a high level of comorbidity with developmental and learning problems as well as with a variety of psychiatric disorders. ADHD is highly heritable, although there is no single causal risk factor and non-inherited factors also contribute to its aetiology. The genetic and environmental risk factors that have been implicated appear to be associated with a range of neurodevelopmental and neuropsychiatric outcomes, not just ADHD. The evidence to date suggests that both rare and multiple common genetic variants likely contribute to ADHD and modify its phenotype. ADHD or a similar phenotype also appears to be more common in extreme low birth weight and premature children and those exposed to exceptional early adversity. In this review, the authors consider recent developments in the understanding of risk factors that influence ADHD.
Measuring media-based social interactions provided by smartphone applications in social networks

Increasing varieties of applications for smartphones allow users to post (upload) multimedia content and interact in social networks. Usually modeled as a graph, social networks are achieved for applying data mining techniques in the analysis of social relations among users. However, these analyses do not make explicit which actions are performed, which types of medias and users' applications for mobile phone are used to provide social interactions. We have been investigating a human-readable technique for representing social interactions as behavioral contingencies -- if-then rules which describe what people do -- and measuring them using data mining procedures. In this paper we apply our technique for analyzing social interactions in group of Facebook users. We present results that enable us to identify the most symmetric social interaction and the smartphone users' application which provides the type of media used in the symmetric social interaction.
Automatic generation of textual image collection descriptions

Digital photo collections are growing rapidly in number and size, making location of relevant images increasingly difficult. Since very few image collections have a description of their content, an image seeker must manually locate image collections and use that collection's image retrieval system to determine if there are any relevant images for his/her need. Manually describing a large and growing image collection that may contain a variety of diverse themes, is a near impossible task. Thus some techniques for automatic generation of image collection descriptions are needed. Further, since most image retrieval systems use text-based queries, it is important that the collection description also be text-based. In the following, we present a system that can automatically generate an image collection description based on available metadata from all images in the collection. These metadata are extended, using information and services available on the Internet, to provide a rich description of the collection as a whole.
Internal Exponential Stabilization to a Nonstationary Solution for 3D Navier-Stokes Equations

We consider the Navier–Stokes system in a bounded domain with a smooth boundary. Given a sufficiently regular time-dependent global solution, we construct a finite-dimensional feedback control that is supported by a given open set and stabilizes the linearized equation. The proof of this fact is based on a truncated observability inequality, the regularizing property for the linearized equation, and some standard techniques of the optimal control theory. We then show that the control constructed for the linear problem stabilizes locally also the full Navier–Stokes system.
Evaluation the Anti-Diabetic Activity of Cherry Laurel (Laurocerasusofficinalis)

Purpose: Cherry laurel has been used as an anti-diabetic drug. In this study, we aimed to evaluate its antidiabetic activity at standard living conditions and under stress by an experimental study. Material and Method: Forty Wistar-Albino rats weighing 300–350 grams were used in this study. Four groups were structured: control, diabetic, glibenclamide and cherry laurel extract. Streptozotocin (50 mg/kg) was injected to induce diabetes. Cherry laurel extract was obtained from the seed of the fruit. Routine blood glucose, insulin, preand intraanesthesia blood glucose levels were measured and compared. The One-way ANOVA followed by Duncan post-hoc test was used for statistical analysis. Results: After the second week of the experiment, Extract 300 and Extract 600 groups had the lower glucose levels (p<0.05). Also, insulin levels measured at the last week of the study revealed that Extract 300 and Extract 600 groups had the highest results (p< 0.01). Glucose levels under stress conditions significantly changed for Extract 300 and glibenclamide group (p<0.05). Glucose level changed more obviously in the Extract 600 group (p<0.001) that means