TFI Run for Leprosy 2015

masih rada gelap gmna gitu :O

Masih rada gelap gmna gitu :O //Before run

Jadi ceritanya waktu hari Minggu kmrn (15 Maret), di Binus ada acara lari gitu namanya Run for Leprosy. Lari kali ini bertemakan polkadot dimana setiap pelari wajib menggunakan atribut polkadot jika tidak ingin didiskualifikasi. Run for Leprosy itu sendiri adalah salah satu kegiatan yang peduli pada kesehatan masyarakat Jakarta dan Indonesia. Dengan mengikuti kegiatan ini artinya kita mau mulai mengerti dan menerima teman-teman yang terkena atau pernah terkena kusta. Semangat dari setiap pelari yang terus berjuang sampai ke garis finish menjadi salah satu inspirasi untuk mengadakan sebuah acara charity untuk rekan-rekan yang saat ini sedang terkena atau sudah sembuh dari kusta.

Definisi Kusta
Penyakit kusta(leprosy) itu sendiri adalah sebuah penyakit infeksi menular kronis yang disebabkan oleh bakteri Mycobacterium leprae. Indonesia dikenal sebagai satu dari tiga negara yang paling banyak memiliki penderita kusta. Dua negara lainnya adalah India dan Brazil. Umumnya penyakit kusta terdapat di negara yang sedang berkembang, dan sebagian besar penderitanya adalah dari golongan ekonomi lemah. Penyakit ini adalah tipe penyakit granulomatosa pada saraf tepi dan mukosa dari saluran pernapasan atas; dan lesi pada kulit adalah tanda yang bisa diamati dari luar. Bila tidak ditangani, kusta dapat sangat progresif, menyebabkan kerusakan pada kulit, saraf-saraf, anggota gerak, dan mata. Tidak seperti mitos yang beredar di masyarakat, kusta tidak menyebabkan pelepasan anggota tubuh yang begitu mudah, seperti pada penyakittzaraath.

Sosialisasi tentang Penyakit Kusta
Mengingat bahayanya penyakit kusta ini, maka ada baiknya jika diadakan sosialisasi mengenai penyakit kusta itu sendiri. Sbenarnya pada dasarnya, kepedulian terhadap pentingnya kesehatan harus selalu disosialisasikan kepada masyarakat. Terutama mereka yang belum mengerti tentang arti pentingnya menjaga kesehatan dan bagaimana cara penanganan penyakit yang ada di sekitar kita. Salah satu contoh sosialisasi misalnya adalah dengan mengadakan seminar mengenai penyakit kusta. Dalam seminar ini bisa dijelaskan tentang gejala2, bagaimana cara supaya tidak tertular, bagaimana mengobati kusta, dsb. Karna sebenarnya penyakit kusta itu bisa disembuhkan, tetapi apa daya, stigma yang ada di masyarakat, kusta adalah penyakit yang sulit bahkan tidak bisa disembuhkan. Padahal dengan penanganan dan perawatan yang intensif, kusta dapat disembuhkan. Hal seperti ini bisa disosialisasikan kepada masyarakat sehingga stigma2 negatif tentang kusta bisa dihilangkan.

Komitmen Terhadap Penyakit Kusta
Dengan mengetahui hal2 mengenai penyakit kusta, saya berkomitmen bahwa saya tidak akan memandang kusta sebagai orang yang harus dijauhi atau dimusuhi atau ditelantarkan, melainkan adalah seseorang yang seharusnya dibantu. Membantu disini bisa bermacam2, bisa membantu mengurangi atau bahkan menghilangkan stigma negatif dalam masyarakat mengenai kusta (sehingga orang2 tidak memandang penyandang kusta seperti orang yang sangat berbahaya dan patut dijauhi), dengan mendukung kegiatan yang berhubungan dengan penyakit kusta (contohnya Run for Leprosy), dan juga memberi semangat kepada mereka, supaya mereka mau berusaha untuk lepas dari penyakit kusta dan tidak putus asa dalam usahanya tersebut.

Kesan & Pesan Run for Leprosy

