68 results on '"Wu, Dan"'
Search Results
2. An Efficient Randomized Low-Rank Matrix Factorization with Application to Robust PCA
- Author
-
Maboud F. Kaloorazi, Li Fei, Wu Dan, and Jie Chen
- Subjects
Signal processing ,Factorization ,Computer science ,Robustness (computer science) ,Approximation algorithm ,Iterative reconstruction ,Supercomputer ,Robust principal component analysis ,Algorithm ,Physics::Geophysics ,Matrix decomposition - Abstract
Low-rank matrix factorization algorithms using the randomized sampling paradigm have recently gained momentum, owing to their computational efficiency, high accuracy, robustness, and efficient parallelization. This paper presents a randomized factorization algorithm tailored for low-rank matrices, called Randomized Partial UTV (RaP-UTV) factorization. RaP-Utvis efficient in arithmetic operations, and can harness the parallel structure of advanced computational platforms. The effectiveness of RaP-Utvis demonstrated through synthetic and real-world data. Applications treated in this work include image reconstruction and robust principal component analysis. The results of RaP-UTV are compared with those of multiple algorithms from the literature.
- Published
- 2021
3. A Randomized Algorithm for Approximating Truncated SVD
- Author
-
Wu Dan, Guowang Gao, and Maboud F. Kaloorazi
- Subjects
Numerical linear algebra ,Matrix (mathematics) ,Rank (linear algebra) ,Computer science ,Dimensionality reduction ,Singular value decomposition ,Decomposition (computer science) ,Leverage (statistics) ,computer.software_genre ,computer ,Algorithm ,Randomized algorithm - Abstract
Matrices with low-rank structure are frequently encountered in a myriad of application domains, due to Big Data generation and consumption. Low-rank matrix decomposition algorithms, such as the truncated singular value decomposition (TSVD), play a pivotal role in processing and extracting patterns of such data matrices. We present in this work an algorithm termed Randomized Rank-k QLP (RR-QLP). It utilizes randomization and efficiently constructs a low-rank decomposition of an input matrix, thus providing an approximation to the TSVD. Its advantage over TSVD, however, is that RR-QLP is computationally more efficient and can leverage the parallel structure of modern computers, thereby tackling a major bottle- neck associated with TSVD. To show the effectiveness of RR-QLP, different classes of data matrices are treated and the results are compared with those of several algorithms from the literature.
- Published
- 2021
4. Intelligent English resource recommendation and teaching effect based on symmetric SDAE collaborative filtering algorithm
- Author
-
Wu Dan
- Subjects
User information ,Data processing ,General Computer Science ,Computer science ,Process (engineering) ,Mathematical statistics ,020206 networking & telecommunications ,Computational intelligence ,02 engineering and technology ,Construct (python library) ,Resource (project management) ,0202 electrical engineering, electronic engineering, information engineering ,Collaborative filtering ,020201 artificial intelligence & image processing ,Algorithm - Abstract
In the process of acquiring English resources, information retrieval based only on keywords has great limitations in many cases. Moreover, the process of browsing irrelevant information will undoubtedly lead to the loss of customers. In addition, search engines are even more powerless for users who have no clear needs. Based on this, this paper combines the symmetric SDAE collaborative filtering algorithm to construct an intelligent English resource recommendation model. The symmetric SDAE model is composed of two stacked denoising automatic codes, one is used to train item information to obtain the item feature matrix, and the other is used to train user information to obtain the user feature matrix. At the same time, in order to study the performance of the model, this paper takes expert ratings and student user ratings as examples for analysis, uses mathematical statistics and machine learning for data processing, and displays the results in graphs. The research results show that the model constructed in this paper has good results, and the next research direction is proposed.
- Published
- 2021
5. Research on aerospace data transaction platform and method based on blockchain
- Author
-
Zhang Zhongyang, Wang Yeying, Fan Chen, Li Yin, Wu Dan, Wang Rui, Guo Liang, and Hu Dongdong
- Subjects
Blockchain ,Traceability ,Scope (project management) ,Computer science ,business.industry ,Stakeholder ,Data security ,Computer security ,computer.software_genre ,Credibility ,Aerospace ,business ,computer ,Database transaction - Abstract
This article authorizes all relevant participants to join the private blockchain network and form a stakeholder alliance to jointly maintain the operation of the blockchain. It not only ensures the legal compliance of the participants in the transaction system, increases mutual trust between the participants, but also provides an open and collaborative environment, and realizes the benign circulation of aerospace industry resources. The data transaction method in this article covers the entire life cycle process of data production and transaction, and uses blockchain technology to ensure data credibility, data security, and transaction traceability. It solves the problems of proof of the value of aerospace test data, data security and network transaction trust, protects the interests of both parties in the transaction, and effectively expands the application scope of aerospace industry resources.
- Published
- 2020
6. Redesigning the Model of Book Evaluation in the Polish Performance-based Research Funding System
- Author
-
Wu Dan, HE Daqing, and Liu Yuan
- Subjects
Publisher list ,Computer science ,media_common.quotation_subject ,05 social sciences ,Performance-based research funding system ,Subject (documents) ,Norwegian Model ,050905 science studies ,Data science ,Task (project management) ,Empirical research ,Book evaluation ,Question answering ,Quality (business) ,Poland ,0509 other social sciences ,Comparative perspective ,050904 information & library sciences ,media_common - Abstract
Purpose This study aims to present the key systemic changes in the Polish book evaluation model to focus on the publisher list, as inspired by the Norwegian Model. Design/methodology/approach In this study we reconstruct the framework of the 2010 and 2018 models of book evaluation in Poland within the performance-based research funding system. Findings For almost 20 years the book evaluation system in Poland has been based on the verification of various technical criteria (e.g. length of the book). The new 2018 model is based on the principle of prestige inheritance (a book is worth as much as its publisher is) and is inspired by the publisher list used in the Norwegian Model. In this paper, we argue that this solution may be a more balanced policy instrument than the previous 2010 model in which neither the quality of the publisher nor the quality of the book played any role in the evaluation. Research limitations We work from the framework of the 2018 model of book evaluation specified in the law on higher education and science from 20 July 2018, as implementation acts are not available yet. Practical implications This study may provide a valuable point of reference on how structural reforms in the research evaluation model were implemented on a country level. The results of this study may be interesting to policy makers, stakeholders and researchers focused on science policy. Originality/value This is the very first study that presents the new framework of the Polish research evaluation model and policy instruments for scholarly book evaluation. We describe what motivated policy makers to change the book evaluation model, and what arguments were explicitly raised to argue for the new solution.
- Published
- 2018
7. PREDICTION AND VALIDATION FOR THE AERODYNAMIC NOISE OF HIGH-SPEED TRAIN POWER CAR
- Author
-
Yang Song, Jiang Shijie, Wen Bangchun, and Wu Dan
- Subjects
010504 meteorology & atmospheric sciences ,Computer science ,simulation model ,Mechanical Engineering ,Acoustics ,lcsh:TA1001-1280 ,Transportation ,High speed train ,Aerodynamics ,01 natural sciences ,Lighthill-Curle theory ,010305 fluids & plasmas ,Power (physics) ,Physics::Fluid Dynamics ,Noise ,on-line tests ,high-speed train ,aerodynamic noise ,0103 physical sciences ,Automotive Engineering ,Online test ,lcsh:Transportation engineering ,0105 earth and related environmental sciences - Abstract
The aerodynamic noise of high-speed train power car was investigated in this article. The full-scale power car was first modeled, and the external steady flow field was computed by a realizable k-ε turbulence model. The aerodynamic noise sources of the power car surface and the external transient flow field were then calculated by broadband noise source model and large eddy simulation (LES) model, respectively. The static pressures on the train surface were obtained from the results of the transient model. Considering the transient flow field, the far-field aerodynamic noise generated by the power car was finally derived from Lighthill-Curle theory. It was validated by means of on-line tests that have been performed along a real high-speed railway line. Through comparisons between simulations and measurements, it is shown that the simulation model gives reliable aerodynamic noise predictions. We foresee numerous applications for modeling and control of the aerodynamic noise in high-speed train.
- Published
- 2018
8. The Safety State Control of Hazardous Chemicals Based on Multi-source Heterogeneous Data Fusion
- Author
-
Zhehan Ma, Ru Sun, Rui Wang, Jie Yu, Li Ying, and Wu Dan
- Subjects
Computer science ,State control ,02 engineering and technology ,010501 environmental sciences ,021001 nanoscience & nanotechnology ,Sensor fusion ,01 natural sciences ,Risk analysis (engineering) ,Hazardous waste ,Production (economics) ,Factory (object-oriented programming) ,State (computer science) ,Rough set ,0210 nano-technology ,Multi-source ,0105 earth and related environmental sciences - Abstract
To solve the problems that safety status information was not timely and information accuracy guarantee was costly in the production, transportation and preservation of hazardous chemicals, the safety state control model for hazardous chemicals with four layers of data perception, data cleaning, data fusion and state evaluation is proposed. Firstly, aiming at the inaccuracy of collected data, a data cleaning method was put forward. Secondly, A data fusion method based on rough set and D-S evidence theory was put forward to acquire technical state real-timely and accurately. Thirdly, the migration of technical state would be grasped through evaluation between physical state and target state. Finally, a hazardous chemical factory was taken as the application object to verify the feasibility of proposed technology.
- Published
- 2019
9. Short Video Classification Based on Spatio-Temporal Features and SVM
- Author
-
Xie Weihua and Wu Dan
- Subjects
Training set ,Computer science ,business.industry ,ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION ,Small sample ,Pattern recognition ,02 engineering and technology ,Support vector machine ,ComputingMethodologies_PATTERNRECOGNITION ,Video encoding ,0202 electrical engineering, electronic engineering, information engineering ,Classification methods ,020201 artificial intelligence & image processing ,Artificial intelligence ,business ,Classifier (UML) - Abstract
Due to the low accuracy of video classification, this paper proposes a video classification method based on temporal and spatial feature. Firstly, obtain the video descriptor and extract the spatio-temporal features from the video. Then the video encoding is generated by using the word bag model. Finally, compare spatial and temporal features respectively to generate the final judgement and train the classifier area to divide into video categories. SVM (Support Vector Machine) is used to train a multi-class classifier to classify video and it can get better results in small sample training set and has excellent generalization ability. Experimental results indicate that the above method is efficient to process and illustrate video classification to some extent.
- Published
- 2019
10. Transient Analysis of Starting and Stopping for Single-axis Inertia Vibration Machine
- Author
-
Liu Tie Lin, Hou Xiang-lin, and Wu Dan Xia
- Subjects
Inertial frame of reference ,Computer simulation ,Differential equation ,Computer science ,Numerical analysis ,media_common.quotation_subject ,Resonance ,Inertia ,Vibration ,Amplitude ,Control theory ,Transient response ,Linear equation ,media_common - Abstract
This paper describes the transient vibration analysis of a single-axis inertial vibration machine. In order to avoid the disadvantage of excessive amplitude caused by the resonance zone during starting and stopping, a dynamic model of SDOF (single degree of freedom) is established based on the dynamic analysis of the physical phenomena during starting. According to the Runge-Kutta method in numerical analysis, a vibration differential equation based on linear vibration is established, and the variation of variables over time during starting and stopping of the vibration machine is analyzed, providing the theoretical evidence for the amplitude control. By means of computer programming, variables in the changing process are simulated and solved, data are processed to a certain extent, and numerical simulation is carried out. Finally, the rationality of the theoretical analysis is verified by experiments, which provides a reference for solving the problem of excessive amplitude increase in engineering.
- Published
- 2019
11. Design of Power Grid Cyber Security Framework Based on Whole Life Cycle Management
- Author
-
Zhao Zhichao, He Jindong, Qian Guo, and Wu Dan
- Subjects
History ,Product life-cycle management ,Computer science ,Power grid ,Computer security ,computer.software_genre ,computer ,Computer Science Applications ,Education - Abstract
The whole process security of power information system is the key to make power grid operation safe and stable. Firstly, the concept and characteristics of whole life cycle management (WLCM) are summarized by this paper systematically. Secondly, the power network security architecture based on full life cycle security management is constructed, which is designed to protect the cyber security of power grid from three aspects: control flow, technical support system and mechanism guarantee system. Thirdly, the cyber security’s management and control flow of power grid, the technical support system of power grid cyber security (PGIS) and the mechanism guarantee system based on life cycle management are proposed. And the control flow, technical support and guarantee mechanism were designed in detail. Finally, the method proposed in this paper is carried out in a provincial power-grid company. The results show that this method can significantly reduce the power network security risk and improve the power grid network security level, which is of great significance to the operation safety of the power grid and has strong engineering application value.
- Published
- 2020
12. Research on Solar Energy Resources in Hexi Region of Gansu Province
- Author
-
Meng Tingting and Wu Dan
- Subjects
World Wide Web ,Thesaurus (information retrieval) ,Computer science ,business.industry ,Solar energy ,business - Abstract
The excessive exploitation and utilization of non-renewable resources by humans has caused a lot of energy depletion, which has caused great changes in the climate system and has a great impact on human production and life. The development and utilization of new energy by human beings has become a hot issue in recent years. As the most important renewable green energy source, solar energy resources have been widely used in many countries and regions. The paper analyzes the solar radiation in the Hexi region for about 21 years in time and space to analyze the availability of solar energy resources in Hexi area.
- Published
- 2019
13. Multidimensional Data Security Exchange Modeling and its Optimization Method
- Author
-
Wu Lijin, Wu Dan, Lin Chenghua, Tang Zhijun, Luo Fucai, and He Jindong
- Subjects
Computer science ,Multidimensional data ,Data mining ,computer.software_genre ,computer - Published
- 2019
14. Research on Data Auditing Technology Based on PARCC
- Author
-
Zhao Zhichao, Luo Fucai, Wu Dan, Tang Zhijun, He Jindong, and Lin Chenghua
- Subjects
Scheme (programming language) ,Database ,Cover (telecommunications) ,Computer science ,business.industry ,Process (computing) ,Data security ,Cloud computing ,Audit ,computer.software_genre ,Signature (logic) ,Order (business) ,business ,computer ,computer.programming_language - Abstract
In order to improve the data security in the computing environment, a "public auditing" scheme PARCC was proposed for the regenerative coding data in the cloud computing system. PARCC allows the user to use a third-party auditor TPA to remote check the integrity of the data. In addition, in order to solve the data owner without online failure data/signature of regeneration, was introduced to the system in one and a half-trusted agent, and designed a new data signature scheme, allowing the agent to replace the data owner to provide renewable data valid signatures. Considering the privacy protection of data, the random cover method of coefficient in PARCC scheme ensures that the user data will not be leaked during the audit and repair process. The safety of the scheme is proved, and the performance of the scheme is comprehensively evaluated and analyzed through the theory. The results show that the scheme has good performance.
- Published
- 2019
15. Robust Reversible Watermarking Scheme against JPEG Compression
- Author
-
武丹 Wu Dan and 汪国昭 Wang Guo-zhao
- Subjects
Arithmetic underflow ,Computer science ,business.industry ,Data_MISCELLANEOUS ,Payload (computing) ,ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION ,Image processing ,Watermark ,computer.file_format ,JPEG ,Atomic and Molecular Physics, and Optics ,Robustness (computer science) ,Histogram ,Computer vision ,Artificial intelligence ,business ,computer ,Digital watermarking - Abstract
A novel reversible watermarking scheme is proposed,which is robust against high-quality JPEG compression.By computing the difference between the means of two adjacent image blocks,employing it to embed the watermark,and using block histogram shifting to avoid overflow/underflow,this technique receives both losslessness and robustness.If the watermarked image does not change at all,the watermark can be extracted out correctly and the original image can be recovered losslessly.If the watermarked image is compressed to some extent,the watermark can still be correctly extracted for semi-fragile authentication.The scheme is successfully applied to three kinds of medical images and commonly used images.Experimental results show that the high visual quality of images,the pure payload,and the robustness of the proposed scheme against compression are acceptable for many applications,including semi-fragile image authentication.
- Published
- 2010
16. An analysis about Internet communication competence for science and technology in China
- Author
-
XuYing, Lihui Wang, Zhong Qi, and Wu Dan
- Subjects
Knowledge management ,Internet communication ,Index system ,Multimedia ,Computer science ,business.industry ,computer.software_genre ,Internet Architecture Board ,The Internet ,Architecture ,business ,Science, technology and society ,China ,computer ,Competence (human resources) - Abstract
The rapid development of Internet provides a more convenient, effective platform for science and technology communication. In recent years, many websites in China have played an important role for science and technology communication, and promote the popularization of science and technology. But at the same time, there are some problems inevitably in the process of development. How to objectively evaluate the current Internet communication competence for science and technology is the important content of this paper. The paper consists of five parts: the first part is to introduce the current development situation of Internet for Science and technology communication, and outline the architecture of Internet for science and technology communication; the second part is to establish the index evaluation system from quantitative and qualitative aspects on the basis of the characteristics of Internet; the third part is according to the data of typical examples obtained by monitoring, to analyze the Internet communication competence for science and technology through the index system; the forth part draws some conclusions; the last part gives relevant suggestions.
- Published
- 2015
17. Keyword-Aware Dominant Route Search for Various User Preferences
- Author
-
Wu Dan, Yujiao Li, Weidong Yang, and Zhipeng Xie
- Subjects
Set (abstract data type) ,Flexibility (engineering) ,Travel time ,Information retrieval ,Route search ,Computer science ,Rating score ,Popularity ,Preference (economics) ,Budget constraint - Abstract
Route search has been studied extensively. However existing solutions for route search are often insufficient in offering users the flexibility to specify their requirements. Recently, a new kind of keyword-aware optimal route (KOR) query is proposed for finding an optimal route such that it covers a set of user-specified keywords, it satisfies a budget constraint (e.g., time), and the total popularity of the route is maximized. For example, a user may search for the route passing through cinema and bookstore within a travel time of 3 hours, which has the highest total rating score. KOR only returns one result regardless of user preferences:however some may care more about bookstore, while others think cinema more important. Apparently, it is not user-friendly for users to specify their own preference explicitly. To meet the various user preferences, this paper presents a new route search query called Keyword-aware Dominant Routes (KDR) query, which returns all possible preferable routes, covering a set of keywords under a specified budget constraint. We devise a novel algorithm DR for efficiently finding the exact result of a KDR query and a heuristic algorithm FDR to approximately answer a KDR query. Experimental results show that our algorithms are efficient.
- Published
- 2015
18. Analyzing Technological Knowledge Diffusion Among Technological Fields Using Patent Data: The Example of Microfluidics
- Author
-
Wu Dan, Zhang Hui, Qiao Zheng, Fei-Fei Wu, and Lu-Cheng Huang
- Subjects
Class (computer programming) ,Measure (data warehouse) ,Computer science ,05 social sciences ,Microfluidics ,050905 science studies ,Data science ,Patent citation ,Field (computer science) ,Set (abstract data type) ,Management of Technology and Innovation ,0502 economics and business ,0509 other social sciences ,Diffusion (business) ,Patent document ,050203 business & management - Abstract
Study of technological knowledge diffusion can provide a basis for R&D planners to invest new R&D projects with a proper direction. In this paper, we introduce a modified method to analyze the diffusion degree of technological knowledge among different technological fields using patent data at the technology patent class level. This method first generates a patent citation network related to a specific research area and then establishes a technological field diffusion matrix according to the concordance between the patent document and the corresponding patent class. After that indicators are set up to measure the diffusion degree of technological field from two aspects of diffusion depth and breadth and then we discern the diffusion type of typical fields. Finally, we conduct microfluidic technology as a case study to prove the feasibility of the method.
- Published
- 2017
19. Fast NIC based RDMA implementation for adaptive unreliable networks
- Author
-
Xu Weixia, Pang Zhengbin, Wu Dan, and Wang Shaogang
- Subjects
Interconnection ,Out-of-order execution ,Remote direct memory access ,Transmission (telecommunications) ,business.industry ,Computer science ,Network packet ,Reliability (computer networking) ,Sliding window protocol ,Scalability ,business ,Computer network - Abstract
Remote Direct Memory Access (RDMA) is one of the basic communication fabrics for parallel computers. Its performance is crucial for most parallel workloads. For next generation super computers, the system usually extends to extremely large scale with millions of computation cores connected through the interconnection network. Most interconnection network features out of order packets delivery and low system-wide network reliability. Building high performance and reliable point-to-point communication over next generation interconnection network is a challenging task. Current system usually implements RDMA through two approaches: 1) the receiver side counters approach; 2) sender side sliding window approach. We see that current approach works better on reliable interconnection networks, but has obvious performance degradation over the un-reliable network. This paper proposes a new hardware approach for fast RDMA transmission, which can provide scalable performance on un-reliable network. Our approach uses a novel receiver side sliding window to support out-of-order packets delivery. Our approach proposes a new implementation of the traditional sliding window approach, which uses receiver side sliding window to efficiently retransmit partial RDMA data when part of the packets fail to reach the receiver. The experiments show that for low reliability interconnection network, our approach has scalable performance benefit over current RDMA implementations.
- Published
- 2014
20. Calculation of a High Order QCD Process — gg to ${\rm t{\bar t}gg}$
- Author
-
D. Judd, Zhang Da-Hua, David Wagoner, and Wu Dan-di
- Subjects
Quantum chromodynamics ,Physics and Astronomy (miscellaneous) ,Computer science ,Permutation group ,Algebra ,symbols.namesake ,Tree (descriptive set theory) ,Order (business) ,Quantum electrodynamics ,symbols ,Feynman diagram ,Notional amount ,Research center ,Gauge symmetry - Abstract
We use the permutation group of order 4 to classify the fourth order tree QCD Feynman diagrams, which contribute to the gg to process. (There are 159 of them.) We also provide new methods to make the color sum, and to check the gauge symmetry of the matrix elements and Feynman parts.
- Published
- 1998
21. Hardware Acceleration of Barrier Communication for Large Scale Parallel Computer
- Author
-
Lu Pingjing, Pang Zhengbin, Wu Dan, and Wang Shaogang
- Subjects
Computer science ,Message passing ,Scalability ,Hardware acceleration ,Parallel computing - Abstract
MPI collective communication overhead dominates the communication cost for large scale parallel computers, scalability and operation latency for collective communication is critical for next generation computers. This paper proposes a fast and scalable barrier communication offload approach which supports millions of compute cores. Following our approach, the barrier operation sequence is packed by host MPI driver into the barrier “descriptor”, which is pushed to the NIC (Network-Interfaces). The NIC can complete the barrier automatically following its algorithm descriptor. Our approach accelerates both intra-node and inter-node barrier communication. We show that our approach achieves both barrier performance and scalability, especially for large scale computer system. This paper also proposes an extendable and easy-to-implement NIC architecture supporting barrier offload communication and also other communication pattern.
- Published
- 2013
22. Vehicle Abnormal Behavior Detection System Based on Video
- Author
-
Sang Hai-feng, Wang Hui, and Wu Dan-Yang
- Subjects
Background subtraction ,Identification (information) ,Vehicle tracking system ,business.industry ,Computer science ,Video tracking ,Computer vision ,Image segmentation ,Artificial intelligence ,Abnormality ,Traffic flow ,business ,Object detection - Abstract
With reference to the common vehicle abnormal behaviors, the article presents a video-based vehicle abnormal behavior detection system. on the basis of background subtraction methods to detect vehicles, the vehicle tracking and abnormal behavior identification was realized by building up information chain of tracked vehicles. the system solves effectively the problems of traditional method, such as losing detection and wrong matching. the experiments showed that the system could not only detect vehicle abnormal behavior correctly, but also calculate the traffic flow and count the number of vehicles which broke traffic rules accurately.
- Published
- 2012
23. Optimizing Private Memory Performance by Dynamically Deactivating Cache Coherence
- Author
-
Wu Dan, Xu Weixia, Lu Pingjing, Wang Shaogang, Dai Yi, and Pang Zhengbin
- Subjects
Memory coherence ,CPU cache ,Cache coloring ,Computer science ,Real-time computing ,Cache pollution ,Non-uniform memory access ,Write-once ,Cache invalidation ,Interleaved memory ,Cache algorithms ,Distributed shared memory ,Hardware_MEMORYSTRUCTURES ,business.industry ,MESI protocol ,Cache-only memory architecture ,Uniform memory access ,Memory map ,MESIF protocol ,Memory management ,Shared memory ,Bus sniffing ,Cache ,business ,Cache coherence ,Computer network - Abstract
User Program has significant percentage of memory requests that target only private data, which does not need to resolve cache coherence conflicts. Yet traditional coherence protocol does not distinguish between shared and private blocks, which leaves much optimization space for memory reference latency and power consumption. This paper proposes an optimized cache coherence protocol, called PMESI, which dynamically deactivates cache coherence maintenance for private memory space. PMESI achieves two distinguishing features: the reduction of memory access latency and system power consumption. Simulation results on the cycle accurate simulator for wide range of industry benchmarks show that 54\% memory references can be efficiently optimized and program execution time is reduced 9\% on average.
- Published
- 2012
24. A multi-interface multi-channel Ad Hoc routing protocol for real time video transmission
- Author
-
Song Ling, Wu Dan, Xu Bai, and Xie Pengyu
- Subjects
Zone Routing Protocol ,Dynamic Source Routing ,Link-state routing protocol ,Optimized Link State Routing Protocol ,business.industry ,Computer science ,ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS ,Enhanced Interior Gateway Routing Protocol ,Path vector protocol ,Wireless Routing Protocol ,Destination-Sequenced Distance Vector routing ,business ,Computer network - Abstract
The real-time video transmission demands not only tremendous bandwidth, but also a strict requirement on delay. In this paper, on the basis of research on the present situation of multi-interface multi-channel Ad Hoc networks, we analysis the extant routing protocols' advantages and disadvantages for video transmission. Firstly, we applied multi-interface multichannel extension method to the AOMDV (Ad-hoc On-demand Multipath Distance Vector) routing protocol, and improved extant channel switching algorithm, called MIMC-AOMDV (Multi-Interface Multi-Channel AOMDV) routing protocol. Secondly, we proposed video streaming delay QoS constraint and link-quality metrics, which used the multi interface queue's total used length to get QMMIMC-AOMDV (Quality metric MIMC-AOMDV) routing protocol. The results show that the proposed QMMIMC-AOMDV can reduce the frame delay effetely and raise frame decodable rate and peak signal to noise ratio (PSNR), so it is more suitable for real-time video streams.
- Published
- 2011
25. Notice of Violation of IEEE Publication Principles: A Scenario-Based Test Case Generation Framework for Security Policies
- Author
-
Chen Yan and Wu Dan
- Subjects
Government ,Cloud computing security ,Computer science ,business.industry ,Standard of Good Practice ,Access control ,Information security ,Computer security model ,Permission ,Computer security ,computer.software_genre ,Security policy ,Security testing ,Security information and event management ,Security engineering ,Security service ,Information security standards ,Software security assurance ,Application security ,Security through obscurity ,Security convergence ,Network security policy ,business ,computer - Abstract
Security policy system is critical to the security sensitive implementation systems. To increase confidence in the correctness of the security policies, policy developers can conduct policy testing to ensure security policies are correctly implemented in these systems. In this paper we present a novel framework for security policy testing. The framework takes the security policy as a support for the secure operation of the functional systems and seizes the dynamic characteristic of the security policies which change with the refinement of functional systems. The testing framework is model based and includes three parts. They are security policy integration; refinement based testing scenario acquisition and risk-based testing organization. The framework covers all elements for the model-based testing and provides a comprehensive solution for the security policy testing.
- Published
- 2009
26. The design and realization of the management system based on SaaS in the small and medium building material enterprise
- Author
-
Wu Dan and Ma Li
- Subjects
Engineering management ,Knowledge management ,business.industry ,Computer science ,Server ,Software as a service ,Human resource management ,Management system ,The Internet ,Service provider ,Informatization ,business ,Enterprise software - Abstract
Informatization construction in the small and medium building material enterprise in China has been pressing for the moment. However, due to the restrictions of financing, human resources, technology and so forth, the achievement of informatization has none the less many difficulties. The managing concept of “software as a service” (the mode of SaaS) has been used to design and realize the management system in such enterprise. In this paper, the author takes up with the following aspects in exploding and actualizing the management system based on SaaS: First of all, the overall designing of the management system make software to cover the core areas in management including the stocking, the vendition and the stockpile. Secondly, the application of the designing concept based on the shared database realizes the share of multi-users and make sure of the uniqueness, the integrality and the security for their information. Finally, the last question discusses how to maintain an effective assistant system for the service provider in order to provide the efficient and timely technological assistants other than reducing the cost.
- Published
- 2009
27. The Design of Bionic Joints: A Lesson from Synovial Joints
- Author
-
Zhao Danpu, Wu Dan, Yi Qiang, Nie Chenghui, Chen Ken, Xu Leon, Salo Antti, and Wang Xia
- Subjects
Motion analysis ,Computer science ,Surface fitting ,business.industry ,Structural engineering ,Multi axial ,business ,Joint (geology) ,Synovial joints - Abstract
The new form factor is one of the important drivers for future electronic devices. In nature, there are many form factors with evolution process that are elegant and adaptive. In this paper, we explore the characteristics of arthrosis, with the focus on the difference between the arthrosis and machine joints. Then three types of joints are introduced, which are simulated from body arthrosis. With the analyses of the structure and motion track of these joints, the strongpoint of such joints is introduced.
- Published
- 2008
28. Classification using a novel support vector machine fuzzy network for digital modulations in satellite communication
- Author
-
Wu Dan, Guo Qing, and Gu Xuemai
- Subjects
Support vector machine ,Control theory ,Computer science ,business.industry ,Robustness (computer science) ,Fuzzy set ,Pattern recognition ,Artificial intelligence ,business ,Fuzzy logic - Abstract
To make the modulation classification system more suitable for signals in a wide range of signal to noise rate (SNR), a novel support vector machine fuzzy network (SVMFN) is presented in this paper. The SVMFN employs a new definition of fuzzy density which incorporates accuracy and uncertainty of the classifiers to improve recognition reliability. Further, three efficient features with high robustness and less computation are extracted from intercepted signals to classify eleven digital modulation types (i.e. 2ASK, 4ASK, 2FSK, 4FSK, 2PSK, 4PSK, 8PSK, 16QAM, TFM, /spl pi//4QPSK and OQPSK). Computer simulation shows that the proposed scheme has the advantages of high accuracy and reliability (success rates are over 97.5% when SNR is not lower than 0 dB), and adapt to engineering applications.
- Published
- 2005
29. A new scheme of automatic modulation classification using wavelet and WSVM
- Author
-
Gu Xuemai, Guo Qing, and Wu Dan
- Subjects
Support vector machine ,Signal processing ,Wavelet ,Artificial neural network ,business.industry ,Computer science ,Feature extraction ,Wavelet transform ,Pattern recognition ,Artificial intelligence ,business ,Quadrature amplitude modulation ,Phase-shift keying - Abstract
This paper deals with automatic modulation classification of communication signals. A new scheme of automatic modulation classification using wavelet analysis and wavelet support vector machine (WSVM) is proposed. Further, a new way of training for wavelet features is carried out to adapt to signals which are non-stable and varied in a wide range of signal-to-noise rates (SNR). Through such training, a single classifier can classify modulation types with high accuracy without knowing signals' SNR if only the SNR is in a certain range. Computer simulation shows that the classifier can separate ten modulation types, i.e. 2ASK, 4ASK, 2FSK, 4FSK, 2PSK, 4PSK, 16QAM, TFM, pi/4QPSK, OQPSK and success rates are over 96.5% when SNR is not lower than 3 dB. Accuracy and efficiency of the proposed scheme are obviously improved
- Published
- 2005
30. Hierarchical Shortest Pathfinding Applied to Route-Planning for Wheelchair Users.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, Yang, Suling, and Mackworth, Alan K.
- Abstract
Pathfinding on large maps is time-consuming. Classical search algorithms such as Dijkstra's and A* algorithms may solve difficult problems in polynomial time. However, in real-world pathfinding examples where the search space increases dramatically, these algorithms are not appropriate. Hierarchical pathfinding algorithms that provide abstract plans of future routing, such as HPA* and PRA*, have been explored by previous researchers based on classical ones. Although the two hierarchical algorithms show improvement in efficiency, they only obtain near optimal solutions. In this paper, we introduce the Hierarchical Shortest Path algorithm (HSP) and a hybrid of the HSP and A* (HSPA*) algorithms, which find optimal solutions in logarithmic time for numerous examples. Our empirical study shows that HSP and HSPA* are superior to the classical algorithms on realistic examples, and our experimental results illustrate the efficiency of the two algorithms. We also demonstrate their applicability by providing an overview of our Route Planner project that applies the two algorithms proposed in this paper. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
31. Planning in Multiagent Expedition with Collaborative Design Networks.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, Xiang, Yang, and Hanshar, Frank
- Abstract
DEC-POMDPs provide formal models of many cooperative multiagent problems, but their complexity is NEXP-complete in general. We investigate a sub-class of DEC-POMDPs termed multiagent expedition. A typical instance consists of an area populated by mobile agents. Agents have no prior knowledge of the area, have limited sensing and communication, and effects of their actions are uncertain. Success relies on planing actions that result in high accumulated rewards. We solve an instance of multiagent expedition based on collaborative design network, a decision theoretic multiagent graphical model. We present a number of techniques employed in knowledge representation and demonstrate the superior performance of our system in comparison to greedy agents experimentally. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
32. A Hybrid Approach to Improving Automatic Speech Recognition Via NLP.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, and Voll, Kimberly
- Abstract
In many domains, automated speech recognition (ASR) demands highly robust and accurate recognition software. Unfortunately, in such domains, even a 99% accurate recognizer is inadequate, and other methods for increasing the reliability and performance of ASR must be considered. As a possible solution to this problem, post-speech-recognition error detection can assist in proofreading more efficiently. To this end, we have developed a multi-heuristic algorithm using natural language processing to detect recognition errors. As a proof of concept, we have applied this algorithm to the radiology domain. The results are encouraging, showing a 22% increase in the recall performance, and a 6% increase in the precision performance, over the best individual technique. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
33. Rethinking the Semantics of Complex Nominals.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, Abdullah, Nabil, and Frost, Richard A.
- Abstract
Complex Nominals (CNs) have simple syntactic structure that conceals non-trivial semantic characteristics. While speakers of natural languages combine noun(s)/adjective(s) with a head noun to indicate existing or novel concepts with ease, formalizing such a semantic process, however, has proven to be a daunting task. In this paper, we present a unified semantic approach for constructions involving a head-noun and modifier(s), i.e., adjective(s)/noun(s). Based on a rigorous typing system, this approach uses set intersection as the only underlying semantic rule. We argue that this novel approach is compositional and warrants consistent inferences. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
34. Creating a Fuzzy Believer to Model Human Newspaper Readers.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, Krestel, Ralf, Witte, René, and Bergler, Sabine
- Abstract
We present a system capable of modeling human newspaper readers. It is based on the extraction of reported speech, which is subsequently converted into a fuzzy theory-based representation of single statements. A domain analysis then assigns statements to topics. A number of fuzzy set operators, including fuzzy belief revision, are applied to model different belief strategies. At the end, our system holds certain beliefs while rejecting others. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
35. Fuzzy Clustering for Topic Analysis and Summarization of Document Collections.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, Witte, René, and Bergler, Sabine
- Abstract
Large document collections, such as those delivered by Internet search engines, are difficult and time-consuming for users to read and analyse. The detection of common and distinctive topics within a document set, together with the generation of multi-document summaries, can greatly ease the burden of information management. We show how this can be achieved with a clustering algorithm based on fuzzy set theory, which (i) is easy to implement and integrate into a personal information system, (ii) generates a highly flexible data structure for topic analysis and summarization, and (iii) also delivers excellent performance. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
36. Multi-state Directed Acyclic Graphs.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, Wachter, Michael, and Haenni, Rolf
- Abstract
This paper continues the line of research on the representation and compilation of propositional knowledge bases with propositional directed acyclic graphs (PDAG), negation normal forms (NNF), and binary decision diagrams (BDD). The idea is to permit variables with more than two states and to explicitly represent them in their most natural way. The resulting representation languages are analyzed according to their succinctness, supported queries, and supported transformations. The paper shows that most results from PDAGs, NNFs, and BDDs can be generalized to their corresponding multi-state extension. This implies that the entire knowledge compilation map is extensible from propositional to multi-state variables. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
37. Query-Based Summarization of Customer Reviews.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, Feiguina, Olga, and Lapalme, Guy
- Abstract
We describe an architecture for organizing and summarizing consumer reviews about products that have been posted on specialized web sites. The core technology is based on the automatic extraction of product features for which we report experiments on two types of corpora. We thus show that NLP techniques can be fruitfully used in this context for helping consumers sort out the mass of information displayed in such contexts. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
38. On the Stability and Bias-Variance Analysis of Kernel Matrix Learning.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, Saradhi, V. Vijaya, and Karnick, Harish
- Abstract
Stability and bias-variance analysis are two powerful tools to understand learning algorithms better. We use these tools to analyze learning the kernel matrix (LKM) algorithm. The motivation comes from: (i) LKM works in the transductive setting where both training and test data points are to be given apriori. Hence, it is worth knowing the stability of LKM under small variations in the data set and (ii) It has been argued that LKMs overfit the given data set. In particular we are interested in answering the following questions: (a) Is LKM a stable algorithm? (b) do they overfit (c) what is the bias behavior with different optimal kernels?. Our experimental results show that LKMs do not overfit the given data set. The stability analysis reveals that LKMs are unstable algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
39. Reinforcement Learning in Nonstationary Environment Navigation Tasks.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, Lane, Terran, Ridens, Martin, and Stevens, Scott
- Abstract
The field of reinforcement learning (RL) has achieved great strides in learning control knowledge from closed-loop interaction with environments. "Classical" RL, based on atomic state space representations, suffers from an inability to adapt to nonstationarities in the target Markov decision process (i.e., environment). Relational RL is widely seen as being a potential solution to this shortcoming. In this paper, we demonstrate a class of "pseudo-relational" learning methods for nonstationary navigational RL domains - domains in which the location of the goal, or even the structure of the environment, can change over time. Our approach is closely related to deictic representations, which have previously been found to be troublesome for RL. The key insight of this paper is that navigational problems are a highly constrained class of MDP, possessing a strong native topology that relaxes some of the partial observability difficulties arising from deixis. Agents can employ local information that is relevant to their near-term action choices to act effectively. We demonstrate that, unlike an atomic representation, our agents can learn to fluidly adapt to changing goal locations and environment structure. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
40. Learning Network Topology from Simple Sensor Data.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, Marinakis, Dimitri, Giguère, Philippe, and Dudek, Gregory
- Abstract
In this paper, we present an approach for recovering a topological map of the environment using only detection events from a deployed sensor network. Unlike other solutions to this problem, our technique operates on timestamp free observational data; i.e. no timing information is exploited by our algorithm except the ordering. We first give a theoretical analysis of this version of the problem, and then we show that by considering a sliding window over the observations, the problem can be re-formulated as a version of set-covering. We present two heuristics based on this set-covering formulation and evaluate them with numerical simulations. The experiments demonstrate that promising results can be obtained using a greedy algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
41. Incremental Neighborhood Graphs Construction for Multidimensional Databases Indexing.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, Hacid, Hakim, and Yoshida, Tetsuya
- Abstract
The point location (neighborhood search) is a significant problem in several fields like databases and data mining. Neighborhood graphs are interesting representations of this problem in a multidimensional space. However, several problems related to neighborhood graphs are under research and require detailed work to solve them. These problems are mainly related to their high construction costs and to their updating difficulties. In this article, we deal with the point location problem by considering neighborhood graphs optimization. We propose and compare two strategies able to quickly build and update these structures. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
42. Problem-Solving Knowledge Mining from Users' Actions in an Intelligent Tutoring System.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, Nkambou, Roger, Mephu Nguifo, Engelbert, Couturier, Olivier, and Fournier-Viger, Philippe
- Abstract
In an intelligent tutoring system (its), the domain expert should provide relevant domain knowledge to the tutor so that it will be able to guide the learner during problem solving. However, in several domains, this knowledge is not predetermined and should be captured or learned from expert users as well as intermediate and novice users. Our hypothesis is that, knowledge discovery (kd) techniques can help to build this domain intelligence in ITS. This paper proposes a framework to capture problem-solving knowledge using a promising approach of data and knowledge discovery based on a combination of sequential pattern mining and association rules discovery techniques. The framework has been implemented and is used to discover new meta knowledge and rules in a given domain which then extend domain knowledge and serve as problem space allowing the intelligent tutoring system to guide learners in problem-solving situations. Preliminary experiments have been conducted using the framework as an alternative to a path-planning problem solver in CanadarmTutor. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
43. Reasoning with Conditional Preferences Across Attributes.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, Chen, Shaoju, Buffett, Scott, and Fleming, Michael W.
- Abstract
Before an autonomous agent can perform automated negotiation on behalf of a user in an electronic commerce transaction, the user's preferences over the set of outcomes must be learned as accurately as possible. This paper presents a structure, a Conditional Outcome Preference Network (COP-network), for modeling preferences directly elicited from a user. The COP-network then expands to indicate all preferences that can be inferred as a result. The network can be easily checked for consistency and redundancy, and can be used to determine quickly whether one outcome is preferred over another. An important feature of the COP-network is that conditional preferences, where a user's preference over outcomes depends on whether particular attribute values are included, can be modeled and inferred as well. If the agent also knows the user's utilities for some of the possible outcomes, then these can be considered in the COP-network as well. Three techniques for estimating utilities based on the specified preferences and utilities are described. One such technique, which works by first estimating utilities for long chains of outcomes for which preferences are known, is shown to be the most effective. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
44. On the Use of Possibilistic Bases for Local Computations in Product-Based Possibilistic Networks.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, Benferhat, Salem, and Smaoui, Salma
- Abstract
Product-based possibilistic networks allow an efficient representation of possibility distributions. However, when the graph is multiply connected, the propagation may be unfeasible because of the high space complexity problem. In this paper, we propose a new inference approach on product-based possibilistic networks based on compact representations of possibility distributions, which are possibilistic knowledge bases. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
45. Adding Local Constraints to Bayesian Networks.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, Crowley, Mark, Boerlage, Brent, and Poole, David
- Abstract
When using Bayesian networks, practitioners often express constraints among variables by conditioning a common child node to induce the desired distribution. For example, an ‘or' constraint can be easily expressed by a node modelling a logical ‘or' of its parents' values being conditioned to true. This has the desired effect that at least one parent must be true. However, conditioning also alters the distributions of further ancestors in the network. In this paper we argue that these side effects are undesirable when constraints are added during model design. We describe a method called shielding to remove these side effects while remaining within the directed language of Bayesian networks. This method is then compared to chain graphs which allow undirected and directed edges and which model equivalent distributions. Thus, in addition to solving this common modelling problem, shielded Bayesian networks provide a novel method for implementing chain graphs with existing Bayesian network tools. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
46. Improving Importance Sampling by Adaptive Split-Rejection Control in Bayesian Networks.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, Yuan, Changhe, and Druzdzel, Marek J.
- Abstract
Importance sampling-based algorithms are a popular alternative when Bayesian network models are too large or too complex for exact algorithms. However, importance sampling is sensitive to the quality of the importance function. A bad importance function often leads to much oscillation in the sample weights, and, hence, poor estimation of the posterior probability distribution. To address this problem, we propose the adaptive split-rejection control technique to adjust the samples with extremely large or extremely small weights, which contribute most to the variance of an importance sampling estimator. Our results show that when we adopt this technique in the EPIS-BN algorithm[14], adaptive split-rejection control helps to achieve significantly better results. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
47. Analytic Results on the Hodgkin-Huxley Neural Network: Spikes Annihilation.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, Calitoiu, Dragos, Oommen, John B., and Nussbaum, Doron
- Abstract
Various families of Neural Networks (NN) have been used in the study and development of the field of Artificial Intelligence (AI). More recently, the Hodgkin-Huxley (HH) has attracted a fair bit of attention. Apart from the HH neuron possessing desirable "computing" properties, it also can be used to reasonably model biological phenomena, and in particular, in modeling neurons which are "synchronized/desynchronized". This paper, which we believe is a of pioneering sort, derives some of the analytic/learning properties of the HH neuron, and neural network. The HH Neuron is a nonlinear system with two equilibrium states: A fixed point and a limit cycle. Both of them co-exist and are stable. The behavior of this neuron can be switched between these two equilibria, namely spiking and resting respectively, by using a perturbation method. The change from spiking to resting is referred to as Spike Annihilation. In this paper, we analytically prove the existence of a brief excitation (input) which, when delivered to the HH neuron during its repetitively firing state, annihilates its spikes. We also formally derive the characteristics of this brief excitation. We thus believe that our analysis of the HH neuron has practical implications in clinical applications, especially in the case of the desynchronization of neuronal populations. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
48. Question Answering Summarization of Multiple Biomedical Documents.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, Zhongmin Shi, Melli, Gabor, Yang Wang, Yudong Liu, Baohua Gu, Kashani, Mehdi M., Sarkar, Anoop, and Popowich, Fred
- Abstract
In this paper we introduce a system that automatically summarizes multiple biomedical documents relevant to a question. The system extracts biomedical and general concepts by utilizing concept-level knowledge from domain-specific and domain-independent sources. Semantic role labeling, semantic subgraph-based sentence selection and automatic post-editing are involved in the process of finding the information need. Due to the absence of expert-written summaries of biomedical documents, we propose an approximate evaluation by taking MEDLINE abstracts as expert-written summaries. Evaluation results indicate that our system does help in answering questions and the automatically generated summaries are comparable to abstracts of biomedical articles, as evaluated using the ROUGE measure. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
49. Constructing a User Preference Ontology for Anti-spam Mail Systems.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, Kim, Jongwan, Dou, Dejing, Liu, Haishan, and Kwak, Donghwi
- Abstract
The judgment that whether an email is spam or non-spam may vary from person to person. Different individuals can have totally different responses to the same email based on their preferences. This paper presents an innovative approach that incorporates user preferences to construct an anti-spam mail system, which is different from the conventional content-based approaches. We build a user preference ontology to formally represent the important concepts and rules derived from a data mining process. Then we use an inference engine that utilizes the knowledge to predict the user's action on new incoming emails. We also suggest a new rule optimization procedure inspired from logic synthesis to improve comprehensibility and exclude redundant rules. Experimental results showed that our user preference based architecture achieved good performance and the rules derived from the architecture and the optimization method have better quality in terms of comprehensibility. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
50. Distributed Data Mining in a Ubiquitous Healthcare Framework.
- Author
-
Carbonell, Jaime G., Siekmann, Jörg, Kobti, Ziad, Wu, Dan, and Viswanathan, Murlikrishna
- Abstract
Ubiquitous Healthcare (u-healthcare) which focuses on automated applications that can provide healthcare to citizens anywhere/anytime using wired and wireless mobile technologies is becoming increasingly important. Ubiquitous healthcare data provides a mine of hidden knowledge which can be exploited in preventive care and "wellness" recommendations. Data mining is therefore a significant aspect of such systems. Distributed Data mining (DDM) techniques for knowledge discovery from databases help in the thorough analysis of data collected from healthcare facilities enabling efficient decision-making and strategic planning. This paper presents and discusses the development of a prototype ubiquitous healthcare system. The prospects for integrating data mining into this framework are studied using a distributed data mining system. The DDM system employs a mixture modelling mechanism for data partitioning. Initial results with some standard medical databases offer a plausible outlook for future integration. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.