Algorithm doubt, help me!!!

if any one could help me out whit this algorithm.
i would really appreciate if there are 2 clients and server.
The serveer must send the average hours to the 2 clients, for this to happen the clients are asked what time is on each computer that is where the average of hours comes from. The one that is behind is asked to set its time one hour ahead and the one that is ahead is asked to set a delay (if this is not possible then at least have the server send a message to delay the clock.
The client must be ready for the server what it sads some data ("i put 80"), when it recives 80 the client will run a sequence that will open the port and send the time on that machine to the server, each client has a diferent port number, i don't know if the server take care of doing math, it on calculates the average.
where i am heaving trouble is the communication between the server and client, i look the "UDP MULTICAST SENDER" and "UDP MULTICAST RECIVER" as example.
and in case its important i am converting the string that a client sends the server whit a CAST
I HOPE SOMEONE CAN HELPME
Attachments:
Berkeley proyecto.zip ‏90 KB

Seguimos la discusion en el foro en espanol:
http://forums.ni.com/ni/board/message?board.id=6170&message.id=1900&jump=true
Saludos,
ErinB
NI Mexico

Similar Messages

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,

Statistical algorithm..help needed for simplification..

HI,
I have a complex algorithm which takes almost 900 milliseconds per line to process this . I have to calculate the probability for hundreds of thousand lines. Just imagine if have to calculate this for some 500000 lines which is not feasilble at al.. Can anyone help me in simplifing this algorithm & improve the performance..
This is very urgent & your help will desperately needed. Pls...pls ..help.
thanks in advacnce...
probabilty(int a, int b, int c, int d)     {
     int a1 = 0;
     int b1 = 0;
     int c1 = 0;
     int d1 = 0;
     double p = 0.0;
     double q = 0.0;
     double sum = 0.0;
     if(a*b*c*d == 0) {
          if (d == 0) {
               a1 = a;
               a = b;
               b = a1;
               a1 = c;
               c = d;
               d = a1;
     } else if (((a + 0.0)/(b + 0.0)) < ((c + 0.0)/(d + 0.0))) {
          a1 = a;
          a = b;
          b = a1;
          a1 = c;
          c = d;
          d = a1;
     p = logFact(a+b) +
          logFact(a+c) +
          logFact(b+d) +
          logFact(c+d) -
          logFact(a+b+c+d);
     for (int i=b; i>=0; i--) {
          b1 = i;
          a1 = a + b - b1;
          c1 = a + c - a1;
          d1 = b + d - b1;
          q = logFact(a1) +
               logFact(b1) +
               logFact(c1) +
               logFact(d1);
          sum = Math.exp(p-q) + sum;
          if(a*b*c*d == 0) {
               break;
     }

Can you explain what the algorithm is, what it does and why?
One thing is replacing things like "if (a*b*c*d == 0)" with common sense: "if (a == 0 || b==0 || ..."
What is logFact? Something expensive that can be optimized while using summation?

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.

Doubt help SAP Library Objects

I don´t understand the next paragraph (help SAP Library)
link sap library
Is there a error? CREF1 to
CREF3?
If it could not be so,why CREF2?
"The effect of the assignment statement is to copy the reference from CREF1 to CREF2. As a result, the reference in CREF3 also points to the object C_COUNTER<1>. No more references point to the object C_COUNTER<2>, and it is automatically deleted by the garbage collection. The internal name C_COUNTER<2> is now free again."

Hi abapers,
thank you for you attention.
I have debuger the next code:
REPORT zcu04_prueba.
CLASS counter DEFINITION.
PUBLIC SECTION.
DATA A TYPE I.
METHODS: increment.
ENDCLASS.
CLASS counter IMPLEMENTATION.
METHOD increment.
   A = A + 1.
ENDMETHOD.
ENDCLASS.
START-OF-SELECTION.
DATA: cref1 TYPE REF TO counter,
           cref2 TYPE REF TO counter,
           cref3 LIKE cref1.
1º):
cref1 = 0<>
cref2 = 0<>
cref3 = 0<>
CREATE OBJECT: cref1, cref2.
2º):
cref1 = 9
MOVE cref2 TO cref3.
3º):
cref1 = 9
CLEAR cref2.
4º):
cref1 = 9
cref3 = cref1.
4º):
cref1 = 9
http://help.sap.com/saphelp_nw70/helpdata/en/73/f6b832b3fd11d194f20000e8353423/content.htm
I don´t understand the next sentence (help SAP Library)
The effect of the assignment statement is to copy the reference from CREF1 to CREF2. As a result, the reference in CREF3 also points to the object C_COUNTER<1>. No more references point to the object C_COUNTER<2>, and it is automatically deleted by the garbage collection. The internal name C_COUNTER<2> is now free again."
I don´t understand. I think that the sentence:
"The effect of the assignment statement is to copy the reference from CREF1 to CREF3 is the correct.
Why it is no correct?
Thanks.
Cordial greetings

