A class of algorithms for automatic evaluation of certain elementary functions in a binary computer.

"Supported in part...under Grant No. US NSF GJ812 and Grant No. US NSF GJ813."

On some Generalizations of a Class of Discrete Functions

In this paper we examine discrete functions that depend on their variables in a particular way, namely the H-functions. The results obtained in this work make the “construction” of these functions possible. H-functions are generalized, as well as their matrix representation by Latin hypercubes.

A Recession Notion for a Class of Monotone Bivariate Functions

Using monotone bifunctions, we introduce a recession concept for general equilibrium problems relying on a variational convergence notion. The interesting purpose is to extend some results of P. L. Lions on variational problems. In the process we generalize some results by H. Brezis and H. Attouch relative to the convergence of the resolvents associated with maximal monotone operators.

Alternative Characterization of the Class k-UCV and Related Classes of Univalent Functions

In this paper an alternative characterization of the class of functions called k -uniformly convex is found. Various relations concerning connections with other classes of univalent functions are given. Moreover a new class of univalent functions, analogous to the ’Mocanu class’ of functions, is introduced. Some results concerning this class are derived.

On Two Saigo’s Fractional Integral Operators in the Class of Univalent Functions

2000 Mathematics Subject Classification: Primary 26A33, 30C45; Secondary 33A35

Applications of the Owa-Srivastava Operator to the Class of K-Uniformly Convex Functions

2000 Mathematics Subject Classification: Primary 30C45, 26A33; Secondary 33C15

Some Notes about a Class of Univalent Functions with Negative Coefficients

MSC 2010: 30C45, 30C50

Note on Radius Problems for Certain Class of Analytic Functions

MSC 2010: 30C45

On a Class of Univalent Functions with Negative Coefficients

Донка Пашкулева - Предмет на тази статия е получаването на точни оценки за коефициентите и ръста на функциите за някои класове еднолистни функции с отрицателни коефициенти.

On Connection between Characterestic Functions and the Caratheodori Class Functions

2000 Mathematics Subject Classification: 47A65, 45S78.

Design of experiments for bivariate binary responses modelled by Copula functions

Optimal design for generalized linear models has primarily focused on univariate data. Often experiments are performed that have multiple dependent responses described by regression type models, and it is of interest and of value to design the experiment for all these responses. This requires a multivariate distribution underlying a pre-chosen model for the data. Here, we consider the design of experiments for bivariate binary data which are dependent. We explore Copula functions which provide a rich and flexible class of structures to derive joint distributions for bivariate binary data. We present methods for deriving optimal experimental designs for dependent bivariate binary data using Copulas, and demonstrate that, by including the dependence between responses in the design process, more efficient parameter estimates are obtained than by the usual practice of simply designing for a single variable only. Further, we investigate the robustness of designs with respect to initial parameter estimates and Copula function, and also show the performance of compound criteria within this bivariate binary setting.

Planar difference functions

In 1980 Alltop produced a family of cubic phase sequences that nearly meet the Welch bound for maximum non-peak correlation magnitude. This family of sequences were shown by Wooters and Fields to be useful for quantum state tomography. Alltop’s construction used a function that is not planar, but whose difference function is planar. In this paper we show that Alltop type functions cannot exist in fields of characteristic 3 and that for a known class of planar functions, x^3 is the only Alltop type function.

Functional encryption for threshold functions (or fuzzy IBE) from lattices

Cryptosystems based on the hardness of lattice problems have recently acquired much importance due to their average-case to worst-case equivalence, their conjectured resistance to quantum cryptanalysis, their ease of implementation and increasing practicality, and, lately, their promising potential as a platform for constructing advanced functionalities. In this work, we construct “Fuzzy” Identity Based Encryption from the hardness of the Learning With Errors (LWE) problem. We note that for our parameters, the underlying lattice problems (such as gapSVP or SIVP) are assumed to be hard to approximate within supexponential factors for adversaries running in subexponential time. We give CPA and CCA secure variants of our construction, for small and large universes of attributes. All our constructions are secure against selective-identity attacks in the standard model. Our construction is made possible by observing certain special properties that secret sharing schemes need to satisfy in order to be useful for Fuzzy IBE. We also discuss some obstacles towards realizing lattice-based attribute-based encryption (ABE).

Causal behavioural profiles : efficient computation, applications, and evaluation

Analysis of behavioural consistency is an important aspect of software engineering. In process and service management, consistency verification of behavioural models has manifold applications. For instance, a business process model used as system specification and a corresponding workflow model used as implementation have to be consistent. Another example would be the analysis to what degree a process log of executed business operations is consistent with the corresponding normative process model. Typically, existing notions of behaviour equivalence, such as bisimulation and trace equivalence, are applied as consistency notions. Still, these notions are exponential in computation and yield a Boolean result. In many cases, however, a quantification of behavioural deviation is needed along with concepts to isolate the source of deviation. In this article, we propose causal behavioural profiles as the basis for a consistency notion. These profiles capture essential behavioural information, such as order, exclusiveness, and causality between pairs of activities of a process model. Consistency based on these profiles is weaker than trace equivalence, but can be computed efficiently for a broad class of models. In this article, we introduce techniques for the computation of causal behavioural profiles using structural decomposition techniques for sound free-choice workflow systems if unstructured net fragments are acyclic or can be traced back to S- or T-nets. We also elaborate on the findings of applying our technique to three industry model collections.

Total energy shaping of a class of underactuated Port-Hamiltonian Systems using a new set of closed-loop potential shape variables

This paper proposes a method for designing set-point regulation controllers for a class of underactuated mechanical systems in Port-Hamiltonian System (PHS) form. A new set of potential shape variables in closed loop is proposed, which can replace the set of open loop shape variables-the configuration variables that appear in the kinetic energy. With this choice, the closed-loop potential energy contains free functions of the new variables. By expressing the regulation objective in terms of these new potential shape variables, the desired equilibrium can be assigned and there is freedom to reshape the potential energy to achieve performance whilst maintaining the PHS form in closed loop. This complements contemporary results in the literature, which preserve the open-loop shape variables. As a case study, we consider a robotic manipulator mounted on a flexible base and compensate for the motion of the base while positioning the end effector with respect to the ground reference. We compare the proposed control strategy with special cases that correspond to other energy shaping strategies previously proposed in the literature.