• Title/Summary/Keyword: Positive Computing

Search Result 247, Processing Time 0.025 seconds

SOME RESULTS RELATED TO DISTRIBUTION FUNCTIONS OF CHI-SQUARE TYPE RANDOM VARIABLES WITH RANDOM DEGREES OF FREEDOM

  • Hung, Tran Loc;Thanh, Tran Thien;Vu, Bui Quang
    • Bulletin of the Korean Mathematical Society
    • /
    • v.45 no.3
    • /
    • pp.509-522
    • /
    • 2008
  • The main aim of this paper is to present some results related to asymptotic behavior of distribution functions of random variables of chi-square type $X^2_N={\Sigma}^N_{i=1}\;X^2_i$ with degrees of freedom N, where N is a positive integer-valued random variable independent on all standard normally distributed random variables $X_i$. Two ways for computing the distribution functions of chi-square type random variables with random degrees of freedom are considered. Moreover, some tables concerning considered distribution functions are demonstrated in Appendix.

Automatic detection of the lung orientation in digital PA chest radiographs

  • Nahm, Kie-B.
    • Journal of the Optical Society of Korea
    • /
    • v.1 no.1
    • /
    • pp.60-64
    • /
    • 1997
  • An image processing algorithm is presented that can identify the orientation as well as the left/right side (parity) of the digitized radiographs. The orientation was found by computing the mean square deviation between the sampled gray values along the center and their best-fit linear regression relations. The parity was determined by comparing the area difference between two thresholded images of the left and the right side around the heart, which is assumed to be around the center of the image. This method was tested with 86 images with their orientations intentionally rotated. The rotation was limited to multiples of 90 degrees, as this was the way the rotation is most likely to happen in the clinical environment. We obtained positive responses for 85 out of 86 images subject to the screening.

The Impact of Environment and Adoption Factors on the Performance of Financial EDI systems (금융EDI시스템의 환경 및 도입 요인이 성과에 미치는 영향)

  • 송미향;정철용
    • The Journal of Society for e-Business Studies
    • /
    • v.2 no.2
    • /
    • pp.75-88
    • /
    • 1997
  • Many Korean banks and companies have adopted EDI to replace traditioanal paper documents by electronic ones, which can move much faster with greater accuracy, Also, it is expected to reduce overall costs and maintain good relationships with customers. However, in practice, the performance of EDI seems to be less than expected. The purpose of this paper is to identify the impact of environment and adoption factors on the performance of financial EDI. We proposed a model for the relationships based on the existing literature and peformed a survey of Korean commercial banks and companies using KTNET. The results of this study are as follows: First, the business environment represented by the size of companies and the frequency of transactions showed a negative impact on the performance in terms of efficiency, which is quite converse to the common belief. Second, the technical environment, including computing skills of users and operators, showed a positive impact on the performance in terms of effectiveness. Third, the clearer the adoption purpose, the higher is the performace as intended, while the initiative for the adoption process showed no significant impact.

  • PDF

Analysis of Future Spectrum Sharing Ecosystem Based on Causal Map (인과지도에 기반한 미래 주파수공유 생태계 분석)

  • Song, Hee Seok;Kim, Taehan
    • Journal of Information Technology Applications and Management
    • /
    • v.20 no.4
    • /
    • pp.19-31
    • /
    • 2013
  • There is tremendous increasing demand on spectrum resource which is boosted by spread of cloud computing and M2M telecommunication as well as smart phone and tablet PC. Recently, spectrum sharing technology has drawn attention to the spectrum policy makers as a promising way to overcome limitation of scarce spectrum resource. To succeed in commercialization of spectrum sharing technology, it is necessary to prospect the future business ecosystem of spectrum sharing and develop appropriate policies and laws at the same time along with the advance of spectrum sharing technology. The purpose of this paper is to prospect future spectrum sharing ecosystem and analyze business ecosystem of spectrum sharing with casual loop map. With the causal map and system dynamics method, it is possible to analyze feedback loops which is not limited to linear thinking and build policies which optimize positive dynamics in business ecosystem of spectrum sharing.

A MULTILEVEL BLOCK INCOMPLETE CHOLESKY PRECONDITIONER FOR SOLVING NORMAL EQUATIONS IN LINEAR LEAST SQUARES PROBLEMS

  • Jun, Zhang;Tong, Xiao
    • Journal of applied mathematics & informatics
    • /
    • v.11 no.1_2
    • /
    • pp.59-80
    • /
    • 2003
  • An incomplete factorization method for preconditioning symmetric positive definite matrices is introduced to solve normal equations. The normal equations are form to solve linear least squares problems. The procedure is based on a block incomplete Cholesky factorization and a multilevel recursive strategy with an approximate Schur complement matrix formed implicitly. A diagonal perturbation strategy is implemented to enhance factorization robustness. The factors obtained are used as a preconditioner for the conjugate gradient method. Numerical experiments are used to show the robustness and efficiency of this preconditioning technique, and to compare it with two other preconditioners.

