检索结果-内蒙古大学图书馆

Seamless integration of rule-based knowledge and object-oriented functionality with linguistic symbiosis 04

学校读者我要写书评

暂无评论

Seamless integration of rule-based knowledge and object-orie...

Applied Computing 2004 - Proceedings of the 2004 ACM Symposium on Applied Computing

作者： D'Hondt, Maja Gybels, Kris Jonckers, Viviane System and Software Engineering Lab. Vrije Universiteit Brussel Belgium Programming Technology Lab. Vrije Universiteit Brussel Belgium Flemish Inst. Prom. Sci.-T.R.I. Flanders Belgium Fund for Scientific Research Flanders Belgium

ISBN: (纸本)9781581138122

Software applications often contain implicit knowledge in addition to functionality which is inherently object-oriented. Many approaches and systems exist that focus on separating rule-based knowledge from object-oriented functionality and representing it explicitly in a logic reasoning system. Support for seamless integration of this knowledge with the object-oriented functionality improves software development and evolution. Our hypothesis is that a linguistic symbiosis is required between the logic reasoning and object-oriented programming paradigms in order to achieve seamless integration. This paper presents a symbiotic extension of SOUL, a system which implements a logic programming language and a production system in Smalltalk. The presence of these two logic reasoning systems in SOUL ensures a comprehensive coverage of rule-based reasoning styles, more specifically forward and backward chaining. Our approach is evaluated by means of two case studies. We summarise a comprehensive survey, which shows that existing systems do not fully support seamless integration.

关键词： Object oriented programming

pioNER: Datasets and Baselines for Armenian Named Entity Recognition

学校读者我要写书评

暂无评论

pioNER: Datasets and Baselines for Armenian Named Entity Rec...

Ivannikov ISPRAS Open Conference (ISPRAS)

作者： Tsolak Ghukasyan Garnik Davtyan Karen Avetisyan Ivan Andrianov Ivannikov Laboratory for System Programming at Russian Armenian University Yerevan Armenia Ivannikov Lab. for Syst. Program. Russian-Armenian Univ. Moscow Russia Ivannikov Institute for System Programming of the Russian Academy of Sciences Moscow Russia

ISBN: (纸本)9781728112763;9781728112756

In this work, we tackle the problem of Armenian named entity recognition, providing silverand gold-standard datasets as well as establishing baseline results on popular models. We present a 163000-token named entity corpus automatically generated and annotated from Wikipedia, and another 53400token corpus of news sentences with manual annotation of people, organization and location named entities. The corpora were used to train and evaluate several popular named entity recognition models. Alongside the datasets, we release 50-, 100-, 200-, 300dimensional GloVe word embeddings trained on a collection of Armenian texts from Wikipedia, news, blogs, and encyclopedia.

关键词： Encyclopedias Electronic publishing Internet Organizations Standards organizations Sports

Accelerated Methods with Compressed Communications for Distributed Optimization Problems under Data Similarity

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Bylinkin, Dmitry Beznosikov, Aleksandr Moscow Institute of Physics and Technology Russia Ivannikov Institute for System Programming of the Russian Academy of Sciences Russia Sber AI Lab Skoltech Russia

In recent years, as data and problem sizes have increased, distributed learning has become an essential tool for training highperformance models. However, the communication bottleneck, especially for high-dimensional data, is a challenge. Several techniques have been developed to overcome this problem. These include communication compression and implementation of local steps, which work particularly well when there is similarity of local data samples. In this paper, we study the synergy of these approaches for efficient distributed optimization. We propose the first theoretically grounded accelerated algorithms utilizing unbiased and biased compression under data similarity, leveraging variance reduction and error feedback frameworks. In terms of communication time our theory gives O ( 1 + h M-1/4 + ω-1/2 ip δ/μ ) complexity for unbiased compressors and O ( 1 + β1/4 √ δ/μ ) for biased ones, where M is the number of computational nodes, β is the compression power, δ is the similarity measure and μ is the parameter of strong convexity of the objective. Our theoretical results are of record and confirmed by experiments on different average losses and datasets. Copyright © 2024, The Authors. All rights reserved.

关键词： Data compression

Code Generation and Optimization for Transactional Memory Constructs in an Unmanaged Language 07

学校读者我要写书评

暂无评论

Code Generation and Optimization for Transactional Memory Co...

International Symposium on Code Generation and Optimization (CGO)

作者： Cheng Wang Wei-Yu Chen Youfeng Wu Bratin Saha Ali-Reza Adl-Tabatabai Programming System Lab Microprocessor Technology Laboratories Intel Corporation Santa Clara CA USA Computer Science Division University of California Berkeley USA

