ppxscal/embedding_network huggingface dataset:
Timestep stochastic simulation of computer networks using diffusion approximation
Authors: Andrzej Kochut
Venue:  (2005)

Performance evaluation of modern computer networks is challenging because of their large sizes, high speeds of communication links, and complex state-dependent control mechanisms. In particular, TCP congestion control reacts in a nonlinear fashion to the state of the network at the time scale of round-trip times, making analysis intractable. Thus packet-level simulation is the only widely used method of performance evaluation. Although it can be accurate, it is computationally expensive and thus can be applied only to small networks and low link speeds. Timestep Stochastic Simulation (TSS) is a novel method for generating sample paths of computer networks, in increments of time steps rather than packet transmissions. TSS has a low computation cost independent of packet rates and provides adequate accuracy for evaluating general state-dependent control mechanisms. TSS generates the evolution of the system state S(t) on a sample path in time steps of size &delta;. At each step, S(t + &delta;) is randomly chosen according to S(t) and the probability distribution Pr[ S(t + &delta;)|S(t)], obtained using the diffusion approximation. Because packet transmission and reception events are replaced by time steps, TSS generates sample paths at a fraction of the cost of packet-level simulation. Because TSS generates sample paths, it can accurately model state-dependent control mechanisms, including TCP congestion control, adaptive dynamic routing, and so on. We have a TSS implementation for general computer networks with state-dependent control. We have applied this to numerous networks with TCP and state-dependent UDP flows, and confirmed its accuracy against packet-level simulation.
Hangul Document Image Retrieval System Using Rank-based Recognitio
Authors: Duk-Ryong Lee, Woo-Youn Kim, Il-Seok Oh
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

We constructed a full-text retrieval system for the scanned Hangul document images. The system consists of three parts; preprocessing, recognition, and retrieval. The retrieval algorithm uses recognition results up to k-ranks. The algorithm is not only insensitive to the recognition errors, but also has the advantage of user-controllable recall and precision. For the objective performance evaluation, we used the scanned images of Journal of Korean Information Science Society provided by KISTI. The system was shown to be practical through the evaluation of retrieval performances.
Risk Mitigation of Design Requirements Using a Probabilistic Analysis
Authors: Michael C. Robinson, Sara E. Wallace, David C. Woodward
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

The definition of requirements for complex systems requires a balance between system over-design and associated risk. A severely over-designed system poses minimal risk of failing to meet the user¿s operational requirements, however the over-designed system poses increased risk of high costs, usability and reliability due to system complexity, and many other issues. The method proposed in this paper creates a more accurate representation of a complex system in order to determine requirements, and quantifies the risk associated with the defined requirements. The sizing of naval power transformers in electrical distribution systems requires an updated approach to quantify the risk inherent in the system requirements definition process. The proposed methodology uses a systems engineering approach, performing a probabilistic (Monte Carlo) analysis of the electrical loads powered by each, individual transformer. Transformer size can then be determined based on the electrical requirements and the amount of risk the program manager is willing to assume.
Superconvergence of the Velocity in Mimetic Finite Difference Methods on Quadrilaterals
Authors: M. Berndt, K. Lipnikov, M. Shashkov, M. F. Wheeler, I. Yotov
Venue: SIAM Journal on Numerical Analysis (2005)

Superconvergence of the velocity is established for mimetic finite difference approximations of second-order elliptic problems over $h^2$-uniform quadrilateral meshes. The superconvergence result holds for a full tensor coefficient. The analysis exploits the relation between mimetic finite differences and mixed finite element methods via a special quadrature rule for computing the scalar product in the velocity space. The theoretical results are confirmed by numerical experiments.
A Dynamic Web Service based Data Mining Process System
Authors: Chieh-Yuan Tsai, Min-Hong Tsai
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

This research introduces a Dynamic Data Mining Process (DDMP) system based on Service-Oriented Architecture (SOA). Each activity in data mining process is viewed as a web service operated on Internet. The web services provide functions of data preprocessing, data mining algorithms, and visualization analysis. Depending on user's requirement, the web services are dynamically linked using Business Process Execution Language for Web Service (BPEL4WS) to construct a desired data mining process. Finally, the result model described by Predictive Model Markup Language (PMML) is returned for further analysis. A practical credit card data set provided by a commercial bank is implemented using the proposed system. It is found that the DDMP system can provide dynamical and satisfied analysis result to the enterprise.
Self-adaptive multithreaded applications: a case for dynamic aspect weaving
Authors: Andreas Rasche, Wolfgang Schult, Andreas Polze
Venue: Proceedings of the 4th workshop on Reflective and adaptive middleware systems (2005)

