Showing papers by "Adrijit Goswami published in 2016"
TL;DR: A hybrid Self-Learning Particle Swarm Optimization (SLPSO) algorithm in multi-objective framework is proposed to solve the MMPPRP-TW and a comparison with the well-known Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is performed to establish superior computational efficiency.
112 citations
TL;DR: The proposed secure and efficient authentication protocol (SEAP) for NFC applications using lifetime-based pseudonyms is proposed and simulated for the formal security verification using the widely-accepted AVISPA tool and results show that SEAP is secure.
Abstract: Authentication protocol plays an important role in the short-range wireless communications for the Near Field Communication (NFC) technology. Due to the shared nature of wireless communication networks, there are several kinds of security vulnerabilities. Recently, a pseudonym-based NFC protocol (PBNFCP) has been proposed to withstand the security pitfalls found in the existing conditional privacy preserving security protocol (CPPNFC). However, this paper further analyzes PBNFCP and shows that it still fails to prevent the claimed security properties, such as impersonation attacks against an adversary, who is a malicious registered user having a valid pseudonym and corresponding private key. In order to overcome these security drawbacks, this paper proposes a secure and efficient authentication protocol (SEAP) for NFC applications using lifetime-based pseudonyms. The proposed SEAP is simulated for the formal security verification using the widely-accepted AVISPA (Automated Validation of Internet Security Protocols and Applications) tool. The simulation results show that SEAP is secure. The rigorous security and performance analysis shows that the proposed SEAP is secure and efficient as compared to the related existing authentication protocols for NFC applications.
70 citations
TL;DR: This paper deals with two-echelon integrated procurement production model for the manufacturer and the buyer integrated inventory system, and proposes an algorithm to derive the optimal policies for both parties in fuzzy stochastic environment.
Abstract: This paper deals with two-echelon integrated procurement production model for the manufacturer and the buyer integrated inventory system. The manufacturer procures raw material from outside suppliers (not a part of supply chain) then proceed to convert it as finished product, and finally delivers to the buyer, who faces imprecise and uncertain, called fuzzy random demand of customers. The manufacturer and the buyer work under joint channel, in which a centralized decision maker makes all decisions to optimize the joint total relevant cost (JTRC) of entire supply chain. In this account, in one production cycle of the manufacturer we determine an optimal multi-ordering policy for the buyer. To be part of this, we first derive the JTRC in stochastic framework, and then extend it in fuzzy stochastic environment. In order to scalarize the fuzzy stochastic JTRC, we use an evaluation method wherein randomness is estimated by probabilistic expectation and fuzziness is estimated by possibilistic mean based on possibility evaluation measure. To derive the optimal policies for both parties, an algorithm is proposed. A numerical illustration addresses the situations of paddy procurement, conversion to rice and fulfillment of uncertain demand of rice. Furthermore, sensitivity of parameters is examined to illustrate the model and algorithm.
39 citations
TL;DR: A new algorithm for finding CHUIs from a transactional database, called the CHUM (Closed + High Utility itemset Miner), which is scalable and efficient and makes use of the item co-occurrences strategy in order to further reduce the number of intersections needed to be performed.
Abstract: In recent years, high utility itemsets (HUIs) mining from the transactional databases becomes one of the most emerging research topic in the field of data mining due to its wide range of applications in online e-commerce data analysis, identifying interesting patterns in biomedical data and for cross marketing solutions in retail business. It aims to discover the itemsets with high utilities efficiently by considering item quantities in a transaction and profit values of each item. However, it produces a tremendous number of HUIs, which imposes further burden in analysis of the extracted patterns and also degrades the performance of mining methods. Mining the set of closed + high utility itemsets (CHUIs) solves this issue as it is a loss-less and condensed representation of all HUIs. In this paper, we aim to present a new algorithm for finding CHUIs from a transactional database, called the CHUM (Closed + High Utility itemset Miner), which is scalable and efficient. The proposed mining algorithm adopts a tricky aimed vertical representation of the database in order to speed up the execution time in generating itemset closures and compute their utility information without accessing the database. The proposed method makes use of the item co-occurrences strategy in order to further reduce the number of intersections needed to be performed. Several experiments are conducted on various sparse and dense datasets and the simulation results clearly show the scalability and superior performance of our algorithm as compared to those for the existing state-of-the-art CHUD (Closed + High Utility itemset Discovery) algorithm.
17 citations
TL;DR: In this model, a two echelon supply chain model with variable setup cost and deterioration cost are analyzed and the objective is to minimize the total cost of the entire system by considering reliability as a decision variable.
Abstract: Product reliability is of significant importance in today’s technological world. People rely more and more upon the sustained functioning of machinery and complex equipments for purposes such as health, economic welfare, safety, to name just a few. Thus, in a business arena, it is critical to assess the reliability of new products. In this model, a two echelon supply chain model with variable setup cost and deterioration cost are analyzed. The setup cost is directly proportional and the deterioration rate is inversely proportional to reliability. Algebraical procedure has been employed to obtain the optimal solution of this model. The objective is to minimize the total cost of the entire system by considering reliability as a decision variable. Some numerical examples, sensitivity analysis, and graphical representations are considered to illustrate the model.
12 citations
TL;DR: This paper deals with a two-warehouse inventory control problem for non-instantaneous deteriorating items in stochastic framework, wherein shortages are permissible and are mixture of partially backlog and lost sales.
Abstract: This paper deals with a two-warehouse inventory control problem for non-instantaneous deteriorating items in stochastic framework, wherein shortages are permissible and are mixture of partially backlog and lost sales. The paper tackles a situation in which the retailer procures more quantity than his/her own warehouse (OW) storage capacity. In such a situation, a rented warehouse (RW) is needed to keep the over purchasing. The stochastic framework captures the situation of random planning horizon of trading. The multifariousness of the random planning horizon is discussed by considering two special cases, namely, uniform and truncated normal distributions. Depending upon the consumption times to and tr of OW and RW inventories, respectively, and preserve time tp after that product starts to deteriorate, we formulate mathematical models for three cases: (i) tp ≤ tr ≤ to, (ii) tr ≤ tp ≤ to, and (iii) tr ≤ to ≤ tp. The discussion is further elongated by presenting some numerical illustrations with co...
7 citations
TL;DR: This paper proposes an effective dynamic group password-based authenticated key exchange scheme for the integrated EPR information system, which retains the original merits of Lee et al.'s scheme and provides users' privacy, perfect forward security and known-key security, and also protects online and offline password guessing attacks.
Abstract: With the rapid growth of the Internet, a lot of electronic patient records (EPRs) have been developed for e-medicine systems. The security and privacy issues of EPRs are important for the patients in order to understand how the hospitals control the use of their personal information, such as name, address, e-mail, medical records, etc. of a particular patient. Recently, Lee et al. proposed a simple group password-based authenticated key agreement protocol for the integrated EPR information system (SGPAKE). However, in this paper, we show that Lee et al.'s protocol is vulnerable to the off-line weak password guessing attack and as a result, their scheme does not provide users' privacy. To withstand this security weakness found in Lee et al.'s scheme, we aim to propose an effective dynamic group password-based authenticated key exchange scheme for the integrated EPR information system, which retains the original merits of Lee et al.'s scheme. Through the informal and formal security analysis, we show that our scheme provides users' privacy, perfect forward security and known-key security, and also protects online and offline password guessing attacks. Furthermore, our scheme efficiently supports the dynamic group password-based authenticated key agreement for the integrated EPR information system. In addition, we simulate our scheme for the formal security verification using the widely-accepted AVISPA (Automated Validation of Internet Security Protocols and Applications) tool and show that our scheme is secure against passive and active attacks.
7 citations
TL;DR: This paper prudently studies the joint effect of deterioration and special sale offer in a stochastic periodic review inventory system, wherein temporary price discount offer is taken into the account.
Abstract: This paper deals with a stochastic periodic review inventory system, wherein temporary price discount offer is taken into the account. The review period (time interval between two consecutive reviews) is considered as a random variable. In the real life, whereas, in one side, supplier stimulates the sale and/or rise cash flow by offering price discount/quantity discount, on the other side extra purchasing impels to deterioration of the product. To become the part of this, we translate some real-life situations such as deterioration, temporary price discount, partial backlogging into the mathematical model. This paper prudently studies the joint effect of deterioration and special sale offer. Furthermore, shortages are permissible in retailer’s inventory system and partially backlogged. The model is mathematically rigorously analyzed and concavity of saving function is also shown. Illustration of the proposed model is exposed through suitable numerical examples, sensitivity analysis and graphical representation.
5 citations
07 May 2016
TL;DR: In this paper, an EOQ type model for time and selling price dependent demand, decreasing selling price and partial backlogging is presented. But the model is not suitable for the case of high-quality products.
Abstract: Owing to intense technological growth and extreme global competition, demand of a newly launched hi-tech item may decrease over time because some better quality items may be available in the marketplace at the same or lower price. This situation pushes the manufacturers to reduce selling price so that demand of that item may increase. If a particular product is not available, competitive market motivates customers to switch to another organisation for similar type of products. Keeping all these things in mind, we have developed an EOQ type model for time and selling price dependent demand, decreasing selling price and partial backlogging. We have formulated the mathematical model, and the procedures to derive the optimal solution are discussed. The effectiveness of the proposed model is illustrated with the help of numerical examples. Sensitivity of the optimal order quantity and optimal cost for changes in various parameter values are also examined.
3 citations
Posted Content•
TL;DR: This paper investigates a newsvendor model with alternative risk preference in which vendor is averse to stockouts in order to avoid dissatisfaction of customers, cost of emergency order and lost sales, and achieves unique optimal solution of the problem.
Abstract: The sophisticated behaviour of the customers, availability of variety of products, stiff competition and product obsolescence results in limited selling period and uncertainty in demand for a product. In that context, the newsvendor models have found increasing applicability in supply chain management (SCM). This paper investigates a newsvendor model with alternative risk preference in which vendor is averse to stockouts in order to avoid dissatisfaction of customers, cost of emergency order and lost sales. We obtain unique optimal solution of the problem and study its various properties. Since newsvendor problem ignores the effect of other vendors in the supply chain, we study a supply chain system with risk neutral wholesaler selling its product to several vendors with stockout averse preferences competing for inventory. We establish the existence and uniqueness of a pure strategy Nash equilibrium. Then we obtain unique optimal solution and study its characteristics. Finally, our model is illustrated with the help of numerical example.
2 citations
01 Jan 2016
TL;DR: This paper proposes a novel time-bound hierarchical access control scheme for secure broadcasting, in which each user needs to store a distinct and unique user's private key, and hence each user in a channel group can subscribe for an individual channel.
Abstract: In a time-bound cryptographic key assignment scheme, distinct temporal keys for distinct time periods are assigned to the channels in order to encrypt and decrypt the channels for secure broadcasting. It has numerous applications including the Pay-TV systems. In this paper, we aim to propose a novel time-bound hierarchical access control scheme for secure broadcasting, in which each user needs to store a distinct and unique user's private key, and hence each user in a channel group can subscribe for an individual channel. Our scheme reduces significantly the implementation cost and also improves the computational performance along with extra features. Through the informal and formal security analysis, it is shown that our scheme is secure against various known attacks including the collusion attack. As a result, our scheme is more secure and efficient as compared to other related schemes in the literature.