The Mathworks, Inc.

Roy Lurie

Loren P Dean

Jocelyn Martin

Halldor Narfi Stefansson

John Norris Little

Joseph F Hicklin

Edric Mark Ellis

Brett W Baker

Piotr R Luszczek

Penelope Anderson

Nausheen B Moulana

Pieter Johannes Mosterman

Benjamin V Hinkle

Michael Karr

Stephen C Johnson

Melissa J Pike

Jason A Kinchen

Christian A Portal

Cleve B Moler

Ricardo E Paxson

Mary Ann Branch Freeman

Paul Kerr-Delworth

Matt Shawver

Darin S Kalashian

David J DeAngelis

Christopher F Garvin

Claudia G Wey

Joseph R Bienkowski

Thomas Gaudette

James Gareth Owen

Michelle D Erickson

Edward Whittington Gulley

Michael Patrick Bushe

Matthew A Shawver

Abigail S Skofield

Felix Alvarez

Eugene F Mcgoldrick

Eugene McGoldrick

Alexander Zak

Eera Gupta

Derya B Ozyurt

Eric Raffi

Ralf Hillebrand

Alexander Rensmann

Keerthi Gurijala

Burhanettin Derya Ozyurt

Oliver Kluge

Joe Conti

A method may include displaying an output, e.g., a figure, a data set, a symbolic expression or equation, a model, or any object with a representation that can be manipulated, e.g., a tree, a list, or a control loop, from executing program code. The method may include receiving an indication that the output has been modified through one or more manipulations, and generating code that represents modifications to the output, such that executing the code with the program code generates the output that has been modified.

Generating code based on user interactions with a user interface element in a code editor

In an embodiment, information for use in identifying a plurality of sub-solvers may be acquired. The plurality of sub-solvers may be used in a first attempt to find at least one solution to a problem that may be defined in the acquired information. At least two of the sub-solvers in the plurality of sub-solvers may be of different sub-solver types. The sub-solvers may be identified based on the acquired information. One or more starting points for the identified sub-solvers may be identified and transferred to the identified sub-solvers. One or more outputs, that indicate one or more results associated with the first attempt to find at least one solution to the problem, may be acquired from the identified sub-solvers. One or more sub-solvers may be identified, based on the acquired one or more outputs, for use in a second attempt to find at least one solution to the problem.

Framework for finding one or more solutions to a problem

A method and system is disclosed for providing a distributed technical computing environment for distributing technical computing tasks from a technical computing client to technical computing workers for execution of the tasks on one or more computers systems. Tasks can be defined on a technical computing client, and the tasks organized into jobs. The technical computing client can directly distribute tasks to one or more technical computing workers. Furthermore, the technical computing client can submit tasks, or jobs comprising tasks, to an automatic task distribution mechanism that distributes the tasks automatically to one or more technical computing workers providing technical computing services. The technical computing worker performs technical computing of tasks and the results of the execution of tasks may be provided to the technical computing client.

Methods and system for distributing technical computing tasks to technical computing workers

A device receives selection of a function category associated with a dynamically-type programming language, receives selection of a function associated with the selected function category, dynamically generates one or more function signatures associated with the selected function, and stores at least a subset of the one or more function signatures in a memory or displays at least a subset of the one or more function signatures to a user.

Dynamic function wizard

A device may obtain first program code, and may cause the first program code to be executed. The device may determine a first execution state generated based on causing the first program code to be executed. The device may store the first execution state. The device may obtain second program code that includes a modification to the first program code, and may cause the second program code to be executed. The device may determine a second execution state generated based on causing the second program code to be executed. The device may store the second execution state. The device may receive an indication to restore the first execution state, and may restore the first execution state based on receiving the indication.

Undoing/redoing program code execution

In an embodiment, a computer-readable medium may include computer-executable instructions for dynamic symbolic math engine selection. The instructions, when executed by a processor, may cause the processor to: dynamically select a first symbolic math engine from two or more symbolic math engines; convert a first symbolic command from a standard format into a first format compatible with the first symbolic math engine; pass the first converted command to the first symbolic math engine for executing; receive an error from the first symbolic math engine from executing the first converted command; convert the first symbolic command from the standard format into a second format compatible with a second symbolic math engine based on the error received from first symbolic math engine, wherein the second symbolic math engine is selected from the two or more symbolic math engines; and pass the second converted command to the second symbolic math engine for executing.

