ppxscal/embedding_network huggingface dataset:
The African dream: a pan-African e-community project
Authors: Denise Biggs, Carol Purnell
Venue: Communities and Technologies (2003)

The African Dream Project seeks to develop community-based tourism by creating a technology-based solution to global marketing. They have chosen to do this by developing tourism routes across Africa, uniting them under the umbrella concept of Afrikatourism. This paper reports on a study done in the Eastern and Western Cape provinces of South Africa to determine the communication and coordination practices of tourism routes that form part of a Pan-African e-community under the auspices of the African Dream Project. The study seeks to devise a model for maintaining cohesion of the routes through effective and efficient ICT and non-ICT practices. It is part of a 2-year study funded by the IDRC to determine the potential impact of ICT on the development of microenterprise in the tourism industry, entitled the SOMDITTI Phase 2 project.
A recursive algorithm for finding HDMR terms for sensitivity analysis
Authors: H. Kaya, M. Kaplan, H. Saygin
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

High Dimensional Model Representation (HDMR) is a newly developed technique which decomposes a multivariate function into a constant, univariate, bivariate functions and so on. These functions are forced to be mutually orthogonal by means of an orthogonality condition. The technique which is generally used for high dimensional input-output systems can be applied to various disciplines including sensitivity analysis, differential equations, inversion of data and so on. In this article we present a computer program that computes individual components of HDMR resolution of a given multivariate function. The program also calculates the global sensitivity indices. Lastly the results of the numerical experiments for different set of functions are introduced.
Periodic broadcast and patching services - implementation, measurement and analysis in an internet streaming video testbed
Authors: Michael K. Bradshaw, Bing Wang, Subhabrata Sen, Lixin Gao, Jim Kurose, Prashant Shenoy, Don Towsley
Venue: Multimedia Systems (2003)

Multimedia streaming applications can consume a significant amount of server and network resources. Periodic broadcast and patching are two approaches that use multicast transmission and client buffering in innovative ways to reduce server and network load, while at the same time allowing asynchronous access to multimedia streams by a large number of clients. Current research in this area has focussed primarily on the algorithmic aspects of these approaches, with evaluation performed via analysis or simulation. In this paper, we describe the design and implementation of a flexible streaming video server and client test bed that implements both periodic broadcast and patching, and explore the issues that arise when implementing these algorithms using laboratory and internet-based test beds. We present measurements detailing the overheads associated with the various server components (signaling, transmission schedule computation, data retrieval and transmission), the interactions between the various components of the architecture, and the overall end-to-end performance. We also discuss the importance of an appropriate server application-level caching policy for reducing the needed disk bandwidth at the server. We conclude with a discussion of the insights gained from our implementation and experimental evaluation.
An efficient spatial publish/subscribe system for intelligent location-based services
Authors: Xiaoyan Chen, Ying Chen, Fangyan Rao
Venue: Proceedings of the 2nd international workshop on Distributed event-based systems (2003)

The advance in wireless Internet and mobile computing brought the booming of intelligent Location-Based Services(LBS), which can actively push location-dependent information to mobile users according to their predefined interest. The successful development of push-based LBS applications relies on the existence of a publish/subscribe middleware that can handle spatial relationship. This paper presents an efficient spatial publish/subscribe system that can serve as the middleware for intelligent LBS applications. The basic models, including spatial event model, spatial subscription model and notification model, are introduced and the over-all architecture is presented. Two kinds of spatial predicate that can meet most common requirement of intelligent location aware applications are also discussed. Furthermore, we propose a novel spatial event processing approach that dispatches the spatial subscriptions to self-positioning mobile devices. By leveraging client-side computing resource and decreasing the communication times, the server-side workload is relieved and the communication cost is reduced. Experimental results clearly demonstrate the efficiency of our approach.
Nano-carbon materials for cold cathode applications
Authors: A. N. Obraztsov, Al. A. Zakhidov, A. P. Volkov, D. A. Lyashenko
Venue: Microelectronic Engineering (2003)

Nano-carbon thin film materials were obtained by chemical vapor deposition in dc discharge activated hydrogen-methane gas mixture. Film structure, surface morphology and phase composition was studied by Raman, electron microscopy and electron spectroscopy methods. A highly efficient cold electron emission was found for the films composed from well graphitized nano-structures including carbon nanotubes and graphite nano-crystallites. Electron emission tests and analysis exhibit non-classical behavior of the nano-carbon cold cathodes. The statistical analysis of the cold emission show normal distribution of parameters of separate emission centers with narrow standard deviation. The possible mechanism of the cold emission is discussed.
Context Thesaurus for the Extraction of Metadata from Medical Research Papers
Authors: Michael Shepherd, Carolyn Watters, June Young
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

