Earticle

This paper investigates the relation between Korean nominal markers (case, topic, focus stress, etc.) and the semantic interpretations each of them induces in multiple nominative constructions (MNC). Adopting Jeon’s (2019b) proposal, which is the revised version of Diesing’s (1992) mapping hypothesis, and Ha’s (2014) applicative approach, I show that in MNCs a generic reading is licensed in the restrictive clause (TopP/FocP) by binding by the null generic operator GEN and an existential/episodic reading can be derived by existential closure in ApplP, which is the nuclear scope. It will be shown that nominative-marked NPs in MNCs are all licensed by an applicative head and are represented in the vP-type projection, ApplP. This mapping structure is supported by the analysis in Jeon (2019b), which presents the evidence against the lexical division of stage- and individual- level predicates, arguing for a distinction dependent on syntactic contexts.

The coexistence of the symmetries and asymmetries of coordinate structures has long been a challenge in the tradition of generative grammar. In most coordinate constructions, it is argued, symmetric coordination is maintained through feature mapping algorithms across all syntactic levels, which are first proposed in Velde (2005). In particular, the apparent asymmetric phenomenon like CSC is in fact the result of both symmetric feature mapping at lexical selection and Remerge in narrow syntax. In the approach to coordinate structures proposed here, which is based on the assumptions and principles of the Survive-minimalism (cf. Putnam and Stroik (2008) and Stroik and Putnam (2013)), the second conjunct, to which a coordinating conjunction has already adjoined due to its defectiveness instead of projecting its phrase, is right-adjoined to the last member of the first conjunct. The resulting structure implies that any elements in the first conjunct c-command those in the second conjunct, accounting for coordinate asymmetries structurally. Moreover, in a derivational way, we can account for the surprising Principle A symmetry in coordinate constructions, following Lebeaux’s (2009) suggestion about the domain of binding principles and Velde’s (2009) list-adjunction.

SMIL(Synchronized Multimedia Integration Language)는 멀티미디어 객체의 집합을 시간적으로 동기화하여 표현할 수 있는 마크업언어로 W3C에 의해서 1998년 7월에 발표된 멀티미디어 데이터의 통합표현을 위한 언어의 표준이다. 본 논문에서는 SMIL을 기반으로 한 기능성 교육용 게임을 시간에 따라 멀티미디어 데이터파일을 명확하게 동기화 할 수 있도록 객체지향 기반의 시각화 도구인 UML을 이용하여 모델링하고 이를 기반으로 설계․구현한다. 즉, 본 논 문에서는 학습자의 수준에 따라 기능성 교육용 게임의 데이터파일을 눈높이에 맞게 설정, 조정할 수 있는 객체모델링 방법을 제안하고, 설계․구현하여 학습자의 학습의 효과를 높이는데 목적이 있다.

SMIL is the collection of multimedia objects and Markup language that can express temporal synchronization and is the standard of synchronization language for integrated expression of multimedia data presented on July, 1998 by W3C. This Paper develops Serious Educational Game based on SMIL according to the time so that it can synchronize multimedia data file accurately by using UML, object-oriented visual tool. And also, it is to suggest object modeling method by setting the data file of game according to the level of the student and is to improve the effect of learning by designing and implementing the actual suggestions.

Soil surface displacement occurs often following timber harvesting. This displacement is caused by canopy removal from the forest area which makes bare soil to be exposed directly to the rainfall. Thus, the displacement may differ in due to precipitation intensity, and this phenomenon results in the displacement prediction to be uncertain. In this study, we investigated on 1) calculating displacement on timber harvested area in research forest by photogrammetry method, and 2) assessing erosion risk of the area by using three different supervised machine learning classification models. Two time-series of point cloud data (PCD) were acquired by photogrammetry method from June 10, 2022 and July 9, 2022, respectively. These two PCD sets were registered by ground control point (GCP). For displacement estimation, DEM of difference (DoD) was calculated by subtracting DEMs from registered PCD sets. A total of nine terrain variables were generated for analyzing the spatial relationship between displacements and topographic features. Erosion risk was analyzed by three different classification algorithms: random forest (RF), extra gradient boost (XGB), logistic regression (LG). Best performed model was RF with overall accuracy (OA) of 72.9% followed by XGB model (72%), and LG model (71.7%). The results of this research indicate that machine learning based classification algorithms have better performances on erosion risk analysis than statistical algorithm through this research.

