ppxscal/embedding_network huggingface dataset:
Microwave Engineering with Wireless Applications, 1st edition
Authors: S. R. Pennock, P. R. Shepherd
Venue:  (1998)

:Beyond traditional microwave engineering lies an intriguing new set of challenges. More and more the spectra of choice in the rapidly expanding field of mobile communications,microwaves offer exciting opportunities to engineers. This up-to-the-minute guide gives you both a thorough grounding in basic microwave engineering principles plus all the information you need to develop circuits and systems for the newest applications. Comprehensive and rigorous enough for use as a text,this book offers engineers and advanced students a clear understanding of microwave engineering in radar,communications,antennas,and mobile radio,along with thorough explanations of underlying principles. In this age of mobile telecommunications,Microwave Engineering with Wireless Applications may become the most valuable resource you own. Join the New Age of Microwave Engineering. Beyond traditional microwave engineering lies an intriguing new set of challenges. More and more the spectra of choice in the rapidly expanding field of mobile communications,microwaves offer exciting opportunities to engineers. This up-to-the-minute guide gives you both a thorough grounding in basic microwave engineering principles plus all the information you need to develop circuits and systems for the newest applications. Comprehensive and rigorous enough for use as a text,this book offers engineers and advanced students a clear understanding of microwave engineering in: Radar; Communications; Antennas; Mobile Radio. You'll also get complete coverage of: Transmission Lines; Electromagnetic Waves; Matching; Matrix Representation of Circuits and Signal Flow Graphs; Microstrip; Waveguides; Passive Device;Active Devices; Detectors and Mixers; Control Circuits; Amplifiers and Oscillators; Microwave Measurement. In this age of mobile telecommunications,Microwave Engineering with Wireless Applications may become the most valuable resource you own.
On the Synthesis of Optimal Schedulers in Discrete Event Control Problems with Multiple Goals
Authors: Hervé Marchand, Olivier Boivineau, Stéphane Lafortune
Venue: SIAM Journal on Control and Optimization (2000)

This paper deals with a new type of optimal control for discrete event systems. Our control problem extends the theory of [R. Sengupta and S. Lafortune, SIAM J. Control Optim., 36 (1998), pp. 488--541] that is characterized by the presence of uncontrollable events, the notion of occurrence and control costs for events, and a worst-case objective function. A significant difference with [R. Sengupta and S. Lafortune, SIAM J. Control Optim., 36 (1998), pp. 488--541] is that our aim is to make the system evolve through a set of multiple goals, one by one, with no order necessarily prespecified, whereas the previous theory only deals with a single goal. Our solution approach is divided into two steps. In the first step, we use the optimal control theory in [R. Sengupta and S. Lafortune, SIAM J. Control Optim., 36 (1998), pp. 488--541] to synthesize individual controllers for each goal. In the second step, we develop the solution of another optimal control problem, namely, how to modify if necessary and piece together, or schedule, all of the controllers built in the first step in order to visit each of the goals with the least total cost. We solve this problem by defining the notion of a scheduler and then by mapping the problem of finding an optimal scheduler to an instance of the well-known traveling salesman problem (TSP) [E. L. Lawler, J. K. Lenstra, A. H. G. Rinooy Kan, and D. B. Shmoys, The Traveling Salesman Problem, John Wiley, 1985]. We finally suggest various strategies to reduce the complexity of the TSP resolution while still preserving global optimality.
Parallel Strategies for Rank-k Updating of the QR Decomposition
Authors: Erricos J. Kontoghiorghes
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

Parallel strategies based on Givens rotations are proposed for updating the QR decomposition of an n &times; n matrix after a rank-k change (k < n). The complexity analyses of the Givens algorithms are based on the total number of Givens rotations applied to a 2-element vector. The algorithms, which are extensions of the rank-1 updating method, achieve the updating using approximately 2(k + n) compound disjoint Givens rotations (CDGRs) with elements annihilated by rotations in adjacent planes. Block generalization of the serial rank-1 algorithms are also presented. The algorithms are rich in level 3 BLAS operations, making them suitable for implementation on large scale parallel systems. The performance of some of the algorithms on a 2-D SIMD (single instruction stream--multiple instruction stream) array processor is discussed.
Enhancing GISs for spatio-temporal reasoning
Authors: A. Raffaetà, F. Turini, C. Renso
Venue: Proceedings of the 10th ACM international symposium on Advances in geographic information systems (2002)