ISBN: (纸本)9780769527642

Transactional memory offers significant advantages for concurrency control compared to locks. This paper presents the design and implementation of transactional memory constructs in an unmanaged language. Unmanaged languages pose a unique set of challenges to transactional memory constructs - for example, lack of type and memory safety, use of function pointers, aliasing of local variables, and others. This paper describes novel compiler and runtime mechanisms that address these challenges and optimize the performance of transactions in an unmanaged environment. We have implemented these mechanisms in a production-quality C compiler and a high-performance software transactional memory runtime. We measure the effectiveness of these optimizations and compare the performance of lock-based versus transaction-based programming on a set of concurrent data structures and the SPLASH-2 benchmark suite. On a 16 processor SMP system, the transaction-based version of the SPLASH-2 benchmarks scales much better than the coarse-grain locking version and performs comparably to the fine-grain locking version. Compiler optimizations significantly reduce the overheads of transactional memory so that, on a single thread, the transaction-based version incurs only about 6.4% overhead compared to the lock-based version for the SPLASH-2 benchmark suite. Thus, our system is the first to demonstrate that transactions integrate well with an unmanaged language, and can perform as well as fine-grain locking while providing the programming ease of coarse-grain locking even on an unmanaged environment

关键词： Yarn Safety Optimizing compilers Application software Environmental management Runtime environment Power engineering computing Concurrent computing Java Cloning

Searching by Code: a New SearchBySnippet Dataset and SnippeR Retrieval Model for Searching by Code Snippets

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Sedykh, Ivan Abulkhanov, Dmitry Sorokin, Nikita Nikolenko, Sergey Malykh, Valentin Huawei Noah's Ark lab Russia St. Petersburg Department of the Steklov Institute of Mathematics Russia Ivannikov Institute for System Programming Russia

Code search is an important and well-studied task, but it usually means searching for code by a text query. We argue that using a code snippet (and possibly an error traceback) as a query while looking for bugfixing instructions and code samples is a natural use case not covered by prior art. Moreover, existing datasets use code comments rather than full-text descriptions as text, making them unsuitable for this use case. We present a new SearchBySnippet dataset implementing the search-by-code use case based on StackOverflow data;we show that on SearchBySnippet, existing architectures fall short of a simple BM25 baseline even after fine-tuning. We present a new single encoder model SnippeR that outperforms several strong baselines on SearchBySnippet with a result of 0.451 Recall@10;we propose the SearchBySnippet dataset and SnippeR as a new important benchmark for code search evaluation. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

Epistemic Multiagent Reasoning with Collaborative Robots 37

学校读者我要写书评

暂无评论

Epistemic Multiagent Reasoning with Collaborative Robots

37th Italian Conference on Computational Logic, CILC 2022

作者： Soldà, Davide Fabiano, Francesco Dovier, Agostino Constraint and Logic Programming Lab University of Udine Udine33100 Italy Embedding System Unit of Fondazione Bruno Kessler Trento38123 Italy Department of Mathematical Physical and Computer Sciences University of Parma Parma43124 Italy Department of Mathematics Computer Science and Physics University of Udine Udine33100 Italy

Over the last few years, the fields of Artificial Intelligence, Robotics and IoT have gained a lot of attention. This increasing interest has brought, among other things, to the development of autonomous multi-agent systems where robotic entities may interact with each other. As for all the other autonomous settings, also these systems require arbitration. Our work tries to address this problem by presenting a framework that embeds both a classical and a multi-agent epistemic (epistemic, for brevity) planner in a robotic control architecture. The idea is to combine the (i) classical and the (ii) epistemic solvers to model efficiently the interaction with: the (i) physical world and the (ii) information flows, respectively. In particular, the presented architecture starts by planning on the "epistemic level" refining then single-agent world-altering actions thanks to the classical planner. To further optimize the solving process, we also introduce the concept of macros in epistemic planning. Macros, in fact, have been successfully employed in classical planning as they allow for opportune aggregations of actions that may lead to a reduction of plans' length. Finally, the overall framework is exemplified and validated with two Franka Emika manipulators. This allowed us to empirically justify how the combination of the two planning approaches (classical and epistemic), and the introduction of macros, reduce the computational time required by the orchestrating phase. © 2022 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0)

关键词： Robot programming

Local SGD for Near-Quadratic Problems: Improving Convergence under Unconstrained Noise Conditions

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Sadchikov, Andrey Chezhegov, Savelii Beznosikov, Aleksandr Gasnikov, Alexander Moscow Institute of Physics and Technology Moscow Russia Ivannikov Institute for System Programming RAS Moscow Russia Sber AI Lab Moscow Russia Innopolis University Innopolis Russia

