• Title/Summary/Keyword: false memory

Search Result 61, Processing Time 0.021 seconds

Algorithm Design to Judge Fake News based on Bigdata and Artificial Intelligence

  • Kang, Jangmook;Lee, Sangwon
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.11 no.2
    • /
    • pp.50-58
    • /
    • 2019
  • The clear and specific objective of this study is to design a false news discriminator algorithm for news articles transmitted on a text-based basis and an architecture that builds it into a system (H/W configuration with Hadoop-based in-memory technology, Deep Learning S/W design for bigdata and SNS linkage). Based on learning data on actual news, the government will submit advanced "fake news" test data as a result and complete theoretical research based on it. The need for research proposed by this study is social cost paid by rumors (including malicious comments) and rumors (written false news) due to the flood of fake news, false reports, rumors and stabbings, among other social challenges. In addition, fake news can distort normal communication channels, undermine human mutual trust, and reduce social capital at the same time. The final purpose of the study is to upgrade the study to a topic that is difficult to distinguish between false and exaggerated, fake and hypocrisy, sincere and false, fraud and error, truth and false.

Approaches for Improving Bloom Filter-Based Set Membership Query

  • Lee, HyunYong;Lee, Byung-Tak
    • Journal of Information Processing Systems
    • /
    • v.15 no.3
    • /
    • pp.550-569
    • /
    • 2019
  • We propose approaches for improving Bloom filter in terms of false positive probability and membership query speed. To reduce the false positive probability, we propose special type of additional Bloom filters that are used to handle false positives caused by the original Bloom filter. Implementing the proposed approach for a routing table lookup, we show that our approach reduces the routing table lookup time by up to 28% compared to the original Bloom filter by handling most false positives within the fast memory. We also introduce an approach for improving the membership query speed. Taking the hash table-like approach while storing only values, the proposed approach shows much faster membership query speed than the original Bloom filter (e.g., 34 times faster with 10 subsets). Even compared to a hash table, our approach reduces the routing table lookup time by up to 58%.

Effect of Task-irrelevant Feature Information on Visual Short-term Recognition of Task-relevant Feature (기억자극의 과제 무관련 세부특징 정보가 과제 관련 세부특징에 대한 시각단기재인에 미치는 영향)

  • Hyun, Joo-Seok
    • Korean Journal of Cognitive Science
    • /
    • v.23 no.2
    • /
    • pp.225-248
    • /
    • 2012
  • The summed-similarity model of visual short-term recognition proposes that the estimated amount of summed similarity between remembered items and a recognition probe determines recognition judgement decision (Kahan & Sekuler, 2002). This study examined the effect of a task-irrelevant location change on the recognition decision against two remembered Gabor gratings differing in their spatial frequencies. On each trial in Experiment, participants reported if two gratings displayed across the visual fields are the same or not as the probe grating displayed after about a second of memory delay. The probe grating would be the same as or different from the memory items (lure) by 1 or 4 JND units. The location of the probe would also vary randomly across the left and right visual field with respect to the location of the corresponding memory item. The participants were instructed to perform their recognition task exclusively to the spatial frequencies of the memory items and the probe while ignoring the potential location change of the probe. The results showed that false-recognition rates of the lure probe increased as the summed similarity between the memory items and the probe increased. The rates also further increased in the condition where the probe location was different from the location of the corresponding memory item compared to the condition where the probe location was the same. The increased false-recognition rates indicate that information stored into visual short-term memory is represented as a form of well-bound visual features rather than independent features.

  • PDF

New Gray Scale Implementaion Method for Improving Dynamic False Contours in ac PDPs (동영상 의사윤곽 개선을 위한 새로운 ac PDP 계조구현 방법)

  • Jung Young-Ho;Jeong Ju Young
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.1
    • /
    • pp.1-8
    • /
    • 2004
  • We developed a new PDP gray scale implementation method on the basis of the quantized memory addressing(QMA) principle. We defined three wall charge states; 'fully-on', 'off', and 'half-on', by controlling the width of address pulses. With these three wall charge state, we were able to express 255 level gray scale with only 7 sub-fields. Furthermore, in contrast to the conventional driving methods, the sub-field combinations for any two adjacent gray levels differ by only 1 sub-field, at worst, and therefore, eliminate the dynamic false contours. Since this method use 7 sub-field, the sustain discharge Period is increased by more than $70\%$ compared to the 12 sub-field method which reduces the dynamic false contours.

Development of a feature selection technique on users' false beliefs (사용자의 False belief를 이용한 새로운 기능 선택방식에 대한 연구)

  • Lee, Jangsun;Choi, Gyunghyun;Kim, Jieun;Ryu, Hokyoung
    • Journal of the HCI Society of Korea
    • /
    • v.9 no.2
    • /
    • pp.33-40
    • /
    • 2014
  • Selecting appropriate features that products or services should provide for users has been a critical decision making problem for designers. However, the existing feature selection methods have prominent limitations when figuring out how they perceive the features. For example, selecting features based on the users' preference without analyzing users' mental models might lead to the 'feature creep' phenomenon. In this study, we suggest the 'False belief technique' that is able to detect users' mental model for the products/services that are formed after being provided with new features. This technique will be utilized as a way forward to help the designer to determine what features should be included in the new product development.

