ppxscal/embedding_network huggingface dataset:
Programming Firefox: Building Rich Internet Applications with Xul
Authors: Kenneth Feldt
Venue:  (2007)

This is your guide to building Internet applications and user interfaces with the Mozilla component framework, which is best known for the Firefox web browser and Thunderbird email client. Programming Firefox demonstrates how to use the XML User Interface Language (XUL) with open source tools in the framework's Cross-Platform Component (XPCOM) library to develop a variety of projects, such as commercial web applications and Firefox extensions. This book serves as both a programmer's reference and an in-depth tutorial, so not only do you get a comprehensive look at XUL's capabilities--from simple interface design to complex, multitier applications with real-time operations--but you also learn how to build a complete working application with XUL. If you're coming from a Java or .NET environment, you'll be amazed at how quickly large-scale applications can be constructed with XPCOM and XUL. Topics in Programming Firefox include: An overview of Firefox technologyAn introduction to the graphical elements that compose a XUL applicationFirefox development tools and the process used to design and build applicationsManaging an application with multiple content areasIntroduction to Resource Description Files, and how the Firefox interface renders RDFManipulating XHTML with JavaScriptDisplaying documents using the Scalable Vector Graphics standard and HTML CanvasThe XML Binding Language and interface overlays to extend FirefoxImplementing the next-generation forms interface through XForms Programming Firefox is ideal for the designer or developer charged with delivering innovative standards-based Internet applications, whether they're web server applications or Internet-enabled desktop applications. It's not just a how-to book, but a what-if exploration that encourages you to push the envelope of the Internet experience.
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
Authors: T. C. E. Cheng, C. T. Ng, J. J. Yuan
Venue: Theoretical Computer Science (2006)

We consider the feasibility model of multi-agent scheduling on a single machine, where each agent's objective function is to minimize the total weighted number of tardy jobs. We show that the problem is strongly NP-complete in general. When the number of agents is fixed, we first show that the problem can be solved in pseudo-polynomial time for integral weights, and can be solved in polynomial time for unit weights; then we present a fully polynomial-time approximation scheme for the problem.
Some approaches to improve tree-based nearest neighbour search algorithms
Authors: Eva Gómez-Ballester, Luisa Micó, Jose Oncina
Venue: Pattern Recognition (2006)

Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are interested in algorithms that can be used with any dissimilarity function provided that it fits the mathematical notion of distance. Some of such algorithms organize, in preprocessing time, the data in a tree structure that is traversed in search time to find the nearest neighbour. The speedup is obtained using some pruning rules that avoid the traversal of some parts of the tree. In this work two new decomposition methods to build the tree and three new pruning rules are explored. The behaviour of our proposal is studied through experiments with synthetic and real data.
BER Analysis of Equalized OFDM Systems in Nakagami, m < 1 Fading
Authors: Vanja Subotic, Serguei Primak
Venue: Wireless Personal Communications: An International Journal (2007)

The orthogonal frequency division multiplexing (OFDM) transmission scheme is currently experiencing increased popularity due to advances in very large scale integration technology. It is used for a variety of broadband systems such as asymmetric digital subscriber lines, very-high-speed digital subscriber lines, digital video, and audio broadcasting, and wide local area network standards such as IEEE 802.11a, IEEE 802.11 g, and ETSI Hiperlan/2. However, propagation impairments can cause severe degradation in bit error rates (BER) for coherent detection. We derive a semi-analytical method to evaluate BER of a quadrature phase shift keying (QPSK)-OFDM system in Nakagami, m < 1 fading and additive noise where pilot-assisted linear channel estimation and channel equalization are used. This allows modeling of more severe fading environments than can be depicted by a Rayleigh distribution. Numerical simulations are used to validate the proposed methods. The techniques developed can be applied to other channel estimation techniques, modulation schemes and the performance evaluation of equalized single carrier narrowband systems.
Conserving network processor power consumption by exploiting traffic variability
Authors: Yan Luo, Jia Yu, Jun Yang, Laxmi N. Bhuyan
Venue: ACM Transactions on Architecture and Code Optimization (TACO) (2007)

Network processors (NPs) have emerged as successful platforms for providing both high performance and flexibility in building powerful routers. Typical NPs incorporate multiprocessing and multithreading to achieve maximum parallel processing capabilities. We observed that under low incoming traffic rates, processing elements (PEs) in an NP are idle for most of the time but still consume dynamic power. This paper develops a low-power technique to reduce the activities of PEs in accordance with the varying traffic volume. We propose to monitor the average number of idle threads in a time window, and gate off the clock signals to unnecessary PEs when a subset of PEs is enough to handle the network traffic. We solve the difficulties arising from clock gating the PEs, such as redirecting network packets, determining the thresholds of turning on/off PEs, and avoiding unnecessary packet loss. Our technique brings significant reduction in power consumption of NPs with no packet loss and little impact on overall throughput.
Templated revision
Authors: Petra L. Van Der Westhuizen, John A. Van Der Poll, Willem A. Labuschagne
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)

