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

110 articles for “Peer-to-Peer”
Set a search alert
Research ArticleOpen accessIn the keywordsAn 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 keywordsIMPACT OF SOCIAL INFLUENCE ON INDIVIDUALS’ ADOPTION OF SOCIAL NETWORKS IN SMESMajharul Talukder, Ali Quazi, Dede DjatikusumoWhile prior studies focused on the determinants of adoption of technological innovation in large scale businesses, there is a lack of empirical research on this issue of acceptance of social networks in SMEs in emerging economies. This study addresses this lacuna by focusing on the social factors driving Indonesian SMEs’ adoption of technological innovation. A theoretical model based on the … …Journal of Computer Science, Vol. 9, Issue 12 · 25 Nov 2013 · 8,280 accessesView PDFCite
Research ArticleOpen accessIn the author namesMESSAGE AUTHENTICATION CODE BASED SECURE GROUP KEY MANAGEMENT PROTOCOL FOR MOBILE AD HOC NETWORKST. Peer Meera Labbai, V. RajamaniA mobile ad hoc network is a group of nodes which are communicating with each other with the use of radio frequencies. When there is high movement of mobile nodes, the nodes find difficult to reach other nodes. If the data are exchanged between nodes when there is high mobility, the data may be lost in transit. Therefore the security … …Journal of Computer Science, Vol. 9, Issue 10 · 5 Sep 2013 · 6,727 accessesView PDFCite
Research ArticleOpen accessIn the author namesShort-Term Effects of Aroma Therapeutic Herbal Steam on Heart Rate Variability and StressPeerada Damapong, Pongmada DamapongThis experimental research aims to examine the short-term effects of aroma therapeutic herbal steam on heart rate variability and stress. In this experimental study, the participants were 60 diabetic patients with stress who had rated their stress in the Suang-prung Stress Test-20 at the level of 3 or higher. They were divided into the treatment group (n = 30) and … …American Journal of Applied Sciences, Vol. 15, Issue 7 · 4 Sep 2018 · 8,671 accessesView PDFCite
Research ArticleOpen accessIn the author namesA Successive Admissible Cell Method for Solving Large Scale Linear Assignment Problem with Dense Cost MatrixWarut Boonphakdee, Peerayuth CharnsethikulNormally, the Linear Assignment Problem (LAP) has been solved by successful algorithms such as Lapjv and Munkres programmed as MATLAB codes. This study presented an improved algorithm for solving large scale LAP. A preprocessing (PP) algorithm was proposed to apply for constructing the kth transferred reduced cost matrix then this matrix was solved by Lapjvalgorithm. Performances of PP-Lapjvalgorithm were faster … …Journal of Computer Science, Vol. 12, Issue 8 · 16 Nov 2016 · 6,948 accessesView PDFCite
Research ArticleOpen accessIn the author namesUSING COLUMN GENERATION TECHNIQUE TO ESTIMATE PROBABILITY STATISTICS IN TRANSITION MATRIX OF LARGE SCALE MARKOV CHAIN WITH LEAST ABSOLUTE DEVIATION CRITERIAWanida Lerspipatthananon, Peerayuth CharnsethikulThe Least Absolute Deviation (LAD) method is the one of many methods used to estimate transition probability matrix of Markov Chain. It can be formulated as a Linear Programming Problem (LP) and solved using its regular state of the art software. However, when the Markov Chain has a large number of states and historical state probabilities data, the corresponding LP … …Journal of Mathematics and Statistics, Vol. 10, Issue 3 · 23 Sep 2014 · 7,116 accessesView PDFCite
Research ArticleOpen accessIn the author namesAN OPTIMIZATION-BASED HEURISTIC FOR A CAPACITATED LOT-SIZING MODEL IN AN AUTOMATED TELLER MACHINES NETWORKSupatchaya Chotayakul, Peerayuth Charnsetthikul, Juta Pichitlamken, John KobzaThis research studies a cash inventory problem in an ATM Network to satisfy customer’s cash needs over multiple periods with deterministic demand. The objective is to determine the amount of money to place in Automated Teller Machines (ATMs) and cash centers for each period over a given time horizon. The algorithms are designed as a multi-echelon inventory problem with single-item … …Journal of Mathematics and Statistics, Vol. 9, Issue 4 · 1 Oct 2013 · 7,049 accessesView PDFCite
Research ArticleOpen accessIn the author namesA JUMP-DIFFUSION WITH STOCHASTIC VOLATILITY AND INTEREST RATEPairote Sattayatham, Paiboon PeeraparpIn this study, we present the application of Time Changed Levy method to model a jump-diffusion process with stochastic volatility and stochastic interest rate. We apply the Lewis Fourier transform method as well as the risk neutral expectation pricing method to derive a formula for a European option pricing. These combining methods give quite a short route to derive the … …Journal of Mathematics and Statistics, Vol. 9, Issue 1 · 27 Mar 2013 · 6,888 accessesView PDFCite
Research ArticleOpen accessIn the author namesTwo Reformulations for the Dynamic Quadratic Assignment ProblemSirirat Muenvanichakul, Peerayuth CharnsethikulProblem statement: The Dynamic Quadratic Assignment Problem (DQAP), an NP-hard problem, is outlined and reformulated in two alternative models: Linearized model and logic-based model. Approach: The solution methods for both models based on combinatorial methods (Benders’ Decomposition and Approximate Dynamic Programming) and constraint logic programming, respectively, are proposed. Results: Proofs of model equivalence and solution methodology are presented. Conclusion: Both … …Journal of Mathematics and Statistics, Vol. 6, Issue 4 · 31 Dec 2010 · 7,947 accessesView PDFCite
Research ArticleOpen accessIn the author namesSolving 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