Mitsubishi Electric Research Laboratories, Inc.

Mitsubishi Electric Information Technology Center America, Inc.

Mitsubishi Electric Information Technology Center America, Inc (ita)

Digital Equipment Corporation

Joseph W Marks

Stuart Merrill Shieber

Hanspeter Pfister

Chia Shen

Sarah F Gibson

David B Anderson

Kevin Kreeger

James L Frankel

Kathleen Ryall

Neal B Lesh

Brian Mirtich

William T Freeman

Clifton L Forlines

Paul A Beardsley

Michael D Mitzenmacher

Carol Strohecker

Edith Ackermann

Aseem Agarwala

Murray S Mazer

Ramesh Johari

Ali Partovi

Paul Beardsley

Ho Min Kang

Joshua Seims

Wheeler Ruml

Judith Galler Karlin

Joseph Gonzalez-Heydrich

David Ratajczak

Sara Frances Frisken Gibson

Jessica Hodgins

David Ray DeMaso

Kathy Ryall

Dennis Nathan Bromley

Rebecca P Hwa

Andrew W Shuman

John Thomas Ngo

Edmund M Sullivan

Brad Andalman

A cellular telephone breeding toy includes a memory storing genetic traits of corresponding breedable virtual fish. The memory also stores sets of image templates, there being at least one genetic trait associated with each image template. A keypad is used to select one or more of the virtual fish, and to render the virtual fish according to the genetic traits and the sets of image templates. Lineage of the virtual fish can also be displayed, and the virtual fish can be traded between cellular telephones using communications protocols. Genetic traits of two virtual fish can be combined randomly to generate off-springs.

Fish breeding toy for cellular telephones

A method packs input rectangles into a target rectangle. The rectangles are permuted into one or more an ordered list according to dimensions of the rectangles, e.g., width, height, perimeter, and area. The rectangles are then marked as unaccepted. A next unaccepted rectangle is selected from the ordered list beginning with a first rectangle in the list. Accepting the next rectangle if it is the last unaccepted rectangles, and otherwise, accepting the next rectangle with a probability p, and marking the next rectangle as accepted, and repeating the steps until all rectangles have been accepted.

Method for packing rectangular strips

A system enables an interactively guided heuristic search for solving a combinatorial optimization problem. The system initially performs a hill-climbing search on the combinatorial optimization problem to obtain a solution using initial default parameters. The current solution and the combinatorial optimization problem are visualized on an optimization table, a table-top display device. The parameters are altered based on the visualization of the combinatorial optimization problem and the current solution. Then, the searching, visualizing, and setting are repeated until the solution is selected as an acceptable solution of the combinatorial optimization problem. During the repeating, the parameters can be a set of probabilities, and in which case the search is a random perturbation-based search. Alternatively, the parameters can be a set of priorities, in which case the search is an exhaustive local search.

Interactive heuristic search and visualization for solving combinatorial optimization problems

A system for interactive manipulation of graphs by a user applies constraints to obtain a visually pleasing display. The user adds nodes and edges to the graph. Visual Organization Feature (VOF) constraints are then applied to the nodes. The system uses a generalized spring algorithm to apply the constraints. Springs are attached to selected nodes to which a constraint is to be applied. The length and the second end-point of each spring are set based upon the constraint which is to be applied. The system then determines by simulation at-rest positions for all of the nodes based upon the springs. As the user adds, changes or deletes VOFs or changes the positions of the nodes, the graph is automatically reconfigured based upon the constraints. A user interface in connection with the graph drawing system provides a display for the graph and selection buttons for applying the VOFs.

Drawing graphs using user selectable visual oragnization features and/or other user controlled constraints

A method for decorating a virtual world model first builds a physical model from a plurality of building blocks. Each building block includes a microcontroller coupled to a plurality of connectors. The connectros are for physically and electronically connecting the blocks in a three-dimensional structure to form the model. An arrangement of the blocks in the model is derived by connecting the model to a host computer. The arrangement is expressed as a set of logical axioms. The set of logical axioms is processed by a logic program to identify large scale structural elements of the model, and decorative attributes are assigned to the large. scale structural elements.

