Search problems : Boolean expressions and spam folder

I get about 1000 spam per day that I have to check.
Some of them contains certain keyword that the real emails would never have.
I would like to setup a smart folder or similar that found all emails in the spam folder that contains any of those keywords. I read some blogs etc. that said that spotlight boolean expressions could be used but they do not seem to work.
e.g. "pill OR berry" yields no results at all but when each of the keywords are used on their own they produce 80 or so results each.
Another problem I have is that I can do a manual search in the spam folder by typing in the search field and it yields results. But if I save that as a smart folder it yields no results at all. It seems that the rules do not work on the spam folder.
I then tried to do all this from spotlight in the finder. I found the folder where the spam mailbox emails are stored (called "messages"). I managed to construct a nice search query and save it as a search. But if I delete one of the emails from the finder it still remains in Mail and the next time I start Mail it will be regenerated from somewhere.
Anyone have any insights to provide here?

I had actually missed that preference. Unfortunately it did not help.
Even if I make a new smart mailbox with just one rule (the email must be in the spam folder) it doesnt work. It doesn't matter if I change between any/all either.
I started experimenting with adding a rule saying that the email must not be in any of the other mailboxes but spam. That seemed to work for a bit but as I added more rules, excluding more mailboxes, it eventually broke. I will investigate it a bit more but currently don't have high hopes...

Similar Messages

Selecting structure fields from search box in expressions and rules.

Hi,
I've a case where there are more than one structure object (structures bound to DDIC structure) with same field (lets say MATNR for example). Now assume that I've 5 structures with the field MATNR (struct_1, struct_2,... struct_5). I've to use the field struct_3-MATNR in one of the expressions are result object. So I click on the context menu button of the result link and click on Select... menu option. In the pop up search screen I type MATNR and it shows me 5 result records. Now the problem is how do I know which MATNR belongs to struct_3. The search results doesn't show to which structure &/OR table a field belongs to.
I've been randomly selecting each one till I get the right one which wastes a lot of time.

I'll try to put my case with a more detailed explanation.
Hierarchy:
Function_01->Ruleset_01->Ruleset_exp_01(DB_LOOKUP)
In the above DB_LOOKUP I try to fetch records from database based on VBELN.
I've a structure Struct_01 in the Function_01 context with the element VBELN in it(Struct_01).
My select query goes like this.
Select Col1 Col2 Col3 from XYZ_TABLE WHERE VBELN = Struct_01-VBELN.
I've to select Struct_01-VBELN for the above case, but I don't find Struct_01 though it is in the function context.
Note: I've around 5 structures with VBELN

Search Document by category and by folder restriction

HI !
I have a problem :
I'm using Search Java API to find "All Documents which have a category and I would like to restrict the search to a subfolder"
So , I found in Javadoc and in IFS Developer reference some piece of code but that doesn't return hits :
AttributeSearchSpecification asp = new AttributeSearchSpecification();
     String [] classNames = new String[] {"Category"};
     SearchClassSpecification scp = new SearchClassSpecification(classNames);
     scp.addResultClass("Category");
     asp.setSearchClassSpecification(scp);
FolderRestrictQualification frq1 = new FolderRestrictQualification();
Folder startFolder = ifsSession.getPrimaryUserProfile().getHomeFolder();
     frq1.setStartFolder(startFolder);
frq1.setMultiLevel(true);
     asp.setSearchQualification(frq1);
     recherche = new Search(ifsSession,asp);
Could you help me please ?
Thank you.

HI !
I have a problem :
I'm using Search Java API to find "All Documents which have a category and I would like to restrict the search to a subfolder"
So , I found in Javadoc and in IFS Developer reference some piece of code but that doesn't return hits :
AttributeSearchSpecification asp = new AttributeSearchSpecification();
     String [] classNames = new String[] {"Category"};
     SearchClassSpecification scp = new SearchClassSpecification(classNames);
     scp.addResultClass("Category");
     asp.setSearchClassSpecification(scp);
