Log in

Relevant bibliographies by topics / Loop tiling / Journal articles

To see the other types of publications on this topic, follow the link: Loop tiling.

Journal articles on the topic 'Loop tiling'

Author: Grafiati

Published: 4 June 2021

Last updated: 10 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Loop tiling.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Renganarayanan, Lakshminarayanan, Daegon Kim, Michelle Mills Strout, and Sanjay Rajopadhye. "Parameterized loop tiling." ACM Transactions on Programming Languages and Systems 34, no. 1 (2012): 1–41. http://dx.doi.org/10.1145/2160910.2160912.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Darte, Alain, Georges-André Silber, and Frédéric Vivien. "Combining Retiming and Scheduling Techniques for Loop Parallelization and Loop Tiling." Parallel Processing Letters 07, no. 04 (1997): 379–92. http://dx.doi.org/10.1142/s0129626497000383.

Full text

Abstract:

Tiling is a technique used for exploiting medium-grain parallelism in nested loops. It relies on a first step that detects sets of permutable nested loops. All algorithms developed so far consider the statements of the loop body as a single block, in other words, they are not able to take advantage of the structure of dependences between different statements. In this paper, we overcame this limitation by showing how the structure of the reduced dependence graph can be taken into account for detecting more permutable loops. Our method combines graph retiming techniques and graph scheduling techniques. It can be viewed as an extension of Wolf and Lam's algorithm to the case of loops with multiple statements. Loan independent dependences play a particular role in our study, and we show how the way we handle them can be useful for fine-grain loop parallelization as well.

APA, Harvard, Vancouver, ISO, and other styles

3

Xue, Jingling. "On Tiling as a Loop Transformation." Parallel Processing Letters 07, no. 04 (1997): 409–24. http://dx.doi.org/10.1142/s0129626497000401.

Full text

Abstract:

This paper is a follow-up Irigoin and Triolet's earlier work and our recent work on tiling. In this paper, tiling is discussed in terms of its effects on the dependences between tiles, the dependences within a tile and the required dependence test for legality. A necessary and sufficient condition is given for enforcing the data dependences of the program, while Irigion and Triolet's atomic tile constraint is only sufficient. A condition is identified under which both Irigoin and Triolet's and our constraints are equivalent. The results of this paper are discussed in terms of their impact on dependence abstractions suitable for legality test and on tiling to optimise a certain given goal.

APA, Harvard, Vancouver, ISO, and other styles

4

Bielecki, Włodzimierz, and Marek Pałkowski. "Tiling arbitrarily nested loops by means of the transitive." International Journal of Applied Mathematics and Computer Science 26, no. 4 (2016): 919–39. http://dx.doi.org/10.1515/amcs-2016-0065.

Full text

Abstract:

Abstract A novel approach to generation of tiled code for arbitrarily nested loops is presented. It is derived via a combination of the polyhedral and iteration space slicing frameworks. Instead of program transformations represented by a set of affine functions, one for each statement, it uses the transitive closure of a loop nest dependence graph to carry out corrections of original rectangular tiles so that all dependences of the original loop nest are preserved under the lexicographic order of target tiles. Parallel tiled code can be generated on the basis of valid serial tiled code by means of applying affine transformations or transitive closure using on input an inter-tile dependence graph whose vertices are represented by target tiles while edges connect dependent target tiles. We demonstrate how a relation describing such a graph can be formed. The main merit of the presented approach in comparison with the well-known ones is that it does not require full permutability of loops to generate both serial and parallel tiled codes; this increases the scope of loop nests to be tiled.

APA, Harvard, Vancouver, ISO, and other styles

5

Parsa, Saeed, and Shahriar Lotfi. "A New Genetic Algorithm for Loop Tiling." Journal of Supercomputing 37, no. 3 (2006): 249–69. http://dx.doi.org/10.1007/s11227-006-6367-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Shao, Zhongxi, Shilei Wu, Jinguo Wu, and Hongya Fu. "A novel 5-DOF high-precision compliant parallel mechanism for large-aperture grating tiling." Mechanical Sciences 8, no. 2 (2017): 349–58. http://dx.doi.org/10.5194/ms-8-349-2017.

Full text

Abstract:

Abstract. In combination with the advantages of parallel mechanisms and compliant mechanisms, a 5-DOF compliant parallel mechanism is designed to meet the requirements, such as large stroke, large load capacity, high precision and high stability, for a large-aperture grating tiling device. The structure and characteristics of the 5-DOF compliant parallel mechanism are presented. The kinematics of the mechanism are derived based on a pseudo-rigid-body model as well. To increase the tiling position retention stability of the mechanism, a closed-loop control system with capacitive position sensors, which are employed to provide feedback signals, is realized. A position and orientation monitoring algorithm and a single neuron adaptive full closed-loop control algorithm are proposed. Performance testing is implemented to verify the accuracy and the tiling position retention stability of the grating tiling device. The experimental results indicate that the tiling accuracy reaches 0.2 µrad per step and 20 nm per step, and the tiling position retention stability can achieve 1.2 µrad per 30 min and 35 nm per 30 min in the rotational direction and the translational direction, respectively.

APA, Harvard, Vancouver, ISO, and other styles

7

LEOPOLD, CLAUDIA. "CACHE MISS ANALYSIS OF 2D STENCIL CODES WITH TILED TIME LOOP." International Journal of Foundations of Computer Science 14, no. 01 (2003): 39–58. http://dx.doi.org/10.1142/s0129054103001583.

Full text

Abstract:

