ppxscal/embedding_network huggingface dataset:
Systems Analysis and Design, 3rd edition
Authors: Kenneth E. Kendall, Julie E. Kendall
Venue:  (1994)

:OFTEN IMITATED, NEVER DUPLICATED... There is simply no other Systems Analysis and Design textbook as exciting as Kendall & Kendall'. Their dynamic, comprehensive presentation leaves no stone unturned. With plenty of review questions and problems, hypothetical consulting situations, an ongoing case study, and even an associated Internet-based case study, this book makes the concepts of the course understandable and motivating. You are given all the tools to learn how to become a successful systems analyst, ace your exams, and have fun doing it' YOU WANT TO LEARN HOW TO BE A SYSTEMS ANALYST AND SYSTEMS DESIGNER... This book includes expanded coverage of data flow diagrams, data dictionaries, and process specifications, as it introduces examples of new software used by analysts and designers to manage projects, analyze and document systems, design new systems, and implement their plans. YOU NEED CURRENT TOPICS IN SYSTEMS ANALYSIS AND DESIGN... The fifth edition of Systems Analysis and Design has new coverage of UML, wireless technologies, ERP, Web-based systems for e-commerce, and expanded coverage on RAD and GUI design. YOU WANT YOUR SYSTEMS ANALYSIS AND DESIGN TEXT TO GIVE YOU HANDS-ON EXPERIENCE... HyperCaseoriginal, hypertext-based software created by the authorsis located on the text's Companion Web site: www.prenhall.com/kendall. This innovative software gives users firsthand experience with a business and organizational structure, allowing you to interview employees, observe office dynamics and practices, analyze prototypes, and review existing systems. The case, a businesssimulation called "Maple Ridge Engineering," is revisited throughout the text, with end-of-chapter exercises. All activities are based on real-life consulting experiences. YOU MUST HAVE INFORMATION ON HOW TO GET EXPERIENCE AS A SYSTEMS ANALYST... The authors include new coverage on analyzing e-commerceincluding thorough new material of e-commerce Web site designand more than 70 consulting opportunities, including new ones with an e-commerce focus. Students can evaluate the political, ethical, social, and economic implications of their systems design in these mini-cases. KENDALL & KENDALL, SYSTEMS ANALYSIS AND DESIGN, FIFTH EDITION giving you the tools to learn, practice, and perfect your skills in Systems Analysis and Design like no other text on the market ever has or ever will!
Ethnic diversity in IS: What are current Ph.D. students saying?
Authors: Fay Cobb Payton, Cynthia Jackson
Venue: ACM SIGCPR Computer Personnel (1999)

Much attention has been focused on creating diversity in research in the Information Systems (IS) discipline (DeSanctis, 1993; King, 1993; Benbasat and Weber, 1996; Robey, 1996). However, ethnic diversity among the IS faculty has not been a primary research focus. African-, Hispanic- and Native-Americans represent only 4.9% of the more than 24,000 business school professors and only 2.8% of the more than 2,000 Information Systems professors. Many universities attribute this nominal minority representation to the difficulty in finding qualified, tenurable faculty members from these ethnic groups.We replicate the research of Hammond (1995) using the survey and commenter features of a group support system, GroupSystems. In particular, we explore cultural issues that may contribute to the small number of African- and Hispanic-Americans who pursue doctoral degrees in information systems/technology (IS/IT). Our results confirmed some of the cultural differences found in earlier research-such as social isolation and lack of minority faculty mentors. Our results also identified family responsibilities and the need to give back to ethnic communities as important cultural issues affecting minorities' IS/IT doctoral students.
On a Perturbation Approach for the Analysis of Stochastic Tracking Algorithms
Authors: Rafik Aguech, Eric Moulines, Pierre Priouret
Venue: SIAM Journal on Control and Optimization (2000)

In this paper, a perturbation expansion technique is introduced to decompose the tracking error of a general adaptive tracking algorithm in a linear regression model. This method results in a tracking error bound and tight approximate expressions for the moments of the tracking error. These expressions allow the evaluation, both qualitatively and quantitatively, of the impact of several factors on the tracking error performance.
Optimal Control for Continuous-Time Linear Quadratic Problems with Infinite Markov Jump Parameters
Authors: Marcelo D. Fragoso, Jack Baczynski
Venue: SIAM Journal on Control and Optimization (2001)

