ppxscal/embedding_network huggingface dataset:
Websphere Application Server V6 Migration Guide
Venue:  (2006)

This IBM Redbook will assist in the migration of your WebSphere Application Server installation. The end-to-end migration path includes the migration of the development environment, the test/integration environment, and the production environment using software engineering methodologies. This guide presents best practices in migration strategy and planning, migration tools, and practical migration examples. This guide was written specifically to address this set of products: - Version 6 IBM Rational Application Developer for WebSphere Software and IBM Rational Web Developer for WebSphere Software for the Windows and Intel Linux 32 bit operating system platforms - Version 6 of the WebSphere Application Server, WebSphere Application Server Express, and WebSphere Application Server Network Deployment products. These products specifically target these operating system platforms, which we will subsequently refer to collectively as the distributed platforms: - Microsoft Windows for Intel 32 bit architecture - Microsoft Windows for Intel EM64T 64 bit and AMD 64 bit architecture - Linux for Intel 32 bit architecture - Linux for Intel EM64T 64 bit and AMD 64 bit architecture - Linux for IBM zSeries architecture - IBM AIX for PowerPC architecture - Sun Solaris™ for Sparc architecture - Hewlet Packard HP-UX PA-Risc architecture - Hewlet Packard HP-UX for Itanium 2 64 bit architecture - WebSphere Application Server for z/OS Version 6 for IBM zSeries architecture 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
A robust machine code proof framework for highly secure applications
Authors: David S. Hardin, Eric W. Smith, William D. Young
Venue: Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications (2006)

Security-critical applications at the highest Evaluation Assurance Levels (EAL) require formal proofs of correctness in order to achieve certification. To support secure application development at the highest EALs, we have developed techniques to largely automate the process of producing proofs of correctness of machine code. As part of the Secure, High-Assurance Development Environment program, we have produced in ACL2 an executable formal model of the Rockwell Collins AAMP7G microprocessor at the instruction set level, in order to facilitate proofs of correctness about that processor's machine code. The AAMP7G, currently in use in Rockwell Collins secure system products, supports strict time and space partitioning in hardware, and has received a U.S. National Security Agency (NSA) Multiple Independent Levels of Security (MILS) certificate based in part on a formal proof of correctness of its separation kernel microcode. Proofs of correctness of AAMP7G machine code are accomplished using the method of "compositional cutpoints", which requires neither traditional clock functions nor a Verification Condition Generator (VCG). In this paper, we will summarize the AAMP7G architecture, detail our ACL2 model of the processor, and describe our development of the compositional cutpoint method into a robust machine code proof framework.
Invariance of the first difference in ARFIMA models
Authors: Barbara P. Olbermann, Sílvia R. Lopes, Valdério A. Reisen
Venue: Computational Statistics (2006)

A desirable property for an estimator of the fractional ARFIMA parameter is to be first difference invariant. This paper investigates the effects on the fractional parameter estimator in nonstationary ARFIMA(p,d,q) processes before and after applying a first difference. We consider semiparametric and parametric approaches for estimating d. The study is based on a Monte Carlo simulation for different sample sizes. The Brazilian exchange rate series is given as an application of the methodology.
Comparing information&dash;theoretic attribute selection measures&colon; a statistical approach
Authors: Ramon Lopez de Mantaras, Jesus Cerquides, Pere Garcia
Venue: AI Communications (1998)

In [7], a new information&dash;theoretic attribute selection method for decision tree induction was introduced. This method consists in computing for each node, a distance between the partition generated by the values of each candidate attribute in the node and the correct partition of the subset of training examples in this node. The chosen attribute is that whose corresponding partition is the closest to the correct partition (i.e., the partition that perfectly classifies the training data). In that paper it was also formally proved that such distance is not biased towards attributes with a large number of values in the sense specified by Quinlan in [12] and some initial experimental evidence suggests that the predictive accuracy of the induced trees was not significantly different from that obtained with the most widely used information theoretic attribute selection measures, that is, Quinlan&rsquo;s Gain and Quinlan&rsquo;s Gain Ratio. However, it seemed that the distance induced smaller trees especially when the attributes had different number of values. In that paper it was not confirmed that the differences were statistically significant due to the small number of experiments performed. In this paper we report experimental results that allow to confirm that the distance induces trees whose size, without losing accuracy, is not significantly different from those obtained using Quinlan&rsquo;s Gain but smaller than those obtained with Quinlan&rsquo;s Gain Ratio. These experimental results are supported by a statistical analysis performed using two statistical hypothesis tests&colon; the sign test and the signed rank test.
Singular point detection by shape analysis of directional fields in fingerprints
Authors: Chul-Hyun Park, Joon-Jae Lee, Mark J. T. Smith, Kil-Houm Park
Venue: Pattern Recognition (2006)

