解决包索排列不均的方法

打包机压缩的棉花包装，现大多数轧花厂用直径2．5mm或2.8mm的低碳镀锌钢丝捆扎。GB6975－86《棉花包装》标准中4．3规定“包索排列要均匀”，如果包索排列不均匀，就符合国家的规定标准。针对目前存在的包索排列不均，谈谈自己的认识，供大家参考。

衡阳湘江三桥斜拉索体的防护

简要介绍衡阳湘江三桥斜拉索防护的施工和材料 。

An efficient algorithm for mining closed itemsets

This paper presents a new efficient algorithm for mining frequent closed itemsets. It enumerates the closed set of frequent itemsets by using a novel compound frequent itemset tree that facilitates fast growth and efficient pruning of search space. It also employs a hybrid approach that adapts search strategies, representations of projected transaction subsets, and projecting methods to the characteristics of the dataset. Efficient local pruning, global subsumption checking, and fast hashing methods are detailed in this paper. The principle that balances the overheads of search space growth and pruning is also discussed. Extensive experimental evaluations on real world and artificial datasets showed that our algorithm outperforms CHARM by a factor of five and is one to three orders of magnitude more efficient than CLOSET and MAFIA.

An Open Source Toolkit for Identifying Comparative Space-time Research Questions

Comparative space-time thinking lies at the heart of spatiotemporally integrated social sciences. The multiple dimensions and scales of socioeconomic dynamics pose numerous challenges for the application and evaluation of public policies in the comparative context. At the same time, social scientists have been slow to adopt and implement new spatiotemporally explicit methods of data analysis due to the lack of extensible software packages, which becomes a major impediment to the promotion of spatiotemporal thinking. The proposed framework will address this need by developing a set of research questions based on space-time-distributional features of socioeconomic datasets. The authors aim to develop, evaluate, and implement this framework in an open source toolkit to comprehensively quantify the changes and level of hidden variation of space-time datasets across scales and dimensions. Free access to the source code allows a broader community to incorporate additional advances in perspectives and methods, thus facilitating interdisciplinary collaboration. Being written in Python, it is entirely cross-platform, lowering transmission costs in research and education.

Privacy-Preserving Top-k Keyword Similarity Search over Outsourced Cloud Data

In this paper,we study the problem of privacy-preserving top-k keyword similarity search over outsourced cloud data.Taking edit distance as a measure of similarity,we first build up the similarity keyword sets for all the keywords in the data collection.We then calculate the relevance scores of the elements in the similarity keyword sets by the widely used tf-idf theory.Leveraging both the similarity keyword sets and the relevance scores,we present a new secure and efficient treebased index structure for privacy-preserving top-k keyword similarity search.To prevent potential statistical attacks,we also introduce a two-server model to separate the association between the index structure and the data collection in cloud servers.Thorough analysis is given on the validity of search functionality and formal security proofs are presented for the privacy guarantee of our solution.Experimental results on real-world data sets further demonstrate the availability and efficiency of our solution.

Feature extraction of induction motor stator fault based on particle swarm optimization and wavelet packet

To effectively extract the interturn short circuit fault features of induction motor from stator current signal, a novel feature extraction method based on the bare-bones particle swarm optimization （BBPSO） algorithm and wavelet packet was proposed. First, according to the maximum inner product between the current signal and the cosine basis functions, this method could precisely estimate the waveform parameters of the fundamental component using the powerful global search capability of the BBPSO, which can eliminate the fundamental component and not affect other harmonic components. Then, the harmonic components of residual current signal were decomposed to a series of frequency bands by wavelet packet to extract the interturn circuit fault features of the induction motor. Finally, the results of simulation and laboratory tests demonstrated the effectiveness of the proposed method.

Genetic algorithm for short-term scheduling of make-and-pack batch production process

This paper considers a scheduling problem in industrial make-and-pack batch production process. This process equips with sequence-dependent changeover time, multipurpose storage units with limited capacity, storage time, batch splitting, partial equipment connectivity and transfer time. The objective is to make a production plan to satisfy all constraints while meeting demand requirement of packed products from various product families. This problem is NP-hard and the problem size is exponentially large for a realistic-sized problem. Therefore,we propose a genetic algorithm to handle this problem. Solutions to the problems are represented by chromosomes of product family sequences. These sequences are decoded to assign the resource for producing packed products according to forward assignment strategy and resource selection rules. These techniques greatly reduce unnecessary search space and improve search speed. In addition, design of experiment is carefully utilized to determine appropriate parameter settings. Ant colony optimization and Tabu search are also implemented for comparison. At the end of each heuristics, local search is applied for the packed product sequence to improve makespan. In an experimental analysis, all heuristics show the capability to solve large instances within reasonable computational time. In all problem instances, genetic algorithm averagely outperforms ant colony optimization and Tabu search with slightly longer computational time.

A New Searching Strategy for the Lost Plane Based on RBF Neural Network Model and Global Optimization Model

In this paper, we construct two models for the searching task for a lost plane. Model 1 determines the searching area. We predict the trajectory of floats generated after the disintegration of the plane by using RBF neural network model, and then determine the searching area according to the trajectory. With the pass of time, the searching area will also be constantly moving along the trajectory. Model 2 develops a maritime search plan to achieve the purpose of completing the search in the shortest time. We optimize the searching time and transform the problem into the 0-1 knapsack problem. Solving this problem by improved genetic algorithm, we can get the shortest searching time and the best choice for the search power.

Case Report:Congenital spinal intradural arachnoid cyst associated with intrathoracic meningocele in a child

Congenital spinal intradural arachnoid cyst associated with intrathoracic meningocele is very rare.We report a case in a 9-year-old Chinese boy who presented with a two-week history of progressive paraparesis and gait ataxia.Magnetic resonance imaging revealed that a dorsal intradural extramedullary cystic lesion extended from T1 to T5 and compressed the spinal cord.A left lateral intrathoracic meningocele pouch was found incidentally at the level of T1.The arachnoid cyst as well as meningocele was removed and the spinal cord compression was relieved.Arachnoid cyst was confirmed by histological examination.The patient recovered well postoperatively.This is the second report of such a case in the world according to the available literature.The take-home message for our case is that the surgical approach should be individualized,depending on the size and location.