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

103 results for “computation time”
Set a search alert
Research ArticleOpen accessIn the abstractPrivacy Preserved Collaborative Secure Multiparty Data MiningM. Balamurugan, J. Bhuvana, S. Chenthur PandianProblem statement: In the current modern business environment, its success is defined by collaboration, team efforts and partnership, rather than lonely spectacular individual efforts in isolation. So the collaboration becomes especially important because of the mutual benefit it brings. Sometimes, such collaboration even occurs among competitors, or among companies that have conflict of interests, but the collaborators are aware that … …Journal of Computer Science, Vol. 8, Issue 6 · 16 Mar 2012 · 7,161 accessesView PDFCite
Research ArticleOpen accessIn the abstractThe Best Candidates Method for Solving Optimization ProblemsHlayel Abdallah AhmadProblem statement: This study is about describing solution technique called Best Candidates Method (BCM) for solving optimization problems; the goal is to minimize the computation time to get the optimal solution. In this study I apply the BCM to the linear assignment problems (LAP) that is one of the optimization problems in the Operation Research (OR). Approach: The optimization problem … …Journal of Computer Science, Vol. 8, Issue 5 · 27 Feb 2012 · 8,341 accessesView PDFCite
Research ArticleOpen accessIn the abstractComputation of Private Key Based on Divide-By-Prime for Luc CryptosystemsZulkarnain Md Ali, Nawara Makhzoum Alhassan MakhzoumProblem statement: One of the public key cryptosystem is Luc cryptosystems. This system used Lucas Function for encryption and decryption process. Lucas Function is a special form of second-order linear recurrence relation. An encyption process is used to encrypt an original message to ciphertext by using public key. A decryption process is the process to decrypt a ciphertext into original … …Journal of Computer Science, Vol. 8, Issue 4 · 1 Feb 2012 · 7,064 accessesView PDFCite
Research ArticleOpen accessIn the abstractSecure Selection of Multiple Resources Based on Virtual Private Network for Computational GridsG. Kavitha, V. SankaranarayananProblem statement: Grid computing provides a virtual framework for controlled sharing of resources across institutional boundaries. In computational grids, a client application is executed on the available set of resources that satisfy the user QoS requirements. Some applications require exhaustive computation power for execution of its tasks. In general, these tasks are assigned to a single available resource on the … …Journal of Computer Science, Vol. 7, Issue 12 · 22 Oct 2011 · 7,607 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Effective Contributory Re-Keying Approach to Compute Conference KeyD. Thilagavathy, M. RajaramProblem statement: With the explosive growth of and internet and web applications many emerging group-oriented distributed applications such as tele/video-conferencing, multiplayer games are based on group communication model that need security services such as privacy and data integrity Hence a secure distributed group key agreement is required to establish and authenticate a common group key for secure and private communication. … …Journal of Computer Science, Vol. 7, Issue 8 · 15 Jul 2011 · 6,643 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Novel Approach to Medical Image SegmentationNandagopalan Shanmugam, Adiga B. Suryanarayana, Sudarshan TSB et al.Problem statement: Segmentation is a vital aspect of medical imaging. It aids in the visualization of medical data and diagnostics of various diseases. Ultrasound image segmentation, in particular echocardiographic image segmentation, is required to identify the regions of interest such as Left Ventricle (LV) and other cardiac cavities. Existing methods do not address the drawbacks of speed and quality of … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 7,214 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Investigation of Using Parallel Genetic Algorithm for Solving the Shortest Path Routing ProblemSalman Yussof, Rina Azlin Razali, Ong Hang SeeProblem statement: Shortest path routing is the type of routing widely used in computer network nowadays. Even though shortest path routing algorithms are well established, other alternative methods may have their own advantages. One such alternative is to use a GA-based routing algorithm. According to previous researches, GA-based routing algorithm has been found to be more scalable and insensitive to … …Journal of Computer Science, Vol. 7, Issue 2 · 25 Feb 2011 · 7,617 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Self-Tuning Proportional-Integral-Derivative Controller for an Autonomous Underwater Vehicle, Based On Taguchi MethodM. Santhakumar, T. AsokanProblem statement: Conventional Proportional-Integral-Derivative (PID) controllers exhibit moderately good performance once the PID gains are properly tuned. However, when the dynamic characteristics of the system are time dependent or the operating conditions of the system vary, it is necessary to retune the gains to obtain desired performance. This situation has renewed the interest of researchers and practitioners in PID control. … …Journal of Computer Science, Vol. 6, Issue 8 · 31 Aug 2010 · 7,855 accessesView PDFCite
Research ArticleOpen accessIn the abstractA New High Order Algorithm with Low Computational Complexity for Electric Field SimulationMohammad Khatim Hasan, Jumat Sulaiman, Samsul Arifin Abdul KarimProblem statement: This research reported on new approach to improve speed of simulation time for free space electric wave propagation from an antenna. The existing method, Finite-Difference Time-Domain (FDTD) have been proven to solve the problem accurately, however, one of the drawbacks of the method was it needs a long processing time to simulate problem. Research efforts to increase the … …Journal of Computer Science, Vol. 6, Issue 7 · 31 Jul 2010 · 6,394 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