Positive and nodal solutions for nonlinear nonhomogeneous parametric neumann problems

We consider a parametric Neumann problem driven by a nonlinear nonhomogeneous differential operator plus an indefinite potential term. The reaction term is superlinear but does not satisfy the Ambrosetti-Rabinowitz condition. First we prove a bifurcation-type result describing in a precise way the dependence of the set of positive solutions on the parameter λ > 0. We also show the existence of a smallest positive solution. Similar results hold for the negative solutions and in this case we have a biggest negative solution. Finally using the extremal constant sign solutions we produce a smooth nodal solution

Using Automatic Static Analysis to Identify Technical Debt

The technical debt (TD) metaphor describes a tradeoff between short-term and long-term goals in software development. Developers, in such situations, accept compromises in one dimension (e.g. maintainability) to meet an urgent demand in another dimension (e.g. delivering a release on time). Since TD produces interests in terms of time spent to correct the code and accomplish quality goals, accumulation of TD in software systems is dangerous because it could lead to more difficult and expensive maintenance. The research presented in this paper is focused on the usage of automatic static analysis to identify Technical Debt at code level with respect to different quality dimensions. The methodological approach is that of Empirical Software Engineering and both past and current achieved results are presented, focusing on functionality, efficiency and maintainabilit

Quantitative Assessment of the Impact of Automatic Static Analysis Issues on Time Efficiency

Background: Automatic Static Analysis (ASA) tools analyze source code and look for code patterns (aka smells) that might cause defective behavior or might degrade other dimensions of software quality, e.g. efficiency. There are many potentially negative code patterns, and ASA tools typically report a huge list of them even in small programs. Moreover, so far, little evidence is available about the negative impact on performance of code patterns identified by such tools. A consequence is that programmers cannot appreciate the benefits of ASA tools and tend not to include them in their workflow. Aims: Quantitatively assess the impact of issues signaled by ASA tools on time efficiency. Method: We select 20 issues and for each of them we set up two source code fragments: one containing the issue and the corresponding refactored version, functionally identical but without the issue. We set up three different platforms, isolated from network and other user programs, then we execute the code fragments, and measure the execution time of both code versions. Results: We find that eleven issues have an actual negative impact on performance. We also compute for each issue an estimation for the delay provoked by a single execution. Conclusions: We produce a set of issues with a verified negative impact on performance. They can be checked easily with an analysis tool and code can be refactored to obtain a provably more efficient code. We also provide the estimated delay cost of each issue in the environments where we conduct the tests. These results can be improved with the help of other researchers: repeating the tests in several platforms would make it possible to build up a wider benchmar

Cyclic (Noncyclic) ϕ-condensing operator and its application to a system of differential equations

We establish a best proximity pair theorem for noncyclic ϕ-condensing operators in strictly convex Banach spaces by using a measure of noncompactness. We also obtain a counterpart result for cyclic ϕ-condensing operators in Banach spaces to guarantee the existence of best proximity points, and so, an extension of Darbo’s fixed point theorem will be concluded. As an application of our results, we study the existence of a global optimal solution for a system of ordinary differential equations

From metric spaces to partial metric spaces

n/

Some new fixed point results in non-Archimedean fuzzy metric spaces

In this paper, we introduce the notions of fuzzy (α,β,ϕ)-contractive mapping, fuzzy α-φ-ψ-contractive mapping and fuzzy α-β-contractive mapping and establish some results of fixed point for this class of mappings in the setting of non-Archimedean fuzzy metric spaces. The results presented in this paper generalize and extend some recent results in fuzzy metric spaces. Also, some examples are given to support the usability of our results

Definition, implementation and validation of energy code smells: an exploratory study on an embedded system

Optimizing software in terms of energy efficiency is one of the challenges that both research and industry will have to face in the next few years.We consider energy efficiency as a software product quality characteristic, to be improved through the refactoring of appropriate code pattern: the aim of this work is identifying those code patterns, hereby defined as Energy Code Smells, that might increase the impact of software over power consumption. For our purposes, we perform an experiment consisting in the execution of several code patterns on an embedded system. These code patterns are executed in two versions: the first one contains a code issue that could negatively impact power consumption, the other one is refactored removing the issue. We measure the power consumption of the embedded device during the execution of each code pattern. We also track the execution time to investigate whether Energy Code Smells are also Performance Smells. Our results show that some Energy Code Smells actually have an impact over power consumption in the magnitude order of micro Watts. Moreover, those Smells did not introduce a performance decreas