Miracle-dz/UniFAR-FTUs huggingface dataset:
Exploiting locality in OpenMP task scheduling

Future multi- and many- core processors are likely to have tens of cores arranged in a tiled architecture where each tile will house a processing core and a bank of the shared last-level cache. The physical distribution of tiles on the processor die gives rise to a Distributed Shared Cache (DSC) architecture where cache access latencies are non-uniform and depend on the physical distance between core and cache bank. In order to maximize cache capacity and favor design simplicity, the address space on a tiled processor is likely to be divided and mapped either statically or dynamically on to the distributed last-level cache such that each cache bank homes certain cache blocks. Given this architecture, an efficient OpenMP 3.0 task scheduler can minimize miss latencies by scheduling tasks on tiles whichare physically closer to the cache banks which home task-relevant data. This master thesis work deals with the design and implementation of a locality-aware user-level runtime OpenMP 3.0 task scheduler for a simulated tiled multicore architecture. Guided by programmer hints, the scheduler extracts locality information pertaining to the data referenced by a task and schedules the task accordingly on the core closest to the L2 slice homing the largest amount of data. Initial results of performance comparison against a work-first randomized work-stealing cilk-like scheduler and a breadth-first randomized work-stealing scheduler have revealed problems with the locality-aware scheduler and have created ground for deeper exploration in the areas of programmer locality characterization and feedback-based extraction of locality information.
Multicore and GPU Programming: An Integrated Approach

Multicore and GPU Programming offers broad coverage of the key parallel computing skillsets: multicore CPU programming and manycore "massively parallel" computing. Using threads, OpenMP, MPI, and CUDA, it teaches the design and development of software capable of taking advantage of today? s computing platforms incorporating CPU and GPU hardware and explains how to transition from sequential programming to a parallel computing paradigm. Presenting material refined over more than a decade of teaching parallel computing, author Gerassimos Barlas minimizes the challenge with multiple examples, extensive case studies, and full source code. Using this book, you can develop programs that run over distributed memory machines using MPI, create multi-threaded applications with either libraries or directives, write optimized applications that balance the workload between available computing resources, and profile and debug programs targeting multicore machines. Comprehensive coverage of all major multicore programming tools, including threads, OpenMP, MPI, and CUDA Demonstrates parallel programming design patterns and examples of how different tools and paradigms can be integrated for superior performance Particular focus on the emerging area of divisible load theory and its impact on load balancing and distributed systems Download source code, examples, and instructor support materials on the book's companion website Table of Contents 1 Introduction 2 Multicore and Parallel Program Design 3 Shared-memory programming: Threads 4 Shared-memory programming: OpenMP 5 Distributed memory programming 6 GPU Programming 7 The Thrust Template Library 8 Load Balancing A Compiling Qt programs B RunningMPI Programs: Preparatory and Configuration Steps C Time Measurement D Boost.MPI E Setting up CUDA F DLTlib
Security patterns in practice : designing secure architectures using software patterns

Learn to combine security theory and code to produce secure systems Security is clearly a crucial issue to consider during the design and implementation of any distributed software architecture. Security patterns are increasingly being used by developers who take security into serious consideration from the creation of their work. Written by the authority on security patterns, this unique book examines the structure and purpose of security patterns, illustrating their use with the help of detailed implementation advice, numerous code samples, and descriptions in UML. * Provides an extensive, up-to-date catalog of security patterns * Shares real-world case studies so you can see when and how to use security patterns in practice * Details how to incorporate security from the conceptual stage * Highlights tips on authentication, authorization, role-based access control, firewalls, wireless networks, middleware, VoIP, web services security, and more * Author is well known and highly respected in the field of security and an expert on security patterns Security Patterns in Practice shows you how to confidently develop a secure system step by step.
Un modelo de threads reactivos usuario-kernel para Java