본 연구에서는 시범지역의 CCTV 제원정보를 전수조사 하여 CCTV 위치, 주감시방향, 감시 거리, 최대감시거리, Tele mode 화각, Wide mode 화각 등 CCTV 정보를 표출하기 위한 기본 요소를 DB화 하였다. 조사된 CCTV제원 정보를 기초로 하여 공간정보 기반으로 도식화, 시 각화 할 수 있는 자동 매핑 알고리즘 제안하였다. 알고리즘을 적용한 결과, 일부 연구지역의 CCTV 위치가 약 11% 중복된 것으로 분석되었고, CCTV 12대 가운데 중복된 CCTV는 총 5대 로 도출되었다. 향후, 제시한 알고리즘을 기반으로 CCTV제원 정보를 지도에 표출하여 CCTV 위치 재설계 및 감시방향 변경 등 보다 과학적인 근거자료로 활용이 가능할 것이다.

Database construction of basic elements for displaying CCTV informations(the location, direction, distance, maximum distance, Tele mode angle view, Wide mode angle view, etc.) is conducted by complete survey about CCTV information in model area. Automatic mapping algorithm is suggested to schematize and visualize it on the basic of the investigated CCTV informations. In the result, the CCTV locations in partial areas are duplicated on about 11 percents. Duplicated ones among twelve CCTVs are total five. If the redesign of CCTV location and direction by displaying the CCTV informations based on the suggested algorithm is performed, it can be used as scientific explanations.

Shimming, active and/or passive, is indispensable for most MR (magnetic resonance) magnets where homogeneous magnetic fields are required within target spaces. Generally, shimming consists of two steps, field mapping and correcting of fields, and they are recursively repeated until the target field homogeneity is reached. Thus, accuracy of the field mapping is crucial for fast and efficient shimming of MR magnets. For an accurate shimming, a "magnetic" center, which is a mathematical origin for harmonic analysis, must be carefully defined, Although the magnetic center is in general identical to the physical center of a magnet, it is not rare that both centers are different particularly in HTS (high temperature superconducting) magnets of which harmonic field errors, especially high orders, are significantly dependent on a location of the magnetic center. This paper presents a new algorithm, based on a field mapping theory with harmonic analysis, to define the best magnetic center of an MR magnet in terms of minimization of pre-shimming field errors. And the proposed algorithm is tested with simulation under gaussian noise environment.

Recent studies for network virtualization have shown a promising way to overcome the Internet ossification. The one of the key issues in network virtualization is a virtual network mapping problem, i.e., mapping a virtual network to the physical network. The situations of dynamic arrivals of virtual network request and the limited life cycle of the virtual networks pose significant challenges to the virtual network mapping problem. A balance between the resource allocation of the physical network and the number of mapped virtual networks. In this paper, we have considered the time characteristics that virtual network requests when mapping algorithms so as to achieve the objective that the node load and link load can simultaneously reach a balance. Giving full consideration to mutual restraints of time and resources, we propose a two-dimensional discrete weighted model based on time and resources, and establish a mathematical programming model of minimizing the degree of two-dimensional load balancing. Moreover, we devise a VN embedding algorithms LB-VNE. Simulation experiments show that the proposed algorithms can increase the acceptance ratio and the revenue by the substrate network in the long term.

