• 제목/요약/키워드: non-representation

검색결과 444건 처리시간 0.024초

ON REGULARITY OF SOME FINITE GROUPS IN THE THEORY OF REPRESENTATION

  • Park, Eun-Mi
    • 대한수학회논문집
    • /
    • 제9권4호
    • /
    • pp.773-782
    • /
    • 1994
  • Investigation of the number of representations as well as of projective representations of a finite group has been important object since the early of this century. The numbers are very related to the number of conjugacy classes of G, so that this gives some informations on finite groups and on group characters. A generally well-known fact is that the number of non-equivlaent irreducible representations, which we shall write as n.i.r. of G is less than or equal to the number of conjugacy classes of G, and the equality holds over an algebraically closed field of characteristic not dividing $\mid$G$\mid$. A remarkable result on the numbers due to Reynolds can be stated as follows.

  • PDF

최소 면적의 CMOS 기능셀 설계도면을 찾는 휴리스틱 알고리즘 (A Heuristic Algorithm for Minimal Area CMOS Cell Layout)

  • 권용준;경종민
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
    • /
    • pp.1463-1466
    • /
    • 1987
  • The problem of generating minimal area CMOS functional cell layout can be converted to that of decomposing the transistor connection graph into a minimum number of subgraphs, each having a pair of Euler paths with the same sequence of input labels on the N-graph and P-graph, which are portions of the graph corresponding to NMOS and PMOS parts respectively. This paper proposes a heuristic algorithm which yields a nearly minimal number of Euler paths from the path representation formula which represents the give a logic function. Subpath merging is done through a list processing scheme where the pair of paths which results in the lowest cost is successively merged from all candidate merge pairs until no further path merging and further reduction of number of subgraphs are possible. Two examples were shown where we were able to further reduce the number of interlaces, i.e., the number of non-butting diffusion islands, from 3 to 2, and from 2 to 1, compared to the earlier work [1].

  • PDF

Damage assessment of frame structure using quadratic time-frequency distributions

  • Chandra, Sabyasachi;Barai, S.V.
    • Structural Engineering and Mechanics
    • /
    • 제49권3호
    • /
    • pp.411-425
    • /
    • 2014
  • This paper presents the processing of nonlinear features associated with a damage event by quadratic time-frequency distributions for damage identification in a frame structure. A time-frequency distribution is a function which distributes the total energy of a signal at a particular time and frequency point. As the occurrence of damage often gives rise to non-stationary, nonlinear structural behavior, simultaneous representation of the dynamic response in the time-frequency plane offers valuable insight for damage detection. The applicability of the bilinear time-frequency distributions of the Cohen class is examined for the damage assessment of a frame structure from the simulated acceleration data. It is shown that the changes in instantaneous energy of the dynamic response could be a good damage indicator. Presence and location of damage can be identified using Choi-Williams distribution when damping is ignored. However, in the presence of damping the Page distribution is more effective and offers better readability for structural damage detection.

A New Analytical Representation to Robot Path Generation with Collision Avoidance through the Use of the Collision Map

  • Park Seung-Hwan;Lee Beom-Hee
    • International Journal of Control, Automation, and Systems
    • /
    • 제4권1호
    • /
    • pp.77-86
    • /
    • 2006
  • A new method in robot path generation is presented using an analysis of the characteristics of multi-robot collision avoidance. The research is based on the concept of the collision map, where the collision between two robots is presented by a collision region and a crossing curve TLVSTC (traveled length versus servo time curve). Analytic collision avoidance is considered by translating the collision region in the collision map. The 4 different translations of collision regions correspond to the 4 parallel movements of the actual original robot path in the real world. This analysis is applied to path modifications where the analysis of collision characteristics is crucial and the resultant path for collision avoidance is generated. Also, the correlations between the translations of the collision region and robot paths are clarified by analyzing the collision/non-collision areas. The influence of the changes of robot velocity is investigated analytically in view of collision avoidance as an example.

Support Vector Machines 기반의 클러스터 결합 기법 (Support Vector Machine based Cluster Merging)

  • 최병인;이정훈
    • 한국지능시스템학회논문지
    • /
    • 제14권3호
    • /
    • pp.369-374
    • /
    • 2004
  • Convex한 클러스터간의 최적의 거리와 Fuzzy Convex Clustering(FCC) 방법에 의한 효과적인 클러스터 결합 알고리즘을 제시하였다. 또한 두 convex한 클러스터간의 거리 측정 방법의 문제점인 정확성과 수행속도 개선하기 위하여 Support Vector Machines(SVM) 을 이용한 빠르고 정확한 거리 측정 방법을 제시하였다. 따라서 데이터의 부적절한 표현 없이 클러스터들의 개수를 크게 더 줄일 수 있었다. 본 논문에서는 제시한 알고리즘의 타당성을 위하여 여러 데이터에 대한 실험결과를 보여주므로서 제시한 알고리즘을 실제 영상 분할에 적용하여 다른 클러스터링 방법의 결과와 비교분석한다.

