Optimal storage locations in a carousel storage and retrieval system

This paper examines the problem of optimal product location in a single bi-directional carousel storage and retrieval system. For items with independent demands, it establishes the long-run average optimality of a simple demand rate ranking and partitioning scheme which has previously been suggested in the literature through heuristic reasoning and simulation studies.     

Adding compression to a full-text retrieval system

We describe the implementation of a data compression scheme as an integral and transparent layer within a full-text retrieval system. Using a semi-static word-based compression model, the space needed to store the text is under 30 per cent of the original requirement. The model is used in conjunction with canonical Huffman coding and together these two paradigms provide fast decompression. Experiments with 500 Mb of newspaper articles show that in full-text retrieval environments compression not only saves space, it can also yield faster query processing - a win-win situation.     

Image compression for fast wavelet-based subregion retrieval

In an image browsing environment there is need for progressively viewing image subregions at various resolutions. We describe a storage scheme that accomplishes good image compression, while supporting fast image subregion retrieval. We evaluate analytically and experimentally the compression performance of our algorithm. We also provide results on the speed of the algorithm to demonstrate its effectiveness, and present an extension to a client/server environment.     

Free balancing for a shuttle-based storage and retrieval system

Shuttle-based storage and retrieval systems (SBS/RSes) – a type of automated storage and retrieval system (AS/RS) – have recently been developed to increase throughput capacity. An SBS/RS can increase throughput by using multiple shuttles as storage and retrieval machines (SRMs), while traditional AS/RSes are limited because they use a single stacker crane as an SRM to handle multiple jobs. However, when setting up an SBS/RS, a significant investment is required to integrate a shuttle for each tier in the storage construction. To lower costs, a reduction in the number of shuttles is an adequate solution if the SBS/RS can maintain the designated throughput. However, this could also lead to operational problems. Namely collision prevention and workload balances could be affected because each shuttle would be able to travel to any tier for pickups and drop-offs. Thus, shuttle position control is important when the system operates with a mismatch between the number of shuttles and tiers. Ideally, free balancing should be achieved. When free balanced, each shuttle's position is monitored to prevent collisions or blockages, as well as to make sure jobs are evenly assigned and the required throughput is maintained. This paper suggests system controls to prove the effectiveness of free balancing, and it runs a simulation analysis to verify the system with the suggested controls. As a result, free balancing shows better performances in terms of throughput and utilization compared to a basic system control. Specifically, in our case, free balancing can achieve targeted throughput with less number of shuttles.     

基于特殊内容的图像分割压缩方法

针对扫描的简历图像存储所面临的压缩比和恢复质量之间的矛盾,提出了一种将简历图像分割压缩的方法,分析了简历图像分割压缩存储的可行性和有效性,找出分割压缩的难点和关键,并结合应用给出了一套具体的解决方法,实现了一个应用此种方法的图像分割压缩转换系统。对系统进行了测试,测试结果表明,该方法是一套简单有效的方法,有效地兼顾了压缩比和图像恢复质量。     

Multi-dimensional color image storage and retrieval for a normal arbitrary quantum superposition state

Multi-dimensional color image processing has two difficulties: One is that a large number of bits are needed to store multi-dimensional color images, such as, a three-dimensional color image of $1024 \times 1024 \times 1024$ needs $1024 \times 1024 \times 1024 \times 24$  bits. The other one is that the efficiency or accuracy of image segmentation is not high enough for some images to be used in content-based image search. In order to solve the above problems, this paper proposes a new representation for multi-dimensional color image, called a $(n\,+\,1)$ -qubit normal arbitrary quantum superposition state (NAQSS), where $n$ qubits represent colors and coordinates of ${2^n}$ pixels (e.g., represent a three-dimensional color image of $1024 \times 1024 \times 1024$ only using 30 qubits), and the remaining 1 qubit represents an image segmentation information to improve the accuracy of image segmentation. And then we design a general quantum circuit to create the NAQSS state in order to store a multi-dimensional color image in a quantum system and propose a quantum circuit simplification algorithm to reduce the number of the quantum gates of the general quantum circuit. Finally, different strategies to retrieve a whole image or the target sub-image of an image from a quantum system are studied, including Monte Carlo sampling and improved Grover’s algorithm which can search out a coordinate of a target sub-image only running in $O(\sqrt{N/r} )$ where $N$ and $r$ are the numbers of pixels of an image and a target sub-image, respectively.     

