Combining Deep Learning with Knowledge Graph for Design Knowledge Acquisition in Conceptual Product Design

The acquisition of valuable design knowledge from massive fragmentary data is challenging for designers in conceptual product design.This study proposes a novel method for acquiring design knowledge by combining deep learning with knowledge graph.Specifically,the design knowledge acquisition method utilises the knowledge extraction model to extract design-related entities and relations from fragmentary data,and further constructs the knowledge graph to support design knowledge acquisition for conceptual product design.Moreover,the knowledge extraction model introduces ALBERT to solve memory limitation and communication overhead in the entity extraction module,and uses multi-granularity information to overcome segmentation errors and polysemy ambiguity in the relation extraction module.Experimental comparison verified the effectiveness and accuracy of the proposed knowledge extraction model.The case study demonstrated the feasibility of the knowledge graph construction with real fragmentary porcelain data and showed the capability to provide designers with interconnected and visualised design knowledge.

A graph neural network approach to the inverse design for thermal transparency with periodic interparticle system

Recent years have witnessed significant advances in utilizing machine learning-based techniques for thermal metamaterial-based structures and devices to attain favorable thermal transport behaviors.Among the various thermal transport behaviors,achieving thermal transparency stands out as particularly desirable and intriguing.Our earlier work demonstrated the use of a thermal metamaterial-based periodic interparticle system as the underlying structure for manipulating thermal transport behavior and achieving thermal transparency.In this paper,we introduce an approach based on graph neural network to address the complex inverse design problem of determining the design parameters for a thermal metamaterial-based periodic interparticle system with the desired thermal transport behavior.Our work demonstrates that combining graph neural network modeling and inference is an effective approach for solving inverse design problems associated with attaining desirable thermal transport behaviors using thermal metamaterials.

A Knowledge Graph based Software Engineering Curriculum Design Method

New theories,methodologies,and technologies have been continuously invented and widely applied in modern software development,along with many new tools and best practices that are of remarkable significance in the software industry.In Software Engineering(SE)programs of universities,it is quite difficult for their curricula to chase after the fast-evolving technology trend.As a consequence,there have been significant challenges in designing an evolvable SE curriculum.In this paper,we present a knowledge graph based curriculum design method for SE programs.Knowledge Points(KPs)are organized into a multi-layer and multi-dimensionally annotated knowledge graph called SEKG,and five principles are applied to partition the SEKG into a set of inter-related courses.Metrics for evaluating the quality of an SE curriculum are briefly discussed.This method can not only help design a systematic curriculum from existing software engineering KPs but also facilitate curriculum evolution to adapt to technology trends.

Research on the Man-Machine Engineering Theory and the Applications on Furniture Design and Interior Decoration Design

In this paper, we conduct research on the man-machine engineering theory and the applications on furniture design and interior decoration design. Furniture is one of the important media, contacts and relationships between building it by their own different shape and size provide comfortable environment for people. Ergonomics is the study of human activity and the claim size on the surrounding environment, how to make furniture to better serve people＇ s life and work. Our research proposed novel paradigm of the man-machine engineering theory which is meaningful.

The Application of Chinese Calligraphy Fonts to the Modem Art Design

Chinese calligraphy font design is based on Chinese characters as the carrier, and provides the modem people, the modem market, and the modem society with a font design by applying the modem technology conditions, combining with the modem design concept, and absorbing the traditional calligraphy form languages such as the midcourt line and structure. Along with the development of Chinese character information processing technology, the modem computer techology has been penetrated into every field of society, it has been very important in the field of the design to implement font design and application using the computer directly. In this paper, the application of Chinese calligraphy fonts to the modem design art is discussed from computer font design and the components of Chinese characters, development trend, and modem decoration design. Calligraphy font design will be applied to more design areas, and also will be penetrated into all aspects of people＇ s daily life.

The Selection and Application of Non-Conventional Decoration Materials in Indoor Design

In indoor design innovation, the material role can not be ignored. In indoor design, using non-conventional decoration materials can make space more personalized and charming. This is one of the material innovation modes and also one of the indoor design innovation modes. The design method should obtain more attention.

A Computational Synthesis Approach of Mechanical Conceptual Design Based on Graph Theory and Polynomial Operation

