RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제
      • 좁혀본 항목 보기순서

        • 원문유무
        • 음성지원유무
        • 원문제공처
          펼치기
        • 등재정보
          펼치기
        • 학술지명
          펼치기
        • 주제분류
          펼치기
        • 발행연도
          펼치기
        • 작성언어
        • 저자
          펼치기

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • KCI등재

        박은식의 사회진화론 인식과 실업교육관

        김순석 한국민족운동사학회 2006 한국민족운동사연구 Vol.48 No.-

        박은식의 사회진화론 인식과 실업교육관김순석 The recognition on social theory of evolution and vocational education of Park Eun Sik Kim, Soon Suk

      • 인터넷 광고에서 방문 횟수를 측정하는 암호학적 방법들에 관한 고찰

        김순석,신제용,성권 중앙대학교 정보통신연구소 2000 정보통신연구소논문집 Vol.2 No.2

        본 논문에서는 웹 광고에서 웹사이트를 방문하려는 고객과 서버(예를 들어, 웹사이트 발행자들)간에 상호작용을 측정하기 위한 안전하고도 효율적인 측정 방법들에 관해 살펴보고자 한다. 대개의 웹 광고는 많은 고객들과 서버들 그리고 서버들에 의해 제공된 고객들의 수 에 관한 정보를 수집하는 감사 기관의 상호작용으로 이루어진다. 이때, 대부분의 서버들은 실제 제공되는 것보다는 훨씬 많은 수의 방문 정보를 감사기관에게 제시함으로서 보다 많은 광고 수익을 얻고자 한다. 이에 본 논문에서는 과장된 서버로부터의 방문기록을 막는 암호학적으로 안전한 몇 가지 측정 방법들을 소개하고자 한다. 아울러 이들 측정 방법들은 전반적인 통신 트래픽 이라든가 다른 부수적인 오버헤드가 부가되지 않을 만큼 효율적이어야 할 것이다. In this paper we study on secure and efficient metering schemes to measure the interaction between clients and servers(e.g. the web site publishers) on the web advertisements. In a representative scenario there are many clients and servers, and an audit agency should collect information about the number of clients that were served by each server. A typical server is motivated to claim that it served many more clients than it has actually served. We introduce some metering schemes which are cryptographically secure and prevent servers from inflating the count of their visits. At the same time the metering schemes should be efficient and do not add a considerable overhead to the different parties and to the overall communication traffic.

      • KCI등재

        상장회사 특례제도의 문제점 및 개선방안

        김순석 한국상사법학회 2015 商事法硏究 Vol.34 No.2

        The Section 13 of Korean Commercial Code prescribes special rules for listed companies. The article 542-2 of the Korean Commercial Code stipulates that the section 13 shall apply to listed companies which have issued certificates of stock listed in a securities market (referring to a market for purchase and sale of securities). This article deals with current issues of section 13 and legal measures to solve those problems. It discusses the issues of expanding the scope of recipients for stock options and substituting the process of obtaining expost facto approval of shareholders meeting for expost facto reporting to shareholders meeting. It also analyzes legal issues raised from strengthening or relaxing requirements for minority shareholders’ rights. This article deals with legal problems associated with introducing compulsory cumulative voting system of shareholders’ meeting in electing plural directors. It proposes to unify those articles regarding ratio of independent directors between the Commercial Code and the Capital Markets and Financial Investment Services Act and to eradicate the rules requiring mandatory election of independent directors for small and medium sized listed companies. It also suggests to amend irrational requirements of disqualification for independent directors and analyzes the prohibition of independent directors’ holding concurrent office of other companies. Finally, this article discusses qualification requirements, election method for supervisory committee members, and reviews effective mechanism to induce internal control system.

      • KCI등재후보

        기업지배구조 개선에 관한 뉴욕증권거래소(NYSE)와 나스닥(NASDAQ)의 상장기준개정안 및 SEC 규칙의 고찰

        김순석 한국기업법학회 2003 企業法硏究 Vol.14 No.-

        After the enactment of the Sarbanes-Oxley Act of 2002, the SEC and SROs adopted numerous rules and regulations according to the authorization of the Act. The purpose of this article is to analyze recent developments of corporate governance practices in listing rules of the NYSE and NASDAQ and SEC regulation. Until the enactment of the Sarbanes-Oxley Act of 2002, there was a basic functional divide between federal and state corporate laws: while federal law through SEC was concerned with disclosure, state law through statutes and court cases was concerned with internal corporate affairs such as relative rights of shareholders and managers, breach of fiduciary duty. Stock exchanges through listing rules are also an important source of corporate governance regulation. However, the Sarbanes-Oxley Act of 2002 generates friction with this longstanding functional divide between federal and state law. Three areas of federal incursion into the state realm of corporate governance in the Sarbanes-Oxley Act of 2002 are executive compensation, board structure and function and regulation of attorneys appearing and practicing before the SEC. This article analyzes each subject of corporate governance comparatively among SEC, NYSE and NASDAQ. It deals with the background of the amendment of the listing rules and the scope of their application. Also it discusses the effective dates and transition period. The requirement of majority of independence directors, the definition of independence, executive sessions, nominating/corporate governance committee and compensation committee composed entirely of independent directors are also reviewed. It also discusses the limitation to qualification and compensation of audit committee, the duty and responsibility of audit committee, equity compensation plan, code of business conduct and ethics, the disclosure of discrepancies of foreign corporate governance practices. Finally this article deals with the implications of the amendment of listing rules of the NYSE and NASDAQ to Korean companies which are listed on those markets. Especially it discusses the independence of audit committee member, the duty and responsibility of audit committee including the appointment and oversight of outside directors.

      • 이동통신환경에서 원격지 도메인으로의 로밍서비스를 위한 새로운 호 설정 프로토콜

        김순석 한라대학교 2007 論文集 Vol.10 No.-

        In related to mobile communication environment, Kesdogan and Pfitzmann[1] proposed solutions using temporary pseudonym identification, called TP(Temporary Pseudonym) to solve the problems concerning current locations of mobile users and exposure of their movements in the privacy aspect. After that, We proposed more improved method protecting mobile users from active attacks of network providers in [2]. But it is the case that mobile users are located in only home domain. As a more extended method, we propose new mobile terminated protocol protecting user privacy in case of moving from the home domain to the remote domain and analyze its security.

      • 전광 트리 네트워크에서 WRA 문제를 해결하는 알고리즘

        김순석,여상수,성권 중앙대학교정보통신연구소 2000 정보통신연구소논문집 Vol.2 No.1

        본 논문은 전광 트리 네트워크상에서 WDM(Wavelength Division Multiplexing)을 이용한 파장 할당 및 경로 설정문제 즉, WRA 문제를 해결하는 알고리즘을 개발하는데 있다. 현재까지 전광 네트워크상의 임의 경로에 파장을 할당하는 문제는 NP-hard 문제[4]로 알려져 있으며, 또한 전광 네트워크상에서 주어진 노드쌍들을 연결하는 각각의 링크에는 서로 다른 파장을 할당해야 한다는 기술상에 제약조건을 안고 있다. 따라서 본 논문에서는 주어진 네트워크의 유형을 일반트리 형태로 한정지어 생각하고, 일반트리구조상에서 위의 제약조건을 만족하면서 논문 [5]에서 제안된 이론을 토대로 분할정복방법을 이용하여 실제 모든 경로에 파장을 할당하는 다항시간 알고리즘을 제안하였다. 제안한 알고리즘의 분석 결과는 O(Q·R)로, 여기서 Q는 일반트리구조상의 모든 노드에서 다른 모든 노드로 가는 요청 노드쌍들의 수이며 R는 일반트리구조상에서 모든 경로에 대해 할당할 수 있는 최대 파장수이다. 또한, 제안한 알고리즘을 펜티엄Ⅱ 233MHz에서 C언어를 이용하여 실험, 본 알고리즘을 검증하였다. This paper considers the problem of the WRA(Wavelength and Routing Assignment) in all-optical tree networks using WDM(Wavelength Division Multiplexing), where each connection between a pair of nodes in a network is assigned a path through the network and a wavelength on that path, such that connections whose paths share a common link in a network are assigned different wavelengths. The problem of optimal colouring of paths on all-optical networks is NP-hard[4], but if a network topology is a tree and the colouring of all paths, then exists an efficient polynomial time algorithm. In this paper, using divided & conquer method we give an efficient algorithm to assign wavelengths to the all paths of a tree network based on the theory of [5]. The time complexity of this algorithm is O(Q·R), in which Q is the request nodes for all-to-all communication in a tree topology and C is the maximum number of wavelength. Also We implemented our algorithm in C and analyzed performance results.

      • KCI등재

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