FolderRestrictQualification frq1 = new FolderRestrictQualification();
Folder startFolder = ifsSession.getPrimaryUserProfile().getHomeFolder();
     frq1.setStartFolder(startFolder);
frq1.setMultiLevel(true);
     asp.setSearchQualification(frq1);
     recherche = new Search(ifsSession,asp);You'll have to join the document with its category, and add this JoinQualification to the searchqualification..
example:
JoinQualification jq=new JoinQualification();
jq.setLeftAttribute(Document.CLASS_NAME,null);
jq.setRightAttribute(YOUR_CATEGORY_CLASS_NAME,Category.ASSOCIATED_PUBLICOBJECT);
//joining Document.id with its category
then AND-ing JoinQualification with FolderResrictQualification via SearchQualification
last step, inserting the SearchQualification into the AttributeSearchSpecification,
and dont forget to include Document and your_category_class_name in the SearchClassSpecification,
because you seems to forget it?
and ofcourse the resultclass is the Document, not the Category, since you're trying to get document, right?
Hope it helps

Need sample code to do text search using boolean operators AND OR + -

I'm looking for an algorithm doing text searches in files
I need it to support AND OR + - keywords (for example "ejb AND peristence")
Does anyone knows where I cand find this kind of algorithm with the full source ?
Of course I can adapt C,C++ to Java.
In fact my target language is Serverside javascript (sorry) so I prefere rather low level solutions !
Any help will be grealy appreciated and the resulting code will be posted
here and on my website : http://www.tips4dev.com

