ppxscal/embedding_network huggingface dataset:
Bipartite Subgraphs and the Smallest Eigenvalue
Authors: Noga Alon, Benny Sudakov
Venue: Combinatorics, Probability and Computing (2000)

Two results dealing with the relation between the smallest eigenvalue of a graph and its bipartite subgraphs are obtained. The first result is that the smallest eigenvalue &mu; of any non-bipartite graph on n vertices with diameter D and maximum degree &Delta; satisfies &mu; &ge; &minus;&Delta; + 1&#x002F;(D+1)n. This improves previous estimates and is tight up to a constant factor. The second result is the determination of the precise approximation guarantee of the MAX CUT algorithm of Goemans and Williamson for graphs G = (V, E) in which the size of the max cut is at least A&#x2223;E&#x2223;, for all A between 0.845 and 1. This extends a result of Karloff.
Dimensions of reengineering environment infrastructures
Authors: S. Ducasse, S. Tichelaar
Venue: Journal of Software Maintenance: Research and Practice (2003)

Over the last decade many research groups and commercial companies have been developing reengineering environments. However, many design decisions such as support for multiple models, incremental loading of information, tool integration, entity grouping, and their impacts on the underlying meta-model and resulting environment have remained implicit. Based on the experience accumulated while developing the Moose reengineering environment and on a survey of reengineering environments, we present a design space defined by a set of criteria that makes explicit the different options and especially their dependencies and trade-offs. Using this design space, developers of future environments should have a better understanding of the problems they face and the impact of design choices.
Using the web to obtain frequencies for unseen bigrams
Authors: Frank Keller, Mirella Lapata
Venue: Computational Linguistics (2003)

This article shows that the Web can be employed to obtain frequencies for bigrams that are unseen in a given corpus. We describe a method for retrieving counts for adjective-noun, noun-noun, and verb-object bigrams from the Web by querying a search engine. We evaluate this method by demonstrating: (a) a high correlation between Web frequencies and corpus frequencies; (b) a reliable correlation between Web frequencies and plausibility judgments; (c) a reliable correlation between Web frequencies and frequencies recreated using class-based smoothing; (d) a good performance of Web frequencies in a pseudodisambiguation task.
Program Slicing for ATPG-Based Property Checking
Authors: Vivekananda M. Vedula, Whitney J. Townsend, Jacob A. Abraham
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

This paper presents a novel technique for abstracting designsin order to increase the efficiency of formal propertychecking. Bounded Model Checking (BMC), using Satisfiability(SAT) techniques, are beginning to be widely usedfor checking properties of designs. Recent approaches usingsequential ATPG techniques, which harness the structuralinformation of the design, have been shown to performbetter than SAT-based BMC. However, these techniques requirean effective methodology to deal with the size of commercialdesigns. A program slicing methodology that hasbeen shown to accelerate sequential ATPG is adapted andintegrated into an ATPG-based BMC framework. Furthermore,a generalization of the ATPG-based approach, whichchecks for unbounded liveness, is also presented.
Negotiation Paradigms for E-Commerce Agents using Knowledge Beads Methodology
Authors: Zhuang Yan, Simon Fong, Shi Meilin
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

The technology of using computer Agents for B2Btrading in Cyberworld is getting prevalent nowadays.Much of the research work has been done on themodels, architectures and service provision in the past.However, agent negotiation remains as a challenge inmaking the whole trading process fully automated, dueto its fuzzy and complex nature. The lack ofinteroperability and knowledge-reuse that limits tocase-based, pose certain drawback. An object-orientedontology-based Knowledge Bead (KB) method forknowledge representation has been proposed in [1]. Itwas designed as a foundation to enable agentnegotiation in e-trading environment in a systematicway. This paper continues the research work of KB onformulating its theorems and methodology. Sometypical negotiation paradigms using appropriatestrategies based on the KB's methodology arepresented as well. In particular, KB's taxonomies andtheir use in the whole negotiation process arediscussed. The main advantage of this approach is theability to describe the deal that is under negotiation inan object-oriented format which in turn allowsreasoning, optimizing, knowledge reuse andmanagement.
SpeechClipse: an Eclipse speech plug-in
Authors: Shairaj Shaik, Raymond Corvin, Rajesh Sudarsan, Faizan Javed, Qasim Ijaz, Suman Roychoudhury, Jeff Gray, Barrett Bryant
Venue: Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange (2003)

