Log in

Relevant bibliographies by topics / Closest string problem / Journal articles

Journal articles on the topic 'Closest string problem'

To see the other types of publications on this topic, follow the link: Closest string problem.

Author: Grafiati

Published: 10 December 2022

Last updated: 28 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Closest string problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Chen, Zhi-Zhong, Bin Ma, and Lusheng Wang. "A three-string approach to the closest string problem." Journal of Computer and System Sciences 78, no. 1 (January 2012): 164–78. http://dx.doi.org/10.1016/j.jcss.2011.01.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Mousavi, Sayyed Rasoul. "A hybrid metaheuristic for Closest String Problem." International Journal of Computational Biology and Drug Design 4, no. 3 (2011): 245. http://dx.doi.org/10.1504/ijcbdd.2011.041413.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kelsey, Tom, and Lars Kotthoff. "Exact Closest String as a Constraint Satisfaction Problem." Procedia Computer Science 4 (2011): 1062–71. http://dx.doi.org/10.1016/j.procs.2011.04.113.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Yuasa, Shota, Zhi-Zhong Chen, Bin Ma, and Lusheng Wang. "Designing and implementing algorithms for the closest string problem." Theoretical Computer Science 786 (September 2019): 32–43. http://dx.doi.org/10.1016/j.tcs.2018.05.017.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Chen, Zhi-Zhong, Bin Ma, and Lusheng Wang. "Randomized Fixed-Parameter Algorithms for the Closest String Problem." Algorithmica 74, no. 1 (October 28, 2014): 466–84. http://dx.doi.org/10.1007/s00453-014-9952-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Gomes, Fernando C., Cláudio N. Meneses, Panos M. Pardalos, and Gerardo Valdisio R. Viana. "A parallel multistart algorithm for the closest string problem." Computers & Operations Research 35, no. 11 (November 2008): 3636–43. http://dx.doi.org/10.1016/j.cor.2007.04.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Liu, Xiaolan, Shenghan Liu, Zhifeng Hao, and Holger Mauch. "Exact algorithm and heuristic for the Closest String Problem." Computers & Operations Research 38, no. 11 (November 2011): 1513–20. http://dx.doi.org/10.1016/j.cor.2011.01.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Della Croce, F., and F. Salassa. "Improved LP-based algorithms for the closest string problem." Computers & Operations Research 39, no. 3 (March 2012): 746–49. http://dx.doi.org/10.1016/j.cor.2011.06.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Della Croce, Federico, and Michele Garraffa. "The Selective Fixing Algorithm for the closest string problem." Computers & Operations Research 41 (January 2014): 24–30. http://dx.doi.org/10.1016/j.cor.2013.07.017.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Hermelin, Danny, and Liat Rozenberg. "Parameterized complexity analysis for the Closest String with Wildcards problem." Theoretical Computer Science 600 (October 2015): 11–18. http://dx.doi.org/10.1016/j.tcs.2015.06.043.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Meneses, Cláudio N., Zhaosong Lu, Carlos A. S. Oliveira, and Panos M. Pardalos. "Optimal Solutions for the Closest-String Problem via Integer Programming." INFORMS Journal on Computing 16, no. 4 (November 2004): 419–29. http://dx.doi.org/10.1287/ijoc.1040.0090.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Pappalardo, Elisa, Domenico Cantone, and Panos M. Pardalos. "A combinedgreedy-walkheuristic and simulated annealing approach for the closest string problem." Optimization Methods and Software 29, no. 4 (October 2013): 673–702. http://dx.doi.org/10.1080/10556788.2013.833616.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Tanaka, Shunji. "A heuristic algorithm based on Lagrangian relaxation for the closest string problem." Computers & Operations Research 39, no. 3 (March 2012): 709–17. http://dx.doi.org/10.1016/j.cor.2011.06.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Hankin, Robin K. S. "Light Inextensible Strings (Thread) Under Tension in the Schwarzschild Geometry." Physics Educator 03, no. 02 (June 2021): 2150005. http://dx.doi.org/10.1142/s2661339521500050.

Full text

Abstract:

Light inextensible string under tension is a stalwart feature of elementary physics. Here I show how considering such a string in the vicinity of a black hole, with the help of computer algebra systems, can generate insight into the Schwarzschild geometry in the context of an undergraduate homework problem. Light taut strings minimize their proper length, given by integrating the spatial component of the Schwarzschild metric along the string. The path itself is given by straightforward numerical solution to the Euler–Lagrange equations. If the string is entirely outside the event horizon, its closest approach to the singularity is tangential. At this point the string is visibly curved, surely a memorable and informative insight. The geometry of the Schwarzschild metric induces some interesting nonlocal phenomena: if the distance of closest approach is less than about [Formula: see text], the string self-intersects, even though it is everywhere under tension. Light taut strings furnish a third interpretation of the concept “straight line”, the other two being null geodesics and free-fall world lines. All the software used is available under the GPL.1

