Mrican, Indonesia
Mrican, Indonesia

Universitas Sanata Dharma is a Jesuit university in Yogyakarta in Indonesia. It is also known as USD or Sadhar. Sanata Dharma means “the true dedication” or “the real service”. The dedication and the service have been devoted to the greater glory of God and to the humanity. Universitas Sanata Dharma has 8 undergraduate schools with 25 departments, 3 graduate programs, 1 professional program, and 3 certified programs. Wikipedia.


Time filter

Source Type

Damanik A.,Sanata Dharma University
Electronic Journal of Theoretical Physics | Year: 2014

In order to accommodate nonzero and relatively large of mixing angle θ13, we modified the tribimaximal mixing(TBM) matrix by introducing a simple perturbation matrix to perturb TBM matrix. The modified TBM can reproduce nonzero mixing angle θ13 = 7.9° which is in agreement with the present experimental results. By imposing two zeros texture into the obtained neutrino mass matrix from modified TBM, we then have the neutrino mass spectrum in normal hierarchy. Some phenomenological implications are also discussed. © Electronic Journal of Theoretical Physics.


Setiawati A.,Sanata Dharma University
Asian Pacific Journal of Cancer Prevention | Year: 2016

Celecoxib, a selective inhibitor of COX-2, showed cytotoxic effects in many cancer cell lines including cervical cancer cells. This study investigated the effect of celecoxib on cell cycle arrest in HeLa cervical cancer cells through p53 expression. In vitro anticancer activity was determined with the 3-[4,5-dimethylthiazol-2-yl]-2,5 diphenyl tetrazolium bromide (MTT) method. A double staining method was applied to investigate the mechanism of cell death, cell cycling was analyzed by flow cytometryand immunocytochemistry was employed to stain p53 expression in cells. Celecoxib showed strong cytotoxic effects and induced apoptosis with an IC50 value of 40 μM. It induced cell cycle arrest at G2/M phase by increasing level of p53 expression on HeLa cells.


Damanik A.,Sanata Dharma University
Journal of Physics: Conference Series | Year: 2014

Nonzero and relatively large of θ13 mixing angle has some phenomenological consequences on neutrino physics beyond the standard model. One of the consequences if the mixing angle θ13 ≠ 0 is the possibility of the CP violation on the neutrino sector. In order to obtain nonzero θ13 mixing angle, we break the neutrino mass matrix that obey μ-τ symmetry by introducing a complex parameter and determine the Jarlskog invariant as a measure of CP violation existence. By using the experimental data θ12 and θ23 as input, we can determine the Dirac phase δ as function of mixing angle θ13. © Published under licence by IOP Publishing Ltd.


Mungkasi S.,Sanata Dharma University
Journal of Physics: Conference Series | Year: 2014

We examine the behavior of shock wave propagation of circular (radial) dam break problems. A dam break problem represents a reservoir having two sides of water at rest initially with different depth separated by a wall, then water flows after the wall is removed. The behavior of shock wave propagation is investigated with respect to water levels and with respect to the speeds of the shock waves. To the author's knowledge, such investigation for circular dam break problems had never been done before. Therefore, this new work shall be important for applied computational mathematics and physics communities as well as fluid dynamic researchers. Based on our research results, the propagation speed of shock wave in a circular dam break is lower than that of shock wave in a planar dam break having the same initial water levels as in the circular dam break. © Published under licence by IOP Publishing Ltd.


Sumarno L.,Sanata Dharma University
2013 International Conference on Quality in Research, QiR 2013 - In Conjunction with ICCS 2013: The 2nd International Conference on Civic Space | Year: 2013

In the field of handwritten word recognition field, word segmentation into letters is an approach that could be used. Using this approach, word segmentation would be a complicated task, especially when dealing with a cursive handwritten word. A simple method in word segmentation called oversegmentation could be used. This paper discusses a simple method using Kaiser window. In general, the word segmentation process in this paper can be described as follow: Input - Preprocessing - Segmentation - Output. The input is an image of isolated handwritten word in binary format, while the output is images of letter segment. The main purpose of preprocessing is to correct slant and slope. This preprocessing is necessary since the segmentation method used is sensitive with slant and slope. The main purpose of segmentation is to divide a word into some letter segments. Based on a subjective test result, it was shown that the minimum parameters for the Kaiser window that can be used effectively for oversegmentation are 8 points in window's length and 10 in beta value. As its window's length is getting longer and its beta value is getting bigger, it can also be used effectively for oversegmentation. However, it must be noted that if the letter size is getting bigger, there will be more letter segments resulted. © 2013 IEEE.


Damanik A.,Sanata Dharma University
International Journal of Modern Physics A | Year: 2012