Stencil codes such as the Jacobi, Gauß-Seidel, and red-black Gauß-Seidel kernels are among the most time-consuming routines in many scientific and engineering applications. The performance of these codes critically depends on an efficient usage of caches, and can be improved by tiling. Several tiling schemes have been suggested in the literature; this paper gives an overview and comparison. Then, in the main part, we prove a lower bound on the number of cold and capacity misses. Finally, we analyze a particular tiling scheme, and show that it is off the lower bound by a factor of at most ten. Our results show up limitations to the speedup that can be gained by future research.

APA, Harvard, Vancouver, ISO, and other styles

8

LIU, Xiaoxian, Rongcai ZHAO, Rui DING, and Yanbing LI. "Pipelining granularity optimization algorithm based on loop tiling." Journal of Computer Applications 33, no. 8 (2013): 2171–76. http://dx.doi.org/10.3724/sp.j.1087.2013.02171.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Di, Peng, Hui Wu, Jingling Xue, Feng Wang, and Canqun Yang. "Parallelizing SOR for GPGPUs using alternate loop tiling." Parallel Computing 38, no. 6-7 (2012): 310–28. http://dx.doi.org/10.1016/j.parco.2012.03.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Bielecki, Wlodzimierz, and Marek Palkowski. "Space-Time Loop Tiling for Dynamic Programming Codes." Electronics 10, no. 18 (2021): 2233. http://dx.doi.org/10.3390/electronics10182233.

Full text

Abstract:

We present a new space-time loop tiling approach and demonstrate its application for the generation of parallel tiled code of enhanced locality for three dynamic programming algorithms. The technique envisages that, for each loop nest statement, sub-spaces are first generated so that the intersection of them results in space tiles. Space tiles can be enumerated in lexicographical order or in parallel by using the wave-front technique. Then, within each space tile, time slices are formed, which are enumerated in lexicographical order. Target tiles are represented with multiple time slices within each space tile. We explain the basic idea of space-time loop tiling and then illustrate it by means of an example. Then, we present a formal algorithm and prove its correctness. The algorithm is implemented in the publicly available TRACO compiler. Experimental results demonstrate that parallel codes generated by means of the presented approach outperform closely related manually generated ones or those generated by using affine transformations. The main advantage of code generated by means of the presented approach is its enhanced locality due to splitting each larger space tile into multiple smaller tiles represented with time slices.

APA, Harvard, Vancouver, ISO, and other styles

11

Panda, P. R., H. Nakamura, N. D. Dutt, and A. Nicolau. "Augmenting loop tiling with data alignment for improved cache performance." IEEE Transactions on Computers 48, no. 2 (1999): 142–49. http://dx.doi.org/10.1109/12.752655.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Li, Fuyang, Keni Qiu, Mengying Zhao, et al. "Checkpointing-Aware Loop Tiling for Energy Harvesting Powered Nonvolatile Processors." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 38, no. 1 (2019): 15–28. http://dx.doi.org/10.1109/tcad.2018.2803624.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Kaplow, Wesley K., and Boleslaw K. Szymanski. "Compile-Time Cache Performance Prediction and Its Application to Tiling." Parallel Processing Letters 07, no. 04 (1997): 393–407. http://dx.doi.org/10.1142/s0129626497000395.

Full text

Abstract:

Tiling has been used by parallelizing compilers to define fine-grain parallel tasks and to optimize cache performance. In this paper we present a novel compile-time technique, called miss-driven cache simulation, for determining loop tile sizes that achieve the highest cache hit-rate. The widening disparity between a processor's peak instruction rate and main memory access time in modern computer systems makes this kind of optimization increasingly important for overall program efficiency. Our simulation technique generates only those references of a loop nest that may generate a cache memory miss and processes them on an architecturally accurate cache model at compile-time. Processing only a small portion of the memory reference trace of a program yields simulation speeds in the millions of memory references per second on workstations, with statistics of misses per reference and inter-reference interference counts gathered at the same time. These simulation speeds and statistics allow for the accurate analysis of the impact of cache optimizations at compile-time. We discuss the results of applying this method to guide loop tiling for such commonly used computational kernels as matrix multiplication and Jacobi iteration for various cache parameters.

APA, Harvard, Vancouver, ISO, and other styles

14

Baghdadi, Riyadh, Albert Cohen, Sven Verdoolaege, and Konrad Trifunović. "Improved loop tiling based on the removal of spurious false dependences." ACM Transactions on Architecture and Code Optimization 9, no. 4 (2013): 1–26. http://dx.doi.org/10.1145/2400682.2400711.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Seto, Kenshu. "A Survey on System-Level Design of Neural Network Accelerators." Journal of Integrated Circuits and Systems 16, no. 2 (2021): 1–10. http://dx.doi.org/10.29292/jics.v16i2.505.

Full text

Abstract:

In this paper, we present a brief survey on the system-level optimizations used for convolutional neural network (CNN) inference accelerators. For the nested loop of convolutional (CONV) layers, we discuss the effects of loop optimizations such as loop interchange, tiling, unrolling and fusion on CNN accelerators. We also explain memory optimizations that are effective with the loop optimizations. In addition, we discuss streaming architectures and single computation engine architectures that are commonly used in CNN accelerators. Optimizations for CNN models are briefly explained, followed by the recent trends and future directions of the CNN accelerator design.

APA, Harvard, Vancouver, ISO, and other styles

16

