ppxscal/embedding_network huggingface dataset:
Graphical query interfaces for semistructured data: the QURSED system
Authors: Michalis Petropoulos, Yannis Papakonstantinou, Vasilis Vassalos
Venue: ACM Transactions on Internet Technology (TOIT) (2005)

We describe the QURSED system for the declarative specification and automatic generation of Web-based query forms and reports (QFRs) for semistructured XML data. In QURSED, a QFR is formally described by its query set specification (QSS) which captures the complex query and reporting capabilities of the QFR and the associations of the query set specification with visual elements that implement these capabilities on a Web page. The design-time component of QURSED, called QURSED Editor, semi-automates the development of the query set specification and its association with visual elements by translating intuitive visual actions taken by a developer into appropriate specification fragments. The run-time component of QURSED produces XQuery statements by synthesizing fragments from the query set specification that have been activated during the interaction of the end-user with the QFR and renders the query results in interactive reports as specified by the QSS. We describe the techniques and algorithms employed by QURSED with emphasis on how it accommodates the intricacies introduced by the semistructured nature of the underlying data. We present the formal model of the query set specification, as well as its generation via the QURSED Editor, and focus on the techniques and heuristics the Editor employs for translating visual designer input into meaningful specifications. We also present the algorithms QURSED employs for query generation and report generation. An online demonstration of the system is available at http://www.db.ucsd.edu/qursed/.
Almost strict total positivity and a class of Hurwitz polynomials
Authors: Dimitar K. Dimitrov, Juan Manuel Peña
Venue: Journal of Approximation Theory (2005)

We establish sufficient conditions for a matrix to be almost totally positive, thus extending a result of Craven and Csordas who proved that the corresponding conditions guarantee that a matrix is strictly totally positive. Then we apply our main result in order to obtain a new criteria for a real algebraic polynomial to be a Hurwitz one. The properties of the corresponding "extremal" Hurwitz polynomials are discussed.
Extracting context to improve accuracy for HTML content extraction
Authors: Suhit Gupta, Gail Kaiser, Salvatore Stolfo
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Previous work on content extraction utilized various heuristics such as link to text ratio, prominence of tables, and identification of advertising. Many of these heuristics were associated with "settings", whereby some heuristics could be turned on or off and others parameterized by minimum or maximum threshold values. A given collection of settings - such as removing table cells with high linked to non-linked text ratios and removing all apparent advertising -- might work very well for a news website, but leave little or no content left for the reader of a shopping site or a web portal We present a new technique, based on incrementally clustering websites using search engine snippets, to associate a newly requested website with a particular "genre", and then employ settings previously determined to be appropriate for that genre, with dramatically improved content extraction results overall.
Malware Defense Using Network Security Authentication
Authors: Joseph V. Antrosio, Errin W. Fulp
Venue: Proceedings of the Third IEEE International Workshop on Information Assurance (2005)

Malware defenses have primarily relied upon intrusion fingerprints to detect suspicious network behavior. While effective for discovering computers that are already compromised, these systems are not designed to stop the spread or damage of malware. Standard gateway firewalls can prevent outside-based attacks; however, they are ineffective in a mobile network where threats originate from inside and administrators have limited control over client machines. This paper introduces a new strategy for malware defense using security authentication which focuses on vulnerabilities rather than exploits. The proposed system uses a remote security scanner to check for vulnerabilities and quarantines machines using logical network segmentation. This maximizes the usefulness of the machine in question while preventing attacks. Furthermore given the unique ability to quarantine machines without any specialized host software, the proposed system can defend against internal malware threats in a mobile network. Positive results have been achieved utilizing a proof-of-concept model and standard networking tools.
A Compiler Method for Memory-Conscious Mapping of Applications on Coarse-Grained Reconfigurable Architectures
Authors: G. Dimitroulakos, M. D. Galanis, C. E. Goutis
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

