Earticle

In digital age, the legal protection of technical measures is a necessary response to effectively protect digital works from the great threat of piracy triggered by digital technology and Internet. However, the excessive protection of technical measures can greatly restrict users' rights such as fair use, first sale doctrine or public domain. Particularly, the legal protection of access control measures in fact gives copyright owners a right to control access to digital works. Therefore, in amending and interpreting related provisions regarding technical protection measures, it is important to ensure an equitable balance between copyright owners and users that copyright law has pursued. In this regard, Korea has taken passive steps to legislate regulations of the technical protection measures. The Computer Program Protection Act of Korea stipulates that 'technical protection measure' means 'any measure to protect a program copyright'. It can arguably be interpreted to protect only right control measures. Nevertheless, the Korean Supreme Court recently found that with respect to the technical measure of Sony Playstation 2 consoles, which can be seen as an access control measure like Game Enhancer, the distribution of Mod chip that circumvents Sony's technical measure was a violation of the ban on distribution of devices disarming technical measures provided in Section 30(2) of the CPPA. However, the Court's decision is required to reconsider because The Acr protecr only copy control measures. In reality, it is not easy to distinguish differences between access control measures and right control measures. Also since many countries have taken steps to legislate regulations of both of them, Korea cannot help considering protecting access control measures. Therefore, This thesis suggests that Korea additionally implement the ban on distribution of devices disarming access control because the most significant threat to copyright owners lies in a preparatory act for circumvention. However, it should not forget to allow users to protect their non- infringing uses by exercising existing exceptions or defenses in copyright law.

일조권에 관련 건축법의 변천과정과 일조권 분쟁 판례를 함께 고찰한 결과는 아래와 같다. 첫째, 우리나라의 경우 가용 토지 면적의 절대 부족으로 인한 주택지 공급의 한계가 있어, 대규모 주택공급을 위한 주택정책 특히 공동주택 공급정책을 입안할 경우 관련 법규의 변경을 통하여 공급량을 확대 시키는 방법을 택해 왔으며, 이는 공급량의 충족이라는 이면에 공동주택의 인동간격의 축소로 인한 주거환경의 악화라는 문제를 낳았다. 둘째, 1990년 이후 공법상 적법한 건축 행위라 할 지라도 인근주민이나 인근학교 등 일조권 수인한계를 넘는 경우 공사 중단, 층수조정 또는 배상 판결 등이 강화되는 추세임을 감안한다면 이에 대한 적극적인 대응책이 마련되어야 할 것이다. 셋째, 건축물 높이 및 인동 거리에 대한 규정은 사법부 판단의 기준을 반영하여 일조 기준 법 규정을 상향 강화토록 조정 하고 건축 인허가 과정에서 일조권 침해 여부를 판단하는 제도적 장치를 마련하는 것이 불필요한 사회적 비용을 줄일 수 있는 방안이라 사료된다. 비록 부족한 주택을 최단 시간 내 공급하기 위한 대책의 일조권 규정이 일환으로 개정되었다 하더라도 주택 보급율이 100%를 넘어 양적 보급에서 질적 수준의 향상에로 공급 기준이 바뀐 오늘날, 국민의 거주 환경을 보호하기 위한 정책들이 시급히 마련되고 시행되어야 할 것이다.

This paper researches the transitional process of the building code regarding solar access right, the cases of legal dispute, and the changes on social consensus. The research reveals problems and improvement direction as follows. First, Korea has limited available land to build houses. When the government sets a plan to supply large amounts of houses, especially apartment housing, it usually amends the relevant law to achieve it. With increasing number of housing supply, the residential environment becomes worse because of the failure of securing distances between houses. Second, since 1990 even the lawful construction in compliance with building code for solar access right sometimes becomes the target of lawsuit, and results in ceasing construction, lowering the height of building, compensation, etc., if the construction affects solar access right of the neighborhoods and schools. These lawsuits show the current building codes may have conflicts with solar access right to be defined by other laws and human basic rights. Third, unnecessary social expenses can be reduced if the regulation of building height and distance between building is reinforced, and institutional strategy, which judges the level of violation of solar access right, is provided during the building permit process. The building code regarding solar access right has been amended for mass-supply of housing units for short period of time. However, since the housing supply ratio is over 100% and there are more concerns on the quality instead of quantity of housing, the direction of policy shall be focused on protection of residential environment.

