103,226 research outputs found
Bibliographie Hilarion G. Petzold 1958 – 2009 mit Anhang als Einführung
No full textDieses Archiv enthält die Gesamtbibliographie der Werke des Autors nebst einiger Texte „Über H. G. Petzold“ im Schlussteil der Bibliographie sowie einen Anhang mit einer Einführung in die Architektur des Werkes in seinem wissenslogischen Aufbau als Ausarbeitung seines „Tree of Science Modells“ (2007).This archive contains the complete bibliography of the author and some texts about H. G. Petzold, moreover an epilogue with an introduction to the architecture of the works in its epistemological structure and composition and as an elaborations of Petzold’s „Tree of Science Modell (2007).https://www.fpi-publikation.de/polyloge/01-2009-petzold-h-g-gesamtbibliographie-h-g-petzold-1958-2009-updating-november2009/peerReviewedpublishedVersio
Dispelling the Myths Behind First-author Citation Counts
No full textWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
Recommended from our members
3346: Samuel G. Freedman, author, 2013
No full textPhotograph of author Samuel G. Freedman, at NT Daily Slash meeting in the Mayborn School of Journalism at UNT
The Right to Strike under the United States Constitution: Theory, Practice, and Possible Implications for Canada
No full textAnswering critics of the Canadian Supreme Court's judgment in B.C. Health, the author argues that the Court laid the foundation for a principled and durable doctrine protecting constitutional labour rights, one that goes directly to the heart of the matter — the inequality of workers’ power in the employment relation. In the author’s view, two paths could lead from B.C. Health to the recognition of Charter protec- tion for a right to strike: one that treats the right as an accessory to col- lective bargaining, and one that upholds the right directly on the basis of the Charter values of equality and participation. The author supports the latter approach, contending that constitutional rights should be defined in relation to fundamental values, in a way that is not contingent on time-bound or fact-sensitive assessments about the role of strikes within a particular collective bargaining regime. Although a Charter right to strike may involve the courts in difficult choices about when to defer to legislative policy decisions, and courts may lack the institutional capac- ity to deal effectively with labour law issues, the author points out that judges can look to ILO standards for expert guidance. Noting that the U.S. experience in this area might be of considerable use to Canadians, the author concludes by providing an overview of American case law concerning a constitutional right to strike.Peer reviewe
Insights from use of police data for suicide surveillance in India: An interim step toward suicide surveillance in low- and middle-income countries
No full textIndia is dependent on police data as the only routinely recorded and publicly available data source on suicide. This correspondence considers some of the uses and limitations of using police suicide data in India and highlights how other low- and middle-income countries can potentially benefit from using police suicide data.Vikas Arya, Andrew Page, Peter Mayer, Lakshmi Vijayakumar, Sangsoo Shin, Jane Pirkis, Gregory Armstron
Online receding horizon planning of multi-contact locomotion
No full textLegged robots can traverse uneven terrain by using multiple contacts between their limbs and the environment. Nevertheless, to enable reliable operation in the real world, legged robots necessarily require the capability to online re-plan their motions in response to changing conditions, such as environment changes, or state deviations due to external force perturbations. To approach this goal, Receding Horizon Planning (RHP) can be a promising solution. RHP refers to the planning framework that can constantly update the motion plan for immediate execution. To achieve successful RHP, we typically need to consider an extended planning horizon, which consists of an execution horizon that plans the motion to be executed, and a prediction horizon that foresees the future. Although the prediction horizon is never executed, it is important to the success of RHP. This is because the prediction horizon serves as a value function approximation that evaluates the feasibility and the future effort required for accomplishing the given task starting from a chosen robot state. Having such value information can guide the execution horizon toward the states that are beneficial for the future.
Nevertheless, computing such multi-contact motions for a legged robot to traverse uneven terrain can be time-consuming, especially when considering a long planning horizon. The computation complexity typically comes from the simultaneous resolution of the following two sub-problems: 1) selecting a gait pattern that specifies the sequence in which the limbs break and make contact with the environment; 2)synthesizing the contact and motion plan that determines the robot state trajectory along with the contact plan, i.e., contact locations and contact timings. The issue of gait pattern selection introduces combinatorial complexity into the planning problem,while the computation of the contact and motion plan brings high-dimensionality and non-convexity due to the consideration of complex non-linear dynamics constraints.
To facilitate online RHP of multi-contact motions, in this thesis, we focus on exploring novel methods to address these two sub-problems efficiently. To give more detail, we firstly consider the problem of planning contact and motion plans in an online receding horizon fashion. In this case, we pre-specifying the gait pattern as a priori. Although this helps us to avoid the combinatorial complexity, the resulting planning problem is still high-dimensional and non-convex, which can hinder online computation. To improve the computation speed, we propose to simplify the modeling of the value function approximation that is required for guiding the RHP. This leads to 1) Receding Horizon Planning with Multiple Levels of Model Fidelity, where we compute the prediction horizon with a convex relaxed model; 2) Locally- Guided Receding Horizon Planning—where we propose to learn an oracle to predict local objectives (intermediate goals) for completing a given task, and then we use these local objectives to construct local value functions to guide a short-horizon RHP. We evaluate our methods for planning centroidal trajectories of a humanoid robot walking on moderate slopes as well as large slopes where static stability cannot be maintained.The result of multi-fidelity RHP demonstrates that we can accelerate the computation speed by relaxing the model accuracy in the prediction horizon. However, the relaxation cannot be arbitrary. Furthermore, owing to the shortened planning horizon, we find that locally-guided RHP demonstrates the best computation efficiency (95%-98.6%cycles converge online). This computation advantage enables us to demonstrate online RHP for our real-world humanoid robot Talos walking in dynamic environments that change on-the-fly.
To handle the combinatorial complexity that arises from the gait pattern selection issue, we propose the idea of constructing a map from the task specifications to the gait pattern selections for a given environment model and performance objective(cost). We show that for a 2D half-cheetah model and a quadruped robot, a direct mapping between a given task and an optimal gait pattern can be established. We use supervised learning to capture the structure of this map in the form of gait regions.Furthermore, we also find that the trajectories in each gait region are qualitatively similar. We utilize this property to construct a warm-starting trajectory for each gait region, i.e., the mean of the trajectories discovered in each region. We empirically show that these warm-starting trajectories can improve the computation speed of our trajectory optimization problem up to 60 times when compared with random initial guesses. Moreover, we also conduct experimental trials on the ANYmal robot to validate our method
Reduction Electrocatalyst: Posy‐Bouquet‐Shaped Gold‐Polyaniline Core‐Shell Nanocomposite
No full textHere it was demonstrated that the decoration of gold (Au) with polyaniline is an effective approach in increasing its electrocatalytic reduction of CO₂ to CO. The core-shell-structured goldpolyaniline (Au–PANI) nanocomposite delivered a CO₂–CO conversion efficiency of 85% with a high current density of 11.6 mAcm¯². The polyaniline shell facilitated CO₂ adsorption, and the subsequent formation of reaction intermediates on the gold core contributed to the high efficiency observed.Amruthalakshmi Vijayakumar, Yong Zhao, Jinshuo Zou, Kezhong Wang, Chong-Yong Lee, Douglas R. MacFarlane, Caiyun Wang, and Gordon G. Wallac
Top Management Control Functions for Information Systems in Small and Medium Enterprises
No full textThis paper analyzes the Top Management Control functions for Information Systems (IS) in Small and Medium Enterprises (SMEs). SMEs extensively rely on information technology resources to enhance their competence in today’s global economy. They should have adequate top management control mechanisms in place for their efficient functioning. Top Management Controls determine how effectively the senior management manages the IS functions in a SME. The major tasks at this level consist of Planning, Organizing, Leading and Controlling functions. A brief introduction to SMEs is given at the beginning followed by the different categories of Top Management Controls. The final section highlights on some good practices to be followed by Top Management to realize the vision for the IS project in SMEs.Charge-Out, Information Systems, IS Plan, Small and Medium Enterprise, Top Management Controls, Zero Based Budgeting
G-Rank: Unsupervised Continuous Learn-to-Rank for Edge Devices in a P2P Network
No full textRanking algorithms in traditional search engines are powered by enormous training data sets that are meticulously engineered and curated by a centralized entity. Decentralized peer-to-peer (p2p) networks such as torrenting applications and Web3 protocols deliberately eschew centralized databases and computational architectures when designing services and features. As such, robust search-and-rank algorithms designed for such domains must be engineered specifically for decentralized networks, and must be lightweight enough to operate on consumer-grade personal devices such as a smartphone or laptop computer. We introduce G-Rank, an unsupervised ranking algorithm designed exclusively for decentralized networks. We demonstrate that accurate, relevant ranking results can be achieved in fully decentralized networks without any centralized data aggregation, feature engineering, or model training. Furthermore, we show that such results are obtainable with minimal data preprocessing and computational overhead, and can still return highly relevant results even when a user’s device is disconnected from the network. G-Rank is highly modular in design, is not limited to categorical data, and can be implemented in a variety of domains with minimal modification. The results herein show that unsupervised ranking models designed for decentralized p2p networks are not only viable, but worthy of further research.https://github.com/awrgold/G-RankComputer Scienc
- …
