Search results

The missing travel time data for roads is a common problem encountered by traffic management departments. Tensor decomposition, as one of the most widely used method for completing missing traffic data, plays a significant role in the intelligent transportation system (ITS). However, existing methods of tensor decomposition focus on the global data structure, resulting in relatively low accuracy in fibrosis missing scenarios. Therefore, this paper aims to propose a novel tensor decomposition model which further considers the local spatiotemporal similarity for fibrosis missing to improve travel time completion accuracy.

The proposed model can aggregate road sections with similar physical attributes by spatial clustering, and then it calculates the temporal association of road sections by the dynamic longest common subsequence. A similarity relationship matrix in the temporal dimension is constructed and incorporated into the tensor completion model, which can enhance the local spatiotemporal relationship of the missing parts of the fibrosis type.

The experiment shows that this method is superior and robust. Compared with other baseline models, this method has the smallest error and maintains good completion results despite high missing rates.

This model has higher accuracy for the fibrosis missing and performs good convergence effects in the case of the high missing rate.

The purpose of this paper is to propose a scheme that allows users to interactively explore relations between entities in knowledge bases (KBs). KBs store a wide range of knowledge about real-world entities in a structured form as (subject, predicate, object). Although it is possible to query entities and relations among entities by specifying appropriate query expressions of SPARQL or keyword queries, the structure and the vocabulary are complicated, and it is hard for non-expert users to get the desired information. For this reason, many researchers have proposed faceted search interfaces for KBs. Nevertheless, existing ones are designed for finding entities and are insufficient for finding relations.

To this problem, the authors propose a novel “relation facet” to find relations between entities. To generate it, they applied clustering on predicates for grouping those predicates that are connected to common objects. Having generated clusters of predicates, the authors generated a facet according to the result. Specifically, they proposed to use a couple of clustering algorithms, namely, agglomerative hierarchical clustering (AHC) and CANDECOMP/PARAFAC (CP) tensor decomposition which is one of the tensor decomposition methods.

The authors experimentally show test the performance of clustering methods and found that AHC performs better than tensor decomposition. Besides, the authors conducted a user study and show that their proposed scheme performs better than existing ones in the task of searching relations.

The authors propose a relation-oriented faceted search method for KBs that allows users to explore relations between entities. As far as the authors know, this is the first method to focus on the exploration of relations between entities.

In the process of building the “Belt and Road” and “Bright Road” community of interests between China and Kazakhstan, this paper proposes the construction of an inland nuclear power plant in Kazakhstan. Considering the uncertainty of investment in nuclear power generation, the authors propose the MGT (Monte-Carlo and Gaussian Radial Basis with Tensor factorization) utility evaluation model to evaluate the risk of investment in nuclear power in Kazakhstan and provide a relevant reference for decision making on inland nuclear investment in Kazakhstan.

Based on real options portfolio combined with a weighted utility function, this study takes into account the uncertainties associated with nuclear power investments through a minimum variance Monte Carlo approach, proposes a noise-enhancing process combined with geometric Brownian motion in solving complex conditions, and incorporates a measure of investment flexibility and strategic value in the investment, and then uses a deep noise reduction encoder to learn the initial values for potential features of cost and investment effectiveness. A Gaussian radial basis function used to construct a weighted utility function for each uncertainty, generate a minimization of the objective function for the tensor decomposition, and then optimize the objective loss function for the tensor decomposition, find the corresponding weights, and perform noise reduction to generalize the nonlinear problem to evaluate the effectiveness of nuclear power investment. Finally, the two dimensions of cost and risk (estimation of investment value and measurement of investment risk) are applied and simulated through actual data in Kazakhstan.

The authors assess the core indicators of Kazakhstan's nuclear power plants throughout their construction and operating cycles, based on data relating to a cluster of nuclear power plants of 10 different technologies. The authors compared it with several popular methods for evaluating the benefits of nuclear power generation and conducted subsequent sensitivity analyses of key indicators. Experimental results on the dataset show that the MGT method outperforms the other four methods and that changes in nuclear investment returns are more sensitive to changes in costs while operating cash flows from nuclear power are certainly an effective way to drive investment reform in inland nuclear power generation in Kazakhstan at current levels of investment costs.

