  • A
  • A
  • A
  • АБB
  • АБB
  • АБB
  • А
  • А
  • А
  • А
  • А
Обычная версия сайта
Найдены 52 823 публикации
Сортировка:
по названию
по году
Статья
Bazhenova E.A., Danilevskaya N., Tikhomirova L. et al. The Social Sciences. 2016. No. 11 (22). P. 5174-5186.

In article slogans of automobile advertising for the purpose of directing their substantial and stylistic features are analyzed. The analysis is carried out on material of texts in two languages – Russian and Chinese. The comparative aspect is used with intention to define the ethnic features of perceiving the same event imprinted in language in human life – the car. The modern world differs in the fact that in it two counter tendencies at the same time develop: globalization (a join/interlacing of cultures and economies of the different countries and the people) and the fissile military-political opposition directed to suppression with each other of cultures and the people. Such situation is dramatic as it leads to the numerous international conflicts, on the one hand, and with another – is one of the reasons of attenuation of interest of people in the cultural (national) sources. Today in the Russian society the modern language ("Newspeak") for which feeding base is the mass culture which does not have legible communications with moral cultural wealth of the previous generations, and, on the contrary, applying for the post of a global (universal) reference point in speech behavior for the person of the world is formed. In this situation defensive reaction of people with a civic stand, including the aspiration of linguists and culturologists to study features of mass culture with the purpose to oppose it the logic of national communication checked time when language, native on structure, reflects "family" for it cultural wealth amplifies. Initial research position is conviction of authors that in the conditions of globalization studying of an originality of pictures of the world of the different people can promote development of the design relations between the different states, and also strengthening of positive tendencies in political interaction between counter military blocks.

Добавлено: 12 января 2017
Статья
Suvorov A., Tsybuleva N. The B.E. Journal of Theoretical Economics. 2010. Vol. 10. No. 1.
Добавлено: 21 июля 2015
Статья
Gerasimova K. Science and Engineering Ethics. 2018. Vol. 24. No. 2. P. 455-477.
Добавлено: 1 августа 2017
Статья
Хорошилов А. В., Щепетков И. Труды Института системного программирования РАН. 2017. Т. 29. № 3. С. 43-56.

В статье рассматривается семейство требований доверия к безопасности ADV_SPM «Моделирование политики безопасности», которое определяется стандартом ГОСТ Р ИСО/МЭК 15408-3-2013 «Критерии оценки безопасности информационных технологий. Часть 3. Компоненты доверия к безопасности». Обсуждаются задачи, решаемые этим семейством, и вопросы, которые возникают при попытке интерпретировать его требования. На простом примере представляется подход к формализации политик безопасности при помощи языка формальных спецификаций Event-B и инструментов платформы Rodin.

Добавлено: 28 августа 2017
Статья
Elizaveta Okorokova, Linderman M., Ossadtchi A. et al. Frontiers in Neuroscience. 2015. Vol. 9. No. 389. P. 1-15.

In recent years, several assistive devices have been proposed to reconstruct arm and hand movements from electromyographic (EMG) activity. Although simple to implement and potentially useful to augment many functions, such myoelectric devices still need improvement before they become practical. Here we considered the problem of reconstruction of handwriting from multichannel EMG activity. Previously, linear regression methods (e.g., the Wiener filter) have been utilized for this purpose with some success. To improve reconstruction accuracy, we implemented the Kalman filter, which allows to fuse two information sources: the physical characteristics of handwriting and the activity of the leading hand muscles, registered by the EMG. Applying the Kalman filter, we were able to convert eight channels of EMG activity recorded from the forearm and the hand muscles into smooth reconstructions of handwritten traces. The filter operates in a causal manner and acts as a true predictor utilizing the EMGs from the past only, which makes the approach suitable for real-time operations. Our algorithm is appropriate for clinical neuroprosthetic applications and computer peripherals. Moreover, it is applicable to a broader class of tasks where predictive myoelectric control is needed.

Добавлено: 15 декабря 2015
Статья
Saritas O., Dranev Y., Chulok A.A. Foresight. 2017. Vol. 19. No. 5. P. 473-490.
Добавлено: 12 сентября 2017
Статья
Pavel Sukhov, Mikhail Batsyn, Petr Terentev. Procedia Computer Science. 2014. Vol. 31. P. 773-777.
Добавлено: 7 июня 2014
Статья
Старикова И. В. Philosophia Mathematica. 2018. Vol. 26. No. 2. P. 161-183.
Добавлено: 15 июня 2018
Статья
Sidorkin A. M. Journal of Philosophy of Education. 2001. Vol. 35. No. 1. P. 21-30.
Добавлено: 16 сентября 2013
Статья
Zvyagina A. I., Melnikova E. K., Averin A. A. et al. Carbon. 2018. Vol. 134. P. 62-70.
Добавлено: 16 июля 2018
Статья
Odesskii A., Feigin B. L. International Mathematics Research Notices. 1997. No. 11. P. 531-539.
Добавлено: 1 июня 2010
Статья
Zlotnik A. A., Koltsova N. Computational Methods in Applied Mathematics. 2013. Vol. 13. No. 2. P. 119-138.

An initial-boundary value problem for the 1D self-adjoint parabolic equation on the half-axis is solved. We study a broad family of two-level finite-difference schemes with two parameters related to averages both in time and space. Stability in two norms is proved by the energy method. Also discrete transparent boundary conditions are rigorously derived for schemes by applying the method of reproducing functions. Results of numerical experiments are included as well.

