Puzzled by search

My 3000 J115 A11: Every time I shut it down or restart it a program launches that runs a long time and hogs all of the processing time. This is really irritating. My computer is useless until this thing does its thing. I have checked the Events log for the time slot when it begins to run and it is always a service titled SEARCH. Why does it do this? How do I turn the program off so it will stop doing this?

Newman welcome to the forums!
Which OS are you using?did you install any desktop search engine if you are using xp?
Cheers and regards,
• » νιנαｿѕαяα∂нι ѕαмανє∂αм ™ « •
●๋•کáŕádhí'ک díáŕý ツ
I am a volunteer here. I don't work for Lenovo

Similar Messages

Part II - Playing Ping-Pong ... now with KaLin?

Just call me flummoxed ...
I went to my "profile page for the forum" by clicking on my name. (So far so good)
I looked "at the top of the middle column," (Puzzled, I search for KaLin's promised support.)
THERE IS NOTHING REMOTELY RESEMBLING "an area titled "My Private Support Cases," nor any selection that leads to "My Private Support Cases."
THERE IS NO LINK to "the private board where you and the agent may exchange information."
And thus, it seems like the ping-pong game continues ...
I used to wonder why nobody responded to their original posts with updates. It appears that moderators prevent this from happening.
Eager for assistance, I remain yours sincerely,
marlowrog

Please check your Private Message Inbox. It should look like this -->>
If a forum member gives an answer you like, give them the Kudos they deserve. If a member gives you the answer to your question, mark the answer that solved your issue as the accepted solution.

Word Search Puzzle Interest

Recently during my lunch time I was playing an old Infocom text adventure game that had a word search puzzle in it. I was really bored (hey, I was playing an old Infocom game!) so I decided to whip up a LabVIEW program to do this word search. Way overkill, obviously, but it was something to keep me busy. I tried out a couple of different ideas for an implementation and finally settled on one to do the word search. It's not optimized, but it works. I then started to wonder if this would make for an interesting coding challenge. That is, to come up with the fastest algorithm that could find a list of words in a given matrix of letters. The solution would have to be scalable so that it could accommodate very large matrices without choking, as well as be spoken-language independent. Any interest?

sure. you can use mousedown code to start a loop that checks the mouse/finger position and determine (on mouseup) if a word has been found and then display a highlight sprite/movieclip.

8-Puzzle Depth First Search .. Need Help

Hi, I have the following code for doing a depth first search on the 8-Puzzle problem
The puzzle is stored as an object that contains an array such that the puzzle
1--2--3
4--5--6
7--8--[] is stored as (1,2,3,4,5,6,7,8,0)
The class for the puzzle is:
class Puzzle implements {
     Puzzle parent;
     int[] pzle;
     int blank;
     Puzzle(int p1,int p2,int p3,int p4,int p5, int p6, int p7, int p8, int p9){
          pzle = new int[9];
          pzle[0] = p1; if(p1==0){ blank=0;}
          pzle[1] = p2; if(p2==0){ blank=1;}
          pzle[2] = p3; if(p3==0){ blank=2;}
          pzle[3] = p4; if(p4==0){ blank=3;}
          pzle[4] = p5; if(p5==0){ blank=4;}
          pzle[5] = p6; if(p6==0){ blank=5;}
          pzle[6] = p7; if(p7==0){ blank=6;}
          pzle[7] = p8; if(p8==0){ blank=7;}
          pzle[8] = p9; if(p9==0){ blank=8;}
     public Puzzle() {
     public boolean equals(Puzzle p){
          if(p == null) return false;
          for(int i =0;i<9;i++){
               if(p.pzle!=pzle[i]){
                    return false;
          return true;
     public String toString(){
          return pzle[0] + "\t" + pzle[1] + "\t" + pzle [2] + "\n" +
                    pzle[3] + "\t" + pzle[4] + "\t" + pzle [5] + "\n" +
                    pzle[6] + "\t" + pzle[7] + "\t" + pzle [8] + "\n";
     public String printSolution(){
          String ret ="";
          Puzzle st = parent;
          while(st!=null){
               ret = st + "\n=======================\n" + ret;
               st = st.parent;
          ret=ret+this;
          return ret;
     public ArrayList<Puzzle> successors(){
          ArrayList<Puzzle> succ = new ArrayList<Puzzle>();
          int b = blank;
          if (((b-1) % 3) != 2 && b!=0) {
          Puzzle np1 = new Puzzle();
          np1.parent = this;
          np1.pzle = new int[9];
          for(int i =0;i<9;i++){
               np1.pzle[i] = pzle[i];
          np1.pzle[b] = np1.pzle[b-1]; np1.pzle[b-1] = 0;
          np1.blank = b-1;
          if(!np1.equals(this.parent)){
          succ.add(np1);
          if (((b+1) % 3) != 0) {
          Puzzle np2 = new Puzzle();
          np2.parent = this;
          np2.pzle = new int[9];
          for(int i =0;i<9;i++){
               np2.pzle[i] = pzle[i];
          np2.pzle[b] = np2.pzle[b+1]; np2.pzle[b+1] = 0;
          np2.blank = b+1;
          if(!np2.equals(this.parent)){
               succ.add(np2);
          if (b-3 >= 0) {
          Puzzle np3 = new Puzzle();
          np3.parent = this;
          np3.pzle = new int[9];
          for(int i =0;i<9;i++){
               np3.pzle[i] = pzle[i];
          np3.pzle[b] = np3.pzle[b-3]; np3.pzle[b-3] = 0;
          np3.blank = b-3;
          if(!np3.equals(this.parent)){
               succ.add(np3);
          if (b+3 < 9) {
          Puzzle np4 = new Puzzle();
          np4.parent = this;
          np4.pzle = new int[9];
          for(int i =0;i<9;i++){
               np4.pzle[i] = pzle[i];
          np4.pzle[b] = np4.pzle[b+3]; np4.pzle[b+3] = 0;
          np4.blank = b+3;
          if(!np4.equals(this.parent)){
               succ.add(np4);
          return succ;
     The code for the DFS is      public static boolean DFS(Puzzle p, Puzzle goal, ArrayList<Puzzle> closed){
     if(p.equals(goal)){
          sol=p;
          return true;
     for(Puzzle pz : closed){
               if(pz.equals(p)){
                    return false;
     closed.add(p);
                    //Generate all possible puzzles that can be attained
                    ArrayList<Puzzle> succ = p.successors();
                    for(Puzzle puz : succ){
                         if(DFS(puz,goal,closed)){ return true;}
          return false;
}The problem is that when i run this on say the following start and goal:          Puzzle startP = new Puzzle(5,4,0,6,1,8,7,3,2);
          Puzzle goalP =new Puzzle(1,2,3,8,0,4,7,6,5);
          ArrayList<Puzzle> closed = new ArrayList<Puzzle>();
          startP.parent=null;
          boolean t = DFS(startP,goalP,closed);5-4-0
6-1-8
7-3-2
start and goal
1-2-3
8-0-4
7-6-5
it first takes foreever which is expected but it There should be 9! possible states correct? If I print out the size of the closed array (already seen states) it gets up to about 180000 and then returns with no solution found. But this is well under the 9! possible states...
Its hard to know whats wrong and if it is even wrong.. but could someone please look at my code and see if something is off?
I dont think the successor generator is wrong as I tested the blank in every space and it got the correct successors.
Any ideas?

Puzzle(int p1,int p2,int p3,int p4,int p5, int p6, int p7, int p8, int p9){
          pzle = new int[9];
          pzle[0] = p1; if(p1==0){ blank=0;}
          pzle[1] = p2; if(p2==0){ blank=1;}
          pzle[2] = p3; if(p3==0){ blank=2;}
          pzle[3] = p4; if(p4==0){ blank=3;}
          pzle[4] = p5; if(p5==0){ blank=4;}
          pzle[5] = p6; if(p6==0){ blank=5;}
          pzle[6] = p7; if(p7==0){ blank=6;}
          pzle[7] = p8; if(p8==0){ blank=7;}
          pzle[8] = p9; if(p9==0){ blank=8;}
     }vs
Puzzle(int...puzzle) {
assert puzzle.length == 9;
this.puzzle = Arrays.copyOf(puzzle, 9);
for (int blank = 0; blank < 9; ++blank) if (puzzle[blank] == 0) break;
// check values are 0...8
Arrays.sort(puzzle); // sorts the original
for (int i = 0; i < 9; ++i) assert puzzle[i] == i;
Does anyone know if there are any simple applets or programs that do 8 Puzzle on any given start and finish state? Just to see the expected results.Not off hand, but you can always generate your starting state by moving backwards from the finish state.
Also, I dont know..but are there some instances of an 8 Puzzle that cannot be solved at all?? IIRC, you can't transform 123 to 132 leaving the remainder unchanged, though I haven't checked.

Puzzle: Can you figure out why my site isn't Search Engine Optimized?

Hello community,
I launched my first website for a client, http://www.extremecrossfit.net/index.html, and I cannot figure why it is not displaying in any of the Google rankings.
Things I have done:
Created paragraph tags, (H1 and P) to place on pages.
Given all images titles & names.
Filled Metadata with keywords and description.
Placed links.
Provided Site Map in Google Webmaster tools.
Perhaps I am impatient. Perhaps I've done something wrong. The site has only been live 1-2 weeks, so perhaps I just need to wait.
Any advice is eternally welcome! Thank you.
CJ
http://www.extremecrossfit.net/index.html

You seem to have done most things correctly. Try changing or adding the Meta Page description to say or add "Martinsburg West Virginia W.Va Crossfit etc. " The word crossfit has lots of competing sites and if you narrow your search criteria, its quite possible that you will be found when someone searches for crossfit W.Va.
Also showing up in search engines and ranking takes several weeks to months.

Word Puzzle still not working

I have written the code to take a text file (from a command line argument) holding the information for the word find grid and also the file holding the words to be found in the grid. The whole find the two files and drop them into memory works all peachy keen but the rest of the program doesn't work for some oddball reason that I can't figure out (and the TAs are useless as usual). I dropped in print statements all over the world to see why it's not working but all I can see is that I hit the method SolvePuzzle and don't actually get any further than the print statement.
Just so you know, all of the methods in the program do work as I wrote them for another version of the same puzzle...it was just that I had to change the program to run with command line arguments instead of asking the user to input the file names. Please, can someone take a look at this monstrous mess and tell me how on earth I get the stupid thing to output correctly?
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
// WordFind class interface: solve word search puzzle
// CONSTRUCTION: with no initializer
// ******************PUBLIC OPERATIONS******************
// int solvePuzzle( )   --> Print all words found in the
//                          puzzle; return number of matches
public class WordFind
     * Constructor for WordFind class.
     * Prompts for and reads puzzle and dictionary files.
   public WordFind(String fname, String fname2 ) throws IOException
        loadPuzzle(fname, fname2);
        //solvePuzzle( );
     * Routine to solve the word search puzzle.
     * Performs checks in all eight directions.
     * @return number of matches
    public int solvePuzzle( )
        int matches = 0;
        for( int r = 0; r < rows; r++ )
            for( int c = 0; c < columns; c++ )
                for( int rd = -1; rd <= 1; rd++ )
                    for( int cd = -1; cd <= 1; cd++ )
                        if( rd != 0 || cd != 0 )
                            matches += solveDirection( r, c, rd, cd );
System.out.println("testing to see if we get BBOOOOO.");
        return matches;
     * Search the grid from a starting point and direction.
     * @return number of matches
    private int solveDirection( int baseRow, int baseCol, int rowDelta, int colDelta )
    System.out.println("testing to see if we get this far part 2.");
        String charSequence = "";
        int numMatches = 0;
        int searchResult;
        charSequence += theBoard[ baseRow ][ baseCol ];
        for( int i = baseRow + rowDelta, j = baseCol + colDelta;
                 i >= 0 && j >= 0 && i < rows && j < columns;
                 i += rowDelta, j += colDelta )
            charSequence += theBoard[ i ][ j ];
            searchResult = prefixSearch( theWords, charSequence );
            if( searchResult == theWords.length )
                break;
            if( !((String)theWords[ searchResult ]).startsWith( charSequence ) )
                break;
            if( theWords[ searchResult ].equals( charSequence ) )
                numMatches++;
                System.out.println( "Found " + charSequence + " at " +
                                    baseRow + " " + baseCol + " to " +
                                    i + " " + j );
        return numMatches;
     * Performs the binary search for word search.
     * @param a the sorted array of strings.
     * @param x the string to search for.
     * @return last position examined;
     *     this position either matches x, or x is
     *     a prefix of the mismatch, or there is no
     *     word for which x is a prefix.
    private static int prefixSearch( Object [ ] a, String x )
    System.out.println("testing to see if we get this far part 3.");
        int idx = Arrays.binarySearch( a, x );
        if( idx < 0 )
            return -idx - 1;
        else
            return idx;
     private void loadPuzzle(String fname, String fname2)
      String oneLine;
      try {
         // open file for reading
         wsFile = new BufferedReader(new FileReader(fname));
         // get the row and columns
         oneLine = wsFile.readLine();
        List puzzleLines = new ArrayList( );
        if( ( oneLine = wsFile.readLine( ) ) == null )
            throw new IOException( "No lines in puzzle file" );
        int columns = oneLine.length( );
        puzzleLines.add( oneLine );
        while( ( oneLine = wsFile.readLine( ) ) != null )
           // if( oneLine.length( ) != columns )
           //     System.err.println( "Puzzle is not rectangular; skipping row" );
           // else
                puzzleLines.add( oneLine );
        int rows = puzzleLines.size( );
        theBoard = new char[ rows ][ columns ];
        Iterator itr = puzzleLines.iterator( );
        for( int r = 0; r < rows; r++ )
            String theLine = (String) itr.next( );
            theBoard[ r ] = theLine.toCharArray( );
               System.out.println(theBoard[r]);
      //BufferedReader wsFile2;
      //ring oneLine;
      try {
         // open file for reading
         wsFile2 = new BufferedReader(new FileReader(fname2));
         List words = new ArrayList( );
        String lastWord = null;
        String thisWord;
        while( ( thisWord = wsFile2.readLine( ) ) != null )
           // if( lastWord != null && thisWord.compareTo( lastWord ) < 0 )
             //   System.err.println( "Dictionary is not sorted... skipping" );
              // continue;
            words.add( thisWord );
            lastWord = thisWord;
        theWords = words.toArray( );
        System.out.println(words);
      catch (FileNotFoundException e)
         System.out.println("File not found.");
      catch (IOException e)
         System.out.println("IO error.");
     //solvePuzzle();
      // Cheap main
    public static void main( String [ ] args )
      String fname = args[0];
          String fname2 = args[1];
       // String fname = "cahsiers.txt";
        //String fname2 = "cashwords.txt";
        WordFind p = null;
            try{
                System.out.println(args[0] + " " + args[1]);
            p = new WordFind(fname, fname2);
                  catch (IOException e)
         System.out.println("IO error.");
             System.out.println( "Solving..." );
        p.solvePuzzle( );
   private char [][] theBoard;
   private int rows, columns;
   private Object [] theWords;
   private int numWords;
     private BufferedReader wsFile;
   private BufferedReader wsFile2;
}Sample output - notice the only output are the test print statements at the moment
cashiers.txt cashwords.txt
BSERENITYNZEKYI
ZBREAMOANARHECM
BBASSWGITOOLKAY
QSCENERYTNLCYMM
TUORTIASEAUBDPA
JZIVVVYYVDXOWSE
FSSENREDLIWAMIR
FIRSEHRSPNLTLTT
CLSCUILRTLYKAES
XAOHQKFOEFYLUSR
ORBGIIWYDSAQLEM
GEYITNEFPGOROEA
EKALNGGAXRERCGJ
TEKRAMSGCAFETOY
[ANTIQUE, BASS, BOAT, BREAM, CABIN, CAFE, CAMPSITE, CRAFTS, CROQUET, DOWNTOWN, D
UCK, FISHING, GEESE, GOLF, GROCERY STORE, HIKING, HONEY, INN, JAM, JELLY, LAKE,
LODGE, MARKET, MOUNTAIN, POND, PRESERVES, RELAXATION, RESORT, RIVER, SCENERY, SE
RENITY, SPA, STREAM, TROUT, VACATION, VALLEY, VIEW, WALLEYE, WILDERNESS, ]
Solving...
testing to see if we get BBOOOOO.
Press any key to continue...
Thanks for all your help.
Wulf

Your problem is the duplicate declarations of rows/columns
class fields
private int rows, columns;
and in loadPuzzle()
int columns = oneLine.length( );//remove int
int rows = puzzleLines.size( );//ditto
the 'int' makes rows/columns local to loadPuzzle(), leaving the class fields rows/colums = 0
the for loops of solvePuzzle() are not executed because rows = 0
also, in loadPuzzle() you seem to have an extra readLine() at the top. This could be by design, but you will lose the first line
// get the row and columns
oneLine = wsFile.readLine();//<--------------
List puzzleLines = new ArrayList( );

How do I get rid of Yahoo search from starting in the creation of a new tab?

my home page works correctly and I have removed the Yahoo tool bar from plugins/apps (can't remember which) But whenever I open a new tab it opens on this
http://search.yahoo.com/?fr=freeze&type=W3i_NA,132,3_6,Tab%20Search,20110520,16934,0,19,0
I would like it to open on my home page, which firefox does on startup. But I can't find a setting in options that will allow you to dictate what first appears when opening a new tab.
I tried this solution but it didn't work
https://support.mozilla.com/en-US/questions/811550?s=getting+rid+of+yahoo+search&as=s

Do you also have a search bar on your tabs bar if so, it is probably "New Tab" extension, but suggest going through all of the following.
'''Remove the Yahoo Toolbar'''
# "Ctrl+Shift+A" (Add-ons Manager)
# Select Puzzle piece on left-side for Extensions List
# Find "Yahoo Toolbar" and click on "Uninstall" button, and restart Firefox. ''(if you really need to keep the Yahoo toolbar, you can hide the toolbar instead with customize, and still change all the search defaults as below)''
'''Then to fix the default search engine''' used at the Location Bar, change the value of '''keyword.URL''' in '''about:config''' to one of the values shown in [http://kb.mozillazine.org/Location_Bar_search#Location_Bar_search_.28external_-_search_engine.29 Location Bar search] at MozillaZine.
* Google Search (Google search results page)<br>'''http://www.google.com/search?ie=UTF-8&oe=UTF-8&q='''
# type in '''about:config''' into the location bar (in a new tab)
# if the warning message nonsense comes up ''uncheck'' the box '''before''' dismissing the dialog message
# '''filter on keyword'''
# right-click on '''keyword.URL''' and choose "modify" then paste in the Google search engine string of your choice.
# '''filter on defaulturl'''
# right-click on '''browser.search.defaulturl''' ''(if it exists)''and again choose "modify" then paste in the Google search engine string of your choice.
# '''filter on ytff'''
# right-click on '''yahoo.ytff.search.popup_src''' ''(if it exists)'' and again choose "modify" then paste in the Google search engine string of your choice, if adventurous might see if "reset" would remove and see if gone in next session (well not for those keeping the extension).<br
>--above used in https://support.mozilla.com/questions/850287
#If new tabs open with a Yahoo search, then in "C:\program files\Mozilla Firefox: Find the yahoo.xml file and delete it ([/questions/892957])
#If you find an extension call "New Tab" uninstall it (it is unwanted malware), this little gem came with a reinstall of "PicPick" software for me and adds a search bar to the already overcrowed tabs bar, when doing the reinstall update for PicPic do a custom install without anything relating to yahoo.
'''Avoiding the problems:''' Many software installations contain additional baggage known as crapware. The Yahoo Toolbar is packaged with Java [http://imageshack.us/photo/my-images/266/javainstall.png/ picture]
More information on ask.com, Yahoo Toolbars which involve extensions, not just changes to the home page.
* http://kb.mozillazine.org/Problematic_extensions
* Uninstalling toolbars - MozillaZine Knowledge Base<br>http://kb.mozillazine.org/Uninstalling_toolbars

Feedback: search within attachments needed in mail

Hello,
I really need to be able to search within attachments within mail.
Specifically I need to be able to search within attached PDF and Word documents, through my entire email store.
it is important that it searches within all emails, regardless of whether or not the attachment has been saved to disk. I am aware that attachments saved to disk are searched but this is no substitute at all for being able to search through my 30,000 or so emails. Also I need to see the results within the email program, not within Spotlight.
Searching within attachments seems such an obviously needed feature, its a puzzle as to why it is not there.
Thanks
Andrew

The puzzle for me is that in fact, in Leopard 10.5.2 and Mail 3.2, Mail.app sometimes searches into attachments, sometimes not.
More specifically: I produced a message with a Word attachment with a infrequent word in it. I sent it to various account I have in Mail, and then searched for the word. Some of the messages are found others not. I cannot find a pattern. Sucessive forwards of the same message to the same account produce disfferent results (some of the messages show up in search others not).
This seems to be message related: if a message shows it will always show, and vice-versa.
Joaquim

How to search a char in 2d array any direction

the method will take a string argument and convert them into char and try to find them in a 2d array.
It is more like a word puzzle(wordSearcher).Here's what i've done so far...
public void find(String word)
for(int a = 0; a < word.length(); a++) {
char oneChar = word.charAt(a);
String oneStringchar = String.valueOf(oneChar);
// Searching through in South Direction
for(int i = 0; i < g.length; i++) {
for(int j = 0 ; j < g.length ; j++) {
if (oneChar == g[j]) {
canvas.draw(oneStringchar, (i * WORD_SIZE) + POS_X, (j * WORD_SIZE) + POS_Y);
}

   // Searching through in South Direction
   for(int i = 0; i < g.length; i++) {
      for(int j = 0 ; j < g.length ; j++) {
if (oneChar == g[i][j]) {
canvas.draw(oneStringchar, (i * WORD_SIZE) + POS_X, (j * WORD_SIZE) + POS_Y);

How to search a word in a 2d array

Hi, i'm seeking advice on how to search a word in 2d array. The method will only taking one argument string and will search in row by row, column by column and diagonall down and up. for example, user input String "SEEK" or then the method will have different search pattern to locate the word. Here is the 2d array look like.
S + K E E S + +
E + + + + + + K
E S + + + + + E
K + E + + + + E
+ + + E + + + S
+ + + + K + + +
What i've done so far is;
// this loop is for search SEEK column by column
public boolean finder(String w){
for(int j = 0; j < puzzle[0].length; j++) {
for(int a = 0; a < w.length(); a++) {
char n = w.charAt(a);
String r = String.valueOf(n);
if (puzzle[0][j] != w.charAt(a)) {
return false
} else {
return true;

read this

How do I set Google as the default search engine in Firefox 5? I have tried several fixes but I keep getting a Yahoo search instead of Google.

I want to use Google as my search engine but no matter what settings I change the default search engine is always Yahoo.
Also I would like to have the feature back where when I open a new tab it shows frequently used pages that I can click on and open.

'''Remove the Yahoo Toolbar'''
# "Ctrl+Shift+A" (Add-ons Manager)
# Select Puzzle piece on left-side for Extensions List
# Find "Yahoo Toolbar" and click on "Uninstall" button
'''Then to fix the default search engine''' used at the Location Bar, change the value of '''keyword.URL''' in '''about:config''' to one of the values shown in [http://kb.mozillazine.org/Location_Bar_search#Location_Bar_search_.28external_-_search_engine.29 Location Bar search] at MozillaZine.
* Google Search (Google search results page)<br>'''http://www.google.com/search?ie=UTF-8&oe=UTF-8&q='''
# type in '''about:config''' into the location bar
# if the warning message nonsense comes up uncheck the box before dismissing the dialog message
# '''filter on keyword'''
# right-click on '''keyword.URL''' and choose "modify" then paste in the Google search engine string of your choice.
'''More information on configuration variables''' available in
[http://kb.mozillazine.org/About:config_entries about:config entries] and for users not familiar with the process there is [http://kb.mozillazine.org/About:config about:config] (How to change).

Search with "Current Node + All Subfolders" not functioning correctly

Hi,
We are having an issue with the search function of SCCM 2012 Admin Console. We have built multi-level folder structure to SCCM which matches our organizational unit structure in AD.
The issue occurs when trying to search with "Current Node + All Subfolders" option in a folder to get listing of all collections nested in the structure. As a result we get incomplete list of collections and majority of them are not showing
up. Sometimes the console even crashes when trying to do this kind of search. Note that this behaviour only occurs when searching inside a folder, not in the device collections root node.
We managed to trace the SQL query in the above situation from SMSProv.log, and it is as follows:
select all SMS_Collection.SiteID,SMS_Collection.CollectionType,SMS_Collection.CollectionVariablesCount,SMS_Collection.CollectionComment,SMS_Collection.CurrentStatus,SMS_Collection.HasProvisionedMember,SMS_Collection.IncludeExcludeCollectionsCount,SMS_Collection.IsBuiltIn,SMS_Collection.IsReferenceCollection,SMS_Collection.LastChangeTime,SMS_Collection.LastMemberChangeTime,SMS_Collection.LastRefreshTime,SMS_Collection.LimitToCollectionID,SMS_Collection.LimitToCollectionName,SMS_Collection.LocalMemberCount,SMS_Collection.ResultClassName,SMS_Collection.MemberCount,SMS_Collection.MonitoringFlags,SMS_Collection.CollectionName,SMS_Collection.PowerConfigsCount,SMS_Collection.RefreshType,SMS_Collection.ServiceWindowsCount from vCollections AS SMS_Collection where (SMS_Collection.SiteID
in (select all Folder##Alias##810314.InstanceKey from vFolderMembers AS Folder##Alias##810314
where (Folder##Alias##810314.ObjectTypeName = N'SMS_Collection_Device'
AND Folder##Alias##810314.ContainerNodeID in
(16777237,16777374,16777384,16777385,16777375,16777376,16777377,16777378)))
AND SMS_Collection.CollectionType = 2) order by SMS_Collection.CollectionName
From this we noticed that not all ContainerNodeIDs are searched, but a list of only 8 ContainerNodeIDs. These ContainerNodeIDs remain the same if the search is done again in the same folder. The same behaviour repeats also in other folders with a different
list of ContainerNodeIDs.
For clarification I'll attach a picture which shows our folder structure with ContainerNodeIDs and ParentContainerIDs. We have also marked the containers which were present in SQL statement. From this you can clearly see there should have been far more ContainerNodeIDs
than listed in the SQL query. Is this a bug in the admin console or could this be a problem with our site database? Is anyone else experiencing similar issues? We have written a custom
powershell script that reads containers from SMS_ObjectContainerNode WMI-class recursively and is able to return complete list of folders and their subfolders, so we assume that our site database and WMI on site server is functioning correctly.
We noticed this on CU2 (could have been present also earlier) and updating to CU3 did not fix the problem. Currently we are running SCCM 2012 SP1 CU3 with one primary site. All components besides distribution point is running on the site server. Distrubution
point is running on a separate server. Our SQL server is running on the site server.
Best Regards,
Juha-Matti

Sorry for the very long delay. I created the ticket in the autumn of last year and just received the final verdict to this issue.
Microsoft support said they were able to reproduce the problem and that they contacted the product group about this issue. It turns out that this behaviour is by design (wait, what?) and since it is by design there is nothing they
can/will do about it.
So the only choice is to request a tailored customization for SCCM2012, which probably in this case (as it is by design) would cost.
I feel a bit puzzled: how can it be by design if it clearly does not work?

HT4314 i'm new and i don't know haw to access a new crossword puzzle, the one i already completed keeps coming up...how does one get to the next puzzle?

in crosswords how does one advance to the next puzzle please, thanks

Re: That garbage is unreadable.
If you really want help, stop messing with the fonts and post so that others can read and offer suggestions.
Or better yet... try a search, I'm certain you'll find a solution to whatever issue you're experiencing.
I have found that many times it is the things that make you most angry that push you to action. This was the case here. Thank you for causing me to get so angry that I found the answer myself.

Web content interactivity puzzler

Hi all,
Hope someone can offer me a way forward on something I'm puzzling over. We're currently developing an App which (we hope!) involves a clickable map with various points of interest, so that when the user taps on one, the visible content in a second frame (an MSO) changes to provide info.
Seems like it should be simple enough, but the map issue is giving me a headache – is there any way of using HTML in the web content to control the state of the MSO? This would allow the user to zoom the map in and out and then tap on Point-of-interest markers to alter the MSO.
The obvious workaround is to effectively make the map a static image with a layer of invisible buttons on top so the user just pans around on it - we'll settle for that if necessary, and it won't be the end of the world because we want the map to function offline anyway, but I still really wanted to use OpenStreetMap/OpenLayers so that the whole thing would "work" as a map rather than an image, with tiled zoomability, layered overlays, and geolocation if the user opts for it...
Any thoughts, or is this the kind of thing you can only do by learning Objective C and Cocoa?
Thanks in advance!
Giles

Hello Giles,
Today, while searching for how to add Google Maps to dps, I found this post, and I thought it would probably give you a clue on how to achieve what you want, it's based on the google maps API, but is a very interesting solution. I hope it helps.
http://googlemapsmania.blogspot.com.br/2009/08/design-portfolios-on-google-maps.html
Please, if you try, let us know if it worked.
Regards and good luck.
Diego

Searching a char in 2d array any direction

the method will take a string argument and convert them into char and try to find them in a 2d array.
It is more like a word puzzle(wordSearcher).Here's what i've done so far...
public void find(String word)
for(int a = 0; a < word.length(); a++) {
char oneChar = word.charAt(a);
String oneStringchar = String.valueOf(oneChar);
// Searching through in South Direction
for(int i = 0; i < g.length; i++) {
for(int j = 0 ; j < g.length ; j++) {
if (oneChar == g[j]) {
canvas.draw(oneStringchar, (i * WORD_SIZE) + POS_X, (j * WORD_SIZE) + POS_Y);
}

Here's something I did a while back, type in any text in the top text area (ensure it's a grid eg 8 x 8),
then the words to find (one per line) in the lower text area. If found, the co-ords of the word are displayed.
import javax.swing.*;
import java.awt.*;
import java.awt.event.*;
import java.util.*;
class WordFinder extends JFrame implements ActionListener
private static JButton goBtn = new JButton("Search");
private static JTextArea taLetters = new JTextArea(10,25);
private static JTextArea taWords = new JTextArea(10,25);
private static int base = 0;
private static String letters = "";
private static String words[];
private static boolean match = false;
private static String taWordsNewText = "";
public static void main(String args[])
    WordFinder wf = new WordFinder();
public WordFinder()
    super("Word Finder");
    setSize(300,80);
    setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
    setVisible(true);
    Container frame = getContentPane();
    frame.setLayout(new BorderLayout());
    JScrollPane spLetters = new JScrollPane (taLetters);
    JScrollPane spWords = new JScrollPane (taWords);
    goBtn.addActionListener(this);
    JPanel mid = new JPanel(new FlowLayout());
    JLabel infoLbl = new JLabel("'letters' above, 'words to find' below");
    mid.add(infoLbl);
    mid.add(goBtn);
    frame.add(spLetters,BorderLayout.NORTH);
    frame.add(mid,BorderLayout.CENTER);
    frame.add(spWords,BorderLayout.SOUTH);
    pack();
    setContentPane(frame);
public void actionPerformed(ActionEvent ae)
    letters = "";
    taWordsNewText = "";
    if(lettersAndWordsOK()) findTheWords();
private static boolean lettersAndWordsOK()
    StringTokenizer st = new StringTokenizer(taLetters.getText(),"\n");
    int count = st.countTokens();
    if(count == 0)
      JOptionPane.showMessageDialog(null,
        "no letter details entered");
      return false;
    String line = "";
    while(st.hasMoreTokens())
      line = st.nextToken();
      if(line.length() != count)
        JOptionPane.showMessageDialog(null,
        "check letters - not a perfect grid \n e.g. 8 x 8");
        return false;
      else
        letters = letters + line;
    st = new StringTokenizer(taWords.getText(),"\n");
    words = new String[st.countTokens()];
    if(words.length > 0)
      for(int i = 0; i < words.length; i++)
        words[i] = st.nextToken();
    else
      JOptionPane.showMessageDialog(null,
        "no listing for words to find");
        return false;
    base = count;
    return true;
private static void findTheWords()
    for(int i = 0; i < words.length; i++)
      int ii;
      for(ii = 0; ii < letters.length(); ii++)
        match = false;
        if(letters.substring(ii,ii+1).equals(words.substring(0,1)))
checkNextLetter(ii,0,1,words[i]);
if(match)break;
if(ii == letters.length()) taWordsNewText += words[i]+" (not found)\n";
taWords.setText(taWordsNewText);
private static void checkNextLetter(int currentPos, int direction,
int textPos,String wordToFind)
if(direction == 0)
int directions[] = {-(base+1),-base,-(base-1),-1,1,base-1,base,base+1};
for(int x = 0; x < directions.length;x++)
checkNextLetter(currentPos,directions[x],textPos,wordToFind);
if(match) break;
else
int nextPos = currentPos + direction;
if(letters.substring(currentPos,currentPos+1).equals(
wordToFind.substring(textPos-1,textPos)))
if(textPos == wordToFind.length())
match = true;
String startCoords = "("+(currentPos - (direction*
(wordToFind.length()-1)))/base+","+(currentPos - (direction*
(wordToFind.length()-1)))%base +")";
String endCoords = "("+(currentPos/base)+","+(currentPos%base)+")";
taWordsNewText += wordToFind+" "+startCoords+" - "+endCoords+"\n";
return;
else if(nextPos >= 0 && nextPos < Math.pow(base,2) &&
Math.abs(currentPos%base - nextPos%base) <= 1)
checkNextLetter(nextPos,direction,textPos+1,wordToFind);

Puzzled by search

Similar Messages

Maybe you are looking for