Request for the 'DOS' function call in Mathscript

To whom it may concern,
It sure would be nice to someday have the 'DOS' function call added to MathScript.
MathScript is really coming along. It now has some of my favorite functions like 'griddata', but I still need to the occasional 'DOS'.
It sure is nice that it handles 'complex' number data types!
Craig

Hello Craig,
Thank you for the feedback. We are aware of the lack of such a command. It will likely be added in a future version of LabVIEW.
Grant M.
Staff Software Engineer | LabVIEW Math & Signal Processing | National Instruments

Similar Messages

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 ] Then swap = part to middle at the end
[ =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 ]
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 ]
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 Muqaddas

Thanks 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.

Error: Request for the permission of type 'System.Data.SqlClient.SqlClientPermission, System.Data, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089' failed

SharePoint 2010 -
I have created a console utility that further calls the stsadm.exe to Export sites from one site collection in a DB to another site collection in another DB of the same web application.
Export works fine. But during Import, I get the following errors
[ListItem] [Admin] Progress: Importing
[ListItem] [Admin] Verbose: List URL: /pwa1/GTR/7 GTR Programme
[ListItem] [Hol plans.xls] Progress: Importing
[ListItem] [Hol plans.xls] Verbose: List URL: /pwa1/GTR/7 GTR Programme
[ListItem] [Time.doc] Progress: Importing
[ListItem] [Time.doc] Verbose: List URL: /pwa1/GTR/7 GTR Programme
[ListItem] [AP Docs] Progress: Importing
[ListItem] [AP Docs] Verbose: List URL: /pwa1/GTR/7 GTR Programme
[ListItem] [Update - June 27th.pdf] Progress: Importing
[ListItem] [Update - June 27th.pdf] Verbose: List URL: /pwa1/GTR/7 GTR Programme
[ListItem] [Update - June 27th.pdf] Error: Request for the permission of type 'System.Data.SqlClient.SqlClientPermission, System.Data, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089' failed.
[ListItem] [Update - June 27th.pdf] Error: Request for the permission of type 'System.Data.SqlClient.SqlClientPermission, System.Data, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089' failed.
[ListItem] [Update - June 27th.pdf] Error: Request for the permission of type 'System.Data.SqlClient.SqlClientPermission, System.Data, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089' failed.
FatalError: Request for the permission of type 'System.Data.SqlClient.SqlClientPermission, System.Data, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089' failed.
Progress: Import did not complete.
1. Does the console application treated as a Sandbox Solution?
2. Do I need to configure CAS policy in wss_usercode.config? and what?
3. What else could be configured to make this work?
I have tried adding the following in wss_custom_minimaltrust.config but no avail.
<SecurityClass Name="SqlClientPermission" Description="System.Data.SqlClient.SqlClientPermission, System.Data, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089"/>
and
<PermissionSet
 class="NamedPermissionSet"
 version="1"
 Name="SPRestricted">
<IPermission
 class="SqlClientPermission"
 version="1"
 Unrestricted="true"
 />

</PermissionSet>
UPDATE: It has been observed that the issue is intermittent. That is, sometimes the import works fine (event without any configuration of SqlClientPermission in any config file) but sometimes it gives the above error. I'm stuck!
Regards, Amit Gupta

Hi,
According to your post, my understanding is that you get Error “Request for the permission of type 'System.Data.SqlClient.SqlClientPermission, System.Data, Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089' failed
Simple solution is to change the trust the trust level to FULL: <trust level="[Full]" originUrl="URL" />
In addition, you can modify the wss_mediumtrust.config and wss_minimaltrust.config file under the path “C:\Program Files\Common Files\Microsoft Shared\Web Server Extensions\14\CONFIG”.
For more information, you can refer to:
http://blogs.msdn.com/b/navdeepm/archive/2010/02/19/system-security-securityexception-request-for-the-permission-of-type-system-data-sqlclient-sqlclientpermission-system-data-version-2-0-0-0-culture-neutral-publickeytoken-b77a5c561934e089-failed.aspx
http://www.fewlines4biju.com/2011/01/request-for-permission-of-type_18.html
http://techsolutions-at-desk.blogspot.com/2011/08/request-for-permission-of-type.html
Thanks,
Linda Li
Forum Support
Please remember to mark the replies as answers if they help and unmark them if they provide no help. If you have feedback for TechNet Subscriber Support, contact
[email protected]
Linda Li
TechNet Community Support

