ShapeSynth: Parameterizing model collections for coupled shape exploration and synthesis

Recent advances in modeling tools enable non‐expert users to synthesize novel shapes by assembling parts extracted from model databases. A major challenge for these tools is to provide users with relevant parts, which is especially difficult for large repositories with significant geometric variations. In this paper we analyze unorganized collections of 3D models to facilitate explorative shape synthesis by providing high‐level feedback of possible synthesizable shapes. By jointly analyzing arrangements and shapes of parts across models, we hierarchically embed the models into low‐dimensional spaces. The user can then use the parameterization to explore the existing models by clicking in different areas or by selecting groups to zoom on specific shape clusters. More importantly, any point in the embedded space can be lifted to an arrangement of parts to provide an abstracted view of possible shape variations. The abstraction can further be realized by appropriately deforming parts from neighboring models to produce synthesized geometry. Our experiments show that users can rapidly generate plausible and diverse shapes using our system, which also performs favorably with respect to previous modeling tools.     

Pore network model of deactivation of immobilized glucose isomerase in packed-bed reactors II: three-dimensional simulation at the particle level

Immobilized glucose isomerase is widely used for converting glucose to fructose by enzymatic isomerization. The process takes place in a packed-bed reactor consisting of mesoporous particles with distributed pore sizes and interconnectivities. Its efficiency is, however, significantly affected by deactivation of the mesoporous particles. In this paper, we study deactivation of the mesoporous particles using a three-dimensional pore network model of the pore space with distributed pore sizes and interconnectivities, and investigate several plausible mechanisms of deactivation of the porous particles. The results of the present study, which will be used as the input for simulation of the phenomenon at the reactor level, demonstrates the strong effect of the particles’ morphology on the deactivation process.     

Design and fabrication of 3D‐plotted polymeric scaffolds in functional tissue engineering

Regenerating the load‐bearing tissues requires 3D scaffolds that balance the temporary mechanical function with the biological requirements. In functional tissue engineering, designing scaffolds with biomimetic mechanical properties could promote tissue ingrowth since the cells are sensitive to their local mechanical environment. This work aims to design scaffolds that mimic the mechanical response of the biological tissues under physiological loading conditions. Poly(L ‐lactide) (PLLA) scaffolds with varying porosities and pore sizes were made by the 3D‐plotting technique. The scaffolds were tested under unconfined ramp compression to compare their stress profile under load with that of bovine cartilage. A comparison between the material parameters estimated for the scaffolds and for the bovine cartilage based on the biphasic theory enabled the definition of an optimum window for the porosity and pore size of these constructs. Moreover, the finite element prediction for the stress distribution inside the scaffolds, surrounded by the host cartilaginous tissue, demonstrated a negligible perturbation of the stress field at the site of implantation. The finite element modeling tools in combination with the developed methodology for optimal porosity/pore size determination can be used to improve the design of biomimetic scaffolds. POLYM. ENG. SCI., 47:608–618, 2007. © 2007 Society of Plastics Engineers.     

Evolution of Surface Morphology in Laser-Dressed Alumina Grinding Wheel Material

An approach to laser dressing of alumina grinding wheels is proposed based on solidification microstructures associated with rapid cooling rates obtained in laser surface processing. Laser dressing of alumina grinding wheels forms surface microstructures characterized by multifaceted grains that are expected to facilitate the micro-scale material removal during precision machining. A detailed investigation of variation of grain size and melt depth with laser fluence is conducted. The results are correlated with calculated cooling rates derived from a thermal model. In addition, based on microscopic observations, the formation of surface grains by stacking of individual multifaceted grains formed during laser dressing is suggested.     

Analysing the patterns of spatial contrast discontinuities in natural images for robust edge detection

Pattern Analysis and Applications - The pattern of spatial contrast discontinuities in natural images has been analysed in the present work, and based on it, a new adaptive model of the...     

Influence of a mixed Al2O3+Cr2O3 superficial coating on the non-isothermal oxidation behavior of Fe and Fe-Cr alloys

The non-isothermal oxidation behavior of electrolytic-grade iron and Fe-Cr alloys in dry air has been studied using linear heating rates of 6 K/min, 10 K/ min, and 15 K/min up to a final temperature of 1273–1473 K. Some of the iron and iron-chromium alloy samples were given a surface treatment by dipping them in an aqueous solution containing both Cr and Al ions before their oxidation studies. This pretreatment has resulted in improved oxidation resistance and scale adherence as depicted by no scale rupture even after a second thermal cycle. Mass changes were recorded gravimetrically, and scales have been characterized by SEM, EPMA, and x-ray diffraction analyses.     

A simulation framework for measuring robustness of incentive mechanisms and its implementation in reputation systems

In game theoretical analysis of incentive mechanisms, all players are assumed to be rational. Since it is likely that mechanism participants in the real world may not be fully rational, such mechanisms may not work as effectively as in the idealized settings for which they were designed. Therefore, it is important to evaluate the robustness of incentive mechanisms against various types of agents with bounded rational behaviors. Such evaluations would provide us with the information needed to choose mechanisms with desired properties in real environments. In this article, we first propose a general robustness measure, inspired by research in evolutionary game theory, as the maximal percentage of invaders taking non-equilibrium strategies such that the agents sustain the desired equilibrium strategy. We then propose a simulation framework based on evolutionary dynamics to empirically evaluate the equilibrium robustness. The proposed simulation framework is validated by comparing the simulated results with the analytical predictions based on a modified simplex analysis approach. Finally, we implement the proposed simulation framework for evaluating the robustness of incentive mechanisms in reputation systems for electronic marketplaces. The results from the implementation show that the evaluated mechanisms have high robustness against a certain non-equilibrium strategy, but is vulnerable to another strategy, indicating the need for designing more robust incentive mechanisms for reputation management in e-marketplaces.     

Lindex: a lattice-based index for graph databases

Subgraph querying has wide applications in various fields such as cheminformatics and bioinformatics. Given a query graph, q, a subgraph-querying algorithm retrieves all graphs, D(q), which have q as a subgraph, from a graph database, D. Subgraph querying is costly because it uses subgraph isomorphism tests, which are NP-complete. Graph indices are commonly used to improve the performance of subgraph querying in graph databases. Subgraph-querying algorithms first construct a candidate answer set by filtering out a set of false answers and then verify each candidate graph using subgraph isomorphism tests. To build graph indices, various kinds of substructure (subgraph, subtree, or path) features have been proposed with the goal of maximizing the filtering rate. Each of them works with a specifically designed index structure, for example, discriminative and frequent subgraph features work with gIndex, δ-TCFG features work with FG-index, etc. We propose Lindex, a graph index, which indexes subgraphs contained in database graphs. Nodes in Lindex represent key-value pairs where the key is a subgraph in a database and the value is a list of database graphs containing the key. We propose two heuristics that are used in the construction of Lindex that allows us to determine answers to subgraph queries conducting less subgraph isomorphism tests. Consequently, Lindex improves subgraph-querying efficiency. In addition, Lindex is compatible with any choice of features. Empirically, we demonstrate that Lindex used in conjunction with subgraph indexing features proposed in previous works outperforms other specifically designed index structures. As a novel index structure, Lindex (1) is effective in filtering false graphs (2) provides fast index lookups, (3) is fast with respect to index construction and maintenance, and (4) can be constructed using any set of substructure index features. These four properties result in a fast and scalable subgraph-querying infrastructure. We substantiate the benefits of Lindex and its disk-resident variation Lindex+ theoretically and empirically.