| F.2.m Miscellaneous | Article |
ALGORITHMIC DECIDABILITY OF COMPUTER PROGRAM-FUNCTIONS LANGUAGE PROPERTIES |
Abstract: A mathematical notion of a computer program-function for some programming languages (in particular,
for some versions of Pascal and Turbo/Visual Prolog) is introduced as a restriction of an |
| F.2.1 Numerical Algorithms and Problems | Article |
A COMBINED EXTERIOR PENALTY FUNCTION – CONJUGATE GRADIENT ALGORITHM ... |
Abstract: In this paper, combined exterior penalty function-conjugate gradient algorithm for a constrained optimal
control problem for the coefficients of a quasilinear equation is applied. The const |
| F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY | Article |
A CONCEPT OF A MODEL OF A COMPUTER SYSTEM FOR FORMING COMPLEX UNITERMS |
Abstract: The existing methods of intuitive and mathematical methods of application of algorithms in
system are described. It is shown that in the existing formula editor of algebra of algorithms onl |
| F.4.1 Mathematical Logic | Article |
A GEOMETRICAL INTERPRETATION TO DEFINE CONTRADICTION |
Abstract: For inference purposes in both classical and fuzzy logic, neither the information itself should be
contradictory, nor should any of the items of available information contradict each other. |
| F.2.m Miscellaneous | Article |
A LANGUAGE USING QUANTIFIERS FOR DESCRIPTION OF ASSERTIONS ABOUT ... |
Abstract: Mathematical models of N-finite (N 2) (especially for N= 216 typical for IBM-compatible personal computers) real, integer or Boolean valued computations are proposed in the frameworks of |
| F.1.1 Models of Computation | Article |
A NEW METHOD FOR THE BINARY ENCODING AND HARDWARE IMPLEMENTATION OF METABOLIC P |
Abstract: In this paper we introduce a new method for the binary encoding of metabolic pathways. Our method
assigns a 5-bit word to the functional groups of the molecules or metabolic intermediates, |
| F.1.1 Models of Computation | Article |
ACCOUNTING IN THEORETICAL GENETICS |
Abstract: We present a logical tool which allows understanding the rationality of the translation underlying some
interactions in Nature. In an abstract, formal way, we can demonstrate the epistemol |
| F.1.1 Models of Computation | Article |
ALGORITHMIZATION PROCESS FOR FRACTAL ANALYSIS IN THE CHAOTIC DYNAMICS OF ... |
Abstract: This work deals in the usage of fractal analysis to determine the trend of dynamic
characteristics of chaotic series based on R/S-analysis. We propose an algorithm using the method of
dyna |
| F.1.1 Models of Computation | Article |
AN ARCHITECTURE FOR REPRESENTING BIOLOGICAL PROCESSES BASED ON NETWORKS... |
Abstract: In this paper we propose the use of Networks of Bio-inspired Processors (NBP) to model some
biological phenomena within a computational framework. In particular, we propose the use of an ex |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
APPROXIMATION GREEDY ALGORITHM FOR RECONSTRUCTING OF (0,1)-MATRICES WITH DIFFERE |
Abstract: Existence and reconstruction issues are considered for a class of (0,1)-matrices with different rows.
Intending to define quantitative characteristics, maximization of which lead to matrice |
| F.1.1 Models of Computation | Article |
AUTOMATA–BASED METHOD FOR SOLVING SYSTEMS OF LINEAR CONSTRAINTS IN {0,1} |
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 t |
| F.1.2 Modes of Computation | Article |
Building Peculiarities of the Modern Wireless Corporate Network |
Abstract: Under consideration is the building of the modern wireless corporate network that implements the
concept of using their own devices. Represented the requirements for the modern wireless net |
| F.1.1 Models of Computation | Article |
CLASSIFICATION OF DATA TO EXTRACT KNOWLEDGE FROM NEURAL NETWORKS |
Abstract: A major drawback of artificial neural networks is their black-box character. Therefore, the rule
extraction algorithm is becoming more and more important in explaining the extracted rules f |
| F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY | Article |
CLASSIFICATION RESULTS FOR (v, k, 1) CYCLIC DIFFERENCE FAMILIES WITH SMALL ... |
Abstract: Classifications of (v, k, 1) cyclic difference families (CDFs) by other authors are known for k = 3 and
v 57, k = 4 and v 64, k = 5 and v 65, k = 6 and v = 91 and k = 7 and v = 91. In |
| F.1.2 Modes of Computation | Article |
COMMUNICATION LATENESS IN SOFTWARE MEMBRANES |
Abstract: This paper presents a study about the time of the communication phase of the P System implemented
as software. After presenting the membranes as software components, is studied how communic |
| F.4.1 Mathematical Logic | Article |
COMPARISON OF PROOF SIZES IN FREGE SYSTEMS AND SUBSTITUTION FREGE SYSTEMS |
Abstract: It is known that the minimal number of the steps in a proof of a tautology in a Frege system can be
exponentially larger than in a substitution Frege system, but it is an open problem wheth |
| F.1.1 Models of Computation | Article |
COMPUTATIONAL MODEL FOR SERENDIPITY |
Abstract: In recent years there have been various attempts and studies that are eager to serendipity in Computer Science. Authors such as Campos and Dias have tried to model the serendipity in order t |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
CONSTRAINED OBJECT-CHARACTERIZATION TABLES AND ALGORITHMS1 |
Abstract: Let ܥ be a collection of objects, characterized by the set ܣ = {ܽଵ,⋯,ܽ} of binary attributes. We
consider problems of the following type: given an object-characterization table, |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
CONSTRAINT CONVEXITY TOMOGRAPHY AND LAGRANGIAN APPROXIMATIONS |
Abstract: This paper considers one particular problem of general type of discrete tomography problems and
introduces an approximate algorithm for its solution based on Lagrangian relaxation. A softwa |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
CONSTRUCTION OF CLASS LEVEL DESCRIPTION FOR EFFICIENT RECOGNITION OF ... |
Abstract: Many artificial intelligence problems are NP-complete ones. To increase the needed time of such a
problem solving a method of extraction of sub-formulas characterizing the common features o |
| F.2.1 Numerical Algorithms and Problems | Article |
CONSTRUCTION OF SOME COMPOSITION PERMUTATIONS VIA LINEAR TRANSLATORS |
Abstract: This paper considers construction of some composition permutation polynomials. For some
permutation polynomials the explicit view of their self-compositions and inverse mappings are given. |
| F.4.1 Mathematical Logic | Article |
CONTRADICTION VERSUS SELFCONTRADICTION IN FUZZY LOGIC* |
Abstract: Trillas et al. introduced in [7] and [8] the concepts of both self-contradictory fuzzy set and contradiction
between two fuzzy sets. Later, in [1] and [2] the necessity of determine not o |
| F.2.2 Nonnumerical Algorithms and Problems | Article |
CONVEXITY RELATED ISSUES FOR THE SET OF HYPERGRAPHIC SEQUENCES |
Abstract: We consider ܦ ,(݊)the set of all degree sequences of simple hypergraphs with ݊ vertices
and ݉ hyperedges. We show that ܦ ,(݊)which is a subset of the ݊-dimensional ݉+1-valued |
Wiki
