Wireless Sensor Networks for Organizational Network Analysis

Since their emergence, wireless sensor networks (WSNs) have become increasingly popular in the pervasive computing industry. This is particularly true within the past five years, which has seen sensor networks being adapted for wide variety of applications. Most of these applications are restricted to ambience monitoring and military use, however, very few commercial sensor applications have been explored till date. For WSNs to be truly ubiquitous, many more commercial sensor applications are yet to be investigated. As an effort to probe for such an application, we explore the potential of using WSNs in the field of Organizational Network Analysis (ONA). In this short paper, we propose a WSN based framework for analyzing organizational networks. We describe the role of WSNs in learning relationships among the people of an organization and investigate the research challenges involved in realizing the proposed framework.

Self Assessment-Based Decision Making for Multiagent Cooperative Search

This paper addresses a search problem with multiple limited capability search agents in a partially connected dynamical networked environment under different information structures. A self assessment-based decision-making scheme for multiple agents is proposed that uses a modified negotiation scheme with low communication overheads. The scheme has attractive features of fast decision-making and scalability to large number of agents without increasing the complexity of the algorithm. Two models of the self assessment schemes are developed to study the effect of increase in information exchange during decision-making. Some analytical results on the maximum number of self assessment cycles, effect of increasing communication range, completeness of the algorithm, lower bound and upper bound on the search time are also obtained. The performance of the various self assessment schemes in terms of total uncertainty reduction in the search region, using different information structures is studied. It is shown that the communication requirement for self assessment scheme is almost half of the negotiation schemes and its performance is close to the optimal solution. Comparisons with different sequential search schemes are also carried out. Note to Practitioners-In the futuristic military and civilian applications such as search and rescue, surveillance, patrol, oil spill, etc., a swarm of UAVs can be deployed to carry out the mission for information collection. These UAVs have limited sensor and communication ranges. In order to enhance the performance of the mission and to complete the mission quickly, cooperation between UAVs is important. Designing cooperative search strategies for multiple UAVs with these constraints is a difficult task. Apart from this, another requirement in the hostile territory is to minimize communication while making decisions. This adds further complexity to the decision-making algorithms. In this paper, a self-assessment-based decision-making scheme, for multiple UAVs performing a search mission, is proposed. The agents make their decisions based on the information acquired through their sensors and by cooperation with neighbors. The complexity of the decision-making scheme is very low. It can arrive at decisions fast with low communication overheads, while accommodating various information structures used for increasing the fidelity of the uncertainty maps. Theoretical results proving completeness of the algorithm and the lower and upper bounds on the search time are also provided.

An Empirical Study of Synthesis of Multiple State Devices by Engineering Designers

Automated synthesis of mechanical designs is an important step towards the development of an intelligent CAD system. Research into methods for supporting conceptual design using automated synthesis has attracted much attention in the past decades. The research work presented here is based on an empirical study of the process of synthesis of multiple state mechanical devices. As a background to the work, the paper explores concepts of what mechanical device, state, single state and multiple state are, and in the context of the above observational studies, attempts to identify the outstanding issues for supporting multiple state synthesis of mechanical devices.

Efficient space-time codes from cyclic division algebras

An overview of space-time code construction based on cyclic division algebras (CDA) is presented. Applications of such space-time codes to the construction of codes optimal under the diversity-multiplexing gain (D-MG) tradeoff, to the construction of the so-called perfect space-time codes, to the construction of optimal space-time codes for the ARQ channel as well as to the construction of codes optimal for the cooperative relay network channel are discussed. We also present a construction of optimal codes based on CDA for a class of orthogonal amplify and forward (OAF) protocols for the cooperative relay network

Shape and size mimicry in the design of ternary molecular solids: towards a robust strategy for crystal engineering

2- and 5-methylresorcinol form co-crystals with 4,4'-bipyridine in which some of the bipyridine molecules are loosely bound. These molecules can be replaced with other molecules of a similar shape and size to give a general method for the engineering of a ternary co-crystal.

Phenylboronic acids in crystal engineering: Utility of the energetically unfavorable syn,syn-conformation in co-crystal design

