A set expression based inheritance system

This paper describes a new formalism for inheritance systems, based on the formal semantics of set expressions. Using the formalism, it is possible to define new semantic classes by arbitrary set expressions operating on previously defined classes. Thus generalizing bothIS-A links andIS-NOT-A links and adding the set intersection operation. We present an efficient algorithm which follows these definitions to deduce the properties implied by the inheritance network, i.e., the properties of the classes containing a given element. The application which motivated the development of the formalism, namely semantic disambiguation of natural language, is also described.     

Truthful Approximation Mechanisms for Scheduling Selfish Related Machines

We consider the problem of scheduling jobs on related machines owned by selfish agents. We provide a 5-approximation deterministic truthful mechanism, the first deterministic truthful result for the problem. Previously, Archer and Tardos showed a 2-approximation randomized mechanism which is truthful in expectation only (a weaker notion of truthfulness). In case the number of machines is constant, we provide a deterministic Fully Polynomial-Time Approximation Scheme (FPTAS) and a suitable payment scheme that yields a truthful mechanism for the problem. This result, which is based on converting FPTAS to monotone FPTAS, improves a previous result of Auletta et al., who showed a (4 + ε)-approximation truthful mechanism.     

Efficient Solution of A, x ( k )?= b ( k ) Using A ?1

In this work, we consider the problem of solving , , where b ^(k+1) = f(x ^(k)). We show that when A is a full matrix and , where depends on the specific software and hardware setup, it is faster to solve for by explicitly evaluating the inverse matrix A ⁻¹ rather than through the LU decomposition of A. We also show that the forward error is comparable in both methods, regardless of the condition number of A.     

Graph extension with constant connectivity

In the field of the scaling-up of communication networks, numbers of communication stations (nodes) and the corresponding communication links (edges) are increasing rapidly. The reliability of the networks then becomes important. To keep the reliability of the networks, the connectivity (invulnerability) of the networks should not decrease. In this article, a method of increasing the nodes of a graph with a constant connectivity is proposed, and some examples of graph extension are shown to realize the extended networks. This work was presented in part at the 11th International Symposium on Artificial Life and Robotics, Oita, Japan, January 23–25, 2006     

S-states of helium-like ions

A simple Mathematica (version 7) code for computing S-state energies and wave functions of two-electron (helium-like) ions is presented. The elegant technique derived from the classical papers of Pekeris (1958, 1959, 1962, 1965, 1971) [1], [2] and [3] is applied. The basis functions are composed of the Laguerre functions. The method is based on the perimetric coordinates and specific properties of the Laguerre polynomials. Direct solution of the generalized eigenvalues and eigenvectors problem is used, distinct from the Pekeris works. No special subroutines were used, only built-in objects supported by Mathematica. The accuracy of the results and computation times depend on the basis size. The ground state and the lowest triplet state energies can be computed with a precision of 12 and 14 significant figures, respectively. The accuracy of the higher excited states calculations is slightly worse. The resultant wave functions have a simple analytical form, that enables calculation of expectation values for arbitrary physical operators without any difficulties. Only three natural parameters are required in the input.The above Mathematica code is simpler than the earlier version (Liverts and Barnea, 2010 [4]). At the same time, it is faster and more accurate.

Program summary

Program title: TwoElAtomSL(SH)Catalogue identifier: AEHY_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEHY_v1_0.htmlProgram obtainable from: CPC Program Library, Queen?s University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 11 434No. of bytes in distributed program, including test data, etc.: 540 063Distribution format: tar.gzProgramming language: Mathematica 7.0Computer: Any PCOperating system: Any which supports Mathematica; tested under Microsoft Windows XP and Linux SUSE 11.0RAM:?¹⁰⁹ bytesClassification: 2.1, 2.2, 2.7, 2.9Nature of problem: The Schrödinger equation for atoms (ions) with more than one electron has not been solved analytically. Approximate methods must be applied in order to obtain the wave functions or another physical attributes from quantum mechanical calculations.Solution method: The S-wave function is expanded into a triple set of basis functions which are composed of the exponentials combined with the Laguerre polynomials in the perimetric coordinates. Using specific properties of the Laguerre polynomials, solution of the two-electron Schrödinger equation reduces to solving the generalized eigenvalues and eigenvector problem for the proper Hamiltonian. The unknown exponential parameter is determined by means of minimization of the corresponding eigenvalue (energy).Restrictions: First, the too large length of expansion (basis size) takes the too large computation time and operative memory giving no perceptible improvement in accuracy. Second, the number of shells Ω in the wave function expansion enables one to calculate the excited nS-states up to n=Ω+1 inclusive.Running time: 2–60 minutes (depends on basis size and computer speed).     

