scholarly journals Secure Large-Scale Airport Simulations Using Distributed Computational Resources

2001 ◽  
Author(s):  
William J. Mcdermott ◽  
David A. Maluf ◽  
Yuri Gawdiak ◽  
Peter Tran
Keyword(s):  
Large Scale ◽  
Computational Resources

scholarly journals Nebula: ultra-efficient mapping-free structural variant genotyper

2021 ◽  
Author(s):  
Parsoa Khorsand ◽  
Fereydoun Hormozdiari
Keyword(s):  
Large Scale ◽  
Structural Variants ◽  
Sequencing Technologies ◽  
Generic Framework ◽  
Common Genetic Variants ◽  
Order Of Magnitude ◽  
Complex Events ◽  
Comparable Accuracy ◽  
Using Data ◽  
Computational Resources

Abstract Large scale catalogs of common genetic variants (including indels and structural variants) are being created using data from second and third generation whole-genome sequencing technologies. However, the genotyping of these variants in newly sequenced samples is a nontrivial task that requires extensive computational resources. Furthermore, current approaches are mostly limited to only specific types of variants and are generally prone to various errors and ambiguities when genotyping complex events. We are proposing an ultra-efficient approach for genotyping any type of structural variation that is not limited by the shortcomings and complexities of current mapping-based approaches. Our method Nebula utilizes the changes in the count of k-mers to predict the genotype of structural variants. We have shown that not only Nebula is an order of magnitude faster than mapping based approaches for genotyping structural variants, but also has comparable accuracy to state-of-the-art approaches. Furthermore, Nebula is a generic framework not limited to any specific type of event. Nebula is publicly available at https://github.com/Parsoa/Nebula.

scholarly journals Vehicular Crowdsourcing for Congestion Support in Smart Cities

Smart Cities ◽  
2021 ◽  
Vol 4 (2) ◽  
pp. 662-685
Author(s):  
Stephan Olariu
Keyword(s):  
Smart City ◽  
Large Scale ◽  
Smart Cities ◽  
Traffic Signal Control ◽  
Signal Timing ◽  
Adaptive Traffic Signal Control ◽  
Traffic Conditions ◽  
Direct Benefits ◽  
Traffic Signal Control Systems ◽  
Computational Resources

Under present-day practices, the vehicles on our roadways and city streets are mere spectators that witness traffic-related events without being able to participate in the mitigation of their effect. This paper lays the theoretical foundations of a framework for harnessing the on-board computational resources in vehicles stuck in urban congestion in order to assist transportation agencies with preventing or dissipating congestion through large-scale signal re-timing. Our framework is called VACCS: Vehicular Crowdsourcing for Congestion Support in Smart Cities. What makes this framework unique is that we suggest that in such situations the vehicles have the potential to cooperate with various transportation authorities to solve problems that otherwise would either take an inordinate amount of time to solve or cannot be solved for lack for adequate municipal resources. VACCS offers direct benefits to both the driving public and the Smart City. By developing timing plans that respond to current traffic conditions, overall traffic flow will improve, carbon emissions will be reduced, and economic impacts of congestion on citizens and businesses will be lessened. It is expected that drivers will be willing to donate under-utilized on-board computing resources in their vehicles to develop improved signal timing plans in return for the direct benefits of time savings and reduced fuel consumption costs. VACCS allows the Smart City to dynamically respond to traffic conditions while simultaneously reducing investments in the computational resources that would be required for traditional adaptive traffic signal control systems.

scholarly journals Reaction Diffusion and Chemotaxis for Decentralized Gathering on FPGAs

2009 ◽  
Vol 2009 ◽  
pp. 1-15 ◽  
Author(s):  
Bernard Girau ◽  
César Torres-Huitzil ◽  
Nikolaos Vlassopoulos ◽  
José Hugo Barrón-Zambrano
Keyword(s):  
Large Scale ◽  
Complex Dynamics ◽  
Diffusion Mechanism ◽  
Reaction Diffusion ◽  
Fpga Implementation ◽  
Cellular Slime Mold ◽  
Reaction Diffusion Model ◽  
Cellular Slime ◽  
Computational Resources ◽  
Embedded Implementation

We consider here the feasibility of gathering multiple computational resources by means of decentralized and simple local rules. We study such decentralized gathering by means of a stochastic model inspired from biology: the aggregation of theDictyostelium discoideumcellular slime mold. The environment transmits information according to a reaction-diffusion mechanism and the agents move by following excitation fronts. Despite its simplicity this model exhibits interesting properties of self-organization and robustness to obstacles. We first describe the FPGA implementation of the environment alone, to perform large scale and rapid simulations of the complex dynamics of this reaction-diffusion model. Then we describe the FPGA implementation of the environment together with the agents, to study the major challenges that must be solved when designing a fast embedded implementation of the decentralized gathering model. We analyze the results according to the different goals of these hardware implementations.

