ppxscal/embedding_network huggingface dataset:
An Approach to Identify Duplicated Web Pages
Authors: Giuseppe A. Di Lucca, Massimiliano Di Penta, Anna Rita Fasolino
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

A relevant consequence of the unceasing expansion of the Web and e-commerce is the growth of the demand ofnew Web sites and Web applications. As a result, Web sites and applications are usually developed without a fomlalized process, but Web pages are directly coded in an incremental way, where new pages are obtained by duplicating existing ones. Duplicated Web pages, having the same structure and just differing for the data they include, can be considered as clones. The identification of clones may reduce the effort devoted to test, maintain and evolve Web sites and applications. Moreover, clone detection among different Web sites aims to detect cases of possible plagiarism. In this paper we propose an approach, based on similarity metrics, to detect duplicated pages in Web sites and applications, implemented with HTML language and ASP technology. The proposed approach has been assessed by analyzing several Web sites and Web applications. The obtained results are reported in the paper with respect to some case studies.
Data parallel programming in an adaptive environment
Authors: Guy Edjlali, Gagan Agrawal, Alan Sussman, Joel H. Saltz
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

For better utilization of computing resources, it is important to consider parallel programming environments in which the number of available processors varies at runtime. In this paper, we discuss runtime support for data parallel programming in such an adaptive environment. Executing data parallel-programs in an adaptive environment requires redistributing data when the number of processors changes, and also requires determining new loop bounds and communication patterns for the new set of processors. We have developed a runtime library to provide this support. We also present performance results for a multiblock Navier-Stokes solver run on a network of workstations using PVM for message passing. Our experiments show that if the number of processors is not varied frequently, the cost of data redistribution is not significant compared to the time required for the actual computations.
A parallel hash-based join algorithm for a networked cluster of multiprocessor nodes
Authors: Yun Jiang, Akifumi Makinouchi
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

Hash joins are expensive and important operations in relational database systems. Developing parallel hash join algorithms is known as an efficient method to improve their performance. Since a parallel processing environment of a networked cluster of nodes is widely available for its advantages of low-cost, high speed and ease of use, we developed a parallel hash-based join algorithm in a networked cluster of multiprocessor nodes. The parallel hash-based join algorithm has two features. One is that it takes advantage of parallel and distributed environments in which shared-memory multiprocessor computers are nodes of a networked cluster. The other is that a distributed shared virtual space is integrated into the design of the parallel hash-based join algorithm so as to facilitate the algorithm and its implementation. In this paper, we present the ideas of design, describe the parallel hash-based join algorithm, show the performance evaluation of it, as well as give a dynamic changing message model for the presence of skew.
Off-line Handwritten Chinese Character Recognition Based on Crossing Line Feature
Authors: Youbin Chen, Xiaoqing Ding, Youshou Wu
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

A new method to extract crossing line feature for off-line handwritten Chinese character recognition is proposed in this paper. Firstly, the input pattern is nonlinearly normalized in order to compensate for shape variations. Secondly, the normalized pattern is separated into four subpatterns according to the four kinds of elementary strokes. Thirdly, the four subpatterns are uniformly divided into MX M cells respectively. In every cell, the crossing lines are counted. Then a 4M 2 dimensional feature vector is generated. An off-line handwritten Chinese character recognition system is built based on this feature. Our experiments have demonstrated the effectiveness of the method proposed in this paper.
Platform-Independent Runtime Optimizations Using OpenThreads
Authors: Matthew Haines, Koen Langendoen
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Although platform-independent runtime systems for parallel programming languages are desirable, the need for low-level optimizations usually precludes their ex- istence. This is because most optimizations involve some combination of low-level communication and low-level threading, the product of which is almost al- ways platform-dependent. We propose a solution to the threading half of this dilemma by using a thread package, that allows .ne-grain control over the be- havior of the threads while still providing performance comparable to hand-tuned, machine-dependent thread packages. This makes it possible to construct platform- independent thread modules for parallel runtime sys- tems and, more importantly, to optimize them.
A Long and Winding Road (Progress on the Road to a Software Engineering Profession)
Authors: J. Barrie Thompson
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

