"Annals. Computer Science Series" Journal Romania, 300559 Timişoara, 6 Lascăr Catargiu str. Phone: 004 0256 220 687  Fax: 004 0256 220 690 Email: conference.fcia [@] tibiscus [.] ro  conference.fcia [@] gmail [.] com 



» A Proposed Method of Identifying Significant Effects in Unreplicated Factorial Experiments » Ibraheem B. A., Adeleke B. L. and Oyeyemi G. M. ABSTRACT: In many areas of research/ production, a lot of factors are combined to obtain a desired product. To be able to analyze which factors (or combinations of factors and at what level) are significant, the experiment has to be replicated. For economic or practical reasons, it may not be feasible to perform the experiment more than once therefore unreplicated factorial designs are often employed. This is especially true in the field of Medicine, Pharmacy and Industrial production units. The traditional method of analysis of variance (ANOVA) cannot be employed in unreplicated factorial designs, therefore many methods have been proposed in literature. In this paper, a new method of analyzing unreplicated factorial designs is proposed and was compared with some of the existing methods. The four existing methods considered were: Lenth, Berk and Picard, Juan and Pena, and Dong. The comparison was performed using Monte Carlo simulation method. The criteria used in evaluating the performances of the methods are Power and Individual Error Rate (IER). Using these criteria of evaluation, the results showed that on overall performance, Dong method is the best among the four existing methods considered and was closely followed by Berk and Picard, Lenth, then Juan and Pena methods in that order. It was also found that not only is the proposed method simpler to compute, it competed favourably with Dong and even performed better than all the others when IER is used for assessment. KEYWORDS:Experiment, Factorial, Replication, Significant effects, Power, Individual Error Rate (IER). » Received: 18 January 2019» Accepted: 5 July 2019 
.  .



» Performance Enhancement of Huffman Coding Image Compression with Chinese Remainder Theorem » Mohammed Babatunde Ibrahim and Kazeem Alagbe Gbolagade ABSTRACT: Data compression is the process of reducing the size of data. Due to the improvement of Information Technology, there are more data that are being generated nowadays that are transferred from one source to another. This data required higher size and bandwidth to be transferred between two parties. Hence, how to reduce the size of data before transferring from one medium to another has been an important issue. This paper proposed an enhanced method to compress image data file. In this paper, we integrate Chinese Remainder Theorem (CRT) into the Huffman compression algorithm to enhance the speed of compression as against the Traditional Huffman Compression (THC). The experimental analysis was performed in matrix laboratory environment (2015). The experimental results revealed that there is significant reduction in size of image, compression time minimization and data quality retention of original image. The shortcomings of THC are blocky appearance and poor quality reconstructed image after decompressing operation is overcome in our enhanced method with CRT. KEYWORDS:Huffman Algorithm, Chinese Remainder Theorem (CRT), compression, Image File. » Received: 16 May 2019» Accepted: 7 July 2019 
17  22



» Metacognition in REACT Teaching Strategy » Nguyen Thi Huong Lan ABSTRACT: Math education in the 21st century is facing new realworld problems, nurturing creative thinking skills and effective ways of learning. In an effort to innovate teaching and learning methods to prepare for a new generation for the demands of the new era, many educators have discovered the value of metacognition. The article explores metacognition in the REACT teaching strategy (Relating, Experiencing, Applying, Cooperating, and Transferring) in order to help students solve practical problems based on context, from which, to acquire knowledge. KEYWORDS:Teaching strategy, metacognition, REACT Strategy. » Received: 2 April 2019» Accepted: 5 July 2019 
.  .



» On Some Permutation Statistics of the Aunu Pattern ω_{i} ∈ G_{p} » I. Suleiman and O. Ejima ABSTRACT: This paper examine certain behavior of some permutation statistics on the pattern ω_{i} defined as: ω_{i}=(1 (1+i)^{modp} (1+2i)^{modp} (1+3i)^{modp} ...(1+((p−1)i)^{modp}) for i=1,2,...,p1. We investigate the permutation statistics that are equidistributed on ω_{i} ∈ G_{p}. This to a larger extent helped in identifying ω_{i} as an Eulerian distribution. The graph permutation of ω_{i} and the graph of 132avoiding pattern of ω_{i} were also studied. KEYWORDS:» Received: 28 February 2019 » Accepted: 15 April 2019 
.  .



» On the Addition Modulus of the Aunu Pattern ω_{i} ∈ G_{p}; An Investigation of Some Topological Properties » A. A. Ibrahim, Ibrahim Suleiman and Ojonugwa Ejima ABSTRACT: This paper investigate the topological properties on the structure generated by the addition modulus of the Aunu permutation pattern ω_{i}. The pattern ω_{i} has the generating function defined as: ω_{i}=(1 (1+i)modp (1+2i)modp (1+3i)modp ...(1+((p−1)i)modp) for i=1,2,...,p1. The numbers are arrangement on the structure X={1,...,P} for primes p≥5. It has been established in this paper that the generated set is a topology on X, it is not a convex set and finally, we find out that the generated set is not a σalgebra. KEYWORDS:Permutation pattern, Aunu numbers, Topology, Connectedness, Hausdorff space, Convexity, Sigma (σ) algebra. » Received: 28 February 2019» Accepted: 6 April 2019 
.  .


» www.fcia.tibiscus.ro  » www.fcia.tibiscus.ro/ccsitia/  » www.geogebra.tibiscus.ro  » www.tibiscus.ro   © 20032019, Last update: 16.07.2019 / 17:30 