ppxscal/embedding_network huggingface dataset:
DHTML Utopia Modern Web Design Using JavaScript & DOM
Authors: Stuart Langridge
Venue:  (2005)

"Create Killer Websites Using the Power of Modern JavaScript" DHTML Utopia is an easy-to-follow, step-by-step tutorial that will show you how to make your websites more slick, dynamic, and usable. Add dynamic interactivity to your website with DHTML by combining the power of JavaScript, Cascading Style Sheets(CSS), and the Document Object Model (DOM) to achieve bulletproof, accessible, standards-compliant, and aesthetically pleasing results that work on all browsers. Build fancy DHTML effects that can be instantly reused in any project Learn to code accessible JavaScript that won't trouble older browsers Make search engine friendly, multi-level, drop-down navigation menus Create usable forms that auto-complete, just like "Google Suggest" Build dynamic web applications using remote scripting techniques/Ajax
On Building a Data Broadcasting System for Mobile Databases
Authors: Agustinus Borgy Waluyo, Gabriel Goh, David Taniar, Bala Srinivasan
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Data broadcasting is a scalable mechanism to disseminate information to a large number of mobile clients in a wireless environment. Our paper concerns with developing a data broadcasting system in a mobile environment, which involves data and index dissemination. The broadcasted data is retrieved from a database server. Subsequently, these data may be broadcasted periodically or aperiodically. As wireless environment inherent resource limitations, the use of indexing scheme will provide efficient data retrieval. We use share indices price context to demonstrate our proposed models. The models are developed using wireless ad-hoc network infrastructure.
Adaptation and Configuration - Support-Possibilities of Different Learner Types within Virtual Learning Environments - An Experience Report
Authors: Imke Sassen, Birgit Schwartz-Reinken
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

There is a variety of virtual learning environments leading from simple text-based HTML courses to more complex hyper-media structures including e.g. interactive learning modules realized as java applets. In this paper we would like to present our E-Learning approach and focus on the problem of the instructional design of adaptive learning scenarios. Due to our results of several evaluations and tests we developed an approach called "configurable adaptation" to avoid several reasons for distrust or frustration on the learners' side. Furthermore we would like to show the importance of didactical and psychological aspects during the implementation of learning systems.
Relescope: an experiment in accelerating relationships
Authors: Stephen Farrell, Christopher Campbell, Suvda Myagmar
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Busy academics and professionals are being called upon to manage more and more relationships. Many details of collaboration are accessible in digital libraries and other repositories. With Relationship-Oriented Computing, we posit that network information embedded in these repositories can be leveraged to improve the human need to manage and form the most productive relationships. To explore this idea, we developed a relationship-network application, called Relescope, and deployed it at the ACM CSCW 2004 conference. It provided a personalized report to attendees based on publication and citation information. The report was intended to provide concrete insights into the relationship-network that could be acted upon. Results of a survey showed that 52% of responders used their report to recognize and talk to others or plan which talks to attend. People with fewer collaborators were more inclined to use Relescope than the people with the most collaborators. Lessons learned and future work are discussed.
Middleware services for web service compositions
Authors: Anis Charfi, Mira Mezini
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

WS-* specifications cover a variety of issues ranging from security and reliability to transaction support in web services. However, these specifications do not address web service compositions. On the other hand, BPEL as the future standard web service composition language allows the specification of the functional part of the composition as a business process but it fails short in expressing non-functional properties such as security, reliability and persistence. In this paper, we propose an approach for the transparent integration of technical concerns in web service compositions. Our approach is driven by the analogy between web services and software components and is inspired from server-side component models such as Enterprise Java Beans. The main components of our framework are the process container, the middleware services and the deployment descriptor.
Pragmatic general multicast congestion control protocol for wireless networks: Research Articles
Authors: Eric Hsiao-Kuang Wu, Wei-Ren Yang
Venue: Wireless Communications Mobile Computing (2005)

Accompanied by the widespread deployment of wireless networks, content and service providers are increasingly interested in supporting multicast communications over wireless network. The reliable multicast protocol can provide (assure) efficiency in data delivery carried by the new generation e-services, such as news, advertisement, guiding messages, etc. Its congestion control function enables the transmissions to adapt the sending rate to the available bandwidth and fairly share bandwidth with the widely used transmission control protocol (TCP) traffic in the networks. Many e-services can be brought and built on the reliable multicast congestion control protocols to the roaming mobile subscribers. However, the reliable multicast congestion control protocols are affected by the wireless packet losses, resulting in degraded multicast performance. This article presents PGMCCW, a pragmatic general multicast congestion control protocol for wireless networks. PGMCCW can differentiate the wireless losses as well as the congestion losses on multicast and can also elect the proper group representative from the multiple receivers in the different wireless sub-networks. The simulation results validate that this scheme is effective to alleviate the influence of the wireless losses and improve the performance over wireless networks. Copyright &copy; 2005 John Wiley & Sons, Ltd.Preliminary version was presented in Proceedings of OOTA 2004.
Recursion schemata for slowly growing depth circuit classes
Authors: Satoru Kuroda
Venue: Computational Complexity (2004)