Much has been accomplished through the years to enhance the capabilities of individuals that are physically challenged. The goal of computer-assisted adaptive technology is to support the physically challenged in performing tasks on a computer. In addition, adaptive technologies also provide opportunities to enrich a programmer's environment and to increase productivity. It is within these broad parameters that SpeechClipse was developed in order to demonstrate the feasibility of incorporating speech recognition into a popular integrated development environment (Eclipse). The preliminary work described in this paper suggests that various categories of Eclipse users would benefit from a speech-enabling plug-in that uses the Java Speech API.
RSVP extensions for real-time services in hierarchical mobile IPv6
Authors: Nen-Fu Huang, Whai-En Chen
Venue: Mobile Networks and Applications (2003)

The Mobile IPv6 (MIPv6) provides many great features, such as sufficient addressing space, mobility, and security; MIPv6 is one of the most important protocols for next generation mobile Internet. Simultaneously, with the rapid improvement of wireless technologies, the real-time multi-media IP services such as video on demand, videoconference, interactive games, IP telephony and video IP phone will be delivered in the near future. Thus, to furnish accurate QoS for real-time services is one of the most important thing in the next generation mobile Internet. Although RSVP, which is a resource reservation protocol, processes signaling messages to establish QoS paths between senders and receivers, RSVP was originally designed for stationary networks and not aware of the mobility of MNs. Therefore, this paper proposes a novel RSVP extension to support real-time services in Hierarchical Mobile IPv6 (HMIPv6) environments. For intra-site mobility, the concept of QoS Agent (QA) is proposed to handle the RSVP QoS update messages and provide the advanced reservation models for real-time services. For inter-site mobility, IP multicast can help to invite inter-site QAs to make pre-reservation and minimize the service disruption caused by re-routing the data path during handover. Simulation results show that the proposed scheme over HMIPv6 is more suitable for real-time services than the famous RSVP tunnel-based solution.
A Queue with Semi-Markovian Batch Plus Poisson Arrivals with Application to the MPEG Frame Sequence
Authors: De-An Wu, Hideaki Takagi
Venue: Queueing Systems: Theory and Applications (2003)

We consider a queueing system with a single server having a mixture of a semi-Markov process (SMP) and a Poisson process as the arrival process, where each SMP arrival contains a batch of customers. The service times are exponentially distributed. We derive the distributions of the queue length of both SMP and Poisson customers when the sojourn time distributions of the SMP have rational Laplace&ndash;Stieltjes transforms. We prove that the number of unknown constants contained in the generating function for the queue length distribution equals the number of zeros of the denominator of this generating function in the case where the sojourn times of the SMP follow exponential distributions. The linear independence of the equations generated by those zeros is discussed for the same case with additional assumption. The necessary and sufficient condition for the stability of the system is also analyzed. The distributions of the waiting times of both SMP and Poisson customers are derived. The results are applied to the case in which the SMP arrivals correspond to the exact sequence of Motion Picture Experts Group (MPEG) frames. Poisson arrivals are regarded as interfering traffic. In the numerical examples, the mean and variance of the waiting time of the ATM cells generated from the MPEG frames of real video data are evaluated.
The retention of women in information technology: a South African perspective
Authors: Nata van der Merwe, Adrie Stander
Venue: Managing globally with information technology (2003)

The retention of women in Information Technology (IT) is a global problem. This chapter reflects on the results of a comprehensive study of women in the South African IT Industry. Areas covered are demographics, experience and qualifications, the work environment, discrimination, gender issues, technical abilities, mentors and other issues related to women in the IT industry. Factors affecting the retention of women in the South African IT Industry are identified, and popular beliefs with regard to the preferences of female IT employees are examined. The authors believe that the findings reported on in this chapter can provide valuable insights that can be used by companies world-wide to enhance employment policies as well as recruitment and retention strategies aimed at women in IT.
de Bruijn notation as a nested datatype
Authors: Richard S. Bird, Ross Paterson
Venue: Journal of Functional Programming (1999)

