On some interval methods for algebraic,exponential and trigonometric polynomials

New inclusion methods for the simultaneous determination of the zeros of algebraic, exponential and trigonometric polynomials are presented. These methods are realized in real interval arithmetic and do not use any derivatives. Using Weierstrass' correction some modified methods with the increased convergence rate are constructed. Convergence analysis and numerical example are included.     

An approach to emulating separable graphs

A technique foremulating multicomputer interconnection networks that are based onseparable graphs (graphs having bounded degree and sublinear multicolor recursive bisectors) is presented. Efficient emulations among interconnection networks are necessary for porting programs designed for one network to another.Emulations are formalized asgraph embeddings, where the nodes (processors) of theguest graph (emulated network) are assigned to nodes of thehost graph (emulator), while the edges (communication links) of the guest are routed via paths in the host. The communication slowdown in an emulation depens on thedilation (length of the longest routing path) and thecongestion (number of paths that contend for a host edge) of the embedding. Theexpansion of the embedding (the ratio of the sizes of the host to guest) determines the inefficiency of processor utilization. Cell trees are introduced as interconnection networks whose special communication properties enable them to serve as intermediate devices in these emulations. Nodes in cell trees are organized into equinumerous parts calledcells; the cells are labeled by nodes of a complete binary tree. Communication in cell trees is restricted to two specific and distinct primitives:cell communication is confined within cells, whiletransfer communication occurs between adjacent cells. Rather than solved directly, the emulation problem for the original guest-host pair is decomposed into two independent parts: emulating the guest by the cell tree, and emulating the cell tree by the host.In emulations of separable graphs by cell trees, the node assignment that ensures small dilation is derived from the separator-based decomposition of guest graphs. The congestion-free edge routing is achieved by coordinatingglobal andlocal phases, which are based on two characteristic cell-tree communication primitives.The technique is instantiated by emulating cell trees on specific host graphs. Withshuffle-like hypercube-derivative networks as hosts new constant-expansion emulations are obtained that have both dilation and congestion logarithmic in the size of the multicolor bisector of guest graphs. These emulations are the first such to have optimal (up to constants)congestion; they provide the firstoptimal algorithm for emulating arbitrary separable graphs on shuffle-like networks. The application of the technique tohypercubes as hosts also produces optimal emulations that differ from those previously known by having smaller expansion constants.This research was supported in part by NSF Grants CCR-88-12567 and CCR-90-13184, and by the University of Massachusetts Graduate School Fellowship for the academic year 1991-92. A preliminary version of this paper was presented at the 3rd ACM Symposium on Parallel Algorithms and Architectures, July 22–24, 1991, in Hilton Head, South Carolina, USA.     

Scientometric analysis of the research activities of chemists from the “Rugjer Bošković” Institute (Yugoslavia), 1976–1985

The research activity of chemists from the Rugjer Bokovi Institute (RBI, Zagreb, Yugoslavia) was analyzed for the period 1976–1985, covering 2018 research years of scientific work, and 1149 SCI registered papers (0.57 publications per research year). At the average, one paper was published by 3.05 scientists. The papers were published in 235 different journals, most frequently is the nationalCroatica Chemica Acta (171 papers). The publications were divided into two groups: for the periods 1976–1980 and 1981–1985, and for each paper citations were collected in the respective time period. An average publication had 2.58 citations. Chemical papers from the second period had 2.73 citations per paper, which is 85% of the expected value, and this was considerably more than for Yugoslav papers (66%) in general. The papers were classified according to the subfields used in theJournal Citation Reports, and the results compared with the data published bySchubert, Glänzel andBraun. The distribution of citations was also analyzed.     

Challenges and opportunities of multimodal data in human learning: The computer science students' perspective

Multimodal data have the potential to explore emerging learning practices that extend human cognitive capacities. A critical issue stretching in many multimodal learning analytics (MLA) systems and studies is the current focus aimed at supporting researchers to model learner behaviours, rather than directly supporting learners. Moreover, many MLA systems are designed and deployed without learners' involvement. We argue that in order to create MLA interfaces that directly support learning, we need to gain an expanded understanding of how multimodal data can support learners' authentic needs. We present a qualitative study in which 40 computer science students were tracked in an authentic learning activity using wearable and static sensors. Our findings outline learners' curated representations about multimodal data and the non-technical challenges in using these data in their learning practice. The paper discusses 10 dimensions that can serve as guidelines for researchers and designers to create effective and ethically aware student-facing MLA innovations.     

