OA系统/软件/办公设备与耗材招标采购公告

<正>出入境证件研究室展柜及办公家具招标采购招标代理:武警学院政府采购中心项目名称:出入境证件研究室展柜及办公家具报名截止:2011-11-04采购内容:展柜15.5延米、文件柜3个、文件更衣柜3个、电子     

OA系统/软件/办公设备与耗材招标采购公告

疏勒县直单位电脑、打印机、复印机等办公自动化设备招标采购公告招标编号:KSSLX(GK)2011-013号招标代理:喀什地区疏勒县政府采购办所属行业:电脑网络计算机,电工电子电器,办公文教采购内容:电脑,打印机,复印机,照相机,摄像机,投影仪开标时间及地点:2011年7月7日10:00     

OA系统/软件/办公设备与耗材招标采购公告

正公交分局办公配套设施招标采购招标编号:FSGP1111355X招标代理:山市公共资源交易中心项目名称:佛山市公安局公交分局办公配套设施报名截止:2012-01-04采购内容:办公配套设施询价文件公示时间:2011年12月26日-2011年12月30日公示公告时间:2011年12月26日-2012年01月12日     

OA系统/软件/办公设备与耗材招标采购公告

人力资源和社会保障局办公家具询价采购招标编号:HTHWZB-2012-031招标代理:广西海特建设工程项目咨询管理有限公司项目名称:合浦县人力资源和社会保障局办公家具采购采购内容:办公家具一批购买询价采购文件时间时间:即日起至2012年4月11日,上午8:00时至12:00时,下午14:30时至17:30时。地点:广西海特建设工程项目咨询管理有限公司合浦分公司(广西     

OA系统/软件/办公设备与耗材招标采购公告

兵团统一采购中心办公自动化设备协议采购招标公告招标编号:BTCG-ZB2010-028招标代理:兵团统一采购中心报名截止:2010-09-26招标内容:计算机(台式和笔记本电脑)、服务器(塔式、机架式、刀片式)、杀毒软件(单机版、网络版)、低端网络交换机、低端路由器、低端防火墙、办公软件、移动存储、存储设备、UPS电源、复印机(含耗材及配件)、打印机(含耗材及配件)、扫描仪(板式、高速文档式、     

OA系统／软件／办公设备与耗材招标采购公告

疏勒县直单位 电脑、打印机、复印机等办公自动化设备招标采购公告 招标编号：KSSLX（GK）2011-013号 招标代理：喀什地区疏勒县政府采购办 所属行业：电脑网络计算机,电工电子电器,办公文教 采购内容：电脑,打印机,复印机,照相机,摄像机,投影仪 开标时间及地点：2011年7月7日10：00     

OA系统/软件/办公设备与耗材招标采购公告

江门市财政局财政局办公自动化设备招标采购公告招标编号:JM2010-A006招标代理:江门市政府采购中心采购名称:江门市财政局办公自动化设备采购项目用途:办公自动化。主要品牌设备(服务器、笔记本电脑、台式电脑     

OA系统/软件/办公设备与耗材招标采购公告

<正>教育局教学设备招标采购招标编号:KSZPX(CK)(2011)07招标代理:泽普县政府采购中心项目名称:教学设备报名截止:2011-09-26采购内容:体育器材,卫生保健室器材,理化生实验器材,药品,地理教室器材,历史教室器材,数学教学辅助工具,政治思品教学辅助图片,美术教室器材和美术教学辅助工具。老师办公桌椅,阅览桌椅,阅览椅,讲桌,餐桌椅,书架、书柜,铁皮仪器柜,药品柜,衣柜(4节柜)。校园数字化电视台,电子阅览室设备与电子书,数字化语言室,理化生     

OA系统/软件/办公设备与耗材招标采购公告

兵团统一采购中心办公自动化设备协议采购招标公告招 标编号：BTCG-ZB2010-028 招标代理：兵团统一采购中心报名截止：2010-09-26 招标内容：计算机（台式和笔记本电脑）、服务器（塔式、机架式、刀片式）、杀毒软件（单机版、网络版）、低端网络交换机、低端路由器、低端防火墙、办公软件、移动存储、存储设备、UPS电源、复印机（含耗材及配件）、打印机（含耗材及配件）、扫描仪（板式、高速文档式、     

OA系统／软件／办公设备与耗材招标采购公告

山东省海洋与渔业厅、山东省微湖监狱渔船智能化管理信息系统、网络设备及OA设备招标采购公告招标编号:SDGP2008-344招标代理:山东省省级机关政府采购中心报名截止:2009-02-10采购公告:手持执法终端读卡器;渔船台式读写器、渔民自助式触摸查询机;渔船智能化管理系统软件;信息卡;超短波通信定位终端设备;网络设备;办公自动化设备。     

M/G/c/K blocking probability models and system performance

An exact solution for the M/G/c/K model is only possible for special cases, such as exponential service, a single server, or no waiting room at all. Instead of basing the approximation on an infinite capacity queue as is often the case, an approximation based on a closed-form expression derivable from the finite capacity exponential queue is presented. Properties of the closed-form expression along with its use in approximating the blocking probability of M/G/c/K systems are discussed. Extensive experiments are provided to test and verify the efficacy of our approximate results.     

设计模式变体的描述与验证*

为解决标准设计模式演化后难以检测的问题,引入设计模式变体思想,以Bridge模式为例,给出了八种常用的变体实现,并以人工形式挖掘了四种开源系统中Bridge模式变体的基准数,接着在Apache Ant1.6.2与JHotDraw5.1开源系统中通过六种主流设计模式检测工具进行了变体检测实验。试验结果表明,FCA-CBR方法简单有效,对2种开源系统中Bridge模式变体检测的精确率达到60%与48.1%,与先前方法相比有了较大的提高。     

(r∞, n12, s12) measurements on the 2-CPU CRAY X-MP

We report performance measurements made on the 2-CPU CRAY X-MP at ECMWF, Reading. Vector (SIMD) performance on one CPU is interpreted by the two parameters ($\text{r}{}_{\mathrm{\infty }}\text{, n}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$), and we find for dyadic operations using FORTRAN $\text{r}{}_{\mathrm{\infty }}\text{= 70}\text{Mflop/s}\text{, n}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{= 53}\text{flop}$. All vector triadic operations produce $\text{r}{}_{\mathrm{\infty }}\text{= 107}\text{Mflop/s}\text{, n}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{= 45}\text{flop}$; and a triadic operation with two vectors and one scalar gives r_∞ = 148 Mflop/s and $\text{n}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{= 60}\text{flop}$. MIMD performance using both CPUs on one job is interpreted with the two parameters ($\text{r}{}_{\mathrm{\infty }}\text{, s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$), where $\text{s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ is the amount of arithmetic that could have been done during the time taken to synchronize the two CPUs. We find, for dyadic operations using the TSKSTART and TSKWAIT synchronization primitives, that r_∞ = 130 Mflop/s and $\text{s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{= 5700}\text{flop}$. This means that a job must contain more than ～ 6000 floating-point operations if it is to run at more than 50% of the maximum performance when split between both CPUs by this method. Less expensive synchronization methods using LOCKS and EVENTS reduces $\text{s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ to 4000 flop and 2000 flop respectively. A simplified form of LOCK synchronization written in CAL code further reduces $\text{s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ to 220 flop. This is probably the minimum possible value for synchronization overhead on the CRAY X-MP.     

Complex random sample scheduling and its application to an N/M/F/Fmax problem

“Complex Random Sample Scheduling(CRSS)” was proposed in this paper as an efficient heuristic method for solving any permutation scheduling problems. To show the effectiveness of the proposed CRSS, it was applied to an N-job, M-machine, permutation flowshop scheduling problem to minimize makespan, N/M/F/F_max. Numerical experiments made it clear that the proposed CRSS provides a schedule very close to the near-optimal schedule obtained by the existing promising heuristic methods such as taboo search and simulated annealing, within less computation time than these heuristic methods.     

Geom/G/1/n system with LIFO discipline without interrupts and constrained total amount of customers

Consideration was given to the discrete-time queuing system with inversive servicing without interrupts, second-order geometrical arrivals, arbitrary (discrete) distribution of the customer length, and finite buffer. Each arriving customer has length and random volume. The total volume of the customers sojourning in the system is bounded by some value. Formulas of the stationary state probabilities and stationary distribution of the time of customer sojourn in the system were established.     

Efficient implementation of Johnson''s rule for the n/2/F/Fmax scheduling problem

Several efficient algorithms of O(n log n) computational complexity, for the Johnson's rule to schedule a set of simultaneously available jobs on two machines in a flowship to minimize the maximum job flowtime have appeared in the literature. A modified version of one of these algorithms is presented which not only simplifies the programming effort for implementation but is also able to generate all possible optimal sequences obtainable from Johnson's rule.     

On the M/Ck/1 queue

We obtain the exact analytic expression of the probability distribution of the number of units in a single server queue with Poisson arrivals and Coxian service time distribution (notated as M/C_k/1). A recursive procedure for calculating this probability distribution is given. The well-known queues M/E_k/1 and M/D/1 are re-derived as special cases of the M/C_k/1 queue. Finally, the cases of M/C₂/1 and M/C₃/1 are fully worked out.