ppxscal/embedding_network huggingface dataset:
Connection-less TCP
Authors: Patricia Gilfeather, Arthur B. MacCabe
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 9 - Volume 10 (2005)

TCP is an important protocol in high-performance computing. It is used extensively in graphics programs and file systems and it is often the protocol used for the cluster control mechanism. As the breadth of applications increases, the need for a scalable and efficient implementation of TCP becomes more important. In addition to other bottlenecks that must be alleviated, TCP connection management must be made scalable. This becomes critical as we consider offloading TCP processing onto TCP offload engines (TOEs) or intelligent network interface cards (iNICs). In this paper, we show how to take advantage of special characteristics of the high-performance computing environment and apply existing operating system mechanisms in a unique way to address some of the scalability concerns in offloaded TCP. Specifically, we implement methods for activating and deactivating TCP connections. These allow us to maintain a large store of open TCP connections without a large amount of storage overhead.
Integrating eCommerce into eLearning
Authors: Markus Schmees
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Generally, realizing and performing taks in an electronic learning context is an expensive matter. In order to compensate incurring costs, appropriate business models are required. A lot of various authors develop and describe different business models for eLearning. However, a common way to integrate these business models into electronic learning activities is missing up to now. In this article, there is an instrument developed that supports an implementation of transaction dependent business models. For this purpose, a learning platform is used as a basis. The introduced instrument combines an automated accomplishment of financial transactions with an execution of provided functions. Additionally, it protects valuable functionality against unauthorized access. The instrument is applicable manifoldly. It can handle any kind of digital learning resource and is able to include an individual account management of involved participants. Moreover, it can be used to meet didactic, organizational, and economical requirements inside a learning platform.
Role-based information security: change management issues
Authors: Pratap Chillakanti
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

Information security has become a paramount issue in today's IT-enabled businesses. Organizations are increasingly depending on IT-enabled business processes to drive productivity, profitability and customer satisfaction. That means that a large volume of information and data is shared across organizations, partners, vendors and employees. In such a situation it becomes imperative to have enterprise-wide security models and frameworks in place to ensure that data and information are not compromised in any way.
Distributed group-based cooperative caching in a mobile broadcast environment
Authors: Chi-Yin Chow, Hong Va Leong, Alvin T. S. Chan
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Caching is a key technique for improving data retrieval performance of mobile clients. The emergence of state-of-the-art peer-to-peer communication technologies now brings to reality what we call "cooperative caching" in which mobile clients not only can retrieve data items from mobile support stations, but also from the cache in their peers, thereby inducing a new dimension for mobile data caching. In this paper, we propose a distributed group-based cooperative caching scheme, in which we define the concept of a tightly-coupled group (TCG) by capturing the data affinity of individual peers and their mobility patterns, in a mobile broadcast environment. A distributed stable peer discovery protocol is proposed for discovering all TCGs dynamically. In addition, a cache signature scheme is adopted to provide hints for the mobile clients to determine whether their required data items are cached by their neighboring peers, and to perform cooperative cache replacement to increase overall data availability. Simulation studies are conducted to evaluate the effectiveness of our distributed group-based cooperative caching scheme.
Towards modeling context-sensitive interactive applications: the context-sensitive user interface profile (CUP)
Authors: Jan Van den Bergh, Karin Coninx
Venue: Proceedings of the 2005 ACM symposium on Software visualization (2005)

The construction of software systems is becoming increasingly complex because of the changing environments the software is supposed to function in. Taking into account the context of use, how the system reacts and anticipates changes in its working environment, is important for a wide range of applications, such as mobile services for example, Model-driven design is already widely accepted as a software engineering methodology to cope with these new type of requirements. This approach is known both in software engineering (e.g. model-driven architecture) as in the design of user interfaces (model-based user interface development), but although they target the same deficiencies from traditional approaches, there is still a gap between both. New modeling elements are necessary that allow the designer to make both context of use and user interactions explicit in the design phase and to create context-sensitive software that will be more robust and usable. We extend the UML 2.0 notation to address the aforementioned issues and present extensions to support the modeling of context-sensitive interactive applications. These extensions are defined in a new UML profile that can easily be used in existing modeling environments.
Fully Differential CMOS Current Feedback Operational Amplifier
Authors: Soliman A. Mahmoud, Inas A. Awad
Venue: Analog Integrated Circuits and Signal Processing (2005)

