ppxscal/embedding_network huggingface dataset:
Caching and Prefetching for Web Content Distribution
Authors: Jianliang Xu, Jiangchuan Liu, Bo Li, Xiaohua Jia
Venue: Computing in Science and Engineering (2004)

Proxy caching effectively reduces the network resources that Web services consume, while minimizing user access latencies. Deploying Web caching proxies over the Internet is not easy, however, and presents several cache management challenges.
Building Executable Union Slices using Conditioned Slicing
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

Program slicing can be used as a support for programcomprehension, because it allows a large program to be dividedup into smaller slices, each of which can be understoodin isolation from the rest. As such, slicing facilitatesthe familiar approach of 'divide and conquer'.Union slicing (the union of dynamic slices) is a usefultechnique for approximating a precise static slice. For programcomprehension (and many other applications) it is oftenimportant that the union slice be an executable program,rather than merely a collection of statements which are relevantto the slicing criterion.This paper presents an algorithm for computing executableunion slices, using conditioned slicing. A case studyis used to illustrate the algorithm and how the executableunion slice is preferable to the (possibly non executable)union slice. The paper also shows, briefly, that the approachhas wider applications than comprehension.
Performance Analysis of Location-Based Data Consistency Algorithms in Mobile Ad Hoc Networks
Authors: Ing-Ray Chen, Jeffery W. Wilson, Frank Driscoll, Karen Rigopoulos
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Many applications of mobile ad hoc networks require real-time data consistency among themoving nodes within a geographical area of interest tofunction correctly, e.g., battlefield command and control applications. While it is operationally desirable to maintain data consistency among nodes within a large geographical area, the time required to propagate statechanges to all mobile nodes in that geographical arealimits its size. This paper investigates the notion oflocation-based data consistency in mobile ad hocnetworks, and analyzes the tradeoff between dataconsistency and timeliness of data exchange among nodeswithin a location-based group in a geographical area ofinterest. By utilizing a Petri net performance model, weanalyze performance characteristics of location-baseddata consistency maintenance algorithms and identifydesign conditions under which the system can besttradeoff consistency for timeliness (reflecting the time topropagate a state change) while satisfying the imposeddata consistency requirement, when given a set ofparameters characterizing the application in theunderlying mobile ad hoc network environment.
Multi-Knockout Genetic Network Analysis: The Rad6 Example
Authors: Alon Kaufman, Martin Kupiec, Eytan Ruppin
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

A novel and rigorous Multi-perturbation Shapley Value Analysis (MSA) method has been recently presented [12]. The method addresses the challenge of defining and calculating the functional causal contributions of elements of a biological system. This paper presents the first study applying MSA to the analysis of gene knockout data. The MSA identifies the importance of genes in the Rad6 DNA repair pathway of the yeast S. cerevisiae, quantifying their contributions and characterizing their functional interactions. Incorporating additional biological knowledge, a new functional description of the Rad6 pathway is provided, predicting the existence of additional DNA polymerase and RFC-like complexes. The MSA is the first method for rigorously analyzing multi-knockout experiments, which are likely to soon become a standard and necessary tool for analyzing complex biological systems.
An adaptive mesh refinement of quadrilateral finite element meshes based upon a posteriori error estimation of quantities of interest: linear static response
Authors: E. Botkin, Hui-Ping Wang
Venue: Engineering with Computers (2004)

A posteriori error estimation in finite element analysis serves as an important guide to the meshing tool in an adaptive refinement process. However, the traditional posteriori error estimates, which are often defined in the energy or energy-type norms over the entire domain, provide users insufficient information regarding the accuracy of specific quantities in the solution. This paper describes an adaptive quadrilateral refinement process with a goal-oriented error estimation, in which a posteriori error is estimated with respect to the specified quantity of interest. A highlight of this paper is the demonstration of tools described in the paper used in a practical industrial environment. The performance of this process is demonstrated on several practical problems where the comparison is with the adaptive process based on the traditional error estimation.
An exploratory study to identify the critical factors affecting the decision to establish internet-based interorganizational information systems
Authors: Khalid S. Soliman, Brian D. Janz
Venue: Information and Management (2004)

