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

Annual IEEE Symposium on Foundations of computer science

作者： L. Babai A. Shpilka D. Stefankovic Department of Computer Science University of Chicago Chicago IL USA Mathematics Institute Hungarian Academy of Sciences (ATOMKI) Budapest Hungary Laboratory for Computer Science M.I.T. Cambridge MA USA Division of Engineering and Applied Sciences Harvard University Cambridge MA USA Department of Computer Science Comenius University Bratislava Slovakia

Cyclic linear codes of block length n over a finite field F/sub q/ are the linear subspaces of F/sub q//sup n/ that are invariant under a cyclic shift of their coordinates. A family of codes is good if all the codes in the family have constant rate and constant normalized distance (distance divided by block length). It is a long-standing open problem whether there exists a good family of cyclic linear codes based on F.J. MacWilliams and N.J.A. Sloane (1977). A code C is r-testable if there exist a randomized algorithm which, given a word x /spl isin/ F/sub q//sup n/, adaptively selects r positions, checks the entries of x in the selected positions, and makes a decision (accept or reject x) based on the positions selected and the numbers found, such that (i) if x /spl isin/ C then x is surely accepted; (ii) if dist(x,C) /spl ges/ /spl epsi/n then x is probably rejected (dist refers to Hamming distance). A family of codes is locally testable if all members of the family are r-testable for some constant r. This concept arose from holographic proofs/PCPs. O. Goldreich and M. Sudan (2002) asked whether there exist good, locally testable families of codes. In this paper we address the intersection of the two questions stated.

关键词： Testing computer science

来源：评论

学校读者我要写书评

暂无评论

Direct methods for matrix Sylvester and Lyapunov equations

引用

Journal of applied mathematics 2003年第6期2003卷 277-303页

作者： Sorensen, Danny C. Zhou, Yunkai Department of Computational and Applied Mathematics Rice University Houston TX 77005-1892 United States Department of Computational and Applied Mathematics Rice University Houston TX 77005-1892 United States Argonne National Laboratory Math and Computer Science Division Argonne IL 60439 United States

We revisit the two standard dense methods for matrix Sylvester and Lyapunov equations: The Bartels-Stewart method for A1X+XA2+D=0 and Hammarling's method for AX+XAT+BBT=0 with A stable. We construct three schemes for solving the unitarily reduced quasitriangular systems. We also construct a new rank-1 updating scheme in Hammarling's method. This new scheme is able to accommodate a B with more columns than rows as well as the usual case of a B with more rows than columns, while Hammarling's original scheme needs to separate these two cases. We compared all of our schemes with the Matlab Sylvester and Lyapunov solver lyap.m;the results show that our schemes are much more efficient. We also compare our schemes with the Lyapunov solver sllyap in the currently possibly the most efficient control library package SLICOT;numerical results show our scheme to be competitive. © 2003 Hindawi Publishing Corporation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Human systems integration and advanced technology in engineering department workload and manpower reduction

引用

NAVAL ENGINEERS JOURNAL 2003年第1期115卷 57-65页

作者： Lively, KA Seman, AJ Kirkpatrick, M KENNETH A. LIVELY graduated from the University of Colorado with a BS in applied mathematics and an MS in mathematics in 1976 and from the Massachusetts Institute of Technology with an MS in electrical engineering and the degree ocean engineer in naval architecture and marine engineering in 1984. He retired from the U.S. Navy in 1989 after 23 years of service. Assignments included electrical officer on the USS Constellation (CV 64) project engineer for the DDG 51 machinery control system (NAVSEA) and DDG 51 Technical Director (NAVSEA). He was vice president of the PDI Division of Bird-Johnson Company from July 1989 to November 1998 where he managed various gas turbine and machinery controls related development projects. He joined Anteon Corporation's Systems Engineering Group as senior controls engineer in December 1998 where he provided technical support to the integrated power systems program (NAVSEA PMS 510) and managed the Office of Naval Research Afloat Laboratory. DR. MARK KIRKPATRICK is currently an independent consultant in human factors and work-load/manning analysis and modeling. He holds a Ph.D. degree in experimental psychology from The Ohio State University and has 34 years of experience in applied human factors. From 1982 through 2000 Dr. Kirkpatrick served as the senior vice president of Carlow International. Prior to joining Carlow in 1982 Dr. Kirkpatrick served as a member of the technical staff at North American Rockwell's Missiles Division and as a project director and vice president for Essex Corporation. His areas of expertise include workload simulation task analysis operator-in-the-loop simulation human performance experimentation statistical analysis and human factors T&E. He has directed and/or participated in human factors projects for the U.S. Navy U.S. Army NASA Department of Transportation the U.S. Nuclear Regulatory Commission and private industry. ANTHONY J. SEMAN III is the technical manager for the reduced ship's crew by virtual presence (RSVP) advanced technology d

