检索结果-内蒙古大学图书馆

International Symposium on Information technology, ITSim

作者： Norjihan Abdul Ghani Zailani Mohamed Sidek Department of Information Science Centre for Advanced Software Engineering (CASE) Faculty of Computer Science & Information Technology City Campus University of Malaya Malaysia

Nowadays, the growth of internet has been accompanied by the growth of web services (e.g e-government, e-health, e-commerce). Web services collect data, especially individuals, from users and use them for various purposes. Sometimes, web services need to release the data they own to third parties. Because privacy is an important concern in web services, there are several research efforts have been devoted to address issues related to the development of privacy-preserving data management techniques. In [3], Agrawal et. al. has introduced Hippocratic Database incorporating privacy protection in relational database systems. In this paper, we’ll proposed the use of Hippocratic Database to ensure the privacy in web services. We use a scenario for driving license renewal by Road Transport Department in order to illustrate this.

关键词： Web services Databases Privacy Data privacy High definition video Insurance Organizations

来源：评论

学校读者我要写书评

暂无评论

N-Most Interesting Closed Itemset Mining

N-Most Interesting Closed Itemset Mining

引用

International Conference on Convergence Information technology

作者： Panida Songram Veera Boonjing Department of Mathematics and Computer Science Faculty of Science King Mongkuts Institute of Technology Ladkrabang Software Systems Engineering Laboratory Bangkok Thailand Department of Computer Science Faculty of Informatics Mahasarakham University Mahasarakham Thailand

In this paper, we propose an efficient algorithm, NCLOSED, for mining the N k-closed itemsets with the highest supports for 1 up to a certain k max value. The algorithm adopts best-first search strategy to generate closed itemsets with highest remaining supports. It does not keep closed itemsets mined in main memory to ensure that they are really closed. This is because this algorithm can directly generate closed itemsets. Moreover, duplicated closed itemsets are detected and discarded from this algorithm.

关键词： Itemsets Data mining computer science Information technology software systems Systems engineering and theory Laboratories Mathematics Informatics software algorithms

来源：评论

学校读者我要写书评

暂无评论

Study of detecting coil and oscillator signal about magnetostrictive position sensor

引用

Yi Qi Yi Biao Xue Bao/Chinese Journal of Scientific Instrument 2008年第SUPPL.期29卷 334-337页

作者： Chang, Xiaoming Wang, Zheng Wakiwaka, Hiroyuki Hirama, Yutaka Yang, Xiaofeng College of Computer and Software Taiyuan University of Technology Taiyuan 030024 China Faculty of Engineering Shinshu University Nagano 380-8553 Japan Hitachi Building Systems Co. Ltd. Tokyo 120-0002 Japan

The magnetostrictive linear position sensor (MLPS) is a kind of sensor that can get the distance being measured by detecting and calculating the induced wave signal and elastic wave signal. The magnetostrictive effect and inverse magnetostrictive effect of magnetostrictive material should induce the turning of magnetic domain and the moving of magnetic domain wall on the senor line. This essay discussed the main characteristic of the oscillator signal of induced waves under experiments, and main factors contributing to oscillator signal were analyzed. The relationship between the rolls of coil and the waveform character of induced waves were analyzed in the paper.

关键词： Detecting coil Induced waves Magnetic domain Magnetostrictive

来源：评论

学校读者我要写书评

暂无评论

Mining Top-K Closed Itemsets Using Best-First Search

Mining Top-K Closed Itemsets Using Best-First Search

引用

International Conference on computer and Information technology (CIT)

作者： Panida Songram Veera Boonjing Software Systems Engineering Laboratory Department of Mathematics and Computer Science Faculty of Science King Mongkut''s Institute of Technology Ladkrabang Bangkok Thailand Department of Computer Science Faculty of Informatics Mahasarakham University Maha sarakham Thailand

In this paper, we proposed an efficient algorithm, TOPK_CLOSED, for mining top-k closed itemsets. This algorithm mines top-k closed itemsets using best-first search. The closed itemsets with the highest supports are firstly found from this algorithm. Consequently, the method quickly finds top-k closed itemsets, which leads to an efficient pruning unnecessary itemsets and stop mining rapidly. In addition, this algorithm can generate closed itemsets without keeping candidates in main memory.

关键词： Itemsets Generators Data mining Pediatrics Complexity theory Algorithm design and analysis Databases

来源：评论

学校读者我要写书评

暂无评论

A Robust Descriptor based on Weber's Law

A Robust Descriptor based on Weber's Law

引用

26th IEEE Conference on computer Vision and Pattern Recognition (CVPR 2008), vol.8

