Free rational rose software for linux

Rational PIC Assembler is an assembler for the mid-range microcontrollers from Microchip. The project uses Intel style mnemonics and target-first operand ordering. Designed to feel comfortable to PC assembly programmers.
This assembler generates code compatible with Microchips midline microcontrollers but is incompatible with their assembler. It should feel familiar to any PC assembly programmer. The instruction mnemonics and operand order are Intel style ( i.e. right, as opposed to wrong ).
Command Line Syntax
pic-asm [ -c ] [ -l filename ] [ -o filename ] input_file
-c -- console mode
an assembly source is accepted from stdin. binary code is
output on stdout. errors are output to stderr
-l filename -- specify listing file
-o filename -- specify object file
Input
The input is a sequence of line each of which contains one or more of the following fields
label instruction operands ; comment
The label and comment are optional. The operands required depend on the instruction.
The assembler is case sensitive, even for instructions.
Constants
Hex values can be specified with C-style 0x[:xdigit:]+. Binary values can be specified with 0b[01]+. Decimal values require no prefix as decimal is the default base.
Character constants are specified by enclosing a single character or escaped character within single quotes. String constants are specified by enclosing zero or more characters and escaped characters within double quotes. String constants generate one character constant for each character in the string. There is no trailing zero stored. For example:
db "Hello worldn", 0, a, b, r, n, t
Labels
A label is a sequence of alphanumeric characters ( including underbar ) that starts a line. Labels do not have colons. Labels local to the last nonlocal label can be defined by prefixing the name with a dot. For instance
; example from example-1.asm
foo call .1
.1 jmp .2
.2 jmp .1
bar call .1
.1 jmp .2
.2 jmp .1
In this example, the labels defined are foo, foo.1, foo.2, bar, bar.1, and bar.2. The first call branches to foo.1. The second call branches to bar.1. The labels local to foo can not be referenced before foo has been declared nor after bar has been declared.
Directives
Data can be declared. The declarator takes the place of the instruction and is followed by one or more expressions separated by commas. Each expression corresponds to one word in the output code regardless of the declarator type.
db - each operand is AND-ed with 0xff before being stored
dw - full 14 bit word definition
dt - each operand is AND-ed with 0xff and OR-ed with 0x3400 ( the return-with-value opcode ). This allows generation of case tables. You can add the accumulator ( w ) to the offset of the table. The processor will branch to the location in the table and return with an eight bit result
For instance:
db 1,2,3
dw 0x3fff, 0x3ff * 16 + 15, -1
dt 0b001, 0b010, 0b100
Equates are a named sequence of tokens. They can be defined with equ. For instance:
led_1 equ 0x100 | 1
led_2 equ 0x100 | 2
combo equ ( led_1 ) | ( led_2 )
The org position can be changed with org. For instance
org 0x10o
Enhancements:
- This release adds support for sophisticated macros, include files, conditional compilation, and compatibility with Microchip headers.

jrMan is an open source version of the REYES rendering algorithm used by Pixars PhotoRealistic Renderman.
Almost all digital production work in the film industry is rendered using this algorithm, yet most computer graphics textbooks fail to mention it or only provide a very superficial description of how it works.
jrMans main objective is to provide an open source implementation of the REYES rendering algorithm to permit, both students and teachers, to understand how it works and experiment with it.
To achieve this objective the source code must be easy to read and should run on most operating systems. This is the one of the reasons we are implementing it in Java.
Main features:
- NURBS
- Curves
- Rational bicubic patches
- Patch meshes
- Smooth micropolygon interpolation
- Delayed ReadArchive
- Alpha output in RGBA images
- Many bug fixes
- Smaller RAM footprint when rendering large/complex scenes

HOL short from Higher Order Logic is a programming environment in which theorems can be proved and proof tools implemented.
Built-in decision procedures and theorem provers can automatically establish many simple theorems. An oracle mechanism gives access to external programs such as SAT and BDD engines.
HOL 4 is particularly suitable as a platform for implementing combinations of deduction, execution and property checking.
Enhancements:
- New set comprehension notation was added.
- SML string notation was added.
- Support for the XEmacs editor was added.
- Case expressions may now include literals as patterns.
- Inductive definitions are now made with respect to a varying monoset.
- Types that use abbreviated patterns are printed in abbreviated form.
- Support for rational numbers and fixed-length integers was added.
- Bugs that prevented some components from compiling under GCC 4 were fixed.
- Normalization in natural numbers and integers was fixed.
- Handling of empty strings was fixed.

