ppxscal/embedding_network huggingface dataset:
Java(TM) Application Development on Linux(R) (Bruce Perens' Open Source Series)
Authors: Carl Albing, Michael Schwarz
Venue:  (2004)

Linux is the fastest-growing Java development platform because it saves money and time by serving as a platform for both development and deployment. But developers face significant platform-specific challenges when managing and deploying Java applications in a controlled production environment.Written for Java and Linux developers alike, Java™ Application Development on Linux®is the hands-on guide to the full Java application development lifecycle on Linux.Determined to spare other developers hours of trial and error, Albing and Schwarz demonstrate the platform, tools, and application development by showing realistic, easy-to-follow examples. After a simple command-line application introduces basic tools, this program leads readers through business-logic object analysis, database design, Java servlet UIs, Java Server Pages (JSP) UIs, Swing GUIs, and Standard Widget Toolkit (SWT) GUIs. Scaling up to the enterprise level provides the opportunity to use both the JBoss Application Server and the Apache Geronimo Application Servers, and Enterprise JavaBeans (EJB).Readers learn how to Use development tools available on Linux, such as the GNU Compiler for Java (gcj), Ant, the NetBeans IDE, IBM's Eclipse Java IDE, JUnit, and SunONE Studio Develop business logic layers using Java DataBase Connectivity (JDBC) Add a Web interface using servlets and JSPs Add a GUI using Sun's Abstract Window Toolkit (AWT) and IBM's SWT Deploy EJBs in LinuxThe authors conclude by demonstrating how a hierarchy of budgets can be created, tracked, and shared with Concurrent Versions System (CVS).A companion Website includes all source code and a link to each tool described.Java™ Application Development on Linux® can propel you from a standing start to the full-speed development and deployment of Java applications on Linux.
Efficient type and memory safety for tiny embedded systems
Authors: John Regehr, Nathan Cooprider, Will Archer, Eric Eide
Venue: Proceedings of the 3rd workshop on Programming languages and operating systems: linguistic support for modern operating systems (2006)

We report our experience in implementing type and memory safety in an efficient manner for sensor network nodes running TinyOS: tiny embedded systems running legacy, C-like code. A compiler for a safe language must often insert dynamic checks into the programs it produces; these generally make programs both larger and slower. In this paper, we describe our novel compiler toolchain, which uses a family of techniques to minimize or avoid these run-time costs. Our results show that safety can in fact be implemented cheaply on low-end 8-bit microcontrollers.
A location model for a web service intermediary
Authors: Yi Sun, Gary J. Koehler
Venue: Decision Support Systems (2006)

Recently, Web services have entered the competition for a new type of distributed e-commerce platform. This paper studies the placement of servers of a Web service intermediary. The intermediary serves as a common interface to its clients while obtaining Web services from independent providers. The intermediary locates its servers by minimizing costs where a major component is network latency. We propose and study an integer programming formulation to determine the locations and usage rales of the servers of an intermediary. A greedy heuristic method is used to obtain good solutions to the problem.
Foundations of documentation: to errr is humam
Authors: T. D. C. Kuch
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1976)

There seems to be a lack of published papers dealing with the incidence and causes of errors in data bases, although errors in programs have been frequently studied. If any reader knows of some good references, I would appreciate hearing about them. 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
Linux on HP Integrity Servers
Authors: Marty Poniatowski
Venue:  (2003)

The Expert Guide to Installing and Running Linux on HP Integrity Itanium® SystemsCompanies are increasingly turning to Linux on HP Integrity systems for high-performance computing, large enterprise and database applications, and 64-bit application development. However, Linux administration in the HP Integrity's Itanium® 2-based environment is significantly different than on conventional IA-32 platforms. Now, there's a comprehensive guide to administering HP Integrity systems running Linux. HP Solution Architect and Linux/Unix expert Marty Poniatowski walks you through every essential tool and technique, from installation and bootup, compiling kernels to building clusters. Coverage includes: A primer on basic Linux system administration for those migrating from other environments The HP Integrity boot process: EFI, POSSE, and the Management Processor Using the HP Enablement Kit for Linux to install, configure, and recover Linux on HP Itanium 2 systems Using Red Hat Package Manager (RPM) and LILO Working with the GNOME and KDE user interfaces Adding and partitioning SCSI disks on HP Integrity Servers Maintaining file systems with fsck, e2fsck, inodes, and Superblock Compiling and tuning Linux kernels Linux system startup and shutdown scripts for HP Integrity systems Understanding, configuring, and using Linux networking Working with netstat, route, ipconfig, iptables, nslookup, and other key commands Managing users, groups, processes, backup/restore, and other basic system administration tasks Running Samba to deliver Windows file and print services Running Linux, HP-UX and Windows Server 2003 concurrently on the same HP Integrity system Shell programming with the Linux bash shellHP co-developed the Itanium architecture, and HP Labs scientists maintain the Itanium Linux kernel. This is the only book to leverage HP's unique knowledge about administering Linux on Itanium platforms. It will be indispensable for every sysadmin running Linux on HP Integrity or other Itanium systems -- regardless of their experience with Linux, HP-UX, or other UNIX systems.© Copyright Pearson Education. All rights reserved. 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 controllable, fast and stable basis for vortex based smoke simulation
Authors: Alexis Angelidis, Fabrice Neyret, Karan Singh, Derek Nowrouzezahrai
Venue: Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation (2006)

