This paper introduces a relationship between the independence of polynomials associated with the links of the network, and the Jacobian determinant of these polynomials. Also, it presents a way to simplify a given communication network through an algorithm that splits the network into subnets and reintegrates them into a network that is a general representation or model of the studied network. This model is also represented through a combination of polynomial equations and uses Groebner bases to reach a new simplified network equivalent to the given network, which may make studying the ability to solve the problem of network coding less expensive and much easier.

        The intensification of competition among all companies and at different levels has become necessary for every company need to continue to improve its performance in order to be able to face the competition and stay in the market. To achieve this, we must rely on the company's accounting information more accurate and appropriate and provided in a timely manner, for the purpose of use in planning and decision making.

So there must be information systems that help the administration to continuous development and improvement of the performance of companies in general, and this is what you need Jordanian companies, especially after the accession of Jordan to the field

Tchebichef polynomials (TPs) play a crucial role in various fields of mathematics and applied sciences, including numerical analysis, image and signal processing, and computer vision. This is due to the unique properties of the TPs and their remarkable performance. Nowadays, the demand for high-quality images (2D signals) is increasing and is expected to continue growing. The processing of these signals requires the generation of accurate and fast polynomials. The existing algorithms generate the TPs sequentially, and this is considered as computationally costly for high-order and larger-sized polynomials. To this end, we present a new efficient solution to overcome the limitation of sequential algorithms. The presented algorithm us

The problem motivation of this work deals with how to control the network overhead and reduce the network latency that may cause many unwanted loops resulting from using standard routing. This work proposes three different wireless routing protocols which they are originally using some advantages for famous wireless ad-hoc routing protocols such as dynamic source routing (DSR), optimized link state routing (OLSR), destination sequenced distance vector (DSDV) and zone routing protocol (ZRP). The first proposed routing protocol is presented an enhanced destination sequenced distance vector (E-DSDV) routing protocol, while the second proposed routing protocol is designed based on using the advantages of DSDV and ZRP and we named it as

Transportability refers to the ease with which people, goods, or services may be transferred. When transportability is high, distance becomes less of a limitation for activities. Transportation networks are frequently represented by a set of locations and a set of links that indicate the connections between those places which is usually called network topology. Hence, each transmission network has a unique topology that distinguishes its structure. The most essential components of such a framework are the network architecture and the connection level. This research aims to demonstrate the efficiency of the road network in the Al-Karrada area which is located in the Baghdad city. The analysis based on a quantitative evaluation using graph th