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

Journal articles on the topic 'Expression problem'

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 'Expression 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

Mukhamedova, Nigora. "THE PROBLEM OF EXPRESSION NON-CATEGORICAL STATEMENTS IN LINGUISTIC TEXTS." INTERNATIONAL JOURNAL OF WORD ART 3, no. 3 (March 30, 2020): 91–97. http://dx.doi.org/10.26739/2181-9297-2020-3-13.

Full text
Abstract:
The article deals with the issues based on the study of non-categorical statements in a linguistic text in modern English. The essence of scientific communication is a message, or the transmission by means of language of some mental content, including the expression of an intellectual-evaluative attitude to the subject of speech. The content of intellectual assessments is conditioned by knowledge and experience of intellectual and material activities of people.In a scientific text, this attitude can be the result of verifying the truth of what is expressed by the author himself or by another scientist or a team of researchers, as well as confirmation or refutation of apreviously formed assessment that served as the basis for further discussion
APA, Harvard, Vancouver, ISO, and other styles
2

Diveev, A. I., and E. A. Sofronova. "Machine Search Problem for Mathematical Expression." Doklady Mathematics 110, S1 (December 2024): S25—S34. https://doi.org/10.1134/s1064562424602087.

Full text
Abstract:
Abstract The problem of searching for a mathematical expression is formulated. Classes of mathematical problems where this problem is in demand are presented. A general approach to solving this problem based on machine learning using symbolic regression methods is given. This approach allows finding not only the parameters of the desired mathematical expression, but also its structure. The general problem of machine learning by methods of symbolic regression is described and a unified approach to overcoming it based on the application of the principle of small variations of the basis solution is given.
APA, Harvard, Vancouver, ISO, and other styles
3

Roy, Subhro, and Dan Roth. "Mapping to Declarative Knowledge for Word Problem Solving." Transactions of the Association for Computational Linguistics 6 (December 2018): 159–72. http://dx.doi.org/10.1162/tacl_a_00012.

Full text
Abstract:
Math word problems form a natural abstraction to a range of quantitative reasoning problems, such as understanding financial news, sports results, and casualties of war. Solving such problems requires the understanding of several mathematical concepts such as dimensional analysis, subset relationships, etc. In this paper, we develop declarative rules which govern the translation of natural language description of these concepts to math expressions. We then present a framework for incorporating such declarative knowledge into word problem solving. Our method learns to map arithmetic word problem text to math expressions, by learning to select the relevant declarative knowledge for each operation of the solution expression. This provides a way to handle multiple concepts in the same problem while, at the same time, supporting interpretability of the answer expression. Our method models the mapping to declarative knowledge as a latent variable, thus removing the need for expensive annotations. Experimental evaluation suggests that our domain knowledge based solver outperforms all other systems, and that it generalizes better in the realistic case where the training data it is exposed to is biased in a different way than the test data.
APA, Harvard, Vancouver, ISO, and other styles
4

Lin, Xin, Zhenya Huang, Hongke Zhao, Enhong Chen, Qi Liu, Hao Wang, and Shijin Wang. "HMS: A Hierarchical Solver with Dependency-Enhanced Understanding for Math Word Problem." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 5 (May 18, 2021): 4232–40. http://dx.doi.org/10.1609/aaai.v35i5.16547.

Full text
Abstract:
Automatically solving math word problems is a crucial task for exploring the intelligence levels of machines in the general AI domain. It is highly challenging since it requires not only natural language understanding but also mathematical expression inference. Existing solutions usually explore sequence-to-sequence models to generate expressions, where the problems are simply encoded sequentially. However, such models are generally far from enough for understanding problems as similar to humans and lead to incorrect answers. To this end, in this paper, we propose a novel Hierarchical Math Solver (HMS) to make deep understanding and exploitation of problems. In problem understanding, imitating human reading habits, we propose a hierarchical word-clause-problem encoder. Specifically, we first split each problem into several clauses and learn problem semantics from the local clause level to the global problem level. Then, in clause understanding, we propose a dependency-based module to enhance clause semantics with the dependency structure of the problem. Next, in expression inference, we propose a novel tree-based decoder to generate the mathematical expression for the answer. In the decoder, we apply a hierarchical attention mechanism to enhance the problem semantics with context from different levels, and a pointer-generator network to guide the model to copy existing information and infer extra knowledge. Extensive experimental results on two widely used datasets demonstrate that HMS achieves not only better answers but also more reasonable inference.
APA, Harvard, Vancouver, ISO, and other styles
5

Clemons, Bil. "Solving the Membrane Protein Expression Problem." Biophysical Journal 112, no. 3 (February 2017): 329a—330a. http://dx.doi.org/10.1016/j.bpj.2016.11.1783.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Peng, Xiangyang, Wei Liu, and Jinrong Shen. "A class of constrained inverse eigenvalue problem and associated approximation problem for symmetrizable matrices." Filomat 33, no. 7 (2019): 1903–9. http://dx.doi.org/10.2298/fil1907903p.

Full text
Abstract:
The real symmetric matrix is widely applied in various fields, transforming non-symmetric matrix to symmetric matrix becomes very important for solving the problems associated with the original matrix. In this paper, we consider the constrained inverse eigenvalue problem for symmetrizable matrices, and obtain the solvability conditions and the general expression of the solutions. Moreover, we consider the corresponding optimal approximation problem, obtain the explicit expressions of the optimal approximation solution and the minimum norm solution, and give the algorithm and corresponding computational example.
APA, Harvard, Vancouver, ISO, and other styles
7