Optical correspondence for different access has turn into the standard for scientists as the utility rate in optical correspondence these days is expanding quickly. As different gets to, the more clients uses the system, date rate, limit and security have turn into the discriminating issue for the optical framework. The development of remote correspondence with code-division multiple access (CDMA) system have persuaded the joining of CDMA method into optical system, as it is substantially more alluring since it permits different users in a local area network (LAN) environment to get to the same fiber channel non concurrently at all times. Besides, the power of CDMA method in remote system is yet to demonstrate that OCDMA offers security preferences over other various access frameworks by keeping up the nature of administrations. In this paper, the study on OCDMA is in light of exhibiting an analysis on Optical Spectral-Amplitude Code (SAC) OCDMA organized with uniform fiber Bragg gratings. It shows a three-clients SAC-OCDMA For three-client SAC-OCDMA system working at 1550 nm wavelength with 622 Mb/s information rate and 10 Gchip/s chip rate, the greatest suitable transmission separation for a bit mistake rate (BER) < 10-9 at 50km SMF utilizing RZ group [8].

Optical code division multiple access system (OCDMA) has been important with increasing demands of high capacity and speed for communication in optical networks. Due to OCDMA technique high efficiency is achieved, hence fiber bandwidth is fully used. In this paper we will focus on different codes i.e MD (Multi Diagonal) FCC (Flexible cross correlation), DCS (Dynamic cyclic shift) code with BER parameter. Due to this codes we will eliminated MAI (multiple access interference) and improve BER (bit error rate), PIIN (Phase induced intensity noise) and make orthogonality between users in the system .We will use AND subtraction detection technique to implement these codes with technique of OCDMA using optiwave system design tool.

A new code, LS code, was proposed for the IMT-2000 CDMA system. The code has special properties during a specific time interval: 1) perfect autocorrelation, and 2) perfect crosscorrelation. Perfect autocorrelation means maximum autocorrelation for zero time-offset and zero autocorrelation for all other times during a specific time interval. Moreover, perfect crosscorrelation means that the crosscorrelation has zero value during a certain time, you can remove all the MAI within that time. However, the detailed properties of LS code and its exact generation method have been previously unknown. Therefore, we investigate the LS code in regards to its exact generating method, properties, and performances in this paper.

An optical fiber code-division multiple-access (CDMA) network is proposed in which encoding is based on the use of concatenated sequences of relatively large weight. The first short component sequence in the concatenated sequence permits realistic electronic encoding of each data bit. The chips of this sequence are then all-optically encoded at substantially higher rate. In spite of the relatively large weight of the sequence the all-optical encoder is practical by virtue of the shortness of the component sequences. The use of Gold and Lempel sequences as component sequences for generating the concatenated sequences is studied and the bit-error rate (BER) performance of the proposed system is presented as a function of the received optical power with the number of simultaneous users as parameter.

A non-coherent synchronous all-optical code-division multiple-access (CDMA) network is proposed. In this network, symmetric codes derived from prime sequence codes are used. We present the construction of symmetric codes and show that the pseudo-orthogonality of the new codes is the same as that of the original prime-sequence codes while the cardinality of the new codes is larger than that of the prime sequence codes and the modified prime codes in the same field GF(p). Therefore, an optical CDMA LAN using symmetric codes can have a larger number of potential subscribers. The new codes allow designing fully programmable serial all-optical transmitter and receiver suitable for low-loss, high-capacity, optical CDMA LANs. It is also shown that compared to systems using modified prime codes the proposed system can achieve better BER performance for low received chip optical power.

In this paper, we present a frequency reassignment problem (FRP) that arises when we add new base stations to resolve hot-spots or to expand the coverage of a code division multiple access (CDMA) network. For this problem, we develop an integer programming (IP) model along with some valid inequalities and preprocessing rules. Also, we develop an effective heuristic procedure that solves two sub-problems induced from the original problem in repetition. Computational results show that the proposed heuristic procedure finds a feasible solution of good quality within reasonable computation time. Also, the lower bound by-produced from the heuristic procedure is quite strong.

We propose a multiple access protocol for a CDMA-based wireless communication system in which the terminals contend for the spreading codes and reserve the codes for multiple talk spurts. Equilibrium Point Analysis(EPA) is employed for the analysis of the proposed model and the recursive formulas for the system parameters are derived. We also present some numerical results corroborated by a simulated example.

