Frequent Flyer Cost Estimation

The marketing activity of a modern airline is quite diverse. Under the conditions of an oligopoly, airlines develop their business in competition for a passenger.In modern conditions in Russia, the use of dumping methods of the early 1990s is very ineffective. There are no weak airlines left on the long-distance air transportation market, and in regional markets large companies lose to small regional carriers due to the high cost of performing flights on large-capacity aircrafts of the airline’s fleet.Generally, non-price methods of competition come out on top. Flexible tariff policy, advertising, and high service in servicing passengers remain leading traditional methods of competing for a passenger.This article is devoted to the study of another marketing method for attracting passengers, or rather retaining passengers on the airline’s flights, which is development of bonus programs, frequent flyer programs. PJSC Russian Airlines (Aeroflot) was chosen as the object for the study. The subject of the research is the «Aeroflot Bonus» program.The objective of the study is to study the cost of the program. For research purposes, this is the value of the frequent flyer program point. The problem proposed to be solved is to determine the amount of expenses for implementation of the bonus program of frequent flyers. When solving the problem in its staging part, the assessment is not limited to direct costs associated with the costs of marketing efforts in the form of costs for organising a special advertising department, issuing bonus cards, software, and wages. The estimation refers also to indirect costs in the form of unreceived proceeds from free bonus tickets. Besides, a rough estimate has been made of the airline’s hidden costs due to an unpaid seat on the plane. The study conclusions indicate that hidden costs will be taken into account in calculating the cost of a flight and the bonus program has a right to exist.

Tight Polynomial Bounds for Loop Programs in Polynomial Space

We consider the following problem: given a program, find tight asymptotic bounds on the values of some variables at the end of the computation (or at any given program point) in terms of its input values. We focus on the case of polynomially-bounded variables, and on a weak programming language for which we have recently shown that tight bounds for polynomially-bounded variables are computable. These bounds are sets of multivariate polynomials. While their computability has been settled, the complexity of this program-analysis problem remained open. In this paper, we show the problem to be PSPACE-complete. The main contribution is a new, space-efficient analysis algorithm. This algorithm is obtained in a few steps. First, we develop an algorithm for univariate bounds, a sub-problem which is already PSPACE-hard. Then, a decision procedure for multivariate bounds is achieved by reducing this problem to the univariate case; this reduction is orthogonal to the solution of the univariate problem and uses observations on the geometry of a set of vectors that represent multivariate bounds. Finally, we transform the univariate-bound algorithm to produce multivariate bounds.

The Correlation between Old and New Linguistic Paradigms: A Literature Review Based on Kuhn’s School of Thoughts

This study aims to assess the evidence regarding the relationship between previous and new schools of linguistics. According to Kuhn (1970), old linguistic paradigms incorporate vocabulary and apparatus from previous or traditional paradigms. In particular, this review addresses the Question: Do new paradigms in linguistic arise from old or previous ones, as Kuhn suggested? The study is significant in understanding emerging schools of linguistics based on previous ones. A qualitative literature review was applied to compare new and old schools of linguistics. According to the findings, there is substantial evidence that functionalism, structuralism, and Transformational-Generative Grammar support Kuhn's argument. Most notably, the changes of the transformational-generative grammar from a consistent and straightforward Standard Theory to an improved Extended Standard Theory, and finally, to the Minimalist Program, point towards the same conclusion. Interestingly, the transformations demonstrate how new paradigms arise from old paradigms without borrowing many concepts, terms, and experiments from them. This study draws the attention of linguists in the 21st Century to pay closer attention to the trends in schools of linguistics. 

F_Radish: Enhancing Silent Data Corruption Detection for Aerospace-Based Computing

Radiation-induced soft errors degrade the reliability of aerospace-based computing. Silent data corruption (SDC) is the most dangerous and insidious type of soft error result. To detect SDC, program invariant assertions are used to harden programs. However, there exist redundant assertions in hardened programs, which impairs the detection efficiency. Benign errors are another type of soft error result. An assertion may detect benign errors, incurring unnecessary recovery overhead. The detection degree of an assertion represents the detection capability, and an assertion with a high detection degree can detect severe errors. To improve the detection efficiency and detection degree while reducing the benign detection ratio, F_Radish is proposed in the present work to screen redundant assertions in a novel way. At a program point, the detection degree and benign detection ratio are considered to evaluate the importance of the assertions in the program point. As a result, only the most important assertion remains in the program point. Moreover, the redundancy degree is considered to screen redundant assertions for neighbouring program points. Experimental results show that in comparison with the Radish approach, the detection efficiency of F_Radish is about two times greater. Moreover, F_Radish reduces the benign detection ratio and improves the detection degree. It can avoid more unnecessary recovery overheads and detect more serious SDC than can Radish.