Mamiyeva, Turkan. "Solving the Cauchy and Boundary Value Problem for a Continuous Multiplicative Differential Equation of the Second Order." Euroasia Journal of Mathematics, Engineering, Natural & Medical Sciences 11, no. 35 (September 25, 2024): 30–33. https://doi.org/10.5281/zenodo.13884817.

Full text
Abstract:
In the presented work, the Cauchy and boundary value problem for the inhomogeneous equation with the second order multiplicative derivative in the case of discontinuity is considered. The general solution of the considered equation, which depends on two arbitrary constants, has been obtained. Then, when looking at the Cauchy problem, these arbitrary constants are determined from the given initial conditions, and when looking at the boundary problem, these arbitrary constants are determined from the given boundary conditions. Thus, analytical expressions have been obtained for the solution of the problems considered both in the Cauchy problem and in the boundary problem. Moreover, in the continuous case, an analytical expression has been obtained for the solution of the Cauchy and boundary problem considered for the second formulation multiplicative derivative inhomogeneous differential equation. Thus, all seven algebraic operations and integration operations are involved in this analytical expression.
APA, Harvard, Vancouver, ISO, and other styles
8

Ludlow, Peter. "Cognitive dynamics: Red Queen semantics versus the story of O." Belgrade Philosophical Annual 35, no. 2 (2022): 53–67. http://dx.doi.org/10.5937/bpa2202053l.

Full text
Abstract:
It appears that indexicals must have fine-grained senses for us to explain things involving human action and emotions, and we typically identify these different senses with different modes of expression. On the other hand, we also express the very same thought in very different ways. The first problem is the problem of cognitive significance. The second problem is what Branquinho (1999) has called the problem of cognitive dynamics. The question is how we can solve both of those problems at the same time. Vojislav Božičković (2021) offers one solution in which the cognitive dynamics runs through the objects of the attitudes. I discuss this solution and offer an alternative in which the theory of cognitive dynamics has no use for the objects of the attitudes to unify expressions of attitudes. When we say or believe "the same thing" using different modes of expressions, it is by virtue of our deploying a dynamic theory of attitude expression. Like Lewis Carrol's Red Queen, we must run to stay in place.
APA, Harvard, Vancouver, ISO, and other styles
9

Cruz, Dalia. "Oral expression: a problem to be addressed." SCIÉNDO 23, no. 4 (December 31, 2020): 293–98. http://dx.doi.org/10.17268/sciendo.2020.035.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Brayden. "A New Method to Explore the Integer Partition Problem." International Journal on Cybernetics & Informatics 12, no. 04 (July 27, 2023): 75–83. http://dx.doi.org/10.5121/ijci.2023.120406.

Full text
Abstract:
Integer Partition is a well known difficult problem in number theory and no solid solution has been found until today. The authors used Linear Difference Equation and Root of Unity to successfully get the expressions for integer n when the group number is k=2, k=3, k=4 and k=5. This proves the close relationship between integer partition and root of unity. With the analysis, it can be concluded that there will be an expression of U(n,k) existing for any n and k and we have found a method to develop the expression. Also this has provided a new interesting method to do further research in the integer partition area.
APA, Harvard, Vancouver, ISO, and other styles
11

Qin, Li Juan, and Yu Lan Hu. "Eight Models Discussion on P3L Multi-Solution Problem." Advanced Materials Research 186 (January 2011): 398–402. http://dx.doi.org/10.4028/www.scientific.net/amr.186.398.

Full text
Abstract:
Multi-solution problem is an important problem that affects the characteristic of pose estimation algorithm. The main content of this paper is to discuss the solution models for pose estimation method from three non-coplanar lines which intersect at two points. This paper provides a detailed account of concrete expressions for eight solution models. Expression for analytical solution can be very visual.
APA, Harvard, Vancouver, ISO, and other styles
12

Liang, Yanqiu. "Intelligent Emotion Evaluation Method of Classroom Teaching Based on Expression Recognition." International Journal of Emerging Technologies in Learning (iJET) 14, no. 04 (February 27, 2019): 127. http://dx.doi.org/10.3991/ijet.v14i04.10130.

Full text
Abstract:
To solve the problem of emotional loss in teaching and improve the teaching effect, an intelligent teaching method based on facial expression recognition was studied. The traditional active shape model (ASM) was improved to extract facial feature points. Facial expression was identified by using the geometric features of facial features and support vector machine (SVM). In the expression recognition process, facial geometry and SVM methods were used to generate expression classifiers. Results showed that the SVM method based on the geometric characteristics of facial feature points effectively realized the automatic recognition of facial expressions. Therefore, the automatic classification of facial expressions is realized, and the problem of emotional deficiency in intelligent teaching is effectively solved.
APA, Harvard, Vancouver, ISO, and other styles
13

Bruss, F. Thomas, Guy Louchard, and John W. Turner. "On the N-tower problem and related problems." Advances in Applied Probability 35, no. 1 (March 2003): 278–94. http://dx.doi.org/10.1239/aap/1046366109.

Full text
Abstract:
Consider N towers each made up of a number of counters. At each step a tower is chosen at random, a counter removed which is then added to another tower also chosen at random. The probability distribution for the time needed to empty one of the towers is obtained in the case N = 3. Arguments are set forward as to why no simple formulae can be expected for N > 3. An asymptotic expression for the mean time before one of the towers becomes empty is derived in the case of four towers when they all initially contain a comparably large number of counters. We then study related problems, in particular the ruin problem for three players. Here we use simple martingale methodology as well as a solution proposed by T. S. Ferguson for a slightly modified problem. Throughout the paper it is our main objective to shed light on the reasons why the case N > 3 is so substantially different from the case N ≤ 3.
APA, Harvard, Vancouver, ISO, and other styles
14