This paper presents a new fingerprint singular point detection method that is type-distinguishable and applicable to various fingerprint images regardless of their resolutions. The proposed method detects singular points by analyzing the shapes of the local directional fields of a fingerprint image. Using the predefined rules, all types of singular points (upper core, lower core, and delta points) can be extracted accurately and delineated in terms of the type of singular points. In case of arch-type fingerprints there exists no singular point, but reference points for arch-type fingerprints are required to be detected for registration. Therefore, we propose a new reference point detection method for arch-type fingerprints as well. The result of the experiments on the two public databases (FVC2000 2a, FVC2002 2a) with different resolutions demonstrates that the proposed method has high accuracy in locating each types of singular points and detecting the reference points of arch-type fingerprints without regard to their image resolutions.
A hardware definition of microprogramming
Authors: Gerhard Chroust
Venue: ACM SIGMICRO Newsletter (1974)

This paper tries to give a simple, effective definition of 'microprogramming' by reducing this notion to the concept of a 'microcontrolled' machine. The class of microcontrolled machines can rigorously be defined using the terminology of switching algebra.
Analyzing internet packet traces using Lindley's Recursion
Authors: Martin J. Fischer, Denise M. Bevilacqua Masi
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Internet trace packet data for a given network link contains information on each packet's arrival time and size. An important problem is to model the congestion packets experienced over the collection period. Recent research has utilized a relationship from Queueing Theory known as Lindley's Recursion to model packet congestion. This relationship has existed for 50 years and has been quite beneficial in analyzing these traces. We report on our use of Lindley's Recursion to analyze publicly-available link data from the Abilene Network, an Internet2 backbone network. We extend the use of Lindley's Recursion and include a discussion of the computational problems, numerical evaluation of trace packet performance and potential modeling issues, and a statistical investigation of the independence of packet interarrival times. In addition, we show how Lindley's Recursion can be used to extend the baseline analysis to interject Voice over Internet Protocol (VoIP) packets into the trace.
Word problems recognisable by deterministic blind monoid automata
Authors: Mark Kambites
Venue: Theoretical Computer Science (2006)

We consider blind, deterministic, finite automata equipped with a register which stores an element of a given monoid, and which is modified by right multiplication by monoid elements. We show that, for monoids M drawn from a large class including groups, such an automaton accepts the word problem of a group H if and only if H has a finite index subgroup which embeds in the group of units of M. In the case that M is a group, this answers a question of Elston and Ostheimer.
Set of test problems for the minimum length connection networks
Authors: J. Soukup, W. F. Chow
Venue: Issue 15 (November 1973) (1973)

The problem of finding the shortest network connection given set of points is often referred to as the Problem of Steiner. The applications of this problem can be found in various engineering fields, typically in the design of telephone networks, in the planning of highway systems or in the design of large mining operations. In the present state of art, for 20 given points or more, one must use a heuristic method to obtain at least a suboptimum solution in a reasonable time.
Rapid and brief communication: Subspace evolution analysis for face representation and recognition
Authors: Huahua Wang, Yue Zhou, Xinliang Ge, Jie Yang
Venue: Pattern Recognition (2007)

This paper develops a novel framework that is capable of dealing with small sample size problem posed to subspace analysis methods for face representation and recognition. In the proposed framework, three aspects are presented. The first is the proposal of an iterative sampling technique. The second is adopting divide-conquer-merge strategy to incorporate the iterative sampling technique and subspace analysis method. The third is that the essence of 2D PCA is further explored. Experiments show that the proposed algorithm outperforms the traditional algorithms.
Soccer video analysis by ball, player and referee tracking
Authors: Wayne Chelliah Naidoo, Jules Raymond Tapamo
Venue: Proceedings of the 2006 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries (2006)

Soccer ball detection and tracking plays a pivotal role in soccer event detection. In fact, all events in the game take place around the ball, and it is crucial to track the movement of the ball, players of both teams as well as the referee in order to perform analysis of the match both real-time and post match. A ball, player and referee detection, classification and tracking; team identification, and a field extraction approach is proposed in this paper. A higher level automatic offside event (OE) detection method is also proposed. The principle constraint considered during the development of the system was that the pattern recognition techniques had to be computationally efficient in terms of processing time. The system developed is a non-invasive vision-based decision support tool, capable of providing real-time analysis of a soccer match, including assisting the referee in making a decision concerning the offside rule.
Correspondence on Fortran standardization
Authors: Frank Engle,  Jr.
Venue: ACM SIGNUM Newsletter (1974)

