Reference Algorithm

There is problem with my Reference Algorithm where it is designed to minimize the size of image file after serializing but unfortunately I am not getting the desired results.Reference Algorithm is roughly like this:-
Because every pixel has alpha,red,green and blue values and also those values always range from 0-255 values.
1]I created wrapper objects of Integer Object from 0-255 value.
2]Extract the alpha,red,green and blue values and whatever is the value point a reference to a Wrapper object of that value.For e.g :-if red value was 200 then use a reference to point towards a wrapper object of Integer with a value of 200.
3]Save the references in a vector.Meaning there will be four vector objects each with references for alpha,red,green and blue values.
4]Serialize the Wrapper Objects[256 object for 0-255 values] and the four vector objects.
Understanding is that objects require more space and therefore create small wrapper objects and use many references.May be saving thousands of references is the reason why the Reference Algorithm is not giving me desired results.

Wow - that's crazy biscuits! So for each pixel, instead of a single 4-byte int value, you now have four references (each 4-byte values). Plus your table of Integers (which is even more wasted space, because an int is the same size as a reference anyway). Nice way to increase your data size more than fourfold.
Have you considered the blindingly obvious option of saving the image as a PNG via ImageIO? :o)
http://en.wikipedia.org/wiki/Reinventing_the_square_wheel

