نتایج جستجو برای: compatible

تعداد نتایج: 54550  

Journal: :Communications in Algebra 2018

1990
Sue-Ken Yap Michael L. Scott

PENGUIN is a grammar-based language for programming graphical user interfaces. Code for each thread of control in a multi-threaded application is confined to its own module, promoting modularity and reuse of code. Networks of PENGUIN components (each composed of an arbitrary number of modules) can be used to construct large reactive systems with parallel execution, internal protection boundarie...

2008
Anna Inn-Tung Chen Chia-Hsin Owen Chen Ming-Shing Chen Chen-Mou Cheng Bo-Yin Yang

We present instances of MPKCs (multivariate public key cryptosystems) with design, given the best attacks we know, and implement them on commodity PC hardware. We also show that they can hold their own compared to traditional alternatives. In fact, they can be up to an order of magnitude faster.

2008
Anna Inn-Tung Chen Chia-Hsin Owen Chen Ming-Shing Chen Chen-Mou Cheng Bo-Yin Yang

We present instances of MPKCs (multivariate public key cryptosystems) with design, given the best attacks we know, and implement them on commodity PC hardware. We also show that they can hold their own compared to traditional alternatives. In fact, they can be up to an order of magnitude faster.

Journal: :Differential Geometry and its Applications 2014

Journal: :Electronic Notes in Discrete Mathematics 2008

2012
Clemens Huemer Ferran Hurtado Javier Tejel

Two plane geometric graphs are said to be compatible when their union is a plane geometric graph. Let S be a set of n points in the Euclidean plane in general position and let T be any given plane geometric tree whose vertex set is S. The main problem we consider in this work consists of finding a second plane geometric tree T ′ on S, such that T ′ is compatible with T and shares with T a minim...

Journal: :The Computer Science Journal of Moldova 1995
Svetlana Cojocaru Victor Ufnarovski

The definition and main results connected with Gröbner basis, Hilbert series and Anick's resolution are formulated. The method of the infinity behavior prediction of Gröbner basis in noncommu-tative case is presented. The extensions of BERGMAN package for IBM PC compatible computers are described. Let A =< X|R > be a finitely presented associative algebra over field K. Here are the main example...

2011
Gaurav Bansal

Even though Privacy concerns (PC) and security concerns (SC) are acknowledged as separate constructs, many studies argue that they are related or, even worse, confused. Building upon the non-overlapping SC and PC dimensions, we propose Internet Users Information Transmission Security Concern (IUITSC) scale. We argue that the scale when used in conjunction with PC scale would cover the entire ga...

Journal: :CoRR 2014
M. A. A. Mashud M. R. Hossain Mustari Zaman M. A. Razzaque

The main objective of this paper is to design and develop an automatic vehicle, fully controlled by a computer system. The vehicle designed in the present work can move in a pre-determined path and work automatically without the need of any human operator and it also controlled by human operator. Such a vehicle is capable of performing wide variety of difficult tasks in space research, domestic...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید