DSpace Collection: Volume 13 Number 1
http://hdl.handle.net/10525/711
The Collection's search engineSearch the Channelsearch
http://sci-gems.math.bas.bg/jspui/simple-search
Handling the Subclassing Anomaly with Object Teams
http://hdl.handle.net/10525/731
Title: Handling the Subclassing Anomaly with Object Teams<br/><br/>Authors: Furlong, Jeff; Radenski, Atanas<br/><br/>Abstract: Java software or libraries can evolve via subclassing. Unfortunately, subclassing may not properlysupport code adaptation when there are dependencies between classes. More precisely, subclassing incollections of related classes may require reimplementation of otherwise valid classes. This problem is defined asthe subclassing anomaly, which is an issue when software evolution or code reuse is a goal of the programmerwho is using existing classes. Object Teams offers an implicit fix to this problem and is largely compatible with theexisting JVMs. In this paper, we evaluate how well Object Teams succeeds in providing a solution for a complex,real world project. Our results indicate that while Object Teams is a suitable solution for simple examples, it doesnot meet the requirements for large scale projects. The reasons why Object Teams fails in certain usages mayprove useful to those who create linguistic modifications in languages or those who seek new methods for codeadaptation.A Sensitive Metric of Class Cohesion
http://hdl.handle.net/10525/730
Title: A Sensitive Metric of Class Cohesion<br/><br/>Authors: Fernández, Luis; Peña, Rosalía<br/><br/>Abstract: Metrics estimate the quality of different aspects of software. In particular, cohesion indicates how wellthe parts of a system hold together. A metric to evaluate class cohesion is important in object-orientedprogramming because it gives an indication of a good design of classes.There are several proposals of metrics for class cohesion but they have several problems (for instance, lowdiscrimination). In this paper, a new metric to evaluate class cohesion is proposed, called SCOM, which hasseveral relevant features. It has an intuitive and analytical formulation, what is necessary to apply it to large-sizesoftware systems. It is normalized to produce values in the range [0..1], thus yielding meaningful values. It is alsomore sensitive than those previously reported in the literature. The attributes and methods used to evaluateSCOM are unambiguously stated. SCOM has an analytical threshold, which is a very useful but rare feature insoftware metrics. We assess the metric with several sample cases, showing that it gives more sensitive valuesthan other well know cohesion metrics.HI!MVC: Hierarchical MVC Framework for WEB Applications
http://hdl.handle.net/10525/729
Title: HI!MVC: Hierarchical MVC Framework for WEB Applications<br/><br/>Authors: Gallego-Carrillo, Micael; García-Alcaide, Iván; Montalvo-Herranz, Soto<br/><br/>Abstract: This paper presents Hi!MVC, a framework for developing high interactive web applications with a MVCArchitecture. Nowadays, to manage, extend and correct web applications can be difficult due to the navigationalparadigm they are based on. Hi!MVC framework helps to make these tasks easier.This framework allows building a web based interface, generating each page from the objects that represent itsstate. Every class to be showed in the interface is associated with two entities: its html representation (view) andits interactions in the view manager (controller). The whole html page is generated by composition of viewsaccording to the composition relationship of objects. Interactions between user and application are managed bythe controller associated to the view which shows interaction elements (links or forms). Hi!MVC allows buildingweb interface in a hierarchical and distributed way.There are other frameworks and APIs offering MVC architectures to web applications, but we think that they arenot applying exactly the same concepts. While they keep on basing their architectures on the navigationalparadigm we are offering a new point of view based on an innovator hierarchical model.First, we present the main ideas of our proposal. Next, we expose how to implement it using different Javatechnologies. Finally, we make a first approach to our hierarchical MVC model. We also compare shortly ourproposal with the previously cited technologies.Matricial Model for the Study of Lower Bounds
http://hdl.handle.net/10525/728
Title: Matricial Model for the Study of Lower Bounds<br/><br/>Authors: Joaquin Erviti, Jose; Toni, Adriana<br/><br/>Abstract: Let V be an array. The range query problem concerns the design of data structures for implementingthe following operations. The operation update(j,x) has the effect vj ← vj + x, and the query operationretrieve(i,j) returns the partial sum vi + ... + vj. These tasks are to be performed on-line. We define analgebraic model – based on the use of matrices – for the study of the problem. In this paper we establish as wella lower bound for the sum of the average complexity of both kinds of operations, and demonstrate that this lowerbound is near optimal – in terms of asymptotic complexity.Data Flow Analysis and the Linear Programming Model
http://hdl.handle.net/10525/727
Title: Data Flow Analysis and the Linear Programming Model<br/><br/>Authors: Aslanyan, Levon<br/><br/>Abstract: The general discussion of the data flow algorithmic models, and the linear programming problem withthe variating by data flow criterion function coefficients are presented. The general problem is widely known indifferent names - data streams, incremental and online algorithms, etc. The more studied algorithmic modelsinclude mathematical statistics and clustering, histograms and wavelets, sorting, set cover, and others. Linearprogramming model is an addition to this list. Large theoretical knowledge exists in this as the simplex algorithmand as interior point methods but the flow analysis requires another interpretation of optimal plans and plantransition with variate coefficients. An approximate model is devised which predicts the boundary stability point forthe current optimal plan. This is valuable preparatory information of applications, moreover when a parallelcomputational facility is supposed.<br/><br/>Description: * The research is supported partly by INTAS: 04-77-7173 project, http://www.intas.beDynamical Systems in Description of Nonlinear Recursive Regression Transformers
http://hdl.handle.net/10525/726
Title: Dynamical Systems in Description of Nonlinear Recursive Regression Transformers<br/><br/>Authors: Kirichenko, Mykola; Donchenko, Volodymyr; Serbaev, Denys<br/><br/>Abstract: The task of approximation-forecasting for a function, represented by empirical data was investigated.Certain class of the functions as forecasting tools: so called RFT-transformers, – was proposed. Least SquareMethod and superposition are the principal composing means for the function generating. Besides, the specialclasses of beam dynamics with delay were introduced and investigated to get classical results regardinggradients. These results were applied to optimize the RFT-transformers. The effectiveness of the forecast wasdemonstrated on the empirical data from the Forex market.Fuzzy Set Theory Approach as the Basis of Analysis of Financial Flows in the Economical Security System
http://hdl.handle.net/10525/725
Title: Fuzzy Set Theory Approach as the Basis of Analysis of Financial Flows in the Economical Security System<br/><br/>Authors: Kuzemin, Alexander; Lyashenko, Vyacheslav<br/><br/>Abstract: The problems of formalization of the process of matching different management subjects’ functioningcharacteristics obtained on the financial flows analysis basis is considered. Formal generalizations for gainingeconomical security system knowledge bases elements are presented. One of feedback directions establishmentbetween knowledge base of the system of economical security and financial flows database analysis issubstantiated.Optimum Trajectory of Dynamic Input-Output Balance Model for Open Economy
http://hdl.handle.net/10525/724
Title: Optimum Trajectory of Dynamic Input-Output Balance Model for Open Economy<br/><br/>Authors: Lyashenko, Igor; Lyashenko, Olena<br/><br/>Abstract: When export and import is connected with output of basic production, and criterion functionalrepresents a final state of economy, the generalization of classical qualitative results of the main-line theory on acase of dynamic input-output balance optimization model for open economy is given.About Problems of Decision Making in Social and Economic Systems
http://hdl.handle.net/10525/723
Title: About Problems of Decision Making in Social and Economic Systems<br/><br/>Authors: Voloshyn, Oleksiy<br/><br/>Abstract: The reasons of a restricted applicability of the models of decision making in social and economicsystems. 3 basic principles of growth of their adequacy are proposed: "localization" of solutions, direct account ofinfluencing of the individual on process of decision making ("subjectivity of objectivity") and reduction ofinfluencing of the individual psychosomatic characteristics of the subject (" objectivity of subjectivity ") are offered.The principles are illustrated on mathematical models of decision making in ecologically- economic and socialsystems.Basic Interactions between Members of the Knowledge Market
http://hdl.handle.net/10525/722
Title: Basic Interactions between Members of the Knowledge Market<br/><br/>Authors: Ivanova, Krassimira; Ivanova, Natalia; Danilov, Andrey; Mitov, Ilia; Markov, Krassimir<br/><br/>Abstract: The interconnections and information interactions between main members of the Knowledge Market are presented in the paper.The Staple Commodities of the Knowledge Market
http://hdl.handle.net/10525/721
Title: The Staple Commodities of the Knowledge Market<br/><br/>Authors: Markov, Krassimir; Ivanova, Krassimira; Mitov, Ilia<br/><br/>Abstract: In this paper, the “Information Market” is introduced as a payable information exchange and based on itinformation interaction. In addition, special kind of Information Markets - the Knowledge Markets are outlined. Themain focus of the paper is concentrated on the investigation of the staple commodities of the knowledge markets.They are introduced as kind of information objects, called “knowledge information objects”. The main theirsdistinctive characteristic is that they contain information models, which concern sets of information models andinterconnections between them.Using Sensitivity as a Method for Ranking the Test Cases Classified by Binary Decision Trees
http://hdl.handle.net/10525/720
Title: Using Sensitivity as a Method for Ranking the Test Cases Classified by Binary Decision Trees<br/><br/>Authors: Noblesse, Sabrina; Vanhoof, Koen<br/><br/>Abstract: Usually, data mining projects that are based on decision trees for classifying test cases will use theprobabilities provided by these decision trees for ranking classified test cases. We have a need for a bettermethod for ranking test cases that have already been classified by a binary decision tree because theseprobabilities are not always accurate and reliable enough. A reason for this is that the probability estimatescomputed by existing decision tree algorithms are always the same for all the different cases in a particular leaf ofthe decision tree. This is only one reason why the probability estimates given by decision tree algorithms can notbe used as an accurate means of deciding if a test case has been correctly classified. Isabelle Alvarez hasproposed a new method that could be used to rank the test cases that were classified by a binary decision tree[Alvarez, 2004]. In this paper we will give the results of a comparison of different ranking methods that are basedon the probability estimate, the sensitivity of a particular case or both.