<![CDATA[Programmer's Town - Algorithms]]>
http://www.progtown.com/
Mon, 05 Mar 2018 08:59:00 +0000PunBB<![CDATA[Re: accordion Extension]]>
http://www.progtown.com/topic2086278-re-accordion-extension.html
Hello, Kodt, you wrote: It is given: a dial-up of integer values X [] - width of some segments. And target value D - width of a total segment on which we project them so in the total they occupy it all - acquiring values W [] (D). Naturally, there are rounding off problems. It is necessary to make it as much as possible beautifully, that is, to observe a row of conditions: Same 1) the Monotonicity: at the monotonous magnification of the total each item too monotonically grow. Certainly, will tell more precisely - do not decrease, because at a total increment on 1 it is clear that this will be given only to any one item.> the bad method W [i] = floor (D*X [i]/sum (X)) already therefore disappears - everything, except last, we give proportional values, approximating downwards> W [last] = D-sum (W [0. last)) - last we give all remained because it rakes up residual in a range (0. . n-1) where n - the amount of elements and as a result skips Besides, is the classical approach: you consider separately value how many it is necessary to select (D*X [i]/sum (X)) and how many it is actually selected. You take a difference (it can be both positive, and negative) memberwise and you call it a deficit. And it is necessary to add always to that element, at which a deficit the greatest. It gives observance both this requirement, and remaining. Well that is from this it is already possible to receive naive implementation. For example, you decompose D = sum (X) * Q + R. The first part sum (X) *Q you arrange directly (there there will be no rounding-off errors). And residual from R you arrange the above-stated method through a deficit (it is a maximum one sorting of elements according to a deficit after initiating allocation).]]>Mon, 05 Mar 2018 08:59:00 +0000http://www.progtown.com/topic2086278-re-accordion-extension.html<![CDATA[Such here a problem]]>
http://www.progtown.com/topic2086279-such-here-a-problem.html
Tue, 27 Feb 2018 11:46:00 +0000http://www.progtown.com/topic2086279-such-here-a-problem.html<![CDATA[To learn at last the regular expressions]]>
http://www.progtown.com/topic2083929-to-learn-at-last-the-regular-expressions.html
I welcome. Already it is a lot of years when it is necessary to use the regular expressions I do it "with the dictionary": I search for something similar by means of Google a file. And it would be desirable, to pass to the full understanding and possession of a question. Whether prompt what to esteem / to train for purpose achievement. Thanks.]]>Fri, 16 Feb 2018 03:35:00 +0000http://www.progtown.com/topic2083929-to-learn-at-last-the-regular-expressions.html<![CDATA[RSA 640. Factorization time]]>
http://www.progtown.com/topic2083930-rsa-640-factorization-time.html
Kind time of days. Prompt please how to estimate what is the time it is required on factorization of number RSA-640? I found results for 2005... And now as affairs are?]]>Thu, 15 Feb 2018 09:43:00 +0000http://www.progtown.com/topic2083930-rsa-640-factorization-time.html<![CDATA[Teach, please (on C#) to build on generalized]]>
http://www.progtown.com/topic2083931-teach-please-on-c-to-build-on-generalized.html
I already created a subject the Author: Arsen. Shnurkov Date: 06.01 11:19 it, but it is entirely cunning in and did not return. Well or at least tell, how it is written "Janusz Brzozowski" in Russian (Russian letters).]]>Thu, 15 Feb 2018 07:34:00 +0000http://www.progtown.com/topic2083931-teach-please-on-c-to-build-on-generalized.html<![CDATA[Algorithm to find the maximum quantity of players that concerned a ball]]>
http://www.progtown.com/topic2083932-algorithm-to-find-the-maximum-quantity-of-players-that-concerned-a-ball.html
Greetings! Help cotton velvet with idea for the following task: there is a group of players. If two players see each other they can pass a ball each other. How to find the maximum quantity of players which can concern a ball. Each player can concern a ball an unlimited number of times. For each player it is given whom it sees. What structure to use for players. Thanks for ideas]]>Fri, 09 Feb 2018 08:10:00 +0000http://www.progtown.com/topic2083932-algorithm-to-find-the-maximum-quantity-of-players-that-concerned-a-ball.html<![CDATA[Adaptation of model to the new data.]]>
http://www.progtown.com/topic2083933-adaptation-of-model-to-the-new-data.html
Rather popular question in about - "and how to modify a network so that she would recognize the data from other allocation, on which it not .". Met interesting (theoretical) operation on this subject which would like to share. Domain adaptation]]>Mon, 29 Jan 2018 07:00:00 +0000http://www.progtown.com/topic2083933-adaptation-of-model-to-the-new-data.html<![CDATA[Amount of parameters vs the size]]>
http://www.progtown.com/topic2083934-amount-of-parameters-vs-the-size.html
Good afternoon. Whether who met an empirical estimation of an amount of parameters of a neural network depending on the size ? Clearly that here all is conditional. But who can share own observations.]]>Sat, 27 Jan 2018 16:32:00 +0000http://www.progtown.com/topic2083934-amount-of-parameters-vs-the-size.html<![CDATA[To pick up allocation]]>
http://www.progtown.com/topic2083935-to-pick-up-allocation.html
Allocation which main numbers is necessary throws out in a range 1-5 and further with attenuation up to 300 those the picture is similar to logarithmically normal allocation but a problem logarithmically normal that it too quickly fades - on 10 million results was not number more than 50 was played here: http://statisticsblog.com/probability-d … #lognormal in an ideal probably it would be desirable discrete - the given probabilities of ranges in which there will be a given allocation]]>Wed, 24 Jan 2018 18:39:00 +0000http://www.progtown.com/topic2083935-to-pick-up-allocation.html<![CDATA[and preparation of sampling for training]]>
http://www.progtown.com/topic2082331-and-preparation-of-sampling-for-training.html
Good afternoon, training for recognition of hand-written digits needs many pictures of each digit. If I want, that the digit was recognized turned on 90 degrees appropriate pictures are necessary at training. An operation principle if I correctly understand such that in network layers the coefficients, tutorings satisfying to sampling steal up. I.e. as though descent? Only it is not clear as to be, if it is necessary to learn to recognize digit on the big pictures where the digit can be at any angle and with any geometrical distortions (within recognition ). It is necessary for digit training under each corner to submit? And how if for one digit at training we submit tens , and it is necessary to search for inputs in the big picture on thousand ? I Am sorry, if a question silly.]]>Sun, 14 Jan 2018 11:55:00 +0000http://www.progtown.com/topic2082331-and-preparation-of-sampling-for-training.html<![CDATA[Manufacture optimization]]>
http://www.progtown.com/topic2082332-manufacture-optimization.html
There is a set of technological operations. Each operation has following attributes 1) D (n) - what is the time (in minutes) it is required on operation performance n 2) T (n) - date and time, to which operation n should be fulfilled 3) S (n) - date and starting time of performance of operation n. Date and ending time of performance of operation n: F (n) = S (n) + D (n). 4) With (n) - an integer number from 0 to 100, characterizing parameters of adjustment of the technology equipment, necessary for the fulfilled operation n Operations are fulfilled one for another that is as soon as one operation ended at once begins another. If one after another there are operations with identical value of a C it positively affects technology equipment (the less the equipment is required to recustomize, the it serves longer, the probability of an error there is less at realignment). On an input the following data is known: 1) the Amount of technological operations N 2) {D (1), D (2), ..., D (N)} 3) {T (1), T (2), ..., T (N)} 4) {a C (1), a C (2), ..., a C (N)} 5) B - date and time when should begin the first operation. It is required to calculate {S (1), S (2), ..., S (N)}, thus that (T (n) - F (n)) was minimum, and the amount of sequentially executable operations with the same value With was maximum. I will be glad to any helps to the task decision.]]>Thu, 11 Jan 2018 07:38:00 +0000http://www.progtown.com/topic2082332-manufacture-optimization.html<![CDATA[Probability that all nodes of a p2p-network will be notified]]>
http://www.progtown.com/topic2082334-probability-that-all-nodes-of-a-p2pnetwork-will-be-notified.html
Conditions: 1. There is a p2p-network, all nodes are equal. Well, type everyone yours. 2. There is an initial list of the nodes (IP address), which developers sew in the program. The part from them can be not accessible at the moment of program start (but were accessible at the moment of program writing). 3. Each node stores the local list of nodes to which broadcasts the information. Them n pieces. We name these nodes neighbors. 4. The node selects the neighbors in a random way: at first casual n working from the list [2], then it is transited under the local list [3] each of these nodes recursively. 5. Nodes accept the information from any interested person (not only from neighbors), write down in the basis. And accepting new - broadcast to all neighbors. All nodes are independent, fairly broadcast the information to the friend-friend. I.e. if one node transferred something to the neighbors (to nodes which holds in the local list), neighbors undertake to transfer already to the neighbors etc. Questions such: 1. What value n (neighbors) at which it is guaranteed all nodes will are connected with each other? That it did not turn out that you selected a certain casual node from the list, checked up its local list of nodes and casually it appeared that all these nodes are not connected to the main network, i.e. as though a subnet formed, broadcast to the friend-friend and the big network do not broadcast. The experimental method created some millions (naturally emulated, not the presents) and connected them in a random way. It appeared that presence casually selected 2 neighbors always connect a network in a single whole and for all time of experiments was a case that translation of one changed a state of all network. I hope, not too explained. Questions: 1. Whether there are any calculations minimum n which unites all in a network? 2. The same question provided that 50 % of nodes are and do not broadcast the information to the neighbors. I.e. You transferred to them and they with this do not do anything.]]>Tue, 09 Jan 2018 10:24:00 +0000http://www.progtown.com/topic2082334-probability-that-all-nodes-of-a-p2pnetwork-will-be-notified.html<![CDATA[Algorithm of an estimation of coincidence]]>
http://www.progtown.com/topic2082335-algorithm-of-an-estimation-of-coincidence.html
Greetings! There is a table in a DB in which, "words" are stored in eight columns, with some user. Each "word" has some "weight", the total of scales of all eight "words" makes 100. The task in implementing algorithm of an estimation of coincidence of "words" at different users, for . There are some thoughts, as well as there is a decision "" (wildly nonoptimal algorithmically)... As though you solved the task? the DB is far off. A variant with table loading in storage for the subsequent handling - the bad variant since it is a lot of records both the expenditure of storage and load time will be very great.]]>Tue, 09 Jan 2018 07:22:00 +0000http://www.progtown.com/topic2082335-algorithm-of-an-estimation-of-coincidence.html<![CDATA[Algorithm of an estimation of coincidence 2]]>
http://www.progtown.com/topic2082336-algorithm-of-an-estimation-of-coincidence-2.html
I welcome! Saw in this branch a subject "algorithm of an estimation of coincidence", I look, answer! Cool! I Will try to ask too! The task: 1) In an advertizing campaign there is a Conversion index. It in this case (number of orders) / (Number of shows of banners) = 0.1 or 10 % Advertising was shown N days. N - it is not known!! We tell in 1 day (either hour, or minute, or second and ) 100 shows and 10 orders, and can and 117 shows and 0 orders or 30 shows and 30 orders. Conversion of 10 % this averaging for all time of show of advertizing. The dispersion is not set and unknown and not . Access to the day statistics is not present. Only to total - all N shows, To - orders, To / N = 0.1 or 10 % however N not small, i.e. such that most likely in an average of 0.1 or 10 % allocation is close to normal, but it is not known. On statements of the problem it is not known, but only my assumptions (like reasonable!) 2) the Manager made certain changes to adjustments of advertizing which could affect conversion. 3) a question: to Find minimum 1 and N1 such, what with probability of X % we can define that Conversion on 1 % i.e. there were> =11 % 4) 2, N2 Y % - Conversion <= 9 % 5) 3, N3 Z % - Conversion did not change almost, i.e. 9 % <To <11 % test value X = Y = Z = 95 % still figure In statements of the problem a certain parameter Capacity [samplings?] 80 % the Dispersion is not known, but it did not change after advertizing campaign modification. About confidential intervals read, but did not understand as them to apply to the answer on 3) 4) 5) P.S. In the Internet a certain formula for calculation N - however its substantiation and an output is not present, so its value zero, the decision should be justified. Results in it turn out too big, the order of 10 thousand conversion and 100. Shows. Intuitively it should seems difference to be visible on the smaller statistics? And to depend on a dispersion or not?]]>Sat, 06 Jan 2018 05:40:00 +0000http://www.progtown.com/topic2082336-algorithm-of-an-estimation-of-coincidence-2.html<![CDATA[How to bend an ellipsoid]]>
http://www.progtown.com/topic2082333-how-to-bend-an-ellipsoid.html
There is an ellipsoid, want to take it for two semiaxes and to start them to bend (concerning center). What should be a surface? On the one hand it is possible to intersect two ellipsoids at an angle, but here the turned out figure and will be as a result intersection of two ellipsoids. And how to construct a figure so that it remained an ellipsoid (let and deformed)? Well that is the mathematical description of such figure is necessary even more likely. Here there is a canonical equation of an ellipsoid x 2/a 2+y 2/b 2+z 2/c 2=1 Here there is a formula for the surface description in a case if to start semiaxes to shift at an angle? What to esteem?]]>Fri, 29 Dec 2017 05:36:00 +0000http://www.progtown.com/topic2082333-how-to-bend-an-ellipsoid.html