In multicore environment, using multiple threads is a common useful approach to improve application performance. Nevertheless, even in many simple applications, the performance might degrade when the number of threads...
详细信息
In this paper, we propose a new patch-based texture synthesis method. The core of the proposed method consists of two main components: (1) a feature-weighted similarity measurement to search for the best match and (2)...
详细信息
In this paper, we propose a new patch-based texture synthesis method. The core of the proposed method consists of two main components: (1) a feature-weighted similarity measurement to search for the best match and (2) a dynamically prioritized-based pixel re-synthesis to reduce discontinuity at the boundary of adjacent patches. Examples and experimental comparisons with other previous methods are demonstrated to verify the usefulness of our proposed method. In addition, we enhance the proposed method with a view warping technique to better synthesize non-frontal-parallel textures (NFPTs) that can not be synthesized well by traditional texture synthesis methods.
Efficient rendering of complex scenes has receive great attention in real-time computer graphics. Current researches are mostly concentrated on reducing the geometric complexity of the scene model such as reconstructi...
详细信息
Efficient rendering of complex scenes has receive great attention in real-time computer graphics. Current researches are mostly concentrated on reducing the geometric complexity of the scene model such as reconstructing an LOD representation, performing visibility culling etc. However, the rendering process of complex scenes involves not only the geometric information of each object, but also multiple attributes, including lighting, material, texture, etc. The invocation of each attribute corresponds to a specific state in the rendering pipeline, frequent transfer between different states in the pipeline will introduce large amount of overhead, hence reducing the rendering efficiency. A rendering method accounting for efficient invocation of multiple attributes of objects based on state transition optimization strategies is presented. It estimates the cost for invoking each attribute of objects in the rendering pipeline and expresses the transitions between various render states as a weighted directed graph. Then the optimized sequence of state transition is obtained by optimization. Experimental results show that our proposed method can effectively reduce the overhead of state transition and improve the rendering efficiency of scenes containing large amounts of multi-attribute objects.
We present the results of a data mining research on the use of GPS positions and speed of travel of vehicles in urban areas to determine optimal travel routes for emergency vehicles. A new approach using predictive pr...
详细信息
We present the results of a data mining research on the use of GPS positions and speed of travel of vehicles in urban areas to determine optimal travel routes for emergency vehicles. A new approach using predictive programming is presented. The approach focuses on using data mining of existing data as the key factor in the application logic where various decisions are to be made. The main appeal of such an approach is that the application logic evolves over time according to the application data. As the data changes the decisions soon follow. This gives the impression of intelligent behavior of the application.
With our society more information-driven, we have begun to distribute data in wide-area storage systems. At the same time, both physical failure and logic error have made it difficult to bring the necessary recovery t...
详细信息
ISBN:
(纸本)9780769537474
With our society more information-driven, we have begun to distribute data in wide-area storage systems. At the same time, both physical failure and logic error have made it difficult to bring the necessary recovery to bear on remote data disaster, and understanding this proceeding. We describe ARRAY, a system architecture for data disaster recovery that combines reliability, storage space, and security to improve performance for data recovery applications. The paper presents an exhaustive analysis of the design space of ARRAY systems, focusing on the trade-offs between reliability, storage space, security, and performance that ARRAY must make. We present RSRAII (Replication-based Snapshot Redundant Array of Independent Imagefiles) which is a configurable RAIDlike data erasure-coding, and also others benefits come from consolidation both erasure-coding and replication strategies. A novel algorithm is proposed to improve snapshot performance referred to as SMPDP (Snapshot based on Multi-Parallel Degree Pipeline).
Microdevices have recently been developed by various micromachining technologies such as laser cutting, lithography, etc. PTFE is widely used as a microwave and millimeter-wave material. However, it is known that PTFE...
详细信息
Event log is the important starting point of any process analysis technique. Existent business process analysis techniques are applied mainly to manual or simulated logs, considering mainly information about control p...
详细信息
In the growing need for information we have come to rely on search engines. The use of large scale search engines, such as Google, is as common as surfing the World Wide Web. We are impressed with the capabilities of ...
详细信息
In the growing need for information we have come to rely on search engines. The use of large scale search engines, such as Google, is as common as surfing the World Wide Web. We are impressed with the capabilities of these search engines but still there is a need for improvment. A common problem with searching is the ambiguity of words. Their meaning often depends on the context in which they are used or varies across specific domains. To resolve this we propose a domain specific search engine that is globally oriented. We intend to provide content classification according to the target domain concepts, access to privileged information, personalization and custom ranking functions. Domain specific concepts have been formalized in the form of ontology. The paper describes our approach to a centralized search service for domain specific content. The approach uses automated indexing for various content sources that can be found in the form of a relational database, web service, web portal or page, various document formats and other structured or unstructured data. The gathered data is tagged with various approaches and classified against the domain classification. The indexed data is accessible through a highly optimized and personalized search service.
A 1.3 pJ/b inductive coupling transceiver is proposed for Cm-range multimedia data transmission in mobile device applications. Its transmission time control (TTC) scheme and adaptive gain control (AGC) scheme reduce t...
详细信息
A 1.3 pJ/b inductive coupling transceiver is proposed for Cm-range multimedia data transmission in mobile device applications. Its transmission time control (TTC) scheme and adaptive gain control (AGC) scheme reduce the energy consumption below to 1.3 pJ/b. Inductor with self-resonance frequency above 200 MHz achieves the data rate over 50 Mbps. The receiver sensitivity can be enhanced to increase the communication distance up to 7 cm by relative magnitude comparison between two nodes of the receiver inductor. The transceiver consumes only 65 ¿W in total with 1 V supply.
In this paper a cumulant-based method for identification of gait using accelerometer data is presented. Acceleration data of three different walking speeds (slow, normal and fast) for each subject was acquired by the ...
详细信息
In this paper a cumulant-based method for identification of gait using accelerometer data is presented. Acceleration data of three different walking speeds (slow, normal and fast) for each subject was acquired by the accelerometer embedded in cell phone which was attached to the person's hip. Data analysis was based on gait cycles that were detected first. Cumulants of order from 1 to 4 with different number of lags were calculated. Feature vectors for classification were built using dimension reduction on calculated cumulants by principal component analysis (PCA). The classification was accomplished by support vector machines (SVM) with radial basis kernel. According to portion of variance covered in the calculated principal components, different lengths of feature vectors were tested. Six healthy young subjects participated in the experiment. The average person recognition rate based on gait classification was 90.3±3.2%. A similarity measure for discerning different walking types of the same subject was also introduced using dimension reduction on accelerometer data by PCA.
暂无评论