Rank order filters and priority queues

Summary A derivation of a parallel algorithm for rank order filtering is presented. Both derivation and result differ from earlier designs: the derivations are less complicated and the result allows a number of different implementations. The same derivation is used to design a collection of priority queues. Both filters and priority queues are highly efficient: they have constant response time and small latency. Anne Kaldewaij received an M.Sc. degree in Mathematics from the University of Utrecht (The Netherlands) and a Ph.D. degree in Computing Science from the Eindhoven University of Technology. Currently, he is associate professor in Computing Science at Eindhoven University. His research includes parallel programming and the design of algorithms and data structures. He enjoys teaching and he has written a number of textbooks on mathematics and programming. Jan Tijmen Udding received an M.Sc. degree in Mathematics in 1980 and a Ph.D. degree in Computing Science in 1984 from Eindhoven University of Technology. Currently, he is associate professor at Groningen University. His main research interests are mathematical aspects of VLSI, program derivation and correctness, and functional programming.     

Software tools for micro-analysis of programs

The paper proposes and describes several tools enabling their user to estimate the efficiency of Pascal or C-like programs. The approach consists of generating symbolic formulas expressing the efficiency of the programs being analyzed. The formulas are applicable to a variety of compiler-machine configurations. The actual numeric values of the variables in the symbolic formula are determined using linear programming techniques. The proposed approach reduces considerably the amount of benchmarking needed to analyze programs. Several examples are presented showing the applicability of the tools. The effort necessary to implement them is considerably reduced by the combined usage of Prolog and a symbolic formula manipulation package (Maple).     

On the monotonicity of (LDL) logic programs with set

LDL is one of the recently proposed logical query languages, which incorporate set, for data and knowledge base systems. Since LDL programs can simulate negation, they are not monotonic in general. On the other hand, there are monotonic LDL programs. This paper addresses the natural question of “When are the generally nonmonotonic LDL programs monotonic?” and investigates related topics such as useful applications for monotonicity. We discuss four kinds of monotonicity, and examine two of them in depth. The first of the two, called “ω-monotonicity”, is shown to be undecidable even when limited to single-stratum programs. The second, called “uniform monotonicity”, is shown to implyω-monotonicity. We characterize the uniform monotonicity of a program (i) by a relationship between its Bancilhon-Khoshafian semantics and its LDL semantics, and (ii) with a useful property called subset completion independence. Characterization (ii) implies that uniformly monotonie programs can be evaluated more efficiently by discarding dominated facts. Finally, we provide some necessary and/or sufficient, syntactic conditions for uniform monotonicity. The conditions pinpoint (a) enumerated set terms, (b) negations of membership and inclusion, and (c) sharing of set terms as the main source for nonuniform monotonicity.     

Does the Youth Corrections System Work? Tracking the Effectiveness of Intervention Efforts With Delinquent Boys in State Custody.

This study adopted a systemic approach to studying intervention efforts with delinquent youth, examining the association between several youth corrections programs and adult criminal outcomes. Two studies were designed to use juvenile and adult court records to evaluate the effectiveness of treatment programs provided to delinquent youth in state custody. The results of Study 1 suggested that court-recorded delinquent charges can be used to estimate delinquency severity. The results of Study 2 presented a discouraging but not entirely unexpected illustration of the effectiveness of intervention efforts among delinquent youth. It was found that time spent in juvenile detention facilities, work programs, and group homes was associated with negative adult criminal outcomes. No links between time spent in youth corrections programs and positive outcomes were identified. Implications for future program evaluation efforts are discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Barriers to Increased Engineering Graduate Enrollments: Counterforces and Their Implementation

