Optimization of quality and operational costs through improved scheduling of harvest operations

The agriculture sector still lacks the tools and models to enhance the utilization of different resources. This paper addresses the vineyard harvesting problem in developing countries, with the objective of optimizing the wine quality and minimizing the operational costs. Heuristics were introduced to better assign the harvesting days to the different grape blocks that exist in the vineyard's field. The quality of the grapes was a key target as it can transform production from a pinnacle wine to a bulk one. We solved several numerical examples for verification and demonstrative purposes and found that our proposed approach finds solutions that significantly reduce the harvesting costs in the vineyard and considerably outperform Branch and Bound algorithm especially for large problems.     

Shrinking‐horizon dynamic programming

We describe a heuristic control policy for a general finite‐horizon stochastic control problem, which can be used when the current process disturbance is not conditionally independent of the previous disturbances, given the current state. At each time step, we approximate the distribution of future disturbances (conditioned on what has been observed) by a product distribution with the same marginals. We then carry out dynamic programming (DP), using this modified future disturbance distribution, to find an optimal policy, and in particular, the optimal current action. We then execute only the optimal current action. At the next step, we update the conditional distribution, and repeat the process, this time with a horizon reduced by one step. (This explains the name ‘shrinking‐horizon dynamic programming’). We explain how the method can be thought of as an extension of model predictive control, and illustrate our method on two variations on a revenue management problem. Copyright © 2010 John Wiley & Sons, Ltd.     

Generating systems from multiple sketched models

Diagrams are often used to model complex systems: in many cases several different types of diagrams are used to model different aspects of the system. These diagrams, perhaps from multiple stakeholders of different specialties, must be combined to achieve a full abstract representation of the system. Many CAD tools offer multi-diagram integration; however, sketch-based diagramming tools are yet to tackle this difficult integration problem. We extend the diagram sketching tool InkKit to combine software engineering sketches of different types. Our extensions support software design processes by providing a sketch-based approach that allows the iterative creation of multiple outputs interacting with one another from the inter-linked models. We demonstrate that InkKit can generate a functional system consisting of a user interface with processes to submit and retrieve data from a database from sketched user interfaces designs and sketched entity relationship diagrams.     

Scheduling a maintenance activity and due-window assignment on a single machine

We study a single machine scheduling and due-window assignment problem. In addition to the traditional decisions regarding sequencing the jobs and scheduling the due-window, we allow an option for performing a maintenance activity. This activity requires a fixed time interval during which the machine is turned off and no production is performed. On the other hand, after the maintenance time, the machine becomes more efficient, as reflected in the new shortened job processing times. The objective is to schedule the jobs, the due-window and the maintenance activity, so as to minimize the total cost consisting of earliness, tardiness, and due-window starting time and size. We introduce an efficient (polynomial time) solution for this problem.     

Impact of media richness and flow on e-learning technology acceptance

Advances in e-learning technologies parallels a general increase in sophistication by computer users. The use of just one theory or model, such as the technology acceptance model, is no longer sufficient to study the intended use of e-learning systems. Rather, a combination of theories must be integrated in order to fully capture the complexity of e-learners, who are both system users and learners. The current research presents an integrated theoretical framework to study users’ acceptance of streaming media for e-learning. Three streams of research provide the basis for this integrated framework: the technology acceptance model, flow theory and media richness theory. Students enrolled in an online section of an information systems course used one of three different combinations of text, streamed audio and streamed video. Regression analysis was used to test the hypotheses in this field experiment. Perceived ease of use was a predictor of perceived usefulness; both the perceived usefulness and the attitude of the user were predictors of intention to use. Richer content-presentation types were positively correlated with higher concentration levels but showed mixed results when correlated with perceived usefulness. Results from this study have practical implications for those interested in integrating streaming media into e-learning.     

Towards view-invariant gait modeling: Computing view-normalized body part trajectories

This paper proposes an approach to compute view-normalized body part trajectories of pedestrians walking on potentially non-linear paths. The proposed approach finds applications in gait modeling, gait biometrics, and in medical gait analysis. Our approach uses the 2D trajectories of both feet and the head extracted from the tracked silhouettes. On that basis, it computes the apparent walking (sagittal) planes for each detected gait half-cycle. A homography transformation is then computed for each walking plane to make it appear as if walking was observed from a fronto-parallel view. Finally, each homography is applied to head and feet trajectories over each corresponding gait half-cycle. View normalization makes head and feet trajectories appear as if seen from a fronto-parallel viewpoint, which is assumed to be optimal for gait modeling purposes. The proposed approach is fully automatic as it requires neither manual initialization nor camera calibration. An extensive experimental evaluation of the proposed approach confirms the validity of the normalization process.     

Airflow in a slot-ventilated enclosure partially filled with porous boxes: Part I - Measurements and simulations in the clear region

A reduced-scale model and CFD predictions were used to investigate experimentally and numerically the airflow patterns within a ceiling slot-ventilated enclosure partially loaded with vented boxes filled by spherical objects. The experiments were carried out using laser Doppler velocimetry. Airflows around and inside porous boxes were predicted taking into account their aerodynamic interactions. This work is divided into two parts. This paper presents part I and concerns the air velocity characteristics within the jet above the boxes, while Part II deals with the air velocity characteristics inside the boxes. The results highlight the confinement effect due to the enclosure and the influence of load porosity on jet penetration, its development and hence the heterogeneity of ventilation within the enclosure. The numerical predictions obtained with the computational fluid dynamics Fluent package using the RSM turbulence model show reasonable agreement with experimental data. Predicted velocity profiles were generally within an error of 3-30% of the measured velocities.     

Uniqueness of the Perfect Fusion Grid on ℤ d

Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In a graph, merging two regions, separated by a set of vertices, is not straightforward. The perfect fusion graphs defined in J. Cousty et al. (J. Math. Imaging Vis. 30:(1):87–104, 2008) verify all the basic properties required by region merging algorithms as used in image segmentation. Unfortunately, the graphs which are the most frequently used in image analysis (namely, those induced by the direct and the indirect adjacency relations) are not perfect fusion graphs. The perfect fusion grid, introduced in the above mentioned reference, is an adjacency relation on ℤ ^d which can be used in image analysis, which indeed induces perfect fusion graphs and which is “between” the graphs induced by the direct and the indirect adjacencies. One of the main results of this paper is that the perfect fusion grid is the only such graph whatever the dimension d.