The Internet, with its unprecedented growth, is a promising platform to exchange information along the business channels. The purpose of this study was to determine the factors that are critical to organizations in their adoption decision of Internet-based interorganizational information systems (IBIS). Using a field-based survey, the researchers obtained findings that suggested that the factors that significantly affect the adoption decision of IBIS are pressures felt from trading partners, pressure felt from competitors, establishing costs, network reliability, data security, scalability, complexity, support from top management, and trust between trading partners. This research highlights the similarities as well as the differences between IBIS and Electronic data interchange (EDI). The study showed that IBIS and EDI are similar in terms of the significant effect of factors such as pressure from trading partner, pressure from competition, establishing cost, top management support, and trust on the adoption decision. However, the results show that there are differences between IBIS and EDI in terms of establishing costs, scalability, and complexity.
Computing Polygonal Surfaces from Unions of Balls
Authors: Roger Tam, Wolfgang Heidrich
Venue: Proceedings of the Computer Graphics International (2004)

We present a new algorithm for computing a polygonalsurface from a union of balls. The method computes andconnects the singular points of a given union of balls inan efficient manner to approximate the boundary. The algorithmuses the dual shape of the balls to give the resultingsurface the correct topology. Our method is simple anddemonstrated to be robust.
SQLator: an online SQL learning workbench
Authors: Shazia Sadiq, Maria Orlowska, Wasim Sadiq, Joe Lin
Venue: ACM SIGCSE Bulletin (2004)

SQL (Structured Query Language) is one of the essential topics in foundation databases courses in higher education. Due to its apparent simple syntax, learning to use the full power of SQL can be a very difficult activity. In this paper, we introduce SQLator, which is a web-based interactive tool for learning SQL. SQLator's key function is the evaluate function, which allows a user to evaluate the correctness of his/her query formulation. The evaluate engine is based on complex heuristic algorithms. The tool also provides instructors the facility to create and populate database schemas with an associated pool of SQL queries. Currently it hosts two databases with a query pool of 300+ across the two databases. The pool is divided into 3 categories according to query complexity. The SQLator user can perform unlimited executions and evaluations on query formulations and/or view the solutions. The SQLator evaluate function has a high rate of success in evaluating the user's statement as correct (or incorrect) corresponding to the question. We will present in this paper, the basic architecture and functions of SQLator. We will further discuss the value of SQLator as an educational technology and report on educational outcomes based on studies conducted at the School of Information Technology and Electrical Engineering, The University of Queensland.
Classifying and coding online actions
Authors: Eszter Hargittai
Venue: Social Science Computer Review (2004)

Research on how the Internet is diffusing across the population has broadened from questions about who uses the medium to what people do during their time online. With this change in focus comes a need for more detailed data on people's online actions. The author provides a method for coding and classifying users' online information-seeking behavior. The author presents an exhaustive list of ways in which a user may arrive at a web page. The proposed methodology includes enough nuanced information to distinguish among different search actions and links. In its entirety, the coding scheme makes it possible to understand many details about the users' sequence of actions simply by looking at the spreadsheet containing the information proposed in this article. The author also demonstrates the utility of this scheme with findings from a study on the information-seeking behavior of 100 randomly selected Internet users to exemplify the utility of this coding and classification scheme.
XIMSA: eXtended Interactive Multimedia System for Auto-medication
Authors: Olivier Cure
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

The adoption of emerging Semantic Web technologies will lead computer-basedmedical systems to a new dimension. These systems will benefit fromnext generation web knowledge representation languages and reasoningfacilities. This paper describes such an application which aims to provideseveral services related to drug consumption. The originality of this approachrelies on its general - public orientation. We already have a developmentexperience in this field with IMSA (Interactive Multimedi a System for Auto-medication).XIMSA is a logical extension of this system which incorporatessome new features based on the use of a formal web ontology.
The Rise of the Model-Driven Enterprise
Authors: David Cohn, Markus Stolze
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

Enterprises have been using formal modeling techniques for a considerable time. This use, however, has been limited to relatively narrow application domains. In this paper we provide data to support our argument that we are at a tipping point, the beginning of a much wider use of formal modeling techniques for managing large organizations.
Near pseudo Smarandache function
Authors: A. W. Vyawahare, K. M. Purohit
Venue: Smarandache Notions Journal (2004)

The Pseudo Smarandache Functions Z(n) are defined by David Gorski [1].This new paper defines a new function K(n) where n ∈ N, which is a slight modification of Z(n) by adding a smallest natural number k. Hence this function is "Near Pseudo Smarandache Function (NPSF)".Some properties of K(n) are presented here, separately, according to as n is even or odd. A continued fraction consisting NPSF is shown to be convergent [3]. Finally some properties of K-1(n) are also obtained.
Multi-Agent Dynamic Logics with Informational Test
Authors: Renate A. Schmidt, Dmitry Tishkovsky
Venue: Annals of Mathematics and Artificial Intelligence (2004)

