• 산업경영시스템학회지
• /
• 제32권4호
• /
• pp.192-202
• /
• 2009

Disassembly of products at their end-of-life (EOL) is a prerequisite for recycling or remanufacturing, since most products should be disassembled before being recycled or remanufactured as secondary parts or materials. In disassembly sequence planning of EOL products, considered are the uncertainty issues, i.e., defective parts or joints in an incoming product, disassembly damage, and imprecise net profits and costs. The paper deals with the problem of determining the disassembly level and corresponding sequence, with the objective of maximizing the overall profit under uncertainties in disassembly cost and/or revenue. The solution is represented as the longest path on a directed acyclic graph where parameter (arc length) uncertainties are modeled in the form of intervals. And, a heuristic algorithm is developed to find a path with the minimum worst case regret, since the problem is NP-hard. Computational experiments are carried out to show the performance of the proposed algorithm compared with the mixed integer programming model and Conde's heuristic algorithm.

• ETRI Journal
• /
• 제43권4호
• /
• pp.728-745
• /
• 2021

Carbon nanotube field-effect transistors (CNTFETs) have been widely studied as a promising technology to be included in post-complementary metal-oxide-semiconductor integrated circuits. Despite significant advantages in terms of delay and power dissipation, the fabrication process for CNTFETs is plagued by fault occurrences. Therefore, developing a fast and accurate method for estimating the reliability of CNTFET-based digital circuits was the main goal of this study. In the proposed method, effects related to faults that occur in a gate's transistors are first represented as a probability transfer matrix. Next, the target circuit's graph is traversed in topological order and the reliabilities of the circuit's gates are computed. The accuracy of this method (less than 3% reliability estimation error) was verified through various simulations on the ISCAS 85 benchmark circuits. The proposed method outperforms previous methods in terms of both accuracy and computational complexity.

• Journal of applied mathematics & informatics
• /
• 제41권3호
• /
• pp.553-567
• /
• 2023

There are real life situations in our lives where the things are changing continuously or from time to time. It is a very important problem for one whether to continue the existing relationship or to form a new one after some occasions. That is, people, companies, cities, countries, etc. may change their opinion or position rapidly. In this work, we think of the problem of changing relationships from a mathematical point of view and think of an answer. In some sense, we comment these changes as power changes. Our number theoretical model will be based on this idea. Using the convolution sum of the restricted divisor function E, we obtain the answer to this problem.

• Journal of applied mathematics & informatics
• /
• 제40권1_2호
• /
• pp.117-132
• /
• 2022

Reverse edge magic(REM) labeling of the graph G = (V, E) is a bijection of vertices and edges to a set of numbers from the set, defined by λ : V ∪ E → {1, 2, 3, …, |V| + |E|} with the property that for every xy ∈ E, constant k is the weight of equals to a xy, that is λ(xy) - [λ(x) + λ(x)] = k for some integer k. We given the construction of REM labeling for the Cartesian Product, Unions of Braids and Unions of Triangular Belts. The Kotzig array used in this paper is the 3 × (2r + 1) kotzig array. we test the konow results about REM labelling that are related to the new results we found.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2023년도 춘계학술발표대회
• /
• pp.468-469
• /
• 2023

실세계 네트워크 데이터에서 노드들 간의 관계는 종종 친구/적 혹은 지지/반대와 같이 대조적인 부호를 갖는다. 이러한 네트워크를 분석하기 위해, 부호가 있는 네트워크 임베딩 (signed network embedding, 이하 SNE) 문제에 대한 관심이 급증하고 있다. 특히, 최근 들어 그래프 합성곱 네트워크 기술을 기반으로 하는 SNE 방법들에 대한 연구가 활발히 수행되어 오고 있다. 본 논문에서는, 부호가 있는 네트워크의 희소성 정도가 기존 SNE 방법들의 성능에 어떻게 영향을 미치는 지에 대해 분석하고자 한다. 4 개의 실세계 데이터 집합들을 이용한 실험을 통해, 우리는 기존 방법들의 부호 예측 정확도가 희소한 네트워크들에서는 상당히 감소하는 것을 확인하였다.

• Journal of applied mathematics & informatics
• /
• 제42권4호
• /
• pp.739-748
• /
• 2024

The intention of this paper is to acquaint domination, total domination on bipolar intuitionistic fuzzy graphs. Subsequently for bipolar intuitionistic fuzzy graphs the domination number and the total domination number are defined. Consequently we proved necessary and sufficient condition for a d-set to be minimal d-set, bounds for domination number and equality conditions for domination number and order.

