Abstract: In data mining, efforts have focused on finding methods for efficient and effective cluster analysis in large databases. Active themes of research focus on the scalability of clustering methods, the effectiveness of methods for clustering complex shapes and types of data, high-dimensional clustering techniques, and methods for clustering mixed numerical and categorical data in large databases. One of the most accuracy approach based on dynamic modeling of cluster similarity is called Chameleon. In this paper we present a modified hierarchical clustering algorithm that used the main idea of Chameleon and the effectiveness of suggested approach will be demonstrated by the experimental results.

Keywords: Chameleon, clustering, hypergraph partitioning, coarsening hypergraph.

ACM Classification Keywords F.2.1 Numerical Algorithms and Problems

Link:

THE NEW SOFTWARE PACKAGE FOR DYNAMIC HIERARCHICAL CLUSTERING FOR CIRCLES TYPES OF SHAPES

Tetyana Shatovska, Tetiana Safonova, Iurii Tarasov

http://www.foibg.com/ijita/vol15/ijita15-2-p13.pdf

Abstract: Presented is webComputing – a general framework of mathematically oriented services including remote access to hardware and software resources for mathematical computations, and web interface to dynamic interactive computations and visualization in a diversity of contexts: mathematical research and engineering, computer-aided mathematical/technical education and distance learning. webComputing builds on the innovative webMathematica technology connecting technical computing system Mathematica to a web server and providing tools for building dynamic and interactive web-interface to Mathematica-based functionality. Discussed are the conception and some of the major components of webComputing service: Scientific Visualization, Domain- Specific Computations, Interactive Education, and Authoring of Interactive Pages.

Keywords: web-access, mathematical user-interfaces, web computations, mathematical active learning.

ACM Classification Keywords: F.1.2 Modes of Computation: interactive computation, online computation; G.4 Mathematical Software: user interfaces; K.3.1 Computer Use in Education: distance learning.

Link:

WEBCOMPUTING SERVICE FRAMEWORK

Evgenija Popova

http://www.foibg.com/ijita/vol13/ijita13-3-p08.pdf

Abstract: This paper is focused on a parallel JAVA implementation of a processor defined in a Network of Evolutionary Processors. Processor description is based on JDom, which provides a complete, Java-based solution for accessing, manipulating, and outputting XML data from Java code. Communication among different processor to obtain a fully functional simulation of a Network of Evolutionary Processors will be treated in future. A safe-thread model of processors performs all parallel operations such as rules and filters. A non-deterministic behavior of processors is achieved with a thread for each rule and for each filter (input and output). Different results of a processor evolution are shown.

Keywords: Networks of Evolutionary Processors, Membrane Systems, Natural Computation.

ACM Classification Keywords: F.1.2 Modes of Computation, I.6.1 Simulation Theory, H.1.1 Systems and Information Theory

Link:

NETWORKS OF EVOLUTIONARY PROCESSORS: JAVA IMPLEMENTATION OF A THREADED PROCESSOR1

Miguel Angel Díaz, Luis Fernando de Mingo López, Nuria Gómez Blas

http://www.foibg.com/ijita/vol15/ijita15-1-p06.pdf

Abstract: This paper presents the application of Networks of Evolutionary Processors to Decision Support Systems, precisely Knowledge-Driven? DSS. Symbolic information and rule-based behavior in Networks of Evolutionary Processors turn out to be a great tool to obtain decisions based on objects present in the network. The non-deterministic and massive parallel way of operation results in NP-problem solving in linear time. A working NEP example is shown.

Keywords: Natural Computing, Networks of Evolutionary Processors, Decision Support Systems.

ACM Classification Keywords: F.1.2 Modes of Computation, I.6.1 Simulation Theory, H.1.1 Systems and Information Theory.

Link:

NETWORKS OF EVOLUTIONARY PROCESSORS (NEP) AS DECISION SUPPORT SYSTEMS1

Nuria Gómez Blas, Miguel Angel Díaz, Juan Castellanos, Francisco Serradilla

http://www.foibg.com/ijita/vol15/ijita15-1-p05.pdf