En este trabajo se presenta un modelo de threads usuario-kernel para Java, eficiente, altamente escalable, y orientado a la construccion de aplicaciones Internet de alto desempeno que requieren crear miles de threads y mantener igual numero de conexiones simultaneas (p.e. servidores Web y servidores proxy). El modelo incluye un mecanismo de planificacion reactiva que permite gestionar en forma implicita operaciones de I/O no bloqueantes sobre threads de usuario cooperativos.
Shape from inconsistent silhouette: Reconstruction of objects in the presence of segmentation and camera calibration error

Tabb, Amy Ph.D., Purdue University, December 2014. Shape from Inconsistent Silhouette: Reconstruction of Objects in the Presence of Segmentation and Camera Calibration Error. Major Professor: Johnny Park. Silhouettes are useful features to reconstruct the object shape when the object is textureless or the shape classes of objects are unknown. In this dissertation, we explore the problem of reconstructing the shape of challenging objects from silhouettes under real-world conditions such as the presence of silhouette and camera calibration error. This problem is called the Shape from Inconsistent Silhouettes problem. A psuedo-Boolean cost function is formalized for this problem, which penalizes differences between the reconstruction images and the silhouette images, and the Shape from Inconsistent Silhouette problem is cast as a psuedo-Boolean minimization problem. We propose a memory and time efficient method to find a local minimum solution to the optimization problem, including heuristics that take into account the geometric nature of the problem. Our methods are demonstrated on a variety of challenging objects including humans and large, thin objects. We also compare our methods to the state-of-the-art by generating reconstructions of synthetic objects with induced error. We also propose a method for correcting camera calibration error given silhouettes with segmentation error. Unlike other existing methods, our method allows camera calibration error to be corrected without camera placement constraints and allows for silhouette segmentation error. This is accomplished by a modified Iterative Closest Point algorithm which minimizes the difference between an initial reconstruction and the input silhouettes. We characterize the degree of error that can be corrected with synthetic datasets with increasing error, and demonstrate the ability of the cam-
Flight Data Recorder: Always-on Tracing and Scalable Analysis of Persistent State Interactions to Improve Systems and Security Management

Mismanagement of the persistent state of a system—all the executable files, configuration settings and other data that govern how a system functions—causes reliability problems, security vulnerabilities, and drives up operation costs. Recent research traces persistent state interactions—how state is read, modified, etc.—to help troubleshooting, change management and malware mitigation, but has been limited by the difficulty of collecting, storing, and analyzing the 10s to 100s of millions of daily events that occur on a single machine, much less the 1000s or more machines in many computing environments. We present the Flight Data Recorder (FDR) that enables always-on tracing, storage and analysis of persistent state interactions. FDR uses a domain-specific log format, tailored to observed file system workloads and common systems management queries. Our lossless log format compresses logs to only 0.5-0.9 bytes per interaction. In this log format, 1000 machine-days of logs—over 25 billion events—can be analyzed in less than 30 minutes. We report on our deployment of FDR to 207 production machines at MSN, and show that a single centralized collection machine can potentially scale to collecting and analyzing the complete records of persistent state interactions from 4000+ machines. Furthermore, our tracing technology is shipping as part of the Windows Vista OS.
High Accuracy Computing Methods: Fluid Flows and Wave Phenomena

High Accuracy Computing Methods presents topics in a single source format using unified spectral theory of computing. With developments of DNS and LES, practitioners are rediscovering waves as important in fluid flows, and capturing these numerically is central to high accuracy computing. Analysis of waves and its use in numerical methods in propagating energy at the right velocity (dispersion effects) and with right amplitude (dissipation) are essential. Most industrial codes using Reynolds-averaged Navier-Stokes equation with turbulence models cannot conceive of capturing waves. The new themes covered in this book are: correct error propagation analysis practical compact schemes and global analysis tool aliasing error and its alleviation spurious upstream propagating q-waves explanation of Gibbs phenomenon new 1D and 2D filters for LES/DNS without SGS modelling anisotropic skewed wave propagation development and analysis of dispersion relation preservation (DRP) schemes flow instabilities and wave propagation phenomena
Mobility management in next generation networks