Naaahh kl untuk acaranya sendiri itu seru banget, jadi smua pelari uda harus kumpul di Binus Alam Sutera pk 5 pagi, karna lari dimulai pk 6. Rute larinya sendiri dibagi jadi 2 (5K dan 10K), selagi nunggu start lari, di Binus diputerin lagu + skalian buat pemanasan (ada instruktur pemanasannya juga!). Nah pas jam 6, yang rute 10K lari dluan, baru pas jam 6.10 yg 5K mulai lari. Itu rameeeeeeeee banget, diikutin sekitar hampir 3000 pelari atau berapa gitu tp intinya banyak bgt pusing sndiri liatnya -_-. Mulai deh lari, pas awal-awal itu semangat banget lari, tapi pas uda nyampe tengah gitu uda mulai cape tuh, akhirnya ya cuma jalan cepet (gamau jalan pelan2 karna ttep smangat buat kejar2an ranking whahaha). Baru deh pas kira2 uda tinggal 1K ke finish, mulai lari lg *nyerobot ranking* *curang*. Seruuuu sihh, aplg pas nyampe garis finish jg dapet medal gt, wow banget :O. Trus dapet susu coklat dingin hbs lari itu sesuatu banget :””). Buat lari kali ini tuh kyk berasa banget semangatnya, soalnya ada sistem ranking juga, siapa si yg mau jd juara bontot? pasti smua pada mau jd juara depan2 gitu kaaaannn *<:^)

X O X O, P

Yel Yel BAS07

+—————————————–+
|http://www.facebook.com/Bas07Binusian2017|
+—————————————–+
Like This yaaa ^^

——————————————-
Bikin Yel-Yel
Ide lagu (digabungin):
– Heavy rotation
– Lazy Song
– iwak peyek
– Gentleman
Beatbox (o/ daniel)
Kahun (o/ baskoro)

[Lazy Song]
hari ini kita disuruh perform
bangun pagi t’rus ke BINUS
berdiri panas-panasan
perform yel-yel susah payah
mending kita tidur di rumah
sampe malem
huhu.. huhuuu..
sampe malem
huhu.. huhuuu..
tidur di rumah

<mencar>
Transisi:
awalnya males2 gitu, trus nanti ada musik gt (pke galon atau tepok tangan atau perkusi dll)

[!!!] nyanyinya harus semangat yaa!!! SCREAM & SHOUT buddies!! B)

Komti:
1 2, 1 2 3 4..
Bareng:
[Reff. Heavy Rotation]
hai semua
binusian
dengarlah
kami dari kelas
BAS07 tahun 17
Univ. Bina Nusantara

[Iwak Peyek]
binusian binusian
kita s’karang lagi perform
perform yel-yel, perform yel-yel
perform yel-yel paling oke

global class, kelas IT
kelas kita paling kece
paling unyu, paling gokil
tapi kita kurang cewe

Bagi satu, bagi satu
cewenya bagi satu
minta satu, minta satu
pasti kita sayang s’lalu

Daniel:
We’re gentleman

[Gentleman] –> JOGET GENTLEMAN

Programming Language Ch 16

1.   3 primary uses of symbolic logic in formal logic:

• to express propositions

• to express the relationships between propositions, and

• to describe how new propositions can be inferred from other propositions that are assumed to be true.

2.   Two parts of a compound term are:  a functor, which is the function symbol that names the relation, and an ordered list of parameters, which together represent an element of the relation.

3.   Propositions can be stated in two modes: one in which the proposition is defined to be true, and one in which the truth of the proposition is something that is to be determined. In other words, propositions can be stated to be facts or queries.

5.   Antecedents are the right side of clausal form propositions, whereas Consequents are the left side of clausal form propositions, because it is the consequence of the truth of the antecedent.

7. What are the forms of Horn clauses ?
• Have a single atomic proposition on the left side
• empty left side.

9. What does it mean for a language to be nonprocedural ?
– Language in which the programs do not exactly state how a result is to be computed but rather describe the form of the result.

11. An uninstantiated variable is a variable that has not been assigned a value.

13.  Conjunctions contain multiple terms that are separated by logical AND operations.

PROBLEM SET

1.”All predicate calculus propositions can be algorithmically converted to clausal form”. Is this statement true or false?

This statement is true. Nilsson (1971) gives proof that this can be done, as well as a simple conversion algorithm for doing it.

2. Describe how a logic programming language is different from a general programming language.

Programming that uses a form of symbolic logic as a programming language, unlike other general programming language, is often called logic programming; languages based on symbolic logic are called logic programming languages, or declarative languages.

7.   Horn clauses can be in only two forms: They have either a single atomic proposition on the left side or an empty left side. The left side of a clausal form proposition is sometimes called the head, and Horn clauses with left sides are called headed Horn clauses. Headed Horn clauses are used to state relationships, such as

likes( bob, trout ) likes( bob, fish ) x fish( trout )

