ppxscal/embedding_network huggingface dataset:
QoS multi-agent applied for Grid Service management
Authors: Montree Bunruangses, Weerawat Poompattanapong, Pratheep Banyatnoparat, Banjong Piyatamrong
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

Grid computing technologies are adopted to enable wide-spread sharing and coordinated use of network resources. Grid Service is a part of Grid infrastructure enables the integration of service across distributed resources based on Service-Oriented architecture. In particular, the Open Grid Service Architecture, the new Grid Service model based on Web Service technologies, has been proposed for providing fundamental mechanisms for discovery, monitoring, planning and adapting application behavior. In many kinds of distributed computing, software agents are expected to play an increasing important role for improving performance such as scalability and availability. This paper presents the quality of service (QoS) for multi-agent system, which the concept of agent is applied to Web service technologies. An agent-based hierarchical model is developed to meet the requirement of scalability. The purpose of this model is to improve the performance of the Service Grid system based on Web Service environment by used Multi-process algorithm priority of service.
QoS-UniFrame: A Petri Net-Based Modeling Approach to Assure QoS Requirements of Distributed Real-Time and Embedded Systems
Authors: Shih-Hsi Liu, Barrett R. Bryant, Jeffrey G. Gray, Rajeev R. Raje, Andrew M. Olson, Mikhail Auguston
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Assuring quality of service (QoS) requirements is critical when assembling a distributed real-time and embedded (DRE) system from a repository of existing components. This paper presents a two-level approach for assuring satisfaction of QoS requirements in the context of a reduced design space for DRE systems. A dynamic and parallel approach is introduced to prune off the infeasible design spaces at the first level. Evolutionary algorithms cooperating with a domain-specific scripting language then discard less probable design spaces using statistics. These techniques fulfill the collective objectives of pruning and assuring the design space at system assembly time.
Deep Store: An Archival Storage System Architecture
Authors: Lawrence L. You, Kristal T. Pollack, Darrell D. E. Long
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

We present the Deep Store archival storage architecture, a large-scale storage system that stores immutable dataefficiently and reliably for long periods of time. Archived data is stored across a cluster of nodes and recorded to hard disk. The design differentiates itself from traditional file systems by eliminating redundancy within and across files, distributing content for scalability, associating rich metadata with content, and using variable levels of replication based on the importance or degree of dependency of each piece of stored data. We evaluate the foundations of our design, including PRESIDIO, a virtual content-addressable storage framework with multiple methods for inter-file and intra-file compression that effectively addresses the data-dependent variability of data compression. We measure content and metadata storage efficiency, demonstrate the need for a variable-degree replication model, and provide preliminary results for storage performance.
Type Annotations to Improve Stack-Based Access Control
Authors: Tian Zhao, John Boyland
Venue: Proceedings of the 18th IEEE workshop on Computer Security Foundations (2005)

Java security architecture uses stack-based access control to protect security-sensitive resources. The architecture implements access control checks by inspecting the call stack to compute permission levels, which are used to decide whether to grant access to these resources. This implementation only considers the direct and indirect callers of sensitive methods that directly accesses the resources. However, it does not check the integrity of the variables used in the calls to these methods, nor does it help protect confidential values that might be returned by these calls. This paper proposes a type-based approach to strengthen stack-based access control. We use type annotations to track values originated from untrusted code such that these values will not be inputs to the sensitive methods when they are executed with high level of trust. We also use the annotations to protect confidential values from being accidentally revealed by trusted code. We give a static type system that checks these properties and augments existing dynamic stack-based checks. The hybrid approach is similar to so-called "history-based access control" without its run-time burden.
Supporting Information Management for Regional Health Information Systems by Models with Communication Path Analysis
Authors: Alfred Winter, Birgit Brigl, Oliver Heller, Ulrike Mueller, Alexander Struebing, Thomas Wendt
Venue: Proceedings of the IDEAS Workshop on Medical Information Systems: The Digital Hospital (2004)

The focus in healthcare has been changed from isolated procedures in a single healthcare institution to the patientoriented care process spreading over institutional boundaries. So interest shifts from hospital information systems (HIS) to regional health information systems (rHIS). More than with HIS an rHIS needs systematic information management. We present the 3LGM² meta-model and the corresponding 3LGM² tool to support information managers in health care regions. Every sequence of enterprise function, i.e. an information process, needs certain communication paths between those application components supporting the functions. The search for appropriate communication paths within a rHIS model is interpreted as allpairs shortest-paths problem which is solved using the Floyd-Warshall algorithm. Method and tool has been applied successfully in the setting of the SAXTELEMED project in Saxony, Germany.
The two sides of ROI: return on investment vs. risk of incarceration
Authors: Hal Berghel
Venue: Communications of the ACM (2005)

