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

25 articles for “Upper Bound”
Set a search alert
Research ArticleOpen accessIn the abstractA Framework for Simple Object Access Protocol Messages to Detect Expansion Attacks for Secure WebserviceIgni Sabasti Prabu Siluvai, Veera Jawahar Senthil KumarThe world has shrunk in this internet era. The applications in the internet use XML and Web Services which are simple, but powerful standards that enable applications to more efficiently communicate with each other. Unfortunately this advantage is coupled with concerns of Web services security. All the services provided by the internet face security problem. The hackers find a loophole … …Journal of Computer Science, Vol. 9, Issue 3 · 18 Apr 2013 · 6,147 accessesView PDFCite
Research ArticleOpen accessIn the abstractGeneralization of Boolean Functions Properties to Functions Defined over GF(p)Saad Elmansori, B. E. EsamProblem statement: Traditionally, cryptographic applications designed on hardware have always tried to take advantage of the simplicity of implementation functions over GF(p), p = 2, to reduce costs and improve performance. On the contrast, functions defined over GF(p); p > 2, possess far better cryptographic properties than GF(2) functions. Approach: We generalize some of the previous results on cryptographic Boolean … …Journal of Computer Science, Vol. 8, Issue 6 · 13 Mar 2012 · 7,436 accessesView PDFCite
Research ArticleOpen accessIn the abstractSolving One-Dimensional Cutting Stock Problem with Discrete Demands and Capacitated Planning ObjectiveSirirat Wongprakornkul, Peerayuth CharnsethikulProblem statement: One-dimensional cutting stock problem with discrete demands and capacitated planning objective is an NP hard problem. Approach: The mathematical model with column-generation technique by a branch-and-bound procedure and the heuristic based on the first fit decreasing method are proposed. Then, both approaches were compared and some characteristics were investigated such as upper-bound value, percentage above lower-bound value, computation … …Journal of Mathematics and Statistics, Vol. 6, Issue 2 · 30 Jun 2010 · 7,947 accessesView PDFCite
Research ArticleOpen accessIn the abstractMultiple Constraints for Ant Based Multicast Routing in Mobile Ad Hoc NetworksA. Sabari, K. DuraiswamyProblem statement: A Mobile Ad hoc Network (MANET) is one of the challenging environments for multicast. Since the associated overhead is more, the existing studies illustrate that tree-based and mesh-based on-demand protocols are not the best choice. The costs of the tree under multiple constraints are reduced by the several algorithms which are based on the Ant Colony Optimization (ACO) … …Journal of Computer Science, Vol. 5, Issue 12 · 31 Dec 2009 · 6,868 accessesView PDFCite
Research ArticleOpen accessIn the abstractMicrofacies and Sedimentary Environments of Gurpi and Pabdeh Formations in Southwest of IranMohammad BahramiProblem statement: The Upper Cretaceous Gurpi and lower Tertiary Pabdeh formations as units of folded Zagros Zone were studied in three different regions (Tang-e-Abolhiat, Tang-e-Zanjiran and Maharloo) in Fars Province, Iran. Approach: Gurpi formation consisted of thin to medium sized layers of gray marl and marlstone interbedded with thin layers of argillaceous limestone and shale. The dominant microfacies in this … …American Journal of Applied Sciences, Vol. 6, Issue 7 · 31 Jul 2009 · 7,735 accessesView PDFCite
Research ArticleOpen accessIn the abstractAdaptive Control of Networked Systems in the Presence of Bounded DisturbancesA. H. Tahoun, Fang Hua-JingThe insertion of data network in the feedback adaptive control loops makes the analysis and design of networked control systems more complex than traditional control systems. This paper addresses the adaptive stabilization problem of linear time-invariant networked control systems when the measurements of the plant states are corrupted by bounded disturbances. The case of state feedback is treated in which … …Journal of Computer Science, Vol. 3, Issue 9 · 30 Sep 2007 · 6,537 accessesView PDFCite
Research ArticleOpen accessIn the abstractSolving Linear Programming Problems on the Parallel Virtual Machine EnvironmentJrJung Lyu, Hsing Luh, Ming-Chang LeeThis study developed a parallel algorithm to efficiently solve linear programming models. The proposed algorithm utilizes the Dantzig-Wolfe Decomposition Principle and can be easily implemented in a general distributed computing environment. The analytical performance of the well-known method, including the speedup upper bound and lower bound limits, was derived. Numerical experiments are also provided in order to verify the complexity … …American Journal of Applied Sciences, Vol. 1, Issue 2 · 30 Jun 2004 · 7,837 accessesView PDFCite
Research ArticleOpen accessIn the abstractCoherent Polarization Shift Keying Modulated Free Space Optical Links Over a Gamma-Gamma Turbulence ChannelX. Tang, Z. Ghassemlooy, S. Rajbhandari et al.Problem statement: The optical signal propagating through the Free Space Optical (FSO) channel suffers from irradiance and phase fluctuations caused by the atmospheric turbulence, which results in Bit Error Rate (BER) performance degradation. Approach: In this study the performance of the Multilevel Coherent Polarization Shift Keying (M-POLSK) based FSO communication system operating over the gamma-gamma turbulence channel is investigated. To … …American Journal of Engineering and Applied Sciences, Vol. 4, Issue 4 · 18 Jan 2012 · 7,954 accessesView PDFCite
Research ArticleOpen accessIn the abstractErgodic Capacity Analysis of Multiple Input Multiple Output Systems with Dual Hop Amplify and Forward Relay NetworksC. Poongodi, A. ShanmugamProblem Statement: In MIMO system, capacity mainly depends on the channel and the antenna characteristics. The capacity can be improved by proper design of antenna elements and choosing appropriate array configuration and the directive elements give more capacity than omni directional elements. The dual polarized antennas are better than single polarized antennas as the former can provide two information channels. … …Journal of Computer Science, Vol. 7, Issue 12 · 17 Oct 2011 · 6,739 accessesView PDFCite
Research ArticleOpen accessIn the abstractOn Numerical Ranges of Nilpotent Elements of C*-AlgebraA. Abdollahi, M. T. Heydari, M. MoosaviProblem statement: Let A be a C*-algebra with unit 1. For each a∈A, let V(a), v(a) v0(a) and denote its numerical range, numerical radius and the distance from the origin to the boundary of its numerical range, respectively. Approach: If a is a nilpotent element of A with the power of nilpotency n, i.e., an = 0 and v(a) = … …Journal of Mathematics and Statistics, Vol. 5, Issue 4 · 31 Dec 2009 · 7,437 accessesView PDFCite