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

19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded systems Design

作者： Thapliyal, Himanshu Kotiyal, Saurabh Srinivas, M.B. Center for VLSI and Embedded System Technologies International Institute of Information Technology Hyderabad-500019 India Department of Computer Engineering SIT Kukas Jaipur India

ISBN: (纸本)0769525024

IEEE 754r is the ongoing revision to the IEEE 754 floating point standard and a major enhancement to the standard is the addition of decimal format. This paper proposes two novel BCD adders called carry skip and carry look-ahead BCD adders respectively. Furthermore, in the recent years, reversible logic has emerged as a promising technology having its applications in low power CMOS, quantum computing, nanotechnology, and optical computing. It is not possible to realize quantum computing without reversible logic. Thus, this paper also paper provides the reversible logic implementation of the conventional BCD adder as the well as the proposed Carry Skip BCD adder using a recently proposed TSG gate. Furthermore, a new reversible gate called TS-3 is also being proposed and it has been shown that the proposed reversible logic implementation of the BCD Adders is much better compared to recently proposed one, in terms of number of reversible gates used and garbage outputs produced. The reversible BCD circuits designed and proposed here form the basis of the decimal ALU of a primitive quantum CPU. © 2006 IEEE.

关键词： Logic circuits

来源：评论

学校读者我要写书评

暂无评论

Modified montgomery modular multiplication using 4:2 Compressor and CSA adder

Modified montgomery modular multiplication using 4:2 Compres...

引用

Third IEEE International Workshop on Electronic Design, Test and Applications, DELTA 2006

作者： Thapliyal, Himanshu Ramasahayam, Anvesh Kotha, Vivek Reddy Gottimukkula, Kunul Srinivas, M.B. Centre for VLSI and Embedded System Technologies International Institute of Information Technology Hyderabad 500019 India Department of Electronics and Communication Engineering S.R. Engineering College Warangal India

ISBN: (纸本)0769525008

The efficiency of the Public Key encryption systems like RSA and ECC can be improved with the adoption of a faster multiplication scheme. In this paper, Modified Montgomery multiplications and circuit architectures are presented. The first modified Montgomery multiplier uses 4:2 compressor and carry save adders (CSA) to perform large word length additions. The total delay for a single modular multiplication using the proposed approach is 7XOR+1 AND gate compared to 8XOR+1AND gate of the recently proposed fastest algorithm. The second modified Montgomery multiplier uses a novel proposed hardware unit that outputs carry save representation of the 4-input operands in 3XOR delays. The total delay for a single modular multiplication using the novel hardware unit is 5XOR+1 AND gate compared to 6XOR+1AND gate of the recently proposed algorithm. The optimal transistor implementations of the proposed approaches have also been presented. The proposed transistor implementations are highly optimized in terms of area, speed and low power. The proposed Montgomery multiplication circuit will be of eminent importance when implemented for higher word length such as 1024 and 2048 as there will be saving in the propagation delays by 1024 and 2048 XOR gates respectively compared to the recently proposed fastest algorithm. © 2005 IEEE.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Towards the Diversity of Sensitive Attributes in k-Anonymity

Towards the Diversity of Sensitive Attributes in k-Anonymity

引用

Web Intelligence and Intelligent Agent Technology Workshops (WI-IAT)

作者： Min Wu Xiaojun Ye Institute of Information System and Engineering School of Software Tsinghua University Beijing China

Privacy preservation is an important and challenging problem in microdata release. As a de-identification model, k-anonymity has gained much attention recently. While focusing on identity disclosures, k-anonymity does not well resolve attribute disclosures. In this paper we focus on the sensitive attribute disclosures in k-anonymity and propose an ordinal distance based sensitivity aware diversity metric. We assume the more diversity the sensitive attribute assumes in an equivalence class in a k-anonymized table, the less inference channel there is in the equivalence class

关键词： Human immunodeficiency virus Cancer USA Councils Privacy Influenza Intelligent agent information systems systems engineering and theory Data analysis Perturbation methods

来源：评论

学校读者我要写书评

暂无评论

The consistent data replication service for distributed computing environments

The consistent data replication service for distributed comp...

引用

16th International Symposium on Methodologies for Intelligent systems, ISMIS 2006