Reguly, Istvan Z., Gihan R. Mudalige, and Michael B. Giles. "Loop Tiling in Large-Scale Stencil Codes at Run-Time with OPS." IEEE Transactions on Parallel and Distributed Systems 29, no. 4 (2018): 873–86. http://dx.doi.org/10.1109/tpds.2017.2778161.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Vasilios, Kelefouras, Keramidas Georgios, and Voros Nikolaos. "Combining Software Cache Partitioning and Loop Tiling for Effective Shared Cache Management." ACM Transactions on Embedded Computing Systems 17, no. 3 (2018): 1–25. http://dx.doi.org/10.1145/3202663.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Koziris, N., A. Sotiropoulos, and G. Goumas. "A pipelined schedule to minimize completion time for loop tiling with computation and communication overlapping." Journal of Parallel and Distributed Computing 63, no. 11 (2003): 1138–51. http://dx.doi.org/10.1016/s0743-7315(03)00102-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Qiu, Keni, Qingan Li, Jingtong Hu, Weigong Zhang, and Chun Jason Xue. "Write Mode Aware Loop Tiling for High Performance Low Power Volatile PCM in Embedded Systems." IEEE Transactions on Computers 65, no. 7 (2016): 2313–24. http://dx.doi.org/10.1109/tc.2015.2479605.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

SHAO, Zhongxi. "Research on the Full Closed-loop Control Technology to the Stability of the Mechanical Grating Tiling." Journal of Mechanical Engineering 51, no. 10 (2015): 205. http://dx.doi.org/10.3901/jme.2015.10.205.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

KELLY, PAUL H. J., OLAV BECKMANN, TONY FIELD, and SCOTT B. BADEN. "THEMIS: COMPONENT DEPENDENCE METADATA IN ADAPTIVE PARALLEL APPLICATIONS." Parallel Processing Letters 11, no. 04 (2001): 455–70. http://dx.doi.org/10.1142/s0129626401000725.

Full text

Abstract:

This paper describes THEMIS, a programming model and run-time library being designed to support cross-component performance optimization through explicit manipulation of the computation's iteration space at run-time. Each component is augmented with "component dependence metadata", which characterizes the constraints on its execution order, data distribution and memory access order. We show how this supports dynamic adaptation of each component to exploit the available resources, the context in which its operands are generated, and results are used, and the evolution of the problem instance. Using a computational fluid dynamics visualization example as motivation, we show how component dependence metadata provides a framework in which a number of interesting optimizations become possible. Examples include data placement optimization, loop fusion, tiling, memoization, checkpointing and incrementalization.

APA, Harvard, Vancouver, ISO, and other styles

22

Rodríguez, Gabriel, Louis-Noël Pouchet, and Juan Touriño. "Representing Integer Sequences Using Piecewise-Affine Loops." Mathematics 9, no. 19 (2021): 2368. http://dx.doi.org/10.3390/math9192368.

Full text

Abstract:

A formal, high-level representation of programs is typically needed for static and dynamic analyses performed by compilers. However, the source code of target applications is not always available in an analyzable form, e.g., to protect intellectual property. To reason on such applications, it becomes necessary to build models from observations of its execution. This paper details an algebraic approach which, taking as input the trace of memory addresses accessed by a single memory reference, synthesizes an affine loop with a single perfectly nested reference that generates the original trace. This approach is extended to support the synthesis of unions of affine loops, useful for minimally modeling traces generated by automatic transformations of polyhedral programs, such as tiling. The resulting system is capable of processing hundreds of gigabytes of trace data in minutes, minimally reconstructing 100% of the static control parts in PolyBench/C applications and 99.99% in the Pluto-tiled versions of these benchmarks. As an application example of the trace modeling method, trace compression is explored. The affine representations built for the memory traces of PolyBench/C codes achieve compression factors of the order of 106 and 103 with respect to gzip for the original and tiled versions of the traces, respectively.

APA, Harvard, Vancouver, ISO, and other styles

23

Escudero, Juan García. "Randomness and Topological Invariants in Pentagonal Tiling Spaces." Discrete Dynamics in Nature and Society 2011 (2011): 1–23. http://dx.doi.org/10.1155/2011/946913.

Full text

Abstract:

We analyze substitution tiling spaces with fivefold symmetry. In the substitution process, the introduction of randomness can be done by means of two methods which may be combined: composition of inflation rules for a given prototile set and tile rearrangements. The configurational entropy of the random substitution process is computed in the case of prototile subdivision followed by tile rearrangement. When aperiodic tilings are studied from the point of view of dynamical systems, rather than treating a single one, a collection of them is considered. Tiling spaces are defined for deterministic substitutions, which can be seen as the set of tilings that locally look like translates of a given tiling. Čech cohomology groups are the simplest topological invariants of such spaces. The cohomologies of two deterministic pentagonal tiling spaces are studied.

APA, Harvard, Vancouver, ISO, and other styles

24

Doroshenko, А. Yu, O. G. Beketov, M. M. Bondarenko, and О. А. Yatsenko. "Automated design and parallelization of programs for heterogeneous platforms using algebra-algorithmic tools." PROBLEMS IN PROGRAMMING, no. 2-3 (September 2020): 103–14. http://dx.doi.org/10.15407/pp2020.02-03.103.

Full text

Abstract:

Methods and software tools for automated design and generation of OpenCL programs based on the algebra of algorithms are proposed. OpenCL is a framework for developing parallel software that executes across heterogeneous platforms consisting of general-purpose processors and/or hardware accelerators. The proposed approach consists in using high-level algebra-algorithmic specifications of programs represented in natural linguistic form and rewriting rules. The developed software tools provide the automated design of algorithm schemes based on a superposition of Glushkov algebra constructs that are considered as reusable components. The tools automatically generate code in a target programming language on the basis of the specifications. In most computing problems, a large part of hardware resources is utilized by computations inside loops, therefore the use of automatic parallelization of cyclic operators is most efficient for them. However, the existing automatic code parallelizing tools, such as Par4All, don’t account the limited amount of accelerator’s onboard memory space while real-life problems demand huge amounts of data to be processed. Thus, there is a need for the development of a parallelization technique embracing the cases of massive computational tasks involving big data. In the paper, a method and a software tool for semi-automatic parallelization of cyclic operators based on loop tiling and data serialization are developed. The parallelization technique uses rewriting rules system to transform programs. The framework for parallelization of loops for optimization of computations using graphics processing units allows semi-automatic parallelization of sequential programs. The approach is illustrated on an example of developing a parallel OpenCL image convolution program.

