ppxscal/embedding_network huggingface dataset:
On the projected descent direction methods for solving convex programming problems
Authors: Yixun Shi
Venue: Neural, Parallel Scientific Computations (2003)

A recent paper [14] has considered the possibility of combining interior point strategy with steepest descent method when solving convex programming problems, in such a way that the convergence property of the interior point method remains valid but many iterations do not request the solution of a system of equations. Motivated by this general idea, the paper [14] proposed a hybrid algorithm which combines a primal-dual potential reduction algorithm with the use of the steepest descent direction of the potential function. The O(√n|ln ε|) complexity of the potential reduction algorithm remains valid but the overall computational cost can be reduced. In this paper, we discuss the relation between this method and general projected descent direction methods, and compare it with a projected steepest descent direction method for solving complex programming problems.
Jazzing up Eclipse with collaborative tools
Authors: Li-Te Cheng, Susanne Hupfer, Steven Ross, John Patterson
Venue: Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange (2003)

Collaboration is an integral part of software development, occurring through tools inside and outside the IDE. This paper presents an overview of the Jazz project, which seeks to integrate collaborative capabilities into the Eclipse IDE, enabling small teams of software developers to work together more productively.
An exploratory analysis of information and knowledge management enablers in business contexts
Authors: Karen Nelson, Michael Middleton
Venue: Knowledge management: current issues and challenges (2003)

This chapter explores the factors limiting organizational information and knowledge management (IKM) through the perceptions of IKM practitioners. The authors propose that a number of organisational factors - which for them are enablers - have the ability to influence IKM project outcomes. It follows that explication of these enablers in an integrated framework could, therefore, be beneficial for practitioners. This chapter itemises 10 candidate enablers identified from a review of the literature and explored in previous research work. The authors discuss the findings of two exploratory surveys, which indicated that all ten enablers were perceived as important to the performance of IKM. However, the amount of management attention required by each enabler appears to be IKM project specific.
Fuzzy-logic-based TCP congestion control system
Authors: A. M. Al-Naamany, H. Bourdoucen
Venue: Network control and engineering for Qos, security and mobility II (2003)

The Internet and most current intranet networks are experiencing a huge increase in the volume of traffic. This affects directly the network congestion by saturating the buffers at the routers and contributes to generating lots of data losses as well as reception and transmission delays. The existing TCP end-to-end congestion control uses Additive Increase Multiplicative Decrease (AIMD) approach, a time out and slow start behavior, which lead to data throughput with abrupt changes. Therefore, developing new congestion control strategies based on non-analytical approaches will certainly help to overcome the current difficulties of the internet in particular which are due to network structural complexity, diversity of services supported, and to variety of parameters involved. This work presents a fuzzy logic-based approach for controlling the network congestion. Its main objective is to optimize the available bandwidth and keep smooth the data throughput transfer profile.
The expressive power of higher-order types or, life without CONS
Authors: Neil D. Jones
Venue: Journal of Functional Programming (2001)

Compare first-order functional programs with higher-order programs allowing functions as function parameters. Can the the first program class solve fewer problems than the second? The answer is no: both classes are Turing complete, meaning that they can compute all partial recursive functions. In particular, higher-order values may be first-order simulated by use of the list constructor &lsquo;cons&rsquo; to build function closures. This paper uses complexity theory to prove some expressivity results about small programming languages that are less than Turing complete. Complexity classes of decision problems are used to characterize the expressive power of functional programming language features. An example: second-order programs are more powerful than first-order, since a function f of type &lsqb;Bool&rsqb;-&rang;Bool is computable by a cons-free first-order functional program if and only if f is in PTIME, whereas f is computable by a cons-free second-order program if and only if f is in EXPTIME. Exact characterizations are given for those problems of type &lsqb;Bool&rsqb;-&rang;Bool solvable by programs with several combinations of operations on data: presence or absence of constructors; the order of data values: 0, 1, or higher; and program control structures: general recursion, tail recursion, primitive recursion.
Modular lazy search for Constraint Satisfaction Problems
Authors: Thomas Nordin, Andrew Tolmach
Venue: Journal of Functional Programming (2001)

