scholarly journals Degenerate Elastic Networks

2020 ◽  
Author(s):  
Giacomo Del Nin ◽  
Alessandra Pluda ◽  
Marco Pozzetta
Keyword(s):  
Linear Combination ◽  
Explicit Representation ◽  
Elastic Networks ◽  
The Given ◽  
Equivalent Description ◽  
Relaxed Problem

Abstract We minimize a linear combination of the length and the $$L^2$$ L 2 -norm of the curvature among networks in $$\mathbb {R}^d$$ R d belonging to a given class determined by the number of curves, the order of the junctions, and the angles between curves at the junctions. Since this class lacks compactness, we characterize the set of limits of sequences of networks bounded in energy, providing an explicit representation of the relaxed problem. This is expressed in terms of the new notion of degenerate elastic networks that, rather surprisingly, involves only the properties of the given class, without reference to the curvature. In the case of $$d=2$$ d = 2 we also give an equivalent description of degenerate elastic networks by means of a combinatorial definition easy to validate by a finite algorithm. Moreover we provide examples, counterexamples, and additional results that motivate our study and show the sharpness of our characterization.

scholarly journals Old and New Identities for Bernoulli Polynomials via Fourier Series

2012 ◽  
Vol 2012 ◽  
pp. 1-14 ◽  
Author(s):  
Luis M. Navas ◽  
Francisco J. Ruiz ◽  
Juan L. Varona
Keyword(s):  
Fourier Series ◽  
Linear Combination ◽  
Legendre Polynomials ◽  
Fourier Coefficients ◽  
Bernoulli Polynomials ◽  
Bernoulli Numbers ◽  
Gegenbauer Polynomials ◽  
Linear Combinations ◽  
The Given

The Bernoulli polynomialsBkrestricted to[0,1)and extended by periodicity haventh sine and cosine Fourier coefficients of the formCk/nk. In general, the Fourier coefficients of any polynomial restricted to[0,1)are linear combinations of terms of the form1/nk. If we can make this linear combination explicit for a specific family of polynomials, then by uniqueness of Fourier series, we get a relation between the given family and the Bernoulli polynomials. Using this idea, we give new and simpler proofs of some known identities involving Bernoulli, Euler, and Legendre polynomials. The method can also be applied to certain families of Gegenbauer polynomials. As a result, we obtain new identities for Bernoulli polynomials and Bernoulli numbers.

Constrained Control of a Rational Interpolant

2011 ◽  
Vol 225-226 ◽  
pp. 170-173
Author(s):  
Meng Tian ◽  
Hong Ling Geng
Keyword(s):  
Numerical Experiments ◽  
Spline Interpolation ◽  
Cubic Spline ◽  
Explicit Representation ◽  
Constrained Control ◽  
Data Set ◽  
Cubic Spline Interpolation ◽  
The Given

In this paper, a rational cubic spline interpolation has been constructed using the rational cubic spline with quadratic denominator and the rational cubic spline based on function values. The spline can preserve monotonicity of the data set. The spline not only belongs to in the interpolating interval, but could also be used to constrain the shape of the interpolant curve such as to force it to be the given region. The explicit representation is easily constructed, and numerical experiments indicate that the method produces visually pleasing curves.

scholarly journals Hypersurface Family with a Common Isoasymptotic Curve

Geometry ◽  
2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Ergin Bayram ◽  
Emin Kasap
Keyword(s):  
Linear Combination ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Frenet Frame ◽  
Necessary And Sufficient ◽  
The Given

We handle the problem of finding a hypersurface family from a given asymptotic curve in R4. Using the Frenet frame of the given asymptotic curve, we express the hypersurface as a linear combination of this frame and analyze the necessary and sufficient conditions for that curve to be asymptotic. We illustrate this method by presenting some examples.

scholarly journals Bernoulli’s Problem for the Infinity-Laplacian Near a Set with Positive Reach

Symmetry ◽  
2019 ◽  
Vol 11 (4) ◽  
pp. 472
Author(s):  
Antonio Greco
Keyword(s):  
Existence And Uniqueness ◽  
Uniqueness Result ◽  
Explicit Representation ◽  
Infinity Laplacian ◽  
Positive Reach ◽  
Interior Problem ◽  
Bernoulli Problem ◽  
The Laplace Operator ◽  
The Given ◽  
Usual Problem

We consider the exterior as well as the interior free-boundary Bernoulli problem associated with the infinity-Laplacian under a non-autonomous boundary condition. Recall that the Bernoulli problem involves two domains: one is given, the other is unknown. Concerning the exterior problem we assume that the given domain has a positive reach, and prove an existence and uniqueness result together with an explicit representation of the solution. Concerning the interior problem, we obtain a similar result under the assumption that the complement of the given domain has a positive reach. In particular, for the interior problem we show that uniqueness holds in contrast to the usual problem associated to the Laplace operator.

