ppxscal/embedding_network huggingface dataset:
A Scalable Peer-to-Peer Architecture for Distributed Information Monitoring Applications
Authors: Bugra Gedik, Ling Liu
Venue: IEEE Transactions on Computers (2005)

We present PeerCQ, a decentralized architecture for Internet scale information monitoring using a network of heterogeneous peer nodes. PeerCQ uses Continual Queries (CQs) as its primitives to express information-monitoring requests. The PeerCQ development has three unique characteristics. First, we develop a systematic and serverless approach to large scale information monitoring, aiming at providing a fully distributed, highly scalable, and self-configurable architecture for scalable and reliable processing of a large number of CQs over a network of loosely coupled, heterogeneous, and possibly unreliable nodes (peers). Second, we introduce an effective service partitioning scheme at the P2P protocol layer to distribute the processing of CQs over a peer-to-peer information monitoring overlay network while maintaining a good balance between system utilization and load balance in the presence of peer joins, departures, and failures. A unique feature of our service partitioning scheme is its ability to incorporate strategies for handling hot spot monitoring requests and peer heterogeneity into the load balancing scheme in PeerCQ. Third, but not least, we develop a dynamic passive replication scheme to enable reliable processing of long-running information monitoring requests in an environment of inherently unreliable peers, including an analytical model to discuss its fault tolerance properties. We report a set of experiments demonstrating the feasibility and the effectiveness of the PeerCQ approach to large-scale peer-to-peer information monitoring.
Autonomous trust construction in multi-agent systems: a graph theory methodology
Authors: Y. C. Jiang, Z. Y. Xia, Y. P. Zhong, S. Y. Zhang
Venue: Advances in Engineering Software (2005)

Trust mechanism always has two popular architectures: centralized fashion and distributed fashion. However, those two architectures are not well suited for multi-agent system since they cannot achieve the trust management autonomy. To achieve the trust management autonomy, the paper presents an autonomous trust construction model based on graph theory methodology. The presented model adopts the graph to describe the trust information, and uses the graph combination and path searching to construct the trust relation. Every agent can implement trust management autonomously; agent system can construct the global trust concept by the combination of trust information among agents; an agent can achieve the trust relation with other agent by trust path searching or trust negotiation. The simulation experiment results prove that the autonomous trust construction based on graph theory methodology is effective.
Structure of the software for computer-aided logical design of automatic control
Authors: A. G. Aleksandrov, R. V. Isakov, L. S. Mikhailova
Venue: Automation and Remote Control (2005)

Requirements on the software for computer-aided logical design of automatic control were formulated and assumed as a basis of the software concept. According to this concept, the software for the computer-aided logical design of automatic control should have two levels: the environment of the control system designer and the (researcher) environment for development and updating of the first level. Realization of the concept was illustrated by the GAMMA-2RS system.
Nonlinear Stability Analysis for the Method of Transport for the Elastic-Plastic Wave Equation
Authors: Guido Giese
Venue: SIAM Journal on Numerical Analysis (2004)

In this paper we present an analytic assessment of the stability and convergence of the so-called method of transport for solving the elastic-plastic wave equation, which is a nonlinear hyperbolic partial differential equation. For the purely elastic wave equation, which is a linear hyperbolic conservation law, one can use von Neumann analysis for proving that stability and convergence immediately follow from the Lax equivalence theorem. For plastic deformation, however, nonlinear stability proofs require greater effort.
The Virtual Team Alliance (VTA): Extending Galbraith's Information-Processing Model to Account for Goal Incongruency
Authors: Jan Thomsen, Raymond E. Levitt, Clifford I. Nass
Venue: Computational Mathematical Organization Theory (2005)

This paper introduces a newComputational organizational analysis and design model, Called the Virtual Team Alliance (VTA), that builds on the Virtual Design Team (VDT) (Jin and Levitt, 1996). VTA extends Galbraith's framework implemented in VDT in two ways: (1) it addresses less routine tasks with some flexibility in how they are performed, and (2) it treats project participants as teleological professionals with potentially incongruent goals. Because tasks in the VTA model are flexible, differences in goals may influence which solution approach project participants prefer; thus, goal incongruencyCan have profound implications for the performance of project teams. We describe how VTA actorsComprise aComplex system that is endowed with fragments ofCanonical information-processing micro-behavior. TheCanonical micro-behaviors in VTA include exception generation, monitoring, selective delegation of authority, searching for alternatives,Clarifying goals, steamrolling, and politicking. The VTA model simulates the micro-levelCommunication andCoordination behavior of actors within the organization, including the impact of goal incongruency between individual actors, in order to determine the emergent, aggregate project behavior and performance. To Galbraith's sociological analysis, based on information-processing "organizational physics," we add new "organizationalChemistry" notions based on social psychological and economic agency theories.
Determining the Radiometric Response Function from a Single Grayscale Image
Authors: Stephen Lin, Lei Zhang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