Pratiwi, Hanida Emilia Dewi, Zukhrufurrohmah Zukhrufurrohmah, and Dwi Priyo Utomo. "Representation Of Mathematics Expression Of Civil Engineering Students In Solving HOTS Problems." Daya Matematis: Jurnal Inovasi Pendidikan Matematika 8, no. 1 (April 1, 2020): 90. http://dx.doi.org/10.26858/jds.v8i1.13324.

Full text
Abstract:
The ability of students to represent mathematical expressions related to HOTS problems is still not good. This study aims to describe the representation of the mathematical expression of students in solving HOTS problems. This type of descriptive research using a qualitative approach in terms of aspects of the representation of mathematical expressions. The subjects of this study were 17 Civil Engineering students who were taking lectures in the academic year 2018/2019. The data collection technique in this research is the test item description. The instrument used was in the form of a test sheet. Data analysis was carried out through three stages: data reduction, data presentation, and conclusion drawing. The results showed that students could involve mathematical symbols correctly and appropriately in each stage of solving HOTS analysis type questions. Students can present other mathematical representations into mathematical expression representations and involve mathematical symbols correctly and appropriately in each stage of HOTS problem solving, both Evaluation type and Creating type. The ability of students to represent mathematical expressions related to HOTS problems is still not good. This study aims to describe the representation of the mathematical expression of students in solving HOTS problems. This type of descriptive research using a qualitative approach in terms of aspects of the representation of mathematical expressions. The subjects of this study were 17 Civil Engineering students who were taking lectures in the academic year 2018/2019. The data collection technique in this research is the test item description. The instrument used was in the form of a test sheet. Data analysis was carried out through three stages: data reduction, data presentation, and conclusion drawing. The results showed that students could involve mathematical symbols correctly and appropriately in each stage of solving HOTS analysis type questions. Students can present other mathematical representations into mathematical expression representations and involve mathematical symbols correctly and appropriately in each stage of HOTS problem solving, both Evaluation type and Creating type.
APA, Harvard, Vancouver, ISO, and other styles
15

Bruss, F. Thomas, Guy Louchard, and John W. Turner. "On the N-tower problem and related problems." Advances in Applied Probability 35, no. 01 (March 2003): 278–94. http://dx.doi.org/10.1017/s0001867800012180.

Full text
Abstract:
Consider N towers each made up of a number of counters. At each step a tower is chosen at random, a counter removed which is then added to another tower also chosen at random. The probability distribution for the time needed to empty one of the towers is obtained in the case N = 3. Arguments are set forward as to why no simple formulae can be expected for N > 3. An asymptotic expression for the mean time before one of the towers becomes empty is derived in the case of four towers when they all initially contain a comparably large number of counters. We then study related problems, in particular the ruin problem for three players. Here we use simple martingale methodology as well as a solution proposed by T. S. Ferguson for a slightly modified problem. Throughout the paper it is our main objective to shed light on the reasons why the case N > 3 is so substantially different from the case N ≤ 3.
APA, Harvard, Vancouver, ISO, and other styles
16

Closser, Avery Harrison, Anthony F. Botelho, and Jenny Yun-Chen Chan. "Exploring the Impact of Symbol Spacing and Problem Sequencing on Arithmetic Performance: An Educational Data Mining Approach." Journal of Educational Data Mining (JEDM) 16, no. 1 (June 27, 2024): 84–111. https://doi.org/10.5281/zenodo.11403249.

Full text
Abstract:
Experimental research on perception and cognition has shown that inherent and manipulated visual featuresof mathematics problems impact individuals’ problem-solving behavior and performance. In a recent study,we manipulated the spacing between symbols in arithmetic expressions to examine its effect on 174undergraduate students’ arithmetic performance but found results that were contradictory to most of theliterature (Closser et al., 2023). Here, we applied educational data mining (EDM) methods to that dataset atthe problem level to investigate whether inherent features of the 32 experimental problems (i.e., problemcomposition, problem order) may have caused unintended effects on students’ performance. We found thatstudents were consistently faster to correctly simplify expressions with the higher-order operator on the left,rather than right, side of the expression. Furthermore, average response times varied based on the symbolspacing of the current and preceding problem, suggesting that problem sequencing matters. However,including or excluding problem identifiers in analyses changed the interpretation of results, suggesting thatthe effect of sequencing may be impacted by other, undefined problem-level factors. These results advancecognitive theories on perceptual learning and provide implications for educational researchers: onlineexperiments designed to investigate students’ performance on mathematics problems should include avariety of problems, systematically examine the effects of problem order, and consider applying differentdata analysis approaches to detect effects of inherent problem features. Moreover, EDM methods can be atool to identify nuanced effects on behavior and performance in the context of data from online platforms.
APA, Harvard, Vancouver, ISO, and other styles
17

Wang, Yingying, Yibin Li, Yong Song, and Xuewen Rong. "Facial Expression Recognition Based on Auxiliary Models." Algorithms 12, no. 11 (October 31, 2019): 227. http://dx.doi.org/10.3390/a12110227.

Full text
Abstract:
In recent years, with the development of artificial intelligence and human–computer interaction, more attention has been paid to the recognition and analysis of facial expressions. Despite much great success, there are a lot of unsatisfying problems, because facial expressions are subtle and complex. Hence, facial expression recognition is still a challenging problem. In most papers, the entire face image is often chosen as the input information. In our daily life, people can perceive other’s current emotions only by several facial components (such as eye, mouth and nose), and other areas of the face (such as hair, skin tone, ears, etc.) play a smaller role in determining one’s emotion. If the entire face image is used as the only input information, the system will produce some unnecessary information and miss some important information in the process of feature extraction. To solve the above problem, this paper proposes a method that combines multiple sub-regions and the entire face image by weighting, which can capture more important feature information that is conducive to improving the recognition accuracy. Our proposed method was evaluated based on four well-known publicly available facial expression databases: JAFFE, CK+, FER2013 and SFEW. The new method showed better performance than most state-of-the-art methods.
APA, Harvard, Vancouver, ISO, and other styles
18

