Multi-objective particle swarm optimisation based integrated production inventory routing planning for efficient perishable food logistics operations

Sustainable and efficient food supply chain has become an essential component of one’s life. The model proposed in this paper is deeply linked to people's quality of life as a result of which there is a large incentive to fulfil customer demands through it. This proposed model can enhance food quality by making the best possible food quality accessible to customers, construct a sustainable logistics system considering its environmental impact and ensure the customer demand to be fulfilled as fast as possible. In this paper, an extended model is examined that builds a unified planning problem for efficient food logistics operations where four important objectives are viewed: minimising the total expense of the system, maximising the average food quality along with the minimisation of the amount of CO₂ emissions in transportation along with production and total weighted delivery lead time minimisation. A four objective mixed integer linear programming model for intelligent food logistics system is developed in the paper. The optimisation of the formulated mathematical model is proposed using a modified multi-objective particle swarm optimisation algorithm with multiple social structures: MO-GLNPSO (Multi-Objective Global Local Near-Neighbour Particle Swarm Optimisation). Computational results of a case study on a given dataset as well as on multiple small, medium and large-scale datasets followed by sensitivity analysis show the potency and effectiveness of the introduced method. Lastly, there has been a scope for future study displayed which would lead to the further progress of these types of models.     

Controlled elements for designing ciphers suitable to efficient VLSI implementation

This work considers the problem of increasing the performance of the ciphers based on Data-Dependent (DD) operations (DDO) for VLSI implementations. New minimum size primitives are proposed to design DDOs. Using advanced DDOs instead of DD permutations (DDP) in the DDP-based iterative ciphers Cobra-H64 and Cobra-H128 the number of rounds has been significantly reduced yielding enhancement of the “performance per cost” value and retaining security at the level of indistinguishability from a random transformation. To obtain further enhancement of this parameter a new crypto-scheme based on the advanced DDOs is proposed. The FPGA implementation of the proposed crypto-scheme achieves higher throughput value and minimizes the allocated resources than the conventional designs. Design of the DDO boxes of different orders is considered and their ASIC implementation is estimated.     

Efficient similarity-based operations for data integration

Dealing with discrepancies in data is still a big challenge in data integration systems. The problem occurs both during eliminating duplicates from semantic overlapping sources as well as during combining complementary data from different sources. Though using SQL operations like grouping and join seems to be a viable way, they fail if the attribute values of the potential duplicates or related tuples are not equal but only similar by certain criteria. As a solution to this problem, we present in this paper similarity-based variants of grouping and join operators. The extended grouping operator produces groups of similar tuples, the extended join combines tuples satisfying a given similarity condition. We describe the semantics of this operator, discuss efficient implementations for the edit distance similarity and present evaluation results. Finally, we give examples of application from the context of a data reconciliation project for looted art.     

Summary report of journal operations, 2006.

Provides a summary report of American Psychological Association journal operations, 2006. This summary is compiled from the 2006 annual reports of the Council of Editors and from Central Office records. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Coordinating production and distribution of jobs with bundling operations

We consider an integrated scheduling and distribution model in which jobs completed by two different machines must be bundled together for delivery. The objective is to minimize the sum of the delivery cost and customers' waiting costs. Such a model not only attempts to coordinate the job schedules on both machines, but also aims to coordinate the machine schedules with the delivery plan. Polynomial-time heuristics and approximation schemes are developed for the model with only direct shipments as well as the general model with milk-run deliveries.     

A frame-based knowledge representation model and its mapping to nested relations

The first part of this paper introduces the basic constructs of a frame representation model and gives a formal definition for them. Subsequently the nested relational model (NF²) is described as an extension of the classical relational model to support relation-valued attributes. In the second part of this paper both models are compared with each other and a mapping of frame representation structures to NF² structures is specified. The structural similarities between frames and NF² relations are made clear and it is shown that their main difference is due to the type polymorphism introduced by the concept hierarchy of the frame model. This causes type collisions to occur in the strictly typed NF² model when frames are directly mapped to NF² structures. Two solutions to this problem are suggested and compared. The paper concludes with a reformulation of query operations of the frame model in terms of NF² algebra operations.     

Cognitive Operations in the Generation Effect on a Recall Test: Role of Aging and Divided Attention.

Generation effect (generated words are better memorized than read words) of anagrams, rhymes, and associates of target words was examined in young, elderly, and very old subjects. Experiments 1 and 2 showed that only young subjects benefit from the generation effect in a free-recall test when the rule is of a phonological nature. Experiments 3, 4, and 5 showed that the generation effect of rhymes was due to a resources-dependent self-initiated process. Experiments 4 and 5 showed that in a divided-attention situation, generation effect of rhymes is not significant in young subjects, but that the generation effect of semantic associates remains significant for both groups (Experiment 5). The results are discussed within the environmental support framework and the transfer-appropriate processing framework. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Reasoning, Integration, Inference Alteration, and Text Comprehension.

This paper reports how the study of formal logical reasoning provides insight into more everyday types of reasoning, such as that involved in language comprehension. Both of these types of cognition are thought to involve the use of mental models, and so it is reasonable to think that the cognitive operations needed for formal logical reasoning would be involved in everyday reasoning as well. We focused on three aspects of formal reasoning: (a) the integration of information into a common mental model, (b) the drawing of inferences, and (c) the coordination of alternative possibilities. We were able to show that the integration and inference components were related to narrative comprehension processes, but the coordination of alternative models was not. Thus, there is evidence for some overlap in the mental processes used in formal and everyday reasoning. This further justifies the study of formal logical reasoning as a window into certain types of everyday reasoning. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Modeling flotation separation in a semi-batch process

A model for a semi-batch flotation separation process has been developed, based on available microprocess probabilities, and compared to experimental data obtained using a WEMCO laboratory flotation cell. In general, the model predicts the correct experimental trends. In many cases, the model also predicts removal efficiency very well. Parametric studies reveal that the model predictions are sensitive to a stability parameter, the turbulent energy density in the flotation cell, the contact angle between the solid particle and fluid, and the ratio of initial-to-critical film thickness.     

Towards an optimum language data model

Maximizing the satisfaction of a value in an engineering design is usually limited by tradeoffs in which other values become unacceptably sacrificed. In a few cases, however, the maximization is limited by a boundary between what is mathematically possible and what is not. Round wheels, vertical pillars, and binary memory elements are examples of optimum engineering structures which result from such mathematical limits. It is proposed that optimum characteristics of a language data model result similarly by minimizing the variety of primitive data objects, the complexity of those objects, and the number of objects needed to represent data states. Reducing these measures is needed to combine both rich data structure and powerful operations in one language. The minimizations lead to a narrow range of designs for language semantics in which the potential advantages of specialization is small compared with the advantages of commonality. Universal language for support of technical literacy appears to be an appropriate scope of generality in language design.