An evaluation of the current state of developments in the field of Software Engineering (SE) Professionalism is presented including the effect of ACM withdrawing from the IEEE-CS/ACM Software Engineering Coordinating Committee (SWECC). An examination is made of two of the projects initiated by SWECC: that defining the Software Engineering Code of Ethics and Professional Practice and that providing a Guide to a Software Engineering Body of Knowledge. The successes and problems associated with each are highlighted. Details are presented of a project supported by the International Federation of Information Processing, concerned with the harmonisation of professional standards, which could now be very relevant to re-establishing progress on the road to a SE profession. Efforts undertaken to promote this work to the SE community are also reported. Finally overall conclusions and recommendations are given that could improve the situation in the future.
Data Warehousing: Dealing with the Growing Pains
Authors: Robert Armstrong
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

A data warehouse provides a customer with information to run and plan their business. It is true that if the data warehouse can not quickly adapt to changes in the environment then the company will lose the advantage that information provides. A warehouse must be built with a solid foundation that is flexible and responsive to business changes. The purpose of this paper is to share experiences in the area of managing the growth within the data warehouse. There are many technical issues that need to be addressed as the data warehouse grows in multiple dimensions. The ideas in this paper should enable you to provide the correct foundation for a long term warehouse. Very few companies are discussing these issues and the lack of discussion leads to a lack of knowledge that will further lead to poor architectural choices. This paper will articulate not only the benefits that are derived from data warehousing today but how to prepare to reap benefits for many tomorrow s. It will also explore the questions to ask, the points to make, and the issues to be addressed to have a long term successful data warehouse project.
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
Authors: Li Li, Milind M. Buddhikot, Chandra Chekuri, Jinhong Katherine Guo
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic Label Switched Path (LSP) routing is often enhanced using restoration routing which sets up alternate LSPs to guarantee uninterrupted connectivity in case network links or nodes along primary path fail. In this paper, we address the problem of distributed routing of restoration paths, which can be defined as follows: given a request for a bandwidth guaranteed LSP between two nodes, find a primary LSP and a set of backup LSPs that protect the links along the primary LSP. A routing algorithm that computes these paths must optimize the restoration latency and the amount of bandwidth used.In this paper, we introduce the concept of "backtracking" to bound the restoration latency. We consider three different cases characterized by a parameter called backtrackingdistance D: (1) no backtracking (D = 0), (2) limited backtracking (D = k), and (3) unlimited backtracking (D = 8). We use a link cost model that captures bandwidth sharing among links using various types of aggregate link state information. We first show that joint optimization of primary and backup paths is NP-hard in all cases. We then consider algorithms that compute primary and backup paths in two separate steps. Using link cost metrics thatcapture bandwidth sharing, we devise heuristics for each case. Our simulation study shows that these algorithms offer a way to tradeoff bandwidth to meet a range of restoration latency requirements.
Optical Formula Recognition
Authors: Stephane Lavirotte
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper describes the design and the first steps of implementation of Ofr (Optical Formula Recognition), a system for extracting and understanding mathematical expressions in printed documents. Our approach clearly separate OCR step, geometrical treatments and syntactic analysis. In this paper we focus on the third part: we define a class of context-sensitive graph grammars for mathematical formulas, study their properties and show how to remove their ambiguities (by adding contexts in rules) to define efficient parsing. This method is based on a ``critical pairs'' approach in the sense of Knuth-Bendix algorithm.
UML-Based Analysis of Embedded Systems Using a Mapping to VHDL
Authors: William E. McUmber, Betty H. C. Cheng
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

Methods for developing and modeling embedded systems and rigorously verifying behavior before committing to code are increasingly important. A number of object-oriented techniques and notations have been introduced, but recently, it appears that the {\it Unified Modeling Language} (UML) could be a notation broad enough in scope to represent a variety of domains and gain widespread use. Currently, however, UML is only a notation, with no formal semantics attached to the individual diagrams. In order to address this problem, we have developed a framework for deriving VHDL specifications from the class and state diagrams in order to capture the structure and the behavior of embedded systems. The derived VHDL specifications enable us to perform behavior simulation of the UML models.
Using a Group Support System to Meet Educational Objectives
Authors: Ricardo Choren, Hugo Fuks, Carlos José Pereira de Lucena
Venue: Proceedings of the 6th International Workshop on Groupware (2000)