Travel time analysis of a new automated storage and retrieval system

In conventional automated storage and retrieval systems (AS/RS), stacker cranes are used to access (store or retrieve loads into/from) the storage cells. The stacker cranes can travel simultaneously in the vertical and horizontal directions. However, because the combined motions generally require heavy machineries, the stacker cranes are inadequate for extra heavy loads such as sea container cargo. For such applications, we present a new kind of storage/retrieval (S/R) mechanism, designed with input from AS/RS manufacturers. Unlike stacker cranes, the new S/R mechanism has one vertical platform and N horizontal platforms to serve N tiers of an AS/RS rack. The vertical platform provides the vertical link among different tiers of the AS/RS rack, whereas the horizontal platforms access the storage cells on a given tier. The vertical platform and the horizontal platforms may move independently and concurrently; and the separation of the mechanisms for vertical/horizontal movements also makes the platforms lighter and hence they can operate at a higher speed than the conventional design. We then present a travel-time model under the stay dwell point policy, i.e. the platforms remain where they are after completing a storage/retrieval operation. The model is validated by computer simulations. The results show that our analytical model is reliable for the design and analysis of the new kind of AS/RS. We also present guidelines for the optimal design of a rectangular-in-time AS/RS rack with the new S/R mechanism.     

Multi-panel medical image segmentation framework for image retrieval system

The automatic segmentation of multi-panel medical images into sub-images improves the retrieval accuracy of medical image retrieval systems. However, the accuracy and efficiency of the available multi-panel medical image segmentation techniques are not satisfactory for multi-panel images containing homogenous color inter-panel borders and image boundary, heterogeneous color inter-panel borders, small size sub-images, or numerous number of sub-images. In order to improve the accuracy and efficiency, a Multi-panel Medical Image Segmentation Framework (MIS-Framework) is proposed and implemented based on locating the longest inter-panel border inside the boundary of the input image. We evaluated the proposed framework on a subset of imageCLEF 2013 dataset containing 2407 images. The proposed framework showed promising experimental results in terms of accuracy and efficiency on single panel as well as multi-panel image class identification and on sub-image separation as compared to the available techniques.     

一个土石混合料图像分割系统

在对石块图像的分割过程中,针对石块图像的形状差异大、同一石块的不同区域具有显著不同亮度特征的实际情况,采用了基于模糊隶属度的区域生长方法。在区域生长中,根据所得到的种子的不同特征,选用不同的生长函数。对种子的提取,提出了相对统计特征的概念。利用相对统计特征不仅提取了用于区域生长的种子,在此基础上,还初步知道了各个种子所对应的石块的大小和与整个石块相对应的初步的统计特征,这正是基于不同尺寸的模糊隶属度的区域生长方法的基础。通过这种方法,对石块图像的分割取得了很好的效果。     

组合压缩在存储测试系统中的应用

在某些特殊的测试环境中,存储测试系统中既要求大容量数据存储又要求微体积.为解决这一矛盾,在研究了游程压缩和LZW两种算法的基础上,提出了以FPGA为核心实现两种算法的无损组合压缩,利用FPGA芯片内的RAM来建立字典,用VHDL语言和状态机实现该压缩算法.仿真和综合验证表明,通过FPGA实现该组合算法,压缩效果显著,压...     

Metaheuristic based control of a flow rack automated storage retrieval system

This paper presents two metaheuristic algorithms, namely taboo search and simulated annealing, applied to the control of a flow rack automated storage retrieval system (AS/RS). These metaheuristic algorithms are developed to control the retrieval machine of the AS/RS in order to minimize the retrieval cycle time. Results of these metaheuristic algorithms are compared to classical heuristics and analytical models found in literature (Gaouar et?al. in MOSIM 2006, Rabat, Maroc, avril 2006; Sari et?al. in Int J Adv Manuf Technol 25:979–987, 2005; Ghomri & Sari in Conception et Production Intégrées, CPI’2009, Fes, Maroc, 19–21 Octobre 2009). These heuristics were developed to control the storage and retrieval of items in the AS/RS. On the other hand, analytical models were conceived to bring a bottom line for comparison of different control techniques. To carry out this comparative study, simulations were performed on a wide range of system configurations. In order to validate metaheuristics results, a sensitive study on their parameters was achieved, and the best parameters were selected for comparative study.     

