To see the other types of publications on this topic, follow the link: Skeleton-based programming.
Journal articles on the topic 'Skeleton-based programming'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 32 journal articles for your research on the topic 'Skeleton-based programming.'
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
Dastgeer, Usman, and Christoph Kessler. "Smart Containers and Skeleton Programming for GPU-Based Systems." International Journal of Parallel Programming 44, no. 3 (March 22, 2015): 506–30. http://dx.doi.org/10.1007/s10766-015-0357-6.
Full text
2
Aversa, R., B. Di Martino, N. Mazzocca, and S. Venticinque. "A Skeleton Based Programming Paradigm for Mobile Multi-Agents on Distributed Systems and Its Realization within the MAGDA Mobile Agents Platform." Mobile Information Systems 4, no. 2 (2008): 131–46. http://dx.doi.org/10.1155/2008/745406.
Full textAbstract:
Parallel programming effort can be reduced by using high level constructs such as algorithmic skeletons. Within the MAGDA toolset, supporting programming and execution of mobile agent based distributed applications, we provide a skeleton-based parallel programming environment, based on specialization of Algorithmic Skeleton Java interfaces and classes. Their implementation include mobile agent features for execution on heterogeneous systems, such as clusters of WSs and PCs, and support reliability and dynamic workload balancing. The user can thus develop a parallel, mobile agent based application by simply specialising a given set of classes and methods and using a set of added functionalities.
3
Coppola, Massimo, and Marco Vanneschi. "High-performance data mining with skeleton-based structured parallel programming." Parallel Computing 28, no. 5 (May 2002): 793–813. http://dx.doi.org/10.1016/s0167-8191(02)00095-9.
Full text
4
LOOGEN, RITA, YOLANDA ORTEGA-MALLÉN, and RICARDO PEÑA-MARÍ. "Parallel functional programming in Eden." Journal of Functional Programming 15, no. 3 (May 2005): 431–75. http://dx.doi.org/10.1017/s0956796805005526.
Full textAbstract:
Eden extends the non-strict functional language Haskell with constructs to control parallel evaluation of processes. Although processes are defined explicitly, communication and synchronisation issues are handled in a way transparent to the programmer. In order to offer effective support for parallel evaluation, Eden's coordination constructs override the inherently sequential demand-driven (lazy) evaluation strategy of its computation language Haskell. Eden is a general-purpose parallel functional language suitable for developing sophisticated skeletons – which simplify parallel programming immensely – as well as for exploiting more irregular parallelism that cannot easily be captured by a predefined skeleton. The paper gives a comprehensive description of Eden, its semantics, its skeleton-based programming methodology – which is applied in three case studies – its implementation and performance. Furthermore it points at many additional results that have been achieved in the context of the Eden project.
5
Aldinucci, Marco, and Marco Danelutto. "Skeleton-based parallel programming: Functional and parallel semantics in a single shot." Computer Languages, Systems & Structures 33, no. 3-4 (October 2007): 179–92. http://dx.doi.org/10.1016/j.cl.2006.07.004.
Full text
6
ALDINUCCI, MARCO. "${\mathsf{eskimo}}$: EXPERIMENTING WITH SKELETONS IN THE SHARED ADDRESS MODEL." Parallel Processing Letters 13, no. 03 (September 2003): 449–60. http://dx.doi.org/10.1142/s0129626403001410.
Full textAbstract:
We discuss the lack of expressivity in some skeleton-based parallel programming frameworks. The problem is further exacerbated when approaching irregular problems and dealing with dynamic data structures. Shared memory programming has been argued to have substantial ease of programming advantages for this class of problems. We present the [Formula: see text] library which represents an attempt to merge the two programming models by introducing skeletons in a shared memory framework.
7
BISCHOF, HOLGER, SERGEI GORLATCH, and EMANUEL KITZELMANN. "COST OPTIMALITY AND PREDICTABILITY OF PARALLEL PROGRAMMING WITH SKELETONS." Parallel Processing Letters 13, no. 04 (December 2003): 575–87. http://dx.doi.org/10.1142/s0129626403001525.
Full textAbstract:
Skeletons are reusable, parameterized program components with well-defined semantics and pre-packaged efficient parallel implementation. This paper develops a new, provably cost-optimal implementation of the DS (double-scan) skeleton for programming divide-and-conquer algorithms. Our implementation is based on a novel data structure called plist (pointed list); implementation's performance is estimated using an analytical model. We demonstrate the use of the DS skeleton for parallelizing a tridiagonal system solver and report experimental results for its MPI implementation on a Cray T3E and a Linux cluster: they confirm the performance improvement achieved by the cost-optimal implementation and demonstrate its good predictability by our performance model.
8
Miao, Lu, Shu Yuan Shang, and Chen Xi Cai. "Research on Image Binding Mechanism Based on Kinect Skeletal Tracking in Virtual Fitting System." Applied Mechanics and Materials 376 (August 2013): 437–40. http://dx.doi.org/10.4028/www.scientific.net/amm.376.437.
Full textAbstract:
On the basis of kinect skeleton track data module, proposing a skeleton track-bound algorithm, you can implement static clothing pictures real time interaction with dynamic characters, combined with WPF in Visual Studio 2010, the corresponding hardware and software resources, a set of accessible and language programming in c# virtual fitting system. Kinect human key joint points coordinates of the corresponding parameter, a corresponding operation, bound to the clothes in the image, makes the image size can be based on different size fitting character change, achieving the desired effect of fitting.
9
ZAVANELLA, ANDREA. "SKELETONS, BSP AND PERFORMANCE PORTABILITY." Parallel Processing Letters 11, no. 04 (December 2001): 393–407. http://dx.doi.org/10.1142/s0129626401000683.
Full textAbstract:
The Skeletal approach to parallel programming conjugates a high-level compositional style and efficiency. A second advantage of Skeletal programming is portability since implementation decisions are usually taken at compile time. The paper claims that an intermediate model embedding the main performance features of the target architecture facilitates performance portability across parallel architectures. This is motivated by describing the Skel-BSP framework which implements a skeleton system on top of a BSP computer. A prototype compiler based on a set of BSP templates is presented together with a set of performance models for each skeleton which allow a local optimization. The paper also introduces a global optimization strategy using a set of transformation rules. This local+global approach seems a viable solution to writing parallel software in machine-independent way (Writing Once and Compiling Everywhere).
10
Tang, Yun Long, Guo Lei Zheng, Bao Rui Du, and Shu Lin Chen. "Tool Path Generation for Top Planar Surface of Ribs in Aircraft Structural Parts." Advanced Materials Research 630 (December 2012): 315–20. http://dx.doi.org/10.4028/www.scientific.net/amr.630.315.
Full textAbstract:
In order to solve the problem regarding the rapid NC machining programming for top planar surface of ribs in aircraft structural parts, an approach based on skeleton extraction technique is presented here to generate tool path for top planar surface. Firstly, the constrained Delaunay triangulation is built to split the rib top planar surface into several sub areas and approximate skeleton branch of each sub area is extracted. Then based on these skeleton branches and process scheme, the set of machining cells of the rib top planar surface is constructed. Secondly, the problem on determining the sequence of machining cells is resolved by optimizing the machining path. Finally, the sequence of machining cells can be converted into the machining cells chain from which tool path can be calculated by CAM systems. Based on the experimental results of the comparison between the generalized pocket method and our approach, our approach is found to be more efficient in generating tool path for top planar surface of ribs.
11
Nunez-Iglesias, Juan, Adam J. Blanch, Oliver Looker, Matthew W. Dixon, and Leann Tilley. "A new Python library to analyse skeleton images confirms malaria parasite remodelling of the red blood cell membrane skeleton." PeerJ 6 (February 15, 2018): e4312. http://dx.doi.org/10.7717/peerj.4312.
Full textAbstract:
We present Skan (Skeleton analysis), a Python library for the analysis of the skeleton structures of objects. It was inspired by the “analyse skeletons” plugin for the Fiji image analysis software, but its extensive Application Programming Interface (API) allows users to examine and manipulate any intermediate data structures produced during the analysis. Further, its use of common Python data structures such as SciPy sparse matrices and pandas data frames opens the results to analysis within the extensive ecosystem of scientific libraries available in Python. We demonstrate the validity of Skan’s measurements by comparing its output to the established Analyze Skeletons Fiji plugin, and, with a new scanning electron microscopy (SEM)-based method, we confirm that the malaria parasite Plasmodium falciparum remodels the host red blood cell cytoskeleton, increasing the average distance between spectrin-actin junctions.
12
Liu, Lei, Dongqing Liu, Shuai Lü, and Peng Zhang. "An Abstract Description Method of Map-Reduce-Merge Using Haskell." Mathematical Problems in Engineering 2013 (2013): 1–12. http://dx.doi.org/10.1155/2013/147593.
Full textAbstract:
Map-Reduce-Merge is an improved parallel programming model based on Map-Reduce in cloud computing environment. Through the new Merge module, Map-Reduce-Merge can support processing multiple related heterogeneous datasets more efficiently. In order to demonstrate the validity and effectiveness of this new model, we present a rigorous description for Map-Reduce-Merge model using Haskell. Firstly, we describe the basic program skeleton of Map-Reduce-Merge programming model. Secondly, an abstract description for the Merge module is presented by analyzing the structure and function of the Merge module with Haskell as the description tool. Thirdly, we evaluate the Map-Reduce-Merge model on the basis of our description. We capture the functional characteristics of the Map-Reduce-Merge model by our abstract description, which can provide theoretical basis for designing more efficient parallel programming model to process join operation.
13
Yaikhom, Gagarine. "MESSAGE PASSING WITHOUT MEMORY COPY." Parallel Processing Letters 18, no. 01 (March 2008): 87–100. http://dx.doi.org/10.1142/s0129626408003247.
Full textAbstract:
We consider here reduction of send latencies for send-and-forget type communications, where senders do not reuse data that have already been sent. We introduce a commit based message sending approach, and describe the corresponding application programming interfaces. These interfaces allow applications to take advantage of message buffering, such as overlapping of computations and communications, while avoiding performance degradation due to intermediate memory copy. The approach works by allowing applications to safely access the implementation buffer through the provided interfaces. Experimental results show that the new approach is effective, and reduces the interface latency significantly compared to related approaches. Since send-and-forget type communications are often observed in skeletal programming, we demonstrate the approach by implementing a pipeline algorithmic skeleton.
14
AHN, JOONSEON, and TAISOOK HAN. "AN ANALYTICAL METHOD FOR PARALLELIZATION OF RECURSIVE FUNCTIONS." Parallel Processing Letters 10, no. 01 (March 2000): 87–98. http://dx.doi.org/10.1142/s012962640000010x.
Full textAbstract:
Programming with parallel skeletons is an attractive framework because it encourages programmers to develop efficient and portable parallel programs. However, extracting parallelism from sequential specifications and constructing efficient parallel programs using the skeletons are still difficult tasks. In this paper, we propose an analytical approach to transforming recursive functions on general recursive data structures into compositions of parallel skeletons. Using static slicing, we have defined a classification of subexpressions based on their data-parallelism. Then, skeleton-based parallel programs are generated from the classification. To extend the scope of parallelization, we have adopted more general parallel skeletons which do not require the associativity of argument functions. In this way, our analytical method can parallelize recursive functions with complex data flows.
15
AHN, JOONSEON, and TAISOOK HAN. "AN ANALYTICAL METHOD FOR PARALLELIZATION OF RECURSIVE FUNCTIONS." Parallel Processing Letters 10, no. 04 (December 2000): 359–70. http://dx.doi.org/10.1142/s0129626400000330.
Full textAbstract:
Programming with parallel skeletons is an attractive framework because it encourages programmers to develop efficient and portable parallel programs. However, extracting parallelism from sequential specifications and constructing efficient parallel programs using the skeletons are still difficult tasks. In this paper, we propose an analytical approach to transforming recursive functions on general recursive data structures into compositions of parallel skeletons. Using static slicing, we have defined a classification of subexpressions based on their data-parallelism. Then, skeleton-based parallel programs are generated from the classification. To extend the scope of parallelization, we have adopted more general parallel skeletons which do not require the associativity of argument functions. In this way, our analytical method can parallelize recursive functions with complex data flows.
16
Соколинская, И. М., and Л. Б. Соколинский. "A scalable algorithm for solving non-stationary linear programming problems." Numerical Methods and Programming (Vychislitel'nye Metody i Programmirovanie), no. 4 (December 18, 2018): 540–50. http://dx.doi.org/10.26089/nummet.v19r448.
Full textAbstract:
Статья посвящена исследованию алгоритма NSLP для решения нестационарных задач линейного программирования сверхбольшой размерности, ориентированного на кластерные вычислительные системы. В основе анализа лежит модель параллельных вычислений BSF, основанная на моделях BSP и SPMD. Даются краткие описания алгоритма NSLP и модели BSF. Рассматривается реализация алгоритма NSLP в виде BSF-программы. На базе стоимостной метрики модели BSF выводится верхняя граница масштабируемости алгоритма NSLP и оценивается эффективность его параллелизации. Описывается реализация алгоритма NSLP на основе программного каркаса BSF на языке Си и приводятся результаты экспериментов, исследующих масштабируемость указанной реализации на модельной задаче линейного программирования. Делается сравнение результатов, полученных аналитическим и экспериментальным путем. This paper is devoted to the scalability study of an NSLP algorithm for solving non-stationary high-dimension linear programming problems on cluster computing systems. The analysis is based on the BSF model of parallel computations. The BSF model is a new parallel computation model designed on the basis of BSP and SPMD models. The brief descriptions of the NSLP algorithm and the BSF model are given. The NSLP algorithm implementation in the form of a BSF program is considered. On the basis of the BSF cost metric, the upper bound of the NSLP algorithm scalability is derived and its parallel efficiency is estimated. The NSLP algorithm implementation using BSF skeleton is described. The scalability estimates obtained analytically and experimentally are compared.
17
Vranic, Valentino. "Multi-paradigm design with feature modeling." Computer Science and Information Systems 2, no. 1 (2005): 79–102. http://dx.doi.org/10.2298/csis0501079v.
Full textAbstract:
In this article, a method for selecting paradigms, viewed as solution domain concepts, appropriate for given application domain concepts is proposed. In this method, denoted as multi-paradigm design with feature modeling, both application and solution domain are modeled using feature modeling. The selection of paradigms is performed in the process of feature modeling based transformational analysis as a paradigm instantiation over application domain concepts. The output of transformational analysis is a set of paradigm instances annotated with the information about the corresponding application domain concepts and features. According to these paradigm instances, the code skeleton is being designed. The approach is presented in conjunction with its specialization to AspectJ programming language. Transformational analysis performed according to the AspectJ paradigm model enables an early aspect identification.
18
Leisheng, Zhou, Chen Yinghao, Xia Jianping, Liu cheng, and Yang guangliang. "Research on Evolutionary Design Method of BIM Technology in Highway Reconstruction and Expansion Project." E3S Web of Conferences 165 (2020): 04006. http://dx.doi.org/10.1051/e3sconf/202016504006.
Full textAbstract:
BIM technology is widely used in expressway Construction projects. In the process of transforming two-dimensional design into three-dimensional design, there are still many problems that need to be solved urgently. Based on the Beijing-Shanghai highway reconstruction and expansion project, this paper proposes an evolutionary design method. Based on the application standard of project model technology, the method uses BIM model software, based on skeleton lines and templates, using EKL programming language to realize the structure size from coarse to fine, information from summary to detail, and progressive design method for component granularity from bottom to high. At the same time, a three-dimensional design method for automatically generating road centerlines is proposed. The results show that the evolutionary design method is in line with the current project habits, matching the existing design concepts, and can efficiently complete the design work at different stages, effectively avoiding a lot of repetitive work.
19
Li, Guoqiang, and Amir Shojaei. "A viscoplastic theory of shape memory polymer fibres with application to self-healing materials." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 468, no. 2144 (April 11, 2012): 2319–46. http://dx.doi.org/10.1098/rspa.2011.0628.
Full textAbstract:
The difficulty in healing structural damage is that most existing schemes need external help to bring the fractured surfaces in contact before healing can occur. To facilitate the existing schemes to heal macroscopic cracks, we envision that the cracked surfaces can be brought in contact through constrained shape recovery of a shape memory polymer (SMP) fibre-reinforced grid skeleton that is embedded in thermoset polymer matrix, similar to stitch a cut in the human skin by suture. In this study, we show that polyurethane SMP fibres can be hardened through cyclic cold-drawing programming, which makes them suitable for reinforcement and healing in thermoset polymer composites. We characterized the microstructure of the SMP fibres, which provides fundamental understanding of the effect of programming on the degree of crystallinity and molecular orientation. Then, a micromechanical multiscale viscoplastic theory is developed to predict the thermomechanical behaviours of the SMP fibres, including the cyclic hardening and stress recovery responses. The proposed theory takes into account the stress-induced crystallization process and the evolution of the morphological texture based on the applied stresses. The cyclic loading and the thermomechanical responses of the SMP fibres confirm the capabilities of the proposed model in capturing these phenomena.
20
Volodin, V. "Optimization design of elastomeric locks." Transactions of the Krylov State Research Centre S-I, no. 2 (December 28, 2020): 220–23. http://dx.doi.org/10.24937/2542-2324-2020-2-s-i-220-223.
Full textAbstract:
This paper discusses the development of small boats made of polymeric composites in combination with metal skeleton based on detachable elastic connections. Lock material was polyethylene with hyperelastic properties of an elastomer. Static calculation is performed as per the finite-element method in plane formulation taking into account contact, geometric and physical non-linearity, as well as implementing a step-wise procedure. Design calculation is performed as per the research method approximating the sub-task (quadratic programming). The paper presents calculations for the process of inserting/extracting a rigid bar with round free flange to/from the lock, with determination of maximum responses, strains and stresses of the insert. Variation of geometric parameters yielded a design variant with minimum load on the insert and the same strength properties as the initial design. The study also yielded the analytical design methodology for elastic detachable connections that combines the solutions to non-linear contact problem and the optimization problem.
21
Li, Xinyu, Xiaoguang Gao, and Chenfeng Wang. "A Novel BN Learning Algorithm Based on Block Learning Strategy." Sensors 20, no. 21 (November 7, 2020): 6357. http://dx.doi.org/10.3390/s20216357.
Full textAbstract:
Learning accurate Bayesian Network (BN) structures of high-dimensional and sparse data is difficult because of high computation complexity. To learn the accurate structure for high-dimensional and sparse data faster, this paper adopts a divide and conquer strategy and proposes a block learning algorithm with a mutual information based K-means algorithm (BLMKM algorithm). This method utilizes an improved K-means algorithm to block the nodes in BN and a maximum minimum parents and children (MMPC) algorithm to obtain the whole skeleton of BN and find possible graph structures based on separated blocks. Then, a pruned dynamic programming algorithm is performed sequentially for all possible graph structures to get possible BNs and find the best BN by scoring function. Experiments show that for high-dimensional and sparse data, the BLMKM algorithm can achieve the same accuracy in a reasonable time compared with non-blocking classical learning algorithms. Compared to the existing block learning algorithms, the BLMKM algorithm has a time advantage on the basis of ensuring accuracy. The analysis of the real radar effect mechanism dataset proves that BLMKM algorithm can quickly establish a global and accurate causality model to find the cause of interference, predict the detecting result, and guide the parameters optimization. BLMKM algorithm is efficient for BN learning and has practical application value.
22
Wang, Yiqiu, Shangdi Yu, Laxman Dhulipala, Yan Gu, and Julian Shun. "GeoGraph." ACM SIGOPS Operating Systems Review 55, no. 1 (June 2, 2021): 38–46. http://dx.doi.org/10.1145/3469379.3469384.
Full textAbstract:
In many applications of graph processing, the input data is often generated from an underlying geometric point data set. However, existing high-performance graph processing frameworks assume that the input data is given as a graph. Therefore, to use these frameworks, the user must write or use external programs based on computational geometry algorithms to convert their point data set to a graph, which requires more programming effort and can also lead to performance degradation. In this paper, we present our ongoing work on the Geo- Graph framework for shared-memory multicore machines, which seamlessly supports routines for parallel geometric graph construction and parallel graph processing within the same environment. GeoGraph supports graph construction based on k-nearest neighbors, Delaunay triangulation, and b-skeleton graphs. It can then pass these generated graphs to over 25 graph algorithms. GeoGraph contains highperformance parallel primitives and algorithms implemented in C++, and includes a Python interface. We present four examples of using GeoGraph, and some experimental results showing good parallel speedups and improvements over the Higra library. We conclude with a vision of future directions for research in bridging graph and geometric data processing.
23
Wang, Zhaohua, Chenglong Yang, Xiaopeng Xu, Dezhuang Song, and Fenghe Wu. "Layout Design of Stiffened Plates for Large-Scale Box Structure under Moving Loads Based on Topology Optimization." Mathematical Problems in Engineering 2020 (November 10, 2020): 1–11. http://dx.doi.org/10.1155/2020/8843657.
Full textAbstract:
As the main load-bearing structure of heavy machine tools, cranes, and other high-end equipment, the large-scale box structures usually bear moving loads, and the results of direct topology optimization usually have some problems: the load transfer skeleton is difficult to identify and all working conditions are difficult to consider comprehensively. In this paper, a layout design method of stiffened plates for the large-scale box structures under moving loads based on multiworking-condition topology optimization is proposed. Based on the equivalent principle of force, the box structures are simplified into the main bending functional section, main torsional functional section, and auxiliary functional section by the magnitude of loads and moments, which can reduce the structural dimension and complexity in topology optimization. Then, the moving loads are simplified to some multiple position loads, and the comprehensive evaluation function is constructed by the compromise programming method. The mathematical model of multiworking-condition topology optimization is established to optimize the functional sections. Taking a crossbeam of superheavy turning and milling machining center as an example, optimization results show that the stiffness and strength of the crossbeam are increased by 17.39% and 19.9%, respectively, while the weight is reduced by 12.57%. It shows that the method proposed in this paper has better practicability and effectiveness for large-scale box structures.
24
Hemalatha, M., A. Vikneshraj, and N. Adithya Prasanna. "IDENTIFICATION AND IMPLEMENTATION OF DESIGN PATTERNS IN MOBILE BANKING." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 6, no. 2 (May 20, 2013): 343–50. http://dx.doi.org/10.24297/ijct.v6i2.3500.
Full textAbstract:
The aim of this paper is to develop a mobile banking system using design patters that provides customers with the facility to check their accounts and to do online transactions using mobile phones. There are various number of software design patterns that have been identified and used by software developers in various domains such as navigation systems, e-commerce, data mining, construction of operating systems, e-business, games and website designing and development purpose. In order to achieve our aim we are going to follow three steps. First step is the identification process, in this process we are going to study the various design patterns and the existing architecture of several mobile banking systems and will identify the design patterns based on the cross cutting concerns that occur in flow of the banking process. The second step is to implement the identified design patterns using the patterns skeleton code. We need to improve the reusability using object oriented programming. Finally we are going to implement the identified patterns and evaluate the patterns using already available methods such as SAAM, ATAM, ALAM (Architecture-Level Maintainability Analysis).
25
Ежова, Н. А., and Л. Б. Соколинский. "Scalability evaluation of iterative algorithms for supercomputer simulation of physical processes." Numerical Methods and Programming (Vychislitel'nye Metody i Programmirovanie), no. 4 (December 18, 2018): 416–30. http://dx.doi.org/10.26089/nummet.v19r437.
Full textAbstract:
Статья посвящена разработке методики исследования масштабируемости ресурсоемких итерационных алгоритмов, применяемых в моделировании сложных физических процессов на суперкомпьютерных системах. В основе предлагаемой методики лежит модель параллельных вычислений BSF (Bulk Synchronous Farm), позволяющая на ранней стадии разработки итерационного алгоритма определить границу его масштабируемости. Модель BSF предполагает представление алгоритма в виде операций над списками с использованием функций высшего порядка. При этом рассматривается два класса представлений: BSF-M (Map BSF) и BSF-MR (Map-Reduce BSF). Предлагаемая методика описывается на примере решения систем линейных алгебраических уравнений методом Якоби. Для метода Якоби строится два итерационных алгоритма: Jacobi-M на основе представления BSF-M и Jacobi-MR на основе представления BSF-MR. Для указанных алгоритмов с помощью стоимостных метрик модели BSF даются аналитические оценки для ускорения, эффективности распараллеливания и верхней границы масштабируемости для многопроцессорных вычислительных систем с распределенной памятью. Приводится информация о реализации этих алгоритмов на языке C++ с использованием программного шаблона BSF и библиотеки параллельного программирования MPI. Демонстрируются результаты масштабных вычислительных экспериментов, выполненных на кластерной вычислительной системе. На основе экспериментальных результатов дается анализ адекватности оценок, полученных аналитическим путем с помощью стоимостных метрик модели BSF. This paper is devoted to the development of a methodology for evaluating the scalability of compute-intensive iterative algorithms used for simulating complex physical processes on supercomputer systems. The proposed methodology is based on the BSF (Bulk Synchronous Farm) parallel computation model, which makes it possible to predict the upper scalability bound of an iterative algorithm in early stages of its design. The BSF model assumes the representation of the algorithm in the form of operations on lists using high-order functions. Two classes of representations are considered: BSF-M (Map BSF) and BSF-MR (Map-Reduce BSF). The proposed methodology is described by the example of solving a system of linear equations by the Jacobi method. For the Jacobi method, two iterative algorithms are constructed: Jacobi-M based on the BSF-M representation and Jacobi-MR based on the BSF-MR representation. Analytical estimations of the speedup, parallel efficiency and upper scalability bound are obtained for these algorithms using the BSF cost metrics on multi-processor computing systems with distributed memory. These algorithms are implemented on C++ language using the BSF program skeleton and MPI parallel programming library. The results of large-scale computational experiments performed on a cluster computing system are discussed. Based on the experimental results, an analysis of the adequacy of estimations obtained analytically using the BSF cost metric is made.
26
POLDNER, MICHAEL, and HERBERT KUCHEN. "ON IMPLEMENTING THE FARM SKELETON." Parallel Processing Letters 18, no. 01 (March 2008): 117–31. http://dx.doi.org/10.1142/s0129626408003260.
Full textAbstract:
Algorithmic skeletons intend to simplify parallel programming by providing a higher level of abstraction compared to the usual message passing. Task and data parallel skeletons can be distinguished. In the present paper, we will consider several approaches to implement one of the most classical task parallel skeletons, namely the farm, and compare them w.r.t. scalability, overhead, potential bottlenecks, and load balancing. We will also investigate several communication modes for the implementation of skeletons. Based on experimental results, the advantages and disadvantages of the different approaches are shown. Moreover, we will show how to terminate the system of processes properly.
27
Nyga, Elżbieta Małgorzata. "Wybrane aktywizujące metody nauczania w pracy z uczniem na przykładzie lekcji podstaw przedsiębiorczości." Przedsiębiorczość - Edukacja 2 (January 1, 2006): 290–303. http://dx.doi.org/10.24917/20833296.2.32.
Full textAbstract:
The subject of entrepreneurship needs an affective attitude of a teacher who: - besides he or she has got great knowledge about the subject he/she is at the same time careful about good and achievements of his or her students, - he or she has got knowledge about the teaching - learning process, - he or she knows different methods and ways of working. This kind of the teacher is a reflective and experienced person. He knows not only „what?” should be taught but also „how?” and „why?”.This teacher accepts behaviours that are described by Schoen, and he aims at the professional perfection. He thinks teaching of Entrepreneurship is a permanent process which is connected with him and his students. During every stage of learning process, teacher plays the roles: an organizer of a teaching process, a tutor, a carer, and an adviser who helps students to find new ways of a personal development. /diagram 1/ The teacher has to assume the teaching aims which come up to requirements of educational and examination standards. It is explained in a the diagram 2. The article does not deal with teaching in a comprehensive way. It is only a focus on methods and techniques of work with a student while using a script „Etyka i korupcja w biznesie” (Ethics and Corruption in Business). The methods and techniques are based on NLP- neuro-linguistic programming of student’s work. It is based on teaching by experience that is D. Kolb’s cycle. You will understand better both issues if you look at diagram 3 and 4. The most important for understanding the essence of the teaching by experience is acquainting readers with teacher, s and learner, s duties (diagram 5 and 6). On the next pages of the article there are some practical hints about using active student methods: brainstorming, map of thoughts, importance hierarchy triangle, fish skeleton, panel discussion. If you illustrate and schematically show the teacher above methods it will be easier for him to select them with a syllabus and lesson organization. At the end of the article there is an outline of a two-hour lesson. During the lesson, students will be able to acquire skills of distinction some different basic ideas and ethical and unethical behaviours in business. Learners will know laws and institutions that protect a society from corruption and corrupting. The outline shows not only the order of the lesson, but describes in details the teacher, s and students, behaviours. For every operation we weed specified time. It suggests the sources of information that can be useful while we are executing the syllabus during the lesson. There are presumable learner, s achievements after the lesson. There is a game Bingo titled „Are You Contaminated by Corruption?” in the enclosure.
28
Laney, Samuel R. "A General-Purpose Microcontroller-Based Framework for Integrating Oceanographic Sensors, Instruments, and Peripherals." Journal of Atmospheric and Oceanic Technology 34, no. 2 (February 2017): 415–27. http://dx.doi.org/10.1175/jtech-d-16-0069.1.
Full textAbstract:
AbstractSensors and instruments for basic oceanographic properties are becoming increasingly sophisticated, which both simplifies and complicates their use in field studies. This increased sophistication disproportionately affects smaller-scale observational efforts that are less likely to be well supported technically but which need to integrate instruments, sensors, and commonly needed peripheral devices in ways not envisioned by their manufacturers. A general-purpose hardware and software framework was developed around a widely used family of low-power microcontrollers to lessen the technical expertise and customization required to integrate sensors, instruments, and peripherals, and thus simplify such integration scenarios. Both the hardware and associated firmware development tools provide a range of features often required in such scenarios: serial data interfaces, analog inputs and outputs, logic lines and power-switching capability, nonvolatile storage of data and parameters for sampling or configuration, and serial communication interfaces to supervisory or telemetry systems. The microcontroller and additional components needed to implement this integration framework are small enough to encapsulate in standard cable splices, creating a small form factor “smart cable” that can be readily wired and programmed for a range of integration needs. An application programming library developed for this hardware provides skeleton code for functions commonly desired when integrating sensors, instruments, and peripherals. This minimizes the firmware programming expertise needed to apply this framework in many integration scenarios and thus streamlines the development of firmware for different field applications. Envisioned applications are in field programs where significant technical instrumentation expertise is unavailable or not cost effective.
29
Kaihoko, Yuhi, Phan Xuan Tan, and Eiji Kamioka. "Prevention of Unintended Appearance in Photos Based on Human Behavior Analysis." Information 11, no. 10 (October 2, 2020): 468. http://dx.doi.org/10.3390/info11100468.
Full textAbstract:
Nowadays, with smartphones, people can easily take photos, post photos to any social networks, and use the photos for various purposes. This leads to a social problem that unintended appearance in photos may threaten the facial privacy of photographed people. Some solutions to protect facial privacy in photos have already been proposed. However, most of them rely on different techniques to de-identify photos which can be done only by photographers, giving no choice to photographed person. To deal with that, we propose an approach that allows a photographed person to proactively detect whether someone is intentionally/unintentionally trying to take pictures of him. Thereby, he can have appropriate reaction to protect the facial privacy. In this approach, we assume that the photographed person uses a wearable camera to record the surrounding environment in real-time. The skeleton information of likely photographers who are captured in the monitoring video is then extracted and put into the calculation of dynamic programming score which is eventually compared with a threshold for recognition of photo-taking behavior. Experimental results demonstrate that by using the proposed approach, the photo-taking behavior is precisely recognized with high accuracy of 92.5%.
30
Ernstsson, August, Johan Ahlqvist, Stavroula Zouzoula, and Christoph Kessler. "SkePU 3: Portable High-Level Programming of Heterogeneous Systems and HPC Clusters." International Journal of Parallel Programming, May 19, 2021. http://dx.doi.org/10.1007/s10766-021-00704-3.
Full textAbstract:
AbstractWe present the third generation of the C++-based open-source skeleton programming framework SkePU. Its main new features include new skeletons, new data container types, support for returning multiple objects from skeleton instances and user functions, support for specifying alternative platform-specific user functions to exploit e.g. custom SIMD instructions, generalized scheduling variants for the multicore CPU backends, and a new cluster-backend targeting the custom MPI interface provided by the StarPU task-based runtime system. We have also revised the smart data containers’ memory consistency model for automatic data sharing between main and device memory. The new features are the result of a two-year co-design effort collecting feedback from HPC application partners in the EU H2020 project EXA2PRO, and target especially the HPC application domain and HPC platforms. We evaluate the performance effects of the new features on high-end multicore CPU and GPU systems and on HPC clusters.
31
Faure, Guilhem, Agnel Praveen Joseph, Pierrick Craveur, Tarun J. Narwani, Narayanaswamy Srinivasan, Jean-Christophe Gelly, Joseph Rebehmed, and Alexandre G. de Brevern. "iPBAvizu: a PyMOL plugin for an efficient 3D protein structure superimposition approach." Source Code for Biology and Medicine 14, no. 1 (November 2, 2019). http://dx.doi.org/10.1186/s13029-019-0075-3.
Full textAbstract:
Abstract Background Protein 3D structure is the support of its function. Comparison of 3D protein structures provides insight on their evolution and their functional specificities and can be done efficiently via protein structure superimposition analysis. Multiple approaches have been developed to perform such task and are often based on structural superimposition deduced from sequence alignment, which does not take into account structural features. Our methodology is based on the use of a Structural Alphabet (SA), i.e. a library of 3D local protein prototypes able to approximate protein backbone. The interest of a SA is to translate into 1D sequences into the 3D structures. Results We used Protein blocks (PB), a widely used SA consisting of 16 prototypes, each representing a conformation of the pentapeptide skeleton defined in terms of dihedral angles. Proteins are described using PB from which we have previously developed a sequence alignment procedure based on dynamic programming with a dedicated PB Substitution Matrix. We improved the procedure with a specific two-step search: (i) very similar regions are selected using very high weights and aligned, and (ii) the alignment is completed (if possible) with less stringent parameters. Our approach, iPBA, has shown to perform better than other available tools in benchmark tests. To facilitate the usage of iPBA, we designed and implemented iPBAvizu, a plugin for PyMOL that allows users to run iPBA in an easy way and analyse protein superimpositions. Conclusions iPBAvizu is an implementation of iPBA within the well-known and widely used PyMOL software. iPBAvizu enables to generate iPBA alignments, create and interactively explore structural superimposition, and assess the quality of the protein alignments.
32
Greger, Harald. "Comparative phytochemistry of flavaglines (= rocaglamides), a group of highly bioactive flavolignans from Aglaia species (Meliaceae)." Phytochemistry Reviews, June 4, 2021. http://dx.doi.org/10.1007/s11101-021-09761-5.
Full textAbstract:
AbstractFlavaglines are formed by cycloaddition of a flavonoid nucleus with a cinnamic acid moiety representing a typical chemical character of the genus Aglaia of the family Meliaceae. Based on biosynthetic considerations 148 derivatives are grouped together into three skeletal types representing 77 cyclopenta[b]benzofurans, 61 cyclopenta[bc]benzopyrans, and 10 benzo[b]oxepines. Apart from different hydroxy, methoxy, and methylenedioxy groups of the aromatic rings, important structural variation is created by different substitutions and stereochemistries of the central cyclopentane ring. Putrescine-derived bisamides constitute important building blocks occurring as cyclic 2-aminopyrrolidines or in an open-chained form, and are involved in the formation of pyrimidinone flavaglines. Regarding the central role of cinnamic acid in the formation of the basic skeleton, rocagloic acid represents a biosynthetic precursor from which aglafoline- and rocaglamide-type cyclopentabenzofurans can be derived, while those of the rocaglaol-type are the result of decarboxylation. Broad-based comparison revealed characteristic substitution trends which contribute as chemical markers to natural delimitation and grouping of taxonomically problematic Aglaia species. A wide variety of biological activities ranges from insecticidal, antifungal, antiprotozoal, and anti-inflammatory properties, especially to pronounced anticancer and antiviral activities. The high insecticidal activity of flavaglines is comparable with that of the well-known natural insecticide azadirachtin. Comparative feeding experiments informed about structure–activity relationships and exhibited different substitutions of the cyclopentane ring essential for insecticidal activity. Parallel studies on the antiproliferative activity of flavaglines in various tumor cell lines revealed similar structural prerequisites that let expect corresponding molecular mechanisms. An important structural modification with very high cytotoxic potency was found in the benzofuran silvestrol characterized by an unusual dioxanyloxy subunit. It possessed comparable cytotoxicity to that of the natural anticancer compounds paclitaxel (Taxol®) and camptothecin without effecting normal cells. The primary effect was the inhibition of protein synthesis by binding to the translation initiation factor eIF4A, an ATP-dependent DEAD-box RNA helicase. Flavaglines were also shown to bind to prohibitins (PHB) responsible for regulation of important signaling pathways, and to inhibit the transcriptional factor HSF1 deeply involved in metabolic programming, survival, and proliferation of cancer cells. Flavaglines were shown to be not only promising anticancer agents but gained now also high expectations as agents against emerging RNA viruses like SARS-CoV-2. Targeting the helicase eIF4A with flavaglines was recently described as pan-viral strategy for minimizing the impact of future RNA virus pandemics.