Future research could consider exploring other excellent methods to improve the accuracy of the investment prediction further using sparseness and noise interference. Also consider collecting some expert advice and providing more appropriate specific suggestions, which will facilitate the application in practice.

The Novel Coronavirus epidemic has plunged the global economy into a deep recession, the tension between China and the US has made the energy cooperation road unusually tortuous, Kazakhstan in Central Asia has natural geographical and resource advantages, so China–Kazakhstan energy cooperation as a new era of opportunity, providing a strong guarantee for China's political and economic stability. The basic idea of building large-scale nuclear power plants in Balkhash and Aktau is put forward, considering the development strategy of building Kazakhstan into a regional international energy base. This work will be a good inspiration for the investment of nuclear generation.

This study solves the problem of increasing noise by combining Monte Carlo simulation with geometric Brownian motion under complex conditions, adds the measure of investment flexibility and strategic value, constructs the utility function of noise reduction weight based on Gaussian radial basis function and extends the nonlinear problem to the evaluation of nuclear power investment benefit.

The purpose of this paper is to apply link prediction to community mining and to clarify the role of link prediction in improving the performance of social network analysis.

In this study, the 2009 version of Enron e-mail data set provided by Carnegie Mellon University was selected as the research object first, and bibliometric analysis method and citation analysis method were adopted to compare the differences between various studies. Second, based on the impact of various interpersonal relationships, the link model was adopted to analyze the relationship among people. Finally, the factorization of the matrix was further adopted to obtain the characteristics of the research object, so as to predict the unknown relationship.

The experimental results show that the prediction results obtained by considering multiple relationships are more accurate than those obtained by considering only one relationship.

Due to the limited number of objects in the data set, the link prediction method has not been tested on the large-scale data set, and the validity and correctness of the method need to be further verified with larger data. In addition, the research on algorithm complexity and algorithm optimization, including the storage of sparse matrix, also need to be further studied. At the same time, in the case of extremely sparse data, the accuracy of the link prediction method will decline a lot, and further research and discussion should be carried out on the sparse data.

The focus of this research is on link prediction in social network analysis. The traditional prediction model is based on a certain relationship between the objects to predict and analyze, but in real life, the relationship between people is diverse, and different relationships are interactive. Therefore, in this study, the graph model is used to express different kinds of relations, and the influence between different kinds of relations is considered in the actual prediction process. Finally, experiments on real data sets prove the effectiveness and accuracy of this method. In addition, link prediction, as an important part of social network analysis, is also of great significance for other applications of social network analysis. This study attempts to prove that link prediction is helpful to the improvement of performance analysis of social network by applying link prediction to community mining.

This study adopts a variety of methods, such as link prediction, data mining, literature analysis and citation analysis. The research direction is relatively new, and the experimental results obtained have a certain degree of credibility, which is of certain reference value for the following related research.

In this paper, a new rate type endochronic constitutive model is introduced to describe deformations in the finite strain range. A new material dependent objective rate of Cauchy stress is suggested based on the general form of spin tensors, defining objective stress rates. The endochronic constitutive equations are extended using the concept of corotational stress rates and additive decomposition of deformation rate. The constitutive relations are specialized for thin‐walled tubes under torsion and a procedure for solving the ordinary differential equations for cases of simple and pure torsion is developed. The axial effects for various materials, subjected to simple and pure torsion, are simulated and compared with experimental data. The results clearly indicate that the new combined rate endochronic model can be effectively used to describe the behavior of material in the finite strain range.

As known from nearly incompressible elasticity, selective reduced integration (SRI) is a simple and effective method of overcoming the volumetric locking problem in 2D and 3D solid elements. This method of finite elastoviscoplasticity is discussed as are its well‐known limitations. In this context, an isochoric‐volumetric decoupled material behavior is assumed and thus the additive deviatoric‐volumetric decoupling of the consistent algorithmic moduli tensor is essential. By means of several numerical examples, the performance of elements using selective reduced integration is demonstrated and compared to the performance of other elements such as the enhanced assumed strain elements. It is shown that a minor modification, with little numerical effort, leads to rather robust element behaviour. The application of this process to so‐called solid‐shell elements for thin‐walled structures is also discussed.