A letter by Howard Kaikow on Fortran standards for the order of evaluation of expressions appeared in the preceeding issue of this Newsletter. Mr. Kaikow had written a similar letter, in April, 1974, to Frank Engel, Jr. who is the chairman of the ANSI X3J3 Fortran Committee. Mr. Engel has kindly given permissio for the Newsleter to publish a copy of the response letter which he wrote to Mr. Kaikow in May, 1974. 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
Inverse problems of chaotic dynamics and statistical analysis in providing information security in communication systems and networks
Authors: P. Yu. Kostenko, A. V. Antonov, T. P. Kostenko
Venue: Cybernetics and Systems Analysis (2006)

A new approach based on chaotic systems is proposed to provide information security in communication systems and networks. Statistical attack and attack involving solution of the inverse problem of chaotic dynamics are analyzed. For these types of attacks, the approach provides security of no less level than elliptic curve cryptography does.
Oracle Application Server Portal Handbook, 1 edition
Authors: Chris Ostrowski
Venue:  (2007)

The Ultimate Oracle Application Server Portal ResourceBuild dynamic, feature-rich enterprise portals using Oracle Application Server Portal and the expert information in this exclusive Oracle Press guide. You'll learn how to maximize the capabilities of Oracle Application Server Portal, customize your portals, integrate Oracle Forms and Oracle Reports, and add Java functionality. Oracle Application Server Portal Handbook covers all of the design, management, and security features available in Oracle Application Server Portal 10.1.4 alongside real-world solutions. Take full advantage of the built-in tools and wizardsCreate rich end-user experiences quickly and easilyCustomize pages and maintain site-wide consistency using HTML templatesIncorporate data from disparate formats using Oracle Application Server Portal's content management featuresBuild pages using OmniPortlet and the Web clipping studioWrite portlets with Java and Oracle JDeveloperImplement SOA-based applications to connect business processesAdminister, tune, and secure Oracle Application Server PortalIntegrate Oracle Forms, Oracle Reports, and Oracle Discoverer workbooksTable of contentsAcknowledgmentsIntroductionPart I: IntroductionChapter 1: Out-of-the-Box Oracle Application Server Portal TechnologiesChapter 2: OracleAS Portal Responsibilities within an OrganizationPart II: Page Design and Content ManagementChapter 3: OracleAS Portal Page DesignChapter 4: Advanced Portal Page DesignChapter 5: Content ManagementChapter 6: OmniPortlet and Web ClippingPart III: DevelopmentChapter 7: Writing Portlets with JavaChapter 8: Advanced Development TopicsPart IV: AdministrationChapter 9: Site Administration and Performance TuningChapter 10: OracleAS Portal Users and SecurityPart V: MiscellaneousChapter 11: Integrating Forms, Reports, and Discoverer into PortalChapter 12: Oracle Instant PortalPart VI: AppendixesAppendix A: Future Direction of OracleAS PortalAppendix B: OracleAS Portal ResourcesAppendix C: Exercise CommentaryIndex 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
Efficient indexing data structures for flash-based sensor devices
Authors: Song Lin, Demetrios Zeinalipour-Yazti, Vana Kalogeraki, Dimitrios Gunopulos, Walid A. Najjar
Venue: ACM Transactions on Storage (TOS) (2006)

Flash memory is the most prevalent storage medium found on modern wireless sensor devices (WSDs). In this article we present two external memory index structures for the efficient retrieval of records stored on the local flash memory of a WSD. Our index structures, MicroHash and MicroGF (micro grid files), exploit the asymmetric read/write and wear characteristics of flash memory in order to offer high-performance indexing and searching capabilities in the presence of a low-energy budget, which is typical for the devices under discussion. Both structures organize data and index pages on the flash media using a sorted by timestamp file organization. A key idea behind these index structures is that expensive random access deletions are completely eliminated. MicroHash enables equality searches by value in constant time and equality searches by timestamp in logarithmic time at a small cost of storing index pages on the flash media. Similarly, MicroGF enables spatial equality and proximity searches in constant time. We have implemented these index structures in nesC, the programming language of the TinyOS operating system. Our trace-driven experimentation with several real datasets reveals that our index structures offer excellent search performance at a small cost of constructing and maintaining the index.
Final Cut Pro 5 for Mac OS X: Visual QuickPro Guide
Authors: Lisa Brenneis
Venue:  (2005)

