ppxscal/embedding_network huggingface dataset:
Design and enhanced evaluation of a robust anaphor resolution algorithm
Authors: Roland Stuckardt
Venue: Computational Linguistics (2001)

Syntactic coindexing restrictions are by now known to be of central importance to practical anaphor resolution approaches. Since, in particular due to structural ambiguity, the assumption of the availability of a unique syntactic reading proves to be unrealistic, robust anaphor resolution relies on techniques to overcome this deficiency.This paper describes the ROSANA approach, which generalizes the verification of coindexing restrictions in order to make it applicable to the deficient syntactic descriptions that are provided by a robust state-of-the-art parser. By a formal evaluation on two corpora that differ with respect to text genre and domain, it is shown that ROSANA achieves high-quality robust coreference resolution. Moreover, by an in-depth analysis, it is proven that the robust implementation of syntactic disjoint reference is nearly optimal. The study reveals that, compared with approaches that rely on shallow preprocessing, the largely nonheuristic disjoint reference algorithmization opens up the possibility for a slight improvement. Furthermore, it is shown that more significant gains are to be expected elsewhere, particularly from a text-genre-specific choice of preference strategies.The performance study of the ROSANA system crucially rests on an enhanced evaluation methodology for coreference resolution systems, the development of which constitutes the second major contribution of the paper. As a supplement to the model-theoretic scoring scheme that was developed for the Message Understanding Conference (MUC) evaluations, additional evaluation measures are defined that, on one hand, support the developer of anaphor resolution systems, and, on the other hand, shed light on application aspects of pronoun interpretation.
PLATO: a new piecewise linear simulation tool
Authors: M. T. van Stiphout, J. T. J. van Eijndhoven, H. W. Buurman
Venue: Proceedings of the conference on European design automation (1990)

This paper describes the basic concepts of a new piecewise linear circuit simulation program called PLATO. Piecewise linear modeling is a very generic and powerful approach to the modeling of electronic components. It allows for the use of macro modeling and mixed-level simulation because all components are modeled in a uniform way. Models are stored in a compact matrix notation. Default models can easily be redefined or modified without affecting the program code but simply by editing the component library. Powerful algorithms are available for solving the piecewise linear equations, yielding global instead of local convergence, this way eliminating convergence problems occurring in more conventional simulators. Latency behavior is utilized by the application of multirate integration techniques together with efficient sparse matrix methods. Results show that computational effort is mainly restricted to active circuit parts.
The dark side of the Web: an open proxy's view
Authors: Vivek S. Pai, Limin Wang, KyoungSoo Park, Ruoming Pang, Larry Peterson
Venue: ACM SIGCOMM Computer Communication Review (2004)

With the advent of large-scale, wide-area networking testbeds, researchers can deploy long-running services that interact with other resources on the Web. While such interaction can easily attract clients and traffic, our experience suggests that projects accepting outside input and interacting with outside resources must carefully consider the avenues for abuse of such services. The CoDeeN Content Distribution Network, deployed on PlanetLab, uses a network of caching Web proxy servers to intelligently distribute and cache requests from a potentially large client population. Due to CoDeeN's non-commerical nature, content is not pushed/advertised by content providers, but instead is pulled by clients who have configured their browsers to use CoDeeN.In effect, CoDeeN is one of the largest "open" proxy networks in the world, and therefore draws unwanted attention from malicious users. This paper discusses our experiences with undersirable traffic on CoDeeN, the mechanisms we developed to curtail it, and the future directions for such work. We believe that this work provides a safe alternative to open proxies and will encourage others to deploy similar systems. Some of the security mechanisms we are developing are suitable for ISPs to deploy on their own networks to detect misbehaving customers before problems arise. Finally, other research projects that allow "open" access to Web resources may face similar situations, and may be able to adopt similar mechanisms.
MuSA.RT: music on the spiral array. real-time
Authors: Elaine Chew, Alexandre R.J. Francois
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

We present MuSA.RT, Opus 1, a multimodal interactive system for music analysis and visualization using the Spiral Array model. Real-time MIDI input from a live performance is processed, analyzed and mapped to the 3D model, revealing tonal structures such as pitches, chords and keys. A user can concurrently navigate through the Spiral Array space using a gamepad or set the camera control to automatic pilot. The interaction among and concurrent processing of the different data streams is made possible through the Modular Flow Scheduling Middleware.
Distributed information discovery challenges
Authors: Nigel Hinds
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