Firstly, a little note to the technical solution: what you probably need the most is speed. I may sound strange, but personally I am convinced that if you could use system tools a naive algorithm:for i:=1 to m do
grep (word)
od; whose complexity is O(m.n), where m is the number of words to be processed and n somehow represents the cardinality of the text to-be-sought-through, so this naive algorithm would actually be in 99% of cases much faster than any implementation of the algorithm below, whose complexity is O(m+n), because the implementation of the grep routine (O(n)) would be optimized and m will be low (who queries 153 words at once?)
Anyway, you asked for an algorithm and you'll have it. It is quite elegant.
Aho, A.V. - Corasick, M.V.: Efficient String Matching - An Aid to Bibliographic Search, Communication of the ACM, 1975 (vol. 18), No. 6, pg. 333-340
[i]The task: let's have an alphabet X and a string x = d1d2...dn (d's are characters from X) and a set K = {y1, ... ym} of words, where yj = tj,1 ... tj,l(j) (t's are again characters from X).
Now we search for all <i, yp> where yp is the suffix of d1...di (occurences of the word yp in x)
(note: if you want to search for the whole words tj,1 and tj,l(j) must be blanks)
The idea of the algorithm is that we first somehow process words yp to construct a search machine and with this machine we will loop through X to search for occurrences of all the words at once.
Example:
K = {he, she, his, hers}
X = ushers
search machine M(Q - set of states, g - "step forward" function, f - "step back" function, out - reporting function):
(function g)
0 (initial state) h-> state 1 e-> state 2 r-> state 7 s-> state 8 ... for {he, hers}
state 1 i-> state 6 s-> state 7 ... for {his}
state 0 s-> state 3 h-> state 4 e-> state 5 e ... for {she, he}
And for all the characters is defined 0 x -> 0
Now, in
(function out)
state 2: report {he}
state 5: report {she, he}
state 7: report {his}
state 9: report {hers}
"Step back" function f for this particular set of word would be:
9 -> 3, 7 -> 3, 5 -> 2, 4 -> 1 otherwise the machine would return to the initial state 0
Processing of ushers will look like:
<0,0> u-stay in the state 0 <1,0> s-move to state 3 <2,3>, <3,4>, <4,5> state 5-report (he, she}, cannot move forward -> must step back (like if "he" was received) <4,2> r-move to state 8, <5,8>, <6,9>
Before we show how to construct the searching machine M (Q,g,f,out) let�s consider the algorithm how to use it:
Alg 1.begin
state:= 0;
for i = 1 to n do
//if cannot move forward, move back
while g(state, di) not defined do state:=f(state) od;
//move forward to a new state
state:=g(state, di);
//report all the words represented by the new state
for all y from out(state) do Report(i,y) od;
od
end.
Alg 2. � build of the �step forward� function g and an auxiliary function o that will be later used for the construction of outvar q:integer;
procedure Enter(T1�Tm);
begin
s:=0; j:=1;
//processing a prefix of a new word that is a prefix of an already processed word too
while j&ltm and g(s,Tj) defined do
s:=g(s,Tj); j:=j+1;
od;
while j&ltm do
q:=q+1; //a new state � global variable
define g(s,Tj) = q; //definition of a single step forward
s:=q;
j:=j+1;
od;
//the last state must be a state when at least the processed word is reported
define o(s) = [T1, � Tm];
end;
begin
q:=0; //initial state
for p:= 1 to k do Enter(yp) od;
for all d from the alphabet X do
if g(0,d) not defined then define g(0,d) = 0 fi
od
end. Alg 3. � build of the �step back� function f and the reporting function outcreate an empty queue
define f(0) = 0; out(0) = {} //an empty set � we expect words of the length 1 at least
for all d from X do
//process children of the initial state
s:=g(0,d);
if s!=0 then
define f(s) = 0; //1-character states, if we throw away the first character we return to the initial
define out(s):=o(s); //report 1-character words, if any
move s at the end of the queue
fi
od
while queue not empty do
r:= the first member of the queue; remove r from the queue;
for all d from X do //process all the children of r
if g(r,d) defined then
s:= g(r,d); //get a child of r
t:= f(r); //f(r) has already been defined
while g(t,d) not defined do t:=f(t) od;
//we found a state from which g(t,d) has sense
define f(s) = g(t,d);
define out(s) = o(s) UNION with out(f(s));
move s at the end of the queue;
fi
od
od
Processing of a query � normal forms
Until now we have solved the problem how to search for multiple words in a text at once. The algorithm returns not only not only whether a word was found or not, but also where exactly a word can be found � all the occurrences and their locations.
However, the initial task was slightly different: procession of a query like �X contains (y1 AND/OR y2 � yn)� In order to decide a question like that it might not be necessary to find all the occurrences of given words, actually not even an occurrence of all the words (e.g. word1 OR word2 is fulfilled as soon as either word1, or word2 is found).
Let�s suppose that a searching query is given in its disjunctive normal form (DNF):
A1 OR A2 OR ...Ak where each of Ax = B1 AND B2 AND ...Bkx and Byz is a statement �X contains yp�
Now, the query is successful whenever any of Ax is fulfilled.
(I don�t know how much you know about transformation of a logical formula to its disjunctive form � it is quite a famous algorithm and can be found in any textbook of logic or NP-completeness. I hope that evaluation of the formula, which is what happens in the procedure Report of the algorithm Alg. 1, is trivial.)

Source Pro problem although tk1 and tk2 folder are deleted

With the first release on Muse 2014 I never had this font problem, which is described here:
Source Sans Pro not displaying in 'Design' mode
After updating to Muse 2014.0.1.30 the problem caught me too:
I closed Muse, located the tk1 and tk2 folders in my user library and deleted them:
But the problem shown in the first screenshot persists! Any hints, what I can do?

THanks god, I am not alone!
Reinstalling seems no durable solution for me. I am hoping for the next version of Muse (Or for an answer of the team, which is normally quite responsive).

Why does the verification for e-mail not show up on/in my e-mail - not in spam folder either?

sure would be nice if the verification of e-mail would be sent promptly. I have checked and checked, both inbox and spam folder and NOTHING. You don't want my business, say so!

Just seen this one....
Nikkimc813
Re: My photos on my pc will not upload to my iphone with icloud 28-Jan-2012 19:11 (in response to Jessy Brisbane)
This might help you
https://discussions.apple.com/message/17424907#17424907
I had the same problem with my iPad. I did what the post above says and it fixed it.
Before I did that my photos weren't showing up in the photo stream but in my FB app if I choose to upload a pic from photo stream they were there. Weird.
and it has worked for me....many many thanks Nikkimc813

Dynamic boolean expression evaluation

Hey everyone,
We have a table that consists of a couple key columns and a column containing a boolean expression. We want to select a number of rows based on the key columns and evaluate the boolean expression in the expression column for each, only returning the first row wherein the boolean expression evaluates to true.
We are using a context to inject the test variables into the boolean expressions and currently we are selecting all the key rows in a PL/SQL procedure and going through the cursor evaluating each of the boolean expressions with an execute immediate.
The expressions are currently formated in the columns as anonymous PL/SQL blocks that, when called, will either return true or false to the PL/SQL procedure. Upon returning true, the procedure stops looping and returns true to the caller.
Psuedo-code would be:
- set-up sys_context with condition variables
- create cursor for: select * from expression_tbl et where <key matches>
- begin loop through cursor
- execute immediate cursor_row.expression using out :out_is_true
- if out_is_true = 'Y' then return true
- loop
- return false
The expressions (anonymous PL/SQL blocks) from the table look something like this:
begin if ((''||sys_context('ctx', '1')||'' = 'FL') AND (''||sys_context('ctx', '3')||'' BETWEEN 1619 AND 4598) ) then :1 := 'Y'; end if; end;
This works, but it seems like I should be able to do this another way and potentially extract more performance.
So...a couple questions:
1) I have read on ask Tom that a dynamic select statement (rather than an anonymous PL/SQL block) can evaulate the boolean expressions. I.E. rather than use an execute immediate clause on an anonymous PL/SQL block contained in the expression column, I would make the expression column compatible with a where clause and create this dynamic SQL query: 'select count(*) from dual where ' || expression. I would then execute that query and if it returns a row then the expression is true, otherwise it is false. My question is, does anyone think the performance of parsing the SQL and executing it would be better than that of executing an anonymous PL/SQL block for every row? Tom said that the SQL could incur a lot of hard-parses and kill performance, but how deathly is the constant compilation of anonymous PL/SQL blocks as shown above in comparison?
2) Would there be any benefit to pulling the execute routines out of the PL/SQL block and issuing a query such as the following:
select * from expression_tbl et where <key matches> AND pkg.eval_routine(et.expression) = 'Y' AND rownum <= 1.
I realize that the evaulating routine would then need to either perform an execute immediate on et.expression (if we keep the current method in place) or formulate the dynamic SQL statement and execute it. But, could this be faster than doing the same loop through rows explicitely in PL/SQL?
Doing this would trim my PL/SQL down to:
- set up sys_context
- execute the above select statmenet
- if a row is returned then return true otherwise return false
Seems more elegant, but the peformance is all that matters.
3) Is there any built-in routine that I may be able to replace pkg.eval_routine from 2 with that would evaulate boolean expressions for me? Or any other way to inline the idea from 1 with 2? I can't think of one given the dynamic nature of the beast, but...maybe there's something I missed.
Thanks everyone! Hopefully I've expressed myself clearly.

