ppxscal/embedding_network huggingface dataset:
Semantic Web Technologies for Information Management within e-Government Services
Authors: Ralf Klischewski, Martti Jeenicke
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

This article examines a case of developing a prototype for an ontology-driven e-government application based on Semantic Web technologies in order to learn more about how to interrelate systems development with the tasks of information and knowledge management related to e-government service provision. The focus of evaluation is set by analyzing the information management challenges specific to the administrative domain and bythe need for taking into account the increased granularity of informational resources and the manifold semantic differences in dealing with those resources.Following the different tasks and problems within the development process the authors identify what appeared to be critical issues: requirements analysis, choice and mastering of Semantic Web technologies, representation of ontology and informational resources, creating interfaces for users and other services. Based on the project analysis, the article concludes by suggesting an agenda for the cooperation of administrative information managers and systems developers as a prerequisite for successful Semantic Web projects in e-government.
Using Hy+ for network management and distributed debugging
Authors: Mariano P. Consens, Masum Z. Hasan, Alberto O. Mendelzon
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

A network manager managing a computer network or a programmer attempting to understand and debug a distributed program both must deal with large volumes of data. Visualization is widely believed to help in these and similar tasks. We contend that visualization is indeed useful, but only if accompanied of the following facilities: abstraction, filtering, and layout control. The Hy+ visualization system and GraphLog query language provide these facilities. They support not just a fixed way of visualizing data, but visualizations that can be specified and manipulated through declarative queries, like data are manipulated in a database. In this paper we show how the Hy+/GraphLog system can be used by network managers or distributed debuggers to meet their information manipulation and visualization goals.With the aid of this system, a network manager can specify network management functions as declarative data manipulation statements (GraphLog queries), for example, to define alerts. The manager can also filter network management information and control the layout and aspect of the resulting visualizations.In the same way, the Hy+/GraphLog system can be used for debugging of distributed and parallel applications by specifying normal or abnormal patterns that the programmer is looking for as declarative GraphLog queries and manipulating the resulting visualizations to understand the behavior of the program.
Shared Simple Virtual Environment: An Object-Oriented Framework for Highly Interactive Group Collaboration
Authors: John M. Linebarger, Christopher D. Janneck, G. Drew Kessler
Venue: Proceedings of the Seventh IEEE International Symposium on Distributed Simulation and Real-Time Applications (2003)

Shared Simple Virtual Environment (SSVE) is an object-oriented software framework designed for object-focused small group collaboration in highly dynamic virtual environments. Comparedto most other collaborative virtual environment systems, SSVE allows a team of six to eight people to collaborate closely on a highly interactive model construction task. SSVE is a "multi-multi" framework¿ multi-user, multi-threaded, multi-platform, and multi-modal. Numerous interaction, awareness and collaboration mechanisms are provided by theramework and by applications that use the framework, including "what you see is what I see," deictic references, and exclusive object access. Several concurrency control mechanisms are also supported through the framework, including those suitable for closely-coupled synchronous collaboration in highly dynamic virtual worlds. In addition, support is provided for emergent group collaboration modes, and a novel user interface widget, the collaboration tree, is introduced to facilitate subgroup formation and integration of task results. In short, SSVE is a framework for the development of applications which explore group collaboration mechanisms in highly-interactive shared virtual environments. A small pilot study that used the framework tovalidate the utility and stability of the framework, as well as to investigate larger issues of group collaboration, is also presented.
Sharc: Managing CPU and Network Bandwidth in Shared Clusters
Authors: Bhuvan Urgaonkar, Prashant Shenoy
Venue: IEEE Transactions on Parallel and Distributed Systems (2004)

Abstract--In this paper, we argue the need for effective resource management mechanisms for sharing resources in commodity clusters. To address this issue, we present the design of Sharc--a system that enables resource sharing among applications in such clusters. Sharc depends on single node resource management mechanisms such as reservations or shares, and extends the benefits of such mechanisms to clustered environments. We present techniques for managing two important resources--CPU and network interface bandwidth--on a cluster-wide basis. Our techniques allow Sharc to 1) support reservation of CPU and network interface bandwidth for distributed applications, 2) dynamically allocate resources based on past usage, and 3) provide performance isolation to applications. Our experimental evaluation has shown that Sharc can scale to 256 node clusters running 100,000 applications. These results demonstrate that Sharc can be an effective approach for sharing resources among competing applications in moderate size clusters.
Client mobility in rendezvous-notify
Authors: Sasu Tarkoma, Jaakko Kangasharju, Kimmo Raatikainen
Venue: Proceedings of the 2nd international workshop on Distributed event-based systems (2003)