Advances in computer and network technology have fueled the proliferation of distributed data and applications. From on-line information to distributed databases, data systems place vast amounts of information at the disposal of Internet users. As archives grow, users increasingly face the problem of sifting through gigabytes of data to find useful information.We focus on the most basic and one of the larger types of data systems on the Internet, file and document systems. While distributed file systems like NFS [4] and AFS [11] make accessing remote files easier, these systems do not help the user discover, or find, new information. Most of this recent file systems work has focused on integrating heterogeneous, hierarchical, file systems. In fact it can be argued that they make the discovery process more difficult by overwhelming the user with data sources.In this paper we discuss information discovery concepts, survey some of the recent research, and explore name space browsing and information discovery issues.
Queue delay estimation and its application to TCP Vegas
Authors: Kyungsup Kim, Chong-Ho Choi
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

This paper proposes a modified Vegas algorithm, which can be adjusted to take a fair share of the bandwidth compared to other transmission control protocols (TCPs). In order to do this, we investigate the maximum round-trip time (RTT) achievable in steady-state flows fully utilizing available link capacities without marking packets. With this, the marking queue delay is defined. We also propose an estimation algorithm for the marking queue delay in TCP data traffic by using the Kalman filter. The modified Vegas algorithm supplements the shortcomings of Vegas such as unfairness due to over- or under-estimations of the round-trip propagation delay.This study analyzes the model of the marking probability in active queue management like random early detection in terms of RTT. This algorithm gives a robust estimate of the marking queue delay, and the Vegas algorithm in the congestion avoidance phase is modified using this estimation. The simulation results validate the advantages of the proposed algorithm in terms of performance and fairness.
Internet Diffusion in India and China -- Comparison Based on Feedback Loop Dominance
Authors: Amitava Dutta, Rahul Roy
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

Many developing countries have recognized the need to enhance their Internet infrastructure to participate competitively in the global economy. However, these countries have distinctive socioeconomic characteristics that impact the assimilation of any new technology, including the Internet. Their interactions are complex, making it difficult to deduce the underlying mechanics informally. This, in turn, makes it hard to assess the impact of efforts to stimulateInternet diffusion. To get more formally grounded insights, this paper compares the mechanics of Internet diffusion in two developing countries -- India and China -- using the system dynamics methodology. The results show a basic similarity in the underlying mechanics, in that the behavior of major feedback loops is similar in the two cases. Specifically, infrastructure capacity shortage and absorption of the technology in different industry sectors drive two counteracting diffusion mechanisms in both countries. However, it also appears that policy actions can impact the timing and duration of dominant behavior. Based on this comparison, we surmise that developing countries, despite the different specific circumstances, do share some common mechanics for Internet diffusion. Moreover, policy actions need to be designed to stimulate sectoral absorption of the technology in parallel with expansion of the physical network infrastructure.
A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems
Authors: Michele Benzi, Miroslav Tuma
Venue: SIAM Journal on Scientific Computing (2003)

This paper describes a technique for constructing robust preconditioners for the CGLS method applied to the solution of large and sparse least squares problems. The algorithm computes an incomplete LDLT factorization of the normal equations matrix without the need to form the normal matrix itself. The preconditioner is reliable (pivot breakdowns cannot occur) and has low intermediate storage requirements. Numerical experiments illustrating the performance of the preconditioner are presented. A comparison with incomplete QR preconditioners is also included.
COOPDRAW: a multiagent architecture for a shared graphical editor
Authors: Christophe Ramstein
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

COOPDRAW is a synchronous shared graphical editor developed in a COOP environment [1]. The COOPDRAW editor's originality and attractiveness stem from the multiagent concept which, besides the extensive modularity and compatibility with distributed applications, enables CSCW (Computer Supported Cooperative Work) needs such as information sharing, view multiplicity and view distribution to be processed naturally.This paper briefly presents the problems involved in the software architecture of synchronous groupware and the COOP environment and goes on to describe the development of COOPDRAW.
Partnering for success in application service provision
Authors: D. E. Sofiane Tebboune, Philip Seltsikas
Venue: Business strategies for information technology management (2003)

Application Service Provision (ASP), which consists of deploying, managing and remotely hosting software applications through centrally located servers, is emerging as a new form of application outsourcing that is attractive to many sectors. This chapter shows that the concept of strategic alliances is highly relevant to the ASP model. The chapter illustrates this with two cases, one of which was a failure because of inappropriate partnership management. The authors highlight the importance of focusing on the management of alliances instead of how to form them, by presenting a life cycle approach to alliances. The chapter also relates the immaturity of the ASP market to the difficulty in measuring the success of strategic alliances formed in this context. This chapter concludes by presenting predictions about the future of ASP.
An experimental analysis of a set of compiler algorithms*
Authors: Keith D. Cooper
Venue:  (2003)