scholarly journals Algorithm for Counting Cars in Large-scale Video Surveillance Systems

2020 ◽  
pp. 100-108
Author(s):  
Arsenii Shirokov ◽  
Denis Kuplyakov ◽  
Anton Konushin
Keyword(s):  
Video Surveillance ◽  
Large Scale ◽  
Surveillance Systems ◽  
Motion Model ◽  
People Tracking ◽  
Detection Frequency ◽  
Computational Resources ◽  
Sparse Set ◽  
The Given ◽  
Distributed Tracking

The article deals with the problem of counting cars in large-scale video surveillance systems. The proposed method is based on car tracking and counting the number of tracks intersecting the given signal line. We use a distributed tracking algorithm. It reduces the amount of necessary computational resources and increases performance up to realtime by detecting vehicles in a sparse set of frames. We adapted and modified the approach previously proposed for people tracking. Proposed improvement of the speed estimation module and refinement of the motion model reduced the detection frequency by 3 times. The experimental evaluation shows that the proposed algorithm allows reaching an acceptable counting quality with a detection frequency of 3 Hz.

Vertical Integration Between Providers With Possible Cloud Migration

2019 ◽  
pp. 274-284
Author(s):  
Aleksandra Kostic-Ljubisavljevic ◽  
Branka Mikavica
Keyword(s):  
Large Scale ◽  
Virtual Machines ◽  
Wholesale Price ◽  
Rejection Rate ◽  
Large Scale Data ◽  
Cloud Migration ◽  
Computational Resources ◽  
Charging Strategy ◽  
Scale Data

All vertically integrated participants in content provisioning process are influenced by bandwidth requirements. Provisioning of self-owned resources that satisfy peak bandwidth demand leads to network underutilization and it is cost ineffective. Under-provisioning leads to rejection of customers' requests. Vertically integrated providers need to consider cloud migration in order to minimize costs and improve quality of service and quality of experience of their customers. Cloud providers maintain large-scale data centers to offer storage and computational resources in the form of virtual machines instances. They offer different pricing plans: reservation, on-demand, and spot pricing. For obtaining optimal integration charging strategy, revenue sharing, cost sharing, wholesale price is applied frequently. The vertically integrated content provider's incentives for cloud migration can induce significant complexity in integration contracts, and consequently improvements in costs and requests' rejection rate.

Vertical Integration Between Providers With Possible Cloud Migration

2018 ◽  
pp. 1164-1173 ◽  
Author(s):  
Aleksandra Kostic-Ljubisavljevic ◽  
Branka Mikavica
Keyword(s):  
Large Scale ◽  
Virtual Machines ◽  
Wholesale Price ◽  
Rejection Rate ◽  
Large Scale Data ◽  
Cloud Migration ◽  
Computational Resources ◽  
Data Centres ◽  
Charging Strategy

All vertically integrated participants in content provisioning process are influenced by bandwidth requirements. Provisioning of self-owned resources that satisfy peak bandwidth demand leads to network underutilization and it is cost ineffective. Under-provisioning leads to rejection of customers' requests. Vertically integrated providers need to consider cloud migration in order to minimize costs and improve Quality of Service and Quality of Experience of their customers. Cloud providers maintain large-scale data centres to offer storage and computational resources in the form of Virtual Machines instances. They offer different pricing plans: reservation, on-demand and spot pricing. For obtaining optimal integration charging strategy, Revenue Sharing, Cost Sharing, Wholesale Price is applied frequently. The vertically integrated content provider's incentives for cloud migration can induce significant complexity in integration contracts, and consequently improvements in costs and requests' rejection rate.

scholarly journals scAIDE: clustering of large-scale single-cell RNA-seq data reveals putative and rare cell types

2020 ◽  
Vol 2 (4) ◽  
Author(s):  
Kaikun Xie ◽  
Yu Huang ◽  
Feng Zeng ◽  
Zehua Liu ◽  
Ting Chen
Keyword(s):  
Single Cell ◽  
Large Scale ◽  
Developmental Trajectories ◽  
Cell Types ◽  
Random Projection ◽  
Good Representation ◽  
Rna Seq ◽  
Unsupervised Deep Learning ◽  
High Level ◽  
Computational Resources

Abstract Recent advancements in both single-cell RNA-sequencing technology and computational resources facilitate the study of cell types on global populations. Up to millions of cells can now be sequenced in one experiment; thus, accurate and efficient computational methods are needed to provide clustering and post-analysis of assigning putative and rare cell types. Here, we present a novel unsupervised deep learning clustering framework that is robust and highly scalable. To overcome the high level of noise, scAIDE first incorporates an autoencoder-imputation network with a distance-preserved embedding network (AIDE) to learn a good representation of data, and then applies a random projection hashing based k-means algorithm to accommodate the detection of rare cell types. We analyzed a 1.3 million neural cell dataset within 30 min, obtaining 64 clusters which were mapped to 19 putative cell types. In particular, we further identified three different neural stem cell developmental trajectories in these clusters. We also classified two subpopulations of malignant cells in a small glioblastoma dataset using scAIDE. We anticipate that scAIDE would provide a more in-depth understanding of cell development and diseases.