APA, Harvard, Vancouver, ISO, and other styles

25

Przybylski, Grzegorz K., Kathleen Dittmann, Piotr Grabarczyk, et al. "Molecular Characterization of a Novel Chromosomal Translocation t(12;14)(q23;q11.2) in T-Lymphoblastic Lymphoma Between the T Cell Receptor Delta Deleting Elements (TRDREC and TRAJ61) and the Hypothetical Gene C12orf42." Blood 114, no. 22 (2009): 4239. http://dx.doi.org/10.1182/blood.v114.22.4239.4239.

Full text

Abstract:

Abstract Abstract 4239 Chromosomal aberrations have diagnostic, prognostic and therapeutic consequences in haematological malignancies. By combining fine-tiling comparative genomic hybridization (FT-CGH) and ligation-mediated PCR (LM-PCR) we established a fast and robust approach to precisely characterize chromosomal breakpoints. Using this approach we characterized at the molecular level novel chromosomal translocation t(12;14)(q23;q11.2) in T-lymphoblastic lymphoma occurring during the deletional rearrangement of the T cell receptor delta gene (TRD). Normally, this transient rearrangement is a pivotal step in T cell differentiation towards the alpha/beta versus the gamma/delta lineage and generates the T cell receptor excision circles (TREC), which are quantitated to determine the proliferative history of T cells. We found that the rearrangement disrupted the hypothetical gene C12orf42 and brought the Achaete-scute complex homolog 1 (ASCL1) gene into proximity to the TRA enhancer, which is encodes a member of the basic helix-loop-helix (BHLH) family of transcription factors and is overexpressed in medullary thyroid cancer and small cell lung cancer. Disclosures: No relevant conflicts of interest to declare.

APA, Harvard, Vancouver, ISO, and other styles

26

Zhang, Zengming, Shuhao Zhao, Fei Hu, et al. "An LED-Driven AuNPs-PDMS Microfluidic Chip and Integrated Device for the Detection of Digital Loop-Mediated Isothermal DNA Amplification." Micromachines 11, no. 2 (2020): 177. http://dx.doi.org/10.3390/mi11020177.

Full text

Abstract:

The sensitive quantification of low-abundance nucleic acids holds importance for a range of clinical applications and biological studies. In this study, we describe a facile microfluidic chip for absolute DNA quantifications based on the digital loop-mediated isothermal amplification (digital LAMP) method. This microfluidic chip integrates a cross-flow channel for droplet generation with a micro-cavity for droplet tiling. DNA templates in the LAMP reagent were divided into ~20,000 water-in-oil droplets at the cross-flow channel. The droplets were then tiled in the micro-cavity for isothermal amplification and fluorescent detection. Different from the existing polydimethylsiloxane (PDMS) microfluidic chips, this study incorporates gold nanoparticles (AuNPs) into PDMS substrate through silica coating and dodecanol modification. The digital LAMP chip prepared by AuNPs-PDMS combines the benefits of the microstructure manufacturing performance of PDMS with the light-to-heat conversion advantages of AuNPs. Upon illumination with a near infrared (NIR) LED, the droplets were stably and efficiently heated by the AuNPs in PDMS. We further introduce an integrated device with a NIR heating unit and a fluorescent detection unit. The system could detect HBV (hepatitis B virus)-DNA at a concentration of 1 × 101 to 1 × 104 copies/μL. The LED-driven digital LAMP chip and the integrated device; therefore, demonstrate high accuracy and excellent performance for the absolute quantification of low-abundance nucleic acids, showing the advantages of integration, miniaturization, cost, and power consumption.

APA, Harvard, Vancouver, ISO, and other styles

27

Szustak, Lukasz, Krzysztof Rojek, Tomasz Olas, Lukasz Kuczynski, Kamil Halbiniak, and Pawel Gepner. "Adaptation of MPDATA Heterogeneous Stencil Computation to Intel Xeon Phi Coprocessor." Scientific Programming 2015 (2015): 1–14. http://dx.doi.org/10.1155/2015/642705.

Full text

Abstract:

The multidimensional positive definite advection transport algorithm (MPDATA) belongs to the group of nonoscillatory forward-in-time algorithms and performs a sequence of stencil computations. MPDATA is one of the major parts of the dynamic core of the EULAG geophysical model. In this work, we outline an approach to adaptation of the 3D MPDATA algorithm to the Intel MIC architecture. In order to utilize available computing resources, we propose the (3 + 1)D decomposition of MPDATA heterogeneous stencil computations. This approach is based on combination of the loop tiling and fusion techniques. It allows us to ease memory/communication bounds and better exploit the theoretical floating point efficiency of target computing platforms. An important method of improving the efficiency of the (3 + 1)D decomposition is partitioning of available cores/threads into work teams. It permits for reducing inter-cache communication overheads. This method also increases opportunities for the efficient distribution of MPDATA computation onto available resources of the Intel MIC architecture, as well as Intel CPUs. We discuss preliminary performance results obtained on two hybrid platforms, containing two CPUs and Intel Xeon Phi. The top-of-the-line Intel Xeon Phi 7120P gives the best performance results, and executes MPDATA almost 2 times faster than two Intel Xeon E5-2697v2 CPUs.