This paper presents a new CMOS fully differential current feedback operational amplifier (FDCFOA). The proposed CMOS realization of the FDCFOA is based on a novel class AB fully differential buffer circuit. Besides the proposed FDCFOA circuit is operating at supply voltages of ±1.5 V, it has a total standby current of 400 ¿A. The applications of the FDCFOA to realize variable gain amplifier, fully differential integrator, and fourth order fully differential maximally flat low pass filter are given. The fourth order filter provides 8 dB gain and a bandwidth of 4.3 MHz to accommodate the wideband CDMA standard. The proposed FDCFOA and its applications are simulated using CMOS 0.35 ¿ m technology.
A Rationality-Based Modeling for Coalition Support
Authors: Jae C. Oh, Nathaniel Gemelli, Robert Wright
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

We present a game theoretic model for multi-agent resource distribution and allocation where agents in the environment must help each other to survive.Each agent maintains a set of two-tuples F = (A, P) called friendship values representing actaul friendship and perceived friendship. The model directly addresses problems in reputation management schemes in multi-agent systems and Peer-to-Peer distributed systems.We present algorithms for maintaining the friendship values as well as a utility equation used in each agent's decision making.For an application problem, we adapted our formal model to the military coalition support problem in peace-keeping missions. Simulation results show that efficient resource allocation and sharing with minimum communication cost is achieved without centralized control.
Why Order Matters: Turing Equivalence in Automated Systems Administration
Venue: Proceedings of the 16th USENIX conference on System administration (2002)

Hosts in a well-architected enterprise infrastructure are self-administered; they perform their own maintenance and upgrades. By definition, self-administered hosts execute self-modifying code. They do not behave according to simple state machine rules, but can incorporate complex feedback loops and evolutionary recursion.The implications of this behavior are of immediate concern to the reliability, security, and ownership costs of enterprise and mission-critical computing. In retrospect, it appears that the same concerns also apply to manually-administered machines, in which administrators use tools that execute in the context of the target disk to change the contents of the same disk. The self-modifying behavior of both manual and automatic administration techniques helps explain the difficulty and expense of maintaining high availability and security in conventionally-administered infrastructures.The practice of infrastructure architecture tool design exists to bring order to this self-referential chaos. Conventional systems administration can be greatly improved upon through discipline, culture, and adoption of practices better fitted to enterprise needs. Creating a low-cost maintenance strategy largely remains an art. What can we do to put this art into the hands of relatively junior administrators? We think that part of the answer includes adopting a well-proven strategy for maintenance tools, based in part upon the theoretical properties of computing.In this paper, we equate self-administered hosts to Turing machines in order to help build a theoretical foundation for understanding this behavior. We discuss some tools that provide mechanisms for reliably managing self-administered hosts, using deterministic ordering techniques.Based on our findings, it appears that no tool, written in any language, can predictably administer an enterprise infrastructure without maintaining a deterministic, repeatable order of changes on each host. The runtime environment for any tool always executes in the context of the target operating system; changes can affect the behavior of the tool itself, creating circular dependencies. The behavior of these changes may be difficult to predict in advance, so testing is necessary to validate changed hosts. Once changes have been validated in testing they must be replicated in production in the same order in which they were tested, due to these same circular dependencies.The least-cost method of managing multiple hosts also appears to be deterministic ordering. All other known management methods seem to include either more testing or higher risk for each host managed.This paper is a living document; revisions and discussion can be found at Infrastructures.Org, a project of TerraLuna, LLC.
Book review: Readings in Planning Edited by James Allen, James Hendler, and Austin Tate (Morgan Kaufmann, San Mateo, CA, 1990)
Venue: ACM SIGART Bulletin (1991)

Readings In Planning (RIP) is another volume in a fine series of anthologies published by Morgan Kaufman. This volume is a collection of previously published (save for one) papers on the subfield of artificial intelligence (AI) dealing with planning and the action. This volume presents many of the historically important papers while providing a general framework for study in this field.
A comparison of techniques for multi-display reaching
Authors: Miguel A. Nacenta, Dzmitry Aliakseyeu, Sriram Subramanian, Carl Gutwin
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Recent advances in multi-user collaboration have seen a proliferation of interaction techniques for moving digital objects from one device to another. However, little is known about how these techniques work in realistic situations, or how they compare to one another. We conducted a study to compare the efficiency of six techniques for moving objects from a tablet to a tabletop display. We compared the techniques in four different distance ranges and with three movement directions. We found that techniques like the Radar View and Pick-and-Drop, that have a control-to-display ratio of 1, are significantly faster for object movement than techniques that have smaller control-to-display ratios. We also found that using spatial manipulation of objects was faster than pressure-based manipulation.
ITP Interpretext system: MUC-3 test results and analysis
Authors: Kathleen Dahlgren, Carol Lord, Hajime Wada, Joyce McDowell, Edward P. Stabler
Venue: Proceedings of the 3rd conference on Message understanding (1991)

