2,735 research outputs found
Mouse Simulation Using Two Coloured Tapes
In this paper, we present a novel approach for Human Computer Interaction
(HCI) where, we control cursor movement using a real-time camera. Current
methods involve changing mouse parts such as adding more buttons or changing
the position of the tracking ball. Instead, our method is to use a camera and
computer vision technology, such as image segmentation and gesture recognition,
to control mouse tasks (left and right clicking, double-clicking, and
scrolling) and we show how it can perform everything as current mouse devices
can. The software will be developed in JAVA language. Recognition and pose
estimation in this system are user independent and robust as we will be using
colour tapes on our finger to perform actions. The software can be used as an
intuitive input interface to applications that require multi-dimensional
control e.g. computer games etc.Comment: 5 page
An Integrated Framework for Competitive Multi-channel Marketing of Multi-featured Products
For any company, multiple channels are available for reaching a population in
order to market its products. Some of the most well-known channels are (a) mass
media advertisement, (b) recommendations using social advertisement, and (c)
viral marketing using social networks. The company would want to maximize its
reach while also accounting for simultaneous marketing of competing products,
where the product marketings may not be independent. In this direction, we
propose and analyze a multi-featured generalization of the classical linear
threshold model. We hence develop a framework for integrating the considered
marketing channels into the social network, and an approach for allocating
budget among these channels
Optimal Constrained Wireless Emergency Network Antennae Placement
With increasing number of mobile devices, newly introduced smart devices, and the Internet of things (IoT) sensors, the current microwave frequency spectrum is getting rapidly congested. The obvious solution to this frequency spectrum congestion is to use millimeter wave spectrum ranging from 6 GHz to 300 GHz. With the use of millimeter waves, we can enjoy very high communication speeds and very low latency. But, this technology also introduces some challenges that we hardly faced before. The most important one among these challenges is the Line of Sight (LOS) requirement. In the emergent concept of smart cities, the wireless emergency network is set to use millimeter waves. We have worked on the problem of efficiently finding a line of sight for such wireless emergency network antennae in minimal time. We devised two algorithms, Sequential Line of Sight (SLOS) and Tiled Line of Sight (TLOS), both perform better than traditional algorithms in terms of execution time. The tiled line of sight algorithm reduces the time required for a single line of sight query from 200 ms for traditional algorithms to mere 1.7 ms on average
Classical and consecutive pattern avoidance in rooted forests
Following Anders and Archer, we say that an unordered rooted labeled forest
avoids the pattern if in each tree, each sequence of
labels along the shortest path from the root to a vertex does not contain a
subsequence with the same relative order as . For each permutation
, we construct a bijection between -vertex
forests avoiding and
-vertex forests avoiding ,
giving a common generalization of results of West on permutations and
Anders--Archer on forests. We further define a new object, the forest-Young
diagram, which we use to extend the notion of shape-Wilf equivalence to
forests. In particular, this allows us to generalize the above result to a
bijection between forests avoiding and forests avoiding for . Furthermore, we give recurrences
enumerating the forests avoiding , , and other sets
of patterns. Finally, we extend the Goulden--Jackson cluster method to study
consecutive pattern avoidance in rooted trees as defined by Anders and Archer.
Using the generalized cluster method, we prove that if two length- patterns
are strong-c-forest-Wilf equivalent, then up to complementation, the two
patterns must start with the same number. We also prove the surprising result
that the patterns and are strong-c-forest-Wilf equivalent, even
though they are not c-Wilf equivalent with respect to permutations.Comment: 39 pages, 11 figure
- β¦