Abstract:

Smart contract technology based on artificial intelligence background is gradually becoming a brand-new path to improve the efficiency of economic transactions due to its unique advantages. This paper initially explores the impact of smart contract technology on economic transaction efficiency through empirical analysis of models and data. The credit mechanism is introduced as an intermediate variable to analyze its mediating effect in the process of improving economic transaction efficiency by smart contract technology. The optimization of Fabric transaction mechanism is realized by using the improved credit model, which further exerts the role of smart contract technology in enhancing economic transaction efficiency. The principal component analysis is used to calculate the comprehensive score of economic transaction efficiency before and after the optimization of smart contract trading mechanism to show the effect of the development of smart contract technology on the improvement of economic transaction efficiency. This paper concludes that the development of smart contract technology will significantly and positively promote the improvement of economic transaction efficiency through benchmark regression analysis, mediation effect test and other methods. After the optimization of smart contract transaction mechanism, the comprehensive score of economic transaction efficiency produces significant improvement compared with the pre-optimization period, in which the average value of the comprehensive score of transaction efficiency in Guangdong, Jiangsu, Shanghai, and Beijing is improved by 20.18%, 24.52%, 33.77%, and 35.54%, respectively. It further indicates that smart contract technology is an effective path to improve economic transaction efficiency.

Abstract:

In the context of globalization where market competition is becoming more and more intense, strategic human resource management (SHRM) plays an important role in enhancing corporate competitiveness. Through structural equation modeling and multiple linear regression methods, this paper reveals the complex paths of SHRM perceptions on employee proactive behaviors, and uses convolutional neural network pairs to explore the nonlinear relationships in the model and validate the results of SEM analysis. Overall, SHRM perception has a significant positive effect on employee proactive behavior (β=0.254, p<0.001). The indirect effect values of job self-efficacy and conceptual psychological contract as mediators were 0.1043 and 0.1726, respectively, which were both positive, i.e., they played a mediating role in the mechanistic effect of SHRM perceptions on employees' proactive behaviors. Insider identity perception, on the other hand, has a significant positive moderating effect between SHRM perception and employee-initiated behavior (β=0.09, p<0.01). The importance of independent variables using CNN model was ranked in descending order as: conceptual psychological contract, job self-efficacy, SHRM perception, job category, and insider identity perception, which was consistent with the results of SEM analysis, revealing the significance of convolutional neural network in optimizing human resource management strategies and enhancing employee motivation.

Abstract:

The rapid development of information technology makes intelligent decision support system play an increasingly important role in economic standardized management. The Intelligent Decision Support System (IDSS) constructed in this paper includes interaction layer, analysis layer and data layer. The system standardizes the management of enterprise economy through strategic forecasting and decision analysis, economic planning and control, and economic analysis. The study combines the fuzzy hierarchical analysis method (FAHP) and the fuzzy comprehensive evaluation method (FCE) to evaluate the standardized level of economic management of enterprise A. The evaluation score of the standardized level of enterprise A’s economic management is , which is greater than 80, and it belongs to the grade of “good”. It shows that the intelligent decision support system constructed based on this paper can effectively help standardize the management of enterprise economy.

Abstract:

With the development of renewable energy technology and the pursuit of sustainable development in the construction industry, the design of direct-soft photovoltaic systems integrated with buildings has become an important research direction. In this paper, a variety of photovoltaic power generation modules are selected and combined with building roof functions to design a solar photovoltaic building integration system. In addition, this paper constructs a multi-objective optimization configuration model, improves the multi-objective particle swarm algorithm, and analyzes the optimization effect of the improved particle swarm algorithm on the photovoltaic building integration system by using multiple sets of test functions and evaluation indexes, combined with a number of experiments. The improved particle swarm algorithm in this paper converges to the optimal value of 0.21 when iterating to 25 rounds. And with the increase of the number of nodes, the optimized particle swarm algorithm, the distribution of node voltages in the vicinity of the standard voltage. The PV building integrated system designed in this paper still has a generation output efficiency higher than 85% after 20 years, which shows good stability of power generation. And the power generation in its whole life cycle is about 1645710kwh, which greatly reduces the consumption of conventional energy. In conclusion, the PV building integrated system in this paper not only has significant advantages in terms of capacity efficiency, but also shows strong potential for environmental protection.

Abstract:

As the birthplace of national culture, traditional villages can convey cultural and social natures through spatial configuration. Based on the theory of spatial syntax, this paper combines the genetic algorithm to design the fitness function for optimization, and selects the streets and lanes of Wengji Village as the research sample, focusing on the analysis of its morphological evolution mechanism from 1975 to 2020. Through quantitative analysis, it is found that although the streets and alleys of Wengji Village show spatial scale expansion due to social and economic development, the village streets and alleys can still maintain the original spatial texture and style. The integration degree, selectability, synergy (0.4273~0.6395) and comprehensibility (0.3744~0.5761) of the streets and alleys in Wengji Village are all characterized by increasing, indicating that the spatial accessibility, spatial openness and spatial wholeness of the streets and alleys in Wengji Village have been improved. However, the degree of synergy and comprehensibility are still lower than 0.7, and there is some room for optimization of the wholeness and cognizability of the streets and lanes of Wengji Village. It is necessary to protect and continue the overall structure of the village, optimize and integrate the key spaces of the village, and rationally control the development process of the village, so as to promote the protection of the spatial form of the streets and lanes of Wengji Village and the continuation of the cultural lineage.

Tareq Abed Mohammed1, Ahmed K. Abbas2, Rasha Qays Aswad3
1College of Computer Science and Information Technology University of Kirkuk
2Collage of Education for pure science University of Diyala
3Collage of Education Al-Muqdad University of Diyala
Abstract:

