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

International Multiconference of Engineers and Computer Scientists

作者： Verna, Didier EPITA Res & Dev Lab F-94276 Le Kremlin Bicetre France

ISBN: (纸本)9789889867140

Implementing binary methods in traditional object-oriented languages is difficult: numerous problems arise, such as typing (covariance vs. contravariance of the arguments), polymorphism on multiple arguments (lack of multi-methods) etc. The purpose of this paper is to demonstrate how those problems are either solved, or nonexistent in the Common Lisp Object System (Clos). Several solutions for implementing binary methods in Clos are proposed. They mainly consist in re-programming a binary method specific object system through the Clos meta-object protocol (mop).

关键词： binary methods common lisp clos meta-object protocol

来源：评论

学校读者我要写书评

暂无评论

Coalgebraic Description of Generalized binary methods

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2006年第3期135卷 73-84页

作者： Honsell, Furio Lenisa, Marina Redamalla, Rekha Univ Udine DIMI Udine Italy BM Birla Sci Ctr Hyderabad Andhra Pradesh India

We extend the Reichel-Jacobs coalgebraic account of specification and refinement of objects and classes in Object Oriented Programming to (generalized) binary methods. These are methods that take more than one parameter of a class type. Class types include sums and (possibly infinite) products type constructors. We study and compare two solutions for modeling generalized binary methods, which use purely covariant functors. In the first solution, which applies when we already have a class implementation, we reduce the behaviour of a generalized binary method to that of a bunch of unary methods. These are obtained by freezing the types of the extra class parameters to constant types. The bisimulation behavioural equivalence induced on objects by this model amounts to the greatest congruence w.r.t method application. Alternatively, we treat binary methods as graphs instead of functions, thus turning contravariant occurrences in the functor into covariant ones.

关键词： OO-programming binary methods Coalgebraic semantics

来源：评论

学校读者我要写书评

暂无评论

Improving DBSCAN's execution time by using a pruning technique on bit vectors

引用

PATTERN RECOGNITION LETTERS 2011年第13期32卷 1572-1580页

作者： Mimaroglu, Selim Aksehirli, Emin Bahcesehir Univ Dept Comp Engn TR-34353 Istanbul Turkey

Clustering is the process of assigning a set of physical or abstract objects into previously unknown groups. The goal of clustering is to group similar objects into the same clusters and dissimilar objects into different clusters. Similarities between objects are evaluated by using the attribute values of objects. There are many clustering algorithms in the literature;among them, DBSCAN is a well known density-based clustering algorithm. We improve DBSCAN's execution time performance for binary data sets and Hamming distances. We achieve considerable speed gains by using a novel pruning technique, as well as bit vectors, and binary operations. Our novel method effectively discards distant neighbors of an object and computes only the distances between an object and its possible neighbors. By discarding distant neighbors, we avoid unnecessary distance computations and use less CPU time when compared with the conventional DBSCAN algorithm. However, the accuracy of our method is identical to that of the original DBSCAN. Experimental test results on real and synthetic data sets demonstrate that, by using our pruning technique, we obtain considerably faster execution time results compared to DBSCAN. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Clustering DBSCAN binary methods Pruning

来源：评论

学校读者我要写书评

暂无评论

Pipelined computation of scalar multiplication in elliptic curve cryptosystems (extended version)

引用

IEEE TRANSACTIONS ON COMPUTERS 2006年第8期55卷 1000-1010页

作者： Mishra, Pradeep Kumar Univ Calgary CISaC Calgary AB T2N 1N4 Canada

In the current work, we propose a pipelining scheme for implementing Elliptic Curve Cryptosystems (ECC). The scalar multiplication is the dominant operation in ECC. It is computed by a series of point additions and doublings. The pipelining scheme is based on a key observation: To start the subsequent operation, one need not wait until the current one exits. The next operation can begin while a part of the current operation is still being processed. To our knowledge, this is the first attempt to compute the scalar multiplication in such a pipelined manner. Also, the proposed scheme can be made resistant to sidechannel attacks (SCA). Our scheme compares favorably with all SCA-resistant sequential and parallel methods.

