Miracle-dz/UniFAR-FTUs huggingface dataset:
A Comparison of Approaches to Legacy System Crosscutting Concerns Mining

Mining of crosscutting concerns is a process that crosscutting concerns are automated identified from code of legacy system. The mining of crosscutting concerns provides the possibility for aspect-oriented refactoring of legacy system. This paper compares and analyzes existing crosscutting concerns mining approaches by four aspects: dynamics, mining ranges, mining principle and mining level, and puts forward some future research directions.
Merging distributed database summaries

The database summarization system coined S<scp>aint</scp>E<scp>ti</scp>Q provides multi-resolution summaries of structured data stored into acentralized database. Summaries are computed online with a conceptual hierarchical clustering algorithm. However, most companies work in distributed legacy environments and consequently the current centralized version of S<scp>aint</scp>E<scp>ti</scp>Q is either not feasible (privacy preserving) or not desirable (resource limitations). To address this problem, we propose new algorithms to generate a single summary hierarchy given two distinct hierarchies, without scanning the raw data. The Greedy Merging Algorithm (GMA) takes all leaves of both hierarchies and generates the optimal partitioning for the considered data set with regards to a cost function (compactness and separation). Then, a hierarchical organization of summaries is built by agglomerating or dividing clusters such that the cost function may emphasize local or global patterns in the data. Thus, we obtain two different hierarchies according to the performed optimisation. However, this approach breaks down due to its exponential time complexity. Two alternative approaches with constant time complexity w.r. t. the number of data items, are proposed to tackle this problem. The first one, called Merge by Incorporation Algorithm (MIA), relies on the S<scp>aint</scp>E<scp>ti</scp>Q engine whereas the second approach, named Merge by Alignment Algorithm (MAA), consists in rearranging summaries by levels in a top-down manner. Then, we compare those approaches using an original quality measure in order to quantify how good our merged hierarchies are. Finally, an experimental study, using real data sets, shows that merging processes (MIA and MAA) are efficient in terms of computational time.
Relative Perturbation Bounds for Invariant Subspaces of Inde nite Hermitian Matrices

RelativePerturbationBoundsforInvariantSubspacesofInde niteHermitianMatricesNinoslavTruhar1University Josip Juraj Strossmayer, Faculty of Civil Engineering, Drinska 16a,31000Osijek, Croatia,truhar@most.gfos. hrIvanSlapnicar2University of Split, Faculty of Electrical Engineering, Mechanicering andNaval Architecture, R. Boskovica b.b, 21000Split, Croatia,ivan.slapnicar@fesb.hr,http://adria.fesb.hr/slapAbstractWegivb oundsforthep erturbationsofinvariantsubspacesinde niteHer-mitianmatrixHunderrelativeadditivp erturbationsof.Theclassp erturbations Hwhichwe considerincludesthe imp ortant case whereHis givenwith an elementwise relative error which typicallyo ccurs when the matrix is b eingstored into computer memory, as well as a more general typ e of p erturbations whichare caused by some numerical algorithms. We derive b ounds for three di erent cases:whenHisp erturb edto+ H, when=DADa graded Hermitianmatrixp erturb edbyH+ H=D(A A),andwhenGAGisgiveninafac-torized form, whereAis a non-singular Hermitianmatrix andGhas a fullcolumnrank, and onlyGisb eingp erturb ed. From these resultswe also deriveb ounds forp erturbations of singular subspaces of a general full rank matrix. Subspace p ertur-bationsaremeasuredintermsofp erturbationsthecorresp ondingpro jections,and our results are therefore relative variants of the well-known Davis{Kahan sin theorems. Roughly sp eaking, our b ounds are prop ortional to the size of the relativep erturbationand are inverselyprop ortionalto therelativegap b etween theeigen-values which de ne the inariant subspace and the rest of the sp ectrum. Due to theuseofrelativegaps,ourb oundsareinsomecasesmuchlessp essimisticthantheclassical norm estimates. Our results generalize some of the recent relative p erturba-tionresults.Wealso describ erelationshipsb etweendi erentrelativp erturbationresults and give some numericalexamples.1Part of this work is contained in the author's M.S. thesis [26]. 2Thiswork was supp ortedbyGrant No. 1-01-252 from the Croatian MinistryofScience and Technology. Part of this work was done while the author was visiting thePreprint submitted to ElsevierScience15 February 1997
A ‘best points’ interpolation method for efficient approximation of parametrized functions