Phenylboronic acids can exist, in principle, in three different conformers (syn,syn; syn,anti and anti,anti) with distinct energy profiles. In their native state, these compounds prefer the energetically favored syn, anti-conformation. In molecular complexes, however, the functionality exhibits conformational diversity. In this paper we report a series of co-crystals, with N-donor compounds, prepared by a design strategy involving the synthons based on the syn, syn-conformation of the boronic acid functionality. For this purpose, we employed compounds with the 1,2-diazo fragment (alprazolam, 1H-tetrazole, acetazolamide and benzotriazole), 1,10-phenanthroline and 2,2'-bipyridine for the co-crystallization experiments. However, our study shows that the mere presence of the 1,2-diazo fragment in the coformer does not guarantee the successful formation of co-crystals with a syn, syn-conformation of the boronic acid. [GRAPHICS] The -B(OH)(2) fragment makes unsymmetrical O-H center dot center dot center dot N heterosynthons with alprazolam (ALP) and 1,10-phenanthroline (PHEN). In the co-crystals of phenylboronic acids with 1H-tetrazole (TETR) and 2,2'-bipyridine (BPY), the symmetrical boronic acid dimer is the major synthon. In the BPY complex, boronic acid forms linear chains and the pyridine compound interacts with the lateral OH of boronic acid dimers that acts as a connector, thus forming a ladder structure. In the TETR complex, each heterocycle interacts with three boronic acids. While two boronic acids interact using the phenolic group, the third molecule generates O-H center dot center dot center dot N hydrogen bonds using the extra OH group, of -B(OH)(2) fragment, left after the dimer formation. Thus, although molecules were selected retrosynthetically with the 1,2-diazo fragment or with nearby hetero-atoms to induce co-crystal formation using the syn,syn-orientation of the -B(OH)(2) functionality, co-crystal formation is in fact selective and is probably driven by energy factors. Acetazolamide (ACET) contains self-complementary functional groups and hence creates stable homosynthons. Phenylboronic acids being weak competitors fail to perturb the homosynthons and hence the components crystallize separately. Therefore, besides the availability of possible hydrogen bond acceptors in the required position and orientation, the ability of the phenyl-boronic acid to perturb the existing interactions is also a prerequisite to form co-crystals. This is illustrated in the table below. In the case of ALP, PHEN and BPY, the native structures are stabilized by weak interactions and may be influenced by the boronic acid fragment. Thus phenylboronic acids can attain co-crystals with those compounds, wherein the cyclic O-H center dot center dot center dot N hydrogen bonds are stronger than the individual homo-interactions. This can lower the lattice energy of the molecular complex as compared with the individual crystals. [GRAPHICS] Phenylboronic acids show some selectivity in the formation of co-crystals with N-heterocycles. The differences in solubility of the components fall short to provide a possible reason for the selective formation of co-crystals only with certain compounds. These compounds, being weak acids, do not follow the Delta pK(a) analysis and hence fail to provide any conclusive observation. Theoretical results show that of the three conformers possible, the syn,anti conformer is the most stable. The relative stabilities of the three conformers syn,anti,syn,syn and anti,anti are 0.0, 2.18 and 3.14 kcal/mol, respectively. The theoretical calculations corroborate the fact that only energetically favorable synthons can induce the formation of heterosynthons, as in ALP and PHEN complexes. From a theoretical and structural analysis it is seen that phenylboronic acids will form interactions with those molecules wherein the heterocyclic and acidic fragments can interrupt the homosynthons. However, the energy profile is shallow and can be perturbed easily by the presence of competing functional groups (such as OH and COOH) in the vicinity. [GRAPHICS] .

Error, Confidence, and Cost in Engineering Computations

The questions that one should answer in engineering computations - deterministic, probabilistic/randomized, as well as heuristic - are (i) how good the computed results/outputs are and (ii) how much the cost in terms of amount of computation and the amount of storage utilized in getting the outputs is. The absolutely errorfree quantities as well as the completely errorless computations done in a natural process can never be captured by any means that we have at our disposal. While the computations including the input real quantities in nature/natural processes are exact, all the computations that we do using a digital computer or are carried out in an embedded form are never exact. The input data for such computations are also never exact because any measuring instrument has inherent error of a fixed order associated with it and this error, as a matter of hypothesis and not as a matter of assumption, is not less than 0.005 per cent. Here by error we imply relative error bounds. The fact that exact error is never known under any circumstances and any context implies that the term error is nothing but error-bounds. Further, in engineering computations, it is the relative error or, equivalently, the relative error-bounds (and not the absolute error) which is supremely important in providing us the information regarding the quality of the results/outputs. Another important fact is that inconsistency and/or near-consistency in nature, i.e., in problems created from nature is completely nonexistent while in our modelling of the natural problems we may introduce inconsistency or near-inconsistency due to human error or due to inherent non-removable error associated with any measuring device or due to assumptions introduced to make the problem solvable or more easily solvable in practice. Thus if we discover any inconsistency or possibly any near-inconsistency in a mathematical model, it is certainly due to any or all of the three foregoing factors. We do, however, go ahead to solve such inconsistent/near-consistent problems and do get results that could be useful in real-world situations. The talk considers several deterministic, probabilistic, and heuristic algorithms in numerical optimisation, other numerical and statistical computations, and in PAC (probably approximately correct) learning models. It highlights the quality of the results/outputs through specifying relative error-bounds along with the associated confidence level, and the cost, viz., amount of computations and that of storage through complexity. It points out the limitation in error-free computations (wherever possible, i.e., where the number of arithmetic operations is finite and is known a priori) as well as in the usage of interval arithmetic. Further, the interdependence among the error, the confidence, and the cost is discussed.