The ITU-T definition of Next Generation Networks includes the ability to make use of multiple broadband transport technologies and to support generalized mobility. Next Generation Networks will need to integrate several IP-based access technologies in a seamless way. In this Thesis, we first describe the requirements of a Mobility Management scheme for multimedia real-time communication services; then, we report a survey of the Mobility Management schemes proposed in the recent literature to perform vertical handovers between heterogeneous networks. Based on this analysis, we propose an application-layer solution for Mobility Management called MMUSE (Mobility Management Using SIP Extension), which is based on the SIP protocol, and satisfies the most important requirements demanded for a proper implementation of vertical handovers. We also implemented our proposed solution, testing it on the field and proving its overall feasibility and its interoperability with different terminals and SIP servers. In our work we also report measurements results which analyze the performance of the solution in a real world environment, using commercial access networks (WiFi, 3G) Finally we discuss a methodology for performance evaluation of the solutions for vertical handovers previously described. The performance evaluation is based on simple analytical models and covers both the ideal case (no packet loss) and the real case where there is a given packet loss rate. The methodology is applied to a comparison among three solutions, namely MIPv4, classical SIP mobility management using re-INVITE messages and the proposed MMUSE SIP based solution.
Exposing the Magic of Design: A Practitioner's Guide to the Methods and Theory of Synthesis

Introduction How to make sense of chaos A lack of method in practice leads to problems The goals of this text The immediacy of this text Section One: What is synthesis? Chapter 1: A Theory of Synthesis Understanding how people solve problems Acting on an informed hunch Making a judgment Using partial or incomplete information Understanding, and breaking, constraints Chapter 2: Sensemaking, Frames, Models and Patterns The nature of sensemaking in understanding The role of perspective in framing situations The importance of models in sensemaking Mental models as a specific type of cognitive representation The nature of patterns on our experiences Chapter 3: Abductive Reasoning Section Two: Design synthesis in a business context Chapter 4: The value of synthesis in driving innovation What is innovation? Design synthesis links innovation research and design Chapter 5: The culture of synthesis Challenging constraints and questioning purpose Being playful Experiencing flow Using visualization as a primary mechanism of thought Changing a prohibitive culture Section Three: Methods and applicability A framework for organizing synthesis methods A method selection guide Chapter 6: Methods for making meaning out of data Externalizing the process (get out of your laptop! ) Using visual design to clean up the mess Organizing, to produce semantic relationships Prioritizing the data to emphasize what's important Judging the data, to reduce the quantity Enhancing the data through "best guess" intuitive leaps For Example: Getting to Meaning through Story Method: Affinity Diagramming How to apply this method For Example: Parallel Clustering Method: Flow Diagramming How to Apply this Method For Example: The Flow Through a Hunter Fan Thermostat A Case Study Chapter 7: Methods for building an experience framework Telling a Story. Changing the Scale. Shifting the Placements. Method: Concept Mapping How to Apply this Method For Example - Using Concept Maps in Product Development Method: Forced Semantic Zoom ("Ecosystem Mapping") How to Apply this Method For Example: Breakpoint Diagrams and Other Tools for Transitions Method: Forced Temporal Zoom ("Customer Journey Mapping") How to Apply this Method For Example -The Emotional Touch Points of Shopping Chapter 8: Methods for Creating Empathy and Insight Understanding Chasm 3: Empathy and Insight Method: Reframing How to Apply this Method Method: Insight Combination How to Apply this Method Conclusion Glossary Works Cited
Introduction to Scheduling