Dispute on Freudian Legacy and a Paradigm Shift (프로이트 비판 논쟁과 패러다임의 변화)

  • Kwon, Teckyoung
    • Journal of English Language & Literature
    • /
    • v.56 no.1
    • /
    • pp.157-178
    • /
    • 2010
  • A critique on Freud's remembering taken place in the 80's and 90s has a significant impact on a paradigm shift: from the discursive constructivism to the neo-empiricism. Along with Marx and Nietzsche, Freud was one of the main intellectual sources in formulating the Cultural Studies, known as the political corrections in the later period of Post-modern era. In the wake of feminism, there was a social happening, namely, a memory restoration, when a woman therapist helped a woman patient to restore the past and come up with her father as the cause of her trauma. Finally, 'the false memory syndrome' brought up a hot issue firing on the controversy about Freudian remembering. Freud as a clinical therapist began to be a sole target to be criticized. Strangely enough, however, Freud was continually utilized by such theorists as Julia Kristeva, Homi Bhabah, and Žižek, while having dissenters like Deleuze, Quattari, and Butler. Of those intellectual claims, this paper focuses on the debates by the dissenters not from the discursive theorists but from the clinical studies: Sulloway, Grunbaum, and Crews. My argument directs to the empirical side of Freud for the conclusion that the dispute on him was a seed of a paradigm shift towards the neo-empiricism, after one century's flourishing of constructivism.

Efficient Hybrid Transactional Memory Scheme using Near-optimal Retry Computation and Sophisticated Memory Management in Multi-core Environment

  • Jang, Yeon-Woo;Kang, Moon-Hwan;Chang, Jae-Woo
    • Journal of Information Processing Systems
    • /
    • v.14 no.2
    • /
    • pp.499-509
    • /
    • 2018
  • Recently, hybrid transactional memory (HyTM) has gained much interest from researchers because it combines the advantages of hardware transactional memory (HTM) and software transactional memory (STM). To provide the concurrency control of transactions, the existing HyTM-based studies use a bloom filter. However, they fail to overcome the typical false positive errors of a bloom filter. Though the existing studies use a global lock, the efficiency of global lock-based memory allocation is significantly low in multi-core environment. In this paper, we propose an efficient hybrid transactional memory scheme using near-optimal retry computation and sophisticated memory management in order to efficiently process transactions in multi-core environment. First, we propose a near-optimal retry computation algorithm that provides an efficient HTM configuration using machine learning algorithms, according to the characteristic of a given workload. Second, we provide an efficient concurrency control for transactions in different environments by using a sophisticated bloom filter. Third, we propose a memory management scheme being optimized for the CPU cache line, in order to provide a fast transaction processing. Finally, it is shown from our performance evaluation that our HyTM scheme achieves up to 2.5 times better performance by using the Stanford transactional applications for multi-processing (STAMP) benchmarks than the state-of-the-art algorithms.

Ternary Bloom Filter Improving Counting Bloom Filter (카운팅 블룸필터를 개선하는 터너리 블룸필터)

  • Byun, Hayoung;Lee, Jungwon;Lim, Hyesook
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.1
    • /
    • pp.3-10
    • /
    • 2017
  • Counting Bloom filters (CBFs) have been popularly used in many network algorithms and applications for the membership queries of dynamic sets, since CBFs can provide delete operations, which are not provided in a standard 1-bit vector Bloom filter. However, because of the counting functions, a CBF can have overflows and accordingly false negatives. CBFs composed of 4-bit counters are generally used, but the 4-bit CBF wastes memory spaces by allocating 4 bits for every counter. In this paper, we propose a simple alternative of a 4-bit CBF named ternary Bloom filter (TBF). In the proposed TBF structure, if two or more elements are mapped to a counter in programming, the counters are not used for insertion or deletion operations any more. When the TBF consumes the same amount of memory space as a 4-bit CBF, it is shown through simulation that the TBF provides a better false positive rate than the CBF as well as the TBF does not generate false negatives.

Memory Leak Detection Using Adaptive Cyclic Memory Allocation (동적 순환 메모리 할당 기법을 이용한 메모리 누수 검출)

  • Lim, Woo-Sup;Han, Hwan-Soo;Lee, Sang-Won
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.10
    • /
    • pp.760-767
    • /
    • 2010
  • There are many memory leak detection tools. However, programmers, who develop very large programs, tend to avoid testing their programs with memory leak detection tools since these tools require runtime and space overheads. Thus, we present a memory leak detection technique which enables programmers to test their modules in their unit test phase with low overheads. To achieve this goal, we extend the existing cyclic memory allocation technique and evaluate our memory leak detection technique on a tiny DBMS. In our experiments, we find our tool has reasonably low runtime and space overheads and it reports only a small number of false positives.

Performance Analysis of Detector in Automobile Pulse Radar with Considering Interference (차량용 펄스 레이더에서 간섭영향에 대한 검출기의 성능 분석)

  • Lee, Jonghun;Ko, Seokjun
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.14 no.1
    • /
    • pp.11-18
    • /
    • 2019
  • In this paper, we consider interferences from other automobile pulse radars using same frequency spectrum. In order to eliminate the interference, we propose the PN code modulation method. This method uses the cross-correlation between PN codes with different seed. The ROC performance is used for comparing the proposed detector to conventional method. And the proposed detector can decide the present or absent of targets and measure the range of the targets by using memory buffer of range gate. Especially, we use false alarm probability for all range gates. That is the false alarm if in any one range gate the false alarm occurs. From the simulation result, we can see that the proposed detector with using PN code is not influenced by interferences.