Items tagged with search search Tagged Items Feed

Is there a way to see just the titles of, say, the last 100 questions?  Looking into recent questions I see the full post, so that requires moving up and down multiple pages. Really painful.

I saw yesterday evening (at home) a very elegant answer to my question "Intersection of real intervals" .
Unfortunately I can't retrieve it this morning (I'm in the office)

It was something like  coulitbe('_x' ...) ... but I don't remember it entirely
I think it came from Carl Love or maybe Mac Dude

 Could you please send me it again ?

 

Thanks

Maple is a scientific software based on Computational Algebraic System (SAC) which has enabled this work entirely solve applied to Civil Engineering, Mechanical and Mecatrónica.The present problems in education, research and engineering are developed with static work sheets ie coding used innecesaria.Maple proposed models are shown below with an innovative structure; with the method of graphics algorithms and embedded components; putting aside the traditional and obsolete syntax; using dynamic worksheets as viable and optimal solutions to interpret and explain problems Ingineering.Design Advanced Analysis Tools (Applied Mathematics) Sophisticated Applications (efficient algorithms) and Multiple deployment options (different styles); this allowed generate math apps (applications engineering); can be interactive on the internet without the need to have the software installed on our computer; This way our projects can be used with a vision of sustainability around the world. Resulting in the generation of data and curves; which in turn will help you make better decisions analytical and predictive modeling in manufacturing and 3D objects; which would lead to new patterns of contrasting solutions.

ECI_2016.pdf

ECI_2016v_full.mw

Lenin Araujo Castillo

Ambassador of Maple - Perú

 

 

 

Assume we have a sreach with 10 for, for example

answer=0:

for i[1] from 1 by 1 to 5 do

    for i[2] from 1 by 1 to 5 do 

        ...

        if .... then answer=1: print(i[1],...,i[10]); "quitting the search"

        ...

     end do

end do

If I write break at qutting part, it will only exit from one for, one idea is putting if answer=1 break before end do of the rest for, that is why I used the local extra variable "answer" but is this the best idea? Any better idea which contains checking less if is apprecied.

Thank you in advance for your time.

I can search for any phrase or symbol in my Maple Worksheet but "sign symbol".

I have a very big result that I am not sure how many minus it has. When I search for - sign, no match found. I can see some minus in the worksheet but Maple can not find them.

Please help me.

I really appreciate.

A search in mapleprimes will not find anything answered as a reply.

Can this be fixed

I made reference to the show the enemy below and included part of the script an interesting part in the show. 

I did a mapleprimes search - only two returns none of which were what I was looking for.  I also did a google search which turned up nothing. 

Was my post deleted?

Hey I have a list of matrices and I want to define a proc that will search through the first matrices entries looking for zeroes, and if it finds one to move on to the next matrix in the list and look for zeroes and so on. if for some reason all matrices in the list have zeroes i would like the proc to answer with 0. otherwise I would like it to answer with the ndex of the first matrix wth all non-zero entries. I've played with things and occasionally made things work. But in general I do not have a solution. This is what I'e tried:

Things like this:

recu:=proc(y,n,q)
options trace;
local f,j,t,k;
t[y]:=y:
k:=y:
for f from 1 to n while y<=q do;
for j from 1 to n do;
if evalb(C[k](f,j)=0) then;
t[y+1]:=t[y]+1;
recu(t[y+1],n,q);
else next;
end if;
end do;
end do;
end proc;

like this:

recu:=proc(y,n,q)
local f,j,t,k;
global S;
options trace;
S:=0;
if y=q then return "no";
end if;
for f from 1 to n do;
for j from 1 to n do;
if evalb(C[y](f,j)=0) then;
recu(y+1,n,q);
S:=S+1;
end if;
end do;
end do;
end proc;

And I think I understand well why these are not workinging however I wondered what I can do that will be syntactically (sp?) correct.

Thanks

The search operation on both questions and posts doesn't work. I get the same set of results for both, and the same results regardless of the search term.

When I login and then create a question or post and click submit (or preview), I get a new request to login, and, after I do that login, the originally entered message body has been erased.

i_before_e$.mw

My Homies

I'm trying to find words which contradict the rule "i before e except after c". according to BBC program "QI" there are 923 exceptions, but below i get less than that. i guess its only as good as the dictionary, the 'inbuilt' has only 25k words but 'ospd3' (with 80k words) seems to stop before letter Q (with my sledgehammer code) when there are more words out there like "weird", "veil" and "reciept".

with(StringTools); with(PatternDictionary); bid := Create(ospd3);
words :=([seq])(LowerCase(Get(bid, i)), i = 1 .. Size(bid)-1);
tot := 0;
for n to nops(words) do
C := searchtext(cie, words[n]); E := searchtext(ei, words[n]);
if`and`(C = 0, E = 0) then next else tot := tot+1;
print([tot, words[n]]) end if
end do

Hi,

 

I have a list of sets eg. L:=[{a},{b,c},{d,a,f},{b,d}] and I'm having problems doing operations on it. 

I want to be able to take the first element (a here), look for the next occurrence of it and return what is in the set with it (here d and f).

However I can't seem to use Search or Occurrences as they consider the sets themselves to be the elements. For instance Search(a, L) returns 0. 

 

What can I do?

I'm using Linearalgebra where I have a 10x1 matrix. I want to find the closest element of the matrix to origo, and the furthest away from origo. Can anyone help me to a understandable solution? :)

Hey,

Is there a way of searching a list for two consecutive numbers?

Eg. I have the sequence:

Hi,

I would like to ask, what is the way to use the Direct Search (or other similar package) to solve not a static optimization problem for, say f(x_1,x_2), but the dynamic one, say for f(x_1(t),x_2(t),t)?

I think there must be the way of adapting the algorithm for that.

Any ideas welcome.

Best

Cannot find own answer in

http://www.mapleprimes.com/posts/100884-Precision-And-Plot-Drivers

via searching in my answers. Is it because original message is too old and thats why should be so?

1 2 3 Page 1 of 3