• Title/Summary/Keyword: Node Insertion

Search Result 64, Processing Time 0.038 seconds

Performance of the Phoneme Segmenter in Speech Recognition System (음성인식 시스템에서의 음소분할기의 성능)

  • Lee, Gwang-seok
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.705-708
    • /
    • 2009
  • This research describes a neural network-based phoneme segmenter for recognizing spontaneous speech. The input of the phoneme segmenter for spontaneous speech is 16th order mel-scaled FFT, normalized frame energy, ratio of energy among 0~3[KHz] band and more than 3[KHz] band. All the features are differences of two consecutive 10 [msec] frame. The main body of the segmenter is single-hidden layer MLP(Multi-Layer Perceptron) with 72 inputs, 20 hidden nodes, and one output node. The segmentation accuracy is 78% with 7.8% insertion.

  • PDF

Tmr-Tree : An Efficient Spatial Index Technique in Main Memory Databases (Tmr-트리 : 주기억 데이터베이스에서 효율적인 공간 색인 기법)

  • Yun Suk-Woo;Kim Kyung-Chang
    • The KIPS Transactions:PartD
    • /
    • v.12D no.4 s.100
    • /
    • pp.543-552
    • /
    • 2005
  • As random access memory chip gets cheaper, it becomes affordable to realize main memory-based database systems. The disk-based spatial indexing techniques, however, cannot direct apply to main memory databases, because the main purpose of disk-based techniques is to reduce the number of disk accesses. In main memory-based indexing techniques, the node access time is much faster than that in disk-based indexing techniques, because all index nodes reside in a main memory. Unlike disk-based index techniques, main memory-based spatial indexing techniques must reduce key comparing time as well as node access time. In this paper, we propose an efficient spatial index structure for main memory-based databases, called Tmr-tree. Tmr-tree integrates the characteristics of R-tree and T-tree. Therefore, Nodes of Tmr-tree consist of several entries for data objects, main memory pointers to left and right child, and three additional fields. First is a MBR of a self node, which tightly encloses all data MBRs (Minimum Bounding Rectangles) in a current node, and second and third are MBRs of left and right sub-tree, respectively. Because Tmr-tree needs not to visit all leaf nodes, in terms of search time, proposed Tmr-tree outperforms R-tree in our experiments. As node size is increased, search time is drastically decreased followed by a gradual increase. However, in terms of insertion time, the performance of Tmr-tree was slightly lower than R-tree.

ICFGO : UI Concealing and Dummy Flow Insertion Method for Inter-Procedural Control Flow Graph Obfuscation (ICFGO : Inter-Procedural Control Flow Graph 난독화를 위한 UI 은닉 및 Dummy Flow 삽입 기법)

  • Shim, Hyunseok;Jung, Souhwan
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.30 no.3
    • /
    • pp.493-501
    • /
    • 2020
  • For the obfuscation of Flow Analysis on the Android operating system, the size of the Flow Graph can be large enough to make analysis difficult. To this end, a library in the form of aar was implemented so that it could be inserted into the application in the form of an external library. The library is designed to have up to five child nodes from the entry point in the dummy code, and for each depth has 2n+1 numbers of methods from 100 to 900 for each node, so it consists of a total of 2,500 entry points. In addition, entry points consist of a total of 150 views in XML, each of which is connected via asynchronous interface. Thus, the process of creating a Inter-procedural Control Flow Graph has a maximum of 14,175E+11 additional cases. As a result of applying this to application, the Inter Procedure Control Flow Analysis too generates an average of 10,931 edges and 3,015 nodes with an average graph size increase of 36.64%. In addition, in the APK analyzing process showed that up to average 76.33MB of overhead, but only 0.88MB of execution overhead in the user's ART environment.