In the context of big data, many problems connected with usage of classical techniques in computing large and complicated data have emerged. For a true disruption of silicon and computational power, there is quantum computing which is poised to redefine itself in the future. Quantum computing is the area of study for this research; real-time big data processing with a specific emphasis on speed. In a sequence of experiments, the performance of quantum algorithms was compared to the performance of classical algorithms regarding large-scale data processes. These findings imply that the compared quantum algorithm has enhanced the processing time while providing on average 70%-time reduction as well as 30 percent improvement of the computational efficiency. Besides, the scalability of quantum computing is also better; it remains effective when used on large datasets, and it has an accuracy of 95% that is higher than classical one. This outcome depiction the power of quantum computing in the alteration of data processing tactics. However, there are some issues like quantum decoherence and error rates, which are guaranteeing the non-stability of quantum computing, but they are expecting more improvements in the field of quantum hardware and error correction. From this study, it consequently becomes clear why the advancement of quantum technology should continue and for what; to meet the challenges of big data.

R. Ponraj1, K. Annathurai2, R. Kala3
1Department of Mathematics, Sri Paramakalyani College, Alwarkurichi-627 412 India.
2Department of Mathematics Thiruvalluvar College, Papanasam–627 425, India.
3Department of Mathematics, Manonmaniam Sundaranar University, Tirunelveli-627012, India.
Abstract:

Let \(G\) be a \((p,q)\) graph. Let \(f\) be a function from \(V(G)\) to the set \(\{1,2,\ldots, k\}\) where \(k\) is an integer \(2< k\leq \left|V(G)\right|\). For each edge \(uv\) assign the label \(r\) where \(r\) is the remainder when \(f(u)\) is divided by \(f(v)\) (or) \(f(v)\) is divided by \(f(u)\) according as \(f(u)\geq f(v)\) or \(f(v)\geq f(u)\). \(f\) is called a \(k\)-remainder cordial labeling of \(G\) if \(\left|v_{f}(i)-v_{f}(j)\right|\leq 1\), \(i,j\in \{1,\ldots , k\}\) where \(v_{f}(x)\) denote the number of vertices labeled with \(x\) and \(\left|\eta_{e}(0)-\eta_{o}(1)\right|\leq 1\) where \(\eta_{e}(0)\) and \(\eta_{o}(1)\) respectively denote the number of edges labeled with even integers and number of edges labeled with odd integers. A graph with admits a \(k\)-remainder cordial labeling is called a \(k\)-remainder cordial graph. In this paper we investigate the \(4\)-remainder cordial labeling behavior of Prism, Crossed prism graph, Web graph, Triangular snake, \(L_{n} \odot mK_{1}\), Durer graph, Dragon graph.

Noah Lebowitz-Lockard1, Joseph Vandehey1
1Noah Lebowitz-Lockard and Joseph Vandehey Department of Mathematics University of Texas at Tyler, Tyler, TX 75799
Abstract:

Behera and Panda defined a balancing number as a number b for which the sum of the numbers from \(1\) to \(b – 1\) is equal to the sum of the numbers from \(b + 1\) to \(b + r\) for some r. They also classified all such numbers. We define two notions of balancing numbers for Farey fractions and enumerate all possible solutions. In the stricter definition, there is exactly one solution, whereas in the weaker one all sufficiently large numbers work. We also define notions of balancing numbers for levers and mobiles, then show that these variants have many acceptable arrangements. For an arbitrary mobile, we prove that we can place disjoint consecutive sequences at each of the leaves and still have the mobile balance. However, if we impose certain additional restrictions, then it is impossible to balance a mobile.

AP Burger1, JH van Vuuren2
1Department of Logistics, Stellenbosch University, Private Bag X1, Matieland, 7602, South Africa.
2Stellenbosch Unit for Operations Research in Engineering, Department of Industrial Engineering, Stellenbosch University, Private Bag X1, Matieland, 7602, South Africa.
Abstract:

For a graph G and for non-negative integers p, q, and r, the triplet \((p, q, r)\) is said to be an admissible triplet if \(3p + 4q + 6r = |E(G)|\). If G admits a decomposition into p cycles of length 3, q cycles of length 4, and r cycles of length 6 for every admissible triplet \((p, q, r)\), then we say that G has a \(\{C_{3}^{p}, C_{4}^{q}, C_{6}^{r}\}\)-decomposition. In this paper, the necessary conditions for the existence of \(\{C_{3}^{p}, C_{4}^{q}, C_{6}^{r}\}\)-decomposition of \(K_{\ell, m, n} (\ell \leq m \leq n)\) are proved to be sufficient. This affirmatively answers the problem raised in Decomposing complete tripartite graphs into cycles of lengths 3 and 4, Discrete Math. 197/198 (1999), 123-135. As a corollary, we deduce the main results of Decomposing complete tripartite graphs into cycles of lengths 3 and 4, Discrete Math., 197/198, 123-135 (1999) and Decompositions of complete tripartite graphs into cycles of lengths 3 and 6, Austral. J. Combin., 73(1), 220-241 (2019).

Gyaneshwar Agrahari1, Dalibor Froncek2
1Louisiana State University, Baton Rouge, Louisiana
2University of Minnesota Duluth, United States
Abstract:

A graph G(V, E) is Γ-harmonious when there is an injection f from V to an Abelian group Γ such that the induced edge labels defined as w(xy) = f(x) + f(y) form a bijection from E to Γ. We study Γ-harmonious labelings of several cycles-related classes of graphs, including Dutch windmills, generalized prisms, generalized closed and open webs, and superwheels.