Mantissa is a collection of various mathematical tools aimed towards for simulation.
Mantissa contains a collection of algorithms, among which:
a small set of linear algebra classes
a least squares estimator
some curve fitting classes
several ordinary differentials equations integrators, either with fixed steps or adaptive stepsize control (see below)
vectors and rotations in a three dimensional space
algebra-related classes like rational and double polynomials
various orthogonal polynomials:
Chebyshev
Hermite
Laguerre
Legendre
some random numbers and vectors generation classes:
Robert M. Ziff four tap shift register (contributed by Bill Maier)
Makoto Matsumoto and Takuji Nishimura Mersenne twister
generators for vectors with correlated components
some basic (min, max, mean, standard deviation) statistical analysis classes
some optimization algorithms using direct search methods:
the Nelder-Mead simplex method
Virginia Torczons multi-directional method
Enhancements:
- For many basic objects provided by Mantissa like Vector3D, Rotation, and the various Polynomial classes, instances are now guaranteed to be immutable.
- This greatly simplifies safe sharing of instances without forcing users to either put severe restrictions on their use of Mantissa classes or make numerous copies just to make sure everything is safe.
- Since the change is a semantic change on the contract of the classes, this version introduces some incompatibilities with respect to previous ones.
- Upgrading to this version is not difficult, though.

Vaucanson is a finite state machine manipulation platform, composed of a library and tools implemented on top of it. Vaucansons goal is to enable the development of C++ programs in an abstract and general way with a large specialization power.
On the one hand, it allows the writing of algorithms that work on every automaton with weights over any semirings and with words from any free monoids. And on the other hand, a particular algorithm can be specialized for a particular data structure implementing only a pseudo behavior.
Enhancements:
- The "vcsn-z" and "vcsn-tdc" binaries were added to the TAF-kit toolkit to work with Z automata and FMP transducers.
- Many commands (algorithms) have been added in "vcsn-b".
- Many bugfixes were made for XML.
- For instance, the alphabet is no longer filled with the default range if it is said to be empty.
- New algorithms were added: is_ambiguous(a) tests if "a" is ambiguous; sub_normalize_here(a) sub-normalizes the automaton "a"; invert(t) returns the inverse of the RW transducer "t", i.e. the transducer that performs the invert rational relation.

SDE for NetBeans is a UML modeling environment tightly integrated with NetBeans.
It lets you draw all types of UML diagrams (use case diagram, class diagram, sequence diagram, activity diagram, etc.) in NetBeans, reverse source code (Java, C++, XML, XML Schema, CORBA IDL, etc.) to UML models, and generate Java source from UML diagrams.
SDE for NetBeans Community Edition features a Rational Rose importer, an XMI importer, HTML/PDF documentation generators, and plug-in and template support.
Enhancements:
- Branch and tag capability was added to the VP Teamwork Server with Subversion and CVS repository integration.
- This allows different modeling projects to be run in parallel while keeping the release quality project stable in the trunk.
- A user interface designer was introduced for creating screen mock-ups in the early stages of a software development project.
- Usability of the sequence diagram was increased.
- There were also a number of enhancements for various other features.

Rose::Object is a simple object base class.

SYNOPSIS

package MyObject;

use Rose::Object;
our @ISA = qw(Rose::Object);

sub foo { ... }
sub bar { ... }
...

my $o = MyObject->new(foo => abc, bar => 5);
...

Rose::Object is a generic object base class. It provides very little functionality, but a healthy dose of convention.

METHODS

new PARAMS

Constructs a new, empty, hash-based object based on PARAMS, where PARAMS are name/value pairs, and then calls init (see below), passing PARAMS to it unmodified.

init PARAMS

Given a list of name/value pairs in PARAMS, calls the object method of each name, passing the corresponding value as an argument. The methods are called in the order that they appear in PARAMS. For example:

$o->init(foo => 1, bar => 2);

is equivalent to the sequence:

$o->foo(1);
$o->bar(2);