Bimal Chandra Das | Daffodil International University(DIU) (original) (raw)

Uploads

Papers by Bimal Chandra Das

Research paper thumbnail of A cost-effective counterfeiting prevention method using hashing, QR code, and website

International Journal of Advances in Applied Sciences, Jun 1, 2024

In this paper, we proposed a cost-effective software method to prevent counterfeiting where we us... more In this paper, we proposed a cost-effective software method to prevent counterfeiting where we used a website, quick-response (QR) code, and hashing. At the early stage of the product, the system will create a unique ID and a password with a random password generator for all products. Then, the password hash would be stored along with the ID in the database. At the same time, the password would be converted into a QR code for each product. The manufacturer will collect the QR code and ID and attach them to the product. When consumers attempt to verify the product, they will enter the website provided by the manufacturer and scan the QR code. After applying the same hash used before, the code will be checked on the database. After a successful check, the product entity will be destroyed and the life of the product ends. This paper contains flowcharts, figures, cost estimation, and a detailed explanation of the system. As it only requires domain hosting, thus the fixed cost of the system is so lower to bear for small enterprises also. We built a similar system using PHP, HTML, JavaScript for websites, and MYSQL for databases.

Research paper thumbnail of ICONCS2Conic Programming Approach to Reduce Congestion Ratio in Communications Network020-published

Springer Nature, 2021

. This research introduce a robust optimization model to reduce the congestion ratio in communica... more . This research introduce a robust optimization model to
reduce the congestion ratio in communications network considering
uncertainty in the traffic demands. The propose formulation is depended
on a model called the pipe model. Network traffic demand is fixed in the
pipe model and most of the previous researches consider traffic fluctuation locally. Our proposed model can deal with fluctuation in the traffic
demands and considers this fluctuation all over the network. We formulates the robust optimization model in the form of second-order cone programming (SOCP) problem which is tractable by optimization software. The numerical experiments determine the efficiency of our model in terms of reducing the congestion ratio compared to the others model.

Research paper thumbnail of A Simple SOCP formulation of Minimization of Network Congestion Ratio (The state-of-the-art optimization technique and future development)

Research paper thumbnail of A Simple SOCP formulation of \ mathrm { M } 而而zation of Network Congestion Ratio

The network link utilization rate is the ratio of traffic flow through a link and its capacity. T... more The network link utilization rate is the ratio of traffic flow through a link and its capacity. The network congestion ratio is the maximum value of all links utilization rates. When some hnks or nodes in network broadcast too much information, it causes network congestion and decreases the network performance by taking more time to send information from source to destination, packet loss or reducing the throughput ([1]). How to minimize the congestion ratio is an important affairs of information and communication technology (ICT) sector. There are several researches on the minimization of the network congestion ratio. Wang and Wang [2] proposed a specific routing problem for intemet traffic engineering as a linear programming (LP) problem whose objective is to minimize the congestion ratio. In their work they assuming that the traffic demand d_{pq} for every pair (p, q) of source node p and destination node q is exactly known. In fact, due to the exact traffic matrix, T=\{d_{pq}\} this research provides a acceptable routing performance than the Multi-Protocol Label Switching (MPLS) standard. The traffic model which is exploits the exact traffic matrix is known as the pipe model ([3], [4], [5]).

Research paper thumbnail of Approach to problem of minimizing network power consumption based on robust optimization

International Journal of Communication Systems, 2019

In this paper, a green and robust optimization model is introduced to minimize network power cons... more In this paper, a green and robust optimization model is introduced to minimize network power consumption, which allows fluctuations of traffic demands between source-destination pairs in the network. Our model is based on the green hose model, where the traffic is bounded by just total outgoing and incoming amount at each node. In addition to the green hose model, we use the ellipsoidal uncertainty set to allow a different type of fluctuations in traffic demands. Here, the total amount of squared errors in traffic demands is bounded by a constant which controls the total admissible fluctuations over the network. Applying the conic duality, we formulate our model in the form of mixed-integer second order cone programming (MISOCP) problem. Furthermore, we establish a relationship between our model and the green hose model with bound of link traffic (HLT) model, an developed version of the hose model known as the HLT. Numerical results demonstrate that each of the MISOCP problems can be solved to its optimality in a reasonable time by a general MISOCP solver, and that the proposed model has different tendency in performance with the green hose and green HLT models.

