A GENERALIZATION OF THE SHIFT OPERATOR

Author(s):  
Yurii S. Saranchuk ◽  
Aleksandr A. Tatarkin

Several approaches are known to generalize the shift operator in the complex domain. Specific generalization procedures lead to significantly different operators of the shift type even in one specific area of complex analysis. In this paper, a certain general operator of the shift type is defined. The properties of this operator are studied and the question of the continuity of this definition is considered. The properties of a certain operator to a certain extent re-peat the properties of the previously studied operators of the shift type. This allows us to speak of the possibility of extending the main results on spectral synthesis in the complex domain to convolutional equations of a more general form.

2020 ◽  
Vol 54 (2) ◽  
pp. 1-7
Author(s):  
Toine Bogers ◽  
Marijn Koolen ◽  
Bamshad Mobasher ◽  
Casper Petersen ◽  
Alexander Tuzhilin

During the past decade, recommender systems have rapidly become an indispensable element of websites, apps, and other platforms that are looking to provide personalized interaction to their users. As recommendation technologies are applied to an ever-growing array of non-standard problems and scenarios, researchers and practitioners are also increasingly faced with challenges of dealing with greater variety and complexity in the inputs to those recommender systems. For example, there has been more reliance on fine-grained user signals as inputs rather than simple ratings or likes. Many applications also require more complex domain-specific constraints on inputs to the recommender systems. The outputs of recommender systems are also moving towards more complex composite items, such as package or sequence recommendations. This increasing complexity requires smarter recommender algorithms that can deal with this diversity in inputs and outputs. The ComplexRec workshop series offers an interactive venue for discussing approaches to recommendation in complex scenarios that have no simple one-size-fits-all solution.


Author(s):  
Aleksandr A. Tatarkin

The traditional approach to solving a specific problem of spectral synthesis in a complex domain involves reducing it to the problem of local description of closed submodules in a certain space of entire functions. The last problem is split into checking the stability and saturation of the submodule under study. This approach turned out to be very effective, for example, in the study of submodules of local rank 1 and in the study of submodules in topological modules associated with unbounded convex domains. Recent studies on spectral synthesis in the complex domain are based on a different scheme. This scheme involves reducing the problem of local description to checking the density of polynomials in a special module of entire functions of exponential type. Moreover, the space under study is a separable locally convex space of type (LN)*. Polynomial approximation in such a space is understood by us as sequential approximation, that is, we are talking about the approximation of space elements by ordinary (not generalized) sequences of polynomials. In this article, we study a special locally convex module of entire vector functions over the ring of polynomials in the degree of the independent variable. The theorem proved in the article can serve as a source of new results on spectral synthesis in the complex domain.


2014 ◽  
Vol 29 ◽  
pp. 39-52 ◽  
Author(s):  
Delroy Cameron ◽  
Amit P. Sheth ◽  
Nishita Jaykumar ◽  
Krishnaprasad Thirunarayan ◽  
Gaurish Anand ◽  
...  

2021 ◽  
Vol 18 (4) ◽  
pp. 1-23
Author(s):  
Tobias Gysi ◽  
Christoph Müller ◽  
Oleksandr Zinenko ◽  
Stephan Herhut ◽  
Eddie Davis ◽  
...  

Most compilers have a single core intermediate representation (IR) (e.g., LLVM) sometimes complemented with vaguely defined IR-like data structures. This IR is commonly low-level and close to machine instructions. As a result, optimizations relying on domain-specific information are either not possible or require complex analysis to recover the missing information. In contrast, multi-level rewriting instantiates a hierarchy of dialects (IRs), lowers programs level-by-level, and performs code transformations at the most suitable level. We demonstrate the effectiveness of this approach for the weather and climate domain. In particular, we develop a prototype compiler and design stencil- and GPU-specific dialects based on a set of newly introduced design principles. We find that two domain-specific optimizations (500 lines of code) realized on top of LLVM’s extensible MLIR compiler infrastructure suffice to outperform state-of-the-art solutions. In essence, multi-level rewriting promises to herald the age of specialized compilers composed from domain- and target-specific dialects implemented on top of a shared infrastructure.


Archeion ◽  
2020 ◽  
pp. 411-444
Author(s):  
Dariusz Makowski

Archives and IT systems in public administration. Introduction to the issue The subject of ICT systems currently in use in public administration units in Poland is incredibly extensive. On the one hand, it can be considered in the formal and legal context and on the other from a strictly technical point of view, related to the architecture or structure of applications, as well as software and hardware solutions used in them. The author has made an attempt to analyse issues related to the functioning of ICT systems, paying particular attention to domain-specific systems implemented in public administration units. The main matter under consideration are legal regulations concerning the essence of ICT systems, as well as handling electronic documentation stored in them. Domain-specific systems are independent ICT systems developed to provide services for a specific area of activity of a given institution, intended for carrying out strictly defined and specialised tasks. Such systems should make it possible to carry out all activities arising from legal provisions which concern the processing of data or compiling and storing documentation, which is managed in a way that reflects the whole decision-making process. The author made an attempt to present the most important issues related to the functioning of such ICT systems in public administration units in Poland. The article discusses legal regulations concerning such systems (and the way in which they are presented in applicable office and archive provisions), attempts to systematise and classify them and characterises their structure and basic tasks. The article presents issues of utmost importance from the point of view of state archives, related to the possibility of taking over archive materials. Attention was drawn not only to formal, legal or technical possibilities, but also organizational ones. The author characterises the manner and methods which can be used to judge the value of documentation coming from such systems. The author pointed out the most important research areas which concern the discussed issues: the place of domain-specific systems in modern offices and in electronic office administration, storing and securing electronic documents and shaping national archival resources. Nowadays, when we are dealing with a dynamic growth of various types of ICT systems, it is extremely important to protect documentation of a historical value, compiled in such systems.


Author(s):  
Delroy Cameron ◽  
Amit Sheth ◽  
Nishita Jaykumar ◽  
Krishnaprasad Thirunarayan ◽  
Gaurish Anand ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document