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...

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.

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.

Realising a higher voltage application utilising bridge topologies in CMOS Power IC CMOS technology presents integration and design issues that must be solved by careful selection of the manufacturing process architecture. In this paper, we present a solution that uses a p+/p-buffer/n-epi stack to implement a 100V RESURF N-channel LDMOS high-side compatible power transistor. The device was deve...

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...

It is well known that, given two simple n-sided polygons, it may not be possible to triangulate the two polygons in a compatible fashion, if one's choice of triangulation vertices is restricted to polygon corners. Is it always possible to produce compatible triangulations if additional vertices inside the polygon are allowed? We give a positive answer and construct a pair of such triangu-lation...

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...

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...