Method for decorating a virtual model

A method traces rays through graphical data. The method partitions the graphical data into a plurality of blocks according to a scheduling grid. For each block, a ray queue is generated. Each entry in the ray queue representing a ray to be traced through the block. The ray queues are ordered spatially and temporally using a dependency graph. The rays are traced through the blocks according to the ordered list.

Temporal and spatial coherent ray tracing for rendering scenes with sampled and geometry data

In a self-configuring store-and-forward computer network, a plurality of processors are each housed in an enclosure having a top surface and a bottom surface. Each processor has an associated block identification number. An array of m by n radially symmetric connectors are arranged on the top surface and on the bottom surface of each enclosure. Each connector has an associated connector identification number. The connectors physically and electronically couple the plurality of processors as a three-dimensional structure. Communications controller in each of the processors exchange the block and connector identification numbers between the processors and a host computer to determine an ordered list of connector numbers that is used to route messages between any of the processors and the host computer.

Self-configuring store-and-forward computer network

A programmable visualization apparatus processes graphical data. The apparatus includes a central processing unit for executing a visualization application and a scheduler. A third level of memory is connected to the central processing unit. The third level of memory stores the graphical data. The graphical data is partitioned into a plurality of blocks. A second level of memory is connected to the central processing unit by a system bus. The second level of memory stores a sub-set of the plurality of blocks. A first level of memory is connected to the second level of memory by a memory bus. The scheduler stores an ordered list of blocks in the first level memory. A processor element is connected to the first level of memory by a processor bus. A dispatcher is connected to the first, the second, and the third memories and the processor element. The dispatcher transfers blocks from the third, to the second, and from the second to the third level memories according to the order of the list of blocks.

Programmable architecture for visualizing sampled and geometry data

An interface is useful in browsing output vectors resulting from applying a transfer function to input data. The interface allows a user to explore effects of different parameter settings which make up the transfer function, particularly in connection with computer-generated and computer-modified images. The interface includes two portions, a central display panel and a surrounding area of a plurality of image displays. Thumbnail sketches of images corresponding to each of the output vectors are located in the central display panel to represent the relationships between the output vectors. The output vectors are processed to determine distances between them, and the distances are then projected to the two-dimensional display of the central display panel. The central display panel can be controlled to pan and zoom the display to review the thumbnail sketches. The user can then select different thumbnail sketches so that full-sized images are displayed in the plurality of image displays. The interface also has additional displays which can overlay the central display panel and the image displays. The additional displays represent information about the images or vectors. The input or output vectors corresponding to a specific image can be displayed. Alternatively, the image can be displayed in larger detail in an additional display.

User interface for creation of image generation and transformation functions

A method recognizes three-dimensional physical objects using three-dimensional deformable templates. A particular object is scanned with a camera to generate volumetric data representing the object. The volumetric data is compared to each of a plurality of three-dimensional deformable templates stored in a database to obtain a score for each comparison. The deforming of the template is done by optimizing an objective function.

System and method for recognizing scanned objects with deformable volumetric templates

Methods and apparatus are provided for accessing an experience journal which includes unstructured text items relating to a topic, such as a medical condition. The method is implemented in a computer system including a processor, a storage device, a video display unit having a display screen, and a user interface. The unstructured text items are stored in the storage device. Similarities among the unstructured text items are determined, and icons, one corresponding to each of the unstructured text items, are displayed on the display screen. The icons are positioned on the display screen relative to each other, such that the distances between icons are representative of the determined similarities among the unstructured text items. In response to user selection of one of the icons, the corresponding unstructured text item is displayed on the display screen.

Method and system for displaying icons representing information items stored in a database

A system for generating a set of graphical images based upon application of different graphical transfer functions to data of physical structures in a scene. The application of the different graphical transfer functions define graphical images of a single scene having different characteristics. A user can then review the images to select a desirable image, without having to define or know the graphical transfer function which generates the image. The system of the present invention generates a dispersed set of output vectors representing characteristics of the set of images based upon a transfer function. The system creates the dispersed set by generating a random set of output vectors and then randomly perturbing one. The perturbed vector replaces one of the other vectors if the replacement results in a more dispersed set. The process is repeated until a thoroughly dispersed set of output vectors has been obtained. The dispersion of the set is determined based upon a total number of iterations or a number of perturbations without replacement. The output vectors are created by randomly selecting sets of parameters of the graphical transfer function as input vectors, and generating the images based upon the input vectors. The output vectors are similarly perturbed by randomly perturbing at least one parameter of a randomly selected input vector, and determining the corresponding new output vector.

Dispersion heuristic for design gallery interfaces

A system generates and arranges animation sequences of articulated characs for review and selection by a user. Motion of articulated characters is based upon input parameters, such as torques at joints of the character. The system can be used to select appropriate parameters to obtain desirable motion of the articulated characters. The system generates a set of input vectors containing parameters of the motion. The input parameters are then processed to determine animation sequences and corresponding output vectors. The output vectors include characteristics of the motion. The input vectors are selected to provide a dispersed set of output vectors. A large number of random input vectors can be generated and then culled to leave a dispersed set of output vectors. Alternatively, a set of randomly generated input vectors of a predetermined size are randomly perturbed, to further disperse the output vectors. The system includes an interface for representing the output vectors and animation sequences in a manner which is easily reviewable by a user. The output vectors are displayed so that positions represent distances between the output vectors. The user can then select specific output vectors so that the corresponding animation sequence is displayed.

System for determining motion control of articulated linkages

A system generates and arranges animation sequences of particle motion for eview and selection by a user. Motion of particles in an animation sequence is based upon input parameters, such as creation point, creation rate, velocity, direction, and lifetime. The system can be used to select appropriate parameters to obtain desirable motion of the particles. The system generates a set of input vectors containing parameters of the motion. The input parameters are then processed to determine animation sequences and corresponding output vectors. The output vectors include characteristics of the motion. The input vectors are selected to provide a dispersed set of output vectors. A large number of random input vectors can be generated and then culled to leave a dispersed set of output vectors. Alternatively, a set of randomly generated input vectors of a predetermined size are randomly perturbed, to further disperse the output vectors. The system includes an interface for representing the output vectors and animation sequences in a manner which is easily reviewable by a user. The output vectors are displayed so that positions represent distances between the output vectors. The user can then select specific output vectors so that the corresponding animation sequence is displayed.

System for determining motion control of particles

A computer-based system for automatic pagination and layout of yellow pages or a commercial telephone directory uses a simulated annealing heuristic to refine a randomly determined candidate solution. The text and advertisements which are to be included in the yellow pages directory are ordered in two distinct data streams representing the order of text and the order of advertisements in the directory. The system determines a possible layout, called a candidate solution, by randomly setting parameters defining the pagination and layout. These parameters may include page breaks in the advertisement stream, column numbers for each advertisement, and an amount of padding or empty space to be added to each page. Once the parameters are set, the individual pages are laid out by putting the advertisements in the next available position in their assigned columns, and the text around the advertisements. The solution is scored based upon the guidelines for the format and layout of the yellow pages directory. The solution is then optimized using a simulated annealing heuristic, which utilizes small modifications or perturbations randomly made to the initial parameters of the candidate solution. The revised solution is scored and compared to the score of the prior solution. The revised solution is then kept according to a probabilistic formula relating the two scores. Through an iterative process of perturbations, scoring, and comparing, the candidate solution becomes optimized. The process is repeated multiple times for different initial candidate solutions, each of which is randomly determined. A best solution is then selected from all of the optimized candidate solutions.

Growing community of inventors

Belmont, MA, United States of America

Joseph W Marks