The Clinicopathological Significance of Bmi-1 Expression in Pathogenesis and Progression of Gastric Carcinomas

  • Lu, Hang;Sun, Hong-Zhi;Li, Hua;Cong, Ming
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.13 no.7
    • /
    • pp.3437-3441
    • /
    • 2012
  • Background: Oncogenic Bmi-1 (B-lymphoma Moloney murine leukemia virus insertion region-1) belongs to the Polycomb-group (PcG) family of proteins and plays an important role in the regulation of proliferation, senescence, cell cycle and apoptosis, chromosome stability, activation of gene transcription. Methods: To clarify the roles of Bmi-1 in tumourigenesis and progression of gastric carcinomas, it was examined by immunohistochemistry (IHC) and real-time RT-PCR in gastric carcinomas, dysplasia, intestinal metaplasia (IM), and gastritis with a comparison of its expression with clinicopathological parameters of carcinomas. Results: There was gradually increased Bmi-1 protein expression from gastritis, IM, dyplasia to carcinoma (p<0.001). Bmi-1 expression was positively linked to tumor size, depth of invasion, lymph node metastasis and worse prognosis of carcinomas (p<0.001), but not to age or sex of carcinoma patients (p>0.05). There was higher Bmi-1 protein expression in intestinal-type carcinomas than diffuse-type ones (p<0.001). At mRNA level, Bmi-1 protein expression was increased from gastritis, IM, dysplasia and carcinoma (p<0.001). Bmi-1 overexpression was observed in gastric carcinoma with larger diameter, deeper invasion, lymph node metastasis, and intestinal-type carcinoma (p<0.05). Conclusion: These findings indicate that up-regulated Bmi-1 expression is positively linked to pathogenesis, growth, invasion, metastasis and differentiation of gastric carcinomas. It was considered as a promising marker to indicate the aggressive behaviors and prognosis of gastric carcinomas.

A Cache Consistency Control for B-Tree Indices in a Database Sharing System (데이타베이스 공유 시스템에서 B-트리 인덱스를 위한 캐쉬 일관성 제어)

  • On, Gyeong-O;Jo, Haeng-Rae
    • The KIPS Transactions:PartD
    • /
    • v.8D no.5
    • /
    • pp.593-604
    • /
    • 2001
  • A database sharing system (DSS) refers to a system for high performance transaction processing. In the DSS, the processing nodes are coupled via a high speed network and share a common database at the disk level. Each node has a local memory and a separate copy of operating system. To reduce the number of disk accesses, the node caches data pages and index pages in its memory buffer. In general, B-tree index pages are accessed more often and thus cached at more processing nodes, than their corresponding data pages. There are also complicated operations in the B-tree such as Fetch, Fetch Next, Insertion and Deletion. Therefore, an efficient cache consistency scheme supporting high level concurrency is required. In this paper, we propose cache consistency schemes using identifiers of index pages and page_LSN of leaf page. The propose schemes can improve the system throughput by reducing the required message traffic between nodes and index re-traversal.

  • PDF

A Case of Long Term Survival of Gastric Cancer on Trastuzumab Based Treatment (Trastuzumab으로 장기 생존한 진행성 위암 증례 1예)

  • Jihye Park;Sang Kil Lee
    • Journal of Digestive Cancer Research
    • /
    • v.3 no.1
    • /
    • pp.39-41
    • /
    • 2015
  • We report a case of long term survival on trastuzumab based treatment. A 51-year-old man with dyspepsia received esophagogastroduodenoscopy on another hospital and was transferred for further evaluation under the impression of advanced gastric cancer, Borrmann type III, antrum, lesser curvature. After further studies in our hospital, the patient was diagnosed with advanced gastric cancer, adenocarcinoma, moderately differentiated with pancreas invasion and lymph node metastasis. Though he was recommended with chemotherapy, he refused and left for oriental herbal medicine. After 4 months, the patient was admitted through emergency room for hematemesis. Diagnosed with gastric outlet obstruction due to gastric cancer in the antrum, he underwent the placement of pyloric metal stent insertion. Immunohistochemical staining showed HER2-positive finding, and he was treated with palliative chemotherapy of trastuzumab, capecitabine, and cisplatin, 16 times during 11 months. The patient showed neutropenia after the therapy, so cisplatin was left out, and he received combination chemotherapy of trastuzumab and capecitabine, 34 times during 25 months. Response evaluation showed no remarkable change in extent of primary stomach cancer, lymph node metastasis, and regression of metastasis site, and the patient is continuing chemotherapy.

  • PDF

Reconstitution of Compact Binary trie for the Efficient Retrieval of Hangul UniCODE Text (한글 유니코드 텍스트의 효율적인 탐색을 위한 컴팩트 바이너리 트라이의 재구성)

  • Jung, Kyu Cheol;Lee, Jong Chan;Park, Sang Joon;Kim, Byung Gi
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.5 no.2
    • /
    • pp.21-28
    • /
    • 2009
  • This paper proposes RCBT(Reduced Compact Binary trie) to correct faults of CBT (Compact Binary trie). First, in the case of CBT, a compact structure was tried for the first time, but as the amount of data was increasing, that of inputted data gained and much difficulty was experienced in insertion due to the dummy nodes used in balancing trees. On the other hand, if the HCBT realized hierarchically, given certain depth to prevent the map from increasing onthe right, reached the depth, the method for making new trees and connecting to them was used. Eventually, fast progress could be made in the inputting and searching speed, but this had a disadvantage of the storage space becoming bigger because of the use of dummy nods like CBT and of many tree links. In the case of RCBT in this thesis, a capacity is increased by about 60% by completely cutting down dummy nods.