Liang, Qi, Dian Ouyang, Fan Zhang, Jianye Yang, Xuemin Lin, and Zhihong Tian. "Efficient Regular Simple Path Queries under Transitive Restricted Expressions." Proceedings of the VLDB Endowment 17, no. 7 (March 2024): 1710–22. http://dx.doi.org/10.14778/3654621.3654636.

Full text
Abstract:
There are two fundamental problems in regular simple path queries (RSPQs). One is the reachability problem which asks whether there exists a simple path between the source and the target vertex matching the given regular expression, and the other is the enumeration problem which aims to find all the matched simple paths. As an important computing component of graph databases, RSPQs are supported in many graph database query languages such as PGQL and openCypher. However, answering RSPQs is known to be NP-hard, making it challenging to design scalable solutions to support a wide range of expressions. In this paper, we first introduce the class of transitive restricted expression , which covers more than 99% of real-world queries. Then, we propose an efficient algorithm framework to support both reachability and enumeration problems under transitive restricted expression constraints. To boost the performance, we develop novel techniques for reachability detection, the search of candidate vertices, and the reduction of redundant path computation. Extensive experiments demonstrate that our exact method can achieve comparable efficiency to the state-of-the-art approximate approach, and outperforms the state-of-the-art exact methods by up to 2 orders of magnitude.
APA, Harvard, Vancouver, ISO, and other styles
19

Chen, Yidong, Zohar Yakhini, Amir Ben-Dor, Edward Dougherty, Jeffrey M. Trent, and Michael Bittner. "Analysis of Expression Patterns: The Scope of the Problem, the Problem of Scope." Disease Markers 17, no. 2 (2001): 59–65. http://dx.doi.org/10.1155/2001/728649.

Full text
Abstract:
Studies of the expression patterns of many genes simultaneously lead to the observation that even in closely related pathologies, there are numerous genes that are differentially expressed in consistent patterns correlated to each sample type. The early uses of the enabling technology, microarrays, was focused on gathering mechanistic biological insights. The early findings now pose another clear challenge, finding ways to effectively use this kind of information to develop diagnostics.
APA, Harvard, Vancouver, ISO, and other styles
20

Bayuk, Dimitri A., and Olga B. Fedorova. "G.W. Leibniz: Sign and the Problem of Expression." Epistemology & Philosophy of Science 57, no. 1 (2020): 146–65. http://dx.doi.org/10.5840/eps202057112.

Full text
Abstract:
The disciplinary differentiation of sciences attracted Leibniz’s attention for a long period of time. From nowadays prospects it looks very well grounded as soon as in Leibniz’s manuscripts a modern scholar finds clue ideas of any research field which would tempt him to consider Leibniz as one of the founders of this particular discipline. We argue that this is possible only in retrospection and would significantly distort the essence of Leibniz’s epistemology. Our approach implies, in contrary, the investigation of the Leibniz doctrine of signs on the background of the related philosophical problem, that of expression. The choice of semiotics is justified by the fact that it took a central place in his theoretical constructions, both those of natural sciences and of philosophy. In Leibniz system of knowledge the concept of notes (notae) and sings (signa) served a theoretical foundation of his most important and long-life aspiration to build up practical science of universal characteristics (characteristica universalis). In his eyes this practical science was the science of sciences (Scientia scientiarum), and we can consider it as the matrix for all possible scientific knowledge.
APA, Harvard, Vancouver, ISO, and other styles
21

McCulloch, Ann Maree. "Depression and its Expression: Art as Problem Solver." International Journal of the Humanities: Annual Review 3, no. 7 (2006): 155–62. http://dx.doi.org/10.18848/1447-9508/cgp/v03i07/41747.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Sasai, M., and P. G. Wolynes. "Stochastic gene expression as a many-body problem." Proceedings of the National Academy of Sciences 100, no. 5 (February 26, 2003): 2374–79. http://dx.doi.org/10.1073/pnas.2627987100.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Kubo, Susumu, and Katsuhiro Nishinari. "An algebraic expression of the number partitioning problem." Discrete Applied Mathematics 285 (October 2020): 283–96. http://dx.doi.org/10.1016/j.dam.2020.04.020.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Salamon, Peter, and Paul Erdös. "The Solution to a Problem of Grünbaum." Canadian Mathematical Bulletin 31, no. 2 (March 1, 1988): 129–38. http://dx.doi.org/10.4153/cmb-1988-020-2.

Full text
Abstract:
AbstractThe paper characterizes the set of all possible values for the number of lines determined by n points for n sufficiently large. For the lower bound of Kelly and Moser for the number of lines in a configuration with n — k collinear points is shown to be sharp and it is shown that all values between Mmin(k) and Mmax(k) are assumed with the exception of Mmax — 1 and Mmax — 3. Exact expressions are obtained for the lower end of the continuum of values leading down from In particular, the best value of c = 1 is obtained in Erdös’ previous expression for this lower end of the continuum.
APA, Harvard, Vancouver, ISO, and other styles
25

Khardon, R. "Translating between Horn Representations and their Characteristic Models." Journal of Artificial Intelligence Research 3 (December 1, 1995): 349–72. http://dx.doi.org/10.1613/jair.183.