Legislative mandates potentially replace CIO's primary concerns of technology risk management with the possibility of serving jail time.
Modeling and Simulation of Traffic Aggregation Based SIP over MPLS Network Architecture
Authors: Bo Rong, Jacques Lebeau, Maria Bennani, Michel Kadoch, Ahmed K. Elhakeem
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

In this paper, a traffic aggregation based SIP over MPLS network architecture is proposed to integrate SIP protocol with traffic engineering (TE) enabled MPLS network seamlessly and speed up the SIP call setup. We rely on OPNET simulation to assess the performance of this new network architecture. As a highlighted part, basic design concepts and implementation details of the simulation model are depicted intensively. The simulation results show that traffic aggregation based SIP over MPLS network architecture has satisfying performance in terms of SIP call setup delay, call blocking probability, and bandwidth utility efficiency.
Schottky barrier formation at Al/TiB2/TiSi2/Si and Cu/TiB2/TiSi2/Si interfaces
Authors: Joshua Pelleg
Venue: Microelectronic Engineering (2004)

Diffusion barriers between Al or Cu and Si are indispensable in order to prevent contact deterioration. TiB"2, in conjunction with a TiSi"2 underlayer, was recently considered as a promising diffusion barrier. The Schottky barrier characteristics of Al/TiB"2/TiSi"2/Si and Cu/TiB"2/TiSi"2/Si were evaluated by room temperature I-V measurements. Zero-bias barrier heights of as deposited and annealed Al/TiB"2/TiSi"2/Si, were in the range of 0.55-0.59 V for specimens annealed at 300-723 K, whereas for specimens annealed at 773 and 748 K the room temperature values were 0.52 and 0.53 V, respectively. The room temperature barrier heights of Cu/TiB"2/TiSi"2/Si (when the TiSi"2 is amorphous) were higher, in the range of 0.65-0.68 V at the annealing temperature interval of 300-723 K, while at 773 and 873 K values of 0.56 and 0.58 V were obtained, respectively.
A characterization of broadband user behavior and their e-business activities
Authors: Humberto T. Marques Neto, Jussara M. Almeida, Leonardo C. D. Rocha, Wagner Meira, Pedro H. C. Guerra, Virgilio A. F. Almeida
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

This paper presents a characterization of broadband user behavior from an Internet Service Provider standpoint. Users are broken into two major categories: residential and Small-Office/Home-Office (SOHO). For each user category, the characterization is performed along four criteria: (i) session arrival process, (ii) session duration, (iii) number of bytes transferred within a session and (iv) user request patterns.Our results show that both residential and SOHO session inter-arrival times are exponentially distributed. Whereas residential session arrival rates remain relatively high during the day, SOHO session arrival rates vary much more significantly during the day. On the other hand, a typical SOHO user session is longer and transfers a larger volume of data. Furthermore, our analysis uncovers two main groups of session request patterns within each user category. The first group consists of user sessions that use traditional Internet services, such as e-mail, instant messenger and, mostly, www services. On the other hand, sessions from the second group, a smaller group, use typically peer-to-peer file sharing applications, remain active for longer periods and transfer a large amount of data. Looking further into the e-business services most commonly accessed, we found that subscription-based and advertising services account for the vast majority of user HTTP requests in both residential and SOHO workloads. Understanding these user behavior patterns is important to the development of more efficient applications for broadband users.
Model Selection for Regularized Least-Squares Algorithm in Learning Theory
Authors: E. De Vito, A. Caponnetto, L. Rosasco
Venue: Foundations of Computational Mathematics (2005)

We investigate the problem of model selection for learning algorithms depending on a continuous parameter. We propose a model selection procedure based on a worst-case analysis and on a data-independent choice of the parameter. For the regularized least-squares algorithm we bound the generalization error of the solution by a quantity depending on a few known constants and we show that the corresponding model selection procedure reduces to solving a bias-variance problem. Under suitable smoothness conditions on the regression function, we estimate the optimal parameter as a function of the number of data and we prove that this choice ensures consistency of the algorithm.
Computation in Noisy Radio Networks
Authors: Eyal Kushilevitz, Yishay Mansour
Venue: SIAM Journal on Discrete Mathematics (2005)

In this paper, we examine noisy radio (broadcast) networks in which every bit transmitted has a certain probability of being flipped. Each processor has some initial input bit, and the goal is to compute a function of these input bits. In this model, we show a protocol to compute any threshold function using only a linear number of transmissions.
A publish and subscribe collaboration architecture for web-based information
Authors: M. Brian Blake, David H. Fado, Gregory A. Mack
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Markup languages, representations, schemas, and tools have significantly increased the ability for organizations to share their information. Languages, such as the Extensible Markup Language (XML), provide a vehicle for organizations to represent information in a common, machine-interpretable format. Although these approaches facilitate the collaboration and integration of inter-organizational information, the reality is that the schema representations behind these languages are reasonably difficult to learn, and automated schema integration (without semantics or ontology mappings) is currently an open problem. In this paper, we introduce an architecture and service-oriented infrastructure to facilitate organizational collaboration that combines the push features of the publish/subscribe protocol with storage of distributed registry capabilities.
Convergence Properties of a Conditional ε-Subgradient Method Applied to Linear Programs
Authors: Sergei V. Rzhevskii
Venue: Computational Optimization and Applications (2005)

We propose a new conditional ¿-subgradient method intended for solving general convex programs, Convergence properties of the method are investigated. It is proved that for a linear program with a compact set of solutions, the method generates a sequence of feasible approximations whose objective function values converge to the optimal value at a rate that is at least linear.
Maran Illustrated Computers Guided Tour
Authors: Ruth Maran
Venue:  (2005)

Coverage includes- Features a unique two-page spread, over 80 topics, dynamic illustrations, and useful tips that appeal to and engage visual learners and simplify the learning process. Provides extensive coverage of all of the latest technologies and trends in the world of computers, including Bluetooth, wi-fi networking, blogs, DVD burners, USB flash drives, and media devices including MP3 players, digital cameras, and camcorders, making it a great reference for all skill levels. maranGraphics trademark "Diskman" character provides a guided tour of each topic, making even the most challenging subjects fun and approachable Written using "Visual Grammar," a proven method that combines instructions with full-color screen shots to provide the best synergistic learning experience available.
EMPS: An Environment for Memory Performance Studies
Authors: Jeffrey K. Hollingsworth, Allan Snavely, Simone Sbaraglia, K. Ekanadham
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11 (2005)

This paper describes an overview of Environment for Memory Performance Studies (EMPS). EMPS is a framework to allow different data gathering and simulation tools to be composed together to predict the performance of parallel programs on a variety of current and future High End Computing (HEC) systems. The framework seeks to combine the automated nature of direct execution simulation with the predictive capabilities of performance modeling.
Proposing new metrics to evaluate web usability for the blind
Authors: Kentarou Fukuda, Shin Saito, Hironobu Takagi, Chieko Asakawa
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Accessibility-related regulations and guidelines are contributing to the steady improvement of Web accessibility. There are various accessibility evaluation tools, and they also help Web authors make their pages compliant with guidelines. As a result, an increasing number of Web pages are compliant with the evaluation tools. These days, however, blind people face the serious problem that reading Web pages is quite difficult. Improvements in information density by using visual effects such as two-dimensional layouts are making it difficult for blind people to understand the page structure. Also, inappropriate alternative texts mislead or confuse blind users.In this paper, to evaluate these kinds of usability problems, we introduce two metrics: navigability and listenability. Navigability evaluates how well structured the Web content is by using headings, intra-page links, labels, etc. Listenability denotes how appropriate the alternative texts are. By using these metrics, we summarize the historical transition of Web usability for blind people.
Assurance patterns for distributed real-time embedded systems
Authors: Sascha Konrad
Venue: Proceedings of the 27th international conference on Software engineering (2005)

No abstract available
Towards a High-Resolution Global Coupled Navy Prediction System
Authors: Julie L. McClean, Prasad Thoppil, Detelina Ivanova, Donald Stark, Mathew Maltrud, Elizabeth Hunke, Paul May, James Carton, Benjamin Giese
Venue: Proceedings of the 2004 Users Group Conference (2004)

A computational project is underway to bring about the realization of a high-resolution global coupled atmosphere/ocean/ice prediction system for Navy meteorological and oceanographic forecasting. A fully coupled near-global ocean/atmosphere prediction system has been constructed using resolutions of 0.75° in the atmosphere and 0.5° in the ocean (eddy-permitting) at the Naval Research Laboratory at Monterey (NRL-MRY). The system consists of the Navy Operational Global Atmospheric System (NOGAPS) that incorporates the NRL Atmospheric Variational Data Assimilation Scheme (NAVDAS), the Los Alamos National Laboratory Parallel Ocean Program (POP), and the Navy Coupled Ocean Data Assimilation (NCODA), an optimal interpolation scheme.
Decision Tree Construction for Data Mining on Grid Computing Environments
Authors: Chao-Tung Yang, Shu-Tzu Tsai, Kuan-Ching Li
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In this paper, we present our Grid-based decision tree architecture, with the intention of applying it to both parallel and sequential algorithms. Also, we show that, based on the scope and model of data mining applied in the Grid environment as well as user equivalent perspective, Grid roles can be categorized into three types. It is our goal, through these definitions, to help software developers define clear system processes and differentiate the application scope for software applications. To fulfill our architecture, we first apply an existing parallel decision tree algorithm (the SPRINT algorithm) to the Grid environment. The performance and differences in many other areas are compared using datasets of different sizes. The experimental results will be used for future reference and further development.
Dual-transition glitch filtering in probabilistic waveform power estimation
Authors: Fei Hu, Vishwani D. Agrawal
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

Existing gate-level probabilistic approaches to power estimation fail to accurately model the glitch filtering by inertial delays. This effect has an impact on the power dissipation of a circuit and should not be neglected, especially for dynamic power estimation of circuits with dynamic power optimization. We propose a new glitch filtering analysis using the dual-transition probability that captures the states of a node at two different time instances. Experiments show that probabilistic simulation and the tagged probability simulation (TPS) techniques, when enhanced by the dual-transition analysis, provide more consistent power estimation. For circuits with a large component of glitch power, up to 29% improvement in the estimation accuracy is obtained.
An innate immune system for the protection of computer networks
Authors: Anastasia Pagnoni, Andrea Visconti
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

This paper presents design, implementation, and testing of NAIS, an artificial immune system for the protection of computer networks. Inspired by the biological innate immune system, NAIS consists of a collection of digital macrophages that scan the network for dangerous non-self processes, and kill them. NAIS is based on the observation that all significant network attacks are preceded by preparatory small-scale intrusions meant to gather the necessary information --- information on servers and operating systems, logins, weak passwords, ill-installed or poorly maintained services, etc. This information is used to bypass the network's defense barriers --- access controls, firewalls --- and to gain access to the machine before it is attacked. Such preparatory intrusions do not generate new processes, however the subsequent, actual intrusion will. Such processes will be recognized as non-self by the digital macrophages run by NAIS, and killed right away, thus defusing the attack. Telling illegal new processes from legal ones is a difficult matter, and amounts to providing a strong definition of non-self process. Our testing of NAIS proved our definition to be quite effective in protecting networks of one-service computers.
Nondeterministic Queries in a Relational Grid Information Service
Authors: Peter A. Dinda, Dong Lu
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

A Grid Information Service (GIS) stores information about the resources of a distributed computing environment and answers questions about it. We are developing RGIS, a GIS system based on the relational data model. RGIS users can write SQL queries that search for complex compositions of resources that meet collective requirements. Executing these queries can be very expensive, however. In response, we introduce the nondeterministic query, an extension to the SELECT statement, which allows the user (and RGIS) to trade off between the query's running time and the number of results. The results are a random sample of the deterministic results, which we argue is sufficient and appropriate. Herein we describe RGIS, the nondeterministic query extension, and its implementation. Our evaluation shows that a meaningful tradeoff between query time and results returned is achievable, and that the tradeoff can be used to keep query time largely independent of query complexity.
Robotic Hand-Eye Coordination: From Observation to Manipulation
Authors: Shahram Jafari, Ray Jarvis
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

In this paper, we present a new hybrid method of performing eye-to-hand coordination and manipulation to produce a working robot named COERSU. The method is an optimized combination of two neuro-fuzzy approaches developed by the authors: direct fuzzy servoing and fuzzy correction. The fuzzy methods are tuned by an Adaptive Neuro-Fuzzy Inference System (ANFIS). On the whole, a genetic tuner and two neuro-fuzzy networks contribute to find the final optimum position of the robotic tooltip in order to grasp the target. Experimental results from COERSU in a table-top scenario to manipulate some soft objects (e.g. fruit/egg) also validate the method.
A formal knowledge management ontology: Conduct, activities, resources, and influences: Research Articles
Authors: C. W. Holsapple, K. D. Joshi
Venue: Journal of the American Society for Information Science and Technology (2004)

This article describes a collaboratively engineered general-purpose knowledge management (KM) ontology that can be used by practitioners, researchers, and educators. The ontology is formally characterized in terms of nearly one hundred definitions and axioms that evolved from a Delphi-like process involving a diverse panel of over 30 KM practitioners and researchers. The ontology identifies and relates knowledge manipulation activities that an entity (e.g., an organization) can perform to operate on knowledge resources. It introduces a taxonomy for these resources, which indicates classes of knowledge that may be stored, embedded, and&sol;or represented in an entity. It recognizes factors that influence the conduct of KM both within and across KM episodes. The Delphi panelists judge the ontology favorably overall: its ability to unify KM concepts, its comprehensiveness, and utility. Moreover, various implications of the ontology for the KM field are examined as indicators of its utility for practitioners, educators, and researchers. &copy; 2005 Wiley Periodicals, Inc.