Good morning a few weeks ago I send the request for the replacement program of my ipod nano 1st generation and they sent me the shipping box but I did not get the label to go back, and I can not return it , i need to you sent me again the box for retu

Good morning a few weeks ago I send the request for the replacement program of my ipod nano 1st generation and they sent me the shipping box but I did not get the label to go back, and I can not return it , i need to you sent me again the box for return the ipod

Best thing would be to call Apple up again, and let them what has happened and they'll help you!

CATCHABLE EXCEPTIONS in the remote function call (RFC)

Please tell me what are the CATCHABLE EXCEPTIONS in the remote function call (RFC) and to which exception class do they belong????
Thanks in advance.
Dinesh Dhiman

HI,
With external function calls, the EXCEPTIONS addition of the CALL FUNCTION command can be used to assign return values to the exceptions defined in the interface of the called function module. Class-based exceptions cannot be propagated to the caller from a remotely-called function module, and have the effect of an exception that cannot be handled.
As well as the exceptions defined in the interface of the called function module, an external function call can also have the following predefined exceptions:
The SYSTEM_FAILURE exception is the response to a runtime error that occurs when the remotely-called function module is executed.
The COMMUNICATION_FAILURE exception occurs when the connection to the partner system cannot be established or if the connection is lost during communication.
Note
We strongly recommend that you assign a return value to both these exceptions for every RFC, and that you handle this return value, as otherwise a runtime error will occur in the exception situations in question.
Regards,
Sesh

HT201407 Dear Apple support! My name is Duy Lam. Recently, one of my best friend just upgrade his phone so he gave me his old iphone 4s, white. The phone was ok, but the problem is when I upgraded it to IOS 7.0.4 it activated lock. it request for the ap

Dear Apple support!
My name is Duy Lam. Recently, one of my best friend just upgrade his phone so he gave me his old iphone 4s, white. The phone was ok, but the problem is when I upgraded it to IOS 7.0.4 it activated lock. it request for the apple id ; I had call my friend to ask about that but it's been a long time he couldn't remember the original ID that he had used. so now, could you be able to unlock the phone that i can continues to use this phone. Thank you so much, and I appreciate you all
<Personal Information Edited by Host>

All Apple support contact information is on the web site - http://www.apple.com/contact/
If your friend needs to recover his AppleID used for that iCloud account, then follow the directions here:
http://support.apple.com/kb/HT5787

Where the documentation is provided for the Standard Function module ?

If there is no documentation provided for the standard function module in SE37 what is the best way to understand the functionality of the function module?Is there any where we can find the documentation?
Please dont say the From coding part its too vast to understand
Ex: HRCM_ORGSTRC_INFO_TABLE_GET
Paint for me ..
Regards
sas
Edited by: Julius Bussche on Mar 18, 2009 1:17 PM

O Really thanks amit !!
Are you able to understand the below code and please provide your valuable inputs what we are understanding is the same.
PERFORM read_infotypes.
*-- ********************************************************** NMP
*-- IF scb frozen then write to itab-scb field. nmp 11/2001.
*-- ********************************************************** NMP
*--Begin of Change by vneld - 01/17/2007
* IF PA0001-ZZBERN NE SPACE.
* FROZEN = PA0001-ZZBERN.
* ENDIF.
* ITAB-SCB = FROZEN.
*-- ********************************************************** NMP
*--end of Change by vneld- 01/17/2007
PERFORM get_date USING '92'
 CHANGING w_hiredate.
PERFORM get_date USING '93'
 CHANGING w_rehire.
PERFORM get_date USING '94'
 CHANGING w_termdate.
IF NOT ( w_rehire IS INITIAL ).
 w_hiredate = w_rehire.
 itab-code = 'R'.
ELSE.
 itab-code = 'H'.
ENDIF.
IF p0001-persg = '3'.
 itab-code = 'T'.