Biometric Certificate on Secure Group Communication

  • Han, Kun-Hee
    • Journal of Convergence Society for SMB
    • /
    • v.4 no.4
    • /
    • pp.25-29
    • /
    • 2014
  • Security is a primary concern in group communication, and secure authentication is essential to establishing a secure group communication. Most conventional authentications consist of knowledge-based and token-based methods. One of the token-based methods is a X.509 certificate, which is used under a Public Key Infrastructure (PKI); it is the most well-known authentication system in a distributed network environment. However, it has a well-known weakness, which only proves the belonging of a certificate. PKI cannot assure identity of a person. The conventional knowledge-based and token-based methods do not really provide positive personal identification because they rely on surrogate representations of the person's identity. Therefore, I propose a secure X.509 certificate with biometric information to assure the identity of the person who uses the X.509 certificate in a distributed computing environment.

  • PDF

Analysis on Review Data of Restaurants in Google Maps through Text Mining: Focusing on Sentiment Analysis

  • Shin, Bee;Ryu, Sohee;Kim, Yongjun;Kim, Dongwhan
    • Journal of Multimedia Information System
    • /
    • v.9 no.1
    • /
    • pp.61-68
    • /
    • 2022
  • The importance of online reviews is prevalent as more people access goods or places online and make decisions to visit or purchase. However, such reviews are generally provided by short sentences or mere star ratings; failing to provide a general overview of customer preferences and decision factors. This study explored and broke down restaurant reviews found on Google Maps. After collecting and analyzing 5,427 reviews, we vectorized the importance of words using the TF-IDF. We used a random forest machine learning algorithm to calculate the coefficient of positivity and negativity of words used in reviews. As the result, we were able to build a dictionary of words for positive and negative sentiment using each word's coefficient. We classified words into four major evaluation categories and derived insights into sentiment in each criterion. We believe the dictionary of review words and analyzing the major evaluation categories can help prospective restaurant visitors to read between the lines on restaurant reviews found on the Web.

ON EIGENSHARPNESS AND ALMOST EIGENSHARPNESS OF LEXICOGRAPHIC PRODUCTS OF SOME GRAPHS

  • Abbasi, Ahmad;Taleshani, Mona Gholamnia
    • Bulletin of the Korean Mathematical Society
    • /
    • v.59 no.3
    • /
    • pp.685-695
    • /
    • 2022
  • The minimum number of complete bipartite subgraphs needed to partition the edges of a graph G is denoted by b(G). A known lower bound on b(G) states that b(G) ≥ max{p(G), q(G)}, where p(G) and q(G) are the numbers of positive and negative eigenvalues of the adjacency matrix of G, respectively. When equality is attained, G is said to be eigensharp and when b(G) = max{p(G), q(G)} + 1, G is called an almost eigensharp graph. In this paper, we investigate the eigensharpness and almost eigensharpness of lexicographic products of some graphs.

A novel watermarking scheme for authenticating individual data integrity of WSNs

  • Guangyong Gao;Min Wang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.3
    • /
    • pp.938-957
    • /
    • 2023
  • The limited computing power of sensor nodes in wireless sensor networks (WSNs) and data tampering during wireless transmission are two important issues. In this paper, we propose a scheme for independent individual authentication of WSNs data based on digital watermarking technology. Digital watermarking suits well for WSNs, owing to its lower computational cost. The proposed scheme uses independent individual to generate a digital watermark and embeds the watermark in current data item. Moreover, a sink node extracts the watermark in single data and compares it with the generated watermark, thereby achieving integrity verification of data. Inherently, individual validation differs from the grouping-level validation, and avoids the lack of grouping robustness. The improved performance of individual integrity verification based on proposed scheme is validated through experimental analysis. Lastly, compared to other state-of-the-art schemes, our proposed scheme significantly reduces the false negative rate by an average of 5%, the false positive rate by an average of 80% of data verification, and increases the correct verification rate by 50% on average.

Performance Analysis and Characterization of Multi-Core Servers (멀티-코어 서버의 성능 분석 및 특성화)

  • Lee, Myung-Ho;Kang, Jun-Suk
    • The KIPS Transactions:PartA
    • /
    • v.15A no.5
    • /
    • pp.259-268
    • /
    • 2008
  • Multi-Core processors have become main-stream microprocessors in recent years. Servers based on these multi-core processors are widely adopted in High Performance Computing (HPC) and commercial business applications as well. These servers provide increased level of parallelism, thus can potentially boost the performance for applications. However, the shared resources among multiple cores on the same chip can become hot spots and act as performance bottlenecks. Therefore it is essential to optimize the use of shared resources for high performance and scalability for the multi-core servers. In this paper, we conduct experimental studies to analyze the positive and negative effects of the resource sharing on the performance of HPC applications. Through the analyses we also characterize the performance of multi-core servers.