Добавлено: 6 апреля 2013
Статья
Marshall I., Wojciechowski S., Fordy A. Physics Letters A. 1986. No. 113A. P. 395-400.
Добавлено: 30 октября 2010
Статья
Babenko M. A. Theory of Computing Systems. 2010. No. 46(1). P. 59-79.
Let G be an undirected graph and be a collection of disjoint subsets of nodes. Nodes in T 1∪⋅⋅⋅∪T k are called terminals, other nodes are called inner. By a TeX -path we mean a path P such that P connects terminals from distinct sets in TeX and all internal nodes of P are inner. We study the problem of finding a maximum cardinality collection ℘ of TeX -paths such that at most two paths in ℘ pass through any node. Our algorithm is purely combinatorial and has the time complexity O(mn 2), where n and m denote the numbers of nodes and edges in G, respectively.
Добавлено: 17 декабря 2010
Статья
Zlotnik A.A., Zlotnik I.A. Doklady Mathematics. 2017. Vol. 95. No. 2. P. 129-135.

A new fast direct algorithm for implementing a finite element method (FEM) of order on rectangles as applied to boundary value problems for Poisson-type equations is described that extends a well-known algorithm for the case of difference schemes or bilinear finite elements (n = 1). Its core consists of fast direct and inverse algorithms for expansion in terms of eigenvectors of one-dimensional eigenvalue problems for an nth-order FEM based on the fast discrete Fourier transform. The amount of arithmetic operations is logarithmically optimal in the theory and is rather attractive in practice. The algorithm admits numerous further applications (including the multidimensional case).

Добавлено: 28 февраля 2017
Статья
Larisa Komosko, Mikhail Batsyn, Pablo San Segundo . et al. Journal of Combinatorial Optimization. 2016. No. 4. P. 1665-1677.
Добавлено: 13 июля 2015
Статья
Babenko M. A., Artamonov S. European Journal of Combinatorics. 2018. P. 3-23.

A perfect 2-matching in an undirected graph G=(V,E) is a function x:E→0,1,2 such that for each node v∈V the sum of values x(e) on all edges e incident to v equals 2. If supp(x)=e∈E∣x(e)≠0 contains no triangles then x is called triangle-free. Polyhedrally speaking, triangle-free 2-matchings are harder than 2-matchings, but easier than usual 1-matchings. Given edge costs c:E→R + , a natural combinatorial problem consists in finding a perfect triangle-free matching of minimum total cost. For this problem, Cornuéjols and Pulleyblank devised a combinatorial strongly-polynomial algorithm, which can be implemented to run in O(VElogV) time. (Here we write V, E to indicate their cardinalities |V|, |E|.) If edge costs are integers in range [0,C] then for both 1- and 2-matchings some faster scaling algorithms are known that find optimal solutions within O(Vα(E,V)logVElog(VC)) and O(VElog(VC)) time, respectively, where α denotes the inverse Ackermann function. So far, no efficient cost-scaling algorithm is known for finding a minimum-cost perfect triangle-free2-matching. The present paper fills this gap by presenting such an algorithm with time complexity of O(VElogVlog(VC)).

Добавлено: 1 марта 2018
Статья
Akhmedov E., Popov F. Journal of High Energy Physics. 2015. Vol.  1509. No.  1509. P. 085.
Добавлено: 6 октября 2015
Статья
V.A. Vassiliev. Arnold Mathematical Journal. 2015. Vol. 1. No. 2. P. 201-209.
Добавлено: 19 января 2016
Статья
Glutsyuk A. Panoramas and Synthèses. 2011. Vol. 34. P. 149-202.
Добавлено: 9 марта 2013
Статья
Kishimoto T., Yuri Prokhorov, Zaidenberg M. Osaka Journal of Mathematics. 2014. Vol. 51. No. 4. P. 1093-1113.

We address the following question: When an affine cone over a smooth Fano threefold admits an effective action of the additive group? In this paper we deal with Fano threefolds of index 1 and Picard number 1. Our approach is based on a geometric criterion from our previous paper, which relates the existence of an additive group action on the cone over a smooth projective variety X with the existence of an open polar cylinder in X. Non-trivial families of Fano threefolds carrying a cylinder were found in loc. cit. Here we provide new such examples.

Добавлено: 10 октября 2013
https://publications.hse.ru/articles/page17.html
publications.hse.ru
crawl=CC-MAIN-2019-04
93976
application/http; msgtype=response
sha1:DPMB72CFKMBXCIOSR3WUKKACT5ZMTQUR
<urn:uuid:bf6be05f-6f63-4d1c-90b4-3fb4fdcdc9a9>
2019-01-17T05:02:59Z
212.8.235.7
text/html
sha1:4JFAADT5CUPWOY4IZCA4IEWCWDPESOZG
<urn:uuid:a20989bd-bf67-4a48-afc6-386de4d94f95>
https://publications.hse.ru/articles/page17.html
response
<urn:uuid:2a3b6796-e59d-4ccb-8fa1-58d32fa58523>
isPartOf: CC-MAIN-2019-04
publisher: Common Crawl
description: Wide crawl of the web for January 2019
operator: Common Crawl Admin (info@commoncrawl.org)
hostname: ip-10-159-152-254.ec2.internal
software: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)
robots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)
format: WARC File Format 1.1
conformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/