scholarly journals On the denseness of Jacobi polynomials

2004 ◽  
Vol 2004 (28) ◽  
pp. 1455-1462 ◽  
Author(s):  
Sarjoo Prasad Yadav
Keyword(s):  
Linear Combination ◽  
Banach Spaces ◽  
Jacobi Polynomials ◽  
Explicit Representation ◽  
Alpha Beta

LetXrepresent either a spaceC[−1,1]orLα,βp(w),1≤p<∞, of functions on[−1,1]. It is well known thatXare Banach spaces under the sup and thep-norms, respectively. We prove that there exist the best possible normalized Banach subspacesXα,βkofXsuch that the system of Jacobi polynomials is densely spread on these, or, in other words, eachf∈Xα,βkcan be represented by a linear combination of Jacobi polynomials to any degree of accuracy. Explicit representation forf∈Xα,βkhas been given.

Finding Topic Experts in the Twitter Dataset Using LDA Algorithm

2019 ◽  
Vol 10 (2) ◽  
pp. 19-26
Author(s):  
Ashwini Anandrao Shirolkar ◽  
R. J. Deshmukh
Keyword(s):  
Social Media ◽  
Linear Combination ◽  
Tacit Knowledge ◽  
Probabilistic Method ◽  
Expert Judgment ◽  
Expert Finding ◽  
Different Types ◽  
New Type ◽  
The Given ◽  
Short Messages

In microblogging services like Twitter, the expert judgment problem has gained increasing attention in social media. Twitter is a new type of social media that provides a publicly available way for users to publish 140-character short messages (tweets). However, previous methods cannot be directly applied to twitter experts finding problems. They generally rely on the assumption that all the documents associated with the candidate experts contain tacit knowledge related to the expertise of individuals. Whereas it might not be directly associated with their expertise, i.e., who is not an expert, but may publish/re-tweet a substantial number of tweets containing the topic words. Recently, several attempts use the relations among users and twitter list for expert finding. Nevertheless, these strategies only partially utilize such relations. To address these issues a probabilistic method is developed to jointly exploit three types of relations (i.e., follower relation, user-list relation and list-list relation) for finding experts. LDA algorithms are used for finding topic experts. LDA is based upon the concept of searching for a linear combination of variables (predictors) that best separates two classes (targets). Semi-supervised graph-based ranking approach (SSGR) to offline calculate the global authority of users. Then, the local relevance between users and the given query is computed. Then, the rank of all the users is found and the top-N users with the highest-ranking scores. Therefore, the proposed approach can jointly exploit the different types of relations among users and lists for improving the accuracy of finding experts on a given topic on Twitter.

Personal Problem Solving of Partners in Divorce Proceedings

2015 ◽  
Vol 36 (1) ◽  
pp. 82-103 ◽  
Author(s):  
Tereza Soukupova ◽  
Petr Goldmann
Keyword(s):  
Gender Differences ◽  
Problem Solving ◽  
Thematic Apperception Test ◽  
Scoring Systems ◽  
Personal Control ◽  
Personality Characteristics ◽  
Personal Problem ◽  
Thematic Apperception ◽  
And Gender ◽  
The Given

Abstract. The Thematic Apperception Test is one of the most frequently administered apperceptive techniques. Formal scoring systems are helpful in evaluating story responses. TAT stories, made by 20 males and 20 females in the situation of legal divorce proceedings, were coded for detection and comparison of their personal problem solving ability. The evaluating instrument utilized was the Personal Problem Solving System-Revised (PPSS-R) as developed by G. F. Ronan. The results indicate that in relation to card 1, men more often than women saw the cause of the problem as removable. With card 6GF, women were more motivated to resolve the given problem than were men, women had a higher personal control and their stories contained more optimism compared to men’s stories. In relation to card 6BM women, more often than men, used emotions generated from the problem to orient themselves within the problem. With card 13MF, the men’s level of stress was less compared to that of the women, and men were more able to plan within the context of problem-solving. Significant differences in the examined groups were found in those cards which depicted significant gender and parental potentials. The TAT can be used to help identify personality characteristics and gender differences.

Pattern Recognition in Histo-Pathology: Basic Considerations

1982 ◽  
Vol 21 (01) ◽  
pp. 15-22 ◽  
Author(s):  
W. Schlegel ◽  
K. Kayser
Keyword(s):  
Pattern Recognition ◽  
Graph Theory ◽  
Normal Tissue ◽  
Diagnostic Procedures ◽  
Minimal Distance ◽  
Malignant Growth ◽  
Colon Tissue ◽  
First Results ◽  
Tissue Structures ◽  
The Given

