Dynamic Algorithms ??

How do you write dynamic algorithms ?
e.g. taks a simple algorithm as �A * B � A�
with only two set varibales A & B, what I would like is for the user to change this algorithm e.g. to �A + A \ B� or any other combination, the algorithm will be located in a text file and loaded into the code, don�t wont to use a gui�
the idea of hot plugable algorithms is interesting, has anyone done this before. Thx

I think you are looking for an expression tree. So given an expression such as, String str = "x * x + y ^ b - 6 * (c - b)"; you build an tree.
ExpressionTree et = new ExpressionTree(str);
The variables are: x, y, b, c
so you need 4 values. In the expression tree create the following method:
public double eval(double[] val) {
However, an association between the index value and the variable name has not been defined. You could choose to sort it alphabetically, or you could do it in order the variables were received.
I have programmed such a class, let me know if you are interested and we could come to some sort of agreement. Or you could spend anywhere from a day to a week programming your own, depending on its level of sophistication.

Similar Messages

Need to overcome unique server name restriction (6.1)

Hello,
We need to have managed servers with same name to run on a given machine.
e.g. we have a server name - myserver.
We would like to run servers all having name myserver on our test machine. But
weblogic documentation tells taht all servers in a weblogic installation must
have unique names even across domains.
How can we overcome this restriction?
Can having different weblogic_home solve this problem.
Or any other way?
Why this restriction?
Regards
Mohit

Hi,
As the article mentioned: When you choose the Switch Independent mode, you also can choose the:
Address Hash and Hyper-V Port and Dynamic algorithm.
When you choose the Hyper-V Port and Dynamic algorithm, you must use the Sum of Queues then you need set the non-overlapping processor set, you must to configure
each NIC in your team to use the different processors. As an example, if you have 16 CPUs and 2 NICs in your team, one correct configuration would be to assign CPUs 2-7 to the first NIC and CPUs 8-15 to the second NIC.
More information:
Windows Server 2012 NIC Teaming (LBFO) Deployment and Management
http://www.microsoft.com/en-us/download/confirmation.aspx?id=30160
Hope this helps.
We
are trying to better understand customer views on social support experience, so your participation in this
interview project would be greatly appreciated if you have time.
Thanks for helping make community forums a great place.

How to use on board counter to change sample rate dynamically on pci-6134

Hi,
I am relatively new in LabView.
I am making power quality measurement system and I need to vary the sampling rate of my pci-6134 dynamically (all channels simultaneously). What I need is to have a constant amount of samples in each period of measured signal (grid voltage), which changes slightly all the time. Therefore I will have to measure the voltage, find its exact frequency and then adjust the sampling rate of daq accordingly. I know that there will always be some delay, but I would rather like not to go into any predictive algorithms...
I have found an information in the Forum that one of possible solutions is to use an onboard counter to change the sampling frequency but I have no idea how to make that. Can someone help me or possibly show an example?
Is there a simple way to solve that problem?
Thanks in advance
Andrzej

At least at a glance, the code generally looks like it ought to work. Two thoughts:
1. Instead of getting into PFI3 vs PFI8 routing stuff, can't you just specify "Dev1/Ctr0InternalOutput" as the AI Sample Clock source? (You may need to right-click the terminal to get at the menu that exposes the so-called "advanced terminals").
2. Try writing both the freq AND duty cycle properties when you want to update the freq. Or try using the DAQmx Write vi instead of a property node. My past experience suggests that writing only the freq property *should* still work, but writing both isn't hard to try and may turn out to help if the behavior of your version of DAQmx differs somehow.
-Kevin P.
P.S. Bonus 3rd thought. I just went back to reread the thread more carefully, including your first screenshot. I'm now thinking that maybe the hardware actually WAS behaving properly, and that you just weren't aware of it. When you query the AI task for it's sampling rate, all the task can know is whatever rate you told it when you configured it outside the loop. So even as you change the counter freq to change the actual hardware sampling rate on the fly, the AI task will continue to report its orig freq. After all, how is *it* supposed to know?
Try an experiment: Set your original freq very low so that the AI task produces a timeout error without getting all the requested samples within the 10 sec timeout window. Run and verify the timeout. Then run again, but after 3-5 seconds set a new frequency that will produce all those samples in another 1 sec or less. Verify that you get the samples rather than timing out. That should demonstrate taht the counter freq change really *does* produce a change to the hardware sample rate, even though the task property node remains unaware.

Web photo gallery, an algorithm?

hi, im makin a site and i want a photo gallery to be on it.
but id like to have an intelligent solution.
so i thought about an algorithm, id select a folder (in code
ofc) and it would automatically make a list of images being in it
(not only once, but every time it is being run - dynamic). then
makin a scrollbox with thumbnails (just resized originals - no
separate images and thumbnails) and when i click on one it shows it
in a frame next to the scrollbox. the images wouldnt have any
separate descriptions.
well, anyway id be happy even from a simpler solution: a page
with all the images in thumbnails, but listed automatically,
depending on the source folder contents, then when i click at one
it just opens it in a blank new window.
could anyone show me how to do it :P? (ima newb in html ;s)
kaziorvb

Go here
www.projectseven.com
Image Gallery Magic and Slide Show Magic will do what you
want. They're not
free but they are VERY good and professional looking.
Best Regards
Hywel Harris
"kaziorvb" <[email protected]> wrote in
message
news:f7a0ll$jnu$[email protected]..
hi, im makin a site and i want a photo gallery to be on it.
but id like to
have
an intelligent solution.
so i thought about an algorithm, id select a folder (in code
ofc) and it
would
automatically make a list of images being in it (not only
once, but every
time
it is being run - dynamic). then makin a scrollbox with
thumbnails (just
resized originals - no separate images and thumbnails) and
when i click on
one
it shows it in a frame next to the scrollbox. the images
wouldnt have any
separate descriptions.
well, anyway id be happy even from a simpler solution: a
page with all the
images in thumbnails, but listed automatically, depending on
the source
folder
contents, then when i click at one it just opens it in a
blank new window.
could anyone show me how to do it :P? (ima newb in html ;s)
kaziorvb

How to set a dynamic validation message in javascript

Hi,
I am using the "validate" event on a field, along with the "script message" field, to make a validation and send a message to the user if the test fails.
- Is it possible to define parameters in this message, for example "field &1 is invalid" where we replace &1 by the name of a field?
- Is it possible to send 2 different messages (I guess it's like using a message &1)?
- What is the best practice according to your experience?
Notes:
- I am aware of the xfa.host.messageBox, but I'd like to keep Adobe logic for validations (am I wrong? why?)
- I also saw the possibility of binding a field from the context, to the message field, but I found that it was not very clean to do this way (if even possible)
Thx !

According to the tests I did since yesterday, it is very difficult to use the "validation script message" (in the "value" tab of a "text input" field, within a dynamic table), for sending a dynamic message.
I abandon, and prefer to use use
xfa.host.messageBox( "dynamic message text" )
For information, I could change the message during "validate" event, with a rather complex algorithm.
Unfortunately, when a table row is just added (dynamically, with a button), though the message has been changed, it displays the original value. When I change the field again, the changed validation message is taken into account. I don't know why.
Edited by: Sandra Rossi on Jul 24, 2009 9:01 AM : it's only to say that since then, this was the only solution! Question closed

Dynamic column in Workflow inbox

HI All ,
     I would like to add a dynamic column in the SBWP layout which reflects the Last reserved by user...
    Any suggestion will surely be rewarded...
Thank you
Srinivas

Hi Srinivas,
the value will be updated each time the work item is <i>reserved</i>. When it is put back again, this value just stay as it was before.
The virtual attributes gets refreshed when the inbox is refreshed (by refresh-button or by re-entering the Workplace).
The algorithm to determine the last user, who has reserved, is the following:
DATA: user_id_last_reserved    TYPE SWWLOGHIST-meth_user.
CLEAR user_id_last_reserved.
SELECT SINGLE meth_user
              FROM SWWLOGHIST
              INTO user_id_last_reserved
              WHERE wi_id = object-key-workitemID
                and method = 'SWW_WI_SELECT'
                and timestamp IN (
                    SELECT MAX( timestamp )
                           FROM SWWLOGHIST
                           WHERE wi_id = object-key-workitemID
                            and method = 'SWW_WI_SELECT'.
IF sy-subrc <> 0.
   "There's no such user
ENDIF.
Have fun,
Florin

Dynamic Data columns

Hi...
Here's my scenario. My layout is keyfigures in lead columns.
I want Calendar Year in the Header. I want the Calendar Year/Month (0CALMONTH) in data columns.
But, the data columns should be dynamically set to the 12 months of the Year I choose as part of the header combination. Example, I choose 2008 as header:
Layout should alow me to enter sales for all months of 2008. So, data columns should become:
Jan 2008 Feb 2008 Mar2008 Apr2008 .....
Sales
I'm open to ideas for other types of layouts also as long as the the months (0CALMONTH) are derived based on Calendar Year.
Thanks...

KJ, thanks for your response.
Dont mean to question your suggestion at all. But is that only way?
I mean to me deriving a calendar year month seems to be a normal practice.
But if thats the only way, could you please provide more insight and possibly an algorithm for the exit? never worked exits before in the cotext of BPS.
Thanks...

Dynamically changing the color of nodes in a JTree

I have created a JTree and want to dynamically change the color of some of the TreeNodes as my program runs. The JTree is displayed in a JPanel. There is an algorithm built into which identifies the nodes whose color I need to change. No user actions is performed (everythign is internal to the program).
It seems that in the TreeCellRender only kicks in when the tree is first displayed. How do I get it to re-render the tree when the TreeModel changes? It seems that the Listeners are only looking for external user interactions.
Any help would be greatly appreciated.
Thanks!

I think I was a bit too vague in my question. Let me try again...
I have changed an attribute in a node in a JTree. This attribute is changed after the tree was initially rendered, but while the program is still running. I want to tell the TreeCellRenderer to look again at this node since that attribute that was changed will effect how the node should be renderered. I tried using the nodeChanged() method, but it did not work (the colot of the node did not change). Any advise how I can do this?
Thanks!

Hyper-V NIC Team Load Balancing Algorithm: TranportPorts vs Hyper-VPorts

Hi,
I'm going to need to configure a NIC team for the LAN traffic for a Hyper-V 2012 R2 environment. What is the recommended load balancing algorithm?
Some background:
- The NIC team will deal with LAN traffic (NOT iSCSI storage traffic)
- I'll set up a converged network. So there'll be a virtual switch on top of this team, which will have vNICs configured for each cluster, live migration and management
- I'll implement QOS at the virtual switch level (using option -DefaultFlowMinimumBandwidthWeight) and at the vNIC level (using option -MinimumBandwidthWeight)
- The CSV is set up on an Equallogics cluster. I know that this team is for the LAN so it has nothing to do with the SAN, but this reference will become clear in the next paragraph.
Here's where it gets a little confusing. I've checked some of the Equallogics documentation to ensure this environment complies with their requirements as far as storage networking is concerned. However, as part of their presentation the Dell publication
TR1098-4, recommends creating the LAN NIC team with the TrasportPorts Load Balancing Algorithm. However, in some of the Microsoft resources (i.e. http://technet.microsoft.com/en-us/library/dn550728.aspx), the recommended load balancing algorithm is HyperVPorts.
Just to add to the confusion, in this Microsoft TechEd presentation, http://www.youtube.com/watch?v=ed7HThAvp7o, the recommendation (at around minute 8:06) is to use dynamic ports algorithm mode. So obviously there are many ways to do this, but which one is
correct? I spoke with Equallogics support and the rep said that their documentation recommends TransportPorts LB algorithm because that's what they've tested and works. I'm wondering what the response from a Hyper-V expert would be to this question. Anyway,
any input on this last point would be appreciated.

Gleb,
>>See Windows Server 2012 R2 NIC Teaming (LBFO) Deployment and Management for more
info
Thanks for this reference. It seems that I have an older version of this document where there's absolutely
no mention of the dynamic LBA. Hence my confusion when in the Microsoft TechEd presentation the
recommendation was to use Dynamic. I almost implemented this environment with switch dependent and Address Hash Distribution because, based on the older version of the document, this combination offered:
a) Native teaming for maximum performance and switch diversity is not required; or
b) Teaming under the Hyper-V switch when an individual VM needs to be able to transmit at rates in excess of what one team member can deliver
The new version of the document recommends Dynamic over the other two LBA. The analogy that the document
makes of TCP flows with human speech was really helpful for me to understand what this algorithm is doing. For those who will never read the document, I'm referring to this:
"The outbound loads in this mode are dynamically balanced based on the concept of
flowlets. Just as human speech has natural breaks at the ends of words and sentences, TCP flows (TCP communication streams) also have naturally
occurring breaks. The portion of a TCP flow between two such breaks is referred to as a flowlet. When the dynamic mode algorithm detects that a flowlet boundary has been encountered, i.e., a break of sufficient length has occurred in the TCP flow,
the algorithm will opportunistically rebalance the flow to another team member if apropriate. The algorithm may also periodically rebalance flows that do not contain any flowlets if circumstances require it. As a result the affinity
between TCP flow and team member can change at any time as the dynamic balancing algorithm works to balance the workload of the team members. "
Anyway, this post made my week. You sir are deserving of a beer!

Dynamically creating JTree

Folks - I'm new to Java and hence requesting some assitance in something I'm working on. I want to read a ascii file that constains some containment hierarchy eg., The file is listed below.
<pre>
# First field is parent, and fields seprated by '=' are childs.
NodeA=NodeC, NodeD, NodeE
NodeE=NodeZ,NodeK
NodeK=NodeF
</pre>
I have no problem in reading the file, and parsing/tokenizing it at all.
How can I use the information here in creating a dynamic JTree.
Any help would be greatly appreciated.

Folks - I'm new to Java and hence requesting some
assitance in something I'm working on. I want to read
a ascii file that constains some containment hierarchy
eg., The file is listed below.
<pre>
# First field is parent, and fields seprated by '='
are childs.
NodeA=NodeC, NodeD, NodeE
NodeE=NodeZ,NodeK
NodeK=NodeF
</pre>
I have no problem in reading the file, and
parsing/tokenizing it at all.
How can I use the information here in creating a
dynamic JTree.
Any help would be greatly appreciated.- i assume that every node is named something unique and there can be no duplicates
- can you guarantee the order of the file? Is it always from the root downwards? ie. can you guarantee that the when you see "NodeE" in the first line that NodeE has not already been created? these details will greatly affect your algorithm. typically if you can guarantee a certain order or format of the file, it will greatly improve the efficiency of the algorithm
- here's an algorithm that would do the tree-building line by line, regardless of order, assuming no two nodes can be named the same thing, but it would probably be better to read in the entire file, storing the information in a vector or something and then go through all the data at once
- this algorithm should be applied after every line is read in; after the last line in the file is read in, the entire tree will be created: how do you know what is the root node?
- read in each line as: parent, child1, child2, etc...
- if a node named "parent" has not already been created, create a node named "parent":
DefaultMutableTreeNode node = new DefaultMutableTreeNode(parent);
- for each child, if a node named "child1" has not already been created, create a node named "child1" and add it as a child to "parent"
DefaultMutableTreeNode child = new DefaultMutableTreeNode(parent);
node.add(child);
- this algorithm is a pain because you always have to check if a node has already been created

MDM dynamic value mapping

Hi,
Gurus,
I'm working on idoc to file scenarion and i have to implement MDM dynamic value mapping for one of the idoc fields, and i have no idead about MDM dynamic value mapping , can anybody help me with step-by-step procedure to implement it and I'm not java guy...
Thanks!!
Waiting for reply...

Hi,
This might help you,
https://www.sdn.sap.com/irj/servlet/prt/portal/prtroot/docs/library/uuid/62770ffa-0301-0010-a0b2-c77294a3902e
https://www.sdn.sap.com/irj/servlet/prt/portal/prtroot/docs/library/uuid/5a9c405f-0a01-0010-0980-fa5082e517e6
https://www.sdn.sap.com/irj/servlet/prt/portal/prtroot/docs/library/uuid/603ca425-0c01-0010-cdb2-c10d13c43631
https://www.sdn.sap.com/irj/servlet/prt/portal/prtroot/docs/library/uuid/4ce0d691-0b01-0010-f4aa-c938d438ceb2
Setting up algorithm on MDM Client
Regards
Agasthuri Doss

Dynamic Programming - subsequence counting

I have two string arrays (X and Y) and I want to count the number of times that a sequence X appears as a subsequence of a sequence Y by using dynamic programing. Could you guys give me some ideas about how to create the DP table?
thanks

black_makeba wrote:
yes, this is a java programming. And the task is to figure out the algorithm. If I knew the algorithm, Coding would be trivial. So I am asking for any ideas about the algorithm.I have a weak spot for problems like this so here's a solution but I'm not sure it qualifies as "dynamic programming" in your assignment.
You start out with an X string like "abcd". We call this string X(0) because it's in its initial state. Now if the first letter "a" has been found the string is called X(1) which is "bcd" (the first letter has been found and is no longer of interest). When the X(0) string "abcd" has advanced to X(4) all letters have been found.
Example:
X(0): "abcd" - initial string
X(1): "bcd" - first letter found
X(2): "cd" - second
X(3): "d" - third
X(4): "" - whole string found
In the general case you have strings from X(0) to X(N) where N is the number of letters in the original X string.
Now you consider each letter in the Y sequence from left to right and for each letter you create an X(0) string. You may also have accumulated a number of X strings in other states like maybe five X(1) and four X(2) etcetera. You have a look at the current letter in the Y sequence and check if the X(0) string can be advanced to X(1). If not you discard it. Once a string is in X(1) it's never discarded. Then you also check all other X strings and see if you can advance them. You never advance a string beyond the X(N) state. This proceeds to the end of the Y sequence when the number of X(N) strings tells you how many hits there were.
Now here comes what I would call a "dynamic programming" strategy. In the above algoritm you keep all X strings of all states but you don't have to. You only need to know how many X strings you have in each state because they all advance too the next state in unison. So you get a table with one entry for each X state. The entry holds the number of X strings in that state.
What you need to figure out is how to update the X state table as you consider each letter in the Y sequence. The entry for X(N) is the number of hits.

Dynamic Programming with 2-D Arrays Possible in Oracle 10g or not?

Hi all,
Is there are 2-D arrays in Oracle? and when not, how can I implement any Dynamic Programming Algorithm (An [Knapsack Problem|http://en.wikipedia.org/wiki/Knapsack_problem] ) on data that I have
Thanks in advance
Edited by: ZiKaS on Dec 28, 2008 7:10 AM

Hello,
By combining single dimension collections you can build 2,3 or x dimension matrix:
Declare
type typ_int is table of integer index by binary_integer ;
type typ_tab_int is table of typ_int index by binary_integer ;
my_table typ_tab_int ;
Begin
for i in 1..10 loop
    for j in 1..5 loop
      my_table(i,j) := i * j ;
    end loop;
end loop;
End;Francois

Relationship between Dynamic Memory Heap and Heap Data Structure

This question is not strictly related to Java, but rather to programming in general, and I tend to get better answers from this community than any where else.
Somehow, my school and industry experience have somehow not given me the opportunity to explore and understand heaps (the data structure), so I'm investigating them now, and in particular, I've been looking at applications. I know they can be used for priority queues, heap sorts, and shortest path searches. However, I would have thought that, obviously, there must be some sort of relationship between the heap data structure, and the dynamic memory heap. Otherwise, I can think of no good reason why the dynamic memory heap would be named "heap". Surprisingly, after searching the web for 90 minutes or so, I've seen vague references, but nothing conclusive (trouble seems to be that it's hard to get Google to understand that I'm using the word "heap" in two different contexts, and similarly, it would not likely understand that web authors would use the word in two different contexts).
The Java Virtual Machine Spec is silent on the subject, as "The Java virtual machine assumes no particular type of automatic storage management system, and the storage management technique may be chosen according to the implementor's system requirements."
I've seen things like:
[of dynamic memory] "All the blocks of a particular size are kept in a sorted linked list or tree (I extrapolate that sorted tree could imply heap)"
[of dynamic memory] "The free and reserved areas of memory are maintained in a data structure similar to binary trees called a heap"
[of dynamic memory] "This is not related to the heap data structure"
[of dynamic memory] "Not to be confused with the data structure known as a "heap"
[of data structure] "Not to be confused with the dynamic memory pool, often known as TheHeap"
At this point, I've come to surmise that some (but not all) memory management algorithms use heaps to track which (pages? blocks? bytes?) of memory are used, and which are not. However, the point of a heap is to store data so that the max (or min) key is at the root of the heap. But we might want to allocate memory of different sizes at different times, so it wouldn't make sense to key on the amount of available memory in a particular region of the free store.
I must assume then that there would be a different heap maintained for each size of memory block that can be allocated, and the key must have something to do with the attractiveness of the particular memory block in the heap (perhaps the lowest address, resulting, hopefully, in growing the free store space less often, leaving more space for the stack to grow, or perhaps keyed based on the fragmentation, to hopefully result in less fragmentation, and therefore more efficient use of the memory space, or perhaps based on page boundaries, keeping as much data in the same page as possible, etc).
So at this point, I have a few questions I've been unable to resolve completely:
1. Am I correct that the heap was so named because (perhaps at one point in time), a heap is/was commonly used to track the available memory in the free store?
2. If so, would it be correct that there would be a heap per standard block size?
3. Also, at what level of granularity would a heap typically be used (memory page, memory blocks, individual words (4-bytes))?
4. What would be the most likely property one would use as a key. That is, what makes the root item on the heap ideal?
5. Would a industrial strength system like the jvm use a (perhaps modified or tuned) heap for this sort of task, or would this typically be too naive for an real world solution today?
Any insight would be awesome!
Thanks,
A.

jschell wrote:
I think you are not only mixing terms but domains.
For starters the OS allocs memory. Applications, regardless of language, request memory from the OS and use it in various ways.
There are many variations of the term "heap" like the following.
[http://en.wikipedia.org/wiki/Heap_(data_structure)]
[http://en.wikipedia.org/wiki/Dynamic_memory_allocation]
A java VM will request memory from the OS (from a 'heap') and use it in its application 'heap' (C/C++) and then create the Java 'heap'. There can be variations of that along the way that can and likely will include variations of how each heap is used, potentially code that creates its own heap, and potentially other allocators which use something which is not a heap.This last part, I find a bit confusing. By "use something which is not a heap", do you mean the heap data structure, or the dynamic memory pool meaning of heap? If the former, then you would be implying that it would be common for a heap data structure to be used to manage the heap dynamic memory pool. If the latter, what would this "something which is not a heap" be? The best definition of "heap" I've found simply states that it is a pool of memory that can be dynamically allocated. If there is some other way of allocating dynamic memory, then it would suggest that the previous definition of "heap" is incomplete.
>
So to terms.
1. Am I correct that the heap was so named because (perhaps at one point in time), a heap is/was commonly used to track the available memory in the free store?Which 'heap'? The VM one? It is probably named that because the implementors of the Sun VM were familar with how C++ and Smalltalk allocated memory.Okay, but that begs the question, was the heap in C++ and/or Smalltalk so named for the above queried reason?
>
2. If so, would it be correct that there would be a heap per standard block size?Not sure what you are referring to but probably a detail of the implementation. And since there are different levels the question doesn't mean much.
However OS allocations are always by block if that helps. After that it requires making the question much, much more specific.
3. Also, at what level of granularity would a heap typically be used (memory page, memory blocks, individual words (4-bytes))?Again not specific enough. A typical standard implementation of heap could not be at the word level. And it is unlikely, but not impossible, that variations would support word size allocations.
The VM heap might use word boundaries (but not size), where the application heap certainly does (word boundary.)My understanding of it is that the application would request blocks from the OS, and then something like malloc would manage the memory within the allocated blocks. malloc (or whatever equivalent Java uses) would have to keep track of the memory it has allocated somehow, and I would think it would have to do this at the word level, since it's most commonly going to allocate memory at the word level to be references to other objects, etc.
So I guess my question here would really be, if the dynamic memory heap is so named because there has been a memory management strategy that relied upon a heap data structure (which I've found no proof, but have found some suggestive literature), then would that probably have applied at the OS Page Fault level, tracking allocated blocks, or would that have applied at the malloc level, allocating individual words as necessary?
>
4. What would be the most likely property one would use as a key. That is, what makes the root item on the heap ideal?"Key" is not a term that will apply in this discussion.
You appear to be referring to strategies for effective allocation of memory such as allocations from different regions by size comparison.
It is possible that all levels might use such an allocator. General purpose applications do not sort allocations though (as per your one reference that mentions 'key'.) Sorry, I got the term "key" from an article I read regarding heaps, that indicates that a "key" is used to sort the elements, which I guess would be a more generalized way to make a heap than assuming a natural ordering on the elements in the heap. I'm not sure if the terminology is standard.
>
5. Would a industrial strength system like the jvm use a (perhaps modified or tuned) heap for this sort of task, or would this typically be too naive for an real world solution today?Again too indefinite. The Sun VM uses a rather complicated allocator, the model for which originated after years of proceeding research certainly in Smalltalk and in Lisp as well, both commercially and academically.
I am sure the default is rules driven either explicitly or implicitly as well. So it is self tuning.
There are command line options that allow you to change how it works as well.I guess perhaps I could attempt to clarify my initial question a bit.
There is a 1:1 correspondence between the runtime stack, and a stack data structure. That is, when you call a function, it pushes a stack frame onto the runtime stack. When you return from a function, it pops a stack frame from the runtime stack. This is almost certainly the reasons the runtime stack is named as it is.
The question is, is there or has there ever been a 1:1 correspondence between some aspect of the dynamic memory heap or how it is managed, and a heap data structure? If so, it would explain the name, but I'm a bit puzzled as to how a heap data structure would be of assistance in creating or managing the dynamic memory heap. If not, on the other hand, then does anybody know where the name "heap" came from, as it applies to the dynamic memory pool?
A.

Dynamic MailAdapter Receiver Agreement using S/Mime

Hi,
I need some help at an specific problem with the SAP XI Mail Adapter.
First a little scenario description:
In our business there are 10 Email addresses and we have 250 businesspartners.
We want to send Emails in a secure way (S/Mime), but we wouldnt configure hundreds of Receiver agreements to specify the exact Certificates which must be used to send an signed and encrypted Mail form A to B.
See
http://s5.directupload.net/file/d/1336/xgadwfu5_jpg.htm
Note:
Schlüsselspeicher = Keystore
Schlüsselspeichereintrag = Certificate-Alias
Signierte Mail-Zertifikate hinzufügen = Add Certifiacate to Mail.
Verschlüsselungsalgorithmus = encryption Algorithm
And now my Question :
Is there any possibility to dynamically set the Configuration settings marked in the picture with a red arrow ?

Any Ideas like an own Adapter, Adapter Modulte, Dynamic Configuration ?

Dynamic Algorithms ??

Similar Messages

Maybe you are looking for