This paper investigates a family of logics for reasoning about the dynamic activities and informational attitudes of agents, namely the agents' beliefs and knowledge. The logics are based on a new formalisation and semantics of the test operator of propositional dynamic logic and a representation of actions which distinguishes abstract actions from concrete actions. The new test operator, called informational test, can be used to formalise the beliefs and knowledge of particular agents as dynamic modalities. This approach is consistent with the formalisation of the agents' beliefs and knowledge as K(D)45 and S5 modalities. Properties concerning informativeness, truthfulness and preservation of beliefs are proved for a derivative of the informational test operator. It is shown that common belief and common knowledge can be expressed in the considered logics. This means, the logics are more expressive than propositional dynamic logic with an extra modality for belief or knowledge. The logics remain decidable and belong to 2EXPTIME. Versions of the considered logics express natural additional properties of beliefs or knowledge and interaction of beliefs or knowledge with actions. It is shown that a simulation of PDL can be constructed in one of these extensions.
Evaluation of an extraction-based approach to answering definitional questions
Authors: Jinxi Xu, Ralph Weischedel, Ana Licuanan
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

This paper evaluates an extraction-based approach to answering definitional questions. Our system extracted useful linguistic constructs called linguistic features from raw text using information extraction tools and formulated answers based on such features. The features employed include appositives, copulas, structured patterns, relations, propositions and raw sentences. The features were ranked based on feature type and similarity to a question profile. Redundant features were detected using a simple heuristic-based strategy. The approach achieved state of the art performance at the TREC 2003 QA evaluation. Component analysis of the system was carried out using an automatic scoring function called Rouge (Lin and Hovy, 2003). Major findings include 1) answers using linguistic features are significantly better than those using raw sentences; 2) the most useful features are appositives and copulas; 3) question profiles, as a means of modeling user interests, can significantly improve system performance; 4) the Rouge scores are closely correlated with subjective evaluation results, indicating the suitability of using Rouge for evaluating definitional QA systems.
Preprocessing for quadratic programming
Authors: Nick Gould, Philippe L. Toint
Venue: Mathematical Programming: Series A and B (2004)

Techniques for the preprocessing of (not-necessarily convex) quadratic programs are discussed. Most of the procedures extend known ones from the linear to quadratic cases, but a few new preprocessing techniques are introduced. The implementation aspects are also discussed. Numerical results are finally presented to indicate the potential of the resulting code, both for linear and quadratic problems. The impact of insisting that bounds of the variables in the reduced problem be as tight as possible rather than allowing some slack in these bounds is also shown to be numerically significant.
Exploiting Agent and Database Technologies for Biological Data Collection
Authors: Hasan Davulcu, Zoe Lacroix, Kaushal Parekh, I. V. Ramakrishnan, Nikeeta Julasana
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Web data sources constitute an important resource for Biological research. A simple tool that can retrieve information from different Web sites through a single interface and store the extracted data in a standardized format for efficient future use is critical to scientific discovery. In this paper we discuss an approach that combines agent and database technologies for biological data integration. To illustrate this, we employ two software tools: WinAgent, for building agents, and dbXML, for XML data management. WinAgent learns from its users by recording a browsing session on Web sites and successive data extraction from regions of interest on retrieved Web pages. The results are stored in a XML document and can be managed, queried and updated using a native XML database system such as dbXML. This approach is currently being evaluated at the Brain Tumor Cancer Unit of the Translational Genomics Research Institute (TGen), Phoenix, Arizona.
Implementation issues: session summary
Authors: Janice Cynthia Weber
Venue: ACM SIGPLAN Notices (1983)

This session consisted of six speakers, presenting the significant ideas from their papers. A few questions were asked, but major discussions were postponed until the second 'Implementation' session.
A Novel Computational Framework for Structural Classification of Proteins Using Local Geometric Parameter Matching
Authors: Sumeet Dua, Naveen Kandiraju
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

The objective of this study was to develop a novel and fast computational framework for classification of proteins using a series of secondary structure geometric parameter represented by an unexplored dihedral angle of a protein sequence. A dihedral angle is calculated between two planes represented by atom-tuplets [N(i), C(i), N(i+1)] and [C(i), N(i+1), C(i+1)], of adjacent (i and i+1) amino acids of a protein structure. The comparison of two such series of dihedral angles, each representing a different protein structure, is based on subsequence matching which not only gives the extent of match but also provides with the approximate demographic information of the match which then is used in classification of proteins. The technique is tested over 25 proteins belonging to 5 different families randomly selected from Alpha, Beta, Alpha and Beta (alpha/beta) and Multi-domain proteins (alpha and beta) classes. The classification rate is achieved with an accuracy of 88%.
Static Analysis for State-Space Reductions Preserving Temporal Logics
Authors: Karen Yorav, Orna Grumberg
Venue: Formal Methods in System Design (2004)