The paper presents a WWW-based group support system (GSS) to facilitate the teaching/learning process. The authors also describe their experiences over four successive editions of a pilot course offered using the GSS. They show the methodologies used and draw some results, experiences and impressions from this experience. They further describe planned future research, including discussion of the possibility of using this method to support distance education.
Design and analysis of FPGA/FPIC switch modules
Authors: Yao-Wen Chang, D. F. Wong, C. K. Wong
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

Switch modules are the most important component of the routing resources in FPGAs and FPICs. The quality of switch modules greatly affects FPGA/FPIC routing solutions. The switch-module design problem was studied by K. Zhu et al. (1993). In order to analyze the routability of designed switch modules, a heuristic algorithm based on network-flow techniques was proposed. In this paper, we mathematically show that the network-flow based algorithm has provably good performance with the bounds 5 and 5/4 away from the optima for two types of switch modules, respectively. Based on the analyses, we developed a new method for designing switch modules. Experimental results show that our designed switch modules significantly improve routability, compared with those by K. Zhu et al. Extensive experiments also show that the network-flow based algorithm is highly accurate and runs very efficiently.
Ponder: Realising Enterprise Viewpoint Concepts
Authors: Emil Lupu, Morris Sloman, Naranker Dulay, Nicodemos Damianou
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

This paper introduces the Ponder language for specifying distributed object enterprise concepts. Ponder, is a declarative language, which permits the specification of policies in terms of obligations, permissions and prohibitions and provides the means for defining roles, relationships and their configurations in nested communities. Ponder provides a concrete representation of most of the concepts of the Enterprise Viewpoint. The design of the language incorporates lessons drawn from several years of research on policy for security and distributed systems management as well as policy conflict analysis. The various language constructs are presented through a scenario for the operation, administration and maintenance of a mobile telecommunication network.
A Factorial Performance Evaluation for Hierarchical Memory Systems
Authors: Xian-He Sun, Dongmei He, Kirk W. Cameron, Yong Luo
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

In this study, we introduce an evaluation methodology for advanced memory systems. This methodology is based on statistical factorial analysis. It is two fold: it first determines the impact of memory systems and application programs toward overall performance; it also identifies the bottleneck in a memory hierarchy and provides cost/performance comparisons via scalability analysis. Different memory systems can be compared in terms of mean performance or scalability over a range of codes and problem sizes. Experimental testing has been performed on Department of Energy's Accelerated Strategic Computing Initiative (ASCI) machines and benchmarks available at the Los Alamos National Laboratory to validate this newly proposed methodology. Experimental and analytical results show this methodology is an effective tool for memory system evaluation and design.
Content is King, (If You Can Find It): A New Model for Knowledge Storage and Retrieval
Authors: Fred L. Wurden
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

The technology for acquiring and storing vast amounts of complex data is accelerating at a much faster rate than the technology for retrieving and analyzing that data. While progress has been made with OODB, OLAP, and knowledge discovery (KD) systems, users of these systems are still required to know and supply missing semantic information. When dealing with complex real-world representations, this is often nearly impossible to do. We discuss a new model that provides significant improvements in storing, correlating, and navigating information. We first provide a brief background looking at other relevant knowledge representation approaches, then describe our patented Contiguous Connection Model. Finally we discuss the impact this technology has had on a large, high-value, digital media knowledge base.
A Directory Server for Mobile Agents Interoperability
Authors: Yasuyuki Beppu, Shin Nakajima, Fumihiro Kumeno, Kenta Cho, Tetsuo Hasegawa, Akihiko Ohsuga
Venue: Proceedings of the 4th International conference on Enterprise Distributed Object Computing (2000)

This paper reports a directory server in a distributed middleware for realizing the interoperability between a wide variety of mobile agent systems. The ODP trader, an ITU-T recommendation for direction service, is customized for the specific requirements. The key ideas are (1) to extend the managed information so that program codes can be members, and (2) to provide Proxy Offer for utilizing services located outside the directory. Performance measurement shows that Proxy Offer is more efficient than dynamic property of the ODP trader in the current application.
Evaluating WAP Usability: "What Usability?"
Authors: Kristian Kiili
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