We introduce a novel method for describing and controlling a 3D smoke simulation. Using harmonic analysis and principal component analysis, we define an underlying description of the fluid flow that is compact and meaningful to non-expert users. The motion of the smoke can be modified with high level tools, such as animated current curves, attractors and tornadoes. Our simulation is controllable, interactive and stable for arbitrarily long periods of time. The simulation's computational cost increases linearly in the number of motion samples and smoke particles. Our adaptive smoke particle representation conveniently incorporates the surface-like characteristics of real smoke.
On the composition of authenticated Byzantine Agreement
Authors: Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
Venue: Journal of the ACM (JACM) (2006)

A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine Agreement (or Generals) and has been the focus of much research. Lamport et al. [1982] showed that in order to achieve Byzantine Agreement in the plain model, more than two thirds of the participating parties must be honest. They further showed that by augmenting the network with a public-key infrastructure for digital signatures, it is possible to obtain protocols that are secure for any number of corrupted parties. The problem in this augmented model is called &ldquo;authenticated Byzantine Agreement&rdquo;.In this article, we consider the question of concurrent, parallel and sequential composition of authenticated Byzantine Agreement protocols with a single common setup. We present surprising impossibility results showing that:(1) Authenticated Byzantine Agreement protocols that remain secure under parallel or concurrent composition (even for just two executions) and tolerate a third or more corrupted parties, do not exist.(2) Deterministic authenticated Byzantine Agreement protocols that run for r rounds and tolerate a third or more corrupted parties, can remain secure for at most 2r &minus; 1 sequential executions.In contrast, we present randomized protocols for authenticated Byzantine Agreement that remain secure under sequential composition, for any polynomial number of executions. We exhibit two such protocols. In the first protocol, an honest majority is required. In the second protocol, any number of parties may be corrupted; however, the complexity of the protocol is in the order of 2n &middot; n&excl; for n parties. In order to have this polynomial in the security parameter k (used for the signature scheme in the protocol), this requires the overall number of parties to be limited to O(log k/log log k). The above results are achieved due to a new protocol for authenticated Byzantine Generals for three parties that can tolerate any number of faulty parties and composes sequentially.Finally, we show that when the model is further augmented so that in each session, all the participating parties receive a common session identifier that is unique to that session, then any polynomial number of authenticated Byzantine agreement protocols can be concurrently executed, while tolerating any number of corrupted parties.
Link-time compaction and optimization of ARM executables
Authors: Bjorn De Sutter, Ludo Van Put, Dominique Chanet, Bruno De Bus, Koen De Bosschere
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2007)

The overhead in terms of code size, power consumption, and execution time caused by the use of precompiled libraries and separate compilation is often unacceptable in the embedded world, where real-time constraints, battery life-time, and production costs are of critical importance. In this paper, we present our link-time optimizer for the ARM architecture. We discuss how we can deal with the peculiarities of the ARM architecture related to its visible program counter and how the introduced overhead can to a large extent be eliminated. Our link-time optimizer is evaluated with four tool chains, two proprietary ones from ARM and two open ones based on GNU GCC. When used with proprietary tool chains from ARM Ltd., our link-time optimizer achieved average code size reductions of 16.0 and 18.5&percnt;, while the programs have become 12.8 and 12.3&percnt; faster, and 10.7 to 10.1&percnt; more energy efficient. Finally, we show how the incorporation of link-time optimization in tool chains may influence library interface design.
Observations on material flow in supply chains
Authors: S. T. Enns, Pattita Suwanruji
Venue: Proceedings of the 38th conference on Winter simulation (2006)

