Algorithm for Constructing an Analog of Plan’s Formula

We present an algorithm for constructing an analog of Plan’s formula, which is essential in obtaining a functional relation to the classical Riemann zeta-function. The algorithm is implemented in the Maple computer algebra system.     

Approaches to Solve the Problem of Determining the Moments of the Beginning and End of an Object’s Movement Using the Data of a Strapdown Inertial Navigation System

Journal of Computer and Systems Sciences International - The problem of autonomous determination using primary and/or secondary data of a strapdown inertial navigation system of two events is...     

Proposal of an Index for the Operator’s Haptic Sensation in a Master-Slave System with Force-Feedback Function

This article proposes an index to estimate the operator’s haptic sensation of the contact between the slave device and the environment in operating master–slave systems with force feedback function. The index value is derived from the velocity information of the master device before and after contact, which is hypothesized to represent the intensity of haptic sensation stimuli presented to the operator. Two characteristics of this index are discussed by means of psychophysics experiment, which are the statistical characteristics of the index value for different operators, and how the change in the operator’s haptic sensation is reflected on the index value. The index is validated by another psychophysics experiment. The experimental results show that the performance of operator’s haptic sensation can be predicted correctly based on the proposed index value. This index is expected to be applied in the parameter design of bilateral-control systems with force feedback function.     

Equiparadoxicality of Yablo’s Paradox and the Liar

It is proved that Yablo’s paradox and the Liar paradox are equiparadoxical, in the sense that their paradoxicality is based upon exactly the same circularity condition—for any frame ${\mathcal{K}}$ , the following are equivalent: (1) Yablo’s sequence leads to a paradox in ${\mathcal{K}}$ ; (2) the Liar sentence leads to a paradox in ${\mathcal{K}}$ ; (3) ${\mathcal{K}}$ contains odd cycles. This result does not conflict with Yablo’s claim that his sequence is non-self-referential. Rather, it gives Yablo’s paradox a new significance: his construction contributes a method by which we can eliminate the self-reference of a paradox without changing its circularity condition.     

An Asymptotic Preserving Method for Linear Systems of Balance Laws Based on Galerkin’s Method

We apply the concept of asymptotic preserving schemes (SIAM J Sci Comput 21:441–454, 1999) to the linearized \(p\) -system and discretize the resulting elliptic equation using standard continuous Finite Elements instead of Finite Differences. The fully discrete method is analyzed with respect to consistency, and we compare it numerically with more traditional methods such as Implicit Euler’s method.     

On the Hopcroft’s minimization technique for DFA and DFCA

We show that the absolute worst case time complexity for Hopcroft’s minimization algorithm applied to unary languages is reached only for deterministic automata or cover automata following the structure of the de Bruijn words. A previous paper by Berstel and Carton gave the example of de Bruijn words as a language that requires $O(nlogn)$ steps in the case of deterministic automata by carefully choosing the splitting sets and processing these sets in a FIFO mode for the list of the splitting sets in the algorithm. We refine the previous result by showing that the Berstel/Carton example is actually the absolute worst case time complexity in the case of unary languages for deterministic automata. We show that the same result is valid also for the case of cover automata and an algorithm based on the Hopcroft’s method used for minimization of cover automata. We also show that a LIFO implementation for the splitting list will not achieve the same absolute worst time complexity for the case of unary languages both in the case of regular deterministic finite automata or in the case of the deterministic finite cover automata as defined by S. Yu.     

Valiant’s model and the cost of computing integers

Let (n) be the minimum number of arithmetic operations required to build the integer from the constants 1 and 2. A sequence x_n is said to be easy to compute if there exists a polynomial p such that for all It is natural to conjecture that sequences such as or n! are not easy to compute. In this paper we show that a proof of this conjecture for the first sequence would imply a superpolynomial lower bound for the arithmetic circuit size of the permanent polynomial. For the second sequence, a proof would imply a superpolynomial lower bound for the permanent or P PSPACE.     

The Interplay Between the Speaker’s and the Hearer’s Perspective

The neutralization of contrasts in form or meaning that is sometimes observed in language production and comprehension is at odds with the classical view that language is a systematic one-to-one pairing of forms and meanings. This special issue is concerned with patterns of forms and meanings in language. The papers in this special issue arose from a series of workshops that were organized to explore variants of bidirectional Optimality Theory and Game Theory as models of the interplay between the speaker’s and the hearer’s perspective.     

Some local Poincaré inequalities for the composition of the sharp maximal operator and the Green’s operator

In this paper, we establish the local Poincaré-type inequalities for the composition of the sharp maximal operator and the Green’s operator with an Orlicz norm.     

Efficient and Accurate Computation of Electric Field Dyadic Green’s Function in Layered Media

Concise and explicit formulas for dyadic Green’s functions, representing the electric and magnetic fields due to a dipole source placed in layered media, are derived in this paper. First, the electric and magnetic fields in the spectral domain for the half space are expressed using Fresnel reflection and transmission coefficients. Each component of electric field in the spectral domain constitutes the spectral Green’s function in layered media. The Green’s function in the spatial domain is then recovered involving Sommerfeld integrals for each component in the spectral domain. By using Bessel identities, the number of Sommerfeld integrals are reduced, resulting in much simpler and more efficient formulas for numerical implementation compared with previous results. This approach is extended to the three-layer Green’s function. In addition, the singular part of the Green’s function is naturally separated out so that integral equation methods developed for free space Green’s functions can be used with minimal modification. Numerical results are included to show efficiency and accuracy of the derived formulas.     

