Informatica

An optimization problem is formulated in the tropical mathematics setting to maximize a nonlinear objective function defined by conjugate transposition on vectors in a semimodule over a general idempotent semifield. The study is motivated by problems from project scheduling, where the deviation between completion times of activities is to be maximized subject to precedence constraints. To solve the unconstrained problem, we establish an upper bound for the function, and then obtain a complete solution to a system of vector equations to find all vectors that yield the bound. An extension of the solution to handle constrained problems is discussed. The results are applied to give direct solutions to the motivational problems, and illustrated with numerical examples.

Phoneme duration modelling is one of the stages in prosody modelling for text-to-speech systems. The rule-based phoneme duration model proposed by Klatt (1979) is still quite a popular method. One of the main shortcomings of this method is that the values of the parameters are selected in an experimental way. This work proposes a new iterative algorithm for the automatic estimation of the factors for the Klatt model using the corpus of an annotated audio record of the speaker. The phoneme duration models were built for three different Lithuanian speakers. The quality of the estimation of phonemes durations was evaluated by the root mean square error, the mean absolute error and the correlation coefficient.

Certificateless short signature (CLSS) possesses the advantages of both certificateless signature and short signature. CLSS eliminates the certificate management in conventional signatures and solves the key escrow problem in ID-based signatures. In the meantime, due to its short signature length, CLSS reduces the bandwidth for communication so that it is suitable for some specific authentication applications requiring bandwidth-constrained communication environments. However, up to now, there is no work on studying the revocation problem in existing CLSS schemes. In this article, we address the revocation problem and propose the first revocable certificateless short signature (RCLSS) scheme. Based on the computational Diffie–Hellman (CDH) assumption, we demonstrate that our RCLSS scheme possesses strong unforgeability against adaptive chosen-message attacks under an accredited security model. It turns out that our scheme has the shortest signature length while retaining computational efficiency. Thus, the proposed RCLSS scheme is well suited for low-bandwidth communication environments. Finally, we combine the proposed RCLSS scheme with cloud revocation authority (CRA) to present a CRA-aided authentication scheme with period-limited privileges for mobile multi-server environment.

This paper presents a model for signal compression, which consists of a piecewise uniform quantizer and a new lossless coder. The model is designed in a general manner, i.e. for any symmetrical signal distribution; this general theory is applied to design models for Gaussian and Laplacian distributions. Rigorous mathematical derivation of the expression for the bit-rate is presented. Forward adaptation of the model is done for non-stationary signals. Theory is proved by simulations in MATLAB and by an experiment with a real speech signal. The most important advantages of the model are low complexity and good performances – it satisfies G.712 standard for the speech transmission quality with 6.18 bps (bits per sample), which is significantly smaller than 8 bps required for quantizers used in PSTN (public switched telephone network) defined with G.711 standard.

This paper investigates in a formal context some fundamental controllability properties “from” and “to” the origin of probabilistic discrete-time dynamic systems as well as their uniform versions and complete controllability in a class of probabilistic metric spaces or probabilistic normed spaces, in particular, in probabilistic Menger spaces. Some related approximate probabilistic controllability properties are also investigated for the case when a nominal controllable system is subject to either parametrical perturbations or unmodelled dynamics. In this context, the approximate controllability of a perturbed system is a robustness-type approximate controllability provided that the nominal system is controllable. Some illustrative examples are also given.

Wireless Mesh Networks (WMNs) have become an important networking infrastructure due to their low cost for providing broadband connectivity. Issues for achieving the network connectivity and user coverage are related to the node placement problem. Several optimization problems are showing their usefulness to the efficient design of WMNs. These problems are related to optimizing network connectivity, user coverage and stability. In this paper, we formulate the optimization problems using a multi-objective optimization model. For the mesh router nodes placement, the bi-objective optimization problem is obtained consisting in the maximization of the size of the giant component in the mesh routers network (for measuring network connectivity) and that of user coverage. We evaluate the performance of WMN-GA system for node placement problem in WMNs. For evaluation, we consider Normal, Exponential and Weibull Distribution of mesh clients and different selection and mutation operators. The population size is considered 64 and the number of generation 200. The simulation results show that WMN-GA system performs better for Single Mutation, Linear Ranking selection and Normal distribution of mesh clients.

This paper improves an infra-chromatic bound which is used by the exact branch-and-bound maximum clique solver BBMCX (San Segundo et al., 2015) as an upper bound on the clique number for every subproblem. The infra-chromatic bound looks for triplets of colour subsets which cannot contain a 3-clique. As a result, it is tighter than the bound obtained by widely used approximate-colouring algorithms because it can be lower than the chromatic number. The reported results show that our algorithm with the new bound significantly outperforms the state-of-the-art algorithms in a number of structured and uniform random graphs.

A new heuristic algorithm for solution of bi-objective discrete competitive facility location problems is developed and experimentally investigated by solving different instances of a facility location problem for firm expansion. The proposed algorithm is based on ranking of candidate locations for the new facilities, where rank values are dynamically adjusted with respect to behaviour of the algorithm. Results of the experimental investigation show that the proposed algorithm is suitable for the latter facility location problems and provides good results in sense of accuracy of the approximation of the true Pareto front.

We propose a new hybrid approach to solve the unbounded integer knapsack problem (UKP), where valid inequalities are generated based on intermediate solutions of an equivalent forward dynamic programming formulation. These inequalities help tighten the initial LP relaxation of the UKP, and therefore improve the overall computational efficiency. We also extended this approach to solve the multi-dimensional unbounded knapsack problem (d-UKP). Computational results demonstrate the effectiveness of our approach on both problems.

In this paper, we propose a novel trust inference framework in the web-based scenarios which are assumed to have a Web of Trust pre-established, and take the contexts of the trust relationships into account when inferring the recommendation trust. For alleviating the problem of sparse matrix in the Web of Trust, we also incorporate the users’ profile and relationship information on the associated social networks into the framework. Based on the Web of Trust established in the discussed web-based scenario (i.e. epinions.com in this paper), and the social relationship information in the associated social networks, the users are classified into four classes. Then different information is used to infer the users’ recommendation trust value based on the classifications. The simulation experiments show that our approach has good coverage of inferred trust values, and the accurate rate of the predicted trust relationship is higher than the traditional PCC (Pearson Correlation Co-efficiency). According to the computation results of adjusted parameters, it can be concluded that the threshold which is used to filter the inferred trust values can be removed, i.e. all the inferred trust values should be kept.