Full text
Abstract:
Characteristic models are an alternative, model based, representation for Horn expressions. It has been shown that these two representations are incomparable and each has its advantages over the other. It is therefore natural to ask what is the cost of translating, back and forth, between these representations. Interestingly, the same translation questions arise in database theory, where it has applications to the design of relational databases. This paper studies the computational complexity of these problems. Our main result is that the two translation problems are equivalent under polynomial reductions, and that they are equivalent to the corresponding decision problem. Namely, translating is equivalent to deciding whether a given set of models is the set of characteristic models for a given Horn expression. We also relate these problems to the hypergraph transversal problem, a well known problem which is related to other applications in AI and for which no polynomial time algorithm is known. It is shown that in general our translation problems are at least as hard as the hypergraph transversal problem, and in a special case they are equivalent to it.
APA, Harvard, Vancouver, ISO, and other styles
26

Petkovic, Dejan, and Milica Radic. "Generalization of Helmholtz coil problem." Serbian Journal of Electrical Engineering 12, no. 3 (2015): 375–84. http://dx.doi.org/10.2298/sjee1503375p.

Full text
Abstract:
The primary intent of this work is to propose a simple analytical method for designing coil systems for homogeneous and gradient magnetostatic field generation. Coil system consists of two identical coaxial (regular) polygonal current loops. In the space between the loops, there is nearly homogeneous or nearly linear distribution of the magnetic field along the axes depending on the currents' direction. First, we derived a suitable, simple and general expression for the magnetic field along the axes due to a polygonal current loop. We emphasize the importance of the role of this expression for further analysis. The total on-axes magnetic field is the result of superposition of the magnetic fields that each loop generates separately. The proper distance between the loops and the current orientation make the system to become either Helmholtz coil or anti-Helmholtz coil. In this paper we give exact, analytical and general expression for this optimal distance that provides the magnetic field to be homogeneous (linear) as much as possible. We based our study on Taylor series expansion of the total magnetic field, demanding that the first contaminating term must be canceled, in both, symmetric and asymmetric case.
APA, Harvard, Vancouver, ISO, and other styles
27

Najafov, Rahil. "Revelation as a universal philosophical problem." Science, Education and Innovations in the Context of Modern Problems 7, no. 4 (December 10, 2024): 140–59. https://doi.org/10.56334/sei/7.4.13.

Full text
Abstract:
We have tried to obtain as much information as possible about the revelation and its mechanism of coming to man, and the way man accepts it, from the "memories" that have come to us from the Prophet, that is, from the hadiths.2. According to linguists, it is a secret word, a quick expression of a thought, a sign, etc. The explanation of this word varies according to theologians Of course, the views we care about are the thoughts and ideas of philosophers who have penetrated to the essence of the revelation on the subject.
APA, Harvard, Vancouver, ISO, and other styles
28

Beléndez, A., A. Hernández, S. Gallego, M. Ortuño, C. Neipp, and T. Beléndez. "Post-Buckling of a Cantilever Column: A More Accurate Linear Analysis of a Classical Nonlinear Problem." International Journal of Mechanical Engineering Education 35, no. 4 (October 2007): 293–304. http://dx.doi.org/10.7227/ijmee.35.4.4.

Full text
Abstract:
A more accurate analytical approximate expression for the slope at any point of the elastic curve of a slender cantilever column is obtained by using a heuristic but pedagogical derivation. This derivation is based on the linearization of the nonlinear differential equation that governs the post-buckling of the cantilever column. The expression proposed depends on two unknown parameters, which are obtained by comparing, term by term, the power series expansions of the approximate and exact expressions for the total length of the column. The results obtained with this new approximate expression are compared with the exact ones and with two approximations previously published in the literature. The numerical results show that the two previous approximations are not nearly as accurate as the new expression presented in this paper.
APA, Harvard, Vancouver, ISO, and other styles
29

Jingjing, Peng, Wang Qingwen, Peng Zhenyun, and Chen Zhencheng. "Solution of symmetric positive semidefinite Procrustes problem." Electronic Journal of Linear Algebra 35 (December 8, 2019): 543–54. http://dx.doi.org/10.13001/ela.2019.5167.

Full text
Abstract:
In this paper, the symmetric positive semidefinite Procrustes problem is considered. By using matrix inner product and matrix decomposition theory, an explicit expression of the solution is given. Based on the explicit expression given in this paper, it is easy to derive the explicit expression of the solution given by Woodgate [K.G. Woodgate. Least-squares solution of F = PG over positive semidefinite symmetric P . Linear Algebra Appl., 245:171–190, 1996.] and by Liao [A.P. Liao. On the least squares problem of a matrix equation. J. Comput. Math., 17:589–594, 1999.] for the Procrustes problem in some special cases. The explicit expression given in this paper also shows that the solution of the special inverse eigenvalue problem considered by Zhang [L. Zhang. A class of inverse eigenvalue problem for symmetric nonnegative definite matrices. J. Hunan Educational Inst., 2:11–17, 1995 (in Chinese).] can be computed exactly. Examples to illustrate the correctness of the theory results are given.
APA, Harvard, Vancouver, ISO, and other styles
30

Bulu, Vera Rosalina. "ANALISIS KESALAHAN MAHASISWA DALAM MENYELESAIKAN SOAL CERITA BERDASARKAN METODE NEWMANN." Journal of Honai Math 3, no. 1 (April 15, 2020): 41–56. http://dx.doi.org/10.30862/jhm.v3i1.111.