A dual-branch model for diagnosis of Parkinson’s disease based on the independent and joint features of the left and right gait

Applied Intelligence - Clinical diagnosis of Parkingson’s disease (PD) requires the physician to assess the patient’s gait and other symptoms. A dual-branch model is proposed in this...     

A Closed-Form Formula for the RBF-Based Approximation of the Laplace–Beltrami Operator

In this paper we present a method that uses radial basis functions to approximate the Laplace–Beltrami operator that allows to solve numerically diffusion (and reaction–diffusion) equations on smooth, closed surfaces embedded in \(\mathbb {R}^3\). The novelty of the method is in a closed-form formula for the Laplace–Beltrami operator derived in the paper, which involve the normal vector and the curvature at a set of points on the surface of interest. An advantage of the proposed method is that it does not rely on the explicit knowledge of the surface, which can be simply defined by a set of scattered nodes. In that case, the surface is represented by a level set function from which we can compute the needed normal vectors and the curvature. The formula for the Laplace–Beltrami operator is exact for radial basis functions and it also depends on the first and second derivatives of these functions at the scattered nodes that define the surface. We analyze the converge of the method and we present numerical simulations that show its performance. We include an application that arises in cardiology.     

Generalization of the Firm’s Profit Maximization Problem: An Algorithm for the Analytical and Nonsmooth Solution

In this paper we present a generalization of the classic Firm’s profit maximization problem, using the linear model for the production function, considering a non constant price and maximum constraints for the inputs. We formulate the problem by previously calculating the analytical minimum cost function. This minimum cost function will be calculated for each production level via the infimal convolution of quadratic functions and the result will be a piecewise quadratic function. To solve this family of optimization problems, we present an algorithm of quasi-linear complexity. Moreover, the resulting cost function in certain cases is not $C^{1}$ and the profit maximization problem will be solved within the framework of nonsmooth analysis. Finally, we present a numerical example.     

On the performance of Dijkstra’s third self-stabilizing algorithm for mutual exclusion and related algorithms

In Dijkstra (Commun ACM 17(11):643–644, 1974) introduced the notion of self-stabilizing algorithms and presented three such algorithms for the problem of mutual exclusion on a ring of n processors. The third algorithm is the most interesting of these three but is rather non intuitive. In Dijkstra (Distrib Comput 1:5–6, 1986) a proof of its correctness was presented, but the question of determining its worst case complexity—that is, providing an upper bound on the number of moves of this algorithm until it stabilizes—remained open. In this paper we solve this question and prove an upper bound of 3\frac1318 n² + O(n){3\frac{13}{18} n^2 + O(n)} for the complexity of this algorithm. We also show a lower bound of 1\frac56 n² - O(n){1\frac{5}{6} n^2 - O(n)} for the worst case complexity. For computing the upper bound, we use two techniques: potential functions and amortized analysis. We also present a new-three state self-stabilizing algorithm for mutual exclusion and show a tight bound of \frac56 n² + O(n){\frac{5}{6} n^2 + O(n)} for the worst case complexity of this algorithm. In Beauquier and Debas (Proceedings of the second workshop on self-stabilizing systems, pp 17.1–17.13, 1995) presented a similar three-state algorithm, with an upper bound of 5\frac34n²+O(n){5\frac{3}{4}n^2+O(n)} and a lower bound of \frac18n²-O(n){\frac{1}{8}n^2-O(n)} for its stabilization time. For this algorithm we prove an upper bound of 1\frac12n² + O(n){1\frac{1}{2}n^2 + O(n)} and show a lower bound of n ²−O(n). As far as the worst case performance is considered, the algorithm in Beauquier and Debas (Proceedings of the second workshop on self-stabilizing systems, pp 17.1–17.13, 1995) is better than the one in Dijkstra (Commun ACM 17(11):643–644, 1974) and our algorithm is better than both.     

Justification for the Use of Cohen’s Kappa Statistic in Experimental Studies of NLP and Text Mining

Modern metrics for evaluating agreement coefficients between the experimental results and expert opinion are compared, and the possibility of using these metrics in experimental research in automatic text processing by machine learning methods is assessed. The choice of Cohen’s kappa coefficient as a measure of expert opinion agreement in the NLP and Text Mining problems is justified. An example of using Cohen’s kappa coefficient for evaluating the level of agreement between the opinion of an expert and the results of ML classification and the measure of agreement of expert opinions in the alignment of sentences of the Kazakh-Russian parallel corpus is given. Based on this analysis, it is proved that Cohen’s kappa coefficient is one of the best statistical methods for determining the level of agreement in experimental studies due to its ease of use, computing simplicity, and high accuracy of the results.

     

E-recruiting and fairness: the applicant’s point of view

More and more companies currently recruit online, partly because of cost savings and competitive pressure, and partly because it is the best way to reach their target group of applicants. In our study, applicants’ perceptions of procedural fairness were examined in e-recruiting contexts. Using an adapted form of the Social Process Questionnaire on Selection, we found that 1,373 participants’ expectations regarding fairness were mediocre and always lower than the perceived importance of five procedural fairness aspects. Based on an experimental manipulation, we showed that feedback was particularly important in online application procedures, whereas participation had smaller effects. Furthermore, participants tend to rate procedural fairness for offline application procedures as fairer than for online procedures although they reported generally positive experiences with online applications in the past. Based on our results, we discuss practical implications and limitations.