Abstract: Transition P Systems are a parallel and distributed computational model based on the notion of the cellular membrane structure. Each membrane determines a region that encloses a multiset of objects and evolution rules. Transition P Systems evolve through transitions between two consecutive configurations that are determined by the membrane structure and multisets present inside membranes. Moreover, transitions between two consecutive configurations are provided by an exhaustive non-deterministic and parallel application of evolution rules. But, to establish the rules to be applied, it is required the previous calculation of useful, applicable and active rules. Hence, computation of useful evolution rules is critical for the whole evolution process efficiency, because it is performed in parallel inside each membrane in every evolution step. This work defines usefulness states through an exhaustive analysis of the P system for every membrane and for every possible configuration of the membrane structure during the computation. Moreover, this analysis can be done in a static way; therefore membranes only have to check their usefulness states to obtain their set of useful rules during execution.

Keywords: Evolution Rules, Usefulness States, Transition P System, Sequential Machines, Static Analysis

ACM Classification Keywords: F.1.1 Computation by abstract devices – Models of computation. D.1.m Miscellaneous – Natural Computing

Link:

STATIC ANALYSIS OF USEFULNESS STATES IN TRANSITION P SYSTEMS

Juan Alberto Frutos, Luis Fernandez, Fernando Arroyo, Gines Bravo

http://www.foibg.com/ijitk/ijitk-vol02/ijitk02-1-p10.pdf

Abstract: Special generalizing for the artificial neural nets: so called RFT – FN – is under discussion in the report. Such refinement touch upon the constituent elements for the conception of artificial neural network, namely, the choice of main primary functional elements in the net, the way to connect them(topology) and the structure of the net as a whole. As to the last, the structure of the functional net proposed is determined dynamically just in the constructing the net by itself by the special recurrent procedure. The number of newly joining primary functional elements, the topology of its connecting and tuning of the primary elements is the content of the each recurrent step. The procedure is terminated under fulfilling “natural” criteria relating residuals for example. The functional proposed can be used in solving the approximation problem for the functions, represented by its observations, for classifying and clustering, pattern recognition, etc. Recurrent procedure provide for the versatile optimizing possibilities: as on the each step of the procedure and wholly: by the choice of the newly joining elements, topology, by the affine transformations if input and intermediate coordinate as well as by its nonlinear coordinate wise transformations. All considerations are essentially based, constructively and evidently represented by the means of the Generalized Inverse.

Keywords: Artificial neural network, approximating problem, beam dynamics with delay, optimization.