We present a system which provides geographical information systems (GISs) with enhanced capabilities for supporting spatio-temporal reasoning. On top of a commercial GIS we build a software layer supplying the user with a declarative spatio-temporal interaction with the underlying GIS. Declarative spatio-temporal reasoning is supported by the language MuTACLP, a constraint logic based knowledge representation language that offers facilities for modeling and handling spatio-temporal information, enriched with some basic operators for combining different spatio-temporal knowledge bases. We describe the architecture of the system and we illustrate an actual implementation. The underlying GIS is ArcGIS 8.1, the language MuTACLP is implemented in Sicstus Prolog and the GIS interface establishing the connection between ArcGIS 8.1 and MuTACLP is realized in Visual Basic. Finally, we highlight the usefulness of this approach by modeling a case study regarding the behavioral ecology of crested porcupines.
Are Bilinear Quadrilaterals Better Than Linear Triangles?
Authors: E. F. D'Azevedo
Venue: SIAM Journal on Scientific Computing (2000)

This paper compares the theoretical effectiveness of bilinear approximation over quadrilaterals with linear approximation over triangles. Anisotropic mesh transformation is used to generate asymptotically optimally efficient meshes for piecewise linear interpolation over triangles and bilinear interpolation over quadrilaterals. For approximating a convex function, although bilinear quadrilaterals are more efficient, linear triangles are more accurate and may be preferred in finite element computations; whereas for saddle-shaped functions, quadrilaterals may offer a higher-order approximation on a well-designed mesh. A surprising finding is different grid orientations may yield an order of magnitude improvement in approximation accuracy
Graphics and GUIs with MATLAB
Authors: Patrick Marchand
Venue:  (2002)

:Graphics and GUIs with MATLAB completely examines the MATLAB graphics system, describing the enhancements and added features of MATLAB 5. This second edition provides illustrative example sets to simplify the process of learning and mastering the powerful, flexible, and easy-to-use graphics environment. This book serves technical professionals using MATLAB's plotting capabilities, MATLAB programmers learning about the graphics environment, anyone creating pictures using mathematical expressions. 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
CCEA Exam Cram
Authors: Anoop Jalan, Travis Guinn, Gene Beaty
Venue:  (2001)

:The Citrix CCEA MetaFrame 1.8 for Windows Exam Cram study guide will give readers the knowledge necessary to both understand the underlying technologies and pass the CCEA exams. Candidates must pass four of the following exams covered in this study guide-Citrix Resource Management Services Exam (910), Citrix Installation Management Services Exam (920), SecureICA and Security exam (930), Load Balancing Services/Citrix Program Neighborhood exam (940), and the Citrix Nfuse Administration Exam (950). The book employs the proven Exam Cram method to efficiently coach the reader on key exam subjects like Load Balancing and Program Neighborhood, Citrix Installation Management Services, Resource Management Services, and Secure ICA. CCEA Candidates also benefit from well-liked Exam Cram features like tear-out cram sheets and memory-joggers, sections on proven test-taking strategies, warnings on trick questions, and time-saving study tips.
AutoCAD 14 for Mechanical Engineers, with 2 CD-ROMs (Mastering)
Authors: George Omura, Steven Keith
Venue:  (1997)

:George Omura's best-selling AutoCAD book has just been revamped for mechanical engineers. No longer will mechanical engineers have to learn AutoCAD through the eyes of an architect--this book was written exclusively for them. With lots of coverage on 3D modeling and relevant real-world examples, the big and growing market of mechanical engineers using AutoCAD will embrace this book. The companion CD features a fully searchable, electronic version of the AutoCAD 14 Instant Reference, plus drawings from the book, relevant libraries, useful utilities and shareware. This is the only solution for mechanical engineers!
Cosmopolitanism and the internet
Authors: Edward Spence
Venue: Selected papers from the second Australian Institute conference on Computer ethics (2000)