The purpose of this paper is to improve the existing paradigm of edge computing to maintain a balanced energy usage.

The new greedy algorithm is proposed to balance the energy consumption in edge computing.

The new greedy algorithm can balance energy more efficiently than the random approach by an average of 66.59 percent.

The results are shown in this paper which are better as compared to existing algorithms.

Let X⊂ℙr be an integral and non-degenerate complex variety. For any q∈ℙr let rX(q) be its X-rank and S(X,q) the set of all finite subsets of X such that |S|=rX(q) and q   ∈  〈S〉, where 〈〉 denotes the linear span. We consider the case |S(X,q)|>1 (i.e. when q is not X -identifiable) and study the set W(X)q:=∩ S∈S(X,q)〈S〉, which we call the non-uniqueness set of q. We study the case dimX=1 and the case X a Veronese embedding of ℙn. We conclude the paper with a few remarks concerning this problem over the reals.

To present a new constitutive model for capturing inelastic behavior of brittle materials.

The multi‐surface plasticity theory is employed to describe the damage‐induced mechanisms. An original feature in that respect concerns the multi‐surface criterion which limits the principle values of elastic strains, which is equivalent to Saint‐Venant plasticity model. The latter allows to represent the damage both in tension and in compression.

Provides a quite realistic description of cracking phenomena in brittle materials, with a very few parameters, leading to a very useful tool for analyzing practical engineering problems.

The model is recast in terms of stress resultants and employed within a flat shell elements in order to provide a very efficient tool for analysis of cellular structures. Moreover, a detailed description of the numerical implementation is given.

MITRE and the National Security Agency cooperatively developed and maintained a D3FEND knowledge graph (KG). It provides concepts as an entity from the cybersecurity countermeasure domain, such as dynamic, emulated and file analysis. Those entities are linked by applying relationships such as analyze, may_contains and encrypt. A fundamental challenge for collaborative designers is to encode knowledge and efficiently interrelate the cyber-domain facts generated daily. However, the designers manually update the graph contents with new or missing facts to enrich the knowledge. This paper aims to propose an automated approach to predict the missing facts using the link prediction task, leveraging embedding as representation learning.

D3FEND is available in the resource description framework (RDF) format. In the preprocessing step, the facts in RDF format converted to subject–predicate–object triplet format contain 5,967 entities and 98 relationship types. Progressive distance-based, bilinear and convolutional embedding models are applied to learn the embeddings of entities and relations. This study presents a link prediction task to infer missing facts using learned embeddings.

Experimental results show that the translational model performs well on high-rank results, whereas the bilinear model is superior in capturing the latent semantics of complex relationship types. However, the convolutional model outperforms 44% of the true facts and achieves a 3% improvement in results compared to other models.

Despite the success of embedding models to enrich D3FEND using link prediction under the supervised learning setup, it has some limitations, such as not capturing diversity and hierarchies of relations. The average node degree of D3FEND KG is 16.85, with 12% of entities having a node degree less than 2, especially there are many entities or relations with few or no observed links. This results in sparsity and data imbalance, which affect the model performance even after increasing the embedding vector size. Moreover, KG embedding models consider existing entities and relations and may not incorporate external or contextual information such as textual descriptions, temporal dynamics or domain knowledge, which can enhance the link prediction performance.

Link prediction in the D3FEND KG can benefit cybersecurity countermeasure strategies in several ways, such as it can help to identify gaps or weaknesses in the existing defensive methods and suggest possible ways to improve or augment them; it can help to compare and contrast different defensive methods and understand their trade-offs and synergies; it can help to discover novel or emerging defensive methods by inferring new relations from existing data or external sources; and it can help to generate recommendations or guidance for selecting or deploying appropriate defensive methods based on the characteristics and objectives of the system or network.

The representation learning approach helps to reduce incompleteness using a link prediction that infers possible missing facts by using the existing entities and relations of D3FEND.