A reinforcement learning approach for transaction scheduling in a shuttle-based storage and retrieval system

With recent Industry 4.0 developments, companies tend to automate their industries. Warehousing companies also take part in this trend. A shuttle-based storage and retrieval system (SBS/RS) is an automated storage and retrieval system technology experiencing recent drastic market growth. This technology is mostly utilized in large distribution centers processing mini-loads. With the recent increase in e-commerce practices, fast delivery requirements with low volume orders have increased. SBS/RS provides ultrahigh-speed load handling due to having an excess amount of shuttles in the system. However, not only the physical design of an automated warehousing technology but also the design of operational system policies would help with fast handling targets. In this work, in an effort to increase the performance of an SBS/RS, we apply a machine learning (ML) (i.e., Q-learning) approach on a newly proposed tier-to-tier SBS/RS design, redesigned from a traditional tier-captive SBS/RS. The novelty of this paper is twofold: First, we propose a novel SBS/RS design where shuttles can travel between tiers in the system; second, due to the complexity of operation of shuttles in that newly proposed design, we implement an ML-based algorithm for transaction selection in that system. The ML-based solution is compared with traditional scheduling approaches: first-in-first-out and shortest process time (i.e., travel) scheduling rules. The results indicate that in most cases, the Q-learning approach performs better than the two static scheduling approaches.     

ADAMO A data storage and retrieval system for clinical research

A data storage and retrieval system—ADAMO—for clinical research is presented. ADAMO is a “problem-oriented” data management system, with which a clinical researcher can obtain answers to his questions in an interactive way without also having to screen irrelevant patient information. The programs composing ADAMO are application independent. The independency is obtained by using files for storing application-dependent information produced by a data definition language. The different files used by ADAMO are described. The way in which the user works with the system is explained. Clinicians and researchers are enthusiastic about the use of the system.     

独立式多分辨率VGA/DVI压缩存储系统

一种独立式多分辨率VGA/DVI压缩存储系统,该系统支持VGA/DVI输入,同时支持SVGA、XGA、SXGA、UXGA、1080p等任意分辨率图像的连续压缩和存储.在100 MHz时钟频率下,系统可以对图像SXGA和UXGA实时压缩为(25帧/s)和(17帧/s).实验表明,在不同码率下,系统的单帧图像压缩性能与JP...     

作基于常识库支持的图像描述和检索系统*

分析了图像检索系统的研究现状,指出了出现语义鸿沟的原因在于系统中缺乏对于实体相互关系的描述,提出了一个四层的图像语义模型,并在此基础上给出了基于常识库和图像实体库的图像描述和检索模型。以图像的颜色、纹理、形状等特征来构造实体的描述信息,并以常识库信息来分析图像场景中的实体构成和关系,从而获得对图像语义信息的识别和理解。     

Image retrieval with a multi-modality ontology

Ontologies represent domain concepts and relations in a form of semantic network. Many research works use ontologies in the information matchmaking and retrieval. This trend is further accelerated by the convergence of various information sources supported by ontologies. In this paper, we propose a novel multi-modality ontology model that integrates both the low-level image features and the high-level text information to represent image contents for image retrieval. By embedding this ontology into an image retrieval system, we are able to realize intelligent image retrieval with high precision. Moreover, benefiting from the soft-coded ontology model, this system has good flexibility and can be easily extended to the larger domains. Currently, our experiment is conducted on the animal domain canine. An ontology has been built based on the low-level features and the domain knowledge of canine. A prototype retrieval system is set up to assess the performance. We compare our experiment results with traditional text-based image search engine and prove the advantages of our approach.     

Image segmentation by a multiresolution approach

Multiresolution approaches to computer vision are able to rapidly detect and extract global structures from an image. In this paper we present (a) a pyramid-based algorithm that can detect the bimodality of the population of pixels in a grey level digital image and (b) a pyramid-based algorithm that maps the values of a bimodal population into two constant values which are approximately the means of the two component subpopulations. A population is considered bimodal if it can be divided into two component subpopulations whose variances are small relative to the population variance. An improvement to the above algorithm, which uses an iterative scheme, is also given, as well as some examples of segmented images. Both algorithms require processing times on the order of the logarithm of the population size.