Research paper thumbnail of Network Congestion Minimization Models Based on Robust Optimization

IEICE Transactions on Communications, 2017

Research paper thumbnail of Effect QF Transportation Problem in Business and Economic Sector

Research paper thumbnail of A comparative study of the methods of solving non-linear programming problem

Daffodil International University Journal of Science and Technology, 1970

The work present in this paper is based on a comparative study of the methods of solving Non-line... more The work present in this paper is based on a comparative study of the methods of solving Non-linear programming (NLP) problem. We know that Kuhn-Tucker condition method is an efficient method of solving Non-linear programming problem. By using Kuhn-Tucker conditions the quadratic programming (QP) problem reduced to form of Linear programming(LP) problem, so practically simplex type algorithm can be used to solve the quadratic programming problem (Wolfe's Algorithm).We have arranged the materials of this paper in following way. Fist we discuss about non-linear programming problems. In second step we discuss Kuhn- Tucker condition method of solving NLP problems. Finally we compare the solution obtained by Kuhn- Tucker condition method with other methods. For problem so consider we use MATLAB programming to graph the constraints for obtaining feasible region. Also we plot the objective functions for determining optimum points and compare the solution thus obtained with exact soluti...

Research paper thumbnail of Effect of graphical method for solving mathematical programming problem

Daffodil International University Journal of Science and Technology, 1970

In this paper, a computer implementation on the effect of graphical method for solving mathematic... more In this paper, a computer implementation on the effect of graphical method for solving mathematical programming problem using MATLAB programming has been developed. To take any decision, for programming problems we use most modern scientific method based on computer implementation. Here it has been shown that by graphical method using MATLAB programming from all kinds of programming problem, we can determine a particular plan of action from amongst several alternatives in very short time. Keywords: Mathematical programming, objective function, feasible-region, constraints, optimal solution. DOI: 10.3329/diujst.v5i1.4379 Daffodil International University Journal of Science and Technology Vol.5(1) 2010 pp.29-36

Research paper thumbnail of An improved Kohonen self-organizing map clustering algorithm for high-dimensional data sets

Indonesian Journal of Electrical Engineering and Computer Science, 2021

Manipulating high-dimensional data is a major research challenge in the field of computer science ... more Manipulating high-dimensional data is a major research challenge in the field of computer science in recent years. To classify this data, a lot of clustering algorithms have already been proposed. Kohonen self-organizing map (KSOM) is one of them. However, this algorithm has some drawbacks like overlapping clusters and non-linear separability problems. Therefore, in this paper, we propose an improved KSOM (I-KSOM) to reduce the problems that measures distances among objects using EISEN Cosine correlation formula. So far as we know, no previous work has used EISEN Cosine correlation distance measurements to classify high-dimensional data sets. To the robustness of the proposed KSOM, we carry out the experiments on several popular datasets like Iris, Seeds, Glass, Vertebral column, and Wisconsin breast cancer data sets. Our proposed algorithm shows better result compared to the existing original KSOM and another modified KSOM in terms of predictive performance with topographic and quant...

Research paper thumbnail of Comparative Performance of Green Pipe, Green Hose and Green Hose-Rectangle Models in Power Efficient Network

2018 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR), 2018

In this paper, a green and robust optimization model is proposed to the problem of minimizing net... more In this paper, a green and robust optimization model is proposed to the problem of minimizing network power consumption which can deal with uncertainty in traffic demands. The green pipe model achieves the first position in terms of minimizing network power consumption if we know the exact traffic demand. However, in reality, traffic demands fluctuate due to various situation. The hose model, which is formulated from the total outgoing/incoming amount of traffic from/to each node can allows errors in the traffic demands but its power consumption is higher than that of the green pipe model. Our proposed scheme is based on the green pipe model. For robust optimization, we use an uncertainty set which is the intersection of the hose and rectangle uncertainty set. The rectangle uncertainty set narrows the range of traffic conditions defined by the hose model by adding the upper and lower bounds for each source-destination pair in the network. In the worst case of traffic flow, we consider a subproblem and formulate the green hose-rectangle model (green HR) in the form of mixed-integer linear programming (MILP). Numerical results demonstrate that the problems obtained by the proposed green HR model can be solved by optimization software and reduce the network power consumption compare to the green hose model.