This paper presents a compiler methodology for memoryaware mapping on 2-Dimensional coarse-grained reconfigurable architectures that aims in improving the mapped applications' performance. By exploiting data reuse opportunities, the methodology tries to overcome the data memory bandwidth bottleneck, which negatively influences the applications' performance. This is achieved by using foreground memory in the architecture and by properly placing operations in the processing elements. The methodology considers a realistic 2-Dimensional coarse-grained reconfigurable architecture template, which can model the majority of the existing coarse-grained architectures. The experimental results show that the execution time and memory accesses are reduced.
Multicommodity flow, well-linked terminals, and routing problems
Authors: Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We study multicommodity routing problems in both edge and node capacitated undirected graphs. The input to each problem is a capacitated graph G=(V,E) and a set Τ of node pairs. In the simplest setting, the goal is to route a unit of flow for as many pairs as possible subject to the edge (node) capacity constraints. If the flow for a routed pair is required to be along a single path, it is the well-studied disjoint paths problem. If we allow fractional routings of the flow, it is known as the all-or-nothing flow problem. The nodes in Τ are referred to as terminals.In recent work [8,9], the authors obtained the first poly-logarithmic approximation algorithms for some edge routing problems. A key idea in these algorithms is to decompose an instance into a collection of instances in which the terminals are well-linked. Informally speaking, a set of nodes is well-linked in a graph if it does not have small separators. A decomposition into well-linked instances was previously achieved in [8] via räcke's hierarchical graph decomposition for oblivious routing [32]. In this paper, we design a simple new decomposition algorithm that is based on computing sparse cuts in a graph. Our new algorithm improves the earlier results for edge routing problems. Another important advantage of the algorithm is that it also applies to node-capacitated problems. We note that for oblivious routing with node capacities, an Ω√n) lower bound is known on the congestion [18], and hence the oblivious routing approach cannot yield poly-logarithmic bounds for well-linked decompositions. Using the new decomposition, we obtain a poly-logarithmic approximation for the node capacitated all-or-nothing flow problem in general graphs and node-disjoint path problem in planar graphs with O(1) congestion. We also show that the flow-cut gap for product multicommodity flows in node capacitated planar graphs is O(1), improving upon the O(log n) bound from [28].
Information extraction for the future
Authors: Paul S. Jacobs
Venue: Proceedings of the 5th conference on Message understanding (1993)

This broad topic session covered a range of ideas on challenges for the future, along with approaches to meeting these challenges. Although some discussion of matters of scale was common to all the presentations, the speakers offered different perspectives on how to achieve scale-up.
A hybrid genetic algorithm for the weight setting problem in OSPF-IS-IS routing
Authors: L. S. Buriol, M. G. C. Resende, C. C. Ribeiro, M. Thorup
Venue: Networks (2005)

Intradomain traffic engineering aims to make more efficient use of network resources within an autonomous system. Interior Gateway Protocols such as OSPF (Open Shortest Path First) and IS-IS (Intermediate System-Intermediate System) are commonly used to select the paths along which traffic is routed within an autonomous system. These routing protocols direct traffic based on link weights assigned by the network operator. Each router in the autonomous system computes shortest paths and creates destination tables used to direct each packet to the next router on the path to its final destination. Given a set of traffic demands between origin-destination pairs, the OSPF weight setting problem consists of determining weights to be assigned to the links so as to optimize a cost function, typically associated with a network congestion measure. In this article, we propose a genetic algorithm with a local improvement procedure for the OSPF weight-setting problem. The local improvement procedure makes use of an efficient dynamic shortest path algorithm to recompute shortest paths after the modification of link weights. We test the algorithm on a set of real and synthetic test problems, and show that it produces near-optimal solutions. We compare the hybrid algorithm with other algorithms for this problem illustrating its efficiency and robustness. &copy; 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 46(1), 36&ndash;56 2005(This research was done while the first author was a visiting scholar at the Internet and Network Systems Research Center at AT&T Labs Research (AT&T Labs Research Technical Report TD-5NTN5G).)
Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research
Venue: Special Interest Group on Computer Personnel Research Annual Conference (2005)

I am very pleased to welcome you to "the Southland in the spring-time" -- to quote a line from my favorite Indigo Girls' song. Atlanta is at its peak in early-to-mid April when you have the benefit of visiting. Although I am a relative newcomer to Atlanta, it has been my home now for nearly 7 years, and all its beauty is very apparent at this time of year.This is the third year that the conference is being sponsored by the recently merged ACM Special Interest Groups on MIS (Management Information Systems) and CPR (Computer Personnel Research). The "merged" conferences in Philadelphia (2003) and Tucson (2004) were spectacular, and we believe that we have captured the same synergy and quality this year in Atlanta. The conference program this year will consist of 23 research papers and 2 panels. We have planned the conference at a hotel right in the heart of Atlanta's "Buckhead" entertainment district; and I encourage you to take advantage of the great shopping and dining in the neighborhood, as well as some of the cultural and historical features of Atlanta, as time permits.
Solving the asymmetric traveling salesman problem with periodic constraints
Venue: Networks (2004)

