10608907
Development and Evaluation of Vision Multiplexing Devices for Vision Impairments
We have proposed a novel concept of vision multiplexing for the visually impaired - superimposing contour images over their natural view of a scene or over original images presented on a TV screen. We have implemented the concept using an optical see-through head mounted display to provide either visual field expansion to patients with peripheral field loss or vision enhancement to patients with central vision loss. We have also implemented the concept in a video player with dynamic magnification for patients with central vision loss. Results of initial testing in the lab and on the street are promising.
13494891
Tracking Telescope Aiming Point for Bioptic Driving Surveillance
Bioptic telescope is a visual aid used by some people with impaired vision for driving and to qualify for licensing. Data on how and when bioptic drivers use the telescope and what they look at with it are important in biop- tic driving studies. A video-based technique to track bioptic drivers' spectacle frames, which represent telescope aiming point, is presented in this paper. With three retro-reflective markers pasted on the bioptic spectacles frame, aiming point is determined from the angles formed by the three markers. Telescope aiming points projected on a scene camera image is calculated by means of interpolation based on a novel calibration method in which a laser pointer is mounted on the spectacle frame. A large number of calibration points are sampled automatically when the driver scans across the scene. Preliminary experiment demonstrated that the average error over a 65° ×48° field was only 0.89 degree.
6802163
Transaction reordering with application to synchronized scans
Traditional workload management methods mainly focus on the current system status while information about the interaction between queued and running transactions is largely ignored. An exception to this is the transaction reordering method, which reorders the transaction sequence submitted to the RDBMS and improves the transaction throughput by considering both the current system status and information about the interaction between queued and running transactions. The existing transaction reordering method only considers the reordering opportunities provided by analyzing the lock conflict information among multiple transactions. This significantly limits the applicability of the transaction reordering method. In this paper, we extend the existing transaction reordering method into a general transaction reordering framework that can incorporate various factors as the reordering criteria. We show that by analyzing the resource utilization information of transactions, the transaction reordering method can also improve the system throughput by increasing the resource sharing opportunities among multiple transactions. We provide a concrete example on synchronized scans and demonstrate the advantages of our method through experiments with a commercial parallel RDBMS.
18530879
Detection of Hidden Information in Webpages Based on Randomness
An effective detection algorithm based on the randomness is devised in this paper for stego-webpages with different steganographies. The parts where secret information embedded in a webpage can generally be represented as two states, which can be described in binary code string. The randomness of the states varies a great deal depending on the webpage part carrying secret information or not. This paper presents a procedure to transform the binary code string into octal string to capture the randomness, from which some statistical features have been discovered. The theoretical description and proof are given that these features can be employed as a criterion to test whether a webpage contains secret information or not. Experiments show that this algorithm can effectively detect the stego-webpages based on letter changing in tags and invisible characters embedding.
30097914
Improved Method for Network Danger Evaluation Based on Immunology Principle
This paper proposes an improved immunological surveillance for network danger evaluation model, focusing on intrusion detection and countermeasures with respect to widely-used networks. An improved intrusion detection mechanism based on self-tolerance, clone selection, and immune surveillance is established. A new network security evaluation method using antibody concentration to quantitatively analyze the degree of intrusion danger level is presented. Additionally, this new hierarchical management framework of the proposed model adopt to improve the detection efficiency and to overcome the shortcoming of the local optimum. The experimental results show that the proposed model is a good solution for network security evaluation.
10289907
Partial Materialized Views
Early access to partial query results is highly desirable during exploration of massive data sets. However, it is challenging to provide transactionally consistent, immediate partial results without significantly increasing queries' execution time. To address this problem, this paper proposes a partial materialized view (PMV) method to cache some of the most frequently accessed results rather than all the possible results. Compared to traditional materialized views, the proposed PMVs do not require maintenance during insertion into base relations, and have much smaller storage and maintenance overhead. Upon the arrival of a query, the RDBMS first searches the PMV and returns to the user the cached partial results. Since a large portion of the PMV is cached in memory, this usually finishes within a millisecond. Then the RDBMS continues to execute the query to find the remaining results. The efficiency of our PMV method is evaluated through a simulation study, a theoretical analysis, and an initial implementation in PostgreSQL.
14863037
Resource-adaptive real-time new event detection
In a document streaming environment, online detection of the first documents that mention previously unseen events is an open challenge. For this online new event detection (ONED) task, existing studies usually assume that enough resources are always available and focus entirely on detection accuracy without considering efficiency. Moreover, none of the existing work addresses the issue of providing an effective and friendly user interface. As a result, there is a significant gap between the existing systems and a system that can be used in practice. In this paper, we propose an ONED framework with the following prominent features. First, a combination of indexing and compression methods is used to improve the document processing rate by orders of magnitude without sacrificing much detection accuracy. Second, when resources are tight, a resource-adaptive computation method is used to maximize the benefit that can be gained from the limited resources. Third, when the new event arrival rate is beyond the processing capability of the consumer of the ONED system, new events are further filtered and prioritized before they are presented to the consumer. Fourth, implicit citation relationships are created among all the documents and used to compute the importance of document sources. This importance information can guide the selection of document sources. We implemented a prototype of our framework on top of IBM's Stream Processing Core middleware. We also evaluated the effectiveness of our techniques on the standard TDT5 benchmark. To the best of our knowledge, this is the first implementation of a real application in a large-scale stream processing system.