Regularizing Flows over Lie Groups

In this paper we discuss regularization of images that take their value in matrix Lie groups. We describe an image as a section in a principal bundle which is a fibre bundle where the fiber (the feature space) is a Lie group. Via the scalar product on the Lie algebra, we define a bi-invariant metric on the Lie-group manifold. Thus, the fiber becomes a Riemannian manifold with respect to this metric. The induced metric from the principal bundle to the image manifold is obtained by means of the bi-invariant metric. A functional over the space of sections, i.e., the image manifolds, is defined. The resulting equations of motion generate a flow which evolves the sections in the spatial-Lie-group manifold. We suggest two different approaches to treat this functional and the corresponding PDEs. In the first approach we derive a set of coupled PDEs for the local coordinates of the Lie-group manifold. In the second approach a coordinate-free framework is proposed where the PDE is defined directly with respect to the Lie-group elements. This is a parameterization-free method. The differences between these two methods are discussed. We exemplify this framework on the well-known orientation diffusion problem, namely, the unit-circle S ¹ which is identified with the group of rotations in two dimensions, SO(2). Regularization of the group of rotations in 3D and 4D, SO(3) and SO(4), respectively, is demonstrated as well.

Examining Factors Influencing the Disruptiveness of Notifications in a Mobile Museum Context

Ubiquitous computing environments continuously infer our context and proactively offer us context aware services and information, suggested by notifications on our mobile devices. However, notifications come with a cost. They may interrupt the user in the current task and be annoying in the wrong context. The challenge becomes how to notify the user about the availability of relevant services while minimizing the level of disruptiveness. Thus, an understanding of what affects the subjective perception of the disruptiveness of the notification is needed. As yet, most of the research on disruptiveness of notifications focused on stationary, task-oriented environments. In this study, we examine the effect of notifications in a special leisure scenario—a museum visit. In two user studies conducted in a museum setting, participants used a context-aware mobile museum guide to receive information on various museum exhibits while periodically receiving notifications. We examined how the user’s activity, the modality of the notification, and the message content affected the perceived level of disruption that the notifications created. We discuss our results in light of existing work in the desktop and mobile domains and provide a framework and recommendations for designing notifications for a mobile museum guide system.     

Expanding the Repertoire of Low-Molecular-Weight Pentafluorosulfanyl-Substituted Scaffolds

The pentafluorosulfanyl (-SF₅) functional group is of increasing interest as a bioisostere in medicinal chemistry. A library of SF₅-containing compounds, including amide, isoxazole, and oxindole derivatives, was synthesised using a range of solution-based and solventless methods, including microwave and ball-mill techniques. The library was tested against targets including human dihydroorotate dehydrogenase (HDHODH). A subsequent focused approach led to synthesis of analogues of the clinically used disease modifying anti-rheumatic drugs (DMARDs), Teriflunomide and Leflunomide, considered for potential COVID-19 use, where SF₅ bioisostere deployment led to improved inhibition of HDHODH compared with the parent drugs. The results demonstrate the utility of the SF₅ group in medicinal chemistry.     

SensPro-Radar:适用于L2/L2+级及更高级别汽车雷达的整体架构平台

我们现在仍在等待全自动驾驶汽车的出现,但同时也意识到,目前的形势发展已远超原始预期.汽车产业价值链目前已经领先一步进入B计划,从采用传统ADAS方案的SAE 2级自动驾驶汽车积极进阶到如今称为L2+级的自动驾驶汽车.这是一个大好机会,原始设备制造商(OEM)与一级制造供应商(Tier 1)可以抓住此次机会,投资研发采用...