Much of the academic literature available on the Web has never been adequately catalogued. Consequently, even using large-scale search engines, much of it remains inaccessible to researchers as indexing on this scale lacks the necessary detail to cope with discipline dependent terminologies and ontologies. Metadata has become a popular means to provide such information within known domains. In this paper, we describe an approach to theautomatic extraction of metadata from medical research papers. Medical research papers tend to have stereotypic prescribed sections, such as introduction, methods, and conclusions. The approach described uses context thesauri and the semantic structure of the documents to extract metadata based on these stereotypic sections.
A Novel Method of Keyframe Setting in Video Coding: Fast Adaptive Dynamic Keyframe Selecting
Authors: Yu Yuan, David Feng, Yuzhuo Zhong
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

In this paper, we describe a novel method of keyframe setting in video coding: Fast Adaptive Dynamic Keyframe Selecting. The method analyzes video contents and decides keyframe setting dynamically and adaptively. Utilizing information generated by motion-estimation, ourmethod involves only a little additional computing cost. Our method can improve both objective and subjective quality compared with traditional keyframe setting. It can be applied to any motion-estimation based video compression. We tested the method on not only standard test sequences but also real movie sequences proving that it gives valuable results.
A transaction manager component for cooperative transaction models
Authors: George T. Heineman
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

The database community has produced extensive research on the concurrency control problem in the context of traditional databases. However, this traditional model is not suitable for some applications, such as software development environments and CAD/CAM systems. What is needed is an extended transaction model better suited for these newer applications. Unfortunately, there is no consensus as to which of the almost dozens of extended transaction models is appropriate.This paper posits that there is no single model which will be applicable to every application and seeks other ways to use existing database technology. Towards this end, we present PERN, a new transaction manager component which provides the flexible and tailorable support required by advanced database applications.
Modeling the Sustainability of Knowledge Management Programs
Authors: Eliot Rich, Peter Duchessi
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

In this paper we explore the processes that create sustainable Knowledge Management (KM) programs. Much of the extant KM literature is advocacy or case description. There have been few attempts to look at success or failure as the result of the combination of endogenous forces that place KM in the context of the firm, and affect outcomes over time.This paper starts by describing a causal model that links a firm's staff and resources to the firm's ability to develop a knowledge repository, and the effects of this repository on the knowledge available to members of the firm. This model was developed through literature review combined with case study and 26 intensive interviews conducted at two international IT consulting firms.This model is formalized through the use of system dynamics simulation. It produces behaviors characteristic of successful knowledge management programs. Under alternative conditions, the model illustrates unsustainable outcomes. These outcomes are characterized by decay and marginalization of the knowledge management program.Knowledge management experts at one of the case study firms reviewed the results of the model through a set of structured interviews. Analysis of the interviews demonstrated that the model depicted plausible behavior for both the sustainable and unsustainable scenarios.This work contributes to the knowledge management literature by identifying and simulating the interaction between the knowledge-generating processes of the firm and its own dynamics. This simulation may be used to understand how knowledge management programs are embedded in the larger environment of the firm, and how that environment is in turn affected by the ability to manage knowledge successfully.
The resource-based theory of the firm: the new paradigm for information resources management?
Authors: Kalle Kangas
Venue: Business strategies for information technology management (2003)

This chapter explores the theoretical foundations of the digital economy. In doing that, it first discusses micro-economics-actually the eight main theories of the 20th century firm. A reasoning, through a literary review, is presented, which shows that no other theory of firm explored provides a suitable background for the digital economy, except the resource-based view of the firm. Starting from this finding, the paper further explores the strategic formulations based on the resource-based view of the firm, as well as its implications to organizational learning and competitive advantage created by information resources management. The conclusions suggest that the resource-based view of the firm, and its implications to strategic management and information resources management, form a solid base for further studies on the foundations of the digital economy. Therefore, the paper suggests that studies of the digital economy could be more fruitful, when studied under the premises of the resource-based theory, than any other modern theory of the firm.
Numerical Approximations for Stochastic Differential Games: The Ergodic Case
Authors: Harold J. Kushner
Venue: SIAM Journal on Control and Optimization (2003)