Event-based computing is vital for the next generation mobile services and applications that need to meet user requirements irrespective of time and location. The event paradigm is a form of asynchronous one-to-many communication and allows clients to receive information that matches their interests through filtering. Event-based communication is a good candidate for mobile computing, because it is asynchronous and supports disconnected operation. However, user and terminal mobility present problems pertaining to synchronization and delivery that need to be solved. In this paper, we examine and analyze mobility in the Rendezvous-Notify architecture. This event-delivery architecture is based on two server roles: access servers that maintain subscription information and buffered events, and resolution servers that are responsible for event channels and routing events to access servers. Access to event channels is done using a rendezvous mechanism.
A-classification of idempotent functions of many-valued logic
Authors: S. S. Marchenkov
Venue: Discrete Applied Mathematics (2004)

A-closure on the set of functions of many-valued logic is defined as the closure under the operations of superposition and of taking the dual function with respect to a permutation in the alternating group. A-classification of functions of many-valued logic is defined with the use of the A-closure operator. The class Ik of idempotent functions is one of two (for k ≥ 5) and one of four (for k = 4) A-precomplete classes in Pk. Twelve types of standard relations, which are called main, are defined on the set Ek. It is proved that each A-closed class of functions from Ik can be defined by a suitable choice of the main relations.
Some numerical methods for stiff problems
Authors: J. C. Butcher
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

In the modelling of many physical systems, stiff differential equations need to be solved numerically. Because stiff problems require implicit methods, implementation costs are an important consideration in the assessment of contending algorithms. We will consider a number of alternatives to the popular backward difference methods. These standard algorithms are incapable of being both Astable and of order greater than 2 and we therefore focus on multistage methods with special structures to guarantee low implementation costs. High order Runge-Kutta methods suffer the natural disadvantage of high-dimensionality in the algebraic systems required for stage evaluation. This is partly overcome by the use of singly-implicit methods and we will consider how far this approach can be taken. Further developments involve general linear methods and the key to finding good methods within this large family seems to be to restrict attention to methods with inherent Runge-Kutta stability.
A child's eye view of Java
Authors: Julia Dawson, David Coward
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

The tale of Goldilocks and the Three Bears has been used as a scenario for the introduction of fundamental object-oriented programming concepts and their implementation in Java. The rationale for the approach stems from the observation of the innate ability of young children to build abstract models of the world around them. This very natural approach is rarely exploited -- the scenario given develops a virtual world in which students participate physically as well as intellectually.
Decision Support Systems for Improving the Analytic Capacity of Decentralized Routine Health Information Systems in Developing Countries
Authors: Michael Edwards, Theo Lippeveld
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

Routine health information systems in most third world countries are woefully inadequate to provide the information support necessary for planning and management of the health services. According to Neame and Boelen, "The health care environment is bursting with information, but the sector lacks the capacity to find, communicate or use it effectively".1 One of the main reasons for this situation is that routine health information systems in most countries are centrally planned and managed.2 Indicators, data collection instruments, and reporting forms usually have been designed by centrally located epidemiologists, statisticians, and administrators (called data people), withminimal involvement of lower-level line managers and providers of the health services (called action people). The cultural differences between the two groups are often so huge that Dunn speaks of the "two communities metaphor".3 Data processing and analysis are mainly the responsibility of a centrally located office. Complex data transmission and compiling systems slow down the production of feedback in such a way that, by the time a feedback report is received at lower levels, the information is frequently obsolete for decision making. Planners and managers face deadlines and time constraints in their daily decision making. Outdated information, even of high quality, is of low value to them. The main result of this centralization is that information use is weakest at the district level, where the main public health interventions are planned, implemented, and monitored, and at the health unit level, where individual health decisions are made.
Building Citizen Trust through e-Government
Authors: Michael Parent, Christine A. Vandebeek, Andrew C. Gemino
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

