• Title/Summary/Keyword: Choice Simulation

Search Result 348, Processing Time 0.032 seconds

Elucidation of the Inhibitory Effect of Phytochemicals with Kir6.2 Wild-Type and Mutant Models Associated in Type-1 Diabetes through Molecular Docking Approach

  • Jagadeb, Manaswini;Konkimalla, V. Badireenath;Rath, Surya Narayan;Das, Rohit Pritam
    • Genomics & Informatics
    • /
    • v.12 no.4
    • /
    • pp.283-288
    • /
    • 2014
  • Among all serious diseases globally, diabetes (type 1 and type 2) still poses a major challenge to the world population. Several target proteins have been identified, and the etiology causing diabetes has been reasonably well studied. But, there is still a gap in deciding on the choice of a drug, especially when the target is mutated. Mutations in the KCNJ11 gene, encoding the kir6.2 channel, are reported to be associated with congenital hyperinsulinism, having a major impact in causing type 1 diabetes, and due to the lack of its 3D structure, an attempt has been made to predict the structure of kir6.2, applying fold recognition methods. The current work is intended to investigate the affinity of four phytochemicals namely, curcumin (Curcuma longa), genistein (Genista tinctoria), piperine (Piper nigrum), and pterostilbene (Vitis vinifera) in a normal as well as in a mutant kir6.2 model by adopting a molecular docking methodology. The phytochemicals were docked in both wild and mutated kir6.2 models in two rounds: blind docking followed by ATP-binding pocket-specific docking. From the binding pockets, the common interacting amino acid residues participating strongly within the binding pocket were identified and compared. From the study, we conclude that these phytochemicals have strong affinity in both the normal and mutant kir6.2 model. This work would be helpful for further study of the phytochemicals above for the treatment of type 1 diabetes by targeting the kir6.2 channel.

A "Dynamic Form-Finding" Approach to Environmental-Performance Building Design

  • Yao, Jia-Wei;Lin, Yu-Qiong;Zheng, Jing-Yun;Yuan, Philip F.
    • International Journal of High-Rise Buildings
    • /
    • v.7 no.2
    • /
    • pp.145-151
    • /
    • 2018
  • Newly-designed high-rise buildings, both in China and abroad, have demonstrated new innovations from the creative concept to the creative method. from the creative concept to the creative method. At the same time, digital technology has enabled more design freedom in the vertical dimension. "Twisting" has gradually become the morphological choice of many city landmark buildings in recent years. The form seems more likely to be driven by the interaction of aesthetics and structural engineering. Environmental performance is often a secondary consideration; it is typically not simulated until the evaluation phase. Based on the research results of "DigitalFUTURE Shanghai 2017 Workshop - Wind Tunnel Visualization", an approach that can be employed by architects to design environmental-performance buildings during the early stages has been explored. The integration of a dynamic form-finding approach (DFFA) and programming transforms the complex relationship between architecture and environment into a dialogue of computer language and dynamic models. It allows the design to focus on the relationship between morphology and the surrounding environment, and is not limited to the envelope form itself. This new concept of DFFA in this research consists of three elements: 1) architectural form; 2) integration of wind tunnel and dynamic models; and 3) environmental response. The concept of wind tunnel testing integrated with a dynamic model fundamentally abandons the functional definition of the traditional static environment simulation analysis. Instead it is driven by integral environmental performance as the basic starting point of morphological generation.

Study on Consumers' Restaurant Selection Criteria by Using Conjoint Analysis (외식 소비자의 레스토랑 선택속성 및 속성가치에 대한 선호도 조사 연구 -컨조인트 분석을 이용하여-)

  • Hong, Jong-Sook;Jeon, Ji-Young;Kim, Young-Sook
    • Journal of the East Asian Society of Dietary Life
    • /
    • v.22 no.2
    • /
    • pp.315-321
    • /
    • 2012
  • In this study, the product attributes that give customers the estimated benefits and products that can predict the customer's choice conjoint analysis techniques to identify the restaurant affinity markets a new dining concept was to develop. Questionnaire for this study of 400 non-response is negative and insincere characters, except for the final analysis, the questionnaire Part 309 was the target. Conjoint model used in this study Pearson's R is 0.928 ($p$<0.000), Kendall's tau is 0.750 ($p$<0.000) with an orthogonal plan was well suited for profiling attributes are extracted 16. Part of the relative importance of the value of the property to determine the result of analyzing the properties that are most important at the level of the respondents of the induct (38.46%), and followed by price (30.52%), Atmosphere (18.28%), and Exclusive space (12.73%) was followed. Portion of the property value for each analysis among industry preference for the Italian food was highest, a nature-friendly interior atmosphere had the highest affinity Average per price at 10,000 won~30,000 won or less than the amount of affinity was higher location of the restaurant alone, showed that space preferred. Through simulation in a virtual seafood restaurant nature-friendly image, average price per person ranging from 10,000 to 30,000won at an exclusive restaurant was most preferred.