作者： No, Jaechun Chang, Won Park Sung, Soon Park Dept. of Computer Software College of Electronics and Information Engineering Sejong University Seoul Korea Republic of Intelligent IT System Research Center Korea Electronics Technology Institute Bundang-gu Seongnam-si Korea Republic of Dept. of Computer Science and Engineering College of Science and Engineering Anyang University Anyang Korea Republic of

ISBN: (纸本)354045764X

This paper describes a data replication service for large-scale, data intensive applications whose results can be shared among geographically distributed scientists. We introduce two kinds of data replication techniques, called owner-initiated data replication and client-initiated data replication, that are developed to support data replica consistency without requiring any special file system-level locking functions. Also, we present performance results on Linux clusters located at Sejong University. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A UML Simulator for Behavioral Validation of systems Based on SOA

A UML Simulator for Behavioral Validation of Systems Based o...

引用

International Conference on Next Generation Web Services Practices (NWeSP)

作者： Hiroyuki Kurahata Taku Fuji Toshiyuki Miyamoto Sadatoshi Kumagai Department of Ele. Electrical and Information Engineering Osaka University Osaka Japan Software Engineering Center Osaka Gas Information System Research Institute Company Limited Osaka Japan

ISBN: (纸本)9780769526645

Recently SOA (service oriented architecture) attracts attention as a technique for effective software development. SOA based systems are commonly implemented with the combination of BPEL4WS and Web services. BPEL4WS is used for defining interaction between multiple Web services. Since semantics of SOA based systems are complex, the effective validation of those semantics is essential for effective development of those systems. This paper proposes a simulator and associated development procedure for the effective development of SOA based systems. The simulator can run a UML model equivalent to BPEL4WS definition and can also incorporate existing Web services in simulation. Also, design and implementation of the simulator is explained in this paper

关键词： Unified modeling language Semiconductor optical amplifiers Web services Service oriented architecture XML Simple object access protocol Programming software engineering Large-scale systems Costs

来源：评论

学校读者我要写书评

暂无评论

Adaptive Call Admission Control Based on Enhanced Genetic Algorithm in Wireless/Mobile Network

Adaptive Call Admission Control Based on Enhanced Genetic Al...

引用

18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006)

作者： Sheng-Ling Wang Yi-Bin Hou Jian-Hui Huang Zhang-Qin Huang School of Electronics and Information Engineering Xi''an Jiaotong University Xi'an China Embedded Software and System Institute Beijing University of technology Beijing China

An adaptive threshold-based Call Admission Control (CAC) scheme used in wireless/mobile network for multi-class services is proposed. In the scheme, each class's CAC thresholds are solved through establishing a reward-penalty model which tries to maximize network's revenue in terms of each class's average new call arrival rate and average handoff call arrival rate, the reward or penalty when network accepts or rejects one class's call etc. To guarantee the real time running of CAC algorithm, an enhanced Genetic Algorithm is designed. Analyses show that the CAC thresholds indeed change adoptively with the average call arrival rate. The performance comparison between the proposed scheme and Mobile IP Reservation(MIR) scheme shows that with the increase of average call arrival rate, the average new Call Blocking Probability(CBP) and the average Handoff Dropping Probability (HDP) within 2000 simulation intervals of the proposed scheme are confined to lower levels, and they show approximatively periodical trends of first rise and then decline. While these two performance metrics of MIR always increase. At last, the analysis shows the proposed scheme outperforms MIR in terms of network's revenue.

关键词： Programmable control Adaptive control Call admission control Genetic algorithms Aggregates Resource management Mobile communication Genetic engineering Embedded software Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Spatial Coding Technique for Low Power VLSI Applications

Energy Efficient Spatial Coding Technique for Low Power VLSI...

引用

IEEE International Workshop on system-on-Chip for Real-Time Applications

作者： J.V.R. Ravindra Navya Chittarvu M.B. Srinivas Center for VLSI and Embedded System Technologies (CVEST) International Institute of Information Technology Hyderabad Andhra Pradesh India Gurunanak Engineering College Hyderabad India

ISBN: (纸本)1424408989

