Numerical Analysis and Scientific Computing Commons^™

Scheduling Optimization Of Aluminum Extrusion Production Line Based On Timed Petri Net And Bso Algorithm, Yali Wu, Shuting He, Yanxi Yang, Lianqiang Feng, Fuqiang Wang, Yulu Chen

Journal of System Simulation

Abstract: For the problems of long production period and low efficiency caused by the complicated processes and large scheduling capacity of aluminum extrusion production line in industrial production, a timed Petri net (TdPN) scheduling model of aluminum extrusion production line is proposed and analyzed for reasonableness. The brain storm optimization (BSO) algorithm is introduced into the model, and an optimized scheduling algorithm for aluminum extrusion scheduling problems is proposed based on the individual encoding and decoding methods. The simulated annealing local search mechanism is used to improve the performance of BSO algorithm in the later stage, which can achieve the …

A Multi-Resolution Simulation Modeling Method, Zhaopeng Liu, Xinhai Xu, Bowen Yuan, Jinlu Zhang

Journal of System Simulation

Abstract: Aiming at the resolution gap between the operation task issued by the high-level commanders and the simulation system model instructions in the human-in-the-loop simulation deduction, a multi-resolution modeling method based on behavior tree is proposed. By improving the behavior tree syntax, the low-resolution combat missions are disaggregated into high-resolution simulation system instructions. By designing a decision model embedded in the behavior tree, the problem of resource uncertainty and execution effect uncertainty faced in the execution of model instructions is solved. A combat scenario for seizing air supremacy is designed to verify the effectiveness of the method.

The Power Of Supercomputing Applied To Fractal Image Generation, Charlin Me Duff

Mathematics Senior Capstones

This project looks into how parallelism benefits the runtime of generating large fractal images. First, it explains what the Julia and Mandelbrot Sets are, who discovered them, and how they are calculated. Following that is an introduction to supercomputers, parallel computing, and Cal Poly Humboldt’s very own supercomputer. Once groundwork is laid, I explain my process of adapting a fractal image generation program from serial computing to different levels of parallelism. After that, is an analysis of the effects of levels of parallelism on the runtime of large fractal image generation. This paper concludes with a reflection on the project …

Achieving High Map-Coverage Through Pattern Constraint Reduction, Yingquan Zhao, Zan Wang, Shuang Liu, Jun Sun, Junjie Chen, Xiang Chen

Research Collection School Of Computing and Information Systems

Testing multi-threaded programs is challenging due to the enormous space of thread interleavings. Recently, a code coverage criterion for multi-threaded programs called MAP-coverage has been proposed and shown to be effective for testing concurrent programs. Existing approaches for achieving high MAP-coverage are based on random testing with simple heuristics, which is ineffective in systematically triggering rare thread interleavings. In this study, we propose a novel approach called pattern constraint reduction (PCR), which employs optimized constraint solving to generate thread interleavings for high MAP-coverage. The idea is to iteratively encode and solve path conditions to generate thread interleavings which are guaranteed …

Dashboard Design Mining And Recommendation, Yanna Lin, Haotian Li, Aoyu Wu, Yong Wang, Huamin Qu

Research Collection School Of Computing and Information Systems

Dashboards, which comprise multiple views on a single display, help analyze and communicate multiple perspectives of data simultaneously. However, creating effective and elegant dashboards is challenging since it requires careful and logical arrangement and coordination of multiple visualizations. To solve the problem, we propose a data-driven approach for mining design rules from dashboards and automating dashboard organization. Specifically, we focus on two prominent aspects of the organization: , which describes the position, size, and layout of each view in the display space; and, which indicates the interaction between pairwise views. We build a new dataset containing 854 dashboards crawled online, …

Novel Architectures And Optimization Algorithms For Training Neural Networks And Applications, Vasily I. Zadorozhnyy

Theses and Dissertations--Mathematics

The two main areas of Deep Learning are Unsupervised and Supervised Learning. Unsupervised Learning studies a class of data processing problems in which only descriptions of objects are known, without label information. Generative Adversarial Networks (GANs) have become among the most widely used unsupervised neural net models. GAN combines two neural nets, generative and discriminative, that work simultaneously. We introduce a new family of discriminator loss functions that adopts a weighted sum of real and fake parts, which we call adaptive weighted loss functions. Using the gradient information, we can adaptively choose weights to train a discriminator in the direction …

Bifurcation Levels Of The Integral Manifolds Of The Newtonian N-Body Problem, Hannah G. Havel

CURE Proceedings