In this paper we study the epistemic change operation of revision when the epistemic state of an agent is extended to include not only beliefs but knowledge too. An information-theoretic model of epistemic states is defined based on the notion of a templated ordering. A set of rationality postulates is defined for templated revision, which extends the AGM postulates, and a model-based representation result is provided characterising the proposed postulates. These postulates capture the intuition that during a revision, the agent's knowledge should grow monotonically while the agent's belief may grow nonmonotonically. It is shown that templated revision satisfies all the Darwiche-Pearl postulates for iterated revision, except for the controversial postulate (C2).
Rapid and brief communication: Camera calibration with one-dimensional objects moving under gravity
Authors: Fei Qi, Qihe Li, Yupin Luo, Dongcheng Hu
Venue: Pattern Recognition (2007)

Camera calibration using one-dimensional (1D) rigid objects is arresting the attentions of researchers since the easy-to-construct geometrical structure of the apparatuses. In this paper, we extend the motion patterns applicable for calibration with the motion of 1D objects. We show that a 1D object with three or more markers, rotating around one marker which is moving in a plane, provides constraint equations on camera intrinsic parameters. A stick moving under gravity without other forces acting on performs such a motion. Simulated tests show the feasibility and numerical robustness of this method.
How to Do Everything with Your Dell Axim Handheld, Second Edition, 2 edition
Authors: Rich Hall, Derek Ball, Barry Shilmover
Venue:  (2005)

Get the most out of your Dell Axim with this step-by-step guide. How to Do Everything with Your Dell Axim Handheld, Second Edition has been fully revised to cover Microsoft’s new operating system for Pocket PCs--Windows Mobile 5.0. Find out how to manage personal information, send and receive e-mail, synchronize with desktop computers, and go wireless. Get details on optimizing memory, conserving battery power, and using the security features to protect your valuable information. Enjoy videos, music, and eBooks, and use your Axim as a digital camera. This handy resource contains all of the expert advice you need to be more productive and have more fun with your Dell Axim.
Necessary and sufficient conditions of existence and uniqueness of solutions to integral equations of actuarial mathematics
Authors: B. V. Norkin
Venue: Cybernetics and Systems Analysis (2006)

Necessary and sufficient conditions of existence and uniqueness of solutions of integral equations are established for ruin probability as a function of the initial capital of an insurance company. Several sufficient conditions and correctness conditions of the problem of finding ruin probability are also established. A general method of successive approximations for solution of this problem is substantiated.
New methodology for disability assessment: analysis of WHO-Disability Assessment Schedule II with clustering based on rules: Thesis
Authors: Roberta Annicchiarico
Venue: AI Communications (2003)

This thesis tries to give an answer to an open question about functional disabilities (FD), constituting and application of Artificial Intelligence to medicine. In fact, there still is a lack of consensus on the concept of FD and many efforts are done at present to forward research on this field, even from the World Health Organization (WHO). On the other hand, in the context of Data Mining it is well known that some complex Knowledge Discovery (KDD) problems require combination of several techniques coming from different research areas to be properly solved.In this work a hybrid KDD technique called clustering based on rules (ClBR) has been used to analyze a database referent to the assessment of FD by means of the WHO-DASII scale, which is a new assessment scale proposed by the WHO for validating functional disability degree. After analysis and interpretation of the results, a proposal of a new taxonomy of disabilities from a real functional point of view is presented as well as its relationship with the total score of the WHO-DASII scale.
Persuasion dialogue in online dispute resolution
Authors: Douglas Walton, David M. Godden
Venue: Artificial Intelligence and Law (2005)

In this paper we show how dialogue-based theories of argumentation can contribute to the construction of effective systems of dispute resolution. Specifically we consider the role of persuasion in online dispute resolution by showing how persuasion dialogues can be functionally embedded in negotiation dialogues, and how negotiation dialogues can shift to persuasion dialogues. We conclude with some remarks on how persuasion dialogues might be modelled is such a way as to allow them to be implemented in a mechanical or computerized system of dialogue or dialogue management.
SELinux by Example: Using Security Enhanced Linux (Prentice Hall Open Source Software Development Series)
Authors: Frank Mayer, Karl MacMillan, David Caplan
Venue:  (2006)

