ppxscal/embedding_network huggingface dataset:
A model of successful collaboration and integration of help desk/computer training services and resources
Authors: Sue R. Bauer, Cindy Grether
Venue: Proceedings of the 30th annual ACM SIGUCCS conference on User services (2002)

From a first-person perspective the presenters described thumbnail accounts of collaborative strategies undertaken to create a successful integration of Help Desk and Computer Training services and resources at California Lutheran University, a four-year liberal arts school. Concrete examples describing real life scenarios piqued and maintained poster session visitors' interests. Presenters encouraged and mentored visitors toward developing and articulating practical, creative methods for maximizing resources in their own IT departments. Strategies/programs set forth in the poster session included:Innovative "new-hire" orientation programs that reduce employee turnover campus-wideManagement of digital/online training materialsDevelopment of "just-in-time" in-house IT training programs based on employee-competency needCreation, facilitation, and maintenance of a weekly "tech tip" column in multiple campus publicationsIntegration of faculty, staff and student in-house trainingStudent body and student worker IT training and orientation programs.To stimulate dialogue with visitors, presenters encouraged discussion and questions while describing evidence of benefits rendered by the collaborative strategies. In addition, a glimpse of anticipated future projects were discussed as visitor interests indicated. Presenters also shared tips participants may wish to consider in order to create a more thorough integration of the Help Desk and Training functions at their own institutions.
Quantum Mechanics
Authors: Sara M. McMurry, Alex Van Someren
Venue:  (1993)

:This book provides an introduction to the theoretical foundations of quantum mechanics for students of experimental physics. It is intended as an intermediate text for those who have already completed an introductory course in quantum physics.
Cases in Electronic Commerce, 2nd edition
Authors: Sidney Laurence Huff, Michael Wade, Scott L. Schneberger, Sid L. Huff
Venue:  (2001)

:Cases in Electronic Commerce is a collection of 25 full-length case studies written by professors at the renowned Richard Ivey School of Business. Each case study is centered around a real-world company and provides sufficient detail on the implications associated with e-commerce initiatives. This managerial-oriented approach allows students to fully understand and appreciate the strategic,tactical,and operational challenges faced when launching an e-commerce-based business.
Judicial Applications of Artificial Intelligence
Authors: Giovanni Sartori, Karl Branting
Venue:  (1998)

:The judiciary is in the early stages of a transformation in which AI (Artificial Intelligence) technology will help to make the judicial process faster, cheaper, and more predictable without compromising the integrity of judges' discretionary reasoning. Judicial decision-making is an area of daunting complexity, where highly sophisticated legal expertise merges with cognitive and emotional competence. How can AI contribute to a process that encompasses such a wide range of knowledge, judgment, and experience? Rather than aiming at the impossible dream (or nightmare) of building an automatic judge, AI research has had two more practical goals: producing tools to support judicial activities, including programs for intelligent document assembly, case retrieval, and support for discretionary decision-making; and developing new analytical tools for understanding and modeling the judicial process, such as case-based reasoning and formal models of dialectics, argumentation, and negotiation.May promote uniformity and efficiency in judicial practice, while supporting rational judicial discretion. Similarly AI may promote flexibility, efficiency and accuracy in other judicial tasks, such as drafting various judicial documents. The contributions in this volume exemplify some of the directions that the AI transformation of the judiciary will take.
DBASE 5 for Windows (Unleashed), 1st edition
Authors: Ernest Escobar, Paul Mahar
Venue:  (1994)

:This hands-on tutorial, with its step-by-step approach, serves as a practical training guide and valuable reference for the experienced user. With extensive coverage of the new features and capabilities, this is the ultimate guide to dBASE for Windows.Tips and tricks from the Borland Development Team increase users' productivityMoves users from the DOS world to the Windows environment quickly and effortlesslyDisk features programming examples from the book which save readers hours of typing
Creating Web Pages with HTML: Comprehensive, 2nd edition
Authors: Patrick Carey, Joan Carey
Venue:  (2000)

