三支概念的一种构建方法

三支概念构建是三支形式概念分析的研究内容之一。为丰富三支概念的研究内容,利用矩阵结构,提出一种三支概念构建算法。首先,给出属性矩阵的定义,并设计利用属性矩阵构建属性三支概念的算法过程,对实例进行算法运算,以此对算法步骤进行说明,对算法正确性进行了相应验证。其次,定义对象矩阵,并设计依据此矩阵构建对象三支概念的算法,对实例进行算法运算。经上述研究验证,所提算法正确且有效。研究结果为三支概念在数据处理中的应用提供了更多选择。     

A function-oriented biologically analogical approach for constructing the design concept of smart product in Industry 4.0

The development of the Industry 4.0 paradigm and the advancement of information technology have aroused new consumer requirements for smart products that are capable of context awareness and autonomous control. Nature holds huge potential for inspiring innovative design concepts that can meet the ever-growing need for smart products since biology perceive and interact with their living environment for survival. However, to date, very few studies have explored the application of natural wisdom in building innovative design concepts for smart products. This paper proposes a function-oriented design approach for smart products, by analogizing to biological prototypes. To do so, a unified functional representation, based on the Function–behavior–structure (FBS) ontology, is proposed to abstract biological prototypes, followed by a fuzzy triangular numbers-based algorithm designed to locate appropriate biological prototypes as analogical sources for smart product development. Moreover, functional innovative strategies and a hybrid design process are formulated to develop design concepts of smart products, by integrating several existing engineering design methods. Finally, an illustrative design case of a smart natural resource collecting system is used to demonstrate the workability of the proposed method.     

An Eulerian approach for constructing a map between surfaces with different topologies

3D objects of the same kind often have different topologies, and finding correspondence between them is important for operations such as morphing, attribute transfer, and shape matching. This paper presents a novel method to find the surface correspondence between topologically different surfaces. The method is characterized by deforming the source polygonal mesh to match the target mesh by using the intermediate implicit surfaces, and by performing a topological surgery at the appropriate locations on the mesh. In particular, we propose a mathematically well‐defined way to detect the topology change of surface by finding the non‐degenerate saddle points of the velocity fields that tracks implicit surfaces. We show the effectiveness and possible applications of the proposed method through several experiments.     

A new approach to constructing CSS codes based on factor graphs

A novel, practical and convenient approach to constructing Calderbank-Shor-Steane (CSS) codes based on factor graphs is presented in this paper. Our proposed method is applied to solve two problems associated with constructing CCS codes. One is judging whether a code is a weakly self-dual code or not, the other is finding the generator matrix and parity-check matrix of a weakly self-dual code. The novelty, practicality and convenience of the approach are shown as follows. First, the approach is a hitherto unexplored one to constructing CSS codes. Second, the judgment of a weakly self-dual code is entirely based on factor graphs. Namely, we consider a code a weakly self-dual one when the Tanner graph or convolutional factor graph of its dual code can be obtained by that of its own via our proposed transform T_R→L. Finally, we can obtain the generator matrix and parity-check matrix of a weakly self-dual code via factor graphs other than conventional algebra methods, which allow us avoid matrix computation to get them. An example is given to show how to construct quantum CSS code based on factor graphs. The method can be extended to other CSS codes.     

A geometric approach for constructing coteries and k-coteries

Quorum-based mutual exclusion algorithms are resilient to node and communication line failures. Recently, some mutual exclusion algorithms successfully use logical structures to construct coteries with small quorums sizes. In this paper, we introduce a geometric approach on dealing with the logical structures and present some useful geometric properties for constructing coteries and k-coteries. Based on those geometric properties, a logical structure named three-sided graph is proposed to provide a new scheme for constructing coteries with small quorums: The smallest quorum size is O(√N) in a homogeneous system with N nodes and O(1) in a heterogeneous system. In addition, we also extend the three-sided graph to the O-sided graph for constructing k-coteries     

概念特化的概念格更新构造算法

概念格是形式概念分析中的核心数据结构,概念格应用的瓶颈之一是其构造效率. 针对形式背景的某个属性分解为多个新属性得到更加特化的概念,给出了一种基于概念特化的渐进式更新构造算法. 该算法利用分解后的新属性及其相应的形式背景,构造出的概念格与原概念格的某个子概念格作比较,来更新构造概念格,从而减少了比较次数,提高了更新构造的效率. 以天体光谱数据作为形式背景,实验验证了该算法的正确性和有效性.     

A new approach to constructing optimal parallel prefix circuits with small depth

