@conference {14035,
	title = {Automatic position calibration of multiple microphones},
	booktitle = {Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP {\textquoteright}04). IEEE International Conference on},
	volume = {4},
	year = {2004},
	month = {2004/05//},
	pages = {iv-69 - iv-72 vol.4 - iv-69 - iv-72 vol.4},
	abstract = {We describe a method to determine automatically the relative three dimensional positions of multiple microphones using at least five loudspeakers in unknown positions. The only assumption we make is that there is a microphone which is very close to a loudspeaker. In our experimental setup, we attach one microphone to each loudspeaker. We derive the maximum likelihood estimator and the solution turns out to be a non-linear least squares problem. A closed form solution which can be used as the initial guess for the minimization routine is derived. We also derive an approximate expression for the covariance of the estimator using the implicit function theorem. Using this, we analyze the performance of the estimator with respect to the positions of the loudspeakers. The algorithm is validated using both Monte-Carlo simulations and a real-time experimental setup.},
	keywords = {approximations;, array, audio, AUTOMATIC, calibration;, closed, covariance;, dimensional, estimation;, form, function, implicit, least, likelihood, loudspeakers;, maximum, microphone, microphones;, minimisation;, minimization;, multiple, nonlinear, position, positions;, problem;, processing;, signal, solution;, squares, theorem;, three},
	doi = {10.1109/ICASSP.2004.1326765},
	author = {Raykar,V.C. and Duraiswami, Ramani}
}
@article {18193,
	title = {Data hiding in image and video .I. Fundamental issues and solutions},
	journal = {Image Processing, IEEE Transactions on},
	volume = {12},
	year = {2003},
	month = {2003/06//},
	pages = {685 - 695},
	abstract = {We address a number of fundamental issues of data hiding in image and video and propose general solutions to them. We begin with a review of two major types of embedding, based on which we propose a new multilevel embedding framework to allow the amount of extractable data to be adaptive according to the actual noise condition. We then study the issues of hiding multiple bits through a comparison of various modulation and multiplexing techniques. Finally, the nonstationary nature of visual signals leads to highly uneven distribution of embedding capacity and causes difficulty in data hiding. We propose an adaptive solution switching between using constant embedding rate with shuffling and using variable embedding rate with embedded control bits. We verify the effectiveness of our proposed solutions through analysis and simulation.},
	keywords = {adaptive, analysis;, bits;, colour, condition;, constant, CONTROL, data, embedded, EMBEDDING, embedding;, encapsulation;, extractable, hiding;, image, Modulation, modulation;, multilevel, multiplexing, multiplexing;, NOISE, nonstationary, processing;, rate;, reviews;, shuffling;, signal, signals;, simulation;, solution;, techniques;, variable, video, visual},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2003.810588},
	author = {M. Wu and Liu,Bede}
}
@article {15399,
	title = {Perturbation technique for LLG dynamics in uniformly magnetized bodies subject to RF fields},
	journal = {Magnetics, IEEE Transactions on},
	volume = {38},
	year = {2002},
	month = {2002/09//},
	pages = {2403 - 2405},
	abstract = {The problem of magnetization dynamics of a uniformly magnetized uniaxial particle or film, under elliptically polarized applied field, is considered. In the special case of circularly polarized applied field and particles (films) with a symmetry axis, pure time-harmonic magnetization modes exist that can be computed analytically. Deviations from these highly symmetric conditions are treated as perturbation of the symmetric case. The perturbation technique leads to the exactly solvable system of linear differential equations for the perturbations which enables one to compute higher order magnetization harmonic. The analytical solutions are obtained and then compared with numerical results.},
	keywords = {analytical, anisotropy, anisotropy;, applied, bodies;, circularly, component;, constant-in-time, constant;, damping, demagnetisation;, demagnetizing, differential, dynamics;, effective, elliptically, equation;, equations;, exactly, factors;, field;, film;, films;, Frequency, gyromagnetic, harmonic;, higher, Landau-Lifshitz-Gilbert, large, linear, magnetic, magnetisation;, magnetization, magnetization;, magnetized, modes;, MOTION, order, partial, particle;, particles;, perturbation, polarized, radio, ratio;, RF, saturation, solution;, solvable, system;, technique;, techniques;, thin, time-harmonic, uniaxial, uniformly},
	isbn = {0018-9464},
	doi = {10.1109/TMAG.2002.803596},
	author = {Bertotti,G. and Mayergoyz, Issak D and Serpico,C.}
}
@conference {12306,
	title = {Scalable peer finding on the Internet},
	booktitle = {Global Telecommunications Conference, 2002. GLOBECOM {\textquoteright}02. IEEE},
	volume = {3},
	year = {2002},
	month = {2002/11//},
	pages = {2205 - 2209 vol.3 - 2205 - 2209 vol.3},
	abstract = {We consider the problem of finding nearby application peers over the Internet. We define a new peer-finding scheme (called Tiers) that scales to large application peer groups. Tiers creates a hierarchy of the peers, which allows an efficient and scalable solution to this problem. The scheme can be implemented entirely in the application-layer and does not require the deployment of either any additional measurement services, or well-known reference landmarks in the network. We present detailed evaluation of Tiers and compare it to one previously proposed scheme called Beaconing. Through analysis and detailed simulations on 10,000 node Internet-like topologies we show that Tiers achieves comparable or better performance with a significant reduction in control overheads for groups of size 32 or more.},
	keywords = {application, application-layer;, Beaconing;, CONTROL, finding;, Internet-like, Internet;, measurement, network, overhead, peer, peer-finding, peers;, protocol;, protocols;, reduction;, scalable, scheme;, services;, simulations;, solution;, Tiers;, topologies;, topology;},
	doi = {10.1109/GLOCOM.2002.1189023},
	author = {Banerjee,S. and Kommareddy,C. and Bhattacharjee, Bobby}
}