Automated Program-Semantic Defect Repair and False-Positive Elimination without Side Effects

The alarms of the program-semantic defect-detection report based on static analysis include defects and false positives. The repair of defects and the elimination of false positives are time-consuming and laborious, and new defects may be introduced in the process. To solve these problems, the safe constraints interval of related variables and methods are proposed for the semantic defects in the program, and proposes a functionally equivalent no-side-effect program-semantic defect repair and false-positive elimination strategy based on the test-equivalence theory. This paper realizes the automatic repair of the typical semantic defects of Java programs and the automatic elimination of false positives by adding safe constraint patches. After the repair, the program functions are equivalent and the status of each program point is within the safety range, so that the functions before and after the defect repair are consistent, and the functions and semantics before and after the false positives are eliminated. We have evaluated our approach by repairing 5 projects; our results show that the repair strategy does not require manual confirmation of alarms, automated repair of the program effectively, shortened the repair time greatly, and ensured the correctness of the program after the repair.

Conditioned Slicing of Interprocedural Programs

Program slicing is a technique to decompose programs depending on control flow and data flow amongst several lines of code in a program. Conditioned slicing is a generalization of static slicing and dynamic slicing. A variable, the desired program point, and a condition of interest form a slicing criterion for conditioned slicing. This paper proposes an approach to calculate conditioned slices for programs containing multiple procedures. The approach is termed Node-Marking Conditioned Slicing (NMCS) algorithm. In this approach, first and foremost step is to build an intermediate symbolization of a given program code and the next step is to develop an algorithm for finding out conditioned slices. The dependence graph, termed System Dependence Graph (SDG), is used to symbolize intermediate presentation. After constructing SDG, the NMCS algorithm chooses nodes that satisfy a given condition by the process of marking and unmarking. The algorithm also finds out conditioned slices for every variable at every statement during the process. NMCS algorithm employs a stack to save call context of a method. Few edges in SDG are labeled to identify the statement that calls a method. The proposed algorithm is implemented, and its performance is tested with several case study projects.

PEMBERDAYAAN MASYARAKAT MELALUI PENDIDIKAN PERENCANAAN DAN PENGELOLAAN KEUANGAN DAN INVESTASI BAGI UMKM DALAM RANGKA PENGEMBANGAN USAHA DAN PENINGKATAN KUALITAS HIDUP KELUARGA

Community Engamenet Program gives the skill of planning and financing education forSmall Medium Entreprises (SME), how they make business plan begin budgeting, raising the fund,create financial statement, buseiness development and investing to enhance their wealth of family.This program delivered to 30 SME of Assosiation of Depok Creative Industries (AIKD). Someactivities delivered are training and business assistance. The aims of program point out somechanges before and after program impelementation. The SME have positive behavior in financing.The success indicators are the SME have financial statement of entrepreises and their family. Inotherwise they they can make financial decision wisdom to depelove their entreprises. Hopelly, thisprogram be allowed to to their business needs and can continue and consisten.Key words : SME, financial planning, training and assistance.

Frequent Statement and Dereference Elimination for Imperative and Object-Oriented Distributed Programs

This paper introduces new approaches for the analysis offrequent statement and dereference eliminationfor imperative and object-oriented distributed programs running on parallel machines equipped with hierarchical memories. The paper uses languages whose address spaces are globally partitioned. Distributed programs allow defining data layout and threads writing to and reading from other thread memories. Three type systems (for imperative distributed programs) are the tools of the proposed techniques. The first type system defines for every program point a set of calculated (ready) statements and memory accesses. The second type system uses an enriched version of types of the first type system and determines which of thereadystatements and memory accesses are used later in the program. The third type system uses the information gather so far to eliminate unnecessary statement computations and memory accesses (the analysis offrequent statement and dereference elimination). Extensions to these type systems are also presented to cover object-oriented distributed programs. Two advantages of our work over related work are the following. The hierarchical style of concurrent parallel computers is similar to the memory model used in this paper. In our approach, each analysis result is assigned a type derivation (serves as a correctness proof).

The Roller Disassembly and Assembly Machine Controlled by PLC

This paper provides a kind of roller maintain machine. It introduced the structure and the working principle of the roller disassembly and assembly machine. According to the work requirements, selected the PLC Toshiba's F1-20MR，to realize the switching sequence control function. Analyzed machine's work flow, Designed the PLC control program. Point out the advantage that using PLC replaced the original relay logic control systems: flexible application and good generality, high reliability and environmental adaptability; the program is simple to grasp easy.