Alon Efrat

Applied Filters

Alon Efrat
AuthorRemove filter

Clear all

People

Colleagues

Alon Efrat (98)
Micha Sharir (20)
Joseph S B Mitchell (15)
Swaminathan Sankararaman (12)
Valentin Polishchuk (11)
Arnon Amir (10)
Stephen G Kobourov (10)
Carola Wenk (8)
Esther M Arkin (8)
Pankaj Kumar Agarwal (8)
Kobus J Barnard (7)
Sariel Har-Peled (7)
Srinivasan Ramasubramanian (7)
Boris Aronov (6)
Günter Rote (6)
Matthew J Katz (6)
Michael Segal (5)
Anna Lubiw (4)
Helmut Alt (4)
Frank Oliver Hoffmann (3)

Roles

Advisor
Other

Publication

Journal/Magazine Names

Computational Geometry: Theory and Applications (8)
Discrete & Computational Geometry (6)
Ad Hoc Networks (4)
Information Processing Letters (4)
Journal of Algorithms (3)
Algorithmica (2)
SIAM Journal on Computing (2)
ACM Journal of Experimental Algorithmics (1)
ACM Transactions on Algorithms (1)
Computer (1)
Computer Networks: The International Journal of Computer and Telecommunications Networking (1)
EURASIP Journal on Advances in Signal Processing (1)
IEEE Transactions on Image Processing (1)
Journal of Mathematical Imaging and Vision (1)
Mobile Networks and Applications (1)
Pervasive and Mobile Computing (1)

Proceedings/Book Names

ISAAC '96: Proceedings of the 7th International Symposium on Algorithms and Computation (2)
SCG '98: Proceedings of the fourteenth annual symposium on Computational geometry (2)
SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (2)
SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2)
DIALM-POMC '10: Proceedings of the 6th International Workshop on Foundations of Mobile Computing (1)
ExtremeCom '11: Proceedings of the 3rd Extreme Conference on Communication: The Amazon Expedition (1)
Graph Drawing and Network Visualization (1)
IPSN '15: Proceedings of the 14th International Conference on Information Processing in Sensor Networks (1)
MIR '06: Proceedings of the 8th ACM international workshop on Multimedia information retrieval (1)
MM '11: Proceedings of the 19th ACM international conference on Multimedia (1)
MM '12: Proceedings of the 20th ACM international conference on Multimedia (1)
MobiHoc '12: Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing (1)
PODS '12: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems (1)
QShine '06: Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks (1)
SCG '06: Proceedings of the twenty-second annual symposium on Computational geometry (1)
SCG '95: Proceedings of the eleventh annual symposium on Computational geometry (1)
SCG '96: Proceedings of the twelfth annual symposium on Computational geometry (1)
SCG '97: Proceedings of the thirteenth annual symposium on Computational geometry (1)
SIGSPATIAL '12: Proceedings of the 20th International Conference on Advances in Geographic Information Systems (1)
SIGSPATIAL'13: Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (1)

All Publications

Proceedings (54)
Other periodicals (38)
Journals (4)
Reports (2)

Content Type

Research Article (20)
Poster (1)
Short Paper (1)

Publisher

Association for Computing Machinery (30)
Springer-Verlag (22)
Elsevier Science Publishers B. V. (13)
Society for Industrial and Applied Mathematics (12)
Elsevier North-Holland, Inc. (5)
IEEE Press (5)
Academic Press, Inc. (3)
Duke University (2)
IEEE Computer Society (2)
Hindawi Limited (1)
IEEE Computer Society Press (1)
Kluwer Academic Publishers (1)
Kluwer, B.V. (1)

Publication Date

Upon changing this filter the page will automatically refresh

Past 5 years

Export Citations

Select Citation format

Please download or close your previous search result export first before starting a new bulk export.
Preview is not available.
By clicking download,a status dialog will open to start the export process. The process may takea few minutes but once it finishes a file will be downloadable from your browser. You may continue to browse the DL while the export process is in progress.
Download
- Download citation
- Copy citation

Publications

98 Results for: Author: Alon EfratEdit SearchSave SearchFailed to save your search, try again laterSearch has been saved (My Saved Searches)

Save this search

Please login to be able to save your searches and receive alerts for new content matching your search criteria.

Searched The ACM Guide to Computing Literature (3,748,210 records)|Limit your search to The ACM Full-Text Collection (754,791 records)

Results

Showing 1 - 20of98 Results

Filters

Select All

Export Citations Save to Binder

Save to Binder

Create a New Binder

Name

per page:

Sort by: Latest

Recency
Earliest
Most Downloaded
Most Cited