Aboard current ships, such as the DDG 51, engineering control and damage control activities are manpower intensive. It is anticipated that, for future combatants, the workload demand arising from operation of systems under conditions of normal steaming and during casualty response will need to be markedly reduced via automated monitoring, autonomous control, and other technology initiatives. Current DDG 51 class ships can be considered as a manpower baseline and under Condition III typical engineering control involves seven to eight watchstanders at manned stations in the Central Control Station, the engine rooms and other machinery spaces. In contrast to this manning level, initiatives such as DD 21 and the integrated engineering plant (IEP) envision a partnership between the operator and the automation system, with more and more of the operator's functions being shifted to the automation system as manning levels decrease. This paper describes some human systems integration studies of workload demand reduction and, consequently, manning reduction that can be achieved due to application of several advanced technology concepts. Advanced system concept studies in relation to workload demand are described and reviewed including. Piecemeal applications of diverse automation and remote control technology concepts to selected high driver tasks in current DDG 51 activities. Development of the reduced ship's crew by virtual presence system that will provide automated monitoring and display to operators of machinery health, compartment conditions, and personnel health. The IEP envisions the machinery control system as a provider of resources that are used by various consumers around the ship. Resource needs and consumer priorities are at all times dependent upon the ship's current mission and the availability of equipment pawnbrokers.

关键词： Naval warfare

来源：评论

学校读者我要写书评

暂无评论

Asserting performance expectations

Asserting performance expectations

引用

2002 IEEE/ACM Conference on Supercomputing, SC 2002

作者： Vetter, Jeffrey S. Worley, Patrick H. Center for Applied Scientific Computing Lawrence Livermore National Laboratory LivermoreCA94551 United States Computer Science and Mathematics Division Oak Ridge National Laboratory Oak RidgeTN37831-6367 United States

ISBN: (纸本)076951524X

Traditional techniques for performance analysis provide a means for extracting and analyzing raw performance information from applications. Users then compare this raw data to their performance expectations for application constructs. This comparison can be tedious for the scale of today's architectures and software systems. To address this situation, we present a methodology and prototype that allows users to assert performance expectations explicitly in their source code using performance assertions. As the application executes, each performance assertion in the application collects data implicitly to verify the assertion. By allowing the user to specify a performance expectation with individual code segments, the runtime system can jettison raw data for measurements that pass their expectation, while reacting to failures with a variety of responses. We present several compelling uses of performance assertions with our operational prototype, including raising a performance exception, validating a performance model, and adapting an algorithm empirically at runtime. © 2002 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

B-splines on 3-D tetrahedron partition in four-directional mesh

引用

science China mathematics 2001年第4期44卷 491-496页

作者：孙家昶施锡泉 1. Parallel Computing Division and Laboratory of Computer Science Institute of Software Chinese Academy of Sciences 100080 Beijing China 2. Department of Applied Mathematics University of Dalian 116024 Dalian China

It is more difficult to construct 3-D splines than in 2-D case. Some results in the three directional meshes of bivariate case have been e xtended to 3-D case and corresponding tetrahedron partition has been constructed. The support of related Bsplines and their recurrent formulas on integration and differentiationdifference are obtained. The results of this paper can be extended into higher dimension spaces, and can be also used in wavelet analysis, because of the relationship between spline and wavelets.

关键词： high dimensional splines box splines tetrahedron partition

来源：评论

学校读者我要写书评

暂无评论

Approximate and Compensate: A method for risk-sensitive meta-deliberation and continual computation

Approximate and Compensate: A method for risk-sensitive meta...

引用

2001 AAAI Fall Symposium

作者： Parkes, David C. Greenwald, Lloyd G. Division of Engineering and Applied Sciences Harvard University CambridgeMA02138 United States Mathematics and Computer Science Drexel University PhiladelphiaPA19104 United States

We present a flexible procedure for a resource-bounded agent to allocate limited computational resources to on-line problem solving. Our APPROXIMATE AND COMPENSATE methodology extends a well-known greedy time-slicing approach to conditions in which performance profiles may be non-concave and there is uncertainty in the environment and/or problem-solving procedures of an agent. With this method, the agent first approximates problem-solving performance and problem parameters with standard parameterized models. Second, the agent computes a risk-management factor that compensates for the risk inherent in the approximation. The risk-management factor represents a mean-variance tradeoff that may be derived optimally off-line using any available information. Theoretical and experimental results demonstrate that APPROXIMATE AND COMPENSATE extends existing methods to new problems and expands the practical application of meta-deliberation. © 2001, AAAI (***). All rights reserved.

关键词： Risk management

来源：评论

学校读者我要写书评

暂无评论

TSP cuts which do not conform to the template paradigm 5th

引用

5th International Conference on Mobile Agents, MA 2001

作者： Applegate, David Bixby, Robert Chvátal, Vašek Cook, William Algorithms and Optimization Department AT and T Labs – Research Florham ParkNJ07932 United States Computational and Applied Mathematics Rice University HoustonTX77005 United States Department of Computer Science Rutgers University PiscatawayNJ08854 United States Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States