Full of practical examples, Introduction to Scheduling presents the basic concepts and methods, fundamental results, and recent developments of scheduling theory. With contributions from highly respected experts, it provides self-contained, easy-to-follow, yet rigorous presentations of the material. The book first classifies scheduling problems and their complexity and then presents examples that demonstrate successful techniques for the design of efficient approximation algorithms. It also discusses classical problems, such as the famous makespan minimization problem, as well as more recent advances, such as energy-efficient scheduling algorithms. After focusing on job scheduling problems that encompass independent and possibly parallel jobs, the text moves on to a practical application of cyclic scheduling for the synthesis of embedded systems. It also proves that efficient schedules can be derived in the context of steady-state scheduling. Subsequent chapters discuss scheduling large and computer-intensive applications on parallel resources, illustrate different approaches of multi-objective scheduling, and show how to compare the performance of stochastic task-resource systems. The final chapter assesses the impact of platform models on scheduling techniques. From the basics to advanced topics and platform models, this volume provides a thorough introduction to the field. It reviews classical methods, explores more contemporary models, and shows how the techniques and algorithms are used in practice.
A Software Platform for Global Optimization

This paper addresses issues associated with the global optimization algorithms, which are methods to find optimal solutions for given problems. It focuses on an integrated software environment – global optimization object-oriented library (GOOL), which provides the graphical user interface together with the library of solvers for convex and nonconvex, unconstrained and constrained problems. We describe the design, performance and possible applications of the GOOL system. The practical example – price management problem – is provided to illustrate the effectiveness and range of applications of our software tool. Keywords—global optimization, integrated software systems, nonconvex optimization, numerical libraries, price management.
Patterns for concurrent and networked objects

About This Book About The Authors Guide To The Reader 1 Concurrent and Distributed Objects 2 The Patterns 2.1 Introduction 2.2 Service Access Patterns Wrapper Facade Extension Interface Interceptor 2.3 Event Handling Patterns Reactor Proactor Asynchronous Completion Token 2.4 Initialization Patterns Acceptor-Connector Activator Component Configurator 2.5 Synchronization Patterns Scoped Locking Strategized Locking Thread-Safe Interface Double Checked Locking Optimization 2.6 Concurrency Patterns Active Object Monitor Object Leader/Followers Half Sync/Half-Async Thread-Specific Storage 3 Tying the Patterns Together 3.1 From Individual Patterns To Pattern Languages 3.2 A Pattern Language for Distributed Object Computing 3.3 Beyond Networking, Distribution, and Concurrency Notations Glossary References Index of Patterns Index
Plant protein-coding gene families: Their origin and evolution

Steady advances in genome sequencing methods have provided valuable insights into the evolutionary processes of several gene families in plants. At the core of plant biodiversity is an extensive genetic diversity with functional divergence and expansion of genes across gene families, representing unique phenomena. The evolution of gene families underpins the evolutionary history and development of plants and is the subject of this review. We discuss the implications of the molecular evolution of gene families in plants, as well as the potential contributions, challenges, and strategies associated with investigating phenotypic alterations to explain the origin of plants and their tolerance to environmental stresses.
Interaction Tangible sur Table, un cadre fédérateur illustré

Depuis plusieurs annees, les interfaces tangibles impliquant des interactions realisees via un ou plusieurs objets prennent une importance grandissante en interaction homme-machine. Ce domaine est en extension grâce au developpement d'objets exploitant des technologies sans contact (NFC, RFID, etc.). L'objet tangible represente un sujet ou une action ; cet objet agit sur le systeme, telle une action sur une interface « classique ». L'interaction sur table, c'est-a-dire sur un meuble present dans la vie courante et utilise a diverses fins (bureau, table a manger, table de salon, table bar, etc.), ouvre un champ nouveau de recherche et de developpement. Nous proposons d'illustrer un cadre propose dans un article conjoint, en positionnant des applications mettant en oeuvre le couple . Plusieurs applications, visant a supporter chacune une tâche metier complexe, sont decrites a la fois d'un point de vue technologique et d'un point de vue applicatif. Ces applications montrent les apports de l'association a l'interaction et sont caracterisees selon les dimensions du cadre de conception presente dans un article conjoint, montrant ainsi la genericite et le pouvoir descriptif du cadre propose.
Plasma metabolomics and lipidomics signatures of motoric cognitive risk syndrome in community-dwelling older adults

