Bill of Hayman Levy to K. K. S. I.

Digital image

Promissory note of Joshua Mendes to K. K. S. I.

Digital image

Letter from Gershom Seixas to K. K. S. I. regarding his house

Digital image

Letter to K.K.S.I. from Gershom Seixas regarding his contract

Digital image

Contract between K. K. S. I. and Gershom Seixas regarding school

Digital image

Letter announcing election of Aaron Levy as trustee of K. K. S. I.

Digital image

The elastic constants of isomorphous sodium bromate and sodium chlorate from 77 to 350 K

The elastic constants of NaBrO3 and NaClO3 are evaluated from ultrasonic velocity measurements using pulse superposition techniques. The values of C11, C12 and C44 for NaBrO3 at 298°K are 5.578, 1.705, 1.510 (x 1010 N/m2) and for NaClO3 the values are 4.897, 1.389, 1.174. The values at 77°K are respectively 6.35, 1.98 and 1.65 for NaBrO3 and 6.15, 2.16 and 1.32 for NaClO3.

Eksplikat︠s︡ii︠a︡ k 34 i 35 zemelʻnykh uchastkov Belozerskogo fonda i 37 uchastku Leninskogo fonda

Digital image

Location of concentrators in a computer communication network: a stochastic automation search method

The following problem is considered. Given the locations of the Central Processing Unit (ar;the terminals which have to communicate with it, to determine the number and locations of the concentrators and to assign the terminals to the concentrators in such a way that the total cost is minimized. There is alao a fixed cost associated with each concentrator. There is ail upper limit to the number of terminals which can be connected to a concentrator. The terminals can be connected directly to the CPU also In this paper it is assumed that the concentrators can bo located anywhere in the area A containing the CPU and the terminals. Then this becomes a multimodal optimization problem. In the proposed algorithm a stochastic automaton is used as a search device to locate the minimum of the multimodal cost function . The proposed algorithm involves the following. The area A containing the CPU and the terminals is divided into an arbitrary number of regions (say K). An approximate value for the number of concentrators is assumed (say m). The optimum number is determined by iteration later The m concentrators can be assigned to the K regions in (mk) ways (m > K) or (km) ways (K>m).(All possible assignments are feasible, i.e. a region can contain 0,1,…, to concentrators). Each possible assignment is assumed to represent a state of the stochastic variable structure automaton. To start with, all the states are assigned equal probabilities. At each stage of the search the automaton visits a state according to the current probability distribution. At each visit the automaton selects a 'point' inside that state with uniform probability. The cost associated with that point is calculated and the average cost of that state is updated. Then the probabilities of all the states are updated. The probabilities are taken to bo inversely proportional to the average cost of the states After a certain number of searches the search probabilities become stationary and the automaton visits a particular state again and again. Then the automaton is said to have converged to that state Then by conducting a local gradient search within that state the exact locations of the concentrators are determined This algorithm was applied to a set of test problems and the results were compared with those given by Cooper's (1964, 1967) EAC algorithm and on the average it was found that the proposed algorithm performs better.

Permit to K. K. S. I. from city to move remains from Oliver Street to 21st Street

Digital image

Request of Simeon Levy to K. K. S. I. for matzoth

Digital image

Letter of Gershom Seixas regarding services to K. K. S. I.

Digital image

Letter from Manuel Josephson to K.K.S.I. regarding joint letter to George Washington

Digital image

Letter to Governor Clinton from K. K. S. I.

Digital image

Copy of letter of K. K. S. I. to London regarding selection of a hazan

Digital image