The trust of citizens in their governments has gradually eroded. One response by several North American governments has been to introduce e-government, or web-mediated citizen-to-government interaction. This paper tests the extent to which online initiatives have succeeded in increasing trust and external political efficacy in voters. An internet-based survey of 182 Canadian voters shows that using the internet to transact with government has a significantly positive impact on trust and external political efficacy. Interestingly, though the quality of the interaction is important, it is secondary to internal political efficacy in determining Trust levels, and not significant in determining levels of external political efficacy (or perceived government responsiveness). For policy-makers, this suggests e-government efforts might be better-aimed at citizens with high pre-extant levels of trust, rather than in developing better web sites. For researchers, this paper introduces political efficacy as an important determinant of trust as it pertains to e-government.
Cyclone: A High-Performance Cluster-Based Web Server with Socket Cloning
Authors: Yiu-Fai Sit, Cho-Li Wang, Francis Lau
Venue: Cluster Computing (2004)

With the ever-growing web traffic, cluster-based web server is becoming more and more important to the Internet's infrastructure. Making the best use of all the available resources in the cluster to achieve high performance is thus a significant research issue. In this paper, we introduce Cyclone, a cluster-based web server that can achieve nearly optimal throughput. Cyclone makes use of a novel network support mechanism called Socket Cloning (SC), together with the method of hot object replication, to obtain high performance. SC allows an opened socket to be moved efficiently between cluster nodes. With SC, the processing of HTTP requests can be migrated to the node that has a cached copy of the requested document, thus obviating the need for any cache transfer between cluster nodes. To achieve better load balancing, frequently accessed documents (hot objects) are replicated to other cluster nodes. Trace-driven benchmark tests using http_load show that Cyclone outperforms existing approaches and can achieve a throughput of 14575 requests/s (89.5 MBytes/s), which is 98% efficiency of the available network bandwidth, with eight web server nodes.
Fast Compression with a Static Model in High-Order Entropy
Authors: Luca Foschini, Roberto Grossiy, Ankur Guptaz, Jeffrey Scott Vitter
Venue: Proceedings of the Conference on Data Compression (2004)

We report on a simple encoding format called wzip for decompressing block-sorting transforms, such as the Burrows-Wheeler Transform (BWT). Our compressor uses the simple notions of gamma encoding and RLE, organized witha wavelet tree, to achieve a slightly better compression ratio than bzip2 inless time. In fact, our compression/decompression time is dependent on Hh,the hth order empirical entropy. This relationship of performance to the compressibility of data is a key new idea among compression algorithms. Anotherkey contribution of our compressor is its simplicity. Our compressor can alsooperate as a full-text index with a small amount of data, while still preservingbackward compatibility with just the compressor.
On utility of inductive learning in multiobjective robust design
Authors: Babak Forouraghi
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

Most engineering design problems involve optimizing a number of often conflicting performance measures in the presence of multiple constraints. Traditional vector optimization techniques approach these problems by generating a set of Pareto-optimal solutions, where any specific objective can be further improved only at the cost of degrading one or more other objectives. The solutions obtained in this manner, however, are only single points within the space of all possible Pareto-optimal solutions and generally do not indicate to designers how small deviations from predicted design parameters settings affect the performance of the product or the process under study.In this paper we introduce a new approach to robust design based on the concept of inductive learning with regression trees. Given a set of training examples relating to a multiobjective design problem, we demonstrate how a multivariate regression tree can utilize an information-theoretic measure of covariance complexity to capture optimal, tradeoff design surfaces. The novelty of generating design surfaces as opposed to traditional points in the design space is that now designers are able to easily determine how the responses of a product or process vary as design parameters change. This ability is of paramount importance in situations where design parameter settings need to be modified during the lifetime of a product/process due to various economic or operational constraints. As a result, designers will be able to select optimal ranges for design parameters such that the product's performance indices exhibit minimal or tolerable deviations from their target values. To highlight the advantages of our methodology, we present a multiobjective example that deals with optimum design of an electric discharge machining (EDM) process.
The syriac acts of thomas: a computerized grammatical concordance of acts 1 and 2
Authors: Julian V. Hills
Venue:  (2003)