Research paper thumbnail of A cost-effective counterfeiting prevention method using hashing, QR code, and website

International Journal of Advances in Applied Sciences, Jun 1, 2024

In this paper, we proposed a cost-effective software method to prevent counterfeiting where we us... more In this paper, we proposed a cost-effective software method to prevent counterfeiting where we used a website, quick-response (QR) code, and hashing. At the early stage of the product, the system will create a unique ID and a password with a random password generator for all products. Then, the password hash would be stored along with the ID in the database. At the same time, the password would be converted into a QR code for each product. The manufacturer will collect the QR code and ID and attach them to the product. When consumers attempt to verify the product, they will enter the website provided by the manufacturer and scan the QR code. After applying the same hash used before, the code will be checked on the database. After a successful check, the product entity will be destroyed and the life of the product ends. This paper contains flowcharts, figures, cost estimation, and a detailed explanation of the system. As it only requires domain hosting, thus the fixed cost of the system is so lower to bear for small enterprises also. We built a similar system using PHP, HTML, JavaScript for websites, and MYSQL for databases.

Research paper thumbnail of ICONCS2Conic Programming Approach to Reduce Congestion Ratio in Communications Network020-published

Springer Nature, 2021

. This research introduce a robust optimization model to reduce the congestion ratio in communica... more . This research introduce a robust optimization model to
reduce the congestion ratio in communications network considering
uncertainty in the traffic demands. The propose formulation is depended
on a model called the pipe model. Network traffic demand is fixed in the
pipe model and most of the previous researches consider traffic fluctuation locally. Our proposed model can deal with fluctuation in the traffic
demands and considers this fluctuation all over the network. We formulates the robust optimization model in the form of second-order cone programming (SOCP) problem which is tractable by optimization software. The numerical experiments determine the efficiency of our model in terms of reducing the congestion ratio compared to the others model.

Research paper thumbnail of A Simple SOCP formulation of Minimization of Network Congestion Ratio (The state-of-the-art optimization technique and future development)

Research paper thumbnail of A Simple SOCP formulation of \ mathrm { M } 而而zation of Network Congestion Ratio

The network link utilization rate is the ratio of traffic flow through a link and its capacity. T... more The network link utilization rate is the ratio of traffic flow through a link and its capacity. The network congestion ratio is the maximum value of all links utilization rates. When some hnks or nodes in network broadcast too much information, it causes network congestion and decreases the network performance by taking more time to send information from source to destination, packet loss or reducing the throughput ([1]). How to minimize the congestion ratio is an important affairs of information and communication technology (ICT) sector. There are several researches on the minimization of the network congestion ratio. Wang and Wang [2] proposed a specific routing problem for intemet traffic engineering as a linear programming (LP) problem whose objective is to minimize the congestion ratio. In their work they assuming that the traffic demand d_{pq} for every pair (p, q) of source node p and destination node q is exactly known. In fact, due to the exact traffic matrix, T=\{d_{pq}\} this research provides a acceptable routing performance than the Multi-Protocol Label Switching (MPLS) standard. The traffic model which is exploits the exact traffic matrix is known as the pipe model ([3], [4], [5]).

Research paper thumbnail of Approach to problem of minimizing network power consumption based on robust optimization

International Journal of Communication Systems, 2019

In this paper, a green and robust optimization model is introduced to minimize network power cons... more In this paper, a green and robust optimization model is introduced to minimize network power consumption, which allows fluctuations of traffic demands between source-destination pairs in the network. Our model is based on the green hose model, where the traffic is bounded by just total outgoing and incoming amount at each node. In addition to the green hose model, we use the ellipsoidal uncertainty set to allow a different type of fluctuations in traffic demands. Here, the total amount of squared errors in traffic demands is bounded by a constant which controls the total admissible fluctuations over the network. Applying the conic duality, we formulate our model in the form of mixed-integer second order cone programming (MISOCP) problem. Furthermore, we establish a relationship between our model and the green hose model with bound of link traffic (HLT) model, an developed version of the hose model known as the HLT. Numerical results demonstrate that each of the MISOCP problems can be solved to its optimality in a reasonable time by a general MISOCP solver, and that the proposed model has different tendency in performance with the green hose and green HLT models.