The Markov chain approximation method is a widely used, relatively easy to use, and efficient family of methods for the bulk of stochastic control problems in continuous time for reflected-jump-diffusion-type models. It has been shown to converge under broad conditions, and there are good algorithms for solving the numerical problems if the dimension is not too high. We consider a class of stochastic differential games with a reflected diffusion system model and ergodic cost criterion and where the controls for the two players are separated in the dynamics and cost function. It is shown that the value of the game exists and that the numerical method converges to this value as the discretization parameter goes to zero. The actual numerical method solves a stochastic game for a finite state Markov chain and ergodic cost criterion. The essential conditions are nondegeneracy and that a weak local consistency condition hold "almost everywhere" for the numerical approximations, just as for the control problem.
Domain decomposition algorithms for fourth-order nonlinear elliptic eigenvalue problems
Authors: S.-L. Chang, C.-S. Chien
Venue: Journal of Computational Physics (2003)

We study domain decomposition methods for fourth-order plate problems. The well-known von Kármán equations are used as our model problem. By exploiting the symmetry of the domain, the solution of the original problem can be obtained by solving those associated reduced problems, which are defined on subdomains with appropriate boundary conditions. We show how nonoverlapping and overlapping domain decomposition methods can be used to solve the reduced problems. For the linearized von Kármán equation, we present preconditioners using both Fourier analysis and probing techniques for the interface systems, which are similar to those derived by Chan et al. Finally, we compare the efficiency of various domain decomposition preconditioners for solving the von Kármán equations.
Industrial Strength Software and Quality: Software and Engineering at Siemens
Authors: Reinhold Achatz, Frances Paulisch
Venue: Proceedings of the Third International Conference on Quality Software (2003)

This paper is based on Siemens extensive experiencein the area of quality for software-based products, systems,and plants. It describes the "best practices" in thearea of software and quality that are used at Siemens.These techniques include Siemens' approaches in theareas of assessments and improvement of developmentprocesses, the use of metrics to measure such improvements,testing and quality engineering, inspections andreviews, software architecture as well as organizationissues associated with quality such as the sharing of bestpractices in these areas. The results are based on anumber of examples from a broad variety of applicationareas (e.g. telecommunications, industrial automation,medical engineering and transportation). Our experienceis that a focus on quality leads to reductions in cycle-time, effort, and costs and thus to business benefit.
Shared-memory mutual exclusion: major research trends since 1986
Authors: James H. Anderson, Yong-Jik Kim, Ted Herman
Venue: Distributed Computing (2003)

In 1986, Michel Raynal published a comprehensive survey of algorithms for mutual exclusion [72]. In this paper, we survey major research trends since 1986 in work on shared-memory mutual exclusion.
Assessing data quality with control matrices
Authors: Elizabeth M. Pierce
Venue: Communications of the ACM (2004)

The control matrix, long used by IS auditors to evaluate information integrity, can be modified to assess the reliability of information products.
A framework for medical information science
Authors: Bruce Blum
Venue: ACM SIGBIO Newsletter (1984)

A one day workshop on the topic "A Framework for Medical Information Science" was held in October. Three issues were considered: what is Medical Information Science, what are the key research issues, and what are the educational needs. Because of the brevity of the workshop and scope of the topic, no summary conclusions were developed. Individual papers and position statements will be published. This paper reviews the workshop and some of the principal issues discussed.
Affine Rank 3 Groups on Symmetric Designs
Authors: U. Dempwolff
Venue: Designs, Codes and Cryptography (2004)

In this note we determine the symmetric designs which admit a primitive rank 3 group with a solvable normal subgroup. This completes the investigations of Dempwolff [4].
A Compact and Accurate Model for Classification
Authors: Mark Last, Oded Maimon
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Abstract--We describe and evaluate an information-theoretic algorithm for data-driven induction of classification models based on a minimal subset of available features. The relationship between input (predictive) features and the target (classification) attribute is modeled by a tree-like structure termed an information network (IN). Unlike other decision-tree models, the information network uses the same input attribute across the nodes of a given layer (level). The input attributes are selected incrementally by the algorithm to maximize a global decrease in the conditional entropy of the target attribute. We are using the prepruning approach: When no attribute causes a statistically significant decrease in the entropy, the network construction is stopped. The algorithm is shown empirically to produce much more compact models than other methods of decision-tree learning while preserving nearly the same level of classification accuracy.
Poor Man's TBR: A Simple Model Reduction Scheme
Authors: Joel Phillips, L. Miguel Silveira
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