The argument in this paper comprises of four separate but interrelated theses:
Fundamentals of Computing II: Abstraction,Data Structures,and Large Software Systems,C++ Edition, 2nd edition
Authors: Allen B. Tucker, Bradley W. James, Robert D. Cupper, Richard G. Epstein, Kelemen
Venue:  (1994)

:This is a C++ text for the second course in an integrated curriculum for computer science. This volume is organized around a study of abstraction and its use in data structures and algorithms. Abstraction is the basic step in the software engineering lifecycle,and is a fundamental tool for advanced work in solving large,complex problems in computer science. A highly integrated lab manual offers students the opportunity for hands-on experience.
Learning style translation for the lines of a drawing
Authors: William T. Freeman, Joshua B. Tenenbaum, Egon C. Pasztor
Venue: ACM Transactions on Graphics (TOG) (2003)

We present an example-based method for translating line drawings into different styles. We fit each line as a linear combination of similar lines in a training set, and interpolate between the corresponding training examples in the output style. The synthesized lines preserve the desired stylistic features of the output style.
Concrete Abstractions: An Introduction to Computer Science Using Scheme, 1st edition
Authors: Max Hailperin, Barbara Kaiser, Karl Knight
Venue:  (1999)

:CONCRETE IONS offers students a hands-on, abstraction-based experience of thinking like a computer scientist. This text covers the basics of programming and data structures, and gives first-time computer science students the opportunity to not only write programs, but to prove theorems and analyze algorithms as well. Students learn a variety of programming styles, including functional programming, assembly-language programming, and object-oriented programming (OOP). While most of the book uses the Scheme programming language, Java is introduced at the end as a second example of an OOP system and to demonstrate concepts of concurrent programming.
Programming Microsoft Outlook 2000
Authors: Gordon Padwick, Ken Slovak
Venue:  (1999)

:Learn professional Outlook development techniques from authors Gordon Padwick and Ken Slovak, professional Windows developers. Apply the concepts, code, and real-world applications to your own projects to build sophisticated Outlook applications and become a more advanced developer. Written by professional developers for developers, Programming Outlook 2000 provides a code-intensive, solutions-oriented approach to application development. A complete guide to programming Outlook for automation, workgroups, customization, integration with other Office applications, and more Learn how to how to use the Outlook VBE development environment, Outlook application-level and application-wide event handling, and error handling Design custom additions to Outlook functionality
A fast dynamic channel assignment algorithm for packet services in DECT
Authors: Antonio Capone, Luigi Musumeci
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1997)

In this paper we consider the use of DECT access for packet data services. DECT systems are characterized by a dynamic channel selection algorithm which allows to reuse the available radio resources in a flexible way. The standard channel allocation procedure results inefficient for packet data applications characterized by short and frequent messages, which determine fast varying traffic conditions. We propose an enhanced dynamic channel selection algorithm, which allows to fulfil the requirements of packet access in a more efficient way. The performance characteristics of the new and standard algorithm have been evaluated by simulation, and refer both to a scenario for only packet data services and an integrated scenario for voice and data services.
A Local Problem Error Estimator for Anisotropic Tetrahedral Finite Element Meshes
Authors: Gerd Kunert
Venue: SIAM Journal on Numerical Analysis (2001)

The Poisson problem is solved by the finite element method on anisotropic tetrahedral or triangular meshes. The focus is on adaptive algorithms and, in particular, on a posteriori error estimators based on the solution of a local problem. On anisotropic meshes, such estimators cannot be analyzed in the common way known from isotropic meshes.The first estimator proposed here is a slight modification of a familiar isotropic counterpart. By a rigorous analysis it is proven that this estimator is equivalent to a known anisotropic residual error estimator. Hence the local problem error estimator also yields reliable upper and lower error bounds on anisotropic meshes. The local problems are shown to be well-conditioned.Two further local problem error estimators originally defined for isotropic meshes are investigated in the anisotropic context here. The results reveal the significance of the proper choice of local problem. Furthermore the analysis covers Dirichlet, Neumann, and Robin boundary conditions. Particular attention is paid to the Robin boundary conditions since they require a different treatment than the Neumann boundary conditions. A numerical example supports the error analysis.
Computer Algorithms: Introduction to Design and Analysis, 3rd edition
Authors: Sara Baase, Allen Van Gelder
Venue:  (1999)