research-article
Published By ACM
Published By ACM
Data inference from encrypted databases: a multi-dimensional order-preserving matching approach
- Yanjun Pan
  University of Arizona
  ,
- Alon Efrat
  University of Arizona
  ,
- Ming Li
  University of Arizona
  ,
- Boyang Wang
  University of Cincinnati
  ,
- Hanyu Quan
  Huaqiao University, Xiamen, China
  ,
- Joseph Mitchell
  Stony Brook University
  ,
- Jie Gao
  Stony Brook University
  ,
- Esther Arkin
  Stony Brook University
Mobihoc '20: Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing•October 2020, pp 151-160• https://doi.org/10.1145/3397166.3409135

Due to increasing concerns of data privacy, databases are being encrypted before they are stored on an untrusted server. To enable search operations on the encrypted data, searchable encryption techniques have been proposed. Representative schemes use ...
1Citation
153
Downloads
Metrics
Total Citations1
Total Downloads153
Last 12 Months25
Last 6 weeks1
Export Citations
Save to Binder
Get Access
Article
Polygons with Prescribed Angles in 2D and 3D
- Alon Efrat
  University of Arizona, Tucson, AZ, USA
  ,
- Radoslav Fulek
  University of Arizona, Tucson, AZ, USA
  ,
- Stephen Kobourov
  University of Arizona, Tucson, AZ, USA
  ,
- Csaba D. Tóth
  California State University Northridge, Los Angeles, CA, USA
  Tufts University, Medford, MA, USA
Graph Drawing and Network Visualization•September 2020, pp 135-147• https://doi.org/10.1007/978-3-030-68766-3_11
Abstract
We consider the construction of a polygon P with n vertices whose turning angles at the vertices are given by a sequence $A = (α_{0}, \dots, α_{n - 1})$ , $α_{i} \in (- π, π)$ , for $i \in {0, \dots, n - 1}$ . The problem of realizing A by a polygon can be seen as that of constructing a ... $^{}$ $^{}$ $^{}$
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
research-article
Public Access
Published By ACM
Published By ACM
Multi-level Steiner Trees
- Reyan Ahmed
  University of Arizona, Tucson, AZ, USA
  ,
- Patrizio Angelini
  Universität Tübingen, Germany
  ,
- Faryad Darabi Sahneh
  University of Arizona, Tucson, AZ, USA
  ,
- Alon Efrat
  University of Arizona, Tucson, AZ, USA
  ,
- David Glickenstein
  University of Arizona, Tucson, AZ, USA
  ,
- Martin Gronemann
  Universität zu Köln, Germany
  ,
- Niklas Heinsohn
  Universität Tübingen, Germany
  ,
- Stephen G. Kobourov
  University of Arizona, Tucson, AZ, USA
  ,
- Richard Spence
  University of Arizona, Tucson, AZ, USA
  ,
- Joseph Watkins
  University of Arizona, Tucson, AZ, USA
  ,
- Alexander Wolff
  Universität Würzburg, Germany
ACM Journal of Experimental Algorithmics, Volume 24•2019, Article No.: 2.5, pp 1-22 • https://doi.org/10.1145/3368621

In the classical Steiner tree problem, given an undirected, connected graph G=(V,E) with non-negative edge costs and a set of terminals T⊆ V, the objective is to find a minimum-cost tree E^&prime ⊆ E that spans the terminals. The problem is APX-hard; the ...
4Citation
413
Downloads
Metrics
Total Citations4
Total Downloads413
Last 12 Months104
Last 6 weeks17
Export Citations
Save to Binder
View online with eReader
PDF
research-article
Published By ACM
Published By ACM
Are Friends of My Friends Too Social?: Limitations of Location Privacy in a Socially-Connected World
- Boris Aronov
  New York University, Brooklyn, NY, USA
  ,
- Alon Efrat
  University of Arizona, Tucson, AZ, USA
  ,
- Ming Li
  University of Arizona, Tucson, AZ, USA
  ,
- Jie Gao
  Stony Brook University, Stony Brook, NY, USA
  ,
- Joseph S. B. Mitchell
  Stony Brook University, Stony Brook, NY, USA
  ,
- Valentin Polishchuk
  Linköping University, Linköping, Sweden
  ,
- Boyang Wang
  University of Cincinnati, Cincinnati, OH, USA
  ,
- Hanyu Quan
  Xidian University, Xi'an, China
  ,
- Jiaxin Ding
  Stony Brook University, Stony Brook, NY, USA
Mobihoc '18: Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing•June 2018, pp 280-289• https://doi.org/10.1145/3209582.3209611

