ppxscal/embedding_network huggingface dataset:
Xinerama extension to the X window system
Authors: Irene McCartney
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

The Xinerama extension is one of the newest extensions to the X Window System. Xinerama allows a system configured with multiple graphics devices to configure all of the physical screen into a single logical screen. This extensions allows windows to be moved from screen to screen or even to span screens. Xinerama is implemented at the device independent layer of the X server. This means that no work is required to support the extension on a new graphics device. The extension supports any homogeneous graphics configuration. Any number of screens (up to the maximum that the server supports) can be combined as long as they support similar visual classes, resolution and depths. This paper will discuss the implementation details of the Xinerama extension. It will also look at some of the restrictions involved with this extension.
Constructive Membership Predicates as Index Types
Authors: James Caldwell, Josef Pohl
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

In the constructive setting, membership predicates over recursive types are inhabited by terms indexing the elements that satisfy the criteria for membership. In this paper, we motivate and explore this idea in the concrete setting of lists and trees. We show that the inhabitants of membership predicates are precisely the inhabitants of a generic shape type. We show that membership of x (of type T) in structure S, (x@?"TS) can not, in general, index all parts of a structure S and we generalize to a form @r@?S where @r is a predicate over S. Under this scheme, (@lx.True)@?S is the set of all indexes into S, but we show that not all subsets of indexes are expressible by strictly local predicates. Accordingly, we extend our membership predicates to predicates that retain state ''from above'' as well as allow ''looking below''. Predicates of this form are complete in the sense that they can express every subset of indexes in S. These ideas are motivated by experience programming in Nuprl's constructive type theory and examining the constructive content of mechanically checked formal proofs involving membership predicates.
A New Pseudo-Boolean Satisfiability based approach to Power Mode Schedulability Analysis
Authors: Sayak Ray, Pallab Dasgupta, P. P. Chakrabarti
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

It is important to know for a collection of tasks running in hand-held devices, if there is any way to schedule power modes to them which will maintain every temporal and power constraints. The peak power that the battery in the system can deliver at any moment plays crucial role in deciding schedulability. We propose a pseudo-boolean satisfiability (PB-SAT) based approach for solving this schedulability problem of power modes for a collection of tasks. We show that in majority of useful cases, the problem can be encoded using linear constraints only and thus becomes an instance of PB-SAT problem. We also show how we can find out a mode allocation using PB-SAT approach that ensures minimum power consumption, but never viloates any temporal constraint. We also propose a binary search based approach with PB-SAT as its core, how we can find out the bare minimum value of the battery peak power that will allow a power mode allocation to the tasks without violating its temporal constraints. Results show that the approach gives acceptable results in many cases.
TCP meets mobile code
Authors: Parveen Patel, David Wetherall, Jay Lepreau, Andrew Whitaker
Venue: Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9 (2003)

This paper argues that transport protocols such as TCP provide a rare domain in which protocol extensibility by untrusted parties is both valuable and practical. TCP continues to be refined despite more than two decades of progress, and the difficulties due to deployment delays and backwards-compatibility are well-known. Remote extensibility, by which a host can ship the transport protocol code and dynamically load it on another node in the network on a per-connection basis, directly tackles both of these problems. At the same time, the unicast transport protocol domain is much narrower than other domains that use mobile code, such as active networking, which helps to make extensibility feasible. The transport level provides a well understood notion of global safety--TCP friendliness--while local safety can be guaranteed by isolation of per-protocol state and use of recent safe-language technologies. We support these arguments by outlining the design of XTCP, our extensible TCP framework.
Mining Pareto-optimal rules with respect to support and confirmation or support and anti-support
Authors: Izabela Brzezinska, Salvatore Greco, Roman Slowinski
Venue: Engineering Applications of Artificial Intelligence (2007)

In knowledge discovery and data mining many measures of interestingness have been proposed in order to measure the relevance and utility of the discovered patterns. Among these measures, an important role is played by Bayesian confirmation measures, which express in what degree a premise confirms a conclusion. In this paper, we are considering knowledge patterns in a form of ''if..., then...'' rules with a fixed conclusion. We investigate a monotone link between Bayesian confirmation measures, and classic dimensions being rule support and confidence. In particular, we formulate and prove conditions for monotone dependence of two confirmation measures enjoying some desirable properties on rule support and confidence. As the confidence measure is unable to identify and eliminate non-interesting rules, for which a premise does not confirm a conclusion, we propose to substitute the confidence for one of the considered confirmation measures in mining the Pareto-optimal rules. We also provide general conclusions for the monotone link between any confirmation measure enjoying the desirable properties and rule support and confidence. Finally, we propose to mine rules maximizing rule support and minimizing rule anti-support, which is the number of examples, which satisfy the premise of the rule but not its conclusion (called counter-examples of the considered rule). We prove that in this way we are able to mine all the rules maximizing any confirmation measure enjoying the desirable properties. We also prove that this Pareto-optimal set includes all the rules from the previously considered Pareto-optimal borders.
On the relation between multi-instance learning and semi-supervised learning
Authors: Zhi-Hua Zhou, Jun-Ming Xu
Venue: Proceedings of the 24th international conference on Machine learning (2007)

Multi-instance learning and semi-supervised learning are different branches of machine learning. The former attempts to learn from a training set consists of labeled bags each containing many unlabeled instances; the latter tries to exploit abundant unlabeled instances when learning with a small number of labeled examples. In this paper, we establish a bridge between these two branches by showing that multi-instance learning can be viewed as a special case of semi-supervised learning. Based on this recognition, we propose the MissSVM algorithm which addresses multi-instance learning using a special semi-supervised support vector machine. Experiments show that solving multi-instance problems from the view of semi-supervised learning is feasible, and the MissSVM algorithm is competitive with state-of-the-art multi-instance learning algorithms.
Software Project Risk in the Public Sector
Authors: Paul L. Bannerman
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

Controlling risk in software projects is a major contributor to successful outcomes, in both the private and public sectors. Few studies investigate risk management in the public sector. This paper reports a study of risk practices in government agencies in an Australian State. It finds that risk management practices lag behind project management practices and that there is scope for improvement in both. Ten major risk factors are identified. Also, some conventional conceptions of project and risk management are challenged. The paper concludes by discussing implications of the findings for research and practice in the public sector.
Analysis and Synthesis of Pseudo-Periodic Job Arrivals in Grids: A Matching Pursuit Approach
Authors: Hui Li, Richard Heusdens, Michael Muskulus, Lex Wolters
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Pseudo-periodicity is one of the basic job arrival patterns on data-intensive clusters and Grids. In this paper, a signal decomposition methodology called matching pursuit is applied for analysis and synthesis of pseudoperiodic job arrival processes. The matching pursuit decomposition is well localized both in time and frequency, and it is naturally suited for analyzing non-stationary as well as stationary signals. The stationarity of the processes can be quantitatively measured by permutation en- tropy, with which the relationship between stationarity and modeling complexity is excellently explained. Quantitative methods based on the power spectrum are also provided to measure the degree of periodicity present in the data. Matching pursuit is further shown to be able to extract patterns from signals, which is an attractive feature from a modeling perspective. Real world workload data from production clusters and Grids are used to empirically evaluate the proposed measures and methodologies.
Channel optimized predictive VQ
Authors: J. Linden
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

Combined source-channel coding is considered for the case of predictive vector quantization. A design algorithm for channel optimized predictive vector quantizers is proposed. Under reasonable assumptions, the optimal encoder is presented and a sample iterative design method that simultaneously optimizes the predictor and the codebook is derived. We also demonstrate that this design method can be used to obtain index assignments that are advantageous to what is obtained by post process index assignment algorithms. Results are presented for a correlated Gauss-Markov process and for speech LSF parameters. 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
TclJava: toward portable extensions
Authors: Scott Stanton, Ken Corey
Venue: Proceedings of the 4th conference on USENIX Tcl/Tk Workshop, 1996 - Volume 4 (1996)

This paper discusses an extension to Tcl that allows the programmer to define Tcl commands in Java code, evaluate Tcl scripts and use the Tk graphical user interface from Java. This might be used to recode performance critical parts of Tcl scripts, provide user configuration of an application for Java, or offer other capabilities. The source code is available, see the 'Sources' section at the end.
The Next Stage of Operational Business Intelligence: Creating New Challenges for Business Process Management
Authors: Olivera Marjanovic
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Current practices in the area of Business Intelligence (BI) and Business Performance Management (BPerM) confirm the need for better integration of BI and Business Processes (BPs). This is especially the case with operational BI that aims to unify strategic and tactical decision making, by integrating BI solutions with organisation's constantly evolving BPs. However, operational BI has a very limited view of BP and Business Process Management (BProM) systems. In essence, it focuses on a limited number of core, transactional BPs that are, by definition, highly structured and repetitive. This paper argues that in order to support customer-facing employees in service-oriented industries, it is necessary to consider knowledge intensive BPs and their possible integration with operational BI. This paper offers a critical analysis of case-handling BPs in the context of operational BI. It then identifies a number of research challenges related to a new type of case-handling BProM system.
Neo-symbiosis: A Conceptual Tool for System Design
Authors: Doug Griffith
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In 1960 Licklider advanced the notion of symbiosis between humans and computers that would think as no human brain has ever thought. This paper updates Licklider's vision of symbiosis and recasts it into current theories of cognition. This updated version of Licklider's vision is termed neo-symbiosis. Kahneman's notion of two processing systems provides a useful theoretical framework for capturing both expertise and information processing biases. System 1, termed Intuition, is fast and effortless. It is simultaneously the source of much human expertise, while also being the locus of cognitive and perceptual illusions. System 2, termed Reasoning, is the locus of rational thought. It also has the task of monitoring System 1 output. Computers need to support System 2 processing. A neo-symbiotic design philosophy is presented followed by an illustrative example. Evaluative metrics are discussed. It is concluded that even absent evaluation metrics, neo-symbiosis provides a desirable design goal.
A review of different object recognition methods for the application in driver assistance systems
Authors: Andreas Laika, Walter Stechele
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

Algorithms in the field of driver assistance have been limited by their requirement for real time in the initial phase of their development. However, as computing power is increasing steadily, new possibilities arise. With focus on this situation a review is presented not defined by its designated field of application in driver assistance systems, but rather by the methods in use, namely video-based object recognition using machine learning. Recent methods are compared in a highly summarized table using criteria such as recognition rate, computational requirements or number of training samples required. Concluding their potential use in driver assistance is discussed.
Linear constraints in hot clutter cancellation
Authors: L. J. Griffiths
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper addresses the use of adaptive array signal processing in airborne radar systems to remove terrain-scattered interference, or hot clutter. Mitigation of terrain scattered interference in airborne radar systems involves cancellation of reflections from a multiplicity of ground reflector locations each having potentially different directions of arrival, time delay, and Doppler. This paper presents a specific methodology for the use of a space-time adaptive processor in which successive time samples from each sensor output are combined adaptively. Multiple constraints are employed to ensure that the desired signal characteristics are maintained. The approach presented achieves effective elimination of hot clutter while simultaneously either maximizing the signal-to-noise ratio of the desired signal or to providing a distortionless time estimate of the signal. Examples are presented using recorded data from the Mountaintop Program to illustrate the effectiveness of the proposed approach and to show comparisons with previous approaches.
Pedagogical and organizational components and issues of externally sponsored senior design teams
Authors: D. Moore
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The Electrical and Computer Engineering Department at Rose-Hulman Institute of Technology requires all graduates to complete a year long (3 quarter) design project sequence. The sequence was first offered in the 1997-1998 academic year. The project series involves student teams working on externally sponsored design projects. The paper presents a discussion of the organization of the sequence specifically from the academic and pedagogical standpoint-team formation, team and individual performance assessment, design reviews, and written and oral communication assessment. The peer evaluation and assessment process, the project application procedure and the related forms are presented and discussed. Additionally, scheduling and human resource (faculty and staff) issues are discussed. A summary of the results from the three academic year offerings and proposed changes is included.
SPECT image reconstruction using compound models
Authors: A. Lopez
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

SPECT (single photon emission computed tomography) is used in nuclear medicine to determine the distribution of a radioactive isotope within a patient from tomographic views or projection data. These images are severely degraded due to the presence of noise and several physical factors like attenuation and scattering. We use, within the Bayesian framework, a compound Gauss Markov random field (CGMRF) as prior model to reconstruct such images. In order to find the maximum a posteriori (MAP) estimate we propose a new iterative method, which is stochastic for the line process and deterministic for the reconstruction. The proposed method is tested and compared with other reconstruction methods on both synthetic and real SPECT images.
A new on-line testing and remediation strategy for engineering mathematics
Authors: M. Sami Fadali
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

It is well documented that there is currently an unsatisfied need in industry for more qualified engineers, and a disturbing decline in college students opting for technical degrees. Part of the problem is the high attrition rate among engineering majors, which can be attributed in large part to problems with mathematics. In addition, the Accreditation Board on Engineering and Technology (ABET) has adopted a new set of criteria for evaluating engineering programs, which is outcome-based rather than course-based. The ABET 2000 criteria require that the institution formulate educational objectives, then assess their educational strategies. We are currently developing a strategy using Web-based mathematics examinations, tutoring and advising to help improve retention of engineering students and to address ABET's outcomes-based assessment. This paper describes the software used in our on-line testing and the exam questions we designed based on electrical engineering applications.
Compositional Security for Task-PIOAs
Authors: Ran Canetti, Ling Cheung, Dilsun Kaynar, Nancy Lynch, Olivier Pereira
Venue: Proceedings of the 20th IEEE Computer Security Foundations Symposium (2007)

Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-based scheduling mechanism is less powerful than the traditional perfect-information scheduler. Moreover, one can speak of two types of complexity restrictions: time bounds on description of task-PIOAs and time bounds on length of schedules. This distinction, along with the flexibility of nondeterministic specifications, are interesting departures from existing formal frameworks for computational security. The current paper presents a new approximate implementation relation for task-PIOAs. This relation is transitive and is preserved under hiding of external actions. Also, it is shown to be preserved under concurrent composition, with any polynomial number of substitutions. Building upon this foundation, we present the notion of structures, which classifies communications into two categories: those with a distinguisher environment and those with an adversary. We then formulate secure emulation in the spirit of traditional simulation-based security, and a composition theorem follows as a corollary of the composition theorem for the new approximate implementation relation.
RaceGuard: kernel protection from temporary file race vulnerabilities
Authors: Crispin Cowan, Steve Beattie, Chris Wright, Greg Kroah-Hartman
Venue: Proceedings of the 10th conference on USENIX Security Symposium - Volume 10 (2001)

Temporary file race vulnerabilities occur when privileged programs attempt to create temporary files in an unsafe manner. "Unsafe" means "non-atomic with respect to an attacker's activities." There is no portable standard for safely (atomically) creating temporary files, and many operating systems have no safe temporary file creation at all. As a result, many programs continue to use unsafe means to create temporary files, resulting in widespread vulnerabilities. This paper presents Race-Guard: a kernel enhancement that detects attempts to exploit temporary file race vulnerabilities, and does so with sufficient speed and precision that the attack can be halted before it takes effect. RaceGuard has been implemented, tested, and measured. We show that RaceGuard is effective at stopping temporary file race attacks, preserves compatibility (no legitimate software is broken), and preserves performance (overhead is minimal).
Note: An update on primitive ternary complementary pairs
Authors: R. Craigen, Will Gibson, C. Koukouvinos
Venue: Journal of Combinatorial Theory Series A (2007)

In two recent papers we overhauled the theory of ternary complementary pairs, focusing on questions relating to the possible weights of pairs, and special pairs from which all others can be derived, which we call ''primitive.'' Of particular interest at this time is a new refinement of the concept of primitivity, which necessitates some revisions to our tables. In this article we report on the state of the art with respect to primitive pairs and elaborate on some conjectures in light of new data. 30 new primitive pairs are given; the status of 12 previously ''primitive'' pairs is changed to ''imprimitive.''
Guided time warping for motion editing
Authors: Eugene Hsu, Marco da Silva, Jovan Popović
Venue: Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation (2007)

Time warping allows users to modify timing without affecting poses. It has many applications in animation systems for motion editing, such as refining motions to meet new timing constraints or modifying the acting of animated characters. However, time warping typically requires many manual adjustments to achieve the desired results. We present a technique which simplifies this process by allowing time warps to be guided by a provided reference motion. Given few timing constraints, it computes a warp that both satisfies these constraints and maximizes local timing similarities to the reference. The algorithm is fast enough to incorporate into standard animation workflows. We apply the technique to two common tasks: preserving the natural timing of motions under new time constraints and modifying the timing of motions for stylistic effects.