The design synthesis is the key issue in the mechanical conceptual design to generate the design candidates that meet the design requirements.This paper devotes to propose a novel and computable synthesis approach of mechanisms based on graph theory and polynomial operation.The graph framework of the synthesis approach is built firstly,and it involves:(1)the kinematic function units extracted from mechanisms;(2)the kinematic link graph that transforms the synthesis problem from mechanical domain into graph domain;(3)two graph representations,i.e.,walk representation and path representation,of design candidates;(4)a weighted matrix theorem that transforms the synthesis process into polynomial operation.Then,the formulas and algorithm to the polynomial operation are presented.Based on them,the computational flowchart to the synthesis approach is summarized.A design example is used to validate and illustrate the synthesis approach in detail.The proposed synthesis approach is not only supportive to enumerate the design candidates to the conceptual design of a mechanical system exhaustively and automatically,but also helpful to make that enumeration process computable.

Application of Decoration Culture of Traditional Manchu Residence in Architectural Landscape Design

In recent years,China’s urban construction has been gradually influenced by Western culture and ideologies.The planning of urban development has been carried out in accordance with Western ideologies.As a result,this has prevented our local buildings and architectures to showcase unique local style and characteristics.Even under the influence of global urbanization,the development trend has prevented the construction of global cities from displaying the characteristics of their respective cities.Therefore,it is highly important for a nation not to lose the direction in the design of the urban landscape,and not to blindly imitating the architectural style of other countries or other cities.In addition,the nation and its cities should show their respective unique cultural charm and cultural characteristics and present their best to the whole world in order to promote the popularity of the cities,expand their influence and get onto a better development path.This article mainly introduces the application of the decoration culture of the traditional Manchu residence in the architectural landscape design.

Design Pattern Mining Using Graph Matching

The identification of design pattern instances is important for program understanding and software maintenance. Aiming at the mining of design patterns in existing systems, this paper proposes a subgraph isomorphism approach to discover several design patterns in a legacy system at a time. The attributed relational graph is used to describe design patterns and legacy systems. The sub-graph isomorphism approach consists of decomposition and composition process. During the decomposition process, graphs corresponding to the design patterns are decomposed into sub-graphs, some of which are graphs corresponding to the elemental design patterns. The composition process tries to get sub-graph isomorphism of the matched graph if sub-graph isomorphism of each subgraph is obtained. Due to the common structures between design patterns, the proposed approach can reduce the matching times of entities and relations. Compared with the existing methods, the proposed algorithm is not linearly dependent on the number of design pattern graphs. Key words design pattern mining - attributed relational graph - subgraph isomorphism CLC number TP 311.5 Foundation item: Supported by the National Natural Science Foundation of China (60273075) and the Science Foundation of Naval University of Engineering (HGDJJ03019)Biography: LI Qing-hua (1940-), male, Professor, research direction: parallel computing.

Graph Designs for all Graphs with Six Vertices and Eight Edges

Graph designs for all graphs with six vertices and eight edges are discussed. The existence of these graph designs are completely solved except in two possible cases of order 32.

<i>G</i>-Design of Complete Multipartite Graph Where <i>G</i>Is Five Points-Six Edges

In this paper, we construct G-designs of complete multipartite graph, where G is five points-six edges.

Application Strategies of the Bracket Set in Modern Architectural Design

The Bracket Set(dougong)is an important aspect of traditional Chinese architecture known for its exquisite structure,complexity,and rich variations.This design element has been used since the Qin and Han Dynasties and is still prevalent today.It highlights hierarchy and spiritual connotations in the design of a building.This article explores the application of Bracket Set elements in modern architectural design.It analyzes the specific application strategies of this design element,highlighting its value in modern architecture.The goal is to provide modern architectural designers with multiple perspectives and strategies to fully utilize the advantages of Bracket Set elements in architectural design and enhance the artistic value of their work.

Distance Signatures of Extended and Co-extended Incidence Graphs of Affine Designs

The distance matrix of a connected graph G,denoted by D(G),is the matrix whose rows and columns are indexed by the vertex set V(G)such that the(vi,vj)-entry is d(vi,vj),where vi,vj∈V(G).The distance signature sig(D(G))of G is the inertia of D(G).In this paper,we determine the distance signature of the extended(co-extended)incidence graph of an affine design.Furthermore,we state that an open Graffiti conjecture is true for the extended(co-extended)incidence graphs of affine designs by investigating the lower bound of the matching number.

A Decomposition of a Complete Graph with a Hole

In the field of design theory, the most well-known design is a Steiner Triple System. In general, a G-design on H is an edge-disjoint decomposition of H into isomorphic copies of G. In a Steiner Triple system, a complete graph is decomposed into triangles. In this paper we let H be a complete graph with a hole and G be a complete graph on four vertices minus one edge, also referred to as a . A complete graph with a hole, , consists of a complete graph on d vertices, , and a set of independent vertices of size v, V, where each vertex in V is adjacent to each vertex in . When d is even, we give two constructions for the decomposition of a complete graph with a hole into copies of : the Alpha-Delta Construction, and the Alpha-Beta-Delta Construction. By restricting d and v so that , we are able to resolve both of these cases for a subset of using difference methods and 1-factors.

