ppxscal/embedding_network huggingface dataset:
XML in Easy Steps
Authors: Mike McGrath
Venue:  (2003)

XML In Easy Steps instructs the reader how to create valid, well-formed, XML documents to describe a variety of data. It contains separate chapters on all major features of the eXtensible Markup Language (XML), together with the associated technologies of Document Type Definition (DTD), XMLSchema, eXtensible Stylesheet Language (XSL), XPath, XLink, and XPointer, There are code examples and browser screenshots that illustrate how that example might appear when viewed in a web browser. XML In Easy Steps begins by examining the evolution of XML then explains the basic structure of an XML document. The book describes how to define rules for each XML element-first using the traditional DTD method, then using the newer XMLSchema language. Examples show how each element node of an XML document can be addressed individually using the XPath language. There are demonstrations of how to format the appearance of XML documents in a web browser-with both eXtensible Stylesheet Language (XSL) rules and with Cascading Stylesheet (CSS) rules. The final chapter creates a complete working XML application to illustrate the XML Document Object Model (DOM). The reader need have no previous knowledge of any markup language so it's ideal for the newcomer to XML. Each chapter builds the reader's knowledge of XML. By the end of this book the reader will have gained a sound understanding of XML and be able to create their own schemas and XML data documents. XML In Easy Steps has an easy-to-follow style that will appeal to anyone who wants to begin using XML. It will appeal to programmers who want to quickly add XML to their skills set, and to the student who is studying website design, and to those seeking a career in web development who need an understanding of XML. And, all at a value-price!
A knowledge-based system integrated with numerical analysis tools for aircraft life-cycle design
Authors: William J. Marx, Dimitri N. Mavris, Daniel P. Schrage
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

An integrated design and manufacturing approach allows economic decisions to be made that reflect an entire system design as a whole. To achieve this objective, we have developed and utilized integrated cost and engineering models within a focused design perspective. A framework for the integrated design of an aircraft system with a combined performance and economic perspective is described in this article. This framework is based on the concept of Design Justification using a Design-for-Economics approach. We have developed a knowledge-based system that can be used to evaluate aircraft structural concept material and process selections. The framework consists of the knowledge-based system, integrated with numerical analysis tools including an aircraft performance/sizing code and a life-cycle cost analysis code. Production cost estimates are applied for evaluation of process trades at the subcomponent level of design. Life-cycle cost estimates are used for evaluation of process trades at the system level. Results of a case study are presented for several advanced wing structural concepts for a future supersonic commercial transport aircraft. Cost versus performance studies indicate that a high-speed civil transport aircraft with a hybrid wing structural concept, though more expensive to manufacture than some homogeneous concepts, can have lower direct operating costs due to a lower take-off gross weight and less mission fuel required.
On the approximability of clique and related maximization problems
Authors: Aravind Srinivasan
Venue: Journal of Computer and System Sciences (2003)

We consider approximations of the form n1-o(1) for the Maximum Clique problem, where n is the number of vertices in the input graph and where the "o(1)" term goes to zero as n increases. We show that sufficiently strong negative results for such problems, which we call strong inapproximability results, have interesting consequences for exact computation. A simple sampling method underlies most of our results.
Web Intelligence for Business Coalition Operations
Authors: Alexander Smirnov, Mikhail Pashkin, Nikolai Chilov, Tatiana Levashova
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

E-Business requires cooperation and open standard-based information/knowledge exchange between all the participants of global business information environment (e-Business environment) in real-time. Scientific direction of knowledge logistics addresses this problem. This direction is closely related with a new direction for research and development in ArtificialIntelligence and Information Technology areas "Web intelligence". The paper describes an approach addressing the knowledge logistics problem in regard to Web intelligence. The paper discusses main principles underlying the approach, describes the system "KSNet" based on the approach, and presents an application of the approach to a case study inspired by a coalition-based Binni scenario.
Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients
Authors: James Oxley, Dominic Welsh
Venue: Combinatorics, Probability and Computing (2002)

