A Quick Heuristic-Dynamic Programming for Two-Dimensional Cutting Problem

A binary facsimile coding technique capable of coding documents at compression ratios from 10:1 to 40:1 has been developed. In the basic system, individual document characters are isolated into small rectangular blocks. The location, size, and contents of each block are coded for transmission. A more sophisticated version of the coder utilizes matching of a character with previously scanned characters. If a match exists, a code word indicating the match is coded along with the character location.

A scheme for the parallel implementation of the combined branch-and-bound method and heuristic algorithms is proposed. Results of computations for the one-dimensional Boolean knapsack problem are presented that demonstrate the efficiency of the proposed approach. The main factors that affect the speedup of the solution when local optimization is used are discussed.

LBM simulation of free convection in a nanofluid filled incinerator containing a hot block

A universal approach for continuous or discrete nonlinear programmings with multiple variables and constraints

College students taking Historical Geology courses often have great difficulty interpreting underlying structural relationships from the outcrop patterns shown on geologic maps. A series of cut wooden blocks is traditionally used to demonstrate the connection between various outcrop patterns and their corresponding structural configurations as well as the effect of streams and other surface features on those patterns. Such blocks are quite limited, however, in that they show only a pre-selected set of circumstances and are by necessity “after-the-fact” representations. A common layer cake, after appropriate modifications, provides a better block in that it can show the progressive development of particular outcrop patterns. A moist pound cake (or other dense, coherent cake) is prepared according to specifications and cut into smaller blocks as needed. Dipping beds, folds, faults and differential erosion can be easily and effectively demonstrated. Stream valleys can be carved into the blocks at any desired...

Aiming at the problems of traditional beamforming algorithms that require a two-dimensional angle search for two-dimensional DOA estimation using rectangular arrays, which takes a long time, this paper provides a dimensionality reduction method through theoretical derivation and numerical calculation. This method uses coordinate conversion and secondary optimization, successively calculates the angle of the target relative to the X and Y axes, and combines the idea of least squares to finally calculate the azimuth and elevation angle of the target, turning the two-dimensional problem into a one-dimensional search, which greatly reduces the amount of calculation. The simulation results show that the angle estimation accuracy of this method is equivalent to that of the traditional MUSIC method, but its algorithm complexity and calculation time are reduced a lot, which is very suitable for engineering applications.

The short offset transient electromagnetic method (SOTEM) has become one of the main methods for coal hydrogeology investigations and mineral explorations due to its performance advantages of high precision, large depth abilities, and high efficiency. At the present time, due to the computational complexity and memory requirements for 3D SOTEM inversion algorithms, SOTEM data inversion is mainly based on 1D, which has made it difficult to meet fine detection requirements under complex geological conditions. In this study, a particle swarm optimization-quasi-Newton hybrid algorithm (PSO-QN) was proposed, with high precision and fast 3D inversions of SOTEM data achieved. In addition, flight strategy was introduced in order to ensure the global optimization of individual particles, and a weighting strategy was adopted to avoid falling into local minimums. The 3D inversions of the SOTEM data were tested based on a variety of geoelectric models. The results showed that the dependence of the PSO-QN hybrid algorithm on the number of particle swarms had been dropped to two thirds. Furthermore, the calculation time was significantly reduced to one third. The inversion results of the field data revealed that the proposed inversion method possessed a strong anti-noise capacity, high speed, good stability, and high resolution.

While web proxy caching is a widely deployed technique, the performance of a proxy cache is limited by the local storage. Some studies have addressed this limitation by using the residual resources of clients via a p2p method and have achieved a very high hit rate. However, these approaches treat web objects as homogeneous objects and there is no consideration of various web characteristics. Consequently, the byte hit rate of the system is limited, external bandwidth is wasted, and perceived user latency is increased. The present paper suggests an efficient p2p based web caching technique that manages objects with different policies so as to exploit the characteristics of web objects, such as size and temporal locality. Small objects are stored alone whereas large objects are stored by dividing them into numerous small blocks, which are distributed in clients. On a proxy cache, header blocks of large objects take the place of objects themselves and smaller objects are cached. This technique increases the hit rate. Unlike a web cache, which evicts large objects as soon as possible in the case where clients fulfill the role of backup storage, large objects are given higher priority than small objects in the proposed approach. This maximizes the effect of hits for large objects and thereby increases the byte hit rate. Furthermore, we construct simple latency models for various p2p based web caching systems and analyze the effects of the proposed policies on these systems. We then examine the performances of the efficient policies via a trace driven simulation. The results demonstrate that the proposed techniques effectively enhance web cache performance, including hit rate, byte hit rate, and response time.