In this article we describe a heuristic algorithm to solve the asymmetrical traveling salesman problem with periodic constraints over a given m-day planning horizon. Each city i must be visited ri times within this time horizon, and these visit days are assigned to i by selecting one of the feasible combinations of ri visit days with the objective of minimizing the total distance traveled by the salesman. The proposed algorithm is a heuristic that starts by designing feasible tours, one for each day of the m-day planning horizon, and then employs an improvement procedure that modifies the assigned combination to each of the cities, to improve the objective function. Our heuristic has been tested on a set of test problems purposely generated by slightly modifying known test problems taken from the literature. Computational comparisons on special instances indicate encouraging results. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;1&rpar;, 31&ndash;37 2004
Genome-wide analysis of the effects of heat shock on a Saccharomyces cerevisiae mutant with a constitutively activated cAMP-dependent pathway: Research Articles
Authors: Dawn L. Jones, June Petty, David C. Hoyle, Andrew Hayes, Stephen G. Oliver, Isabel Riba-Garcia, Simon J. Gaskell, Lubomira Stateva
Venue: Comparative and Functional Genomics (2004)

We have used DNA microarray technology and 2-D gel electrophoresis combined with mass spectrometry to investigate the effects of a drastic heat shock from 30 &deg;C to 50 &deg;C on a genome-wide scale. This experimental condition is used to differentiate between wild-type cells and those with a constitutively active cAMP-dependent pathway in Saccharomyces cerevisiae. Whilst more than 50&percnt; of the former survive this shock, almost all of the latter lose viability. We compared the transcriptomes of the wild-type and a mutant strain deleted for the gene PDE2, encoding the high-affinity cAMP phosphodiesterase before and after heat shock treatment. We also compared the two heat-shocked samples with one another, allowing us to determine the changes that occur in the pde2&Delta; mutant which cause such a dramatic loss of viability after heat shock. Several genes involved in ergosterol biosynthesis and carbon source utilization had altered expression levels, suggesting that these processes might be potential factors in heat shock survival. These predictions and also the effect of the different phases of the cell cycle were confirmed by biochemical and phenotypic analyses. 146 genes of previously unknown function were identified amongst the genes with altered expression levels and deletion mutants in 13 of these genes were found to be highly sensitive to heat shock. Differences in response to heat shock were also observed at the level of the proteome, with a higher level of protein degradation in the mutant, as revealed by comparing 2-D gels of wild-type and mutant heat-shocked samples and mass spectrometry analysis of the differentially produced proteins. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Automated signature detection from hand movement
Authors: Mladen Savov, Georgi Gluhchev
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The problem of analyzing hand movements of an individual placing a signature has been studied in order to identify him. A method for locating the signature zone and the duration of the process in series of camera recordings has been developed. Preliminary experiments have been carried out to describe the trajectory of the movement and to select identification features.
Towards a strategic information architecture (SIA) and its initial application
Authors: Jung-Chi Pai, Gwo-Guang Lee
Venue: Journal of Information Science (2005)

As e-business strategies have increasingly attracted the attention of industrial managers, information architecture (IA) is considered as an important blueprint for implementing a successful e-strategy. Furthermore, numerous information architectures have been proposed in recent years by researchers. However, these architectures focus on information systems (IS) and information technology (IT) perspectives, but neglect integration with the information management (IM) strategy. As the complexity of IS/IT applications in an e-business environment grows, effective IM strategy should be considered in developing information architectures. This study proposes a strategic information architecture (SIA) that integrates IS, IT and IM strategy while the IM strategy stresses three dimensions of business conditions and capabilities to cope with IS and IT strategy, including organizational structure, managerial activities and information use. The proposed SIA was initially assessed in a large hospital in Taiwan to examine its usefulness. The implications for IS practice and directions for future research are also discussed.
Exploiting HHPC for Parallel Discrete Event Simulation
Authors: Nael Abu-Ghazaleh, Richard Linderman, Robert Hillman, James Hanna
Venue: Proceedings of the 2004 Users Group Conference (2004)