We characterize iterated log depth circuit classes between AC0 and AC1 by Cobham-like bounded recursion schemata. We also give alternative characterizations which utilize the safe recursion method developed by Bellantoni and Cook.
A Methodology for Evaluating Arabic Machine Translation Systems
Authors: Ahmed Guessoum, Rached Zantout
Venue: Machine Translation (2004)

This paper presents a methodology for evaluating Arabic Machine Translation (MT) systems. We are specifically interested in evaluating lexical coverage, grammatical coverage, semantic correctness and pronoun resolution correctness. The methodology presented is statistical and is based on earlier work on evaluating MT lexicons in which the idea of the importance of a specific word sense to a given application domain and how its presence or absence in the lexicon affects the MT system's lexical quality, which in turn will affect the overall system output quality. The same idea is used in this paper and generalized so as to apply to grammatical coverage, semantic correctness and correctness of pronoun resolution. The approach adopted in this paper has been implemented and applied to evaluating four English-Arabic commercial MT systems. The results of the evaluation of these systems are presented for the domain of the Internet and Arabization.
Formation of a geometric pattern with a mobile wireless sensor network
Authors: Justin Lee, Svetha Venkatesh, Mohan Kumar
Venue: Journal of Robotic Systems (2004)

Mobile wireless sensor networks (MWSNs) will enable information systems to gather detailed information about the environment on an unprecedented scale. These self-organizing, distributed networks of sensors, processors, and actuators that are capable of movement have a broad range of potential applications, including military reconnaissance, surveillance, planetary exploration, and geophysical mapping. In many of the foreseen applications, the MWSN will need to form a geometric pattern without assistance from the user. In military reconnaissance, for example, the nodes will be dropped onto the battlefield from a plane and land at random positions. The nodes will be expected to arrange themselves into a predetermined formation in order to perform a specific task. Thus, we present algorithms for forming a line, circle, and regular polygon from a given set of random positions. The algorithms are distributed and use no communication between the nodes to minimize energy consumption. Unlike past studies of geometric problems where algorithms are either tested in simulations where each node has global knowledge of all the other nodes or implemented on a small number of robots, the robustness of our algorithms has been studied with simulations that model the sensor system in detail. The simulations demonstrate that the algorithms are robust against random errors in the sensors and actuators. &copy; 2004 Wiley Periodicals, Inc.
Trust Analysis of the U.K. e-Voting Pilots
Authors: Alexandros Xenakis Ann Macintosh
Venue: Social Science Computer Review (2005)

This article explores the issue of trust in the context of the e-electoral process based on the experience gained through the 2002 and 2003 U.K. e-voting pilots. In our analysis, we adopt a process-stage approach to e-elections. We identify the different agents involved in the e-electoral process so as to indicate who generates trust and to whom they convey their trust during the evolution of the process. We then describe agent responsibilities for each of the process stages to identify the issues that require trust between agents. Thus we indicate why trust was needed to support the deployment of the pilots. Based on our analysis we describe cases where "inherited trust" was indirectly conveyed between agents. Finally, because trust in e-voting is primarily needed from the electorate, we propose four levels of social acceptance for the e-voting process and discuss some trust-building arguments for prospective public administration e-transaction environments.
CCSP CSIDS Exam Certification Guide
Authors: Earl Carter
Venue:  (2005)