A method is presented for computing the radiometric response function of a camera from a single grayscale image. While most previous techniques require a set of registered images with different exposures to obtain response data, our approach capitalizes on a statistical feature of graylevel histograms at edge regions to gain information for radiometric calibration. Appropriate edge regions are automatically determined by our technique, and a prior model of radiometric response functions is employed to deal with incomplete data. With this single-image method, radiometric calibration becomes possible to perform in many instances where the camera is unknown.
On the triangularization of arbitrary matrices
Authors: C. P. Huang
Venue: ACM SIGNUM Newsletter (1978)

The main object of this note is to show that a matrix of order 3 can be triangularized by just one sequence of rotations. In [1] we describe a process to triangularize a matrix of order 3. The process consists of two steps. The first step is to apply a sequence of two Greenstadt's rotations [1] with pivot-pairs (1, 2) and (2, 3). This sequence of rotations shall either triangularize the matrix, or the resulting matrix becomes the exceptional form (see equation (8) of [1]). The second step of the process wants to change the matrix from the exceptional form to the non-exceptional so that the first step can resume its function again. Parlett and Wang [2] point out that it probably would take the first step an infinite sequence of rotations to bring the matrix to the exceptional form. Therefore, in order to triangularize the matrix, the process would have to apply a concatenation of infinitely many infinite sequences of rotations. Wang [2] proposes a way to eliminate this concatenation by trying to apply the second step prior to the "end" of the first step, i.e., prior to some point where the matrix is turning into the exceptional form. In this note we show that the process described in [1] does not require a concatenation of many infinite sequences of rotations, it only requires one sequence of rotations to triangularize a matrix. Here we consider only the matrix of order 3, but we believe that a similar analysis can also be applied to matrices of higher order. Throughout this note we assume that notations that are used without specification are the same notations used in [1].
Fundamental bounds on the accuracy of network performance measurements
Authors: Matthew Roughan
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

This paper considers the basic problem of "how accurate can we make Internet performance measurements". The answer is somewhat counter-intuitive in that there are bounds on the accuracy of such measurements, no matter how many probes we can use in a given time interval, and thus arises a type of Heisenberg inequality describing the bounds in our knowledge of the performance of a network. The results stem from the fact that we cannot make independent measurements of a system's performance: all such measures are correlated, and these correlations reduce the efficacy of measurements. The degree of correlation is also strongly dependent on system load. The result has important practical implications that reach beyond the design of Internet measurement experiments, into the design of network protocols.
Geometric Methods for Shape Recovery from Line Drawings of Polyhedra
Authors: Lluís Ros, Federico Thomas
Venue: Journal of Mathematical Imaging and Vision (2005)