The thesis of this dissertation is that experimental analysis in computer science is an essential component of understanding algorithmic behavior. In three different experiments, we compare and contrast well-chosen algorithms and show empirical evidence of performance differences. In all cases herein, the algorithms that were assumed to be the best are shown to have superior, sometimes surprising alternatives, justifying our thesis. In each case, we developed a set of solutions and evaluated and refined them until we discovered better methods. In the first experiment, we examine different methods for building an interference graph, the pivotal structure of a graph-coloring register allocator. Our results show that a twenty-year-old assumption about the graph's characteristics is flawed, and we show extensive data to explain the best way to build this graph. In the second experiment, we take an O(n 2) algorithm for computing dominance and show how to make it run, in general, faster than the commonly used dominator algorithm due to Lengauer and Tarjan, which runs in time proportional to the inverse of Ackermann's function. The dominance work led to our third experiment, which seeks to show the best way to compute iterative data-flow analyses. There is a well understood theoretical specification due to Kam and Ullman that bounds the time necessary to compute specific types of data-flow equations. We compare their algorithm against a simple worklist algorithm that takes its intuition from a study of how Kam and Ullman's algorithm propagates information, and we show that the worklist algorithm is faster, in practice. In many ways, the value of this work is in the engineering improvements to necessary and complicated phases of the compiler. *This work is based in part upon work supported by the Texas Advanced Technology Program under Grant No. 003604-015 and by Darpa through Army Contract DABT63-95-C-0115.
A case study on the adaptive maintenance of an internet application
Authors: Susan Bergin, John Keating
Venue: Journal of Software Maintenance: Research and Practice (2003)

We describe an Internet application for providing mobile phone tariff information for Northern Ireland and the Republic of Ireland. Using this application it is possible to accurately and easily determine and compare mobile phone packages offered by different service providers. One of the important features of such an Internet application is the potential for high maintenance associated with the data in the system and more importantly the structure of the system given the inevitable changes in the corresponding mobile phone market. We have identified the maintenance tasks associated with our system to reflect changes in the mobile phone market and outline an evaluation technique for describing the system's ability to cope with change. In particular, we evaluate the actual change required to our software system to implement various maintenance tasks. We have found that there is an upper bound (∼5%) on the maintenance effort associated with the system which is both acceptable and manageable for maintenance purposes. We show that at most the changes required to our system are no greater than 3.07%, when a complete new service provider is added or removed. We conclude that the development of a maintenance model in conjunction with system design is essential for estimating the maintenance effort associated with similar Internet applications.
Kinetic simulation of signal transduction system in hippocampal long-term potentiation with dynamic modeling of protein phosphatase 2A
Authors: Shinichi Kikuchi, Kenji Fujimoto, Noriyuki Kitagawa, Taro Fuchikawa, Michiko Abe, Kotaro Oka, Kohtaro Takei, Masaru Tomita
Venue: Neural Networks (2003)

We modeled and analyzed a signal transduction system of long-term potentiation (LTP) in hippocampal post-synapse. Bhalla and Iyengar [Science 283(1999) 381] have developed a hippocampal LTP model. In the conventional model, the concentration of protein phosphatase 2A (PP2A) was fixed. However, it was reported that dynamic inactivation of PP2A was essential for LTP [J. Neurochem. 74 (2000) 807]. We introduced a dynamic modeling of PP2A; inactivation (phosphorylation) of PP2A by calcium/calmodulin-dependent protein kinase II (CaMKII) in the presence of calcium/calmodulin, self-activation (autodephosphorylation) of PP2A, and inactivation (dephosphorylation) of CaMKII by PP2A. This model includes complex feedback loops; both CaMKII and PP2A are autoactivated, while they inactivate each other. Moreover, we proposed an analysis strategy for model validation by applying the results of sensitivity analysis. In our system, calcineurin (CaN) played an essential role, rather than the activation of protein kinase C (PKC) as documented in the conventional model. From results of the analysis of our model, we found the following robustness as characteristics of bistability in our model: (1) PP2A reactions against calcium ion (Ca2+) perturbation; (2) PP2A inactivation against PP2A increase; (3) protein phosphatase 1 (PP1) activation against PF2A increase; and (4) PP2A reactions against PP2A initial concentration. These properties facilitated LTP induction in our system. We showed that another mechanism could introduce bistable behavior by adding dynamic reactions of PP2A.
Data-parallel polygonization
Authors: Erik G. Hoel, Hanan Samet
Venue: Parallel Computing (2003)