With the ubiquitous adoption of smartphones and mobile devices, it is now common practice for one's location to be sensed, collected and likely shared through social platforms. While such data can be helpful for many applications, users start to be aware ...
3Citation
219
Downloads
Metrics
Total Citations3
Total Downloads219
Last 12 Months15
Export Citations
Save to Binder
Get Access
article
Nearest-Neighbor Searching Under Uncertainty I
- Pankaj K. Agarwal
  Department of Computer Science, Duke University, Durham, USA 27708-0129
  ,
- Alon Efrat
  Department of Computer Science, University of Arizona, Tucson, USA 85721-0077
  ,
- Swaminathan Sankararaman
  Akamai Technologies, Cambridge, USA 02142
  ,
- Wuzhou Zhang
  Apple Inc., Cupertino, USA 95014
Discrete & Computational Geometry, Volume 58, Issue 3•October 2017, pp 705-745 • https://doi.org/10.1007/s00454-017-9903-x

Nearest-neighbor queries, which ask for returning the nearest neighbor of a query point in a set of points, are important and widely studied in many fields because of a wide range of applications. In many of these applications, such as sensor databases, ...
3Citation
Metrics
Total Citations3
Export Citations
Save to Binder
research-article
Published By ACM
Published By ACM
Improved Approximation Algorithms for Relay Placement
- Alon Efrat
  University of Arizona, Tucson, AZ
  ,
- Sándor P. Fekete
  Braunschweig University of Technology, Braunschweig, Germany
  ,
- Joseph S. B. Mitchell
  Stony Brook University, NY, USA
  ,
- Valentin Polishchuk
  Linköping University, Norrköping, Sweden
  ,
- Jukka Suomela
  Aalto University, Aalto, Finland
ACM Transactions on Algorithms, Volume 12, Issue 2•February 2016, Article No.: 20, pp 1-28 • https://doi.org/10.1145/2814938

In the relay placement problem, the input is a set of sensors and a number r ⩾ 1, the communication range of a relay. In the one-tier version of the problem, the objective is to place a minimum number of relays so that between every pair of sensors ...
6Citation
238
Downloads
Metrics
Total Citations6
Total Downloads238
Last 12 Months6
Last 6 weeks2
Export Citations
Save to Binder
Get Access
research-article
Published By ACM
Published By ACM
Secure Communication through Jammers Jointly Optimized in Geography and Time
- Yair Allouche
  Ben Gurion University, Beer-Sheva , Israel
  ,
- Yuval Cassuto
  Technion -- Israel Institute of Technology, Haifa , Israel
  ,
- Alon Efrat
  The University of Arizona, Tucson, AZ, USA
  ,
- Michael Segal
  Ben-Gurion University, Beer-Sheva, Israel
  ,
- Esther M. Arkin
  Stony Brook University, Stony Brook, NY, USA
  ,
- Guy Grebla
  Columbia University, New York City, NY, USA
  ,
- Joseph S.B. Mitchell
  Stony Brook University, Stony Brook, NY, USA
  ,
- Swaminathan Sankararaman
  Akamai Technologies, Cambridge, MA, USA
MobiHoc '15: Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing•June 2015, pp 227-236• https://doi.org/10.1145/2746285.2746322

Security-sensitive applications, such as patient health monitoring and credit card transactions, are increasingly utilizing wireless communication systems, RFIDs, wireless sensor networks, and other wireless communication systems. The use of ...
4Citation
187
Downloads
Metrics
Total Citations4
Total Downloads187
Last 12 Months9
Export Citations
Save to Binder
Get Access
research-article
Published By ACM
Published By ACM
Optimal placement of protective jammers for securing wireless transmissions in a geographic domain
- Esther Arkin
  Stony Brook University, Stony Brook, NY
  ,
- Yuval Cassuto
  Israel Institute of Technology, Haifa, Israel
  ,
- Alon Efrat
  The University of Arizona, Tucson, AZ
  ,
- Guy Grebla
  Columbia University, New York, NY
  ,
- Joseph S. B. Mitchell
  Stony Brook University, Stony Brook, NY
  ,
- Swaminathan Sankararaman
  Akamai Systems
  ,
- Michael Segal
  Ben-Gurion University, Beer-Sheva, Israel
IPSN '15: Proceedings of the 14th International Conference on Information Processing in Sensor Networks•April 2015, pp 37-46• https://doi.org/10.1145/2737095.2742142