SELinux: Bring World-Class Security to Any Linux Environment!SELinux by Example is the first complete, hands-on guide to using SELinux in production environments. Authored by three leading SELinux researchers and developers, it illuminates every facet of working with SELinux, from its architecture and security object model to its policy language. The book thoroughly explains SELinux sample policies- including the powerful new Reference Policy-showing how to quickly adapt them to your unique environment. It also contains a comprehensive SELinux policy language reference and covers exciting new features in Fedora Core 5 and the upcoming Red Hat Enterprise Linux version 5.· Thoroughly understand SELinux's access control and security mechanisms· Use SELinux to construct secure systems from the ground up· Gain fine-grained control over kernel resources· Write policy statements for type enforcement, roles, users, and constraints· Use optional multilevel security to enforce information classification and manage users with diverse clearances· Create conditional policies that can be changed on-the-fly· Define, manage, and maintain SELinux security policies· Develop and write new SELinux security policy modules· Leverage emerging SELinux technologies to gain even greater flexibility· Effectively administer any SELinux system
Extracting symbolic rules from trained neural network ensembles
Authors: Zhi-Hua Zhou, Yuan Jiang, Shi-Fu Chen
Venue: AI Communications (2003)

Neural network ensemble can significantly improve the generalization ability of neural network based systems. However, its comprehensibility is even worse than that of a single neural network because it comprises a collection of individual neural networks. In this paper, an approach named REFNE is proposed to improve the comprehensibility of trained neural network ensembles that perform classification tasks. REFNE utilizes the trained ensembles to generate instances and then extracts symbolic rules from those instances. It gracefully breaks the ties made by individual neural networks in prediction. It also employs specific discretization scheme, rule form, and fidelity evaluation mechanism. Experiments show that with different configurations, REFNE can extract rules with good fidelity that well explain the function of trained neural network ensembles, or rules with strong generalization ability that are even better than the trained neural network ensembles in prediction.
MCSA/MCSE 70-291 Exam Cram: Implementing, Managing, and Maintaining a Microsoft Windows Server 2003 Network Infrastructure (2nd Edition) (Exam Cram 2)
Authors: Diana Huggins
Venue:  (2006)

MCSA/MCSE 70-291 Exam Cram, Second Edition is the #1 quick-study guide to passing the MCSA/MCSE 70-291 exam. This book covers all exam objectives, includingï¾ how toï¾ maintain a DHCP server, manage name resolution with DNS, secure networks using IPSec, troubleshoot network and Internet connectivity, and monitor network traffic. This new editionï¾ also includes two full practice exams and has been updated against Microsoft's official courseware (MOC) that corresponds to this exam.ï¾ This book willï¾ provide a refresher on important concepts and help you build on aï¾ solid foundation of knowledge on exam topics and objectives. The book also features test-taking strategies, time-saving study tips, and a special Cram Sheet that includes tips, acronyms, and memory joggers not available anywhere else.
Partial evaluation of multi&dash;paradigm declarative languages: Thesis
Authors: Elvira Albert
Venue: AI Communications (2001)

This paper abstracts the contents of a PhD dissertation entitled &lsquo;Partial evaluation of multi&dash;paradigm declarative languages: foundations, control, algorithms and efficiency&rsquo; which has been recently defended. Partial evaluation is an automatic technique for program optimization whose range of potential applications covers a wide spectrum of problem&dash;specific optimizations. For instance, there are successful experiences in the field of artificial intelligence, like the optimization (by partial evaluation) on simulators for neural network training. The thesis presents novel methods and techniques for the partial evaluation of multi&dash;paradigm declarative languages, which integrate features from functional and logic programming.
A Framework for Distributed Simulation of Asynchronous Handshake Circuits
Authors: E. Tsirogiannis, G. Theodoropoulos, D. Chen, Q. Zhang, L. Janin, D. Edwards
Venue: Proceedings of the 39th annual Symposium on Simulation (2006)

This paper presents PARBREEZE, a distributed simulation kernel for asynchronous hardware behavioural simulation. PARBREEZE is based on the Logical Process paradigm and targets asynchronous handshake circuits generated by the Balsa asynchronous hardware synthesis environment. The paper describes the architecture of PARBREEZE and presents performance results for different partitioning strategies.
Efficient visual secret sharing scheme for color images
Authors: Shyong Jian Shyu
Venue: Pattern Recognition (2006)

A k-out-of-n visual secret sharing scheme (VSSS) resolves the visual variant of the k-out-of-n secret sharing problem where only k or more out of n participants can reveal the secret by human visual system without any cryptographic computation. The best pixel expansion of the general k-out-of-n VSSS for c-colored images was cxm by Yang and Laih [New colored visual secret sharing schemes, Des Codes Cryptogr. 24 (2000) 325-335] where m is the pixel expansion of an existing binary k-out-of-n VSSS. Regarding the c-colored n-out-of-n scheme, the best pixel expansion is (c-1)2^n^-^1-c+2 and c(c-1)2^n^-^2-c when n is odd and even, respectively, by Blundo et al. [Improved schemes for visual cryptography, Des Codes Cryptogr. 24 (2001) 255-278]. In this paper, we propose a new c-colored k-out-of-n VSSS by using a pixel expansion of @?log"2c@?xm that is more efficient than ever.
An update on GKS: the final changes
Authors: Thomas Wright
Venue: ACM SIGGRAPH Computer Graphics (1985)