Parallel prefix circuits are parallel algorithms performing the prefix operation for the combinational circuit model. The size of a prefix circuit is the number of operation nodes in the circuit, and the depth is the maximum level of operation nodes. A circuit with n inputs is depth-size optimal if its depth plus size equals 2n−2. Smaller depth implies faster computation, while smaller size implies less power consumption, smaller VLSI area, and less cost. A circuit should have a small fan-out and small depth for it to be of practical use. In this paper, we present a new approach to easing the design of parallel prefix circuits, and construct a depth-size optimal parallel prefix circuit, named WE4, with fan-out 4. In many cases of n, WE4 has the smallest depth among all known depth-size optimal prefix circuits with bounded fan-out.     

A systematic approach for new service concept generation: Application of agent-based simulation

In new service development (NSD), a concept design that influences the direction of other activities is considered as a crucial stage. Although several methods exist, most of them cannot reflect responses of future potential customers because they assume that customers have the same responses in the future. Therefore, by using agent-based simulation (ABS) that can understand the future status of a service system, this paper suggests a new approach to creating the most promising service concept. The proposed approach considers the future trends of various customer responses and service concept strategies of firms by using ABS, generating a more accurate concept. By applying the suggested approach to a healthcare industry, its practicability and utility are verified. The novel approach based on the agent-based simulation method, which has customer, service provider, and competitor agents, is expected to be useful for service providers in a competitive market.     

A new approach to solve SLAM challenges by relative map filter

In this paper we propose a new approach to solve some challenges in the simultaneous localization and mapping (SLAM) problem based on the relative map filter (RMF). This method assumes that the relative distances between the landmarks of relative map are estimated fully independently. This considerably reduces the computational complexity to average number of landmarks observed in each scan. To solve the ambiguity that may happen in finding the absolute locations of robot and landmarks, we have proposed two separate methods, the lowest position error (LPE) and minimum variance position estimator (MVPE). Another challenge in RMF is data association problem where we also propose an algorithm which works by using motion sensors without engaging in their cumulative error. To apply these methods, we switch successively between the absolute and relative positions of landmarks. Having a sufficient number of landmarks in the environment, our algorithm estimates the positions of robot and landmarks without using motion sensors and kinematics of robot. Motion sensors are only used for data association. The empirical studies on the proposed RMF-SLAM algorithm with the LPE or MVPE methods show a better accuracy in localization of robot and landmarks in comparison with the absolute map filter SLAM.     

Proposal for a new concept for a robot in which the constructing module can be exchanged seamlessly

Although industrial robots have developed considerably since the end of the last century, and have been used in various fields, robotics is still being actively researched in Japan. Following the work of national research institutes and educational institutions, robot manufacturers have also put considerable resources into developing a new generation of robots. Moreover, society in general has high expectations of robots. To provide a low-price robot that can be widely used in the home, in medical treatments, in welfare, and in disaster relief, etc., a high-function, low-cost module that can easily be exchanged for maintenance or repair is very necessary. To achieve this aim, it is undesirable to develop robots based on different original standards from research institutes, educational institutions, and robot manufacturers, etc. Therefore, a common standard in robotic development needs to be established, and robots must be developed based on that standard. In this research, a new concept for the next generation of robot development is proposed. This concept includes a high-intelligence module, lower manufacturing costs, and an easy exchange operation.     

An interactive concept map approach to supporting mobile learning activities for natural science courses

Mobile and wireless communication technologies not only enable anytime and anywhere learning, but also provide the opportunity to develop learning environments that combine real-world and digital-world resources. Nevertheless, researchers have indicated that, without effective tools for helping students organize their observations in the field, the mobile learning performance could be disappointing. To cope with this problem, this study proposes an interactive concept map-oriented approach for supporting mobile learning activities. An experiment has been conducted on an elementary school natural science course to evaluate the effectiveness of the proposed method. The experimental results show that the proposed approach not only enhances learning attitudes, but also improves the learning achievements of the students.     

A rigorous approach for constructing self-evolving real-time reactive systems

Self-evolving systems adapt themselves automatically to changing external situations and internal conditions. This paper proposes an architecture with four components, that, respectively, provides the infrastructure for formal architectural modeling of the evolving system, reuse of design elements, predicting the reliability of evolution, and managing change. The tools in TROMLAB, a framework for developing real-time reactive systems support and sustain the evolution of system components.     

Bordat概念格构造算法的改进

作为一种重要的概念格构造算法,Bordat算法简洁、直观且易于并行化,但该算法本身的效率并不高。在深入研究格结构特性的基础上,给出了它的改进算法。首先对形式背景的属性集进行等价类划分,以减少参与计算的属性个数,并消除了在产生子节点集的过程中,对属性之间的多余比较,从而大大提高算法的效率,并通过实例和实验说明该算法的正确性和有效性。     

A divide-and-conquer approach for automatic polycube map construction