Wireless communication systems, such as RFIDs and wireless sensor networks, are increasingly being used in security-sensitive applications, e.g. credit card transactions or monitoring patient health in hospitals. Wireless jamming by transmitting ...
6Citation
208
Downloads
Metrics
Total Citations6
Total Downloads208
Last 12 Months6
Last 6 weeks1
Export Citations
Save to Binder
Get Access
research-article
Geographic max-flow and min-cut under a circular disk failure model
- Sebastian Neumayer
  LIDS, MIT, Cambridge, MA 02139, United States
  ,
- Alon Efrat
  University of Arizona, Tucson, AZ 85721, United States
  ,
- Eytan Modiano
  LIDS, MIT, Cambridge, MA 02139, United States
Computer Networks: The International Journal of Computer and Telecommunications Networking, Volume 77, Issue C•February 2015, pp 117-127 • https://doi.org/10.1016/j.comnet.2014.10.026

Failures in fiber-optic networks may be caused by natural disasters, such as floods or earthquakes, as well as other events, such as an Electromagnetic Pulse (EMP) attack. These events occur in specific geographical locations, therefore the geography of ...
9Citation
Metrics
Total Citations9
Export Citations
Save to Binder
Article
MapSets: Visualizing Embedded and Clustered Graphs
- Alon Efrat
  Department of Computer Science, University of Arizona, Tucson, USA
  ,
- Yifan Hu
  Yahoo Labs, New York, USA
  ,
- Stephen G. Kobourov
  Department of Computer Science, University of Arizona, Tucson, USA
  ,
- Sergey Pupyrev
  Department of Computer Science, University of Arizona, Tucson, USA and Institute of Mathematics and Computer Science, Ural Federal University, Russia
GD 2014: Revised Selected Papers of the 22nd International Symposium on Graph Drawing - Volume 8871•September 2014, pp 452-463• https://doi.org/10.1007/978-3-662-45803-7_38

We describe MapSets, a method for visualizing embedded and clustered graphs. The proposed method relies on a theoretically sound geometric algorithm, which guarantees the contiguity and disjointness of the regions representing the clusters, and also ...
3Citation
Metrics
Total Citations3
Export Citations
Save to Binder
article
Collecting data in ad-hoc networks with reduced uncertainty
Ad Hoc Networks, Volume 17•June, 2014, pp 71-81 • https://doi.org/10.1016/j.adhoc.2014.01.005

We consider the data gathering problem in wireless ad-hoc networks where a data mule traverses a set of sensors, each with vital information on its surrounding, and collects their data. The mule goal is to collect as much information as possible thereby ...
7Citation
Metrics
Total Citations7
Export Citations
Save to Binder
article
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing
- Helmut Alt
  Institut für Informatik, Freie Universität, Berlin, Germany
  ,
- Esther M. Arkin
  Applied Mathematics and Statistics, Stony Brook University, Stony Brook, USA
  ,
- Alon Efrat
  Computer Science, The University of Arizona, Tucson, USA
  ,
- George Hart
  Computer Science, The University of Arizona, Tucson, USA
  ,
- Ferran Hurtado
  Departament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Barcelona, Spain
  ,
- Irina Kostitsyna
  Computer Science, Stony Brook University, Stony Brook, USA
  ,
- Alexander Kröller
  Computer Science, Technische Universität Braunschweig, Braunschweig, Germany
  ,
- Joseph S. Mitchell
  Applied Mathematics and Statistics, Stony Brook University, Stony Brook, USA
  ,
- Valentin Polishchuk
  Helsinki Institute for IT, Computer Science, University of Helsinki, Helsinki, Finland
Theory of Computing Systems, Volume 54, Issue 4•May 2014, pp 689-714 • https://doi.org/10.1007/s00224-013-9493-9

We show how to compute the smallest rectangle that can enclose any polygon, from a given set of polygons, in nearly linear time; we also present a PTAS for the problem, as well as a linear-time algorithm for the case when the polygons are rectangles ...
0Citation
Metrics
Total Citations0
Export Citations
Save to Binder
article
On channel-discontinuity-constraint routing in wireless networks
- Swaminathan Sankararaman
  Department of Computer Science, The University of Arizona, Tucson, AZ, USA
  ,
- Alon Efrat
  Department of Computer Science, The University of Arizona, Tucson, AZ, USA
  ,
- Srinivasan Ramasubramanian
  Department of Electrical and Computer Engineering, The University of Arizona, Tucson, AZ, USA
  ,
- Pankaj K. Agarwal
  Department of Computer Science, Duke University, Durham, NC, USA
Ad Hoc Networks, Volume 13•February, 2014, pp 153-169 • https://doi.org/10.1016/j.adhoc.2011.04.011