We present an interpolation method for efficient approximation of parametrized functions. The method recognizes and exploits the low‐dimensional manifold structure of the parametrized functions to provide good approximation. Basic ingredients include a specific problem‐dependent basis set defining a low‐dimensional representation of the parametrized functions, and a set of ‘best interpolation points’ capturing the spatial‐parameter variation of the parametrized functions. The best interpolation points are defined as solution of a least‐squares minimization problem which can be solved efficiently using standard optimization algorithms. The approximation is then determined from the basis set and the best interpolation points through an inexpensive and stable interpolation procedure. In addition, an a posteriori error estimator is introduced to quantify the approximation error and requires little additional cost. Numerical results are presented to demonstrate the accuracy and efficiency of the method. Copyright © 2007 John Wiley & Sons, Ltd.
On the reported death of the MACHO era

We present radial velocity measurements of four wide halo binary candidates from the sample in Chaname & Gould (CG04) which, to date, is the only sample containing a large number of such candidates. The four candidates that we have observed have projected separations >0.1 pc, and include the two widest binaries from the sample, with separations of 0.45 and 1.1 pc. We confirm that three of the four CG04 candidates are genuine, including the one with the largest separation. The fourth candidate, however, is spurious at the 5σ level. In the light of these measurements, we re-examine the implications for MAssive Compact Halo Object (MACHO) models of the Galactic halo. Our analysis casts doubt on what MACHO constraints can be drawn from the existing sample of wide halo binaries.
Terrain traversability analysis using multi-sensor data correlation by a mobile robot

A key feature for an autonomous mobile robot navigating in off-road unknown areas is environment sensing. Extraction of meaningful information from sensor data allows a good characterization of the near to far terrains, and thus, the ability for the vehicle to achieve its tasks with easiness. We present an image feature extraction scheme to predict mobile platform motion information. For a sequence of run, several images of terrains and vibrations endured by the mobile robot are acquired using a camera and an acceleration sensor. Texture information extracted by the Segmentation-based Fractal Texture Analysis descriptor (SFTA) was used to find correlations with acceleration features quantified using different time analysis parameters. Experimental results showed that texture information is a good candidate to predict running information.
ENFAT-AODV: The fault-tolerant routing protocol for high failure rate Wireless Sensor Networks

As more and more real Wireless Sensor Network's (WSN) applications have been tested and deployed over the last decade, the research community of WSN realizes that several issues need to be revisited from practical angles, such as reliability and availability. Furthermore, fault-tolerance is one of the main issues in WSNs since it becomes critical in real deployed environments where network stability and reduced inaccessibility times are important. Basically, wireless sensor networks suffer from resource limitations, high failure rates and faults caused by the defective nature of wireless communication and the wireless sensor itself. This can lead to situations, where nodes are often interrupted during data transmission and blind spots occur in the network by isolating some of the devices. In this paper, we address the reliability issue by designing an enhanced fault-tolerant mechanism for Ad hoc On-Demand Distance Vector (AODV) routing protocol used in WSN called the ENhancement of FAult-Tolerant AODV (ENFAT-AODV) routing protocol. We design and implement a backup route scheme by creating a backup path for every node in the network. When a node gets failure to deliver the data packet through the main route, it immediately employs the backup route to become a new main path for the next data packet delivery to reduce a number of data packets dropped and to maintain the continuity of data packet transmission in presence of some faults (node or link failures). Furthermore, with high failure rate, this proposed routing protocol improves the throughput and the average End-to-End delay and decrease the control packet load in the network. Consequently, the reliability, availability and maintainability of the network are achieved. The simulation shows that proposed routing scheme is better than the AODV routing.
Designing a tighter searching space for pairwise global sequence alignments over multiple scoring systems

