Optimal segmentation of beam and disk structures

Large structures are usually composed of elements by properly designed connections. The optimal design solution in such cases should provide optimal size and number of elements together with optimal connection stiffness. The problem is formulated by assuming the element cost to be a nonlinear function of its size and the cost of connection to depend on its stiffness or transmitted forces. The number of elements and the connection stiffness now constitute the design parameters to be determined. A two-level procedure is proposed for determination of the optimal segmentation for beam and plate structures. Several illustrative examples are presented.     

Incremental, online, and merge mining of partial periodic patterns in time-series databases

Mining of periodic patterns in time-series databases is an interesting data mining problem. It can be envisioned as a tool for forecasting and prediction of the future behavior of time-series data. Incremental mining refers to the issue of maintaining the discovered patterns over time in the presence of more items being added into the database. Because of the mostly append only nature of updating time-series data, incremental mining would be very effective and efficient. Several algorithms for incremental mining of partial periodic patterns in time-series databases are proposed and are analyzed empirically. The new algorithms allow for online adaptation of the thresholds in order to produce interactive mining of partial periodic patterns. The storage overhead of the incremental online mining algorithms is analyzed. Results show that the storage overhead for storing the intermediate data structures pays off as the incremental online mining of partial periodic patterns proves to be significantly more efficient than the nonincremental nononline versions. Moreover, a new problem, termed merge mining, is introduced as a generalization of incremental mining. Merge mining can be defined as merging the discovered patterns of two or more databases that are mined independently of each other. An algorithm for merge mining of partial periodic patterns in time-series databases is proposed and analyzed.     

Optimal seek profile generation with time-varying weightings for hard disk drives

In this paper, an optimal servo control strategy is presented to achieve high seek/settle performance without compromising the targeted seek time in hard disk drives. The cost function to be optimized is given by a weighted quadratic function with respect to time and the jerk of control command. Thanks to the fact that the cost function is directly penalized with time-varying weightings, the proposed method is more effective to minimize the settling vibration induced by the actuator seek profile compared with the previous optimization approaches in literature. The proposed approach is applicable to any given initial and terminal conditions.     

Optimal extraction of motif patterns in 2D

The combinatorial explosion of motif patterns occurring in 1D and 2D arrays leads to the consideration of special classes of motifs growing linearly with the size of the input array. Such motifs, called irredundant motifs, are able to succinctly represent all of the other motifs occurring in the same array within reasonable time and space bounds. In previous work irredundant motifs were extracted from 2D arrays in O(N²log²nloglogn) and O(N³) time, where N is the size of the 2D input array and n is its largest dimension.In this paper, we present an algorithm to extract irredundant motifs from 2D arrays that is quadratic in the size of the input. The input is defined on a binary alphabet. It is shown that the algorithm is optimal and practically faster than the previous ones.     

Optimal design of smart carriage arm in magnetic disk drive for vibration suppression

In hard disk drives, vibration suppression is very important to boost the performance of information-processing equipment. It has been expected that technology of smart structure will contribute to the development of small and light-weight mechatronics devices with the required performance. The smart structure is composed of the piezoelectric film sensor and actuator in order to reduce the structural vibration. The placement of the piezoelectric actuator and H ₂ control system are simultaneously optimized based on genetic algorithm to improve the effect on the vibration suppression. It has been verified by some applications with a plate structure and a magnetic disk drive that an enhanced performance for the vibration suppression can be achieved by the proposed optimal design method.     

A multiway merge sorting network

A multiway merge sorting network is presented, which generalizes the technique used in the odd-even merge sorting network. The merging network described here is composed of m k-way mergers and a combining network. It arranges k ordered lists of length n each into one ordered lists in T(k)+[log₂k] [log₂m] [log₂m] steps, where T(k) is the number of steps needed to sort k keys in order; and k and m are any integers no longer restricted to 2     

The parallel odd-even merge algorithm

This paper briefly describes the implementation of the odd-even merge algorithm on a parallel MIMD computer and discusses its computational complexity.     

HEVC帧间运动归并技术的研究

HEVC作为下一代视频编码标准,正在由JCT-VC制定.根据最新的HEVC中提出的归并技术,描述了B帧编解码效率的改善.实验验证了运动归并技术在低延迟低复杂度情况下对P帧的影响.通过HM6.0中运动归并技术算法原理,分析运动归并技术对于P帧在编解码效率上并无明显的提升,PSRN平均降低了0.1％.     

Understanding and improving UML package merge

Package merge allows the content of one package to be combined with that of another package. Package merge is used extensively in the UML 2 specification to modularize the definition of the UML 2 meta model and to define the four compliance levels of UML 2. Package merge is a novel construct in UML and currently not well understood. This paper summarizes our work to understand and improve package merge. First, we identify ambiguous and missing rules in the package merge definition and suggest corrections. Then, we formalize package merge and analyze it with respect to some desirable properties. Our analyses employs Alloy, a first-order modelling language with tool support, and concepts from mathematical logic which allow us to develop a general taxonomy of package extension mechanisms. The analyses reveal the unexpected failure of important properties.

Optimal channel selection for analysis of EEG-sleep patterns of neonates

This paper extends our previous work on automated detection and classification of neonate EEG sleep stages. In [19] we adapted and integrated a range of computational, mathematical and statistical tools for the analysis of neonatal electroencephalogram (EEG) sleep recordings with the aim of facilitating the assessment of neonatal brain maturation and dismaturity by studying the structure and temporal patterns of their sleep. That work relied on algorithms using a single channel of EEG. The present paper builds on our previous work by incorporating a larger selection of EEG channels that capture both the spatial distribution and temporal patterns of EEG during sleep. Using a multivariate analysis approach, we obtain the "optimal" selection of the EEG channels and characteristics that are most suitable for EEG sleep state separation.     

Poisson disk sampling through disk packing

Computational Visual Media - Poisson disk sampling is an important problem in computer graphics and has a wide variety of applications in imaging, geometry, rendering, etc. In this paper, we...     

Plastic merge procedure for mosaics of polygons

Graphic input, while providing a congenial medium for the user, can lead to problems of noisy data. In the case of mosaics of arbitrary polygons input graphically, the problem lies in boundary misalignments and the consequent lack of guaranteed common boundaries. A general plastic merge procedure operating on mosaics of arbitrary rectilinear polygons is described which corrects such boundary misalignments. The work was originally motivated by the needs of an applications project funded by sponsors with user interests. With further support from SRC, the underlying concepts were subsequently expanded and are presented here in a form which is not application-specific.     

Technical challenges faced when companies merge…

One of the greatest technical challenges that IT and security staff face can be the job of merging two organizations together. After the board level discussions, and all of the HR issues have been resolved, what still remains are two networks, two sets of servers, two sets of policies and standards, and probably more different types of workstation hardware and software builds than anyone even realised. At this point the respective IT and Information security functions have to make order out of the chaos.