similar to: Machine Trust Accounts

I need to allow the company operator to decide whether to record a call. (Car dealership that needs to coach salespeople). They don't want to record every sales call, just for the purposes of coaching certain employees on an ad hoc basis. The situation is: a. Call comes in on PSTN PRI b. Call is routed to operator in dialplan c. Operator ascertains that its a sales call for a salesman in

What is the best way to make use of the new "scoping" operators and otherwise search the database using deep relationship chains Take for example that I want to query what items all customers have ever bought from one salesman salesman has-many customers customers have-many orders orders have many items Now I want to write an application which is for the use of only one salesman

Hi All Hoping someone can help me with the "transactions" object. I am struggling to get my data in. I know the answer is in the help somewhere I'm sure, I just cannot find it. Essentially, I have data in this format (though I can change it if it particularly unsuitable) Transaction_id, store , salesman, date_time , items 1 , waterfront, john ,

If I want to test for a salesman effect on average sale, I model it as "Sale ~ Salesman". But what if I want to test for a salesman effect on total sales? How do I model that? Given a significant salesman effect, how do I follow up with the equivalent of Tukey's HSD to determine who the (indistinguishly) top salesmen are? If I add another factor, say "region" to the

Hello! I am considering proposing my college's staff the usage of PXELinux, to replace the commercial alternative (Rembo). My question is, can PXE boot images be compressed? If so, how? Because a Windows 2000 boot image is already big, but with no compression... it kinda makes it unusable. Thank you for your time and attention! Best regards, sardaukar_siet ===== Uproot your questions

Ady, This sounds interesting. I know PXE and related DHCP options somewhat well. But I don't recognize this. Typically, you add PXE-related options to your DHCP server. Either your main DHCP server, or a proxy DHCP server you stand up. To a lesser extent, some smarter TFTP servers (like Tivoli or Rembo) can parse vendor-encapsulated options. They take different actions according to the

I'd like request a feature... A "check valid" (or something like that) keyword for the smb.conf file. This would validate the share as pointing to a existing directory. If the directory is valid, the share appears in the user's browse list. Otherwise, the share doesn't appear. This is useful for shares that are generated by variable substition. For example,

Hola, Ya tenéis disponible el material que se presentó en la última reunión del "Grupo de Usuarios de R de Madrid". - - Carlos Ortega <http://www.qualityexcellence.es/> / Francisco Mauro: "'Unos cuantos modelos dinámicos y caóticos (con shiny)''". Se expondrán varios sistemas dinámicos y muy conocidos en la literatura utilizando la

Dear All, I need some witty computer related proverbs or one liners that some of have used in the past as footers for your emails for example. I particularly remember a PERL based transliteration joke/footer that when run in PERL produces a witty output.... This is to fix a problem internally created by an over zealous salesman at my company pinning up A4 sheets with bullSh*t sales proverbs

Hi, folks. I need some new replacement batteries for rack-mount APC UPSes. My old vender... well, the salesman I dealt with for several years left about a year and a half ago, and last year's purchase was a disaster (wrong batteries, wrong batteries, months to get the shipping to return the wrong batteries...), so I'm looking for a new, reliable vendor who does US government contract

On Mon, Oct 6, 2014 at 3:17 PM, Spike White <spikewhitetx at gmail.com> wrote: > Ady, > > This sounds interesting. I know PXE and related DHCP options > somewhat well. But I don't recognize this. > > Typically, you add PXE-related options to your DHCP server. > Either your main DHCP server, or a proxy DHCP server you stand up. > > To a lesser extent, some

Hi All, I am new to R and want to use R to solve search problems (like Traveling salesman problem, finding nearest neighbor, hill climbing). Is this possible in R? To start with I want as follows. Find five float numbers whose sum is is equal to their product which should be 8000. x + y + z + p + r = 8000 x * y * z * p * r = 8000 Regards, Ambikesh Jayal. School of IS, Computing & Maths,

I'm preparing some code to compute the optimal geometry of stressed solids. The core of the calculations is the optimization of elastic energy using the simulated annealing method implemented in the R optim() rutine. I've defined a function to compute this "energy" scalar (the fn parameter for optim) and prepared a list with the arrays defining the geometry and the elastic

Hi all I am trying to solve a combinatorial optimization problem. Basically, I can reduce my problem into the next problem: 1.- Given a NxN grid of points, with some values in each cell 2.- Find the combination of K points on the grid such that, the maximum mean value is obtained I took the Travel SalesMan problem example in ?optim documentation. I am not sure if I have understood correctly

Hi all, I''m just about ready to release kermit, which will be 0.22.1. I''m just going through and making sure all of the tests still pass. I''d much appreciate any tests people can do for me. -- The salesman asked me what size I wore, I told him extra-medium. -- Stephen Wright

Our final year students rank 5 classes (1st, 2nd, ..., 5th), and are allocated 3, based on their choices and a minimum class size. We want to maximise satisfaction (students getting their higher preferences), but have a minimum viable class size. Is there an algorithm out there to help, in R (like TSP for the travelling salesman prob) or elsewhere, or must I just iterate and locate the highest

On 16.06.2016 20:09, Gordon Messmer wrote: > On 06/16/2016 10:53 AM, Walter H. wrote: >> lets encrypt only trusts for 3 months; would you really except in an >> onlineshop, someone trusts this shop? >> let us think something like this: "when the CA only trusts for 3 >> months, how should I trust for a longer period >> which is important for warranty

On 06/16/2016 11:50 AM, Walter H. wrote: > technically there is more: not the user needs to check the dates a SSL > certificate is valid; > > just compare it with real life: which salesman would you trust more - > the one that gets a new car every few years, which has the same > advertisings on it and maybe has the same color, or the other one that > gets nearly every

Any comments? > http://slashdot.org/article.pl?sid=01/07/13/1558239&mode=nocomment > > Lossy Music Formats Compared > Posted by michael on Friday July 13, @12:45PM > from the is-it-real-or-mp3 dept. > > Nicholas writes: "Today's Washington Post has an article detailing > the results of having a "a diverse panel of listeners: two members > of the

I tried optim using the SANN algoithm. To start things out I tried the example of solving the "traveling salesman" problem as given in the documentation. The example works just fine. But if I comment out the line: set.seed(123) # chosen to get a good soln relatively quickly More often than not it doesn't converge to the optimum solution as shown in the example. Alos with trace on