In large storage systems, files are often coded across several servers to improve reliability and retrieval speed. We consider a system of @math servers storing files using a Maximum Distance Separable code (cf. li2016mean ). Specifically, each file is stored in equally sized pieces across @math servers such that any @math pieces can reconstruct the original file. File requests are routed using the Batch Sampling routing scheme. I.e. when a request for a file is received, a centralized dispatcher routes the job into the @math -shortest queues among the @math for which the corresponding server contains a piece of the file being requested. We study the long time behavior of this class of load balancing mechanisms. In particular, it is shown that the ODE system that describes the mean field limit of the occupancy measure process has a unique fixed point which is stable. This fixed point corresponds to a distribution on @math of queue lengths with tails that decay super-exponentially. Upper and lower bounds on the decay rate are provided. Finally, we show that the unique invariant measure of the Markov occupancy measure process converges to the Dirac measure concentrated at the unique fixed point of the ODE system, establishing the interchangeability of the @math and @math limits.
Load balancing mechanisms similar to the type considered here have been studied in many works. Specifically, the Join-the-Shortest-Queue (JSQ), Join-the-Idle-Queue (JIQ), and Power-of- @math (also known as the supermarket model) routing schemes have garnered quite a bit of attention (see @cite_6 @cite_5 @cite_4 @cite_8 @cite_13 @cite_7 @cite_12 @cite_10 @cite_9 and references therein). The papers @cite_6 @cite_2 were the first to study the tail behavior of the fixed point of the ODE system associated with the Power-of- @math routing scheme, showing that in steady-state the fraction of queues with lengths exceeding @math decay super-exponentially in @math , a large improvement over the exponential rate for the setting where jobs are routed to servers uniformly at random. Later works on a similar theme include @cite_4 @cite_3 @cite_9 . In all these works, the authors study fluid and diffusion approximations for various types of load balancing mechanisms. In each case, stable fixed points are identified for the LLN limit and the interchangeability of limit property is established.
@cite_4 @cite_7 @cite_8 @cite_10 @cite_9 @cite_6 @cite_3 @cite_2 @cite_5 @cite_13 @cite_12
2950469527 1666061104 2117702591 2560633844 207933838 2023246505
In a document network such as a citation network of scientific documents, web-logs, etc., the content produced by authors exhibits their interest in certain topics. In addition some authors influence other authors' interests. In this work, we propose to model the influence of cited authors along with the interests of citing authors. Moreover, we hypothesize that apart from the citations present in documents, the context surrounding the citation mention provides extra topical information about the cited authors. However, associating terms in the context to the cited authors remains an open problem. We propose novel document generation schemes that incorporate the context while simultaneously modeling the interests of citing authors and influence of the cited authors. Our experiments show significant improvements over baseline models for various evaluation criteria such as link prediction between document and cited author, and quantitatively explaining unseen text. A citing sentence is one that appears in a scientific article and cites previous work. Citing sentences have been studied and used in many applications. For example, they have been used in scientific paper summarization, automatic survey generation, paraphrase identification, and citation function classification. Citing sentences that cite multiple papers are common in scientific writing. This observation should be taken into consideration when using citing sentences in applications. For instance, when a citing sentence is used in a summary of a scientific paper, only the fragments of the sentence that are relevant to the summarized paper should be included in the summary. In this paper, we present and compare three different approaches for identifying the fragments of a citing sentence that are related to a given target reference. Our methods are: word classification, sequence labeling, and segment classification. Our experiments show that segment classification achieves the best results. Scholars are increasingly citing electronic “web references” which are not preserved in libraries or full text archives. WebCite is a new standard for citing web references. To “webcite” a document involves archiving the cited Web page through www.webcitation.org and citing the WebCite permalink instead of (or in addition to) the unstable live Web page. This journal has amended its “instructions for authors” accordingly, asking authors to archive cited Web pages before submitting a manuscript. Almost 200 other journals are already using the system. We discuss the rationale for WebCite, its technology, and how scholars, editors, and publishers can benefit from the service. Citing scholars initiate an archiving process of all cited Web references, ideally before they submit a manuscript. Authors of online documents and websites which are expected to be cited by others can ensure that their work is permanently available by creating an archived copy using WebCite and providing the citation information including the WebCite link on their Web document(s). Editors should ask their authors to cache all cited Web addresses (Uniform Resource Locators, or URLs) “prospectively” before submitting their manuscripts to their journal. Editors and publishers should also instruct their copyeditors to cache cited Web material if the author has not done so already. Finally, WebCite can process publisher submitted “citing articles” (submitted for example as eXtensible Markup Language [XML] documents) to automatically archive all cited Web pages shortly before or on publication. Finally, WebCite can act as a focussed crawler, caching retrospectively references of already published articles. Copyright issues are addressed by honouring respective Internet standards (robot exclusion files, no-cache and no-archive tags). Long-term preservation is ensured by agreements with libraries and digital preservation organizations. The resulting WebCite Index may also have applications for research assessment exercises, being able to measure the impact of Web services and published Web documents through access and Web citation metrics. @PARASPLIT [J Med Internet Res 2005;7(5):e60] Abstract Documents in computer-readable form can be used to provide information about other documents, i.e. those they cite. To do this efficiently requires procedures for computer recognition of citing statements. This is not easy, especially for multi-sentence citing statements. Computer recognition procedures have been developed which are accurate to the following extent: 73 of the words in statements selected by computer procedures as being citing statements are words which are correctly attributable to the corresponding documents. The retrieval effectiveness of computer-recognized citing statements was tested in the following way. First, for eight retrieval requests in inorganiic chemistry, average recall by search of Chemical Abstracts Service indexing and Chemical Abstracts abstract text words was found to be 50 . Words from citing statements referring to the papers to be retrieved were then added to the index terms and abstract words as additional access points, and searching was repeated. Average recall increased to 70 . Only words from citing statements published within a year of the cited papers were used. The retrieval effect of citing statement words alone (published within a year) without index or abstract terms was the following: average recall was 40 . When just the words of the titles of the cited papers were added to those citing statement words, average recall increased to 50 .