scispace - formally typeset
Search or ask a question
Institution

University of Haifa

EducationHaifa, Israel
About: University of Haifa is a education organization based out in Haifa, Israel. It is known for research contribution in the topics: Population & Poison control. The organization has 7558 authors who have published 27141 publications receiving 711629 citations. The organization is also known as: Haifa University & Universiṭat Ḥefah.


Papers
More filters
Journal ArticleDOI
TL;DR: The development of an underwater gripper that utilizes soft robotics technology to delicately manipulate and sample fragile species on the deep reef is presented, making it the first use of soft robotics in the deep sea for the nondestructive sampling of benthic fauna.
Abstract: This article presents the development of an underwater gripper that utilizes soft robotics technology to delicately manipulate and sample fragile species on the deep reef. Existing solutions for deep sea robotic manipulation have historically been driven by the oil industry, resulting in destructive interactions with undersea life. Soft material robotics relies on compliant materials that are inherently impedance matched to natural environments and to soft or fragile organisms. We demonstrate design principles for soft robot end effectors, bench-top characterization of their grasping performance, and conclude by describing in situ testing at mesophotic depths. The result is the first use of soft robotics in the deep sea for the nondestructive sampling of benthic fauna.

580 citations

Journal ArticleDOI
TL;DR: A modified version of the algorithm that finds a solution of a variational inequality which is also a fixed point of a given nonexpansive mapping is proposed and weak convergence theorems for both algorithms are established.
Abstract: We present a subgradient extragradient method for solving variational inequalities in Hilbert space. In addition, we propose a modified version of our algorithm that finds a solution of a variational inequality which is also a fixed point of a given nonexpansive mapping. We establish weak convergence theorems for both algorithms.

579 citations

Journal ArticleDOI
01 Oct 1980-Genetics
TL;DR: The association of alleles among different loci was studied in natural populations of Hordeum spontaneum, the evolutionary progenitor of cultivated barley, and the variance of the number of heterozygous loci in two randomly chosen gametes affords a useful measure of such association.
Abstract: The association of alleles among different loci was studied in natural populations of Hordeum spontaneum, the evolutionary progenitor of cultivated barley. The variance of the number of heterozygous loci in two randomly chosen gametes affords a useful measure of such association. The behavior of this statistic in several particular models is described. Generally, linkage (gametic phase) disequilibrium tends to increase the variance above the value expected under complete independence. This increase is greatest when disequilibria are such as to maximize the sum of squares of the two-locus gametic frequencies.-When data on several loci per individual are available, the observed variance may be tested for its agreement with that expected under the hypothesis of complete interlocus independence, using the sampling theory of this model. When applied to allozyme data from 26 polymorphic populations of wild barley, this test demonstrated the presence of geographically widespread multilocus organization. On average, the variance was 80% higher than expected under random association. Gametic frequencies for four esterase loci in both of these populations of wild barley and two composite crosses of cultivated barley were analyzed. Most generations of the composites showed less multilocus structure, as measured by the indices of association, than the wild populations.

579 citations

Proceedings ArticleDOI
27 Oct 2008
TL;DR: This work presents FairplayMP, a system for secure multi-party computation that supplements the Fairplay system and modified the BMR protocol in a novel way and considerably improved its performance by using the Ben-Or-Goldwasser-Wigderson (BGW) protocol for the purpose of constructing gate tables.
Abstract: We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the great achievements of modern cryptography, enabling a set of untrusting parties to compute any function of their private inputs while revealing nothing but the result of the function. In a sense, FairplayMP lets the parties run a joint computation that emulates a trusted party which receives the inputs from the parties, computes the function, and privately informs the parties of their outputs. FairplayMP operates by receiving a high-level language description of a function and a configuration file describing the participating parties. The system compiles the function into a description as a Boolean circuit, and perform a distributed evaluation of the circuit while revealing nothing else. FairplayMP supplements the Fairplay system [16], which supported secure computation between two parties. The underlying protocol of FairplayMP is the Beaver-Micali-Rogaway (BMR) protocol which runs in a constant number of communication rounds (eight rounds in our implementation). We modified the BMR protocol in a novel way and considerably improved its performance by using the Ben-Or-Goldwasser-Wigderson (BGW) protocol for the purpose of constructing gate tables. We chose to use this protocol since we believe that the number of communication rounds is a major factor on the overall performance of the protocol. We conducted different experiments which measure the effect of different parameters on the performance of the system and demonstrate its scalability. (We can now tell, for example, that running a second-price auction between four bidders, using five computation players, takes about 8 seconds.)

578 citations

Book
Oz Shy1
01 Jan 2001
TL;DR: In this article, the authors introduce upper-level undergraduates, graduate students, and researchers to the latest developments in network economics, one of the fastest-growing fields in all industrial organization.
Abstract: This book introduces upper-level undergraduates, graduate students, and researchers to the latest developments in network economics, one of the fastest-growing fields in all industrial organization. Network industries include the Internet, e-mail, telephony, computer hardware and software, music and video players, and service operations in the banking, legal, and airlines industries among many others. The work offers an overview of the subject matter as well as investigations about specific industries. It conveys the essential features of how strategic interactions between firms are affected by network activity, as well as covering social interaction and its influence on consumers' choices of products and services. Virtually no calculus is used in the text, and each chapter ends with a series of exercises and selected references. The text may be used for both one- and two-semester courses.

577 citations


Authors

Showing all 7747 results

NameH-indexPapersCitations
Markku Laakso162945142292
M.-Marsel Mesulam15055890772
Michael Levin11198645667
Peter Schmidt10563861822
Eviatar Nevo9584840066
Uri Alon9144254822
Dan Roth8552328166
Simon G. Potts8224931557
Russell G. Foster7931823206
Leo Radom7960434075
Stevan E. Hobfoll7427135870
Larry Davidson6945920177
Alan R. Templeton6724928320
Uri Gneezy6521129671
Benny Pinkas6415621122
Network Information
Related Institutions (5)
Rutgers University
159.4K papers, 6.7M citations

91% related

University of Maryland, College Park
155.9K papers, 7.2M citations

91% related

University of Amsterdam
140.8K papers, 5.9M citations

90% related

Boston University
119.6K papers, 6.2M citations

90% related

Utrecht University
139.3K papers, 6.2M citations

90% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202394
2022304
20211,979
20201,822
20191,579
20181,505