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

2nd International Conference on Functional programming Languages and Computer Architecture, 1985

作者： Hughes, John Programming Methodology Group Department of Computer Science Chalmers University of Technology GöteborgS-412 96 Sweden

来源：评论

学校读者我要写书评

暂无评论

Approach to the modeling of systems and sites from ready resources 20

Approach to the modeling of systems and sites from ready res...

引用

20th Conference Scientific Services and Internet, SSI 2018

作者： Lavrischeva, E.M. Ryzhov, A.G. Ivannikov Institute for System Programming of the Russian Academy of Sciences Russia Moscow Institute of Physics and Technology [State University Russia

The component approach to creation of systems and sites from ready resources (components, objects, services and reuses) is considered. The approach is based on the graph and component model (CM), which includes functional, system, service and interface software resources and algebra of their processing. Functions of objects-components are described in the programming languages (PL) and their interfaces in the languages of API, IDL, WSDL, etc. They are implemented in a client–server architecture and interact with each other through the interface. The analysis of models of systems, websites and applications running in a two-tier client-server architecture are given and the modern way of development of this architecture is presented in connection with the increase in the number of users working with modern huge amounts of Big Data and Cloud Computing data. Finished resources are checked for the correctness of their specifications in the PL, and then errors information are tested and collected to correct the errors and assess their reliability. Spent resources are configured and the system is checked for functionality. Site described http://***, including ready-made resources and artifacts of software development technology, and new service-component resources (SOA, SCA, SOAP, etc.) used for modeling web-systems and sites. © 2018 CEUR-WS. All rights reserved.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Deviations in Efficiencies of Logarithmically Growing Sorting Algorithms at Infinitely Large Datasets 3

Deviations in Efficiencies of Logarithmically Growing Sortin...

引用

3rd IEEE International Virtual Conference on Innovations in Power and Advanced Computing Technologies, i-PACT 2021

作者： Mathew, D.A. Steve School of Information Technology and Engineering Vellore Institute of Technology Vellore632 014 India Programming and Data Science Indian Institute of Technology Madras Chennai600 036 India

ISBN: (纸本)9781665426916

Asymptotic Notations have been very effective in representing the efficiencies of algorithms by analyzing the number of steps and the nature of traversals and operations that the algorithm is bound to perform. Though they represent the nature of growth of the time or space consumed by the algorithms, they only consider the fastest-growing term and not the other terms. The result from this kind of analysis often seems to be fruitful in grading the algorithms based on their efficiency, but theoretically, there seem to be evident deviations when these complexities are extrapolated to larger datasets, hypothetically 'infinitely large' datasets. This deviation is tracked down when the constant and slow-growing terms involved are considered. The practical difficulty of empirically verifying this fact due to the ambiguity in defining a very large number of inputs is overcome by theoretically calculating the ratio between the time complexities of algorithms of interest and applying their limit to be infinity. In this study, the algorithms heapsort and merge sort are analyzed and the drastic deviation between them is shown mathematically though they both have the complexity of $n(log(n))$, concluding that the merge sort is actually twice as fast as heap sort when approaching infinitely large data elements. © 2021 IEEE.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

Satisfiability and validity problems in many-sorted composition-nominative pure predicate logics

Satisfiability and validity problems in many-sorted composit...

引用

8th International Conference on ICT in Education, Research, and Industrial Applications, ICTERI 2012

作者： Nikitchenko, Mykola S. Tymofieiev, Valentyn G. Department of Theory and Technology of Programming Taras Shevchenko National University of Kyiv 64 Volodymyrska Street 01601 Kyiv Ukraine

ISBN: (纸本)9783642357367

We propose methods for solving the satisfiability and validity problems in many-sorted composition-nominative pure predicate logics (without functions and with equality). These logics are algebra-based logics of many-sorted partial predicates constructed in a semantic-syntactic style on the methodological basis that is common with programming;they can be considered as generalizations of traditional many-sorted logics on classes of partial predicates that do not have fixed arity. We show the reduction of the satisfiability problem to the same problem for many-sorted classical first-order pure predicate logic with equality. As validity is dual to satisfiability, the method proposed can be adopted to the validity problem. This enables us to use existent satisfiability and validity checking procedures developed for classical logic also for solving these problems in composition-nominative pure predicate logics with equality. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Satisfiability problems in quasiary program logics 8

Satisfiability problems in quasiary program logics

引用

8th International Conference Advanced Computer Information Technologies, ACIT 2018

作者： Nikitchenko, Mykola Shkilniak, Stepan Tymofieiev, Valentyn Department of Theory and Technology of Programming Taras Shevchenko National University of Kyiv 60 Volodymyrska Street City of Kyiv01033 Ukraine

ISBN: (纸本)9789666544899

In the paper we present special program specification algebras and logics defined for classes of quasiary mappings. Informally speaking, such mappings are partial mappings defined over partial states (partial assignments) of variables. Conventional n-ary mappings can be considered as a special case of quasiary mappings. Such mappings better reflect properties of software systems. We describe methods of reducibility of the satisfiability problem in quasiary logics to the satisfiability problem in logics of n-ary mappings. The methods proposed can be useful for software verification. Copyright © 2018 for the individual papers by the papers'authors.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Nested mixin-methods in Agora 7th

引用

7th European Conference on Object-Oriented programming, ECOOP 1993

作者： Steyaert, Patrick Codenie, Wim D’Hondt, Theo De Hondt, Koen Lucas, Carine Van Limberghen, Marc Programming Technology Lab Computer Science Department Vrije Universiteit Brussel Pieinlaan 2 BrusselsB-1050 Belgium

ISBN: (纸本)9783540571209

Mixin-based inheritance is an inheritance technique that has been shown to subsume a variety of different inheritance mechanisms. It is based directly upon an incremental modification model of inheritance. This paper addresses the question of how mixins can be seen as named attributes of classes the same way that objects, methods, and also classes in their own right, are seen as named attributes of classes. The general idea is to let a class itself have control over how it is extended. This results in a powerful abstraction mechanism to control the construction of inheritance hierarchies in two ways. Firstly, by being able to constrain the inheritance hierarchy;secondly, by being able to extend a class in a way that is specific for that class. Nested mixins are a direct consequence of having mixins as attributes. The scope rules for nested mixins are discussed, and shown to preserve the encapsulation of objects. © Springer-Verlag Berlin Heidelberg 1993.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Supporting process development in Bio-jETI by model checking and synthesis

Supporting process development in Bio-jETI by model checking...

引用

Workshop on Semantic Web Applications and Tools for Life Sciences, SWAT4LS 2008

作者： Lamprecht, Anna-Lena Margaria, Tiziana Steffen, Bernhard Programming Systems Dortmund University of Technology 44227 Dortmund Germany Service and Software Engineering Potsdam University 14482 Potsdam Germany

Bio-jETI is a platform for the intuitive graphical design and execution of bioinformatics workows composed from heterogeneous remote services. In this paper we use a simple phylogenetic analysis process to show how formal approaches like model checking and process synthesis can be applied to further support the workow development in Bio-jETI. To unfold their full potential these methods need a comprehensive knowledge base about the domain, containing semantic information about the single services as well as ontological classifications of the used terms. We outline how to systematically integrate these semantic web concepts into our framework and discuss the implications on checking and synthesis.

关键词： Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

McRT-malloc - A scalable transactional memory allocator 06

McRT-malloc - A scalable transactional memory allocator

引用

ISMM 2006 - 2006 International Symposium on Memory Management

作者： Hudson, Richard L. Saha, Bratin Adl-Tabatabai, Ali-Reza Hertzberg, Benjamin C. Programming System Lab Microprocessor Technology Lab Intel Corporation Computer Architecture Lab Stanford University Palo Alto CA

ISBN: (纸本)1595932216

Emerging multi-core processors promise to provide an exponentially increasing number of hardware threads with every generation. Applications will need to be highly concurrent to fully use the power of these processors. To enable maximum concurrency, libraries (such as malloc-free packages) would therefore need to use non-blocking algorithms. But lock-free algorithms are notoriously difficult to reason about and inappropriate for average programmers. Transactional memory promises to significantly ease concurrent programming for the average programmer. This paper describes a highly efficient non-blocking malloc/free algorithm that supports memory allocation and deallocation inside transactional code blocks. Thus this paper describes a memory allocator 1 that is suitable for emerging multicore applications, while supporting modem concurrency constructs. This paper makes several novel contributions. It is the first to integrate a software transactional memory system with a malloc/free based memory allocator. We present the first algorithm which ensures that space allocated in an aborted transaction is properly freed and does not lead to a space blowup. Unlike previous lock-free malloc packages, our algorithm avoids atomic operations on typical code paths, making our algorithm substantially more efficient. Copyright © 2006 ACM.

关键词： Storage allocation (computer)

来源：评论

学校读者我要写书评

暂无评论

A New Method for Research of Grown-In Microdefects in Dislocation-Free Silicon Single Crystals

引用

Journal of Crystallization Process and technology 2011年第2期1卷 13-17页

作者： V.I Talanin I.E Talanin N.Ph Ustimenko Department of Programming & Information Technology Classic Private University

As a virtual experimental device for analysis and calculation of grown-in microdefects formation in undoped silicon dislocation-free single crystals the software is proposed. The software is built on the basis on diffusion model of formation, growth and coalescence of grown-in microdefects. Diffusion model describes kinetics of defect structure changes during cooling after growth on crystallization temperature to room temperature. The software allows the use of personal computer to investigate the defect structure of dislocation-free silicon single crystals with a diameter on 30 mm to 400 mm grown by floating-zone and Czochralski methods.

关键词： Silicon Grown-In Microdefects Precipitate Vacancy Microvoid Interstitial Dislocation Loop

来源：评论

学校读者我要写书评

暂无评论

Make social networks clean again: Graph embedding and stacking classifiers for bot detection

Make social networks clean again: Graph embedding and stacki...

引用

2018 Conference on Information and Knowledge Management Workshops, CIKM 2018

作者： Skorniakov, Kirill Turdakov, Denis Zhabotinsky, Andrey Ivannikov Institute for System Programming Russian Academy of Sciences Moscow Institute of Physics and Technology State University Moscow Russia Ivannikov Institute for System Programming Russian Academy of Sciences National Research University Higher School of Economics Moscow Russia Ivannikov Institute for System Programming Russian Academy of Sciences Lomonosov Moscow State University Moscow Russia

The paper introduces a novel approach to the detection of social bots using ensembling of classifiers. We also studied the impact of different feature sets and demonstrated the power of graph embedding which is underused by the existing methods. The main contribution of this work is a creating of a stacking based ensemble, which effectively exploits text and graph features. Empirical evaluation proved the effectiveness of the proposed method for bots detection and showed improvement in comparison to existing solutions by 4-9 points of AUC. Copyright © CIKM 2018.

关键词： Knowledge management

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：