Brian - According to Tom Kyte Doing PL/SQL inside Execute Immediate should be faster as you are already within the context of a PL/SQL engine. If we choose to do it in SQL then the PL/SQL engine has to hand it over to the SQL Engine for executing the dynamic Select statements and so might be a little slower. But I am not sure if the difference can be quantifiable unless u do your own test of both evaluators and run them for like a few thousand times in a loop.
If you are using 10g R2 - you might want to look into DBMS_RLMGR package which is the API for the Oracle's version of the embedded business rule manager.
I looked into it but it didn't fit our needs as its deficient with respect to rule versioning and effective and until date based business rule enforcement/ validation.
After taking a shot at designing something home grown I feel its not that difficult to construct one that fit our needs inclusive of the features( rule versioning, effective and until dates) that I listed above as deficiencies in the Oracle embedded rule engine.
If you don't have those requirements may be using the Business Rule manager API of 10g R2 might not be a bad anticipating it will be improved in future versions.
Regards
-Suren

Search MessageSelector sample for complex boolean express with AND, OR, NOT

As far as I know I can specify in the "Message Selector" field of a JMS-PartnerLink
a boolean expression.
How are AND, OR and NOT written here? Can I use brackets?
Can I use blanks inside the boolean expression?
Assume I would like to specify:
((myfield1 > 3.0) && (myfield2 == 777)) || (myfield3 != 'aaa')
Is the syntax correct for this?