We study the complexity of computing the coefficients of three classical polynomials, namely the chromatic, flow and reliability polynomials of a graph. Each of these is a specialization of the Tutte polynomial &Sigma;tijxiyj. It is shown that, unless NP = RP, many of the relevant coefficients do not even have good randomized approximation schemes. We consider the quasi-order induced by approximation reducibility and highlight the pivotal position of the coefficient t10 = t01, otherwise known as the beta invariant.Our nonapproximability results are obtained by showing that various decision problems based on the coefficients are NP-hard. A study of such predicates shows a significant difference between the case of graphs, where, by Robertson&ndash;Seymour theory, they are computable in polynomial time, and the case of matrices over finite fields, where they are shown to be NP-hard.
Dealing efficiently with data-center disasters
Authors: Svend Frølund, Fernando Pedone
Venue: Journal of Parallel and Distributed Computing (2003)

In disaster-resilient systems, wide-area networks play the dual roles of solution and problem. They allow systems to survive disasters because different parts of a system can be located in geographically dispersed locations. They present a problem since communication of disaster-recovery information along wide-area links has high latency. The challenge is to continuously send disaster-recovery information to backup data centers without seriously degrading the on-line response time of the primary data center. We present a disaster-resilient, atomic broadcast algorithm that meets this challenge.One key to achieving disaster resilience at a reasonable cost is to define an atomic broadcast abstraction that is tailored to the multi-data-center setting. Unlike traditional atomic broadcast abstractions, our hierarchical atomic broadcast (HABcast) abstraction gives different delivery guarantees to processes in different data centers. The HABcast properties reflect the fact that only the processes in the primary data center are online (i.e., connected to clients). Roughly speaking, because processes in a backup data center do not interact with external entities, we can give them weaker delivery guarantees without compromising the overall reliability of the system.Another key to practical disaster resilience is for algorithms to exploit the underlying fail-over mechanism between data centers. The fail-over to a backup data center is initiated by human operators, so-called "push-button" switch-over. Because the fail-over decision is made by a human operator, the system itself does not have to guard against false disaster suspicions, and can thus be more efficient.Our HABcast algorithm exploits the above aspects of disaster-resilient systems. Basically, the algorithm overlays a primary-backup scheme on top of a per-data-center atomic algorithm that broadcasts messages within a single data center. This combination presents some unique challenges, such as handling the simultaneous occurrence of failures and disasters, and preventing the plurality of processes within a single data center from resulting in a plurality of messages being communicated between data centers.
Price Dispersion and Differentiation in Online Travel: An Empirical Investigation
Authors: Eric K. Clemons, Il-Horn Hann, Lorin M. Hitt
Venue: Management Science (2002)

Previous research has examined whether price dispersion exists in theoretically highly efficient Internet markets. However, much of the previous work has been focused on industries with low cost and undifferentiated products. In this paper, we examine the presence of price dispersion and product differentiation using data on the airline ticket offerings of online travel agents (OTAs). We find that different OTAs offer tickets with substantially different prices and characteristics when given the same customer request. Some of this variation appears to be due to product differentiation--different OTAs specialize by systematically offering different trade-offs between ticket price and ticket quality (minimizing the number of connections, matching requested departure and return time). However, even after accounting for differences in ticket quality, ticket prices vary by as much as 18% across OTAs. In addition, OTAs return tickets that are strictly inferior to the ticket offered by another OTA for the same request between 2.2% and 28% of the time. Overall, this suggests the presence of both price dispersion and product differentiation in the online travel market.
Distance Associativity for High-Performance Energy-Efficient Non-Uniform Cache Architectures
Authors: Zeshan Chishti, Michael D. Powell, T. N. Vijaykumar
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