The subject matter of this paper is the optimal control problem for continuous-time linear systems subject to Markovian jumps in the parameters and the usual infinite-time horizon quadratic cost. What essentially distinguishes our problem from previous ones, inter alia, is that the Markov chain takes values on a countably infinite set. To tackle our problem, we make use of powerful tools from semigroup theory in Banach space and a decomplexification technique. The solution for the problem relies, in part, on the study of a countably infinite set of coupled algebraic Riccati equations (ICARE). Conditions for existence and uniqueness of a positive semidefinite solution of the ICARE are obtained via the extended concepts of stochastic stabilizability (SS) and stochastic detectability (SD). These concepts are couched into the theory of operators in Banach space and, parallel to the classical linear quadratic (LQ) case, bound up with the spectrum of a certain infinite dimensional linear operator.
Small Soldiers: Official Strategy Guides
Authors: Craig Wessel, Brady Games
Venue:  (1998)

:Learn how to navigate all the intricate puzzles layered within each mission and defeat all the Commando Elite. Small Soldiers is based on the movie by the same name and is aimed at players ages 8 and up.
A Trust Region Interior Point Algorithm for Linearly Constrained Optimization
Authors: J. Frédéric Bonnans, Cecilia Pola
Venue: SIAM Journal on Optimization (1997)

We present an extension, for nonlinear optimization under linear constraints, of an algorithm for quadratic programming using a trust region idea introduced by Ye and Tse [Math. Programming, 44 (1989), pp. 157--179] and extended by Bonnans and Bouhtou [RAIRO Rech. Opér., 29 (1995), pp. 195--217]. Due to the nonlinearity of the cost, we use a linesearch in order to reduce the step if necessary. We prove that, under suitable hypotheses, the algorithm converges to a point satisfying the first-order optimality system, and we analyze under which conditions the unit stepsize will be asymptotically accepted.
The Relational Structure of Belief Networks
Authors: S. K. M. Wong
Venue: Journal of Intelligent Information Systems (2001)

This paper demonstrates the relational structure of belief networks by establishing an extended relational data model which can be applied to both belief networks and relational applications. It is demonstrated that a Markov network can be represented as a generalized acyclic join dependency (GAJD) which is equivalent to a set of conflict-free generalized multivalued dependencies (GMVDs). A Markov network can also be characterized by an entropy function, which greatly facilitates the manipulation of GMVDs. These results are extensions of results established in relational theory. It is shown that there exists a complete set of inference rules for the GMVDs. This result is important from a probabilistic perspective. All the above results explicitly demonstrate that there is a unified model for relational database and probabilistic reasoning systems. This is not only important from a theoretical point of view in that one model has been developed for a number of domains, but also from a practical point of view in that one system can be implemented for both domains. This implemented system can take advantage of the performance enhancing techniques developed in both fields. Thereby, this paper serves as a theoretical foundation for harmonizing these two important information domains.
How to Use Adobe PhotoShop X, 3rd edition
Authors: Daniel Giordan
Venue:  (2002)

:Filled with the author's original photography and artwork, How to Use Adobe Photoshop provides a visually appealing introduction to Photoshop techniques. 1 Updated and revised to cover new features in the latest version of Photoshop, expected March/April 2002. 1 Full-color, two-page spreads explain how to use Photoshop to create and manipulate images for print publishing and the Web. 2 The only beginning-to-intermediate level, four-color Photoshop title on the market. How to Use Adobe Photoshop visually steps the reader through everything he or she needs to know in order to create and manipulate images for print and the Web. Photoshop can be a somewhat intimidating program for the beginning user, but How to Use Adobe Photoshop, with its visual, step-by-step approach, makes it simple to learn the basic techniques involved in using Photoshop. Previously announced in 4/2002 catalog.
The Obnoxious Center Problem on a Tree
Authors: Rainer E. Burkard, Helidon Dollani, Yixun Lin, Günter Rote
Venue: SIAM Journal on Discrete Mathematics (2001)