We describe a unified, lazy, declarative framework for solving constraint satisfaction problems, an important subclass of combinatorial search problems. These problems are both practically significant and computationally hard. Finding solutions involves combining good general-purpose search algorithms with problem-specific heuristics. Conventional imperative algorithms are usually implemented and presented monolithically, which makes them hard to understand and reuse, even though new algorithms often are combinations of simpler ones. Lazy functional languages, such as Haskell, encourage modular structuring of search algorithms by separating the generation and testing of potential solutions into distinct functions communicating through an explicit, lazy intermediate data structure. But only relatively simple search algorithms have been treated this way in the past. Our framework uses a generic generation and pruning algorithm parameterized by a labeling function that annotates search trees with conflict sets. We show that many advanced imperative search algorithms, including conflict-directed backjumping, backmarking, minimal forward checking, and fail-first dynamic variable ordering, can be obtained by suitable instantiation of the labeling function. More importantly, arbitrary combinations of these algorithms can be built by simply composing their labeling functions. Our modular algorithms are as efficient as the monolithic imperative algorithms in the sense that they make the same number of consistency checks, and most of our algorithms are within a constant factor of their imperative counterparts in runtime and space usage. We believe our framework is especially well-suited for experimenting to find good combinations of algorithms for specific problems.
RTMix &ndash; towards a standardised interactive electroacoustic art performance interface
Authors: Ivica Ico Bukvic
Venue: Organised Sound (2002)

The following article offers an analytical overview of the currently available software technologies designed to assist in creation, dissemination, and most importantly performance of interactive electroacoustic art. By grouping the software into two basic groups based on their interfaces, my aim is to provide a comprehensive list of two groups' strengths and shortcomings, therefore exposing common issues that arise whenever a composer utilises such software interfaces in performance settings. Finally, as an incentive in solving a number of given problems, the author will present RTMix, his own software creation that has been designed primarily as a standardised interface for the purpose of easier production, performance and dissemination of the interactive electroacoustic artwork.
Teacher certification: a computer science necessity
Authors: J. L. Poirot, G. G. Early
Venue: ACM SIGCUE Outlook (1975)

The need for computer education for secondary school teachers has become quite apparent over the past few years. Such education has been accomplished, for the most part, by in-service training, summer institutes or graduate programs.This paper recommends undergraduate teacher certification in computer science and gives the steps necessary for approval of a certification program for the state of Texas. In addition, coursework for a certification program is discussed.
Asymptotic analysis of loss probability in a finite queue where one packet occupies as many places as its length
Authors: Bara Kim, Jeongsim Kim, In-Suk Wee, Bong Dae Choi
Venue: Performance Evaluation (2003)

We consider a discrete-time single server queue which models the input buffer of an IP switch/router. The packets arrive according to a batch Bernoulli process and the packet lengths (service times) are independent and identically distributed with a general distribution. We assume that the system has a finite buffer of size K. In contrast to ordinary queues where one packet occupies one place in the buffer, we assume that one packet occupies as many places as its length. We study an asymptotic behavior of the loss probability for this queueing system as the buffer size K tends to infinity, and then use this result to approximate the exact loss probability. Numerical examples show that the approximation is very accurate.
The Market Evolution and Sales Takeoff of Product Innovations
Authors: Rajshree Agarwal, Barry L. Bayus
Venue: Management Science (2002)

In contrast to the prevailing supply-side explanation that price decreases are the key driver of a sales takeoff, we argue that outward shifting supplyand demand curves lead to market takeoff. Our fundamental idea is that sales in new markets are initially low because the first commercialized forms of new innovations are primitive. Then, as new firms enter, actual and perceived product quality improves (and prices possibly drop), which leads to a takeoff in sales. To provide empirical evidence for this explanation, we explore the relationship between takeoff times, price decreases, and firm entry for a sample of consumer and industrial product innovations commercialized in the United States over the past 150 years. Based on a proportional hazards analysis of takeoff times, we find that new firm entry dominates other factors in explaining observed sales takeoff times. We interpret these results as supporting the idea that demand shifts during the early evolution of a new market due to nonprice factors is the key driver of a sales takeoff.
Multi-user performance of Commedia dell' Arte in 3D
Authors: Michael D. Wilson, Todd Holoubek, Ann Poochareon
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

