This paper presents a complete and up-to-date survey of published inventory literature for the deteriorating (decaying) inventory models. More specifically, those papers are addressed that consider the effect of deterioration as a function of the on-hand level of inventory. The basic features, extensions and generalization of various models are discussed. A classification scheme is presented along with suggestions for future research.

https://link.springer.com/content/pdf/10.1057%2Fjors.1991.4.pdf

Survey of Literature on Continuously Deteriorating Inventory Models

This paper develops a new crossover operator, Sequential Constructive crossover (SCX), for a genetic algorithm that generates high quality solutions to the Traveling Salesman Problem (TSP). The sequential constructive crossover operator constructs an offspring from a pair of parents using better edges on the basis of their values that may be present in the parents' structure maintaining the sequence of nodes in the parent chromosomes. The efficiency of the SCX is compared as against some existing crossover operators; namely, edge recombination crossover (ERX) and generalized N-point crossover (GNX) for some benchmark TSPLIB instances. Experimental results show that the new crossover operator is better than the ERX and GNX.

Genetic algorithm for the traveling salesman problem using sequential constructive crossover

A method for establishing, confirming, and transferring ownership of digital artworks. The method associates a given artwork to a unique public ID and to an online service. The owner of the artwork is the person who has full access to the online service at the public ID. Confirming ownership of the artwork includes the owner performing an action that demonstrates the owner has full access to the online service at the public ID. Transferring ownership of the artwork includes ( 1 ) transferring access to the account itself, or (2) using the online service's transfer protocol, which may also update the public ID associated with the owner of the artwork.

Method to securely establish, affirm, and transfer ownership of artworks

(s, S) continuous review models for inventory with random lifetimes

Digital watermarks are one of the tools which helps to make the distribution of digital material more secure. It is a kind of digital signal or pattern hidden directly in digital content. The paper deals with the multi-faceted aspects of digital watermarking (DWM) technology. It also discusses the need for DWM with the properties like robustness, security, invertibility, transparency, complexity, capacity, and verification. The key aspects are given with the solutions for DWM. Few companies involved in DWM activities are discussed with the technique of embedding with different types of watermarks. It discusses tool and techniques for images, text, and other applications of DWM. The possible attacks on DWM and the organisations involved in developing standards for it are described. It has been concluded that the protection of individual rights is a must, and deeper understanding of the DWM will lead to the design of more reliable systems for safe-guarding digital contents.

/pdf/safeguarding-the-digital-contents-digital-watermarking-3vewzzi3ul.pdf

Safeguarding the Digital Contents: Digital Watermarking

The Travelling Salesman Problem with Precedence Constraints (TSP-PC) is the usual Travelling Salesman Problem with the restrictions that the salesman should start from a prescribed node (i.e., a headquarters) and each admissible tour is to satisfy k precedence relations denoted by ir < jr; r=1,2,...,k. That is the node jr should not be visited unless node ir is already visited. This problem is NP-hard and arises in practical transportation and sequencing problems. In this paper, a lexisearch algorithm has been developed for obtaining exact optimal solution. Also, simple and hybrid genetic algorithms have been developed for obtaining heuristically optimal solution to the problem. The efficiency of the genetic algorithms to the TSP-PC as against lexi-search approach has been examined for a variety of randomly generated test problems.

The Travelling Salesman Problem with Precedence Constraints

With the advancement of Internet technologies and its wide usage, it has become easy to illegally copy, distribute, and manipulate digital products. Digital watermarking is a proven method to protect authenticity by identifying the owner of the digital content. Significant work has been reported in the last five years on legal and technical measures for protecting digital rights. This paper explains the concepts of ownership rights and related intellectual property rights and their technical and legal protection measures. It also introduces digital water marking, its classification, features, and applications.

Multimedia Digital Rights Protection Using Watermarking Techniques

This paper considers the number of de~ands for a good item during a cycle of an inventory system with initial stock Q and with the items in stock deteriorating stochastically over time. The demands occur as a Poisson process, and the lot is replenished with zero lead time, making the cycle time itself a random variable. The probability distribution of the number of demands is developed; also tabulated is the minimal reorder quantity Q(k,δ) to assure meeting a minimum of k demands in a cycle with a confidence of (1-δ) .

On a new distribution arising in decaying inventory systems

The conventional Maximum flow problem is modified to take account of possible requirements at intermediate nodes across which flow takes place. This is achieved by incorporating pseudo or priority arcs to act as thresholds controlling out-flow from the nodes and modifying the Ford and Fulkerson algorithm to take account of these thresholds.

A maximum flow problem with intermediate node requirements

In this paper we consider the mixture of two Rectangular Distributions. Methods used for estimating the parameters are (i) Moment ratio method (ii) Extreme value estimation , this problem has been addressed to some extent by Pavan Kumar (2003), in the context of obtaining stopping rule to estimate population minimum in sampling with replacement from a finite population. Extreme value estimate method relatively better than moment ratio method, based on simulation, the percentage of acceptable estimators obtained in samples.

/pdf/estimation-in-mixtures-the-rectangular-case-4iv25beny5.pdf

S. N. Narahari Pandit

Papers

The Travelling Salesman Problem with Precedence Constraints

Multimedia Digital Rights Protection Using Watermarking Techniques

On a new distribution arising in decaying inventory systems

A maximum flow problem with intermediate node requirements

Estimation in Mixtures: The Rectangular Case