The obnoxious center problem in a graph G asks for a location on an edge of the graph such that the minimum weighted distance from this point to a vertex of the graph is as large as possible. We derive algorithms with linear running time for the cases when G is a path or a star, thus improving previous results of Tamir [SIAM J. Discrete Math, 1 (1988), pp. 377--396]. For subdivided stars we present an algorithm of running time O(n log n). For general trees, we improve an algorithm of Tamir [SIAM J. Discrete Math, 1 (1988), pp. 377--396] by a factor of log n. Moreover, a linear algorithm for the unweighted center problem on an arbitrary tree with neutral and obnoxious vertices is described.
Best Websites for Financial Professionals, Business Appraisers, and Accountants
Authors: Eva M. Lang, Jan D. Tudor
Venue:  (2000)

:A no-nonsense style to quickly finding and evaluating the quality and usefulness of a siteEspecially designed for the growing number of accountants, business appraisers, and financial professionals who are turning to the Internet business and financial information, this book helps professionals evaluate, target, and locate the best financial and business sites on the Web. Organized by financial area, this is a comprehensive and economical resource for finding public financial information on the Web. Two of the industrys leading researchers, Eva M. Lang and Jan D. Tudor reveal tips, traps, and recommend favorite sites including a comprehensive review of the most important financial sites on the Internet, so that financial professionals can save time, decrease costs, and turn public data into dollars. This book is ideal for the busy professional who needs to know where to find industry statistics fast. Plus, readers will get continuous updating, which will be posted on a related Web site for quick user access.
Selectivity estimation for spatio-temporal queries to moving objects
Authors: Yong-Jin Choi, Chin-Wan Chung
Venue: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (2002)

A query optimizer requires selectivity estimation of a query to choose the most efficient access plan. An effective method of selectivity estimation for the future locations of moving objects has not yet been proposed. Existing methods for spatial selectivity estimation do not accurately estimate the selectivity of a query to moving objects, because they do not consider the future locations of moving objects, which change continuously as time passes.In this paper, we propose an effective method for spatio-temporal selectivity estimation to solve this problem. We present analytical formulas which accurately calculate the selectivity of a spatio-temporal query as a function of spatio-temporal information. Extensive experimental results show that our proposed method accurately estimates the selectivity over various queries to spatio-temporal data combining real-life spatial data and synthetic temporal data. When Tiger/lines is used as real-life spatial data, the application of an existing method for spatial selectivity estimation to the estimation of the selectivity of a query to moving objects has the average error ratio from 14% to 85%, whereas our method for spatio-temporal selectivity estimation has the average error ratio from 9% to 23%.
O'Leary Series: Microsoft Access 2000 Brief Edition, 1st edition
Authors: Timothy J. O'Leary, Linda I. O'Leary
Venue:  (1999)

:The O'Leary Series is the true step-by-step way to develop computer application skills. The new design emphasizes the step-by-step visual approach with screen captures for every concept introduced throughout the text.
Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs
Authors: Romeo Rizzi
Venue: SIAM Journal on Discrete Mathematics (2002)

This paper gives a new and faster algorithm to find a 1-factor in a bipartite $\Delta$-regular graph. The time complexity of this algorithm is ${\cal O}(n \Delta + n \log n \log \Delta)$, where $n$ is the number of nodes. This implies an ${\cal O}(n \log n \log \Delta + m \log \Delta)$ algorithm to edge-color a bipartite graph with n nodes, m edges, and maximum degree $\Delta$.\\
Computers Simplified, 5th edition
Authors: Ruth Maran, Paul Whitehead
Venue:  (2000)

:Are you new to computers? Does new technology make you nervous? Relax! You're holding in your hands the easiest guide ever to computers - a book that skips the long-winded explanations and shows you how things work. All you have to do is open the book, follow the friendly disk character - and discover just how easy it is to get up to speed. Self contained lessons make learning a snap Jargon-free captions offer practical tips and tricks
Linear Programming in O([n3/ln n]L) Operations
Authors: K. M. Anstreicher
Venue: SIAM Journal on Optimization (1999)

