2021-08-24

Initializing a structure in C language

#include <stdio.h>
typedef struct sub_struct {
int field1;
int field2;
int field3;
} SUB_STRUCT;

typedef struct my_struct {
SUB_STRUCT field1;
int field2;
int field3;
int field4;
} MY_STRUCT;

main() {

MY_STRUCT var =
{
.field1 = {
   .field1=1 ,
   .field3=3 },
.field2 = 2,
.field4 = 4
};
printf ("var.field1.field1 = %d\n", var.field1.field1);
printf ("var.field1.field2 = %d\n", var.field1.field2);
printf ("var.field1.field3 = %d\n", var.field1.field3);
printf ("var.field2 = %d\n", var.field2);
printf ("var.field3 = %d\n", var.field3);
printf ("var.field4 = %d\n", var.field4);
}

var.field1.field1 = 1
var.field1.field2 = 0
var.field1.field3 = 3
var.field2 = 2
var.field3 = 0
var.field4 = 4

2021-06-09

Elliptic curve algebra explained in high school maths

 

I have no formal Computer Science background. Most of my computer knowledge are acquired after graduation. Especially about encryption stuff, this is based on self learning and most level is just up to RSA standard. Recently having some interest on the underlying technologies of Bitcoin, I want to study about Elliptic curve (y2 = x3 + ax + b) because it is used for encryption. However, after viewing some YouTube videos, I still cannot have a better understanding the geometry about it. Some of them are even wrong. The following diagrams are from Wikipedia (red line) and the blue line will define a “binary” operation P+Q = -R



The Youtuber simply stated the following formulae to derive R…

If P = (x1, y1), Q = (x2, y2), R = (x3, y3)

Not satisfied with result, I try to solve the problem (simultaneous equations in two unknowns) using my high school level maths level.

Putting (2) into (1)


which is a simple polynomial of level 3.

High school level maths shows the sum of roots (x1+x2+x3) is the negative coefficient of x2 (i.e. m2). Back to how to calculate m, it is simply

Oh! I finally got the answer!


The Youtuber also stated that for the case P=Q i.e. x1 = x2 and y1 = y2), then



For this case, actually the straight line should be a tangent line touching the elliptic curve at point B. Oh! This needs calculus and I need to cheat by doing some searching on internet. Luckily, some universities do public some tutorial paper on that.

Taking differentiation on y2 = x3 + ax + b

As in the previous case, m2 is still the sum of root (in this case is x1+x2+x3).

Therefore x3 and also be calculated according.

2020-06-07

從慚愧到一點慰藉

由於終於安裝了家居寬頻,所以多聽咗youtube(真喺聽,唔喺睇),我用的裝置是一部android手機接駁藍芽音箱。
但越聽越多很花時間 (youtube真喺好addictive!) 跟住有人話其實是用快速1.5至2倍速度聽youtube。坦白講,我對聲效的認識仍停留在n年前在大學時讀的Digital Signal Processing, 只是識少少Fast Fourier Transform(其實都唔記得晒),仍覺得加速會將聲音變調而唔好聽。
就即管試下…點解android手機嘅youtube無playback speed選項?上網求救,原來只支援android 5或更新的手機(說來慚愧,我部舊手機只是行android 4.4.4)。但是點解google將playback speed logic放在client side而不是server side呢?再上網找資料,原來google在2017年寫過篇blog解釋此功能,仲話甚麼甚麼time stretching,phase vocoder等…(算罷,我投降喇!)不過文章介紹youtube player是用Sonic library來實施variable playback speed。講番效果,其實真喺唔差,沒有雞仔聲。
我平時是用開audacity做音效editing,就看看audacity有無此功能,原本真是有的,快速版是Change Tempo,慢速版(效果好啲)是Sliding Stretch,後者是用Subband Sinusoidal Modeling Synthesis運算法,我試過效果也不錯,總算有點慰藉。

2020-05-17

Zoom來學佛 - 林碧君 (因陀羅網 @ 溫暖人間541期)

疫情影響了很多宗教活動,佛教也不例外,目前法師講經/開示、法會、佛學課程、禪修甚至義工們的互動,很多都改以「Zoom」遙距式舉行。

