• Title/Summary/Keyword: k-opt

Search Result 193, Processing Time 0.024 seconds

A Comprehensive Information System Validation Model

  • Choi, Kyung-Sub
    • 한국경영정보학회:학술대회논문집
    • /
    • 2007.06a
    • /
    • pp.557-561
    • /
    • 2007
  • Along with the significance of information systems in today s global business operation, the significance of information systems control and audit is ever increasing in the effort to secure accuracy and integrity of vital business data. A study is undertaken to integrate Food and Drug Administration computerized systems validation regulations. Securities & Exchange Commission Sarbanes-Oxley Act of 200 and other significant regulations, and lastly, People Capability Maturity Model into one comprehensive information system validation model. The initial benefits to this comprehensive model are convenience, time-saving, and synchronization of the regulations. An organization that is striving for a high level of quality system in its essential operating areas of organization may opt for this model. After the complete development of the model, a field test would be scheduled to test its efficacy and validity.

  • PDF

Performance Comparison of Discrete Particle Swarm Optimizations in Sequencing Problems (순서화 문제에서 01산적 Particle Swarm Optimization들의 성능 비교)

  • Yim, D.S.
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.33 no.4
    • /
    • pp.58-68
    • /
    • 2010
  • Particle Swarm Optimization (PSO) which has been well known to solve continuous problems can be applied to discrete combinatorial problems. Several DPSO (Discrete Particle Swarm Optimization) algorithms have been proposed to solve discrete problems such as traveling salesman, vehicle routing, and flow shop scheduling problems. They are different in representation of position and velocity vectors, operation mechanisms for updating vectors. In this paper, the performance of 5 DPSOs is analyzed by applying to traditional Traveling Salesman Problems. The experiment shows that DPSOs are comparable or superior to a genetic algorithm (GA). Also, hybrid PSO combined with local optimization (i.e., 2-OPT) provides much improved solutions. Since DPSO requires more computation time compared with GA, however, the performance of hybrid DPSO is not better than hybrid GA.

Proper Incentives to Promote Information Exchange

  • Obayashi, Atsuomi
    • Industrial Engineering and Management Systems
    • /
    • v.6 no.1
    • /
    • pp.55-63
    • /
    • 2007
  • Exchange of information is essential to the process of innovation such as product development. However, in many cases innovation fails because of a lack of knowledge sharing among parties concerned, even if parties individually have pieces of useful knowledge and skills. Besides physical factors like communication costs, the possibility of opportunistic behavior by parties like stealing ideas can discourage information exchange. This paper introduces a model to analyze incentives of information exchange. The model is a game by two players who alternately opt to offer information to the partner. It is suggested that information exchange can stop before reaching the efficient level. In order to attain the efficient information exchange, expectation of mutual benefit and absence of opportunistic motives in both players are needed. Methods for promoting information exchange include modifying payoff structure to meet the condition of information exchange. The fluidity of partnership may increase a variety of information exchange partners, but discourage building trust between partners which promotes information exchange.

Assistive Circuit for Lowering Minimum Operating Voltage and Balancing Read/Write Margins in an SRAM Array

  • Shin, Changhwan
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.14 no.2
    • /
    • pp.184-188
    • /
    • 2014
  • There is a trade-off between read stability and writability under a full-/half-select condition in static random access memory (SRAM). Another trade-off in the minimum operating voltage between the read and write operation also exists. A new peripheral circuit for SRAM arrays, called a variation sensor, is demonstrated here to balance the read/write margins (i.e., to optimize the read/write trade-off) as well as to lower the minimum operation voltage for both read and write operations. A test chip is fabricated using an industrial 45-nm bulk complementary metal oxide semiconductor (CMOS) process to demonstrate the operation of the variation sensor. With the variation sensor, the word-line voltage is optimized to minimize the trade-off between read stability and writability ($V_{WL,OPT}=1.055V$) as well as to lower the minimum operating voltage for the read and write operations simultaneously ($V_{MIN,READ}=0.58V$, $V_{MIN,WRITE}=0.82V$ for supply voltage $(V_{DD})=1.1V$).

Students' Perspectives (Stream-Wise) of Parameters Affecting Education Quality in an Affiliated Undergraduate Engineering Institution

  • Kumari, Neeraj
    • Asian Journal of Business Environment
    • /
    • v.4 no.3
    • /
    • pp.13-18
    • /
    • 2014
  • Purpose - This study examines students' perspectives (stream-wise) of parameters affecting education quality in an affiliated undergraduate engineering institution in NCR, Haryana. Research design, data, and methodology - This study involves descriptive research and data collection using a structured questionnaire based on the Likert scale. The sample comprises 500 student respondents. For data analysis, an f-test was performed using high quality SPSS software. Results - For "Selection" and "Personality Development & Industry Exposure," the analysis of variance revealed a statistical difference between the mean values of the groups. Whereas, for "Academic Excellence," "Infrastructure," "Placements," and "Management & Administration," the analysis of variance revealed no statistical difference between the mean values of the groups. Conclusions - Students' perceptions about the "Selection" and "Personality Development & Industry Exposure" change according to the various specializations they opt for in their undergraduate engineering education in Haryana. Whereas, for "Academic Excellence," "Infrastructure," "Placements," and "Management & Administration," the perceptions of the students do not vary because of the different specializations they have opted for in their undergraduate engineering education.

