58 research outputs found
Search for an Optimal Solution to Vague Traffic Problems Using the PSK Method
No full textThere are several algorithms, in literature, for obtaining the fuzzy optimal solution of fuzzy transportation problems (FTPs). To the best of the author's knowledge, in the history of mathematics, no one has been able to solve transportation problem (TP) under four different uncertain environment using single method in the past years. So, in this chapter, the author tried to categories the TP under four different environments and formulates the problem and utilizes the crisp numbers, triangular fuzzy numbers (TFNs), and trapezoidal fuzzy numbers (TrFNs) to solve the TP. A new method, namely, PSK (P. Senthil Kumar) method for finding a fuzzy optimal solution to fuzzy transportation problem (FTP) is proposed. Practical usefulness of the PSK method over other existing methods is demonstrated with four different numerical examples. To illustrate the PSK method different types of FTP is solved by using the PSK method and the obtained results are discussed. </jats:p
PSK-Method-for-Solving-Mixed-and-Type-4-Intuitionistic-Fuzzy-Solid-Transportation-Problems.pdf
No full text In this article, the author categorises the solid transportation problem (STP) under uncertain environments. He formulates the mixed and fully intuitionistic fuzzy solid transportation problems (FIFSTPs) and utilizes the triangular intuitionistic fuzzy number (TIFN) to deal with uncertainty and hesitation. The PSK (P. Senthil Kumar) method for finding an intuitionistic fuzzy optimal solution for fully intuitionistic fuzzy transportation problem (FIFTP) is extended to solve the mixed and type-4 IFSTP and the optimal objective value of mixed and type-4 IFSTP is obtained in terms of triangular intuitionistic fuzzy number (TIFN). The main advantage of this method is that the optimal solution of mixed and type-4 IFSTP is obtained without using the basic feasible solution and the method of testing optimality. Moreover, the proposed method is computationally very simple and easy to understand. Finally, the procedure for the proposed method is illustrated with the help of numerical examples which is followed by graphical representation of the finding. </p
Scalable asynchronous connected components detection based on a parallel union-find algorithm
No full textConnectivity in a graph is a well-studied problem. Various parallel algorithms to detect and label connected components exist, many of which are optimized for a shared-memory environment. However, scientific and engineering applications today process large-scale graphs that do not fit in a single compute node. This calls for a highly scalable solution to the connectivity problem. We propose a novel distributed-memory parallel algorithm based on the Union-Find data structure and asynchronous messaging. We strengthen the scalability of our approach by introducing several optimization techniques for parallel execution. The algorithm is implemented as a library using Charm++, a migratable object-based parallel programming model, allowing any Charm++ application to easily perform connected components detection. MPI applications may also use the library either via Adaptive MPI, or by using interoperability features of Charm++. In addition, the library will also support reading data from the disk. As a driving use case we utilize the library in ChaNGa, a cosmological simulation framework, to detect clusters of stars and classify galaxies. We evaluate the performance of our algorithm for real and synthetic graphs, computing connectivity on a probabilistic mesh benchmark with over 250 million edges in under 10 seconds using 4,096 cores of the Blue Waters (Cray XE) Supercomputer.Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2020-05-01The student, - Senthil Kumar Karthik, accepted the attached license on 2018-04-24 at 16:01.The student, - Senthil Kumar Karthik, submitted this Thesis for approval on 2018-04-24 at 16:17.This Thesis was approved for publication on 2018-04-24 at 17:09.DSpace SAF Submission Ingestion Package generated from Vireo submission #12454 on 2018-08-31 at 17:21:26Made available in DSpace on 2018-09-04T20:36:54Z (GMT). No. of bitstreams: 2
SENTHILKUMARKARTHIK-THESIS-2018.pdf: 669223 bytes, checksum: 35b2a1b95520cfc20fcd4073f2ddfaa8 (MD5)
LICENSE.txt: 4220 bytes, checksum: f6bfd3369d3dadd3a99e12a3c16d63df (MD5)
Previous issue date: 2018-04-24Embargo set by: Seth Robbins for item 107306
Lift date: 2020-09-04T20:37:00Z
Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD systemEmbargo set by: Seth Robbins for item 107306
Lift date: 2020-09-04T20:42:08Z
Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD systemU of I Only Restriction Lifted for Item 107306 on 2020-09-05T09:15:09Z
PSK Method for Solving Mixed and Type-4 Intuitionistic Fuzzy Solid Transportation Problems
No full textIn this article, the author categorises the solid transportation problem (STP) under uncertain environments. He formulates the mixed and fully intuitionistic fuzzy solid transportation problems (FIFSTPs) and utilizes the triangular intuitionistic fuzzy number (TIFN) to deal with uncertainty and hesitation. The PSK (P. Senthil Kumar) method for finding an intuitionistic fuzzy optimal solution for fully intuitionistic fuzzy transportation problem (FIFTP) is extended to solve the mixed and type-4 IFSTP and the optimal objective value of mixed and type-4 IFSTP is obtained in terms of triangular intuitionistic fuzzy number (TIFN). The main advantage of this method is that the optimal solution of mixed and type-4 IFSTP is obtained without using the basic feasible solution and the method of testing optimality. Moreover, the proposed method is computationally very simple and easy to understand. Finally, the procedure for the proposed method is illustrated with the help of numerical examples which is followed by graphical representation of the finding
An Efficacious and Secure Registration for Internet Protocol Mobility
No full textFor the ample development of mobile internet protocol (IP) technology and the recurrent movement of a mobile device, it is necessary for the mobile device to inform their home network where initially registered through an efficient and secured procedure against any sort of attacks. The procedure of registration for IP mobility by the portable system must have a better performance by providing a certain level of security, such as authentication, integrity, replay attack protection, and location privacy. All at once, the extreme security in the registration of IP mobility may cause long registration time, principally for real-time systems. This paper mainly deals with a balanced effort for secure and efficient registration procedure which gives better security and efficiency in terms of registration delay. The proposed work provides an easy and fast registration procedure and lessens the registration delay through the usage of an identity based authenticated key exchange scheme that eliminates expensive pairing operations. The proposed protocol is verified by using AVISPA tool. The performance evaluation reveals that the proposed protocol significantly outperforms the existing protocols in terms of the registration delay.Defence Science Journal, 2013, 63(5), pp.502-507, DOI:http://dx.doi.org/10.14429/dsj.63.400
A Secure and Decentralized Registration Scheme for IPv6 Network-Based Mobility Senthil Kumar Mathi 1, M.L.Valarmathi 2
No full textAbstract — For frequent movement of a mobile device, there is a need for a secure registration procedure of the mobile device by announcing its current location to the home network, especially, if it is not in the home domain. While devising the registration procedure for mobile IPv6 (MIPv6) based network, it is essential to consider the security issues for cryptographic approaches and an infrastructure requirement on the network. If a public key based cryptography is used for improving the security, then the key exchange mechanisms of the communicants must be handled appropriately. The infrastructure based approach increases the complexity of the mobile device and the mobility agents and also requires an additional message exchanges. Hence, this paper deals with an infrastructure-less registration scheme with symmetric key approach that acts upon MIPv6 environment consisting of the mobile node, home agent, and correspondent node. The proposed scheme is simulated and evaluated for security using Murphi checker. The correctness of the signaling/message sequences of the proposed scheme are verified by the finite state machine. Finally, the simulation results reveals that better security and mutual authentication between MIPv6 nodes have been achieved, and further, mitigation for the various attack scenarios have also been addressed
A Secure and Efficient Binding Update Scheme with Decentralized Design for Next Generation IP Mobility
No full textProduction and size characterization of graphene
No full textGraphene, a 2D nanomaterial made of carbon, has gained interest in the scientific community since its discovery in 2004. Among other properties, graphene has excellent tensile strength, electrical and thermal conductivity and can be used as catalyst. Graphene has no shortage of applications, but large scale production methods are yet to be developed. LPE is a promising method, in which the layers that make up graphite are separated to produce graphene in a liquid medium. However, the flakes that are produced are polydispersed in size and thickness, which leads to the need for size selection. Current studies have achieved size selection with centrifugation. However, centrifugation has thus far been a trial and-error procedure, without understanding the underlying physics and statistics. This research focuses on creating a rational basis by combining experiments with simulations based on fluid dynamics and statistics. By combining results from simulations and experiments we are able to arrive at the size distributions of initial stock dispersion of graphene that was made from LPE. The simulations entail plate particle settling in a tube, where randomly generated polydisperse particles are randomly distributed in a tube. Stokes settling velocity is assumed for each particle. In parallel to this, we perform sedimentation experiments of stock dispersion at fixed relative centrifugal force (RCF) for different times. From the experiments we know the mass transfer from the supernatant to the sediment and the average thickness of the plates in the supernatant. Both these experimental results allow us to narrow the initial particle size distributions we assumed in the simulations. Thus we have developed a technique based on simple experiments and simulations that gives great insight into particle size distribution without having to perform tedious characterization such as AFM or TEM. Once the particle size distribution is known for a specific LPE protocol, it will allow the likes of both industry and academia to standardize graphene quality.<br/
Biological Mechanisms of Plant Interactions With a Combination of Biotic and Abiotic Stresses
No full textThis eBook is a collection of articles from a Frontiers Research Topic. Frontiers Research Topics are very popular trademarks of the Frontiers Journals Series: they are collections of at least ten articles, all centered on a particular subject. With their unique mix of varied contributions from Original Research to Review Articles, Frontiers Research Topics unify the most influential researchers, the latest key findings and historical advances in a hot research area! Find out more on how to host your own Frontiers Research Topic or contribute to one as an author by contacting the Frontiers Editorial Office: frontiersin.org/about/contac
Thermoeconomic Optimization of Organic Rankine Cycle (ORC) for Low Grade Heat Recovery at Temperatures below 100℃
No full textLow-grade heat sources are abundant on earth but are majorly untapped due to lower thermodynamic efficiency at low temperatures and cost considerations. A cost-effective technology is needed to convert this energy resource into useful forms of energy. This work aims at optimizing Organic Rankine Cycle (ORC) based heat engine and a cogeneration system developed to produce electricity and refrigeration from a heat source below 100℃, from both thermodynamic and economic point of view. Exergoeconomics, an algebraic thermoeconomic method, was used to analyze and optimize the systems for cost-effectiveness and exergetic efficiency. Also, the prototype of the cogeneration system was experimentally tested. The results exergoeconomic optimization show that the cost-effectiveness of the cogeneration system can be significantly improved by design parameter changes. The experimental results obtained were comparable with the results obtained from theoretical simulations
- …