:Part of the New Perspectives series, this text offers a case-based, problem-solving approach for learning basic to more advanced features of Web page creation using HTML.
Improved Upper Bounds for the Real Part of Nonmaximal Eigenvalues of Nonnegative Matrices
Authors: Reinhard Nabben
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

In this note we improve two upper bounds for the real part of nonmaximal eigenvalues of nonnegative irreducible matrices. We also improve an upper bound for the spectral radius of principal submatrices of nonnegative matrices.
Low-Cost Task Scheduling for Distributed-Memory Machines
Authors: Andrei Radulescu, Arjan J. C. van Gemund
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

In compile-time task scheduling for distributed-memory systems, list scheduling is generally accepted as an attractive approach since it pairs low cost with good results. List scheduling algorithms schedule tasks in order of their priority. This priority can be computed either 1) statically, before the scheduling, or 2) dynamically, during the scheduling. In this paper, we show that list scheduling with statically computed priorities can be performed at a significantly lower cost than existing approaches, without sacrificing performance. Our approach is general, i.e., it can be applied to any list scheduling algorithm with static priorities. The low-complexity is achieved by using low-complexity methods for the most time consuming parts in list scheduling algorithms, i.e., processor selection and task selection, preserving the criteria used in the original algorithms. We exemplify our method by applying it to the MCP algorithm. Using an extension of this method, we can also reduce the time complexity of a particular class of list scheduling with dynamic priorities (including algorithms such as DLS, ETF, or ERT). Our results confirm that the modified versions of the list scheduling algorithms obtain a performance comparable to their original versions, yet at a significantly lower cost. We also show that the modified versions of the list scheduling algorithms consistently outperform multistep algorithms, such as DSC-LLB, which also have higher complexity and clearly outperform algorithms in the same class of complexity, such as CPM.
Beginning Linux Programming, 2nd edition
Authors: Neil Matthew, Richard Stones
Venue:  (1999)

:Building on the proven success of the first edition this book continues its unique aproach to teaching UNIX programming in a simple and structured way on the Linux platform. Through the use of detailed and realistic examples, the reader learns by doing, and in the course of a single book, is able to move from being a Linux beginner to creating custom Internet applications in Linux.
Adaptive Wavelet Methods for Saddle Point Problems---Optimal Convergence Rates
Authors: Stephan Dahlke, Wolfgang Dahmen, Karsten Urban
Venue: SIAM Journal on Numerical Analysis (2002)

In this paper an adaptive wavelet scheme for saddle point problems is developed and analyzed. Under the assumption that the underlying continuous problem satisfies the inf-sup condition, it is shown in the first part under which circumstances the scheme exhibits asymptotically optimal complexity. This means that within a certain range the convergence rate which relates the achieved accuracy to the number of involved degrees of freedom is asymptotically the same as the error of the best wavelet N-term approximation of the solution with respect to the relevant norms. Moreover, the computational work needed to compute the approximate solution stays proportional to the number of degrees of freedom. It is remarkable that compatibility constraints on the trial spaces such as the Ladyzhenskaya--Babuska--Brezzi (LBB) condition do not arise. In the second part the general results are applied to the Stokes problem. Aside from the verification of those requirements on the algorithmic ingredients the theoretical analysis had been based upon, the regularity of the solutions in certain Besov scales is analyzed. These results reveal under which circumstances the work/accuracy balance of the adaptive scheme is even asymptotically better than that resulting from preassigned uniform refinements. This in turn is used to select and interpret some first numerical experiments that are to quantitatively complement the theoretical results for the Stokes problem.
Existence Conditions and Properties of the Frequency Response Operators of Continuous-Time Periodic Systems
Authors: Jun Zhou, Tomomichi Hagiwara
Venue: SIAM Journal on Control and Optimization (2001)

