No abstract

Optical transpose interconnection system (OTIS) is an optoelectronic architecture that promises to be a great choice for future-generation parallel systems. OTIS combines the advantages of electronic and optical links, where electronic links are used for short distances which require low material cost, and optical links are used for long distances which provide high speed network with low power consumption. Taking into account the advantageous characteristics of OTIS and based on the attractive properties of hyper hexa-cell (HHC) interconnection topology from low diameter and good minimum node degree, this paper introduces a new optoelectronic architecture referred to as OTIS hyper hexa-cell (OHHC). This paper also provides an evaluation and a comparison of the new topology with OTIS-mesh in terms of the following topological properties: size, diameter, maximum and minimum node degree, bisection width, total cost and optical cost. The results of this study proved the excellence of the proposed OHHC over OTIS-mesh in terms of diameter, minimum node degree, bisection width, and optical cost.

No abstract

Background: Propositions simplification is a classic topic in discrete mathematics that is applied in different areas of science such as programs development and digital circuits design. Investigating alternative methods would assist in presenting different approaches that can be used to obtain better results. This paper proposes a new method to simplify any logical proposition with two propositional variables without using the logical equivalences. Methods: This method is based on constructing a truth table for the given proposition, and applying one of the following two concepts: the sum of Minterms or the product of Maxterms which has not been used previously in discrete mathematics, along with five new rules that are introduced for the first time in this work. Results: The proposed approach was applied to some examples, where its correctness was verified by applying the logical equivalences method. Applying the two methods showed that the logical equivalences method cannot give the simplest form easily; especially if the proposition cannot be simplified, and it cannot assist in determining whether the obtained solution represent the simplest form of this proposition or not. Conclusion: In comparison with the logical equivalences method, the results of all the tested propositions show that our method is outperforming the current used method, as it provides the simplest form of logical propositions in fewer steps, and it overcomes the limitations of logical equivalences method. Originality/value: This paper fulfils an identified need to provide a new method to simplify any logical proposition with two propositional variables.

Recently, the size of biological databases has significantly increased, with a growing number of users and rates of queries. As a result, some databases have reached a terabyte size. On the other hand, the need to access the databases at the fastest possible rates is increasing. At this point, the computer scientists could assist to organize the data and query in a way that allows biologists to quickly search existing information. In this paper, a query optimizing model for DNA and protein sequence datasets is proposed. This method of dealing with the query can effectively and rapidly retrieve all similar proteins/DNA from a large database to reduce the computational time required to search these biological genomic datasets. Specifically, a theoretical and conceptual proposed framework is derived using query techniques from different applications. The results show that the query optimization algorithms reduce the query processing time in comparison with the normal query searching algorithm.