Distributed optimization plays an important role in modern large-scale machine learning and data processing systems by optimizing the utilization of computational resources. One of the classical and popular approaches is Local Stochastic Gradient Descent (Local SGD), characterized by multiple local updates before averaging, which is particularly useful in distributed environments to reduce communication bottlenecks and improve scalability. A typical feature of this method is the dependence on the frequency of communications. But in the case of a quadratic target function with homogeneous data distribution over all devices, the influence of frequency of communications vanishes. As a natural consequence, subsequent studies include the assumption of a Lipschitz Hessian, as this indicates the similarity of the optimized function to a quadratic one to some extent. However, in order to extend the completeness of the Local SGD theory and unlock its potential, in this paper we abandon the Lipschitz Hessian assumption by introducing a new concept of approximate quadraticity. This assumption gives a new perspective on problems that have near quadratic properties. In addition, existing theoretical analyses of Local SGD often assume bounded variance. We, in turn, consider the unbounded noise condition, which allows us to broaden the class of studied problems. Copyright © 2024, The Authors. All rights reserved.

关键词： Stochastic systems

Sinkhorn Transformations for Single-Query Postprocessing in Text-Video Retrieval

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Yakovlev, Konstantin Polyakov, Gregory Alimova, Ilseyar Podolskiy, Alexander Bout, Andrey Nikolenko, Sergey Piontkovskaya, Irina Huawei Noah’s Ark Lab Moscow Russia Ivannikov Institute for System Programming of the RAS Moscow Russia St. Petersburg Department the Steklov Institute of Mathematics St. Petersburg Russia

A recent trend in multimodal retrieval is related to postprocessing test set results via the dual-softmax loss (DSL). While this approach can bring significant improvements, it usually presumes that an entire matrix of test samples is available as DSL input. This work introduces a new postprocessing approach based on Sinkhorn transformations that outperforms DSL. Further, we propose a new postprocessing setting that does not require access to multiple test queries. We show that our approach can significantly improve the results of state of the art models such as CLIP4Clip, BLIP, X-CLIP, and DRL, thus achieving a new state-of-the-art on several standard text-video retrieval datasets both with access to the entire test set and in the single-query setting. Copyright © 2023, The Authors. All rights reserved.

关键词： Information retrieval

Design and Implementation of a QoL Improvement system for Visually Impaired Patients 5

学校读者我要写书评

暂无评论

Design and Implementation of a QoL Improvement System for Vi...

5th International Conference on Advances in Computational Tools for Engineering Applications, ACTEA 2023

作者： Abi Zeid Daou, Roy Beaino, Jad Hawat, Johnny Ibrahim, Ramy Hayek, Ali Boercsoek, Josef Olmedo, Jose Javier Serrano Université la Sagesse Faculty of Engineering Mechatronics Department Beirut Lebanon MART Learning Education and Research Center Chananir Lebanon University of Applied Science Hamm-Lippstadt Department Lippstadt 2 Hardware Engineering Hamm59063 Germany University of Kassel Faculty of Electrical Engineering/Computer Science Department of Computer Architecture and System Programming Germany Centro de Tecnología Biomédica Universidad Politécnica de Madrid Lab of Bioinstrumentation and Nanomedicine Spain

ISBN: (纸本)9798350309959

Visually impaired people encounter several challenges in their mobility and navigation. Their daily activities are obstructed due to their inability to adapt or recognize accurately their surroundings, especially outside their house which they are more familiar with. Thus, it becomes the main reason of accidents, falling off, getting lost in unknown areas, etc. Furthermore, one of the sensory systems that helps the body to process data about the external environment is the visual system. Blind people also lose touch with the outside world, develops poor motor habits, which results in postural problems as a result. This project will assist visually impaired people in their daily life and simplify normal tasks through a system combining two previously designed projects, 'Smart Shoes for Blind and Visually Impaired People', and 'Human posture monitoring device'. The multifunctional system is developed with the goal of securing safe movements for visually impaired people as well as maintaining a good back posture by detecting leaning postures (LP). The purpose of the smart shoe is to identify obstacles and protect the user from unintended accidents. A compatible Android application has been developed to alert the user when there is an obstruction or when he is walking on a wet surface. Voice alarms will be used to acoustically alert the user. If the user collapses, a message with their position will be sent right away to a relative. On the other hand, the smart vest will identify the position of the user's back and alert him to maintain a straight posture through the same application as well. As the system is dealing with human health, some safety measurements would be taken into consideration to implement a safe electrical system in order to reduce error and to increase accuracy. © 2023 IEEE.

关键词： Accidents