Complex Problems Solution as a Service Based on Predictive Optimization and Tasks Orchestration in Smart Cities

Smart cities have different contradicting goals having no apparent solution.The selection of the appropriate solution,which is considered the best compromise among the candidates,is known as complex problem-solving.Smart city administrators face different problems of complex nature,such as optimal energy trading in microgrids and optimal comfort index in smart homes,to mention a few.This paper proposes a novel architecture to offer complex problem solutions as a service(CPSaaS)based on predictive model optimization and optimal task orchestration to offer solutions to different problems in a smart city.Predictive model optimization uses a machine learning module and optimization objective to compute the given problem’s solutions.The task orchestration module helps decompose the complex problem in small tasks and deploy them on real-world physical sensors and actuators.The proposed architecture is hierarchical and modular,making it robust against faults and easy to maintain.The proposed architecture’s evaluation results highlight its strengths in fault tolerance,accuracy,and processing speed.

EQUATION IN COMPLEX VARIABLE OF AXISYMMETRICAL DEFORMATION PROBLEMS FOR A GENERAL SHELL OF REVOLUTION

In this paper, the equation of axisymmetrical deformation problems for a general shell of revolution is derived in one complex variable under the usual Love-Kirchhoff assumption. In the case of circular ring shells, this equation may be simplified into the equation given by F.Tdlke(1938)[3]. R.A. Clark(1950 )[4] and V. V.Novozhilov(1951)[5]. When the horizontal radius of the shell of revolution is much larger than the average radius of curvature of meridian curve, this equation in complex variable may be simplified into the equation for slander ring shells. If the ring shell is circular in shape, then this equation can be reduced into the equation in complex variable for slander circular ring shells given by this author (1979)[6]. If the form of elliptic cross-section is near a circle, then the equation of slander ring shell with near-circle ellipitic cross-section may be reduced to the complex variable equation similar in form for circular slander ring shells.

THE AVERAGE CASE COMPLEXITY OF THE SHIFT-INVARIANT PROBLEM

The present paper deals with the average case complexity of the shift—invariant problem. The main aim is to give a new proof of the upper bound of average error of finite element method. Our method is based on the techniques proposed by Heinrich (1990). We also point out an essential error regarding the proof of the upper bound in A. G. Werschulz (1991).

Modeling complex crack problems using the three-node triangular element fitted to numerical manifold method with continuous nodal stress

A three-node triangular element fitted to numerical manifold method with continuous nodal stress, called Trig_3-CNS(NMM)element, was recently proposed for linear elastic continuous problems and linear elastic simple crack problems. The Trig_3-CNS(NMM) element can be considered as a development of both the Trig_3-CNS element and the numerical manifold method(NMM).Inheriting all the advantages of Trig_3-CNS element, calculations using Trig_3-CNS(NMM) element can obtain higher accuracy than Trig_3 element without extra degrees of freedom(DOFs) and yield continuous nodal stress without stress smoothing. Inheriting all the advantages of NMM, Trig_3-CNS(NMM) element can conveniently treat crack problems without deploying conforming mathematical mesh. In this paper,complex problems such as a crucifix crack and a star-shaped crack with many branches are studied to exhibit the advantageous features of the Trig_3-CNS(NMM) element. Numerical results show that the Trig_3-CNS(NMM) element is prominent in modeling complex crack problems.

Counting Problems in Parameterized Complexity

Parameterized complexity is a multivariate theory for the analysis of computational problems. It leads to practically efficient algorithms for many NP-hard problems and also provides a much finer complexity classification for other intractable problems. Although the theory is mostly on decision problems, parameterized complexity naturally extends to counting problems as well. The purpose of this article is to survey a few aspects of parameterized counting complexity, with a particular emphasis on some general frameworks in which parameterized complexity proves to be indispensable.

Some Open Problems in Parameterized Complexity Related to the Work of Jianer Chen

This short paper highlights some open problems related to the work of Jianer Chen in the area of parameterized/multivariate algorithmics.

The Maximum Trigonometric Degrees of Quadrature Formulae with Prescribed Nodes

The purpose of this paper is to study the maximum trigonometric degree of the quadrature formula associated with m prescribed nodes and n unknown additional nodes in the interval（-π, π]. We show that for a fixed n, the quadrature formulae with m and m ＋ 1 prescribed nodes share the same maximum degree if m is odd. We also give necessary and sufficient conditions for all the additional nodes to be real, pairwise distinct and in the interval（-π, π] for even m, which can be obtained constructively. Some numerical examples are given by choosing the prescribed nodes to be the zeros of Chebyshev polynomials of the second kind or randomly for m ≥ 3.

A Curriculum Cluster Teaching Model of Software Engineering from the Metaverse Perspective

To solve the teaching difficulties,including hard cultivating engineering thinking,a reasonable transition of professional training,and deep cooperation of students,which impeded the cultivation effectiveness of students’ability to solve complex engineering problems,the paper proposed a Zongheng group teaching model of curriculum cluster based on projects.Firstly,from the perspective of Metaverse,and considering the professional,current teaching situation and learning situation,we analyzed the professional background and proposed the Zongheng group teaching model of curriculum cluster.Then,the connotation,teaching construction and implementation details are explained.After that,we summarized the teaching effect about the 2 years of exploration and practice in the major of software engineering at College of Computer and Information Technology in Mudanjiang Normal University,to clarify the effect of teaching reform.2 years of teaching practice shows that making full use of the advantages of curriculum cluster,Zongheng group and the project-based teaching method,the long-range training,in-depth student cooperation,and the students’ability of solving complex engineering problems are improved.

New procedure to generate multipliers in complex Neumann problem and effective Kohn algorithm

