Replacement for the ap_bank_branches and ap_bank_accounts in R12.1.3
Hi,
I'm working on bank Reconciliation interface in R12.1.3.
This is custom interface in 11.0.3 which uses ap_bank_branches and ap_bank_accounts table to derive the bank related information.
Could anybody please let me know if there is change in these tables and if yes which table i have to use.
Thanks in Advance,
Vishwas
Use ce_bank_accounts
ce_bank_acct_usages_all
ce_gl_accounts_ccid
For more details, see excellent post by Sanjit Anand at http://www.oracleappshub.com/account-payable/r12-ebs-banking-model-in-demanding-and-changing-world/. It shows the progression of this data model from 10.x to 11i to R12.
Hope this helps,
Sandeep Gandhi
Similar Messages
-
My old iphone was replaced today, due to faults. Now it will not allow me to use my credit card account for the appstore and itunes?
Please don't tell me to retry, or re check my information because it is all correct, it basically says u cannot use thi account due to it being connected to another device... which is my old fault iphone, at the apple store.I have never before heard of cards being locked to a single device... but your case has shown me that it happens.
If I am getting it right you try to log in to your account and it asks for billing information, and when you enter your card details it tells you that the card cannot be used. If that is the case then I'm sorry to say that my only suggestion would be to contact iTunes support directly; the contact form can be found in here: Apple - Support - iTunes Store - Contact Us -
A replacement for the Quicksort function in the C++ library
Hi every one,
I'd like to introduce and share a new Triple State Quicksort algorithm which was the result of my research in sorting algorithms during the last few years. The new algorithm reduces the number of swaps to about two thirds (2/3) of classical Quicksort. A multitude
of other improvements are implemented. Test results against the std::sort() function shows an average of 43% improvement in speed throughout various input array types. It does this by trading space for performance at the price of n/2 temporary extra spaces.
The extra space is allocated automatically and efficiently in a way that reduces memory fragmentation and optimizes performance.
Triple State Algorithm
The classical way of doing Quicksort is as follows:
- Choose one element p. Called pivot. Try to make it close to the median.
- Divide the array into two parts. A lower (left) part that is all less than p. And a higher (right) part that is all greater than p.
- Recursively sort the left and right parts using the same method above.
- Stop recursion when a part reaches a size that can be trivially sorted.
The difference between the various implementations is in how they choose the pivot p, and where equal elements to the pivot are placed. There are several schemes as follows:
[ <=p | ? | >=p ]
[ <p | >=p | ? ]
[ <=p | =p | ? | >p ]
[ =p | <p | ? | >p ] Then swap = part to middle at the end
[ =p | <p | ? | >p | =p ] Then swap = parts to middle at the end
Where the goal (or the ideal goal) of the above schemes (at the end of a recursive stage) is to reach the following:
[ <p | =p | >p ]
The above would allow exclusion of the =p part from further recursive calls thus reducing the number of comparisons. However, there is a difficulty in reaching the above scheme with minimal swaps. All previous implementation of Quicksort could not immediately
put =p elements in the middle using minimal swaps, first because p might not be in the perfect middle (i.e. median), second because we don’t know how many elements are in the =p part until we finish the current recursive stage.
The new Triple State method first enters a monitoring state 1 while comparing and swapping. Elements equal to p are immediately copied to the middle if they are not already there, following this scheme:
[ <p | ? | =p | ? | >p ]
Then when either the left (<p) part or the right (>p) part meet the middle (=p) part, the algorithm will jump to one of two specialized states. One state handles the case for a relatively small =p part. And the other state handles the case for a relatively
large =p part. This method adapts to the nature of the input array better than the ordinary classical Quicksort.
Further reducing number of swaps
A typical quicksort loop scans from left, then scans from right. Then swaps. As follows:
while (l<=r)
while (ar[l]<p)
l++;
while (ar[r]>p)
r--;
if (l<r)
{ Swap(ar[l],ar[r]);
l++; r--;
else if (l==r)
{ l++; r--; break;
The Swap macro above does three copy operations:
Temp=ar[l]; ar[l]=ar[r]; ar[r]=temp;
There exists another method that will almost eliminate the need for that third temporary variable copy operation. By copying only the first ar[r] that is less than or equal to p, to the temp variable, we create an empty space in the array. Then we proceed scanning
from left to find the first ar[l] that is greater than or equal to p. Then copy ar[r]=ar[l]. Now the empty space is at ar[l]. We scan from right again then copy ar[l]=ar[r] and continue as such. As long as the temp variable hasn’t been copied back to the array,
the empty space will remain there juggling left and right. The following code snippet explains.
// Pre-scan from the right
while (ar[r]>p)
r--;
temp = ar[r];
// Main loop
while (l<r)
while (l<r && ar[l]<p)
l++;
if (l<r) ar[r--] = ar[l];
while (l<r && ar[r]>p)
r--;
if (l<r) ar[l++] = ar[r];
// After loop finishes, copy temp to left side
ar[r] = temp; l++;
if (temp==p) r--;
(For simplicity, the code above does not handle equal values efficiently. Refer to the complete code for the elaborate version).
This method is not new, a similar method has been used before (read: http://www.azillionmonkeys.com/qed/sort.html)
However it has a negative side effect on some common cases like nearly sorted or nearly reversed arrays causing undesirable shifting that renders it less efficient in those cases. However, when used with the Triple State algorithm combined with further common
cases handling, it eventually proves more efficient than the classical swapping approach.
Run time tests
Here are some test results, done on an i5 2.9Ghz with 6Gb of RAM. Sorting a random array of integers. Each test is repeated 5000 times. Times shown in milliseconds.
size std::sort() Triple State QuickSort
5000 2039 1609
6000 2412 1900
7000 2733 2220
8000 2993 2484
9000 3361 2778
10000 3591 3093
It gets even faster when used with other types of input or when the size of each element is large. The following test is done for random large arrays of up to 1000000 elements where each element size is 56 bytes. Test is repeated 25 times.
size std::sort() Triple State QuickSort
100000 1607 424
200000 3165 845
300000 4534 1287
400000 6461 1700
500000 7668 2123
600000 9794 2548
700000 10745 3001
800000 12343 3425
900000 13790 3865
1000000 15663 4348
Further extensive tests has been done following Jon Bentley’s framework of tests for the following input array types:
sawtooth: ar[i] = i % arange
random: ar[i] = GenRand() % arange + 1
stagger: ar[i] = (i* arange + i) % n
plateau: ar[i] = min(i, arange)
shuffle: ar[i] = rand()%arange? (j+=2): (k+=2)
I also add the following two input types, just to add a little torture:
Hill: ar[i] = min(i<(size>>1)? i:size-i,arange);
Organ Pipes: (see full code for details)
Where each case above is sorted then reordered in 6 deferent ways then sorted again after each reorder as follows:
Sorted, reversed, front half reversed, back half reversed, dithered, fort.
Note: GenRand() above is a certified random number generator based on Park-Miller method. This is to avoid any non-uniform behavior in C++ rand().
The complete test results can be found here:
http://solostuff.net/tsqsort/Tests_Percentage_Improvement_VC++.xls
or:
https://docs.google.com/spreadsheets/d/1wxNOAcuWT8CgFfaZzvjoX8x_WpusYQAlg0bXGWlLbzk/edit?usp=sharing
Theoretical Analysis
A Classical Quicksort algorithm performs less than 2n*ln(n) comparisons on the average (check JACEK CICHON’s paper) and less than 0.333n*ln(n) swaps on the average (check Wild and Nebel’s paper). Triple state will perform about the same number of comparisons
but with less swaps of about 0.222n*ln(n) in theory. In practice however, Triple State Quicksort will perform even less comparisons in large arrays because of a new 5 stage pivot selection algorithm that is used. Here is the detailed theoretical analysis:
http://solostuff.net/tsqsort/Asymptotic_analysis_of_Triple_State_Quicksort.pdf
Using SSE2 instruction set
SSE2 uses the 128bit sized XMM registers that can do memory copy operations in parallel since there are 8 registers of them. SSE2 is primarily used in speeding up copying large memory blocks in real-time graphics demanding applications.
In order to use SSE2, copied memory blocks have to be 16byte aligned. Triple State Quicksort will automatically detect if element size and the array starting address are 16byte aligned and if so, will switch to using SSE2 instructions for extra speedup. This
decision is made only once when the function is called so it has minor overhead.
Few other notes
- The standard C++ sorting function in almost all platforms religiously takes a “call back pointer” to a comparison function that the user/programmer provides. This is obviously for flexibility and to allow closed sourced libraries. Triple State
defaults to using a call back function. However, call back functions have bad overhead when called millions of times. Using inline/operator or macro based comparisons will greatly improve performance. An improvement of about 30% to 40% can be expected. Thus,
I seriously advise against using a call back function when ever possible. You can disable the call back function in my code by #undefining CALL_BACK precompiler directive.
- Like most other efficient implementations, Triple State switches to insertion sort for tiny arrays, whenever the size of a sub-part of the array is less than TINY_THRESH directive. This threshold is empirically chosen. I set it to 15. Increasing this
threshold will improve the speed when sorting nearly sorted and reversed arrays, or arrays that are concatenations of both cases (which are common). But will slow down sorting random or other types of arrays. To remedy this, I provide a dual threshold method
that can be enabled by #defining DUAL_THRESH directive. Once enabled, another threshold TINY_THRESH2 will be used which should be set lower than TINY_THRESH. I set it to 9. The algorithm is able to “guess” if the array or sub part of the array is already sorted
or reversed, and if so will use TINY_THRESH as it’s threshold, otherwise it will use the smaller threshold TINY_THRESH2. Notice that the “guessing” here is NOT fool proof, it can miss. So set both thresholds wisely.
- You can #define the RANDOM_SAMPLES precompiler directive to add randomness to the pivoting system to lower the chances of the worst case happening at a minor performance hit.
-When element size is very large (320 bytes or more). The function/algorithm uses a new “late swapping” method. This will auto create an internal array of pointers, sort the pointers array, then swap the original array elements to sorted order using minimal
swaps for a maximum of n/2 swaps. You can change the 320 bytes threshold with the LATE_SWAP_THRESH directive.
- The function provided here is optimized to the bone for performance. It is one monolithic piece of complex code that is ugly, and almost unreadable. Sorry about that, but inorder to achieve improved speed, I had to ignore common and good coding standards
a little. I don’t advise anyone to code like this, and I my self don’t. This is really a special case for sorting only. So please don’t trip if you see weird code, most of it have a good reason.
Finally, I would like to present the new function to Microsoft and the community for further investigation and possibly, inclusion in VC++ or any C++ library as a replacement for the sorting function.
You can find the complete VC++ project/code along with a minimal test program here:
http://solostuff.net/tsqsort/
Important: To fairly compare two sorting functions, both should either use or NOT use a call back function. If one uses and another doesn’t, then you will get unfair results, the one that doesn’t use a call back function will most likely win no matter how bad
it is!!
Ammar MuqaddasThanks for your interest.
Excuse my ignorance as I'm not sure what you meant by "1 of 5" optimization. Did you mean median of 5 ?
Regarding swapping pointers, yes it is common sense and rather common among programmers to swap pointers instead of swapping large data types, at the small price of indirect access to the actual data through the pointers.
However, there is a rather unobvious and quite terrible side effect of using this trick. After the pointer array is sorted, sequential (sorted) access to the actual data throughout the remaining of the program will suffer heavily because of cache misses.
Memory is being accessed randomly because the pointers still point to the unsorted data causing many many cache misses, which will render the program itself slow, although the sort was fast!!.
Multi-threaded qsort is a good idea in principle and easy to implement obviously because qsort itself is recursive. The thing is Multi-threaded qsort is actually just stealing CPU time from other cores that might be busy running other apps, this might slow
down other apps, which might not be ideal for servers. The thing researchers usually try to do is to do the improvement in the algorithm it self.
I Will try to look at your sorting code, lets see if I can compile it. -
How to use the same services-config for the local and remote servers.
My flex project works fine using the below but when I upload my flash file to the server I doesn't work, all the relative paths and files are the same execpt the remote one is a linux server.
<?xml version="1.0" encoding="UTF-8"?>
<services-config>
<services>
<service id="amfphp-flashremoting-service"
class="flex.messaging.services.RemotingService"
messageTypes="flex.messaging.messages.RemotingMessage">
<destination id="amfphp">
<channels>
<channel ref="my-amfphp"/>
</channels>
<properties>
<source>*</source>
</properties>
</destination>
</service>
</services>
<channels>
<channel-definition id="my-amfphp" class="mx.messaging.channels.AMFChannel">
<endpoint uri="http://localhost/domainn.org/amfphp/gateway.php" class="flex.messaging.endpoints.AMFEndpoint"/>
</channel-definition>
</channels>
</services-config>
I think the problem is the line
<endpoint uri="http://localhost/domainn.org/amfphp/gateway.php" class="flex.messaging.endpoints.AMFEndpoint"/>
but I'm not sure how to use the same services-config for the local and remote servers.paul.williams wrote:
You are confusing "served from a web-server" with "compiled on a web-server". Served from a web-server means you are downloading a file from the web-server, it does not necessarily mean that the files has been generated / compiled on the server.
The server.name and server.port tokens are replaced at runtime (ie. on the client when the swf has been downloaded and is running) not compile time (ie. while mxmlc / ant / wet-tier compiler is running). You do not need to compile on the server to take advantage of this.
Hi Paul,
In Flex, there is feature that lets developer to put all service-config.xml file configuration information into swf file. with
-services=path/to/services-config.xml
IF
services-config.xml
have tokens in it and user have not specified additional
-context-root
and this swf file is not served from web-app-server (like tomcat for example) than it will not work,
Flash player have no possible way to replace token values of service-config.xml file durring runtime if that service-config.xml file have been baked into swf file during compilation,
for example during development you can launch your swf file from your browser with file// protocol and still be able to access blazeDS services if
-services=path/to/services-config.xml
have been specified durring compilation.
I dont know any better way to exmplain this, but in summary there is two places that you can tell swf about service confogiration,
1) pass -services=path/to/services-config.xml parameter to compiler this way you tell swf file up front about all that good stuff,
or 2) you put that file on the webserver( in this case, yes you should have replacement tokens in that file) and they will be repaced at runtime . -
Replacement for the Replacement? help!! 1st generation program
Hi my name is Juan Robles I recently enter to the 1st generation ipod program replacement, and they do send me a better ipod touch nano 8 gb 6 generation.
but it doesn't charge, i let it charge for a hole day and I even try it with a usb cable and a wall charger and once you disconected, it goes dead not even a blink... but if i plug it back to the cable it turn on very fast in less than 5 seconds.
My question is do they support a replacement for the replacement they send me, it is less than 90 days of from the date of service.
The Fedex box, the one with the replacement new ipod don't have the return address like the first one, the one where i send my 1st generation ipod. So any one resolve a similar issue , i will love to have the return address. I allready try the thec phone support but they put me on hold for more tha a hour and nothing.
Thanks in advance...Apple Service Operations
3011 Laguna Blvd., Building A
ELk Grove, CA 95758 -
HOW TO CREATE SEVERAL folder for the generation and READING FILE
HOW TO CREATE SEVERAL folder for the generation and READING FILE WITH THE COMMAND utl_File.
please give an example to create 3 folders or directories ...
I appreciate your attention ...
Reynel Martinez SalazarI hope this link help you.
[http://www.adp-gmbh.ch/ora/sql/create_directory.html]
create or replace directory exp_dir as '/tmp';
grant read, write on directory exp_dir to eygle;
SQL> create or replace directory UTL_FILE_DIR as '/opt/oracle/utl_file';
Directory created.
SQL> declare
2 fhandle utl_file.file_type;
3 begin
4 fhandle := utl_file.fopen('UTL_FILE_DIR', 'example.txt', 'w');
5 utl_file.put_line(fhandle , 'eygle test write one');
6 utl_file.put_line(fhandle , 'eygle test write two');
7 utl_file.fclose(fhandle);
8 end;
9 /
PL/SQL procedure successfully completed.
SQL> !
[oracle@jumper 9.2.0]$ more /opt/oracle/utl_file/example.txt
eygle test write one
eygle test write two
[oracle@jumper 9.2.0]$
SQL> declare
2 fhandle utl_file.file_type;
3 fp_buffer varchar2(4000);
4 begin
5 fhandle := utl_file.fopen ('UTL_FILE_DIR','example.txt', 'R');
6
7 utl_file.get_line (fhandle , fp_buffer );
8 dbms_output.put_line(fp_buffer );
9 utl_file.get_line (fhandle , fp_buffer );
10 dbms_output.put_line(fp_buffer );
11 utl_file.fclose(fhandle);
12 end;
13 /
eygle test write one
eygle test write two
PL/SQL procedure successfully completed.
SQL> select * from dba_directories;
OWNER DIRECTORY_NAME DIRECTORY_PATH
SYS UTL_FILE_DIR /opt/oracle/utl_file
SYS BDUMP_DIR /opt/oracle/admin/conner/bdump
SYS EXP_DIR /opt/oracle/utl_file
SQL> drop directory exp_dir;
Directory dropped
SQL> select * from dba_directories;
OWNER DIRECTORY_NAME DIRECTORY_PATH
SYS UTL_FILE_DIR /opt/oracle/utl_file
SYS BDUMP_DIR /opt/oracle/admin/conner/bdumpRegards salim.
Edited by: Salim Chelabi on Apr 4, 2009 4:33 PM -
We currently have a HP OfficeJet J6400 All-in-One Printer. It works fine and we are happy with it. However, our platforms are changing. We both have iPhones, iPads and iPods. We need to migrate to an Air Printer in order to make better use of our technology. It's a pain to have to send something to another platform (laptop) and then print.
My question is, which HP with Air Print would be a good replacement for the J6400. We still want all the features of an All-in-One.
Thanks,
Jim
This question was solved.
View Solution.Hello jghannah
For a list of AirPrint printers check the right hand side of this page.
I personally think either the Officejet 6500A Plus or the Officejet Pro 8600 would be perfect for your upgrade. They share a similar design to that of the Officejet 6400 series. They all have Airprint as well. For a good comparison between them check out the following link: Officejets with Airprint Comparison
Don't forgot to say thanks by giving "Kudos" to those that help solve your problems.
When a solution is found please mark the post that solves your issue. -
Can someone please tell me the exact screen measurements (width and length) for the 13 and 15 inch macbooks?
I've got a 13 inch Air but I need to know the visible dimensions of the 15.4 macbook pro.
Thank youYou should be able to identify the MagSafe adapter and cord from Support page:
•Intel-Based Apple notebooks: Identifying the right power adapter and power cord
•Apple Portables: Troubleshooting MagSafe adapters
Hopefully this helps. If you have a defective adapter, take it along if you happen to
have access to an Apple Store or Authorized Apple Service Provider, to match it.
PS: there is a MagSafe plug adapter to use one kind of MagSafe with later model
http://eshop.macsales.com/item/Apple/MD504ZMA/
PPS: MagSafe 85W Adapter compatible with your computer, see specs:
http://eshop.macsales.com/item/Apple/MC556LLA/
PPPS: Six foot AC power cable, replaces duck-head:
http://eshop.macsales.com/item/Apple/PWRCBLMSA/
Good luck & happy computing!
edited 2x -
Hello All...
Back after a brief absence, things look a little bit different.
I'm trying to take a 16 minute mini dv video and compress it for use on the web. I'm interested in any suggestions you may have on settings for the video and audio tracks. I've tried using Sorenson 3 (15 frames, key frames set to automatic, 320 x 240) for video and IMA 4:1 (mono) for audio. The resulting video looked great but the file size came in at about 255 Mb.
Thanks!
PowerMac G5 1.8 Dual Mac OS X (10.4.3)
Message was edited by: Dan FoleyThank you for the replies. Everyone was correct about the jack, interface, and phasing problems. I have been unplugging my motu audio interface and then using headphones at work. I have not changed any detailed audio output settings in logic. When I read that the jack might be a problem I tried switching headphones. This actually helped. I am using dre-beats headphones and they seem to be having issues with the mac/jack-(the phasing/panning problems. I can use these headphones with other devices but not the mac. I have to use ipod ear buds and the phasing seems fixed. Hopefully this information is helpful to someone else.
If anyone knows how to correct this issue please let me know its difficult to know what my final mixes are going to sound like and I have had to keep bouncing everything into i-tunes- sync to ipod and then listen in my car radio. -
Attachments dont download from Gmail in Safari, They disappear,I even tried re-downloading Safari and that download disappeared, it is not in my downloads folder, I actually searched in finder for the file and it is nowhere on my computer. Please help!
Oh my gosh I had the EXACT same problem, and for ages I couldn't figure out how to fix it until today. Here's what I did:
First I went onto my computer, opened itunes, and un-installed tumblr, vine and kik. These were the apps I was having problems with (it said I had them on my phone but, like you, they didn't show).
Then I went to the itunes store, searched for each one, and it said I could update them so I did (just FYI: for tumblr a window popped up saying "please click ok to confirm you are 17 years or older", so I did that also)
When I went back to my phone and tried installing them again (still on my computer), it worked!
I hope this helps, because it was incredibly frustrating. Good luck! -
I changed my Apple ID to my new email address successfully for the iTunes and App store but it won't work for iCloud and it won't recognize my password. I read that this can't be done. How am I supposed to get into iCloud? I plan on getting rid of my old email address which is my old Apple ID so how is that going to work?
Same question Wish someone had replied!
I changed my Apple ID to my new email and now cannot find any way to access icloud. Unfortunately I had allowed icloud to hijack my airbook files, so of course I am afraid I will lose them tomorrow when I exchange my iphone for a new one and cannot keep an icloud account i cannot access. What a poor sync system! Really atypical for apple! -
I have upgraded from an iphone to a 5. I have an itunes account on my laptop for the 4 and have started a new itunes account for the 5 on my desktop at work as the laptop was being fixed. I want to transfer all the contacts, apps and music, photos etc from the 4 to the 5 How do I go about this (in dummies language please!)
iOS: Transferring information from your current iPhone, iPad, or iPod touch to a new device
-
When I try to play a song on my iPod Touch, it shows the information screen for the song and then skips to a new song but then goes back to the main playlist page without ever playing a song! Help!
thats tough man, yeah exchanging it is the best option. But why do people always leave a message saying" i'll probably just by an ipod" and it's usually followed by, "even though i don't like apple or ipod" . I mean fine, if u feel like giving up on the zen micro thats fine, i personally don't care if you're going to buy an ipod. for god sakes ipod isn't even the next alternati've mp3 players, theres plenty. Are u just trying to get the creative people saying "oh man we lost another one to ipod" cuz i'm sure they don't lose sleep over u wanting to buy an ipod instead of a zen. *done ranting*
Message Edited by bleakreserve on 02-3-2005 06:34 AM -
I'm installing the new OS and iPhone is asking for a password to "restore" my iPhone, but I've never used a password for the phone and don't know what it is! Can anyone help??
You selected Encrypt iPhone Backups in iTunes. Then you entered a password.
It would be that specific password it is asking for.
See here:
https://discussions.apple.com/thread/3284065?start=0&tstart=0 -
Variance of Wagetype amounts Report for the previous and prest months
Hi experts,
our clients are wish to have the report of Variance of Wagetypes for the Previous and Present months.
we require the report on new wagetypes included in the Current month along with amount and also any wagetypes deleted for the current month along with amount.We also need to have the Difference between previous gross amount and current months Gross.
Is it possible to have the report on variation of amounts.
Regards,
V Sai.Hi,
The quickest way is to use wage type reporter (transaction PC00_M99_CWTR, report H99CWTR0_CE).
There you can specify two payroll periods and compare values by wage types, if necessary export result in Excel and do whatever you want.
Cheers
Maybe you are looking for
-
How can I create a new database?
Hi, can anyone tell me the steps I have to do if I want to create a new database? Can I perform this operation from the console of the Enterprise Manager or from the DBA studio? Thank you.
-
How do I select rows where 2 numbers are closest?
Hi, I need to select one row from each person where the days are the closest between the rows. In this example, I have rows of order data, and when a company first set up an account and then a column with the number of days it took for a certain orde
-
why won't my iPod stop after finishing episodes. It keeps playing.
-
Need info on configuring Third Party Systems on Soln Mgr
Hi All, I have installed Solution Manager 4.0 on Windows 2003 Server and Oracle 10.2.0.2 and need to integrate Third Party Systems like E3, HighJump and Marketmax on it. What we are basically looking for is configuring the Service Desk functionality
-
One folder that I have copied contains over 800 photos. On my PC they have file names that commence with date taken (yymmdd) followed by a sequence number (e.g. 071229-01). The photos taken on one day do not sort properly on the iPod - can anyone exp