Knowledge graph construction with structure and parameter learning for indoor scene design

We consider the problem of learning a representation of both spatial relations and dependencies between objects for indoor scene design.We propose a novel knowledge graph framework based on the entity-relation model for representation of facts in indoor scene design, and further develop a weaklysupervised algorithm for extracting the knowledge graph representation from a small dataset using both structure and parameter learning. The proposed framework is flexible, transferable, and readable. We present a variety of computer-aided indoor scene design applications using this representation, to show the usefulness and robustness of the proposed framework.

Research in Green Modularity Design Methodology

Green design and manufacturing is a proactive approach to minimize wastes during a product’s design stage, thus preventing future environmental impacts. Current modular design method mainly focuses on product functional and manufacturing issues. In this paper, a theoretical scheme of multi-objective modularity analysis for discrete electromechanical product design was proposed. Product physical architecture was represented by a fuzzy graph, where fuzzy relationships contain environmental objectives and influence module formulation. Finally the optimal product modules combining all objectives can be searched by clustering algorithm.

Design of a sustainable development path in Chenzhou based on a knowledge graph

Sustainable urban development involves many fields with complex data types and rich semantic relationships,such as the economic,societal,and ecological fields.Knowledge graphs provide a new means for sustainable urban development research by leveraging their strengths in the construction of knowledge networks and display of knowledge associations.Focusing on Chenzhou,a resource-based city serving as a China’s Innovation Demonstration Zone for Sustainable Development Agenda,this study adopted a top-down approach,applying the“seven-step”and“skeleton”methods to construct an ontology for sustainable urban development through manual editing.A knowledge graph was constructed for Chenzhou’s sustainable development,comprising 515 nodes,3209 relations,and 28157 attributes.Sustainable measures and pathways were proposed based on this knowledge graph.The results showed that Chenzhou’s future sustainable development should focus on innovation,growth,emissions reduction,centering around high-quality and sustainable development.Promoting the transfer and transformation of scientific and technological achievements,accelerating the optimization and upgrading of industrial structures,and enhancing talent cultivation and recruitment will foster new quality productive forces,providing strong momentum and support for the high-quality and sustainable development of Chenzhou.To accelerate the green economy transition,Chenzhou should improve the market-oriented allocation system for resources and environmental factors,explore the“gross ecosystem product+eco environment-oriented development”project implementation model,encourage enterprises to adopt environmental,social,and governance principles,and foster synergies between supply and demand.Furthermore,coordinating Chenzhou’s low-carbon city pilot projects and constructing carbon sequestration pathways that leverage nature-based solutions will help implement the“dual carbon”actions and enhance the city’s ability to respond to climate change.

On Network Designs with Coding Error Detection and Correction Application

The detection of error and its correction is an important area of mathematics that is vastly constructed in all communication systems.Furthermore,combinatorial design theory has several applications like detecting or correcting errors in communication systems.Network(graph)designs(GDs)are introduced as a generalization of the symmetric balanced incomplete block designs(BIBDs)that are utilized directly in the above mentioned application.The networks(graphs)have been represented by vectors whose entries are the labels of the vertices related to the lengths of edges linked to it.Here,a general method is proposed and applied to construct new networks designs.This method of networks representation has simplified the method of constructing the network designs.In this paper,a novel representation of networks is introduced and used as a technique of constructing the group generated network designs of the complete bipartite networks and certain circulants.A technique of constructing the group generated network designs of the circulants is given with group generated graph designs(GDs)of certain circulants.In addition,the GDs are transformed into an incidence matrices,the rows and the columns of these matrices can be both viewed as a binary nonlinear code.A novel coding error detection and correction application is proposed and examined.

BIMATCHING DESIGNS

A collection of k-matchings of bipartite graph Kn,n with the property thatevery pair of independent edges lies in exactly λ of the k-matchings is called aBIMATCH(n,k,λ)-design. Existences and constructions for various BIMATCH (n,k,λ)designs are given.

Solving the Maximum Matching Problem on Bipartite Star123-Free Graphs in Linear Time

The bipartite Star123-free graphs were introduced by V. Lozin in [1] to generalize some already known classes of bipartite graphs. In this paper, we extend to bipartite Star123-free graphs a linear time algorithm of J. L. Fouquet, V. Giakoumakis and J. M. Vanherpe for finding a maximum matching in bipartite Star123, P7-free graphs presented in [2]. Our algorithm is a solution of Lozin’s conjecture.