&ldquo;I have no data yet. It is a capital mistake to theorise before one has data.&rdquo; Sir Arthur Conan Doyle The Adventures of Sherlock Holmesde Bruijn notation is a coding of lambda terms in which each occurrence of a bound variable x is replaced by a natural number, indicating the &lsquo;distance&rsquo; from the occurrence to the abstraction that introduced x. One might suppose that in any datatype for representing de Bruijn terms, the distance restriction on numbers would have to be maintained as an explicit datatype invariant. However, by using a nested (or non-regular) datatype, we can define a representation in which all terms are well-formed, so that the invariant is enforced automatically by the type system. Programming with nested types is only a little more difficult than programming with regular types, provided we stick to well-established structuring techniques. These involve expressing inductively defined functions in terms of an appropriate fold function for the type, and using fusion laws to establish their properties. In particular, the definition of lambda abstraction and beta reduction is particularly simple, and the proof of their associated properties is entirely mechanical.
Personalization of user profiles for content-based music retrieval based on relevance feedback
Authors: Keiichiro Hoashi, Kazunori Matsumoto, Naomi Inoue
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Numerous efforts on content-based music information retrieval have been presented in recent years. However, the object of such existing research is to retrieve a specific song from a large music database. In this research, we propose a music retrieval method which retrieves songs based on the user's musical preferences. This enables users to discover new songs which they are expected to like. Since music preferences are expected to be highly ambiguous, we propose the implementation of relevance feedback methods to improve the performance of our music information retrieval method. In order to reduce the burden of users to input learning data to the system, we also propose a method to generate user profiles based on genre preferences, and refinement of such profiles based on relevance feedback. Evaluation experiments are conducted based on a corpus of music data with user ratings. Results of these experiments prove the effectiveness of our method.
Power-saving protocols for IEEE 802.11-based multi-hop ad hoc networks
Authors: Yu-Chee Tseng, Chih-Shun Hsu, Ten-Yueng Hsieh
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

Power-saving is a critical issue for almost all kinds of portable devices. In this paper, we consider the design of powersaving protocols for mobile ad hoc networks (MANETs) that allow mobile hosts to switch to a low-power sleep mode. The MANETs being considered in this paper are characterized by unpredictable mobility, multi-hop communication, and no clock synchronization mechanism. In particular, the last characteristic would complicate the problem since a host has to predict when another host will wake up to receive packets. We propose three power management protocols, namely dominating-awake-interval, periodically-fully-awake-interval, and quorum-based protocols, which are directly applicable to IEEE 802.11-based MANETs. As far as we know, the power management problem for multihop MANETs has not been seriously addressed in the literature. Existing standards, such as IEEE 802.11, HIPERLAN, and bluetooth, all assume that the network is fully connected or there is a clock synchronization mechanism. Extensive simulation results are presented to verify the effectiveness of the proposed protocols.
Weak instability in stochastic and fluid queueing networks
Authors: David Gamarnik, John Hasenbein
Venue: ACM SIGMETRICS Performance Evaluation Review (2003)

The fluid model has proven to be one of the most effective tools for the analysis of stochastic queueing networks, specifically for the analysis of stability. It is known that stability of a fluid model implies positive (Harris) recurrence (stability) of a corresponding stochastic queueing network, and weak stability implies rate stability of a corresponding stochastic network. These results have been established both for cases of specific scheduling policies and for the class of all work conserving policies.However, only partial converse results have been established and in certain cases converse statements do not hold. In this paper we close one of the existing gaps. For the case of networks with two stations we prove that if the fluid model is not weakly stable under the class of all work conserving policies, then any corresponding queueing network is not rate stable under the class of all work conserving policies. We establish the result by building a particular work conserving scheduling policy which makes any corresponding stochastic process transient. An important corollary of our result is that the condition of the form &rho;* < 1, which was proven in [7) to be the exact condition for global weak stability of the fluid model, is also the exact global rate stability condition for any corresponding queueing network. Here &rho;* is a certain computable parameter of the network involving virtual station and push start conditions.
A statistical analysis of student performance in online computer science courses
Authors: Merry McDonald, Brian Dorn, Gary McDonald
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

During the past few years the number of courses offered online has greatly increased as technology has made delivery of such courses feasible. This paper discusses the experiences of the authors in teaching online courses for upper-division computer science students and reports results of a study comparing success of students in online courses to students in traditional courses.
An intelligent 3D user interface adapting to user control behaviors
Authors: Tsai-Yen Li, Shu-Wei Hsu
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

The WALK mode is one of the most common navigation interfaces for 3D virtual environments. However, due to the limited view angle and low frame rate, users are often blocked by obstacles when they navigate in a cluttered virtual scene with such a mode. Intelligent 3D navigation interfaces with assisting mechanisms, such as motion planning methods or virtual force fields, have been proposed in the literature to improve navigation efficiency. Nevertheless, the applicability of these methods is subject to individual discrepancy, and the control parameters of these methods are usually determined by empirical means. In this paper, we propose an intelligent navigation interface with a personalizable assisting mechanism. We have designed two methods, simulation experiment and dynamic adjustment, to find the best control parameters for composing artificial forces for an individual in an off-line and on-line manner, respectively. The simulation experiment method searches for the optimal control parameters for a user in a systematic manner while the dynamic adjustment method makes the assisting mechanism adaptive to user control behaviors as well as environmental variations in real time. Our experiments show that both methods can further improve the navigation efficiency for a wider range of users.
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
Authors: Benjamin W. Wah, Yixin Chen
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subproblems, and propose algorithms for resolving unsatisfied global constraints. The algorithms are based on the necessary and sufficient extended saddle-point condition for constrained local minimization developed in this paper. When compared with the MIPS planner in solving some PDDL2.1 planning problems, our distributed implementation of MIPSshows significant improvements in time and quality.
Statistics on query expressions in relational database management systems
Authors: Luis Gravano
Venue:  (2003)