Full text
Abstract:
This Qualitative study aimed to describe the students the mistakes in solving the problems related to cubes and cuboid topics based on Newmann's procedures. To gather the data, three students of primary school teacher department in a university in Kupang, Indonesia, with a high, moderate and low problem – solving skills were chosen to be analyzed further using descriptive method. The result showed that the students with a high problem – solving skill were doing wrong in writing the final answer due to an incomplete understanding of cube and cuboid. The students with a moderate problem – solving skill were doing mistake in transforming the word problems into mathematical expression since the students were not accustomed to do non – routine problem. Furthermore, the students with the low problem – solving skills were doing mistakes in transforming word problems into a mathematical expression, during the process and writing the final answer. The mistake was emerged due to students’ inability to understand the problems and incomplete understanding of the concept of cube and cuboid.
APA, Harvard, Vancouver, ISO, and other styles
31

Lambie, Rosemary Anne. "Adaptations for Written Expression." Academic Therapy 22, no. 1 (September 1986): 27–34. http://dx.doi.org/10.1177/105345128602200104.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Yulduz, Mamadiyarova. "EXPRESSION OF EKPHRASIS GENESIS AND SCIENTIFIC APPROACHES TO IT." CURRENT RESEARCH JOURNAL OF PHILOLOGICAL SCIENCES 03, no. 02 (February 1, 2022): 49–52. http://dx.doi.org/10.37547/philological-crjps-03-02-10.

Full text
Abstract:
This article is a literary phenomenon that reflects the feature of “Visual expression of a visual image in word” - the problem of the genesis of the phenomenon of ekphrasis, the forms of its evolution, the issues of its interpretation in terms of space and time, the various theories and views that have emerged as a result of its study and analysis by researchers and scientists.
APA, Harvard, Vancouver, ISO, and other styles
33

Gasull, Armengol, and Joan Torregrosa. "Center-Focus Problem for Discontinuous Planar Differential Equations." International Journal of Bifurcation and Chaos 13, no. 07 (July 2003): 1755–65. http://dx.doi.org/10.1142/s0218127403007618.

Full text
Abstract:
We study the center-focus problem as well as the number of limit cycles which bifurcate from a weak focus for several families of planar discontinuous ordinary differential equations. Our computations of the return map near the critical point are performed with a new method based on a suitable decomposition of certain one-forms associated with the expression of the system in polar coordinates. This decomposition simplifies all the expressions involved in the procedure. Finally, we apply our results to study a mathematical model of a mechanical problem, the movement of a ball between two elastic walls.
APA, Harvard, Vancouver, ISO, and other styles
34

COLL, B., R. PROHENS, and A. GASULL. "THE CENTER PROBLEM FOR DISCONTINUOUS LIÉNARD DIFFERENTIAL EQUATION." International Journal of Bifurcation and Chaos 09, no. 09 (September 1999): 1751–61. http://dx.doi.org/10.1142/s0218127499001231.

Full text
Abstract:
We prove that the Lyapunov constants for differential equations given by a vector field with a line of discontinuities are quasi-homogeneous polynomials. This property is strongly used to derive the general expression of the Lyapunov constants for two families of discontinuous Liénard differential equations, modulus some unknown coefficients. In one of the families these coefficients are determined and the center problem is solved. In the other family the center problem is just solved by assuming that the coefficients which appear in these expressions are nonzero. This assumption on the coefficients is supported by their computation (analytical and numerical) for several cases.
APA, Harvard, Vancouver, ISO, and other styles
35

Andrushkevich, Alexander G. "Problems and Prospects for a One-Sided Solution to Kripke’s Problem." Epistemology & Philosophy of Science 61, no. 2 (2024): 71–76. http://dx.doi.org/10.5840/eps202461224.

Full text
Abstract:
This text is a replica of the article by E.V. Borisov А Straight Solution to Kripke’s problem. The proposed solution to the problem of skepticism regarding the meaning of a linguistic expression is based on the idea of language and speech activity, limited to the act of use. Such a truncated and one-sided version of the analysis of language presents a picture where the only subject capable of understanding the meanings of words is the speech agent himself. Although this approach partially allows us to resolve the skeptical problem, it arises again when we pay attention not to the agent of speech, but to the recipient to whom speech activity is directed.
APA, Harvard, Vancouver, ISO, and other styles
36

Varanka, Tuomas, Wei Peng, and Guoying Zhao. "Micro-Expression Recognition with Noisy Labels." Electronic Imaging 2021, no. 11 (January 18, 2021): 157–1. http://dx.doi.org/10.2352/issn.2470-1173.2021.11.hvei-157.

Full text
Abstract:
Facial micro-expressions are quick, involuntary and low intensity facial movements. An interest in detecting and recognizing micro-expressions arises from the fact that they are able to show person’s genuine hidden emotions. The small and rapid facial muscle movements are often too difficult for a human to not only spot the occurring micro-expression but also be able to recognize the emotion correctly. Recently, a focus on developing better micro-expression recognition methods has been on models and architectures. However, we take a step back and go to the root of task, the data. We thoroughly analyze the input data and notice that some of the data is noisy and possibly mislabelled. The authors of the micro-expression datasets have also acknowledged the possible problems in data labelling. Despite this, no attempts have been made to design models that take into account the potential mislabelled data in micro-expression recognition, to our best knowledge. In this paper, we explore new methods taking noisy labels into special account in an attempt to solve the problem. We propose a simple, yet efficient label refurbishing method and a data cleaning method for handling noisy labels. The data cleaning method achieves state-of-the-art results in the MEGC2019 composite dataset.
APA, Harvard, Vancouver, ISO, and other styles
37

Jodar, L., and M. Mariton. "Explicit solutions for a system of coupled Lyapunov differential matrix equations." Proceedings of the Edinburgh Mathematical Society 30, no. 3 (October 1987): 427–34. http://dx.doi.org/10.1017/s0013091500026821.

