ppxscal/embedding_network huggingface dataset:
Stability of &#x03B8;-methods for delay integro-differential equations
Authors: Toshiyuki Koto
Venue: Journal of Computational and Applied Mathematics (2003)

Stability of θ-methods for delay integro-differential equations (DIDEs) is studied on the basis of the linear equation du/dt= λu(t) + µu(t - τ) + k ∫t-τt u(σ) dσ, where λ,µ,k are complex numbers and τ is a constant delay. It is shown that every A-stable θ-method possesses a similar stability property to P-stability, i.e., the method preserves the delay-independent stability of the exact solution under the condition that k is real and τ/h is an integer, where h is a step-size. It is also shown that the method does not possess the same property if τ/h is not an integer. As a result, no θ-method can possess a similar stability property to GP-stability with respect to DIDEs.
Scratching someone else's itch: (why open source can't do usability)
Authors: Steven Pemberton
Venue: interactions (2004)

Every good work of software starts by scratching a developer's personal itch.<br>---Eric Raymond,<br>The Cathedral and the Bazaar<br><br>There's a closely related issue, however that I don't know how to solve yet without a big player with a lot of money, which is doing systematic user interface end user testing. We're not very good at that yet, we need to find a way to be good at it.<br>---Eric Raymond,<br>Why Open Source will Rule
Quadruple Time Redundancy Adders
Authors: Whitney J. Townsend, Jacob A. Abraham, Earl E. Swartzlander,  Jr.
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

This paper presents a concurrent error correcting adder design employing fault masking through a combination of time and hardware redundancy. This new method, Quadruple Time Redundancy, is compared with a non-redundant adder, a Tripple Modular Redundancy adder, and a Time Shared Triple Modular Redundancy adder with respect to the hardware complexity and the delay for adders of various sizes. In comparison with Time Shared Triple Modular Redundancy to which it is most closely related, Quadruple Time Redundancy results in a 40% - 55% reduction in hardware complexity while incurring a reasonable delay increase.
Modeling, rendering and animating human hair
Authors: Ulrich Neumann
Venue:  (2002)

As computer generated virtual humans become ubiquitous in many areas such as virtual agents, avatars in virtual worlds, and characters in games, these create strong demands for realistic human hair synthesis. Although methods for creating convincing face images and animations exist, it remains difficult to obtain the realistic appearance and behavior of human hair. As a consequence, hair is usually simplified or hidden with hats. However, hair is a very important cue for recognizing people. To faithfully model the natural appearance of a person, hair has to be accurately modeled, rendered, and animated. The difficulties with human hair arise from several of its qualities. First, an average person's head has about 100,000 hair strands. With this number, even simplified models take vast amount of computing resources. Second, each hair strand's behavior is not trivial. Third, the interactions between hairs generate very important patterns that make one hairstyle distinguishable from others. This thesis identifies the problems related to modeling human hair and presents related research efforts. Thin shell volume (TSV) method and multiresolution hair modeling (MHM) method aim at modeling human hair due to hair-hair interaction. TSV method focuses on relatively flat hairstyles and structural details are added with virtual hair combing function on these hairstyles. MHM extends the idea of TSV method, enabling the user to model wide range of hairstyles at multiple level of detail. An interactive system is developed based on MHM method. To render resulting strand-based hair models, a complete hair-rendering pipeline is developed. A novel shadow generation algorithm is presented that exploits existing graphics hardware. This approach is called opacity shadow maps and is much more efficient than previous hair shadow algorithms. A simple antialiasing algorithm using alpha blending is also presented. In conclusion, future extensions of the methods are proposed.
From the chair
Authors: Janice C. Sipior, Laurie Schatzberg, Dorothy Leidner, Fred Niederman, Diane Lending
Venue: ACM SIGMIS Database (2004)

