Spiral in Rectangular algorithm, Please help!

I'm trying to spiral around in a rectangle shape (clockwise) but can't seem to get it to work properly with any sized rectangle.
Here is what I have so far...
public class Test {
    private static final int RIGHT = 0;
    private static final int DOWN = 1;
    private static final int LEFT = 2;
    private static final int UP = 3;
    public static void main (String[] args) {
        int x = 100;
        int y = 100;
        int xTol = 3;
        int yTol = 3;       
        boolean searching = true;
        int minX = x - xTol;
        int maxX = x + xTol;
        int curX = x;
        int minY = y - yTol;
        int maxY = y + yTol;
        int curY = y;
        int direction = 0; // 0 = right, 1 = down, 2 = left, 3 = up
        int checks = 1;
        // Initial Compare.
        System.out.println("ini Compare:\tcurX: " + curX + " curY: " + curY);
        int rightFinish = 0;
        int downFinish = 0;
        int leftFinish = 0;
        int upFinish = 0;
        int compCount = 0;
        while (searching) {
            switch (direction) {
                case RIGHT:
                    for (int i = 0; i != checks; ++i) {
                        ++curX;
                        System.out.println("RIGHT Compare:\tcurX: " + curX + " curY: " + curY);
                    direction++;
                    rightFinish = curX;
                    break;
                case DOWN:
                    for (int i = 0; i != checks; ++i) {
                        ++curY;
                        System.out.println("DOWN Compare:\tcurX: " + curX + " curY: " + curY);
                    direction++;
                    downFinish = curY;
                    break;
                case LEFT:
                    for (int i = 0; i != checks; ++i) {
                        --curX;
                        System.out.println("LEFT Compare:\tcurX: " + curX + " curY: " + curY);
                    direction++;
                    leftFinish = curX;
                    break;
                case UP:
                    for (int i = 0; i != checks; ++i) {
                        --curY;
                        System.out.println("UP Compare:\tcurX: " + curX + " curY: " + curY);
                    direction = 0;
                    upFinish = curY;
                    break;
            if (++compCount >= 2) {
                compCount = 0;
                ++checks;
            if (rightFinish == maxX && downFinish == maxY && leftFinish == minX && upFinish == minY) {
                System.out.println(direction);
                break;
}The above code almost accomplishes what I want but not quite.
Ultimately i want to create a "rectangle" out of dots by specifying a maxX, maxY, minX and minY in clockwise form.
IE the output would be something like:
ini Compare:     curX: 100 curY: 100
RIGHT Compare:     curX: 101 curY: 100
DOWN Compare:     curX: 101 curY: 101
LEFT Compare:     curX: 100 curY: 101
LEFT Compare:     curX: 99 curY: 101
UP Compare:     curX: 99 curY: 100
UP Compare:     curX: 99 curY: 99
RIGHT Compare:     curX: 100 curY: 99
RIGHT Compare:     curX: 101 curY: 99
RIGHT Compare:     curX: 102 curY: 99
DOWN Compare:     curX: 102 curY: 100
DOWN Compare:     curX: 102 curY: 101
DOWN Compare:     curX: 102 curY: 102
LEFT Compare:     curX: 101 curY: 102
LEFT Compare:     curX: 100 curY: 102
... and so on until complete. The above code almost makes a square but would not work for rectangle.

Jardium wrote:
OK, but you thought about the algorithm, corrected little errors within it, etc. without viewing the points on the screen?
How can you be sure that the points which are generated by your program really make up a spiral? Just by reading them?As in my original post the output of the code I write is:
ini Compare: curX: 100 curY: 100
RIGHT Compare: curX: 101 curY: 100
DOWN Compare: curX: 101 curY: 101
LEFT Compare: curX: 100 curY: 101
LEFT Compare: curX: 99 curY: 101
UP Compare: curX: 99 curY: 100
UP Compare: curX: 99 curY: 99
RIGHT Compare: curX: 100 curY: 99
RIGHT Compare: curX: 101 curY: 99
RIGHT Compare: curX: 102 curY: 99
DOWN Compare: curX: 102 curY: 100
DOWN Compare: curX: 102 curY: 101
DOWN Compare: curX: 102 curY: 102
LEFT Compare: curX: 101 curY: 102
LEFT Compare: curX: 100 curY: 102
That is spiroling around...
But would not complete correctly if the width and height are not the same.
Please only post if you have a valid question or are willing to help out.
Thanks,

Similar Messages

  • Java 1.4 and AES Algorithm PLEASE HELP!!

    I hope this question has not already been asked. I have spent a long time searching the archives and documentation.
    I am attempting to migrate from jsdk1.3 to jsdk1.4 but have come up against the following problem.
    I need to create keys and encrypt files and was doing it by using the following:
    import java.security.*;
    import cryptix.provider.key.RawKeyGenerator;
    import xjava.security.KeyGenerator;
    And in my code am using:
    SecureRandom rnd = new SecureRandom();
    rnd.nextInt();
    RawKeyGenerator kg = (RawKeyGenerator)KeyGenerator.getInstance("AES","Cryptix");
    kg.initialize(rnd, 32);
    key = kg.generateKey();
    But I now get the following exception.
    Unexpected exception in IJCE_SecuritySupport.registerTargets()
    Please report this as a bug to <[email protected]>, including
    any other messages displayed on the console, and a description of what appeared to cause the error.
    java.lang.InternalError: Unexpected exception in IJCE_SecuritySupport.registerTargets()
    at xjava.security.IJCE.reportBug(IJCE.java:701)
    at xjava.security.IJCE_SecuritySupport.<clinit>(IJCE_SecuritySupport.java:138)
    at xjava.security.IJCE.findTarget(IJCE.java:498)
    at xjava.security.IJCE.getProviderInternal(IJCE.java:666)
    at xjava.security.IJCE.getClassCandidate(IJCE.java:446)
    at xjava.security.IJCE.getImplementationClass(IJCE.java:410)
    at xjava.security.IJCE.getImplementation(IJCE.java:367)
    at xjava.security.KeyGenerator.getInstance(KeyGenerator.java:152)
    at uk.co.sundayta.docsys.KeyManager.createNewKey(KeyManager.java:96)
    at uk.co.sundayta.docsys.KeyManager.createEncodedKey(KeyManager.java:110)
    at uk.co.sundayta.docsys.KeyManager.createKey(KeyManager.java:71)
    at uk.co.sundayta.docsys.KeyManager.run(KeyManager.java:62)
    at java.lang.Thread.run(Thread.java:536)
    The KeyManager error at line 96 mentioned above is in my code and is related to the snipit of code mentioned above.
    I need 1.4 as I need to use the new 1.4 plug-in on the clients to unencrypt the data.
    I have not sent an email to the address mentioned above as I assume it is a migration problem.
    I also had a message saying:
    Netscape security model is no longer supported.
    Please migrate to the Java 2 security model instead.
    I cannot do this as I need the java 1.4 plug-in for something else on the client. If I compile with 1.3 and run with 1.4 there seems to be an incompatibility problem.
    I would be grateful for any advice as I need to ship this soon.
    Thanks Andrew Mercer.

    Hi!
    I was trying to run some examples from the JXTA platform with jdk_1.3 (the classic HelloWorld), and got a very similar exception. The problem is I'm quite a newbie with JXTA and have no idea whatsoever about security in java, so I don't know what to do about it. I got the same messages about migrate the security model and report the whole thing as a bug, and I actually tried to send the message, but the address doesn't exist, so I'm stuck. If you've come across a solution or someone who might help, I would really like to know it! I copy below the text for the exception, in case it's helpfull to you somehow.
    Kind regards,
    Marta
    Text for the exception:
    java.lang.NoSuchMethodError
         at xjava.security.IJCE_SecuritySupport.registerTargets(IJCE_SecuritySupport.java:155)
         at xjava.security.IJCE_SecuritySupport.<clinit>(IJCE_SecuritySupport.java:134)
         at xjava.security.IJCE.findTarget(IJCE.java:498)
         at xjava.security.IJCE.getProvidersInternal(IJCE.java:638)
         at xjava.security.IJCE.getClassCandidate(IJCE.java:426)
         at xjava.security.IJCE.getImplementationClass(IJCE.java:410)
         at xjava.security.IJCE.getImplementation(IJCE.java:367)
         at xjava.security.Cipher.getInstance(Cipher.java:485)
         at xjava.security.Cipher.getInstance(Cipher.java:452)
         at xjava.security.Cipher.getInstance(Cipher.java:395)
         at COM.claymoresystems.crypto.PEMData.writePEMObjectPEMData.java:154)
         at COM.claymoresystems.crypto.EAYEncryptedPrivateKey.writePrivateKey(EAYEncryptedPrivateKey.java:109)
         at net.jxta.impl.endpoint.tls.PeerCerts.appendPrivateKey(PeerCerts.java:174)
         at net.jxta.impl.endpoint.tls.PeerCerts.genPeerRootCert(PeerCerts.java:137)
         at net.jxta.impl.endpoint.tls.PeerCerts.generateCerts(PeerCerts.java:457)
         at net.jxta.impl.endpoint.tls.TlsConfig.init(TlsConfig.java:185)
         at net.jxta.impl.peergroup.Configurator.configureTls(Configurator.java:265)
         at net.jxta.impl.peergroup.Configurator.<init>(Configurator.java:202)
         at net.jxta.impl.peergroup.Platform.init(Platform.java:252)
         at net.jxta.peergroup.PeerGroupFactory.newPlatform(PeerGroupFactory.java:210)
         at net.jxta.peergroup.PeerGroupFactory.newNetPeerGroup(PeerGroupFactory.java:284)
         at SimpleJxtaApp.startJxta(SimpleJxtaApp.java:91)
         at SimpleJxtaApp.main(SimpleJxtaApp.java:73)
    Unexpected exception in IJCE_SecuritySupport.registerTargets()

  • Algorithm PLEASE help :)

    Hi I'm new in Java and I need to find algorithm for these questions :
    1. Write a program that reads a number n and sequence of n numbers and finds in the sequence the longest area of adjacent equal elements . Example :
    n = 14
    sequence = {7,3,3,3,7,7,7,7,3,3,3,2,7,2}
    result = {7,7,7,7}
    2. Write a program that reads from the console a sequence of numbers and finds the longest subsequence of growing numbers. Example :
    sequence = {3, 1, 2, 4, 6, 2, 3, 5, 4, 5}
    result = {1, 2, 3, 4, 5}
    I'll be very thankful if you write me one of the algorithms

    Construct a map of the longest sequences with the least last added value, so if you have
    6421
    321
    And encounter 5, you find 321 in lgM, where M is the size of the table, insert 5321, but when inserting it look at the next greater node, see whether it's the same length, and remove it if so, as any value which would extend it would also extend the sequence with the lower last added value you just added. Adjacent nodes must be be one number longer, otherwise there would be an intermediate sequence. You also look at the next least sequence, and if it's last value is your value -1 then delete it, as there can't be a sequence which extends it by one which has a lower next value:
    6421
    321
    +5 =>
    6421
    +5321
    321
    eliminate above as same length (above will always be same length, if you've added one value to the longest sequence whose last added value is less than the new value)
    =>
    5321
    321
    +4 =>
    5321
    +4321
    321
    eliminate above, and eliminate below as consecutive values
    =>
    4321
    So that would be O(N lgM), where M is the maximum size of the table. You can also reject any values less than or equal to the last value in the least long sequence as they won't contribute, so run time will typically be better, but I'm not about to calculate by how much. You do need to maintain all of the best sequences whose last value is less than a value which can be extended to be longer than any other sequence extended by adding a given new value, so I don't think O(N) is possible. If you have two numbers remaining, you don't know to choose between 54321 and 754321 until you get 6,7 or 8,3. The question is what size M is - if the sequence is increasing by one each time, M=1. If it's the same value repeated, or decreasing, M=1. For the sample input sequence, M gets up to 3:
    +3 = {3}
    +1 = {3},{1} -> {1}
    +2 = {2,1},{1} -> {2,1}
    +4 = {4,2,1},{2,1}
    +6 = {6,4,2,1},{4,2,1},{2,1}
    +2 = {6,4,2,1},{4,2,1},{2,1}
    +3 = {6,4,2,1},{4,2,1},{3,2,1},{2,1} -> {6,4,2,1},{3,2,1}
    +5 = {6,4,2,1},{5,3,2,1},{3,2,1} -> {5,3,2,1},{3,2,1}
    +4 = {5,3,2,1},{4,3,2,1},{3,2,1} -> {4,3,2,1}
    +5 = {5,4,3,2,1},{4,3,2,1} -> {5,4,3,2,1}
    Since M is increased for every value encountered greater than the previous greatest value, and decreased for every value adjacent to an existing value. You'd need to know the range of possible values to determine it, but at worst case M = N for sequences such as a[i] = 2*i.

  • SOS! Please help me with Expectation Maximization Algorithm!

    I have to image processing with Expectation Maximization Algorithm. I have loaded image into Georaster Object. But I do not know how to prepare data for image processing with EM algorithm. Please help me more details!
    Thanks!
    Thoa

    Hi Thoa,
    This is a general DB question. Try posting your question to that forum:
    General Database Discussions
    Thanks, Mark

  • VideoFormat.RLE is not working..  please help

    Hi all,
    I am creating AVI file from Bitmap that are compressed(As well as non-compressed) throught RLE Algorithm
    Code makes .AVI file. But this file is not accurate..
    Please help me..
    I am attaching the code with it.
    ========================================================
    package animation;
    import java.io.*;
    import java.awt.Color;
    import java.awt.Dimension;
    import javax.media.*;
    import javax.media.control.*;
    import javax.media.protocol.*;
    import javax.media.datasink.*;
    import javax.media.format.VideoFormat;
    import bmpCreation.BitmapImage;
    public class AviCreator implements ControllerListener, DataSinkListener {
    private Object waitSync = new Object();
    private boolean stateTransitionOK = true;
    private Object waitFileSync = new Object();
    private boolean fileDone = false;
    private boolean fileSuccess = true;
    * A DataSource to read from a list of BITMAP Images
    * turn that into a stream of JMF buffers.
    * The DataSource is not seekable or positionable.
    private class ImageDataSource extends PullBufferDataSource
    private ImageSourceStream streams[];
    ImageDataSource(int width, int height, int frameRate)
    streams = new ImageSourceStream[1];
    streams[0] = new ImageSourceStream(width, height, frameRate);
    public void setLocator(MediaLocator source)
    public MediaLocator getLocator()
    return null;
    * Content type is of RAW since we are sending buffers of video
    * frames without a container format.
    public String getContentType()
    return ContentDescriptor.RAW;
    public void connect()
    public void disconnect()
    public void start()
    public void stop()
    * Return the ImageSourceStreams.
    public PullBufferStream[] getStreams()
    return streams;
    * We could have derived the duration from the number of
    * frames and frame rate. But for the purpose of this program,
    * it's not necessary.
    public Time getDuration()
    System.out.println("dur is " + streams[0].nextImage);
    //return new Time(1000000000);
    return DURATION_UNKNOWN;
    public Object[] getControls()
    return new Object[0];
    public Object getControl(String type)
    return null;
    * The source stream to go along with ImageDataSource.
    private class ImageSourceStream implements PullBufferStream
    final int width, height;
    final VideoFormat format;
    // ColorPalette clrPal;
    float frameRate;
    long seqNo = 0;
    int nextImage = 0; // index of the next image to be read.
    boolean ended = false;
    public ImageSourceStream(int width, int height, int frameRate)
    this.width = width;
    this.height = height;
    // Bug fix from Forums (next line)
    this.frameRate = (float) frameRate;
    System.out.println("FrameRate = " + frameRate);
    format = new javax.media.format.VideoFormat(VideoFormat.RLE,new Dimension(width, height),
                                                           Format.NOT_SPECIFIED,Format.byteArray,frameRate);
    * We should never need to block assuming data are read from files.
    public boolean willReadBlock()
    return false;
    * This is called from the Processor to read a frame worth
    * of video data.
    public void read(Buffer buf) throws IOException
    // Check if we've finished all the frames.
    if (nextImage >= 20)
    // We are done. Set EndOfMedia.
    System.err.println("Done reading all images.");
    buf.setEOM(true);
    buf.setOffset(0);
    buf.setLength(0);
    ended = true;
    return;
    //System.out.println("nextImage := " + nextImage);
    nextImage++;
    byte data[] = null;
    byte data_copy[] = null;
    // Check the input buffer type & size.
    if (buf.getData() instanceof byte[])
    data = (byte[]) buf.getData();
    // Check to see the given buffer is big enough for the frame.
    BitmapImage imgLoaded = new BitmapImage();
    //Note that loadBitmapImage is my own function and works fine.
    imgLoaded.loadBitmapImage("E:/Images/untitled.bmp");
    int nDataLength = imgLoaded.getByteArray().length;
    if (data == null || (data.length<nDataLength-118))
    data           = new byte[ nDataLength - 118];
    Here I am not much sure but I think Bitmap Header will be 118 Bytes.
         //Consider
    data_copy      = new byte[nDataLength];
    buf.setData(data);
    // Bug fix from Forums ( next 3 lines).
    long time = (long) (seqNo * (1000 / frameRate) * 1000000);
    buf.setTimeStamp(time);
    buf.setSequenceNumber(seqNo++);
    ("E:/ApplicationDemo/ApplicationDemo/Compressed.bmp");
    data_copy = imgLoaded.getByteArray();      
    for(int nCount=118;nCount<nDataLength;nCount++)
         data[nCount-118] = data_copy[nCount];
    buf.setOffset(0);
    buf.setLength(nDataLength-118);
    buf.setFormat(format);
    buf.setFlags(buf.getFlags() | Buffer.FLAG_KEY_FRAME);
    * Return the format of each video frame. That will be JPEG.
    public Format getFormat()
    return format;
    public ContentDescriptor getContentDescriptor()
    return new ContentDescriptor(ContentDescriptor.RAW);
    public long getContentLength()
    return 0;
    public boolean endOfStream()
    return ended;
    public Object[] getControls()
    return new Object[0];
    public Object getControl(String type)
    return null;
         @Override
         public void controllerUpdate(ControllerEvent evt) {
         if (evt instanceof ConfigureCompleteEvent
         || evt instanceof RealizeCompleteEvent
         || evt instanceof PrefetchCompleteEvent)
         synchronized (waitSync)
         stateTransitionOK = true;
         waitSync.notifyAll();
         else if (evt instanceof ResourceUnavailableEvent)
         synchronized (waitSync)
         stateTransitionOK = false;
         waitSync.notifyAll();
         else if (evt instanceof EndOfMediaEvent)
         evt.getSourceController().stop();
         evt.getSourceController().close();
         @Override
         public void dataSinkUpdate(DataSinkEvent evt) {
    if (evt instanceof EndOfStreamEvent)
    synchronized (waitFileSync)
    fileDone = true;
    waitFileSync.notifyAll();
    else if (evt instanceof DataSinkErrorEvent)
    synchronized (waitFileSync)
    fileDone = true;
    fileSuccess = false;
    waitFileSync.notifyAll();
         public boolean createAvi(int width, int height, int frameRate, String outputFile){
    // Generate the output media locators.
    MediaLocator oml;
    if ((oml = createMediaLocator(outputFile)) == null)
    System.err.println("Cannot build media locator from: " + outputFile);
    System.exit(0);
    doIt(width, height, frameRate, oml);
              return true;
         * Create a media locator from the given string.
         private static MediaLocator createMediaLocator(String url) {
              MediaLocator ml;
    //          if (url.indexOf(":") > 0 && (ml = new MediaLocator(url)) != null)
    //               return ml;
    //          if (url.startsWith(File.separator))
    //               if ((ml = new MediaLocator("file:" + url)) != null)
    //                    return ml;
    //          else
                   String file =
                        "file:" + /*System.getProperty("user.dir") + File.separator +*/ url;
                   if ((ml = new MediaLocator(file)) != null)
                        return ml;
              return null;
    private boolean doIt( int width, int height, int frameRate, MediaLocator outML) {
    ImageDataSource ids = new ImageDataSource(width, height, frameRate);
    Processor p;
    try
    System.err.println(
    "- create processor for the image datasource ...");
    p = Manager.createProcessor(ids);
    catch (Exception e)
    System.err.println(
    "Yikes! Cannot create a processor from the data source.");
    return false;
    p.addControllerListener(this);
    // Put the Processor into configured state so we can set
    // some processing options on the processor.
    p.configure();
    if (!waitForState(p, Processor.Configured))
    System.err.println("Failed to configure the processor.");
    return false;
    // Set the output content descriptor to QuickTime.
    p.setContentDescriptor(
    new ContentDescriptor(FileTypeDescriptor.MSVIDEO));
    // Query for the processor for supported formats.
    // Then set it on the processor.
    TrackControl tcs[] = p.getTrackControls();
    // for (int i = 0; i < tcs.length; i++) {
    // Format format = tcs.getFormat();
    // if (tcs[i].isEnabled() && format instanceof VideoFormat) {
    //Dimension size = ((VideoFormat)format).getSize();
    //float frameRate = ((VideoFormat)format).getFrameRate();
    //int w = (size.width % 8 == 0 ? size.width :(int)(size.width / 8) * 8);
    //int h = (size.height % 8 == 0 ? size.height :(int)(size.height / 8) * 8);
    // VideoFormat jpegFormat = new VideoFormat(
    // VideoFormat.JPEG_RTP, new Dimension(w, h), Format.NOT_SPECIFIED, Format.byteArray, frameRate);
    /// messageLabel.setText("Status: Video transmitted as: " + jpegFormat.toString());
    //int nLength = tcs.length;
    // System.out.println(nLength);
    Format f[] = tcs[0].getSupportedFormats();
    if (f == null || f.length <= 0)
    System.err.println(
    "The mux does not support the input format: "
    + tcs[0].getFormat());
    return false;
    tcs[0].setFormat(f[0]);
    System.err.println("Setting the track format to: " + f[0]);
    // We are done with programming the processor. Let's just
    // realize it.
    p.realize();
    if (!waitForState(p, Processor.Realized))
    System.err.println("Failed to realize the processor.");
    return false;
    // Now, we'll need to create a DataSink.
    DataSink dsink;
    if ((dsink = createDataSink(p, outML)) == null)
    System.err.println(
    "Failed to create a DataSink for the given output MediaLocator: "
    + outML);
    return false;
    dsink.addDataSinkListener(this);
    fileDone = false;
    System.err.println("start processing...");
    // OK, we can now start the actual transcoding.
    try
    p.start();
    dsink.start();
    catch (IOException e)
    System.err.println("IO error during processing");
    return false;
    // Wait for EndOfStream event.
    waitForFileDone();
    // Cleanup.
    try
    dsink.close();
    catch (Exception e)
    p.removeControllerListener(this);
    System.err.println("...done processing.");
    return true;
    * Block until the processor has transitioned to the given state.
    * Return false if the transition failed.
    private boolean waitForState(Processor p, int state)
    synchronized (waitSync)
    try
    while (p.getState() < state && stateTransitionOK)
    waitSync.wait();
    catch (Exception e)
    return stateTransitionOK;
    * Create the DataSink.
    private DataSink createDataSink(Processor p, MediaLocator outML)
    DataSource ds;
    if ((ds = p.getDataOutput()) == null)
    System.err.println(
    "Something is really wrong: the processor does not have an output DataSource");
    return null;
    DataSink dsink;
    try
    System.err.println("- create DataSink for: " + outML);
    dsink = Manager.createDataSink(ds, outML);
    dsink.open();
    catch (Exception e)
    System.err.println("Cannot create the DataSink: " + e);
    return null;
    return dsink;
    * Block until file writing is done.
    private boolean waitForFileDone()
    synchronized (waitFileSync)
    try
    while (!fileDone)
    waitFileSync.wait();
    catch (Exception e)
    return fileSuccess;

    As I know getSupportedFormats doesn't support BMP files.

  • I want to check all functions of PCI 6534.I have read the user manual..I have some memory related questions.​Please help me for that.

    I want to check all functions of PCI 6534.I have read the user manual..I have some memory related questions.Please help me for that.
    1.)If i am using the continuous output mode.and the size of generated data is less than 32 MB.If i want to preload the memory,what should i do?I want that first of all i load all my data to onboard memory & then i want to make start the transfer between 6534 & peripheral.Is it possible?As per me it should be.Plz tell me how should i do this?I think that in normal procedure the transfer between 6534-peripheral & outputting data from pc buffer to onboard memory works parallely.But i don't want this.Is it poss
    ible?
    (2).Similarly in finite input operation(pattern I/O) is it possible to preload the memory and then i read it?Because i think that the PC memory will be loaded automatically when 6534 acquires the data and then when we use DIO read vi the pc buffer data will be transferred to application buffer.If this is true,i do not want this.Is it possible?
    (3) One more question is there if i am using normal operation onboard memory will be used bydefault right?Now if i want to use DMA and if i have data of 512 bytes to acquire.How will it work and how should i do it?Please tell me the sequence of operations.As per my knowledge in normal DMA operation we have 32 Bytes FIFO is there so after acquisition of 32 bytes only i can read it.How it will known to me that 32 bytes acquisition is complete?Next,If i want to acquire each byte separately using DMA interrupts what should i do?Provide me the name of sourse from which i can get details about onboard memory & DMA process of 6534 specifically
    (4).In 6534 pattern Input mode,if i want to but only 10 bits of data.and i don't want to waste any data line what should i do?

    Hi Vishal,
    I'll try to answer your questions as best I can.
    1) It is definitely possible to preload data to the 32MB memory (per group) and start the acquisition after you have preloaded the memory. There are example programs on ni.com/support under Example Code for pattern generation and the 6534 that demonstrate which functions to use for this. Also, if your PC memory buffer is less than 32MB, it will automatically be loaded to the card. If you are in continuous mode however, you can choose to loop using the on-board memory or you can constantly be reading the PC memory buffer as you update it with your application environment.
    2) Yes, your data will automatically be loaded into the card's onboard memory. It will however be transferred as quickly as possible to the DMA FIFO on the card and then transferred to the PC memory buffer through DMA. It is not going to wait until the whole onboard memory is filled before it transfers. It will transfer throughout the acquisition process.
    3) Vishal, searching the example programs will give you many of the details of programming this type of application. I don't know you application software so I can't give you the exact functions but it is easiest to look at the examples on the net (or the shipping examples with your software). Now if you are acquiring 512 bytes of data, you will start to fill your onboard memory and at the same time, data will be sent to the DMA FIFO. When the FIFO is ready to send data to the PC memory buffer, it will (the exact algorithm is dependent on many things regarding how large the DMA packet is etc.).
    4) If I understand you correctly, you want to know if you waste the other 6 bits if you only need to acquire on 10 lines. The answer to this is Yes. Although you are only acquiring 10 bits, it is acquired as a complete word (16bits) and packed and sent using DMA. You application software (NI-DAQ driver) will filter out the last 6 bits of non-data.
    Hope that answers your questions. Once again, the example code on the NI site is a great place to start this type of project. Have a good day.
    Ron

  • I need some help with my java game using applets, CAN SOMEBODY PLEASE HELP

    Hi,
    I am in the process of creating a RPG program using Java. I am not very experienced with java, however the problem i am currently facing is something i can't seem to figure out. I would like to draw a simple grid where a character (indicated by a filled circle) moves around this grid collecting items (indicated by a red rectangle). When the character moves on top of the grid with the item, i would like it to disappear. Right now i am not worrying about the fact that the item will reappear after the character moves away again, because sometimes, when the character moves over the item, nothing happens/another item disappears. i have been at this for 4 days and still cannot figure out what is goign on. can somebody please help me? it would be most appreciated.
    Thanks
    PS if i needed to send you my code, how do i do it?

    Thank you for replying.
    The thing is, I am taking java as a course, and it is necessary for me to start off this way (this is for my summative evaluation). i agree with you on the fact, however, that i should go in small steps. i have been doing that until this point, and my frustration caused me to jump around randomly for an answer. I also think that it may just be a bug, but i have no clue as to how to fix it, as i need to show my teacher at least a part of what i was doing by sometime next week. Here is my code for anybody willing to go through it:
    // The "Keys3" class.
    import java.applet.*;
    import java.awt.*;
    import java.awt.Event;
    import java.awt.Font;
    import java.awt.Color;
    import java.applet.AudioClip;
    public class Keys3 extends java.applet.Applet
        char currkey;
        int currx, curry, yint, xint;
        int itmval [] = new int [5],
            locval [] = new int [5],
            tempx [] = new int [5], tempy [] = new int [5],
            tot = 0, score = 0;
        boolean check = true;
        AudioClip bgSound, bgSound2;
        AudioClip hit;
        private Image offscreenImage;
        private Graphics offscreen;     //initializing variables for double buffering
        public void init ()  //DONE
            bgSound = getAudioClip (getCodeBase (), "sound2_works.au");
            hit = getAudioClip (getCodeBase (), "ah_works.au");
            if (bgSound != null)
                bgSound.loop ();
            currx = 162;
            curry = 68;
            setBackground (Color.white);
            for (int count = 0 ; count < 5 ; count++)
                itmval [count] = (int) (Math.random () * 5) + 1;
                locval [count] = (int) (Math.random () * 25) + 1;
            requestFocus ();
        public void paint (Graphics g)  //DONE
            resize (350, 270);
            drawgrid (g);
            if (check = true)
                pickitems (g);
                drawitems (g);
            g.setColor (Color.darkGray);
            g.fillOval (currx, curry, 25, 25);
            if (currkey != 0)
                g.setColor (Color.darkGray);
                g.fillOval (currx, curry, 25, 25);
            if (collcheck () != true)
                collision (g);
            else
                drawitems (g);
        } // paint method
        public void update (Graphics g)  //uses the double buffering method to overwrite the original
                                         //screen with another copy to reduce flickering
            if (offscreenImage == null)
                offscreenImage = createImage (this.getSize ().width, this.getSize ().height);
                offscreen = offscreenImage.getGraphics ();
            } //what to do if there is no offscreenImage copy of the original screen
            //draws the backgroudn colour of the offscreen
            offscreen.setColor (getBackground ());
            offscreen.fillRect (0, 0, this.getSize ().width, this.getSize ().height);
            //draws the foreground colour of the offscreen
            offscreen.setColor (getForeground ());
            paint (offscreen);
            //draws the offscreen image onto the main screen
            g.drawImage (offscreenImage, 0, 0, this);
        public boolean keyDown (Event evt, int key)  //DONE
            switch (key)
                case Event.DOWN:
                    curry += 46;
                    if (curry >= 252)
                        curry -= 46;
                        if (hit != null)
                            hit.play ();
                    break;
                case Event.UP:
                    curry -= 46;
                    if (curry <= 0)
                        curry += 46;
                        if (hit != null)
                            hit.play ();
                    break;
                case Event.LEFT:
                    currx -= 66;
                    if (currx <= 0)
                        currx += 66;
                        if (hit != null)
                            hit.play ();
                    break;
                case Event.RIGHT:
                    currx += 66;
                    if (currx >= 360)
                        currx -= 66;
                        if (hit != null)
                            hit.play ();
                    break;
                default:
                    currkey = (char) key;
            repaint ();
            return true;
        public boolean collcheck ()  //DONE
            if (((currx == tempx [0]) && (curry == tempy [0])) || ((currx == tempx [1]) && (curry == tempy [1])) || ((currx == tempx [2]) && (curry == tempy [2])) || ((currx == tempx [3]) && (curry == tempy [3])) || ((currx == tempx [4]) && (curry == tempy [4])))
                return false;
            else
                return true;
        public void collision (Graphics g)
            drawgrid (g);
            for (int count = 0 ; count < 5 ; count++)
                if ((currx == tempx [count]) && (curry == tempy [count]))
                    g.setColor (Color.darkGray);
                    g.fillOval (currx, curry, 25, 25);
                else if ((currx != tempx [count]) && (curry != tempy [count]))
                    g.setColor (Color.red);
                    g.fillRect (tempx [count], tempy [count], 25, 25);
        public void drawitems (Graphics g)
            for (int count = 0 ; count < 5 ; count++)
                g.setColor (Color.red);
                g.fillRect (tempx [count], tempy [count], 25, 25);
        public void pickitems (Graphics g)
            check = false;
            for (int count = 0 ; count < 5 ; count++)
                if (locval [count] <= 5)
                    tempy [count] = 22;
                else if (locval [count] <= 10)
                    tempy [count] = 68;
                else if (locval [count] <= 15)
                    tempy [count] = 114;
                else if (locval [count] <= 20)
                    tempy [count] = 160;
                else if (locval [count] <= 25)
                    tempy [count] = 206; //this determines the y-position of the item to be placed
                if (locval [count] % 5 == 0)
                    tempx [count] = 294;
                else if ((locval [count] == 1) || (locval [count] == 6) || (locval [count] == 11) || (locval [count] == 16) || (locval [count] == 21))
                    tempx [count] = 30;
                else if ((locval [count] == 2) || (locval [count] == 7) || (locval [count] == 12) || (locval [count] == 17) || (locval [count] == 22))
                    tempx [count] = 96;
                else if ((locval [count] == 3) || (locval [count] == 8) || (locval [count] == 13) || (locval [count] == 18) || (locval [count] == 23))
                    tempx [count] = 162;
                else if ((locval [count] == 4) || (locval [count] == 9) || (locval [count] == 14) || (locval [count] == 19) || (locval [count] == 24))
                    tempx [count] = 228;
        public void drawgrid (Graphics g)  //DONE
            g.drawRect (10, 10, 330, 230); //draws the outer rectangular border
            int wi = 10; //width of one square on the board
            int hi = 10; //height of one square on the board
            for (int height = 1 ; height <= 5 ; height++)
                for (int row = 1 ; row <= 5 ; row++)
                    if (((height % 2 == 1) && (row % 2 == 1)) || ((height % 2 == 0) && (row % 2 == 0)))
                        g.setColor (Color.gray);
                        g.fillRect (wi, hi, 66, 46);
                    else /*if (((height % 2 == 0) && (row % 2 == 1)) || ((height % 2 == 0) && (row % 2 == 0)))*/
                        g.setColor (Color.lightGray);
                        g.drawRect (wi, hi, 66, 46);
                        g.setColor (Color.lightGray);
                        g.drawRect (wi, hi, 66, 46); //drawn twice to make a shadow effect
                    wi += 66;
                wi = 10;
                hi += 46;
            } //this draws the basic outline of the game screen
    } // Keys3 class

  • Hi i am using  personal hot spot before updating 6.1.3.now iam using ios 6.1.3 version the personal hot spot is not working..can you please help me on this?how to use that,its in a default mode?

    Hi previously i use personal hotspot,after updating my 6.1.3 ios in india iam not able to use that.It is in a default mode.
    Can you please help me how to use personal hotspot.
    Thanks,
    Goutham.

    Im really good at programming but really suck at algorithms
    >If your are 'really good' at programming, you will be able to solve this problem. Because, it has nothing to do with algorithm.
    >>can someone please please write in a algorithm form for me , i need it by friday i would greatly be thankful for u
    >Wrong person, in the wrong place.

  • Acrobat Pro 9 problems - please help

    Hello there from Victoria, Canada
    We are a small group of teachers that produce monthly current events teaching units for Canadian schools.
    Some of our our customers receive the newsletter by mail, and the rest download pdf files from our website. The pdf files are password protected and we notify our subscribers by email what the password is.
    We have never had never experienced any major issues, until now. We recently upgraded to Acrobat Pro version 9 (from 8) and many, many subscribers have been contacting us claiming that they cant open the password protected files even though they are using Adobe Reader 9. When I create the pdf file, the settting I use is open with Reader 5 and above.
    Many of our customers are very frustrated and so are we. Can anyone please help ???? Is anyone else experiencing problems and what can we do to solve this?
    Thanks in advance for your time.
    Eric W.

    Hi Eric,
    The file will never open in Mac Preview because Preview doesn't know how to decrypt it. The reason Preview thinks that the file is corrupt because it is encountering the encrypted data which appears to Preview to be junk. Only an application that has PDF decryption capabilities (e.g. Adobe Reader or Acrobat) will be able to open the file.
    As an aside, the file is in Acrobat 7.0 and later format (i.e. it uses the PDF-1.6 file structure) and although the encryption algorithm is one that Acrobat 5 understands (128-bit RC4) there are other elements in the file that cannot be displayed in Acrobat 6.x and earlier. Although Michael noted above that he was able to open the file in versions 5 and 6, the display would have been degraded.
    Assuming that the persons having trouble opening the file are not using Preview, but are indeed using Reader 9.0, are there any alert dialogs that come up when they try to open the file? And as Phil asked above, what system (OS and language) are they on?
    Also, because the Open Password edit box doesn't display until the entire file has been downloaded, it is possible that on slower systems that it appears that the file won't open.
    Thanks,
    Steve Madwin
    Acrobat QA Engineer

  • PLEASE HELP!!!! WEP screwed me on WRT54GS

    Can anyone do me a HUUGE Favour?
    So I spent hours setting up my wireless network..  Then in my haste I set a WEP password to 128 bit, proceeded to type in a 10 key passphrase, generated, selected code 4, and pushed OK.  Next thing I know Im locked out....lawl.
    So I think I messed up by using a passphrase that was not the standard size for 128 bit WEP.  Now I cant use the passphrase to access the network, AND, I dont have the WEP key.....
    I know, I know...Everyone is gonna say "reset the router" but I dont have time to reconfigur EVERYTHING on my network for new settings.
    So, back to the point of this thread,  Does anyoen here have a Linksys WRT54GS or something close,  A router that will have the same WEP generating algorithm???
     If so can somone, anyone PLEASE generate the WEP code from this passphrase and post them for me so I can get back on my network...lol.
    Please do not be offended by the passphrase, Its not a joke, or meant to offend.
    This is the actuall passphrase used to generate the WEP key, and Im really hoping someone can help.
    128 bit WEP
    Passphrase is "f u c k u a l l 1 2" (no spaces) and number 4 was selected.
    If Anyone could please generate the WEP key from this passphrase I would be forever grateful.
    Thanks in advance for any tips for help.
    Tyson
    Oh and if your wondering why I dont go to 192.168.1.1 and fix it myself,  I share a house with my brother, he owns the basement and is on vacation right now. (great timing right?)  he is computer illiterate, and only knows the passphrase (which obviously didnt help),  the router is hardwired down in his place, I wont be able to get down there for over a week till he gets back and Im hoping to get my internet back before then.  Im running to the Library to use email and internet at htis point and its driving me nuts.
    Also Im thinking the passphrase might not be working due to a Linksys router and a Dlink adapter?  Because it wont allow me to use my 10 key passphrase, but says 5 or 13 ascii or 10 or 26 hex...... please help..lol
    Message Edited by Chronn on 12-06-2009 12:48 PM
    Message Edited by Chronn on 12-06-2009 12:52 PM
    (Mod note: Edited for guideline compliance. Thank you.)
    Message Edited by Vince_02 on 12-06-2009 01:04 PM

    I know, I would....  Read the post again... I wont have access to the wired PC for over a week...lawl
    It would be faster and easier if someone can genrate the WEP key for me from a linksys router with the correct algorithm, then I can just get access from here, and go onto the security settings and switch from WEP to WPA and never deal with this crap again.

  • Please help C++ into java.

    Hello,
    I am working one small swing program. And want to know about c++ code. Can any one tell me that can we convert the c++ code into java code. My c++ code is:
    void Activity::computeInternalStructure(Rules& r)
         //the internal subgroups list must be computed before entering here.
         //teachers
         //this->nTeachers=0;
         this->iTeachersList.clear();
         for(QStringList::Iterator it=this->teachersNames.begin(); it!=this->teachersNames.end(); it++){
              int tmp;
              for(tmp=0; tmp<r.nInternalTeachers; tmp++){
                   if(r.internalTeachersList[tmp]->name == (*it))
                        break;
              assert(tmp < r.nInternalTeachers);
              //assert(this->nTeachers<MAX_TEACHERS_PER_ACTIVITY);
              //this->teachers[this->nTeachers++]=tmp;
              this->iTeachersList.append(tmp);
         //subjects
         this->subjectIndex = r.searchSubject(this->subjectName);
         assert(this->subjectIndex>=0);
         //activity tags
         this->iActivityTagsSet.clear();
         foreach(QString tag, this->activityTagsNames)
              assert(tag!="");
              int index=r.searchActivityTag(tag);
              assert(index>=0);
              this->iActivityTagsSet.insert(index);
         //this->activityTagIndex = r.searchActivityTag(this->activityTagName);
         //students     
         //this->nSubgroups=0;
         this->iSubgroupsList.clear();
         for(QStringList::Iterator it=this->studentsNames.begin(); it!=this->studentsNames.end(); it++){
              StudentsSet* ss=r.searchAugmentedStudentsSet(*it);
              assert(ss);
              if(ss->type==STUDENTS_SUBGROUP){
                   int tmp;
                   /*for(tmp=0; tmp<r.nInternalSubgroups; tmp++)
                        if(r.internalSubgroupsList[tmp]->name == ss->name)
                             break;*/
                   tmp=((StudentsSubgroup*)ss)->indexInInternalSubgroupsList;
                   assert(tmp>=0);
                   assert(tmp<r.nInternalSubgroups);
                   //assert(this->nSubgroups<MAX_SUBGROUPS_PER_ACTIVITY);
                   bool duplicate=false;
                   if(this->iSubgroupsList.contains(tmp))
                   //for(int j=0; j<this->nSubgroups; j++)
                   //     if(this->subgroups[j]==tmp)
                             duplicate=true;
                   if(duplicate){
                        QString s;
                        s=QObject::tr(QString("Warning: activity with id=%1\ncontains duplicated subgroups. Automatically correcting..."))
                             .arg(this->id);               
                        cout<<qPrintable(s)<<endl;
                   else
                        this->iSubgroupsList.append(tmp);
                        //this->subgroups[this->nSubgroups++]=tmp;
              else if(ss->type==STUDENTS_GROUP){
                   StudentsGroup* stg=(StudentsGroup*)ss;
                   for(int k=0; k<stg->subgroupsList.size(); k++){
                        StudentsSubgroup* sts=stg->subgroupsList[k];
                        int tmp;
                        /*for(tmp=0; tmp<r.nInternalSubgroups; tmp++)
                             if(r.internalSubgroupsList[tmp]->name == sts->name)
                                  break;*/
                        tmp=sts->indexInInternalSubgroupsList;
                        assert(tmp>=0);
                        assert(tmp<r.nInternalSubgroups);
                        //assert(this->nSubgroups<MAX_SUBGROUPS_PER_ACTIVITY);
                        bool duplicate=false;
                        if(this->iSubgroupsList.contains(tmp))
                        //for(int j=0; j<this->nSubgroups; j++)
                        //     if(this->subgroups[j]==tmp)
                                  duplicate=true;
                        if(duplicate){
                             QString s;
                             s=QObject::tr(QString("Warning: activity with id=%1\ncontains duplicated subgroups. Automatically correcting..."))
                                  .arg(this->id);
                             cout<<qPrintable(s)<<endl;
                        else
                             //this->subgroups[this->nSubgroups++]=tmp;
                             this->iSubgroupsList.append(tmp);
              else if(ss->type==STUDENTS_YEAR){
                   StudentsYear* sty=(StudentsYear*)ss;
                   for(int k=0; k<sty->groupsList.size(); k++){
                        StudentsGroup* stg=sty->groupsList[k];
                        for(int l=0; l<stg->subgroupsList.size(); l++){
                             StudentsSubgroup* sts=stg->subgroupsList[l];
                             int tmp;
                             /*for(tmp=0; tmp<r.nInternalSubgroups; tmp++)
                                  if(r.internalSubgroupsList[tmp]->name == sts->name)
                                       break;*/
                             tmp=sts->indexInInternalSubgroupsList;
                             assert(tmp>=0);
                             assert(tmp<r.nInternalSubgroups);
                             //assert(this->nSubgroups<MAX_SUBGROUPS_PER_ACTIVITY);
                             bool duplicate=false;
                             if(this->iSubgroupsList.contains(tmp))
                             //for(int j=0; j<this->nSubgroups; j++)
                             //     if(this->subgroups[j]==tmp)
                                       duplicate=true;
                             if(duplicate){
                                  QString s;
                                  s=QObject::tr(QString("Warning: activity with id=%1\ncontains duplicated subgroups. Automatically correcting..."))
                                       .arg(this->id);
                                  QObject::tr("&Ok"));
                                  cout<<qPrintable(s)<<endl;
                             else{
                                  //this->subgroups[this->nSubgroups++]=tmp;
                                  this->iSubgroupsList.append(tmp);
              else
                   assert(0);
    }Please help me. In this code we are using some variables. with QT GUI in c++.
    Thanks in advance.
    Manveer.

    Manveer-Singh wrote:
    Hello,
    I am working one small swing program. And want to know about c++ code. Can any one tell me that can we convert the c++ code into java code. My c++ code is:
    void Activity::computeInternalStructure(Rules& r)
         //the internal subgroups list must be computed before entering here.
         //teachers
         //this->nTeachers=0;
         this->iTeachersList.clear();
         for(QStringList::Iterator it=this->teachersNames.begin(); it!=this->teachersNames.end(); it++){
              int tmp;
              for(tmp=0; tmp<r.nInternalTeachers; tmp++){
                   if(r.internalTeachersList[tmp]->name == (*it))
                        break;
              assert(tmp < r.nInternalTeachers);
              //assert(this->nTeachers<MAX_TEACHERS_PER_ACTIVITY);
              //this->teachers[this->nTeachers++]=tmp;
              this->iTeachersList.append(tmp);
         //subjects
         this->subjectIndex = r.searchSubject(this->subjectName);
         assert(this->subjectIndex>=0);
         //activity tags
         this->iActivityTagsSet.clear();
         foreach(QString tag, this->activityTagsNames)
              assert(tag!="");
              int index=r.searchActivityTag(tag);
              assert(index>=0);
              this->iActivityTagsSet.insert(index);
         //this->activityTagIndex = r.searchActivityTag(this->activityTagName);
         //students     
         //this->nSubgroups=0;
         this->iSubgroupsList.clear();
         for(QStringList::Iterator it=this->studentsNames.begin(); it!=this->studentsNames.end(); it++){
              StudentsSet* ss=r.searchAugmentedStudentsSet(*it);
              assert(ss);
              if(ss->type==STUDENTS_SUBGROUP){
                   int tmp;
                   /*for(tmp=0; tmp<r.nInternalSubgroups; tmp++)
                        if(r.internalSubgroupsList[tmp]->name == ss->name)
                             break;*/
                   tmp=((StudentsSubgroup*)ss)->indexInInternalSubgroupsList;
                   assert(tmp>=0);
                   assert(tmp<r.nInternalSubgroups);
                   //assert(this->nSubgroups<MAX_SUBGROUPS_PER_ACTIVITY);
                   bool duplicate=false;
                   if(this->iSubgroupsList.contains(tmp))
                   //for(int j=0; j<this->nSubgroups; j++)
                   //     if(this->subgroups[j]==tmp)
                             duplicate=true;
                   if(duplicate){
                        QString s;
                        s=QObject::tr(QString("Warning: activity with id=%1\ncontains duplicated subgroups. Automatically correcting..."))
                             .arg(this->id);               
                        cout<<qPrintable(s)<<endl;
                   else
                        this->iSubgroupsList.append(tmp);
                        //this->subgroups[this->nSubgroups++]=tmp;
              else if(ss->type==STUDENTS_GROUP){
                   StudentsGroup* stg=(StudentsGroup*)ss;
                   for(int k=0; k<stg->subgroupsList.size(); k++){
                        StudentsSubgroup* sts=stg->subgroupsList[k];
                        int tmp;
                        /*for(tmp=0; tmp<r.nInternalSubgroups; tmp++)
                             if(r.internalSubgroupsList[tmp]->name == sts->name)
                                  break;*/
                        tmp=sts->indexInInternalSubgroupsList;
                        assert(tmp>=0);
                        assert(tmp<r.nInternalSubgroups);
                        //assert(this->nSubgroups<MAX_SUBGROUPS_PER_ACTIVITY);
                        bool duplicate=false;
                        if(this->iSubgroupsList.contains(tmp))
                        //for(int j=0; j<this->nSubgroups; j++)
                        //     if(this->subgroups[j]==tmp)
                                  duplicate=true;
                        if(duplicate){
                             QString s;
                             s=QObject::tr(QString("Warning: activity with id=%1\ncontains duplicated subgroups. Automatically correcting..."))
                                  .arg(this->id);
                             cout<<qPrintable(s)<<endl;
                        else
                             //this->subgroups[this->nSubgroups++]=tmp;
                             this->iSubgroupsList.append(tmp);
              else if(ss->type==STUDENTS_YEAR){
                   StudentsYear* sty=(StudentsYear*)ss;
                   for(int k=0; k<sty->groupsList.size(); k++){
                        StudentsGroup* stg=sty->groupsList[k];
                        for(int l=0; l<stg->subgroupsList.size(); l++){
                             StudentsSubgroup* sts=stg->subgroupsList[l];
                             int tmp;
                             /*for(tmp=0; tmp<r.nInternalSubgroups; tmp++)
                                  if(r.internalSubgroupsList[tmp]->name == sts->name)
                                       break;*/
                             tmp=sts->indexInInternalSubgroupsList;
                             assert(tmp>=0);
                             assert(tmp<r.nInternalSubgroups);
                             //assert(this->nSubgroups<MAX_SUBGROUPS_PER_ACTIVITY);
                             bool duplicate=false;
                             if(this->iSubgroupsList.contains(tmp))
                             //for(int j=0; j<this->nSubgroups; j++)
                             //     if(this->subgroups[j]==tmp)
                                       duplicate=true;
                             if(duplicate){
                                  QString s;
                                  s=QObject::tr(QString("Warning: activity with id=%1\ncontains duplicated subgroups. Automatically correcting..."))
                                       .arg(this->id);
                                  QObject::tr("&Ok"));
                                  cout<<qPrintable(s)<<endl;
                             else{
                                  //this->subgroups[this->nSubgroups++]=tmp;
                                  this->iSubgroupsList.append(tmp);
              else
                   assert(0);
    }Please help me. In this code we are using some variables. with QT GUI in c++.
    Thanks in advance.
    Manveer.why do you say this?
    My c++ code is:and
    In this code we are using some variables. with QT GUI in c++. You didn't code that. Liviu Lalescu code that, not you.
    He has rights on that code and he published it under gpl.
    So you must say that it is from him, not from you.
    Also if you "translate" (modify) his algorithm you must still care about the gpl. Please read whole gpl and care about that.
    Regards,
    Volker Dirr
    PS:
    compare original code from Liviu at sourceforge or at his homepage:
    http://lalescu.ro/liviu/fet/
    you can see the copied copy in /src/engine/activity.cpp line 167 and following.

  • Dispatcher stops Frequently: Please help

    Hi Experts,
    im  facing issues related to Dispatcher , it stops frequently. as i have restarted the system many times but again same .. PLEASE HELP
    Environment . :   ECC6.0,  ORACLE,  WINDOWS  32 bit
    Thanks in Advance  and Appreciate the responses....
    please find below the dev_disp logs
    ===================================================================
    trc file: "dev_disp", trc level: 1, release: "700"
    sysno      00
    sid        ECD
    systemid   560 (PC with Windows NT)
    relno      7000
    patchlevel 0
    patchno    333
    intno      20050900
    make:      multithreaded, Unicode, optimized
    pid        5876
    kernel runs with dp version 247000(ext=110000) (@(#) DPLIB-INT-VERSION-247000-UC)
    length of sys_adm_ext is 576 bytes
    *** SWITCH TRC-HIDE on ***
    ***LOG Q00=> DpSapEnvInit, DPStart (00 5876) [dpxxdisp.c   1292]
      shared lib "dw_xml.dll" version 333 successfully loaded
      shared lib "dw_xtc.dll" version 333 successfully loaded
      shared lib "dw_stl.dll" version 333 successfully loaded
      shared lib "dw_gui.dll" version 333 successfully loaded
      shared lib "dw_mdm.dll" version 333 successfully loaded
    rdisp/softcancel_sequence :  -> 0,5,-1
    use internal message server connection to port 3900
    Mon Jan 20 10:52:51 2014
    *** WARNING => DpNetCheck: NiHostToAddr(www.doesnotexist0041.qqq.nxst) took 12 seconds
    Mon Jan 20 10:53:08 2014
    *** WARNING => DpNetCheck: NiAddrToHost(1.0.0.0) took 17 seconds
    ***LOG GZZ=> 2 possible network problems detected - check tracefile and adjust the DNS settings [dpxxtool2.c  5540]
    MtxInit: 30000 0 0
    DpSysAdmExtInit: ABAP is active
    DpSysAdmExtInit: VMC (JAVA VM in WP) is not active
    DpIPCInit2: start server >sap-ec6-dev_ECD_00                      <
    DpShMCreate: sizeof(wp_adm) 22152 (1704)
    DpShMCreate: sizeof(tm_adm) 4415616 (21968)
    DpShMCreate: sizeof(wp_ca_adm) 24064 (80)
    DpShMCreate: sizeof(appc_ca_adm) 8000 (80)
    DpCommTableSize: max/headSize/ftSize/tableSize=500/8/528056/528064
    DpShMCreate: sizeof(comm_adm) 528064 (1048)
    DpSlockTableSize: max/headSize/ftSize/fiSize/tableSize=0/0/0/0/0
    DpShMCreate: sizeof(slock_adm) 0 (96)
    DpFileTableSize: max/headSize/ftSize/tableSize=0/0/0/0
    DpShMCreate: sizeof(file_adm) 0 (72)
    DpShMCreate: sizeof(vmc_adm) 0 (1544)
    DpShMCreate: sizeof(wall_adm) (38456/34360/64/184)
    DpShMCreate: sizeof(gw_adm) 48
    DpShMCreate: SHM_DP_ADM_KEY (addr: 06400040, size: 5079600)
    DpShMCreate: allocated sys_adm at 06400040
    DpShMCreate: allocated wp_adm at 064021A8
    DpShMCreate: allocated tm_adm_list at 06407830
    DpShMCreate: allocated tm_adm at 06407860
    DpShMCreate: allocated wp_ca_adm at 0683D8E0
    DpShMCreate: allocated appc_ca_adm at 068436E0
    DpShMCreate: allocated comm_adm at 06845620
    DpShMCreate: system runs without slock table
    DpShMCreate: system runs without file table
    DpShMCreate: allocated vmc_adm_list at 068C64E0
    DpShMCreate: allocated gw_adm at 068C6520
    DpShMCreate: system runs without vmc_adm
    DpShMCreate: allocated ca_info at 068C6550
    DpShMCreate: allocated wall_adm at 068C65C0
    MBUF state OFF
    DpCommInitTable: init table for 500 entries
    DpRqQInit: Parameter rdisp/queue_lock_level = 2
    rdisp/queue_size_check_value :  -> on,50,30,40,500,50,500,80
    ThTaskStatus: rdisp/reset_online_during_debug 0
    EmInit: MmSetImplementation( 2 ).
    MM global diagnostic options set: 0
    <ES> client 0 initializing ....
    <ES> EsILock: use spinlock for locking
    <ES> InitFreeList
    <ES> block size is 1024 kByte.
    Using implementation view
    <EsNT> Using memory model view.
    <EsNT> Memory Reset disabled as NT default
    <ES> 511 blocks reserved for free list.
    ES initialized.
    mm.dump: set maximum dump mem to 96 MB
    J2EE server info
      start = TRUE
      state = STARTED
      pid = 5608
      argv[0] = E:\usr\sap\ECD\DVEBMGS00\exe\jcontrol.EXE
      argv[1] = E:\usr\sap\ECD\DVEBMGS00\exe\jcontrol.EXE
      argv[2] = pf=E:\usr\sap\ECD\SYS\profile\ECD_DVEBMGS00_sap-ec6-dev
      argv[3] = -DSAPSTART=1
      argv[4] = -DCONNECT_PORT=65000
      argv[5] = -DSAPSYSTEM=00
      argv[6] = -DSAPSYSTEMNAME=ECD
      argv[7] = -DSAPMYNAME=sap-ec6-dev_ECD_00
      argv[8] = -DSAPPROFILE=E:\usr\sap\ECD\SYS\profile\ECD_DVEBMGS00_sap-ec6-dev
      argv[9] = -DFRFC_FALLBACK=ON
      argv[10] = -DFRFC_FALLBACK_HOST=localhost
      start_lazy = 0
      start_control = SAP J2EE startup framework
    DpJ2eeStart: j2ee state = STARTED
    Mon Jan 20 10:53:12 2014
    rdisp/http_min_wait_dia_wp : 1 -> 1
    ***LOG CPS=> DpLoopInit, ICU ( 3.0 3.0 4.0.1) [dpxxdisp.c   1699]
    ***LOG Q0K=> DpMsAttach, mscon ( sap-ec6-dev) [dpxxdisp.c   12778]
    DpStartStopMsg: send start message (myname is >sap-ec6-dev_ECD_00                      <)
    DpStartStopMsg: start msg sent
    CCMS: start to initalize 3.X shared alert area (first segment).
    DpJ2eeLogin: j2ee state = CONNECTED
    DpMsgAdmin: Set release to 7000, patchlevel 0
    MBUF state PREPARED
    MBUF component UP
    DpMBufHwIdSet: set Hardware-ID
    ***LOG Q1C=> DpMBufHwIdSet [dpxxmbuf.c   1050]
    DpMsgAdmin: Set patchno for this platform to 333
    Release check o.K.
    Mon Jan 20 10:53:15 2014
    ***LOG Q0I=> NiIRead: recv (10054: WSAECONNRESET: Connection reset by peer) [nixxi.cpp 4434]
    *** ERROR => NiIRead: SiRecv failed for hdl 4 / sock 1420
        (SI_ECONN_BROKEN/10054; I4; ST; 127.0.0.1:2668) [nixxi.cpp    4434]
    *** ERROR => DpJ2eeMsgProcess: NiRead failed (NIECONN_BROKEN) [dpxxj2ee.c   1212]
    DpJ2eeMsgProcess: j2ee state = CONNECTED (NIECONN_BROKEN)
    Mon Jan 20 10:53:53 2014
    DpJ2eeEmergencyShutdown: j2ee state = SHUTDOWN
    Mon Jan 20 10:53:56 2014
    MBUF state ACTIVE
    DpModState: change server state from STARTING to ACTIVE
    Mon Jan 20 10:58:43 2014
    J2EE server info
      start = TRUE
      state = STARTED
      pid = 3560
      argv[0] = E:\usr\sap\ECD\DVEBMGS00\exe\jcontrol.EXE
      argv[1] = E:\usr\sap\ECD\DVEBMGS00\exe\jcontrol.EXE
      argv[2] = pf=E:\usr\sap\ECD\SYS\profile\ECD_DVEBMGS00_sap-ec6-dev
      argv[3] = -DSAPSTART=1
      argv[4] = -DCONNECT_PORT=64999
      argv[5] = -DSAPSYSTEM=00
      argv[6] = -DSAPSYSTEMNAME=ECD
      argv[7] = -DSAPMYNAME=sap-ec6-dev_ECD_00
      argv[8] = -DSAPPROFILE=E:\usr\sap\ECD\SYS\profile\ECD_DVEBMGS00_sap-ec6-dev
      argv[9] = -DFRFC_FALLBACK=ON
      argv[10] = -DFRFC_FALLBACK_HOST=localhost
      start_lazy = 0
      start_control = SAP J2EE startup framework
    DpJ2eeStart: j2ee state = STARTED
    Mon Jan 20 10:58:44 2014
    DpJ2eeLogin: j2ee state = CONNECTED
    ======================================================================
    Regards
    Shafeeq

    Hi Experts Im sending DEV_W0 logs as well
    =========================================================
    trc file: "dev_w0", trc level: 1, release: "700"
    *  ACTIVE TRACE LEVEL           1
    *  ACTIVE TRACE COMPONENTS      all, MJ
    M sysno      00
    M sid        ECD
    M systemid   560 (PC with Windows NT)
    M relno      7000
    M patchlevel 0
    M patchno    333
    M intno      20050900
    M make:      multithreaded, Unicode, optimized
    M pid        616
    M
    M  kernel runs with dp version 247000(ext=110000) (@(#) DPLIB-INT-VERSION-247000-UC)
    M  length of sys_adm_ext is 576 bytes
    M  ***LOG Q0Q=> tskh_init, WPStart (Workproc 0 616) [dpxxdisp.c   1354]
    I  MtxInit: 30000 0 0

    M Mon Jan 20 10:53:10 2014
    M  DpSysAdmExtCreate: ABAP is active
    M  DpSysAdmExtCreate: VMC (JAVA VM in WP) is not active
    M  DpShMCreate: sizeof(wp_adm) 22152 (1704)
    M  DpShMCreate: sizeof(tm_adm) 4415616 (21968)
    M  DpShMCreate: sizeof(wp_ca_adm) 24064 (80)
    M  DpShMCreate: sizeof(appc_ca_adm) 8000 (80)
    M  DpCommTableSize: max/headSize/ftSize/tableSize=500/8/528056/528064
    M  DpShMCreate: sizeof(comm_adm) 528064 (1048)
    M  DpSlockTableSize: max/headSize/ftSize/fiSize/tableSize=0/0/0/0/0
    M  DpShMCreate: sizeof(slock_adm) 0 (96)
    M  DpFileTableSize: max/headSize/ftSize/tableSize=0/0/0/0
    M  DpShMCreate: sizeof(file_adm) 0 (72)
    M  DpShMCreate: sizeof(vmc_adm) 0 (1544)
    M  DpShMCreate: sizeof(wall_adm) (38456/34360/64/184)
    M  DpShMCreate: sizeof(gw_adm) 48
    M  DpShMCreate: SHM_DP_ADM_KEY (addr: 08980040, size: 5079600)
    M  DpShMCreate: allocated sys_adm at 08980040
    M  DpShMCreate: allocated wp_adm at 089821A8
    M  DpShMCreate: allocated tm_adm_list at 08987830
    M  DpShMCreate: allocated tm_adm at 08987860
    M  DpShMCreate: allocated wp_ca_adm at 08DBD8E0
    M  DpShMCreate: allocated appc_ca_adm at 08DC36E0
    M  DpShMCreate: allocated comm_adm at 08DC5620
    M  DpShMCreate: system runs without slock table
    M  DpShMCreate: system runs without file table
    M  DpShMCreate: allocated vmc_adm_list at 08E464E0
    M  DpShMCreate: allocated gw_adm at 08E46520
    M  DpShMCreate: system runs without vmc_adm
    M  DpShMCreate: allocated ca_info at 08E46550
    M  DpShMCreate: allocated wall_adm at 08E465C0
    M  DpRqQInit: Parameter rdisp/queue_lock_level = 2
    M  rdisp/queue_size_check_value :  -> on,50,30,40,500,50,500,80
    M  ThTaskStatus: rdisp/reset_online_during_debug 0
    X  EmInit: MmSetImplementation( 2 ).
    X  MM global diagnostic options set: 0
    X  <ES> client 0 initializing ....
    X  <ES> EsILock: use spinlock for locking
    X  Using implementation view
    X  <EsNT> Using memory model view.
    M  <EsNT> Memory Reset disabled as NT default
    X  ES initialized.
    X  mm.dump: set maximum dump mem to 96 MB
    M  ThInit: initializing DIA work process W0
    M  ThInit: rdisp/cleanup_after_crash = 1
    M  ThInit: running on host sap-ec6-dev

    M Mon Jan 20 10:53:12 2014
    M  calling db_connect ...
    B  Loading DB library 'E:\usr\sap\ECD\DVEBMGS00\exe\dboraslib.dll' ...
    B  Library 'E:\usr\sap\ECD\DVEBMGS00\exe\dboraslib.dll' loaded

    B Mon Jan 20 10:53:13 2014
    B  Version of 'E:\usr\sap\ECD\DVEBMGS00\exe\dboraslib.dll' is "700.08", patchlevel (0.324)
    C  Prepending E:\usr\sap\ECD\DVEBMGS00\exe to Path.

    C Mon Jan 20 10:53:21 2014
    C  Oracle Client Version: '10.2.0.4.0', (dbsl 700 131011, UNICODE[2])
    C  Application info callback registered.
    C  Client NLS setting (by OCINlsGetInfo): con=0, 'AMERICAN_AMERICA.UTF16'
    C  Logon as OPS$-user to get SAPSR3's password
    C  Connecting as /@ECD on connection 0 (nls 0) ... (dbsl 700 131011, UNICODE[2])
    C  Attaching to DB Server ECD (con=0,svchp=065E5218,srvhp=065F8614)
    C  Starting user session: OCISessionBegin(con=0, usr='/',svchp=065E5218, srvhp=065F8614, usrhp=06645C28)
    C     CbApplInfoGet() failed (ignored 1).

    C Mon Jan 20 10:53:22 2014
    C  Now '/@ECD' is connected: con=0, nls_hdl=0, session_id=67.
    C  Got SAPSR3's password from OPS$-user
    C  Disconnecting from connection 0 ...
    C  Closing user session (con=0,svchp=065E5218,usrhp=06645C28)
    C  Disconnected (con=0) from ORACLE.
    C  Connecting as SAPSR3/<pwd>@ECD on connection 0 (nls 0) ... (dbsl 700 131011, UNICODE[2])
    C  Starting user session: OCISessionBegin(con=0, usr=SAPSR3/<pwd>, svchp=065E5218, srvhp=065F8614, usrhp=06645C28)
    C  Now 'SAPSR3/<pwd>@ECD' is connected: con=0, nls_hdl=0, session_id=66.
    C  con=0, V$NLS_PARAMETERS: NLS_LANG=AMERICAN_AMERICA.UTF8, NLS_NCHAR=UTF8
    C  Nls CharacterSet                      NationalCharSet                        EnvHp      ErrHp      ErrBt
    C    0 UTF16                             AL16UTF16                           065E0368   065E5A44   065E52CC
    C  DB instance ECD is running on SAP-EC6-DEV with ORACLE version 10.2.0.2.0 since JAN 20, 2014, 10:52:51

    B Mon Jan 20 10:53:23 2014
    B  Connection 0 opened (DBSL handle 0)
    M  db_connect o.k.
    M  ICT: exclude compression: *.zip,*.cs,*.rar,*.arj,*.z,*.gz,*.tar,*.lzh,*.cab,*.hqx,*.ace,*.jar,*.ear,*.war,*.css,*.pdf,*.js,*.gzip,*.uue,*.bz2,*.iso,*.sda,*.sar,*.gif,*.png

    I Mon Jan 20 10:53:51 2014
    I  MtxInit: 0 0 0
    M  SHM_PRES_BUF (addr: 0AA70040, size: 4400000)
    M  SHM_ROLL_AREA (addr: 87810040, size: 61440000)
    M  SHM_PAGING_AREA (addr: 0C280040, size: 32768000)
    M  SHM_ROLL_ADM (addr: 0AEB0040, size: 633840)
    M  SHM_PAGING_ADM (addr: 0AF50040, size: 787488)
    M  ThCreateNoBuffer allocated 544152 bytes for 1000 entries at 0B020040
    M  ThCreateNoBuffer index size: 3000 elems
    M  ThCreateNoBuffer: correct_btc_behaviour = 1
    M  ThCreateVBAdm allocated 12160 bytes (50 server) at 0B0B0040
    X  EmInit: MmSetImplementation( 2 ).
    X  MM global diagnostic options set: 0
    X  <ES> client 0 initializing ....
    X  Using implementation view
    X  ES initialized.
    X  mm.dump: set maximum dump mem to 96 MB
    M  Deactivate statistics hyper index locking

    B Mon Jan 20 10:53:52 2014
    B  dbntab: NTAB buffers attached
    B  dbntab: Buffer FTAB(hash header)  (addr: 10AE0088, size: 336)
    B  dbntab: Buffer FTAB(anchor array) (addr: 10AE01D8, size: 160036)
    B  dbntab: Buffer FTAB(item array)   (addr: 10B07300, size: 720000)
    B  dbntab: Buffer FTAB(data area)    (addr: 10BB6F80, size: 30720000)
    B  dbntab: Buffer IREC(hash header)  (addr: 0E260088, size: 336)
    B  dbntab: Buffer IREC(anchor array) (addr: 0E2601D8, size: 160036)
    B  dbntab: Buffer IREC(item array)   (addr: 0E287300, size: 180000)
    B  dbntab: Buffer IREC(data area)    (addr: 0E2B3220, size: 6144000)
    B  dbntab: Buffer STAB(hash header)  (addr: 0E890088, size: 336)
    B  dbntab: Buffer STAB(anchor array) (addr: 0E8901D8, size: 160036)
    B  dbntab: Buffer STAB(item array)   (addr: 0E8B7300, size: 180000)
    B  dbntab: Buffer STAB(data area)    (addr: 0E8E3220, size: 3072000)
    B  dbntab: Buffer TTAB(hash header)  (addr: 0EBE0088, size: 1688)
    B  dbntab: Buffer TTAB(anchor array) (addr: 0EBE0720, size: 160036)
    B  dbntab: Buffer TTAB(item array)   (addr: 0EC07848, size: 480000)
    B  dbntab: Buffer TTAB(data area)    (addr: 0EC7CB48, size: 5840000)
    B  db_con_shm_ini:  WP_ID = 0, WP_CNT = 13, CON_ID = -1
    B  dbstat: TABSTAT buffer attached (addr: 13949F90)
    B  dbtbxbuf: Buffer TABL  (addr: 160700C8, size: 30000000, end: 17D0C448)
    B  dbtbxbuf: Buffer TABLP (addr: 0F2100C8, size: 10240000, end: 0FBD40C8)
    B  dbexpbuf[EXP_SHB]: buffer EIBUF installed with
    B    semkey             = 35
    B    shmkey             = 54
    B    wp_n               = 13
    B    sclass             = 0
    B    block_length       = 256
    B    max_objects        = 2000
    B    max_obj_size       = 880160
    B    pref_obj_size      = 0
    B    est_large_obj_size = 16384
    B    free_vec_lg        = 65
    B    hash_vec_size      = 4001
    B    buffer_l           = 4194304
    B    max_blocks         = 13754
    B    free_blocks        = 13754
    B    mutex_n            = 4001
    B    recovery_delay     = 500000
    B    tracing            = 0
    B    force_checks       = 0
    B    protect_shm        = 0
    B  dbexpbuf[EXP_SHM]: buffer ESM   installed with
    B    semkey             = 56
    B    shmkey             = 65
    B    wp_n               = 13
    B    sclass             = 0
    B    block_length       = 256
    B    max_objects        = 2000
    B    max_obj_size       = 880160
    B    pref_obj_size      = 0
    B    est_large_obj_size = 16384
    B    free_vec_lg        = 65
    B    hash_vec_size      = 4001
    B    buffer_l           = 4194304
    B    max_blocks         = 13754
    B    free_blocks        = 13754
    B    mutex_n            = 4001
    B    recovery_delay     = 500000
    B    tracing            = 0
    B    force_checks       = 0
    B    protect_shm        = 0
    B  dbexpbuf[EXP_CUA]: buffer CUA   installed with
    B    semkey             = 30
    B    shmkey             = 47
    B    wp_n               = 13
    B    sclass             = 10
    B    block_length       = 512
    B    max_objects        = 1500
    B    max_obj_size       = 641440
    B    pref_obj_size      = 0
    B    est_large_obj_size = 98304
    B    free_vec_lg        = 193
    B    hash_vec_size      = 3001
    B    buffer_l           = 3072000
    B    max_blocks         = 5012
    B    free_blocks        = 5012
    B    mutex_n            = 3001
    B    recovery_delay     = 500000
    B    tracing            = 0
    B    force_checks       = 0
    B    protect_shm        = 0
    B  dbexpbuf[EXP_OTR]: buffer OTR   installed with
    B    semkey             = 55
    B    shmkey             = 64
    B    wp_n               = 13
    B    sclass             = 13
    B    block_length       = 256
    B    max_objects        = 2000
    B    max_obj_size       = 880160
    B    pref_obj_size      = 0
    B    est_large_obj_size = 20480
    B    free_vec_lg        = 81
    B    hash_vec_size      = 4001
    B    buffer_l           = 4194304
    B    max_blocks         = 13754
    B    free_blocks        = 13754
    B    mutex_n            = 4001
    B    recovery_delay     = 500000
    B    tracing            = 0
    B    force_checks       = 0
    B    protect_shm        = 0
    B  dbcalbuf: Buffer CALE  (addr: 13010040, size: 500000, end: 1308A160)
    M  rdisp/thsend_mode : -1 -> 0

    G Mon Jan 20 10:53:53 2014
    G  RelWritePermissionForShm( pLocation = 120, pEnforce = 0 )
    G  GetWritePermissionForShm( pLocation =  99, pEnforce = 1 )
    G  RelWritePermissionForShm( pLocation = 100, pEnforce = 1 )
    S  *** init spool environment
    S  TSPEVJOB updates outside critical section: event_update_nocsec = 1
    S  initialize debug system
    T  Stack direction is downwards.
    T  debug control: prepare exclude for printer trace
    T  new memory block 1D404C20
    S  spool kernel/ddic check: Ok
    S  using table TSP02FX for frontend printing
    S  1 spool work process(es) found
    S  frontend print via spool service enabled

    S Mon Jan 20 10:53:54 2014
    S  printer list size is 150
    S  printer type list size is 50
    S  queue size (profile)   = 300
    S  hostspool list size = 3000
    S  option list size is 30
    S      found processing queue enabled
    S  found spool memory service RSPO-RCLOCKS at 216500A8
    S  doing lock recovery
    S  setting server cache root
    S  found spool memory service RSPO-SERVERCACHE at 21650430
    S    using messages for server info
    S  size of spec char cache entry: 297028 bytes (timeout 100 sec)
    S  size of open spool request entry: 2480 bytes
    S  immediate print option for implicitely closed spool requests is disabled
    A  ***GENER* Trace switched on ***

    A  ---PXA-------------------------------------------
    A  PXA INITIALIZATION
    A  PXA: Locked PXA-Semaphore.
    A  System page size: 4kb, total admin_size: 19392kb, dir_size: 19300kb.
    A  Attached to PXA (address 8B2B0040, size 300000K)
    A  abap/pxa = shared protect gen_remote
    A  PXA INITIALIZATION FINISHED
    A  ---PXA-------------------------------------------

    A  SHO: Set profile parameter abap/shared_objects_timeout to 10
    A  ABAP ShmAdm attached (addr=B8506000 leng=20955136 end=B9902000)
    A  >> Shm MMADM area (addr=B89695C0 leng=126752 end=B89884E0)
    A  >> Shm MMDAT area (addr=B8989000 leng=16224256 end=B9902000)
    A  RFC Destination> destination sap-ec6-dev_ECD_00 host sap-ec6-dev system ECD systnr 0 (sap-ec6-dev_ECD_00)
    A  RFC Options> H=sap-ec6-dev,S=00,d=2,
    A  RFC FRFC> fallback activ but this is not a central instance.
    A   
    A  RFC rfc/signon_error_log = -1
    A  RFC rfc/dump_connection_info = 0
    A  RFC rfc/dump_client_info = 0
    A  RFC rfc/cp_convert/ignore_error = 1
    A  RFC rfc/cp_convert/conversion_char = 23
    A  RFC rfc/wan_compress/threshold = 251
    A  RFC rfc/recorder_pcs not set, use defaule value: 2
    A  RFC rfc/delta_trc_level not set, use default value: 0
    A  RFC rfc/no_uuid_check not set, use default value: 0
    A  RFC rfc/bc_ignore_thcmaccp_retcode not set, use default value: 0
    A  RFC Method> initialize RemObjDriver for ABAP Objects
    M  ThrCreateShObjects allocated 27042 bytes at 0B0D0040

    N Mon Jan 20 10:53:55 2014
    N  SsfSapSecin: putenv(SECUDIR=E:\usr\sap\ECD\DVEBMGS00\sec): ok

    N  =================================================
    N  === SSF INITIALIZATION:
    N  ===...SSF Security Toolkit name SAPSECULIB .
    N  ===...SSF library is E:\usr\sap\ECD\DVEBMGS00\exe\sapsecu.dll .
    N  ===...SSF default hash algorithm is SHA1 .
    N  ===...SSF default symmetric encryption algorithm is DES-CBC .
    N  ===...SECUDIR="E:\usr\sap\ECD\DVEBMGS00\sec"
    N  ===...loading of Security Toolkit completed with rc 5 (SSF_SUP_NOTALLFUNCTIONS).
    N  ===   SAPSECULIB Version 5.4.28M-6
    N  =================================================

    N Mon Jan 20 10:53:58 2014
    N  MskiInitLogonTicketCacheHandle: Logon Ticket cache pointer retrieved from shared memory.
    N  MskiInitLogonTicketCacheHandle: Workprocess runs with Logon Ticket cache.
    M  JrfcVmcRegisterNativesDriver o.k.
    W  =================================================
    W  === ipl_Init() called
    B    dbtran INFO (init_connection '<DEFAULT>' [ORACLE:700.08]):
    B     max_blocking_factor =   5,  max_in_blocking_factor      =   5,
    B     min_blocking_factor =   5,  min_in_blocking_factor      =   5,
    B     prefer_union_all    =   0,  prefer_join                 =   0,
    B     prefer_fix_blocking =   0,  prefer_in_itab_opt          =   1,
    B     convert AVG         =   0,  alias table FUPD            =   0,
    B     escape_as_literal   =   1,  opt GE LE to BETWEEN        =   0,
    B     select *            =0x0f,  character encoding          = STD / <none>:-,
    B     use_hints           = abap->1, dbif->0x1, upto->2147483647, rule_in->0,
    B                           rule_fae->0, concat_fae->0, concat_fae_or->0
    W    ITS Plugin: Path dw_gui
    W    ITS Plugin: Description ITS Plugin - ITS rendering DLL
    W    ITS Plugin: sizeof(SAP_UC) 2
    W    ITS Plugin: Release: 700, [7000.0.333.20050900]
    W    ITS Plugin: Int.version, [33]
    W    ITS Plugin: Feature set: [26]
    W    ===... Calling itsp_Init in external dll ===>
    W  === ipl_Init() returns 0, ITSPE_OK: OK
    W  =================================================
    N  VSI: WP init in ABAP VM completed with rc=0
    E  Profile-Parameter: enque/deque_wait_answer = FALSE
    E  Profile-Parameter: enque/sync_dequeall = 0
    E  Replication is disabled
    E  EnqCcInitialize: local lock table initialization o.k.
    E  EnqId_SuppressIpc: local EnqId initialization o.k.
    E  EnqCcInitialize: local enqueue client init o.k.

    S Mon Jan 20 10:53:59 2014
    S  server @>SSRV:sap-ec6-dev_ECD_00@< appears or changes (state 1)

    S Mon Jan 20 10:54:00 2014
    S  server @>SSRV:sap-ec6-dev_ECD_00@< appears or changes (state 1)

    A Mon Jan 20 10:54:03 2014
    A  ***GENER* Trace switched off ***
    M  SecAudit(RsauShmInit): WP attached to existing shared memory.
    M  SecAudit(RsauShmInit): addr of SCSA........... = 07160040
    M  SecAudit(RsauShmInit): addr of RSAUSHM........ = 071607A8
    M  SecAudit(RsauShmInit): addr of RSAUSLOTINFO... = 071607E0
    M  SecAudit(RsauShmInit): addr of RSAUSLOTS...... = 071607EC
    M  SecAudit(check_daily_file): audit file opened E:\usr\sap\ECD\DVEBMGS00\log\20140120.AUD

    B Mon Jan 20 10:58:43 2014
    B  316 seconds passed since last buffsync

    S Mon Jan 20 11:06:43 2014
    S  found spool memory service RSPO-ACTIONS at 21659AF8

    B Mon Jan 20 11:15:32 2014
    B  dbmyclu : info : my major identification is 3232236530, minor one 0.
    B  dbmyclu : info : Time Reference is 1.12.2001 00:00:00h GMT.
    B  dbmyclu : info : my initial uuid is E381960EE8794FF1B90F0013211F21B9.
    B  dbmyclu : info : current optimistic cluster level: 0
    B  dbmyclu : info : pessimistic reads set to 2.
    =================================

  • Please help me with this indicator on my screen...it has reduced voice quality

    Please help me with the rectangular symbol on the top next to the speaker symbol. It seems that I have turned on some option by mistake and everytime I make or receive a call, this symbol comes up. It wasn't the case earlier.
    Because of this my voice call quality has dropped significantly. Please help soon.
    Thanks,
    itsmits
    Solved!
    Go to Solution.

    Sure, it's been answered here in the forums many many times.
    That is the call Audio Boost indicator.
    To change it, press your green dial key > Menu key > Enhanced Audio Boost.
    1. If any post helps you please click the below the post(s) that helped you.
    2. Please resolve your thread by marking the post "Solution?" which solved it for you!
    3. Install free BlackBerry Protect today for backups of contacts and data.
    4. Guide to Unlocking your BlackBerry & Unlock Codes
    Join our BBM Channels (Beta)
    BlackBerry Support Forums Channel
    PIN: C0001B7B4   Display/Scan Bar Code
    Knowledge Base Updates
    PIN: C0005A9AA   Display/Scan Bar Code

  • Please help me with ABAP code

    Hi Gurus,
    Please help me with the code.
    Algorithm: This is for master data extraction. I need to append some records to I_T_DATA before the loop on I_T_DATA begins.
    ZTAB is a custom defined table with key KEY. STAB is standard table with key KEY.
    1. Create an internal table I_T_STAB similar to STAB.
    2. Loop at I_T_DATA
        Read record from ZTAB where KEY = I_T_DATA-KEY and { field1 <> I_T_DATA-field1 or field2 <> I_T_DATA-field2 <> field3 <> I_T_DATA-field3}
    If success
         Delete record from I_T_DATA.
    Else
         Continue loop.
    Copy all records of STAB to I_T_STAB.
    3. Delete records in I_T_STAB where I_T_STAB-KEY = ZTAB-KEY.
    Now
    4. Delete all records in I_T_DATA where I_T_DATA-KEY = I_T_STAB-KEY.
    Now,
    5. Append all the remaining records from step 3 in I_T_STAB to I_T_DATA.
    Please help me with the code upto this part.
    Now the actual code in exit starts.
    Loop at I_T_DATA
    Thanks,
    Regards,
    aarthi
    [email protected]

    You might get a quick answer if you were to post in the ABAP forum. 
    Moderator, please move to ABAP forum.  Thanks.
    Regards,
    Rich Heilman

  • Please help!! Semester Project due in 3 days...........

    I have a connectivity problem where I have to select a number of vertices(N) and
    connect them with random non repeating edges(M). I have to test with cases
    M=.1xNxN, M=.2xNxN,.............M= .9xNxN. Well, it works up to M=.2xNxN when using 10 edges but I get a Stackoverflow error with more than M=.2xNxN.
    Please Please help. I have two classes
    import java.util.Random;import java.util.Scanner;
    * Write a description of class QuickUnion here.
    * @author (your name)
    * @version (a version number or a date)
    public class Union
        private Random generator;
        int E1,E2; int count = 0; int n = 50000;
         int a[] = new int [n];
        int b[] = new int [n];
         //Actual random number generator
         public int Generator(int gen){
             generator = new Random();      
            return generator.nextInt(gen);}
        //Method uses Random Generator to get E1,E2(or p,q) values
        public void Generator(int e1, int e2, int N){
            E1=Generator(N-1);
            E2=Generator(N-1);
            while(E1==E2){E2=Generator(N);}
            check(E1,E2,N);}
        //Method checks both array a and b at the same time for p,q or q,p values already generated
        public void check(int e1, int e2, int N){
            for(int i=0; i<a.length; i++){
                if(((a==e1) && (b[i]==e2)) || ((b[i]==e1) && (a[i]==e2))){
    Generator(0,0,N); }}
    a[count]=e1; b[count]=e2; count++;
    //Methods to view a and b arrays
    public void arrayShow(){
    for(int k=0; k<a.length; k++){System.out.print(a[k] + " ");
    public void arrayShow2(){
    for(int k=0; k<a.length; k++){System.out.print(b[k] + " ");
    import java.util.*; import java.util.Scanner;
    * QUICKFIND QUICKFIND QUICKFIND
    * @author Degrion Hill
    * @version 3160 Project Program
    public class Client2
    {public static void main(String[] args)
    int answer =0;
    int N,E1,E2,counter= 0;
    Scanner in = new Scanner(System.in);
    // User Input for amount of Vertices
    System.out.println("Enter the number of Vertices");
    N=in.nextInt();
    //Populating Array
    int id[] = new int [N];
    for(int i = 0; i < N; i++){id[i]=i;}
    //User input for amount of edges
    System.out.println("Enter the number of edges");
    int edges = in.nextInt();
    Union test = new Union();
    //Random Edge Generator
    while(counter<edges){
    test.Generator(0,0,N);
    //Assignment of Random number to p,q values to make edge
    int p = test.E1, q = test.E2;
    int t = id[p];
    //Quick Find Algorithm
    System.out.println("p=" + p + " " + "q=" + q); counter++;
    for(int k =0; k < N; k++){
    System.out.print(" " + id[k]);}
    System.out.print("\n");
    if (t==id[q])continue;
    for(int i = 0; i<N; i++)
    if(id[i]==t) id[i]=id[q];
    System.out.println("SORTED");
    //Sort the array before Counting groups(Using Bubble Sort)
    Sort test2 = new Sort();
    test2.bubble(id,0,id.length-1);
    for(int m =0; m < N; m++){
    System.out.print(" " + id[m]);}
    //Count changes in the array(groups)
    int y=0; int group=0;
    for(int x=0; x<N; x++){
    if(x==0){id[y]=id[x];}
    if(id[x] != id[y]){id[y]=id[x];group++;}}
    System.out.println();
    System.out.println(group+1 + " Group/s");
    System.out.print("");
    System.out.println("Run Again? [1 for YES, 2 for NO]");
    answer=in.nextInt();
    //(Testing) Shows a and b arrays to see if ALL cases for p,q are there
    if(answer==1){main(args);} test.arrayShow(); System.out.println(""); test.arrayShow2();

    Whithout diving into your code: StackOverFlowError occurs usually if you do a recursion and don't stop it before memory blows.

Maybe you are looking for

  • Changing a Node in a DOM

    Hi, I was wondering if it is possible to Change a Node in a Document with a another node e.g. A Node is a copy, but has a different Value. So effectively updating th Node and the Document. Cheers, IJ...

  • Why does TO_CHAR not like me adding a fraction then specifying FF?

    Why does TO_CHAR not like me adding a fraction? SQL> SELECT TO_CHAR(TO_TIMESTAMP('1/1/2012', 'DD/MM/YYYY') + .733409047, 'HH24:MI:SS') FROM Dual; TO_CHAR( 17:36:07 SQL> SELECT TO_CHAR(TO_TIMESTAMP('1/1/2012', 'DD/MM/YYYY') + .733409047, 'HH24:MI:SS.F

  • IS XAVC-S SUPPORTED BY FCPX ?

    HI ALL: I don't seem to find specific answer to this question. I know that the Professional XAVC is supported by FCPX by using the Sony Pluging. But the XAVC--S is the consumer codec and cannot find this information anywhere. The spec sheet for FCPX

  • I have a great idea for Mini's and or other Notebook's / Laptops.

    I just bought an Hp Mini 210 and i love it but there are a few things that bother me.  When i am using my mini at night or in a car i cannot for the life of me see the letters i am pushing. tho i have the keyboard memorized in my head so i don't need

  • Reorganisation of tables

    Hi, in Oracle segment advisor you will find suggestions like "shrink space" or "Reorganise" to reorganise a table. I understand the different commands behind these options, but can you explain the criteria Oracle uses to choose between these two opti