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

Interval set cluster analysis: A re-formulation 1

12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, RSFDGrC 2009

作者： Yao, Yiyu Lingras, Pawan Wang, Ruizhi Miao, Duoqian Department of Computer Science University of Regina Regina SK S4S 0A2 Canada Department of Mathematics and Computing Science Saint Mary's University Halifax NS B3H 3C3 Canada Dept. of Comp. Science and Technology Key Laboratory of Embedded System and Service Computing Tongji University Shanghai 201804 China

ISBN: (数字)9783642106460

ISBN: (纸本)3642106455

A new clustering strategy is proposed based on interval sets, which is an alternative formulation different from the ones used in the existing studies. Instead of using a single set as the representation of a cluster, each cluster is represented by an interval set that is defined by a pair of sets called the lower and upper bounds. Elements in the lower bound are typical elements of the cluster and elements between the upper and lower bounds are fringe elements of the cluster. A cluster is therefore more realistically characterized by a set of core elements and a set of boundary elements. Two types of interval set clusterings are proposed, one is non-overlapping lower bound interval set clustering and the other is overlapping lower bound interval set clusterings, corresponding to the standard partition based and covering based clusterings. © 2009 Springer-Verlag Berlin Heidelberg.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Approximate dynamic job-shop scheduling optimization for semiconductor assembly based on swarm intelligence

引用

Nanjing Li Gong Daxue Xuebao/Journal of Nanjing University of Science and Technology 2009年第SUPPL. 1期33卷 39-46页

作者： Kang, Qi Yang, Dong-Sheng Wang, Lei Wu, Qi-Di College of Electronics and Information Engineering Shanghai 201804 China Key Laboratory of Embedded System and Computer-service of Ministry of Education Tongji University Shanghai 201804 China

An approximate dynamic optimization method is proposed for a kind of semiconductor assembly job-shop scheduling based on swarm intelligence. In this method, a heuristic swarm stochastic optimization technology, i. e., the particle swarm optimization is adopted to find an optimal operation. sequence and the schedule strategy having the minimal total make-span (TMS) in its admissible sequence space. Meanwhile, a discrete dynamic programming approach is integrated to particle fitness evaluation. The numerical example based on the simplified produce model and the actual produce data is studied to illustrate the effectiveness of the method for job-shop scheduling.

关键词： Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

Integrated verification model atsFPM based on functional, time and spatial constraints

引用

Jisuanji Xuebao/Chinese Journal of computers 2009年第4期32卷 740-750页

作者： Niu, Jun Zeng, Guo-Sun Chen, Bo Department of Computer Science and Technology Tongji University Shanghai 201804 China Key Laboratory of Embedded System and Service Computing of Ministry of Education Shanghai 201804 China College of Information Engineering Zhejiang Business Technology Institute Ningbo 315012 China

Nowadays complex information system's integrated formal models of function verification and performance evaluation lack properties constraint about space aspect. This paper presents an integrated verification model atsFPM by defining a space requirement function over the states of the considered information system. The patterns of paths which are based on regular expressions is proposed in order to specify the functional specifications. The syntax and semantic of the model atsFPM is defined. A conversion product model is obtained by the combination of the system model and the automaton of the pattern of paths which expresses the functional specifications. The verification of the model atsFPM is tackled by the performance verification technique of Markov Reward Model. Experimental results show that the atsFPM model and its verification approach can satisfy the modeling of information system and verification of functional and performance specifications.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

Process-aware service composition based on Petri net

引用

Journal of Harbin Institute of Technology (New Series) 2008年第SUPPL.期15卷 162-166页

作者： Sun, Ping Li, Xiangmei Department of Computer Science and Engineering Tongji University Shanghai 201804 China Embedded System and Service Computing Key Laboratory Shanghai 201804 China

One of the most promising advantages of Web service technology is the possibility of creating value-added services by combining existing ones. A major challenge is how to discover and select concrete service according to user requirements. This paper addresses the topic of service discovery composite Web services. The main feature is that we take the process model as well as service profile into account. Firstly, the process models of Web services are translated into Petri nets. Based on this, we propose a service matchmaking algorithm, via comparing the functionality compatibility and process consistency, thus leading to more accurate matchmaking.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Optimization dynamics evaluation mode for particle swarm algorithm

引用

Nanjing Li Gong Daxue Xuebao/Journal of Nanjing University of Science and Technology 2009年第SUPPL. 1期33卷 1-6页

作者： An, Jing Yang, Dong-Sheng Wang, Lei Kang, Qi Wu, Qi-Di College of Electronics and Information Engineering Tongji University Shanghai 201804 China School of Mechanical and Automation Engineering Shanghai Institute of Technology Shanghai 200235 China Embedded System and Computer-service Key Laboratory of Ministry of Education Tongji University Shanghai 201804 China

Based on the fundamental evaluation index system of intelligent optimization, a type of optimization dynamics evaluation mode for particle swarm algorithm is presented here. The mode is used for general optimization performance and particles'population dynamics. In the evaluation mode, primary indexes include optimum value, population dynamic aggregation, population center convergence and population diversity. Numerical optimization simulation based on several benchmarks is studied, and the typical population dynamic results of primary indexes show that the proposed optimization dynamics evaluation mode is effective.

关键词： Population dynamics

来源：评论

学校读者我要写书评

暂无评论

Performance analysis for large scale parallel microscopic traffic simulation system

Performance analysis for large scale parallel microscopic tr...

引用

International Symposium on Advances in computer and Sensor Networks and systems, 2008