Intelligent Text Processing is a small start-up company participating in the MUC-3 exercise for the first time this year. Our system, Interpretext, is based on a prototype text understanding system. With three full-time and three part-time people, dividing time between MUC-3 and other contract projects, ITP made maximum use of modest resources.
Range-Efficient Computation of F" over Massive Data Streams
Authors: A. Pavan, Srikanta Tirthapura
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Efficient one-pass computation of F¿, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consider the problem of efficiently estimating F¿ of a data stream where each element of the stream is an interval of integers. We present a randomized algorithm which gives an (\varepsilon ,\delta ) approximation of F¿, with the following time complexity (n is the size of the universe of the items): (1) The amortized processing time per interval is 0(\log \frac{1}{\delta }Log\frac{n}{\varepsilon }). (2) The time to answer a query for F¿ is 0(\log {1 \mathord{\left/ {\vphantom {1 {\delta )}}} \right. \kern-\nulldelimiterspace} {\delta )}}. The workspace used is 0(\frac{1}{{\varepsilon ^2 }}\log \frac{1}{\delta }\log n) bits. Our algorithm improves upon a previous algorithm by Bar-Yossef, Kumar and Sivakumar [5], which requires 0(\frac{1}{{\varepsilon ^5 }}\log \frac{1}{\delta }\log ^5 n) processing time per item. Our algorithm can be used to compute the max-dominance norm of a stream of multiple signals, and significantly improves upon the current best bounds due to Cormode and Muthukrishnan [11]. This also provides efficient and novel solutions for data aggregation problems in sensor networks studied by Nath and Gibbons [22] and Considine et. al. [8].
Hierarchical Gaussian process mixtures for regression
Authors: J. Q. Shi, R. Murray-Smith, D. M. Titterington
Venue: Statistics and Computing (2005)

As a result of their good performance in practice and their desirable analytical properties, Gaussian process regression models are becoming increasingly of interest in statistics, engineering and other fields. However, two major problems arise when the model is applied to a large data-set with repeated measurements. One stems from the systematic heterogeneity among the different replications, and the other is the requirement to invert a covariance matrix which is involved in the implementation of the model. The dimension of this matrix equals the sample size of the training data-set. In this paper, a Gaussian process mixture model for regression is proposed for dealing with the above two problems, and a hybrid Markov chain Monte Carlo (MCMC) algorithm is used for its implementation. Application to a real data-set is reported.
Test set enhancement for quality transition faults using function-based methods
Authors: Stelios Neophytou, Maria K. Michael, Spyros Tragoudas
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

A recent method generates high quality tests for transition faults using functions. Event sensitization criteria as well as path lengths can be taken into consideration during the generation of such test functions. It is shown how to manipulate the test functions to generate compact test sets. Experimental results on ISCAS'85 and ISCAS'89 circuits show that a compaction rate of the order of 70% to 84% is achieved without compromising fault coverage. Moreover, a novel method to enrich the compacted test set with additional vectors is presented so that transition faults are tested through different activation and propagation paths. Such test sets havehigher quality, compared to traditional transition fault test sets, since events propagate through many critical paths.
Bandwidth on Demand for Deployed-IP Users
Authors: William G. Hwang
Venue: IT Professional (2005)

In areas lacking a communications infrastructure, commercial satellite services can offer a cost-effective means of carrying IP traffic.
Propagation, Observation, and Control of Waves Approximated by Finite Difference Methods
Authors: Enrique Zuazua
Venue: SIAM Review (2005)