作者： Jie Chen Shiguang Shan Guoying Zhao Xilin Chen Wen Gao Matti Pietikainen School of Computer Science and Technology Harbin Institute of Technology Harbin China Machine Vision Group Department of Electrical and Information Engineering University of Oulu Finland Languages Informatics Systems and Software Engineering Department Faculty of Computer Science Chinese Academy and Sciences Beijing China

Inspired by Weber's Law, this paper proposes a simple, yet very powerful and robust local descriptor, Weber Local Descriptor (WLD). It is based on the fact that human perception of a pattern depends on not only the change of a stimulus (such as sound, lighting, et al.) but also the original intensity of the stimulus. Specifically, WLD consists of two components: its differential excitation and orientation. A differential excitation is a function of the ratio between two terms: One is the relative intensity differences of its neighbors against a current pixel;the other is the intensity of the current pixel. An orientation is the gradient orientation of the current pixel. For a given image, we use the differential excitation and the orientation components to construct a concatenated WLD histogram feature. Experimental results on Brodatz textures show that WLD impressively outperforms the other classical descriptors (e.g., Gabor). Especially, experimental results on face detection show a promising performance. Although we train only one classifier based on WLD features, the classifier obtains a comparable performance to state-of-the-art methods on MIT+CMU frontal face test set, AR face dataset and CMU profile test set.

关键词： Robustness Face detection Humans Content addressable storage Testing Psychology Laboratories Machine intelligence Information processing computers

来源：评论

学校读者我要写书评

暂无评论

Distributed transaction semantic for Binary Vote Assignment Grid

Distributed transaction semantic for Binary Vote Assignment ...

引用

International Conference on Electrical engineering/Electronics, computer, Telecommunications and Information technology, ECTI-CON

作者： A. Noraziah M. Mat Deris R. Norhayati M.Y.M. Saman Faculty of Computer System & Software Engineering Universiti Malaysia Pahang Kuantan Pahang Malaysia Faculty of Information & Technology Multimedia Universiti Tun Hussein Onn Malaysia Batu Pahat Malaysia Faculty chemical Engineering & Natural Resources Universiti Malaysia Pahang Kuantan Pahang Malaysia Faculty of Science & Technology University in Malaysia for Engineering Kuala Terengganu Terengganu Malaysia

This paper presents a new design to manage transaction and replication for distributed systems. First, we recall the binary vote assignment grid (BVAG) model that imposes neighbours binary vote assignment to its logical grid structure on replicated data copies. Based on this model, we extend our work to design the distributed transaction semantic in order to manage BVAG transaction both in normal and failure cases. We present an implementation of the system. The proposed distributed transaction semantic shows that the system preserves the data consistency and support advance fault-tolerant through synchronization approach.

关键词： Servers Distributed databases Peer to peer computing Availability Synchronization computers Linux

来源：评论

学校读者我要写书评

暂无评论

Pointwise Logic on Completely Distributive Lattices and Approximate Reasoning

Pointwise Logic on Completely Distributive Lattices and Appr...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Yalin Zheng Guang Yang Jing Zheng Jinsheng Xing State Key Laboratory for Intelligent Technology and Systems Department of Automation Faculty of Information Science and Technology Tsinghua University Beijing China Research Center of Intelligent Information Technology Department of Computer Science and Technology Faculty of Software Dongguan University of Science and Technology Dongguan China Research Center of Dongguan Economy Department of Economy and Commerce Dongguan University of Science and Technology Dongguan China Faculty of Mathematics and Computer Science Shanxi Normal University Linfen China Research Center of System Engineering Faculty of Electronic and Information Engineering Xi'an Jiaotong University Xi'an China

In this paper, we propose the basic framework of point- wise topological logic on completely distributive lattices and explore approximate reasoning in it. The logic of this paper is based on pointwise characterization, therefore the pointwise conception is pervasive. We explore approximate reasoning in abstract logical framework Fl on completely distributive lattice L. We propose the structure of point- wise topological logic F TL , the structure of matching function sigma. and the structure of matching neighborhood group. We investigate approximate reasoning in pointwise topological logic F TL with matching function sigma, develop pointwise topological algorithm of simple approximate reasoning, introduce the essential characteristics of this scheme.

关键词： Lattices Fuzzy logic computer science Knowledge engineering Fuzzy systems Information technology Laboratories Intelligent systems Automation Information science

来源：评论

学校读者我要写书评

暂无评论

GPU accelerated fast FEM deformation simulation

GPU accelerated fast FEM deformation simulation

引用

IEEE Asia-Pacific Conference on Circuits and Systems