Wire delays continue to grow as the dominant component oflatency for large caches.A recent work proposed an adaptive,non-uniform cache architecture (NUCA) to manage large, on-chipcaches.By exploiting the variation in access time acrosswidely-spaced subarrays, NUCA allows fast access to closesubarrays while retaining slow access to far subarrays.Whilethe idea of NUCA is attractive, NUCA does not employ designchoices commonly used in large caches, such as sequential tag-dataaccess for low power.Moreover, NUCA couples dataplacement with tag placement foregoing the flexibility of dataplacement and replacement that is possible in a non-uniformaccess cache.Consequently, NUCA can place only a few blockswithin a given cache set in the fastest subarrays, and mustemploy a high-bandwidth switched network to swap blockswithin the cache for high performance.In this paper, we proposethe Non-uniform access with Replacement And PlacementusIng Distance associativity" cache, or NuRAPID, whichleverages sequential tag-data access to decouple data placementfrom tag placement.Distance associativity, the placementof data at a certain distance (and latency), is separated from setassociativity, the placement of tags within a set.This decouplingenables NuRAPID to place flexibly the vast majority offrequently-accessed data in the fastest subarrays, with fewerswaps than NUCA.Distance associativity fundamentallychanges the trade-offs made by NUCA's best-performingdesign, resulting in higher performance and substantiallylower cache energy.A one-ported, non-banked NuRAPIDcache improves performance by 3% on average and up to 15%compared to a multi-banked NUCA with an infinite-bandwidthswitched network, while reducing L2 cache energy by 77%.
Security protocols for 2G and 3G wireless communications
Authors: T. Newe, T. Coffey
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Wireless communications are being driven by the need for providing network access to mobile or nomadic computing devices. The need for wireless access to a network is evident in current work environments. A number of new protocols have been recently published with the goal of providing both privacy of data and authentication of users for mobile systems. Such protocols can employ private-key and/or public key cryptographic algorithms. Publickey algorithms hold the promise of simplifying the network infrastructure required to provide security services such as: privacy, authentication and non-repudiation, while symmetric algorithms require less processing power on the mobile device.In this paper a selection of protocols are reviewed and they are broadly divided into two categories: second generation and third generation protocols. A summary of the capabilities and services provided by each protocol is then provided.
Hardware Support for Priority Inheritance
Authors: Bilge E. S. Akgul, Vincent J. Mooney III, Henrik Thane, Pramote Kuacharoen
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

Previous work has shown that a system-on-a-chip lockcache (SoCLC) reduces on-chip memory traffic, providesa fair and fast lock hand-off, simplifies software, increasesthe real-time predictability of the system and improvesperformance. In this research work, we extendthe SoCLC mechanism with a priority inheritance supportimplemented in hardware. Priority inheritance providesa higher level of real-time guarantees for synchronizingapplication tasks. Experimental results indicate thatour SoCLC hardware mechanism with priority inheritanceachieves a 36% speedup in lock delay, 88% speedup in locklatency and 15% speedup in the overall execution time whencompared to its software counterpart. The cost in terms ofadditional hardware area for the SoCLC with priority inheritanceis approximately 10,000 NAND2 gates.
An Approach to Data Visualization and Interpretation for Sensor Networks
Authors: Fengxian Fan, Edoardo S. Biagioni
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

With the increase in applications for sensor networks, data manipulation and representation have become a crucial component of sensor networks. This paper explores an approach to process and interpret the data gathered by sensor networks. We have built sensor networks which consist of a series of sensor and communication units ("pods") deployed to monitor rareplants or other endangered species. The environmental data, such as temperature, rainfall, and sunlight, around the plants are sent by the wireless sensor networks to a base station which is able to access the Internet. The approach presented in this paper combines database management technology, geographic information system and Web development technology to visualize the data gathered by the wireless sensor networks. The resulting maps created by a GIS system, GRASS, connect the environmental data with the pods' geographic positions obtained from GPS (the Global Positioning System). Voronoi Diagrams are used to partition the map into areas holding different weather attributes based on the data collected by the pods. The Web development technology -- dynamic Web programming -- is also adopted in this system to make the data available via the Internet. Finally, we sketch the design of an asynchronous collaborative discussion environment which supports online communities among the end users of our information interpretation system. The integration of our data visualization tools and the online collaborative discussion environment makes the system useful to different communities of potential users.
Model Stability: A key factor in determining whether an algorithm produces an optimal model from a matching distribution
Authors: Kai Ming Ting, Regina Jing Ying Quek
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

This paper investigates the factors leading to producingsuboptimal models when training and test class distributions(or misclassification costs) are matched. Our resultshows that model stability plays a key role in determiningwhether the algorithm produces an optimal modelfrom a matching distribution (cost). The performance differencebetween a model trained from the matching distribution(cost) and the optimal model generally increases asthe degree of model stability decreases. The practical implicationof our result is that one should only follow theconventional wisdom of using a training class distribution(cost) that matches the test class distribution (cost) to traina classifier if the learning algorithm is known to be stable.
Using Organizational Modeling to Evaluate Health Care IS/IT Projects
Authors: André Vasconcelos, Ricardo Mendes, José Tribolet
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