http://www.mcs.csueastbay.edu/support/oracle/doc/10.2/server.102/b14257/jm_create.htm
11.3 JMS Point-to-Point Model Features/MessageSelector
that will give you some examples of how to use it

AirPort Express and AirPort Utility Problems

Hi all
As I have posted before I was having some problems with a slow internet connection and pages loading verrrrrrry slooowly in Safari. Used sppedtest.net to test my connection speed and was finding my upload and download speeds to be fine, so I think that it something other than my DSL intenet connection. Also found that I mgiht be having some problems connecting to the internet via my AirPort Express (sometimes I would see a flashing amber light). After searching Google I found out that I should use the AirPort Ulitity to fix the probem. Well in any event yesterday I updated the firmware on the AirPort, but today was still having some problems. No flashing lights today, but just a slow connection that I do not get on a neighbor's network. Today again I opened the AirPort Utility, but get the following message, "No configured base stations have been found. AirPort Utility will continue to searching." My step-dad suggested taking it to local authorized store/service center to see if they could fix it. Only thing is that they will charge me more the cost of a new AirPort Exprees ($99). Also wondering if I were to buy a new AirPort what is the difference between the Express and Extreme. Not sure if this matters, but my step-dad's computer is a 1.83 GHz Intel Core 2 Duo Mac Mini, while I am on a the newest MacPro. For some reasaon I thought I read were the Extreem might be a better choice, as his airport card runs a a slower speed than mine and the Extremw would allow us each to connect at the different speeds, while the Express would not.
One any help in fixxing my problems and answering my questions is greatly appriecated.
Michael

How old is your Airport Express?
This is your main and only wireless base station?
The new Extremem models do have Simultaneous Dual Band frequencies which allows the faster computers to connect to it with less outside interferrence from 2.4 MHz devices.
These units also have a built-in 3 port hub if needed for other devices like printers and computers that don't have wireless.
http://store.apple.com/us/product/MD031LL/A/AirPort-Extreme?fnode=MTY1NDA0Mg
If you have an old express, it may be worth updating at least to a new model or an Airport Extreme.
Entirely up to you.

My Airport Express just stops working. Computer keeps searching for it. DSL modem is OK. Have to unplug Airport Express and replug to get it to work again. Starting happening sporaticaly some time ago, but now it is about once a day, maybe twice a day. Ha

My Airport Express just stops working. Computer keeps searching for it. DSL modem is OK. Have to unplug Airport Express and replug to get it to work again. Starting happening sporaticaly some time ago, but now it is about once a day, maybe twice a day. Has v.6.3 on it. Supposedly up to date.What's the problem?
Has anyone had that happen? Solution? (other than purchase a new one.......)

My Airport Express just stops working. Computer keeps searching for it. DSL modem is OK. Have to unplug Airport Express and replug to get it to work again. Starting happening sporaticaly some time ago, but now it is about once a day, maybe twice a day. Has v.6.3 on it. Supposedly up to date.What's the problem?
Has anyone had that happen? Solution? (other than purchase a new one.......)

Search terms: boolean and exact phrase

I constructed my search terms per the "tips" to find messages containing the exact phrase "save as" and the word corrupt:
"save as" AND corrupt
the search returned a list of messages with the word "corrupt" highlighted as I would have hoped, but it also listed messages with "as" highlighted and even more bizarre, with the word "and" highlighted.
Did I miss something in the discussion of boolean expressions? Do I have to do something special to cause it to treat "and" as an operator instead of as a search string????
and why is it highlighting "as"???

I'm not seeing how that answered any of my questions.
I think my answer goes to this question:
Do I have to do something special to cause it to treat "and" as an operator instead of as a search string????
To:
Nor does it illustrate that the exact phrase operation is working.
You are correct. All it does is help you to get better results than you got using AND.