We propose an efficient block least-mean-square (BLMS) adaptive algorithm, in conjunction with error control coding, for direct-sequence code division multiple access (DS-CDMA) systems. The proposed adaptive receiver incorporates decision feedback detection and channel encoding in order to improve the performance of the standard LMS algorithm in convolutionally coded systems. The BLMS algorithm involves two modes of operation: (i) The training mode where an uncoded training sequence is used for initial filter tap-weights adaptation, and (ii) the decision-directed where the filter weights are adapted, using the BLMS algorithm, after decoding/encoding operation. It is shown that the proposed adaptive receiver structure is able to compensate for the signal-to­noise ratio (SNR) loss incurred due to the switching from uncoded training mode to coded decision-directed mode. Our results show that by using the proposed adaptive receiver (with decision feed­back block adaptation) one can achieve a much better performance than both the coded LMS with no decision feedback employed. The convergence behavior of the proposed BLMS receiver is simulated and compared to the standard LMS with and without channel coding. We also examine the steady-state bit-error rate (BER) performance of the proposed adaptive BLMS and standard LMS, both with convolutional coding, where we show that the former is more superior than the latter especially at large SNRs ($SNR\;\geq\;9\;dB$).

There has been a growing need for increased capacity in cellular systems. This has resulted in the adoption of the code division multiple access (CDMA) system as a multiple channel access method. Thus, it is important to obtain the phase offsets of binary codes in the CDMA system because distinct phase offsets of the same code are used to distinguish signals received at the mobile station from different base stations. This letter proposes an efficient algorithm to compute the phase offset of a binary code in the CDMA system through the use of the basic facts of number theory and a new notion of the subcodes of a given code. We also formulate the algorithm in a compact form.

The access control system is a system that allows users to selectively enter the building by granting an access key to the user for security. Access keys with weak security are easily exposed to attackers and cannot properly perform the role that authenticates users. Access code keys should be protected from forgery or spoofing. For this reason, access key verification service models is important in security. However, most models manage all access keys on one central server. This method not only interrupts all services due to server errors, but also risks forgery and spoofing in the process of transmitting access keys. Therefore, blockchain algorithms are used to reduce this risk. This paper proposes a blockchain-based access key verification service model that used distributed stored blockchain gateways on storing access keys and authenticates the user's identity based on them. To evaluate the performance of this model, an experiment was conducted to confirm the performance of the access key forgery recovery rate and the blockchain network performance. As a result, the proposed method is 100% forgery recovery rate, and the registration and verification process is evaluated at 387.58 TPS and 136.66 TPS.

메모리 관련 수행은 일반적으로, 임베디드 시스템에서의 전체 전력 소모에서 상당한 양을 차지하고 있으며, 임베디드 시스템에서 사용되는 메모리 중 상당수가 에너지 절약을 용이하도록 다중의 작동 모드(예: 액티브, 스탠바이, 냅, 파워다운) 기능을 지니고 있다. 본 논문에서는 메모리 접근 코드의 스케줄링이 전력 소모에 미치는 관계를 이용함으로서 메모리의 작동 모드를 최대한 활용하는 문제에 대한 해결책을 제시한다. 기존의 방법에서는 (1) 제한된 레지스터 조건을 만족함과 (2) 효율적인 메모리 접근 모드 (예: 페이지, 버스트 모드) 활용 등을 후반부의 별개 작업으로 고려한 반면, 본 제안한 방법은 (1)과 (2) 두 요소를 메모리 접근 코드 스케줄링에 긴밀히 결합시켜 전력 소모를 효과적으로 줄이고자 하였다. 벤치마크를 사용한 실험에서 우리가 제안한 방법을 사용하면, 기존의 일방적 우선순위를 기반으로 한 그리디 방식보다 평균 $32.13\%$ 더 적은 전력 소모를 가짐을 입증하였다.

메모리 관련 수행은 일반적으로, 임베디드 시스템에서의 전체 전력 소모에서 상당한 양을 차지하고 있으며, 임베디드 시스템에서 사용되는 메모리 중 상당수가 에너지 절약을 용이하도록 다중의 작동 모드(예: 액티브, 스탠바이, 냅, 파워다운) 기능을 지니고 있다. 본 논문에서는 메모리 접근 코드의 스케줄링이 전력 소모에 미치는 관계를 이용함으로서 메모리의 작동 모드를 최대한 활용하는 문제에 대한 해결책을 제시한다. 기존의 방법에서는 (1) 제한된 레지스터 조건을 만족함과 (2) 효율적인 메모리 접근 모드 (예: 페이지, 버스트 모드) 활용 등을 후반부의 별개 작업으로 고려한 반면, 본 제안한 방법은 (1)과 (2) 두 요소를 메모리 접근 코드 스케줄링에 긴밀히 결합시켜 전력 소모를 효과적으로 줄이고자 하였다. 벤치마크를 사용한 실험에서 우리가 제안한 방법을 사용하면, 기존의 일방적 우선순위를 기반으로 한 그리디 방식보다 평균 $32.13\%$ 더 적은 전력 소모를 가짐을 입증하였다.