Multi-channel wireless networks are increasingly deployed as infrastructure networks, e.g. in metro areas. Network nodes frequently employ directional antennas to improve spatial throughput. In such networks, between two nodes, it is of interest to ...
5Citation
Metrics
Total Citations5
Export Citations
Save to Binder
article
Optimization Schemes for Protective Jamming
- Swaminathan Sankararaman
  Department of Computer Science, Duke University, Durham, USA
  ,
- Karim Abu-Affash
  Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84105
  ,
- Alon Efrat
  Department of Computer Science, The University of Arizona, Tucson, USA
  ,
- Sylvester David Eriksson-Bique
  CS Department, University of Helsinki, Helsinki, Finland
  ,
- Valentin Polishchuk
  CS Department, University of Helsinki, Helsinki, Finland
  ,
- Srinivasan Ramasubramanian
  Department of Electrical and Computer Engineering, The University of Arizona, Tucson, USA
  ,
- Michael Segal
  Department of Communication Systems Engineering, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84105
Mobile Networks and Applications, Volume 19, Issue 1•February 2014, pp 45-60 • https://doi.org/10.1007/s11036-013-0483-6

In this paper, we study strategies for allocating and managing friendly jammers, so as to create virtual barriers that would prevent hostile eavesdroppers from tapping sensitive wireless communication. Our scheme precludes the use of any encryption ...
1Citation
10
Downloads
Metrics
Total Citations1
Total Downloads10
Export Citations
Save to Binder
article
Data transmission and base-station placement for optimizing the lifetime of wireless sensor networks
Ad Hoc Networks, Volume 12•January, 2014, pp 201-218 • https://doi.org/10.1016/j.adhoc.2011.09.010

In this paper, we study the fundamental optimization problem in wireless sensor networks of base-station positioning such that data from the sensors may be transmitted to it in an energy-efficient manner. We primarily consider the setting where a sensor ...
3Citation
Metrics
Total Citations3
Export Citations
Save to Binder
research-article
Published By ACM
Published By ACM
Sweeping a terrain by collaborative aerial vehicles
- Alon Efrat
  University of Arizona
  ,
- Mikko Nikkilä
  University of Helsinki
  ,
- Valentin Polishchuk
  University of Helsinki
SIGSPATIAL'13: Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems•November 2013, pp 4-13• https://doi.org/10.1145/2525314.2525355

Mountainous regions are typically hard to access by land; because of this, search operations in hilly terrains are often performed by airborne force such as Unmanned Aerial Vehicles (UAVs). We give algorithms for motion planning and coordination for a ...
5Citation
213
Downloads
Metrics
Total Citations5
Total Downloads213
Last 12 Months5
Export Citations
Save to Binder
Get Access
article
The resilience of WDM networks to probabilistic geographical failures
- Pankaj K. Agarwal
  Department of Computer Science, Duke University, Durham, NC
  ,
- Alon Efrat
  Department of Computer Science, The University of Arizona, Tucson, AZ
  ,
- Shashidhara K. Ganjugunte
  Mentor Graphics, Wilsonville, OR and Duke University, Durham, NC
  ,
- David Hay
  Department of Engineering and Computer Science, Hebrew University, Jerusalem, Israel
  ,
- Swaminathan Sankararaman
  Department of Computer Science, Duke University, Durham, NC
  ,
- Gil Zussman
  Department of Electrical Engineering, Columbia University, New York, NY
IEEE/ACM Transactions on Networking, Volume 21, Issue 5•October 2013, pp 1525-1538 • https://doi.org/10.1109/TNET.2012.2232111

