• 제어로봇시스템학회논문지
• /
• 제5권3호
• /
• pp.281-287
• /
• 1999

In this paper, a design method based on evolutionary programming for feedforward neural networks which have a single hidden layer is presented. By using an evolutionary programming, the network parameters such as the network structure, weight, slope of sigmoid functions and bias of nodes can be acquired simultaneously. To check the effectiveness of the suggested method, two numerical examples are examined. The performance of the identified network is demonstrated.

• Journal of Information Processing Systems
• /
• 제18권1호
• /
• pp.159-172
• /
• 2022

The role of the interconnect network, which connects computing nodes to each other, is important in high-performance computing (HPC) systems. In recent years, the peripheral component interconnect express (PCIe) has become a promising interface as an interconnection network for high-performance and cost-effective HPC systems having the features of non-transparent bridge (NTB) technologies. OpenSHMEM is a programming model for distributed shared memory that supports a partitioned global address space (PGAS). Currently, little work has been done to develop the OpenSHMEM library for PCIe-interconnected HPC systems. This paper introduces a prototype implementation of the OpenSHMEM library through a switchless interconnect network using PCIe NTB to provide a PGAS programming model. In particular, multi-interrupt, multi-thread-based data transfer over the OpenSHMEM shared memory model is applied at the implementation level to reduce the latency and increase the throughput of the switchless ring network system. The implemented OpenSHMEM programming model over the PCIe NTB switchless interconnection network provides a feasible, cost-effective HPC system with a PGAS programming model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권5호
• /
• pp.1069-1084
• /
• 2011

This paper considers an optimal base station clustering problem for designing a mobile (wireless) communication network. For a given network with a set of nodes (base stations), the problem is to optimally partition the set of nodes into subsets (each called a cluster) such that the associated inter-cluster traffic is minimized under certain topological constraints and cluster capacity constraints. In the problem analysis, the problem is formulated as an integer programming problem. The integer programming problem is then transformed into a binary integer programming problem, for which the associated linear programming relaxation is solved in a column generation approach assisted by a branch-and-bound procedure. For the column generation, both a heuristic algorithm and a valid inequality approach are exploited. Various numerical examples are solved to evaluate the effectiveness of the LP (Linear Programming) based branch-and-bound algorithm.

• Journal of Information Technology Applications and Management
• /
• 제23권2호
• /
• pp.61-80
• /
• 2016

The wireless mesh network (WMN) is a next-generation technology for data networking that has the advantage in cost and the flexibility in its construction because of not requiring the infra-structure such as the ethernet. This paper focuses on the optimal link scheduling problem under the wireless mesh network to effectuate real-time streaming by using the constraint programming. In particular, Under the limitation of half-duplex transmission in wireless nodes, this paper proposes a solution method to minimize the makespan in scheduling packet transmission from wireless nodes to the gateway in a WMN with no packet transmission conflicts due to the half-duplex transmission. It discusses the conflicts in packet transmission and deduces the condition of feasible schedules, which defines the model for the constraint programming. Finally it comparatively shows and discusses the results using two constraint programming solvers, Gecode and the IBM ILOG CP solver.

• 한국멀티미디어학회논문지
• /
• 제11권12호
• /
• pp.1730-1738
• /
• 2008

Quality of Service (QoS) Guarantees grant ways for service providers to establish service differentiation among subscribers. On the other hand, service subscribers are also assured the level of service they paid for. In addition, the efficient level of service quality can be selected according to the subscribers' needs thus ensuring efficient use of available bandwidth. While network utility optimization techniques assure certain QoS metrics, a number of situations exist where some QoS goals are not met. The optimality of the network parameters is not mandatory to guarantee specified QoS levels. This paper proposes a joint data rate and power control scheme that guarantees service contract QoS level to a subscriber using Goal Programming. In using goal programming, this paper focuses on finding the range of feasible solutions as opposed to solving for the optimal. In addition, in case no feasible solution is found, an acceptable compromised solution is solved.

• 대한안전경영과학회지
• /
• 제3권4호
• /
• pp.145-154
• /
• 2001

This paper deals with a network model for the efficient transportation of post and consists of the formulation based on the network model and the LINGO programming model including the operations of the post transportation. This network model is represented by using Time Space Network. The generalized formulation is built up with the input variables and the decision variables, which are defined on the basis of the network model. And LINGO programming model to be proposed with DB and LINGO is constructed in consideration of how to manage the post transportation and the intermodal transport. The results of the model implementation were represented on Time Space Network and they are analyzed and verified. The LINGO programming model is used as the module to be set in application software. Specifically with using GEOmania, GIS tool, the LINGO Model is applied to develop the application for Mail Transportation Decision Support System.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.1095-1098
• /
• 1993

This paper presents linear programming neural networks for job-shop scheduling. The starting times of tasks and constraints are formulated as the linear programming problem. A modified Hopfield neural network is proposed for solving job-shop scheduling.

• 산업공학
• /
• 제17권4호
• /
• pp.472-481
• /
• 2004

In this paper, we propose a linear programming model of supply planning process for the supply chain collaboration strategy of a company. The amount of its supplying quantity relies on outsourcing suppliers heavily. Conversely, the revenues of those suppliers are highly dependent on the supplying quota from the supply network planning of the company. In order to keep the supply stable through collaboration, the company builds such a policy to guarantee the fairness on revenue between the supplies. For this, the supply network plan should keep the capacity utilization ratio even for all the suppliers. But the production capacities are different and the distribution of molds is disproportional through suppliers, so the supply network plan is not easily established with simple arithmetic processes. Therefore, we developed the linear programming model with those target function and constraints minimizing the costs for holding inventory and penalty of delayed delivery, simultaneously guaranteeing the even capacity utilization through suppliers. The proposed model has been applied to real case and the evaluation for the planning result from the model would be followed in order to make sure that our model guarantee on extracting the supply network plan subordinated to the policy. Also we mention about further studies for improvement of the model.

• 산업경영시스템학회지
• /
• 제27권3호
• /
• pp.7-13
• /
• 2004

In this paper, machine cell formation problem is discussed. To reflect precisely actual manufacturing situations such as routing sequences, production quantities, and machining (or operation) characteristics, a new network presentation (or the problem is proposed. It is formulated as a simple 0-1 quadratic programming model with linear constraints. Then, the model is converted into a 0-1 integer programming model using a variable transformation technique. Lastly, some computational results are presented.

• 한국농공학회:학술대회논문집
• /
• 한국농공학회 1999년도 Proceedings of the 1999 Annual Conference The Korean Society of Agricutural Engineers
• /
• pp.69-74
• /
• 1999

Upland Irrigation Network Analysis System(UINAS) used Object-Oriented Programming (OOP). The results of using OOP is definition of objects and class hierarchy for UINAS, Objects of UINAS are consist of the Pipe , Sprinkler, Valve , Pump, Tee , Bend and Contractions. The classj hierarchy have cooperative design for FEM in analysing the irrigation network. Therefore UINAS have a flexiblility in additioning the network components.