A basic concept for the automatic diagnosis of histo-pathological specimen is presented. The algorithm is based on tissue structures of the original organ. Low power magnification was used to inspect the specimens. The form of the given tissue structures, e. g. diameter, distance, shape factor and number of neighbours, is measured. Graph theory is applied by using the center of structures as vertices and the shortest connection of neighbours as edges. The algorithm leads to two independent sets of parameters which can be used for diagnostic procedures. First results with colon tissue show significant differences between normal tissue, benign and malignant growth. Polyps form glands that are twice as wide as normal and carcinomatous tissue. Carcinomas can be separated by the minimal distance of the glands formed. First results of pattern recognition using graph theory are discussed.

Coordinating Medical Literature with Patient Care

1977 ◽  
Vol 16 (04) ◽  
pp. 234-240 ◽  
Author(s):  
Joann Gustafson ◽  
J. Nelson ◽  
Ann Buller
Keyword(s):  
Health Care ◽  
Medical Staff ◽  
Medical Information ◽  
Medical Literature ◽  
Medical Information System ◽  
Staff Members ◽  
Information Displays ◽  
Medical Displays ◽  
Computerized Medical Information ◽  
The Given

The contribution of a special library project to a computerized problem-oriented medical information system (PROMIS) is discussed. Medical information displays developed by the PROMIS medical staff are accessible to the health care provider via touch screen cathode terminals. Under PROMIS, members of the library project developed two information services, one concerned with the initial building of the medical displays and the other with the updating of this information. Information from 88 medical journals is disseminated to physicians involved in the building of the medical displays. Articles meeting predetermined selection criteria are abstracted and the abstracts are made available by direct selective dissemination or via a problem-oriented abstract file. The updating service involves comparing the information contained in the selected articles with the computerized medical displays on the given topic. Discrepancies are brought to the attention of PROMIS medical staff members who evaluate the information and make appropriate changes in the displays. Thus a feedback loop is maintained which assures the completeness, accuracy, and currency of the computerized medical information. The development of this library project and its interface with the computerized health care system thus attempts to deal with the problems in the generation, validation, dissemination, and application of medical literature.

Identification and Transformation of Terminal Morphemes in Medical English

1969 ◽  
Vol 8 (02) ◽  
pp. 84-90 ◽  
Author(s):  
A. W. Pratt ◽  
M. Pacak
Keyword(s):  
Word Form ◽  
Subsequent Transformation ◽  
Part Of Speech ◽  
Morphological Segmentation ◽  
Medical English ◽  
Nominal Form ◽  
Admissible Path ◽  
Near Future ◽  
The Given ◽  
Admissible Sequences

The system for the identification and subsequent transformation of terminal morphemes in medical English is a part of the information system for processing pathology data which was developed at the National Institutes of Health.The recognition and transformation of terminal morphemes is restricted to classes of adjectivals including the -ING and -ED forms, nominals and homographic adjective/noun forms.The adjective-to-noun and noun-to-noun transforms consist basically of a set of substitutions of adjectival and certain nominal suffixes by a set of suffixes which indicate the corresponding nominal form(s).The adjectival/nominal suffix has a polymorphosyntactic transformational function if it has the property of being transformed into more than one nominalizing suffix (e.g., the adjectival suffix -IC can be substituted by a set of nominalizing suffixes -Ø, -A, -E, -Y, -IS, -IA, -ICS): the adjectival suffix has a monomorphosyntactic transformational property if there is only one admissible transform (e.g., -CIC → -X).The morphological segmentation and the subsequent transformations are based on the following principles:a. The word form is segmented according to the principle of »double consonant cut,« i.e., terminal characters following the last set of double consonants are analyzed and treated as a potential suffix. For practical purposes only such terminal suffixes of a maximum length of four have been analyzed.b. The principle that the largest segment of a word form common to both adjective and noun or to both noun stems is retained as a word base for transformational operations, and the non-identical segment is considered to be a »suffix.«The backward right-to-left character search is initiated by the identification of the terminal grapheme of the given word form and is extended to certain admissible sequences of immediately preceding graphemes.The nodes which represent fixed sequences of graphemes are labeled according to their recognition and/or transformation properties.The tree nodes are divided into two groups:a. productive or activatedb. non-productive or non-activatedThe productive (activated) nodes are sequences of sets of graphemes which possess certain properties, such as the indication about part-of-speech class membership, the transformation properties, or both. The non-productive (non-activated) nodes have the function of connectors, i.e., they specify the admissible path to the productive nodes.The computer program for the identification and transformation of the terminal morphemes is open-ended and is already operational. It will be extended to other sub-fields of medicine in the near future.

Sign in / Sign up

Export Citation Format

Share Document