8. Critically comment on the following statement : “ Logic programs are nonprocedural”
– It is true, because logical programs use lots of different processes based on its conditions. If a certain logical requirement is true, then a program will execute the corresponding process, instead of procedurally executing the statements.

10.  Using the internet for reference, find some of the applications of expert systems.

• Expert system in healthcare: The Electronic health record (EHR) is designed to replace the traditional medical and bring together a more versatile, expansive and robust expert system to provide greater quality care.

• Expert systems in the financial field: Loan departments are interested in expert systems for morgages because of the growing cost of labour, which makes the handling and acceptance of relatively small loans less profitable.

• A new application for expert systems is automated computer program generation. Funded by a US Air Force grant, an expert system-based application (hprcARCHITECT) that generates computer programs for mixed processor technology (FPGA/GPU/Multicore) systems without a need for technical specialists has recently been commercially introduced

 

Programming Language Ch 15

2.   A lambda expression specifies the parameters and the mapping of a function.

3.   Atoms and lists were parts of the original LISP.

6.   Simple list is a list which membership of a given atom in a given list that does not include sublists.

7.   REPL stand for read-evaluate-print loop.

8.   Three parameters to IF are: a predicate expression, a then expression, and an else expression.

18.   A function is tail recursive if its recursive call is the last operation in the function. This means that the return value of the recursive call is the return value of the nonrecursive call to the function. It is important to specify repetition to be tail recursive because it is more efficient(increase the efficiency).

22.  During reader phase of a common LISP language processor,  There is a special kind of macro, named reader macros or read macros, that are expanded.  A reader macro expands a specific character into a string of LISP code. For example, the apostrophe in LISP is a read macro that expands to a call to QUOTE.

24.  What is stored in an ML evaluation environment?

A table called the evaluation environment stores the names of all implicitly and explicitly declared identifiers in a program, along with their types. This is like a run-time symbol table.

29.  Curried function let new functions can be constructed from them by partial evaluation.

30.  Partial evaluation means that the function is evaluated with actual parameters for one or more of the leftmost formal parameters.

33.  Explain the process of currying.
The process of currying replaces a function with more than one parameter with a function with one parameter that returns a function that takes the other parameters of the initial function.

35.   A language is nonstrict if it does not have the strict requirement.

43.  What is the syntax of a lambda expression in F#?

The following lambda expression illustrates their syntax:
(fun a b −> a / b)

PROBLEM SET

2.  Give the general form of function declaration in ML.

Function declarations in ML appear in the general form
fun function_name( formal parameters ) = expression;

8.   How is the functional operator pipeline ( | > )used in F#?

The pipeline operator is a binary operator that sends the value of its left operand, which is an expression, to the last parameter of the function call, which is the right operand. It is used to chain together function calls while flowing the data being processed to each call.

Consider the following example code, which uses the high-order functions filter and map:

let myNums = [1; 2; 3; 4; 5]
let evensTimesFive = myNums

|> List.filter (fun n −> n % 2 = 0)

10.  What does  the following Scheme function do?