This paper summarizes one group of recent simulation studies comparing replenishment strategies. Time-phased planning, implemented using DRP and MRP logic, continuous-review reorder point (ROP) and single-card Kan-ban (KBN) systems are considered. These differ in terms of decision-making information, logic and integration requirements. Experimental results have been statistically analyzed and explained using simple stochastic models. Steps have also been taken to evaluate which strategies are most suitable under various demand patterns, levels of uncertainty and capacity constraints. Results show that DRP/MRP is superior under time-varying demand, regardless of whether or not capacity constraints are present. With no capacity constraints and level demand, ROP is superior to KBN, in part because it considers backorder information. With capacity constraints behavior is complicated by queuing effects. Under level demand, KBN may slightly outperform ROP, given assumptions of equal lot sizes, order placement delays and transportation times.
Incremental wrapper-based gene selection from microarray data for cancer classification
Authors: Roberto Ruiz, José C. Riquelme, Jesús S. Aguilar-Ruiz
Venue: Pattern Recognition (2006)

Gene expression microarray is a rapidly maturing technology that provides the opportunity to assay the expression levels of thousands or tens of thousands of genes in a single experiment. We present a new heuristic to select relevant gene subsets in order to further use them for the classification task. Our method is based on the statistical significance of adding a gene from a ranked-list to the final subset. The efficiency and effectiveness of our technique is demonstrated through extensive comparisons with other representative heuristics. Our approach shows an excellent performance, not only at identifying relevant genes, but also with respect to the computational cost.
Construction of multivariate compactly supported prewavelets in L2 space and pre-Riesz bases in Sobolev spaces
Authors: Ming-Jun Lai
Venue: Journal of Approximation Theory (2006)

We give a new constructive method for finding compactly supported prewavelets in L2 spaces in the multivariate setting. This method works for any dimensional space. When this method is generalized to the Sobolev space setting, it produces a pre-Riesz basis for Hs(Rd) which can be useful for applications.
A combined register-stack architecture
Authors: Richard L. Sites
Venue: ACM SIGARCH Computer Architecture News (1978)

A stack is the simplest mechanism for evaluating arithmetic expressions, while a group of general registers is the simplest mechanism for quick access to a small number of common subexpressions or loop control variables. Until now, computers have been designed around either a stack mechanism or a register mechanism, but no machine has included both in a convenient way. In this paper, we propose a new <u>combination</u> architecture in which there are general registers, but one of these registers is the top of an evaluation stack. This combination is intended entirely for calculation, and is not related to the use of stacks in main memory for holding activation records of Algol-like procedures, or to the use of stacks for holding subroutine linkage information. The mechanism can be implemented entirely in a fixed number of hardware registers, with no elaborate stack spilling mechanism. The combination architecture meshes perfectly with existing general-register architectures, while providing the advantages of a stack for expression evaluation. One way to view the combination architecture is that it provides access to about twice as many fast registers with no increase in the number of instruction bits needed to address them.
Presenting Windows Workflow Foundation
Authors: Paul Andrew, James Conard, Scott Woodgate
Venue:  (2005)

Presenting Windows Workflow Foundation is a premium reference that provides information on a key part of WinFX, providing universally accessible and consistent workflow technology for the Windows platform. Windows Workflow Foundation delivers an API as part of WinFX and a workflow designer hosted in Visual Studio 2005.The Windows Workflow Foundation supports development of both sequential and state-based workflow involving both human and system interaction. Sequential workflow is a map of activities that may be in series or parallel. State-based workflow is a state machine where events cause transitions. Rules can be specified that drive decision making in a workflow and can be updated easily at runtime. Workflow can be created as a model and executed inside many host applications including Windows Forms, console applications, or Web applications. Key Scenarios that can be developed with Windows Workflow Foundation include: Document management: The steps involved in the review and approval of shared documents or other content. Line of business application: The processing flow or business logic in an extensible part of the application. Website page flow: The flow of state variables between web pages. IT management: Handling of common systems management processes. Decision making logic: Where complex business logic is well described by a sequential or state diagram. Consumer: A common series of steps for consumer PC usage.Download the source code from the book at www.samspublishing.com
Real-Time Huffman Encoder with Pipelined CAM-Based Data Path and Code-Word-Table Optimizer
Authors: Takeshi Kumaki, Yasuto Kuroda, Masakatsu Ishizaki, Tetsushi Koide, Hans Jürgen Mattausch, Hideyuki Noda, Katsumi Dosaka, Kazutami Arimoto, Kazunori Saito
Venue: IEICE - Transactions on Information and Systems (2007)

This paper presents a novel optimized real-time Huffman encoder using a pipelined data path based on CAM technology and a parallel code-word-table optimizer. The exploitation of CAM technology enables fast parallel search of the code word table. At the same time, the code word table is optimized according to the frequency of received input symbols and is up-dated in real-time. Since these two functions work in parallel, the proposed architecture realizes fast parallel encoding and keeps a constantly high compression ratio. Evaluation results for the JPEG application show that the proposed architecture can achieve up to 28% smaller encoded picture sizes than the conventional architectures. The obtained encoding time can be reduced by 95% in comparison to a conventional SRAM-based architecture, which is suitable even for the latest end-user-devices requiring fast frame-rates. Furthermore, the proposed architecture provides the only encoder that can simultaneously realize small compressed data size and fast processing speed.
Note on: an improved algorithm for the packing of unequal circles within a larger containing circle
Authors: Wenqi Huang, Mao Chen
Venue: Computers and Industrial Engineering (2006)