关键词： Elliptic Curve Cryptosystems ECC EC-operations pipelining scalar multiplication comb methods binary methods Jacobian coordinates sidechannel attacks sidechannel atomicity

来源：评论

学校读者我要写书评

暂无评论

Type-safe-covariant specialization with generalized matching

引用

INFORMATION AND COMPUTATION 2002年第1期177卷 90-120页

作者： Rinat, R Hebrew Univ Jerusalem Inst Comp Sci IL-91905 Jerusalem Israel

Matching is a relation between object types originally designed to support type-safe subclassing with binary methods. In this paper we generalize it to deal with general covariance by allowing field and method parameter types to change covariantly in matching types. In addition, object types may explicitly contain virtual types which can also change covariantly. The result is a significant increase in the flexibility of subclassing. The new definition is accompanied by appropriate machinery, allowing the loss of subsumption to be compensated by match-bounded parameterization and hash types. We define a language LGM supporting generalized matching, its typing rules, and its operational semantics and establish a subject reduction theorem showing the soundness of the system. (C) 2002 Elsevier Science (USA).

关键词： static type-checking matching covariance subclassing binary methods hash types

来源：评论

学校读者我要写书评

暂无评论

Exploring the protein-protein interaction landscape in plants

引用

PLANT CELL AND ENVIRONMENT 2019年第2期42卷 387-409页

作者： Struk, Sylwia Jacobs, Anse Sanchez Martin-Fontecha, Elena Gevaert, Kris Cubas, Pilar Goormachtig, Sofie Univ Ghent Dept Plant Biotechnol & Bioinformat Ghent Belgium VIB Ctr Plant Syst Biol Ghent Belgium Univ Ghent Dept Biochem Ghent Belgium VIB Ctr Med Biotechnol Ghent Belgium Campus Univ Autonoma Madrid Ctr Nacl Biotecnol CSIC Plant Mol Genet Dept Madrid Spain

Protein-protein interactions (PPIs) represent an essential aspect of plant systems biology. Identification of key protein players and their interaction networks provide crucial insights into the regulation of plant developmental processes and into interactions of plants with their environment. Despite the great advance in the methods for the discovery and validation of PPIs, still several challenges remain. First, the PPI networks are usually highly dynamic, and the in vivo interactions are often transient and difficult to detect. Therefore, the properties of the PPIs under study need to be considered to select the most suitable technique, because each has its own advantages and limitations. Second, besides knowledge on the interacting partners of a protein of interest, characteristics of the interaction, such as the spatial or temporal dynamics, are highly important. Hence, multiple approaches have to be combined to obtain a comprehensive view on the PPI network present in a cell. Here, we present the progress in commonly used methods to detect and validate PPIs in plants with a special emphasis on the PPI features assessed in each approach and how they were or can be used for the study of plant interactions with their environment.

关键词： protein-protein interaction techniques plant interactome signal transduction pathway plant-environment interactions co-complex purification binary methods

来源：评论

学校读者我要写书评

暂无评论

Matching MyType to subtyping

引用

SCIENCE OF COMPUTER PROGRAMMING 2013年第7期78卷 933-952页

作者： Saito, Chieri Igarashi, Atsushi Kyoto Univ Kyoto 6068501 Japan

The notion of MyType has been proposed to promote type-safe reuse of binary methods and recently extended to mutually recursive definitions. It is well known, however, that MyType does not match with subtyping well. In current type systems, type safety is guaranteed at the expense of subtyping, and hence dynamic dispatch. In this article, we propose two mechanisms, namely, nonheritable methods and exact statements to remedy the mismatch between MyType and subtyping. We rigorously prove their safety by modeling them in a small calculus. (C) 2013 Elsevier B.V. All rights reserved.

关键词： binary methods Dynamic dispatch Exact types MyType Subtyping

来源：评论