The N-body problem, first proposed by Isaac Newton, is a field of study in mathematics and physics that involves predicting the motion of particles moving under their mutual gravitational attraction. It has significance to many areas of science, including physics and computer science, and is crucial in understanding how the universe works. In fact, it was a primary motivation for Newton's development of calculus. An important application of the N-body problem is within celestial mechanics and involves how planets and other celestial bodies move with mutual gravitational attraction. It is important in developing how satellites behave in space using complicated …

Dynamic Function Learning Through Control Of Ensemble Systems, Wei Zhang, Vignesh Narayanan, Jr-Shin Li

Publications

Learning tasks involving function approximation are preva- lent in numerous domains of science and engineering. The underlying idea is to design a learning algorithm that gener- ates a sequence of functions converging to the desired target function with arbitrary accuracy by using the available data samples. In this paper, we present a novel interpretation of iterative function learning through the lens of ensemble dy- namical systems, with an emphasis on establishing the equiv- alence between convergence of function learning algorithms and asymptotic behavior of ensemble systems. In particular, given a set of observation data in a function learning task, we …

Evaluating The Use Of Environmental Tracers To Reduce Conceptual Model Uncertainty Of Hydrogeologic Models, Andrew Nordberg, Jon Graham, W. Payton Gardner

Graduate Student Theses, Dissertations, & Professional Papers

Environmental tracer concentrations for CFC12, SF6, and tritium are used in groundwater simulations to assess the ability of these tracers to reduce conceptual model uncertainty due to uncertainty of a site’s geologic and recharge characterization. The resulting groundwater simulations are characterized by site-specific hydrologic and geologic data, and with coordination from a field team with years of knowledge about the site. First-order (conceptual) uncertainty is directly addressed by using a stochastic modeling approach for spatial variability of the proposed subsurface configurations. Simulations of environmental tracer concentrations and water levels are used to assess six alternate conceptual models that are based …

Exploring High Performance And Energy Efficient Graph Processing On Gpu, Robert P. Watling

Dissertations, Master's Theses and Master's Reports

Parallel graph processing is central to analytical computer science applications, and GPUs have proven to be an ideal platform for parallel graph processing. Existing GPU graph processing frameworks present performance improvements but often neglect two issues: the unpredictability of a given input graph and the energy consumption of the graph processing. Our prototype software, EEGraph (Energy Efficiency of Graph processing), is a flexible system consisting of several graph processing algorithms with configurable parameters for vertex update synchronization, vertex activation, and memory management along with a lightweight software-based GPU energy measurement scheme. We observe relationships between different configurations of our software, …

Phys 275: Intro To Scientific Computing, David Goldberg

Open Educational Resources

No abstract provided.

Anchorage: Visual Analysis Of Satisfaction In Customer Service Videos Via Anchor Events, Kam Kwai Wong, Xingbo Wang, Yong Wang, Jianben He, Rong Zhang, Huamin Qu

Research Collection School Of Computing and Information Systems

Delivering customer services through video communications has brought new opportunities to analyze customer satisfaction for quality management. However, due to the lack of reliable self-reported responses, service providers are troubled by the inadequate estimation of customer services and the tedious investigation into multimodal video recordings. We introduce , a visual analytics system to evaluate customer satisfaction by summarizing multimodal behavioral features in customer service videos and revealing abnormal operations in the service process. We leverage the semantically meaningful operations to introduce structured event understanding into videos which help service providers quickly navigate to events of their interest. supports a comprehensive …

El-Vit: Probing Vision Transformer With Interactive Visualization, Hong Zhou, Rui Zhang, Peifeng Lai, Chaoran Guo, Yong Wang, Zhida Sun, Junjie Li

Research Collection School Of Computing and Information Systems

Nowadays, Vision Transformer (ViT) is widely utilized in various computer vision tasks, owing to its unique self-attention mechanism. However, the model architecture of ViT is complex and often challenging to comprehend, leading to a steep learning curve. ViT developers and users frequently encounter difficulties in interpreting its inner workings. Therefore, a visualization system is needed to assist ViT users in understanding its functionality. This paper introduces EL-VIT, an interactive visual analytics system designed to probe the Vision Transformer and facilitate a better understanding of its operations. The system consists of four layers of visualization views. The first three layers include …

Dual-View Preference Learning For Adaptive Recommendation, Zhongzhou Liu, Yuan Fang, Min Wu

Research Collection School Of Computing and Information Systems

While recommendation systems have been widely deployed, most existing approaches only capture user preferences in the , i.e., the user's general interest across all kinds of items. However, in real-world scenarios, user preferences could vary with items of different natures, which we call the . Both views are crucial for fully personalized recommendation, where an underpinning macro-view governs a multitude of finer-grained preferences in the micro-view. To model the dual views, in this paper, we propose a novel model called Dual-View Adaptive Recommendation (DVAR). In DVAR, we formulate the micro-view based on item categories, and further integrate it with the …