作者： Youquan Liu Shaohui Jiao Wen Wu Suvranu De State Key Lab of Computer Science Institute of Software Chinese Academy and Sciences Beijing China Faculty of Science and Technology University of Macau Macao China Department of Computer Science and Engineering Chinese University of Hong Kong Hong Kong China Faculty of Information Technology Macau University of Science and Technology Macao China Department of Mechanical Aerospace and Nuclear Engineering Rensselaer Polytechnic Institute Troy NY USA

In this paper we present a general FEM (finite element method) solution that enables fast dynamic deformation simulation on the newly available GPU (graphics processing unit) hardware with compute unified device architecture (CUDA) from NVIDIA. CUDA-enabled GPUs harness the power of 128 processors which allow data parallel computations. Compared to the previous GPGPU, it is significantly more flexible with a C language interface. We not only implement FEM deformation computation algorithms with CUDA but also analyze the performance in detail. Our test results indicate that the GPU with CUDA enables about 4 times speedup for FEM deformation computation on an Intel(R) Core 2 Quad 2.0 GHz machine with GeForce 8800 GTX.

关键词： Acceleration Deformable models Computational modeling Finite element methods Graphics Hardware computer architecture Concurrent computing Performance analysis Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A Fuzzy Particle Swarm Approach to Multiobjective Quadratic Assignment Problems

A Fuzzy Particle Swarm Approach to Multiobjective Quadratic ...

引用

Asia International Conference on Modeling & Simulation

作者： Mingyan Zhao Ajith Abraham Crina Grosan Hongbo Liu School of Software Dalian University of Technology Dalian China Centre for Quantifiable Quality of Service in Communication Systems Norwegian University of Science and Technology Trondheim Norway Department of Computer Science Faculty of Mathematics and Computer Science Babes Bolyai University Cluj-Napoca Romania School of Computer Science and Engineering Dalian Maritime University Dalian China

The multiobjective Quadratic Assignment Problem (mQAP) is considered as one of the hardest optimization problems but with many real-world applications. Since it may not be possible to simply weight the importance of each flow for the mQAP, it is best to use Pareto optimization to obtain the Pareto front or an approximation of it. Although Particle Swarm Optimization (PSO) algorithm has exhibited good performance across a wide range of application problems, research on mQAP has not much been investigated. This paper introduces a fuzzy particle swarm algorithm to handle the Multiobjective Quadratic Assignment Problem (mQAP). In the fuzzy scheme, the representations of the position and velocity of the particles in the conventional PSO is extended from the real vectors to fuzzy matrices. A new mapping is introduced between the particles in the swarm and the problem space in an efficient way. We evaluated the performance of the proposed approach. Empirical results illustrate that the approach can be applied for solving mQAP's very effectively.

关键词： Particle swarm optimization computer science Ant colony optimization Asia Mathematical model computer simulation Fuzzy systems Communication system software software quality Quality of service

来源：评论

学校读者我要写书评

暂无评论

How to Combine Requirements engineering and Interaction Design?

How to Combine Requirements Engineering and Interaction Desi...

引用

IEEE International Conference on Requirements engineering

作者： Hermann Kaindl Larry Constantine Oscar Pastor Alistair Sutcliffe Didar Zowghi Institute of Computer Technology University of Technology Vienna Vienna Austria Human-Centered Software Engineering Lab University of Madeira Constantine & Lockwood limited USA Department of Informatics Systems and Computation Universitad Politécnica de Valencia Spain Systems Engineering in Manchester Business School University of Manchester Institute of Science and Technology UK Faculty of Information Technology University of Technology (UTS) Australia

In this panel, we propose to figure out how requirements engineering and interaction design can be usefully combined. In particular, some people argue that scenarios/ use cases should be concrete, as in story-telling. Others argue for use of "essential" use cases as a methodological approach to interaction and user-interface design. Somewhat in the middle, it is argued that use cases should help acquiring the requirements in the first place. What should the practitioner believe and, in particular, do, in order to develop useful and usable software and systems? software development and interaction design require different skills and different methods and are typically done by different people. Still, scenario-based design is proposed for several activities relevant for both tasks, such as requirements elicitation, software design, and interaction design. Symbolic modeling in this spirit is actually common to various fields. However, scenario-based approaches vary, especially with regard to their use, e.g., employing abstract use cases or integrating scenarios with functions and goals in a systematic design process. So, the key issue to be raised at the panel is how to combine different approaches, e.g., in scenario-based development, so that the interaction design as well as the development of the user interface and of the software internally result in an overall useful and useable system.

关键词： Design engineering Concrete User interfaces Usability Human computer interaction software systems Programming software design Process design Systems engineering and theory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：