Shorter product cycles, the requirement for immediate reaction to cyber-attacks and the need for the adaptation to changing environmental conditions demand software reconfigurations to be performed at runtime, in order to reduce downtime. Especially long running applications, which have to provide continuous service should not be restarted for maintenance. They must be updated dynamically.We have developed a reconfiguration strategy allowing to identify valid reconfiguration points even in multithreaded environments, enabling dynamic application updates. The usage of dynamic aspect weaving enables us to transparently create self-adaptive applications without additional compilation steps or programming constraints in the software development process.We demonstrate how our approach can be applied to a real-world retail application of a large logistics company. We will describe the implementation of the reconfiguration aspect and our dynamic aspect weaving tool Rapier LOOM.NET.
Content-based music audio recommendation
Authors: Pedro Cano, Markus Koppenberger, Nicolas Wack
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

We present the MusicSurfer, a metadata free system for the interaction with massive collections of music. MusicSurfer automatically extracts descriptions related to instrumentation, rhythm and harmony from music audio signals. Together with efficient similarity metrics, the descriptions allow navigation of multimillion track music collections in a flexible and efficient way without the need for metadata nor human ratings.
Efficient estimation of linear functionals of a bivariate distribution with equal, but unknown marginals: the least-squares approach
Authors: Hanxiang Peng, Anton Schick
Venue: Journal of Multivariate Analysis (2005)

In this paper, we characterize and construct efficient estimators of linear functionals of a bivariate distribution with equal marginals. An efficient estimator equals the empirical estimator minus a correction term and provides significant improvements over the empirical estimator. We construct an efficient estimator by estimating the correction term. For this we use the least-squares principle and an estimated orthonormal basis for the Hilbert space of square-integrable functions under the unknown equal marginal distribution. Simulations confirm the asymptotic behavior of this estimator in moderate sample sizes and the considerable theoretical gains over the empirical estimator.
Some Approaches to Solving Inventory Control Problems
Authors: A. P. Knopov, L. P. Tur
Venue: Cybernetics and Systems Analysis (2005)

Several approaches to the solution of inventory control problems are considered. These approaches are designed to find optimal strategies, control parameters for a given strategy, and probability estimates of resource supply.
Multi-dimensional quorum sets for read-few write-many replica control protocols
Authors: B. Silaghi, P. Keleher, B. Bhattacharjee
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

We describe d-spaces, a replica control protocol defined in terms of quorum sets on multi-dimensional logical structures. Our work is motivated by asymmetrical access patterns, where the number of read accesses to data are dominant relative to update accesses, i.e. where the protocols should be read-few write-many. D-spaces are optimal with respect to quorum group sizes. The quality of the tradeoff between read efficiency and update availability is not matched by existing quorum protocols. We also propose a novel scheme for implementing d-spaces that combines caching and local information to provide a best-effort form of global views. This allows quorum reconfiguration to be lightweight without impacting access latencies, even when the rate of membership changes is very high.
An Agent Oriented Proactive Fault-Tolerant Framework for Grid Computing
Authors: Mohammad Tanvir Huda, Heinz W. Schmidt, Ian D. Peake
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

Because of computational grid heterogeneity, scale and complexity, faults become likely. Therefore, grid infrastructure must have mechanisms to deal with faults while also providing efficient and reliable services to its end users. Existing fault-tolerant approaches are inefficient because they are reactive and incomplete. They are reactive because they only deal with faults when they take place; they are incomplete because they only deal with certain types of faults. Proactive approaches increase efficiency by reducing the cost and time of operations and network resource usage by maintaining the state of executing applications and resuming operation when rescheduled. This paper presents an agent oriented, fault-tolerant grid framework where agents deal with individual faults proactively. Agents maintain information about hardware conditions, executing process memory consumption, available resources, network conditions and component mean time to failure. Based on this information and critical states, agent can improve the reliability and efficiency of grid services.
Exemplars for Better Requirements - Tales from the Trenches
Authors: Suzanne Robertson
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Good requirements don¿t just happen; they come from effective practices. And effective practices come from distillation of experience. In her job as a consultant Suzanne Robertson has worked on a wide variety of projects in diverse socio-technical domains. She has had the opportunity to discover good practices by examining the way that successful requirements projects are run and by identifying patterns of behaviour that are common to those projects. This talk is about these Requirements Exemplars - patterns to emulate - that she has distilled from experience with projects in many different cultures.
Paranoid: A Global Secure File Access Control System
Authors: Fareed Zaffar, Gershon Kedem, Ashish Gehani
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