Official self-study test preparation guide for the Cisco IPS exam 642-532The official study guide helps you master all the topics on the IPS exam, including: IPS concepts Command-line interface (CLI) and IPS Device Manager (IDM) configuration modes Basic sensor and IPS signature configuration IPS signature engines Sensor tuning IPS event monitoring Sensor maintenance Verifying system configuration Using the Cisco IDS Module (IDSM) and Cisco IDS Network Module Capturing network trafficCCSP IPS Exam Certification Guide is a best of breed Cisco® exam study guide that focuses specifically on the objectives for the IPS exam. Cisco Security Test Engineer Earl Carter shares preparation hints and test-taking tips, helping you identify areas of weakness and improve your Intrusion Prevention System (IPS) knowledge. Material is presented in a concise manner, focusing on increasing your understanding and retention of exam topics.CCSP IPS Exam Certification Guide presents you with an organized test preparation routine through the use of proven series elements and techniques. “Do I Know This Already” quizzes open each chapter and allow you to decide how much time you need to spend on each section. Exam topic lists and Foundation Summary materials make referencing easy and give you a quick refresher whenever you need it. Challenging chapter-ending review questions help you assess your knowledge and reinforce key concepts. The companion CD-ROM contains a powerful testing engine that allows you to focus on individual topic areas or take complete, timed exams. The assessment engine also tracks your performance and provides feedback on a module-by-module basis, presenting question-by-question remediation to the text. Well-regarded for its level of detail, assessment features, and challenging review questions and exercises, this book helps you master the concepts and techniques that will enable you to succeed on the exam the first time.CCSP IPS Exam Certification Guide is part of a recommended learning path from Cisco Systems® that includes simulation and hands-on training from authorized Cisco Learning Partners and self-study products from Cisco Press. To find out more about instructor-led training, e-learning, and hands-on instruction offered by authorized Cisco Learning Partners worldwide, please visit www.cisco.com/go/authorizedtraining.ï¾ Companion CD-ROMThe CD-ROM contains an electronic copy of the book and more than 200 practice questions for the IPS exam, all available in study mode, test mode, and flash-card format.This volume is part of the Exam Certification Guide Series from Cisco Press®. Books in this series provide officially developed exam preparation materials that offer assessment, review, and practice to help Cisco Career Certification candidates identify weaknesses, concentrate their study efforts, and enhance their confidence as exam day nears.
Using logical views and dialogue to answer locally-expressed distributed queries
Authors: Nikhil Srivastava
Venue: Journal of Computing Sciences in Colleges (2004)

It is often desirable to consolidate related information stored across multiple databases by querying all of them at once. However, these databases are often designed by different people, who have different conceptualizations of the domain in question, and may use different terminology. These disparities cause semantic heterogeneity, which occurs as the use of incongruent usage of syntax to denote meaning (semantics) across databases.
Modeling the performance of a NAT/firewall network service for the IXP2400
Authors: Tom Verdickt, Wim Van de Meerssche, Koert Vlaeminck
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

The evolution towards IP-aware access networks creates the possibility (and, indeed, the desirability) of additional network services, like firewalling or NAT, integrated into the network devices. These new services, however, force the network components to be both flexible (to cope with changing protocols and applications) and powerful. Network processors as a platform on which to implement the network services seem to fit the bill.System performance should be assured by incorporating performance analysis into the design of the system, by means of performance modeling at the architectural design stage. This paper describes the use of Software Performance Engineering during the design of a firewall/NAT router on the Intel IXP2400 network processor. Several design options were first modeled and analysed, and based on those simulations, a final design was chosen and implemented.
Feasibility Study for the Development of a Motion Imagery Quality Metric
Authors: John M. Irvine, Charles Fenimore, David Cannon, John Roberts, Steven A. Israel, Larry Simon, Charles Watts, James D. Miller, Michelle Brennan, Ana Ivelisse Aviles, Paul F. Tighe, Richard J. Behrens
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