Cost center hierarchy doubts - Help

Hi All,
I have an issue here. Please help me out.
Can we maintain two standard hierarchies for a single controlling area?
Can we assign a same cost center to a subgroup and super group?
I have created a super group and under which there are four subgroups. Under each subgroup there are few costcenters (departments).
When i am running the subgroup wise report, i am getting cost element wise report.
While running super group cost element report i am getting subgroup and cost element report.
Can i get cost center, cost element report from super group?
Expecting your valuable answers.
Thanks & Regards
Arun

Hi Yongqiang,
Thanks for a quick reply.
Can you please explain me how can we assign a costcenter to different cost center groups in the same hierarchy.
If possible give me the tcode for it.
Thanks
Arun

Adapter : XML Doubt :Help Needed

Hi
I am trying to modity the sample adpater to work as a custom jdbc adapter. When my adaptyer gets the message it gets it in an XML format :
<?xml version="1.0" encoding="UTF-8"?>
<ns0:mt_jdbcrec xmlns:ns0="urn:flatfile2jdbc">
   <STATEMENT>
      <MyTest action="INSERT">
         <TABLE>TEST_EMP</TABLE>
         <access>
            <EMPID>c</EMPID>
            <EMPNAME>xc</EMPNAME>
            <EMPPAGE>xc</EMPPAGE>
            <FLAG>xc</FLAG>
         </access>
      </MyTest>
   </STATEMENT>
</ns0:mt_jdbcrec>
To do an insert into my data base I need to know the data type for each field. Is there any way to get the datatype for each field from my incoming message???
Thanks in Advance
Jai

Jai,
The below statement is little bit confusing,
<i>To do an insert into my data base I need to know the data type for each field. Is there any way to get the datatype for each field from my incoming message???</i>
If you don't mind could you please explain little bit in detail!!
-raj.

Report doubts-Help me to sort out this issue

Dear friends
I have table
Table name - country_master
column name
     country code varchar2(3)
country name varchar2(50)
I have other details
Table Name - Sales_dtls
Column name
sales_date
sales_value
lst_ctry1, - This below 10 column only stores country code
lst_ctry2,
lst_ctry3..
lst_ctr10
How do I Print country name based on country code in my reports
My sample reports output look like this
SALES_DATE SALES_VALUE LST_CTRY1 LST_CTRY2 .. LST_CTRY10
Rgds
Dev

You can join to the country_master table 10 times or create a function to return the name like:
select sales_date
       sales_value
       b.country_name lst_ctry1_name ,
       c.country_name lst_ctry2_name,
       d.country_name lst_ctry3_name,
       k.country_name lst_ctry10_name
from country_master k,
       country_master d,
       country_master c,
       country_master b,
       sales_dtls a
where a.lst_ctry1 = b.country_code
   and a.lst_ctry2 = c.country_code
   and a.lst_ctry3 = d.country_code
   and a.lst_ctry10 = k.country_code
OR
create or replace function get_country_name(p_code varchar2) return varchar2 is
v_name varchar2(1000);
begin
select country_name
   into v_name
   from country_master
where country_code = p_code;
return v_name;
end;
select sales_date
       sales_value
       get_country_name(lst_ctry1),
       get_country_name(lst_ctry2),
       get_country_name(lst_ctry3),
       get_country_name(lst_ctry10)
from sales_dtls a

FLASHBACK QUERY - Range based - Doubt - Help needed -URGENT

Hi,
I want to user the flashback query facility to capture the history of versions for a day (i.e) i want to get the data versions from morning 10 a.m to 6.pm.
How to get the versions by using the time range for a day.
I used the query as
select a.eno,
          b.eno,
          a.ename,
          b.ename
