
![]() | ![]() |
- Enter the current fare in the meter.
- Click Convert button.
- The amount you need to pay, the new fare, will be shown.
GET /thoughts HTTP/1.1
Host: Sriki

![]() | ![]() |
| FARE TABLE-010 | ||
| Stage | Name | Fare |
| 1 | KAMAKYA | 0.00 |
| 2 | KATTRIGUPPE | 5.00 |
| 3 | HOSAKERE HALLI | 9.00 |
| 4 | BANK COLONY | 10.00 |
| 5 | GANESH BHAVAN | 13.00 |
| 6 | CHAMARAJPET | 15.00 |
| 7 | GOODS ROAD | 16.00 |
| 8 | KBS | 16.00 |
List stageList=[KAMKYA...KBS]
List fareList=[0..16]
int start= stageList.indexOf[YOUR START STAGE]
int end = stageList.indexOf[YOUR END STAGE]
Fare= fareList[end-start]
#!/usr/bin/perl -w
use strict;
BEGIN{
$\="\n";
}
&usage if @ARGV!=1;
my $fileName=shift;
&usage if ($fileName !~ m#\.(ram|rm)$#);
&process_ram($fileName) if ($fileName =~ m|\.ram$|);
&process_rm($fileName) if ($fileName =~ m|\.rm$|);
sub usage(){
print STDERR "usage: $0 filename.rm/ram\n";
exit 1;
}
sub process_ram(){
my $fileName=shift;
$fileName=&processUrl($fileName);
open RAM_FILE, $fileName || die "Failed To Process File: $!";
while(){
chomp;
chop if ~ m/\r$/;
$_ = &processUrl($_);
&convertToMp3($_);
}
close RAM_FILE;
}
sub process_rm(){
my $fileName=shift;
$fileName=&processUrl($fileName);
&convertToMp3($fileName);
}
sub convertToMp3(){
my $fileName=shift;
chomp($fileName);
chop($fileName) if $fileName =~ m/\r$/;
print "Processing File...$fileName";
my ($dirName,$baseName)=&dirname($fileName);
$baseName =~ s/\.rm/.mp3/;
die "Invalid File: ${fileName}" unless(-e $fileName);
`mplayer $fileName -ao pcm 2>/dev/null`;
`lame -h -b 128 audiodump.wav $dirName/$baseName`;
`rm audiodump.wav`;
}
sub dirname(){
return (".",$_[0]) unless $_[0] =~ m|^/|;
return $_[0]=~ m|(.*/)(.*)$|;
}
sub processUrl(){
my $fileName=shift;
chomp($fileName);
if(&isUrl($fileName)){
&download($fileName);
return $fileName =~ m|.*/(.*)$|,$1;
}
return $fileName;
}
sub isUrl(){
$_[0] =~ m/^http.*/;
}
sub download(){
print "Downloading File...$_[0]";
system("wget -c $_[0]")==0 || die "Failed to download file: $_[0]";
}
Recent anti-encroachment drive of Mysore is an example of admirable planning and execution. The drive was directed and managed by the MCC commissioner K. S Raykar.
Planning Phase:Almost 6 months
a) to get approvals from higher ups including district minister Shobha Karandlaje
b) to develop project execution plan.
Departments Involved: MCC, MUDA, Mysore Police (KSRP, CAR, DAR...etc), Telecom Department
Project Leads: K.S Raykar( MCC Commissioner), Manivannan (DCP), Sunil Agarwal (Police Commissioner)
Project Team Structure/Resourcing:
Commanded by: 2 teams of MUDA and MCC
Executed By: 27 teams of workers!!!
The team organization and composition of each team is shown below.

Risks/ Risk Mitigation:
Stay Order from Court: The operation was started on a Sunday, early in the morning - no court is open at that time.
Influence from elected representatives: All the phone lines, land line and mobile, were jammed with help of Telecom providers - physical presence required for any kind of influence.
People gathering to protest: Jamming of phone lines prevent mobilization of people. Also, 500 policemen providing security would deter anyone raising voice.
Result: More than 450 encroachments cleared by noon!
Issues Encountered: There was protest by the elected representatives at the demolition site. The threat of arrest, and few arrests, by the police was enough to diffuse the crowd.
Post Execution: MCC Commissioner goes on a 3 day sick leave from Monday – leaving all the encroachers and their supporters with the rubble!
/*Input Data we need to Solve*/
/* Input Set of products */
set products;
/* Gains of the product */
param gain{i in products};
/* Milling Requirements of the product */
param milling{i in products};
/* Lathe Requirements of the product */
param lathe{i in products};
/* Threading Requirements of the product */
param thread{i in products};
/* Milling Limit*/
param millingLimit;
/* Threading Limit*/
param threadLimit;
/* lathe Limit*/
param latheLimit;
/*Variable Declarations*/
var x{i in products}, >= 0;
/*Objective*/
maximize profit: sum{i in products} gain[i]*x[i];
/*Constraints*/
subject to millingMachine: sum{i in products} milling[i]*x[i] <= millingLimit;
subject to latheMachine: sum{i in products} lathe[i]*x[i] <= latheLimit;
subject to threadMachine: sum{i in products} thread[i]*x[i] <= threadLimit;
end;
data;
set products:= Nuts Bolts Rivets;
param gain:=Nuts 20
Bolts 6
Rivets 8 ;
param milling:=Nuts 8
Bolts 2
Rivets 3;
param thread:=Nuts 4
Bolts 3
Rivets 0;
param lathe:=Nuts 2
Bolts 0
Rivets 1;
param millingLimit := 250;
param threadLimit := 150;
param latheLimit := 50;
end;
symphony -F HardwarePlant.mod -D HardwarePlant.dat
Solution Cost: 700.000
+++++++++++++++++++++++++++++++++++++++++++++++++++
Column names and values of nonzeros in the solution
+++++++++++++++++++++++++++++++++++++++++++++++++++
x[Bolts] 50.000
x[Rivets] 50.000
A typical diagram of ESB based transformation is as shown above. In reality all the mesh gets into the ESB itself; ESB encapsulates the mesh. Subsequent to the ESB based solution implementation, enterprises would have to setup teams to manage the ESB and deal with the governance around the ESB usage.
We used the log variadic macro in our code. Nice learning!!
#ifdef EMU
int log(char*msg, ...) {
va_list args;
va_start(args, msg);
return vprintf(msg, args);
}
#else
#define log(msg, ...)
#endif
The PROCESSES initialization parameter determines the maximum number of operating system processes that can be connected to Oracle Database concurrently. The value of this parameter must be a minimum of one for each background process plus one for each user process. The number of background processes will vary according the database features that you are using. For example, if you are using Advanced Queuing or the file mapping feature, you will have additional background processes. If you are using Automatic Storage Management, then add three additional processes.
NAME TYPE VALUE
------------------------------------ -----------
aq_tm_processes integer 0
db_writer_processes integer 1
gcs_server_processes integer 0
job_queue_processes integer 4
log_archive_max_processes integer 2
processes integer 50
public int getNum()
{
int i=2;
try
{
return i;
}
finally
{
i=3;
}
}