cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Agung Nugroho
Contact Email
jmfs@lppm.itb.ac.id
Phone
+6222-86010051
Journal Mail Official
jmfs@lppm.itb.ac.id
Editorial Address
ITB Journal Publisher, LPPM ITB, Center for Research and Community Services (CRCS) Building 6th & 7th Floor , Jl. Ganesha No. 10 Bandung 40132, Indonesia
Location
Kota bandung,
Jawa barat
INDONESIA
Journal of Mathematical and Fundamental Sciences
Published by Institut Teknologi Bandung
ISSN : 23375760     EISSN : 23385510     DOI : https://doi.org/10.5614/j.math.fund.sci.
Core Subject : Science, Education,
Astronomy Chemistry Earth & Planetary Sciences Mathematics Physics
Journal of Mathematical and Fundamental Sciences welcomes full research articles in the area of Mathematics and Natural Sciences from the following subject areas: Astronomy, Chemistry, Earth Sciences (Geodesy, Geology, Geophysics, Oceanography, Meteorology), Life Sciences (Agriculture, Biochemistry, Biology, Health, Medical, Pharmacy), Mathematics, Physics, and Statistics.
Arjuna Subject : Matematika - Matematika (Lain-Lain)
Articles 2 Documents
 1 
Search results for , issue "Vol. 20 No. 1/2 (1987)" : 2 Documents clear
Analisis Asam Amino dengan Kromatografi Cairan Kinerja Tinggi Secara Derivatisasi Prakolom dan Pascakolom Wayan Rediatning S.; Nanny Kartini H.
Journal of Mathematical and Fundamental Sciences Vol. 20 No. 1/2 (1987)
Publisher : Institute for Research and Community Services (LPPM) ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Abstract. Through an experiment process, an optimum condition of amino acid analysis using High Performance Liquid Chromatography (HPLC) with post- and pre-column derivatization methods has been found. The optimum condition of the analysis for the post-column deriyatization was obtained by using resin cation exchanger (R-SO3Na) as the column, citric acid buffer of the pH 3.0 and boric acid buffer of the pH 9.7 as the mobile phase and O-phtalaldehyde (OPA) /2-mercaptoethanoal as the derivator, In the pre-column derivatization method, Resolve 5μ spherical C18 was used as the column, solution A (methanol : THF ; H2O = 2 : 2 : 96) which contains 0.05 M Na2HPO4 and 0.05M NaOAc) and solutionB (methanol:H2O= 65 : 35) as the mobile phase, and OPA/ethantiol as the derivator. Each of both HPLC methods can separate more than 17 kinds of amino acids. The result shows that the pre-column derivatization method was more sensitive and took a shorter analysing time than the post-column derivatization method; however, secondary amino acid could not be determined by the first method. Sari. Telah dilakukan percobaan untuk mencari kondisi optimum proses analisis asam amino dengan kromatografi cair kinerja tinggi (KCKT) secara derivatisasi prakolom dan pascakolom. Kondisi analisis optimum untuk cara derivatisasi pascakolom diperoleh dengan menggunakan resin penukar kation (R-SO3 Na+), larutan dapar sitrat pH 3,0 dan larutan dapar borat pH 9,7 sebagai fase gerak, serta O-ftalaldehida (OPA)/2-merkaptoetanol sebagai penderivatisasinya. Untuk cara derivatisasi prakolom, sebagai kolom digunakan Resolve spherical C18, sebagai fase gerak digunakan larutan A yang terdiri dari metanol : THF : air (2:2: 96) yang mengandung 0,5 M Na2 HPO4 dan larutan B yang terdiri dari metanol : air (65 :35), sedangkan sebagai zat penderivalisasi digunakan OPA/etantiol. Kedua metode KCKT ini masing-masing dapat memisahkan 17 macam campuran asam amino. Diketahui bahwa kepekaan cara derivatisasi prakolom lebih tinggi dan waktu analisisnya lebih cepat daripada cara derivatisasi pascakolom, tetapi cara prakolom tidak dapat menentukan asam amino sekunder.
On Non-Linear Finite State Digital Channel Coding Hermawan Kresno Dipojono
Journal of Mathematical and Fundamental Sciences Vol. 20 No. 1/2 (1987)
Publisher : Institute for Research and Community Services (LPPM) ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Abstract. A discrete-time digital channel coding, in which the encoder and decoder are both time-invariant finite state machines, is investigated. The channel is assumed to be memoryless. Two measures of performance are considered: the probability of error and the minimum free distance. Greater emphasis is placed on the minimum free distance since it is easier to evaluate than the probability of error criterion, and for small channel crossover probability it is a very good indicator of system performance; it is defined as the Hamming distance between two possible output sequences that correspond to distinct state sequences of the same length that are identical at both the start and finish. An algorithm to calculate the distance between such possible output sequences was developed; it also identifies all such pain of output sequence. Another algorithm, based on the finite state machine properties of the encoder, was found to generate the finite state decoder. Finally, after having found the pairs of encoder-decoder finite state machines, we simulated the communication system. Sari. Suatu kode saluran digital dengan waktu tercacah yang mempunyai pasangan encoder-decoder berupa mesin berkeadaan terhingga dan invarian waktu akan diteliti. Saluran dianggap tanpa daya ingat. Digunakan dua buah ukuran kinerja yaitu probabilitas kesalahan dan jarak bebas minimum. Penggunaan jarak bebas minimum lebih ditekankan karena lebih mudah dievaluasi dibandingkan probabilitas kesalahan. Untuk probabilitas kesalahan saluran yang kecil, jarak itu merupakan indikator yang sangat baik bagi kinerja sistem; ia didefinisikan sebagai jarak Hamming minimum antara dua buah kemungkinan sekuen keluaran yang berupa sekuen keadaan yang unik dengan panjang dan keadaan yang sama, baik di awal maupun di akhir sekuen. Sebuah algoritma untuk menghitung jarak antara sekuen keluaran yang sedemikian itu telah pula dikembangkan; algoritma tersebut juga mampu mengidentifikasi semua pasangan sekuen keluaran itu. Sebuah algoritma lainnya, didasarkan pada sifat-sifat encoder sebagai mesin dengan keadaan berhingga, yang mampu menyusun decoder dengan keadaan berhingga, telah pula ditemukan. Akhirnya, setelah menemukan berbagai pasangan encoder-decoder yang berupa mesin dengan keadaan berhingga, sistem komunikasi digital disimulasikan.