We show that the complexity to solve linear programming problems, using standard linear algebra, can be reduced to O([n3/ln n]L) operations, where n is the number of variables in a standard-form problem with integer data of bit size L. Our technique combines partial updating with a preconditioned conjugate gradient method, in a scheme first suggested by Nesterov and Nemirovskii.
How to Do Everything with Your Pocket PC and Handheld PC
Authors: Frank McPherson
Venue:  (2000)

:Learn to set up all the features and productivity applications on your Windows CE,connect and sync to your desktop PC,send and receive e-mail,download games,utilities,and MP3 files,and so much more. This book shows you how to do,well,EVERYTHING!Take full advantage of all the features your Pocket PC and Handheld PC have to offer with the help from this easy-to-follow guide. Wherever you go,stay up-to-date with your e-mail,appointments,to-do lists,and contact data. Connect to the Internet,create documents using the Pocket Office programs,share information with other handheld devices,synch up to your desktop PC,play games,and download software. This handy resource explains how you can be more productive and always accessible using your Pocket PC or Handheld PC. Inside,learn to: Navigate the desktop and input data using handwriting,keyboard,or voice input Use ActiveSync to connect to your desktop PC Manage contacts,appointments,and tasks with Pocket Outlook Use the Pocket Office SuitePocket Word,Pocket Excel,Pocket Access,and Pocket PowerPoint Send and receive e-mail with your Pocket PC or Handheld PC Inbox Connect to the Internet and browse the Web with Pocket Internet Explorer Record and play sound files with the voice recorder Network to other computers and exchange data Download games,software,and utilities Use peripherals such as storage cards,Clik!,SuperDisk,and CD-ROM drives,digital cameras,printers,and network interface cards
A clustering genetic algorithm for cylinder drag optimization
Authors: Michele Milano, Petros Koumoutsakos
Venue: Journal of Computational Physics (2002)

A real coded genetic algorithm is implemented for the optimization of actuator parameters for cylinder drag minimization. We consider two types of idealized actuators that are allowed either to move steadily and tangentially to the cylinder surface ("belts") or to steadily blow/suck with a zero net mass constraint. The genetic algorithm we implement has the property of identifying minima basins, rather than single optimum points. The knowledge of the shape of the minimum basin enables further insights into the system properties and provides a sensitivity analysis in a fully automated way. The drag minimization problem is formulated as an optimal regulation problem. By means of the clustering property of the present genetic algorithm, a set of solutions producing drag reduction of up to 50% is identified. A comparison between the two types of actuators, based on the clustering property of the algorithm, indicates that blowing/suction actuation parameters are associated with larger tolerances when compared to optimal parameters for the belt actuators. The possibility of using a few strategically placed actuators to obtain a significant drag reduction is explored using the clustering diagnostics of this method. The optimal belt-actuator parameters obtained by optimizing the two-dimensional case is employed in three-dimensional simulations, by extending the actuators across the span of the cylinder surface. The three-dimensional controlled flow exhibits a strong two-dimensional character near the cylinder surface, resulting in significant drag reduction.
Instant collaboration: using context-aware instant messaging for session management in distributed collaboration tools
Authors: Klaus Marius Hansen, Christian Heide Damm
Venue: Proceedings of the second Nordic conference on Human-computer interaction (2002)

Distributed collaboration has become increasingly important, and instant messaging has become widely used for distributed communication. We present findings from an investigation of instant messaging use for work-related activities in a commercial setting. Based on these findings, we propose a lightweight session management design for distributed collaboration tools based on context-aware instant messaging. An implementation of this design is presented and an ongoing evaluation is discussed.
Systems Analysis and Design, 4th edition
Authors: Gary B. Shelly, Thomas J. Cashman
Venue:  (2000)

:This title allows students to do systems analysis and design right from the start. Examples and cases are drawn from actual systems projects that enable students to learn in the context of solving problems, much like the ones they will encounter on the job. A blend of traditional development and current techniques, such as client-server and object-oriented development, graphical user interfaces, and electronic data interchange are provided. The clear writing style makes systems analysis and design easy to understand.
Disk scheduling policies with lookahead
Authors: Alexander Thomasian, Chang Liu
Venue: ACM SIGMETRICS Performance Evaluation Review (2002)