I would like to wish all of you a happy, healthy, and prosperous New Year!I would like to thank all of our members and their guests who attended the "Third Annual ACM-SIGMIS Reception," held as an ACM-SIGMIS event on Saturday, December 13, 2003, prior to the International Conference on Information Systems (ICIS2003) in Seattle, Washington, USA. It was great fun seeing all of you! Photos from the event will soon be posted to ACM-SIGMIS's website at: http://www.acm.org/sigmis. This is an annual event, so please mark your calendar now. Next year's reception is planned for Saturday, December 11, 2004, prior to ICIS2004 to be held in Washington, D.C., USA, December 12 - 15, 2004.Please plan to attend our ACM-SIGMIS Computer Personnel Research 2004 (CPR'04) Conference. For more information, please contact the Conference Chair, Mohan Tanniru, University of Arizona, mtanniru@eller.arizona.edu or visit the conference website listed below: Conference: ACM-SIGMIS Computer Personnel Research 2004 (CPR'04) Conference Theme: "Computer Personnel: Careers, Culture, and Ethics in a Networked Environment" Dates: April 22-24, 2004 Location:Tucson, Arizona, USA Website: http://www.eller.arizona.edu/mis/CPR2004.htmI am pleased to announce the establishment of the annual SIGMIS Magid Igbaria Outstanding Conference Paper of the Year Award, in recognition of the outstanding contributions to MIS and CPR by the late Magid Igbaria, Claremont Graduate School. This award, approved in October 2003 by the ACM awards committee, will be presented for the first time at this year's CPR'04 conference. I would like to express my sincere gratitude to Fred Niederman, Saint Louis University, for all his efforts in establishing this award. I would also like to thank Lorne Olfman, Claremont Graduate School; Tor Guimaraes, Tennessee Technological University; Al Lederer, University of Kentucky; Munir Mandviwalla, Temple University; and Conrad Shayo, California State University for their support.Thank you for your interest and involvement in SIGMIS. We encourage your comments and suggestions. Should you have any questions, ideas, or other input, please feel free to contact any one of us. We look forward to seeing you at ACM-SIGMIS CPR'04!
Owner/user role in computational grid extension by non-dedicated resources
Authors: Goran Martinovic
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

Engagement of non-dedicated machines in the computational grid requires special attention by mapping. In addition to application, platform and mapping parameters, a human as a resource owner plays an extremely important role. The problem is easier for the owner/user who also requires grid services at the same time. The grid can provide a powerful support to CSCW. Resource concession can also be treated as cooperation in the grid extension. The proposed resource extension model is based on meeting scheduling. This model puts a group member into a competitive position, since he becomes responsible for his organizational and infrastructure capabilities. He tends to concede the idle capacity to the grid in order to be able to use services provided by that powerful virtual machine.
WS-Negotiation: An Overview of Research Issues
Authors: Patrick C. K. Hung, Haifei Li, Jun-Jang Jeng
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

A Web service is defined as an autonomous unit of application logic that provides either some business functionality or information to other applications through an Internet connection. Web services are based on a set of XML standards such as Simple Object Access Protocol (SOAP), Universal Description, Discovery and Integration (UDDI) and Web Services Description Language (WSDL). In particular, Web services discovery is the process of finding most appropriate Web services providers needed by a Web services requestor. One of the important issues in the discovery process is for Web services providers and Web services requestors to negotiate and find a solution that is acceptable to both sides. Thus, a moresophisticated business model with negotiation feature is required for this challenging research area. As there are increasing demands for negotiation technologies in the context of Web services, this paper proposes an independent declarative XML language called WSNegotiation for Web services providers and requestors. In general, WS-Negotiation contains three parts: Negotiation Message, which describes the format for messages exchanged among negotiation parties, Negotiation Protocol, which describes the mechanism and rules that negotiation parties should follow, and Negotiation Decision Making, which is an internal and private decision process based on a cost-benefit model or other strategies. This paper also presents a Service Level Agreement (SLA) template model with different domain specific vocabularies for supporting different types of business negotiations in WS-Negotiation.
Teaching undergraduate software design in a liberal arts environment using RoboCup
Authors: Timothy Huang, Frank Swenton
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

Most large research universities include a software design or software development course as a required or elective component of an undergraduate computer science major. For various reasons, some institutions, including many liberal arts colleges and primarily undergraduate institutions, do not. In this paper, we present a software design course, tailored to undergraduate computer science students within a liberal arts environment, based on the RoboCup soccer simulation platform. We describe the course curriculum and outline its goals, which student evaluations suggest it achieved. We also outline the features of our "NewKrislet" soccer player, which provides an elementary but sufficiently functional entry point to Robocup client design.
Delta optimizes continuing-qualification-training schedules for pilots
Authors: Milind G. Sohoni, T. Glenn Bailey, Kristi G. Martin, Helen Carter, Ellis L. Johnson
Venue: Interfaces (2003)

Delta Air Lines periodically trains its cockpit crew members to maintain their flight qualifications. The negotiation of the new pilot working agreement (PWA) in June 2001 introduced a short and stringent planning cycle and a new training-pay structure that affects operating costs. The downturn in airline business after September 11, 2001 forced Delta to reduce its workforce and to modify its requirements for scheduling pilot training. To mitigate Delta's exposure to costs and to automate the scheduling process under a rigid planning time line, we developed and deployed an automated optimization system, CQOPT, that builds and assigns training schedules based on individual pilot's requirements. The primary objectives of CQOPT are to minimize overall operating costs and maximize training assignments. Shortly after CQOPT's deployment in May 2002, the planning cycle dropped from several days to a few hours. Delta expects to save $7.5 million in annual operating costs by using CQOPT to schedule continuing qualification (CQ) training for its pilots.
SoftTest: a framework for software testing of Java programs
Authors: B. Childers, M. L. Soffa, Jonathan Beaver, L. Ber, K. Cammarata, T. Kane, J. Litman, J. Misurda
Venue: Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange (2003)