The definition of the frequency response operator via the steady-state analysis in finite-dimensional linear continuous-time periodic (FDLCP) systems is revisited. It is shown that the frequency response operator is guaranteed to be well defined only densely on the linear space l2, which is different from the usual understanding. Fortunately, however, it turns out that this frequency response operator can have an extension onto l2 so that the equivalence between the time-domain H2 norm (respectively, the L2-induced norm) and the frequency-domain H2 norm (respectively, the $H_{\infty}$ norm of the frequency response operator) is recovered. Under some stronger assumptions, it is also shown that the frequency response operator can be viewed as a bounded operator from l1 to l1, which can also be established via the steady-state analysis.
Extensible Lattice Sequences for Quasi-Monte Carlo Quadrature
Authors: Fred J. Hickernell, Hee Sun Hong, Pierre LÉcuyer, Christiane Lemieux
Venue: SIAM Journal on Scientific Computing (2000)

Integration lattices are one of the main types of low discrepancy sets used in quasi-Monte Carlo methods. However, they have the disadvantage of being of fixed size. This article describes the construction of an infinite sequence of points, the first bm of which forms a lattice for any nonnegative integer m. Thus, if the quadrature error using an initial lattice is too large, the lattice can be extended without discarding the original points. Generating vectors for extensible lattices are found by minimizing a loss function based on some measure of discrepancy or nonuniformity of the lattice. The spectral test used for finding pseudorandom number generators is one important example of such a discrepancy. The performance of the extensible lattices proposed here is compared to that of other methods for some practical quadrature problems.
3D Studio Special Effects
Authors: New Riders
Venue:  (1994)

:The complete and behind-the-scenes guide to professional special effects! Readers learn all the amazing 3D Studio techniques used in Hollywood. CD-ROM includes everything readers need to create each special effect--plus 300M of original material maps In full color and written by noted professional artists and animators Step-by-step instructions on every effect Includes advanced IPAS plug-in effects and the use of third-party applications Covers Releases 3 & 4 The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
AutoCAD and Its Applications Basics: Release 14, 14th edition
Authors: Terence M. Shumaker, David A. Madsen
Venue:  (1998)

:This book provides comprehensive, easy-to-understand coverage of introductory and two-dimensional AutoCAD drafting. The content provides instruction for mastering AutoCAD commands and drawing techniques current with Release 14.
A New Triangular Finite-Element with Optimum Constraint Ratio for Compressible Fluids
Authors: Daniel Y. Le Roux
Venue: SIAM Journal on Scientific Computing (2001)

The discretization of the shallow-water equations using the finite-element method is a delicate problem. Apart from the possible occurrence of pressure and/or velocity modes, other spurious modes may appear that are essentially a consequence of having more momentum than continuity discretized equations, contrary to the continuum case. In this paper a new triangular finite-element pair is proposed which overcomes this imbalance problem. The new pair is shown to improve on results obtained with existing pairs in representing the propagation of fast gravity and slow Rossby waves by discretizing the linear shallow-water equations.
Power Graphics Using Turbo Pascal 6
Authors: Keith Weiskamp, Loren Heiny
Venue:  (1991)

:This hands-on, applications-oriented guidebook progresses from basic graphics programming techniques to more advanced topics such as building object-oriented drawing tools; three-dimensional graphics programming; and creating custom graphics interfaces like windows and menus. Focuses on the OOP features and tools in Turbo Pascal version 6 and provides well explained, useful examples and complete graphics programs to illustrate important concepts.
Oracle8i Sqlj Programming, 1st edition
Authors: Nirva Morisseau-Leroy, Gerald P. Momplaisir, Martin K. Solomon, Edward D. Griffin, Thomas Kurian
Venue:  (1999)

:Learn how to implement SQLJthe new standard for embedding static SQL directly into Java programs. Create powerful portable applications with SQLJ. Enable Java to go where it's never gone before! Oracle8i SQLJ Programming explains in detail how to implement SQLJthe new standard for embedding static SQL directly into Java programs. With SQLJ,you'll use less code and get enhanced portability,compile-time checking,and so much more. This authoritative guide shows you how to create cross-platform,distributed,and Web-enabled applications designed specifically for Oracle8ithe revolutionary new database complete with seamless Java integration. Every chapter includes case studies of actual Java applications developed with SQLJ. Inside,learn: Embed SQL statements within Java easily for concise,convenient codeDevelop object-oriented applications that can access SQL databases on any variables directly in SQL statements Develop SQLJ stored subprograms and triggers Catch error in your SQL statements before runtime Customize your SQLJ code for Oracle8i Customize your SQLJ code for Oracle8i Deploy SQLJ on thin,OCI-based,and KPRB JDBC server-side drivers Take advantage of SLQj's interoperability with JDBC and PL/SQL Use Java RMI and create COBRA objects and Enterprise JavaBeans components for distributed computing
Performance evaluation of domain reference architectures
Authors: K. Suzanne Barber, Jim Holt, Geoff Baker
Venue: Proceedings of the 14th international conference on Software engineering and knowledge engineering (2002)

