• Title/Summary/Keyword: general computer

Search Result 3,487, Processing Time 0.035 seconds

Computer-assisted Virtual Surgery and Splint Fabrication for Paediatric Mandible Fracture

  • Lee, Jung-woo
    • Journal of International Society for Simulation Surgery
    • /
    • v.2 no.2
    • /
    • pp.87-89
    • /
    • 2015
  • Closed reduction using acrylic splints with circummandibular fixation has been known to be useful techniques in pediatric mandibular fractures. However, this technique has some shortcomings, including needs for impression taking or additional laboratory process, which can increase the exposure time of general anesthesia or make an additional sedation visit. Recently, the advancement of computer-aided maxillofacial surgery offers to clinicians to expansion of its application. This case report represents a technique of computer-assisted virtual reconstruction and computer-aided designed splint fabrication in a 2-year-old boy with mandibular body fracture.

An Approach to 3D Object Localization Based on Monocular Vision

  • Jung, Sung-Hoon;Jang, Do-Won;Kim, Min-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.12
    • /
    • pp.1658-1667
    • /
    • 2008
  • Reconstruction of 3D objects from a single view image is generally an ill-posed problem because of the projection distortion. A monocular vision based 3D object localization method is proposed in this paper, which approximates an object on the ground to a simple bounding solid and works automatically without any prior information about the object. A spherical or cylindrical object determined based on a circularity measure is approximated to a bounding cylinder, while the other general free-shaped objects to a bounding box or a bounding cylinder appropriately. For a general object, its silhouette on the ground is first computed by back-projecting its projected image in image plane onto the ground plane and then a base rectangle on the ground is determined by using the intuition that touched parts of the object on the ground should appear at lower part of the silhouette. The base rectangle is adjusted and extended until a derived bounding box from it can enclose the general object sufficiently. Height of the bounding box is also determined enough to enclose the general object. When the general object looks like a round-shaped object, a bounding cylinder that encloses the bounding box minimally is selected instead of the bounding box. A bounding solid can be utilized to localize a 3D object on the ground and to roughly estimate its volume. Usefulness of our approach is presented with experimental results on real image objects and limitations of our approach are discussed.

  • PDF

G-Inverse and SAS IML for Parameter Estimation in General Linear Model (선형 모형에서 모수 추정을 위한 일반화 역행렬 및 SAS IML 이론에 관한 연구)

  • Choi, Kuey-Chung;Kang, Kwan-Joong;Park, Byung-Jun
    • The Korean Journal of Applied Statistics
    • /
    • v.20 no.2
    • /
    • pp.373-385
    • /
    • 2007
  • The solution of the normal equation arising in a general linear model by the least square methods is not unique in general. Conventionally, SAS IML and G-inverse matrices are considered for such problems. In this paper, we provide a systematic solution procedures for SAS IML.

Robustness of Complete Diallel cross designs with a Single Missing Observation

  • Kwon, Yong-Man;Lee, Jang-Jae
    • Journal of Integrative Natural Science
    • /
    • v.5 no.2
    • /
    • pp.135-138
    • /
    • 2012
  • The reduction of efficiency of missing observations on complete diallel cross designs are examined. we studies robustness of optimal block designs for estimating general combining ability against loss of missing observations in diallel cross. A-efficiencies suggest that these designs are fairly robust. Simple g-inverses may be found for the information matrices of the line effects which allow evaluation of expressions for the variances of the differences between the pairs of line effects with missing observations. we numerically calculate the reduction of efficiency for estimating general combining ability against loss of missing observations in diallel cross.

REMARKS ON A PAPER OF LEE AND LIM

  • Hamedani, G.G.;Slattery, M.C.
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.27 no.3
    • /
    • pp.475-477
    • /
    • 2014
  • Lee and Lim (2009) state three characterizations of Loamax, exponential and power function distributions, the proofs of which, are based on the solutions of certain second order non-linear differential equations. For these characterizations, they make the following statement : "Therefore there exists a unique solution of the differential equation that satisfies the given initial conditions". Although the general solution of their first differential equation is easily obtainable, they do not obtain the general solutions of the other two differential equations to ensure their claim via initial conditions. In this very short report, we present the general solutions of these equations and show that the particular solutions satisfying the initial conditions are uniquely determined to be Lomax, exponential and power function distributions respectively.