A new methodology is developed in this work to solve a one-dimensional (1D) nonlinear wave propagation problem. In its response, the space variable is converted to time functions at different locations, and the resultant time functions are merged with the time variable. Since the merged variables are essentially time-delay variables, the main point of the methodology is that the governing equation of the nonlinear wave propagation problem can be converted to a corresponding nonlinear delay differential equation (DDE) with multiple delays. The new methodology is shown how to formulate the converted DDE, and a modified incremental harmonic balance method is used to solve the 1D nonlinear DDE by introducing a delay matrix operator, where a formula of the Jacobian matrix is derived and can be efficiently and automatically used in the Newton method. This new methodology is demonstrated by solving examples of 1D monatomic chains under the nonlinear Hertzian contact law and with cubic springs. Results well match those in previous works, but derivation effort of solutions and calculation time can be significantly reduced here. When the algorithm of the methodology is compiled as a computer program, there is no additional derivation required to solve wave propagation problems associated with different governing equations.

Various undrained cavity expansion solutions for elastic–plastic soil have been proposed previously. However, no solution has been presented for elastic–viscoplastic (EVP) soil until now. This paper presents a general solution method for solving the classical one-dimensional (1D) boundary value problem (BVP) for undrained cylindrical or spherical cavity expansion in EVP soil with an emphasis on the rate effect of soil. The solution method is summarized as three standard procedures: (i) obtaining the soil displacement and strain under incompressible conditions, (ii) calculating the effective stress of soil through a suitable constitutive law, and (iii) obtaining the pore pressure by numerically solving the stress equilibrium equation through the finite difference method (FDM) or other numerical solution techniques. The numerical algorithms for calculating the effective stress and pore pressure are very simple, without any complex iteration processes, and they require little calculation time but provide high computational accuracy. In addition, some numerical results are given to investigate the influence of the cavity expansion velocity on the cavity expansion response. The proposed solution procedure is general and can be applied not only for the EVP model but also for other plasticity models, and the given EVP solution can be applied to interpret the rate effect of the cone penetration test and pile penetration.

The present set of three experiments was designed to extend the findings that visuomotor programming can make use of learned size information under some, but not all, conditions. An association was established between the size of square wooden blocks and a perceptual cue in all experiments. In Experiment 1 the perceptual cue to size was a small two-dimensional drawing of a shape affixed to the top of the blocks (e.g. triangle = large; circle = small, or vice versa). In Experiment 2 size and shape were again associated but this time a pattern of two-dimensional shapes covered the visible surface of the blocks. In Experiment 3 block size was associated with the colour of a small circle affixed to the top of the blocks (e.g. red = large; yellow = small, or vice versa). All of the subjects grasped the blocks, and on other trials estimated the size of the blocks by opening their thumb and finger a matching amount. Consistent with previous reports, in all experiments, the learned associations changed the perceived size of two test blocks halfway in size between the large and small blocks: estimations of the test block matched by shape or colour to the group of large objects were smaller than estimations of the test block matched to the group of small objects. The effect appears to result from relative-size comparisons being made between the medium-sized test blocks and the size category (large or small) associated with the matching shape or colour cue. Despite the significant effect of the learned perceptual associations on manual estimations, no effect on grip scaling was seen when the cues associated with size were single small elements centred on the top of the block (Experiment 1 and Experiment 3). Changes in grip scaling corresponded to the change in perceived size only when the cue to size covered the entire block (Experiment 2), forming a surface pattern. These findings suggest that visuomotor programming is more likely to use learned size information when the cue providing the size association covers the visible surface of the target objects, perhaps by acting as a texture that provides reliable information about the target's material and identity.