Relationship between the Initial Clamping Force and the Sliding Distance of the Rail Clamp according to the Wedge Angle (쐐기각에 따른 레일클램프의 초기 압착력과 밀림거리 사이의 관계)

  • Han D.S.;Lee S.W.;Kwon S.K.;Han G.J.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2006.05a
    • /
    • pp.379-380
    • /
    • 2006
  • In this study we dealt with the relationship between the initial clamping force and the sliding distance in the wedge type rail clamp. The sliding distance is determined by the wedge angle and the initial clamping force. In order to derive the relation formula between the wedge angle and the sliding distance, we ad opt 5-kinds of the wedge angle, such as 2, 4, 6, 8, $10^{\circ}$. And then we analyze the effect of the initial clamping force on the sliding distance.

  • PDF

One-Sided Optimal Assignment and Swap Algorithm for Two-Sided Optimization of Assignment Problem

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.12
    • /
    • pp.75-82
    • /
    • 2015
  • Generally, the optimal solution of assignment problem can be obtained by Hungarian algorithm of two-sided optimization with time complexity $O(n^4)$. This paper suggests one-sided optimal assignment and swap optimization algorithm with time complexity $O(n^2)$ can be achieve the goal of two-sided optimization. This algorithm selects the minimum cost for each row, and reassigns over-assigned to under-assigned cell. Next, that verifies the existence of swap optimization candidates, and swap optimizes with ${\kappa}-opt({\kappa}=2,3)$. For 27 experimental data, the swap-optimization performs only 22% of data, and 78% of data can be get the two-sided optimal result through one-sided optimal result. Also, that can be improves on the solution of best known solution for partial problems.

Kerberos Authentication Deployment Policy of US in Big data Environment (빅데이터 환경에서 미국 커버로스 인증 적용 정책)

  • Hong, Jinkeun
    • Journal of Digital Convergence
    • /
    • v.11 no.11
    • /
    • pp.435-441
    • /
    • 2013
  • This paper review about kerberos security authentication scheme and policy for big data service. It analyzed problem for security technology based on Hadoop framework in big data service environment. Also when it consider applying problem of kerberos security authentication system, it analyzed deployment policy in center of main contents, which is occurred in commercial business. About the related applied Kerberos policy in US, it is researched about application such as cross platform interoperability support, automated Kerberos set up, integration issue, OPT authentication, SSO, ID, and so on.

Performance Analysis of Chromatic Dispersion Compensation of a Chirped Fiber Grating on a Differential Phase-shift-keyed Transmission

  • Kim, Sung-Chul
    • Journal of the Optical Society of Korea
    • /
    • v.13 no.1
    • /
    • pp.107-111
    • /
    • 2009
  • The properties of the chirped fiber Bragg grating (CFBG) as a chromatic dispersion compensator in differential phase-shift-keyed (DPSK) transmission are analyzed. Comparisons of a performance of a CFBG in between DPSK and On-Off Key (OOK) are shown by simulations using the commercial numerical modeling software, $OptSim^{TM}$. In the simulation, we compared the performance of the CFBG when they were used in the RZ-OOK 40 Gbps and the RZ-DPSK 40 Gbps transmission. The simulation results show the performance of an overall transmission with a CFBG in DPSK is inferior to the case of OOK, although DPSK generally has a 3 dB higher SNR (signal-to-noise ratio) than OOK.

Almost-Sure Convergence of the DLMS Algorithm (DLMS 알고리즘의 수렴에 관한 연구)

  • Ahn, Sang Sik
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.9
    • /
    • pp.62-70
    • /
    • 1995
  • In some practical applications of the LMS Algorithm the coefficient adaptation can be performed only after some fixed delay. The resulting algorithm is known as the Delayed Least Mean Square (DLMS) algorithm in the literature. There exist analyses for this algorithm, but most of them are based on the unrealistic independence assumption between successive input vectors. Inthis paper we consider the DLMS algorithm with decreasing step size .mu.(n)=n/a, a>0 and prove the almost-sure convergence ofthe weight vector W(n) to the Wiener solution W$_{opt}$ as n .rarw. .inf. under the mixing unput condition and the satisfaction of the law of large numbers. Computer simulations for decision-directed adaptive equalizer with decoding delay are performed to demonstrate the functioning of the proposed algorithm.m.

  • PDF