본 논문에서는 블루투스 기저대역에 적용하기 위한 상관기와 액세스 코드 생성모듈의 설계에 대해 다룬다. 상관기와 액세스 코드 생성 모듈은 블루투스 유닛 사이의 연결설정과 패킷판별, 클록 동기화를 수행한다. 상관기 모듈은 1Mb/s 전송속도를 가지는 입력신호에 대해 슬라이딩 윈도우 상관을 취하여 유용한 패킷판별과 클록 동기화를 행하며, 그 구성은 Wallace tree 구조의 CSA(Carry Save Adder)와 임계 값 판별기로 구성된다. 액세스 코드 생성모듈은 블루투스 표준안에서 제시한 4단계의 생성과정에 따라 설계하였으며 BCH(Bose-Chadhuri-Hocquenghem)순회 부호기(cyclic code)와 제어장치로 구성된다. 의사 랜덤 시퀀스는 동기화 문제를 해결하기 위해 임의의 저장장치에 저장된 형태로 사용하였다. 본 논문에서 제시한 상관기와 액세스 코드 생성모듈은 하드웨어 묘사언어인 VHDL로 설계되었으며 시뮬레이션 및 테스트를 위해 Xilinx FPGA를 사용하여 검증하였다. 설계된 회로의 합성결과는 치대 4.689ns의 임계지연과 최대 7-bit까지의 상관허용 오차를 보여준다.

We describe the design for a correlator and an access code generator in bluetooth system. These are used for a connection setting, a packet decision and a clock synchronization between Bluetooth units. The correlator consists of two blocks; carry save adder based on Wallace tree and threshold-value decision block. It determines on an useful packet and clock-synchronization for input signal of 1.0Mbps through the sliding-window correlating. The access-code generator also consists of two blocks; BCH(Bose-Chadhuri-Hocquenghem) cyclic encoder and control block. It generates the access-codes according to four steps' generation process based on Bluetooth standard. In order to solve synchronization problem, we make use of any memory as a pseudo random sequence. The proposed correlator and access-code generator were coded with VHDL. An FPGA Implementation of these modules and the simulation results are proved by Xilinx chip. The critical delay and correlative margin based on synthesis show the 4.689ns and the allowable correlation-error up to 7-bit.

We describe the design for a correlator and an access code generator in bluetooth system. These are used for a connection setting, a packet decision and a clock synchronization between Bluetooth units. The correlator consists of two blocks; carry save adder based on Wallace tree and threshold-value decision block. It determines on an useful packet and clock-synchronization for input signal of 1.0Mbps through the sliding-window correlating. The access-code generator also consists of two blocks; BCH(Bose-Chadhuri-Hocquenghem) cyclic encoder and control block. It generates the access-codes according to four steps' generation process based on Bluetooth standard. In order to solve synchronization problem, we make use of any memory as a pseudo random sequence. The proposed correlator and access-code generator were coded with VHDL. An FPGA implementation of these modules and the simulation results are proved by Xilinx chip. The critical delay and correlative margin based on synthesis show the 4.689㎱ and the allowable correlation-error up to 7-bit.

본 논문에서는 사물 인터넷과 액세스 코드 배포가 가능한 스마트폰 애플리케이션을 기반으로 하는 공공 자전거 공유 시스템을 설계하고 구현하였다. 스마트폰 사용자는 애플리케이션을 사용해 자전거 대여 신청을 하면 서버에서 암호화된 액세스 코드를 받게 되고, 이 코드는 도킹 스테이션에서 자전거의 잠금을 해제하는 용도로 사용되며 자전거 반환 시에도 동일한 코드가 사용된다. 스테이션의 하드웨어 프로토타입은 라즈베리 파이, 아두이노, 키패드, 모터드라이버와 같은 사물 인터넷 디바이스를 기반으로 하여 구현되었으며, 스마트폰 애플리케이션은 기본적으로 액세스 코드를 이용한 공유 자전거 대여 및 반환 기능과 더불어 사전에 자전거를 예약할 수 있는 부가 기능도 포함하고 있다. 구현한 시스템을 테스트 해 본 결과 3~4초의 매우 적은 지연시간을 보여주고 있어 효율적인 시스템임을 알 수 있다. 본 시스템은 단일 콘트롤 박스에서 다수의 자전거를 관리할 수 있도록 구현할 수 있으며, 사용자 역시 스마트폰 애플리케이션만으로 시스템을 이용할 수 있어 비용 효율적이라 여겨진다.

