Data distribution schemes of sparse arrays on distributed memory multicomputers

A data distribution scheme of sparse arrays on a distributed memory multicomputer, in general, is composed of three phases, data partition, data distribution, and data compression. To implement the data distribution scheme, many methods proposed in the literature first perform the data partition phase, then the data distribution phase, followed by the data compression phase. We called a data distribution scheme with this order as Send Followed Compress (SFC) scheme. In this paper, we propose two other data distribution schemes, Compress Followed Send (CFS) and Encoding-Decoding (ED), for sparse array distribution. In the CFS scheme, the data compression phase is performed before the data distribution phase. In the ED scheme, the data compression phase can be divided into two steps, encoding and decoding. The encoding step and the decoding step are performed before and after the data distribution phase, respectively. To evaluate the CFS and the ED schemes, we compare them with the SFC scheme. In the data partition phase, the row partition, the column partition, and the 2D mesh partition with/without load-balancing methods are used for these three schemes. In the compression phase, the CRS/CCS methods are used to compress sparse local arrays for the SFC and the CFS schemes while the encoding/decoding step is used for the ED scheme. Both theoretical analysis and experimental tests were conducted. In the theoretical analysis, we analyze the SFC, the CFS, and the ED schemes in terms of the data distribution time and the data compression time. In experimental tests, we implemented these three schemes on an IBM SP2 parallel machine. From the experimental results, for most of test cases, the CFS and the ED schemes outperform the SFC scheme. For the CFS and the ED schemes, the ED scheme outperforms the CFS scheme for all test cases.

Proteomic expression profiling of thyroid neoplasms

Thyroid cancer is the most common endocrine neoplasm with multiple histologic subtypes, each associated with different treatments and outcomes. Differentiating benign neoplasms such as follicular adenomas from malignant entities such as follicular carcinomas and papillary carcinoma can be challenging. To define the proteomic profile of different thyroid tumors, we screened an antibody array of 330 features against five thyroid neoplasms: follicular adenoma, follicular carcinoma, papillary carcinoma, anaplastic carcinoma, and medullary carcinoma as well as normal thyroid epithelium. Eight candidate biomarkers; c-erbB-2, Stat5a, Annexin IV, IL-11, RARα, FGF7, Caspase 9, and phospho-c-myc were identified as differentially expressed on the antibody array, and validated with immunohistochemistry on tissue microarrays, with a total of 144 samples of the same variety of thyroid neoplasms. Analysis revealed c-erbB-2, Annexin IV, and Stat5a have potential clinical utility to differentiate follicular adenoma, follicular carcinoma, and papillary carcinoma from each other. By using an antibody array as a discovery platform and a tissue microarray as a first step in validation on a large number of specimens, we have identified new markers that have potential utility in the diagnosis of thyroid neoplasms.     

Transient temperature responses of hydronic radiant floor heating system by different pipe embedding depth and water supply condition

"Ondol" is a Korean unique heating system. It is a specific radiant floor heating system using combustion heat of briquette or timber in Korea. Such traditional "Ondol" is changed to radiant heating system with pipe-coil embedded in the floor or slab. This study has contributed to the understandings of the transient behaviours of Ondol-heated floor panels and enclosure exposed to this type of heating system. The result is that the water supply temperature had a large effect on the rate of increase in floor surface and room air temperature. But, in spite of a higher water supply temperature, the heat flow rate was not increased considerably. The shallow pipe embedding depths, of course, result in a low heat flow rate.     

Correlation of the transport properties of simple fluids at low temperatures and high pressures based on the generalized Eucken relation and the molecular dynamics of hard sphere fluid

A generalized correlation is developed for the viscosity and thermal conductivity of isotropic fluids under high pressures (up to 200 MPa) and low temperatures (down to 85 K). Two known observations have been taken into consideration in the development of the correlation. First, the Alder correction factors for the Enskog theory values of transport coefficients obtained from molecular dynamics simulations for hard sphere fluids are incorporated. The inclusion of these corrections in the theory makes it possible to describe correctly the density dependence of the hard sphere viscosity and thermal conductivity at high pressures. The hydrodynamic cage effect, which is manifested in the molecular motions of dense fluid systems, is thus correctly accounted for. Second, the generalized Eucken relation, which relates the thermal conductivity to the viscosity, is incorporated. As a consequence, an internally consistent correlation is obtained, which can adequately predict the behavior of the thermal conductivity from given values of viscosity. Tests on simple fluids, such as argon, krypton, etc., show that the correlation is valid within a few percent for the entire fluid range where experimental data are available for comparison, and also along the vapor-liquid saturation line, with the exclusion of the critical region. Furthermore, since the variables appearing in the theory are in reduced form, a corresponding states correlation is established for isotropic fluids.     

Bi-criteria minimization for the permutation flowshop scheduling problem with machine-based learning effects