The nonzero and relatively large θ 13 have been reported by Daya Bay, T2K, MINOS and Double Chooz Collaborations. In order to accommodate the nonzero θ 13, we modified the tribimaximal (TB), bimaxima (BM) and democratic (DC) neutrino mixing matrices. From three modified neutrino mixing matrices, two of them (the modified BM and DC mixing matrices) can give nonzero θ 13 which is compatible with the result of the Daya Bay and T2K experiments. The modified TB neutrino mixing matrix predicts the value of θ 13 which is greater than the upper bound value of the latest experimental results. By using the modified neutrino mixing matrices and imposing an additional assumption that neutrino mass matrices have two zeros texture, we then obtain the neutrino mass in normal hierarchy when (M ν) 22 = (M ν) 33 = 0 for the neutrino mass matrix from the modified TB neutrino mixing matrix and (M ν) 11 = (M ν) 13 = 0 for the neutrino mass matrix from the modified DC neutrino mixing matrix. For these two patterns of neutrino mass matrices, either the atmospheric mass squared difference or the solar mass squared difference can be obtained, but not both of them simultaneously. From four patterns of two zeros texture to be considered on the obtained neutrino mass matrix from the modified BM neutrino mixing matrix, none of them can correctly predict the neutrino mass spectrum (normal or inverted hierarchy). © 2012 World Scientific Publishing Company.


Damanik A.,Sanata Dharma University
Modern Physics Letters A | Year: 2011

We construct a neutrino mass matrix Mν via a seesaw mechanism with perturbed invariant under a cyclic permutation by introducing a parameter δ into the diagonal elements of Mν with the assumption that trace of the perturbed Mν is equal to trace of the unperturbed Mν. We found that the perturbed neutrino mass matrices M ν can predict the mass-squared difference Δ m 2 ij ≠ 0 with the possible hierarchy of neutrino mass is normal or nverted hierarchy. By using the advantages of the mass-squared differences and mixing parameters data from neutrino oscillation experiments, we then have neutrino masses in inverted hierarchy with masses: |m1| = 0.101023 eV, |m2| = 0.101428 eV and |m3| = 0.084413 eV. © 2011 World Scientific Publishing Company.


Soelistijanto B.,Sanata Dharma University
Proceedings - 2016 IEEE Region 10 Symposium, TENSYMP 2016 | Year: 2016

Social opportunistic networks (SONs) are delay-tolerant MANETs that exploit human mobility to enable message delivery in the networks. Humans tend to move in a way that is influenced by their social relations. Knowledge of social relationships therefore can be exploited to build social-aware routing protocols. These algorithms typically favour higher (social) ranking nodes as better relays for message transfers. The combination of this forwarding heuristic and the social network structure, which exhibits a non-uniform connectivity distribution with the existence of a few highly-connected nodes, leads the routing algorithm to direct most of the traffic through these hub nodes. Unbalanced traffic distribution therefore results in the network. This paper presents an analysis of traffic distribution in SONs when social-aware routing protocols are applied in the networks. Initially, we survey state-of-the-art social-aware routing protocols. We next investigate the topology characteristics of real-life SONs. Furthermore, we apply three forwarding strategies on these networks, categorising these strategies into social-aware forwarding and social-oblivious forwarding. The social-aware forwarding strategies consider node ranking when choosing traffic relays and the node ranking here is measured by degree and betweeness centralities. The social-oblivious forwarding, however, disregards node ranking on the forwarding decision and selects a relay node randomly. We show that the social-aware forwarding strategies result in very poor traffic distribution fairness, where a few (hub) nodes process a large fraction of the network traffic. Finally, we discuss the strategies for improving traffic distribution fairness in SONs. © 2016 IEEE.


Soelistijanto B.,Sanata Dharma University
Proceedings of 2015 International Conference on Information and Communication Technology and Systems, ICTS 2015 | Year: 2015

Social opportunistic networks (SONs) are delay-tolerant mobile ad hoc networks that exploit human mobility to carry messages between disconnected parts of the network. Humans tend to move in a way that is influenced by their social relations and social-aware routing protocols therefore use social properties of nodes, e.g. social ranking (popularity), as the routing metrics. These protocols favour more popular nodes as better relays for message transfers. Due to the non-uniform distribution of node popularity in SONs, this forwarding heuristic leads the routing to direct most of the traffic through a few most-popular nodes. Traffic congestion therefore results in these hub nodes. To date, a set of congestion control strategies have been proposed in opportunistic networks and most of them were developed by assuming that traffic congestion is distributed randomly in the network. In SONs, however, traffic congestion is most likely to occur in a few hub nodes. In this paper, we present an analysis of traffic congestion distribution in SONs. We initially survey state-of-the-art congestion control strategies in opportunistic networks. Subsequently, we investigate traffic congestion distribution in a real-life SON when a social-aware routing algorithm is applied in the network. We first discuss node popularity distribution in this human network. Using simulation, we furthermore show that node traffic congestion, identified with buffer/storage saturation leading to message drops, occurs frequently in the hub nodes. We also identify that node's total received traffic increases exponentially with the linear increase of the node popularity. We finally discuss a strategy for designing a congestion control algorithm in SONs. © 2015 IEEE.


Mungkasi S.,Sanata Dharma University
IOP Conference Series: Materials Science and Engineering | Year: 2015

The Burgers equation is considered. The equation is solved using finite difference methods. The standard finite difference method may lead to inaccurate solutions, unless a very fine mesh is used, which results in expensive computations. Therefore, we implement an adaptive finite difference moving mesh method as an alternative numerical method to solve the equation. The advantages of implementing the adaptive method are investigated. © Published under licence by IOP Publishing Ltd.

Loading Sanata Dharma University collaborators
Loading Sanata Dharma University collaborators