scholarly journals A Divide-and-Conquer Approach for Solving Fuzzy Max-Archimedeant-Norm Relational Equations

2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Jun-Lin Lin ◽  
Hung-Chjh Chuan ◽  
Laksamee Khomnotai
Keyword(s):  
Original Problem ◽  
Relevant Literature ◽  
The Other ◽  
Divide And Conquer ◽  
Fuzzy Relational Equations ◽  
Original Matrix ◽  
Binary Matrix ◽  
The Matrix ◽  
Binary Matrices ◽  
Test Matrices

A system of fuzzy relational equations with the max-Archimedeant-norm composition was considered. The relevant literature indicated that this problem can be reduced to the problem of finding all the irredundant coverings of a binary matrix. A divide-and-conquer approach is proposed to solve this problem and, subsequently, to solve the original problem. This approach was used to analyze the binary matrix and then decompose the matrix into several submatrices such that the irredundant coverings of the original matrix could be constructed using the irredundant coverings of each of these submatrices. This step was performed recursively for each of these submatrices to obtain the irredundant coverings. Finally, once all the irredundant coverings of the original matrix were found, they were easily converted into the minimal solutions of the fuzzy relational equations. Experiments on binary matrices, with the number of irredundant coverings ranging from 24 to 9680, were also performed. The results indicated that, for test matrices that could initially be partitioned into more than one submatrix, this approach reduced the execution time by more than three orders of magnitude. For the other test matrices, this approach was still useful because certain submatrices could be partitioned into more than one submatrix.

scholarly journals Partition of a Binary Matrix intok(k ≥ 3) Exclusive Row and Column Submatrices Is Difficult

2014 ◽  
Vol 2014 ◽  
pp. 1-13
Author(s):  
Peiqiang Liu ◽  
Daming Zhu ◽  
Jinjie Xiao ◽  
Qingsong Xie ◽  
Yanyan Mao
Keyword(s):  
Positive Integer ◽  
Bipartite Graphs ◽  
Np Hard ◽  
Binary Matrix ◽  
Attribute Vector ◽  
The Matrix ◽  
Binary Matrices

A biclustering problem consists of objects and an attribute vector for each object. Biclustering aims at finding a bicluster—a subset of objects that exhibit similar behavior across a subset of attributes, or vice versa. Biclustering in matrices with binary entries (“0”/“1”) can be simplified into the problem of finding submatrices with entries of “1.” In this paper, we consider a variant of the biclustering problem: thek-submatrix partition of binary matrices problem. The input of the problem contains ann×mmatrix with entries (“0”/“1”) and a constant positive integerk. Thek-submatrix partition of binary matrices problem is to find exactlyksubmatrices with entries of “1” such that theseksubmatrices are pairwise row and column exclusive and each row (column) in the matrix occurs in exactly one of theksubmatrices. We discuss the complexity of thek-submatrix partition of binary matrices problem and show that the problem is NP-hard for anyk≥3by reduction from a biclustering problem in bipartite graphs.

Pembobotan Berdasarkan Tingkat Kesamaan Semantik pada Metode Fuzzy Semi-Supervised Co-Clustering untuk Pengelompokkan Dokumen Teks

2014 ◽  
Vol 6 (2) ◽  
pp. 46-51
Author(s):  
Galang Amanda Dwi P. ◽  
Gregorius Edwadr ◽  
Agus Zainal Arifin
Keyword(s):  
Supervised Learning ◽  
Semantic Similarity ◽  
The Other ◽  
Classification Result ◽  
Document Similarity ◽  
The Matrix ◽  
Index Terms ◽  
Membership Value ◽  
Degree Of Similarity

Nowadays, a large number of information can not be reached by the reader because of the misclassification of text-based documents. The misclassified data can also make the readers obtain the wrong information. The method which is proposed by this paper is aiming to classify the documents into the correct group.  Each document will have a membership value in several different classes. The method will be used to find the degree of similarity between the two documents is the semantic similarity. In fact, there is no document that doesn’t have a relationship with the other but their relationship might be close to 0. This method calculates the similarity between two documents by taking into account the level of similarity of words and their synonyms. After all inter-document similarity values obtained, a matrix will be created. The matrix is then used as a semi-supervised factor. The output of this method is the value of the membership of each document, which must be one of the greatest membership value for each document which indicates where the documents are grouped. Classification result computed by the method shows a good value which is 90 %. Index Terms - Fuzzy co-clustering, Heuristic, Semantica Similiarity, Semi-supervised learning.

scholarly journals Image-based textile decoding

2020 ◽  
pp. 1-14
Author(s):  
Siqiang Chen ◽  
Masahiro Toyoura ◽  
Takamasa Terada ◽  
Xiaoyang Mao ◽  
Gang Xu
Keyword(s):  
Deep Learning ◽  
Grid Point ◽  
Intermediate Representation ◽  
Training Set ◽  
Binary Matrix ◽  
The Matrix ◽  
Correct Pattern ◽  
Grid Points ◽  
Textile Fabric ◽  
Direct Correspondence