Producing reliable and robust software has become one of the most important software development concerns in recent years. Testing is a process by which software quality can be assured through the collection of information about software. While testing can improve software reliability, current tools typically are inflexible and have high over-heads, making it challenging to test large software projects. In this paper, we describe a new scalable and flexible framework, called SoftTest, for testing Java programs with a novel path-based approach to coverage testing. We describe an initial implementation of the framework for branch coverage testing and demonstrate the feasibility of our approach.
Restructuring VLSI layout representations for efficiency
Authors: Ravi Nair, Vivekanand Chickermane, Ray Chamberlain
Venue: Proceedings of the conference on European design automation (1991)

VLSI mask layouts usually have a hierarchical representation which serves to record the structure of the design while saving storage space. It is often convenient to work directly on such a representation for performing some operations. However for many other operations it is preferable to work on the flattened representation of the circuit. In this paper we look at the unnesting operation on layouts to demonstrate that simple transformations of one hierarchy to an equivalent one help tremendously in improving the performance of typical operations on hierarchical layout representations, while not requiring as much memory as flattened representations.
Measured Responses to Cyber Attacks Using Schmitt Analysis: A Case Study of Attack Scenarios for a Software-Intensive System
Authors: James B. Michael, Thomas C. Wingfield, Duminda Wijesekera
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

In this paper we address the development of measuredresponses to coercive actions. We demonstrate, via acase study of kinetic and cyber attacks on a safety-criticalsoftware-intensive system, the application of the SchmittAnalysis to the question of whether the attacks have risento the level of a "use of force" under international law,taking into account both the quantitative and qualitativeaspects of the attacks.
Video cut editing rule based on participants' gaze in multiparty conversation
Authors: Yoshinao Takemae, Kazuhiro Otsuka, Naoki Mukawa
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

This paper proposes a video cut editing rule based on participants' gaze for extracting and conveying the flow of conversation in multiparty conversation. Systems that record meetings and those that support teleconferences are attracting considerable interest. Conventional systems use a fixed-viewpoint camera and simple camera selection based on participants' utterances. However, conventional systems fail to convey a sufficient amount of nonverbal information about the participants and the flow of conversation. We focus on participants' gaze since it is a good indicator of the participants' intent and emotion, conversational attention etc. We propose a video cut editing rule based on the convergence of participants' gaze direction. We conduct an experiment to evaluate the effectiveness of the proposed method. The results indicate that the proposed method can successfully convey who is taking to whom, which is a key indicator of the flow of conversation.
Testability Transformation
Authors: Mark Harman, Lin Hu, Rob Hierons, Joachim Wegener, Harmen Sthamer, André Baresel, Marc Roper
Venue: IEEE Transactions on Software Engineering (2004)

Abstract--A testability transformation is a source-to-source transformation that aims to improve the ability of a given test generation method to generate test data for the original program. This paper introduces testability transformation, demonstrating that it differs from traditional transformation, both theoretically and practically, while still allowing many traditional transformation rules to be applied. The paper illustrates the theory of testability transformation with an example application to evolutionary testing. An algorithm for flag removal is defined and results are presented from an empirical study which show how the algorithm improves both the performance of evolutionary test data generation and the adequacy level of the test data so-generated.
Building "bows for violinists": designing real digital tools for working artists
Authors: Michael B. Johnson
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

When asked what we do at Pixar Studio Tools R&D, we often use a story Marvin Minsky related about picking up a violin to make music versus a CD player. One is designed for ease of use, while the other demands and rewards a lifetime of study and practice. Both have their place when you want to hear music, but only one of them is helpful in making music. In Pixar R&D, we build bows for our violinists here at Pixar.Designing and building digital tools for artists working on large collaborative projects like features films has many challenges. Some of these are unique to a collaborative enterprise, and some are not. I will discuss some of the challenges in building such tools, using examples drawn from both successful and unsuccessful projects. 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
The Matroid Ramsey Number n(6,6)
Authors: Joseph E. Bonin, Jennifer McNulty, Talmage James Reid
Venue: Combinatorics, Probability and Computing (1999)