Research on ship photoelectric measuring instrument measurement error compensation technology, which can improve the accuracy of the measurement. According to the ship sailing in the influence of turbulence by the winds and waves, causing airlines direction deflection happen suddenly, and measurement data is not accurate with jumping up and down along the axis. In order to avoid these problems, this paper proposes a kind of ship turbulence measurement compensation algorithm, by adjusting the ship turbulence coefficient to predict the turbulence extend of the ship, and compensate the turbulence measurement error, use the ship turbulence coefficient correction method to revise the result of compensation, overcome turbulence effects impact. The experiment proves that the ship turbulence measurement compensation algorithm compensate measurement results, can improve the accuracy rate of measurement data and satisfactory results have been obtained.

This paper introduces a new efficient algorithm for mapping linear array into hex-cell network. The capability of mapping several topologies is considered as one of the most important features of the hex-cell interconnection network. This feature is strongly affecting the performance of parallel machines. In this paper, we present a new algorithm for mapping linear array topology into hex-cell network with dilation and congestion of one;which indicates that we have one-to-one mapping as a result of intercommunication among nodes.

A human chromosome is a DNA molecule with approximately 108 base pairs. The techniques developed to date for sequencing are restricted to pieces of DNA with up to tens of thousands of base pairs. This means that when a piece is sequenced, only an extremely small part of a chromosome can be seen. Molecular biologists use special techniques to deal with DNA molecules comparable in size to a chromosome. These techniques enable them to create maps of an entire chromosome or of significant fractions of chromosomes. Computational techniques were studied that could potentially aid biologists in the map-generation process. An algorithm that solves the consecutive 1s problem was studied. Such a problem is a good model of hybridization mapping when there are no errors and when probes are unique. If errors are present, another approach is needed, and the approximation algorithm is a prospective problem solver for hybridization physical mapping of DNA with errors.

Because the single chaotic mapping easily creates security weaknesses in the image encryption algorithm, the security needs to be improved. Aiming at this problem, a bit-level image encryption algorithm based on composite chaotic mapping (CCM-IEA) is proposed. First of all, the algorithm scrambles the plain image on bit level through the Cat mapping for the first time. And then the Henon mapping of two dimensional discrete is used to scramble for the second time. Finally, image diffusion is operated through the one dimensional Logistic mapping, and the data sensitivity is enhanced. The experimental results show that the performance of the CCM-IEA algorithm is better on the histogram, information entropy and correlation analysis. Compared with the single chaotic images encryption algorithm, the CCM-IEA algorithm has the ability to resist the information entropy analysis and correlation analysis. It can be seen that the CCM-IEA algorithm has high safety performance and good encryption effect.

In order to give full play to ability of existing devices, the combined positioning algorithm of volume image sequence is proposed, which is applied in large scale topographical map. Firstly, the observation equations of observable image sequence are analyzed, and the five different coordinates relating with space 3D coordinate of object can be calculated. Secondly, the combining positioning algorithm based the characteristics of hyperbolic curve and Kalman filter is put forward and the corresponding mathematical model is constructed. Finally, the dynamic measured data of a highway is used as basis, the corresponding simulation analysis is carried out, and results show that the new combined positioning algorithm can improve the precision of mobile measurement system effectively.

A novel algorithm for enhancing colour images is proposed. Since DWT is used in image compression and image compression reduces storage space, an algorithm is developed to work directly in DWT space. DWT separates image into high and low frequency components. High frequency components define contrast of an image. Enhancement is done in two steps namely local enhancement and global enhancement. Local enhancement is based on contrast measure and improves contrast. Global enhancement is needed for overall image quality improvement. HSV colour space is used of which V components will undergo enhancement, S component will undergo histogram equalization, and H remains the same for preserving the colour.