ENDIF.
*Change by Mdukes
** We need HIRE,Rehire & term within 13 month`s window
** But if someone Hire in IT ,change dept and then terminated .
** We need to exclude that person from the list .
** We need to change his Org.Unit by END_DATE 12/31/9999 from Pa0001.
CLEAR:result_tab.REFRESH:result_tab.
CALL FUNCTION 'HRCM_ORGSTRC_INFO_TABLE_GET'
 EXPORTING
 PLVAR = '01'
 ROOT_OTYPE = 'O'
 ROOT_OBJID = P0001-ORGEH
 BEGDA = SY-DATUM
 ENDDA = P0001-ENDDA
 PATH_ID = EVPATH
 PATH_DEPTH = 10
 TABLES
 ORG_INFO_TABLE = result_tab
 EXCEPTIONS
 PATH_ERROR = 1
 ROOT_ERROR = 2
 OTHERS = 3.
* CALL FUNCTION 'RH_STRUC_GET'
* EXPORTING = 'O'
* act_objid = PA0001-ORGEH
* act_wegid = EVPATH
* act_plvar = TYPE
* act_tflag = space
* act_vflag = space
* authority_check = space
* TABLES
* result_tab = result_tab
* EXCEPTIONS
* no_plvar_found = 1
* no_entry_found = 2
* OTHERS = 3.
* reading the Org.Unit based on employee Org.unit (Evaluation Path 'O-O'.
* After that making sure the latest Pa0001 org.unit is part of selection org.unit
* If yes, set the flag to = 1 . Otherwise ignore the rec .
* We want only IT folks hire/rehire/term within 13 monthu2019s window
* if somebody change the dept and get term within 13 monthu2019s .it
* Should show up in hire but not in term report .
CLEAR:REC.
lOOP AT result_tab.
 read table PCHOBJID with key low = result_tab-OBJID.
 if sy-subrc = 0 .
 Rec = 1.
 EXIT.
 Endif.
ENDLOOP.
if rec = 1.
*--begin of change by vneld- 01/17/07
 CHECK ( ( w_hiredate >= w_13th_mnth_date AND w_hiredate <= sy-datum )
 OR
 ( w_termdate >= w_13th_mnth_date AND w_termdate <= sy-datum ) ).
*--end of change by vneld- 01/17/07
**---check for hires or terms in the calendar year.
**---No future terms
* CHECK ( ( W_HIREDATE(4) = SY-DATUM(4) ) OR
* ( W_TERMDATE(4) = SY-DATUM(4) AND W_TERMDATE <= SY-DATUM ) ).
 CONCATENATE p0002-vorna p0002-nachn INTO itab-name SEPARATED BY ' '.
*--Begin of change by vneld 03/29/2007
*--get supervisor name
 data : lname(20),
 fname(20).
 clear: lname,
 fname.
 Select vorna nachn from pa0002 into (fname ,lname)
 where pernr = p0001-zzsuper_no.
 endselect.
 CONCATENATE lname fname INTO itab-supv SEPARATED BY ' '.
* itab-supv = p0001-zzsuper_text.
*--End of change by vneld 03/29/2007
*----get employee group text
 CLEAR t501t.
 SELECT SINGLE * FROM t501t WHERE sprsl = 'EN' AND
 persg = p0001-persg.
 IF sy-subrc EQ 0.
 itab-group = t501t-ptext.
 ENDIF.
 PERFORM get_dept.
 PERFORM get_position.
 PERFORM append_fields.
endif.
ENDFORM. " PROCESS_EMPLOYEE
Edited by: saslove sap on Mar 19, 2009 7:45 AM

The save for the web function has stopped working in my copy of photoshop elements 12. I get this message, " The operation could not be completed. The system cannot find the path specified" Resetting preferences did not fix.

The save for the web function has stopped working in my copy of photoshop elements 12. I get this message, “ The operation could not be completed. The system cannot find the path specified” Resetting preferences did not fix.

my os is windows 7. elements 12 worked fine for many months then save for the web stopped working

Request for the creation of a new Unemployment account for tax

Hi Guys,
This is a question with regard to US tax. We have received a request for the creation of a new Unemployment account for the payment of taxes. This is because the account assignment number has changed for a particular company code in Tennassee state. Please let me know where this change could be made in SAP.
Thanks,
Subbaiah

Subbaiah,
Table T5UTL is used for New Tax Company Codes. If this is a new legal entity, youu2019ll need to set up the Tax Company here. Youu2019ll also need to assign at least one Personnel Area to this new Tax Company. This must be established in order to update the next table shown below, but only if itu2019s a new legal entity. The user will know.
Table T5UTH is for establishing the account number to be used in BSI. It must be established in order to update the next table shown below.
Table T5UTI is for assigning account numbers by Tax Company Code. Youu2019ll need one for Tax Authority TN, Tax Type 10. The user will need to supply this information to you.
Table BTXRATE will need to be updated with the Tax Company Code, year, and the State Unemployment Insurance rate & taxable wage amount.
Once this is done, youu2019ll need to update BSI.
If Tennessee is a new state, youu2019ll have work to do with the tax models.
Regards,
Howard

Creation of Trasport request for the Deletion of Infoset from Dev

Hi
i want to create a trasport request for the deletion of infosets from dev system and want to trasport request in to production.
i wish to know while right clicking the info set and selecting deletion will it prompt for trasport request.
could any one help me out for this issue.
Thanks
Sandy

Hi
I suggest you to transport the Infoarea under which the Infoset query is deleted
This will adjust all your changes including any deletion or any new changes
Assign points if useful
Thanks
N Ganesh

I am getting error code -9808 saying cannot complete request for the i store, i am getting error code -9808 saying cannot complete request for the i store

i am getting the erorr code -9808 saying that we cannot complete my request for the i store to setup my new device ...what up with that

Try here:
iTunes Store: "An unknown error occured (-9808)"

The precondition on the request for the URL / evaluated to false

Hi,
I get error message when connect on secure 443 port:
"The precondition on the request for the URL / evaluated to false."
Problem in:
<Location />
SetHandler weblogic-handler
WLExcludePathOrMimeType /DocumentServer
</Location>
It works in httpd.conf, but does NOT work in ssl.conf
We are using WL8.1 and Apache 2.0.48
Thanks,
Oleg.

Have you looked at the support pattern for SSL and Web Server plug-ins?
https://support.bea.com/application_content/product_portlets/support_patterns/wls/SSLAndPlug-inPattern.html

Request for the permission of type 'System.Data.SqlClient.SqlClientPermission, System.Data, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089' failed.

Hi Friends,
Request for the permission of type System.Data.SqlClient.SqlClientPermission System.Data Version 1.0.5000.0 Culture neutral .This error is recieving when ever i tried to use the sql connection (with Visual
studio C#) in sharepoint portal installed application.
Please help me if any answers for the issue.

Hi,
Open wss_mediumtrust.config & wss_minimaltrust.config. SharePoint 2013(C:\Program Files\Common Files\Microsoft Shared\Web Server Extensions\15\config\).
Find in wss_mediumtrust.config:
<SecurityClass
Name="SqlClientPermission"
Description="System.Data.SqlClient.SqlClientPermis sion, System.Data,
Version=2.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089"/>
Copy and paste it in to the <SecurityClasses> node of wss_minimaltrust.config.
In the PermissionSet section of this configuration file, add the following:
Find in wss_mediumtrust.config:
<IPermission class="SqlClientPermission" version="1" Unrestricted="true"/>
Copy and paste it in to the a <PermissionSet> node of wss_minimaltrust.config.
Here is a similar thread for your reference:
https://social.msdn.microsoft.com/Forums/en-US/a1c8f2bf-2575-40b4-87f1-4f98462b3234/request-for-the-permission-of-type-systemdatasqlclientsqlclientpermission-systemdata-version?forum=tfssetup
Best Regards
Dennis Guo
TechNet Community Support

I have trouble seeing the small icons for the program functions in this tutorial.

Hello,
I have my assets from an older site, and want to start a site desktop site in muse. Is there a program ( maybe a book ) that can walk me through this step by step, instead of the Katie's Cafe demo / tutorial?
The problem with the tutorial is in the dark interface I have trouble seeing the small icons for the program functions.
I really need to setup a new site as soon as possible, but am not getting there right now.
Thanks.
Patricia Goff

You can download the pdf from here :
https://helpx.adobe.com/pdf/muse_reference.pdf
Thanks,
Sanjit

HT1212 I found an iphone over one year ago. Its locked with a passcode. I kept waiting for the owner to call it. They never did. I went to ATT store today, they put a new sim card in it. but now itunes needs the passcode to reset it to factory settings.

I found an iphone over one year ago. Its locked with a passcode. I kept waiting for the owner to call it. They never did. I went to an AT&T store today, they put a new sim card in it. and told me to go home, log on to itunes, and restore the phone to "factory settings".But itunes says the phone is locked and it needs the passcode to reset it to factory settings.
Any workaround? Or, am I doing something wrong here?
Thanks so much.
Joe

Sounds like you may be the owner of a new phone! If you don't need or want it and no one claims it you probably can sell it. Check eBay to see what the going rate is.
You are to be commended for at least trying to find the owner. Many wouldn't.
Best.
GDG

Request for the 'DOS' function call in Mathscript

Similar Messages

Maybe you are looking for