In deep-submicron technology (DSM), minimizing the propagation delay and power dissipation on buses is the most important design objective in system-on-chip (SOC) design. In particular, the coupling effects between wires on the bus that can cause serious problems such as cross-talk delay, noise and power dissipation. Most of the researchers have concentrated either on minimizing the power dissipation or minimizing crosstalk delay. In this paper, the authors propose a technique for energy efficient data transmission for on-chip buses and evaluate the effectiveness of our technique by using SPEC 95 benchmarks suit. The authors show that our technique achieves 35% of energy savings over the un-encoded data transmission on the data bus

关键词： Energy efficiency Very large scale integration Power dissipation Crosstalk Data communication Propagation delay system-on-a-chip Couplings Wires Delay effects

来源：评论

学校读者我要写书评

暂无评论

General-Service Ballistic Computer Programming Based on B-Method

引用

Defence Technology（防务技术） 2006年第3期2卷 178-183页

作者：郑宇军张子丘王金全薛锦云 Institute of Software Chinese Academy of Sciences Beijing 100080 China Armament Demonstration and Research Center Beijing 100034 China System Engineering Research Institute of Engineer Equipment Beijing 100093 China College of Computer Information Engineering Jiangxi Normal University Nanchang 330027 Jiangxi China

Formal methods offer the promise of significant improvement on quality and reliability of critical embedded software. B-Method is employed to develop general-service ballistic computer programs in the paper, each of which can be adapted to a family of service/weapon-specific ballistic computers. Based on the structuring mechanisms of B-method, a unified approach is proposed to systematically control the complexity of ballistic parameters in the process of type and operation refinement, and ultimately a series of high reliable, reusable, and scalable programs are produced. Experiences with the application of the method and tools are also discussed.

关键词：抽象机精化弹道程序设计

来源：评论

学校读者我要写书评

暂无评论

Priority mapping problem in static real-time middleware

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2006年第4期43卷 722-728页

作者： Wang, Baojin Li, Mingshu Wang, Zhigang Institute of Information and Engineering PLA Information and Engineering University Zhengzhou 450002 China Laboratory for Internet Software Technologies Institute of Software Chinese Academy of Sciences Beijing 100080 China

The deadline monotonic (DM) priority assignment scheme and distributed priority ceiling resource access protocol (DPCP) work well with real-time CORBA. In practice, a potentially large number of global unique priorities must be mapped to the restricted number of local priorities provided by the operating systems. Most operating systems use first-in-first-out (FIFO) scheduling within the same priority. So, a high global priority task could be blocked by lower global priority tasks ahead of it in the local priority FIFO queue. This causes priority inversion and affects the schedulability of tasks with higher global priority. In addition, the optimal priority assignment requires a search of exponential complexity. This is the priority mapping problem. To solve it, necessary and sufficient conditions are presented for analyzing the schedulability of a task which global priority has been mapped to a local priority. The decreasing global priority mapping (DGPM) algorithm is also provided. It can schedule a task and global critical section (GCS) set that is schedulable under any other direct priority mapping algorithms. DGPM can overlap tasks (map two or more tasks to the same local priority) while not allowing the system to become non-schedulable, or prove that the system is no-schedulable after overlapping. The. conditions and algorithm are used in the projects.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Priority mapping algorithm without affecting the schedulability of tasks set

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2006年第6期43卷 1083-1089页

作者： Wang, Baojin Li, Mingshu Institute of Information and Engineering PLA Information and Engineering University Zhengzhou 450002 China Laboratory for Internet Software Technologies Institute of Software Chinese Academy of Sciences Beijing 100080 China Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100080 China

In practice, the schedulability of static priority scheduling may be reduced if priority levels of the system are insufficient. When the priority levels that a task set requires are more than the system can support, more than one task must be assigned the same priority. The priority mapping algorithms that have been used can augment the worst-case response time of task with higher priority, and may reduce the system schedulability. If keeping system schedulable, these algorithms may require more priority levels than the system can support. With preemption threshold scheduling model, the schedulability is improved as compared to both preemption and non-preemption scheduling models, and all tasks can be handled with the minimum number of event handling threads. But, the number of system priority levels that a thread needs does not be reduced. This paper presents a priority mapping algorithm called TSM (threshold segment mapping) and a thread implementation architecture with event-driven. It is shown that the TSM algorithm can maintain the strict order of tasks' priorities, and does not improve task's worst-case response time. The number of system priority levels used by the algorithm and architecture equals to that of threads. Simulations show that when maintaining system schedulability, the TSM algorithm uses less priority levels than existing priority mapping algorithms.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：