A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Filters
h-Index manipulation by undoing merges
2020
Quantitative Science Studies
Preserved Fulltext
In this article, we study the manipulation of the h-index by undoing such merges. In contrast to manipulation by merging articles, such manipulation is harder to detect. ...
Dutiful researchers merge different versions of their articles in their Google Scholar profile even though this can decrease their h-index. ...
{i} to D 0
h-Index manipulation by undoing merges Downloaded from http://direct.mit.edu/qss/article-pdf/1/4/1529/1871038/qss_a_00093.pdf by guest on 16 July 2021
Downloaded from http://direct.mit.edu ...
doi:10.1162/qss_a_00093
fatcat:tm6vsyktbjbqpc6kux6ccff6sa
h-Index Manipulation by Undoing Merges
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this article, we study the manipulation of the h-index by undoing such merges. In contrast to manipulation by merging articles (van Bevern et al. [Artif. ...
Dutiful researchers merge different versions of their articles in their Google Scholar profile even though this can decrease their h-index. ...
The main theoretical conclusion from our work is that h-index manipulation by splitting merged articles 3 is typically computationally easier than manipulation by merging. ...
arXiv:1604.04827v3
fatcat:rslfafrsrzcbheheaio43ck5vi
Transactions on the multiversion B+-tree
2009
Proceedings of the 12th International Conference on Extending Database Technology Advances in Database Technology - EDBT '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The structural consistency and balance of the MVBT is guaranteed by short-duration latching of pages, redo-only logging of structure modifications (version splits, key splits and page merges), and redo-undo ...
logically if a physical undo is not possible. ...
In this way we can use the same algorithms for manipulating the contents of both leaf and index pages. Any consistent and balanced TMVBT is required to satisfy the following three invariants. ...
doi:10.1145/1516360.1516482
dblp:conf/edbt/HaapasaloJSSS09
fatcat:2ixkzwkgandvfkhnpdocnpmypa
Reciprocal Drag-and-Drop
2015
ACM Transactions on Computer-Human Interaction
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
(G∩) = ∅ 14 h(G∩) = append(merge(h(G∩), h(Gi)), (d, t)) 15 if G \ = ∅ then 16 if G \ does not exist in History then 17 h(G \ ) = ∅ 18 h(G \ ) = merge(h(G \ ), h(Gi)) 19 20 end 21 h(G) = append(h(G), d) ...
DND −1 helps users make a precise drag-and-drop and, if this manipulation actually invokes an application command, it will be handled by the application's undo model. ...
doi:10.1145/2785670
fatcat:hpmpi3fby5gazkw2p5gljytf2q
Merging By Decentralized Eventual Consistency Algorithms
2015
EAI Endorsed Transactions on Collaborative Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
I t h a s thr objectives: study the users' behavior during the collaboration, evaluate the quality of textual merging results produced by specific a lgorithms a nd p ropose a s olution t o improve t he ...
The collaborative system is in charge to propose a merge result that includes user's modifications. T h e u s e rs n o w h a v e t o c h e ck a n d adapt this result. ...
The framework calculates two metrics: Merge blocks the number of modifications in the difference. Merge lines the number of lines manipulated by these modifications. ...
doi:10.4108/eai.21-12-2015.150817
fatcat:mpnbvtoqtjfwtoqpuo4rpqa5ni
Sketch-n-Sketch
2019
Proceedings of the 32nd Annual ACM Symposium on User Interface Software and Technology - UIST '19
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
To enable output-directed interaction at more stages of program construction, we expose intermediate execution products for manipulation and we present a mechanism for contextual drawing. ...
In this paradigm, direct manipulation of the program's graphical output corresponds to writing code in a general-purpose programming language, and edits not possible with the mouse can still be enacted ...
This work was supported by U.S. National Science Foundation Grant No. 1651794. ...
doi:10.1145/3332165.3347925
dblp:conf/uist/HempelLC19
fatcat:oebfz4tu4vbbnbranoocz3gyku
Page 1871 of Psychological Abstracts Vol. 44, Issue 11
[page]
1970
Psychological Abstracts
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Role and discrepancy level were manipulated by assigning counterattitudinal arguments to be read (pas- sive role) or written (active role) at specified opinion scale positions. ...
All 5 clusters were recognizable: generalized responsibility merged with | of the 8 previously identified factors, onset and failure to undo combined in specific personal responsibility for one’s condition ...
Efficient applicative data types
1984
Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '84
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This merged joining is analogous to the sorting technique of merging two ordered lists. With this order, only H÷V vertices are added in the worst case. ...
SEL(A,k) is achieved by searching A for the first cell containing index k and returning the associated value. ...
A special record is set aside to model A. its H-field is 0, its LN-field is i, and its RC-fieid is initially 2 * I ) A G M A X -I . ...
doi:10.1145/800017.800517
dblp:conf/popl/Myers84
fatcat:uku2t5b62zd4zjcwzw5l4vog6u
The Recovery Manager of the System R Database Manager
1981
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The transactmn concept allows application programs to commit, abort, or partially undo their effects. ...
Transaction undo and redo are based on records kept in a transaction log. The checkpoint mechanism is based on differential fries (shadows). The recovery log is recorded on disk rather than tape. ...
Transaction UNDO T h e logic of action U N D O is very simple. ...
doi:10.1145/356842.356847
fatcat:rbj5kor46bhhrj2xsj2vyenpcq
Fast Stable Merging and Sorting in Constant Extra Space
1992
Computer journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
In this paper, we devise a relatively simple strategy by which this efficient merge can be made stable, and extend our results in a nontrivial way to the problem of stable sorting by merging. ...
In an earlier research paper, 9 we presented a novel, yet straightforward linear-time algorithm for merging two sorted lists in a fixed amount of additional space. ...
A block of h records beginning at index / is sorted in nondecreasing order by the procedure SORT(i,h). ...
doi:10.1093/comjnl/35.6.643
fatcat:dyngmzeaaveubpp5hrqlnuooya
A High-Performance Persistent Memory Key-Value Store with Near-Memory Compute
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The modules are able to manipulate data structures directly in the store. ...
This is achieved by using the time t's prior quantum summary as a starting point and then merging in updates up to time t. ...
arXiv:2104.06225v1
fatcat:zeeqr5tu55crda7ohy4a3icycm
Interactive context-aware user-driven metadata correction in digital libraries
2012
International Journal on Digital Libraries
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
At the heart of the system lies an automatically constructed network of images that can be navigated quickly by following ... ...
H. and Witten, Ian H. for this author retrieved from the Name Authority service. ...
The pulldown menus that appear as the result of clicking on items in the toolbar, such as Punctuation and Merge, are <div> elements, and their appearance is controlled by manipulating their CSS style property ...
doi:10.1007/s00799-012-0100-5
fatcat:mdflxc2vbrbnxkfpculniwrhpm
Crash recovery in client-server EXODUS
1992
SIGMOD record
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The issues result @om two characteristics of page-server systems: 1) the fact that data is modified and cached in client database buffers that are not accessible by the server, and 2) the performance and ...
The implementation supports ejjicient buffer management policies, allows j%zxibility in the interaction between clients and the server, and reduces the server load by generating log records at clients. ...
Clients perform all data and index manipulation during normal (i.e., non-recovery or rollback) operation. ...
doi:10.1145/141484.130312
fatcat:xemcykdjirdmxdqcbxaclvt32e
Crash recovery in client-server EXODUS
1992
Proceedings of the 1992 ACM SIGMOD international conference on Management of data - SIGMOD '92
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The issues result @om two characteristics of page-server systems: 1) the fact that data is modified and cached in client database buffers that are not accessible by the server, and 2) the performance and ...
The implementation supports ejjicient buffer management policies, allows j%zxibility in the interaction between clients and the server, and reduces the server load by generating log records at clients. ...
Clients perform all data and index manipulation during normal (i.e., non-recovery or rollback) operation. ...
doi:10.1145/130283.130312
dblp:conf/sigmod/FranklinZTCD92
fatcat:rvbhzyuaavgxbgtfdsppmxq4h4
Anatomy of a native XML base management system
2002
The VLDB journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Two helper aggregate nodes (h 1 and h 2 ) have been added to the physical tree. They group the children below p 1 and p 2 into a tree. ...
Consequently, there are several attempts to merge the two "pure" methods above. ...
doi:10.1007/s00778-002-0080-y
fatcat:mhtjrg4k7jatjdzlg6nlrmhlyy
« Previous
Showing results 1 — 15 out of 2,993 results