This paper presents a model reduction algorithm motivated by a connection between frequency domain projection methods and approximation of truncated balanced realizations. The method produces guaranteed passive models, has near-optimal error properties, is computationally simple to implement, contains error estimators, and can incorporate frequency weighting information in a straightforward manner. Examples are shown to prove that the method can outperform the standard order reduction techniques by providing similar accuracy with lower models or superior accuracy for the same size model.
Comparison of Genomes Using High-Performance Parallel Computing
Authors: N. F. Almeida,  Jr., C. E. R. Alves, E. N. Caceres, S. W. Song
Venue: Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (2003)

Comparison of the DNA sequences and genes of two genomes can be useful to investigate the common functionalities of the corresponding organisms and get a better understanding of how the genes or groups of genes are organized and involved in several functions. In this paper we use high-performance parallel computing to compare the whole genomes of two organisms, namely Xanthomonas axonopodis pv. citri and Xanthomonas campestris pv. campestris, each with more than five million base-pairs. Our purpose is two-fold. First we intend to exploit the high-performance power of a cluster of low-cost microcomputers, propose a parallel solution to this problem, and show its feasibility with implementation and performanceresults. Second we do additional comparisons of the two genomes by locating and compare not only the homologous genes (expressed in terms of the 20-letter amino acids) but also compare the regions or gaps (in terms of the 4-letter DNA nucleotides) between the corresponding homologous genes. We have implemented the proposed comparison strategy to compare the two genomes Xanthomonas axonopodis pv. citri (Xac) and Xanthomonas campestris pv. campestris (Xcc). The parallel platform used is a Beowulf cluster of 64 nodes consisting of low cost microcomputers. Xac has 5,175,554 base pairs and 4,313 protein-coding genes while Xcc has 5,076,187 base pairs and 4,182 protein-coding genes. The parallel solution is based on the dynamic programming approach and presents not only less processing time, but also better quality results as compared to approaches based on Blast and EGG.
Semi-Lagrangian schemes for the Vlasov equation on an unstructured mesh of phase space
Authors: N. Besse, E. Sonnendrücker
Venue: Journal of Computational Physics (2003)

A new scheme for solving the Vlasov equation using an unstructured mesh for the phase space is proposed. The algorithm is based on the semi-Lagrangian method which exploits the fact that the distribution function is constant along the characteristic curves. We use different local interpolation operators to reconstruct the distribution function f, some of which need the knowledge of the gradient of f. We can use limiter coefficients to maintain the positivity and the L∞ bound of f and optimize these coefficients to ensure the conservation of the L1 norm, that is to say the mass by solving a linear programming problem. Several numerical results are presented in two and three (axisymmetric case) dimensional phase space. The local interpolation technique is well suited for parallel computation.
A new symmetric fractional B-spline
Authors: Manuel Duarte Ortigueira
Venue: Signal Processing (2003)

A new definition of a symmetric fractional B-spline is presented. This generalises the usual integer order B-spline, that becomes a special case of the new one.
A Suite of Tools for Debugging Distributed Autonomous Systems
Authors: David Kortenkamp, Reid Simmons, Tod Milam, Joaquín L. Fernández
Venue: Formal Methods in System Design (2004)

This paper describes a set of tools that enables developers to log and analyze the run-time behavior of distributed control systems. A feature of the tools is that they can be applied to distributed systems. The logging tools enable developers to instrument C or C++ programs so that data indicating state changes can be logged automatically in a variety of formats. In particular, run-time data from distributed systems can be synchronized into a single relational database. Tools are also provided for visualizing the logged data. Analysis to verify correct program behavior is done using a new interval logic that is described in this paper. The logic enables system engineers to express temporal specifications for the autonomous control program that are then checked against the logged data. The data logging, visualization, and interval logic analysis tools are all fully implemented. Results are given from a NASA distributed autonomous control system application.
Looking into video frames on small displays
Authors: Xin Fan, Xing Xie, He-Qin Zhou, Wei-Ying Ma
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

With the growing popularity of personal digital assistants and smart phones, people have become enthusiastic to watch videos through these mobile devices. However, a crucial challenge is to provide a better user experience for browsing videos on the limited and heterogeneous screen sizes. In this paper, we present a novel approach which allows users to overcome the display constraints by zooming into video frames while browsing. An automatic approach for detecting the focus regions is introduced to minimize the amount of user interaction. In order to improve the quality of output stream, virtual camera control is employed in the system. Preliminary evaluation shows that this approach is an effective way for video browsing on small displays.