from emp a, emp as of timestamp
to_timestamp('08-NOV-2006 06:32:21.999999 AM','DD-MON-RRRR HH:MI:SS.ff6 AM') b
where a.eno=b.eno
The above query will fetch only one versions for the specified timestamp.
How could i implement the range based search through flashback query.
Please suggest any methods to implement the same.
Thanks in advance.

You'll want to read the documentation about Oracle Flashback Version Query.<br><br>
Regards,
Rob.

I need an algorithm, HELP!

If I input something like this:
a->b,
a->c,
b->d,
d->a,
and so on, could be many,
the the output is this: a->b->d->a, which is a circle from the input.
I need such a algorithm to help me find out all the circles from the input.

Cross post of [http://forums.sun.com/thread.jspa?threadID=5447698&tstart=0|http://forums.sun.com/thread.jspa?threadID=5447698&tstart=0].
Please don't post the same question in multiple forums since people may waste their time answering in one forum when a perfectly good response has been posted in another forum. If you feel the need to get a wider exposure of your problem then create a thread that links to the master thread and request responses be made only in the master thread.
I shall lock this thread.

Photoshop CS5, Need help

Everytime I try to install CS5 on my laptop, it freezes between 1-5% complete, these are the error messages I am getting
Exit Code: 24
-------------------------------------- Summary --------------------------------------
- 0 fatal error(s), 65 error(s), 3 warning(s)
WARNING: OS requirements not met for {667C8B6C-3EAF-4646-A8EC-D85CCC4D3D84}
WARNING: OS requirements not met for {7DFEBBA4-81E1-425B-BBAA-06E9E5BBD97E}
WARNING: Unable to read Adobe file version for file path 'C:\Program Files (x86)\Common Files\Adobe\APE\3.1\AdobeSWFL.dll'
ERROR: Unable to find file
ERROR: Error code: 2
ERROR: Set payload canceled status
ERROR: Payload {02731921-5711-4E7A-A898-D6BCF0F2A1CD} has an action "install" but no resultState
ERROR: Payload {033E378E-6AD3-4AD5-BDEB-CBD69B31046C} has an action "install" but no resultState
ERROR: Payload {03B6AF5B-A024-43DE-8DD2-8FB7B6A4149A} has an action "install" but no resultState
ERROR: Payload {0669F23C-1B69-41B4-A3ED-4F54A5986D66} has an action "install" but no resultState
ERROR: Payload {0A6FC585-E761-4776-A4F3-BDA1E4FE1B7A} has an action "install" but no resultState
ERROR: Payload {0D067D13-C3D7-4EA6-B346-740CD91FD547} has an action "install" but no resultState
ERROR: Payload {0F3647F8-E51D-4FCC-8862-9A8D0C5ACF25} has an action "install" but no resultState
ERROR: Payload {11C0657F-2BD4-4CBC-87F3-9455DC91886E} has an action "install" but no resultState
ERROR: Payload {15FEDA5F-141C-4127-8D7E-B962D1742728} has an action "install" but no resultState
ERROR: Payload {17C6080E-F475-4B49-A30C-EEB85673E999} has an action "install" but no resultState
ERROR: Payload {1D809D80-28A4-11DF-A816-0024E8692489} has an action "install" but no resultState
ERROR: Payload {1E9FC118-651D-4934-97BE-E53CAE5C7D45} has an action "install" but no resultState
ERROR: Payload {2EBE92C3-F9D8-48B5-A32B-04FA5D1709FA} has an action "install" but no resultState
ERROR: Payload {37AB3C65-E02C-4DCF-B0E0-4C2E253D8FA3} has an action "install" but no resultState
ERROR: Payload {39CB2E53-5326-4939-8B5A-0402C6EFBFE3} has an action "install" but no resultState
ERROR: Payload {3BF96AC2-0CA1-11DF-B07B-459956D89593} has an action "install" but no resultState
ERROR: Payload {3F023875-4A52-4605-9DB6-A88D4A813E8D} has an action "install" but no resultState
ERROR: Payload {4438C826-1FD0-4D04-A70B-24FE1580AB21} has an action "install" but no resultState
ERROR: Payload {4569AD91-47F4-4D9E-8FC9-717EC32D7AE1} has an action "install" but no resultState
ERROR: Payload {50A16F0B-47DA-4583-B4FE-E026719A2024} has an action "install" but no resultState
ERROR: Payload {54F4466A-091A-46DA-B697-43D55CEF9DF6} has an action "install" but no resultState
ERROR: Payload {56540320-C921-1029-83D9-FE864D1FC1DF} has an action "install" but no resultState
ERROR: Payload {61A3D10A-AA4D-4E4C-B9DB-6A08D318EA41} has an action "install" but no resultState
ERROR: Payload {635FED5B-2C6D-49BE-87E6-7A6FCD22BC5A} has an action "install" but no resultState
ERROR: Payload {667C8B6C-3EAF-4646-A8EC-D85CCC4D3D84} has an action "install" but no resultState
ERROR: Payload {69582206-7E5D-4476-A8F4-ECF90E9C8A69} has an action "install" but no resultState
ERROR: Payload {6B485102-4593-43F6-BA45-F14D690B0C64} has an action "install" but no resultState
ERROR: Payload {6C7D437A-D2E9-4FE9-A4D9-A6329860835C} has an action "install" but no resultState
ERROR: Payload {6D96660C-1444-410E-9A84-681C0AFB8937} has an action "install" but no resultState
ERROR: Payload {6E505C8F-2896-11DF-9B64-0013724DD917} has an action "install" but no resultState
ERROR: Payload {6F29BE46-E5F3-4146-8A84-20301E5C985A} has an action "install" but no resultState
ERROR: Payload {6F3A624B-1B72-4081-96E8-23261F389C5C} has an action "install" but no resultState
ERROR: Payload {73A4DC5E-226E-42BA-8ECA-2822592AC044} has an action "install" but no resultState
ERROR: Payload {78A53622-CDBA-49D1-A3D0-D563FB398D0C} has an action "install" but no resultState
ERROR: Payload {7A33510F-1580-42C2-877E-8C5502566292} has an action "install" but no resultState
ERROR: Payload {7DFEBBA4-81E1-425B-BBAA-06E9E5BBD97E} has an action "install" but no resultState
ERROR: Payload {7F9C94CD-0BAC-4F8F-8990-6A5886F4D550} has an action "install" but no resultState
ERROR: Payload {8557397C-A42D-486F-97B3-A2CBC2372593} has an action "install" but no resultState
ERROR: Payload {8CCA90E1-F5BA-456F-84BF-AD5FB2CCE13F} has an action "install" but no resultState
ERROR: Payload {925D058B-564A-443A-B4B2-7E90C6432E55} has an action "install" but no resultState
ERROR: Payload {925ED7E4-E1B6-4544-8141-1C98A18D2E2E} has an action "install" but no resultState
ERROR: Payload {92A3CA0D-55CD-4C5D-BA95-5C2600C20F26} has an action "install" but no resultState
ERROR: Payload {98DD55B6-C58C-462F-B8A4-F0585BFEBB15} has an action "install" but no resultState
ERROR: Payload {9A8B01C5-78D1-465F-B5F6-BD59B7800EC7} has an action "install" but no resultState
ERROR: Payload {A472B9E4-0AFF-4F7B-B25D-F64F8E928AAB} has an action "install" but no resultState
ERROR: Payload {AE9B837F-D135-42FC-BE03-33545B5DCBDC} has an action "install" but no resultState
ERROR: Payload {B55FDCCB-8A45-4943-8D90-585C3490A032} has an action "install" but no resultState
ERROR: Payload {BAE5212B-6651-4AD8-B26A-1B284D2665C6} has an action "install" but no resultState
ERROR: Payload {BD0D6363-E961-410F-8BF4-ECD8795F3923} has an action "install" but no resultState
ERROR: Payload {C8C1BAD5-54E6-4146-AD07-3A8AD36569C3} has an action "install" but no resultState
ERROR: Payload {CBDD7465-CE11-4A58-9497-C370B65923F1} has an action "install" but no resultState
ERROR: Payload {CFA46C39-C539-4BE9-9364-495003C714AD} has an action "install" but no resultState
ERROR: Payload {D26EEF95-420A-4726-B85D-AFBE752EF526} has an action "install" but no resultState
ERROR: Payload {D31D91FE-F0E8-4DF1-812C-9400BE92A386} has an action "install" but no resultState
ERROR: Payload {E39A5ABD-516B-46F9-A042-694BBA6A4E08} has an action "install" but no resultState
ERROR: Payload {E4E188D2-27D5-4E4C-92CE-87F9D24AD2F6} has an action "install" but no resultState
ERROR: Payload {E995AC53-954A-48D2-A861-613B8D42A9BE} has an action "install" but no resultState
ERROR: Payload {F6FA54C9-3E8F-4416-905C-DA5398DF9640} has an action "install" but no resultState
ERROR: The following payload errors were found during install:
ERROR: - Adobe Player for Embedding: User canceled installation
ERROR: - AdobeJRE: User canceled installation
ERROR: User cancelled the operation
I have windows home premium 64 bit, 4gb ram, intel core i3 with 2.26 ghz, can someone please try to help
I also tryed to install this program on my desktop comptuer which is a few years old and it works no problem

function(){return A.apply(null,[this].concat($A(arguments)))}
function(){return A.apply(null,[this].concat($A(arguments)))}function(){return A.apply(null,[this].concat($A(arguments)))}Wakewich5 wrote:
WARNING: OS requirements not met for {667C8B6C-3EAF-4646-A8EC-D85CCC4D3D84}
WARNING: OS requirements not met for {7DFEBBA4-81E1-425B-BBAA-06E9E5BBD97E}
etc.
I have windows home premium 64 bit
Which Windows? Windows 7? That clarification will no doubt help get an answer.
I've always wondered myself what OS requirements are not being met as indicated by these kinds of messages.
The creator of this thread seems to be reporting a very similar problem, and he has gotten some additional information... They do note a log to look in for more information.
http://forums.adobe.com/thread/629188
-Noel

Please help me with my project

I am required to do a proj in java.i am not finding
a good topic. But i liked the topic"html from java"
i dont have a clue as to h ow to do it.
please could you specify the detailed algorithm
for implementing it.i will be grateful
also if you know some other better topic ,pls
could you tell me abt it along with the algorithm
plese help
belur

So in a way you'd like us to do your project for you?
Wouldn't that make it our project?

A/V synchronization algorithm

Hi everybody!
I've done some packets capture from a RTSP session.
Can anybody tell me how can I check manually the audio and video packets synchronization?
What I want is an algorithm that helps me check the synchorinzation.
Thanks.

Doesn't anybody knows how Audio and Video Synchronization is made on JMF?

Payroll retro issue - related to /563

Hi PY experts,
Problem:
I have one PY retro issue.
Issue reported in December is :- One employee has a /563 claim of $18.45 (Claim from prev mth).
Why is here a deduction shown for this payslip?.
Issue reported in Jan 2010 is :- same employee has $99.3 (Claim from prev mth).
My analysis and details are as follows:-
December retro triggered for Oct,Nov.
Jan 10-retro triggered for June 09 onwards.
/561(amt employee owes to employer) in Nov in December run:- 18.45.
/561 in Nov in Jan'10 run:-117.75
So,
/563(claims from previous month) in December in december run:-18.45
/563 in December in Jan'10 run:-117.75
So,
99.30 SGD shown in Jan 2010 is the difference between the figures which was displayed in the last month.Ies (117.75 - 18.45 ) =99.30 .
-But my understanding is /561 will get formulated only in case the /110+/550 is negative.
But in this employee's scenario this amount is not coming as negative.Then how /561 is getting formulated even though( /110+/550 ) is not negative?
There is only difference between different runs of payroll of /101 . here is no difference in /110 amounts for same months in different runs.
So retro triggered thru the payment wage types(Cumilation 01).So I have run the wage type reoprt for comparing these wage types.(I can fwd this to email)
My doubts /help required areas are :-
1) How /561 is getting formulated even though( /110+/550 ) is not negative?
2) I can forward the details in proper excel format(easy to compare kind) -monthly wage type comparison report
which is related to (/101) wise reoprt , pls help me to find out how the exact amount is getting formulated.
Regards
Thomas
Edited by: tomspadiyara on Jan 10, 2010 7:00 AM
Edited by: tomspadiyara on Jan 11, 2010 3:19 AM

Hi,
I got the answers for the questions..
Can anybody pls help me by a document how all the technical wage types are getting formulated: ies
/140
/254 etc etc kind
This will help me for a faster derivation of the figure came in /563

Algorithm doubt, help me!!!

Similar Messages

Maybe you are looking for