APA, Harvard, Vancouver, ISO, and other styles

15

Sutton, Andrew M. "Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String Problem." Algorithmica 83, no. 4 (February 15, 2021): 1138–63. http://dx.doi.org/10.1007/s00453-021-00809-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Mousavi, Sayyed Rasoul, and Navid Nasr Esfahani. "A GRASP algorithm for the Closest String Problem using a probability-based heuristic." Computers & Operations Research 39, no. 2 (February 2012): 238–48. http://dx.doi.org/10.1016/j.cor.2011.02.025.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Arbib, Claudio, Mara Servilio, and Paolo Ventura. "An improved integer linear programming formulation for the closest 0-1 string problem." Computers & Operations Research 80 (April 2017): 94–100. http://dx.doi.org/10.1016/j.cor.2016.11.019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Li, Ming, Bin Ma, and Lusheng Wang. "On the closest string and substring problems." Journal of the ACM 49, no. 2 (March 2002): 157–71. http://dx.doi.org/10.1145/506147.506150.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Butnaru, Andrei-Mădălin. "Machine learning applied in natural language processing." ACM SIGIR Forum 54, no. 1 (June 2020): 1–3. http://dx.doi.org/10.1145/3451964.3451979.

Full text

Abstract:

Machine Learning is present in our lives now more than ever. One of the most researched areas in machine learning is focused on creating systems that are able to understand natural language. Natural language processing is a broad domain, having a vast number of applications with a significant impact in society. In our current era, we rely on tools that can ease our lives. We can search through thousands of documents to find something that we need, but this can take a lot of time. Having a system that can understand a simple query and return only relevant documents is more efficient. Although current approaches are well capable of understanding natural language, there is still space for improvement. This thesis studies multiple natural language processing tasks, presenting approaches on applications such as information retrieval, polarity detection, dialect identification [Butnaru and Ionescu, 2018], automatic essay scoring [Cozma et al., 2018], and methods that can help other systems to understand documents better. Part of the described approaches from this thesis are employing kernel methods, especially string kernels. A method based on string kernels that can determine in what dialect a document is written is presented in this thesis. The approach is treating texts at the character level, extracting features in the form of p -grams of characters, and combining several kernels, including presence bits kernel and intersection kernel. Kernel methods are also presented as a solution for defining the complexity of a specific word. By combining multiple low-level features and high-level semantic features, the approach can find if a non-native speaker of a language can see a word as complicated or not. With one focus on string kernels, this thesis proposes two transductive methods that can improve the results obtained by employing string kernels. One approach suggests using the pairwise string kernel similarities between samples from the training and test sets as features. The other method defines a simple self-training algorithm composed of two iterations. As usual, a classifier is trained over the training data, then is it used to predict the labels of the test samples. In the second iteration, the algorithm adds a predefined number of test samples to the training set for another round of training. These two transductive methods work by adapting the learning method to the test set. A novel cross-dialectal corpus is shown in this thesis. The Moldavian versus Romanian Corpus (MOROCO) [Butnaru and Ionescu, 2019a] contains over 30.000 samples collected from the news domain, split across six categories. Several studies can be employed over this corpus such as binary classification between Romanian and Moldavian samples, intra-dialect multi-class categorization by topic, and cross-dialect multi-class classification by topic. Two baseline approaches are presented for this collection of texts. One method is based on a simple string kernel model. The second approach consists of a character-level deep neural network, which includes several Squeeze-and-Excitation Blocks (SE-blocks). As known at this moment, this is the first time when a SE-block is employed in a natural language processing context. This thesis also presents a method for German Dialect Identification composed on a voting scheme that combines a Character-level Convolutional Neural Network, a Long Short-Term Memory Network, and a model based on String Kernels. Word sense disambiguation is still one of the challenges of the NLP domain. In this context, this thesis tackles this challenge and presents a novel disambiguation algorithm, known as ShowtgunWSD [Butnaru and Ionescu, 2019b]. By treating the global disambiguation problem as multiple local disambiguation problems, ShotgunWSD is capable of determining the sense of the words in an unsupervised and deterministic way, using WordNet as a resource. For this method to work, three functions that can compute the similarity between two words senses are defined. The disambiguation algorithm works as follows. The document is split into multiple windows of words of a specific size for each window. After that, a brute-force algorithm that computes every combination of senses for each word within that window is employed. For every window combination, a score is calculated using one of the three similarity functions. The last step merges the windows using a prefix and suffix matching to form more significant and relevant windows. In the end, the formed windows are ranked by the length and score, and the top ones, based on a voting scheme, will determine the sense for each word. Documents can contain a variable number of words, therefore employing them in machine learning may be hard at times. This thesis presents two novel approaches [Ionescu and Butnaru, 2019] that can represent documents using a finite number of features. Both methods are inspired by computer vision, and they work by first transforming the words within documents to a word representation, such as word2vec. Having words represented in this way, a k-means clustering algorithm can be applied over the words. The centroids of the formed clusters are gathered into a vocabulary. Each word from a document is then represented by the closest centroid from the previously formed vocabulary. To this point, both methods share the same steps. One approach is designed to compute the final representation of a document by calculating the frequency of each centroid found inside it. This method is named Bag of Super Word Embeddings (BOSWE) because each centroid can be viewed as a super word. The second approach presented in this thesis, known as Vector of Locally-Aggregated Word Embeddings (VLAWE), computes the document representation by accumulating the differences between each centroid and each word vector associated with the respective centroid. This thesis also describes a new way to score essays automatically by combining a low-level string kernel model with a high-level semantic feature representation, namely the BOSWE representation. The methods described in this thesis exhibit state-of-the-art performance levels over multiple tasks. One fact to support this claim is that the string kernel method employed for Arabic Dialect Identification obtained the first place, two years in a row at the Fourth and Fifth Workshop on NLP for Similar Languages, Varieties, and Dialects (VarDial). The same string kernel model obtained the fifth place at the German Dialect Identification Closed Shared Task at VarDial Workshop of EACL 2017. Second of all, the Complex Word Identification model scored a third-place at the CWI Shared Task of the BEA-13 of NAACL 2018. Third of all, it is worth to mention that the ShotgunWSD algorithm surpassed the MCS baseline on several datasets. Lastly, the model that combines string kernel and bag of super word embeddings obtained state-of-the-art performance over the Automated Student Assessment Prize dataset.