A textile fabric consists of countless parallel vertical yarns (warps) and horizontal yarns (wefts). While common looms can weave repetitive patterns, Jacquard looms can weave the patterns without repetition restrictions. A pattern in which the warps and wefts cross on a grid is defined in a binary matrix. The binary matrix can define which warp and weft is on top at each grid point of the Jacquard fabric. The process can be regarded as encoding from pattern to textile. In this work, we propose a decoding method that generates a binary pattern from a textile fabric that has been already woven. We could not use a deep neural network to learn the process based solely on the training set of patterns and observed fabric images. The crossing points in the observed image were not completely located on the grid points, so it was difficult to take a direct correspondence between the fabric images and the pattern represented by the matrix in the framework of deep learning. Therefore, we propose a method that can apply the framework of deep learning viau the intermediate representation of patterns and images. We show how to convert a pattern into an intermediate representation and how to reconvert the output into a pattern and confirm its effectiveness. In this experiment, we confirmed that 93% of correct pattern was obtained by decoding the pattern from the actual fabric images and weaving them again.

Matrix-Mineral Relationships-A. Morphologist's Viewpoint

1979 ◽  
Vol 58 (2_suppl) ◽  
pp. 922-929 ◽  
Author(s):  
M.U. Nylen
Keyword(s):  
Organic Material ◽  
Crucial Role ◽  
Crystal Surface ◽  
Organic Matrix ◽  
The Other ◽  
Enamel Matrix ◽  
Initial Cell ◽  
Cell Product ◽  
Ultrastructural Morphology ◽  
The Matrix

The literature on the ultrastructural morphology of the enamel matrix and its relationship to the crystals is reviewed. Two morphological entities of the matrix are discussed: One is the so-called stippled material which may be the initial cell product; the other, variously described as fibrillar, lamellar, tubular or helical, is thought by many to play a crucial role in nucleation and orientation of the crystals. A number of observations, however, suggest that the latter structures form secondarily to the crystals and that in reality they represent organic material adsorbed to the crystal surface and maintained as independent structures upon removal of the mineral. The need for additional studies is stressed including systematic studies of interactions between constituents of the organic matrix and the apatite crystals.

A Yield Criterion of Porous Materials With Anisotropy Caused by Geometry or Distribution of Pores

1991 ◽  
Vol 113 (4) ◽  
pp. 425-429 ◽  
Author(s):  
T. Hisatsune ◽  
T. Tabata ◽  
S. Masaki
Keyword(s):  
Velocity Field ◽  
Porous Materials ◽  
Upper Bound ◽  
Volume Fraction ◽  
Yield Criterion ◽  
Longitudinal Direction ◽  
Axisymmetric Deformation ◽  
The Other ◽  
The Matrix ◽  
Spherical Cells

Axisymmetric deformation of anisotropic porous materials caused by geometry of pores or by distribution of pores is analyzed. Two models of the materials are proposed: one consists of spherical cells each of which has a concentric ellipsoidal pore; and the other consists of ellipsoidal cells each of which has a concentric spherical pore. The velocity field in the matrix is assumed and the upper bound approach is attempted. Yield criteria are expressed as ellipses on the σm σ3 plane which are longer in longitudinal direction with increasing anisotropy and smaller with increasing volume fraction of the pore. Furthermore, the axes rotate about the origin at an angle α from the σm-axis, while the axis for isotropic porous materials is on the σm-axis.

Wounded by reality: emotional deprivation and unresolved trauma in psychoanalytical couple’s therapy

2021 ◽  
Vol 15 (2) ◽  
pp. 253-268
Author(s):  
Hélène Béïnoglou
Keyword(s):  
Romantic Relationships ◽  
Emotional Experience ◽  
Therapeutic Process ◽  
Clinical Work ◽  
The Other ◽  
The Matrix ◽  
Emotional Deprivation ◽  
Unresolved Trauma

In this article, I will focus on highly conflictual couples with extensive emotional deprivation and unresolved trauma, which prevents them from developing healthy romantic relationships and overcoming the challenges entailed in any intimate attachment. I will describe how everyday interactions are experienced as threatening or even lethal movements between the partners. The question which arises in the psychoanalytical therapeutic process is how to help the couple tolerate the sensory reminders of the unresolved trauma as a necessary precursor to any process of symbolisation. In order to provide a safe enough therapeutic attachment bond, extensive time is dedicated to the emotional experience of self and the other in the here-and-now of the session, which validates the emotional experience of the couple as well as contains it. The therapy focuses on the transferential and countertransferential movements inspired by the matrix of the victim, abuser, and uninvolved witness (Davies & Frawley, 1994) to elaborate the intertwining of the unresolved trauma with the couple’s form of attachment. In order to illustrate my argument, I present two examples: one from a fictional narration and another from my clinical work.

Concise Equations for Rotor Dynamics Analysis