At present there is no concordance to the Syriac Acts of Thomas . The lack of a concordance hobbles research into this early third-century Christian apocryphal acts. A Greek concordance already exists. In order to study the Acts of Thomas with any confidence a concordance is necessary for both the Greek and the Syriac. Research interests in the Acts revolve around a number of areas, including, but not limited to the following: (1) Translation Direction: The question concerning the Acts' original language remains, was it Greek or Syriac? (2) Sacraments: The Acts of Thomas offer insights from early Christianity concerning Baptism and Eucharist. (3) Biblical texts and Translations: The text retains readings which can be classified as belonging to the Old Syriac Gospels and possibly to the Diatesseron. (4) The Thomas Tradition: The Acts are part of the Thomas Tradition. (5) Apocryphal Acts of the Apostles: The Acts are one of the five great apocryphal acts of the apostles. (6) Gender Studies: Women play a crucial part in most of the individual stories which form the Acts. (7) Jewish-Christian Relations: There appear to be connections between some portions of the Acts and portions of the Talmud. None of these areas of research can be fully undertaken without a concordance to the Syriac Acts of Thomas. To this end, I have automated the Syriac text of the Acts of Thomas as found in the 1871 William Wright edition of the British Museum manuscript additional 14,645. I have developed a concordance which emphasizes automation and grammatical classification of the text. My aim is two-fold, to offer a grammatical concordance to Acts 1 and 2, and to exploit modern word processing software to be able to conduct this research without having to take courses in computer programming. Acts 1 and 2 circulated separately from the entire thirteen act version, so a concordance to those two acts will be immediately useful for research on the Acts of Thomas.
SubCALM: A Program for Hierarchical Substrate Coupling Simulation on Floorplan Level
Authors: Thomas Brandtner, Robert Weigel
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

The hierarchical substrate coupling simulation tool Sub-CALM offers the opportunity to estimate substrate coupling on floorplan level. A novel approach for modeling well and SOI structures in a boundary element description is introduced. Several acceleration techniques like precalculated macromodels and sophisticated preconditioning algorithms are presented which are applied to an O(n)-conjugate-gradient Poisson solver in order to be able to process large full-chip layouts during floorplanning.
The Increasing Need for Integrating Simulation and Collaboration to Support Change Management Programs
Authors: Mariëlle den Hengst, Vlatka Hlupic, Wendy L. Currie
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

Integrating simulation and collaboration to support change management programs is not yet an often used practice. Both simulation and collaboration are said to have added value for change management programs, yet their integration is fairly new. We identify the need forintegrating simulation and collaboration for four different change management programs: TQM, JIT, BPR, and PI. It appears that the need for integration for the newer approaches (BPR and PI) is greater than for older approaches (TQM and JIT). This finding is supported by two case studies, one focusing on TQM/JIT and one focusing on BPR/PI. The case studies furthermore show that integration is difficult because of the lack of proper support tools.
A New Approach to Object-Oriented Middleware
Authors: Michi Henning
Venue: IEEE Internet Computing (2004)

Ice is a new object-oriented middleware platform that allows developers to build distributed client-server applications with minimal effort. This article discusses design decisions, contrasts the Corba and Ice approaches, and outlines Ice's advantages.
A new histogram method for sparse attributes: the averaged rectangular attribute cardinality map
Authors: B. John Oommen, Jing Chen
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Most current Database Management Systems (DBMS) use histograms in their query optimization, and in approximating query result sizes. This is because they can be utilized in determining efficient query evaluation plans. All the existing methods perform poorly when the attributes of a relation are very sparsely distributed, also called the "sparse data cases". These cases are the worst-cases scenarios for attributes with skewed distributions. In this paper, we propose a novel histogram-based algorithm, namely the Averaged Rectangular Attribute Cardinality Map (Averaged R-ACM), and demonstrate its performance in estimating query result sizes for the sparse data cases. Our proposed algorithm combines the advantages of the traditional widely-used histogram-based algorithm, namely the Equi-width histogram, and a relatively new algorithm, namely the R-ACM2 introduced in [Thi99]. The goals of compacting the sparse data distribution and of obtaining accurate estimates of query result sizes are achieved by utilizing this algorithm. The superiority of this algorithm is also validated by an extensive set of experiments. And the entire set of experimental results obtained by integrating the underlying algorithm and other histogram-based algorithms into the ORACLE query optimizer can be found in [Che03].