Advances in magnetic recording technology have resulted in a rapid increase in disk capacities, but improvements in the mechanical characteristics of disks have been quite modest. For example the access time to random disk blocks has decreased by a mere factor of two, while disk capacities have increased by several orders of magnitude. High performance OLTP applications subject disks to a very demanding workload, since they require high access rates to randomly distributed disk blocks and gain limited benef&pound;t from caching and prefetching. We address this problem by re-evaluating the performance of some well known disk scheduling methods, before proposing and evaluating extensions to them. A variation to CSCAN takes into account rotational latency, so that the service time of further requests is reduced. A variation to SATF considers the sum of service times of several successive requests in scheduling the next request, so that the arm is moved to a (temporal) neighborhood with many requests. The service time of further requests is discounted, since their immediate processing is not guaranteed. A variation to the SATF policy prioritizes reads with respect to writes and processes winner write requests conditionally, i.e., when the ratio of their service time to that of the winner read request is smaller than a certain threshold. We review previous work to put our work into the proper perspective and discuss plans for future work.
Active disk paxos with infinitely many processes
Authors: Gregory Chockler, Dahlia Malkhi
Venue: Proceedings of the twenty-first annual symposium on Principles of distributed computing (2002)

We present an improvement to the Disk Paxos protocol by Gafni and Lamport which utilizes extended functionality and flexibility provided by Active Disks and supports unmediated concurrent data access by an unlimited number of processes. The solution facilitates coordination by an infinite number of clients using finite shared memory. It is based on a collection of read-modify-write objects with faults, that emulate a new, reliable shared memory abstraction called a ranked register. The required read-modify-write objects are readily available in Active Disks and in Object Storage Device controllers, making our solution suitable for state-of-the-art Storage Area Network (SAN) environments.
InP-based AlInAs/GaAs 0.51 Sb 0.49/GaInAs single Heterojunction Bipolar transistor for high-speed and RF wireless applications
Authors: Changhyun Yi, Tong-Ho Kim, April S. Brown
Venue: Journal of Electronic Materials (2002)

The InP-based AlInAs-GaAsSb-GaInAs heterojunction bipolar transistors (HBTs) have been grown by solid-source molecular-beam epitaxy (SSMBE). Since the AlInAs-GaAsSb heterojunction has a type-II (staggered) band lineup, the conduction-band discontinuity is negligible at 300 K (10 meV). Thus, the turn-on voltage is significantly lower than that of an AlInAs-GaInAs HBT even without compositional grading of the emitter-base junction. A self-aligned process was used to fabricate large area devices. The measured turn-on voltage and collector-emitter offset were 0.36 V and 0.23 V, respectively, with a DC current gain of approximately 25 and ideality factors of ηC = 1.01 and ηB = 1.1 at JC = 10 kA/cm2 collector-current density.
On the Self-Concordance of the Universal Barrier Function
Authors: Osman Güler
Venue: SIAM Journal on Optimization (1997)

Let $K$ be a regular convex cone in $\hbox{{\bbb R}}^n$ and let $F(x)$ be its universal barrier function. Let $D^kF(x)[h,\ldots,h]$ be the $k$th order directional derivative at the point $x\in K^0$ and direction $h\in\hbox{{\bbb R}}^n$. We show that for every $m\ge3$ there exists a constant $c(m)>0$ depending only on $m$ such that $|D^mF(x)[h,\ldots,h]|\le c(m)\,D^2F(x)[h,h]^{m/2}$. For $m=3$, this is the self-concordance inequality of Nesterov and Nemirovskii. Our proof uses a powerful recent result of Bourgain.
An indeterminate constructor for applicative programming
Authors: Daniel P. Friedman, David S. Wise
Venue: Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1980)

This paper proposes the encapsulization and control of contending parallel processes within data structures. The advantage of embedding the contention within data is that the contention, itself, thereby becomes an object which can be handled by the program at a level above the actions of the processes themselves. This means that an indeterminate behavior, never precisely specified by the programmer or by the input, may be shared in the same way that an argument to a function is shared by every use of the corresponding parameter, an ability which is of particular importance to applicative-style programming.