System and method for dynamic symbolic math engine selection

Exemplary embodiments provide annotations for dynamic dispatch of threads from scripting language code. Exemplary embodiments may provide scripting language code and execute the code causing examination of at least one annotation associated with a referenced collection of code. Exemplary embodiments may dynamically dispatch a first task to a first thread automatically from the scripting language code at runtime based on the examination of the at least one annotation associated with the referenced collection of code.

Annotations for dynamic dispatch of threads from scripting language code

Methods and system for registering callbacks and distributing tasks to technical computing works

One or more computer-readable media store executable instructions that, when executed by processing logic, perform parallel processing. The media store one or more instructions for initiating a single programming language, and identifying, via the single programming language, one or more data distribution schemes for executing a program. The media also store one or more instructions for transforming, via the single programming language, the program into a parallel program with an optimum data distribution scheme selected from the one or more identified data distribution schemes, and allocating the parallel program to two or more labs for parallel execution. The media further store one or more instructions for receiving one or more results associated with the parallel execution of the parallel program from the two or more labs, and providing the one or more results to the program.

Performing parallel processing of distributed arrays

A computing device-implemented method includes receiving a program, analyzing and transforming the program, determining an inner context and an outer context of the program based on the analysis of the program, and allocating one or more portions of the inner context of the program to two or more labs for parallel execution. The method also includes receiving one or more results associated with the parallel execution of the one or more portions from the two or more labs, and providing the one or more results to the outer context of the program.

Using parallel processing constructs and dynamically allocating program portions

The present invention is directed to a method, apparatus, and computer program product for performing selective memory restoration of a simulation based on an indexing scheme. The present invention executes a block diagram model of a biological process to generate simulations results using a simulation engine. An indexing scheme is used for registering memory locations used by a simulation context for a subsystem in the block diagram model. Experimental data is gathered from an in situ experimental device. A simulation environment is used to compare expected simulation results with experimental data. The block diagram model is then updated based on the results of the comparison to create a modified block diagram model, which is then used to selectively restore the simulation to a steady-state.

Method, computer program product, and apparatus for selective memory restoration of a simulation

A system for modeling, simulating and analyzing chemical and biochemical reactions includes a modeling environment for constructing a model of a chemical or biochemical system comprising a plurality of chemical reactions. The system also includes a simulation engine accepting as input said constructed model of the chemical or biochemical system and generating as output an expected result. The modeling environment includes a block diagram explorer for displaying a block diagram in a graphical user interface describing the system as a hierarchical network of interconnected blocks. Each block represents a species participating one of the chemical reactions or one of said chemical reactions in the system. The block diagram explorer allows for a user to manipulate and modify the graphical parameters of the block diagram representation to provide insight into the functionality and operation of the system being modeled.

Block diagram explorer in a method and apparatus for integrated modeling, simulation and analysis of chemical and biological systems

A computing device-implemented method includes receiving a program created by a technical computing environment, analyzing the program, generating multiple program portions based on the analysis of the program, dynamically allocating the multiple program portions to multiple software units of execution for parallel programming, receiving multiple results associated with the multiple program portions from the multiple software units of execution, and providing the multiple results or a single result to the program.

Parallel programming interface to dynamicaly allocate program portions

In an embodiment, a computer-readable medium may include computer-executable instructions for selecting a symbolic math engine. The instructions may be executed on a processor. The medium may include: one or more instructions for dynamically selecting a first symbolic math engine from two or more symbolic math engines; one or more instructions for converting a symbolic command from a standard format into a first format compatible with the first symbolic math engine; one or more instructions for passing the converted command to the first symbolic math engine for executing, the executing including producing a result; and one or more instructions for outputting or storing the result of the executing.

Growing community of inventors

Wayland, MA, United States of America

Roy Lurie