A Walsh-Hadamard Transform Adaptive Filter with Time-varying Step Size (가변 스텝사이즈를 적용한 월시.아다말 적응필터)

  • 오신범;이채욱
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.5 no.2
    • /
    • pp.32-38
    • /
    • 2000
  • One of the most popular algorithm in adaptive signal processing is the least mean square(LMS) algorithm. The majority of these papers examine the LMS algorithm with a constant step size. The choice of the step size reflects a tradeoff between misadjustment and the speed of adaptation. Subsequent works have discussed the issue of optimization of the step size or methods of varying the step size to improve performance. However there is as yet no detailed analysis of a variable step size algorithm that is capable of giving both the adaptation speed and the convergence. In this paper we propose a new variable step size algorithm where the step size adjustment is controlled by the gradient of error square. The proposed algorithm is performed in the Walsh-Hadamard domain in real-valued orthogonal transform because of fast convergence. The simulation results using the new algorithm for noise canceller system is described. They are compared to the results obtained by other algorithms. It is shown that the proposed algorithm produces good results compared with conventional algorithms.

  • PDF

AHP and Group Decision Making for Access Network Selection in Heterogeneous Wireless Networks (이기종 무선 네트워크에서 접근 네트워크 선택을 위한 AHP와 그룹 결정 방법)

  • Kim, Nam-Sun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.10
    • /
    • pp.858-864
    • /
    • 2013
  • In the 4G wireless environment, one of the important issues is to discover and select an access network suited for users. In this thesis, we propose a new network selection mechanism using group decision making and evaluate the effect of network selection schemes for vertical handover in heterogeneous wireless networks. We consider the group of users with similar QoS requirements search for the available access network simultaneously and a service area consist of multiple access networks with various characteristics. We divide the access networks with similar characteristics split into a group. Between each group, the one group is selected and within that group, the best access networks will be assigned according to priority order by network selection algorithm. We evaluate and compare the performance of three representative MADM schemes: GRA, SAW and TOPSIS. The MATLAB simulation results indicate the proposed algorithm can make a more effective choice according to the networks' characteristics and user's preference.

Systolic Arrays for Lattice-Reduction-Aided MIMO Detection

  • Wang, Ni-Chun;Biglieri, Ezio;Yao, Kung
    • Journal of Communications and Networks
    • /
    • v.13 no.5
    • /
    • pp.481-493
    • /
    • 2011
  • Multiple-input multiple-output (MIMO) technology provides high data rate and enhanced quality of service for wireless communications. Since the benefits from MIMO result in a heavy computational load in detectors, the design of low-complexity suboptimum receivers is currently an active area of research. Lattice-reduction-aided detection (LRAD) has been shown to be an effective low-complexity method with near-maximum-likelihood performance. In this paper, we advocate the use of systolic array architectures for MIMO receivers, and in particular we exhibit one of them based on LRAD. The "Lenstra-Lenstra-Lov$\acute{a}$sz (LLL) lattice reduction algorithm" and the ensuing linear detections or successive spatial-interference cancellations can be located in the same array, which is considerably hardware-efficient. Since the conventional form of the LLL algorithm is not immediately suitable for parallel processing, two modified LLL algorithms are considered here for the systolic array. LLL algorithm with full-size reduction-LLL is one of the versions more suitable for parallel processing. Another variant is the all-swap lattice-reduction (ASLR) algorithm for complex-valued lattices, which processes all lattice basis vectors simultaneously within one iteration. Our novel systolic array can operate both algorithms with different external logic controls. In order to simplify the systolic array design, we replace the Lov$\acute{a}$sz condition in the definition of LLL-reduced lattice with the looser Siegel condition. Simulation results show that for LR-aided linear detections, the bit-error-rate performance is still maintained with this relaxation. Comparisons between the two algorithms in terms of bit-error-rate performance, and average field-programmable gate array processing time in the systolic array are made, which shows that ASLR is a better choice for a systolic architecture, especially for systems with a large number of antennas.