This newly updated guide from Lisa Brenneis, an undisputed master of the digital video medium, provides task-based, step-by-step instructions along with loads of visuals and time-saving tips that will help busy readers quickly find what they need to know about Final Cut Pro. Topics covered include essential editing operations and media-management strategies, transitions and motion effects, filters, rendering options, and more. This must-have reference also addresses features new to version 5: including higher quality effects, RT Extreme with Dynamic RT, closer integration with Apple's other creative tools and more.
An approach for integrating multi-modal, model-based diagnostic components
Authors: Gregory Provan, David Glover
Venue: AI Communications (1999)

We describe an approach for modeling and diagnosing complex multi&dash;modal systems. A novel feature of this approach is the proposed method for integrating multiple specification modalities. We apply this approach to a real&dash;world rocket engine turbopump. The example model consists of two sub&dash;models, one describing liquid flows, and one describing mechanical vibrations. Typical methods for modeling such systems will treat these two modalities as being completely disjoint, even though they have significant interactions. We describe a method for integrating these sub&dash;models using variables that play different roles in the different sub&dash;models. We focus on how the integrated causal network model allows us to diagnose a more complete and physically plausible set of faults than by using the independent sub&dash;models.
iMime: an interactive character animation system for use in dementia care
Authors: Andreas Wiratanaya, Michael J. Lyons, Nicholas J. Butko, Shinji Abe
Venue: Proceedings of the 12th international conference on Intelligent user interfaces (2007)

We describe the design and implementation of an interactive character animation interface. The system analyzes the attentive state and aspects of the affective behaviour of a viewer using input from a video camera and uses this to control the behaviour of a cartoon-like animated character. Using the interaction metaphor of a mime artist, we design the system to encourage viewer attention and interaction, with adaptation using an online reinforcement learning based on the viewer's attentive state. This work is ultimately aimed at developing a system to support the care of dementia sufferers.
Microsoft Windows Shell Script Programming for the Absolute Beginner
Authors: Jerry Lee Ford,  Jr.
Venue:  (2003)

If you are new to programming with Windows Shell Script and are looking for a solid introduction, this is the book for you. Developed by computer science instructors, books in the for the absolute beginner™ series teach the principles of programming through simple game creation. You will acquire the skills that you need for more practical Shell Script programming applications, and you will learn how these skills can be put to use in real-world scenarios. Best of all, by the time you finish this book you will be able to apply the basic principles you've learned to the next programming language you tackle. With the instructions in this book, you'll learn to: * Store and retrieve information in variables * Apply conditional logic and create conditional logic tests * Improve script organization with procedures * Debug your scripts and handle errors * Create loops to process collections of data Features Readers will create games by writing Windows Shell scripts as they learn the fundamentals of this programming language Each chapter contains several new concepts with a small, but complete example program to tie everything together In addition to Windows Shell Scripting, this book will provide the reader with a solid overview of the Windows Shell and the Windows command prompt, as well as its support for VBScript Includes a CD that contains all of the book's scripts. Includes all games developed as projects plus numerous other example scripts. None of the existing VBScript books provide a CD, therefore readers looking for easily accessible source code will prefer this book. 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
Google Hacks: Tips & Tools for Finding and Using the World's Information (Hacks)
Authors: Rael Dornfest, Paul Bausch, Tara Calishain
Venue:  (2006)

Everyone knows that Google lets you search billions of web pages. But few people realize that Google also gives you hundreds of cool ways to organize and play with information.Since we released the last edition of this bestselling book, Google has added many new features and services to its expanding universe: Google Earth, Google Talk, Google Maps, Google Blog Search, Video Search, Music Search, Google Base, Google Reader, and Google Desktop among them. We've found ways to get these new services to do even more.The expanded third edition of Google Hacks is a brand-new and infinitely more useful book for this powerful search engine. You'll not only find dozens of hacks for the new Google services, but plenty of updated tips, tricks and scripts for hacking the old ones. Now you can make a Google Earth movie, visualize your web site traffic with Google Analytics, post pictures to your blog with Picasa, or access Gmail in your favorite email client. Industrial strength and real-world tested, this new collection enables you to mine a ton of information within Google's reach. And have a lot of fun while doing it:Search Google over IM with a Google Talk botBuild a customized Google Map and add it to your own web siteCover your searching tracks and take back your browsing privacyTurn any Google query into an RSS feed that you can monitor in Google Reader or the newsreader of your choiceKeep tabs on blogs in new, useful waysTurn Gmail into an external hard drive for Windows, Mac, or LinuxBeef up your web pages with search, ads, news feeds, and moreProgram Google with the Google API and language of your choiceFor those of you concerned about Google as an emerging Big Brother, this new edition also offers advice and concrete tips for protecting your privacy. Get into the world of Google and bend it to your will!