This note proposed an improved version of the algorithm proposed by Wang et al. [Wang, H. Q., Huang, W. Q., Zhang, Q., & Xu, D. M. (2002). An improved algorithm for the packing of unequal circles within a larger containing circle. European Journal of Operational Research, 141, 339 347] for solving the disk packing problem with equilibrium constraints. An efficient strategy of accelerating the search process is introduced in the gradient method to shorten the execution time. A number of computational results are presented, showing the effectiveness of the proposed method.
Errurs: left ambiguity
Authors: Gerald M. Weinberg
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1979)

In the previous ERRURS, we wrote of heteronyms--words such as <u>refuse</u>, <u>refuse</u>, and <u>refuse</u> that look alike but don't sound or mean alike. It's possible to extend the entire concept of heteronymous ambiguity (wow!) to larger elements. If we're sufficiently clever, we can even make an entire sentence look and sound like another sentence.
Fast simulation of deformable models in contact using dynamic deformation textures
Authors: Nico Galoppo, Miguel A. Otaduy, Paul Mecklenburg, Markus Gross, Ming C. Lin
Venue: Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation (2006)

We present an efficient algorithm for simulating contacts between deformable bodies with high-resolution surface geometry using dynamic deformation textures, which reformulate the 3D elastoplastic deformation and collision handling on a 2D parametric atlas to reduce the extremely high number of degrees of freedom in such a computationally demanding simulation. We perform proximity queries for deformable bodies using a two-stage algorithm directly on dynamic deformation textures, resulting in output-sensitive collision detection that is independent of the combinatorial complexity of the deforming meshes. We present a robust, parallelizable formulation for computing constraint forces using implicit methods that exploits the structure of the motion equations to achieve highly stable simulation, while taking large time steps with inhomogeneous materials. The dynamic deformation textures can also be used directly for real-time shading and can easily be implemented using SIMD architecture on commodity hardware. We show that our approach, complementing existing pioneering work, offers significant computational advantages on challenging contact scenarios in dynamic simulation of deformable bodies.
Toward Separating Integer Factoring from Discrete Logarithm mod p
Authors: Shuji Isobe, Wataru Kumagai, Masahiro Mambo, Hiroki Shizuya
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2007)

This paper studies the reduction among cyptographic functions. Our main result is that the prime factoring function IF does not reduce to the certified discrete logarithm function modulo a prime nor its variant with respect to some special reducibility, i.e. the range injection reducibility, under the assumption that the Heath-Brown conjecture is true and IF â PF. Since there is no known direct relationship between these functions, this is the first result that could separate these functions. Our approach is based on the notion of the preimage functions.
Numerical simulations of jet pinching-off and drop formation using an energetic variational phase-field method
Authors: Xiaofeng Yang, James J. Feng, Chun Liu, Jie Shen
Venue: Journal of Computational Physics (2006)

We study the retraction and pinch-off of a liquid filament and the formation of drops by using an energetic variational phase field model, which describes the motion of mixtures of two incompressible fluids. An efficient and accurate numerical scheme is presented and implemented for the coupled nonlinear systems of Navier-Stokes type linear momentum equations and volume preserving Allen-Cahn type phase equations. Detailed numerical simulations for a Newtonian fluid filament falling into another ambient Newtonian fluid are carried out. The dynamical scaling behavior and the pinch-off behavior, as well as the formation of the consequent satellite droplets are investigated.
Experiences in building and operating ePOST, a reliable peer-to-peer application
Authors: Alan Mislove, Ansley Post, Andreas Haeberlen, Peter Druschel
Venue: Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006 (2006)

Peer-to-peer (p2p) technology can potentially be used to build highly reliable applications without a single point of failure. However, most of the existing applications, such as file sharing or web caching, have only moderate reliability demands. Without a challenging proving ground, it remains unclear whether the full potential of p2p systems can be realized.To provide such a proving ground, we have designed, deployed and operated a p2p-based email system. We chose email because users depend on it for their daily work and therefore place high demands on the availability and reliability of the service, as well as the durability, integrity, authenticity and privacy of their email. Our system, ePOST, has been actively used by a small group of participants for over two years.In this paper, we report the problems and pitfalls we encountered in this process. We were able to address some of them by applying known principles of system design, while others turned out to be novel and fundamental, requiring us to devise new solutions. Our findings can be used to guide the design of future reliable p2p systems and provide interesting new directions for future research.