:This edition features an increased emphasis on algorithm design techniques such as divide-and-conquer and greedy algorithms, along with the addition of new topics and exercises. It continues the tradition of solid mathematical analysis and clear writing style: emphasizes the development of algorithms through a step-by-step process rather than by merely presenting the end result; stresses the importance of the algorithm analysis process - continuously re-evaluating, modifying, and perhaps rejecting algorithms until a satisfactory solution is attained; provides extensive treatment of recursion with a clear, student-friendly review of how it works and why it is a valuable programming technique; uses a Java-like pseudocode; and includes an appendix with java examples.
Emergence of Noopolitik: Toward an American Information Strategy
Authors: John Arquilla, David Ronfeldt
Venue:  (1999)

:This report builds on what we have accomplished so far in a set of studies, since 1991, about future military affairs (cyberwar), societal-level conflict and crime (netwar), and information strategy (see the Bibliography for relevant citations). Here we advance the idea of "noopolitik" (n-oh-poh-li-teek), a new approach to statecraft based principally on the primacy of ideas, values, laws, and ethics, as enabled by the emergence of the noosphere (an all-encompassing realm of the mind), to extend our research agenda in a new direction. Primarily of interest to U.S. policymakers and strategists, this report will also interest those in academia and think tanks concerned with how the information revolution is altering the conditions for and conduct of strategy. This study was prepared for a project on information strategy. The project was sponsored by the Office of the Assistant Secretary of Defense/Command, Control, Communications, and Intelligence (OASD/C3I), and was conducted within both the Acquisition and Technology Policy Center and the International Security and Defense Policy Center of RAND's National Defense Research Institute (NDRI). NDRI is a federally funded research and development center sponsored by the Office of the Secretary of Defense, the Joint Staff, the Unified Commands, and the defense agencies. John Arquilla David Ronfeldt U.S. Naval Postgraduate School RAND Monterey, CA 93943 Santa Monica, CA 90407-2138 (408) 656-3450 (310) 393-0411 jarquilla@nps.navy.mil ronfeldt@rand.org
Some examples of quasi-interpolants constructed from local spline projectors
Authors: Byung-Gook Lee, Tom Lyche, Knut Mørken
Venue: Mathematical Methods for Curves and Surfaces: Oslo 2000 (2001)

We give a recipe for deriving local spline approximation methods which reproduce the whole spline space. The methods are obtained by solving a series of local approximation problems. Examples of specific quadratic and cubic approximation methods are given.
Web-Enabled Data Warehouse
Authors: William A. Giovinazzo
Venue:  (2002)

:Link business intelligence to the Web! Technologies, integration, and applications. Internet-enabled business intelligence: from planning to profit In-depth coverage of integration and key enabling technologies, including Java and XML Advanced analysis and profiling: understand customers better, and respond faster Clickstrean analysis: understanding how customers use your site Linking data warehouses to CRM and other enterprise/value chain systemsThis is the first start-to-finish guide to planning, deploying, and profiting from Internet-enabled data warehouses. Leading business intelligence specialist William Giovinazzo covers every enabling technology, every analysis approach, and every key challenge you'll face in linking business intelligence to the Web. From infrastructure integration to state-of-the-art profiling and wireless applications, Giovinazzo shows how everything fits togetherand exactly how to use Web-enabled data warehouses to deliver powerful ROI in your business. How the Internet enhances your business intelligence infrastructure Leveraging key enabling technologies: Java, XML, XSL, and more Breakthrough analysis techniques: understand customers better, and respond faster! Integrating data warehouses with CRM and other enterprise and inter-enterprise systems Establishing common warehouse metadata Drawing on the clickstreams generated by your Web and e-commerce sites Personalization techniques that work
Flash (tm) MX Bible, 1st edition
Authors: Robert Reinhardt, Snow Dowd
Venue:  (2002)

