Volume 23, No. 1 (2013)
Articles
GRÜSS AND OSTROWSKI TYPE INEQUALITIES AND THEIR APPLICATIONS
ANA MARIA ACU(1), FLORIN SOFONEA(2), CARMEN VIOLETA MURARU(3)
We establish new inequalities for the cumulative distribution function, the incomplete special function, the expectation, the variance and the k-th order moments.
THE USE OF THE CHROMATIC POLYNOMIAL OF A GRAPH IN ENUMERATIVE COMBINATORICS
CORNEL BERCEANU
The chromatic polynomial of a graph on the set N={1,2,...,n} is used as an instrument to find the number of possible partitions of N under some particular restraints and the number of functions on N with special properties.
ON THE ROBUSTNESS OF ANT COLONY OPTIMIZATION
GLORIA CERASELA CRIŞAN
The real life faces many situations when people have to handle inconsistent data (i.e. contradictory facts, opposite opinions, etc.), managing them using personal and social experience and beliefs. Generally speaking, social life forms successfully and gracefully treat these conflicting cases – for example, by identifying the false facts and dropping them. In Computer Science and Information Technology, the problem of error identification and correction is a central one, approached in Code Theory, Software Engineering, Databases, Computer Architecture, etc. This paper studies the behavior of a multi-agent software application when some of the agents have correct information about the solved problem, but the others do not. The well-known Traveling Salesman Problem (TSP) is solved using a biologically-inspired algorithm that models the way real ants manage to find the shortest path from nest to food source. The results are encouraging, showing that the artificial ants manifest the same robustness as real ants.
NEW ASPECTS IN OPTIMIZATION OF BDDS: MIXED TECHNIQUES BASED ON POPULATIONS OF SOLUTIONS AND LOWER BOUND
IULIAN FURDU(1), PETRU GABRIEL PUIU(2)
This paper provides a comprehensive introduction on recent advances to reduced ordered binary decision diagrams (ROBDDs or BDDs) as a state-of-the-art data structure in computed-aided design. Key aspects concerning the use of techniques based on lower bounds in the context of BDD optimization are investigated. Three embryonic genetic algorithms for BDD optimization are presented (from which a new one) and their performance compared.
GEOMETRY ON THE BIG TANGENT BUNDLE
MANUELA GÎRŢU
In this paper we describe some geometrical structures on the manifold fibred over M: Liouville vector fields, almost tangent structure, semisprays, nonlinear connections and we show how these can be used in the study of mechanical systems.
SOFTWARE QUALITY EVALUATION USING FUZZY THEORY
MARA HAJDU-MACELARU
The software quality evaluation is still not a fully resolved problem in Software Engineering. It is known that software quality depends upon several quality attributes such as reliability, modifiability, understandability, testability, usability, portability, and so on. Several authors and international standards have tried to reach an agreement on their definition over the years and provide a standard and accurate one. Due to the complexity of software systems, it is often difficult to evaluate the overall quality of their underlying software components. A way for evaluation is to use software metrics as quantitative predictors when evaluating the quality attributes. There are several metrics based on statistical methods, similar to those used for product inspection and quality assurance in manufacturing, that have been investigated during time by Software Engineering. Some authors have started to use Fuzzy Theory in software assessment and evaluation. And it seems that its usage improves the evaluation of the software quality
R - MECHANICAL SYSTEMS
OTILIA LUNGU
In the present paper we study a particular case of Finslerian mechanical system This is defined by a triple , where M is the configuration space, F(x,y)=α(x,y)+β(x,y) is a Randers metric and are the external forces.
POINCARÉ INEQUALITIES BASED ON BANACH FUNCTION SPACES ON METRIC MEASURE SPACES
MARCELINA MOCANU
We introduce a new type of first order Poincaré inequality for functions defined on a metric measure space, that is an useful tool in the study of Newtonian spaces based on Banach function spaces. This Poincaré inequality extends the Orlicz-Poincaré inequality introduced by Aïssaoui (2004) and the Poincaré inequality based on Lorentz spaces, introduced by Costea and Miranda (2011), that in turn generalize the well-known weak (1,p)-Poincaré inequality. Using very recent results of Durand-Cartagena, Jaramillo and Shanmugalingam (2012, 2013), it turns out that every complete metric space X, endowed with a doubling measure and supporting a weak Poincaré inequality based on a Banach function space is (thick) quasiconvex. We prove that the validity of the Poincaré inequality based on a Banach function space, on a doubling metric measure space, implies a pointwise estimate involving an appropriate maximal operator.
SOME APPROXIMATION PROPERTIES OF q-DURRMEYER-SCHURER OPERATORS
CARMEN VIOLETA MURARU(1), ANA MARIA ACU(2)
In recent years, there are many preoccupations in construction and study of generalized version in q-calculus of well-known linear and positive operators. In [5] is introduced a q-type of Schurer -Bernstein operators. We will propose a Durrmeyer variant of q-Schurer operators of the form studied in [5]. Also, a Bohman-Korovkin type approximation theorem of these operators is considered. The rate of convergence by us-ing the first modulus of smoothness is computed.
MEASURES FOR UNCERTAIN DATA. CASE STUDY ON DATA EXTRACTED FROM MASS MEDIA
ELENA NECHITA
In most of the applications related to real world situations, especially in those dealing with large data sets, uncertainty is unavoidable. Depending on the sources where data come from, uncertainty also comes in different facets. For the computer scientists, the challenge is to process these types of data in such a way that the end user receives the needed information with as much accuracy as possible. Therefore, specific methods had to be developed to deal with the uncertainty characteristic of the data. This paper investigates and compares the information given by two measures of uncertainty, namely uncertainty density and answer decisiveness, when applied to a set of data extracted from mass media. As well, several issues related to uncertainty are going to be discussed for digital media, together with their implications.
GRAVITATIONAL FIELD OF LAGRANGIAN NONHOLONOMIC MECHANICAL SYSTEM
VALER NIMINEŢ
One associates to a Lagrangian nonholonomic mechanical system a canonical semispray on the phase space TM, which has the integral curves given by the evolution equations of . The Lagrange geometry of the system is the geometry of semispray . We study h- and v- electromagnetic tensors and then we apply the Ricci identities for the gravitational potentials.
INTELLIGENT PREVENTION
IOANA ALEXANDRA PANDELE
Forest fire prevention is the set of measures designed to reduce the number of forest fires, their extent and the damage they cause. This concept is closely linked to the risk of forest fires, to which are added factors such as climatic and physiographic conditions and the value of the forest. Knowledge of theories, policies and practices of forest fire prevention is very fragmented, dispersed and largely unpublished. Intelligent Prevention would require integrating the Artificial Intelligence (Intelligent Agents). Intelligent Agent Based Prevention could evaluate overcoming obstacles to prevention, establish links between agents involved in forest management and provide tools for the exchange of information between organizations. The aim of this work is the beginning of achieving the map of potential forest fires from Bacău County, obtained after statistical analysis of fire data (data provided by the Forestry Department of Bacău) and study of the dangerousness forest environment, managing all this data into a Geographic Information System (GIS).
A NAGEL ANALOGUE OF THE STEINER-LEHMUS THEOREM
ION PĂTRAŞCU(1), CĂTĂLIN I. BARBU(2)
In this note we prove an analogue of the Steiner -Lehmus theorem from the Nagel perspective.
ARTIFICIAL ANT SPECIES ON SOLVING OPTIMIZATION PROBLEMS
CAMELIA-M. PINTEA
During the last years several ant-based techniques were involved to solve hard and complex optimization problems. The current paper is a short study about the influence of artificial ant species in solving optimization problems. There are studied the artificial Pharaoh Ants, Lasius Niger and also artificial ants with no special specificity used commonly in Ant Colony Optimization.
MAPS CREATION BY INTERPOLATION USING SPLINE FUNCTIONS IN SCILAB
DAN POPA
In this paper the author is solving, using Scilab, a problem proposed by Octavian Cira [3], concerning: the creation of a map by interpolation based on spline functions. No software like ARC GIS was used here.
TWO GENERAL FIXED POINT THEOREMS UNDER STRICT IMPLICIT RELATIONS IN G - METRIC SPACES
VALERIU POPA(1), ALINA-MIHAELA PATRICIU(2)
In this paper two fixed point theorems are proved, which extend the main results from [31] (V. Popa and A.-M. Patriciu, (E.A) - property and altering distances in metric spaces, Sci. Stud. Res., Ser. Math. Inform. 22, 1(2012), 93-102) to G - metric spaces and generalizing Theorem 2.1 [4] (M Abbas, T Nazir and D. Dorić, Common fixed points of mappings satisfying (E.A) property in generalized metric spaces, Appl. Math. Comput. 28 (2012), 7665-7670) for mappings satisfying (E.A.) property under strict implicit relations.
EFFICIENCY BY MATHEMATICS
VASILE POSTOLICĂ
This research report is devoted to the general concept of the efficiency presented and analysed in an original manner, the optimization being indicated as an equivalent of the efficiency, in the context of the accelerated interoperability that simplify the integration. It is a short synthesis of the last results obtained in this field.
RELIABLE OPEN SOURCE SYSTEM FOR AUTOMATIC RELEASE OF RESERVES USING SCADA INTERFACE
PETRU GABRIEL PUIU(1), IULIAN FURDU(2)
This paper work presents the modeling, simulation and implementation of automatic release of reserves (ARR) in a SCADA interface. In the premises known from the literature, a new method to implement AAR system was identified and applied. The classical solutions, although well known and with good results in operation are expensive. The only solution to eliminate the dependency on software and dedicated equipment is the open sources. Automated system for automatic release of the reserve (AAR) as implemented, consists of two voltage sources (Transformer 1 and Transformer 2) and two roof sections linked by a cross coupling. The project comprises three parts: simulation of real components that goes into AAR, the SCADA implementation and the parameters display. The novelty of the work is the adoption of an Open Source software solution, both for installation control and for programmable controller implementing.
CLOUD COMPUTING- A SOLUTION TO THE CRISIS
ANAMARIA ŞICLOVAN
Millions of people who use the Internet rely on companies and organizations which provide these chargeable services, their aim being to receive as beneficiaries those applications that provide virtualization services as advantageous as possible. In the financial context in which we find ourselves, that is this financial crisis, we believe that cloud computing systems can offer advantages regarding the Internet services expenses. The purpose of our article is to expose the capacity of cloud computing systems of controlling the financial crisis in terms of costs.
INVESTIGATIONS ON THE BISECTION PROBLEM
MIHAI TALMACIU
In this paper we characterize threshold graphs using the weakly decomposition, give a recognition algorithm for this class of graphs and an algorithm for the bisection problem in threshold graphs.
VERIFICATION OF THE NORMAL GRAPH CONJECTURE ON PARTICULAR CLASSES OF GRAPHS
MIHAI TALMACIU
A graph is normal if there exists a cross-intersecting pair of set families one of which consists of cliques while the other one consists of stable sets, and furthermore every vertex is obtained as one of these intersections. It is known that perfect graphs are normal. Korner and de Simone observed that , and are minimal not normal and conjectured, as generalization of the Strong Perfect Graph Theorem, that every ( , , )-free graph is normal (Normal Graph Conjecture). In this paper we prove this conjecture for the class of minimal Asteroidal Triple (AT) graphs.
A SEMANTIC SERVICE COMPOSITION MODEL FOR HEALTH GIS APPLICATIONS DEVELOPMENT
COSMIN-ION TOMOZEI(1), SIMONA-ELENA VÂRLAN(2), IULIAN FURDU(3)
In the development of large scale distributed health applications, the need for adopting new technologies, such as multimedia or GIS, became more and more important. This paper describes a model for the composition of medical web services, by means of a SOA ontology, in which information is combined and process in a semantic approach. The visualization of the resulting data sets is placed on a GIS architecture, which is used for the support of decisions for health services development. In this paper we propose a Semantic Web GIS architecture using SWS technologies together with details about its practical usage and future work. The vast amount of heterogeneous data sources that a GIS practitioner have to cope with to find appropriate resources for special situations has led to a new approach in GIS application research and development. To fill the gap in discovery and share of information we need a semantic layer in GIS framework to give machine understandable meaning to services and web content. Using Semantic Web Services (SWS) we can add higher semantic level to GIS framework improving interop-erability and reasoning for better matching responses
ABOUT DESCRIPTION LOGIC AND ONTOLOGY
SIMONA-ELENA VÂRLAN(1), COSMIN-ION TOMOZEI(2)
Description Logic (DL) it is considered a tool that can make the Semantic Web vision a reality. The Ontology Web Language (OWL), the language to create ontologies, is the product of the combination between Resource Description Framework (RDF) language and DL. In this paper, we analyze the utility that DL brings in implementing ontologies which are the main way to create semantics in Web space.
DOUBLE HYBRIDIZED EMBRYONIC GENETIC ALGORITHM FOR OPTIMAL DELIVERY ROUTING
ADRIAN VÎLCU
This paper presents an efficient embryonic hybrid genetic algorithm for finding a minimum cost Hamiltonian circuit for a variable weight transportation problem. Prior work addresses the design of different heuristic methods, pure genetic algorithms or some hybridizations of genetic algorithm with greedy methods. The proposed algorithm includes a combination between a genetic algorithm, a branch and bound method and a dynamic-programming-inspired method. The basic components of the embryonic genetic algorithm are defined, the ways of using dynamic programming as a hypermutation operator and the realization of the fusion between the branch and bound approach and the basic genetic algorithm are described. The experimental results are compared to those given by other existing methods. The originality of this paper results from a combination of exact techniques - branch and bound method and dynamic programming and genetic algorithm. Except a better solving method for the delivery problem, this new solving technique has design implications on the creation of new methods for solving other difficult practical problems.