The query optimizer is the component in a relational database system that identifies efficient execution plans for input queries. Modern optimizers generally explore many alternative query plans in a cost-based manner. Specifically, the resource consumption and associated cost of each candidate plan is estimated, and the plan with the least expected cost is chosen for execution. The cost estimation for a plan depends on several factors, including resource availability during execution, the specific operators that compose the plan, and the size of intermediate results that would be generated during the plan execution. Among these factors, the intermediate-result size (or cardinality) estimation is the main source of inaccuracies during optimization: cardinality estimation typically relies on several simplifying assumptions that often do not hold in practice. Optimizers then sometimes base their decisions on inaccurate information and produce low-quality execution plans. To address this limitation, in this thesis we introduce the concept of SITS, which are statistics built on query expressions. SITS directly and accurately model intermediate results in a query execution plan, and therefore avoid error-prone simplifying assumptions during cardinality estimation. If optimizers have appropriate SITS available during optimization, the resulting query plans can be dramatically better than otherwise. Although SITs are a fairly simple concept, challenging problems need to be addressed before SITs can be seamlessly integrated into modern relational database systems. In this thesis we study three important challenges associated with SITS. First, we show how to modify query optimizers to exploit the additional statistical information provided by SITs without significantly increasing optimization time. Second, we study a spectrum of alternatives to create SITs, which balance efficiency of construction and accuracy of the resulting estimators. Third, we present techniques to recommend a small but highly beneficial set of SITs to materialize in a database system for a given query workload. In summary, we address the main obstacles for enabling SITs for optimization, namely which SITs to build, how to build them, and how to exploit them during optimization. Overall, SITs constitute a well-founded approach for dealing with complex data correlations, and positively impact the efficiency of relational database systems.
A media computation course for non-majors
Authors: Mark Guzdial
Venue: ACM SIGCSE Bulletin (2003)

Computing may well become considered an essential part of a liberal education, but introductory programming courses will not look like the way that they do today. Current CSI course are failing dramatically. We are developing a new course, to be taught starting in Spring 2003, which uses computation for communication as a guiding principle. Students learn to program by writing Python programs for manipulating sound, images, and movies. This paper describes the course development and the tools developed for the course. The talk will include the first round of assessment results.
The constituents of business interaction: generic layered patterns
Authors: Mikael Lind, Göran Goldkuhl
Venue: Data Knowledge Engineering (2003)

In order to perform business modelling as apart of information systems development, there is a need for frameworks and methods. The paper proposes a framework for business interaction based on a language/ action perspective. The framework is an architecture of five generic layers. The first layer concept is 'business act', which functions as the basic unit of analysis. The following four layer concepts are 'action pair', 'exchange', 'business transaction', and 'transaction group'. The framework is inspired by a similar framework constructed by Weigand et al. The paper makes a critical examination of this framework as a basis for the proposed framework.
Questioning lawful access to traffic data
Authors: Alberto Escudero-Pascual, Ian Hosein
Venue: Communications of the ACM (2004)

The path to technology-neutral policy is fraught with danger as more legislation is updated to deal with new communications infrastructures.
Incremental Penetration Depth Estimation between Convex Polytopes Using Dual-Space Expansion
Authors: Young J. Kim, Ming C. Lin, Dinesh Manocha
Venue: IEEE Transactions on Visualization and Computer Graphics (2004)

Abstract--We present a fast algorithm to estimate the penetration depth between convex polytopes in 3D. The algorithm incrementally seeks a "locally optimal solution¿ by walking on the surface of the Minkowski sums. The surface of the Minkowski sums is computed implicitly by constructing a local dual mapping on the Gauss map. We also present three heuristic techniques that are used to estimate the initial features used by the walking algorithm. We have implemented the algorithm and compared its performance with earlier approaches. In our experiments, the algorithm is able to estimate the penetration depth in about a milli-second on an 1 GHz Pentium PC. Moreover, its performance is almost independent of model complexity in environments with high coherence between successive instances.