:Master Flash fundamentals and create animations and interfaces for complete Web projects Take your projects to the next level with tips and specialized production techniques from over 30 Flash experts Harness the power of ActionScript and new MX features to build dynamic Flash applications "The Flash MX Bible is the only book that offers an indispensable wealth of reference material, as well as rich and in-depth tutorials."-- Eric Jordan, President / Chief Creative Officer 2Advanced Studios If Flash MX can do it, you can do it too . . . Whether youre a Web development newcomer or a Flash 5 veteran, this book shows you step by step how to make the most of Flash MX and take any Web site to the next level. Packed with examples and illustrations including 16 pages in full color as well as expert tutorials from Flash pros, it delivers everything from a "Flash in a Flash" Quick Start to brand-new coverage of embedded video, accessibility options, components, font applications, ColdFusion, and Pocket PC movies. Its all you need to unleash the power of Flash MX and start creating state-of-the-art animations, interfaces, and dynamic applications. Inside, youll find complete coverage of Flash MX Get up to speed fast using the "Flash in a Flash" Quick Start Discover secrets for streamlined production of engaging animated graphics and effective interfaces Make the most of enhanced Flash MX drawing tools and animation controls Build complete Web projects using Flash and dynamically loaded content Harness ActionScript, pre-built components, and native JPEG and MP3 loading to create dynamic effects, interactive games, and more Integrate Flash content with Dreamweaver, ColdFusion, and other applications Create art and effects with Flash MX drawing tools Use ActionScript to load JPEGS into your site at runtime Bonus CD-ROM Additional expert tutorials, chapters on troubleshooting Flash movies, and appendixes of Flash MX compatible formats and actions Reusable ActionScript components and complete FLA files from examples described in the book Sorenson Squeeze for Flash MX video compressor trial software Color Schemer shareware and ColorSafe and Swift 3D demos
The Distance of Potentially Stable Sign Patterns to the Unstable Matrices
Authors: Qing Lin, D. D. Olesky, P. vanden Driessche
Venue: SIAM Journal on Matrix Analysis and Applications (2002)

A measure $\delta_{us}(A)$ of the relative distance to the unstable matrices for a stable $n$-by-$n$ matrix $A$ is defined and extended to a potentially stable sign pattern. It is shown that $\delta_{us}(A) \in (0,1]$ and $|\delta_{us}(A)-\delta_{us}(B)|$ is bounded above in terms of ||A-B||2. For n=2, there is a unique (up to permutation and signature similarity) minimally potentially stable sign pattern, and an optimal stable matrix (i.e., having maximal relative distance to the unstable matrices) is determined analytically. For n=3 and 4 a complete list of all minimally potentially stable tree sign patterns is given and an approximation to an optimal matrix is found for each of these patterns. Such a matrix is also computed for some rooted trees with n=5, and these results can be applied to estimate the distance to the unstable matrices for more general potentially stable sign patterns.
Direct Engineering: Toward Intelligent Manufacturing
Authors: Ali K. Kamrani, Peter R. Sferro
Venue:  (1999)

:Direct Engineering: Toward Intelligent Manufacturing addresses the following recent topics related to the development, implementation, and integration of the DE environment: (1) the current scope of the research in intelligent manufacturing: (2) presents the results of the technologies and tools developed for integrated product and process design, and (3) examines the methodologies and algorithms used for the implementation of direct engineering.
Comments on 'Novel Totally Self-Checking Berger Checker Designs Based on Generalized Berger Code Partitioning'
Authors: Stanislaw J. Piestrak
Venue: IEEE Transactions on Computers (2002)

Rao et al.proposed a totally self-checking (TSC) 2-output checker for Berger codes with \big. I=2^{r-1}\bigr. information bits. These comments show that their checker may not be self-testing, as claimed. Hence, the circuit proposed by us is the first correct solution of this design problem.