Research on Wireless Sensor Networks Security Attack and Countermeasures: Survey (무선 센서 네트워크 보안 위협 및 대응책 연구)

  • Hong, Sunghyuck
    • Journal of Convergence Society for SMB
    • /
    • v.4 no.4
    • /
    • pp.1-6
    • /
    • 2014
  • A wireless sensor network is being actively researched around the world that are connected to the mesh are a plurality of sensor nodes in a wireless manner that span different regions of the techniques. However, wireless communications use the limitation of resources, so it is very weak due to the properties of the network itself secure in comparison to the normal network. Wireless sensor network is divided into tapped-based attacks, forgery based attacks, denial of service attacks based largely by securities laws must defend against various attacks such as insertion of the wrong information being sent eavesdropping or modification of information, which is usually sensor network applications need to do. The countermeasure of sensor network attack is described in this research, and it will contribute to establish a secure sensor network communication.

  • PDF

An Enhancing Technique for Scan Performance of a Skip List with MVCC (MVCC 지원 스킵 리스트의 범위 탐색 향상 기법)

  • Kim, Leeju;Lee, Eunji
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.5
    • /
    • pp.107-112
    • /
    • 2020
  • Recently, unstructured data is rapidly being produced based on web-based services. NoSQL systems and key value stores that process unstructured data as key and value pairs are widely used in various applications. In this paper, a study was conducted on a skip list used for in-memory data management in an LSM-tree based key value store. The skip list used in the key value store is an insertion-based skip list that does not allow overwriting and processes all changes only by inserting. This behavior can support Multi-Version Concurrency Control (MVCC), which can simultaneously process multiple read/write requests through snapshot isolation. However, since duplicate keys exist in the skip list, the performance significantly degrades due to unnecessary node visits during a list traverse. In particular, serious overhead occurs when a range query or scan operation that collectively searches a specific range of data occurs. This paper proposes a newly designed Stride SkipList to reduce this overhead. The stride skip list additionally maintains an indexing pointer for the last node of the same key to avoid unnecessary node visits. The proposed scheme is implemented using RocksDB's in-memory component, and the performance evaluation shows that the performance of SCAN operation improves by up to 350 times compared to the existing skip list for various workloads.

Management of an Intra-abdominal Fluid Collection after Gastric Cancer Surgery (위암 수술 후 발생한 복강 내 체액 저류의 치료)

  • Jeon, Young-Min;Ahn, Hye-Seong;Yoo, Moon-Won;Cho, Jae-Jin;Lee, Jeong-Min;Lee, Huk-Joon;Yang, Han-Kwang;Lee, Kuhn-Uk
    • Journal of Gastric Cancer
    • /
    • v.8 no.4
    • /
    • pp.256-261
    • /
    • 2008
  • Purpose: Intra-abdominal fluid collection is one of the risk factors associated with postoperative morbidity or mortality for patients who undergo gastric cancer surgery. The aim of this study was to analyze the clinicopathological characteristics of the patients with postoperative intra-abdominal fluid collection and to identify the indications for inserting a percutaneous drain (PCD) in patients with intra-abdominal fluid collection. Materials and Methods: Among the 1,277 patients who underwent operations for gastric cancer at Seoul National University Hospital between April 2005 and July 2006, the data of 117 patients with an intra-abdominal fluid collection were reviewed. Results: The number of patients' with pathologic stage I, II, III and IV disease was 42 (36.8%), 23 (20.2%), 16 (14%) and 33 (28.9%), respectively. Forty-three patients (36.3%) underwent PCD insertion and the other 43 patients received conservative management. A univariate analysis of multiple clinical variables revealed that age, gender, diabetes, liver disease, lymph node dissection, the pathologic stage and the body mass index (BMI, $kg/m^2$) were not significantly associated with PCD insertion (P>0.05). However, the univariate analysis showed that two characteristics were associated with a significantly high incidence of PCD insertion: a diameter of an intra-abdominal fluid collection greater than 4 cm and infectious signs such as leukocytosis, fever and bacteremia. Conclusion: About two thirds of the intra-abdominal fluid collections after surgery for gastric cancer were managed with only conservative method without other morbidities of mortality. Surgeons should consider performing PCD insertion if the largest diameter of an intra-abdominal fluid collection is over 4 cm or if infectious signs are seen.

  • PDF