The purpose of this paper is threefold.(i) To explain the effective Kohn algorithm for multipliers in the complex Neumann problem and its difference with the full-real-radical Kohn algorithm, especially in the context of an example of Catlin-D'Angelo concerning the ineffectiveness of the latter.(ii) To extend the techniques of multiplier ideal sheaves for the complex Neumann problem to general systems of partial differential equations.(iii) To present a new procedure of generation of multipliers in the complex Neumann problem as a special case of the multiplier ideal sheaves techniques for general systems of partial differential equations.

Progress in Computational Complexity Theory

We briefly survey a number of important recent uchievements in Theoretical Computer Science （TCS）, especially Computational Complexity Theory. We will discuss the PCP Theorem, its implications to inapproximability on combinatorial optimization problems; space bounded computations, especially deterministic logspace algorithm for undirected graph connectivity problem; deterministic polynomial-time primality test; lattice complexity, worst-case to average-case reductions; pseudorandomness and extractor constructions; and Valiant＇s new theory of holographic algorithms and reductions.

0N THE COMPLEXITY OF AN OPTIMAL ROUTING TREE PROBLEM

A routing tree for a set of tasks is a decision tree which assigns the tasks to their destinationsaccording to the features of the tasks. A weighted routing tree is one with costs attached to each linkof the tree. Links of the same feature have the same cost. It is proved that the problem of finding ?routing tree of the minimum cost for a given set of tasks of two features is NP-complete.

New-Type Urbanization and the Development of the Sciences of Human Settlements in China

As urbanization is an evolutionary process of the open giant system of complex spaces,solutions should be sought based on the scientifi c method of "limited solutions to complex problems." Firstly,as people are the core of human settlements,urbanization should show its care for humans and thus for human settlements; secondly,a human settlement civilization should be cultivated on the basis of ecological civilization; thirdly,rural development should be promoted in units of county,in order to coordinate the urban-rural development; fourthly,it should encourage the decision-makers and think tanks to improve the management mechanism. As transformation becomes the general trend of this era,we need also to understand the Sciences of Human Settlements from the perspective of scientifi c transformation,which is expected to break new grounds in the Sciences of Human Settlements.

Solution to the Generalized Champagne Problem on simultaneous stabilization of linear systems

The well-known Generalized Champagne Problem on simultaneous stabilization of linear systems is solved by using complex analysis and Blonders technique. We give a complete answer to the open problem proposed by Patel et al., which automatically includes the solution to the original Champagne Problem. Based on the recent development in automated inequality-type theorem proving, a new stabilizing controller design method is established. Our numerical examples significantly improve the relevant results in the literature.

A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR P_*(κ) LINEAR COMPLEMENTARITY PROBLEM

This paper proposes a new infeasible interior-point algorithm with full-Newton steps for P_*(κ) linear complementarity problem(LCP),which is an extension of the work by Roos(SIAM J.Optim.,2006,16(4):1110-1136).The main iteration consists of a feasibility step and several centrality steps.The authors introduce a specific kernel function instead of the classic logarithmical barrier function to induce the feasibility step,so the analysis of the feasibility step is different from that of Roos' s.This kernel function has a finite value on the boundary.The result of iteration complexity coincides with the currently known best one for infeasible interior-point methods for P_*(κ) LCP.Some numerical results are reported as well.

On Isomorphism Testing of Groups with Normal Hall Subgroups

A normal Hall subgroup N of a group G is a normal subgroup with its order coprime with its index. Schur- Zassenhaus theorem states that every normal Hall subgroup has a complement subgroup, that is a set of coset representatives H which also forms a subgroup of G. In this paper, we present a framework to test isomorphism of groups with at least one normal Hall subgroup, when groups are given as multiplication tables. To establish the framework, we first observe that a proof of Schur-Zassenhaus theorem is constructive, and formulate a necessary and sufficient condition for testing isomorphism in terms of the associated actions of the semidirect products, and isomorphisms of the normal parts and complement parts. We then focus on the case when the normal subgroup is abelian. Utilizing basic facts of representation theory of finite groups and a technique by Le Gall （STACS 2009）, we first get an efficient isomorphism testing algorithm when the complement has bounded number of generators. For the case when the complement subgroup is elementary abelian, which does not necessarily have bounded number of generators, we obtain a polynomial time isomorphism testing algorithm by reducing to generalized code isomorphism problem, which asks whether two linear subspaces are the same up to permutation of coordinates. A solution to the latter can be obtained by a mild extension of the singly exponential （in the number of coordinates） time algorithm for code isomorphism problem developed recently by Babai et al. （SODA 2011）. Enroute to obtaining the above reduction, we study the following computational problem in representation theory of finite groups： given two representations ρandτ- of a group H over Zp^d, a prime, determine if there exists an automorphism ： ФH→ H, such that the induced representation p Ф= ρ o Ф and τ are equivalent, in time poly（｜H｜, p^d）.

Parameterized Algorithmics for Computational Social Choice:Nine Research Challenges

Computational Social Choice is an interdisciplinary research area involving Economics, Political Science,and Social Science on the one side, and Mathematics and Computer Science（including Artificial Intelligence and Multiagent Systems） on the other side. Typical computational problems studied in this field include the vulnerability of voting procedures against attacks, or preference aggregation in multi-agent systems. Parameterized Algorithmics is a subfield of Theoretical Computer Science seeking to exploit meaningful problem-specific parameters in order to identify tractable special cases of in general computationally hard problems. In this paper, we propose nine of our favorite research challenges concerning the parameterized complexity of problems appearing in this context. This work is dedicated to Jianer Chen, one of the strongest problem solvers in the history of parameterized algorithmics,on the occasion of his 60 th birthday.