Research paper thumbnail of Network Congestion Minimization Models Based on Robust Optimization

IEICE Transactions on Communications, 2017

Research paper thumbnail of Effect QF Transportation Problem in Business and Economic Sector

Research paper thumbnail of A comparative study of the methods of solving non-linear programming problem

Daffodil International University Journal of Science and Technology, 1970

The work present in this paper is based on a comparative study of the methods of solving Non-line... more The work present in this paper is based on a comparative study of the methods of solving Non-linear programming (NLP) problem. We know that Kuhn-Tucker condition method is an efficient method of solving Non-linear programming problem. By using Kuhn-Tucker conditions the quadratic programming (QP) problem reduced to form of Linear programming(LP) problem, so practically simplex type algorithm can be used to solve the quadratic programming problem (Wolfe's Algorithm).We have arranged the materials of this paper in following way. Fist we discuss about non-linear programming problems. In second step we discuss Kuhn- Tucker condition method of solving NLP problems. Finally we compare the solution obtained by Kuhn- Tucker condition method with other methods. For problem so consider we use MATLAB programming to graph the constraints for obtaining feasible region. Also we plot the objective functions for determining optimum points and compare the solution thus obtained with exact soluti...

Research paper thumbnail of Effect of graphical method for solving mathematical programming problem

Daffodil International University Journal of Science and Technology, 1970

In this paper, a computer implementation on the effect of graphical method for solving mathematic... more In this paper, a computer implementation on the effect of graphical method for solving mathematical programming problem using MATLAB programming has been developed. To take any decision, for programming problems we use most modern scientific method based on computer implementation. Here it has been shown that by graphical method using MATLAB programming from all kinds of programming problem, we can determine a particular plan of action from amongst several alternatives in very short time. Keywords: Mathematical programming, objective function, feasible-region, constraints, optimal solution. DOI: 10.3329/diujst.v5i1.4379 Daffodil International University Journal of Science and Technology Vol.5(1) 2010 pp.29-36

Research paper thumbnail of An improved Kohonen self-organizing map clustering algorithm for high-dimensional data sets

Indonesian Journal of Electrical Engineering and Computer Science, 2021

Manipulating high-dimensional data is a major research challenge in the field of computer science ... more Manipulating high-dimensional data is a major research challenge in the field of computer science in recent years. To classify this data, a lot of clustering algorithms have already been proposed. Kohonen self-organizing map (KSOM) is one of them. However, this algorithm has some drawbacks like overlapping clusters and non-linear separability problems. Therefore, in this paper, we propose an improved KSOM (I-KSOM) to reduce the problems that measures distances among objects using EISEN Cosine correlation formula. So far as we know, no previous work has used EISEN Cosine correlation distance measurements to classify high-dimensional data sets. To the robustness of the proposed KSOM, we carry out the experiments on several popular datasets like Iris, Seeds, Glass, Vertebral column, and Wisconsin breast cancer data sets. Our proposed algorithm shows better result compared to the existing original KSOM and another modified KSOM in terms of predictive performance with topographic and quant...

Research paper thumbnail of Comparative Performance of Green Pipe, Green Hose and Green Hose-Rectangle Models in Power Efficient Network

2018 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR), 2018

In this paper, a green and robust optimization model is proposed to the problem of minimizing net... more In this paper, a green and robust optimization model is proposed to the problem of minimizing network power consumption which can deal with uncertainty in traffic demands. The green pipe model achieves the first position in terms of minimizing network power consumption if we know the exact traffic demand. However, in reality, traffic demands fluctuate due to various situation. The hose model, which is formulated from the total outgoing/incoming amount of traffic from/to each node can allows errors in the traffic demands but its power consumption is higher than that of the green pipe model. Our proposed scheme is based on the green pipe model. For robust optimization, we use an uncertainty set which is the intersection of the hose and rectangle uncertainty set. The rectangle uncertainty set narrows the range of traffic conditions defined by the hose model by adding the upper and lower bounds for each source-destination pair in the network. In the worst case of traffic flow, we consider a subproblem and formulate the green hose-rectangle model (green HR) in the form of mixed-integer linear programming (MILP). Numerical results demonstrate that the problems obtained by the proposed green HR model can be solved by optimization software and reduce the network power consumption compare to the green hose model.