Polycube map is a global cross-surface parameterization technique, where the polycube shape can roughly approximate the geometry of modeled objects while retaining the same topology. The large variation of shape geometry and its complex topological type in real-world applications make it difficult to effectively construct a high-quality polycube that can serve as a good global parametric domain for a given object. In practice, existing polycube map construction algorithms typically require a large amount of user interaction for either pre-constructing the polycubes with great care or interactively specifying the geometric constraints to arrive at the user-satisfied maps. Hence, it is tedious and labor intensive to construct polycube maps for surfaces of complicated geometry and topology. This paper aims to develop an effective method to construct polycube maps for surfaces with complicated topology and geometry. Using our method, users can simply specify how close the target polycube mimics a given shape in a quantitative way. Our algorithm can both construct a similar polycube of high geometric fidelity and compute a high-quality polycube map in an automatic fashion. In addition, our method is theoretically guaranteed to output a one-to-one map. To demonstrate the efficacy of our method, we apply the automatically-constructed polycube maps in a number of computer graphics applications, such as seamless texture tiling, T-spline construction, and quadrilateral mesh generation.     

A new hybrid feature selection approach using feature association map for supervised and unsupervised classification

Feature selection, both for supervised as well as for unsupervised classification is a relevant problem pursued by researchers for decades. There are multiple benchmark algorithms based on filter, wrapper and hybrid methods. These algorithms adopt different techniques which vary from traditional search-based techniques to more advanced nature inspired algorithm based techniques. In this paper, a hybrid feature selection algorithm using graph-based technique has been proposed. The proposed algorithm has used the concept of Feature Association Map (FAM) as an underlying foundation. It has used graph-theoretic principles of minimal vertex cover and maximal independent set to derive feature subset. This algorithm applies to both supervised and unsupervised classification. The performance of the proposed algorithm has been compared with several benchmark supervised and unsupervised feature selection algorithms and found to be better than them. Also, the proposed algorithm is less computationally expensive and hence has taken less execution time for the publicly available datasets used in the experiments, which include high-dimensional datasets.     

An enhanced concept map approach to improving children’s storytelling ability

Storytelling is an imperative and innovative pathway to enhance learning due to the fact that such activity prompts learners to reflect to construct meaning based on their observations and knowledge. Therefore, to develop and enhance students’ storytelling ability has become an important issue for both educators and researchers. Since storytelling involves complex cognitive processes, this study proposed an enhanced concept map approach featured with story grammars to help children develop stories. By gathering the stories developed by 114 third-graders, this study aimed to investigate whether the concept map approach can enhance their storytelling ability. It is found that the children, who used the concept map with story grammars, can develop stories with more complex structure, clearer subjects, more creative ideas, and abundant contents than those only using the concept map without the grammars. Such findings support that the concept map and story grammars can be an effective approach for developing learner-centered storytelling tools which help students develop and apply the knowledge about storytelling.     

A data-driven approach for constructing multilayer network-based service ecosystem models

Software and Systems Modeling - Services are flourishing drastically both on the Internet and in the real world. In addition, services have become much more interconnected to facilitate...     

A novel approach for constructing privacy-aware architecture utilizing Shannon's entropy

The right to privacy refers to an individual's decision about how personal information can be gathered, utilized, and disseminated. Individual consent and openness are the most important foundations for gaining consumers' confidence, and this pushes businesses to use privacy-enhancing techniques while developing systems. The purpose of a privacy-aware design is to safeguard data in such a manner that it does not expand an adversary's current understanding of an individual beyond what would be permitted. When these data pieces are coupled with the plethora of source data accessible outside the system to identify a user, this becomes crucial. Individual privacy is protected by privacy rules all around the globe, but they are often complicated and ambiguous, making their translation into practical and technologically privacy-friendly structures difficult. The main contribution of this article is that we use Shannon's entropy (SE) to construct an objective measure that may guide our major technical design choices. And for privacy-aware architecture, simplifying the state-of-the-art security approaches given in the literature.     

A new algorithm for constructing approximate transformations fornonlinear systems

An algorithm is provided for constructing an approximating transformation for a feedback linearizable system, and for a system that is not feedback linearizable. Instead of approximating the given nonlinear system, the authors approximate the transformation in a proper sense. They assume that the lead variables of a transformation have a certain form with unknown parameters, substitute these variables into the required equations, and determine the unknown parameters through linear algebraic equations. There is a tremendous savings in terms of number of equations and unknowns, and it is sometimes possible to find exact (or best possible) transformations in a surprisingly small number of steps     

A general approach for constructing the limit cycle loci of multiple-nonlinearity systems

This note presents a widely convergent algorithm for finding a limit cycle of systems with multiple nonlinearities. A systematic approach is proposed for constructing the limit cycle loci on the parameter planes. The merits of this approach lie in its simplicity, generality, and ability to provide deeper insight into parameter influences on the limit cycle. Besides, stability of the limit cycle can be predicted with a minimum amount of computations.