179,946 research outputs found
Link stability estimation based on link connectivity changes in mobile ad-hoc networks
Dear Wang,
Re: Link Stability Estimation Based on Link Connectivity Changes in Mobile Ad-hoc Networks
I have not been able to assess if this is an author version peer-reviewed or is it an author version non peer reviewed. Could you please clarify this so I can proceed to add your paper to Spiral. Spiral digital repository only accept peer-reviewed papers.
30/11/12 author has confirmed peer reviewe
Genotypische Unterschiede zwischen Europäischen Elitesorten von Vicia faba L. im Merkmal Trockenheitstoleranz
Antiferromagnetism and quadrupolar order in TmTe: a low-temperature neutron-diffraction study
New neutron-diffraction results on the magnetically ordered phase of TmTe are presented. Below the Neel temperature, T(N) approximate to 0.4 K, an additional ferromagnetic intensity is observed in addition to the already reported type-II antiferromagnetic peaks. This effect is ascribed to a canted magnetic structure of the Tm moments, consistent with the O(2)(2)-type antiferroquadrupolar order occurring below T(Q) = 1.8 K. (C) 2000 Elsevier Science B.V. All rights reserved
Letter, [Author unclear] to Paulina T. Merritt
Handwritten letter to Paulina Merritt from an unknown author, October 1, 1876.
T-trail: link failure monitoring in software-defined optical networks
© 2009-2012 OSA. Monitoring trail (m-trail) provides a striking mechanism for fast and unambiguous link failure localization in all-optical networks. However, allocating dedicated supervisory lightpaths (m-trail) undoubtedly increases total network cost. Accordingly, how to maximally reduce monitoring cost in an optical network is an important issue. To this end, we propose a concept of traffic trail (t-trail) that uses traffic lightpaths, instead of dedicated supervisory lightpaths, to localize a single link failure in the context of a software-defined optical network (SDON). The central controller of an SDON collects routing information of all t-trails in the network. Thus, any link failure can be localized according to the ON-OFF status of the traversing t-trails. We first formulate the problem as an integer linear programming (ILP) model. Since the ILP is not feasible for solving the problem in large-size networks, an efficient heuristic algorithm t-trail allocation (TTA) is proposed to address it. We conduct extensive simulations to evaluate the performance of TTA. The results show that compared with the existing m-trail schemes, TTA can reduce total costs by 20.91% on average
Link Services or Link Agents?
A general link service for the WWW has been used within an Electronic Libraries' project. Experience using it shows that as the links become increasingly interesting to the user, processing them becomes increasingly expensive. Eventually textual analysis, ontological services and remote database lookups conflict with the goal of prompt delivery of documents. This paper summarizes the history of the Link Service software behind the Open Journal project together with the kind of links that it has been used to produce. Building on this work it then discusses how the paradigm, architecture and user interface of the DLS have been newly modified both in response to user feedback and also to allow more linking facilities to be added to the WWW environment. We then introduce AgentDLS, an agent-style system that offers suggestions to help the user's browsing and information discovery activities
The Pipeline of Enrichment: Supporting Link Creation for Continuous Media
The application of open hypermedia to temporal media has previously been explored with respect to the link service, in particular link delivery and generic linking. This paper is based on the notion of continuous metadata, in which we use metadata in a temporally significant manner to capture and convey the information required to support linking. With a focus on link creation and live processing, our approach enriches hypermedia content with additional metadata at a number of points between capture and delivery. We illustrate this approach with a tool which assists metadata capture by annotation of continuous media according to a simple ontology
Generalized Additive Models with Unknown Link Function Including Variable Selection
The generalized additive model is a well established and strong tool that allows to model smooth effects of predictors on the response. However, if the link function, which is typically chosen as the canonical link, is misspecified, substantial bias is to be expected. A procedure is proposed that
simultaneously estimates the form of the link function and the unknown form of the predictor functions including selection of predictors. The procedure is based on boosting methodology, which obtains estimates by using a sequence of weak learners. It strongly dominates fitting procedures that are unable to modify a given link function if the true link function deviates from the fixed function. The performance of the procedure is shown
in simulation studies and illustrated by a real world example
Dean David T. Link
Portrait, David T. Link, Notre Dame Law Schoolhttps://scholarship.law.nd.edu/metadata_images/1066/thumbnail.jp
On-line Adaptive T-S Fuzzy-Neural Control for A Class of General Multi-Link Robot Manipulators
[[abstract]]This paper proposes a novel method of on-line modeling and control through the Takagi-Sugeno
(T-S) fuzzy-neural model for a class of general n-link
robot manipulators. Compared with previous methods, this paper has two unique aspects: first, a more
general n-link robot system using on-line adaptive
T-S fuzzy-neural controller is investigated, and second, the complete proof of the controller is given. The
general robot systems are linearized via the mean
value theorem, and then the T-S fuzzy-neural model
can approximate the linearized system. Also, we propose an on-line identification algorithm and put significant emphasis on robust tracking controller design using an adaptive scheme for the robot systems.
Finally, an example including two cases is provided to
demonstrate the feasibility and robustness of the
proposed method.
- …
