There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

다중혈관 관상동맥 환자에서 y-문합을 이용하여 양쪽 내흉동맥만을 사용한 우회술의 조기 성적

[신간의 별자리x] 우리/미술, 그리고 ‘슬픔의 박물관’

Data Mining - Concepts and Techniques.

The term photonic crystals appears because of the analogy between electron waves in crystals and the light waves in artificial periodic dielectric structures. During the recent years the investigation of one-, two-and three-dimensional periodic structures has attracted a widespread attention of the world optics community because of great potentiality of such structures in advanced applied optical fields. The interest in periodic structures has been stimulated by the fast development of semiconductor technology that now allows the fabrication of artificial structures, whose period is comparable with the wavelength of light in the visible and infrared ranges.

http://ieeexplore.ieee.org/iel5/6354/16969/00781867.pdf

Photonic crystals

Plasmonics in Metal-clad Terahertz Waveguides

Recent trend towards cloud computing and outsourcing has led to the requirement for face recognition (FR) to be performed remotely by third-party servers. When outsourcing the FR, client's test image and classification result will be revealed to the servers. Within this context, we propose a novel privacy-preserving (PP) FR algorithm based on randomization. Existing PP FR algorithms are based on homomorphic encryption (HE) which requires higher computational power and communication bandwidth. Since we use randomization, the proposed algorithm outperforms the HE based algorithm in terms of computational and communication complexity.We validated our algorithm using popular ORL database. Experimental results demonstrate that accuracy of the proposed algorithm is the same as the accuracy of existing algorithms, while improving the computational efficiency by 120 times and communication complexity by 2.5 times against the existing HE based approach.

/pdf/hide-and-seek-face-recognition-in-private-470hi9rhsy.pdf

Hide-and-seek: Face recognition in private

The Internet and mobile networks have penetrated the healthcare sector due to their increased functionality, low cost, high reliability and easy-to-use nature. However, in such healthcare environment the privacy and security of the transmitted information must be preserved. When dealing with health sensitive information at times it is vital to protect the patientpsilas identity and their health sensitive information from third parties. In this paper we present a protocol that will authenticate and authorize patients to healthcare services without providing the patientpsilas identification. The protocol protects patientpsilas privacy with a secure anonymous authentication to healthcare services, where the patient has access to a complete set of healthcare services.

/pdf/patient-s-privacy-protection-with-anonymous-access-to-5fpdsvanhu.pdf

Patient’s privacy protection with anonymous access to medical services

In energy constrained wireless sensor networks, it is important that a routing protocol provides network redundancy and reliability at a minimum energy consumption cost. To satisfy these conflicting constraints, wireless sensor networks (WSN) routing protocols generally employ a clustering algorithm in which the entire network does not have to be active at all times. In this paper, we propose a novel graph-theoretic clustering algorithm that exploits cycles in a connected and undirected WSN graph to provide redundancy and reliability in an energy efficient manner. The proposed algorithm also facilitates cluster head rotation for load distribution, thereby extending the network lifetime. Our performance evaluation shows that the proposed algorithm performs better than existing graph- theoretic clustering algorithms.

A Cycle-based Clustering Algorithm for Wireless Sensor Networks

User authentication and capability-based access control approaches have been widely studied in the past. These approaches make the perspective of effortlessly carrying out the authentication and authorization processes non-viable thus limiting their usability in the heterogeneous Internet-of-Things (IoTs). In this paper, we propose an integrated authentication and capability-based access control approach for increased usability in IoT environments. The important characteristic of the approach is that the capability metric generated during authentication is used to perform access control. The proposed approach allows lightweight operations to be performed on IoT devices and computation intensive operations on the cloud server. The security evaluation also shows that the proposed approach is secure against various attack vectors predominant in IoT. The experimental results show that the proposed approach incurs a maximum CPU usage of 29.35%, a maximum memory usage of 2.79% and total computational overhead of 809.26ms in a real IoT testbed which is quite acceptable. The bandwidth requirement for the proposed approach is less because of the comparatively reduced size of the longest message.

Muttukrishnan Rajarajan

Papers

Plasmonics in Metal-clad Terahertz Waveguides

Hide-and-seek: Face recognition in private

Patient’s privacy protection with anonymous access to medical services

A Cycle-based Clustering Algorithm for Wireless Sensor Networks

Authentication and Capability-based Access Control: An Integrated Approach for IoT Environment