Using structural geometric arguments, Whiteley showed that a line drawing is a correct projection of a spherical polyhedron if and only if it has a cross-section compatible with it. We here enlarge the class of drawings to which this test applies, including those of polyhedral disks, possibly with perforations. This extension is helpful, as it makes the test applicable to verify and reconstruct drawings from usual scenes with opaque objects.The presented results rely on geometric constructions, thus offering an alternativeapproach to line drawing interpretation, complementary to the algebraic-combinatorial treatment given in the classic work by Sugihara.
Representational Oriented Component Analysis (ROCA) for Face Recognition with One Sample Image per Training Class
Authors: Fernando De la Torre, Ralph Gross, Simon Baker, B. V. K. Vijaya Kumar
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Subspace methods such as PCA, LDA, ICA have become a standard tool to perform visual learning and recognition. In this paper we propose Representational Oriented Component Analysis (ROCA), an extension of OCA, to perform face recognition when just one sample per training class is available. Several novelties are introduced in order to improve generalization and efficiency: Combining several OCA classifiers based on different image representations of the unique training sample is shown to greatly improve the recognition performance. To improve generalization and to account for small misregistration effect, a learned subspace is added to constrain the OCA solution, A stable/efficient generalized eigenvector algorithm that solves the small size sample problem and avoids overfitting. Preliminary experiments in the FRGC Ver 1.0 dataset (http://www.bee-biometrics.org/) show that ROCA outperforms existing linear techniques (PCA,OCA) and some commercial systems.
Agent-Mediated e-Commerce System
Authors: Elhadi Shakshuki, Saad Abu-Draz
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Software agents offer a promise to change electronic commerce trading by helping Internet traders to purchase products from online distributed resources based on their interests and preferences. Users delegate trading responsibilities to software agents to automate many of the real world trade practices. Existing e-commerce systems inhabit some limitations, which are not realistic in real world trading. This paper presents a peer-to-peer agent-mediated e-commerce system. The system architecture describes the different stages and components that require automation and needed to develop an e-commerce system. The main objective of this system is to address some of the shortcomings that are present in contemporary e-commerce systems, such as single attribute-based negotiation and the necessity of an electronic marketplace. To demonstrate the proposed system a prototype is implemented.
Software-Directed Disk Power Management for Scientific Applications
Authors: S. W. Son, M. Kandemir, A. Choudhary
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Disk power consumption is becoming an increasingly important issue in high-end servers that execute large-scale data-intensive applications. In particular, array-based scientific codes can spend a significant portion of their power budget on the disk subsystem. Observing this, the prior research proposed several strategies, such as spining down to low-power modes or adjusting the speed of the disk in lower RPM, to reduce power consumption on the disk subsystem. A common characteristic of most of these techniques is that they are reactive, in the sense that they make their decisions based on the disk access patterns observed during execution. While such techniques are certainly useful and the published studies reveal that they can be very effective in some cases, one can conceivably achieve better results by adopting a proactive scheme. Focusing on array-intensive scientific applications, this paper makes two important contributions. First, it presents a compiler-driven proactive approach to disk power management. In this approach, the compiler analyzes the application code and extracts the disk access pattern. It then uses this information to insert explicit disk power management calls in the appropriate places in the code. It also preactivates a disk (placed into the low-power mode) before it is actually needed to eliminate the potential performance impact of disk power management. The second contribution of this paper is a code transformation approach that can be used to increase the savings coming from a disk power management scheme (whether reactive or proactive). Our experimental results with several scientific application codes show that both the proactive disk power management approach and the disk layout aware code transformations are beneficial from both power consumption and execution time perspectives.
Storage Virtualization: Technologies for Simplifying Data Storage and Management
Authors: Tom Clark
Venue:  (2005)

"Tom Clark gives us a clear, readable guide to this emerging technology. He explains how it works, what problems it solves, and where it fits in an evolving IT infrastructure."-Milan Merhar"Tom Clark gives us a strong overview of contemporary storage technology with storage virtualization as the central theme-a valuable work for all those seeking a broad understanding of storage in an IT infrastructure."-David Thiel, HP Fellow and Chair of the SNIA Technical Council"Storage virtualization technology holds immense promise for streamlining data storage operations and making the unmanageable manageable. In this work, Tom Clark provides a comprehensive overview of virtualization concepts and the practical benefits customers can realize. Storage Virtualization is recommended reading for anyone wanting to understand this next wave of innovative networked storage technology."-John Webster, Founder and Senior Analyst, Data Mobility GroupEvaluating, Planning, and Implementing High-Value Storage Virtualization SolutionsStorage virtualization has come of age, offering IT professionals powerful new ways to simplify infrastructure, streamline management, improve utilization, and reduce costs. Now, the author of the best-selling storage books IP SANs and Designing Storage Area Networks presents an up-to-the-minute, vendor-neutral overview of storage virtualization in all its forms.Writing for IT managers, administrators, architects, analysts, consultants, and vendors, Tom Clark explains everything from the basics to the latest emerging standards. Storage Virtualization uses realistic examples and diagrams to explain each key concept, concluding with case studies that demonstrate real-world implementation and help you assess the technology's business value. Coverage includes The current state of both storage virtualization technologies and the marketplace Relationships among files, records, data on disk, and storage interconnections Virtualization standards, including the Fabric Application Interface Standard How multiple storage systems are abstracted into virtual storage pools Host-based virtualization, array-based virtualization, and virtualization appliances Virtualization services for high availability and heterogeneous storage applications Virtualized SAN file systems that simplify file management and support distributed computing Virtualized tape backup, including Redundant Array of Independent Tape (RAIT) devices Policy-based storage management, application-sensitive virtualization intelligence, and other high-level automation and virtualization services The future of storage virtualization and storage utilities Extensive resource listings: vendors, industry organizations, and standards initiatives© Copyright Pearson Education. All rights reserved.
Applying neural network to reconstruct nonlinear dynamical systems
Authors: Ali Liaqat, Masahide Kimoto
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

We propose a new neural network residual minimization training method for the reconstruction of nonlinear dynamical systems empirically from observational data. In this method, an unknown dynamical system is expressed as a set of first order ordinary differential equations. The object function consists of squared deviations of the observations from the computed values and squared residuals of the differential equations at evaluation points. An algorithm for the training of the network system over wider assimilation window is employed. The performance of the method is examined over the prediction period by applying it to the chaotic Lorenz system. The results are compared with those computed by auto regression and conventional neural network methods and a considerable improvement in prediction skill is obtained. Its application to data from real climate system is in progress.
A Web-Based and Integrated Hospital Information System
Authors: Hongyan Li, Ming Xue, Ying Ying
Venue: Proceedings of the IDEAS Workshop on Medical Information Systems: The Digital Hospital (2004)

A Web-based and Integrated Hospital Information System(WIHIS), is presented in this paper. WIHIS is a three-tier web-based system and focuses on medical information instead of financial affairs. It is integrated with workflow engine to automatize the management and supervising of medical business process as well as rule engine to separate business rules from program code. It could use XML as integration media and adopt a top-down integration strategy to integrate heterogeneous Electronic Medical Records distributed in different sources.
Didactic design through storyboarding: standard concepts for standard tools
Authors: Klaus P. Jantke, Rainer Knauf
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

The current state of affair in e-learning world-wide shows a reluctance to didactic design. Learners frequently complain and scientists discuss about insufficient adaptivity of e-learning offers to the learners' needs. Didactics is badly underestimated.High quality didactic design is seen as a crucial aspect of dissemination. E-learning content and services need to reach their audience properly. Learners with different prerequisites, with different needs, with different expectations and under varying context conditions have to be addressed appropriately. Didactic design is seen as an issue of quality assurance in e-learning.As well-known from quality management, high quality requirements and related measures towards quality assurance may turn out to be obstacles to dissemination, because quality may turn out to be expensive. The related answer are solutions frequently called quick and dirty. This does apply to e-learning as well.The authors' own storyboard concept is introduced. Its reach goes far beyond the limits of current practices in e-learning systems and service development. The modeling concepts required are standard: annotated graphs. The software in use is standard as well: Visio. Emphasis is put on the investigation of how a suitable usage of the concepts allows for an expressive didactic design.To sum up, the authors' intended contribution is twofold. First, they want to encourage didactic design through storyboarding in e-learning. Concepts are introduced and applications are demonstrated. Second, with the dissemination problem in mind, they want to show that concepts are crucial, but not tools. One can exploit advanced concepts toward sophisticated didactic design without an urgent need for costly software.
BBN PLUM: MUC-3 test results and analysis
Authors: Ralph Weischedel, Damaris Ayuso, Sean Boisen, Robert Ingria, Jeff Palmucci
Venue: Proceedings of the 3rd conference on Message understanding (1991)

Perhaps the most important facts about our participation in MUC-3 reflect our starting point and goals. In March, 1990, we initiated a pilot study on the feasibility and impact of applying statistical algorithms in natural language processing. The experiments were concluded in March, 1991 and lead us to believe that statistical approaches can effectively improve knowledge-based approaches [Weischedel, et al., 1991a, Weischedel, Meteer, and Schwartz, 1991]. Due to nature of that effort, we had focussed on many well-defined algorithm experiments. We did not have a complete message processing system; nor was the pilot study designed to create an application system.
Comparing MUCK-II and MUC-3: assessing the difficulty of different tasks
Authors: Lynette Hirschman
Venue: Proceedings of the 3rd conference on Message understanding (1991)

The natural language community has made impressive progress in evaluation over the last four years. However, as the evaluations become more sophisticated and more ambitious, a fundamental problem emerges: how to compare results across changing evaluation paradigms. When we change domain, task, and scoring procedures, as has been the case from MUCK-I to MUCK-II to MUC-3, we lose comparability of results. This makes it difficult to determine whether the field has made progress since the last evaluation. Part of the success of the MUC conferences has been due to the incremental approach taken to system evaluation. Over the four year period of the three conferences, the domain has become more "realistic", the task has become more ambitious and specified in much greater detail, and the scoring procedures have evolved to provide a largely automated scoring mechanism. This process has been critical to demonstrating the utility of the overall evaluation process. However we still need some way to assess overall progress of the field, and thus we need to compare results and task difficulty of MUC-3 relative to MUCK-II.
Hughes Research Laboratories: description of the Trainable Text Skimmer used for MUC-4
Authors: Stephanie E. August, Charles P. Dolan
Venue: Proceedings of the 4th conference on Message understanding (1992)

The objective of the Hughes Trainable Text Skimmer (TTS) Project is to create text skimming software that: (1) can be easily re-configured for new applications, (2) improves its performance with use, and (3) is fast enough to process several megabytes of text per day. The TTS-MUC4 system is our second full-scale prototype. It is an adaptation of the TTS-MUC3 system [1] [2], which constituted our first-full scale text skimming prototype.