The need to repeat alignments on a pair of amino acid residue sequences to select an appropriate scoring function and detect a significance of score arises in genomics and proteomics. While computing the alignments obtained through a set of typical scoring matrices with the corresponding default gap cost, we observe that many aligned segments are shared with a reference global alignment. We show that parameters extracted from the search for an alignment corresponding to a good scoring system can be used to predict the deviation of alignments computed with respect to different scoring matrices. By training sample pairs of protein sequences from SCOP 1.71 of the ASTRAL database, we build the approximated probability distribution of distance from a node on a reference path to the alignments based on other scoring schemes with respect to the proposed parameters. We show that the overall computational cost to perform alignments using `three' scoring matrices and the proposed method can be reduced to 11% of a normal Needleman-Wunch global alignment with an average 92% accuracy.
Analysis of sentiment on newspaper quotations: A preliminary experiment

Most Opinion Mining work has been carried out on highly subjective text types where the target is clearly defined and unique across the text like movie or product reviews. However, when applying Opinion Mining to the news domain, it is necessary to clearly define the essence of the task, in a more precise manner than it has been done in the field so far. The main tasks that have been implemented in this paper are: identifying a target, creating three different datasets of quotations (reported speech), pertaining to the identified target, from three different dailies, separation of good and bad news content from the good and bad emotions expressed on the target and comparing the results with manual work.
Dietary Cysteine and Other Amino Acids and Stroke Incidence in Women

Background and Purpose— Cysteine could potentially lower the risk of stroke through antihypertensive and antioxidant effects. Our aim was to evaluate the hypothesis that cysteine intake is inversely associated with stroke incidence. Methods— We used data from the Swedish Mammography Cohort, a population-based prospective cohort of 34 250 women who were free of cardiovascular disease and cancer and had completed a food-frequency questionnaire about diet and other risk factors for stroke in the autumn of 1997. Stroke cases were identified by linkage of the study population with the Swedish Inpatient Register and the Swedish Cause of Death Register. Relative risks (RR) with 95% confidence intervals, adjusted for potential confounders, were estimated by using Cox proportional hazards regression model. Results— We ascertained 1751 incident cases of stroke during 10.4 years of follow-up. Dietary cysteine intake (mean, 635 mg/d) was inversely associated with stroke risk. The multivariable RR of total stroke comparing the highest with the lowest quintile of cysteine intake was 0.79 (95% confidence interval, 0.65–0.97; P for trend=0.04). The corresponding RR was 0.82 (95% confidence interval, 0.65–1.03; P for trend=0.12) for cerebral infarction and 0.54 (95% confidence interval, 0.29–1.03; P for trend=0.08) for intracerebral hemorrhage. Dietary intake of other amino acids showed no independent (after adjustment for cysteine intake) association with stroke risk. Conclusions— These findings suggest that dietary cysteine intake may be inversely associated with risk of stroke. Clinical Trial Registration— URL: http://www.clinicaltrials. gov. Unique identifier: NCT01127698.
Why art? Exploring the contribution to mental well-being of the creative aspects and processes of visual art-making in an arts and mental health course

Abstract Background: Evaluations of participatory arts and mental health projects have consistently found improvements in mental well-being but the part played by the creative aspects, as distinct from the benefits of social interaction, remains unclear. Methods: This study explored the specific part played by the creative aspects of introductory arts courses that aim to improve mental well-being. Nine course participants consented to recording of accreditation assessment meetings held with them towards the end of their course. Results: Thematic analysis identified themes relating to two categories: creative processes and the learning that ensued. The creative processes were playful experimentation and inspiration. Learning processes revolved around learning to learn and artistic development. Conclusions: Previous studies have found play, inspiration and learning to be associated with well-being. It therefore seems reasonable to conclude that the creative aspects of the courses did play an important part in improving participants’ well-being.
Docking control of autonomous aerial refueling for UAV based on LQR

Unmanned Aerial Vehicle (UAV) has many advantages, such as miniature,light weight, low cost, excellent and maneuverability and so on, which make it get more and more attention from the military of many countries. A critical limitation for the current use of UAV is their limited range. This paper describes the results of an effort on the modeling of the UAV aerial refueling problem and on how to realize the docking procedure accurately without considering wake effects and natural oscillation of the probe-drogue refueling system. Desirable performances are achieved by the LQR-based control laws for the docking of the UAV to the probe-drogue refueling system. By using the simulation platform of Matlab/Simulink, the simulation results of the tracks of probe and drogue in the docking phrase of aerial refueling are verified. This simulations reveal that the design of the full state feedback controller can realize docking between the tanker and the unmanned aerial vehicle fast and smoothly.
THE DESTRUCTION OF THIN STELLAR DISKS VIA COSMOLOGICALLY COMMON SATELLITE ACCRETION EVENTS

Most Galaxy-sized systems (Mhost ≃ 1012 M☉) in the ΛCDM cosmology are expected to have interacted with at least one satellite with a total mass Msat ≃ 1011 M☉ ≃ 3Mdisk in the past 8 Gyr. Analytic and numerical investigations suggest that this is the most precarious type of accretion for the survival of thin galactic disks because more massive accretion events are relatively rare and less massive ones preserve thin disk components. We use high-resolution, dissipationless N-body simulations to study the response of an initially thin, fully formed Milky Way-type stellar disk to these cosmologically common satellite accretion events, and show that the thin disk does not survive. Regardless of orbital configuration, the impacts transform the disks into structures that are roughly three times as thick and more than twice as kinematically hot as the observed dominant thin disk component of the Milky Way. We conclude that if the Galactic thin disk is a representative case, then the presence of a stabilizing gas component is the only recourse for explaining the preponderance of disk galaxies in a ΛCDM universe; otherwise, the disk of the Milky Way must be uncommonly cold and thin for its luminosity, perhaps as a consequence of an unusually quiescent accretion history.
Reliability evaluation of distribution system with Hybrid Wind/PV/Pico-Hydro Generation

The growing depletion of natural resources, renewable energies has attracted much attention. In this paper three different models which are Wind Turbine Generator (WTG), Photo voltaic (PV) and Pico-Hydro Generator (PHG) are combined as Small Autonomous Hybrid Power System (SAHPS) for reliability evaluation, which are based on different energy sources and operation characteristics. This paper presents models to obtain the SAHPS output and Markov modeling for evaluating availability of SAHPS. The algorithm for restoration time assessment of load point is developed when the SAHPS unit is installed. The reliability performance of Distribution System is analyzed in terms of Distribution System reliability indices with SAHPS and without SAHPS for different load points on a simple 7-bus radial feeder for four different customer scatterings.
Different but equal: the implausible assumption at the heart of neutral theory

1.The core assumption of neutral theory is that all individuals in a community have equal fitness regardless of species, and regardless of the species composition of the community. But, real communities consist of species exhibiting large trait differences; hence these differences must be subject to perfect fitness-equalizing trade-offs for neutrality to hold. 2.Here we explain that perfect equalizing trade-offs are extremely unlikely to occur in reality, because equality of fitness among species is destroyed by: (i) any deviation in the functional form of the trade-off away from the one special form that gives equal fitness; (ii) spatial or temporal variation in performance; (iii) random species differences in performance. 3.In the absence of the density-dependent processes stressed by traditional niche-based community ecology, communities featuring small amounts of (i) or (ii) rapidly lose trait variation, becoming dominated by species with similar traits, and exhibit substantially lower species richness compared to the neutral case. Communities featuring random interspecific variation in traits (iii) lose all but a few fortuitous species. 4.Thus neutrality should be viewed, a priori, as a highly improbable explanation for the long-term co-occurrence of measurably different species within ecological communities. In contrast, coexistence via niche structure and density dependence, is robust to species differences in baseline fitness, and so remains plausible. 5.We conclude that: (i) co-occurring species will typically exhibit substantial differences in baseline fitness even when (imperfect) equalizing trade-offs have been taken into account; (ii) therefore, communities must be strongly niche structured, otherwise they would lose both trait variation and species richness; (iii) nonetheless, even in strongly niche-structured communities, it is possible that the abundance of species with similar traits are at least partially free to drift.
Behavioural Simulation and Synthesis of Biological Neuron Systems using VHDL

The investigation of neuron structures is an incredibly difficult and complex task that yields relatively low rewards in terms of information from biological forms (either animals or tissue). The structures and connectivity of even the simplest invertebrates are almost impossible to establish with standard laboratory techniques, and even when this is possible it is generally time consuming, complex and expensive. Recent work has shown how a simplified behavioural approach to modelling neurons can allow "virtual" experiments to be carried out that map the behaviour of a simulated structure onto a hypothetical biological one, with correlation of behaviour rather than underlying connectivity. The problems with such approaches are numerous. The first is the difficulty of simulating realistic aggregates efficiently, the second is making sense of the results and finally, the models often take days to run therefore it would be advantageous to have a model which can be synthesized onto hardware. In this paper we present a synthesizable VHDL implementation of Neuron models that allow large aggregates to be simulated. The models are demonstrated using a post synthesis system level VHDL model of the C. Elegans locomotory system.
Accumulation of Poly(3-hydroxybutyrate) Helps Bacterial Cells to Survive Freezing

Accumulation of polyhydroxybutyrate (PHB) seems to be a common metabolic strategy adopted by many bacteria to cope with cold environments. This work aimed at evaluating and understanding the cryoprotective effect of PHB. At first a monomer of PHB, 3-hydroxybutyrate, was identified as a potent cryoprotectant capable of protecting model enzyme (lipase), yeast (Saccharomyces cerevisiae) and bacterial cells (Cupriavidus necator) against the adverse effects of freezing-thawing cycles. Further, the viability of the frozen–thawed PHB accumulating strain of C. necator was compared to that of the PHB non-accumulating mutant. The presence of PHB granules in cells was revealed to be a significant advantage during freezing. This might be attributed to the higher intracellular level of 3-hydroxybutyrate in PHB accumulating cells (due to the action of parallel PHB synthesis and degradation, the so-called PHB cycle), but the cryoprotective effect of PHB granules seems to be more complex. Since intracellular PHB granules retain highly flexible properties even at extremely low temperatures (observed by cryo-SEM), it can be expected that PHB granules protect cells against injury from extracellular ice. Finally, thermal analysis indicates that PHB-containing cells exhibit a higher rate of transmembrane water transport, which protects cells against the formation of intracellular ice which usually has fatal consequences.
Adaptive Duty Cycling for Energy Harvesting Systems

Harvesting energy from the environment is feasible in many applications to ameliorate the energy limitations in sensor networks. In this paper, we present an adaptive duty cycling algorithm that allows energy harvesting sensor nodes to autonomously adjust their duty cycle according to the energy availability in the environment. The algorithm has three objectives, namely: (a) achieving energy neutral operation, i.e., energy consumption should not be more than the energy provided by the environment; (b) maximizing the system performance based on an application utility model subject to the above energy-neutrality constraint; and (c) adapting to the dynamics of the energy source at run-time. We present a model that enables harvesting sensor nodes to predict future energy opportunities based on historical data. We also derive an upper bound on the maximum achievable performance assuming perfect knowledge about the future behavior of the energy source. Our methods are evaluated using data gathered from a prototype solar energy harvesting platform and we show that our algorithm can utilize up to 58% more environmental energy compared to the case when harvesting-aware power management is not used