1995 ◽  
Author(s):  
W. J. Chen
Keyword(s):  
Equations Of Motion ◽  
Rotor Dynamics ◽  
Memory Storage ◽  
The Other ◽  
Dynamics Analysis ◽  
Real Domain ◽  
The Matrix ◽  
System Equations ◽  
Ordering Algorithms ◽  
Matrix Bandwidth

Abstract Concise equations for rotor dynamics analysis are presented. Two coordinate ordering methods are introduced in the element equations of motion. One is in the real domain and the other is in the complex domain. The two proposed ordering algorithms lead to more compact element matrices. A station numbering technique is also proposed for the system equations during the assembly process. This numbering technique can minimize the matrix bandwidth, the memory storage and can increase the computational efficiency.

MRHS solver based on linear algebra and exhaustive search

2018 ◽  
Vol 12 (3) ◽  
pp. 143-157 ◽  
Author(s):  
Håvard Raddum ◽  
Pavol Zajac
Keyword(s):  
Linear Algebra ◽  
Matrix Representation ◽  
Equation System ◽  
Exhaustive Search ◽  
Binary Matrix ◽  
Algebraic Attacks ◽  
The Matrix ◽  
Speed Up ◽  
Symmetric Key

Abstract We show how to build a binary matrix from the MRHS representation of a symmetric-key cipher. The matrix contains the cipher represented as an equation system and can be used to assess a cipher’s resistance against algebraic attacks. We give an algorithm for solving the system and compute its complexity. The complexity is normally close to exhaustive search on the variables representing the user-selected key. Finally, we show that for some variants of LowMC, the joined MRHS matrix representation can be used to speed up regular encryption in addition to exhaustive key search.

scholarly journals Pulmonary Mucosa-Associated Lymphoid Tissue Lymphoma: A Report of 2 Cases and Literature Review

2021 ◽  
Vol 1 (1) ◽  
pp. 36-40
Author(s):  
Xiangting Xie ◽  
◽  
Ying Zhang ◽  
Xiaoyan Tan ◽  
Yun Luo ◽  
...  
Keyword(s):  
Computed Tomography ◽  
Malt Lymphoma ◽  
Lymphoid Tissue ◽  
Relevant Literature ◽  
Complete Resection ◽  
The Other ◽  
Malignant Lymphomas ◽  
Chest Computed Tomography ◽  
Pulmonary Malt Lymphoma

Pulmonary mucosa-associated lymphoid tissue (MALT) lymphoma is indolent and progresses more slowly than other malignant lymphomas. The clinical features are not specific and the diagnosis can often be difficult. Here, we present two rare cases of pulmonary MALT lymphoma. Both patients were incidentally found lesions in the lungs with chest computed tomography during physical examination. They were finally diagnosed by pathological biopsy. One received complete resection, the other was treated with chemotherapy. There were no recurrence in the two patients during follow-up. We also review relevant literature to provide a better recognition of this disease.

scholarly journals Institutional Traps of Digitalization of Russian Higher Education

2021 ◽  
Vol 30 (3) ◽  
pp. 59-75
Author(s):  
M. A. Golovchin
Keyword(s):  
Higher Education ◽  
Large Scale ◽  
New Technologies ◽  
Teaching Staff ◽  
Original Matrix ◽  
Russian Higher Education ◽  
The Matrix ◽  
Institutional Traps ◽  
The Impact ◽  
Russian Universities

In 2016-2018 the state in Russia adopted a package of program documents, which implies the transfer of education to the large-scale introduction of digital technologies. This phenomenon has been called “digitalization of education”. In scientific literature, electronization and digitalization are increasingly called one of the institutional traps for the development of Russian universities, since the corresponding institutional environment has not yet been formed due to the forced nature of innovations. As a result, the processes of introducing new technologies into education are still not regulated. Within the framework of the purpose of the study, the manifestations of the trap of electronization and digitalization of Russian higher education were analyzed on the basis of sociological data, and the theoretical modeling of the process of adaptation of educational agents to the institution of digitalization was carried out.In the course of the study, the approaches were summarized that have been developed in discussions on educational digitalization. The article presents the author’s vision of the studied phenomenon as an institutional trap; as well as understanding of the institutional features and characteristics of electronization and digitalization in education.The research method is the analysis of estimates obtained in the course of an expert survey which was conducted by the Vologda Scientific Center of the Russian Academy of Sciences among the representatives of the teaching staff of state universities in the Vologda region. In the course of this analysis, the indicators of educational digitalization as an effective innovation were clarified such as an increased accessibility of educational resources; simplification of communication and the process of transferring knowledge from teacher to student; increased opportunities for training specialists for the new (digital) economy; improving the quality of education in universities, etc. Based on the results of the empirical study, it has been determined that the conditions for the development of digitalization in Russian universities are currently ambiguous, which is closely related to the level of competitiveness of the educational organization.The scientific novelty of the research consists in the presentation of an original matrix describing the process of university employees adaptation to the conditions of digital transformation of education. The matrix is proposed on the basis of a sociological analysis of the impact of the trap of electronization and digitalization on the activities of educational agents. The matrix can be taken into account in the practice of higher education management.

Sign in / Sign up

Export Citation Format

Share Document