APA, Harvard, Vancouver, ISO, and other styles

20

Ma, Bin, and Xiaoming Sun. "More Efficient Algorithms for Closest String and Substring Problems." SIAM Journal on Computing 39, no. 4 (January 2010): 1432–43. http://dx.doi.org/10.1137/080739069.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Gramm, Niedermeier, and Rossmanith. "Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems." Algorithmica 37, no. 1 (September 2003): 25–42. http://dx.doi.org/10.1007/s00453-003-1028-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Alamro, Hayam, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Wing-Kin Sung, and Steven Watts. "Efficient Identification of k-Closed Strings." International Journal of Foundations of Computer Science 31, no. 05 (August 2020): 595–610. http://dx.doi.org/10.1142/s0129054120500288.

Full text

Abstract:

A closed string contains a proper factor occurring as both a prefix and a suffix but not elsewhere in the string. Closed strings were introduced by Fici (WORDS 2011) as objects of combinatorial interest. This paper addresses a new problem by extending the closed string problem to the [Formula: see text]-closed string problem, for which a level of approximation is permitted up to a number of Hamming distance errors, set by the parameter [Formula: see text]. We address the problem of deciding whether or not a given string of length [Formula: see text] over an integer alphabet is [Formula: see text]-closed and additionally specifying the border resulting in the string being [Formula: see text]-closed. Specifically, we present an [Formula: see text]-time and [Formula: see text]-space algorithm to achieve this along with the pseudocode of an implementation and proof-of-concept experimental results.

APA, Harvard, Vancouver, ISO, and other styles

23

Zörnig, Peter. "Improved optimization modelling for the closest string and related problems." Applied Mathematical Modelling 35, no. 12 (December 2011): 5609–17. http://dx.doi.org/10.1016/j.apm.2011.05.015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

ZWIEBACH, BARTON. "INTERPOLATING STRING FIELD THEORIES." Modern Physics Letters A 07, no. 12 (April 20, 1992): 1079–90. http://dx.doi.org/10.1142/s0217732392000951.

Full text

Abstract:

A minimal area problem imposing different length conditions on open and closed curves is shown to define a one-parameter family of covariant open-closed quantum string field theories. These interpolate from a recently proposed factorizable open-closed theory up to an extended version of Witten’s open string field theory capable of incorporating on shell closed strings. The string diagrams of the latter define a new decomposition of the moduli spaces of Riemann surfaces with punctures and boundaries based on quadratic differentials with both first order and second order poles.

APA, Harvard, Vancouver, ISO, and other styles

25

Park, Jeong-Hyuck. "Stringy Gravity: Solving the Dark Problems at ‘short’ distance." EPJ Web of Conferences 168 (2018): 01010. http://dx.doi.org/10.1051/epjconf/201816801010.

Full text

Abstract:

Dictated by Symmetry Principle, string theory predicts not General Relativity but its own gravity which assumes the entire closed string massless sector to be geometric and thus gravitational. In terms of R/(MG), i.e. the dimensionless radial variable normalized by mass, Stringy Gravity agrees with General Relativity toward infinity, but modifies it at short distance. At far short distance, gravitational force can be even repulsive. These may solve the dark matter and energy problems, as they arise essentially from small R/(MG) observations: long distance divided by much heavier mass. We address the pertinent differential geometry for Stringy Gravity, stringy Equivalence Principle, stringy geodesics and the minimal coupling to the Standard Model. We highlight the notion of ‘doubled-yet-gauged’ coordinate system, in which a gauge orbit corresponds to a single physical point and proper distance is defined between two gauge orbits by a path integral.