Architectures embody the requirements expressed by system stakeholders, and the type of architecture used to capture a given set of requirements dictates when evaluation can occur and what will be evaluated. This research aims to leverage requirements and a resulting architecture dictated by the problem domain and captured early in the lifecycle. Thus, the research goal is to provide early performance evaluation in an effort to convey the most accurate blueprint to system implementers specifically and system stakeholders in general. A new software architecture evaluation tool called Arcade, developed to support the Systems Engineering Process Activities (SEPA), automates early performance evaluation of software architectures using simulation. SEPA suggests a comprehensive approach to capture and represent different types of requirements as a multi-level software architecture. One SEPA architecture level, the Domain Reference Architecture (DRA) encompasses performance characteristics inherent to the domain in terms of what processes, data, and timing are required, rather than how a system should be implemented. Performance evaluation of a DRA can provide qualitative data to (1) aid in identification and validation of domain related performance concerns, and (2) provide system implementers with performance guidelines towards satisfying the performance constraints inherent to the domain. The range of performance statistics Arcade is capable of analyzing is demonstrated through a case study of a Motorola e-business project.
The Large, the Small and the Human Mind
Authors: Roger Penrose
Venue:  (2000)

:Roger Penrose's views on the large-scale physics of the universe, the small-scale world of quantum physics and the physics of the mind are controversial and widely discussed. The Large, the Small and the Human Mind is a fascinating and accessible summary of Roger Penrose's current thinking on those areas of physics in which he feels there are major unresolved problems. It is also a stimulating introduction to the radically new concepts which he believes will be fruitful in understanding the workings of the brain and the nature of the human mind.
Microsoft FrontPage 2000 Bible, 1st edition
Authors: David Elderbrock, David Karlins
Venue:  (1999)

:With FrontPage 2000, creating a Web site has never been easier. Designed to function like any other Office 2000 program - with the same familiar menus, templates, and wizards - FrontPage 2000 enables you to build a Web site that integrates interactive multimedia elements, pre-built Office 2000 components such as spreadsheets or databases, and the very latest advances in Web technology. Using precise instructions and lots of examples, Microsoftr FrontPager 2000 Bible shows you how to harness the power of this award-winning software - and create state-of-the-art Web pages.
Locating the Least 2-Norm Solution of Linear Programs via a Path-Following Method
Authors: Yun-Bin Zhao, Duan Li
Venue: SIAM Journal on Optimization (2002)

A linear program has a unique least 2-norm solution, provided that the linear program has a solution. To locate this solution, most of the existing methods were devised to solve certain equivalent perturbed quadratic programs or unconstrained minimization problems. We provide in this paper a new theory which is different from these traditional methods and is an effective numerical method for seeking the least 2-norm solution of a linear program. The essence of this method is a (interior-point-like) path-following algorithm that traces a newly introduced regularized central path that is fairly different from the central path used in interior-point methods. One distinguishing feature of our method is that it imposes no assumption on the problem. The iterates generated by this algorithm converge to the least 2-norm solution whenever the linear program is solvable; otherwise, the iterates converge to a point which gives a minimal KKT residual when the linear program is unsolvable.
Java: First Contact, 2nd edition
Authors: Roger Garside, John Mariani
Venue:  (2002)

:Java - with its clean, elegant structure - is the perfect framework for introducing object-oriented programming and design. Master both, from the ground up, with this step-by-step guide to fundamental concepts and techniques in Java.
Javaserver Pages for Dummies, 1st edition
Authors: Mac Rinehart
Venue:  (2001)