作者： Fei, Yin Dongliang, Zhang Department of Computer Science and Technology Tongji University The Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai 201804 China

ISBN: (纸本)9781427629807

In this paper, we present the parallel implementation of the traffic microsimulation PMTS (Parallel Microscopic Traffic Simulation) focusing on the performance issues. The parallelization of PMTS is domain decomposition, which means that each processor of the PC cluster is responsible for a different geographical area of the simulation region. We describe the transportation network graph partition and information exchange between domains. We demonstrate the time cost mathematics models for PMTS: the vehicle generation, vehicle position calculation, and vehicle information exchange between domains. The workload balance is obtained by adjusting the boundary lines according to the relative load of adjacent subnetworks. All these works have been proved to be effective when PMTS put into use and the experiment results are also provided which match our analysis.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Optimal Dynamic-Priority Real-Time Scheduling Algorithms for Uniform Multiprocessors

Optimal Dynamic-Priority Real-Time Scheduling Algorithms for...

引用

Real-Time systems Symposium (RTSS)

作者： Shih-Ying Chen Chih-Wen Hsueh Embedded System and Wireless Network Laboratory Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan

In hard-real-time environment, scheduling periodic tasks upon multiprocessors is one of the most popular problems where uniform multiprocessor scheduling is a well-known one. In this platform, execution time of each task in one processor is proportional to the computing capacity of this processor. From previous works, we know there are only approximate feasible solutions for on-line scheduling on uniform multiprocessors. In this paper, with task migration, we first present a novel model called T-Ler plane to describe the behavior of tasks and processors, and two optimal on-line algorithms based on T-Ler plane to schedule real-time tasks with dynamic-priority assignment on uniform multiprocessors. To make it practical and to reduce context switches, we also present a polynomial-time algorithm to bound the times of rescheduling in a T-Ler plane. Since task migration is easier in SOC multicore processors, our result might be applicable and adapted to many asymmetric multicore platforms.

关键词： Scheduling algorithm Processor scheduling Optimal scheduling Job shop scheduling Multicore processing Concurrent computing Real time systems Dynamic scheduling Switches Linux

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Smartphone Edition based on embedded Linux

Design and Implementation of Smartphone Edition based on Emb...

引用

International Conference on Advanced Communication Technology (ICACT)

作者： Do-Hyung Kim Min-Hong Yun Sun-Ja Kim Cheol-Hoon Lee Embedded S/W Research Division Electronics and Telecommunications Research Institute South Korea Department of Computer Engineering System Software Laboratory Chungnam National University South Korea

The paper describes the design and implementation of Qplus Smartphone Edition based on embedded Linux. Existing Smartphone platforms entailed royalty expenses and had customization difficulties due to the closure of their source codes. The Qplus Smartphone Edition requires no royalty because it is based on the embedded Linux. And, it supports key navigation functionality such as moving between folders or running applications with key-only operations. It also provides more user friendly environment through screen interfaces and indicators similar to those of the cellular phones.

关键词： Linux Application software Kernel Graphics Libraries Cellular phones Databases Navigation Software architecture Telephony

来源：评论

学校读者我要写书评

暂无评论

Formal Verification of Bypassed Processor Pipelines

Formal Verification of Bypassed Processor Pipelines

引用

The 9th International Conference for Young computer Scientists(第九届国际青年计算机大会)

作者： Yanyan Gao Xi Li Department of Computer Science University of Science and Technology of China Hefei 230027 China Embedded System Laboratory Suzhou Institute for Advanced Study University of Science and Technology of China Suzhou 215123 China

With the development and application of pipeline technique in processor, the verification of pipeline designs is becoming important in academies and industries. This paper presents a method to model and check the correctness of pipeline with bypass configuration at instruction level. This method is based on model checking, a method of formal verification. This method not only suits for the complete bypass design, but also can be used to check the validation of partial bypass configuration. The properties a bypassed design should satisfy are also provided. And the abstracted model can be verified automatically by using NuSMV, which is a tool used for model checking. If the properties cannot be satisfied, a counterexample is created to help correct the design or the model.

关键词： Bypass verification processor ASIP pipeline.

来源：评论

学校读者我要写书评

暂无评论

CSLive: A Live Streaming Overlay with Cooperative Swarming

CSLive: A Live Streaming Overlay with Cooperative Swarming

引用

International Conference on Parallel and Distributed systems (ICPADS)

作者： Yi-Chun Chen Wen-Hung Sun Chiu-Ping Chang Chung-Ta King Yueh-Feng Lee Department of Computer Science National Tsing Hua University Hsinchu Taiwan Department of Internet Embedded System (X100) Information & Communications Research Laboratory Industrial Technology Research Institute Hsinchu Taiwan

Peer-to-peer (P2P) live streaming systems gain a lot of attention recently. Among the various architectures, the gossip-based approach holds great potential and has been used in real systems. In a gossip-based P2P streaming system, peer nodes are grouped together to exchange pieces of the live stream with each other. Maintaining the group and pulling the streaming data from other peers incur nontrivial overhead. This paper proposes CSLive, a P2P streaming system which gathers nodes that have good network proximity into clusters and lets nodes in the same cluster cooperate with each other to pull the stream. Each node in the cluster is responsible for pulling a subset of the stream, while pushing the subset to other nodes in the cluster. With the cooperative operations, a node can receive most streaming data from other nodes in the same cluster, which have good communication quality. The proposed system is evaluated with simulation.

关键词： Peer to peer computing computer science Internet embedded system Communication industry computer industry computer architecture Stability Bandwidth Information retrieval

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：