Introduction Motoric cognitive risk syndrome (MCR) is characterized by subjective cognitive complaints (SCCs) and slow gait (SG). Metabolomics and lipidomics may potentiate disclosure of the underlying mechanisms of MCR. Methods This was a cross-sectional study from the West China Health and Aging Trend cohort study (WCHAT). The operational definition of MCR is the presence of SCCs and SG without dementia or mobility disability. The test and analysis were based on untargeted metabolomics and lipidomics, consensus clustering, lasso regression and 10-fold cross-validation. Results This study enrolled 6,031 individuals for clinical analysis and 577 plasma samples for omics analysis. The overall prevalence of MCR was 9.7%, and the prevalence of MCR-only, assessed cognitive impairment-only (CI-only) and MCR-CI were 7.5, 13.3, and 2.1%, respectively. By consensus clustering analysis, MCR-only was clustered into three metabolic subtypes, MCR-I, MCR-II and MCR-III. Clinically, body fat mass (OR = 0.89, CI = 0.82–0.96) was negatively correlated with MCR-I, and comorbidity (OR = 2.19, CI = 1.10–4.38) was positively correlated with MCR-III. Diabetes mellitus had the highest ORs above 1 in MCR-II and MCR-III (OR = 3.18, CI = 1.02–9.91; OR = 2.83, CI = 1.33–6.04, respectively). The risk metabolites of MCR-III showed relatively high similarity with those of cognitive impairment. Notably, L-proline, L-cystine, ADMA, and N1-acetylspermidine were significantly changed in MCR-only, and PC(40:3), SM(32:1), TG(51:3), eicosanoic acid(20:1), methyl-D-galactoside and TG(50:3) contributed most to the prediction model for MCR-III. Interpretation Pre-dementia syndrome of MCR has distinct metabolic subtypes, and SCCs and SG may cause different metabolic changes to develop MCR.
Baryon breakdown in black hole

According to relativity theory, a black hole is a distinct region in spacetime; according to astronomical observations, it is a celestial body transforming matter into high-energy jets. We propose that a black hole is, indeed, a star, where particles transform into photons through a specific nuclear reaction, besides radiative accretion disk processes. Our reasoning draws from statistical physics of open quantized systems. The many-body theory describes elementary particles comprising quanta of actions and their reactions as conversions of matter-bound quanta into vacuum quanta. The proposed transformation details the annihilation of neutrons into gamma rays. This reaction, characteristic of a black hole, begins when the strength of gravitation exceeds the strength of the strong force. Then gluons detach from quarks and attach to surrounding high-energy quanta of the gravitational field. Without gluons, the tightly packed neutrons cannot hold up their SU(3) symmetry. The tetrahedral structures flatten out so that quarks of opposite charges end up pairwise on top of each other and annihilate into rays of light quanta as electrons and positrons do. Finally, the quanta jet out along the black hole spinning axis, where the gravitation due to the collapsing core gives in most. Over the eons, these episodic effluxes from a precessing supermassive black hole amass into Fermi bubbles.
A Learning Algorithm for Web Page Scoring Systems

Hyperlink analysis is a successful approach to define algorithms which compute the relevance of a document on the basis of the citation graph. In this paper we propose a technique to learn the parameters of the page ranking model using a set of pages labeled as relevant or not relevant by a supervisor. In particular we describe a learning algorithm applied to a scheme similar to PageRank. The ranking algorithm is based on a probabilistic Web surfer model and its parameters are optimized in order to increase the probability of the surfer to visit a page labeled as relevant and to reduce it for the pages labeled as not relevant. The experimental results show the effectiveness of the proposed technique in reorganizing the page ordering in the ranking list accordingly to the examples provided in the learning set.
Editorial: Pathogenesis, treatment, and future directions for rare T-cell leukemias

COPYRIGHT © 2022 Herling, Jarjour, Mishra and Brammer. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms. TYPE Editorial PUBLISHED 07 September 2022 DOI 10.3389/fonc.2022. 991527