Extreme-Point-based Heuristics for the Three-Dimensional Bin Packing problem

One of the main issues in addressing three-dimensional packing problems is finding an efficient and accurate definition of the points at which to place the items inside the bins, because the performance of exact and heuristic solution methods is actually strongly influenced by the choice of a placement rule. We introduce the extreme point concept and present a new extreme point-based rule for packing items inside a three-dimensional container. The extreme point rule is independent from the particular packing problem addressed and can handle additional constraints, such as fixing the position of the items. The new extreme point rule is also used to derive new constructive heuristics for the three-dimensional bin-packing problem. Extensive computational results show the effectiveness of the new heuristics compared to state-of-the-art results. Moreover, the same heuristics, when applied to the two-dimensional bin-packing problem, outperform those specifically designed for the proble

An Algorithmic Study of Manufacturing Paperclips and Other Folded Structures

We study algorithmic aspects of bending wires and sheet metal into a specified structure. Problems of this type are closely related to the question of deciding whether a simple non-self-intersecting wire structure (a carpenter's ruler) can be straightened, a problem that was open for several years and has only recently been solved in the affirmative. If we impose some of the constraints that are imposed by the manufacturing process, we obtain quite different results. In particular, we study the variant of the carpenter's ruler problem in which there is a restriction that only one joint can be modified at a time. For a linkage that does not self-intersect or self-touch, the recent results of Connelly et al. and Streinu imply that it can always be straightened, modifying one joint at a time. However, we show that for a linkage with even a single vertex degeneracy, it becomes NP-hard to decide if it can be straightened while altering only one joint at a time. If we add the restriction that each joint can be altered at most once, we show that the problem is NP-complete even without vertex degeneracies. In the special case, arising in wire forming manufacturing, that each joint can be altered at most once, and must be done sequentially from one or both ends of the linkage, we give an efficient algorithm to determine if a linkage can be straightened.Comment: 28 pages, 14 figures, Latex, to appear in Computational Geometry - Theory and Application

A SAT encoding for Multi-dimensional Packing Problems

International audienceThe Orthogonal Packing Problem (OPP) consists in determining if a set of items can be packed into a given container. This decision problem is NP-complete. S. P. Fekete et al. modelled the problem in which the overlaps between the objects in each dimension are represented by interval graphs. In this paper we propose a SAT encoding of Fekete et al. characterization. Some results are presented, and the efficiency of this approach is compared with other SAT encodings

Dynamic Composite Data Physicalization Using Wheeled Micro-Robots

This paper introduces dynamic composite physicalizations, a new class of physical visualizations that use collections of self-propelled objects to represent data. Dynamic composite physicalizations can be used both to give physical form to well-known interactive visualization techniques, and to explore new visualizations and interaction paradigms. We first propose a design space characterizing composite physicalizations based on previous work in the fields of Information Visualization and Human Computer Interaction. We illustrate dynamic composite physicalizations in two scenarios demonstrating potential benefits for collaboration and decision making, as well as new opportunities for physical interaction. We then describe our implementation using wheeled micro-robots capable of locating themselves and sensing user input, before discussing limitations and opportunities for future work

Hair-cell-specific Genes in the Embryonic Chicken Inner Ear by Overexpression

The inner ear houses organs used for hearing and balance that use hair cells to accomplish their tasks. Inner ear development remains to be fully understood, and advancing knowledge in development could lead to therapies and treatments for hearing problems. A gene called Atoh1 is necessary for hair cell formation and has been shown to increase hair cell number when overexpressed. Importantly, microRNAs from the 183 family (miRs-183, -182, and -96) are also expressed in developing hair cells. MicroRNAs are small RNA molecules that bind to messenger RNAs and prevent translation. MicroRNAs have been associated with cellular functions such as programmed cell death, cell division, and differentiation. In 2009, miR-96 was implicated in a congenital form of human deafness. Like Atoh1, miR-96 increases hair cell number when over-expressed. However, we do not know if the effects of overexpressing these genes will be additive. To address this, we plan to inject the inner ears of chicken embryos with a virus that causes overexpression of miRNAs from the 183 family and Atoh1. In order to establish the effects of injecting this virus, we are gathering data on control embryos injected with a non-bioactive virus to acquire a baseline for hair cell quantification. Hair cells will be quantified using image-analysis software after injection of the virus. The data collection methods are still being refined and we do not yet have any data. Further research potentially could utilize these results to develop therapeutic treatments for deafness