Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

141 results for “Design and Computation”

Set a search alert
Research ArticleOpen accessIn the abstractSome Applications of Spanning Trees in Complete and Complete Bipartite GraphsS. N. DaoudProblem statement: The number of spanning trees τ(G) in graphs (networks) is an important invariant, it is also an important measure of reliability of a network. Approach: Using linear algebra and matrix analysis techniques to evaluate the associated determinants. Results: In this study we derive simple formulas for the number of spanning trees of complete graph Kn and complete bipartite … …American Journal of Applied Sciences, Vol. 9, Issue 4 · 15 Feb 2012 · 7,266 accessesView PDFCite
Research ArticleOpen accessIn the abstractNew Mersenne Number Transform Diffusion Power AnalysisM. F. Al-Gailani, S. BoussaktaProblem statement: Due to significant developments in the processing power and parallel processing technologies, the existing encryption algorithms are increasingly susceptible to attacks, such as side-channel attacks, for example. Designing new encryption algorithms that work efficiently on different platforms and security levels to protect the transmitted data from any possible attacks is one of the most important issues in today’s … …American Journal of Engineering and Applied Sciences, Vol. 4, Issue 4 · 12 Jan 2012 · 7,454 accessesView PDFCite
Research ArticleOpen accessIn the abstractNumber of Spanning Trees of Circulant Graphs C6n and their ApplicationsS. N. DaoudProblem statement: The number of spanning trees of a graph G is usually denoted by τ(G). A circulant graph with n vertices and k jumps is Cn (a1,…..,ak). Approach: In this study the number τ(G) of spanning trees of the circulant graphs C6n with some non-fixed jumps such as C6n (1, n), C6n (1, n, 2n), C6n (1, n, 3n), … …Journal of Mathematics and Statistics, Vol. 8, Issue 1 · 12 Dec 2011 · 7,632 accessesView PDFCite
Research ArticleOpen accessIn the abstractComplexity of Cocktail Party Graph and Crown GraphS. N. DaoudProblem statement: The number of spanning trees τ(G) in graphs (networks) was an important invariant. Approach: Using the properties of the Chebyshev polynomials of the second kind and the linear algebra techniques to evaluate the associated determinants. Results: The complexity, number of spanning trees, of the cocktail party graph on 2n vertices, given in detail in the text was proved. … …American Journal of Applied Sciences, Vol. 9, Issue 2 · 12 Dec 2011 · 7,872 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Single Core Hardware Module of a Data Compression Scheme Using Prediction by Partial Matching TechniqueJubayer Jalil, Md. Mamun, Mohd. Marufuzzaman, Hafizah HusainProblem statement: Compression is useful because it helps reduce the consumption of expensive resources, such as hard disk space or transmission bandwidth. For effective data compression, the compression algorithm must be able to predict future data accurately in order to build a good probabilistic model for compression. Lossless compression is essential in cases where it is important that the original … …American Journal of Applied Sciences, Vol. 8, Issue 11 · 7 Oct 2011 · 7,258 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Discrete Event Simulation Framework for Utility Accrual Scheduling Algorithm in Uniprocessor EnvironmentIdawaty Ahmad, Shamala Subramaniam, Mohamed Othman, Zuriati ZulkarnainProblem statement: The heterogeneity in the choice of simulation platforms for real time scheduling stands behind the difficulty of developing a common simulation environment. A Discrete Event Simulation (DES) for a real time scheduling domain encompassing event definition, time advancing mechanism and scheduler has yet to be developed. Approach: The study focused on the proposed and the development of an … …Journal of Computer Science, Vol. 7, Issue 8 · 14 Jul 2011 · 7,227 accessesView PDFCite
Research ArticleOpen accessIn the abstractSingle Core Hardware Module to Implement Partial Encryption of Compressed ImageMamun Bin Ibne Reaz, Md. Syedul Amin, Fazida Hanim Hashim, Khandaker AsaduzzamanProblem statement: Real-time secure image and video communication is challenging due to the processing time and computational requirement for encryption and decryption. In order to cope with these concerns, innovative image compression and encryption techniques are required. Approach: In this research, we have introduced partial encryption technique on compressed images and implemented the algorithm on Altera FLEX10K FPGA device that … …American Journal of Applied Sciences, Vol. 8, Issue 6 · 13 Jun 2011 · 7,383 accessesView PDFCite
Research ArticleOpen accessIn the abstractComputational Study of Hybrid Water Heater with Evacuated Glass Tube Solar Collector and Rice Husk CombustionPiyanun Charoensawan, Chaiwat WannagositProblem statement: The thermal performance modeling of hybrid water heater with evacuated glass tube solar collector and flue gas of rice husk combustion was developed. The solar global radiation and ambient air temperature data used in the system modeling belongs Phitsanulok province from 7 am-5 pm in the summer season. Approach: The system can be divided into two parts, i.e., … …Energy Research Journal, Vol. 1, Issue 2 · 31 Oct 2010 · 7,598 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Novel Method for Testing Digital to Analog Converter in Static RangeK. Hariharan, S. Gouthamraj, B. Subramaniam et al.Problem statement: Linearity testing methods for DAC usually involves usage of non-linear analog components, which are indeed prone to various errors. Few other testing methodologies involve complex circuitry for measuring exactitude of DAC. Practically, it is difficult to build those as Built In Self Test (BIST) due to complexity of calculation, which demands more usage of ALU (or core of … …American Journal of Applied Sciences, Vol. 7, Issue 8 · 31 Aug 2010 · 7,462 accessesView PDFCite
Research ArticleOpen accessIn the abstractPiecewise Sliding Mode Decoupling Fault Tolerant Control SystemRafi Youssef, Hui PengProblem statement: Proposed method in the present study could deal with fault tolerant control system by using the so called decentralized control theory with decoupling fashion sliding mode control, dealing with subsystems instead of whole system and to the knowledge of the author there is no known computational algorithm for decentralized case, Approach: In this study we present a decoupling … …American Journal of Applied Sciences, Vol. 7, Issue 1 · 31 Jan 2010 · 7,391 accessesView PDFCite