This paper highlights the role of the faculty member in recruiting students currently enrolled in B.S. programs in engineering and the sciences into full-time pursuit of a graduate-level engineering degree. The faculty member is demonstrated to be in a unique position to influence such students, providing strong counterforces to a confluence of attitudes and pressures experienced during the B.S. experience which effectively create a barrier to full-time engineering graduate study. We analyze this barrier via the method of force field analysis, and demonstrate that effective recruitment into full-time graduate study must be based on a four-fold strategy of education, expectations, improved B.S. experience and better control of the B.S. environment. Approaches to implement these strategies are discussed.     

Optimal tracing and replay for debugging message-passing parallel programs

A common debugging strategy involves reexecuting a program (on a given input) over and over, each time gaining more information about bugs. Such techniques can fail on message-passing parallel programs. Because of nondeterminacy, different runs on the given input may produce different results. This nonrepeatability is a serious debugging problem, since an execution cannot always be reproduced to track down bugs. This paper presents a technique for tracing and replaying message-passing programs. By tracing the order in which messages are delivered, a reexecution can be forced to deliver messages in their original order, reproducing the original execution. To reduce the overhead of such a scheme, we show that the delivery'order of only messages involved inraces need be traced (and not every message). Our technique makes run-time decisions to detect and trace racing messages and is usuallyoptimal in the sense that the minimal number of racing messages is traced. Experiments indicate that only 1% of the messages are often traced, gaining a reduction of two orders of magnitude over traditional techniques that trace every message. These traces allow an execution to be reproduced any number of times for debugging. Our work is novel in that we adaptively decide what to trace, and trace only those messages that introduce nondeterminacy. With our strategy, large reductions in trace size allow long-running programs to be replayed that were previously unmanageable. In addition, the reduced tracing requirements alleviate tracing bottle-necks, allowing executions to be debugged with substantially lower execution time overhead.This work was supported in part by National Science Foundation grants CCR-8815928 and CCR-9100968, Office of Naval Research grant N00014-89-J-1222, and a grant from Sequent Computer Systems, Inc.     

COMPILE-TIME ANALYSIS AND OPTIMIZATION OF EXPLICITLY PARALLEL PROGRAMS*

Data flow analysis has been used by compilers in diverse contexts, from optimization to register allocation. Traditional analysis of sequential programs has centered on scalar variables. More recently, several researchers have investigated analysis of array sections for optimizations on modern architectures. This information has been used to distribute data, optimize data movement and vectorize or parallelize programs. As multiprocessors become more common-place. we believe there will be considerable interest in explicitly parallel programming languages. In this paper, we extend traditional analysis to array section analysis for parallel languages which include additional control and synchronization structures.

We show how to compute array section data flow information, i.e., Communication Sets, for a class of parallel programs. To illustrate its use, we show how this information can be applied in compile-time program partitioning. Information about array accesses can also be used to improve estimates of program execution time used to direct runtime thread scheduling.     

基于MVC和EF的学位与研究生教育信息管理系统设计与实现

为促进学校学位与研究生教育信息管理水平,在MVC设计模式基础上结合EF(ADO.NET Entity Framework)框架和Ajax技术,探讨学位与研究生教育信息管理系统的设计与实现。系统包括用户管理、学籍管理、课程管理、成绩管理、奖学金管理、导师管理、双盲评审管理和学位信息管理8个模块,具有较好的可用性、稳定性和可扩展性。     

Future energy goals for Maryland: Greenhouse gas reductions

Legislative requirements in Maryland set very robust goals for the implementation of energy efficiency by utilities. Significant energy savings has been achieved in all customer sectors and efficiency gains have been made over time in equipment and building construction. Looking forward, utilities should implement programs to promote energy efficiency with a greater emphasis on GHG reductions. Feasibility studies need to occur, but flexibility is key given changing codes and standards and market transformation.     

Solid Edge的数据库开发技术在族类零件开发中的应用

用Solid Edge的数据库开发技术对族类零件进行开发，采用基于Jet数据库引擎的AD0数据控件访问方法和各种数据绑定控件并编写应用程序，对零件进行有效的管理并实现参数化设计，为后续的CAX和并行工程提供数据模型。