Data-parallel algorithms are presented for polygonizing a collection of line segments represented by a data-parallel bucket PMR quadtree, a data-parallel R-tree, and a data-parallel R+-tree. Such an operation is useful in a geographic information system (GIS). A sample performance comparison of the three data-parallel structures for this operation is also given.
Combining UCMs and formal methods for representing and checking the validity of scenarios as user requirements
Authors: John A. van der Poll, Paula Kotzé, Ahmed Seffah, Thiruvengadam Radhakrishnan, Asmaa Alsumait
Venue: Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology (2003)

In user interface engineering, scenarios are stories that capture information about users and their tasks, including the context of use. Scenarios are generally documented using natural languages in order to understand, validate and use them effectively and efficiently throughout the development lifecycle. Stakeholders and software developers need to understand scenarios and translate them into design solutions. This paper discusses how use case maps, a visual notation for representing scenarios, with the complicity of formal requirements engineering methods, can lead to a comprehensive framework for representing and validating scenarios while improving and mediating the communication between usability engineers and software development teams. Particular attention is given to the extended use case maps as well as to a number of heuristics for formal validation.
Conceptual Modelling of Web Applications, Workflows and Web Services
Authors: Piero Fraternali
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

Conceptual modelling has recently gained attention as a means for formalizing the development process of Web applications, opening the way to the benefits of software engineering also in the Web context. New applications demand the extension of hypertextual front-ends with workflow functionality and with the ability of interacting with remote Web services. This scenario poses new challenges to Web conceptual models, which must be able to capture new requirements.
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Authors: Achour Mostefaoui, Sergio Rajsbaum, Michel Raynal
Venue: Journal of the ACM (JACM) (2003)

This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of input vectors for which it is possible to solve consensus despite the occurrence of up to f process crashes. The first main result defines acceptable conditions and shows that these are exactly the conditions for which a consensus protocol exists. Two examples of realistic acceptable conditions are presented, and proved to be maximal, in the sense that they cannot be extended and remain acceptable. The second main result is a generic consensus shared-memory protocol for any acceptable condition. The protocol always guarantees agreement and validity, and terminates (at least) when the inputs satisfy the condition with which the protocol has been instantiated, or when there are no crashes. An efficient version of the protocol is then designed for the message passing model that works when f < n/2, and it is shown that no such protocol exists when f &ge; n/2. It is also shown how the protocol's safety can be traded for its liveness.
Users as developers: conditions and effects of user systems development
Authors: Anders Avdic
Venue: Computing information technology: the human side (2003)

This chapter presents conditions and effects of User Systems Development using a Spreadsheet Program. It argues that User Systems Development using a Spreadsheet Program is characterized by integration, interactivity and capacity of questioning, which make it possible to control continuous changes in the environment of an organization. Three empirical studies have been carried out using a Grounded Theory influenced approach. The results are presented with the use of the model of generic practice (the ToP model), in order to systemize empirical findings and related theory. The model is used to specify the conditions and results of a specific practice, e.g., a controller practice or an information technology (IT) specialist practice.
Order-Sensitive Clustering for Remote Homologous Protein Detection
Authors: Jin Chen, Wynne Hsu, Mong Li Lee
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Traditional sequence alignment methods are effective in identifying homologous proteins that are highly similar. However, these approaches do not perform well for remote homologous proteins, that is, proteins whose 3D structures are similar but their sequences are not. Recent biological research reveals that protein sequences contain residues that determine the 3D structure of proteins. In this work, we investigate incorporating this information to aid in theclustering of protein databases. We capture protein residues in the form of patterns with fixed order among them. First, the significant patterns are extracted from the protein sequences. Based on the extracted patterns, we perform sequence mining to generate the order among them. Finally, we adopt a partition-based method to cluster protein sequences using the patterns and order features. Experiments on COG and SCOP40 datasets show that our new approach is able to generate high quality clusters that are similar to those determined manually by the biologists.
ScrollPad: Tangible Scrolling with Mobile Devices
Authors: Daniel Fällmana, Andreas Lund, Mikael Wiberg
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

In this paper we approach the problem of managing large visual sets of data on small mobile devices. While current approaches either focuses on 1) scrolling on the mobile device, or 2) reducing the content in various ways (e.g. zooming, automatic redesign depending on the screen size of a mobile device, etc) our approach is to scroll with the mobile device itself (i.e. object in the world scrolling) over a large virtual area. We present the background for this project and working prototype called ScrollPad developed to illustrate this concept. We then present an initial user study conducted and relate this project to similar efforts made before concluding the paper.