Some educational communities and organizations have recognized the possibilities of mLearning. mLearning may provide tools to respond to the demands of working life and information society. One way to enhance mLearning is to raise the usability of mobile terminals as good usability is the basis for the meaningful and effective learning. Poor usability disturbs the learning processes because the energy of users is directed to the use of the system instead of learning. In this paper the usability of Nokia 7110 mobile phone is evaluated.Researchers located the problem points of the user interface and navigation system. In fact, there were several obstacles in the user interface of the tested mobile phone that need improvement. First of all, the Navi Roller confuses users and they prefer to use it even in thetasks that could be done more easily with the other buttons. Secondly, the inconsistency of the Navi Roller and the shortcut button caused some problems. WAP services need improvement as well. The navigating structures were hard to understand and feedback ofactions was insufficient. As a conclusion, there is a lot usability work to be done before mobile terminals can be effectively adapted as a part of education.
Better Deterministic Routing on Meshes
Authors: Jop F. Sibeyn
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional n x n meshes. The deterministic algorithm is based on ``column-sort'' and exploits only part of the features of the mesh. For small n and moderate k, the lower-order terms of this algorithm make it considerably more expensive than the randomized algorithm. In this paper, we present a novel deterministic algorithm, which, by exploiting the topology of the mesh, has lower-order terms that are almost negligible, even smaller than those of the randomized algorithm. An additional advantage of the new algorithm is that it routes average-case packet distributions twice as fast as worst-case distributions. In earlier algorithms this required additional steps for globally probing the distribution.
OLE DB: A Component DBMS Architecture
Authors: José A. Blakeley
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

The article describes an effort at Microsoft whose primary goal is to enable applications to have uniform access to data stored in diverse DBMS and non DBMS information containers. Applications continue to take advantage of the benefits of database technology such as declarative queries, transactional access, and security without having to transfer data from its place of origin to a DBMS. Our approach consists of defining an open, extensible collection of interfaces that factor and encapsulate orthogonal, independently reusable portions of DBMS functionality. These interfaces define the boundaries of DBMS components arch as record containers, and query processors that enable uniform, transactional access to data among such components. The proposed interfaces extend Microsoft's OLE Component Object Model (COM) with database functionality, hence these interfaces are collectively referred to as OLE DB. The OLE DB functional areas include data access and updates (rowsets), query processing, catalog information, notifications, transactions, security, and distribution. The article presents an overview of the OLE DB approach and its areas of componentization.
Reliability Assessment of WEB Applications
Authors: Vasu S. Alagar, O. Ormandjieva
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

The paper discusses a formal approach for specifying time-dependent Web applications and proposes a Markov model for reliability prediction. Measures for predicting reliability are calculated from the formal architectural specification and system configuration descriptions.
Line Removal and Restoration of Handwritten Characters on the Form Documents
Authors: Jin-Yong Yoo, Min-Ki Kim, Sang Yong Han, Young-Bin Kwon
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

The off-line handwritten characters recorded on prescribed form documents may be overwritten by the lines of form documents. Overwitten characters should be isolated in order to be more effectively recognized. However, removal of the line causes breaks in overwritten characters. Consequently, a character restoration process is necessary. In this paper, the shape types of overwritten characters are analyzed and a method of restoring characters broken by line removal is proposed. A 97% correct restoration ratio was obtained through this method.
From Software Architecture to Implementation with UML
Authors: Christine Hofmeister, Robert L. Nord
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

Although originally developed to describe OO design, today UML is also being used to describe software architecture. However, using the same notation for different levels of abstraction can create confusion. In this paper we illustrate some of the important differences between software architecture models and implementation models in UML.
A UML Profile to Support the Formal Presentation of Software Architecture
Authors: Amjad Hudaib, Carlo Montangero
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

We present an UML profile that accommodates the specialized dynamic models that support the Oikos_adtl approach to software architecture. The profile reflects some core modeling Oikos_adtl concepts in the UML framework. We propose the related notations and diagrams, which map into the new models. Since we rely on the standard UML extension mechanisms, we are also setting the requirements for add-ins to the standard UML tools, to support our approach to the formal specification and analysis of software architectures.