然而,靠「Zoom」弘法,對傳訊和接收雙方的要求都大幅地提高了— 我們準備好了嗎?

不少機構只是把原來的課程/開示設計原封不動地改為網上直播,兩小時的課就直播兩小時,但沒群眾影響下,觀眾真的可以在電腦前呆坐兩小時嗎?欠缺現場氣氛下,對着顯示屏的專注力和現 場聽課會一樣嗎?如何保證聽課的環境 不會分心?(手機有關嗎?) 就算同樣有中場休息,又如何保證小息完後會繼續?(不少有名的網上教育,例如TED,設計 成片長不超過二十分鐘是有原因的。)

講者的挑戰則更大,除了要學習「網紅式」鏡頭表達技巧外,因為無法從現場的反應中,感受到聽眾的接受 程度及最關心的事,便無法調整講授內容 — 容易流於自說自話。

更重要是,聽眾常覺得網上的開示「必然會」重播,便會想「無須即時同 步聽課,日後有空才看」一而「有空 的一日」,永遠是明日。

From Uncertainty Principle to the Dilemma of Efficiency and Service Quality

Recently, listening to some youtube clips about philosophy triggers my memory of Heisenbery's uncertainty principle learnt in high school:

(standard deviation of position) times (standard deviation of momentum) >= Planck constant / 2

It simply states the more certain of the former implies the more uncertain of the latter.
I nearly forgot. But during work, I more often have to deal with the resource (labour or others) efficiency and customer satisfaction (e.g. wait time). Hey! I remember I have learnt queuing theory for M/M/1 model,

the mean queue time is t = ρ / (1-ρ) where ρ = λ / μ
λ is the rate at which packets arrive at the queue (in packets/second), and
μ is the rate at which packets may be served by the queue (in packets/second)
(sorry I in fact forgot the exact formula but I just copy from Wikipedia)

My main point is this has many similarity with uncertainty principle in the sense that the high efficiency you request, the longer wait time will be resulted.

for efficiency, I can view ρ can serve this role because it is always less than one.

The I redefine inefficiency as λ = 1-ρ, then
t = ρ / (1-ρ) ≈ 1 / (1-ρ) (since ρ≈1)
then t • (1-ρ) ≈ 1 or

t • λ ≈ 1
which is my analogy of the uncertainty principle.

2017-08-03

Raspberry Pi Camera: Most Simple Motion Detection Logic


I want to make my newly purchased Pi as a home surveillance appliance.

My requirements are very simple:

  • it is purely camera based (i.e. no need to install Passive Infrared (PIR) motion sensor)
  • it is still photo based (i.e. not video based)
  • it should not consume too much of my Pi resources (CPU or GPU)
  • it will take photos when it detected image changes
  • the photos will be uploaded to Google Drive

I have checked many resources on internet.  The main stream is to either use opencv (or its derivative SimpleCV) or the Motion package (or even the whole OS with motionEyeOS).  Although some ports are said to utilize the Pi's GPU resources, I notice the performance is still not satisfactory (low resolution or low frame rate).