Similar Messages

  • How to count unique entries accross the data grid?

    So I have managed to put a bunch of data into a partitioned cache 3 nodes.
    And now I would like to perform the following query/calculation.
    Say I have the following model...
    Person
    firstName
    lastName
    phoneNumber
    creditCard
    email
    ipAddress
    Given a person's email, count unique phoneNumbers, ipaddresses and creditCards.
    Or
    Given a person' s credit card count how many unique phonenumber, emails and ipAddresses.
    That said if we have the follwoing data...
    John Smith - [email protected] - 555-555-5555 - 1234567890000000 - xxx.xxx.xxx.xxx
    John Smith - [email protected] - 999-555-5555 - 1234567890000000 - xxx.xxx.xxx.yyy
    John Smith - [email protected] - 777-555-5555 - 1234567890000000 - xxx.xxx.xxx.yyy
    For query 1 given [email protected] I should get back
    1 unique phoneNumber
    1 unique creditCard
    2 unique ips
    For query 2 given 1234567890000000
    3 unique phoneNumbers
    2 unique emails
    2 unique ips
    Is possible through a regular query?
    Basically it's a cross reference algorithm.
    Edited by: 884647 on Sep 27, 2011 8:33 AM
    Edited by: 884647 on Sep 27, 2011 8:37 AM

    Just found this in a thread...
    Filter filter = ....
    ValueExtractor email = new ReflectionExtractor("email");
    ValueExtractor phone = new ReflectionExtractor("phonenumber");
    ValueExtractor ip = new ReflectionExtractor("phonenumber");
    Map mapResult = cache.aggregate(filter, new CompositeAggregator(new EntryAggregator[] {new ReducerAggregator(email), new ReducerAggregator(phone), new ReducerAggregator(ip)});
    Seems like the right solution and this works across a partitioned cache?

  • Lower_bound(), upper_bound() functions for sorted containers

    I can't find lower_bound(), upper_bound() functions for sorted containers in the java library. It doesn't seem to be there in the apache commons either.
    i'm referring here to the meaning as defined in STL (C++) as in:
    http://www.cplusplus.com/reference/algorithm/lower_bound/
    http://www.cplusplus.com/reference/algorithm/upper_bound/
    These functions are extremely useful for range lookups. Why is this not readily available in the java libraries?

    How I would write the Java code for the problem you stated on the blog:
    import java.util.Arrays;
    import java.util.NavigableMap;
    import java.util.TreeMap;
    import java.util.Map.Entry;
    public class TestNavigable {
        public static void main(String[] args) {
            NavigableMap<Integer, Integer> map = new TreeMap<Integer, Integer>();
            map.put(10, 100);
            map.put(25, 212);
            map.put(30, 212);
            map.put(200, 400);
            for (int check : new int[] { -1, 0, 5, 11, 26, 30, 100, 400 }) {
                Entry<Integer, Integer> upper = map.ceilingEntry(check);
                if (upper != null) {
                    Integer lower = map.lowerKey(upper.getKey());
                    if(lower == null) {
                        System.out.println(check + " falls into range up to "
                                + upper.getKey() + " and maps to " + upper.getValue());
                    else {
                        System.out.println(check + " falls into range <" + lower + ", "
                                + upper.getKey() + "] and maps to " + upper.getValue());
                else {
                    System.out.println(check + " is out of range!");
            // if you want to use arrays for other reasons
            // note: would require to keep keys/values in sync if not sorted
            int[] keys = { 10, 25, 30, 200 };
            int[] values = { 100, 212, 212, 400 };
            for (int check : new int[] { -1, 0, 5, 11, 26, 30, 100, 400 }) {
                int index = Arrays.binarySearch(keys, check);
                if(index < 0) {
                    index = -(index + 1);
                // good enough if no duplicate elements in keys
                // see binarySearch javadoc
                int lower = index - 1;
                int upper = index;
                if (upper < values.length) {
                    if(lower == -1) {
                        System.out.println(check + " falls into range up to "
                                + keys[upper] + " and maps to " + values[upper]);
                    else {
                        System.out.println(check + " falls into range <" + keys[lower] + ", "
                                + keys[upper] + "] and maps to " + values[upper]);
                else {
                    System.out.println(check + " is out of range!");
    }I'm too spoiled to write a binary search like you did ;-).

  • Algorithm/Lib for analysing references in scientific documents needed

    hi folks,
    i need a library to analyse references of a scientific document. the lib should be able to identify references in the full text (for instance [1], [2], ... or Author A (1995), ... Author B & C (1968), ...) and it should be able to identify the elements in the reference list. For instance if the reference list looks like this:
    Smith, J. 1982, A new method for reference analysing, Journal of Information Technology, vol. 23, no. 5, pp. 234-238.
    the library/algorithm should return for instance an array/list/... like this
    [surname][initial][year][title][journal][...]....
    Do libraries like this exist? I would also pay money for it if necessary.
    Best regards
    Jochen

    sorry for posting twice. please could you delete this thread?

  • Recommendation for algorithm references

    I stumbled on a book by John Horton Conway, "Winning Ways".
    He had an iterative solution to the Tower of Hanoi puzzle.
    Could someone recommend some other interesting algorithm books?
    I'd prefer your comments, rather than links to search engines or book sites, thanks.

    Fundamentals of Algorithms by Cormen et al is a good book for reference.There is another book "Data structures and algorithms design patterns' written by Waterloo professor,I think Bruno Weiss which is online .Algorithms in C/C++ by Sedgewick are also good.If you are working somewhere, then reading these books daily after the work becomes really exhausting.

  • Square root algorithm?

    Okay, two things...I've always kinda wondered what the algorithm for the square-root function is...where would I find that?
    but the main thing is, I was making a class to store/deal with a complex/mixed number (a + b*i), and I was trying to make a square-root method for that. But I fiddled around with the variables in the equation, and I can't quite get any further.
    This is what I got (algebraically: this isn't actual code):
    ( the variables a, b, c, d are all real numbers )
    ( the constant i is the imaginary unit, sqrt(-1) )
    sqrt(a + b*i) == c + d*i
    a + b*i == (c + di)^2
    a + b*i == c*c - d*d + 2*c*d*i
    a == c*c - d*d
    b == 2*c*d
    c == sqrt( a + d*d )
    c == b / (2* d)
    d == sqrt( c*c - a )
    d == b / (2*c)
    right now the only thing i can conclude from that, is that if you know (a or b) and (c or d) you can determine the other variables. but I can't figure out how to define c or d purely in terms of a and b, as the method would need to. so I'm stuck.

    Okay, two things...I've always kinda wondered what the
    algorithm for the square-root function is...where
    would I find that?
    Math.sqrt()It's an extremely important skill to learn to read the API and become familiar with the tools you will use to program Java. Java has an extensive set of documentation that you can even download for your convenience. These "javadocs" are indexed and categorized so you can quickly look up any class or method. Take the time to consult this resource whenever you have a question - you'll find they typically contain very detailed descriptions and possibly some code examples.
    http://java.sun.com/reference/api/index.html
    http://java.sun.com/j2se/1.4.2/docs/api/

  • Confusion between references in recursion

    Hi all,
    I am trying to create B+ trees for a database. My algorithm for the insert function is:
    void insert(page_no, entry, newchildentry )
    if page_no is not a leaf ,say N
    find i such that Ki <= entry's key value < K i+1   //choose subtree
    insert(newPage(i), entry,newchildentry )
    if newchildentry is null, return;
    else
              if N has space, insert the newchildentry, set it to null and return
             else
             split the page in half, the newchildentry is set to a new value
             if N is the root , do some extra things return;
    if  page_no is a leaf, say L
    if  L has space, insert entry on to it, set newchildentry to null and return;
    else split L in half, populate the newchildentry to some new values
    return;
    }The problem that i am facing is that newchildentry is being populated by some values in the "if page_no is a leaf, say L" part and on collapsing the recursion, these values are being lost and I can't figure what the problem is. i'm new to java even though i have programmed in c/c++ before and i think this would work. is it because java is maintaining different placeholders for the newchildentry?
    thanks.
    ~dang_it

    Hi all,
    I am trying to create B+ trees for a database. My
    algorithm for the insert function is:
    void insert(page_no, entry, newchildentry )
    if page_no is not a leaf ,say N
    find i such that Ki <= entry's key value < K i+1
    //choose subtree
    insert(newPage(i), entry,newchildentry )
    if newchildentry is null, return;
    else
    if N has space, insert the newchildentry,
    hildentry, set it to null and return
    else
    split the page in half, the newchildentry is
    dentry is set to a new value
    if N is the root , do some extra things
    ra things return;
    if  page_no is a leaf, say L
    if  L has space, insert entry on to it, set
    newchildentry to null and return;
    else split L in half, populate the newchildentry to
    some new values
    return;
    }The problem that i am facing is that newchildentry is
    being populated by some values in the "if page_no is
    a leaf, say L" part and on collapsing the recursion,
    these values are being lost and I can't figure what
    the problem is. i'm new to java even though i have
    programmed in c/c++ before and i think this would
    work. is it because java is maintaining different
    placeholders for the newchildentry?
    thanks.
    ~dang_itIn the code that is failing, what type is newchildentry. You need to be aware that objects are not passed in the argument list. A copy of the object reference is passed. When the method finishes, even if the object contents have changed, the reference has not. So, to say that in some case you set newchildentry to null does not change the newchildentry object reference in the calling method.
    � {�                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   

  • Ask again:  Where can I find source code for CPRM algorithm?

    Hi, everyone.
    Where can I find reference implementation or some sample codes for CPRM(content protection for recordable media) algorithm? Can anyone help?
    Information about CPRM can be find here,
    http://www.4centity.com/
    JAVA version is preferred and C/C++ implementation is also OK.
    Thanks in advance,
    Geo

    Thanks, edsonw buddy!
    I only found C2 cipher source code and some other documents dealing with CPRM algorithm. And what I want is total CPRM implementation reference source code (C2 is only a basic module of CPRM algorithm).
    So can you provide me some useful information dealing with how to get total CPRM implementation reference source code? Both JAVA and C/C++ will be OK.
    Have a wonderful weekend,
    George

  • Where can I find source code for CPRM algorithm?

    Hi, everyone.
    Where can I find reference implementation or some sample codes for CPRM(content protection for recordable media) algorithm? Can anyone help?
    Information about CPRM can be find here,
    http://www.4centity.com/
    Thanks in advance,
    Geo

    Thanks, edsonw buddy!
    I really take rather a lot of time to search reference implementation in this site but failed to find it out. Can you give me the precise link from which I can download reference implementation and sample vectors?
    Best regards,
    George

  • Cross reference stream

    Hello!
    I'm in real trouble, and I think that the answer is very close to me, but I can't get it by myself...
    Here is my problem:
    I'm currently improving the PDF parser that I've made, adding support for cross reference streams. After a careful reading of the ISO 32000 specification (with PDF 1.7 in background), I've wrote a piece of code that decode the stream and build the corresponding objects (I use Java).
    But the decoded values are meaningless, and I don't understand why!
    The data are like that:
    filter predictor: 12
    encoding : Flate
    fields length : 1 2 1 (this is the W entry values)
    column size : 4
    I assume that there is one color per pixel formed by one byte.
    First, I 'deflate' the data, then 'unfilter' them. Both operations look ok as I've made test for the Flate encoding (ok), and the for the filter I've use it with PDFBox source (and my work unfiltered well what PDFBox filtered...).
    Note that I compared my outputs with those produced by PDFBox, and they are the same... Something may be wrong in the parameters I use, but I no idea now...
    I think I missed out something as I read incorrect data as entry type 18...
    I don't know where to go now, after a whole week of work!
    If any have an idea, I'd be grateful to hear it!

    This is ready algorithm to read PNG predictor styled Cross Reference Stream:
    1. You need to read from PDF three variables: /Columns 5/Predictor 12 and /W[1 3 1] and of course stream
    2. Deflate (encode) stream via zlib (without passing anything more than stream)
    3. Divide encoded stream to rows, but length of each rows must be one bigger than columns variable (in this case is 6) because first value is type xref row
    6. rows without first row go to UNprediction with this algorithm:
    def self.do_png_post_prediction(data, bpp, bpr)
            result = ""
            uprow = thisrow = "\0" * bpr # just zero fill (byte zero - not char zero)
            ncols = data.size / bpr
            ncols.times do |col|    # just for each rows
              line = data[col * bpr, bpr]
              predictor = 10 + line[0]
              for i in (bpp..bpr-1) # just for each values of row without first value
                up = uprow[i]
                left = thisrow[i-bpp]
                upleft = uprow[i-bpp]
                case predictor
                  when PNG_NONE
                    thisrow = line
                  when PNG_SUB
                    thisrow[i] = ((line[i] + left) & 0xFF).chr
                  when PNG_UP
                    thisrow[i] = ((line[i] + up) & 0xFF).chr
                  when PNG_AVERAGE
                    thisrow[i] = ((line[i] + ((left + up) / 2)) & 0xFF).chr
                  when PNG_PAETH
                    p = left + up - upleft
                    pa, pb, pc = (p - left).abs, (p - up).abs, (p - upleft).abs
                    thisrow[i] = ((line[i] +
                      case [ pa, pb, pc ].min
                        when pa then left
                        when pb then up
                        when pc then upleft
                      end
                    ) & 0xFF).chr    # AND 0xFF is very important, without this values growing extremely fast
                else
                  puts "Unknown PNG predictor : #{predictor}"
                  thisrow = line
                end
              end
              result << thisrow[bpp..-1]
              uprow = thisrow
            end
            result
          end
       7. Take bytes from UNpredicted rows, and in this case
       1st byte first byte is type
       2nd byte    
       3rd-5th - is this what You want - offset in decoded PDF to objects (Xref table): offset = 2^9*5th + 2^8*4th + 3rd

  • Use of "Open FPGA VI Reference" function --- Build Specification vs VI vs Bitfile

    When using the "Open FPGA VI Reference" function in a LV2012 cRIO application, there are 3 options: Build Specification, VI, or Bitfile. What would be the reasons for selecting one over the others? Does it affect the resulting startup.rtexe when the cRIO application is built? I searched through the help and in these forums, but I don't see criteria for selecting one over the others; maybe I missed it.

    Hello Chris,
    Apologies in advance for a long reply.  
    The reference method won't change the functionality of your rtexe.exe.  They all end up dropping a bitstream, based on a bitfile, onto the cRIO's FPGA.
    To a degree, the method used to reference the FPGA code is a matter of taste, but there are situations where one method is better suited than the others.
    Reference by VI:
    Setting the configuration options to open reference by VI is helpful during development when you are making changes to an FPGA VI often and building/testing using the same spec.  When this option is used, a bitfile is selected based on the default build specification for the project.  A project may have only one default build specification.  You can make any build the default by checking the option under the Source Files category in the build properties.  The default build is indicated in the project explorer by the green box around the builds icon.  
    Reference by Bitfile:
    This option references a bitfile directly.  Through the configuration window, you can select one specific bitfile to open a reference to (this is not dynamic and does not change unless you physically go make a change to that path).  If you're using this method, it helps to give your bitfiles more meaningful names than the ones that are automatically generated by LabVIEW.  When you run subsequent compilations off of the same build specification and do not change the bitfile nname or path in the build configuration, the old bitfile is overwritten and replaced with the new one.  When you are using this option, it is critical that you keep up with which bitfile is the one you want to be using.  There is an option now that will help alleviate any problems referencing by bitfile through the Open FPGA VI Reference function.  There is a new VI called Open Dynamic Bitfile Reference.  It is typically used when you want to chose a specific bitfile to load depending on something in your host code (a configuration option etc) - but it allows you to dynamically reference a bitfile on the block diagram by path.
    Referency by Build Specification:
    This option is good for when you want to always use a bitfile that is associated with/compiled with the same build configuration.  Say you have two options for top level FPGA VIs in your project (each with its own build spec).  Both of these VIs have the same interface (read/write controls, DMA) but they run different algorithms or something.  This is nice because you can easily switch your host application between them by picking the build spec associated with the FPGA VI you want to use.  In this type of sutation, referencing by VI is no good because you can only have on default build spec.
    cheers.
    Matthew H.
    Applications Engineer
    National Instruments

  • What algorithm does Excel 2010 use for Pseudo Random Number Generation (MT19937?)

    Does Excel 2010+ use the Mersenne Twister (MT19937) algorithm for Pseudo Random Number Generation (PRNG), implemented by the RAND() function?
    This has been a nagging question for some time now, with "hints" that it indeed does.  However, a relatively thorough search turns up no definitive documentation.  The most direct indication is perhaps given by Guy Melard [Ref 9] where
    he tests Excel 2010's RAND() function using the Crush battery of tests in TestU01 by L'Ecuyer & Simard.  Melard references a "semi-official" indication that Microsoft did indeed implement MT19937 for the RAND() function in
    Excel 2010, but this reference no longer seems to be available. http://office.microsoft.com/enus/excel-help/about-solver-HP005198368.aspx?pid=CH010004571033.
    The other references below [Ref 1-10] document the history of the statistical suitability of the PRNG and probability distributions in various versions of Excel.  This includes the Wichmann-Hill PRNG implementations supposedly (arguably) used in
    Excel 2003 & 2007 for random number generation.  But still, we have no answer as to which PRNG algorithm is used in
    Excel 2010 (and 2013 for that matter).
    Microsoft indicates that RAND() has been improved in Excel 2010; Microsoft states, "...and the RAND function now uses a new random number algorithm." (see https://support.office.com/en-ca/article/Whats-New-Changes-made-to-Excel-functions-355d08c8-8358-4ecb-b6eb-e2e443e98aac). 
    But no details are given on the actual algorithm.  This is critical for Monte Carlo methods and many other applications.
    Any help would be much appreciated. Thanks.
    [Ref 1] B. McCullough, B. Wilson.  On the Accuracy of Statistical Procedures in Microsoft Excel 97. 
    Computational Statistics & Data Analysis. Vol. 31 No. 1, pp 27-37. July 1999.
    http://users.df.uba.ar/cobelli/LaboratoriosBasicos/excel97.pdf
    [Ref 2]L. Knüsel.  On the accuracy of the statistical distributions in Microsoft Excel 97. Computational Statistics & Data Analysis. Vol. 26 No. 3, pp 375-377. January 1998.
    http://www.sciencedirect.com/science/article/pii/S0167947397817562
    [Ref 3]B. McCullough, B. Wilson.  On the Accuracy of Statistical Procedures in Microsoft Excel 2000 and Excel XP. 
    Computational Statistics & Data Analysis. Vol.40 No. 4, pp 713-721. October 2002.
    https://www.researchgate.net/publication/222672996_On_the_accuracy_of_statistical_procedures_in_Microsoft_Excel_2000_and_Excel_XP/links/00b4951c314aac4702000000.pdf
    [Ref 4] B. McCullough, B. Wilson.  On the Accuracy of Statistical Procedures in Microsoft Excel 2003. 
    Computational Statistics & Data Analysis. Vol.49. No. 4, pp 1244-1252. June 2005.
    http://www.pucrs.br/famat/viali/tic_literatura/artigos/planilhas/msexcel.pdf
    [Ref 5] L. Knüsel. On the accuracy of statistical distributions in Microsoft Excel 2003. Computational Statistics & Data Analysis, Vol. 48, No. 3, pp 445-449. March 2005.
    http://www.sciencedirect.com/science/article/pii/S0167947304000337
    [Ref 6]B. McCullough, D.Heiser.  On the Accuracy of Statistical Procedures in Microsoft Excel 2007. 
    Computational Statistics & Data Analysis. Vol.52. No. 10, pp 4570-4578. June 2008.
    http://users.df.uba.ar/mricci/F1ByG2013/excel2007.pdf
    [Ref 7] A. Yalta. The Accuracy of Statistical Distributions in Microsoft<sup>®</sup> Excel 2007. Computational Statistics & Data Anlaysis. Vol. 52 No. 10, pp 4579 – 4586. June 2008.
    http://www.sciencedirect.com/science/article/pii/S0167947308001618
    [Ref 8] B. McCullough.  Microsoft Excel’s ‘Not The Wichmann-Hill’ Random Number Generators. Computational Statistics and Data Analysis. Vol.52. No. 10, pp 4587-4593. June 2008.
    http://www.sciencedirect.com/science/article/pii/S016794730800162X
    [Ref 9] G. Melard.  On the Accuracy of Statistical Procedures in Microsoft Excel 2010. Computational Statistics. Vol.29 No. 5, pp 1095-1128. October 2014.
    http://homepages.ulb.ac.be/~gmelard/rech/gmelard_csda23.pdf
    [Ref 10] L. Knüsel.  On the Accuracy of Statistical Distributions in Microsoft Excel 2010. Department of Statistics - University of Munich, Germany.
    http://www.csdassn.org/software_reports/excel2011.pdf

    I found the same KB article:
    https://support.microsoft.com/en-us/kb/828795
    This was introduced (according to the article) in Excel 2003. Perhaps the references in notes 2 and 3 might help.
    The article describes combining the results of 3 generators, each similar to a Multiply With Carry (MWC) generator, but with zero carry. MWC generators do very well on the Diehard battery of randomness tests (mentioned in your references), and have
    very long periods. But using zero carry makes no sense to me.
    Combining the three generators only helps if the periods of the 3 are relatively prime (despite what the article implies). Then the period of the result will be the product of the 3 periods. But without knowing the theory behind these generators, I have
    no idea what the periods would be. The formulas for MWC generators fail here.
    Richard Mueller - MVP Directory Services

  • EBS - Reference document number search for clearing open item

    Dear Experts,
    I am currently implementing EBS with MT 940 stattement for bank reconciliation.I want to clear open item, for out going cheque, during posting by reference field (XBLNR) where cheque number maintained.As per MT 940 statement this cheques number is mentioned in 86 line as follow
    :61:1102280228DR19961,NCHK682486          //51070
    :86:47558011XYZ ROAD
    But when I import bank statement, system recognise 682486 as reference field which is in 61 line and clears the open item.
    my requirement is for outgoing check system should recognise 86 line reference and other direct payment or inter bank transfer, system should consider  61 line reference.
    I have created different posting rule for Outgoing check and direct payment/Inter bank transfer.
    I tried to find such issue in forum but did not found any help.
    If need to use search string then how to configure for this and what algorithm to be used for the same.
    looking for solution
    Regards
    Sanjay D

    Hi,
    If you are talking about line item level, then it is called Allocation Number. At the header level, it is called Reference number.
    This is controlled using the copy control for billing - at the header level control.
    The reference number & allocation number once maintained in the configuration, will show up in the Accounting doc - header level & item level, respectively.
    For example - if the customer payment always refers to his PO number, then it really helps to use the allocation number for the accounting doc line items - which helps in clearing incoming payment faster. In this case, the reference number could be our delivery number. This is one of the examples for using both Ref & allocation #'s.
    Hope, this helps!
    S. Siva

  • How to change the schedule line date in SO with reference to value contract

    Hi SD Guru's,
    I need to change the schedule line date in the sales order with reference to the value contract by using some algorithm that i will write. The problem that i can't find the suitable place to add the algorithm. I can't add it to the Copy control because there is no schedule lines in value contract and copy control for schedule lines does no exist.
    I can not add to user exit MV45AFZZ  , because order that was created with reference to the value contract, does not go through this user exit.
    Do you have some ideas where i can add it?
    Thanks and Regards
    Viky
    Edited by: Viky Sloutsky on Oct 20, 2010 12:43 PM

    Hello Viky
    How about using program MV45AFZB- USEREXIT_CHECK_VBEP or USEREXIT_MOVE_FIELD_TO_VBEPKOM
    or program FV45EFZ1- USEREXIT_CHANGE_SALES_ORDER
    Does the program go through these exits when an order is created with ref to a value contract??
    Also I am wondering why you need to change a Schedule line determined by Availability check and/or delivery scheduling?

  • How to clear Documents using XBLNR(Reference field) through Manual BRS-FF67

    I want to clear GL line items in clearing account using Manual BRS(FF67) with reference to "XBLNR" field(Reference). IS there any standard Algorithm which SAP provided for reference field or if we want to develop ne algorithm then how to create.
    Thank in advance.
    Best Regards
    Raj

    Hello Raj,
    It is not possible to clear an open item on a g/l account via the
    reference document number. The automatic clearing with interpretation
    algorithm 021/001 only takes place, if the item, which should be cleared
    is on a customer/vendor account. So it could never find open G/L items.
    The reason is that the reference number is usually not unique
    so it could lead to wrong clearings.
    A workaround therefore would be to use:
    a) another interpretation algorithm depending on the note to payee
       data are available.
    b) the user exit 1 (described in note 494777, point 1) if there are
       no other information available as the reference number.
    c) the report SAPF124/E to clear these items afterwards. Then the bank
       statement should only post FB01 without clearing. The requirements
       are criteria to assign and clear the suitable items.
    Regards,
    Renan

Maybe you are looking for

  • JOIN의 종류와 이해

    제품 : ORACLE SERVER 작성날짜 : 2002-04-08 PURPOSE Join의 종류와 이의 사용 방법을 이해한다. EXPLANATION (1) 개요 Join 은 크게 - outer join - semi join - anti join 이 있으며, 이에 대해 하나씩 다루어 보기로 한다. (2)Anti Join - 1. 전체적 설명 anti-join 은 join 의 반대의 logic 을 갖는다. 이를 실행하면 왼쪽과 오른쪽이 match

  • 5th Gen. iPod won't sync game

    Bought tetris and it won't update. I went to devices>games and the box where it says sync games cannot be checked. It says I have to update iPod, but it's already updated...Help.

  • Scroll bar moves on asynchronous postback in IE 11

    Hi all, I have an .aspx page with a number of user controls, each of which has a GridView control within an UpdatePanel.  These UpdatePanels initiate asynchronous postbacks to update the GridViews. With IE9, and with the MaintainScrollPositionOnPostb

  • ACCOUNTING DOCUMENT FOR CONTROLLING DOCUMENT

    Hi Experts, I would like to know which table provides me the accounting document for the related Controlling document. ie. If i gives a controlling document for a table as an input in SE16 i should get the related accounting document . please help...

  • Relocating and moving my Mac

    Hi Everyone, I'm about to relocate to another state and plan on sending my G4 by Fed Ex - Do I need to prepare my Mac for the journey other than placing it back into it's original mailed to me box/container? I may also change my move plans for my Mac