APA, Harvard, Vancouver, ISO, and other styles

26

Zwiebach, Barton. "How covariant closed string theory solves a minimal area problem." Communications in Mathematical Physics 136, no. 1 (February 1991): 83–118. http://dx.doi.org/10.1007/bf02096792.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

POPOV, A. D. "FUNDAMENTAL CHIRAL STRINGS." Modern Physics Letters A 06, no. 26 (August 30, 1991): 2423–28. http://dx.doi.org/10.1142/s0217732391002840.

Full text

Abstract:

The problem of the non-uniqueness of the string theory in the space Rd-1,1 with d ≤ 10 and the procedure of the compactification and the deompactification are discussed. We consider a compact bosonic string defined as a closed string moving in the Lorentizian torus T25,1 and introduce fundamental chiral bosonic string (FCBS) as a universal cover of a compact string. It is shown that the Fock spaces of any standard strings are embedded into the Fock space of FCBS.

APA, Harvard, Vancouver, ISO, and other styles

28

Muslihin, Khoirunnisa Rohadatul Aisy, Endang Rusyaman, and Diah Chaerani. "Conic Duality for Multi-Objective Robust Optimization Problem." Mathematics 10, no. 21 (October 24, 2022): 3940. http://dx.doi.org/10.3390/math10213940.

Full text

Abstract:

Duality theory is important in finding solutions to optimization problems. For example, in linear programming problems, the primal and dual problem pairs are closely related, i.e., if the optimal solution of one problem is known, then the optimal solution for the other problem can be obtained easily. In order for an optimization problem to be solved through the dual, the first step is to formulate its dual problem and analyze its characteristics. In this paper, we construct the dual model of an uncertain linear multi-objective optimization problem as well as its weak and strong duality criteria via conic duality. The multi-objective form of the problem is solved using the utility function method. In addition, the uncertainty is handled using robust optimization with ellipsoidal and polyhedral uncertainty sets. The robust counterpart formulation for the two uncertainty sets belongs to the conic optimization problem class; therefore, the dual problem can be built through conic duality. The results of the analysis show that the dual model obtained meets the weak duality, while the criteria for strong duality are identified based on the strict feasibility, boundedness, and solvability of the primal and dual problems.

APA, Harvard, Vancouver, ISO, and other styles

29

Khachatryan, Kh A., and H. S. Petrosyan. "Solvability of a Nonlinear Problem in Open-Closed $$ {\boldsymbol {p}}$$-Adic String Theory." Differential Equations 56, no. 10 (October 2020): 1371–78. http://dx.doi.org/10.1134/s00122661200100134.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Dikhtyaruk, N., and E. Poplavskaya. "Plane contact problem on the interaction of a pre-stressed strip with an infinite inhomogeneous stringer." Problems of tribology 97, no. 3 (September 28, 2020): 55–63. http://dx.doi.org/10.31891/2079-1372-2020-97-3-55-63.

Full text

Abstract:

The article is devoted to the study of problems of contact interaction of an infinite elastic inhomogeneous stringer with a prestressed strip clamped along one edge. As a result of the research, we have obtained a resolving system of recurrent systems of integro-differential equations. In general, the studies were carried out for the theory of large initial and various versions of the theory of small initial deformations within the framework of the linearized theory of elasticity with an elastic potential of an arbitrary structure. Integral integer differential equations are obtained using the integral Fourier transform. Their solution is presented in the form of quasiregular infinite systems of algebraic equations. The article also investigates the influence of the initial (residual) stresses in strips on the distribution law of contact stresses along the line of contact with an infinite stringer. The system is solved in a closed form using the Fourier transform. The stress expressions are represented by Fourier integrals with a fairly simple structure. The influence of the initial stress on the distribution of contact stresses has been studied and mechanical effects have been found under the action of concentrated loads.

APA, Harvard, Vancouver, ISO, and other styles

31

CHEN, DANNY Z., and EWA MISIOŁEK. "FINDING MANY OPTIMAL PATHS WITHOUT GROWING ANY OPTIMAL PATH TREES." International Journal of Computational Geometry & Applications 20, no. 04 (August 2010): 449–69. http://dx.doi.org/10.1142/s0218195910003384.

Full text

Abstract:

Many algorithms for applications such as pattern recognition, computer vision, and computer graphics seek to compute actual optimal paths in weighted directed graphs. The standard approach for reporting an actual optimal path is based on building a single-source optimal path tree. A technique by Chen et al.2 was given for a class of problems such that a single actual optimal path can be reported without maintaining any single-source optimal path tree, thus significantly reducing the space bound of those problems with no or little increase in their running time. In this paper, we extend the technique by Chen et al.2 to the generalized problem of reporting many actual optimal paths with different starting and ending vertices in certain directed graphs, and show how this new technique yields improved results on several application problems, such as reconstructing a 3-D surface band bounded by two simple closed curves, finding various constrained segmentation of 2-D medical images, and circular string-to-string correction. We also correct an error in the time/space complexity for the well-cited circular string-to-string correction algorithm12 and give an improved result for this problem. Although the generalized many-path problem seems more difficult than the single-path cases, our algorithms have nearly the same space and time bounds as those of the single-path cases. Our technique is likely to help improve many other optimal paths or dynamic programming algorithms.

APA, Harvard, Vancouver, ISO, and other styles

32

Chen, Yuanmei, Haizhen Ren, Lei Zhang, and Yang Zhao. "Computation of Differential in Strong Product Network of Paths via Recursive Iteration." Journal of Physics: Conference Series 2025, no. 1 (September 1, 2021): 012050. http://dx.doi.org/10.1088/1742-6596/2025/1/012050.

Full text

Abstract:

Abstract The set differential can be attributed to some influence maximization problems, which are widely used. For example, it is a basic algorithm problem of information diffusion in social networks. In 2004, Lewis et al. extended this concept to the graph, defined the differential of graph. The present article mainly studies the differential in strong product network of paths. Using the basic block recursive iterative method, we obtain closed form formulas for the differential on the strong product network of paths. The method used here is also effective for the differentials in square graphs.

APA, Harvard, Vancouver, ISO, and other styles

33

CECOTTI, S., S. FERRARA, L. GIRARDELLO, A. PASQUINUCCI, and M. PORRATI. "MATTER-COUPLED SUPERGRAVITY WITH GAUSS-BONNET INVARIANTS: COMPONENT LAGRANGIAN AND SUPERSYMMETRY BREAKING." International Journal of Modern Physics A 03, no. 07 (July 1988): 1675–733. http://dx.doi.org/10.1142/s0217751x88000734.

Full text

Abstract:

We present the component Lagrangian for the general coupling of N=1 matter to a higher curvature four-dimensional supergravity in which the (curvature)2 terms enter the Lagrangian only through the Gauss-Bonnet and Hirzebruch invariants. This is the situation suggested by the low-energy limit of heterotic strings, after compactification to four dimensions. The model obtained from the string by SU(3)-invariant truncation of the toroidal compactification is discussed in detail. We give the closed-form expression for the scalar potential and discuss supersymmetry breaking via gaugino condensation. We show that, in this last case, the cosmological constant Λ remains exactly zero even when the higher curvature corrections are taken into account. We also discuss briefly the problem of auxiliary field propagation and show that the spurious states decouple (i.e. they get an infinite mass) on the physical vacuum with Λ=0, irrespective of whether SUSY is broken or not. Some new, stringy, developments are discussed in the last section.

APA, Harvard, Vancouver, ISO, and other styles

34

Chicano, Francisco, Andrew M. Sutton, L. Darrell Whitley, and Enrique Alba. "Fitness Probability Distribution of Bit-Flip Mutation." Evolutionary Computation 23, no. 2 (June 2015): 217–48. http://dx.doi.org/10.1162/evco_a_00130.

Full text

Abstract:

Bit-flip mutation is a common mutation operator for evolutionary algorithms applied to optimize functions over binary strings. In this paper, we develop results from the theory of landscapes and Krawtchouk polynomials to exactly compute the probability distribution of fitness values of a binary string undergoing uniform bit-flip mutation. We prove that this probability distribution can be expressed as a polynomial in p, the probability of flipping each bit. We analyze these polynomials and provide closed-form expressions for an easy linear problem (Onemax), and an NP-hard problem, MAX-SAT. We also discuss a connection of the results with runtime analysis.

APA, Harvard, Vancouver, ISO, and other styles

35

Dawson, William J. "Upper-extremity Problems Caused by Playing Specific Instruments." Medical Problems of Performing Artists 17, no. 3 (September 1, 2002): 135–40. http://dx.doi.org/10.21091/mppa.2002.3022.

Full text

Abstract:

This study was undertaken to obtain information on the prevalence of music-related upper-extremity problems peculiar to a specific instrument or group of closely-related instruments, and to help determine what problem types are most common or characteristic for players of specific instruments. Music-related problems in 167 performers from a hand surgical practice were reviewed retrospectively. The musicians ranged in age from 9 to 83 years; 41.9% were males. Nearly 90% were professional performers, teachers, collegiate music students, or dedicated amateurs. More than 75% played strings or keyboard instruments. Multiple diagnoses were found in 37.7% of musicians. Data from the six largest instrumental groups revealed that muscle-tendon strain diagnoses were most common, occurring principally among pianists, violinists and violists, guitarists, and reed instrumentalists. Other common diagnoses included inflammatory disorders (tenosynovitis and the like), hypermobility, masses, and arthritic problems. Of the pianists, 54.7% developed strains, 17.4% inflammatory conditions, and 12.8% nerve problems. Violinists and violists as a group had 64.4% strains and 6.7% inflammatory conditions. Guitarists presented with 37.5% strains, 21.9% inflammatory conditions, and 15.6% nerve problems. Flutists had 25% strains and 45% inflammatory conditions. Other woodwind musicians developed 68.2% strains and 13.6% inflammatory conditions. Percussionists had 36.4% strains and 36.4% inflammatory conditions. Only one musician developed an upper-extremity problem that could be considered unique to playing a specific instrument. Statistically significant occurrence rates were found only in pianists under age 30 with strain diagnoses and in those above age 30 with inflammatory problems. These categories seem to be related to repetitive and/or forceful upper-extremity movements, and the resulting specific pathological processes.

APA, Harvard, Vancouver, ISO, and other styles

36

FILIPPOV, A. T., and A. P. ISAEV. "GAUGE MODELS OF “DISCRETE STRINGS”." Modern Physics Letters A 04, no. 22 (October 30, 1989): 2167–76. http://dx.doi.org/10.1142/s0217732389002434.

Full text

Abstract:

A new class of constrained hamiltonian systems with a finite number of degrees of freedom is proposed in which excitations can be divided into two groups analogous to the left and right movers of string theories. Some of these models can be regarded as discrete analogs of the bosonic string, and in the continuum limit with the infinite dimensional constraint algebra Vect (S1)⊗ Vect (S1) one can obtain the classical theory of closed bosonic strings. We also discuss the problem of quantizing these models and constructing the propagator by using path integral methods. A possibility of a supersymmetric extension of our models is also pointed out.

APA, Harvard, Vancouver, ISO, and other styles

37

WANG, ZI-MING, AIRONG WEI, and POOM KUMAM. "Hybrid Bregman projection methods for fixed point and equilibrium problems." Carpathian Journal of Mathematics 34, no. 3 (2018): 441–47. http://dx.doi.org/10.37193/cjm.2018.03.21.

Full text

Abstract:

The purpose of this article is to investigate a projection algorithm for solving a fixed point problem of a closed multi-valued Bregman quasi-strict pseudocontraction and an equilibrium problem of a bifunction. Strong convergence of the projection algorithm is obtained without any compact assumption in a reflexive Banach space. As applications, monotone variational inequality problems are considered. Finally, a numerical simulation example is presented for demonstrating the feasibility and convergence of the algorithm proposed in main result.

APA, Harvard, Vancouver, ISO, and other styles

38

Palese, Marcella. "Variations by generalized symmetries of local Noether strong currents equivalent to global canonical Noether currents." Communications in Mathematics 24, no. 2 (December 1, 2016): 125–35. http://dx.doi.org/10.1515/cm-2016-0009.

Full text

Abstract:

Abstract We will pose the inverse problem question within the Krupka variational sequence framework. In particular, the interplay of inverse problems with symmetry and invariance properties will be exploited considering that the cohomology class of the variational Lie derivative of an equivalence class of forms, closed in the variational sequence, is trivial. We will focalize on the case of symmetries of globally defined field equations which are only locally variational and prove that variations of local Noether strong currents are variationally equivalent to global canonical Noether currents. Variations, taken to be generalized symmetries and also belonging to the kernel of the second variational derivative of the local problem, generate canonical Noether currents - associated with variations of local Lagrangians - which in particular turn out to be conserved along any section. We also characterize the variation of the canonical Noether currents associated with a local variational problem.

APA, Harvard, Vancouver, ISO, and other styles

39

RYANG, SHIJONG. "ASYMPTOTIC AdS STRING SOLUTIONS FOR NULL POLYGONAL WILSON LOOPS IN R1,2." Modern Physics Letters A 25, no. 30 (September 28, 2010): 2555–69. http://dx.doi.org/10.1142/s021773231003375x.

Full text

Abstract:

For the asymptotic string solution in AdS3 which is represented by the AdS3 Poincaré coordinates and yields the planar multi-gluon scattering amplitude at strong coupling in arXiv:0904.0663, we express it by the AdS4 Poincaré coordinates and demonstrate that the hexagonal and octagonal Wilson loops surrounding the string surfaces take closed contours consisting of null vectors in R1,2 owing to the relations of Stokes matrices. For the tetragonal Wilson loop we construct a string solution characterized by two parameters by solving the auxiliary linear problems and demanding a reality condition, and analyze the asymptotic behavior of the solution in R1,2. The freedoms of two parameters are related with some conformal SO(2,4) transformations.

APA, Harvard, Vancouver, ISO, and other styles