The Paranoid file system is an encrypted, secure, global file system with user managed access control. The system provides efficient peer-to-peer application transparent file sharing. This paper presents the design, implementation and evaluation of the Paranoid file system and its accesscontrol architecture. The system lets users grant safe, selective, UNIX-like, file access to peer groups across administrative boundaries. Files are kept encrypted and access control translates into key management. The system uses a novel transformation key scheme to effect access revocation. The file system works seamlessly with existing applications through the use of interposition agents. The interposition agents provide a layer of indirection making it possible to implement transparent remote file access and data encryption/ decryption without any kernel modifications. System performance evaluations show that encryption and remote file-access overheads are small, demonstrating that the Paranoid system is practical.
An evaluation of quantum neural networks in the detection of epileptic seizures in the neonatal electroencephalogram
Authors: N. B. Karayiannis, A. Mukherjee, J. R. Glover, J. D. Frost, R. A. Hrachovy,  Jr., E. M. Mizrahi
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2006)

This paper presents the results of an experimental study that evaluated the ability of quantum neural networks (QNNs) to capture and quantify uncertainty in data and compared their performance with that of conventional feedforward neural networks (FFNNs). In this work, QNNs and FFNNs were trained to classify short segments of epileptic seizures in neonatal EEG. The experiments revealed significant differences between the internal representations created by trained QNNs and FFNNs from sample information provided by the training data. The results of this experimental study also confirmed that the responses of trained QNNs are more reliable indicators of uncertainty in the input data compared with the responses of trained FFNNs.
A vlsi analog computer/math co-processor for a digital computer
Authors: Yannis P. Tsividis
Venue:  (2005)

This dissertation investigates the utility of a programmable VLSI analog computer for the solution of differential equations. To investigate the capability of analog computing in a modern context, a large VLSI circuit (100 mm 2) was designed and fabricated in a standard mixed-signal CMOS technology. It contains 416 analog functional blocks, switches for their interconnection, and circuitry for the system's program and control. This chip is controlled and programmed by a PC via a data acquisition card. This arrangement has been used to solve differential equations with acceptable accuracy, as much as 400x faster than a modern workstation. The utility of a VLSI analog computer has been demonstrated by solving stochastic differential equations, partial differential equations, and ordinary differential equations (ODEs). Additionally, techniques for using the digital computer to refine the solution from the analog computer are presented. Solutions from the analog computer have been used to accelerate a digital computer's solution of the periodic steady state of an ODE by more than an order of magnitude. An analysis has been done showing that the analog computer dissipates 0.02% to 1% of the energy of a digital general purpose microprocessor and about 2% to 20% of the energy of a digital signal processor, when solving the same differential equation.
Battery-Aware Real-Time Task Scheduling in Wireless Sensor Networks
Authors: Seungki Hong, Daeyoung Kim, Jae-eon Kim
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Since the lifetime of a battery directly impacts the lifetime of sensor networks, one of the key considerations in the design of sensor networks is the ability to maximize battery lifetime. In this paper, we present (1) a task modeling methodology and (2) a battery-aware real-time task scheduling technique for sensor networks. The task modeling is achieved based on task classification in terms of the usage of resources on a micro-sensor system. For exploiting the recovery effect of battery, the battery-aware task scheduling algorithm composed of three phases is designed to maximize the lifetime of a battery while meeting the timing constraint of each task.
Solving Schemes for Computational Magneto-Aerodynamics
Authors: J. S. Shang
Venue: Journal of Scientific Computing (2005)

The electromagnetic force introduces a new physics dimension for enhancing aerodynamic performance of aerospace vehicles. In order to simulate interdisciplinary phenomena, the Navier---Stokes and Maxwell equations in the time domain must be integrated on a common frame of reference. For a wide range of applications from subsonic unmanned vehicles to hypersonic flight control, the resultant nonlinear partial differential equations offer a formidable challenge for numerical analysis. The experience and physical insight using the approximate Riemann and compact-differencing formulation as well as several temporal discritizations will be shared. The most recent development and advancement in numerical procedures for solving this system of governing equations are delineated
Additive Schwarz Iterations for Markov Chains
Authors: Rafael Bru, Francisco Pedroche, Daniel B. Szyld
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