Full text
Abstract:
This paper is concerned with the problem of obtaining explicit expressions of solutions of a system of coupled Lyapunov matrix differential equations of the typewhere Fi, Ai(t), Bi(t), Ci(t) and Dij(t) are m×m complex matrices (members of ℂm×m), for 1≦i, j≦N, and t in the interval [a,b]. When the coefficient matrices of (1.1) are timeinvariant, Dij are scalar multiples of the identity matrix of the type Dij=dijI, where dij are real positive numbers, for 1≦i, j≦N Ci, is the transposed matrix of Bi and Fi = 0, for 1≦i≦N, the Cauchy problem (1.1) arises in control theory of continuous-time jump linear quadratic systems [9–11]. Algorithms for solving the above particular case can be found in [12]]. These methods yield approximations to the solution. Without knowing the explicit expression of the solutions and in order to avoid the error accumulation it is interesting to know an explicit expression for the exact solution. In Section 2, we obtain an explicit expression of the solution of the Cauchy problem (1.1) and of two-point boundary value problems related to the system arising in (1.1). Stability conditions for the solutions of the system of (1.1) are given. Because of developed techniques this paper can be regarded as a continuation of the sequence [3, 4, 5, 6].
APA, Harvard, Vancouver, ISO, and other styles
38

Dong, Jingwei, Yushun Zhang, and Lingye Fan. "A Multi-View Face Expression Recognition Method Based on DenseNet and GAN." Electronics 12, no. 11 (June 3, 2023): 2527. http://dx.doi.org/10.3390/electronics12112527.

Full text
Abstract:
Facial expression recognition (FER) techniques can be widely used in human-computer interaction, intelligent robots, intelligent monitoring, and other domains. Currently, FER methods based on deep learning have become the mainstream schemes. However, these methods have some problems, such as a large number of parameters, difficulty in being applied to embedded processors, and the fact that recognition accuracy is affected by facial deflection. To solve the problem of a large number of parameters, we propose a DSC-DenseNet model, which improves the standard convolution in DenseNet to depthwise separable convolution (DSC). To solve the problem wherein face deflection affects the recognition effect, we propose a posture normalization model based on GAN: a GAN with two local discriminators (LD-GAN) that strengthen the discriminatory abilities of the expression-related local parts, such as the parts related to the eyes, eyebrows, mouth, and nose. These discriminators improve the model’s ability to retain facial expressions and evidently benefits FER. Quantitative and qualitative experimental results on the Fer2013 and KDEF datasets have consistently shown the superiority of our FER method when working with multi-pose face images.
APA, Harvard, Vancouver, ISO, and other styles
39

Lee, Seung-Hoon. "Sport and Religion: The Problem of Expression and Suppression." Journal of the Korean Society for the Philosophy of Sport, Dance, & Martial Arts’ 28, no. 3 (September 30, 2020): 85–96. http://dx.doi.org/10.31694/pm.2020.09.28.3.007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Kita, Takafumi. "An Exact Entropy Expression for a Many-Body Problem." Journal of the Physical Society of Japan 68, no. 11 (November 15, 1999): 3740–41. http://dx.doi.org/10.1143/jpsj.68.3740.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Sturges, Paul. "Limits to freedom of expression? The problem of blasphemy." IFLA Journal 41, no. 2 (June 2015): 112–19. http://dx.doi.org/10.1177/0340035215584778.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Berg, J. "Dynamics of gene expression and the regulatory inference problem." EPL (Europhysics Letters) 82, no. 2 (April 2008): 28010. http://dx.doi.org/10.1209/0295-5075/82/28010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Schmidt, Florian, and Marcel H. Schulz. "On the problem of confounders in modeling gene expression." Bioinformatics 35, no. 4 (August 2, 2018): 711–19. http://dx.doi.org/10.1093/bioinformatics/bty674.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Szeberényi, József. "Problem-solving test: Expression cloning of the erythropoietin receptor." Biochemistry and Molecular Biology Education 36, no. 3 (2008): 236–38. http://dx.doi.org/10.1002/bmb.20191.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Chernenko, Oleg. "Gustav Shpet on William James: the Problem of Expression." Voprosy filosofii, no. 12 (December 4, 2024): 96. https://doi.org/10.21146/0042-8744-2024-12-96-101.

Full text
Abstract:
Nowadays, the reception of William James’s psychological and philosophical ideas in Russia is of particular interest to researchers of Russian intellectual cul­ture. Contemporary philosophers and scholars in the humanities focus on how Russian philosophers and psychologists of the 20th century interpreted his un­derstanding of “religious experience,” clarify the significance of his ideas for the development of academic theology in Russia, identify the socio-cultural pre­requisites of his pragmatism, and trace the transformations of this teaching on Russian soil. In this context, the archival materials of Gustav Gustavovich Shpet are of particular interest, thanks to which James’s “radical empiricism” ac­quires a new, relevant sound for contemporary discussions in the field of inter­disciplinary studies of consciousness and the epistemology of religious experi­ence. The article traces the trajectories of Shpet’s reception of James’s ideas (based on published works and taking into account manuscripts preserved in the Russian philosopher’s family archive). Particular attention is given to James’s articles “What is Emotion?” and “On Some Omissions of Introspec­tive Psychology” (both published in 1884), which Shpet chose for translation and subsequent publication in the Reader on the History of Psychology. The con­clusion is substantiated that Shpet rethought James’s idea of the typology of “subjective-psychological states” and also transferred his reasoning about emo­tion as a special kind of expression, as a necessary element in the structure of ex­perience, into the epistemological context.
APA, Harvard, Vancouver, ISO, and other styles
46

Kukushkina, O. V. "Negative Information: Statement of Fact or Expression of Opinion?" Theory and Practice of Forensic Science, no. 3(43) (September 30, 2016): 132–45. http://dx.doi.org/10.30764/64/1819-2785-2016-3-132-145.