In this paper, we design and implement a public bicycle sharing system based on smart phone application capable of distributing access codes via internet connection. When smartphone user uses the application to request a bicycle unlock code, server receives the request and sends an encrypted code, which is used to unlock the bicycle at the station and the same code is used to return the bicycle. The station's hardware prototypes were built on top of Internet devices such as raspberry pi, arduino, keypad, and motor driver, and smartphone application basically includes shared bike rental and return functionality. It also includes an additional feature of reservation for a certain time period. We tested the implemented system, and found that it is efficient because it shows the average of 3-4 seconds delay. The system can be implemented to manage multiple bikes with a single control box, and as the user can use a smartphone application, this makes the system more cost effective.

민사소송법은 1960. 4. 4. 제정 당시부터 40여 년간 당사자와 이해관계인 아닌 제3자의 소송기록열람 및 판결열람을 허용하지 않았다. 그러나 2007. 5. 17.자 개정으로써 이해관계인이 아니더라도 “권리구제‧학술연구 또는 공익적 목적”이 있는 제3자에게 소송기록(판결 포함)의 열람권을 부여하였으며, 2011. 6. 30.에는 위와 같은 목적이 없는 제3자에게도 확정판결의 열람권을 부여하는 개정이 이루어졌고 이것이 현행 민사소송법 제163조의2이다. 그런데 최근 또다시 판결공개의 확대를 요구하는 목소리가 높고, 그 주장내용 중 주요한 2가지는 미확정판결문 열람허용 및 키워드 검색 허용이다. 이 문제를 검토함에 있어서는, 판결공개가 헌법상의 원칙임과 동시에 프라이버시 보호 역시 헌법상의 원칙이라는 점을 유의해야 한다. 헌법상의 재판공개 원칙의 존재이유는 (1) 재판절차의 공정성 확보, (2) 사법시스템에 대한 국민의 신뢰 확보, (3) 일반 대중에게 ‘법의 지배’ 및 법절차를 교육한다는 점, 그리고 (4) 공동체의 상처 치유에 있다고 생각된다. 프라이버시는 100여년 전부터 미국에서 체계화된 개념이지만, 현재 전 세계 각국이 이를 인정하고 있고, 한국은 헌법상 그 보호를 천명하고 있다. 비록 그 개념상 불명확한 면도 있지만, 프라이버시가 없다면 자유가 존재할 수 없음은 분명하다. 판결의 공개를 어느 수준으로 해야 타당한지를 검토함에 있어서는, 항상 위와 같은 헌법상의 판결공개 원칙의 존재이유와 프라이버시권의 인정이유를 염두에 두어야 한다. 그리고 디지털 시대에 이르러 판결공개의 의미가 크게 달라졌다는 점도 유의해야 한다. 미국 연방대법원이 제시한 실질적 모호성(practical obscurity) 개념은, 아날로그 시대의 비효율을 의미하는 것이 아니라 개인의 프라이버시 보호와 정보공개 사이의 적절한 균형을 가능하게 하는 기제로서의 의미를 가지고 있는 것이다. 이런 배경 하에서, 미확정판결의 제3자에 대한 공개 문제를 검토해 보면, 미확정판결과 확정판결 사이에 재판공개 원칙이 달리 적용될 본질적 차이를 찾기는 어렵다. 양자 모두에서 프라이버시 침해는 비실명화를 통해 해결될 문제이다. 반면에, 키워드 검색 허부 문제를 검토해 보면, 민사판결의 키워드 검색은 이미 제공되고 있으므로 이는 형사판결에 관한 문제인데, 검색의 대상범위 및 검색방법의 면에서 한국의 확정판결 공개는 이미 세계 최고수준이다. 현재의 판결공개가 충분할지언정 모자라지는 않는다고 생각되므로, 프라이버시 침해우려가 더 높은 형사판결에까지 키워드 검색을 제공할 필요는 없다고 보인다.

Korean Civil Procedure Code(“CPC”) had permitted access to court judgment only for interested parties for more than 40 years since its enactment of 4th April, 1960. After the revision of 30th June, 2011, the current CPC permits for non-interested parties to have access to the finalized judgments. In this situation, there are currently loud voices requiring (1) access even to the non-finalized judgments, and (2) provision of keyword search system in the court webpage. With these two issues, it is needed to put into considerations two basic and constitutional factors, which are (a) values for access to court records, and (b) reasons for privacy protection. This article explores various values for public availability with court records and delves into the meaning of practical obscurity, and then ponders with essentials of privacy in order to address above two issues. Finally, this article concludes that there should be no core distinction between access to the finalized judgments and access to the non-finalized judgments. With these two kinds of judgments in common, privacy issues have to be solved by de-identification. For another issue of providing keyword search system, this article concludes that the present Korean electronic search system is enough for constitutional requirements and expansion is unnecessary.