Global Optimization of Clusters in Gene Expression Data of DNA Microarrays by Deterministic Annealing

  • Lee, Kwon Moo;Chung, Tae Su;Kim, Ju Han
    • Genomics & Informatics
    • /
    • 제1권1호
    • /
    • pp.20-24
    • /
    • 2003
  • The analysis of DNA microarry data is one of the most important things for functional genomics research. The matrix representation of microarray data and its successive 'optimal' incisional hyperplanes is a useful platform for developing optimization algorithms to determine the optimal partitioning of pairwise proximity matrix representing completely connected and weighted graph. We developed Deterministic Annealing (DA) approach to determine the successive optimal binary partitioning. DA algorithm demonstrated good performance with the ability to find the 'globally optimal' binary partitions. In addition, the objects that have not been clustered at small non­zero temperature, are considered to be very sensitive to even small randomness, and can be used to estimate the reliability of the clustering.

MDS 분석방법을 이용한 거실의 가구사용행태연구 (An Application of MDS(Multidimensional Scaling) Methods to the Study of Furniture Usage and Behavior in the Living Room)

  • 조성희
    • 한국주거학회논문집
    • /
    • 제1권2호
    • /
    • pp.1-11
    • /
    • 1990
  • A study of domestic furniture arrangements may reveal the living style relevant to the room as conceived and coded by occupants and the effects of the physical environment on the structure of behavior settings. The purpose of this study was to investigate, through analizing the furniture usage and behavior as a non-reactive and activity oriented behavioral measures, the occupants` domestic habits as a living style using MDS. MDS(multidimensional scaling technique) is a statistical technique for creating a spatial representation of data. It Is a particularly appropriate technique for analizing qualitative data such as the furniture usage and behavior because it takes into account all of the relationships between items. For the MDS analysis, the furniture usage and behavior examined by housing types based on 114 households in Seoul. The result of spatial configuration by MDS has three dimensions : recogn;lion of room function, pattern of room organization, understanding of room meaning. The effect of housing types for dimensions is identical but configuration of furniture items is different.

  • PDF

공리적 설계 이론 향상을 위한 제언 (A Suggestion and a Contribution for the Improvement of Axiomatic Design)

  • 최덕현;황운봉
    • 대한기계학회논문집A
    • /
    • 제28권7호
    • /
    • pp.970-976
    • /
    • 2004
  • For a long time, design methodologies strive to systematize the design process in order to make the practice more efficient and effective. One of such methodologies is Axiomatic Design. However, this design theory still has some problems and is not completely settled. In this paper, the new issue for the non-linear design in Axiomatic Design is suggested and the representation of system architecture by flow chart is corrected. In the case that the design equation varies as a function of the variation of DP ($\delta$DP), the design should be regarded as the nonlinear design because the design equation is not a constant. When system architectures are represented by a flow chart, all systems could not be independently represented. However, by adding the notation of the end of decoupling to the notations using in flow chart, those can be independently represented.

NURBS 곡면기반의 기하학적 모델링과 셀 유한요소해석의 연동 (Integration of Shell FEA with Geometric Modeling Based on NURBS Surface Representation)

  • 최진복;노희열;조맹효
    • 대한기계학회논문집A
    • /
    • 제31권1호
    • /
    • pp.105-112
    • /
    • 2007
  • The linkage framework of geometric modeling based on NURBS(Non-Uniform Rational B-Spline) surface and shell finite analysis is developed in the present study. For this purpose, geometrically exact shell finite element is implemented. NURBS technology is employed to obtain the exact geometric quantities for the analysis. Especially, because NURBS is the most powerful and wide-spread method to represent general surfaces in the field of computer graphics and CAD(Computer Aided Design) industry, the direct computation of surface geometric quantities from the NURBS surface equation without approximation shows great potential for the integration between geometrically exact shell finite element and geometric modeling in the CAD systems. Some numerical examples are given to verify the performance and accuracy of the developed linkage framework. In additions, trimmed surfaces with some cutouts are considered for more practical applications.

Surface Extraction from Multi-material CT Data

  • Fujimori, Tomoyuki;Suzuki, Hiromasa
    • International Journal of CAD/CAM
    • /
    • 제6권1호
    • /
    • pp.81-87
    • /
    • 2006
  • This paper describes a method for extracting surfaces from multi-material CT (Computed Tomography) data. Most contouring methods such as Marching Cubes algorithm assume that CT data are composed of only two materials. Some extended methods such as [3, 6] can extract surfaces from the multi-material (non-manifold) implicit representation. However, these methods are not directly applicable to CT data that are composed of three or more materials. There are two major problems that arise from fundamentals of CT. The first problem is that we have to use n(n-1)/2 threshold values for CT data contains n materials and select appropriately one threshold value for each boundary area. The second is that we cannot reconstruct only from CT data in which area three or more materials are adjacent each other. In this paper, we propose a method to solve the problems by using image analysis and demonstrate the effectiveness of the method with application examples construct polygon models from CT data of machine parts.