This paper presents a research project that aims at creating a methodology for evaluating IS/IT Projects in the Portuguese Health Care System. This project is being jointly developed by the Center for Organizational Engineering and a task force from Saúde XXI, the Portuguese Health Operational Program. In order to create a framework on which to base project evaluation, the project team developed a model of the Portuguese Health System, using the CEO Framework. The CEO Framework is an UML-based organizational modeling framework that uses business process and information systems modeling techniques to represent, monitor and simulate organizational behavior. The model created reflects the reality of the Portuguese Health Care System, including the entities involved, the inter and intra-organizational processes that are executed, the current Information Systems Architecture and the in force Information Systems Strategy. Based on the created Organizational Model, the project team created a tool that facilitates the evaluation of IS/IT projects, by measuring (1) the support to the current processes; (2) the conformance to the IS Architecture and Strategy; (3) the relation with other past or current projects. This paper describes the organizational modeling process that was executed, the developed evaluation methodologies and tools, and the preliminary results regarding ongoing project evaluation.
Controlling chaos in a chaotic neural network
Authors: Guoguang He, Zhitong Cao, Ping Zhu, Hisakazu Ogura
Venue: Neural Networks (2003)

The chaotic neural network constructed with chaotic neuron shows the associative memory function, but its memory searching process cannot be stabilized in a stored state because of the chaotic motion of the network. In this paper, a pinning control method focused on the chaotic neural network is proposed. The computer simulation proves that the chaos in the chaotic neural network can be controlled with this method and the states of the network can converge in one of its stored patterns if the control strength and the pinning density are chosen suitable. It is found that in general the threshold of the control strength of a controlled network is smaller at higher pinned density and the chaos of the chaotic neural network can be controlled more easily if the pinning control is added to the variant neurons between the initial pattern and the target pattern.
FastScript3D: a JavaScript companion to Java3D
Authors: Patti Koenig Koehler
Venue: ACM SIGGRAPH 2003 Web Graphics (2003)

FastScript3D is a web-friendly companion to Java3D that makes it easy to get started using Java3D via JavaScript and HTML. The FastScript3D web site shows how you can create Java3D web content without having to be an experienced Java3D programmer.
OOHDM-Web: an environment for implementation of hypermedia applications in the WWW
Authors: Daniel Schwabe, Rita de Almeida Pontes, Isbela Moura
Venue: ACM SIGWEB Newsletter (1999)

This paper shows an environment, OOHDM-Web, that allows template driven website for applications designed using, OOHDM.. We show how this environment allows direct mapping of navigation and interface constructs of OOHDM into a library of functions in the CGI scripting environment CGI-LUA, extended with the DB-LUA package. OOHDM-Web allows implementation of hypermedia applications as CGI scripts that produce dynamically generated pages, whose contents are fed from a database and integrated with pre-defined templates. The paper presents the advantages of combining the two techniques, template-driven implementations and design methods, reaping benefits of their respective stregths.
Web Access to Large Audiovisual Assets Based on User Preferences
Authors: K. Karpouzis, G. Moschovitis, K. Ntalianis, S. Ioannou, S. Kollias
Venue: Multimedia Tools and Applications (2004)

Current multimedia databases contain a wealth of information in the form of audiovisual as well as text data. Even though efficient search algorithms have been developed for either media, there still exists the need for abstract presentation and summarization of the results of database users' queries. Moreover, multimedia retrieval systems should be capable of providing the user with additional information related to the specific subject of the query, as well as suggest other topics which could be identified to attract the interest of users with a similar profile. In this paper, we present solutions to these issues, giving as an example an integrated architecture we have developed, along with notions that support efficient and secure Internet access to audiovisual/video databases. Segmentation of each video in shots is followed by shot classification in a number of predetermined categories. Generation of users' profiles according to the categories, enhanced by relevance feedback, permits an efficient presentation of retrieved video shots or characteristic frames in terms of the user interest in them. Moreover, this clustering scheme assists the notion of &lsquo;lateral&rsquo; links that enable the user to continue retrieval with data of similar nature or content to those already returned. Furthermore, user groups are formed and modeled by registering actual preferences and practices. This enables the system to &lsquo;predict&rsquo; information that is possibly relevant to the user's interest and present it along with the returned results. The concepts utilized in this system can be smoothly integrated in MPEG-7 compatible multimedia database systems.