Route Retrieval Support System by Using of Pedestrians' Preference Data (보행자의 감성을 고려한 경로탐색 지원시스템 제안)

  • Kim, Don-Han
    • Archives of design research
    • /
    • v.19 no.2 s.64
    • /
    • pp.81-90
    • /
    • 2006
  • Pedestrians perceive differently from the sideway views or the exteriors of the buildings on the way to their destinations. Therefore, the navigation experience can become much different when the path was chosen based on the individual's preference from it is not. By focusing on the effects of the individual pedestrian' path choice on their navigation, this paper presents an algorithm designed for pedestrians to be able to explore their preferred path and proposes a prototype of navigation system based on the algorithm. The navigation support system searches for the best path upon their individual preferences and information of the destination. The system provides the process of retrieving the final path via the pedestrian-support system interaction. The path retrieval is peformed with the combinational matrix of keywords that are formulates Fuzzy theory from the correlations between the terms describing preferences used in the path preference survey. This paper presents the potentials of the path finding method tailored to pedestrians' preferences by a simulation of the proposed path retrieval algorithm.

  • PDF

Direction-based Geographic Routing for Wireless Sensor Networks (센서 네트워크에서 장애물 극복을 위한 방향기반의 라우팅 기법)

  • Ko, Young-Il;Park, Chang-Sup;Son, In-Keun;Kim, Myoung-Ho
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.6
    • /
    • pp.438-450
    • /
    • 2006
  • Geographic routing protocols are very attractive choice for routing in wireless sensor networks because they have been shown to scale better than other alternatives. Under certain ideal conditions, geographic routing works correctly and efficiently. The most commonly used geographic routing protocols include greedy forwarding coupled with face routing. Existing face routing algorithms use planarization techniques that rely on the unit-graph assumption. In real world, many conditions violate the unit-graph assumption of network connectivity, such as location errors, communication voids and radio irregularity, cause failure in planarization and consequently face routing. In this paper, we propose the direction-based geographic routing, which enables energy efficient routing under realistic conditions without planarization techniques. Our proposed approach is for the case in which many sensors need to collect data and send it to a central node. Simulation results show that the protocol exhibits superior performances in terms of energy consumption, delivery success rate, and outperforms the compared protocols.

Heuristic Backtrack Search Algorithm for Energy-efficient Clustering in Wireless Sensor Networks (무선 센서 네트웍에서 에너지 효율적인 집단화를 위한 경험적 백트랙 탐색 알고리즘)

  • Sohn, Surg-Won
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.5
    • /
    • pp.219-227
    • /
    • 2008
  • As found in research on constraint satisfaction problems, the choice of variable ordering heuristics is crucial for effective solving of constraint optimization problems. For the special problems such as energy-efficient clustering in heterogeneous wireless sensor networks, in which cluster heads have an inclination to be near a base station, we propose a new approach based on the static preferences variable orderings and provide a pnode heuristic algorithm for a specific application. The pnode algorithm selects the next variable with the highest Preference. In our problem, the preference becomes higher when the cluster heads are closer to the optimal region, which can be obtained a Priori due to the characteristic of the problem. Since cluster heads are the most dominant sources of Power consumption in the cluster-based sensor networks, we seek to minimize energy consumption by minimizing the maximum energy dissipation at each cluster heads as well as sensor nodes. Simulation results indicate that the proposed approach is more efficient than other methods for solving constraint optimization problems with static preferences.

  • PDF

Alcock-Paczynski Test with the Evolution of Redshift-Space Galaxy Clustering Anisotropy: Understanding the Systematics

  • Park, Hyunbae;Park, Changbom;Tonegawa, Motonari;Zheng, Yi;Sabiu, Cristiano G.;Li, Xiao-dong;Hong, Sungwook E.;Kim, Juhan
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.44 no.1
    • /
    • pp.78.2-78.2
    • /
    • 2019
  • We develop an Alcock-Paczynski (AP) test method that uses the evolution of redshift-space two-point correlation function (2pCF) of galaxies. The method improves the AP test proposed by Li et al. (2015) in that it uses the full two-dimensional shape of the correlation function. Similarly to the original method, the new one uses the 2pCF in redshift space with its amplitude normalized. Cosmological constraints can be obtained by examining the redshift dependence of the normalized 2pCF. This is because the 2pCF should not change apart from the expected small non-linear evolution if galaxy clustering is not distorted by incorrect choice of cosmology used to convert redshift to comoving distance. Our new method decomposes the redshift difference of the 2-dimensional correlation function into the Legendre polynomials whose amplitudes are modelled by radial fitting functions. The shape of the normalized 2pCF suffers from small intrinsic time evolution due to non-linear gravitational evolution and change of type of galaxies between different redshifts. It can be accurately measured by using state of the art cosmological simulations. We use a set of our Multiverse simulations to find that the systematic effects on the shape of the normalized 2pCF are quite insensitive to change of cosmology over \Omega_m=0.21 - 0.31 and w=-0.5 - -1.5. Thanks to this finding, we can now apply our method for the AP test using the non-linear systematics measured from a single simulation of the fiducial cosmological model.

  • PDF