A tight upper bound on the number of elements in a connected matroid with fixed rank and largest cocircuit size is given. This upper bound is used to show that a connected matroid with at least thirteen elements contains either a circuit or a cocircuit with at least six elements. In the language of matroid Ramsey numbers, n(6, 6) = 13: this is the largest currently known matroid Ramsey number.
The conquest file system: a disk/persistent-ram hybrid design for better performance and simpler data paths
Authors: An-I Andy Wang
Venue:  (2003)

Modern file systems assume the use of disk, but this assumption has two major problems. First, disk has been the system-wide performance bottleneck of the past decade&mdash;a bottleneck that continues to worsen rapidly. Second, disk-related optimizations have grown over the years to mask this widening performance gap, resulting in operating systems that are increasingly complex. Popular solutions, such as disk caching and RAM file systems, either impose high overhead to access memory content or fail to provide the ability to store arbitrary amounts of data persistently without adding further complexities. The Conquest file system exploits the observation that memory is becoming an inexpensive resource that can deliver all file system services with the single exception of large storage capacity. Instead of using memory for caching, Conquest uses memory with battery backup as persistent storage, and provides two separate data paths to memory and disk storage. By specializing the data paths, the memory data path no longer contains disk-related complexity. The disk data path consists of only optimizations for the specialized disk usage pattern. Conquest's design addresses the two major problems introduced by disk: (1) making memory the primary storage provides fast access to memory content without disk-related overhead, and (2) specialized use of memory and disk reduces the complexity of both data paths. Compared to ext2fs, reiserfs, and SGI XFS, Conquest shows at least a 20% smaller code base in terms of semicolon counts. With a memory-only workload, Conquest matches the performance of ramfs and outperforms disk caching by 24% to 350% in terms of transaction rates. With a workload that exercises memory and disk components, Conquest still outperforms disk caching by 43% to 96%. Conquest shows that the goal of achieving better performance does not preclude simplicity of design, and Conquest realizes most of the benefits of persistent RAM at a fraction of the cost of a RAM-only solution. Conquest further demonstrates that in a memory-rich environment, disk-related optimizations impose high performance overheads for the common case of accessing data from memory, and disk-based benchmarks need to be redesigned to capture subtle effects of underlying hardware on memory-speed file systems.
Generating, Selecting and Prioritizing Test Cases from Specifications with Tool Support
Authors: Y. T. Yu, S. P. Ng, Eric Y. K. Chan
Venue: Proceedings of the Third International Conference on Quality Software (2003)

The classification-tree method provides a systematicway for software testers to derive test cases byconsidering important relevant aspects that are identifiedfrom the specification. The method has been used inmany real-life applications and shown to be effective.This paper presents several enhancements to the methodby annotating the classification tree with additionalinformation to reduce manual effort in the generation,selection and prioritization of test cases. A tool forsupporting this enhanced process is also described.
A Model for Investigating the Effects of Machine Autonomy on Human Behavior
Authors: Jeffrey V. Nickerson, Richard R. Reilly
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

As autonomous machines become more pervasive, situations will arise when human decision-makers will receive advice from both machines and other humans. When these instructions conflict, a new social situation is defined for which we have little precedent. The authors propose a model for investigating these situations. The model synthesizes research from several different fields, including machine autonomy, affect, initial trust, individual differences, and training. The model is explained, and a set of propositions is described. Themodel is used to analyze the case of an air collision in which machines and humans provided conflicting advice. The model is also applied to situations in which unmanned aerial vehicles and piloted aircraft seek to avoid collisions with each other. Ways of testing the model through human subject experiments are discussed.
A statistical model for word discovery in transcribed speech
Authors: Anand Venkataraman
Venue: Computational Linguistics (2001)

A statistical model for segmentation and word discovery in continuous speech is presented. An incremental unsupervised learning algorithm to infer word boundaries based on this model is described. Results are also presented of empirical tests showing that the algorithm is competitive with other models that have been used for similar tasks.
An Investigation and Conceptual Model of SMS Marketing
Authors: Astrid Dickinger, Parissa Haghirian, Jamie Murphy, Arno Scharl
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

Mobile marketing, also known as wireless marketing, promises vast opportunities. Still in an experimental phase, businesses have little experience using this new marketing tool. Mobile services offer companies powerful marketing potential via direct communication with consumers, anytime and anywhere, but little research on this subject exists. This paper discusses Short Message Services (SMS), which belong to the first and most successful forms of mobile data transmission. Based on a literature review and exploratory qualitative research, this paper defines mobile marketing, describes its most popular application, text messaging,introduces a conceptual model of success factors for implementing mobile marketing, and proposes future research avenues.