The Experts below are selected from a list of 258 Experts worldwide ranked by ideXlab platform
Yu Ping - One of the best experts on this subject based on the ideXlab platform.
-
Hierarchical Ordering of Schematic Knowledge Relating to Pythagorean Theorem Problems——the Explanation Based on Relational-representational Complexity Model
Journal on Mathematics Education, 2020Co-Authors: Yu PingAbstract:It is revealed that schematic knowledge relating to word problems was organized Hierarchically.In fact,the essence of hierarchy has been interpreted by the integration of representational complexity and knowledge base.Evidences were provided in research of Area-of-rectangle problems schema.The paper further testified the effectiveness of the explanation when it comes to more complex problems.Using the empirical study method,we have assessed schematic knowledge relating to Pythagorean theorem problems by asking 1 068th students to judge the conditions on the calculation and classify problems in terms of whether the text of each problem provided insufficient,sufficient,or irrelevant information for solution.The results suggest that schematic knowledge relating to Pythagorean theorem problems involved with the latter four templates was Hierarchically organized and the Hierarchical Ordering could be explained from depth of representation and knowledge base.Moreover,depth of representation is not only reflected by the number of represented Hierarchical relations as stated in the previous study,but also is correlated with complexity inside a relational-representation and reasoning level required in a relational-representation.
-
Hierarchical Ordering of schematic knowledge relating to pythagorean theorem problems the explanation based on relational representational complexity model
Journal on Mathematics Education, 2009Co-Authors: Yu PingAbstract:It is revealed that schematic knowledge relating to word problems was organized Hierarchically.In fact,the essence of hierarchy has been interpreted by the integration of representational complexity and knowledge base.Evidences were provided in research of Area-of-rectangle problems schema.The paper further testified the effectiveness of the explanation when it comes to more complex problems.Using the empirical study method,we have assessed schematic knowledge relating to Pythagorean theorem problems by asking 1 068th students to judge the conditions on the calculation and classify problems in terms of whether the text of each problem provided insufficient,sufficient,or irrelevant information for solution.The results suggest that schematic knowledge relating to Pythagorean theorem problems involved with the latter four templates was Hierarchically organized and the Hierarchical Ordering could be explained from depth of representation and knowledge base.Moreover,depth of representation is not only reflected by the number of represented Hierarchical relations as stated in the previous study,but also is correlated with complexity inside a relational-representation and reasoning level required in a relational-representation.
D. K. Panda - One of the best experts on this subject based on the ideXlab platform.
-
Efficient multicast on irregular switch-based cut-through networks with up-down routing
IEEE Transactions on Parallel and Distributed Systems, 2001Co-Authors: Ram Kesavan, D. K. PandaAbstract:The irregular switch-based network of workstations is fast becoming a cost-effective platform for high performance computing. This paper presents efficient multicasting with reduced link contention on irregular switch-based cut-through interconnection using the popular up*/down* (UD) routing and unicast message passing. First, it is proven that, for an arbitrary irregular network with UD routing, it is not possible to create an ordered list of nodes to implement an arbitrary multicast in a link contention-free manner with a minimal number of communication steps. Next, three different multicast algorithms are proposed with their respective node Orderings to reduce link contention: switch-based Ordering (SO), switch-based Hierarchical Ordering (SHO), and chain concatenation Ordering (CCO). A variation of the binomial tree-based communication pattern, with unicast message passing, is used on the above Orderings to implement multicast. Then, the problem of node contention is described in the case when multiple multicasts occur concurrently in a system. Using source-based information, the CCO algorithm is modified to propose a source-partitioned chain concatenation Ordering (SPCCO) algorithm. It is also shown how the SPCCO algorithm reduces the effect of node contention at the cost of link contention. Using detailed simulation experiments, the proposed multicast algorithms are compared with each other as well as with the naive random Ordering (RO) algorithm for a range of system sizes, switch sizes, message lengths, input buffer sizes, degrees of connectivity, destination set sizes, and communication start-up times. For the case of single multicast, the CCO algorithm is shown to be the best to implement multicast with reduced link contention and minimum latency, For the case of multiple multicasts, the SPCCO algorithm is shown to be the best when the start-up overhead dominates the propagation overhead and the CCO algorithm is shown to be the best otherwise. The results also highlight the importance of reducing link contention when designing efficient multicast, even for systems with large input buffers in the switches. Thus, these results demonstrate significant potential to be applied to current and future generation NOW systems with irregular interconnection.
-
HPCA - Multicast on irregular switch-based networks with wormhole routing
Proceedings Third International Symposium on High-Performance Computer Architecture, 1997Co-Authors: Ram Kesavan, K. Bondalapati, D. K. PandaAbstract:This paper presents efficient multicasting with reduced contention on irregular networks with switch-based wormhole interconnection and unicast message passing. First, it is proved that for an arbitrary irregular network with a typical deadlock-free, adaptive routing, it may not be possible to create an ordered list of nodes to implement an arbitrary multicast in a contention-free manner with minimal number of communication steps. Next, three different multicast algorithms are proposed with their respective node Orderings to reduce contention: switch-based Ordering (SO), switch-based Hierarchical Ordering (SHO), and chain concatenation Ordering (CCO). A variation of a binomial tree-based communication pattern with unicast message passing is used on the above ordered lists to implement multicast. The proposed multicast algorithms are compared with each other as well as with the naive random Ordering (RO) algorithm for a range of system sizes, switch sizes, message lengths, degrees of connectivity, destination set sizes, and communication start-up times. The CCO algorithm is shown to be the best to implement multicast with reduced contention and minimum latency. Such results related to multicast on irregular networks are the first of their kind in the wormhole literature. Thus, these demonstrate significant potential to be applied to current and future generation NOW systems with irregular interconnection.
-
Multicast on irregular switch-based networks with wormhole routing
Proceedings Third International Symposium on High-Performance Computer Architecture, 1997Co-Authors: Ram Kesavan, K. Bondalapati, D. K. PandaAbstract:This paper presents efficient multicasting with reduced contention on irregular networks with switch-based wormhole interconnection and unicast message passing. First, it is proved that for an arbitrary irregular network with a typical deadlock-free, adaptive routing, it may not be possible to create an ordered list of nodes to implement an arbitrary multicast in a contention-free manner with minimal number of communication steps. Next, three different multicast algorithms are proposed with their respective node Orderings to reduce contention: switch-based Ordering (SO), switch-based Hierarchical Ordering (SHO), and chain concatenation Ordering (CCO). A variation of a binomial tree-based communication pattern with unicast message passing is used on the above ordered lists to implement multicast. The proposed multicast algorithms are compared with each other as well as with the naive random Ordering (RO) algorithm for a range of system sizes, switch sizes, message lengths, degrees of connectivity, destination set sizes, and communication start-up times. The CCO algorithm is shown to be the best to implement multicast with reduced contention and minimum latency. Such results related to multicast on irregular networks are the first of their kind in the wormhole literature. Thus, these demonstrate significant potential to be applied to current and future generation NOW systems with irregular interconnection.
Ram Kesavan - One of the best experts on this subject based on the ideXlab platform.
-
Efficient multicast on irregular switch-based cut-through networks with up-down routing
IEEE Transactions on Parallel and Distributed Systems, 2001Co-Authors: Ram Kesavan, D. K. PandaAbstract:The irregular switch-based network of workstations is fast becoming a cost-effective platform for high performance computing. This paper presents efficient multicasting with reduced link contention on irregular switch-based cut-through interconnection using the popular up*/down* (UD) routing and unicast message passing. First, it is proven that, for an arbitrary irregular network with UD routing, it is not possible to create an ordered list of nodes to implement an arbitrary multicast in a link contention-free manner with a minimal number of communication steps. Next, three different multicast algorithms are proposed with their respective node Orderings to reduce link contention: switch-based Ordering (SO), switch-based Hierarchical Ordering (SHO), and chain concatenation Ordering (CCO). A variation of the binomial tree-based communication pattern, with unicast message passing, is used on the above Orderings to implement multicast. Then, the problem of node contention is described in the case when multiple multicasts occur concurrently in a system. Using source-based information, the CCO algorithm is modified to propose a source-partitioned chain concatenation Ordering (SPCCO) algorithm. It is also shown how the SPCCO algorithm reduces the effect of node contention at the cost of link contention. Using detailed simulation experiments, the proposed multicast algorithms are compared with each other as well as with the naive random Ordering (RO) algorithm for a range of system sizes, switch sizes, message lengths, input buffer sizes, degrees of connectivity, destination set sizes, and communication start-up times. For the case of single multicast, the CCO algorithm is shown to be the best to implement multicast with reduced link contention and minimum latency, For the case of multiple multicasts, the SPCCO algorithm is shown to be the best when the start-up overhead dominates the propagation overhead and the CCO algorithm is shown to be the best otherwise. The results also highlight the importance of reducing link contention when designing efficient multicast, even for systems with large input buffers in the switches. Thus, these results demonstrate significant potential to be applied to current and future generation NOW systems with irregular interconnection.
-
HPCA - Multicast on irregular switch-based networks with wormhole routing
Proceedings Third International Symposium on High-Performance Computer Architecture, 1997Co-Authors: Ram Kesavan, K. Bondalapati, D. K. PandaAbstract:This paper presents efficient multicasting with reduced contention on irregular networks with switch-based wormhole interconnection and unicast message passing. First, it is proved that for an arbitrary irregular network with a typical deadlock-free, adaptive routing, it may not be possible to create an ordered list of nodes to implement an arbitrary multicast in a contention-free manner with minimal number of communication steps. Next, three different multicast algorithms are proposed with their respective node Orderings to reduce contention: switch-based Ordering (SO), switch-based Hierarchical Ordering (SHO), and chain concatenation Ordering (CCO). A variation of a binomial tree-based communication pattern with unicast message passing is used on the above ordered lists to implement multicast. The proposed multicast algorithms are compared with each other as well as with the naive random Ordering (RO) algorithm for a range of system sizes, switch sizes, message lengths, degrees of connectivity, destination set sizes, and communication start-up times. The CCO algorithm is shown to be the best to implement multicast with reduced contention and minimum latency. Such results related to multicast on irregular networks are the first of their kind in the wormhole literature. Thus, these demonstrate significant potential to be applied to current and future generation NOW systems with irregular interconnection.
-
Multicast on irregular switch-based networks with wormhole routing
Proceedings Third International Symposium on High-Performance Computer Architecture, 1997Co-Authors: Ram Kesavan, K. Bondalapati, D. K. PandaAbstract:This paper presents efficient multicasting with reduced contention on irregular networks with switch-based wormhole interconnection and unicast message passing. First, it is proved that for an arbitrary irregular network with a typical deadlock-free, adaptive routing, it may not be possible to create an ordered list of nodes to implement an arbitrary multicast in a contention-free manner with minimal number of communication steps. Next, three different multicast algorithms are proposed with their respective node Orderings to reduce contention: switch-based Ordering (SO), switch-based Hierarchical Ordering (SHO), and chain concatenation Ordering (CCO). A variation of a binomial tree-based communication pattern with unicast message passing is used on the above ordered lists to implement multicast. The proposed multicast algorithms are compared with each other as well as with the naive random Ordering (RO) algorithm for a range of system sizes, switch sizes, message lengths, degrees of connectivity, destination set sizes, and communication start-up times. The CCO algorithm is shown to be the best to implement multicast with reduced contention and minimum latency. Such results related to multicast on irregular networks are the first of their kind in the wormhole literature. Thus, these demonstrate significant potential to be applied to current and future generation NOW systems with irregular interconnection.
Galen D. Stucky - One of the best experts on this subject based on the ideXlab platform.
-
Patterning porous oxides within microchannel networks
Advanced Materials, 2001Co-Authors: P. Yang, A. H. Rizvi, Benjamin Messer, Bradley F. Chmelka, George M Whitesides, Galen D. StuckyAbstract:A continuing challenge for materials chemists and engineers is the ability to create multifunctional composite structures with well-defined superimposed structural order from nanometer to micrometer length scales. Materials with three-dimensional structures ordered over multiple length scales can be prepared by carrying out colloidal crystallization and inorganic/organic cooperative self-assembly within microchannel networks. The resulting materials show Hierarchical Ordering over several discrete and tunable length scales ranging from several nanometers to micrometers. These patterned porous materials hold promise for use as advanced catalysts, sensors, low-k dielectrics, optoelectronic and integrated photonic crystal devices.
-
fluoride induced Hierarchical Ordering of mesoporous silica in aqueous acid syntheses
Advanced Materials, 1999Co-Authors: Patrick Schmidtwinkel, Bradley F. Chmelka, Peidong Yang, David I Margolese, Galen D. StuckyAbstract:The acid-catalyzed synthesis of highly ordered mesostructured materials has led to a variety of twoand three-dimensional periodic symmetries, and has proven to be an effective route for the generation of fibers, spheres, thin films, and other monolithic forms of mesoporous materials. Zhao et al. recently used non-ionic poly(alkylene oxide) block copolymers, under acidic conditions, to prepare well-ordered, hexagonal mesoporous silica, denoted SBA-15, featuring uniform and adjustable large pore sizes combined with thick hydrothermally stable walls. The catalytic effect of fluoride in the synthesis of mesoporous silica at neutral to basic pH has been described by Voegtlin et al. Fluoride has been successfully used to extend the pH range over which anionic silica precursors can be utilized to create organized periodic structures; it has been used to diminish framework defects in zeolites, and to improve the organization in MCM-41 molecular sieves and MSU-X materials. However, to the best of our knowledge, no studies have been reported on the role of fluoride on cationic silica species in the aqueous acid-synthesis of ordered porous silica. In this communication, we describe the Hierarchical Ordering effects induced by small amounts of fluoride added during the synthesis of SBA-15-type mesoporous silica under acidic aqueous conditions. The non-ionic poly(ethylene oxide)-b-poly(propylene oxide)-b-poly(ethylene oxide) triblock copolymer EO20PO70EO20 (Pluronic P123) has been employed as the structure-directing agent. At low pH, remarkably well-ordered, hydrothermally stable, large hexagonal mesoporous silica rods with uniform channels extending over micrometer-sized length scales, and with few defects, have been synthesized. The fluoride-induced enhancement of order has enabled the preparation of SBA-15 materials at moderate acidity (~ pH 2.5±3) without compromising the long-range hexagonal symmetry. The mesoporous silicas possess narrow pore-size distributions, hydrothermally stable frameworks, large surface areas, and pore volumes of up to 0.92 cm/g. This work has been motivated by our interest in i) the patterning of mesoporous materials ranging from mesoscopic to macroscopic length scales while retaining molecular-level structural control and ii) understanding the underlying mechanism for the acid-catalyzed mesoporous silica synthesis. Addition of small amounts of fluoride (F:Si molar ratios of 0.008 and 0.03; fluoride source: NH4F or (NH4)2SiF6) during the aqueous acidic SBA-15-type silica synthesis induces substantial Ordering that is manifested on different length scales: both the mesoscopic structure and the macroscopic morphology of the mesoporous silicas are significantly improved. Scanning electron microscopy (SEM) has revealed that small amounts of fluoride bring about the formation of large mesoporous silica rods (Fig. 1a) when pre-
Aidong Zhang - One of the best experts on this subject based on the ideXlab platform.
-
Identification of functional hubs and modules by converting interactome networks into Hierarchical Ordering of proteins.
BMC bioinformatics, 2010Co-Authors: Aidong ZhangAbstract:Protein-protein interactions play a key role in biological processes of proteins within a cell. Recent high-throughput techniques have generated protein-protein interaction data in a genome-scale. A wide range of computational approaches have been applied to interactome network analysis for uncovering functional organizations and pathways. However, they have been challenged because of complex connectivity. It has been investigated that protein interaction networks are typically characterized by intrinsic topological features: high modularity and hub-oriented structure. Elucidating the structural roles of modules and hubs is a critical step in complex interactome network analysis. We propose a novel approach to convert the complex structure of an interactome network into Hierarchical Ordering of proteins. This algorithm measures functional similarity between proteins based on the path strength model, and reveals a hub-oriented tree structure hidden in the complex network. We score hub confidence and identify functional modules in the tree structure of proteins, retrieved by our algorithm. Our experimental results in the yeast protein interactome network demonstrate that the selected hubs are essential proteins for performing functions. In network topology, they have a role in bridging different functional modules. Furthermore, our approach has high accuracy in identifying functional modules Hierarchically distributed. Decomposing, converting, and synthesizing complex interaction networks are fundamental tasks for modeling their structural behaviors. In this study, we systematically analyzed complex interactome network structures for retrieving functional information. Unlike previous Hierarchical clustering methods, this approach dynamically explores the Hierarchical structure of proteins in a global view. It is well-applicable to the interactome networks in high-level organisms because of its efficiency and scalability.
-
Identification of functional hubs and modules by converting interactome networks into Hierarchical Ordering of proteins
BMC Bioinformatics, 2010Co-Authors: Aidong ZhangAbstract:Abstract Background Protein-protein interactions play a key role in biological processes of proteins within a cell. Recent high-throughput techniques have generated protein-protein interaction data in a genome-scale. A wide range of computational approaches have been applied to interactome network analysis for uncovering functional organizations and pathways. However, they have been challenged because ofcomplex connectivity. It has been investigated that protein interaction networks are typically characterized by intrinsic topological features: high modularity and hub-oriented structure. Elucidating the structural roles of modules and hubs is a critical step in complex interactome network analysis. Results We propose a novel approach to convert the complex structure of an interactome network into Hierarchical Ordering of proteins. This algorithm measures functional similarity between proteins based on the path strength model, and reveals a hub-oriented tree structure hidden in the complex network. We score hub confidence and identify functional modules in the tree structure of proteins, retrieved by our algorithm. Our experimental results in the yeast protein interactome network demonstrate that the selected hubs are essential proteins for performing functions. In network topology, they have a role in bridging different functional modules. Furthermore, our approach has high accuracy in identifying functional modules Hierarchically distributed. Conclusions Decomposing, converting, and synthesizing complex interaction networks are fundamental tasks for modeling their structural behaviors. In this study, we systematically analyzed complex interactome network structures for retrievingfunctional information. Unlike previous Hierarchical clustering methods, this approach dynamically explores the Hierarchical structure of proteins in a global view. It is well-applicable to the interactome networks in high-level organisms because of its efficiency and scalability.
-
identification of functional hubs and modules by converting interactome networks into Hierarchical Ordering of proteins
BMC Bioinformatics, 2010Co-Authors: Aidong ZhangAbstract:Background Protein-protein interactions play a key role in biological processes of proteins within a cell. Recent high-throughput techniques have generated protein-protein interaction data in a genome-scale. A wide range of computational approaches have been applied to interactome network analysis for uncovering functional organizations and pathways. However, they have been challenged because ofcomplex connectivity. It has been investigated that protein interaction networks are typically characterized by intrinsic topological features: high modularity and hub-oriented structure. Elucidating the structural roles of modules and hubs is a critical step in complex interactome network analysis.
