All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 39 Next

Displaying 761 – 780 of 922

Showing per page

Analysis of multibackground memory testing techniques

Ireneusz Mrozek (2010)

International Journal of Applied Mathematics and Computer Science

March tests are widely used in the process of RAM testing. This family of tests is very efficient in the case of simple faults such as stuck-at or transition faults. In the case of a complex fault model-such as pattern sensitive faults-their efficiency is not sufficient. Therefore we have to use other techniques to increase fault coverage for complex faults. Multibackground memory testing is one of such techniques. In this case a selected March test is run many times. Each time it is run with new...

Analyzing sets of phylogenetic trees using metrics

Damian Bogdanowicz (2011)

Applicationes Mathematicae

The reconstruction of evolutionary trees is one of the primary objectives in phylogenetics. Such a tree represents historical evolutionary relationships between different species or organisms. Tree comparisons are used for multiple purposes, from unveiling the history of species to deciphering evolutionary associations among organisms and geographical areas. In this paper, we describe a general method for comparing phylogenetic trees and give some basic properties of the Matching Split metric, which...

Analyzing the dynamics of deterministic systems from a hypergraph theoretical point of view

Luis M. Torres, Annegret K. Wagler (2013)

RAIRO - Operations Research - Recherche Opérationnelle

To model the dynamics of discrete deterministic systems, we extend the Petri nets framework by a priority relation between conflicting transitions, which is encoded by orienting the edges of a transition conflict graph. The aim of this paper is to gain some insight into the structure of this conflict graph and to characterize a class of suitable orientations by an analysis in the context of hypergraph theory.

Analyzing the reasoning mechanisms in fuzzy rule based classification systems.

Oscar Cordón, María José del Jesús, Francisco Herrera (1998)

Mathware and Soft Computing

Fuzzy Rule-Based Systems have been succesfully applied to pattern classification problems. In this type of classification systems, the classical Fuzzy Reasoning Method classifies a new example with the consequent of the rule with the greatest degree of association. By using this reasoning method, we do not consider the information provided by the other rules that are also compatible (have also been fired) with this example.In this paper we analyze this problem and propose to use FRMs that combine...

Another look at a model for evaluating interface aesthetics

David Ngo, John Byrne (2001)

International Journal of Applied Mathematics and Computer Science

Gestalt psychologists promulgated the principles of visual organisation in the early twentieth century. These principles have been discussed and re-emphasised, and their importance and relevance to user interface design is understood. However, a limited number of systems represent and make adequate use of this knowledge in the form of a design tool that supports certain aspects of the user interface design process. The graphic design rules that these systems use are extremely rudimentary and often...

Ant-based extraction of rules in simple decision systems over ontological graphs

Krzysztof Pancerz, Arkadiusz Lewicki, Ryszard Tadeusiewicz (2015)

International Journal of Applied Mathematics and Computer Science

In the paper, the problem of extraction of complex decision rules in simple decision systems over ontological graphs is considered. The extracted rules are consistent with the dominance principle similar to that applied in the dominancebased rough set approach (DRSA). In our study, we propose to use a heuristic algorithm, utilizing the ant-based clustering approach, searching the semantic spaces of concepts presented by means of ontological graphs. Concepts included in the semantic spaces are values...

Antiassociative groupoids

Milton Braitt, David Hobby, Donald Silberger (2017)

Mathematica Bohemica

Given a groupoid 〈 G , ☆ 〉 , and k ≥ 3 , we say that G is antiassociative if an only if for all x 1 , x 2 , x 3 ∈ G , ( x 1 ☆ x 2 ) ☆ x 3 and x 1 ☆ ( x 2 ☆ x 3 ) are never equal. Generalizing this, 〈 G , ☆ 〉 is k -antiassociative if and only if for all x 1 , x 2 , ... , x k ∈ G , any two distinct expressions made by putting parentheses in x 1 ☆ x 2 ☆ x 3 ☆ ⋯ ☆ x k are never equal. We prove that for every k ≥ 3 , there exist finite groupoids that are k -antiassociative. We then generalize this, investigating when other pairs of groupoid terms can be made never equal.

Anycasting in connection-oriented computer networks: Models, algorithms and results

Krzysztof Walkowiak (2010)

International Journal of Applied Mathematics and Computer Science

Our discussion in this article centers around various issues related to the use of anycasting in connection-oriented computer networks. Anycast is defined as a one-to-one-of-many transmission to deliver a packet to one of many hosts. Anycasting can be applied if the same content is replicated over many locations in the network. Examples of network techniques that apply anycasting are Content Delivery Networks (CDNs), Domain Name Service (DNS), Peer-to-Peer (P2P) systems. The role of anycasting is...

Aperiodicity of the Hamiltonian flow in the Thomas-Fermi potential.

Charles L. Fefferman, Luis A. Seco (1993)

Revista Matemática Iberoamericana

In [FS1] we announced a precise asymptotic formula for the ground-state energy of a non-relativistic atom. The purpose of this paper is to establish an elementary inequality that plays a crucial role in our proof of that formula. The inequality concerns the Thomas-Fermi potentialVTF = -y(ar) / r, a > 0, where y(r) is defined as the solution of⎧   y''(x) = x-1/2y3/2(x),⎨   y(0) = 1,⎩   y(∞) = 0.

Currently displaying 761 – 780 of 922