Commedia is a medieval form of highly improvisational theatre from Italy in which archetypal characters like Harlequin the sly trickster, or Columbine the tough smart wench, were combined with satire, acrobatics, and low-ball farce into a style that transformed and shaped the writings of Shakespeare, Moliere, and The Loony Toons.In Gilligan's Island, Gilligan's bumbling servant combined with Skippers overweight bravado, against Professors ungrounded wisdom and Mr. Howells miserly riches all vying for the attentions of innocent Marianne and vivacious Ginger typify the modern retellings of Commedia characters and scenarios. Buggs Bunny is Harlequin drawn to life, while Lara Croft is Columbine in perfect 3D.We believe that bringing improvised Commedia to Multi-User 3D Performance will add to both disciplines. It will expand Commedia to the limits of imagination while it will give Multi-User 3D Performance a set of time tested techniques to explore improvisation.Our purpose is to create an application in Macromedia Director that allows actor-driven 3D characters to be controlled through motion and other media capture devices. Imagine Toy Story where the ending changes every night, while the characters play with the audience, and you begin to get the idea.
Novelty detection: a review&mdash;part 1: statistical approaches
Authors: Markos Markou, Sameer Singh
Venue: Signal Processing (2003)

Novelty detection is the identification of new or unknown data or signal that a machine learning system is not aware of during training. Novelty detection is one of the fundamental requirements of a good classification or identification system since sometimes the test data contains information about objects that were not known at the time of training the model. In this paper we provide state-of-the-art review in the area of novelty detection based on statistical approaches. The second part paper details novelty detection using neural networks. As discussed, there are a multitude of applications where novelty detection is extremely important including signal processing, computer vision, pattern recognition, data mining, and robotics.
A window into the what, why, which, and how of extreme programming
Authors: Beverly B. Carter
Venue:  (2002)

Extreme Programming (XP) is a lightweight or agile software development process that was developed in 1996. It was designed to address the challenges of high speed and high change that characterize today's technology environment. The XP process consists of 12 practices that users believe will allow them to develop high quality software, on time and within budget. Although successful applications of XP have been reported, very little research has been conducted in either the academic or corporate arenas. This project advances research into XP through the use of an Internet protocol that asked key questions regarding why organizations were adopting the XP process, what software development problems individuals and organizations hoped to solve by using XP, which practices were being utilized, and how XP users were measuring success and failure. The answers to these questions were then synthesized into themes and categories that were used to develop a pictorial model that represents five major components of the XP process&mdash;purpose, problems, process, product, and issues that can cause XP projects to fail. The resultant model is a useful tool by which potential users, teams and organizations can obtain a synopsis understanding of the XP software development process and serves as a starting point from which further study can evolve and more elaborate models can be developed.
Investment and Bidding Strategies in Markets for Firm Transmission Rights
Authors: Aleksandr Rudkevich
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

The first part of this paper addresses the applicability of the Markowitz portfolio theory to investing in Contracts for Firm Transmission Right (CFTRs) or Transmission Congestion Contracts (TCCs) typical for electricity markets in Northeastern US (PJM, NY ISO, ISO New England). Special emphasis is placed on the use of the principal component analysis providing for a dramatic reduction in the size of the optimization problem, selecting subsets of statistically independent CFTRs/TCCs and on the mathematical formulation of necessary and sufficient conditions for arbitrage opportunities. The second part of the paper is dedicated to the analysis of profit-maximizing bidding strategies available to large players with significant Auction Revenue Rights (ARRs). The use of the Supply Function Equilibrium technique provides for a closed form solution in the case of two strategic players competing for CFTRs over a major interface.
Building Text Classifiers Using Positive and Unlabeled Examples
Authors: Bing Liu, Yang Dai, Xiaoli Li, Wee Sun Lee, Philip S. Yu
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

This paper studies the problem of building text classifiersusing positive and unlabeled examples. The key feature ofthis problem is that there is no negative example forlearning. Recently, a few techniques for solving thisproblem were proposed in the literature. These techniquesare based on the same idea, which builds a classifier intwo steps. Each existing technique uses a different methodfor each step. In this paper, we first introduce some newmethods for the two steps, and perform a comprehensiveevaluation of all possible combinations of methods of thetwo steps. We then propose a more principled approachto solving the problem based on a biased formulation ofSVM, and show experimentally that it is more accuratethan the existing techniques.
Computational study of the crack extension initiation in a solid propellant plate with a circular hole
Authors: G. Papakaliatakis
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Solid propellants are particulate composite materials, containing hard particles embedded in a rubbery matrix. On the microscopic scale, a highly filled propellant can be considered as nonhomogeneous. When the material is strained, damage in the form of microvoids in the binder or debonding at the matrix/particle interface takes place. As the applied strain in the material is progressively increased the growth of damage takes place as successive nucleation and coalescence of the microvoids or as material tears. These processes of damage initiation and evolution are time-dependent and they are mainly responsible for the time-sensitivity of the nonlinear stress-strain behaviour of solid propellants. Their mechanical response is strongly influenced by the loading rate, temperature and material microstructure.
An Editor for Adaptive XML-Based Policy Management of IPsec
Authors: Raj Mohan, Timothy E. Levin, Cynthia E. Irvine
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