The motion imagery community would benefit from the availability of standard measures for assessing image interpretability. The National Imagery Interpretability Rating Scale (NIIRS) has served as a community standard for still imagery, but no comparable scale exists for motion imagery. Several considerations unique to motion imagery indicate that the standard methodology employed in the past for NIIRS development may not be applicable or, at a minimum, require modifications. Traditional methods for NIIRS development rely on a close linkage between perceived image quality, as captured by specific image interpretation tasks, and the sensor parameters associated with image acquisition. The dynamic nature of motion imagery suggests that this type of linkage may not exist or may be modulated by other factors. An initial study was conducted to understand the effects of specific factors on perceived image interpretability for motion imagery. These factors are: ¿Target motion: Other studies indicate that moving targets exhibit greater saliencethat can enhance target detection and recognition ¿Camera motion: The parallax effect and changing viewing geometry assist the analyst, particularly when viewing partially occluded targets ¿Scene complexity: It has been hypothesized that both target and camera motion exhibit greater effects on perceived interpretability when the scenes are more complex. In this evaluation, a number of experienced imagery analysts provided ratings and comparisons of a number of motion imagery clips and images derived from these clips. The image set was well characterized in terms of target motion, camera motion, and scene complexity, as well as ground sampled distance (GSD). Analysis of the data from this evaluation provides insight into the magnitude of these effects on perceived image interpretability. This paper describes the evaluation, presents the results, and explores the implications for development of a "NIIRS-like" scale for motion imagery.
Simulation of Mobility and Routing in Ad Hoc Networks using Ant Colony Algorithms
Authors: Tarek H. Ahmed
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Mobile Ad-hoc Networks (MANET's) have recently attracted a lot of attention in the research community as well as the industry. This technology has become increasingly important in communication and networking. Routing is one of the most important and difficult aspects in ad hoc network since ad hoc network topology frequently changes. Conventional routing algorithms are difficult to be applied to a dynamic network topology, therefore modeling and design an efficient routing protocol in such dynamic networks is an important issue. One of the meta-heuristic algorithms which is inspired by the behavior of real ants is called Ant Colony Optimization (ACO) algorithm, it can definitely be used as a tool to tackle the mercurial scenarios present in this dynamic environment. In this paper, I have designed a model which combines ant colony behavior and queuing network analysis to evaluate End-to-End packet delay in MANET.
The Linear Complementarity Problem Under Asymptotic Analysis
Authors: Fabián Flores-Bazán, Ruben López
Venue: Mathematics of Operations Research (2005)

In this work we study the classical linear complementarity problem LCP by describing the asymptotic behavior of the approximate solutions to its variational inequality formulation. Thus, some properties satisfied by the directions which are limits of the normalized unbounded approximate solutions will be established. Based on this analysis, various equivalent conditions guaranteeing the existence of solutions to LCP are given. In particular, the sufficient condition of Gowda and Pang expressed in terms of the solutions to augmented linear complementarity problems is written in a way that is more easily verifiable. Our approach allows us to deal with GarcÃ a-matrices, semimonotone, copositive,q-pseudomonotone matrices among others, in a unified framework. Furthermore, we introduce a larger class of matrices for which many of the results (including a sensitivity one) due to Gowda and Pang are still valid. In addition, some conditions ensuring the boundedness of the solution set are also provided, and some estimates for the asymptotic cone of the solution set, for different classes of matrices, are given as well. Hence, the present approach sheds new light and offers an alternative to view classical results.
Adapting the Personal Software Process (PSP) to Formal Methods
Authors: Abdul Babar, John Potter
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

The goal of good software engineering practice is to deliver reliable, high-quality software on-time and on-budget. In this paper we advocate the combination of two modern approaches towards achieving this goal. On the one hand, with an eye to software quality, we consider adopting a state-based formal development method, the B-method. In terms of tool support and industry adoption, this is the most advanced such method. On the other, aimed at improving the development practices of individual developers, we consider the adoption of the Personal Software Process (PSP). To our knowledge this combination of formal methods and PSP has not been considered before; we term our special version of the combination B-PSP. We present a re-design of the PSP data collection and analysis tasks specifically geared towards the B-Method. Although we support the general framework of PSP, we also believe that developers do not enjoy having their creative and thinking process being interrupted by the need to regularly log activities.With this in mind, we present the PSP tasks in a style which should be acceptable to B developers. We view the results of this paper as a specification for some of the data logging and analysis requirements of a B-PSP-based development.
An On-Line Learning Mechanism for Unsupervised Classification and Topology Representation
Authors: Shen Furao, Osamu Hasegawa
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

An on-line learning mechanism is proposed for unsupervised data. Using a similarity threshold and local error based insertion criterion, the system is able to grow incrementally and to accommodate input patterns of on-line non-stationary data distribution. The definition of a utility parameter ¿ "error-radius" ¿ enables this system to learn the number of nodes needed to solve a task. The usage ofnew technique for removing nodes in low probability density regions can separate the clusters with low-density overlaps and dynamically eliminate noise in the input data. Experiment results show that his system can report a reasonable number of clusters and represent the topological structure of unsupervised on-line data with no prior conditions sush as a suitable number of nodes or a good initial codebook.
Extracting frequent connected subgraphs from large graph sets
Authors: Wei Wang, Qing-Qing Yuan, Hao-Feng Zhou, Ming-Sheng Hong, Bai-Le Shi
Venue: Journal of Computer Science and Technology (2004)

Mining frequent patterns from datasets is one of the key success of data mining research. Currently, most of the studies focus on the data sets in which the elements are independent, such as the items in the marketing basket. However, the objects in the real world often have close relationship with each other. How to extract frequent patterns from these relations is the objective of this paper. The authors use graphs to model the relations, and select a simple type for analysis. Combining the graph theory and algorithms to generate frequent patterns, a new algorithm called Topology, which can mine these graphs efficiently, has been proposed. The performance of the algorithm is evaluated by doing experiments with synthetic datasets and real data. The experimental results show that Topology can do the job well. At the end of this paper, the potential improvement is mentioned.