• Journal of applied mathematics & informatics
• /
• 제42권4호
• /
• pp.899-913
• /
• 2024

In this article, the Series Solution Method (SSM) is employed to solve the linear or non-linear Volterra integro-differential equations. Numerous examples have been presented to explain the numerical results, which is the comparison between the exact solution and the numerical solution, and it is found through the tables. The amount of error between the exact solution and the numerical solution is very small and almost nonexistent, and it is also illustrated through the graph how the exact solution completely applies to the numerical solution. This proves the accuracy of the method, which is the Series Solution Method (SSM) for solving the linear or non-linear Volterra integro-differential equations using Mathematica. Furthermore, this approach yields numerical results with remarkable accuracy, speed, and ease of use.

• 한국HCI학회:학술대회논문집
• /
• 한국HCI학회 2009년도 학술대회
• /
• pp.625-630
• /
• 2009

영상기반의 3차원 복원(reconstruction)에 대한 연구가 최근 좋은 결과를 많이 내고 있지만, 이는 복원의 목적이 되는 영역이 각 입력영상으로부터 미리 정확하게 추출되어있다고 가정하기 때문이다. 본 논문에서는 다시점 영상에서 세그멘트(segment)라 불리는 초기 분할된 영역을 기반으로 전경물체 추출과 3차원 복원을 EM형식으로 반복적으로 수행하는 정교한 전경물체 추출방법을 제안한다. 본 논문에서 세그멘트는 수행시간을 최소화하기 위해 사용된 3차원 복원방법인 visual hull에 의해 발생한 외곽선 오류를 보상해야 하며, 사용자의 입력을 최소화하기 위해 적은 수의 집합으로 구성되어야 한다. 이를 위해 데이터 항과 스무드 항으로 구성된 에너지 함수를 최적화할 수 있는 그래프 컷 방법을 이용하는 영상분할을 초기단계로써 수행하며, 전경물체 추출과 3차원 복원은 에너지 함수가 최적화될 때까지 반복 수행한다. 실험에서 간단한 3차원 복원 방법을 이용함에도 불구하고 전경물체의 외곽선에서 정확한 결과를 보였다.

• Journal of Communications and Networks
• /
• 제6권3호
• /
• pp.269-279
• /
• 2004

A new online multi-layer integrated routing (MLIR) scheme that combines IP (electrical) layer routing with WDM (optical) layer routing is investigated. It is a highly efficient and cost-effective routing scheme viable for the next generation integrated optical Internet. A new simplified weighted graph model for the integrated optical Internet consisted of optical routers with multi-granularity optical-electrical hybrid switching capability is firstly proposed. Then, based on the proposed graph model, we develop an online integrated routing scheme called differentiated weighted fair algorithm (DWFA) employing adaptive admission control (routing) strategies with the motivation of service/bandwidth differentiation, which can jointly solve multi-layer routing problem by simply applying the minimal weighted path computation algorithm. The major objective of DWFA is fourfold: 1) Quality of service (QoS) routing for traffic requests with various priorities; 2) blocking fairness for traffic requests with various bandwidth granularities; 3) adaptive routing according to the policy parameters from service provider; 4) lower computational complexity. Simulation results show that DWFA performs better than traditional overlay routing schemes such as optical-first-routing (OFR) and electrical-first-routing (EFR), in terms of traffic blocking ratio, traffic blocking fairness, average traffic logical hop counts, and global network resource utilization. It has been proved that the DWFA is a simple, comprehensive, and practical scheme of integrated routing in optical Internet for service providers.

• 한국통신학회논문지
• /
• 제30권11A호
• /
• pp.979-986
• /
• 2005

광전달망(Optical Transport Network)에서 사용자의 서비스 요구는 종종 주기적인 특성을 보이므로 이러한 계획 연결 요구에 대하여 시간 중복성을 RWA 문제에 이용할 수 있다. 계획 연결 요구의 RWA 문제는 조합 최적화 방법(Combinatorial Optimal Solution)과 그래프 컬러링(Graph Coloring)의 조합으로 해결되거나, 경로 선택에 기반한 순차적(sequential) RWA(sRWA) 의해서 해결된다. 이와 같은 방법은 복잡하거나 많은 연산을 필요로 하므로 본 논문에서는 그룹화를 통해 계획 연결 요구들의 시간 중복성을 이용하여 효과적으로 경로 설정 및 파장 할당을 하는 알고리즘을 제안한다. 본 논문에서 제안하는 알고리즘이 현재 실질적으로 효율적이라 알려진 sRWA 보다 같거나 작은 파장 수를 사용하여 $54\%$ 이상의 계산량의 성능 향상을 보인다.