Page 1 of 1 | Total Record : 2

 1 

Filter by Year

1987 1987


Reset
Filter By Issues
All Issue Vol. 56 No. 3 (2024) Vol. 56 No. 1 (2024): (In Progress) Vol. 55 No. 3 (2024) Vol. 55 No. 2 (2023) Vol. 55 No. 1 (2023) Vol. 54 No. 3 (2023) Vol. 54 No. 2 (2022) Vol. 54 No. 1 (2022) Vol. 53 No. 3 (2021) Vol. 53 No. 2 (2021) Vol. 53 No. 1 (2021) Vol. 52 No. 3 (2020) Vol. 52 No. 2 (2020) Vol. 52 No. 1 (2020) Vol. 51 No. 3 (2019) Vol. 51 No. 2 (2019) Vol. 51 No. 1 (2019) Vol. 50 No. 3 (2018) Vol. 50 No. 2 (2018) Vol. 50 No. 1 (2018) Vol. 49 No. 3 (2017) Vol. 49 No. 2 (2017) Vol. 49 No. 1 (2017) Vol. 48 No. 3 (2016) Vol. 48 No. 2 (2016) Vol. 48 No. 1 (2016) Vol. 47 No. 3 (2015) Vol. 47 No. 2 (2015) Vol. 47 No. 1 (2015) Vol. 46 No. 3 (2014) Vol. 46 No. 2 (2014) Vol. 46 No. 1 (2014) Vol. 45 No. 3 (2013) Vol. 45 No. 2 (2013) Vol. 45 No. 1 (2013) Vol. 44 No. 3 (2012) Vol. 44 No. 2 (2012) Vol. 44 No. 1 (2012) Vol. 43 No. 3 (2011) Vol. 43 No. 2 (2011) Vol. 43 No. 1 (2011) Vol. 42 No. 2 (2010) Vol. 42 No. 1 (2010) Vol. 41 No. 2 (2009) Vol. 41 No. 1 (2009) Vol. 40 No. 2 (2008) Vol. 40 No. 1 (2008) Vol. 39 No. 1-2 (2007) Vol. 38 No. 2 (2006) Vol. 38 No. 1 (2006) Vol. 37 No. 2 (2005) Vol. 37 No. 1 (2005) Vol. 36 No. 2 (2004) Vol. 36 No. 1 (2004) Vol. 35 No. 2 (2003) Vol. 35 No. 1 (2003) Vol. 34 No. 2&3 (2002) Vol. 33 No. 3 (2001) Vol. 33 No. 2 (2001) Vol. 33 No. 1 (2001) Vol. 32 No. 2 (2000) Vol. 32 No. 1 (2000) Vol. 31 No. 3 (1999) Vol. 31 No. 2 (1999) Vol. 31 No. 1 (1999) Vol. 30 No. 3 (1998) Vol. 30 No. 2 (1998) Vol. 30 No. 1 (1998) Vol. 29 No. 1/2 (1996) Vol. 27 No. 3 (1994) Vol. 27 No. 2 (1994) Vol. 25 No. 2/3 (1992) Vol. 25 No. 1 (1992) Vol. 24 No. 2/3 (1991) Vol. 24 No. 1 (1991) Vol. 23 No. 1 (1990) Vol. 22 No. 1/2/3 (1989) Vol. 21 No. 2/3 (1988) Vol. 21 No. 1 (1988) Vol. 20 No. 1/2 (1987) Vol. 20 No. 3 (1987) Vol. 19 No. 2/3 (1986) Vol. 19 No. 1 (1986) Vol. 18 No. 2/3 (1985) Vol. 18 No. 1 (1985) Vol. 17 No. 3 (1984) Vol. 17 No. 2 (1984) Vol. 17 No. 1 (1984) Vol. 16 No. 3 (1983) Vol. 16 No. 2 (1983) Vol. 16 No. 1 (1983) Vol. 15 No. 3 (1982) Vol. 15 No. 2 (1982) Vol. 15 No. 1 (1982) Vol. 14 No. 1/2 (1981) Vol. 14 No. 3 (1981) Vol. 13 No. 1/2 (1980) Vol. 13 No. 3 (1980) Vol. 12 No. 3 (1979) Vol. 12 No. 2 (1979) Vol. 12 No. 1 (1979) Vol. 11 No. 3 (1978) Vol. 11 No. 2 (1977) Vol. 11 No. 1 (1976) Vol. 10 No. 3 (1976) Vol. 10 No. 2 (1975) Vol. 10 No. 1 (1975) Vol. 9 No. 3 (1975) Vol. 9 No. 2 (1975) Vol. 9 No. 1 (1974) Vol. 8 No. 3 (1974) Vol. 8 No. 2 (1974) Vol. 8 No. 1 (1974) Vol. 7 No. 4 (1974) Vol. 7 No. 3 (1973) Vol. 7 No. 2 (1973) Vol. 7 No. 1 (1973) Vol. 6 No. 4 (1972) Vol. 6 No. 3 (1972) Vol. 6 No. 2 (1971) Vol. 6 No. 1 (1971) Vol. 5 No. 1 (1970) Vol. 4 No. 4 (1970) Vol. 4 No. 3 (1969) Vol. 4 No. 2 (1968) Vol. 4 No. 1 (1967) Vol. 3 No. 4 (1965) Vol. 3 No. 3 (1965) Vol. 3 No. 2 (1964) Vol. 3 No. 1 (1964) Vol. 2 No. 4 (1963) Vol. 2 No. 3 (1963) Vol. 2 No. 2 (1962) Vol. 2 No. 1 (1962) Vol. 1 No. 4 (1961) Vol. 1 No. 3 (1961) Vol. 1 No. 2 (1961) Vol. 1 No. 1 (1961) More Issue