Unusual co-crystal of isonicotinamide: the structural landscape in crystal engineering

The idea of a structural landscape is based on the fact that a large number of crystal structures can be associated with a particular organic molecule. Taken together, all these structures constitute the landscape. The landscape includes polymorphs, pseudopolymorphs and solvates. Under certain circumstances, it may also include multicomponent crystals (or co-crystals) that contain the reference molecule as one of the components. Under still other circumstances, the landscape may include the crystal structures of molecules that are closely related to the reference molecule. The idea of a landscape is to facilitate the understanding of the process of crystallization. It includes all minima that can, in principle, be accessed by the molecule in question as it traverses the path from solution to the crystal. Isonicotinamide is a molecule that is known to form many co-crystals. We report here a 2 : 1 co-crystal of this amide with 3,5-dinitrobenzoic acid, wherein an unusual N-H center dot center dot center dot N hydrogen-bonded pattern is observed. This crystal structure offers some hints about the recognition processes between molecules that might be implicated during crystallization. Also included is a review of other recent results that illustrate the concept of the structural landscape.

Crystal Engineering in the Desiraju Research Group in Bangalore

Over the years, crystal engineering has transformed into a mature and multidisciplinary subject. New understanding, challenges, and opportunities have emerged in the design of complex structures and structure-property evaluation. Revolutionary pathways adopted by many leaders have shaped and directed this subject. In this short essay to celebrate the 60th birthday of Prof. Gautam R. Desiraju, we, his current research group members, contemplate the development of some of the topics explored by our group in the context of the overall subject. These topics, though not entirely new, are of significant interest to the crystal engineering community.

Demonstrating the Usefulness of CAELinux for Computer Aided Engineering using an Example of the Three Dimensional Reconstruction of a Pig Liver

CAELinux is a Linux distribution which is bundled with free software packages related to Computer Aided Engineering (CAE). The free software packages include software that can build a three dimensional solid model, programs that can mesh a geometry, software for carrying out Finite Element Analysis (FEA), programs that can carry out image processing etc. Present work has two goals: 1) To give a brief description of CAELinux 2) To demonstrate that CAELinux could be useful for Computer Aided Engineering, using an example of the three dimensional reconstruction of a pig liver from a stack of CT-scan images. One can note that instead of using CAELinux, using commercial software for reconstructing the liver would cost a lot of money. One can also note that CAELinux is a free and open source operating system and all software packages that are included in the operating system are also free. Hence one can conclude that CAELinux could be a very useful tool in application areas like surgical simulation which require three dimensional reconstructions of biological organs. Also, one can see that CAELinux could be a very useful tool for Computer Aided Engineering, in general.

Multiuser detection in large-dimension multicode MIMO-CDMA systems with higher-order modulation

In this paper, we are interested in high spectral efficiency multicode CDMA systems with large number of users employing single/multiple transmit antennas and higher-order modulation. In particular, we consider a local neighborhood search based multiuser detection algorithm which offers very good performance and complexity, suited for systems with large number of users employing M-QAM/M-PSK. We apply the algorithm on the chip matched filter output vector. We demonstrate near-single user (SU) performance of the algorithm in CDMA systems with large number of users using 4-QAM/16-QAM/64-QAM/8-PSK on AWGN, frequency-flat, and frequency-selective fading channels. We further show that the algorithm performs very well in multicode multiple-input multiple-output (MIMO) CDMA systems as well, outperforming other linear detectors and interference cancelers reported in the literature for such systems. The per-symbol complexity of the search algorithm is O(K2n2tn2cM), K: number of users, nt: number of transmit antennas at each user, nc: number of spreading codes multiplexed on each transmit antenna, M: modulation alphabet size, making the algorithm attractive for multiuser detection in large-dimension multicode MIMO-CDMA systems with M-QAM.