40

Gao, Fugen, Xiaoxiao Liu, and Xiaochun Li. "Strong Convergence on the Split Feasibility Problem by Mixing W -Mapping." Journal of Mathematics 2021 (May 27, 2021): 1–6. http://dx.doi.org/10.1155/2021/9924937.

Full text

Abstract:

In this paper, we concern with the split feasibility problem (SFP) in real Hilbert space whenever the sets involved are nonempty, closed, and convex. By mixing W -mapping with the viscosity, we introduce a new iterative algorithm for solving the split feasibility problem, and we prove that our proposed algorithm is convergent strongly to a solution of the split feasibility problem.

APA, Harvard, Vancouver, ISO, and other styles

41

Wu, C. S., M. Budhu, and S. El-Kholy. "Finite strain elastic closed form solutions for some axisymmetric problems." Acta Mechanica 97, no. 1-2 (March 1993): 1–22. http://dx.doi.org/10.1007/bf01173138.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Wang, Shenghua, and Shin Min Kang. "Strong Convergence Iterative Algorithms for Equilibrium Problems and Fixed Point Problems in Banach Spaces." Abstract and Applied Analysis 2013 (2013): 1–9. http://dx.doi.org/10.1155/2013/619762.

Full text

Abstract:

We first introduce the concept of Bregman asymptotically quasinonexpansive mappings and prove that the fixed point set of this kind of mappings is closed and convex. Then we construct an iterative scheme to find a common element of the set of solutions of an equilibrium problem and the set of common fixed points of a countable family of Bregman asymptotically quasinonexpansive mappings in reflexive Banach spaces and prove strong convergence theorems. Our results extend the recent ones of some others.

APA, Harvard, Vancouver, ISO, and other styles

43

Perez, R. A., O. D. I. Nwokah, and D. F. Thompson. "Strong Diagonal Dominance by Quantitative Feedback Theory." Journal of Dynamic Systems, Measurement, and Control 115, no. 2A (June 1, 1993): 246–52. http://dx.doi.org/10.1115/1.2899028.

Full text

Abstract:

This paper uses strong diagonal dominance theory to obtain a systematic solution to the MIMO-QFT problem by an n times solution of the SISO-QFT sensitivity constraint problem. This is analogous to the current MIMO-QFT formulation that requires an n times solution for the elements of the closed-loop transfer matrix. Of equal but independent interest is the establishment of the first early verifiable existence and uniqueness conditions for robust diagonal stabilizability.

APA, Harvard, Vancouver, ISO, and other styles

44

Wang, C. Y., C. M. Wang, and R. Freund. "Vibration of Heavy String Tethered to Mass–Spring System." International Journal of Structural Stability and Dynamics 17, no. 04 (April 6, 2017): 1771002. http://dx.doi.org/10.1142/s021945541771002x.

Full text

Abstract:

This paper is concerned with the vibration of a heavy string tethered to a mass–spring system which is a model for tower crane or gantry crane. The governing equation of motion of the aforementioned problem is solved analytically and exact closed-form characteristic solutions for the natural frequencies are presented. These exact solutions would serve as benchmarks for models which may be more complex than the basic vibration problem considered. Moreover, we investigate the effect of the string-mass pendulum as a flexible dynamic vibration absorber. Such a problem is important in vibration control, and is investigated analytically for the first time. It is found that the effect of the bottom mass is to decrease the amplitude of the string in general. The effect of increased forcing frequency increases the number of nodal points on the string. In most cases, the amplitude of the top mass is reduced.

APA, Harvard, Vancouver, ISO, and other styles

45

Zhi-Zhong Chen and Lusheng Wang. "Fast Exact Algorithms for the Closest String and Substring Problems with Application to the Planted (L,d)-Motif Model." IEEE/ACM Transactions on Computational Biology and Bioinformatics 8, no. 5 (September 2011): 1400–1410. http://dx.doi.org/10.1109/tcbb.2011.21.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Vakili, Javad, and Rouhollah Sadighidizaji. "Finding the closest efficient targets in DEA by a numeration method: the FDH non-convex technology." Boletim da Sociedade Paranaense de Matemática 41 (December 23, 2022): 1–14. http://dx.doi.org/10.5269/bspm.51654.

Full text

Abstract:

Satisfying the Production Possibility Set (PPS) in Free Disposability Hull (FDH) property, there is only a few approaches which discuss on identifying the closest efficient targets of Decision Making Units (DMUs) in Data Envelopment Analysis (DEA). In this paper, without solving any optimization problem, a successful numeration method is proposed to compute the minimum distance of units from the strong efficient frontier of the FDH non-convex PPS. In fact, by some ratios obtained from a linear mixed-integer bi-level programming problem, the closest efficient targets of units are calculated. Moreover, there is an interesting discuss about simplifying a linear mixed-integer bi-level programming problem to reach to the ratios. Finally, the applicability of the proposed method to a real-world problem is illustrated through a numerical example

