• 제목/요약/키워드: Data-science

검색결과 56,444건 처리시간 0.071초

Development of Terra MODIS data pre-processing system on WWW

  • Takeuchi, W.;Nemoto, T.;Baruah, P.J.;Ochi, S.;Yasuoka, Y.
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2002년도 Proceedings of International Symposium on Remote Sensing
    • /
    • pp.569-572
    • /
    • 2002
  • Terra MODIS is one of the few space-borne sensors currently capable of acquiring radiometric data over the range of view angles. Institute of Industrial Science, University of Tokyo, has been receiving Terra MODIS data at Tokyo since May 2001 and Asian Institute of Technology at Bangkok since May 2001. They can cover whole East Asia and is expected to monitor environmental changes regularly such as deforestation, forest fires, floods and typhoon. Over eight hundred scenes have been archived in the storage system and they occupy 2 TB of disk space so far. In this study, MODIS data processing system on WWW is developed including following functions: spectral subset (250m, 500m, 1000m channels), radiometric correction to radiance, spatial subset of geocoded data as a rectangular area with latitude-longitude grid system in HDF format, generation of a quick look file in JPEG format. Users will be notified just after all the process have finished via e-mail. Using this system enables us to process MODIS data on WWW with a few input parameters and download the processed data by FTP access. An easy to use interface is expected to promote the use of MODIS data. This system is available via the Internet on the following URL from September 1 2002, "http : //webmodis.iis.u-tokyo.ac.jp/".

  • PDF

Privacy-assured Boolean Adjacent Vertex Search over Encrypted Graph Data in Cloud Computing

  • Zhu, Hong;Wu, Bin;Xie, Meiyi;Cui, Zongmin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권10호
    • /
    • pp.5171-5189
    • /
    • 2016
  • With the popularity of cloud computing, many data owners outsource their graph data to the cloud for cost savings. The cloud server is not fully trusted and always wants to learn the owners' contents. To protect the information hiding, the graph data have to be encrypted before outsourcing to the cloud. The adjacent vertex search is a very common operation, many other operations can be built based on the adjacent vertex search. A boolean adjacent vertex search is an important basic operation, a query user can get the boolean search results. Due to the graph data being encrypted on the cloud server, a boolean adjacent vertex search is a quite difficult task. In this paper, we propose a solution to perform the boolean adjacent vertex search over encrypted graph data in cloud computing (BASG), which maintains the query tokens and search results privacy. We use the Gram-Schmidt algorithm and achieve the boolean expression search in our paper. We formally analyze the security of our scheme, and the query user can handily get the boolean search results by this scheme. The experiment results with a real graph data set demonstrate the efficiency of our scheme.

일회성 무기체계 특성에 따른 고장 데이터의 오차 및 극복방안 (Failure Data Error according to Characteristics of One-Shot Weapon System and its Solution)

  • 최윤석;마정목
    • 한국군사과학기술학회지
    • /
    • 제21권5호
    • /
    • pp.599-606
    • /
    • 2018
  • Failure data of systems in many field can be erroneous, which influences the reliability analysis of the systems. The general form of failure data is right censored data with accurate time information. But due to its nature of data collection in the military field, failure time of one-shot weapon systems can have errors which are related to the maintenance period. So this paper suggests a model that can reduce the error by utilizing interval censored data as an alternative to right censored data in weibull distribution.

HARMONIC WAVELET TRANSFORM FOR MINIMIZING RELATIVE ERRORS IN SENSOR DATA APPROXIMATION

  • Kang Seonggoo;Yang Seunghoon;Lee Sukho;Park Sanghyun
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
    • /
    • pp.276-279
    • /
    • 2005
  • As the Ubiquitous generation approaches, the importance of the sensor data processing is growing. The data approximation scheme, one of the data processing methods, can be the key of sensor data processing, for it is related not only to the lifetime of sensors but also to the size of the storage. In this paper, we propose the Harmonic Wavelet transform which can minimize the relative error for given sensor data. Harmonic Wavelets use the harmonic mean as a representative which is the minimum point of the maximum relative error between two data values. In addition, Harmonic Wavelets retain the relative errors as wavelet coefficients so we can select proper wavelet coefficients that reduce the relative error more easily. We also adapt the greedy algorithm for local optimization to reduce the time complexity. Experimental results show the performance and the scalability of Harmonic Wavelets for sensor data.

  • PDF

A Reliable Secure Storage Cloud and Data Migration Based on Erasure Code

  • Mugisha, Emmy;Zhang, Gongxuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권1호
    • /
    • pp.436-453
    • /
    • 2018
  • Storage cloud scheme, pushing data to the storage cloud poses much attention regarding data confidentiality. With encryption concept, data accessibility is limited because of encrypted data. To secure storage system with high access power is complicated due to dispersed storage environment. In this paper, we propose a hardware-based security scheme such that a secure dispersed storage system using erasure code is articulated. We designed a hardware-based security scheme with data encoding operations and migration capabilities. Using TPM (Trusted Platform Module), the data integrity and security is evaluated and achieved.