In traditional scheduling problems, the processing time for the given job is assumed to be a constant regardless of whether the job is scheduled earlier or later. However, the phenomenon named “learning effect” has extensively been studied recently, in which job processing times decline as workers gain more experience. This paper discusses a bi-criteria scheduling problem in an m-machine permutation flowshop environment with varied learning effects on different machines. The objective of this paper is to minimize the weighted sum of the total completion time and the makespan. A dominance criterion and a lower bound are proposed to accelerate the branch-and-bound algorithm for deriving the optimal solution. In addition, the near-optimal solutions are derived by adapting two well-known heuristic algorithms. The computational experiments reveal that the proposed branch-and-bound algorithm can effectively deal with problems with up to 16 jobs, and the proposed heuristic algorithms can yield accurate near-optimal solutions.     

Topological localization with kidnap recovery using sonar grid map matching in a home environment

This paper presents a method of topological localization with kidnap recovery capability in a home environment using only low-cost sonar sensors. The proposed method considers both pose tracking and relocation problems. The pose tracking is achieved by calculating node probability using grid-map matching and relative motion model. The relocation method detects the kidnap automatically and recovers it using multiple hypothesis tracking. After kidnap recovery, it also provides a criterion for selecting a reasonable hypothesis for returning to the pose tracking stage autonomously. Experimental results in a real home environment verify that the proposed localization method provides a reliable and convergent node probability when the robot is kidnapped.     

Tree-turn routing: an efficient deadlock-free routing algorithm for irregular networks

In this paper, we propose a general turn model, called a Tree-turn model, for tree-based routing algorithms on irregular topologies. In the Tree-turn model, links are classified as either a tree link or a cross link and six directions are associated with the channels of links. Then we can prohibit some of the turns formed by these six directions such that an efficient deadlock-free routing algorithm, Tree-turn routing, can be derived. There are three phases to develop the Tree-turn routing. First, a coordinated tree for a given topology is created. Second, a communication graph is constructed based on the topology and the corresponding coordinated tree. Third, the forwarding table is set up by using all-pairs shortest path algorithm according to the prohibited turns in the Tree-turn model and the directions of the channels in the communication graph. To evaluate the performance of the proposed Tree-turn routing, we develop a simulator and implement Tree-turn routing along with up*/down* routing, L-turn routing, and up*/down* routing with DFS methodology. The simulation results show that Tree-turn routing outperforms other routing algorithms for all the test cases.     

Modeling and experimental investigation for electrolytic corrosion prevention in high frequency micro EDM using deionized water

The characteristics of the prevention of electrolytic corrosion during micro electrical discharge machining (EDM) using deionized water and high frequency bipolar pulse were investigated. Electrolytic corrosion during micro EDM using deionized water was analyzed using an equivalent electrical circuit based on the electrical double layer theory. Based on the analysis and experimental verification, a narrow positive pulse duration should be provided to the workpiece to prevent corrosion. A negative voltage with zero average applied voltage (V_{avg, app}) is also essential for this purpose. If V_{avg, app} is positive or negative, electrolytic corrosion occurs on the workpiece or tool, respectively. Micro holes and 3D structures without corrosion were successfully fabricated using a high frequency bipolar pulse with a pulse duration of 0.2?μs and a period of 1?μs, as well as V_{avg, app}?=?0?V.     

Combining genetic approach and integer programming to solve multi-facility economic lot-scheduling problem

Economic lot-scheduling problem (ELSP) has been studied since the 1950??s. ELSP deals with the scheduling of the production of several items on a single facility in a cyclical pattern. The facility can only produce one single item at a time, and there is a set-up cost and set-up time associated with each item. Because of the rapid development of many emerging markets nowadays, many common items are produced in different places in order to satisfy the demands in different markets. This becomes the multi-facilities ELSP problems. In ELSP problems, it is known that if more items types to be produced by the facility, the production frequency of each item type will increase because of the balancing of the production rate and the demand rate. Consequently, the number of set-up time and set-up cost increases accordingly. Thus, reallocating the common items, which can be produced in any facilities, to be produced only on certain facility can certainly reduce the number of production frequency, and lead to lower related costs. The objective of this paper is to propose an optimization methodology combining Integer Programming and Genetic Algorithm to solve multi-facility ELSP problems. This paper proposes to divide the main problem into a master problem and sub-problems, which are solved by Integer Programming and Genetic Algorithm respectively. To demonstrate the significance of reallocating the common items and aggregating them to produce in certain facility, several models have been designed and tested. The comparison of the models demonstrates the reduction of the costs benefited by result of common items reallocation.     

Effects of user age and target-expansion methods on target-acquisition tasks using a mouse

Target expansion, i.e., the increase of target size according to cursor movement, can be a practical scheme to improve the usability of target-selection tasks using a mouse. This study examined the effects of different user age groups and target-expansion methods on target-acquisition tasks with grouped icons. Twenty-eight subjects performed acquisition tasks under eight experimental conditions: combinations of four expansion areas (no, one-icon, fish-eye, and group expansion) and two expansion techniques (occlusion and push). Older users took longer to acquire targets than younger users; however, they showed no significant difference in accuracy. Target expansion did not substantially improve performance speed compared to the static condition. However, the error rate was lowest when group area was expanded with the push technique, and both age groups were most satisfied with one-icon area expansion with the occlusion technique. We suggest alternative guidelines in designing target-expansion schemes.