SNN(Spiking Neural Networks) 기반의 인공지능 연구는 현재 유행하는 DNN(Deep Neural Networks) 기 반의 인공지능의 한계를 극복할 수 있는 차세대 인공지능으로서 주목받고 있다. 본 논문에서는 SNN 형태의 입력을 뉴로모픽 컴퓨팅 시스템에서 구동시킬 수 있는 시스템 SW인 SNN 컴파일러의 구조에 대하여 설명한다. 또한 컴파일 러 구현을 위하여 사용된 알고리즘을 소개하고 매핑 알고리즘의 동작 형태에 따라 뉴로모픽 컴퓨팅 시스템에서 수행 시간이 어떻게 달라지는지에 대한 실험결과를 제시한다. 본문에서 제안한 매핑 알고리즘은 랜덤 매핑에 비해 최대 3.96배의 수행속도 향상이 있었다. 해당 연구 결과를 통해 SNN들을 다양한 뉴로모픽 하드웨어에서 적용할 수 있을 것이다.

Research on artificial intelligence based on SNN (Spiking Neural Networks) is drawing attention as a next-generation artificial intelligence that can overcome the limitations of artificial intelligence based on DNN (Deep Neural Networks) that is currently popular. In this paper, we describe the structure of the SNN compiler, a system SW that generate code from SNN description for neuromorphic computing systems. We also introduce the algorithms used for compiler implementation and present experimental results on how the execution time varies in neuromorphic computing systems depending on the the mapping algorithm. The mapping algorithm proposed in the text showed a performance improvement of up to 3.96 times over a random mapping. The results of this study will allow SNNs to be applied in various neuromorphic hardware.

A new algorithm of the image mapping which is a technique of the elemental image generation is proposed. The proposed method is based on the characteristics of the lens array such as the number, the size and the focal length of the elemental lens. The 3D image generated by 3D graphic API such as OpenGL can be directly adopted without the complex adaptation. Since the image mapping using the proposed method can enhance the speed of the elemental image generation, the computer- generated integral imaging system can be applied to virtual reality system.

Purpose: To develop an advanced non-linear curve fitting (NLCF) algorithm for dynamic susceptibility contrast study of brain. Materials and Methods: The first pass effects give rise to spuriously high estimates of $K^{trans}$ in voxels with large vascular components. An explicit threshold value has been used to reject voxels. Results: By using this non-linear curve fitting algorithm, the blood perfusion and the volume estimation were accurately evaluated in T2*-weighted dynamic contrast enhanced (DCE)-MR images. From the recalculated each parameters, perfusion weighted image were outlined by using modified non-linear curve fitting algorithm. This results were improved estimation of T2*-weighted dynamic series. Conclusion: The present study demonstrated an improvement of an estimation of kinetic parameters from dynamic contrast-enhanced (DCE) T2*-weighted magnetic resonance imaging data, using contrast agents. The advanced kinetic models include the relation of volume transfer constant $K^{trans}\;(min^{-1})$ and the volume of extravascular extracellular space (EES) per unit volume of tissue $\nu_e$.

Semantic Web and its related technologies have been opening the era of information sharing via Web. In the meantime, there are several huddles to overcome toward the new era and one of the major huddles is information integration issue unless we build and use a single unified but huge ontology which address everything in the world. Particularly in e-business area, information integration problem must be a great concern in search and comparison of products from various internet shopping sites and e-marketplaces. To overcome such an information integration problem, we propose an ontology driven mapping algorithm between heterogeneous product classification and description frameworks. We also perform comparative evaluation of the proposed mapping algorithm against a well-known ontology mapping tool, PROMPT.

In this paper, The proposed algorithm consists of three steps. In the first step, TD(Transition Density) calculation has to be performed. a CLB-based CPLD low-power technology mapping algorithm considered a Trade-off is proposed. To perform low-power technology mapping for CPLDs, a given Boolean network has to be represented in a DAG. Total power consumption is obtained by calculating the switching activity of each node in a DAG. In the second step, the feasible clusters are generated by considering the following conditions: the number of inputs and outputs, the number of OR terms for CLB within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low-power technology mapping based on the CLBs packs the feasible clusters. The proposed algorithm is examined using SIS benchmarks. When the number of OR terms is five, the experiment results show that power consumption is reduced by 30.73% compared with TEMPLA, and by 17.11 % compared with PLA mapping.