Parallel Discrete Event Simulation (PDES) is an important application in use in many DoD projects; for example, PDES is used in large-scale war-gaming, and in complex system design, analysis and verification. Improving PDES performance and capacity allows faster simulation times and more extensive analysis of more detailed models. These benefits are not application-specific: they should reflect to any application that uses the improved simulation kernel. In this work, we overview our efforts for optimizing PDES in a Heterogeneous High Performance Computing (HHPC) environment. We profile the SPEEDES simulator and identify several opportunities. We report on our experiences on two fronts: (1) optimizing the communication subsystem-a critical system for PDES since it is a fine-grained application and (2) exploring the use of augmented FPGA boards to accelerate simulation. While such approaches have been attempted for sequential and data path intensive applications, we believe that their use in clustered environments is novel. Both efforts are works in progress;we present our designs and some preliminary analysis results. For example, removing the centralized communication server from event message exchange path with a number of other small improvements to the simulation cycle, improved performance by an average of 20% performance improvement for one of our large benchmarks.
Information retrieval in P2P networks using genetic algorithm
Authors: Wan Yeung Wong, Tak Pang Lau, Irwin King
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Hybrid Peer-to-Peer (P2P) networks based on the direct connection model have two shortcomings which are high bandwidth consumption and poor semi-parallel search. However, they can further be improved by the query propagation model. In this paper, we propose a novel query routing strategy called GAroute based on the query propagation model. By giving the current P2P network topology and relevance level of each peer, GAroute returns a list of query routing paths that cover as many relevant peers as possible. We model this as the Longest Path Problem in a directed graph which is NP-complete and we obtain high quality (0.95 in 100 peers) approximate solutions in polynomial time by using Genetic Algorithm (GA). We describe the problem modeling and proposed GA for finding long paths. Finally, we summarize the experimental results which measure the scalability and quality of different searching algorithms. According to these results, GAroute works well in some large scaled P2P networks.
Awarded Best Paper! - Scalable Centralized Bayesian Spam Mitigation with Bogofilter
Authors: Jeremy Blosser, David Josephsen
Venue: Proceedings of the 18th USENIX conference on System administration (2004)

Bayesian content filters gained popular acclaim when they were put forward in 2002 by Paul Graham as a potential long-term solution for the spam problem. They have since fallen from the limelight, however, due to perceived attack vulnerabilities inherent to all content-based filters as well as real and imagined vulnerabilities specific to Bayesian filters. It has also been assumed that Bayesian filters would be problematic to implement in centralized or large environments due to wordlist management issues. This paper revisits the effectiveness of Bayesian filters as a sustainable singular spam solution for mid- to large-sized environments through a real-world study of the deployment and operation of the Bogofilter Robinson-Fisher Bayesian classification utility in a production mail environment servicing thousands of accounts. Our implementation strategy and methodology as well as our results are described in detail so that they can be evaluated and replicated if desired. Other filtering methodologies which were previously implemented in this environment are also discussed for comparison purposes, though they have since been removed from production due primarily to lack of need. Bayesian classification has been able to solve the spam problem for this user population for the present and observable future, with a single wordlist, and with no secondary spam filtering techniques employed. Significantly, only two business-related legitimate messages have been reported as blocked due to filter misclassification since Bogofilter was deployed.
Computer assisted mapping and records activities systems (CAMRAS)
Authors: William L. Bathke, George J. Hinkle
Venue: ACM SIGDA Newsletter (1978)

The Research Foundation of the American Public Works Association is conducting, under the sponsorship of over twenty agencies, the Computer Assisted Mapping and Record Activities Systems (CAMRAS) program. The CAMRAS program provides for a joint use planning, engineering, and management tool that can greatly improve speed and accuracy in compiling, transferring, and using information; and which provides an economical retrieval of important data needed by a large number and variety of public agencies and utility companies operating within a common geographic area. The specific objectives of the program are (1) to develop, promulgate, and implement suggested procedures and standards for jointly funded, and shared use, computer assisted, geo-based location record systems, and (2) to assist in the initiation, development, testing, and operation of a working system at a size and scope to provide a wide range of measurable and user-oriented data. This will be accomplished through a CAMRAS-type implementation of a test site location. Memphis, Tennessee is serving as the site of the model test application which is to be conducted over a three year period at a funding level of approximately $1.7 million.
Pruning Training Sets for Learning of Object Categories
Authors: Anelia Angelova, Yaser Abu-Mostafa, Pietro Perona
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Training datasets for learning of object categories are often contaminated or imperfect. We explore an approach to automatically identify examples that are noisy or troublesome for learning and exclude them from the training set. The problem is relevant to learning in semi-supervised or unsupervised setting, as well as to learning when the training data is contaminated with wrongly labeled examples or when correctly labeled, but hard to learn examples, are present. We propose a fully automatic mechanism for noise cleaning, called ýdata pruningý, and demonstrate its success on learning of human faces. It is not assumed that the data or the noise can be modeled or that additional training examples are available. Our experiments show that data pruning can improve on generalization performance for algorithms with various robustness to noise. It outperforms methods with regularization properties and is superior to commonly applied aggregation methods, such as bagging.