(define ( x lis)

(cond

(( null? lis) 0 )

(( not(list? (car lis)))

(cond

((eq? (car lis) #f) (x (cdr lis)))

(else (+1 (x (cdr lis))))))

(else (+ (x (car lis))  (x (cdr lis))))

x returns the number of non-#f atoms in the given list

|> List.map (fun n −> 5 * n)

Programming Language Ch 14

2.   An exception is raised when its associated event occurs.

3.   The advantages of having support for exception handling builtin to language:

• First, without exception handling, the code required to detect error conditions can considerably clutter a program.

• Another advantage of language support for exception handling results from exception propagation. Exception propagation allows an exception raised in one program unit to be handled in some other unit in its dynamic or static ancestry.

• A language that supports exception handling encourages its users to consider all of the events that could occur during program execution and how they can be handled. This approach is far better than not considering such possibilities and simply hoping nothing will go wrong.

9.   An exception handler in Ada can occur in either a  subprogram body, a package body, a task, or a block

10.  There are four exceptions that are defined in the default package, Standard:

Constraint_aError
Program_Error
Storage_Error
Tasking_Error

12.   The suppress pragma is used to disable certain run-time checks that are parts of the built-in exceptions in Ada.

14. The name of all C++ exception handlers is Try clause.

15.  The exception out_of_range is thrown by library container classes.

16.  The exception overflow_error is thrown by math library functions.

32.  Event-driven programming is a programming where parts of the program are executed at completely unpredictable times, often triggered by user interactions with the executing program.

33.   The JFrame class defines the data and methods that are needed for frames. So, a class that uses a frame can be a subclass of JFrame. A JFrame has several layers, called panes.

PROBLEM SET

1.   What mechanism did early programming languages provide to detect or attempt to deal with errors?

Early programming languages were designed and implemented in such a way that the user program could neither detect nor attempt to deal with such errors. In these languages, the occurrence of such an error simply causes the program to be terminated and control to be transferred to the operating system.

2.   Describe the approach for the detection of subscript range errors used in C and Java.

In C subscript ranges are not checked. Java compilers usually generate code to check the correctness of every subscript expression. If any exception generates, then an unchecked exception is thrown.

4.   What are the different approaches to handle checked exception in Java?

In Java there are basically two types of exceptions: Checked exceptions and unchecked exceptions.

Checked exceptions must be explicitly caught or propagated as described in Basic try-catch-finally Exception Handling. Unchecked exceptions do not have this requirement. They don’t have to be caught or declared thrown.
Checked exceptions in Java extend the java.lang.Exception class. Unchecked exceptions extend the java.lang.RuntimeException.

14.  Summarize the arguments in favor of the termination and resumption models of continuation.

The resumption model is useful when the exception is only an unusual condition, rather than an error. The termination model is useful when the exception is an error and it is highly unlikely that the error can be corrected so that execution could continue in some useful way.

Programming Language Ch 13

1.   Three possible levels of concurrency in programs:
• instruction level (executing two or more machine instructions simultaneously),
• statement level (executing two or more high-level language statements simultaneously)
• unit level (executing two or more subprogram units simultaneously)

2.   In an SIMD computer, each processor has its own local memory. One processor controls the operation of the other processors. Because all of the processors, except the controller, execute the same instruction at the same time, no synchronization is required in the software.

5.   Unit-level concurrency is best supported by MIMD computers.

6.   Vector processor have groups of registers that store the operands of a vector operation in which
the same instruction is executed on the whole group of operands simultaneously.

7.   Physical concurrency is several program units from the same program that literally execute simultaneously.

Logical concurrency is multiple processors providing actual concurrency, when in fact the actual execution of programs is taking place in interleaved fashion on a single processor.

8.   A scheduler manages the sharing of processors among the tasks. If there were never any interruptions and tasks all had the same priority, the scheduler could simply give each task a time slice, such as 0.1 second, and when a task’s turn came, the scheduler could let it execute on a processor for that amount of time.

16.   A task descriptor is a data structure that stores all of the relevant information about the execution state of a task.

18.   The purpose of a task-ready queue is to be storage of tasks that are ready to run.

21.   A binary semaphore is  a semaphore that requires only a binary-valued counter.

A counting semaphore is a synchronization object that can have an arbitrarily large number of states.

30.   Ada terminate clause, when selected, means that the task is finished with its job but is not yet terminated. Task termination is discussed later in this section.

34.   Sleep method in Java blocks the the thread.

35.   Yield method in Java surrenders the processor voluntarily as a request from the running thread.

36.  The join method in Java is used to force a method to delay its execution until the run method of another thread has completed its execution.

55.   Concurrent ML is an extension to ML that includes a fform of threads and a form of synchronous message passing to support concurrency.

56.  The use of spawn primitive of CML is to take the function as its parameter and to create a thread.

57.   The use of subprograms BeginInvoke and Endinvoke in F# is to call threads asynchronously.

60.   What is the type of an F# heap-allocated mutatable variable?

A mutable heap-allocated variable is of type ref

63.  The FORALL statement of High-Performance Fortran is to specifies a sequence of assignment statements that may be executed concurrently.

PROBLEM SET

1. Explain clearly why a race condition can create problems for a system.

Race condition can create problems for a system, because two or more tasks are racing to use the shared resource and the behavior of the program depends on which task arrives first (and wins the race).

2.   The different ways to handle deadlock:

– Ignoring deadlock

– Detection

– Prevention

– Avoidance

3.    Busy waiting is a method whereby a task waits for a given event by continuously checking for that event to occur. What is the main problem with this approach?

Busy-waiting or spinning is a technique in which a process repeatedly checks to see if a condition is true, such as whether keyboard input or a lock is available. Spinning can also be used to generate an arbitrary time delay, a technique that was necessary on systems that lacked a method of waiting a specific length of time. Processor speeds vary greatly from computer to computer, especially as some processors are designed to dynamically adjust speed based on external factors, such as the load on the operating system. Busy waiting may loop forever and it may cause a computer freezing.