学校读者我要写书评

暂无评论

Self Type Constructors 09

Self Type Constructors

引用

24th Annual ACM Conference on Object-Oriented Programming, Systems, Languages and Applications

作者： Saito, Chieri Igarashi, Atsushi Kyoto Univ Grad Sch Informat Kyoto 6068501 Japan

ISBN: (纸本)9781605587349

Bruce and Foster proposed the language LOOJ, an extension of Java with the notion of MyType, which represents the type of a self reference and changes its meaning along with inheritance My Type is useful to write extensible yet type-safe classes for objects with recursive interfaces, that is, ones with methods that take or return objects of the same type as the receiver Although LOOJ has also generics, MyType has been introduced as a feature rather orthogonal to generics. As a result, LOOJ cannot express an Interface that refers to the same generic class recursively but with different type arguments. This is a significant limitation because such an interface naturally arises in practice. for example, in a generic collection class with method map(), which converts a collection to the same kind of collection of a different element type. Altherr and Cremet and Moors, Piessens, and Oder-sky cave solutions to this problem but they used a highly sophisticated combination of advanced mechanisms such as abstract type members, higher-order type constructors, and F-bounded polymorphism. In this paper, we give another solution by introducing self type constructors, which integrate MyType and generics so that MyType can take type arguments in a generic class Self type constructors are tailored to writing recursive interfaces more concicely than previous solutions We demonstrate the expressive power of self type constructors by means of examples, formalize a core language with self type constructors, and prove its type safety

关键词： binary methods generics MyType type constructor polymorphism

来源：评论

学校读者我要写书评

暂无评论

JavaGI: The Interaction of Type Classes with Interfaces and Inheritance

引用

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS 2011年第4期33卷 12-12页

作者： Wehr, Stefan Thiemann, Peter Factis Res GmbH D-79100 Freiburg Germany Univ Freiburg D-79110 Freiburg Germany

The language JavaGI extends Java 1.5 conservatively by a generalized interface mechanism. The generalization subsumes retroactive and type-conditional interface implementations, binary methods, symmetric multiple dispatch, interfaces over families of types, and static interface methods. These features make certain coding patterns redundant, increase the expressiveness of the type system, and permit solutions to extension and integration problems with components in binary form, for which previously several unrelated extensions had been suggested. This article explains JavaGI and motivates its design. Moreover, it formalizes a core calculus for JavaGI and proves type soundness, decidability of typechecking, and determinacy of evaluation. The article also presents the implementation of a JavaGI compiler and an accompanying run-time system. The compiler, based on the Eclipse Compiler for Java, offers mostly modular static typechecking and fully modular code generation. It defers certain well-formedness checks until load time to increase flexibility and to enable full support for dynamic loading. Benchmarks show that the code generated by the compiler offers good performance. Several case studies demonstrate the practical utility of the language and its implementation.

关键词： Design Languages Theory JavaGI Java generalized interfaces retroactive interface implementations external methods open classes multimethods multiple dispatch type conditionals multiheaded interfaces explicit implementing types binary methods static interfacemethods implementation constraints constraint entailment subtyping formalization implementation case studies benchmarks

来源：评论

学校读者我要写书评

暂无评论

Multiple dispatch as dispatch on tuples

引用

ACM SIGPLAN NOTICES 1998年第10期33卷 374-387页

作者： Leavens, GT Millstein, TD Iowa State Univ Dept Comp Sci Ames IA 50011 USA Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA

Many popular object-oriented programming languages, such as C++, Smalltalk-80, Java, and Eiffel, do not support multiple dispatch. Yet without multiple dispatch, programmers find it difficult to express binary methods and design patterns such as the "visitor" pattern. We describe a new, simple, and orthogonal way to add multimethods to single-dispatch object-oriented languages, without affecting existing code. The new mechanism also clarifies many differences between single and multiple dispatch.

关键词： multiple dispatch multimethods generic functions typing single dispatch binary methods semantics language design Tuple

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：