Crowdfa: A Privacy-Preserving Mobile Crowdsensing Paradigm Via Federated Analytics, Bowen Zhao, Xiaoguo Li, Ximeng Liu, Qingqi Pei, Yingjiu Li, Robert H. Deng

Research Collection School Of Computing and Information Systems

Mobile crowdsensing (MCS) systems typically struggle to address the challenge of data aggregation, incentive design, and privacy protection, simultaneously. However, existing solutions usually focus on one or, at most, two of these issues. To this end, this paper presents CROWD FA, a novel paradigm for privacy-preserving MCS through federated analytics (FA), which aims to achieve a well-rounded solution encompassing data aggregation, incentive design, and privacy protection. Specifically, inspired by FA, CROWD FA initiates an MCS computing paradigm that enables data aggregation and incentive design. Participants can perform aggregation operations on their local data, facilitated by CROWD FA, which supports various …

Predictive Taxonomy Analytics (Lasso): Predicting Outcome Types Of Cyber Breach, Jing Rong Goh, Shaun S. Wang, Yaniv Harel, Gabriel Toh

Research Collection School Of Economics

Cyber breaches are costly for the global economy and extensive efforts have gone into improving the cybersecurity infrastructure. There are numerous types of cyber breaches that vary greatly in terms of cause and impact, resulting in an extensive literature for individual cyber breach type. Our paper seeks to provide a general framework that can be easily applied to analyze different types of cyber breaches. Our framework is inspired by the taxonomy approach in the cybersecurity literature, where it was proposed that an effective set of taxonomy can provide a direction on supporting improved decision-making in cyber risk management and selecting …

Efficient Approximate Range Aggregation Over Large-Scale Spatial Data Federation, Yexuan Shi, Yongxin Tong, Yuxiang Zeng, Zimu Zhou, Bolin Ding, Lei Chen

Research Collection School Of Computing and Information Systems

Range aggregation is a primitive operation in spatial data applications and there is a growing demand to support such operations over a data federation, where the entire spatial data are separately held by multiple data providers (a.k.a., data silos). Data federations notably increase the amount of data available for data-intensive applications such as smart mobility planning and public health emergency responses. Yet they also challenge the conventional implementation of range aggregation queries because the raw data cannot be shared within the federation and the data partition at each data silo is fixed during query processing. These constraints limit the design …

Assessing The Performance Of A Particle Swarm Optimization Mobility Algorithm In A Hybrid Wi-Fi/Lora Flying Ad Hoc Network, William David Paredes

UNF Graduate Theses and Dissertations

Research on Flying Ad-Hoc Networks (FANETs) has increased due to the availability of Unmanned Aerial Vehicles (UAVs) and the electronic components that control and connect them. Many applications, such as 3D mapping, construction inspection, or emergency response operations could benefit from an application and adaptation of swarm intelligence-based deployments of multiple UAVs. Such groups of cooperating UAVs, through the use of local rules, could be seen as network nodes establishing an ad-hoc network for communication purposes.

One FANET application is to provide communication coverage over an area where communication infrastructure is unavailable. A crucial part of a FANET implementation is …

Efficient Gpu Implementation Of Automatic Differentiation For Computational Fluid Dynamics, Mohammad Zubair, Desh Ranjan, Aaron Walden, Gabriel Nastac, Eric Nielsen, Boris Diskin, Marc Paterno, Samuel Jung, Joshua Hoke Davis

Computer Science Faculty Publications

Many scientific and engineering applications require repeated calculations of derivatives of output functions with respect to input parameters. Automatic Differentiation (AD) is a method that automates derivative calculations and can significantly speed up code development. In Computational Fluid Dynamics (CFD), derivatives of flux functions with respect to state variables (Jacobian) are needed for efficient solutions of the nonlinear governing equations. AD of flux functions on graphics processing units (GPUs) is challenging as flux computations involve many intermediate variables that create high register pressure and require significant memory traffic because of the need to store the derivatives. This paper presents a …

Claimdistiller: Scientific Claim Extraction With Supervised Contrastive Learning, Xin Wei, Md Reshad Ul Hoque, Jian Wu, Jiang Li

Computer Science Faculty Publications

The growth of scientific papers in the past decades calls for effective claim extraction tools to automatically and accurately locate key claims from unstructured text. Such claims will benefit content-wise aggregated exploration of scientific knowledge beyond the metadata level. One challenge of building such a model is how to effectively use limited labeled training data. In this paper, we compared transfer learning and contrastive learning frameworks in terms of performance, time and training data size. We found contrastive learning has better performance at a lower cost of data across all models. Our contrastive-learning-based model ClaimDistiller has the highest performance, boosting …