The IPsec protocol provides a mechanism to enforce arange of security services for both confidentiality andintegrity, enabling secure transmission of informationacross networks. Dynamic parameterization of IPsec, viathe KeyNote trust management system, further enablessecurity mechanisms to adjust the level of security service"on-the-fly" to respond to changing network andoperational conditions. However KeyNote requires thatan IPsec policy be defined in the KeyNote specificationsyntax. Defining such a dynamic security policy in theKeyNote Policy Specification language is complicatedand can lead to incorrect specification of the desiredpolicy, thus degrading the security of the network. Wepresent an alternative XML representation of thislanguage and a graphical user interface to create andmanage a consistent and correct security policy. Theinterface has the simplicity of a simple menu-driveneditor that not only provides KeyNote with a policy inthe specified syntax but also integrates techniques tosupport administrative policy verification.
Multimedia software to motivate ethnic minority children to learn about their culture and language of origin
Authors: Dongjie Xu, Isobel Nicholson
Venue: Proceedings of the 2003 conference on Interaction design and children (2003)

The goal of this research is to analyse how multimedia can help ethnic children to understand their culture of origin and to identify the problems encountered in teaching ethnic languages. British born Chinese children were chosen as the group to study, as the researcher is Chinese. This poster describes an exploratory study at a Chinese school in UK. The school serves families from many different Chinese cultures who use different versions of Chinese language. Teaching materials and motivation were also problem areas.
Analyzing stability of equilibrium points in neural networks: a general approach
Authors: Wilson A. Truccolo, Govindan Rangarajan, Yonghong Chen, Mingzhou Ding
Venue: Neural Networks (2003)

Networks of coupled neural systems represent an important class of models in computational neuroscience. In some applications it is required that equilibrium points in these networks remain stable under parameter variations. Here we present a general methodology to yield explicit constraints on the coupling strengths to ensure the stability of the equilibrium point. Two models of coupled excitatory-inhibitory oscillators are used to illustrate the approach.
Information Quality Assessment of a Yellow-Pages Location-Based Service
Authors: Artem Katasonov, Markku Sakkinen
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

The main problems in assessing the information qualityof a particular kind of location-based service are described.Verifying the conformance of query results to the real worldis identified as the most expensive problem. An approachfrom database quality assessment is adapted, by combiningit with conventional software reliability testing, so thatthe verification can be replaced with two significantly easiertest obligations. The resulting procedure should achieve agood compromise between the confidence level of the resultsand the testing effort. The approach seems also applicableto a broader range of systems.
Object-oriented programming training: bottom-up versus top-down approach
Authors: Proadpran Punyabukkana Pitsatorn
Venue:  (2003)

Many believe that after a programmer learns one programming language, additional programming languages are relatively easy to learn. This may have been true before object-oriented technology was introduced. Object-oriented programming requires programmers to make a large cognitive shift from their experiences with structured programming. The language required for object-oriented technology requires not an extension of previous knowledge, but so sharp a change of direction that previous knowledge does not apply. Experienced programmers who attempt to learn their first object-oriented programming language may find that their knowledge and skills with structured programming actually impede learning the new language. Current efforts to retrain structured programmers to use object-oriented languages have not been very successful. This research aims at comparing alternate methods of training experienced structured programmers in object-oriented language. A laboratory experiment comparing a bottom-up approach and a top-down approach was executed. Traditionally, most object-oriented programming courses are taught in a top-down fashion to first introduce the programmers to the concept of object-oriented technology. Later, the language itself is taught and applied and eventually, toward the end of the course, programmers write the programs. An alternate bottom-up, or debugging, approach stems from the concept of learning by doing and learning by example. In this approach, programmers acquire the new language by inspecting existing code and learning how to correct or &ldquo;debug&rdquo; it. Dependent variables observed in this study are performance of the programmers and their attitude toward the teaching approach. Independent variables include two teaching approaches and the level of complexity of the programs. The results of the study did not find a significant difference between the two training approaches. However, as the complexity of the programs increased, the participants from the bottom-up classes tended to perform equally with those from the top-down. Trainees from the bottom-up classes reported higher overall satisfaction than those from the top-down.