:Covers JavaServer Pages 1.2 specificationJSP examples, tools, and more on CD-ROMFind out how JSP works with JavaScript, JavaBean, and JDBCGet up to speed with the latest JavaServer Pages specificationsWhether you're a Web designer or a Java developer, this friendly guide helps you deliver dynamic Web content. From working with basic JSP tags to harnessing JavaBeans and sophisticated JSP applications, it's just what you need to create successful JavaServer Pages.all this on the bonus CD-ROMDreamweaver UltraDev and HomeSite trial versionsTomcatJava 2 SDK Standard Ed. v1.3 for WindowsForte for Java 2.0 Community Ed. for All PlatformsAll sample code from the bookGet Smart! @www.dummies.comFind listings of all our books.Create your own personalized book with Hungry Minds a la carte.Sign up for daily eTips at www.dummiesdaily.comAuthor Biography: Mac Rinehart is the president of Sextant Technology Consulting, Inc. and a consultant specializing in JSP and Java enterprise application development. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Machine Learning and Its Applications: advanced lectures
Authors: Georgios Paliouras, Vangelis Karkaletsis, Constantine D. Spyropoulos
Venue: Springer Lecture Notes In Artificial Intelligence; Vol. 2049 (2001)

In recent years machine learning has made its way from artificial intelligence into areas of administration, commerce, and industry. Data mining is perhaps the most widely known demonstration of this migration, complemented by less publicized applications of machine learning like adaptive systems in industry, financial prediction, medical diagnosis and the construction of user profiles for Web browsers.
The Kronecker Product of Schur Functions Indexed by Two-Row Shapes or Hook Shapes
Authors: Mercedes H. Rosas
Venue: Journal of Algebraic Combinatorics: An International Journal (2001)

The Kronecker product of two Schur functions i>s&mu; and i>s&nu;, denoted by i>s&mu; &ast; i>s&nu;, is the Frobenius characteristic of the tensor product of the irreducible representations of the symmetric group corresponding to the partitions &mu; and &nu;. The coefficient of i>s&lambda; in this product is denoted by &gamma;&lambda;&mu;&nu;, and corresponds to the multiplicity of the irreducible character &chi;&lambda; in &chi;&mu;&chi;&nu;.We use Sergeev's Formula for a Schur function of a difference of two alphabets and the comultiplication expansion for i>s&lambda;[i>XY] to find closed formulas for the Kronecker coefficients &gamma;&lambda;&mu;&nu; when &lambda; is an arbitrary shape and &mu; and &nu; are hook shapes or two-row shapes.Remmel (J.B. Remmel, i>J. Algebra 120 (1989), 100&ndash;118; i>Discrete Math. 99 (1992), 265&ndash;287) and Remmel and Whitehead (J.B. Remmel and T. Whitehead, i>Bull. Belg. Math. Soc. Simon Stiven 1 (1994), 649&ndash;683) derived some closed formulas for the Kronecker product of Schur functions indexed by two-row shapes or hook shapes using a different approach. We believe that the approach of this paper is more natural. The formulas obtained are simpler and reflect the symmetry of the Kronecker product.
Time bounded medium access control for ad hoc networks
Authors: Raymond Cunningham, Vinny Cahill
Venue: Proceedings of the second ACM international workshop on Principles of mobile computing (2002)

Most previous work on medium access control (MAC) protocols for wireless ad hoc networks has focused on the twin goals of maximising throughput and minimising average packet delay as required for general-purpose applications.In this paper we describe a new MAC protocol for use in multi-hop ad hoc networks whose goal is to provide, with high probability, time-bounded access to the wireless medium for applications with guaranteed response time requirements.The Time-Bounded Medium Access Control (TBMAC) protocol is based on time-division multiple access with dynamic but predictable slot allocation. TBMAC uses a light-weight atomic multicast protocol to achieve distributed agreement on slot allocation and employs location information to minimise contention for slots.TBMAC is the first time-bounded MAC protocol for multi-hop wireless ad hoc networks. In this paper we describe the protocol and provide a number of time bounds for the transmission of messages.