In computer tomography (CT), truncated projections are produced due to scanning large objects with a detector that is limited in width. Applying filtered back-projection(FBP) method directly to truncated projections, the reconstructed image will contain truncation artifacts – bright rings on the boundary of region of interest (ROI). Extrapolation algorithms can be used to reduce the truncation artifacts; however extrapolations are usually double the length of the projection data; resulting in an increased calculation time. This paper introduces mixed extrapolation, which is a combination of exponential and quadratic extrapolation. It is proven that doubling the length of the projection data for the mixed extrapolation can be avoided. The projections were extrapolated according to the boundary values and their derivatives. The algorithm achieves equivalence to the extrapolation approach with negligible increased calculation time. Supplementary functions are introduced in order to simplify the calculations. These functions can be calculated prior to extrapolation process, hence the calculation time is significantly reduced. The calculation times are compared between fast extrapolation introduced in this paper and normal extrapolation with doubling the length of projection data.

White matter hyperintensities (WMH), also known as white matter lesions, are localised white matter areas that appear hyperintense on MRI scans. WMH commonly occur in the ageing population, and are often associated with several factors such as cognitive disorders, cardiovascular risk factors, cerebrovascular and neurodegenerative diseases. Despite the fact that some links between lesion location and parametric factors such as age have already been established, the relationship between voxel-wise spatial distribution of lesions and these factors is not yet well understood. Hence, it would be of clinical importance to model the distribution of lesions at the population-level and quantitatively analyse the effect of various factors on the lesion distribution model.In this work we compare various methods, including our proposed method, to generate voxel-wise distributions of WMH within a population with respect to various factors. Our proposed Bayesian spline method models the spatio-temporal distribution of WMH with respect to a parametric factor of interest, in this case age, within a population. Our probabilistic model takes as input the lesion segmentation binary maps of subjects belonging to various age groups and provides a population-level parametric lesion probability map as output. We used a spline representation to ensure a degree of smoothness in space and the dimension associated with the parameter, and formulated our model using a Bayesian framework.We tested our algorithm output on simulated data and compared our results with those obtained using various existing methods with different levels of algorithmic and computational complexity. We then compared the better performing methods on a real dataset, consisting of 1000 subjects of the UK Biobank, divided in two groups based on hypertension diagnosis. Finally, we applied our method on a clinical dataset of patients with vascular disease.On simulated dataset, the results from our algorithm showed a mean square error (MSE) value of 7.27×10−5, which was lower than the MSE value reported in the literature, with the advantage of being robust and computationally efficient. In the UK Biobank data, we found that the lesion probabilities are higher for the hypertension group compared to the non-hypertension group and further verified this finding using a statistical t-test. Finally, when applying our method on patients with vascular disease, we observed that the overall probability of lesions is significantly higher in later age groups, which is in line with the current literature.

In this paper, we have described an accurate and efficient shadowing recognition method based on octree data structure for efficiently judging the illuminated regions in electrically large objects. The physical optics method is used to calculate a bistatic RCS curve for target VFY-218. The theory of shadowing recognition is a hybrid method consists of traditional method and the octree data structure. This novel method is able to analyze the shadowing relationship precisely with less calculation time when compared with traditional method. Finally, numerical experiments and results show the accuracy and efficiency of this method.

A novel 3D modeling system in which a target object is easily captured and modeled by using a hand-held camera with several reference panels is presented in this paper. The reference panels are designed to be able to obtain the camera position and discriminate between each other. A conventional 3D modeling system using a reference panel has several restrictions regarding the target object, specifically the size and its location. Our system uses multiple reference panels, which are set around the target object to remove these restrictions. The main features of this system are as follows: 1) The whole shape and photo-realistic textures of the target object can be digitized based on several still images or a movie captured by using a hand-held camera; as well as each location of the camera that can be calculated using the reference panels. 2) Our system can be provided as a software product only. That means there are no special requirements for hardware; even the reference panels , because they can be printed from image files or software. 3) This system can be applied to digitize a larger object. In the experiments, we developed and used an interactive region selection tool to detect the silhouette on each image instead of using the chroma -keying method. We have tested our system with a toy object. The calculation time is about 10 minutes (except for the capturing the images and extracting the silhouette by using our tool) on a personal computer with a Pentium-III processor (600MHz) and 320MB memory. However, it depends on how complex the images are and how many images you use. Our future plan is to evaluate the system with various kind of objects, specifically, large ones in outdoor environments.© (2002) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.