Considering my case that most of the time, my periodically captured photos are nearly the same, except some lighting changes, noises, clock face changes etc and inspired various projects (e.g. brainflakes  or Sarah Henkens' blog), I devise my motion detection algorithm as follows:

(a) the task will be kicked off by cron

(b) use Pi's command line to capture still picture onto the disk

(c) I will compare the grey-scale of each pixel in consecutive snapshots.  Someone said for RGB domain, using the Green channel for comparison is sufficient.  But Pi also supports YUV output.  The Y channel (luminance) actually is the brightness of each pixel.  Pi's YUV format is YUV420 and the first 2/3 of the file contains the Y data.

(d) if the number of pixels with change in Y (luminance) is greater than a limit, then this photo will be uploaded to Google Drive

(e) the photo will be converted to JPEG before the upload.  I use Imagemagick's convert command to do the job.  Remark: although I take my still picture at maximum resolution 3280x2464, because of the padding (horizontal: multiples of 32, vertical: multiples of 16), the resultant YUV file is of resolution of 3296x2464.  Since YUV file has no header to indicate the information, I need to specify the figure in the Imagemagick's convert command.

However, I find the major challenge is how to specify limit in step (d).  Therefore I conduct a data analysis of sensitivity of different values of change of Y.


As shown in the above graph, the bottom group of lines are those image with no motion detection (the variation is due to background noise).  The upper group of lines (with lighter colour) are those image with motion detection.  Finally I choose the following:
  • Change of Y: 50
  • Count: 50
However, after running for several days, I find that the camera is too sensitive that it trigger the capture even though I saw there is no noticeable object movement on the image.  Of course I have tried to adjust the above detection threshold using trial-and-error.  But as you know, I am only struggling between the dilemma of false positive and false negative scenario.  If I decrease the sensitivity significantly , then I may miss a capture if there is real object movement.

Finally I find the false detection scenarios are mainly due to too reasons:
  • overall ambient background brightness change due to sunshine (although it is a indoor environment)
  • there a portion of screen due to a white window curtain, which has a high value of Y and its changes of Y will affect the overall counter significantly
My original logic is to just look into a single point of "Change of Y", assuming that it is on a global applicable trend.  But it is not necessarily true.  Therefore to emphasize the object detection, I adopt a an accumulative approach, by counting the number of pixels with changes greater than a value.  For the second issue, my original logic use absolute logic and therefore a pixel changing from Y=1 to Y=11 has the same effect with another pixel changing from Y=245 to Y=255.  But from a subjective point, I think a relative change is more appropriate.

The following is effect after the change:


After the adjustment,, it can be observed that:

  1. the vertical axis interception is always 8121344, which is the total number of pixel of the image
  2. the lines of the background image (those in lighter color) are nearly straight line (with vertical axis in log scale)
  3. the lines of the image with motion (those in darker color) have a more horizontal line segment

I then choose the following criteria:
  • Relative Change of Y: 100
  • Accumulative count of pixels: 10000
Finally about the details of implementation.  I have only coded two programs.  The first is a C program called yuv_ardiff (viz. yuv's accumulative and relative diff) for step (c) above. [Remark: I am still learning python].  The second is a bash script will implement the whole logic.
The following are the source codes:

/***********
File        : yuv_ardiff.c
Description : To compare the Y space of two yuv files for motion detection
              Accumulative Relative Diff
Usage       : yuv_ardiff file1.yuv file2.yuv
Modification History
2017-08-01  Initial version
2017-08-06  Change counter to accumulative
2017-08-08  Use Relative ratio
*/

#include <stdio.h>
#include <stdlib.h>
#include <sys/stat.h>

int main (int argc, char **argv)
{
struct stat st;
int file1_size, file2_size;
int y_size;
int i;
FILE *fp1;
FILE *fp2;
unsigned char byte1, byte2;
int diff, sum, rdiff;;
int count[256];

if (argc != 3) {
  printf ("Usage: %s file1.yuv file2.yuv\n", argv[0]);
  return 0;
  }


if (stat(argv[1], &st) == -1) {
  printf ("Error: Cannot get the file size of %s\n", argv[1]);
  return 0;
  }
file1_size = st.st_size;
/* printf ("%d\n", file1_size); */

if (stat(argv[2], &st) == -1) {
  printf ("Error: Cannot get the file size of %s\n", argv[2]);
  return 0;
  }
file2_size = st.st_size;
/* printf ("%d\n", file2_size); */

if (file1_size != file2_size) {
  printf ("Error: File size of %s (%d) is not equal to %s (%d)\n", argv[1], file1_size, argv[2], file2_size);
  return 0;
  }

/* The first 2/3 are Y, next 1/6 is U and last 1/6 is V */
if ((file1_size % (3*16*16)) != 0) { /* actual is 1.5 * 32 * 16 */
  printf ("Error: File size (%d) should be multiple of 1.5*32*16\n", file1_size);
  return 0;
  }


fp1 = fopen (argv[1], "r");
if (fp1 == NULL) {
  printf ("Error: Cannot open file (%s)\n", argv[1]);
  return 0;
  }

fp2 = fopen (argv[2], "r");
if (fp2 == NULL) {
  printf ("Error: Cannot open file (%s)\n", argv[2]);
  return 0;
  }

y_size = file1_size * 2 / 3;
/* printf ("y_size = %d\n", y_size); */
for (i=0; i<256; i++)
  count[i] = 0;

for (i=0; i< y_size; i++) {
  if (fread (&byte1, 1, 1, fp1) != 1) {
    printf ("Error: Cannot read byte from (%s)\n", argv[1]);
    return 0;
    }
  if (fread (&byte2, 1, 1, fp2) != 1) {
    printf ("Error: Cannot read byte from (%s)\n", argv[2]);
    return 0;
    }

  diff = abs (byte1 - byte2);
  sum = byte1 + byte2;

  if (sum > 0)
    rdiff = (diff * 256) / sum;
  else
    rdiff = 0;

  if (rdiff > 255) {
    printf ("Error: rdiff (%d) is greater than 255\n", rdiff);
    return 0;
    }

  (count[rdiff])++;

  } // for loop

fclose (fp1);
fclose (fp2);

for (i=254; i>=0; i--)
    count[i] += count[i+1];

for (i=0; i<256; i++)
  printf ("%d ", count[i]);
printf ("\n");

return 0;
} // main

=====================================================
#!/bin/bash
# File: pi_camera_motion.sh
cd /home/whc/motion
rm -f last.yuv
if [ -e current.yuv ]; then
mv current.yuv last.yuv
fi
DATE=`date +"%Y%m%d_%H%M%S"`
raspiyuv -n -h 2464 -w 3280 -o current.yuv
if [ -e last.yuv ]; then
yd=`/home/whc/bin/yuv_adiff last.yuv current.yuv`
echo ${DATE} ${yd} >> /home/whc/yuv_ardiff.log
diff_count=`echo ${yd} | awk '{print \$101}'`
if [ "${diff_count}" -gt "10000" ]; then
convert -size "3296x2464" -depth 8 -sampling-factor "4:2:0" yuv:current.yuv pi_photo_${DATE}.jpg
/home/whc/gdrive-linux-rpi upload --parent xxxxxxxxxxxxxxxxxxxxxxxxxx pi_photo_${DATE}.jpg
fi
fi

2017-07-26

Take periodic photos using Pi camera and upload to Google Drive


Taking photos using the Pi camera is easy.  But how to allow remote access of the photo is a headache.  I do not want to Port Forwarding in my router (especially on SSH ports) because I think my Pi is not yet appropriately hardened.  I decide to upload the photos to the cloud.

Google has well-documented API for the Google Drive access.  In particular, I love Petter Rasmussen's gdrive, which is a CLI (command-line-interface) client for many Operating Systems because it is a static binary which does not need external libraries.

I have tried the Windows 64 bit build and the Raspberry Pi build and it works.  For the Windows build, I even try it behind the proxy server of my company and it works after I set up the http_proxy environment variable.

The github page of the gdrive already provides extensive documentation (with examples) and it is easy to adopt.  The following are my major usage:

(1) Initial setup

gdrive about

gdrive will print out a URL.  Using browser to launch the URL and enter the account password, Google will print out a verification code.  I will enter the verification code to the CLI.

There is documentation on Service Account, which is said to make server-to-Google access with password-less access.  But I find that even using the verification code approach, I find gdrive can refresh the token file automatically.  In other words, I only need to input the verification code once.  Therefore I finally do not bother to set up a Service Account.

(2) List File details

gdrive list --query "name = 'file_name_or_folder_name' "

C:\PortableApps\gdrive>gdrive-windows-x64.exe list --query "name = 'PI_PHOTO_00.jpg' "
Id                             Name              Type   Size     Created
xxxxxxxxxxxxxxxxxxxxxxxxxxxx   PI_PHOTO_00.jpg   bin    4.8 MB   2017-07-26 10:00:16

C:\PortableApps\gdrive>gdrive-windows-x64.exe list --query "name = 'pi-photos' "
Id                             Name        Type   Size   Created
xxxxxxxxxxxxxxxxxxxxxxxxxxxx   pi-photos   dir           2017-07-21 19:50:23

(3) List Files inside a folder

gdrive list --query " 'Parent_Folder_Id' in parents"

C:\PortableApps\gdrive>gdrive-windows-x64.exe list --query " '0Bzo1pJKfp9QEdVZFdVV2RTV2RVE' in parents "
Id                             Name              Type   Size     Created
xxxxxxxxxxxxxxxxxxxxxxxxxxxx   PI_PHOTO_35.jpg   bin    4.8 MB   2017-07-26 10:35:12
xxxxxxxxxxxxxxxxxxxxxxxxxxxx   PI_PHOTO_30.jpg   bin    4.7 MB   2017-07-26 10:30:12

(4) Upload File to specified folder

gdrive --parent Parent_Folder_Id Upload_Filename

(5) Delete File

gdrive delete  File_Id

I then start to code my bash script (which will be run by cron periodically) to take photo and then upload the photo.  I use the minute digits to name my photo filename and originally thought that this nomenclature can automatically recycle my photo copies without an explicit housekeeping job.  But I am wrong.  I find Google Drive allow multiple copies of the same filename (even not using the versioning feature) and these multiple copies will be assigned with different File-Id.

Worst still I find gdrive has no direct command to delete a file (or files) by filename.  I need to first list the File_id by the inputted filename and then delete them (if more than one) one-by-one.  The logic is:

gdrive list --no-header --query "name = 'Filename' " | awk '{print $1}' | xargs -n 1 gdrive delete

The xargs command is to ensure the gdrive is executed one-by-one

The following is my script:

#!/bin/bash
# use 00-59 minutes for filename recycling
DATE_MM=$(date +"%M")
cd  /home/pi/photos
raspistill -n -o PI_PHOTO_${DATE_MM}.jpg
# delete duplicated copies at Google drive
/home/pi/gdrive-linux-rpi list --no-header --query "name = 'PI_PHOTO_${DATE_MM}.jpg'" | awk '{print $1}' | xargs -n 1 /home/pi/gdrive-linux-rpi delete
# upload to pi_photos folder at Google Drive
/home/pi/gdrive-linux-rpi upload --parent xxxxxxxxxxxxxxxxxxxxxxxxxxxx --delete PI_PHOTO_${DATE_MM}.jpg

2016-01-07

Using U3 Flash Drive for CDROM emulation


I have an old U3 flash drive, which has only 1G capacity. This kind of a device can mount two drives simultaneously - one is a conventional flash drive (read/write) and one is a CDROM drive (read-only). Usually users does not care the CDROM partition and sometimes even remove it totally to spare more space from the conventional partition.

However, recently triggered by a corporate customer's site requirement that conventional flash drive is disabled but CDROM ia allowed (thanks to its read-only feature), I start to think whether I can re-use my old U3 drive for that purpose.

The first step is to create an ISO file, which should be a well-known idea if you have ever burned a disk. I choose to use InfraRecorder, because it has no embedded commercial ad and has a portable version to save the installation effort. The following screen shots illustrate the steps to build the ISO file.






Then I download u3tool from SOURCEFORGE.NET. It is a open source tool to manipulate the U3 disk and I find it also work properly in my 64 bit Windows environment as well. The steps are simple:

(i) create the CDROM partition
u3-tool -p <size-of-iso-file> <driver letter o u3-cdrom-without-colon>
e.g. u3-tool -p 42301440 d

(ii) load the iso file
u3-tool -l <iso-filename>  <driver letter u3-cdrom-without-colon>
e.g. u3-tool -l unix.iso e



Then this CD Drive is shown in Windows Explorer as follows:






2015-09-24

Using openssl to test two way SSL connectivity

In my previous post Building a two way https web service server using Java, I said I used openssl to do the web service server testing.

In fact, before choosing openssl, I have tried other methods like curl, various Chrome extensions.  But finally I stick to openssl because of its flexibility and availability of low level output to facilitate my debugging.

In fact the script is as simple as follows:

openssl s_client -connect localhost:8000 -cert client.pem -key key.pem -CApath . -CAfile ca.pem -showcerts -debug -msg -state -crlf -ign_eof <<EOF
POST /app HTTP/1.1
hostname: localhost
Content-Type: application/x-www-form-urlencoded
Content-Length: XXX

<?xml version='1.0'?><Envelope xmlns='http://schemas.xmlsoap.org/soap/envelope/' xmlns:op='http://schemas.xyz.com/svc' xmlns:ems='http://schemas.xyz.com/ems'><Header>Header_Text</Header><Body><op:AddPbs><ems:ChannelAcctId><ems:ChannelId>06</ems:ChannelId><ems:AcctId>1234567</ems:AcctId></ems:ChannelAcctId></op:AddPbs></Body></Envelope>

EOF

Let me explain each parameter one by one:

s_client: it is the SSL/TLS client program of openssl suite
connect: it designates the web service connection details (IP address and port)
cert: it specifies the self (client) certificate to present to the host
key: it specifies the private key file signing the client certificate
CApath: it designates the folder containing the certificate chain(s)
CAfile: it designates the "trusted" CA which signs the server certificate
showcerts: it shows the whole server certificate chain
debug: it is a treasure of openssl
msg: ditto
state: ditto
crlf: in Unix, the line delimiter is LF only.  This switch will cause the content to be transmitted with CR+LF instead (but please note the Content-Length has to be modified accordingly)
ign_eof: I originally omitted this switch.  But I find it is needed because otherwise the connection is closed too early by openssl before the server can send  the response back.


Building a two way https web service server using Java


I have the following requirements:
  • to build a multi-thread http server serving inbound web service requests via POST
  • the request is not conventional SOAP but is still XML-based
  • both client and server authentication (certificate based) is needed (riding not https)

 After some googling I found that Java provides a convenient framework to deliver this capability (as in Meisch's article "Java Webservice using HTTPS part 2")

The major classes used is:
  1. com.sun.net.httpserver.HttpsServer (abstract class); and
  2. com.sun.net.httpserver.HttpHandler (interface)
As HttpsServer is an abstract class, it cannot be instantiated (creating an object via new operator).  My example class java_https_server is therefore to implement the HttpHandler interface and have a method CreateHttpServer to create an HttpsServer object via the static HttpsServer.create() method.

The logic of the program is as follows:
  1. inside the main method, after creating a dummy java_https_server object, invoke the CreateHttpServer method to create a HttpsServer object
  2. inside CreateHttpServer method, open a Java Key Store containing the web server's own certificate and the Trust Store containing the trusted client certificate (the latter is needed because I use two-way SSL).  An SSLContext object instance is linked to these two key stores.  Finally, a context (which I find useless because I cannot still associate different handler with different context) is created for the HttpsServer object.
  3. the main method continue to set up a shutdown hook to graceful termination handling
  4. since the java_https_server implements the HttpHandler interface, a handle() method is defined  This is the core running logic of the whole web service server. I have added many println statements to display the attributes of the http connection in my codes.
The source listing is as follows:

import java.io.FileInputStream;

import java.io.InputStream;
import java.io.OutputStream;
import java.io.IOException;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import com.sun.net.httpserver.HttpHandler;
import com.sun.net.httpserver.HttpsServer;
import com.sun.net.httpserver.HttpExchange;
import com.sun.net.httpserver.HttpsExchange;
import com.sun.net.httpserver.HttpsConfigurator;
import com.sun.net.httpserver.HttpsParameters;
import javax.net.ssl.KeyManagerFactory;
import javax.net.ssl.SSLParameters;
import javax.net.ssl.TrustManagerFactory;
import javax.net.ssl.SSLContext;
import java.security.KeyStore;
import java.net.URI;
import java.net.InetSocketAddress;

public class java_https_server implements HttpHandler {
private static final int HTTP_OK_STATUS = 200;
// ----------class property --------------
private String context = "/";
private int port = 8000;
private String keystorePasswordString = "password";
private String keystoreFile = "/full_path/keystore.jks";
private String truststorePasswordString = "password";
private String truststoreFile = "/full_path/truststore.jks";
// --------- Constructor -------------------
public java_https_server () {
  }
// --------------------------------------------
public HttpsServer CreateHttpServer(int port, String context) {
  HttpsServer httpServer;
  try {
    httpServer = HttpsServer.create(new InetSocketAddress(port), 0);
    SSLContext sslContext = SSLContext.getInstance("TLS");
    // server keystore
    char[] keystorePassword = keystorePasswordString.toCharArray();
    KeyStore ks = KeyStore.getInstance("JKS");
    ks.load (new FileInputStream(keystoreFile), keystorePassword);
    KeyManagerFactory kmf = KeyManagerFactory.getInstance("SunX509");
    kmf.init (ks, keystorePassword);
    // server truststore
    TrustManagerFactory tmf = TrustManagerFactory.getInstance("SunX509");
    char[] truststorePassword = truststorePasswordString.toCharArray();
    ks.load (new FileInputStream(truststoreFile), truststorePassword);
    tmf.init (ks);
    sslContext.init(kmf.getKeyManagers(), tmf.getTrustManagers(), null);
    // create an anonymous inner class HttpsConfigurator to require client certificate
    HttpsConfigurator configurator = new HttpsConfigurator(sslContext) {
      public void configure (HttpsParameters params) {
        SSLParameters sslParams = getSSLContext().getDefaultSSLParameters();
        sslParams.setNeedClientAuth(true);
        params.setSSLParameters(sslParams);
        }
      };
    httpServer.setHttpsConfigurator(configurator);
    //Create a new context for the given context and handler
    httpServer.createContext(context, this);
    //Create a default executor
    httpServer.setExecutor(null);
    }
  catch (Exception e) {
    e.printStackTrace();
    return null;
    }
  return httpServer;
  } // method CreateHttpServer
// --------------------------------------------
public void handle(HttpExchange t) throws IOException {
  URI uri = t.getRequestURI();
  String response;
  System.out.println ("LocalAddress: " + t.getLocalAddress().toString());
  System.out.println ("RemoteAddress: " + t.getRemoteAddress().toString());
  System.out.println ("URL is: " + uri.toString());
  System.out.println ("Method: " + t.getRequestMethod());
  System.out.println ("Client Certficate: " +
    ((HttpsExchange)t).getSSLSession().getPeerCertificateChain()[0].getSubjectDN());
  if (t.getRequestMethod().equals ("POST")) {
    InputStream is = t.getRequestBody();
    byte[] data = new byte[100000];
    int length = is.read(data);
    if (length == 100000)
      System.out.println ("Warning: the input buffer is FULL!");
    System.out.println ("Request Length: " + length);
    data = java.util.Arrays.copyOf(data, length); // trim the array to the correct size
    System.out.println ("Request Body:[" + new String(data) + "]");
    is.close();
    response = "Give your response here";
    }
  else {
    response = "Error";
    }
  //Set the response header status and length
  t.sendResponseHeaders(HTTP_OK_STATUS, response.getBytes().length);
  //Write the response string
  OutputStream os = t.getResponseBody();
  os.write(response.getBytes());
  os.close();
}
// --------------------------------------------
public static void main(String[] args) throws Exception {
  java_https_server server = new java_https_server();
  System.out.println("Use Ctrl-C (foreground) or \"kill -15 (background)\" to stop me");
  final HttpsServer httpServer = server.CreateHttpServer(server.port, server.context);
  Runtime.getRuntime().addShutdownHook(new Thread() {
    @Override
    public void run() {
      System.out.println("Stopping Server..");
      httpServer.stop(0);
      System.out.println("Server stopped");
      } // run()
    });
  httpServer.start(); // Start the server
  System.out.println("Server is started and listening on port "+ server.port);
  } // method main
} // class java_https_server

Some example runtime output is as follows:
$ java -cp . java_https_server
Use Ctrl-C (foreground) or "kill -15 (background)" to stop me
Server is started and listening on port 8000
LocalAddress: /127.0.0.1:8000
RemoteAddress: localhost/127.0.0.1:52204
URL is: /app
Method: POST
Client Certficate: CN=ccm010, OU=xxx, O=xxx, L=xxx, ST=xxx, C=HK
Request Length: 385
Request Body:[<?xml version='1.0'?><Envelope xmlns='http://schemas.xmlsoap.org/soap/envelope/' xmlns:op='http://schemas.xyz.com/svc' xmlns:ems='http://schemas.xyz.com/ems'><Header>Header_Text</Header><Body><op:AddPbs><ems:ChannelAcctId><ems:ChannelId>06</ems:ChannelId><ems:AcctId>1234567</ems:AcctId></ems:ChannelAcctId></op:AddPbs></Body></Envelope>]
Stopping Server..
Server stopped

I will cover how to test using openssl with client certificate in the next post.

Using openssl to test two way SSL connectivity