DSpace Collection: Volume 14, Number 1-2
http://hdl.handle.net/10525/4030
The Collection's search engineSearch the Channelsearch
http://sci-gems.math.bas.bg/jspui/simple-search
Common Vulnerabilities and Exposures from Emails
http://hdl.handle.net/10525/4036
Название: Common Vulnerabilities and Exposures from Emails<br/><br/>Authors: Hasan, Falak Ussien<br/><br/>Краткий обзор (реферат): Ontologies are used for knowledge management, concept definition and semantic search. Ontology is applicable to the organization and management of knowledge in a single given domain. This paper is an attempt to construct a knowledge base for email vulnerabilities using ontologies. It presents a method of building relations among CVEs email entries as established by the MITRE Corporation’s weaknesses data base. The use of ontology is illustrated with queries analyzing software products from a security manager's point of view. This work is based on the MITRE community effort CWE List, Version 3.1—Research concept view CWE-1000.Quadruples for Residue Number Systems with Sum of Quotients a Power of a Prime
http://hdl.handle.net/10525/4035
Название: Quadruples for Residue Number Systems with Sum of Quotients a Power of a Prime<br/><br/>Authors: Boyvalenkov, Georgi; Boyvalenkov, Peter<br/><br/>Краткий обзор (реферат): We investigate Residue Number Systems (RNS) of special type which were recently shown to be useful for some type of computations in embedded systems. We develop an algorithm for derivation of all quadruples for RNS under investigation subject to certain restrictions.Some NP-Complete Problems for Attribute Reduction in Consistent Decision Tables
http://hdl.handle.net/10525/4034
Название: Some NP-Complete Problems for Attribute Reduction in Consistent Decision Tables<br/><br/>Authors: Khoa, Phan Dang; Demetrovics, Janos; Thi, Vu Duc; Anh, Pham Viet<br/><br/>Краткий обзор (реферат): Over recent years, the research of attribute reduction for general decision systems and, in particular, for consistent decision tables has attracted great attention from the computer science community due to the emerge of big data. It has been known that, for a consistent decision table, we can derive a polynomial time complexity algorithm for finding a reduct. In addition, finding redundant properties can also be done in polynomial time. However, finding all reduct sets in a consistent decision table is a problem with exponential time complexity. In this paper, we study complexity of the problem for finding a certain class of reduct sets. In particular, we make use of a new concept of relative reduct in the consistent decision table. We present two NP-complete problems related to the proposed concept. These problems are related to the cardinality constraint and the relative reduct set. On the basis of this result, we show that finding a reduct with the smallest cardinality cannot be done by an algorithm with polynomial time complexity.Teaching Programming Through The "Modular Arithmetic" Math Project
http://hdl.handle.net/10525/4033
Название: Teaching Programming Through The "Modular Arithmetic" Math Project<br/><br/>Authors: Raykova, Mariyana; Boev, Stoyan<br/><br/>Краткий обзор (реферат): Project-based approach was integrated into the Computer science programme at New Bulgarian University to enhance the learning process for first year students. A multidisciplinary project based on main concepts of Programming and Discrete mathematics was designed and developed. The concepts and relations between them were presented by concepts maps and the tasks were ordered according to revised Bloom's taxonomy. So it became possible to evaluate the cognitive learning levels of the students from simple remembering of information to analyzing and creating, to improve the self-learning skills, the ability to search for new information, working in teams and communication skills. The students had the opportunity to apply algorithms related to different data structures, memory and time optimisation that are used in the business and to integrate different programming technologies in a project.Numerical Integration of Two-Dimensional Complex-Valued Functions for the needs of BIEM
http://hdl.handle.net/10525/4032
Название: Numerical Integration of Two-Dimensional Complex-Valued Functions for the needs of BIEM<br/><br/>Authors: Laskov, Lasko<br/><br/>Краткий обзор (реферат): Numerical integration is a key problem with numerous applications, including the boundary integral equation method (BIEM). GSL [7] provides powerful implementations of a broad variety of well-known numerical methods and algorithms. However, its routines have certain limitations: the numerical integration based on QUADPACK library [2] is implemented only in the case of one-dimensional functions. In this paper we present an extension of the GSL numerical integration routines for the special case of two-dimensional complex-valued functions. The presented approach is part of our effort to build a BIEM software system for solving a 3D elastodynamics problem for wave propagation in a continuously inhomogeneous half-space.