Information Spread in the Context of Evacuation OptimizationDr. Mirko Kämpf
Abstract: Our evacuation simulation tool utilizes established algorithms for the emotional and intelligence driven motion of human beings in addition to a simple lattice gas simulation. We analyze the spread of information inside a restricted geometry of a real building and compare these results with the data from a simulation in the free space. We apply the DFA and the RIS statistic to our simulation dataset to detect phases or phase transitions of the whole system. We study the impact of communication technology by comparison of different update algorithms and exit strategies. These results help us to define basic functional requirements to the underlying communication technology and network topology as well as to the needed sensors.
Performance Analysis and Optimal Detection of Spatial Modulationrahulmonikasharma
In this paper, we propose the optimal detector for spatial modulation. The new detector performs significant better than the original (~4 dB gain), and we derive the closed form expression for the average bit error probability. The optimal detector of SM shows performance gain (~1.5 ?3 dB) over popular multiple antenna system, making it an excellent prospect for future wireless communication.
A smart guidance navigation robot using petri net, database location, and rad...journalBEEI
The objective of this research is, to explain a new framework to navigate the movement of the robot towards a target goal. This involves the need for the robot to move from the initial position to 1 out of 30 rooms. Therefore the strategy used involves the combination of the room database stored in the RFID data using the petri net (PN) method to simulate and model the movement of the robot for navigation after which the dynamic behavior of the robot is moving to the desired location was analyzed. The process started from the creation of an environmental map determined by the user followed by modeling through PN and the result was used to produce a marking value which explains and navigates the movement of the robot towards the selected room. The marking value was also used as the database for the robot's movement and later substituted with the RFID to be used as the sensor input in the implementation stage. It was concluded that the robot has the ability to move to the target position according to the database stored in RFID and designed to move forward and turn left and right. For example, it followed the marking value M1 M2 M3M13M12 M11 M10 M9 M8 to Room 1 and M1 M2 M46 M47 to Room 29.
Analyzing the performance of the dynamicIJCNCJournal
In this paper, we are focused to analyse the performance of the two dimensional dynamic
Position Location and Tracking (PL&T) of mobile nodes. The architecture of the dynamic PL&T
is developed based on determining the potential zone of the target node (s) and then tracking
using the triangulation. We assume that the nodes are mobile and have one omnidirectional
antenna per node. The network architecture under consideration is cluster based Mobile Ad Hoc
Network (MANET) where at an instance of time, three nodes are used as reference nodes to track
target node(s) using triangulation method. The novel approach in this PL&T tracking method is
the “a priori” identification of the zone of the target node(s) within a circle with a reasonable
radios, and then placing the three reference nodes for the zone such that a good geometry is
created between the reference nodes and the target nodes to improve the accuracy of
triangulation method. The geometry of the reference nodes’ triangle is closer to equilateral
triangle and all potential target nodes are inside the circle. We establish the fact that when the
target node is moving linearly, the predictive method of zone finding is sufficient to track the
target node accurately. However, when the target node changes the direction, the predictive
method of zone finding will fail and we need to place the three references outside the zone such
that proper geometry with no one angle is less than 30 degrees is maintained to get accurate
PL&T location of the target node at each instance of time. The new zone is always formed for
each instance of time prior to triangulation.
In this paper, we demonstrate the accuracy of integrated zone finding and triangulation for
detecting the PL&T location the node at each instance of time within 1.5 foot accuracy. It should
be noted that as the target node is tracked continuously by applying the integrated zone finding
and triangulation algorithm at different instances of time, one foot accuracy can no longer be
maintained. Periodically, the good PL&T data on each node has to be established by
reinitializing the PL&T locations of the nodes including those that are used as reference nodes.
In this paper, the performance of the dynamic PL&T system is derived using Additive White
Gaussian Noise (AWGN) channel; and using AWGN plus Multi-path fading channel. The impact
of multipath fading on tracking accuracy is analysed using Rician Fading channel for MANET
applications outdoors. Our real time simulations show the PL&T tracking accuracy for the
mobile target nodes in both cases to be within 1.5 foot accuracy.
Educational slides on TRACLUS, an algorithm for clustering trajectory data created by Jae-Gil Lee, Jiawei Han and Kyu-Young Wang, published on SIGMOD’07.
http://web.engr.illinois.edu/~hanj/pdf/sigmod07_jglee.pdf
Information Spread in the Context of Evacuation OptimizationDr. Mirko Kämpf
Abstract: Our evacuation simulation tool utilizes established algorithms for the emotional and intelligence driven motion of human beings in addition to a simple lattice gas simulation. We analyze the spread of information inside a restricted geometry of a real building and compare these results with the data from a simulation in the free space. We apply the DFA and the RIS statistic to our simulation dataset to detect phases or phase transitions of the whole system. We study the impact of communication technology by comparison of different update algorithms and exit strategies. These results help us to define basic functional requirements to the underlying communication technology and network topology as well as to the needed sensors.
Performance Analysis and Optimal Detection of Spatial Modulationrahulmonikasharma
In this paper, we propose the optimal detector for spatial modulation. The new detector performs significant better than the original (~4 dB gain), and we derive the closed form expression for the average bit error probability. The optimal detector of SM shows performance gain (~1.5 ?3 dB) over popular multiple antenna system, making it an excellent prospect for future wireless communication.
A smart guidance navigation robot using petri net, database location, and rad...journalBEEI
The objective of this research is, to explain a new framework to navigate the movement of the robot towards a target goal. This involves the need for the robot to move from the initial position to 1 out of 30 rooms. Therefore the strategy used involves the combination of the room database stored in the RFID data using the petri net (PN) method to simulate and model the movement of the robot for navigation after which the dynamic behavior of the robot is moving to the desired location was analyzed. The process started from the creation of an environmental map determined by the user followed by modeling through PN and the result was used to produce a marking value which explains and navigates the movement of the robot towards the selected room. The marking value was also used as the database for the robot's movement and later substituted with the RFID to be used as the sensor input in the implementation stage. It was concluded that the robot has the ability to move to the target position according to the database stored in RFID and designed to move forward and turn left and right. For example, it followed the marking value M1 M2 M3M13M12 M11 M10 M9 M8 to Room 1 and M1 M2 M46 M47 to Room 29.
Analyzing the performance of the dynamicIJCNCJournal
In this paper, we are focused to analyse the performance of the two dimensional dynamic
Position Location and Tracking (PL&T) of mobile nodes. The architecture of the dynamic PL&T
is developed based on determining the potential zone of the target node (s) and then tracking
using the triangulation. We assume that the nodes are mobile and have one omnidirectional
antenna per node. The network architecture under consideration is cluster based Mobile Ad Hoc
Network (MANET) where at an instance of time, three nodes are used as reference nodes to track
target node(s) using triangulation method. The novel approach in this PL&T tracking method is
the “a priori” identification of the zone of the target node(s) within a circle with a reasonable
radios, and then placing the three reference nodes for the zone such that a good geometry is
created between the reference nodes and the target nodes to improve the accuracy of
triangulation method. The geometry of the reference nodes’ triangle is closer to equilateral
triangle and all potential target nodes are inside the circle. We establish the fact that when the
target node is moving linearly, the predictive method of zone finding is sufficient to track the
target node accurately. However, when the target node changes the direction, the predictive
method of zone finding will fail and we need to place the three references outside the zone such
that proper geometry with no one angle is less than 30 degrees is maintained to get accurate
PL&T location of the target node at each instance of time. The new zone is always formed for
each instance of time prior to triangulation.
In this paper, we demonstrate the accuracy of integrated zone finding and triangulation for
detecting the PL&T location the node at each instance of time within 1.5 foot accuracy. It should
be noted that as the target node is tracked continuously by applying the integrated zone finding
and triangulation algorithm at different instances of time, one foot accuracy can no longer be
maintained. Periodically, the good PL&T data on each node has to be established by
reinitializing the PL&T locations of the nodes including those that are used as reference nodes.
In this paper, the performance of the dynamic PL&T system is derived using Additive White
Gaussian Noise (AWGN) channel; and using AWGN plus Multi-path fading channel. The impact
of multipath fading on tracking accuracy is analysed using Rician Fading channel for MANET
applications outdoors. Our real time simulations show the PL&T tracking accuracy for the
mobile target nodes in both cases to be within 1.5 foot accuracy.
Educational slides on TRACLUS, an algorithm for clustering trajectory data created by Jae-Gil Lee, Jiawei Han and Kyu-Young Wang, published on SIGMOD’07.
http://web.engr.illinois.edu/~hanj/pdf/sigmod07_jglee.pdf
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
A Path Planning Technique For Autonomous Mobile Robot Using Free-Configuratio...CSCJournals
This paper presents the implementation of a novel technique for sensor based path planning of autonomous mobile robots. The proposed method is based on finding free-configuration eigen spaces (FCE) in the robot actuation area. Using the FCE technique to find optimal paths for autonomous mobile robots, the underlying hypothesis is that in the low-dimensional manifolds of laser scanning data, there lies an eigenvector which corresponds to the free-configuration space of the higher order geometric representation of the environment. The vectorial combination of all these eigenvectors at discrete time scan frames manifests a trajectory, whose sum can be treated as a robot path or trajectory. The proposed algorithm was tested on two different test bed data, real data obtained from Navlab SLAMMOT and data obtained from the real-time robotics simulation program Player/Stage. Performance analysis of FCE technique was done with existing four path planning algorithms under certain working parameters, namely computation time needed to find a solution, the distance travelled and the amount of turning required by the autonomous mobile robot. This study will enable readers to identify the suitability of path planning algorithm under the working parameters, which needed to be optimized. All the techniques were tested in the real-time robotic software Player/Stage. Further analysis was done using MATLAB mathematical computation software.
Artificial Intelligence in Robot Path Planningiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Reduction of Azimuth Uncertainties in SAR Images Using Selective RestorationIJTET Journal
Abstract— A framework is proposed for reduction of azimuth uncertainty space borne strip map synthetic aperture radar (SAR) images. In this paper, the azimuth uncertainty in SAR images is identified by using a local average SAR image, system parameter, and a distinct metric derived from azimuth antenna pattern. The distinct metric helps isolate targets lying at locations of uncertainty. The method for restoration of uncertainty regions is selected on the basis of the size of uncertainty regions. A compressive imaging technique is engaged to bring back isolated ambiguity regions (smaller regions of interrelated pixels), clustered regions (relatively bigger regions of interrelated pixels) are filled by using exemplar-based in-painting. The recreation results on a real Terra SAR-X data set established that the proposed method can effectively remove azimuth uncertainties and enhance SAR image quality.
Path Planning for Mobile Robot Navigation Using Voronoi Diagram and Fast Marc...Waqas Tariq
For navigation in complex environments, a robot needs to reach a compromise between the need for having efficient and optimized trajectories and the need for reacting to unexpected events. This paper presents a new sensor-based Path Planner which results in a fast local or global motion planning able to incorporate the new obstacle information. In the first step the safest areas in the environment are extracted by means of a Voronoi Diagram. In the second step the Fast Marching Method is applied to the Voronoi extracted areas in order to obtain the path. The method combines map-based and sensor-based planning operations to provide a reliable motion plan, while it operates at the sensor frequency. The main characteristics are speed and reliability, since the map dimensions are reduced to an almost unidimensional map and this map represents the safest areas in the environment for moving the robot. In addition, the Voronoi Diagram can be calculated in open areas, and with all kind of shaped obstacles, which allows to apply the proposed planning method in complex environments where other methods of planning based on Voronoi do not work.
Real Time Myanmar Traffic Sign Recognition System using HOG and SVMijtsrd
Traffic sign recognition is one of the most important research topics for enabling autonomous vehicle driving systems. In order to be deployed in driving environments, intelligent transport system must be able to recognize and respond to exceptional road conditions such as traffic signs, highway work zones and imminent road works automatically. In this paper, Real time Myanmar Traffic Sign Recognition System RMTSRS is proposed. The incoming video stream is fed into computer vision. Then each incoming frames are segmented using color threshold method for traffic sign detection. A Histogram of Oriented Gradients HOG technique is used to extract the features from the segmented traffic sign and then RMTSRS classifies traffic sign types using Support Vector Machine SVM . The system achieves classification accuracy up to 98 . Myint Tun | Thida Lwin "Real-Time Myanmar Traffic Sign Recognition System using HOG and SVM" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd27929.pdfPaper URL: https://www.ijtsrd.com/computer-science/real-time-computing/27929/real-time-myanmar-traffic-sign-recognition-system-using-hog-and-svm/myint-tun
Camera-Based Road Lane Detection by Deep Learning IIYu Huang
lane detection, deep learning, autonomous driving, CNN, RNN, LSTM, GRU, lane localization, lane fitting, ego lane, end-to-end, vanishing point, segmentation, FCN, regression, classification
Prediction and planning for self driving at waymoYu Huang
ChauffeurNet: Learning To Drive By Imitating The Best Synthesizing The Worst
Multipath: Multiple Probabilistic Anchor Trajectory Hypotheses For Behavior Prediction
VectorNet: Encoding HD Maps And Agent Dynamics From Vectorized Representation
TNT: Target-driven Trajectory Prediction
Large Scale Interactive Motion Forecasting For Autonomous Driving : The Waymo Open Motion Dataset
Identifying Driver Interactions Via Conditional Behavior Prediction
Peeking Into The Future: Predicting Future Person Activities And Locations In Videos
STINet: Spatio-temporal-interactive Network For Pedestrian Detection And Trajectory Prediction
Here we describe federated learning based traffic flow prediction system. In federated learning we solve the problem of data security and also provide collaborative learning. model parameter are shared here ,not data
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
A Path Planning Technique For Autonomous Mobile Robot Using Free-Configuratio...CSCJournals
This paper presents the implementation of a novel technique for sensor based path planning of autonomous mobile robots. The proposed method is based on finding free-configuration eigen spaces (FCE) in the robot actuation area. Using the FCE technique to find optimal paths for autonomous mobile robots, the underlying hypothesis is that in the low-dimensional manifolds of laser scanning data, there lies an eigenvector which corresponds to the free-configuration space of the higher order geometric representation of the environment. The vectorial combination of all these eigenvectors at discrete time scan frames manifests a trajectory, whose sum can be treated as a robot path or trajectory. The proposed algorithm was tested on two different test bed data, real data obtained from Navlab SLAMMOT and data obtained from the real-time robotics simulation program Player/Stage. Performance analysis of FCE technique was done with existing four path planning algorithms under certain working parameters, namely computation time needed to find a solution, the distance travelled and the amount of turning required by the autonomous mobile robot. This study will enable readers to identify the suitability of path planning algorithm under the working parameters, which needed to be optimized. All the techniques were tested in the real-time robotic software Player/Stage. Further analysis was done using MATLAB mathematical computation software.
Artificial Intelligence in Robot Path Planningiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Reduction of Azimuth Uncertainties in SAR Images Using Selective RestorationIJTET Journal
Abstract— A framework is proposed for reduction of azimuth uncertainty space borne strip map synthetic aperture radar (SAR) images. In this paper, the azimuth uncertainty in SAR images is identified by using a local average SAR image, system parameter, and a distinct metric derived from azimuth antenna pattern. The distinct metric helps isolate targets lying at locations of uncertainty. The method for restoration of uncertainty regions is selected on the basis of the size of uncertainty regions. A compressive imaging technique is engaged to bring back isolated ambiguity regions (smaller regions of interrelated pixels), clustered regions (relatively bigger regions of interrelated pixels) are filled by using exemplar-based in-painting. The recreation results on a real Terra SAR-X data set established that the proposed method can effectively remove azimuth uncertainties and enhance SAR image quality.
Path Planning for Mobile Robot Navigation Using Voronoi Diagram and Fast Marc...Waqas Tariq
For navigation in complex environments, a robot needs to reach a compromise between the need for having efficient and optimized trajectories and the need for reacting to unexpected events. This paper presents a new sensor-based Path Planner which results in a fast local or global motion planning able to incorporate the new obstacle information. In the first step the safest areas in the environment are extracted by means of a Voronoi Diagram. In the second step the Fast Marching Method is applied to the Voronoi extracted areas in order to obtain the path. The method combines map-based and sensor-based planning operations to provide a reliable motion plan, while it operates at the sensor frequency. The main characteristics are speed and reliability, since the map dimensions are reduced to an almost unidimensional map and this map represents the safest areas in the environment for moving the robot. In addition, the Voronoi Diagram can be calculated in open areas, and with all kind of shaped obstacles, which allows to apply the proposed planning method in complex environments where other methods of planning based on Voronoi do not work.
Real Time Myanmar Traffic Sign Recognition System using HOG and SVMijtsrd
Traffic sign recognition is one of the most important research topics for enabling autonomous vehicle driving systems. In order to be deployed in driving environments, intelligent transport system must be able to recognize and respond to exceptional road conditions such as traffic signs, highway work zones and imminent road works automatically. In this paper, Real time Myanmar Traffic Sign Recognition System RMTSRS is proposed. The incoming video stream is fed into computer vision. Then each incoming frames are segmented using color threshold method for traffic sign detection. A Histogram of Oriented Gradients HOG technique is used to extract the features from the segmented traffic sign and then RMTSRS classifies traffic sign types using Support Vector Machine SVM . The system achieves classification accuracy up to 98 . Myint Tun | Thida Lwin "Real-Time Myanmar Traffic Sign Recognition System using HOG and SVM" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd27929.pdfPaper URL: https://www.ijtsrd.com/computer-science/real-time-computing/27929/real-time-myanmar-traffic-sign-recognition-system-using-hog-and-svm/myint-tun
Camera-Based Road Lane Detection by Deep Learning IIYu Huang
lane detection, deep learning, autonomous driving, CNN, RNN, LSTM, GRU, lane localization, lane fitting, ego lane, end-to-end, vanishing point, segmentation, FCN, regression, classification
Prediction and planning for self driving at waymoYu Huang
ChauffeurNet: Learning To Drive By Imitating The Best Synthesizing The Worst
Multipath: Multiple Probabilistic Anchor Trajectory Hypotheses For Behavior Prediction
VectorNet: Encoding HD Maps And Agent Dynamics From Vectorized Representation
TNT: Target-driven Trajectory Prediction
Large Scale Interactive Motion Forecasting For Autonomous Driving : The Waymo Open Motion Dataset
Identifying Driver Interactions Via Conditional Behavior Prediction
Peeking Into The Future: Predicting Future Person Activities And Locations In Videos
STINet: Spatio-temporal-interactive Network For Pedestrian Detection And Trajectory Prediction
Here we describe federated learning based traffic flow prediction system. In federated learning we solve the problem of data security and also provide collaborative learning. model parameter are shared here ,not data
Efficient architecture to condensate visual information driven by attention ...Sara Granados Cabeza
This are the slides from my PhD dissertation. I developed a new representation map for visual information (such as disparity, optical flow, etc.) that I've called "semidense" representation. This novel representation reduces the memory and bandwidth needs for embedded platforms and real-time systems.
Preserving Privacy in Semantic-Rich Trajectories of Human MobilityRoberto Trasarti
The increasing abundance of data about the trajectories of
personal movement is opening up new opportunities for analyzing and mining human mobility, but new risks emerge
since it opens new ways of intruding into personal privacy.
Representing the personal movements as sequences of places
visited by a person during her/his movements - semantic
trajectory - poses even greater privacy threats w.r.t. raw
geometric location data. In this paper we propose a privacy model defining the attack model of semantic trajectory
linking, together with a privacy notion, called c-safety. This
method provides an upper bound to the probability of inferring that a given person, observed in a sequence of non-sensitive places, has also stopped in any sensitive location.
Coherently with the privacy model, we propose an algorithm
for transforming any dataset of semantic trajectories into a
c-safe one. We report a study on a real-life GPS trajectory dataset to show how our algorithm preserves interesting
quality/utility measures of the original trajectories, such as
sequential pattern mining results.
Effect of grid adaptive interpolation over depth imagescsandit
A suitable interpolation method is essential to keep the noise level minimum along with the timedelay.
In recent years, many different interpolation filters have been developed for instance
H.264-6 tap filter, and AVS- 4 tap filter. This work demonstrates the effects of a four-tap lowpass
tap filter (Grid-adaptive filter) on a hole-filled depth image. This paper provides (i) a
general form of uniform interpolations for both integer and sub-pixel locations in terms of the
sampling interval and filter length, and (ii) compares the effect of different finite impulse
response filters on a depth-image. Furthermore, the author proposed and investigated an
integrated Grid-adaptive filter, that implement hole-filling and interpolation concurrently,
causes reduction in time-delay noticeably along with high PSNR .
CHANNEL ESTIMATION AND MULTIUSER DETECTION IN ASYNCHRONOUS SATELLITE COMMUNIC...ijwmn
In this paper, we propose a new method of channel estimation for asynchronous additive white Gaussian noise channels in satellite communications. This method is based on signals correlation and multiuser interference cancellation which adopts a successive structure. Propagation delays and signals amplitudes are jointly estimated in order to be used for data detection at the receiver. As, a multiuser detector, a single stage successive interference cancellation (SIC) architecture is analyzed and integrated to the channel estimation technique and the whole system is evaluated. The satellite access method adopted is the direct sequence code division multiple access (DS CDMA) one. To evaluate the channel estimation and the detection technique, we have simulated a satellite uplink with an asynchronous multiuser access.
Balistrocchi, M., Metulini, R., Carpita, M., and Ranzi, R.: Dynamic maps of human exposure to floods based on mobile phone data, Nat. Hazards Earth Syst. Sci. Discuss., https://doi.org/10.5194/nhess-2020-201, in press, 2020
Recent advances in radio and embedded systems for completing the procedure of location estimation most
of the time sensor networks are fully dependent on the distance measurements that is present between the
sensor neighbourhood node. Techniques used for the localization can be categorized differently.
Techniques used for the measurement of the distance between the wireless sensor nodes, dependent upon
the physical means are divided into three broader categories namely Received signal strength (RSS), Angle
of Arrival (AOA) and propagation base on time measurements. This paper discusses the most of the
approached of WSN and IoT based positioning system.
YARCA (Yet Another Raycasting Application) Projectgraphitech
The scope of this project is to extend NASA’s World Wind to make it possible to visualize ray casting not only in intersection with the terrain, but also to consider 3D objects, which we call barriers, that will be hit by rays emitted by other objects which we call transmitters, calculating the coverage area and field of view of the transmitters and showing how the transmission signal is reflected onto the objects’ surfaces.
Trajectory Segmentation and Sampling of Moving Objects Based On Representativ...ijsrd.com
Moving Object Databases (MOD), although ubiquitous, still call for methods that will be able to understand, search, analyze, and browse their spatiotemporal content. In this paper, we propose a method for trajectory segmentation and sampling based on the representativeness of the (sub) trajectories in the MOD. In order to find the most representative sub trajectories, the following methodology is proposed. First, a novel global voting algorithm is performed, based on local density and trajectory similarity information. This method is applied for each segment of the trajectory, forming a local trajectory descriptor that represents line segment representativeness. The sequence of this descriptor over a trajectory gives the voting signal of the trajectory, where high values correspond to the most representative parts. Then, a novel segmentation algorithm is applied on this signal that automatically estimates the number of partitions and the partition borders, identifying homogenous partitions concerning their representativeness. Finally, a sampling method over the resulting segments yields the most representative sub trajectories in the MOD. Our experimental results in synthetic and real MOD verify the effectiveness of the proposed scheme, also in comparison with other sampling techniques.
Graphical Visualization of MAC Traces for Wireless Ad-hoc Networks Simulated ...idescitation
Many network simulators (e.g., ns2) are already
being used for performing wired and wireless network
simulations. But, with the current graphical visualization
support in-built in ns2, it is difficult to understand the node
status, packet status and the MAC level events particularly
for Ad-hoc networks. In this paper, we extend the visualization
support in ns-2 that should help research community in the
area of wireless networks to analyze different MAC level
events in an efficient manner. In particular, we have developed
two types of visualizations namely, temporal and spatial.
Temporal visualization helps to analyze success or failure of
a packet with respect to time while spatial visualization helps
to understand the effects due to proximity of nodes. The trace
is made highly configurable in terms of different attributes
like specific nodes and time duration.
We take some parts of a theoretical mobility model in a two-dimension grid proposed by Greenlaw and
Kantabutra to be our model. The model has eight necessary factors that we commonly use in a mobile
wireless network: sources or wireless signal providers, the directions that a source can move, users or
mobile devices, the given directions which define a user’s movement, the given directions which define a
source’s movement, source’s velocity, source’s coverage, and obstacles. However, we include only the
sources, source’s coverage, and the obstacles in our model. We define SQUARE GRID POINTS COVERAGE
(SGPC) problem to minimize number of sources with coverage radius of one to cover a square grid point
size of p with the restriction that all the sources must be communicable and proof that SGPC is in NPcomplete
class. We also give an APPROX-SQUARE-GRID-COVERAGE (ASGC) algorithm to compute the
approximate solution of SGPC. ASGC uses the rule that any number can be obtained from the addition of
3, 4 and 5 and then combines 3-gadgets, 4-gadgets and 5-gadgets to specify the position of sources to cover
a square grid point size of p. We find that the algorithm achieves an approximation ratio of
2
1 2 10 2
p
p .
Moreover, we state about the extension usage of our algorithm and show some examples. We show that if
we use ASPC on a square grid size of p and if sources can be moved, the area under the square grid can be
covered in eight-time-steps movement. We also prove that if we extend our source coverage radius to 1.59,
without any movement the area under the square gird will also be covered. Further studies are also
discussed and a list of some tentative problems is given in the conclusion.
Presentation of a geotagging approach for social media content with a refined language modelling approach. Presented at PAISI workshop, co-located with PA-KDD 2015, Ho Chi Minh City, Vietnam
Geotagging Social Media Content with a Refined Language Modelling ApproachSymeon Papadopoulos
Presentation of a geotagging approach for social media content with a refined language modelling approach. Presented at PAISI workshop, co-located with PA-KDD 2015, Ho Chi Minh City, Vietnam
Steganography is the art and science of hiding the
existence of information. In computer-based steganography,
several forms of digital media may be used as “cover” for hidden
information. Photos, documents, web pages and even MP3 music
files may all serve as innocuous looking hosts for secret messages.
In this paper, we generate a ECG signal of patient and hide this
ECG signal in the image of patient i.e. patient photo is used as a
cover for hiding the ECG signal. Steganography is done using the
Contourlet transform. To hide the data in image Singular Value
Decomposition (SVD) is used. The contourlet transform provides
higher correlation coefficient. The results are comparing with the
wavelet transform. The proposed system provides a better PSNR
value than the wavelet transform.
Ijri ece-01-02 image enhancement aided denoising using dual tree complex wave...Ijripublishers Ijri
This paper presents a novel way to reduce noise introduced or exacerbated by image enhancement methods, in particular algorithms based on the random spray sampling technique, but not only. According to the nature of sprays, output images of spray-based methods tend to exhibit noise with unknown statistical distribution. To avoid inappropriate assumptions on the statistical characteristics of noise, a different one is made. In fact, the non-enhanced image is considered to be either free of noise or affected by non-perceivable levels of noise. Taking advantage of the higher sensitivity of the human visual system to changes in brightness, the analysis can be limited to the luma channel of both the non-enhanced and enhanced image. Also, given the importance of directional content in human vision, the analysis is performed through the dual-tree complex wavelet transform , lanczos interpolator and edge preserving smoothing filters. Unlike the discrete wavelet transform, the DTWCT allows for distinction of data directionality in the transform space. For each level of the transform, the standard deviation of the non-enhanced image coefficients is computed across the six orientations of the DTWCT, then it is normalized.
Keywords: dual-tree complex wavelet transform (DTWCT), lanczos interpolator, edge preserving smoothing filters.
LEARNING FINGERPRINT RECONSTRUCTION: FROM MINUTIAE TO IMAGENexgen Technology
bulk ieee projects in pondicherry,ieee projects in pondicherry,final year ieee projects in pondicherry
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
Data collection scheme for wireless sensor network with mobile collectorijwmn
In this paper, we investigate the problem of designing the minimum number of required mobile elements
tours such that each sensor node is either on the tour or one hop away from the tour, and the length of the
tour to be bounded by pre-determined value L. To address this problem, we propose heuristic-based
solution. This solution works by directing the mobile element tour towards the highly dense area in the
network. The experiment results show that our scheme outperform the benchmark scheme by 10% in most
scenarios.
The Quality of the New Generator Sequence Improvent to Spread the Color Syste...TELKOMNIKA JOURNAL
This paper shows a new technic applicable for the digital devices that are the result of the finite’s
effect precision in the chaotic dynamics used in the coupled technic and the chaotic map’s perturbation
technics used for the generation of a Pseudo-Random Number Generator (PRNGs).The use of the
pseudo- chaotic sequences coupled to the orbit perturbation method in the chaotic logistic map and the
NewPiece-Wise Linear Chaotic Map (NPWLCM). The pseudo random number generator’s originality
proposed from the perturbation of the chaotic recurrence. Furthermore the outputs of the binary sequences
with NPWLCM are reconstructed conventionally with the Bernoulli’s sequences shifts map to change the
shapes with the bitwise permetation then the results in simulation are shown in progress.After being
perturbed, the chaotic system can generate the chaotic binary sequences in uniform distribution and the
statistical properties invulnerable analysis. This generator also has many advantages in the possible useful
applications of spread spectrum digitalimages, such as sensitive secret keys, random uniform distribution
of pixels in Crypto system in secure and synchronize communication.
1. Anna Monreale Fabio Pinelli Roberto Trasarti Fosca Giannotti A. Monreale, F. Pinelli, R. Trasarti, F. Giannotti. WhereNext: a Location Predictor on Trajectory Pattern Mining . KDD 2009 Knowledge Discovery and Delivery Lab (ISTI-CNR & Univ. Pisa) www-kdd.isti.cnr.it
2.
3.
4.
5.
6.
7. Select the set of interesting trajectories Validation Evaluation Extract T-Patterns (A set of Local models) Merge T-Patterns (Global model) Use the Condensed model as predictor