APA, Harvard, Vancouver, ISO, and other styles

28

Речкалов, Т. В., and М. Л. Цымблер. "A parallel data clustering algorithm for Intel MIC accelerators." Numerical Methods and Programming (Vychislitel'nye Metody i Programmirovanie), no. 2 (March 28, 2019): 104–15. http://dx.doi.org/10.26089/nummet.v20r211.

Full text

Abstract:

Алгоритм PAM (Partitioning Around Medoids) представляет собой разделительный алгоритм кластеризации, в котором в качестве центров кластеров выбираются только кластеризуемые объекты (медоиды). Кластеризация на основе техники медоидов применяется в широком спектре приложений: сегментирование медицинских и спутниковых изображений, анализ ДНК-микрочипов и текстов и др. На сегодня имеются параллельные реализации PAM для систем GPU и FPGA, но отсутствуют таковые для многоядерных ускорителей архитектуры Intel Many Integrated Core (MIC). В настоящей статье предлагается новый параллельный алгоритм кластеризации PhiPAM для ускорителей Intel MIC. Вычисления распараллеливаются с помощью технологии OpenMP. Алгоритм предполагает использование специализированной компоновки данных в памяти и техники тайлинга, позволяющих эффективно векторизовать вычисления на системах Intel MIC. Эксперименты, проведенные на реальных наборах данных, показали хорошую масштабируемость алгоритма. The PAM (Partitioning Around Medoids) is a partitioning clustering algorithm where each cluster is represented by an object from the input dataset (called a medoid). The medoid-based clustering is used in a wide range of applications: the segmentation of medical and satellite images, the analysis of DNA microarrays and texts, etc. Currently, there are parallel implementations of PAM for GPU and FPGA systems, but not for Intel Many Integrated Core (MIC) accelerators. In this paper, we propose a novel parallel PhiPAM clustering algorithm for Intel MIC systems. Computations are parallelized by the OpenMP technology. The algorithm exploits a sophisticated memory data layout and loop tiling technique, which allows one to efficiently vectorize computations with Intel MIC. Experiments performed on real data sets show a good scalability of the algorithm.

APA, Harvard, Vancouver, ISO, and other styles

29

Li, Zhiyuan, and Yonghong Song. "Automatic tiling of iterative stencil loops." ACM Transactions on Programming Languages and Systems 26, no. 6 (2004): 975–1028. http://dx.doi.org/10.1145/1034774.1034777.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Chen, Yeong-Sheng, Sheng-De Wang, and Chien-Min Wang. "Tiling Nested Loops into Maximal Rectangular Blocks." Journal of Parallel and Distributed Computing 35, no. 2 (1996): 123–32. http://dx.doi.org/10.1006/jpdc.1996.0075.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Xue, Jingling. "Communication-Minimal Tiling of Uniform Dependence Loops." Journal of Parallel and Distributed Computing 42, no. 1 (1997): 42–59. http://dx.doi.org/10.1006/jpdc.1997.1310.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Favreau, Jean-Marie, and Vincent Barra. "Tiling surfaces with cylinders using n-loops." Computers & Graphics 35, no. 1 (2011): 35–42. http://dx.doi.org/10.1016/j.cag.2010.11.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Wilson, Sarah M., Brian S. Schmutzler, Joel M. Brittain, et al. "Inhibition of Transmitter Release and Attenuation of Anti-retroviral-associated and Tibial Nerve Injury-related Painful Peripheral Neuropathy by Novel Synthetic Ca2+ Channel Peptides." Journal of Biological Chemistry 287, no. 42 (2012): 35065–77. http://dx.doi.org/10.1074/jbc.m112.378695.

Full text

Abstract:

N-type Ca2+ channels (CaV2.2) are a nidus for neurotransmitter release and nociceptive transmission. However, the use of CaV2.2 blockers in pain therapeutics is limited by side effects resulting from inhibition of the physiological functions of CaV2.2 within the CNS. We identified an anti-nociceptive peptide (Brittain, J. M., Duarte, D. B., Wilson, S. M., Zhu, W., Ballard, C., Johnson, P. L., Liu, N., Xiong, W., Ripsch, M. S., Wang, Y., Fehrenbacher, J. C., Fitz, S. D., Khanna, M., Park, C. K., Schmutzler, B. S., Cheon, B. M., Due, M. R., Brustovetsky, T., Ashpole, N. M., Hudmon, A., Meroueh, S. O., Hingtgen, C. M., Brustovetsky, N., Ji, R. R., Hurley, J. H., Jin, X., Shekhar, A., Xu, X. M., Oxford, G. S., Vasko, M. R., White, F. A., and Khanna, R. (2011) Suppression of inflammatory and neuropathic pain by uncoupling CRMP2 from the presynaptic Ca2+ channel complex. Nat. Med. 17, 822–829) derived from the axonal collapsin response mediator protein 2 (CRMP2), a protein known to bind and enhance CaV2.2 activity. Using a peptide tiling array, we identified novel peptides within the first intracellular loop (CaV2.2(388–402), “L1”) and the distal C terminus (CaV1.2(2014–2028) “Ct-dis”) that bound CRMP2. Microscale thermophoresis demonstrated micromolar and nanomolar binding affinities between recombinant CRMP2 and synthetic L1 and Ct-dis peptides, respectively. Co-immunoprecipitation experiments showed that CRMP2 association with CaV2.2 was inhibited by L1 and Ct-dis peptides. L1 and Ct-dis, rendered cell-penetrant by fusion with the protein transduction domain of the human immunodeficiency virus TAT protein, were tested in in vitro and in vivo experiments. Depolarization-induced calcium influx in dorsal root ganglion (DRG) neurons was inhibited by both peptides. Ct-dis, but not L1, peptide inhibited depolarization-stimulated release of the neuropeptide transmitter calcitonin gene-related peptide in mouse DRG neurons. Similar results were obtained in DRGs from mice with a heterozygous mutation of Nf1 linked to neurofibromatosis type 1. Ct-dis peptide, administered intraperitoneally, exhibited antinociception in a zalcitabine (2′-3′-dideoxycytidine) model of AIDS therapy-induced and tibial nerve injury-related peripheral neuropathy. This study suggests that CaV peptides, by perturbing interactions with the neuromodulator CRMP2, contribute to suppression of neuronal hypersensitivity and nociception.

APA, Harvard, Vancouver, ISO, and other styles

34

Parsa, Saeed, and Mohammad Hamzei. "Nested-Loops Tiling for Parallelization and Locality Optimization." Computing and Informatics 36, no. 3 (2017): 566–96. http://dx.doi.org/10.4149/cai_2017_3_566.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Tong, Jin Yu, Zi Wei Pan, Jia Han Bao, Xiang Rong Xu, and Tian Cheng Pan. "The Analysis of Initial Welding Defect and Structure Improvement of Converter Loop." Applied Mechanics and Materials 201-202 (October 2012): 692–96. http://dx.doi.org/10.4028/www.scientific.net/amm.201-202.692.

Full text

Abstract:

Aimed at the welding initial defect fatigue extension of 300t converter loop in a factory, the whole assembly finite-element (FE) model of converter loop with the welding initial defect is established. The converter loop FE model with different depth initial defect is computed by using 3D nonlinear finite element method at different tilting angles. And the stress intensity factor is extracted and analyzed under different working circumstances. The analysis results show that when the initial defect depth is greater than 11.715mm, the defect will result in fatigue crack extension at the complex alternating stress. To solve the cracking leakage problem of converter loop, the original welding manholes is replaced by the movable manhole. In the past over one year, the fatigue cracking and leaking phenomena did not occur in the converter loop, so the effect is obvious.

APA, Harvard, Vancouver, ISO, and other styles

36

Rinaldi, Simone, and D. G. Rogers. "Indecomposability: polyominoes and polyomino tilings." Mathematical Gazette 92, no. 524 (2008): 193–204. http://dx.doi.org/10.1017/s0025557200183020.

Full text

Abstract:

When we were preparing our earlier article [1], we thought to look back to see what else had appeared in the Gazette on the subject of polyominoes. A polyomino is a finite collection of cells in the square grid with connected interior - so it is insufficient that cells be connected only corner to corner. Some authors require polyominoes to have a simply connected interior, that is, to be without holes, as was appropriate, for example, in [1] for stack polyominoes. The classic text on polyominoes is Solomon Golomb's engaging book [2], first published in 1965, now supplemented at an even more accessible level by [3].

APA, Harvard, Vancouver, ISO, and other styles

37

Scott, H., and V. F. Fusco. "Electronic beam tilting using a single reactively loaded circular wire loop antenna." IEE Proceedings - Microwaves, Antennas and Propagation 149, no. 5 (2002): 271–74. http://dx.doi.org/10.1049/ip-map:20020580.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Di Francesco, Philippe, Paul Zinn-Justin, and Jean-Bernard Zuber. "Determinant formulae for some tiling problems and application to fully packed loops." Annales de l’institut Fourier 55, no. 6 (2005): 2025–50. http://dx.doi.org/10.5802/aif.2150.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Chen, Ying Jun, Yan Mei Li, Qing Hua Chen, and Wen Gang Wu. "Fabrication of the Open-Loop MEMS-Based Tilting Mirror Using the Compound Process." Applied Mechanics and Materials 529 (June 2014): 169–72. http://dx.doi.org/10.4028/www.scientific.net/amm.529.169.

Full text

Abstract:

In this paper, a kind of novel open-loop two-stage torsion-mirror optical actuators has been demonstrated. The mirrors are fabricated in SOI wafers, and exhibit good basic electromechanical characteristics. They provide an impetus to being brought into use as optical switches or attenuators, etc. for fiber communication applications.

APA, Harvard, Vancouver, ISO, and other styles

40

Kent, Stephen, and Jeremy Evans. "Hardware-in-loop Simulation of Railway Vehicles with Tilting and Active Suspension Systems." Vehicle System Dynamics 33, sup1 (1999): 453–63. http://dx.doi.org/10.1080/00423114.1999.12063103.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Shiou, Fang‐Jung, and Po‐Huai Chang. "Development of a closed‐loop micro‐/nano‐positioning stage with small tilting angles." Journal of the Chinese Institute of Engineers 32, no. 6 (2009): 755–63. http://dx.doi.org/10.1080/02533839.2009.9671559.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Xue, Jianyang, Linlin Ma, Xiaoyang Dong, Xin Zhang, and Xicheng Zhang. "Investigation on the behaviors of Tou–Kung sets in historic timber structures." Advances in Structural Engineering 23, no. 3 (2019): 485–96. http://dx.doi.org/10.1177/1369433219872439.

Full text

Abstract:

To investigate the structural performance of Tou–Kung, two 1/3.52-scaled models of Tou–Kung were designed and tested subjected to vertical loading and quasi-static loading. Also, the finite element models of intact Tou–Kung and tilting Tou–Kung were established. Based on the validation of experimental results and finite element models, numerical simulation analysis of the models was carried out to study the influence of tilting angle on the behaviors of Tou–Kung. It is shown that the failure modes of the models were the compressive fracture of Da-Tou under vertical load, the shear failure of the dowel at Da-Tou, and the slipping between Da-Tou and Pingban-Fang subjected to lateral cyclic loads. The relationship of vertical load and vertical displacement was obtained and analyzed, and the vertical initial stiffness and bearing capacity of the models descended with the increase in tilting angle. The hysteretic loops of the tilting models subjected to cyclic loads are asymmetrical in positive and negative loading, and the asymmetrical degrees of the curves are much significant with a larger tilting angle of the models. With the increase in tilting angle, the lateral stiffness and ultimate load increased in positive loading, and both of them decreased in negative loading due to the tilting of the models. Also, the equivalent viscous damping coefficient of the models decreases with a larger tilting angle of Tou–Kung.

APA, Harvard, Vancouver, ISO, and other styles

43

Ito, Atsushi, Philipp Oetinger, Ryosuke Tasaki, Oliver Sawodny, and Kazuhiko Terashima. "Visual Nonlinear Feedback Control of Liquid Level in Mold Sprue Cup by Cascade System with Flow Rate Control for Tilting-Ladle-Type Automatic Pouring System." Materials Science Forum 925 (June 2018): 483–90. http://dx.doi.org/10.4028/www.scientific.net/msf.925.483.

Full text

Abstract:

This paper presents the novel approach of liquid level control of mold sprue cup using camera information for tilting-ladle-type automatic pouring system in casting industry. A liquid level in mold sprue cup should be kept at high position to avoid inclusion of oxides and dusts during pouring process. A cascade control system with double feedback loop to enhance control response was proposed for the present level control: inner loop was the flowrate control system for pouring ladle, and outer loop was the level control one with camera measurement to detect the liquid level. The control part of flow rate was constructed based on the past study. The mathematical model of liquid behavior in a sprue cup of an inverted cone shape was built in this paper. The level controller was newly designed based on nonlinear control theory by exact linearization. The effectiveness of the proposed cascade system was verified by control simulations.

APA, Harvard, Vancouver, ISO, and other styles

44

Teh, Aik-Hong, Masatomo Makino, Takeshi Hoshino, et al. "Structure of the RsbX phosphatase involved in the general stress response ofBacillus subtilis." Acta Crystallographica Section D Biological Crystallography 71, no. 6 (2015): 1392–99. http://dx.doi.org/10.1107/s1399004715007166.

Full text

Abstract:

In the general stress response ofBacillus subtilis, which is governed by the sigma factor σB, stress signalling is relayed by a cascade of Rsb proteins that regulate σBactivity. RsbX, a PPM II phosphatase, halts the response by dephosphorylating the stressosome composed of RsbR and RsbS. The crystal structure of RsbX reveals a reorganization of the catalytic centre, with the second Mn2+ion uniquely coordinated by Gly47 O from the β4–α1 loop instead of a water molecule as in PPM I phosphatases. An extra helical turn of α1 tilts the loop towards the metal-binding site, and the β2–β3 loop swings outwards to accommodate this tilting. The residues critical for this defining feature of the PPM II phosphatases are highly conserved. Formation of the catalytic centre is metal-specific, as crystallization with Mg2+ions resulted in a shift of the β4–α1 loop that led to loss of the second ion. RsbX also lacks the flap subdomain characteristic of PPM I phosphatases. On the basis of a stressosome model, the activity of RsbX towards RsbR-P and RsbS-P may be influenced by the different accessibilities of their phosphorylation sites.

APA, Harvard, Vancouver, ISO, and other styles

45

Haraguchi, Kageyama, and Kaneko. "Study of Personal Mobility Vehicle (PMV) with Active Inward Tilting Mechanism on Obstacle Avoidance and Energy Efficiency." Applied Sciences 9, no. 22 (2019): 4737. http://dx.doi.org/10.3390/app9224737.

Full text

Abstract:

Traffic congestion and lack of parking spaces in urban areas etc. may lessen the original benefits of cars, and now new ultra-small mobility concepts called personal mobility vehicles (PMVs) are receiving attention. Among them, PMVs with an inward tilting mechanism in order to avoid overturning on turning, as in motorcycles, look realistic in new, innovative traffic systems. In this study, PMVs with an active inward tilting mechanism with three wheels, double front wheels and single rear wheel, were studied regarding front inner wheel lifting phenomena, capability of obstacle avoidance and energy balance of active tilting mechanism. Based on a comprehensive study of inner wheel lifting and obstacle avoidance, PMVs with a front wheel steering system as the most realistic specification were compared on capability of obstacle avoidance with passenger cars and motorcycles with those that have current market experience, and showed better capability. Although the energy consumption of an active inward tilting mechanism might be in conflict with the energy efficiency of small PMV concepts, the energy needed to tilt PMVs was very little compared with the general energy consumption of driving. It was clarified that the new PMV concepts with inward tilting mechanism have sufficient social acceptability from both mandatory points of safety and efficiency.

APA, Harvard, Vancouver, ISO, and other styles

46

Sawada, Daiyo. "Symmetry and Tessellations from Rotational Transformations on Transparencies." Arithmetic Teacher 33, no. 4 (1985): 12–13. http://dx.doi.org/10.5951/at.33.4.0012.

Full text

Abstract:

The title of this article may be a bit ostentatious, but it describes a simple yet rather dramatic procedure for producing symmetrical tessellated patterns. I feel that mathematics is all around us if we would only care to look. It is easy to remind students of mosaic tiling patterns, hexagonal or other interlocking paving patterns, or Escher's work. Recently I discovered that simple dot grids in a square (fig. I) or in a triangle (fig. 2) can produce tessellations (interlocking patterns that cover a surface).

APA, Harvard, Vancouver, ISO, and other styles

47

McGorry, Patrick, Debra Rickwood, Alessandra Radovini, Paul Denborough, Sophie Adams, and Amelia Callaghan. "Response to Looi et al. – Tilting at windmills: A giant quest." Australian & New Zealand Journal of Psychiatry 54, no. 7 (2020): 670–72. http://dx.doi.org/10.1177/0004867420925153.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Camporredondo, Barber, Legrand, and Muñoz. "A Kinematic Controller for Liquid Pouring between Vessels Modelled with Smoothed Particle Hydrodynamics." Applied Sciences 9, no. 23 (2019): 5007. http://dx.doi.org/10.3390/app9235007.

Full text

Abstract:

In robotics, the task of pouring liquids into vessels in non-structured or domestic spaces is an open field of study. A real time, fluid dynamic simulation, based on smoothed particle hydrodynamics (SPH), together with solid motion kinematics, allow for a closed loop control of pouring. In the first place, a control criterion related with the behavior of the liquid free surface is established to handle sloshing, especially in the initial phase of pouring to prevent liquid adhesion over the vessel rim. A 2-D, free surface SPH simulation is implemented on a graphic processing unit (GPU) to predict the liquid motion with real-time capability. The pouring vessel has a single degree of freedom of rotation, while the catching vessel has a single degree of freedom of translation, and the control loop handles the tilting angle of the pouring vessel. In this work, a two-stage pouring method is proposed, differentiating an initial phase where sloshing is particularly relevant, and a nearly constant outflow phase. For control purposes, the free outflow trajectory was simplified and modelled as a free falling solid with an initial velocity at the vessel crest, as calculated by the SPH simulation. As the first stage of pouring is more delicate, a novel slosh induction method (SIM) is proposed to overcome spilling issues during initial tilting in full filled vessels. Both robotic control and fluid modelling showed good results at multiples initial vessel filling heights.

APA, Harvard, Vancouver, ISO, and other styles

49

Muntifering, Brittany, Jianmin Qu, and Khalid Hattar. "MINIMAL VARIATION OF DEFECT STRUCTURE DUE TO THE ORDER OF ROOM TEMPERATURE HYDROGEN ISOTOPE IMPLANTATION AND SELF-ION IRRADIATION IN NICKEL." MRS Advances 1, no. 42 (2016): 2887–92. http://dx.doi.org/10.1557/adv.2016.396.

Full text

Abstract:

ABSTRACTThe formation and stability of radiation-induced defects in structural materials in reactor environments significantly effects their integrity and performance. Hydrogen, which may be present in significant quantities in future reactors, may play an important role in defect evolution. To characterize the effect of hydrogen on cascade damage evolution, in-situ TEM self-ion irradiation and deuterium implantation was performed, both sequentially and concurrently, on nickel. This paper presents preliminary results characterizing dislocation loop formation and evolution during room temperature deuterium implantation and self-ion irradiation and the consequence of the sequence of irradiation. Hydrogen isotope implantation at room temperature appears to have little or no effect on the final dislocation loop structures that result from self-ion irradiation, regardless of the sequence of irradiation. Tilting experiments emphasize the importance of precise two-beam conditions for characterizing defect size and structure.

APA, Harvard, Vancouver, ISO, and other styles

50

Wen, Jierong, та Andrew Hung. "Effects of C-Terminal Carboxylation on α-Conotoxin LsIA Interactions with Human α7 Nicotinic Acetylcholine Receptor: Molecular Simulation Studies". Marine Drugs 17, № 4 (2019): 206. http://dx.doi.org/10.3390/md17040206.

Full text

Abstract:

α-Conotoxins selectively bind to nicotinic acetylcholine receptors (nAChRs), which are therapeutic targets due to their important role in signaling transmission in excitable cells. A previous experimental study has demonstrated that carboxylation of the C-terminal of α-conotoxin LsIA reduces its potency to inhibit human α7 nAChR relative to naturally amidated LsIA. However, little is known about the contribution of conformational changes in the receptor and interactions, induced by C-terminal amidation/carboxylation of conotoxins, to selective binding to nAChRs, since most conotoxins and some disulfide-rich peptides from other conotoxin subfamilies possess a naturally amidated C-terminal. In this study, we employ homology modeling and molecular dynamics (MD) simulations to propose the determinants for differential interactions between amidated and carboxylated LsIAs with α7 nAChR. Our findings indicate an overall increased number of contacts favored by binding of amidated LsIA versus its carboxylated counterpart. Toxin-receptor pairwise interactions, which may play a role in enhancing the potency of the former, include ARG10-TRP77, LEU141 and CYS17-GLN79 via persistent hydrogen bonds and cation-π interactions, which are weakened in the carboxylated form due to a strong intramolecular salt-bridge formed by ARG10 and carboxylated C-terminus. The binding of amidated LsIA also induces enhanced movements in loop C and the juxtamembrane Cys-loop that are closely associated with receptor function. Additionally, the impacts of binding of LsIA on the overall structure and inter-subunit contacts were examined using inter-residue network analysis, suggesting a clockwise tilting of the α7 C and F loops upon binding to carboxylated LsIA, which is absent for amidated LsIA binding. The predicted molecular mechanism of LsIA binding to the α7 receptor may provide new insights into the important role of the C-terminal in the binding potency of conotoxins at neuronal nAChRs for pharmacological purposes.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!