In this work, we construct the projectively distinct (k, n)-arcs in PG (3, 4) over Galois field GF (4), where k 5, and we found that the complete (k, n)-arcs, where 3 n 21, moreover we prove geometrically that the maximum complete (k, n)-arc in PG (3, 4) is (85, 21)-arc. A (k, n)-arcs is a set of k points no n+ 1 of which are collinear. A (k, n)-arcs is complete if it is not contained in a (k+ 1, n)-arcs
The different crises and financial collapses place in many companies, particularly in developed countries as a result of administrative and financial corruption return aspects of the task to the role of the company and the external auditor, both in their emphasis on honesty and fairness of financial statements and the Provisions of accounting information and on the contrary to the truth, you may have to the loss of the rights of stakeholders, particularly existing investors, and the loss of confidence of prospective investors in the accounting information contained in the financial statements of these companies, which led to a crisis of confidence and credibility in the profession of accounting and auditing where the wonder of ma
... Show MoreNow that most of the conventional reservoirs are being depleted at a rapid pace, the focus is on unconventional reservoirs like tight gas reservoirs. Due to the heterogeneous nature and low permeability of unconventional reservoirs, they require a huge number of wells to hit all the isolated hydrocarbon zones. Infill drilling is one of the most common and effective methods of increasing the recovery, by reducing the well spacing and increasing the sweep efficiency. However, the problem with drilling such a large number of wells is the determination of the optimum location for each well that ensures minimum interference between wells, and accelerates the recovery from the field. Detail
This paper presents a newly developed method with new algorithms to find the numerical solution of nth-order state-space equations (SSE) of linear continuous-time control system by using block method. The algorithms have been written in Matlab language. The state-space equation is the modern representation to the analysis of continuous-time system. It was treated numerically to the single-input-single-output (SISO) systems as well as multiple-input-multiple-output (MIMO) systems by using fourth-order-six-steps block method. We show that it is possible to find the output values of the state-space method using block method. Comparison between the numerical and exact results has been given for some numerical examples for solving different type
... Show MoreBackground: The prediction of changes in the mandibular third molar position and eruption is an important clinical concern because third molar retention may be beneficial for orthodontic anchorage. The aims of this study were to assess the mandibular third molar position by using medical CT scan and lateral reconstructed radiograph and evaluate gender differences. Materials and Methods: The sample of present study consisted of 39 patients (18 males and 21 females) with age range 11-15 years who were attending at Al-Suwayra General Hospital/ the Computerized Tomography department. The distance from anterior edge of ramus to distal surface of permanent mandibular second molar and mesio-distal width of developing mandibular third molar were
... Show MoreFree Space Optical (FSO) technology offers highly directional, high bandwidth communication channels. This technology can provide fiber-like data rate over short distances. In order to improve security associated with data transmission in FSO networks, a secure communication method based on chaotic technique is presented. In this paper, we have turned our focus on a specific class of piece wise linear one-dimensional chaotic maps. Simulation results indicate that this approach has the advantage of possessing excellent correlation property. In this paper we examine the security vulnerabilities of single FSO links and propose a solution to this problem by implementing the chaotic signal generator “reconfigurable tent map”. As synchronizat
... Show MoreIn this paper, a design of the broadband thin metamaterial absorber (MMA) is presented. Compared with the previously reported metamaterial absorbers, the proposed structure provides a wide bandwidth with a compatible overall size. The designed absorber consists of a combination of octagon disk and split octagon resonator to provide a wide bandwidth over the Ku and K bands' frequency range. Cheap FR-4 material is chosen to be a substate of the proposed absorber with 1.6 thicknesses and 6.5×6.5 overall unit cell size. CST Studio Suite was used for the simulation of the proposed absorber. The proposed absorber provides a wide absorption bandwidth of 14.4 GHz over a frequency range of 12.8-27.5 GHz with more than %90 absorp
... Show MoreThis paper proposed a new method to study functional non-parametric regression data analysis with conditional expectation in the case that the covariates are functional and the Principal Component Analysis was utilized to de-correlate the multivariate response variables. It utilized the formula of the Nadaraya Watson estimator (K-Nearest Neighbour (KNN)) for prediction with different types of the semi-metrics, (which are based on Second Derivative and Functional Principal Component Analysis (FPCA)) for measureing the closeness between curves. Root Mean Square Errors is used for the implementation of this model which is then compared to the independent response method. R program is used for analysing data. Then, when the cov
... Show MoreTwo unsupervised classifiers for optimum multithreshold are presented; fast Otsu and k-means. The unparametric methods produce an efficient procedure to separate the regions (classes) by select optimum levels, either on the gray levels of image histogram (as Otsu classifier), or on the gray levels of image intensities(as k-mean classifier), which are represent threshold values of the classes. In order to compare between the experimental results of these classifiers, the computation time is recorded and the needed iterations for k-means classifier to converge with optimum classes centers. The variation in the recorded computation time for k-means classifier is discussed.