In this paper we present two methods that use static analysis of parallel programs to create reduced models for them. Our algorithms examine the control-flow graph of a program (the syntax) and create a smaller transition system than would have been created otherwise. The smaller transition system is equivalent to the original transition system of the program with respect to temporal logic specifications.The two methods are orthogonal in their approach. The first, called path reduction, reduces the state-space by compressing computation paths. This method reduces the number of steps each computation takes. The second method, called dead variable reduction, reduces according to the variable domains. It identifies classes of equivalent states which differ only on variable values (and not the program counter) and uses a representative for each class. We also consider a refinement of the dead variable reduction, based on partially dead variables, which may result in a greater reduction.Our algorithms are based on syntactic manipulation of expressions, thus enabling us to handle programs with variables over finite as well as infinite domains. Both methods can easily be combined with either explicit state or symbolic methods (and with each other).We used the Murphi verifier to test the amount of reduction achieved by both methods. We let Murphi perform a DFS search and compared the sizes of the original and reduced transition systems, for several examples and according to both reductions. The results show that path reduction and the reduction based on partially dead variables give significant reductions, while the effect of fully dead variables is less impressive. We discuss the differences between the approaches, and the reasons for these results.
Scheduling and lot streaming in flowshops with no-wait in process
Authors: Nicholas G. Hall, Gilbert Laporte, Esaignani Selvarajah, Chelliah Sriskandarajah
Venue: Journal of Scheduling (2003)

Lot streaming involves splitting a production lot into a number of sublots, in order to allow the overlapping of successive operations, in multi-machine manufacturing systems. In no-wait flowshop scheduling, sublots are necessarily consistent, that is, they remain the same over all machines. The benefits of lot streaming include reductions in lead times and work-in-process, and increases in machine utilization rates. We study the problem of minimizing the makespan in no-wait flowshops producing multiple products with attached setup times, using lot streaming. Our study of the single product problem resolves an open question from the lot streaming literature. The intractable multiple product problem requires finding the optimal number of sublots, sublot sizes, and a product sequence for each machine. We develop a dynamic programming algorithm to generate all the nondominated schedule profiles for each product that are required to formulate the flowshop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and computationally test an efficient heuristic for this problem. Our results indicate that solutions can quickly be found for flowshops with up to 10 machines and 50 products. Moreover, the solutions found by our heuristic provide a substantial improvement over previously published results.
An integrated approach to scatternet traffic management in Bluetooth ad hoc networks
Authors: Liza Lai-Yee Shek, Yu-Kwong Kwok
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2004)

Bluetooth is an important and increasingly popular wireless communication standard, and in recent years a large number of Bluetooth products have been introduced commercially. Its chief advantages are small and low power consumption, which make the technology an attractive choice when setting up short-range wireless ad hoc networks. A typical Bluetooth network, known as a piconet, consists of one master and seven slaves. When several Bluetooth networks interconnect through a number of bridge nodes, they form a scatternet. However, no routing protocol has yet been defined for Bluetooth scatternets. Meanwhile, because of its small size and low cost, Bluetooth is widely "pervasive", in the sense that even low cost electrical appliances are expected to become Bluetooth enabled. If so, scatternets consisting of several piconets will exist even in a home environment. Thus, there is a pressing need to develop an efficient ad hoc routing algorithm to make effective communication possible between distant devices.This study proposes an integrated ad hoc routing and time-slot scheduling (IARTSS) scheme to address the problem of ad hoc routing in Bluetooth networks. Our proposed scheme contains four main mechanisms to address the different facets of the problem, namely Compensation-Based Time-Slot Assignment (CTSA), Traffic Differentiation Queueing (TDQ). Adaptive Master-Slave Switching (AMSS), and an Enhanced AODV algorithm for ad hoc routing. CTSA judiciously allocates time-slots to slaves based on elapsed time, utilization, and queue lengths, helping the bridge nodes to catch up with the lagging of services in piconets. TDQ differentiates traffic into self-originated and forwarded messages, and serves them in a dynamically adjusted adaptive ratio. AMSS calculates the time for a bridge node to stay in a piconet in a more effective way, based on utilization fraction and queue lengths. Enhanced AODV for ad hoc Routing is implemented as a routing protocol for Bluetooth scatternet. We have built a comprehensive Bluetooth simulator and performed extensive simulations to evaluate the proposed IARTSS. We find that our proposed scheme can perform well under a wide variety of practical circumstances, and provides efficient and high performance intrapiconet and inter-piconet communications.