VotingRank: A Case Study of e-Commerce Recommender Application Using MapReduce

  • Ren, Jian-Ji;Lee, Jae-Kee
    • Annual Conference of KIPS
    • /
    • 2009.04a
    • /
    • pp.834-837
    • /
    • 2009
  • There is a growing need for ad-hoc analysis of extremely large data sets, especially at e-Commerce companies which depend on recommender application. Nowadays, as the number of e-Commerce web pages grow to a tremendous proportion; vertical recommender services can help customers to find what they need. Recommender application is one of the reasons for e-Commerce success in today's world. Compared with general e-Commerce recommender application, obviously, general e-Commerce recommender application's processing scope is greatly narrowed down. MapReduce is emerging as an important programming model for large-scale data-parallel applications such as web indexing, data mining, and scientific simulation. The objective of this paper is to explore MapReduce framework for the e-Commerce recommender application on major general and dedicated link analysis for e-Commerce recommender application, and thus the responding time has been decreased and the recommender application's accuracy has been improved.

Matrix Formation in Univariate and Multivariate General Linear Models

  • Arwa A. Alkhalaf
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.4
    • /
    • pp.44-50
    • /
    • 2024
  • This paper offers an overview of matrix formation and calculation techniques within the framework of General Linear Models (GLMs). It takes a sequential approach, beginning with a detailed exploration of matrix formation and calculation methods in regression analysis and univariate analysis of variance (ANOVA). Subsequently, it extends the discussion to cover multivariate analysis of variance (MANOVA). The primary objective of this study was to provide a clear and accessible explanation of the underlying matrices that play a crucial role in GLMs. Through linking, essentially different statistical methods, by fundamental principles and algebraic foundations that underpin the GLM estimation. Insights presented here aim to assist researchers, statisticians, and data analysts in enhancing their understanding of GLMs and their practical implementation in diverse research domains. This paper contributes to a better comprehension of the matrix-based techniques that can be extended to GLMs.

Constructions and Properties of General (k, n) Block-Based Progressive Visual Cryptography

  • Yang, Ching-Nung;Wu, Chih-Cheng;Lin, Yi-Chin;Kim, Cheonshik
    • ETRI Journal
    • /
    • v.37 no.5
    • /
    • pp.979-989
    • /
    • 2015
  • Recently, Hou and others introduced a (2, n) block-based progressive visual cryptographic scheme (BPVCS) in which image blocks can be gradually recovered step by step. In Hou and others' (2, n)-BPVCS, a secret image is subdivided into n non-overlapping image blocks. When t ($2{\leq}t{\leq} n$) participants stack their shadow images, all the image blocks associated with these t participants will be recovered. However, Hou and others' scheme is only a simple 2-out-of-n case. In this paper, we discuss a general (k, n)-BPVCS for any k and n. Our main contribution is to give two constructions (Construction 1 and Construction 2) of this general (k, n)-BPVCS. Also, we theoretically prove that both constructions satisfy a threshold property and progressive recovery of the proposed (k, n)-BPVCS. For k = 2, Construction 1 is reduced to Hou and others' (2, n)-BPVCS.

Multi-channel Long Short-Term Memory with Domain Knowledge for Context Awareness and User Intention

  • Cho, Dan-Bi;Lee, Hyun-Young;Kang, Seung-Shik
    • Journal of Information Processing Systems
    • /
    • v.17 no.5
    • /
    • pp.867-878
    • /
    • 2021
  • In context awareness and user intention tasks, dataset construction is expensive because specific domain data are required. Although pretraining with a large corpus can effectively resolve the issue of lack of data, it ignores domain knowledge. Herein, we concentrate on data domain knowledge while addressing data scarcity and accordingly propose a multi-channel long short-term memory (LSTM). Because multi-channel LSTM integrates pretrained vectors such as task and general knowledge, it effectively prevents catastrophic forgetting between vectors of task and general knowledge to represent the context as a set of features. To evaluate the proposed model with reference to the baseline model, which is a single-channel LSTM, we performed two tasks: voice phishing with context awareness and movie review sentiment classification. The results verified that multi-channel LSTM outperforms single-channel LSTM in both tasks. We further experimented on different multi-channel LSTMs depending on the domain and data size of general knowledge in the model and confirmed that the effect of multi-channel LSTM integrating the two types of knowledge from downstream task data and raw data to overcome the lack of data.

Security Risk Assessment in Conducting Online Exam

  • Danah AlDossary;Danah AlQuaamiz;Fai AlSadlan;Dana AlSharari;Lujain AlOthman;Raghad AlThukair;Ezaz Aldahasi
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.6
    • /
    • pp.77-83
    • /
    • 2023
  • This research is conducted to minimize the potential security risks of conducting online exams to an acceptable level as vulnerabilities and threats to this type of exam are presented. This paper provides a general structure for the risk management process and some recommendations for increasing the level of security.