I just upgraded to OS X 10.6.7 and mail is putting most of my emails in the Spam folder. I move them to the appropriate folder, but is there anything else I can do to "train it"?

You can see that most of my question is the title. I just upgraded to OS X 10.6.7 & have a minor problem. Mail keeps putting most of my emails into the Spam Folder. I then move them to the appropriate folders (I have several email accounts) Will this eventually train the program to know what is spam & what is not or am I stuck with constantly doing this?

Returning to Mail Preferences - Junk Mail, in the section
When junk mail arrives:
select mark as junk mail but leave it in my inbox
This should then give you the opportunity to mark it as Not Junk
and after several days it may improve.
I say 'may improve', based on my experience of when I upgraded to 10.5 a few years ago. It took a while to learn what I kept insisting was not junk. It is a slow learner but it got there.
P.S. When you are satisfied it is identifying junk reasonably accurately, you can change the Preferences setting back to 'Move it to the Junk mail box'
Message was edited by: roam

Create and save boolean expressions for later evaluation

Is it possible to create Boolean expressions by inputs via user interface in LabVIEW and save them for later evaluation? I am interested in creating a 'flexible policy engine' which involves creating 'rules' comprising attribute values of certain attributes of objects based on boolean expressions which can later be used for arriving at some decisions based on the 'rules'.

Hi Belur,
Have you considered building a script based on the boolean expressions that you want to create for the flexible policy and saving the script to file?
Later, you can read the script and depending on the policy, it can re-create the boolean expressions.
A simple way to implement this is by having various pre-defined expressions places into a Case Statement. The script calls the appropriate cases that create the complete expression.
You can store the attributes of the objects and when the vi is running, it can first open the initialization file, read the attributes and set them.
For instance, you can read from and write to Property (and Invoke Nodes) to which you can the attributes.
Unfortunately, I don't have an example of this that I c
an share with you. There may be some if you do a search.
Hope this helps..
JLV

Boolean Expression Searching with UltraSearch

Has anyone out there made UltraSearch use
Boolean Expression Searching along with the
"- and +" searching? I read somewhere that
you need to modify the wk0queryexp.pkb package.
Any help??
Thanks.

... equals Label then "ZCRC_RETAIL_ITEM-LABEL equals Id" is returned
... equals Marke then "ZCRC_RETAIL_ITEM-MARKE equals Id" is returned
ZCRC_RETAIL_ITEM-LABEL equals Id is an unamed range with text "ZCRC_RETAIL_ITEM-LABEL equals Id" and content ZCRC_RETAIL_ITEM-LABEL equals Id. Maybe it also works without any text. BRFplus should compose a text out of the content.

Where did this Spam folder come from and how to I "un-spam" emails?

Hello
I have my email account setup on my iPhone via POP. There is no spam folder on my email server.
Yesterday I noticed hundreds of emails in a spam folder in the folder list on my iPhone. When I log into my webmail this folder is no there, therefore I am thinking the iPhone has created it.
Firstly, how do I stop it from doing this?
Secondly, emails in there are from people who have successfully emailed me in the past without getting filtered into spam so how do I un-spam emails?
Is this spam a new iOS4 feature?
Ultimately I can resetup my email as IMAP but that will delete all the emails in this folder and I don't want to do that (so I suppose I'm going to have to manually move them all right?)
Many thanks for your help
Ken

If you are using Gmail, it is the All Mail label that has always existed, but Snow Leopard didn't show it.
You can disable it in Gmail's settings under Labels. Set it to not show in IMAP.
Some people experience problems when doing that, though. I did not.
I set up my Gmail as shown in this blog post: http://jeffschuette.com/2012/03/07/setting-up-apple-mail-to-rock-and-roll-with-g mail/
I didn't want Gmail storing emails that I had deleted, so I used his setup to stop it, and I also hid the All Mail folder from Mail.

Search problems : Boolean expressions and spam folder

Similar Messages

Maybe you are looking for