ISBN: (纸本)3540428771

The first computer implementation of the Dantzig-Fulkerson- Johnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequalities as well as cutting planes of Gomory’s type. The practice of looking for and using cuts that match prescribed templates in conjunction with Gomory cuts was continued in computer codes of Miliotis, Land, and Fleischmann. Gr¨otschel, Padberg, and Hong advocated a different policy, where the template paradigm is the only source of cuts;furthermore, they argued for drawing the templates exclusively from the set of linear inequalities that induce facets of the TSP polytope. These policies were adopted in the work of Crowder and Padberg, in the work of Gr¨otschel and Holland, and in the work of Padberg and Rinaldi;their computer codes produced the most impressive computational TSP successes of the nineteen eighties. Eventually, the template paradigm became the standard frame of reference for cutting planes in the TSP. The purpose of this paper is to describe a technique for finding cuts that disdains all understanding of the TSP polytope and bashes on regardless of all prescribed templates. Combining this technique with the traditional template approach was a crucial step in our solutions of a 13,509-city TSP instance and a 15,112-city TSP instance. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of a CORBA commodity grid kit 2nd

引用

2nd International Workshop on Grid Computing, GRID 2001

作者： Vema, Snigdha Parashart, Manish Gawor, Jarek von Laszewski, Gregor The Applied Software Systems Laboratory Department of Electrical and Computer Engineering Rutgers University 94 Brett Road PiscatawayNJ08854-8058 United States Mathematics and Computer Science Division Argonne National Laboratory 9700 S. Cass Ave ArgonneIl60440 United States

ISBN: (纸本)3540429492

This paper reports on an ongoing research project aimed at designing and deploying a COMA Commodity Grid (COG) Kit. The overall goal of this project is to explore how commodity distributed computing technologies and state-of-the-art software engineering practices can be used for the development of advanced Grid applications. As part of this activity, we are investigating how CORBA can be integrated with the existing Grid infrastructure. In this paper, we present the design of a CORBA Commodity Grid Kit that provides a software development framework for building a CORBA "Grid domain." We then present our experiences in developing a prototype CORBA COG Kit that supports the development and deployment of CORBA applications on the Grid by providing them access to the Grid services provided by the Globus toolkit. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Common object request broker architecture (CORBA)

来源：评论

学校读者我要写书评

暂无评论

End-to-end provision of policy information for network QoS

End-to-end provision of policy information for network QoS

引用

International Symposium on High Performance Distributed Computing

作者： V. Sander W.A. Adamson I. Foster A. Roy Central Institute for Applied Mathematics Forschungszentrum Jülich GmbH Julich Germany Center for Information Technology Integration University of Michigan Ann Arbor MI USA Department of Computer Science University of Chicago Chicago IL USA Mathematics and Computer Science Division Argonne National Laboratory Argonne IL USA

High-end networked applications such as distance visualization, distributed data analysis, and advanced collaborative environments have demanding quality of service (QoS) requirements. We focus on making policy decisions when users attempt to make reservations for network bandwidth across several administrative network domains that are controlled by a bandwidth broker. We present a signalling protocol that facilitates the establishment of a distributed policy decision point as well as the establishment of a direct signalling channel between the source and end domains.

关键词： Bandwidth Quality of service computer science Application software mathematics Protocols computer networks Distributed computing Grid computing Scalability

来源：评论

学校读者我要写书评

暂无评论

Quantitative comparative evaluation of 2D vector field visualization methods

Quantitative comparative evaluation of 2D vector field visua...

引用

IEEE Conference on Visualization

作者： D.H. Laidlaw R.M. Kirby J.S. Davidson T.S. Miller M. da Silva W.H. Warren M. Tarr Department of Computer Science Brown University Providence RI USA Division of Applied Mathematics Brown University Providence RI Department of Cognitive and Linguistic Sciences Brown University Providence RI USA

Presents results from a user study that compared six visualization methods for 2D vector data. Two methods used different distributions of short arrows, two used different distributions of integral curves, one used wedges located to suggest flow lines, and the final one was line-integral convolution (LIC). We defined three simple but representative tasks for users to perform using visualizations from each method: (1) locating all critical points in an image, (2) identifying critical point types, and (3) advecting a particle. The results show different strengths and weaknesses for each method. We found that users performed better with methods that: (1) showed the sign of vectors within the vector field, (2) visually represented integral curves, and (3) visually represented the locations of critical points. These results provide quantitative support for some of the anecdotal evidence concerning visualization methods. The tasks and testing framework also provide a basis for comparing other visualization methods, for creating more effective methods and for defining additional tasks to further understand tradeoffs among methods. They may also be useful for evaluating 2D vectors on 2D surfaces embedded in 3D and for defining analogous tasks for 3D visualization methods.

关键词： Data visualization Streaming media Convolution Testing computer science mathematics Chromium computer graphics Application software computer applications

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：