Enhanced Locality Sensitive Clustering in High Dimensional Space

  • Chen, Gang;Gao, Hao-Lin;Li, Bi-Cheng;Hu, Guo-En
    • Transactions on Electrical and Electronic Materials
    • /
    • 제15권3호
    • /
    • pp.125-129
    • /
    • 2014
  • A dataset can be clustered by merging the bucket indices that come from the random projection of locality sensitive hashing functions. It should be noted that for this to work the merging interval must be calculated first. To improve the feasibility of large scale data clustering in high dimensional space we propose an enhanced Locality Sensitive Hashing Clustering Method. Firstly, multiple hashing functions are generated. Secondly, data points are projected to bucket indices. Thirdly, bucket indices are clustered to get class labels. Experimental results showed that on synthetic datasets this method achieves high accuracy at much improved cluster speeds. These attributes make it well suited to clustering data in high dimensional space.

Activities for the Environmental Satellite Data Center at the Science University of Tokyo

  • Takagi, Mikio
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 1998년도 Proceedings of International Symposium on Remote Sensing
    • /
    • pp.134-137
    • /
    • 1998
  • NOAA satellite data and GMS data have been received at the Institute of Industrial Science, University of Tokyo since early 80's and 1994, respectively. So far, all data are archived and users can look their quick look images through the Internet and get the data by request. The following processed data set will be available soon with the corporation with the Science University of Tokyo: Radiometrically corrected by 65 code and geometrically corrected NOAA data with the corporation with Iwate University and NDVI, SST and cloud classified images as their products. 1 km AVHRR Land Project Data Set of Asia and their 14 regional subsets. Geometrically corrected GMS images and surface temperature maps, sea surface temperature maps and cloud classification maps.

  • PDF

Approximate Clustering on Data Streams Using Discrete Cosine Transform

  • Yu, Feng;Oyana, Damalie;Hou, Wen-Chi;Wainer, Michael
    • Journal of Information Processing Systems
    • /
    • 제6권1호
    • /
    • pp.67-78
    • /
    • 2010
  • In this study, a clustering algorithm that uses DCT transformed data is presented. The algorithm is a grid density-based clustering algorithm that can identify clusters of arbitrary shape. Streaming data are transformed and reconstructed as needed for clustering. Experimental results show that DCT is able to approximate a data distribution efficiently using only a small number of coefficients and preserve the clusters well. The grid based clustering algorithm works well with DCT transformed data, demonstrating the viability of DCT for data stream clustering applications.

A Privacy-Preserving Health Data Aggregation Scheme

  • Liu, Yining;Liu, Gao;Cheng, Chi;Xia, Zhe;Shen, Jian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권8호
    • /
    • pp.3852-3864
    • /
    • 2016
  • Patients' health data is very sensitive and the access to individual's health data should be strictly restricted. However, many data consumers may need to use the aggregated health data. For example, the insurance companies needs to use this data to setup the premium level for health insurances. Therefore, privacy-preserving data aggregation solutions for health data have both theoretical importance and application potentials. In this paper, we propose a privacy-preserving health data aggregation scheme using differential privacy. In our scheme, patients' health data are aggregated by the local healthcare center before it is used by data comsumers, and this prevents individual's data from being leaked. Moreover, compared with the existing schemes in the literature, our work enjoys two additional benefits: 1) it not only resists many well known attacks in the open wireless networks, but also achieves the resilience against the human-factor-aware differential aggregation attack; 2) no trusted third party is employed in our proposed scheme, hence it achieves the robustness property and it does not suffer the single point failure problem.

KVN을 위한 디지털 데이터 처리 시스템의 성능평가 (PERFORMANCE EVALUATION OF DIGITAL DATA PROCESSING SYSTEM FOR KOREAN VLBI NETWORK(KVN))

  • 오세진;노덕규;염재환;변도영;이창훈;정현수;제도홍
    • 천문학논총
    • /
    • 제22권3호
    • /
    • pp.63-73
    • /
    • 2007
  • In this paper, we introduce the performance test results of digital data processing system for KVN (Korean VLBI Network). The digital data processing system for KVN consists of DAS (Data Acquisition System) and high-speed recorder which called Mark5B system. DAS system performs the digitalization of analog radio signal through ADS-1000 gigabit sampler with 1 Gsps/2-bit and process the digital filtering of digital signal. Mark5B system records the output data of DFB (Digital Filter Bank) with about 1 Gbps. In this paper, we carried out the preliminary evaluation experiments of the KVN digital data processing system connected between DAS system and Mark5B with VSI (VLBI Standard Interface) interface which is designed for compatible in each VLBI system. We first performed all of the KVN digital data processing system connected by VSI interface in the world. In factory inspection phase, we found that the DAS system has a memory read/write error in DSM (Digital Spectrometer) by analyzing the recorded data in Mark5B system. We confirmed that the DSM memory error has been correctly solved by comparing DSM results with Mark5B results. The effectiveness of KVN digital data processing system has been verified through the preliminary experiments such as data transmission, recording with VSI interface connection and data analysis between DSM and Mark5B system. In future work, we will perform the real astronomical observation by using the KVN 21m radio telescopes so as to verify its stability and performance.