Discrete Element Methods for Large Scale Particle/Fluid Simulations

2009 ◽  
Author(s):  
Harald Kruggel-Emden ◽  
Frantisek Stepanek ◽  
Ante Munjiza
Keyword(s):  
Large Scale ◽  
Interstitial Fluid ◽  
Discrete Element ◽  
Industrial Scale ◽  
Realistic Modeling ◽  
Event Driven ◽  
Scale Particle ◽  
Discrete Element Methods ◽  
Computational Resources ◽  
The Cost

The time- and event-driven discrete element methods are more and more applied to realistic industrial scale applications. However, they are still computational very demanding. Realistic modeling is often limited or even impeded by the cost of the computational resources required. In this paper the time-driven and event-driven discrete element methods are reviewed addressing especially the available algorithms. Their options for simultaneously modeling an interstitial fluid are discussed. A potential extension of the time-driven method currently under development functioning as a link between event- and time-driven methods is suggested and shortly addressed.

scholarly journals Interoperable and scalable data analysis with microservices: Applications in Metabolomics

2017 ◽  
Author(s):  
Payam Emami Khoonsari ◽  
Pablo Moreno ◽  
Sven Bergmann ◽  
Joachim Burman ◽  
Marco Capuccini ◽  
...  
Keyword(s):  
Mass Spectrometry ◽  
Data Analysis ◽  
Large Scale ◽  
Metabolite Identification ◽  
Access Point ◽  
Scientific Discipline ◽  
Resonance Spectroscopy ◽  
Magnetic Resonance Spectroscopy Study ◽  
Analysis Workflow ◽  
Computational Resources

Developing a robust and performant data analysis workflow that integrates all necessary components whilst still being able to scale over multiple compute nodes is a challenging task. We introduce a generic method based on the microservice architecture, where software tools are encapsulated as Docker containers that can be connected into scientific workflows and executed in parallel using the Kubernetes container orchestrator. The access point is a virtual research environment which can be launched on-demand on cloud resources and desktop computers. IT-expertise requirements on the user side are kept to a minimum, and established workflows can be re-used effortlessly by any novice user. We validate our method in the field of metabolomics on two mass spectrometry studies, one nuclear magnetic resonance spectroscopy study and one fluxomics study, showing that the method scales dynamically with increasing availability of computational resources. We achieved a complete integration of the major software suites resulting in the first turn-key workflow encompassing all steps for mass-spectrometry-based metabolomics including preprocessing, multivariate statistics, and metabolite identification. Microservices is a generic methodology that can serve any scientific discipline and opens up for new types of large-scale integrative science.

scholarly journals Big Archive-Assisted Ensemble of Many-Objective Evolutionary Algorithms

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Wen Zhong ◽  
Jian Xiong ◽  
Anping Lin ◽  
Lining Xing ◽  
Feilong Chen ◽  
...  
Keyword(s):  
Evolutionary Algorithms ◽  
Large Scale ◽  
Optimization Problems ◽  
Experimental Studies ◽  
Evolutionary Process ◽  
Superior Performance ◽  
Nondominated Solutions ◽  
Environmental Selection ◽  
Computational Resources ◽  
Better Than

Multiobjective evolutionary algorithms (MOEAs) have witnessed prosperity in solving many-objective optimization problems (MaOPs) over the past three decades. Unfortunately, no one single MOEA equipped with given parameter settings, mating-variation operator, and environmental selection mechanism is suitable for obtaining a set of solutions with excellent convergence and diversity for various types of MaOPs. The reality is that different MOEAs show great differences in handling certain types of MaOPs. Aiming at these characteristics, this paper proposes a flexible ensemble framework, namely, ASES, which is highly scalable for embedding any number of MOEAs to promote their advantages. To alleviate the undesirable phenomenon that some promising solutions are discarded during the evolution process, a big archive that number of contained solutions be far larger than population size is integrated into this ensemble framework to record large-scale nondominated solutions, and also an efficient maintenance strategy is developed to update the archive. Furthermore, the knowledge coming from updating archive is exploited to guide the evolutionary process for different MOEAs, allocating limited computational resources for efficient algorithms. A large number of numerical experimental studies demonstrated superior performance of the proposed ASES. Among 52 test instances, the ASES performs better than all the six baseline algorithms on at least half of the test instances with respect to both metrics hypervolume and inverted generational distance.

Sign in / Sign up

Export Citation Format

Share Document