DSpace Community: 2007
http://hdl.handle.net/10525/645
The Community's search engineSearch the Channelsearch
http://sci-gems.math.bas.bg/jspui/simple-search
Software for Remote Parallel Simulation
http://hdl.handle.net/10525/709
Title: Software for Remote Parallel Simulation<br/><br/>Authors: Mikov, Alexander; Zamyatina, Elena; Firsov, Anton<br/><br/>Abstract: This paper describes distributed/parallel simulation system Triad.Net and software, which allowsgeographical distributed users to participate collaboratively and remotely in simulation experiments and toobserve simulation model behavior via Internet.Mon, 01 Jan 2007 00:00:00 GMTThe Technology of Programming for a Cluster Computer by the Remote Terminal with OS Windows
http://hdl.handle.net/10525/708
Title: The Technology of Programming for a Cluster Computer by the Remote Terminal with OS Windows<br/><br/>Authors: Cheremisinov, Dmitry; Cheremisinova, Liudmila<br/><br/>Abstract: The problem of preparation of a program to perform it on multiprocessor system of a cluster type isconsidered. When developing programs for a cluster computer the technology based on use of the remoteterminal is applied. The situation when such remote terminal is the computer with operational system Windows isconsidered. The set of the tool means, allowing carrying out of editing program texts, compiling and startingprograms on a cluster computer, is suggested. Advantage of an offered way of preparation of programs toexecution is that it allows as much as possible to use practical experience of programmers used to working in OSWindows environment.Mon, 01 Jan 2007 00:00:00 GMTCluster Supercomputer Architecture
http://hdl.handle.net/10525/707
Title: Cluster Supercomputer Architecture<br/><br/>Authors: Golovinskiy, Andrey; Ryabchun, Sergey; Yakuba, Anatoliy<br/><br/>Abstract: The paper describes the architecture of SCIT - supercomputer system of cluster type and the basearchitecture features used during this research project. This supercomputer system is put into research operationin Glushkov Institute of Cybernetics NAS of Ukraine from the early 2006 year. The paper may be useful for thosescientists and engineers that are practically engaged in a cluster supercomputer systems design, integration andservices.Mon, 01 Jan 2007 00:00:00 GMTThe Application of Graph Model for Automation of the User Interface Construction
http://hdl.handle.net/10525/706
Title: The Application of Graph Model for Automation of the User Interface Construction<br/><br/>Authors: Kudelko, Elena<br/><br/>Abstract: The ability of automatic graphic user interface construction is described. It is based on the building ofuser interface as reflection of the data domain logical definition. The submitted approach to development of theinformation system user interface enables dynamic adaptation of the system during their operation. Thisapproach is used for creation of information systems based on CASE-system METAS.Mon, 01 Jan 2007 00:00:00 GMTDecomposition of Boolean Functions – Recognizing a Good Solution by Traces
http://hdl.handle.net/10525/705
Title: Decomposition of Boolean Functions – Recognizing a Good Solution by Traces<br/><br/>Authors: Zakrevskij, Arkadij<br/><br/>Abstract: The problem of sequent two-block decomposition of a Boolean function is regarded in case when agood solution does exist. The problem consists mainly in finding an appropriate weak partition on the set ofarguments of the considered Boolean function, which should be decomposable at that partition. A new fastheuristic combinatorial algorithm is offered for solving this task. At first the randomized search for traces of such apartition is fulfilled. The recognized traces are represented by some "triads" - the simplest weak partitionscorresponding to non-trivial decompositions. After that the whole sought-for partition is restored from thediscovered trace by building a track initialized by the trace and leading to the solution. The results of computerexperiments testify the high practical efficiency of the algorithm.Mon, 01 Jan 2007 00:00:00 GMTMatrixes of Relations between Pairs Objects and Transformations between Various Kinds
http://hdl.handle.net/10525/704
Title: Matrixes of Relations between Pairs Objects and Transformations between Various Kinds<br/><br/>Authors: Gnatienko, Grigory<br/><br/>Abstract: Ways of representation of relations between pair's objects are described at a complete choice.Methods of revealing and kinds of relations between objects are considered. The table of conformity betweenvarious forms of representation of relations is resulted.Mon, 01 Jan 2007 00:00:00 GMTAlgorithm of Construction of Ordering of the Objects Nearest to the Any Relation on Set of Objects
http://hdl.handle.net/10525/703
Title: Algorithm of Construction of Ordering of the Objects Nearest to the Any Relation on Set of Objects<br/><br/>Authors: Gnatienko, Grigory; Gnatienko, Oleksiy<br/><br/>Abstract: The problem of a finding of ranging of the objects nearest to the cyclic relation set by the expertbetween objects is considered. Formalization of the problem arising at it is resulted. The algorithm based on amethod of the consecutive analysis of variants and the analysis of conditions of acyclicity is offered.Mon, 01 Jan 2007 00:00:00 GMTFormalization of Structural Constraints of Relationships in Model „Entity-Relationship”
http://hdl.handle.net/10525/702
Title: Formalization of Structural Constraints of Relationships in Model „Entity-Relationship”<br/><br/>Authors: Buy, Dmytro; Silveystruk, Lyudmila<br/><br/>Abstract: The basic conceptions of the model „entity-relationship” as entities, relationships, structural constraintsof the relationships (index cardinality, participation degree, and structural constraints of kind (min, max)) areconsidered and formalized in terms of relations theory. For the binary relations two operators (min and max) areintroduced; structural constraints are determined in terms of the operators; the main theorem about compatibilityof these operators’ values on the source relation and inversion to it is given here.Mon, 01 Jan 2007 00:00:00 GMTFinding the Relationship between a Search Algorithm and a Class of Functions on Discrete Space by Exhaustive Search
http://hdl.handle.net/10525/701
Title: Finding the Relationship between a Search Algorithm and a Class of Functions on Discrete Space by Exhaustive Search<br/><br/>Authors: Nedel’ko, Victor; Nedel’ko, Svetlana<br/><br/>Abstract: The task of revealing the relationship between a search algorithm and a class of functions those itsolves is considered. Particularly, there was found a class of functions solvable by some adaptive searchalgorithm for a discrete space of low cardinality. To find an optimal algorithm exhaustive search was used.Algorithm quality criterion based on equivalence classes was also introduced.<br/><br/>Description: * The work is supported by RFBR, grant 04-01-00858-a.Mon, 01 Jan 2007 00:00:00 GMTContradiction versus Selfcontradiction in Fuzzy Logic
http://hdl.handle.net/10525/700
Title: Contradiction versus Selfcontradiction in Fuzzy Logic<br/><br/>Authors: Torres, Carmen; Cubillo, Susana; Castineira, Elena<br/><br/>Abstract: Trillas et al. introduced in [7] and [8] the concepts of both self-contradictory fuzzy set and contradictionbetween two fuzzy sets. Later, in [1] and [2] the necessity of determine not only the contradiction, but also thedegree in that this property occurs, was considered. This paper takes up again these subjects, and firstly westudy if there exists some connection between the two first notions. After that, taking into account that self-contradiction of a fuzzy set could be understood as the contradiction with itself, and starting from the degrees ofcontradiction between two fuzzy sets proposed in [5], we obtain degrees of self-contradiction. Finally,preservation of some intuitive properties both in the use of connectives and in the obtaining of new knowledgethroughout compositional rule of inference, are tested.<br/><br/>Description: * This work is partially supported by CICYT (Spain) under project TIN 2005-08943-C02-001 and by UPM-CAM (Spain) under project R05/11240.Mon, 01 Jan 2007 00:00:00 GMTHW Implementation of a Optimized Algorithm for the Application of Active Rules in a Transition P-system
http://hdl.handle.net/10525/699
Title: HW Implementation of a Optimized Algorithm for the Application of Active Rules in a Transition P-system<br/><br/>Authors: Martinez, Victor; Fernandez, Luis; Arroyo, Fernando; Gutierrez, Abraham<br/><br/>Abstract: P systems or Membrane Computing are a type of a distributed, massively parallel and nondeterministic system based on biological membranes. They are inspired in the way cells process chemicalcompounds, energy and information. These systems perform a computation through transition between twoconsecutive configurations. As it is well known in membrane computing, a configuration consists in a m-tuple ofmultisets present at any moment in the existing m regions of the system at that moment time. Transitionsbetween two configurations are performed by using evolution rules which are in each region of the system in anon-deterministic maximally parallel manner.This work is part of an exhaustive investigation line. The final objective is to implement a HW system that evolvesas it makes a transition P-system. To achieve this objective, it has been carried out a division of this genericsystem in several stages, each of them with concrete matters.In this paper the stage is developed by obtaining the part of the system that is in charge of the application of theactive rules. To count the number of times that the active rules is applied exist different algorithms. Here, it ispresents an algorithm with improved aspects: the number of necessary iterations to reach the final values issmaller than the case of applying step to step each rule. Hence, the whole process requires a minor number ofsteps and, therefore, the end of the process will be reached in a shorter length of time.Mon, 01 Jan 2007 00:00:00 GMTAlgorithmic Minimization of Non-zero Entries in 0,1-Matrices
http://hdl.handle.net/10525/698
Title: Algorithmic Minimization of Non-zero Entries in 0,1-Matrices<br/><br/>Authors: Toni, Adriana; Castellanos, Juan; Erviti, Jose<br/><br/>Abstract: In this paper we present algorithms which work on pairs of 0,1- matrices which multiply again a matrixof zero and one entries. When applied over a pair, the algorithms change the number of non-zero entries presentin the matrices, meanwhile their product remains unchanged. We establish the conditions under which thenumber of 1s decreases. We recursively define as well pairs of matrices which product is a specific matrix andsuch that by applying on them these algorithms, we minimize the total number of non-zero entries present in bothmatrices. These matrices may be interpreted as solutions for a well known information retrieval problem, and inthis case the number of 1 entries represent the complexity of the retrieve and information update operations.Mon, 01 Jan 2007 00:00:00 GMTDescription Reduction for Restricted Sets of (0,1) Matrices
http://hdl.handle.net/10525/697
Title: Description Reduction for Restricted Sets of (0,1) Matrices<br/><br/>Authors: Sahakyan, Hasmik<br/><br/>Abstract: Any set system can be represented as an n -cube vertices set. Restricted sets of n -cube weightedsubsets are considered. The problem considered is in simple description of all set of partitioning characteristicvectors. A smaller generating sets are known as “boundary” and ”steepest” sets and finally we prove that theintersection of these two sets is also generating for the partitioning characteristic vectors.<br/><br/>Description: * The research is supported partly by INTAS: 04-77-7173 project, http://www.intas.beMon, 01 Jan 2007 00:00:00 GMTOn the Coherence Between Probability and Possibility Measures
http://hdl.handle.net/10525/696
Title: On the Coherence Between Probability and Possibility Measures<br/><br/>Authors: Castineira, Elena; Cubillo, Susana; Trillas, Enric<br/><br/>Abstract: The purpose of this paper is to study possibility and probability measures in continuous universes,taking different line to the one proposed and dealt with by other authors. We study the coherence between theprobability measure and the possibility measure determined by a function that is both a possibility density anddistribution function. For this purpose, we first examine functions that satisfy this condition and then we anlyze thecoherence in some notable probability distributions cases.<br/><br/>Description: * This paper is supported by CICYT (Spain) under Project TIN 2005-08943-C02-01.Mon, 01 Jan 2007 00:00:00 GMTSearching for Nearest Strings with Neural-Like String Embedding
http://hdl.handle.net/10525/695
Title: Searching for Nearest Strings with Neural-Like String Embedding<br/><br/>Authors: Sokolov, Artem<br/><br/>Abstract: We analyze an approach to a similarity preserving coding of symbol sequences based on neuraldistributed representations and show that it can be viewed as a metric embedding process.Mon, 01 Jan 2007 00:00:00 GMTSelecting Classifiers Techniques for Outcome Prediction Using Neural Networks Approach
http://hdl.handle.net/10525/694
Title: Selecting Classifiers Techniques for Outcome Prediction Using Neural Networks Approach<br/><br/>Authors: Shatovskaya, Tatiana<br/><br/>Abstract: This paper presents an analysis of different techniques that is designed to aid a researcher indetermining which of the classification techniques would be most appropriate to choose the ridge, robust andlinear regression methods for predicting outcomes for specific quasi-stationary process.Mon, 01 Jan 2007 00:00:00 GMT