Is there a way to convert maple codes into Singular codes?

If not, Are there any Singular expert here?

Could someone please give me a screen shot and/or a copy-and-paste of the Singular codes that would do the following simple task done in maple:

Let me explain a bit:

The input is F, which is a set of 2 polynomials.

Hello,

I'm trying to increase the number of parameters in the maplesim optimization template (nowadays we have six parameters)

I have a problem where I need to tune a model and I have more parameters -

How can I increase the number above six?

restart;

P := proc (x, lambda) options operator, arrow; piecewise(x < 0, 0, lambda^x*exp(-lambda)/factorial(x)) end proc;

The upper confidence limit. When the confidence limit is 95%, e is 0.05

Lu := proc (a) options operator, arrow; sum(P(x, lambda), x = 0 .. a) = 0.5e-1 end proc

Lu(10)

exp(-lambda)+lambda*exp(-lambda)+(1/2)*lambda^2*exp(-lambda)+(1/6)*lambda^3*exp(-lambda)+(1/24)*lambda^4*exp(-lambda)+(1/120)*lambda^5*exp(-lambda)+(1/720...

This is the frame of the bike rear suspension i'm trying to calculate. Here is my maple sheet.

Download Maple-start.mw Maple-start.mw 

What i'm trying to achieve is a plot that would look a little like this:

hey,

i have a problem to get to the orthogonal point, but still there is a intersection and so should be as well a orthogonal point....

> S1 := proc (t) options operator, arrow; F[1](t)*m[1]*(1-F[2](t)) end proc;
> S2 := proc (t) options operator, arrow; F[2](t)*(m[2]+F[1](t)*m[1]) end proc;
> F[1] := proc (t) options operator, arrow; (1-exp(-(p[1]+q[1])*t))/(1+q[1]*exp(-(p[1]+q[1])*t)/p[1]) end proc;
> F[2] := proc (t) options operator, arrow; piecewise...

Hey everybody,

for some reason I dont get for the following problem any answer, with other data it worked, but not whit this!? and i know that there is a intersection point!!

> S1 := proc (t) options operator, arrow; F[1](t)*m[1]*(1-F[2](t)) end proc;
> S2 := proc (t) options operator, arrow; F[2](t)*(m[2]+F[1](t)*m[1]) end proc;
> F[1] := proc (t) options operator, arrow; (1-exp(-(p[1]+q[1])*t))/(1+q[1]*exp(-(p[1]+q[1])*t)/p[1]) end proc;

> m1 := 1000;
                              1000
> m2 := 250;
                              250
> m1A := .2;
          ...

In my class we need to know how we can double underline our answers and how we can use the ⇕ (DoubleUpDownArrow) in equations

We would be happy if you have the answers we are searching

Regards Henrk Sigsgaard

My question is related to this discussion on "querying events"

http://www.mapleprimes.com/questions/125273-Dsolve-Events-How-To-Control-For-A-Sign-Change#comment125426

I thought I might start a new thread.

The following loop is an illustration of the sort of thing I'd like to do with dsolve and events: I loop over a parameter of the "event" and extract information on the solution at different values of the parameter. Here is the code (successfully tested on Maple 15 / Standard / Windows)...

Hello everybody,

I try to find the intersection point for the following equation, but I didn't get any or just "warning, ..." where is the problem? and how can I solve this!?

> S1 := proc (t) options operator, arrow; F[1](t)*m[1]*(1-F[2](t)) end proc;
> S2 := proc (t) options operator, arrow; F[2](t)*(m[2]+F[1](t)*m[1]) end proc;
> F[1] := proc (t) options operator, arrow; (1-exp(-(p[1]+q[1])*t))/(1+q[1]*exp(-(p[1]+q[1])*t)/p[1]) end proc;

Hi,

I reach to these balance equations Equations.pdf  in my queuing system where all parameters (N, S, m, λ, μ, x) are positive integer.

I was wondering whether I can solve these (N + S) equations by Maple to find the variables (π_x , -N ≤ x ≤ S ) based on the parameters?

These (N + S) variables indicate the steady-state probabilities in the system.

On the main page for the Rubi rule-based integrator, there is a table comparing results of Rubi against Maple and Mathematica.

On the face of it, the Maple results don't look so good. Maple is claimed as scoring about 82% correct on the author's example test suite. But only 42% of the suite gets an "optimal" result from Maple. The other 40% that Maple is claimed to get correct have results that are described as "Messy:

I've seen a few posts regarding implicit functions in Maple, but I've not seen any that can help my case...

(I should point out that I am new to Maple as well).

My function is h_c=[1/(2π*(√2)*a*f²)]*ln(h_c/4), and f=(a0-a)/a0

I have managed to get so far- Maple has accepted the function as an equation, and I want to plot h_c as a function of f, which, as you can see, varies according to a. I've tried...

Hey
I have just started with maple and I it is a little bit confusing for me  an I am tryin to implement the sieve of eratosthenes algorithm

but I am still getting strang warnings and the programm does not function as wanted so i wanted to use the debugger but
it is not working(it is like disabled)
I have maple 12
I will be glad to get a help
thanks 

Hi,

A while back, I was trying to use Maple's NonlinearFit function, but I kept getting an error regarding the input.  Any help you might be able to give me would be appreciated.  Thanks much.