Abstract: A two-party approximation protocol is transformed into a private approximation protocol. A first input x?{0, 1, . . . , M}n and a second input y?{0, 1, . . . , M}n of a two party approximation protocol approximating a function of a form ƒ(x, y)=?j=1ng (xj, yj) is received. Variable B is set as a public upper bound on ƒ(x, y). Variable l is set l=O*(1). The following is performed until ? j = 1 l ? z j ? l t or B<1, where t is an arbitrary number: (1) a private importance sampling protocol with the first input x, the second input y, and a third input 1k, is executed independently for j?[l], where k is a security parameter, an output of the private importance sampling protocol is shares of Ij?[n]?{?}; (2) l coin tosses z1, . . . , zl are independently generated where zj=1 iff Ij??; and (3) B is divided by 2 if ? j = 1 l ? z j ? l t or B<1 is not satisfied.

Abstract: A two-party approximation protocol is transformed into a private approximation protocol. A first input x?{0, 1, . . . , M}n and a second input y?{0, 1, . . . , M}n of a two party approximation protocol approximating a function of a form ƒ(x, y)=?j=1ng(xj, yj) is received. Variable B is set as a public upper bound on ƒ(x, y). Variable l is set l=O*(1). The following is performed until ? j = 1 l ? z j ? l t or B<1, where t is an arbitrary number: (1) a private importance sampling protocol with the first input x, the second input y, and a third input 1k, is executed independently for j?[l], where k is a security parameter, an output of the private importance sampling protocol is shares of Ij?[n]?{?}; (2) l coin tosses z1, . . . , zl are independently generated where zj=1 iff Ij??; and (3) B is divided by 2 if ? j = 1 l ? z j ? l t or B<1 is not satisfied.

Abstract: A two-party approximation protocol is transformed into a private approximation protocol. A first input x?{0,1, . . . , M}n and a second input y?{0,1, . . . , M}n of a two party approximation protocol approximating a function of a form ƒ(x, y)=?j=1ng (xj, yj) is received. Variable B is set as a public upper bound on ƒ(x, y). Variable l is set l=O*(1). The following is performed until ? j = 1 l ? z j ? l t or B<1, where t is an arbitrary number: (1) a private importance sampling protocol with the first input x, the second input y, and a third input lk, is executed independently for j?[l], where k is a security parameter, an output of the private importance sampling protocol is shares of Ij?[n]?{?}; (2) l coin tosses z1, . . . , z,l are independently generated where zj=1 iff Ij??; and (3) B is divided by 2 if ? j = 1 l ? z j ? l t or B<1 is not satisfied.

Abstract: A method and system for monitoring network traffic by estimating an L1 difference. Sketches in the form (x, ft(x)) are received from first and second network devices, where x indicates a source-destination pair, and ft(x) indicates an amount of information transmitted via the network device from the source to the destination in a time period t. An L1 difference between ft(x) values is estimated by determining an L0 value of a data stream resulting from the first network device inserting elements of a first set of distinct items as insertions into the data stream and from the second network device inserting elements of a second set as deletions from the data stream. Determining the L0 value includes processing updates to ranges of the data stream. Based on the L1 difference, a pattern of the network traffic is determined.

Abstract: A two-party approximation protocol is transformed into a private approximation protocol. A first input x?{0, 1, . . . , M}n and a second input y?{0, 1, . . . , M}n of a two party approximation protocol approximating a function of a form f(x, y)=?j=1ng(xj, yj) is received. Variable B is set as a public upper bound on f(x, y). Variable l is set l=O*(1). The following is performed until ? j = 1 l ? z j ? l t or B<1, where t is an arbitrary number: (1) a private importance sampling protocol with the first input x, the second input y, and a third input 1k, is executed independently for j?[l], where k is a security parameter, an output of the private importance sampling protocol is shares of Ij?[n]?{?}; (2) l coin tosses z1, . . . , zl are independently generated where zj=1 iff Ij??; and (3) B is divided by 2 if ? j = 1 l ? z j ? l t or B<1 is not satisfied.

Abstract: A method and system for monitoring network traffic by estimating an L1 difference. Sketches in the form (x, ft(x)) are received from first and second network devices, where x indicates a source-destination pair, and ft(x) indicates an amount of information transmitted via the network device from the source to the destination in a time period t. An L1 difference between ft(x) values is estimated by determining an L0 value of a data stream resulting from the first network device inserting elements of a first set of distinct items as insertions into the data stream and from the second network device inserting elements of a second set as deletions from the data stream. Determining the L0 value includes processing updates to ranges of the data stream. Based on the L1 difference, a pattern of the network traffic is determined.

Abstract: The invention includes a paved surface configured for reducing tire noise and increasing tire traction on the paved surface and to a method and apparatus for manufacturing such a paved surface. The paved surface includes grooves in the traffic bearing surface that are substantially neither transverse nor parallel to the intended direction of traffic.

Abstract: A method and apparatus for a node to automatically switch between half-duplex and full-duplex transmission in CSMA/CD networks characterized by a first and second device coupled over a communication link to allow communication of information and control signals between the first and second device. Each of the two devices include a transmit circuit and a receive circuit, wherein the first device begins to transmit information on a first communication circuit, the first communication circuit providing for communication of information between the first device and the second device, and the second device receives the transmitted information.

Abstract: A multi-segment agent topology mechanism for use by multi-segment network devices in an Ethernet network. Topology information packets exchanged between topology agents in a network include segment identifier information as well as IP address of the sending agent. A device's topology agent maintains and updates topology information in topology tables which identifies interconnected network devices, such as concentrators and bridges, by IP address and segment identifier information as well as incoming slot and port information for eventual use by a network management system in evaluating a networks topology map, and in automatically determining changes in the network's topology.

Abstract: A concentrator having a single medium access controller for monitoring a plurality of communication lines is provided. Each of the communication lines corresponds to a network and carries identification signals periodically transmitted by devices on the corresponding network. The medium access controller includes a transmit unit and a receive unit. The transmit unit sequentially broadcasts concentrator identification signals over each of the communication lines. The transmit unit sequences through the communication lines at a rate to insure that a concentrator identification signal is sent over each communication line during a predetermined transmit interval. The receive unit sequentially monitors the signals on each of the communication lines. The receive unit monitors the signals on any given communication line for a predetermined monitoring period before sequencing to the next communication line.