This paper surveys several topics related to the observation and control of wave propagation phenomena modeled by finite difference methods. The main focus is on the property of observability, corresponding to the question of whether the total energy of solutions can be estimated from partial measurements on a subregion of the domain or boundary. The mathematically equivalent property of controllability corresponds to the question of whether wave propagation behavior can be controlled using forcing terms on that subregion, as is often desired in engineering applications. Observability/controllability of the continuous wave equation is well understood for the scalar linear constant coefficient case that is the focus of this paper. However, when the wave equation is discretized by finite difference methods, the control for the discretized model does not necessarily yield a good approximation to the control for the original continuous problem. In other words, the classical convergence (consistency + stability) property of a numerical scheme does not suffice to guarantee its suitability for providing good approximations to the controls that might be needed in applications. Observability/controllability may be lost under numerical discretization as the mesh size tends to zero due to the existence of high-frequency spurious solutions for which the group velocity vanishes. This phenomenon is analyzed and several remedies are suggested, including filtering, Tychonoff regularization, multigrid methods, and mixed finite element methods. We also briefly discuss these issues for the heat, beam, and Schrödinger equations to illustrate that diffusive and dispersive effects may help to retain the observability/controllability properties at the discrete level. We conclude with a list of open problems and future subjects for research.
Saving an epsilon: a 2-approximation for the k-MST problem in graphs
Authors: Naveen Garg
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We present a polynomial time 2-approximation algorithm for the problem of finding the minimum tree that spans at least k vertices. Our result also leads to a 2-approximation algorithm for finding the minimum tour that visits k vertices and to a 3-approximation algorithm for the problem of finding the maximum number of vertices that can be spanned by a tree of length at most a given bound.
StressCam: non-contact measurement of users' emotional states through thermal imaging
Authors: Colin Puri, Leslie Olson, Ioannis Pavlidis, James Levine, Justin Starren
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

We present a novel methodology for monitoring the affective states of computer users. The method is based on thermal imaging of the face. To the user, the imaging system appears much like a video-conferencing camera. The method does not require contact with the subject and is passive; therefore, monitoring can be continuous and transparent to the computer user. We have found that user stress is correlated with increased blood flow in the frontal vessel of the forehead. This increased blood flow dissipates convective heat, which can be monitored through thermal imaging. The system has been evaluated on 12 subjects, and compared against real-time measurements of Energy Expenditure (EE). The new method is highly correlated with the established, but awkward EE methodology. The StressCam methodology is applicable to many instances where the real time measurement of users' emotional state is needed.
Programming language concepts and Perl
Authors: Chuck Liang
Venue: Journal of Computing Sciences in Colleges (2004)

Perl is sometimes overlooked in high-level courses in programming languages. Recent versions of Perl come equipped with an array of features that can in fact be helpful in demonstrating programming language principles and design choices. Higher-order, functional style programming is fully supported by Perl. As a language designed for purely practical as opposed to theoretical purposes, it offers a contrast as well as a companion to languages such as Scheme and ML, which are traditionally used in programming language courses.
Selected M-Related Dissertations Bibliography
Authors: Susanne M. Humphrey, Bob Krovetz
Venue: ACM SIGART Bulletin (1990)

The following are citations selected by title and abstract as being related to AI, resulting from a computer search, using DIALOG Information Services, of the Dissertation Abstracts Online database produced by University Microfilms International (UMI). Business Administration, Accounting
DIY-IT: an empirical study of website development staffing by non-profit organizations
Authors: Susan A. Vowels
Venue: Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research (2005)

Scholars have extensively examined the role of information technology workers through the prism of the corporate world, a viewpoint open to bias tending toward constructs that deal exclusively with professional IT workers. The purpose of this study is to investigate a significant area that has been under explored, namely, the use of non-traditional or "do-it-yourself IT" workers, and to explore the possibility that with the advent of more user-friendly and ubiquitous IT productivity tools, the use of non-professional IT staff, or "DIY-IT," is becoming an attractive and viable option, particularly for non-profit organizations and small businesses. This study will examine the impact of web design software products and cost-effective hosting solutions on website development and website maintenance staffing by non-profit arts organizations and by small businesses. A hypothesis is that in the non-profit world, DIY-IT is performed by volunteers and by paid employees who are not primarily IT workers and whose primary job descriptions focuses on broader tasks. In small businesses, it is hypothesized that DIY-IT is performed by staff who are not primarily IT workers. The extent of DIY-IT is of interest, as well as its impact, i.e., are organizations more satisfied with their websites when professional IT personnel are involved, how does the degree of sophistication vary as a function of the type of IT staffing, can the value of professional IT personnel be quantified, and are there circumstances when DIY-IT is more appropriate in fulfilling the needs of the organization? As this research progresses, a goal is to develop a model that can be generally applied to IT staffing by non-profit organizations and small businesses.
Mathematical software patterns
Authors: E. L. Battiste
Venue: ACM SIGNUM Newsletter (1975)

The past and current situation in the production of mathematical software requires that, in order to project the future, one realize the critical elements in such production. These are discussed below, with projections, under the topics Origins, Support, and Requirements.