Full text
Abstract:
The paper explores the key problems of establishing the type of negative information and differentiating between facts and opinions. This is one of the most challenging problems of forensic linguistics that requires a robust methodological framework to be tackled successfully. When faced with this problem, the expert has to deal with the ambiguity of terminology and wording of questions, as well as the complexity of the object of study – the semantics of statements encountered in acts of speech. The paper analyzes the content of key terms traditionally used to address this forensic problem, and offers a possible solution. The so-called “factual square” is a method based on analyzing a statement against four semantic parameters: presence of statement of past action; verifiability of this statement on the basis of specificity of description of the action and its potential observability; lack of alternative, i.e. indication of a different possibility; the purpose of conveying negative information. The paper also analyzes the basic types of factual information and offers specific examples of semantic analysis of statements using the proposed approach.
APA, Harvard, Vancouver, ISO, and other styles
47

Petrosiuk, Denys Valeriiovych, Olena Oleksandrivna Arsirii, Oksana Yurievna Babilunha, and Anatolii Oleksandrovych Nikolenko. "DEEP LEARNING TECHNOLOGY OF CONVOLUTIONAL NEURAL NETWORKS FOR FACIAL EXPRESSION RECOGNITION." Applied Aspects of Information Technology 4, no. 2 (June 30, 2021): 192–201. http://dx.doi.org/10.15276/aait.02.2021.6.

Full text
Abstract:
The application of deep learning convolutional neural networks for solving the problem of automated facial expression recognition and determination of emotions of a person is analyzed. It is proposed to use the advantages of the transfer approach to deep learning convolutional neural networks training to solve the problem of insufficient data volume in sets of images with different facial expressions. Most of these datasets are labeled in accordance with a facial coding system based on the units of human facial movement. The developed technology of transfer learning of the public deep learning convolutional neural networks families DenseNet and MobileNet, with the subsequent “fine tuning” of the network parameters, allowed to reduce the training time and computational resources when solving the problem of facial expression recognition without losing the reliability of recognition of motor units. During the development of deep learning technology for convolutional neural networks, the following tasks were solved. Firstly, the choice of publicly available convolutional neural networks of the DenseNet and MobileNet families pre-trained on the ImageNet dataset was substantiated, taking into account the peculiarities of transfer learning for the task of recognizing facial expressions and determining emotions. Secondary, a model of a deep convolutional neural network and a method for its training have been developed for solving problems of recognizing facial expressions and determining human emotions, taking into account the specifics of the selected pretrained convolutional neural networks. Thirdly, the developed deep learning technology was tested, and finally, the resource intensity and reliability of recognition of motor units on the DISFA set were assessed. The proposed technology of deep learning of convolutional neural networks can be used in the development of systems for automatic recognition of facial expressions and determination of human emotions for both stationary and mobile devices. Further modification of the systems for recognizing motor units of human facial activity in order to increase the reliability of recognition is possible using of the augmentation technique.
APA, Harvard, Vancouver, ISO, and other styles
48

Statkevych, Vitalii. "Set difference operation for regular Petri net languages for the producer/consumer problem with the bounded buffer." System research and information technologies, no. 2 (September 14, 2021): 94–112. http://dx.doi.org/10.20535/srit.2308-8893.2021.2.08.

Full text
Abstract:
We consider a Petri net for the producer/consumer problem (one of the classical synchronization problems) with the bounded buffer of size n and the regular formal languages Ln, generated by the net. The objective of this paper is to obtain a regular expression for the set difference of languages Ln \ Lm, n > m. For this purpose, we give the finite automaton which accepts the set difference of mentioned languages, and then we use the state elimination method to obtain the regular expression in the recursive form. The main result is illustrated by the examples. In an appendix, we consider the problem with two producers and two consumers with the bounded buffer of size 1. We give a reachability graph and propose the method for obtaining the regular expression. The explicit formulas are given for the problem with two producers and one consumer and also for the problem with one producer and two consumers.
APA, Harvard, Vancouver, ISO, and other styles
49

Pelayo, J. C., and D. M. Yanga. "Linked cluster theory in the spin polaron problem." International Journal of Modern Physics B 33, no. 07 (March 20, 2019): 1950044. http://dx.doi.org/10.1142/s0217979219500449.

Full text
Abstract:
The Linked Cluster Theory in the spin polaron formulation is investigated in this paper using the finite temperature (Matsubara) Green’s function method. We use a representation where holes and spins are described as spinless fermions and normal bosons, respectively. An analytic expression of the thermodynamic potential of high-temperature superconductors in the superconducting state was obtained using the Linked Cluster theory and an expression for its normal state by setting the energy gap to zero. The expression of the thermodynamic potential enabled us to calculate two bulk thermodynamic properties of high-temperature superconductors, entropy and specific heat, both in the normal and superconducting states.
APA, Harvard, Vancouver, ISO, and other styles
50

Sun, Baiqing, Kun Tang, Hongmei Zhang, and Shan Xiong. "An Exact Solution of the Binary Singular Problem." Journal of Function Spaces 2014 (2014): 1–8. http://dx.doi.org/10.1155/2014/580497.

Full text
Abstract:
Singularity problem exists in various branches of applied mathematics. Such ordinary differential equations accompany singular coefficients. In this paper, by using the properties of reproducing kernel, the exact solution expressions of dual singular problem are given in the reproducing kernel space and studied, also for a class of singular problem. For the binary equation of singular points, I put it into the singular problem first, and then reuse some excellent properties which are applied to solve the method of solving differential equations for its exact solution expression of binary singular integral equation in reproducing kernel space, and then obtain its approximate solution through the evaluation of exact solutions. Numerical examples will show the effectiveness of this method.
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!

To the bibliography