PubMed HealthSearch

PubMed · 8672687

Dynamic simulation using a graphical programming language.

Abstract

A power oscillator, suitable for energizing an ultrasonic surgical cutter was simulated using a graphical programming language. The simulation included a model of the amplitude control system as well as the ultrasonic actuator. In addition, those elements which existed in a practical oscillator and were typically obscure to the design requirements were identified, simulated and discussed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

H L Valenta. 1996. Dynamic simulation using a graphical programming language.. https://pubmed.ncbi.nlm.nih.gov/8672687/

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

Generating correlated data for omics simulation.

Simulation of realistic omics data is a key input for benchmarking studies that help users obtain optimal computational pipelines. Omics data involves large numbers of measured features on each sample and these measures are generally correlated with each other. However, simulation too often ignores these correlations, perhaps due to computational and statistical hurdles of doing so. To alleviate this, we describe three approaches for generating omics-scale data with correlated measures which mimic real datasets. These approaches are all based on a Gaussian copula approach with a covariance matrix that decomposes into a diagonal part and a low-rank part. This decomposition allows for extremely efficient simulation, overcoming a hurdle for adoption of past methods. We use these approaches to demonstrate the importance of including correlation in two benchmarking applications. First, we show that variance of results from the popular DESeq2 method increases when dependence is included. Second, we demonstrate that CYCLOPS, a method for inferring circadian time of collection from transcriptomics, improves in performance when given gene-gene dependencies in some circumstances. We provide an R package, dependentsimr, that has efficient implementations of these methods and can generate dependent data with arbitrary marginal distributions, including discrete (binary, ordered categorical, Poisson, negative binomial), continuous (normal), or with an empirical distribution.

Computer Simulation

Addressing current challenges in cancer immunotherapy with mathematical and computational modelling.

The goal of cancer immunotherapy is to boost a patient's immune response to a tumour. Yet, the design of an effective immunotherapy is complicated by various factors, including a potentially immunosuppressive tumour microenvironment, immune-modulating effects of conventional treatments and therapy-related toxicities. These complexities can be incorporated into mathematical and computational models of cancer immunotherapy that can then be used to aid in rational therapy design. In this review, we survey modelling approaches under the umbrella of the major challenges facing immunotherapy development, which encompass tumour classification, optimal treatment scheduling and combination therapy design. Although overlapping, each challenge has presented unique opportunities for modellers to make contributions using analytical and numerical analysis of model outcomes, as well as optimization algorithms. We discuss several examples of models that have grown in complexity as more biological information has become available, showcasing how model development is a dynamic process interlinked with the rapid advances in tumour-immune biology. We conclude the review with recommendations for modellers both with respect to methodology and biological direction that might help keep modellers at the forefront of cancer immunotherapy development.

Computer Simulation

A one step motion detection circuitry.

A model of motion and direction detection is presented as well as results from a computer simulation of the model. The model is based on cooperative computations which allows an extremely simple architecture. Furthermore, it involves only one logical step in its computations even though Hubel and others have argued that motion detection requires at least two. This is made possible by not including the initial detection of movement. The model simply updates prior detections which is a simpler problem. New movement can be captured by the system by means of spontaneous activity in the movement selective cells. The cost is that some iterations are required to capture new movement. On the other hand, the model handles noisy input very well. The reason for this is that movement is viewed as a stable phenomenon rather than change.

Computer Simulation