APA, Harvard, Vancouver, ISO, and other styles

47

Tian, Ming, and Li-Hua Huang. "A General Approximation Method for a Kind of Convex Optimization Problems in Hilbert Spaces." Journal of Applied Mathematics 2014 (2014): 1–9. http://dx.doi.org/10.1155/2014/156073.

Full text

Abstract:

The constrained convex minimization problem is to find a pointx∗with the property thatx∗∈C, andh(x∗)=min h(x),∀x∈C, whereCis a nonempty, closed, and convex subset of a real Hilbert spaceH,h(x)is a real-valued convex function, andh(x)is not Fréchet differentiable, but lower semicontinuous. In this paper, we discuss an iterative algorithm which is different from traditional gradient-projection algorithms. We firstly construct a bifunctionF1(x,y)defined asF1(x,y)=h(y)−h(x). And we ensure the equilibrium problem forF1(x,y)equivalent to the above optimization problem. Then we use iterative methods for equilibrium problems to study the above optimization problem. Based on Jung’s method (2011), we propose a general approximation method and prove the strong convergence of our algorithm to a solution of the above optimization problem. In addition, we apply the proposed iterative algorithm for finding a solution of the split feasibility problem and establish the strong convergence theorem. The results of this paper extend and improve some existing results.

APA, Harvard, Vancouver, ISO, and other styles

48

Xu, You Liang. "Description of Large Deformation Problem Using Means of Visual Strain." Applied Mechanics and Materials 275-277 (January 2013): 16–22. http://dx.doi.org/10.4028/www.scientific.net/amm.275-277.16.

Full text

Abstract:

The constitutive equation of large deformation problem is closely related to geometric description. Nowadays, linear strain tensor is no longer unsuitable to describe large deformation. However, the existing non-linear strain tensors have complicated forms as well as no apparent geometric or physical meaning. While, the increment method is used to solve, however, convergence and efficiency are low sometimes. Thus the idea of visual strain tensor is proposed, with distinct meaning and visual image. Beside, it is likely to be used in engineering measurement, and it can be connected with measured constitutive equation directly. Thus this research provides a new idea and method for solving large-deformation problems in practical engineering.

APA, Harvard, Vancouver, ISO, and other styles

49

Asoodeh, Shahab, and Flavio P. Calmon. "Bottleneck Problems: An Information and Estimation-Theoretic View." Entropy 22, no. 11 (November 20, 2020): 1325. http://dx.doi.org/10.3390/e22111325.

Full text

Abstract:

Information bottleneck (IB) and privacy funnel (PF) are two closely related optimization problems which have found applications in machine learning, design of privacy algorithms, capacity problems (e.g., Mrs. Gerber’s Lemma), and strong data processing inequalities, among others. In this work, we first investigate the functional properties of IB and PF through a unified theoretical framework. We then connect them to three information-theoretic coding problems, namely hypothesis testing against independence, noisy source coding, and dependence dilution. Leveraging these connections, we prove a new cardinality bound on the auxiliary variable in IB, making its computation more tractable for discrete random variables. In the second part, we introduce a general family of optimization problems, termed “bottleneck problems”, by replacing mutual information in IB and PF with other notions of mutual information, namely f-information and Arimoto’s mutual information. We then argue that, unlike IB and PF, these problems lead to easily interpretable guarantees in a variety of inference tasks with statistical constraints on accuracy and privacy. While the underlying optimization problems are non-convex, we develop a technique to evaluate bottleneck problems in closed form by equivalently expressing them in terms of lower convex or upper concave envelope of certain functions. By applying this technique to a binary case, we derive closed form expressions for several bottleneck problems.

APA, Harvard, Vancouver, ISO, and other styles

50

Isiogugu, Obiageli, Paranjothi Pillay, and Osuo-Siseken Uzoma-Oguguo. "Strong convergence of a selection of ishikawa-reich-sabach-type algorithm." Filomat 33, no. 6 (2019): 1505–16. http://dx.doi.org/10.2298/fil1906505i.

Full text

Abstract:

We establish the strong convergence of a selection of an Ishikawa-Reich-Sabach iteration scheme for approximating the common elements of the set of fixed points F(T) of a multi-valued (or singlevalued) pseudocontractive-type mapping T and the set of solutions EP(F) of an equilibrium problem for a bifunction F in a real Hilbert space H. This work is a contribution to the study on the computability and applicability of algorithms for approximating the solutions of equilibrium problems for bifunctions involving the construction of the sequence {Kn}?n=1 of closed convex subsets of H from an arbitrary x0 ? H and the sequence {xn}?n=1 of the metric projections of x0 into Kn. The results obtained are contributions to the resolution of the controversy over the computability and applicability of such algorithms in the contemporary literature.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!