A propositional probabilistic logic with discrete linear time for reasoning about evidence

The aim of the paper is to present a sound, strongly complete and decidable probabilistic temporal logic that can model reasoning about evidence. The formal system developed here is actually a solution of a problem proposed by Halpern and Pucella (J Artif Intell Res 26:1–34, 2006).     

A case of using the Semantic Interoperability Framework for custom orthopedic implants manufacturing

The efficiency and effectiveness of the daily practice in orthopedic surgery depend on the availability, interoperability and unique access to a wide set of information, related to the patient’s medical record and diagnosis, domain knowledge and available resources and staff. The most important of the tangible resources, needed for the therapeutic or preventive actions are orthopedic implants. In some cases, the implants may be highly complex and customized products, which need to be manufactured (assembled) on basis of the above information in a shortest possible timeframe. In this paper, the case of the custom orthopedic implants manufacturing is described from the perspective of the collaborative enterprising, with special consideration of the interoperability issues of the involved enterprise collaboration. It is shown how the previously developed Semantic Interoperability Framework can be used to improve the efficiency of the manufacturing and other relevant processes.     

Automatic recognition of gait-related health problems in the elderly using machine learning

This paper proposes a system for the early automatic recognition of health problems that manifest themselves in distinctive form of gait. Purpose of the system is to prolong the autonomous living of the elderly at home. When the system identifies a health problem, it automatically notifies a physician and provides an explanation of the automatic diagnosis. The gait of the elderly user is captured using a motion-capture system, which consists of body-worn tags and wall-mounted sensors. The positions of the tags are acquired by the sensors and the resulting time series of position coordinates are analyzed with machine-learning algorithms in order to recognize a specific health problem. Novel semantic features based on medical knowledge for training a machine-learning classifier are proposed in this paper. The classifier classifies the user’s gait into: 1) normal, 2) with hemiplegia, 3) with Parkinson’s disease, 4) with pain in the back and 5) with pain in the leg. The studies of 1) the feasibility of automatic recognition and 2) the impact of tag placement and noise level on the accuracy of the recognition of health problems are presented. The experimental results of the first study (12 tags, no noise) showed that the k-nearest neighbors and neural network algorithms achieved classification accuracies of 100%. The experimental results of the second study showed that classification accuracy of over 99% is achievable using several machine-learning algorithms and 8 or more tags with up to 15 mm standard deviation of noise. The results show that the proposed approach achieves high classification accuracy and can be used as a guide for further studies in the increasingly important area of Ambient Assisted Living. Since the system uses semantic features and an artificial-intelligence approach to interpret the health state, provides a natural explanation of the hypothesis and is embedded in the domestic environment of the elderly person; it is an example of the semantic ambient media for Ambient Assisted Living.     

Frequency dependence of the spin-fluctuation spectrum in Pd: Calculations within the finite bandwidth model

The frequency dependence of the electron-paramagnon spectrumP() in Pd is calculated within the finite bandwidth model. It is found that for an almost full band, the magnitude, the range, and the position of the peak frequency inP() are dramatically reduced compared to their values in the usual paramagnon theory. Also, we find that the frequency dependence of the spin-fluctuation contribution to the electron self-energy is strongly affected by a close proximity of the Fermi level to the top of the band. We speculate that an unusually large value of the Coulomb pseudopotential is probably partially responsible for the absence of superconductivity in Pd.     

Formation of oxide phases in the system Fe2O3−Gd2O3

The formation of oxide phases in the system (1 -x) Fe₂O₃ +xGd₂O₃ was investigated for 0 x 1. On the basis of XRD measurements the distribution of oxide phases, -Fe₂O₃, Gd₃Fe₅O₁₂, GdFeO₃ and Gd₂O₃ was determined, as a function ofx. No solid solutions were observed with certainty even at the very ends of the concentration range. This was also confirmed by⁵⁷Fe Mössbauer spectroscopy. New accurate crystallographic data for Gd₃Fe₅O₁₂ are given. The formation of oxide phases in the system Fe₂O₃- Gd₂O₃ is compared with the data for analogous system Fe₂O₃-Eu₂O₃.