Last February, SIGGRAPH published the proposed American National Standard (ANS) called 'The Graphical Kernel System' (GKS) [1]. Since that time there have been changes in the standard as the result of comments submitted during the public review of the standard and simultaneous work on the parallel standard being finalized in the international arena by the International Standards Organization (ISO). Changes in the body of the standard are essentially editorial, with certain passages clarified and corrections made. These changes are best analyzed by reviewing the entire document, which should be available from the American National Standards Institute in the first quarter of 1985.
Time Management for System Administrators
Authors: Thomas A Limoncelli
Venue:  (2005)

Time is a precious commodity, especially if you're a system administrator. No other job pulls people in so many directions at once. Users interrupt you constantly with requests, preventing you from getting anything done. Your managers want you to get long-term projects done but flood you with requests for quick-fixes that prevent you from ever getting to those long-term projects. But the pressure is on you to produce and it only increases with time. What do you do? The answer is time management. And not just any time management theory--you want Time Management for System Administrators, to be exact. With keen insights into the challenges you face as a sys admin, bestselling author Thomas Limoncelli has put together a collection of tips and techniques that will help you cultivate the time management skills you need to flourish as a system administrator.Time Management for System Administrators understands that an Sys Admin often has competing goals: the concurrent responsibilities of working on large projects and taking care of a user's needs. That's why it focuses on strategies that help you work through daily tasks, yet still allow you to handle critical situations that inevitably arise.Among other skills, you'll learn how to:Manage interruptionsEliminate timewastersKeep an effective calendarDevelop routines for things that occur regularlyUse your brain only for what you're currently working onPrioritize based on customer expectationsDocument and automate processes for faster executionWhat's more, the book doesn't confine itself to just the work environment, either. It also offers tips on how to apply these time management tools to your social life. It's the first step to a more productive, happier you.
Educational series #5: integer programming by group theory
Authors: Harvey M. Salkin
Venue: Issue 16 (April 1974) (1974)

Integer Programming problems can be solved by a variety of methods. These include:Implicit EnumerationBranch and BoundCutting PlanesPartitioningGroup Theory
Implementation of a project office to improve on project delivery and performance: a case study
Authors: J Boonzaaier, J J Van Loggerenberg
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)

As competition increases, rising costs of Information and Communication Technology (ICT) come under the spotlight. As a result, there is pressure on ICT to deliver more with fewer resources. Unsuccessful projects became intolerable. Successful project management entails much more than completing projects in time and within budget. Quality, user satisfaction, effective team collaboration and effective resource management all contribute to project success. ICT unfortunately has a rather tarnished reputation when it comes to successful project delivery. Reasons why ICT projects often fail include poor planning, poor communication, poor project management skills, project complexity, ill-defined requirements and too many changes in scope. The ICT Department of the South African Reserve Bank is no exception. The main purpose of this paper is to determine whether or not the implementation of a project office in the ICT Department has addressed the problems identified in the literature and those previously experienced by the Bank.
NSL-BLRL: Efficient CacheWarmup for Sampled Processor Simulation
Authors: Luk Van Ertvelde, Filip Hellebaut, Lieven Eeckhout, Koen De Bosschere
Venue: Proceedings of the 39th annual Symposium on Simulation (2006)

Architectural simulation is extremely time-consuming given the huge number of instructions that need to be simulated for contemporary benchmarks. Sampled simulation which selects a number of samples from the complete benchmark execution yields substantial speedups. However, there is one major issue that needs to be dealt with in order to minimize non-sampling bias, namely the hardware state at the beginning of each sample. This is well known in the literature as the cold-start problem. The hardware structures that suffer the most from the cold-start problem are cache hierarchies. In this paper we propose NSL-BLRL which combines two previously proposed cache hierarchy warmup approaches, namely No-State-Loss (NSL) and Boundary Line Reuse Latency (BLRL). The idea of NSL-BLRL is to warmup the cache hierarchy using a hardware state checkpoint that stores a truncated NSL stream. The NSL stream is a leastrecently used stream of (unique) memory references in the pre-sample. This NSL stream is then truncated to form the NSL-BLRL warmup checkpoint; this is done by inspecting the sample for determining how far in the pre-sample one needs to go back to accurately warmup the hardware state for the given sample. We show using SPEC CPU2000 benchmarks that NSL-BLRL is (i) nearly as accurate as BLRL and NSL for sampled processor simulation, (ii) yields simulation time speedups of several orders of magnitude compared to BLRL, and (iii) is more space-efficient than NSL. As such, we conclude that NSL-BLRL is a highly efficient and accurate cache warmup strategy for sampled processor simulation.