Telecommunications networks, and in particular optical WDM networks, are vulnerable to large-scale failures in their physical infrastructure, resulting from physical attacks (such as an electromagnetic pulse attack) or natural disasters (such as solar ...
30Citation
228
Downloads
Metrics
Total Citations30
Total Downloads228
Last 12 Months3
Last 6 weeks2
Export Citations
Save to Binder
Get Access
research-article
Published By ACM
Published By ACM
Efficient algorithms for pursuing moving evaders in terrains
- Alon Efrat
  The University of Arizona
  ,
- Joseph S. B. Mitchell
  Stony Brook University
  ,
- Swaminathan Sankararaman
  Duke University
  ,
- Parrish Myers
  The University of Arizona
SIGSPATIAL '12: Proceedings of the 20th International Conference on Advances in Geographic Information Systems•November 2012, pp 33-42• https://doi.org/10.1145/2424321.2424327

We propose algorithms for computing optimal trajectories of a group of flying observers (such as helicopters or UAVs) searching for a lost child in a hilly terrain. Very few assumptions are made about the speed or direction of the child's motion and ...
1Citation
229
Downloads
Metrics
Total Citations1
Total Downloads229
Export Citations
Save to Binder
Get Access
poster
Published By ACM
Published By ACM
Client-side backprojection of presentation slides into educational video
- Yekaterina Kharitonova
  University of Arizona, Tucson, AZ, USA
  ,
- Qiyam Tung
  University of Arizona, Tucson, AZ, USA
  ,
- Alexander Danehy
  University of Arizona, Tucson, AZ, USA
  ,
- Alon Efrat
  University of Arizona, Tucson, AZ, USA
  ,
- Kobus Barnard
  University of Arizona, Tucson, AZ, USA
MM '12: Proceedings of the 20th ACM international conference on Multimedia•October 2012, pp 1005-1008• https://doi.org/10.1145/2393347.2396368

A significant part of many videos of lectures is presentation slides that occupy much of the field of view. Further, for a student studying the lecture, having the slides sharply displayed is especially important, compared with the speaker, background, ...
0Citation
143
Downloads
Metrics
Total Citations0
Total Downloads143
Last 12 Months2
Export Citations
Save to Binder
Get Access
research-article
Published By ACM
Published By ACM
Optimization schemes for protective jamming
- Swaminathan Sankararaman
  Duke University, Durham, NC, USA
  ,
- Karim Abu-Affash
  Ben Gurion University, Beer-Sheva, Israel
  ,
- Alon Efrat
  The University of Arizona, Tucson, AZ, USA
  ,
- Sylvester David Eriksson-Bique
  University of Helsinki, Helsinki, Finland
  ,
- Valentin Polishchuk
  University of Helsinki, Helsinki, Finland
  ,
- Srinivasan Ramasubramanian
  The University of Arizona, Tucson, AZ, USA
  ,
- Michael Segal
  Ben Gurion University, Beer-Sheva, Israel
MobiHoc '12: Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing•June 2012, pp 65-74• https://doi.org/10.1145/2248371.2248383

In this paper, we study strategies for allocating and managing friendly jammers, so as to create virtual barriers that would prevent hostile eavesdroppers from tapping sensitive wireless communication. Our scheme precludes the use of any encryption ...
32Citation
344
Downloads
Metrics
Total Citations32
Total Downloads344
Last 12 Months9
Export Citations
Save to Binder
Get Access

Author Profile Pages

Description: The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM bibliographic database, the Guide. Coverage of ACM publications is comprehensive from the 1950's. Coverage of other publishers generally starts in the mid 1980's. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community.
Please see the following 2007 Turing Award winners' profiles as examples:
History: Disambiguation of author names is of course required for precise identification of all the works, and only those works, by a unique individual. Of equal importance to ACM, author name normalization is also one critical prerequisite to building accurate citation and download statistics. For the past several years, ACM has worked to normalize author names, expand reference capture, and gather detailed usage statistics, all intended to provide the community with a robust set of publication metrics. The Author Profile Pages reveal the first result of these efforts.
Normalization: ACM uses normalization algorithms to weigh several types of evidence for merging and splitting names.
These include:
- co-authors: if we have two names and cannot disambiguate them based on name alone, then we see if they have a co-author in common. If so, this weighs towards the two names being the same person.
- affiliations: names in common with same affiliation weighs toward the two names being the same person.
- publication title: names in common whose works are published in same journal weighs toward the two names being the same person.
- keywords: names in common whose works address the same subject matter as determined from title and keywords, weigh toward being the same person.
The more conservative the merging algorithms, the more bits of evidence are required before a merge is made, resulting in greater precision but lower recall of works for a given Author Profile. Many bibliographic records have only author initials. Many names lack affiliations. With very common family names, typical in Asia, more liberal algorithms result in mistaken merges.

Automatic normalization of author names is not exact. Hence it is clear that manual intervention based on human knowledge is required to perfect algorithmic results. ACM is meeting this challenge, continuing to work to improve the automated merges by tweaking the weighting of the evidence in light of experience.
Bibliometrics: In 1926, Alfred Lotka formulated his power law (known as Lotka's Law) describing the frequency of publication by authors in a given field. According to this bibliometric law of scientific productivity, only a very small percentage (~6%) of authors in a field will produce more than 10 articles while the majority (perhaps 60%) will have but a single article published. With ACM's first cut at author name normalization in place, the distribution of our authors with 1, 2, 3..n publications does not match Lotka's Law precisely, but neither is the distribution curve far off. For a definition of ACM's first set of publication statistics, see Bibliometrics
Future Direction: The initial release of the Author Edit Screen is open to anyone in the community with an ACM account, but it is limited to personal information. An author's photograph, a Home Page URL, and an email may be added, deleted or edited. Changes are reviewed before they are made available on the live site.
ACM will expand this edit facility to accommodate more types of data and facilitate ease of community participation with appropriate safeguards. In particular, authors or members of the community will be able to indicate works in their profile that do not belong there and merge others that do belong but are currently missing.

A direct search interface for Author Profiles will be built.

An institutional view of works emerging from their faculty and researchers will be provided along with a relevant set of metrics.

It is possible, too, that the Author Profile page may evolve to allow interested authors to upload unpublished professional materials to an area available for search and free educational use, but distinct from the ACM Digital Library proper. It is hard to predict what shape such an area for user-generated content may take, but it carries interesting potential for input from the community.

Bibliometrics

The ACM DL is a comprehensive repository of publications from the entire field of computing.

It is ACM's intention to make the derivation of any publication statistics it generates clear to the user.

Average citations per article = The total Citation Count divided by the total Publication Count.
Citation Count = cumulative total number of times all authored works by this author were cited by other works within ACM's bibliographic database. Almost all reference lists in articles published by ACM have been captured. References lists from other publishers are less well-represented in the database. Unresolved references are not included in the Citation Count. The Citation Count is citations TO any type of work, but the references counted are only FROM journal and proceedings articles. Reference lists from books, dissertations, and technical reports have not generally been captured in the database. (Citation Counts for individual works are displayed with the individual record listed on the Author Page.)
Publication Count = all works of any genre within the universe of ACM's bibliographic database of computing literature of which this person was an author. Works where the person has role as editor, advisor, chair, etc. are listed on the page but are not part of the Publication Count.
Publication Years = the span from the earliest year of publication on a work by this author to the most recent year of publication of a work by this author captured within the ACM bibliographic database of computing literature (The ACM Guide to Computing Literature, also known as "the Guide".
Available for download = the total number of works by this author whose full texts may be downloaded from an ACM full-text article server. Downloads from external full-text sources linked to from within the ACM bibliographic space are not counted as 'available for download'.
Average downloads per article = The total number of cumulative downloads divided by the number of articles (including multimedia objects) available for download from ACM's servers.
Downloads (cumulative) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server since the downloads were first counted in May 2003. The counts displayed are updated monthly and are therefore 0-31 days behind the current date. Robotic activity is scrubbed from the download statistics.
Downloads (12 months) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 12-month period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (12-month download counts for individual works are displayed with the individual record.)
Downloads (6 weeks) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 6-week period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (6-week download counts for individual works are displayed with the individual record.)

ACM Author-Izer Service

Summary Description

ACM Author-Izer is a unique service that enables ACM authors to generate and post links on both their homepage and institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge.

Downloads from these sites are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to definitive version of ACM articles should reduce user confusion over article versioning.

ACM Author-Izer also extends ACM’s reputation as an innovative “Green Path” publisher, making ACM one of the first publishers of scholarly works to offer this model to its authors.

To access ACM Author-Izer, authors need to establish a free ACM web account. Should authors change institutions or sites, they can utilize the new ACM service to disable old links and re-authorize new links for free downloads from a different site.

How ACM Author-Izer Works

Authors may post ACM Author-Izer links in their own bibliographies maintained on their website and their own institution’s repository. The links take visitors to your page directly to the definitive version of individual articles inside the ACM Digital Library to download these articles for free.

The Service can be applied to all the articles you have ever published with ACM.

Depending on your previous activities within the ACM DL, you may need to take up to three steps to use ACM Author-Izer.

For authors who do not have a free ACM Web Account:

Go to the ACM DL http://dl.acm.org/ and click SIGN UP. Once your account is established, proceed to next step.

For authors who have an ACM web account, but have not edited their ACM Author Profile page:

Sign in to your ACM web account and go to your Author Profile page. Click "Add personal information" and add photograph, homepage address, etc. Click ADD AUTHOR INFORMATION to submit change. Once you receive email notification that your changes were accepted, you may utilize ACM Author-izer.

For authors who have an account and have already edited their Profile Page:

Sign in to your ACM web account, go to your Author Profile page in the Digital Library, look for the ACM Author-izer link below each ACM published article, and begin the authorization process. If you have published many ACM articles, you may find a batch Authorization process useful. It is labeled: "Export as: ACM Author-Izer Service"

ACM Author-Izer also provides code snippets for authors to display download and citation statistics for each “authorized” article on their personal pages. Downloads from these pages are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of ACM articles should reduce user confusion over article versioning.

Note: You still retain the right to post your author-prepared preprint versions on your home pages and in your institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library. But any download of your preprint versions will not be counted in ACM usage statistics. If you use these AUTHOR-IZER links instead, usage by visitors to your page will be recorded in the ACM Digital Library and displayed on your page.

FAQ

Q. What is ACM Author-Izer?
A. ACM Author-Izer is a unique, link-based, self-archiving service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles for free.
Q. What articles are eligible for ACM Author-Izer?
A. ACM Author-Izer can be applied to all the articles authors have ever published with ACM. It is also available to authors who will have articles published in ACM publications in the future.

Q. Are there any restrictions on authors to use this service?
A. No. An author does not need to subscribe to the ACM Digital Library nor even be a member of ACM.

Q. What are the requirements to use this service?
A. To access ACM Author-Izer, authors need to have a free ACM web account, must have an ACM Author Profile page in the Digital Library, and must take ownership of their Author Profile page.

Q. What is an ACM Author Profile Page?
A. The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM Digital Library. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community. Please visit the ACM Author Profile documentation page for more background information on these pages.

Q. How do I find my Author Profile page and take ownership?
A. You will need to take the following steps:
- Create a free ACM Web Account
- Sign-In to the ACM Digital Library
- Find your Author Profile Page by searching the ACM Digital Library for your name
- Find the result you authored (where your author name is a clickable link)
- Click on your name to go to the Author Profile Page
- Click the "Add Personal Information" link on the Author Profile Page
- Wait for ACM review and approval; generally less than 24 hours

Q. Why does my photo not appear?
A. Make sure that the image you submit is in .jpg or .gif format and that the file name does not contain special characters

Q. What if I cannot find the Add Personal Information function on my author page?
A. The ACM account linked to your profile page is different than the one you are logged into. Please logout and login to the account associated with your Author Profile Page.

Q. What happens if an author changes the location of his bibliography or moves to a new institution?
A. Should authors change institutions or sites, they can utilize ACM Author-Izer to disable old links and re-authorize new links for free downloads from a new location.

Q. What happens if an author provides a URL that redirects to the author’s personal bibliography page?
A. The service will not provide a free download from the ACM Digital Library. Instead the person who uses that link will simply go to the Citation Page for that article in the ACM Digital Library where the article may be accessed under the usual subscription rules.

However, if the author provides the target page URL, any link that redirects to that target page will enable a free download from the Service.

Q. What happens if the author’s bibliography lives on a page with several aliases?
A. Only one alias will work, whichever one is registered as the page containing the author’s bibliography. ACM has no technical solution to this problem at this time.

Q. Why should authors use ACM Author-Izer?
A. ACM Author-Izer lets visitors to authors’ personal home pages download articles for no charge from the ACM Digital Library. It allows authors to dynamically display real-time download and citation statistics for each “authorized” article on their personal site.

Q. Does ACM Author-Izer provide benefits for authors?
A. Downloads of definitive articles via Author-Izer links on the authors’ personal web page are captured in official ACM statistics to more accurately reflect usage and impact measurements.

Authors who do not use ACM Author-Izer links will not have downloads from their local, personal bibliographies counted. They do, however, retain the existing right to post author-prepared preprint versions on their home pages or institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library.

Q. How does ACM Author-Izer benefit the computing community?
A. ACM Author-Izer expands the visibility and dissemination of the definitive version of ACM articles. It is based on ACM’s strong belief that the computing community should have the widest possible access to the definitive versions of scholarly literature. By linking authors’ personal bibliography with the ACM Digital Library, user confusion over article versioning should be reduced over time.

In making ACM Author-Izer a free service to both authors and visitors to their websites, ACM is emphasizing its continuing commitment to the interests of its authors and to the computing community in ways that are consistent with its existing subscription-based access model.

Q. How do authors access ACM Author-Izer?
A. See How to Use

Q. Why can’t I find my most recent publication in my ACM Author Profile Page?
A. There is a time delay between publication and the process which associates that publication with an Author Profile Page. Right now, that process usually takes 4-8 weeks.

Q. How does ACM Author-Izer expand ACM’s “Green Path” Access Policies?
A. ACM Author-Izer extends the rights and permissions that authors retain even after copyright transfer to ACM, which has been among the “greenest” publishers. ACM enables its author community to retain a wide range of rights related to copyright and reuse of materials. They include:
- Posting rights that ensure free access to their work outside the ACM Digital Library and print publications
- Rights to reuse any portion of their work in new works that they may create
- Copyright to artistic images in ACM’s graphics-oriented publications that authors may want to exploit in commercial contexts
- All patent rights, which remain with the original owner