ACM Classification keywords:F.1.1.Models of Computation: Self modifying machines(neural networks; G.1.6. Optimization; H.1.m. Models and principles; I.2.6. Artificial Intelligence: learning, connectionism and neural nets.

Link:

GENERALIZING OF NEURAL NETS: FUNCTIONAL NETS OF SPECIAL TYPE

Volodymyr Donchenko, Mykola Kirichenko, Yuriy Krivonos

http://www.foibg.com/ijita/vol14/ijita14-3-p10.pdf

Abstract: We consider a finite state automata based method of solving a system of linear Diophantine equations with coefficients from the set {-1,0,1} and solutions in {0,1}.

Keywords: system of the linear Diophantine equations, set of the basis solutions, outputless finite state automaton.

ACM Classification Keywords: F.1.1 Models of Computation - finite automata, systems of linear Diophantine constraints

Link:

AUTOMATA–BASED METHOD FOR SOLVING SYSTEMS OF LINEAR CONSTRAINTS IN {0,1}

Sergey Krivoi, Lyudmila Matvyeyeva, Wioletta Grzywacz

http://www.foibg.com/ijita/vol12/ijita12-4-p10.pdf

Abstract: This paper presents some connectionist models that are widely used to solve NP-problems. Most well known numeric models are Neural Networks that are able to approximate any function or classify any pattern set provided numeric information is injected into the net. Neural Nets usually have a supervised or unsupervised learning stage in order to perform desired response. Concerning symbolic information new research area has been developed, inspired by George Paun, called Membrane Systems. A step forward, in a similar Neural Network architecture, was done to obtain Networks of Evolutionary Processors (NEP). A NEP is a set of processors connected by a graph, each processor only deals with symbolic information using rules. In short, objects in processors can evolve and pass through processors until a stable configuration is reach. This paper just shows some ideas about these two models.

Keywords: Natural Computation, Membrane Systems, Neural Networks, Networks of Evolutionary Processors.

ACM Classification Keywords: F.1.1 Models of Computation: Self-modifying machines (neural networks); F.4.1 Mathematical Logic: Computational logic

Link:

FILTERED NETWORKS OF EVOLUTIONARY PROCESSORS*

Luis Fernando de Mingo López, Eugenio Santos Menéndez,Francisco Gisbert

http://www.foibg.com/ijita/vol12/ijita12-1-p01.pdf

Abstract: Signal processing is an important topic in technological research today. In the areas of nonlinear dynamics search, the endeavor to control or order chaos is an issue that has received increasing attention over the last few years. Increasing interest in neural networks composed of simple processing elements (neurons) has led to widespread use of such networks to control dynamic systems learning. This paper presents backpropagation-based neural network architecture that can be used as a controller to stabilize unsteady periodic orbits. It also presents a neural network-based method for transferring the dynamics among attractors, leading to more efficient system control. The procedure can be applied to every point of the basin, no matter how far away from the attractor they are. Finally, this paper shows how two mixed chaotic signals can be controlled using a backpropagation neural network as a filter to separate and control both signals at the same time. The neural network provides more effective control, overcoming the problems that arise with control feedback methods. Control is more effective because it can be applied to the system at any point, even if it is moving away from the target state, which prevents waiting times. Also control can be applied even if there is little information about the system and remains stable longer even in the presence of random dynamic noise.

Keywords: Neural Network, Backpropagation, Chaotic Dynamic Systems, Control Feedback Methods.

ACM Classification Keywords: F.1.1 Models of Computation: Self-modifying machines (neural networks); F.1.2 Modes of Computation: Alternation and nondeterminism; G.1.7 Ordinary Differential Equations: Chaotic systems; G.3 Probability and Statistics: Stochastic processes

Link:

NEURAL CONTROL OF CHAOS AND APLICATIONS

Cristina Hernández, Juan Castellanos, Rafael Gonzalo, Valentín Palencia

http://www.foibg.com/ijita/vol12/ijita12-2-p01.pdf

Abstract: An important task for a direct mailing company is to detect potential customers in order to avoid unnecessary and unwanted mailing. This paper describes a non-linear method to predict profiles of potential customers using dARTMAP, ARTMAP-IC, and Fuzzy ARTMAP neural networks. The paper discusses advantages of the proposed approaches over similar techniques based on MLP neural networks.

Keywords: ARTMAP, neural networks, data mining

ACM Classification Keywords: F.1.1 Models of Computation - neural networks, H.2.8 Database Applications -data mining.

Link:

SOLVING A DIRECT MARKETING PROBLEM BY THREE TYPES OF ARTMAP NEURAL NETWORKS

Anatoli Nachev

http://www.foibg.com/ijita/vol15/ijita15-1-p10.pdf

Abstract: General Regression Neuro-Fuzzy? Network, which combines the properties of conventional General Regression Neural Network and Adaptive Network-based Fuzzy Inference System is proposed in this work. This network relates to so-called “memory-based networks”, which is adjusted by one-pass learning algorithm.

Keywords: memory-based networks, one-pass learning, Fuzzy Inference Systems, fuzzy-basis membership functions, neurons at data points, nonlinear identification.

ACM Classification Keywords: F.1 Computation by abstract devices - Self-modifying machines (e.g., neural networks), I.2.6 Learning - Connectionism and neural nets, G.1.2. Approximation – Nonlinear approximation.

Link:

GENERAL REGRESSION NEURO–FUZZY NETWORK FOR IDENTIFICATION OF NONSTATIONARY PLANTS

Yevgeniy Bodyanskiy, Nataliya Teslenko

http://www.foibg.com/ijitk/ijitk-vol02/ijitk02-2-p05.pdf

Abstract: The basic conceptions of the model „entity-relationship” as entities, relationships, structural constraints of the relationships (index cardinality, participation degree, and structural constraints of kind (min, max)) are considered and formalized in terms of relations theory. For the binary relations two operators (min and max) are introduced; structural constraints are determined in terms of the operators; the main theorem about compatibility of these operators’ values on the source relation and inversion to it is given here.

Keywords: entity, relationship, index cardinality, participation degree, structural constraints of kind (min, max).

ACM Classification Keywords: E.4 Coding and information theory – Formal models of communication

Link:

FORMALIZATION OF STRUCTURAL CONSTRAINTS OF RELATIONSHIPS IN MODEL „ENTITY-RELATIONSHIP”

Dmytro Buy, Lyudmila Silveystruk

http://www.foibg.com/ijita/vol14/ijita14-4-p07.pdf

Abstract: An approach for organizing the information in the data warehouses is presented in the paper. The possibilities of the numbered information spaces for building data warehouses are discussed. An application is outlined in the paper.

Keywords: Data Warehouses, Operational Data Stores, Numbered Information Spaces

ACM Classification Keywords: E.1 Data structures, E.2 Data storage representations

Link:

BUILDING DATA WAREHOUSES USING NUMBERED INFORMATION SPACES

Krassimir Markov

http://www.foibg.com/ijita/vol12/ijita12-2-p12.pdf

Abstract: In this paper a methodology for evaluation of information security of objects under attacks, processed by methods of compression, is represented. Two basic parameters for evaluation of information security of objects – TIME and SIZE – are chosen and the characteristics, which reflect on their evaluation, are analyzed and estimated. A co-efficient of information security of object is proposed as a mean of the coefficients of the parameter TIME and SIZE. From the simulation experiments which were carried out methods with the highest co-efficient of information security had been determined. Assessments and conclusions for future investigations are proposed.

Keywords: Information Security, File Objects, Information Attacks, Methods of Compression, Information Flows, Coefficient of Information Security

ACM Classification Keywords: D.4.6 Security and Protection: information flow controls

Link:

ANALYSIS OF INFORMATION SECURITY OF OBJECTS UNDER ATTACKS AND PROCESSED BY METHODS OF COMPRESSION

Dimitrina Polimirova-Nickolova?, Eugene Nickolov

http://www.foibg.com/ijitk/ijitk-vol02/ijitk02-2-p01.pdf

Abstract: This paper deals with the security problems of DRM protected e-learning content. After a short review of the main DRM systems and methods used in e-learning, an examination is made of participators in DRM schemes (e-learning object author, content creator, content publisher, license creator and end user). Then a conceptual model of security related processes of DRM implementation is proposed which is improved afterwards to reflect some particularities in DRM protection of e-learning objects. A methodical way is used to describe the security related motives, responsibilities and goals of the main participators involved in the DRM system. Taken together with the process model, these security properties are used to establish a list of requirements to fulfill and a possibility for formal verification of real DRM systems compliance with these requirements.

Keywords: Security, DRM protection, e-learning.

ACM Classification Keywords: D.4.6 Security and Protection.

Link:

CONCEPTUAL MODEL AND SECURITY REQUIREMENTS FOR DRM TECHNIQUES USED FOR E-LEARNING OBJECTS PROTECTION

Maria Nickolova, Eugene Nickolov

http://www.foibg.com/ijitk/ijitk-vol01/ijitk01-1-p18.pdf

Abstract: Possibilities for investigations of 43 varieties of file formats (objects), joined in 10 groups; 89 information attacks, joined in 33 groups and 73 methods of compression, joined in 10 groups are described in the paper. Experimental, expert, possible and real relations between attacks’ groups, method’ groups and objects’ groups are determined by means of matrix transformations and the respective maximum and potential sets are defined. At the end assessments and conclusions for future investigation are proposed.

Keywords: File Formats, Information Attacks, Methods of Compression, Compressed Objects, Information Security.

ACM Classification Keywords: D.4.6 Security and Protection: information flow controls

Link:

INVESTIGATING THE RELATIONS OF ATTACKS, METHODS AND OBJECTS IN REGARD TO INFORMATION SECURITY IN NETWORK TCP/IP ENVIRONMENT

Dimitrina Polimirova, Eugene Nickolov, Cecko Nikolov

http://www.foibg.com/ijitk/ijitk-vol01/ijitk01-1-p17.pdf

Abstract: In this paper a possibility for quantitative measuring of information security of objects, exposed to information attacks and processed with methods of compression, is represented. A co-efficient of information security, which reflects the influence of the level of compression obtained after applying methods of compression to objects and the time, required by the attack to get access to the corresponding object, is proposed. Methods’ groups with the highest and respectively the lowest values of the co-efficient of information security for all methods’ groups in relation to all attacks’ groups are determined. Assessments and conclusions for future investigations are proposed.

Keywords: Information Flows, Information Security, Information Attacks, Methods of Compression, Compressed Objects, Coefficient of Information Security, Level of Compression.

ACM Classification Keywords: D.4.6 Security and Protection: information flow controls

Link:

RESEARCH OF THE INFLUENCE OF METHODS OF COMPRESSION ON THE CO-EFFICIENT OF INFORMATION SECURITY OF OBJECTS UNDER ATTACKS

Dimitrina Polimirova, Eugene Nickolov, Cecko Nikolov

http://www.foibg.com/ijitk/ijitk-vol01/ijitk01-3-p10.pdf

Abstract: The paper represents a verification of a previously developed conceptual model of security related processes in DRM implementation. The applicability of established security requirements in practice is checked as well by comparing these requirements to four real DRM implementations (Microsoft Media DRM, Apple's iTunes, SunnComm? Technologies’s MediaMax? DRM and First4Internet’s? XCP DRM). The exploited weaknesses of these systems resulting from the violation of specific security requirements are explained and the possibilities to avoid the attacks by implementing the requirements in designing step are discussed.

Keywords: Security, DRM protection, e-learning.

ACM Classification Keywords: D.4.6 Security and Protection

Link:

VERIFICATION AND APPLICATION OF CONCEPTUAL MODEL AND SECURITY REQUIREMENTS ON PRACTICAL DRM SYSTEMS IN E-LEARNING

Maria Nickolova, Eugene Nickolov

http://www.foibg.com/ijitk/ijitk-vol01/ijitk01-2-p10.pdf

Abstract: In this paper is proposed a model for researching the capability to influence, by selected methods’ groups of compression, to the co-efficient of information security of selected objects’ groups, exposed to selected attacks’ groups. With the help of methods for multi-criteria evaluation are chosen the methods’ groups with the lowest risk with respect to the information security. Recommendations for future investigations are proposed.

Keywords: Attacks, Methods of Compression, Objects, Information Security, Methods for Multi-criteria Evaluation, Risk Assessment.

ACM Classification Keywords: D.4.6 Security and Protection: information flow controls

Link:

APPLICATION OF METHODS OF MULTI-CRITERIA EVALUATION IN CHOOSING A METHOD OF COMPRESSION AS A MEANS OF HEIGHTENING THE INFORMATION SECURITY OF SYSTEM AND APPLIED OBJECTS

Dimitrina Polimirova, Eugene Nickolov, Cecko Nikolov

http://www.foibg.com/ijitk/ijitk-vol01/ijitk01-4-p09.pdf

Abstract: This paper suggest a generic threat model for the processes in e-learning systems. After a breaf discussion of the particularities of e-learning systems from the security point of view, the role of threat models in system security is explained. Then a characterization of the attackers is made, together with the assets and entry points identification and threats identification and classification. The most probable attacks for e-learning system are described regardless of the specific implementation, to help the e-learning system developers to eliminate or mitigate these attacks if possible in the design stage not waiting for actual attacks to occur.

Keywords: Security, threat modeling, e-learning.

ACM Classification Keywords: D.4.6 Security and Protection

Link:

THREAT MODEL FOR USER SECURITY IN E-LEARNING SYSTEMS

Maria Nickolova, Eugene Nickolov

http://www.foibg.com/ijitk/ijitk-vol01/ijitk01-4-p07.pdf

Abstract: The principal methods of compression and different types of non-encrypted objects are described. An analysis is made of the results obtained from examinations of the speed of compression for objects when using passwords with different length. The size of the new file obtained after compression is also analyzed. Some evaluations are made with regard to the methods and the objects used in the examinations. In conclusion some deductions are drawn as well as recommendations for future work.

Keywords: Password, Methods of Compression, Non-Encrypted? Applications, Archive Programs, Level of Compression, File Extensions, Information Security.

ACM Classification Keywords: D.4.6 Security and Protection: information flow controls

Link:

EXAMINATION OF PASSWORDS’ INFLUATION ON THE COMPRESSING PROCESS OF NON-ENCRYPTED OBJECTS

Dimitrina Polimirova-Nickolova?, Eugene Nickolov

http://www.foibg.com/ijita/vol12/ijita12-1-p05.pdf

Abstract: The goal of this paper is to outline the advance of the access methods in the last ten years as well as to make review of all available in the accessible bibliography methods.

Keywords: Access Methods, Overview of the Access Methods

ACM Classification Keywords: D.4.3 File Systems Management, Access methods

Link:

ADVANCE OF THE ACCESS METHODS

Krassimir Markov, Krassimira Ivanova, Ilia Mitov, Stefan Karastanev

http://www.foibg.com/ijitk/ijitk-vol02/ijitk02-2-p04.pdf

Abstract: Java software or libraries can evolve via subclassing. Unfortunately, subclassing may not properly support code adaptation when there are dependencies between classes. More precisely, subclassing in collections of related classes may require reimplementation of otherwise valid classes. This problem is defined as the subclassing anomaly, which is an issue when software evolution or code reuse is a goal of the programmer who is using existing classes. Object Teams offers an implicit fix to this problem and is largely compatible with the existing 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 does not meet the requirements for large scale projects. The reasons why Object Teams fails in certain usages may prove useful to those who create linguistic modifications in languages or those who seek new methods for code adaptation.

Keywords: Languages; Code reuse; Subclassing

ACM Classification Keywords: D.3.2 Programming Languages: Language Classifications – Extensible languages, object-oriented languages; D.3.3 Programming Languages: Language Constructs and Features – Classes and objects, data types and structures, inheritance, polymorphism

Link:

HANDLING THE SUBCLASSING ANOMALY WITH OBJECT TEAMS

Jeff Furlong, Atanas Radenski

http://www.foibg.com/ijita/vol13/ijita13-1-p12.pdf

Abstract: This paper describes the use of the Business Process Execution Language for Web Services (BPEL4WS/BPEL) for managing scientific workflows. This work is result of our attempt to adopt Service Oriented Architecture in order to perform Web services – based simulation of metal vapor lasers. Scientific workflows can be more demanding in their requirements than business processes. In the context of addressing these requirements, the features of the BPEL4WS specification are discussed, which is widely regarded as the de-facto standard for orchestrating Web services for business workflows. A typical use case of calculation the electric field potential and intensity distributions is discussed as an example of building a BPEL process to perform distributed simulation constructed by loosely-coupled services. Keywords: BPEL, scientific workflows, Web services, SOA. ACM Classification Keywords: D.2.12 Interoperability - Distributed objects Link: USING THE BUSINESS PROCESS EXECUTION LANGUAGE FOR MANAGING SCIENTIFIC PROCESSES Anna Malinova, Snezhana Gocheva-Ilieva?

http://www.foibg.com/ijitk/ijitk-vol02/ijitk02-3-p09.pdf

Abstract: This article introduces a small setting case study about the benefits of using TSPi in a software project. An adapted process from the current process based on the TSPi was defined. The pilot project had schedule and budget constraints. The process began by gathering historical data from previous projects in order to get a measurement repository. The project was launched with the following goals: increase the productivity, reduce the test time and improve the product quality. Finally, the results were analysed and the goals were verified.

Keywords: TSPi, Small Settings, Process improvement.

ACM Classification Keywords: D.2.9 Software Engineering – Management, software process models

Link:

A SMALL SETTINGS CASE STUDY USING TSPI IN A SOFTWARE PROJECT

Jose Calvo-Manzano?, Gonzalo Cuevas, Tomás San Feliu, Edgar Caballero

http://www.foibg.com/ijitk/ijitk-vol02/ijitk02-3-p07.pdf