A convergence analysis is presented for additive Schwarz iterations when applied to consistent singular systems of equations of the form $Ax=b$. The theory applies to singular $M$-matrices with one-dimensional null space and is applicable in particular to systems representing ergodic Markov chains, and to certain discretizations of partial differential equations. Additive Schwarz can be seen as a generalization of block Jacobi, where the set of indices defining the diagonal blocks have nonempty intersection; this is called the overlap. The presence of overlap is known to accelerate the convergence of the methods in the nonsingular case. By providing convergence results, as well as some characteristics of the induced splitting, we hope to encourage the use of this additional computational tool for the solution of Markov chains and other singular systems. We present several numerical examples showing that additive Schwarz performs better than block Jacobi. For completeness, a few numerical experiments with block Gauss--Seidel and multiplicative Schwarz are also included.
A Process Management Tool Supporting Component-Based Process Development and Hierarchical Management Mechanism
Authors: Yasha Wang, Dongni Li, Xiaoyang He
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

How to develop the software process models that satisfy the organization's standards and the characteristics of software projects, and improve it continuously, is difficulty for software organizations. A process management tool named JBPM (Jade Bird Process Management) proposes a good solution for this issue. JBPM supports component based process development and hierarchical management mechanism which is illumined by CMM. In order to provide a unified framework for all processes in different projects across the organization, JBPM employs the software lifecycle process framework in ISO/IEC std. 12207 and IEEE std. 1517, and use it as a general requirement specification for those processes.
"Poor" Signal Processing and Grey Modeling Technique
Authors: Zhijie Chen, Weizhen Chen, Qile Chen, Mian-Yun Chen
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

An investigated object with "poor" signal or lacking in the completed model information is referred to as a grey system. Grey systems are found everywhere. In this paper, the latest researches on "poor" signal processing and grey modeling technique are presented. The researched results here can open new prospects for the development and application of systems methodology.
Acute Triangulations of Polygons
Authors: Liping Yuan
Venue: Discrete Computational Geometry (2005)

In this paper we present upper bounds for the number of triangles in a triangulation of an n-gon, imposing the condition that all triangles used are non-obtuse, or just acute. This is based on work by Bern et al. and Maehara, and strengthens their results.
Tail equivalence relationships for ruin probabilities in several risk models: Research Articles
Authors: Feng Hu, Chuancun Yin, Zhaojun Zong
Venue: Applied Stochastic Models in Business and Industry (2005)

This paper is a further investigation into the ruin probability &psgr;(x) in several risk models, where x is the initial surplus. Under the assumption that the claim sizes are heavy-tailed, we get some tail equivalence relationships of &psgr;(x). Copyright &copy; 2005 John Wiley & Sons, Ltd.
Modeling landscapes with ridges and rivers: bottom up approach
Authors: Farès Belhadj, Pierre Audibert
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

We present a new fractal based method of generating realistic models of natural landscapes. In this paper, we describe a three-steps method that produces a terrain mesh using ridge lines and rivers drainage network. As opposed to previous methods that compute water erosion for a given terrain model --- Digital Elevation Map ---, our terrain mesh is generated constrained by a precomputed set of ridge lines and rivers network. A skeleton of a ridges and rivers network is computed and stored in a Digital Elevation Map (D.E.M.) as initial values. Then, the elevations data set is enriched using a novel interpolation method based on a Midpoint Displacement's Inverse process. Finally, a midpoint displacement subdivision is applied to interpolate the remaining elevation coordinates. The resulting terrain meshes lead to naturalistic landscape models and our method seems to be very promising. Images produced by our model are presented.
A Multi-Agent System to Stream Multimedia to Handheld Devices
Authors: Gillian Leetch, Eleni Mangina
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

The concept of mobile computing and its associated content is a topic receiving growing attention. The computing paradigm has evolved since the days of the mainframe system of previous decades to the laptop and handheld devices of today. These new systems require purpose-built applications, as users have ever increasing expectations of computational capabilities while on the move. Today, it is expected that the utilities that are accessible on the desktop are available when mobile. The intention of this paper is to describe the implementation of a web-based, multi-agent system specifically designed for users on the move, to stream multimedia content to a hand-held device.
T-RHYTHM: A System for Supporting Rhythm Learning by Using Tactile Devices
Authors: Sosuke Miura, Masanori Sugimoto
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

The T-RHYTHM system, that supports individual learners in playing or singing in solo or ensemble situations, is proposed. T-RHYTHM provides each learner with the rhythm of music through her tactile sense, and supports her so that she can recognize her own rhythm without being confused by other learners' performances or singing voices. The rhythm of the music given to each learner is determined based on a performance by an accompanist and transmitted to her vibration device via a wireless communication. The user studies of T-RHYTHM were conducted in solo and ensemble settings, and proved that the system could effectively improve learners' rhythm recognition skills.