ppxscal/embedding_network huggingface dataset:
Intelligent Parsing of Scanned Volumes for Web Based Archives
Authors: Xiaonan Lu, James Z. Wang, C. Lee Giles
Venue: Proceedings of the International Conference on Semantic Computing (2007)

The proliferation of digital libraries and the large amount of existing documents raise important issues in efficient handling of documents. Printed texts in documents need to be converted into digital format and semantic information need to be parsed and managed for effective retrieval. In this work, we attempt to solve the problems faced by current web based archives, where large scale repositories of electronic resources have been built from scanned volumes. Specifically, we focus on the scientific domain and target scanned volumes of scientific publications. Our goal is to automate the semantic processing of scanned volumes, an important and challenging step towards efficient retrieval of content within scanned volumes. We tackle the problem by designing a machine learning-based method to extract multi-level metadata about content of scanned volumes. We combine image and text information within scanned volumes for intelligent parsing. We developed a system and test it with real world data from the Internet Archive, and the experimental evaluation has demonstrated good results.
A web-based information system for management and analysis of patient data after refractive eye surgery
Authors: Bruno Zuberbuhler, Peter Galloway, Aravind Reddy, Manuel Saldana, Richard Gale
Venue: Computer Methods and Programs in Biomedicine (2007)

The aim was to develop a software tool for refractive surgeons using a standard user-friendly web-based interface, providing the user with a secure environment to protect large volumes of patient data. The software application was named ''Internet-based refractive analysis'' (IBRA), and was programmed with the computer languages PHP, HTML and JavaScript, attached to the opensource MySQL database. IBRA facilitated internationally accepted presentation methods including the stability chart, the predictability chart and the safety chart; it was able to perform vector analysis for the course of a single patient or for group data. With the integrated nomogram calculation, treatment could be customised to reduce the postoperative refractive error. Multicenter functions permitted quality-control comparisons between different surgeons and laser units.
Elasto-plastic constitutive model for geotechnical materials with strain-softening behaviour
Authors: Ruiping Guo, Guangxin Li
Venue: Computers Geosciences (2008)

An elasto-plastic model originally developed at Tsinghua University (Tsinghua elasto-plastic model) for soils reflects the observed non-linearity and dilatancy of soils in laboratory tests. The model incorporates a yield criterion, an associated flow rule and a work-hardening law, which can be determined by laboratory tests. This paper presents a modified Tsinghua elasto-plastic constitutive model, which incorporates a function of plastic work as the hardening parameter in the original Tsinghua elasto-plastic model. The modified model has 12 parameters, which are easily determined using conventional triaxial shearing and isotropic compression tests. It can be used to describe strain hardening followed by strain-softening behaviour and to simulate dilatancy during shear application. The modified model was used to determine the relationship between load and settlement for a shallow footing founded on dense Yongding River sand. The results of the numerical analyses were in agreement with the results of hydraulic gradient laboratory tests. The results showed in a preliminary way that the modified model developed in this study was effective for simulating the strain-softening boundary-value problems common in geotechnical engineering.
Very large scale cooperative experiments in Emulab-derived systems
Authors: Keith Sklower, Anthony D. Joseph
Venue: Proceedings of the DETER Community Workshop on Cyber Security Experimentation and Test on DETER Community Workshop on Cyber Security Experimentation and Test 2007 (2007)

Cyber-defense research has been severely limited by the lack of an experimental infrastructure for testing new theories and new technologies in realistic scenarios. Current testbeds are mostly small-scale and limited to small numbers of machines. The cyber DEfense Technology Experimental Research (DETER) testbed, provides a medium-scale test environment with more than 300 nodes. However, there is increasing interest in running experiments at very large scale with more than 1,000 nodes. This paper describes how experiments can be federated across existing small- and medium-scale testbeds using the University of Utah's Emulab software, such as the DETER testbed, to enable the running of massive-scale experiments. We describe the Emulab software and the DETER testbed and we detail the necessary steps for running a federated experiment. We provide a status update on our progress and discuss how a manually configured proof-of-concept experiment could be performed.
Is a bot at the controls?: Detecting input data attacks
Authors: Travis Schluessler, Stephen Goglin, Erik Johnson
Venue: Proceedings of the 6th ACM SIGCOMM workshop on Network and system support for games (2007)

The use of programmatically generated input data in place of human-generated input data poses problems for many computer applications in use today. Mouse clicks and keyboard strokes can automatically be generated to cheat in online games, or to perpetrate click fraud. The ability to discern whether input data was computationally generated instead of created by a human input device is therefore of paramount importance to these types of applications. This paper describes a method for detecting input data that was computationally modified or fabricated. This includes detecting data that was not directly generated by a physical human input device such as a keyboard or mouse. A prototype of this system was built on existing hardware and was shown to be effective at detecting attacks on a real application. This detection method is capable of addressing the majority of input-based attacks currently in use. When used in conjunction with a trusted peripheral, it offers a robust mechanism for ensuring a computer is not at the controls.
ASSIST-V: An Environment Simulator for IBM 360 Systems Software Development
Authors: C. E. Hughes
Venue: IEEE Transactions on Software Engineering (1978)

This paper describes ASSIST-V, a software tool designed for use in the teaching of operating systems, fie management, and machine architecture courses. ASSIST-V is a program that provides an environment for the implementation, testing, and evaluation of systems software for the IBM 360 series machines. This capability is achieved by simulating all relevant aspects of the machine's architecture. In particular, ASSIST-V simulates interrupts, I/O channels, and I/O devices, as well as all IBM 360 machine instructions. In addition, ASSIST-V provides extensive debugging and statistics-gathering aids.
Anomaly Intrusion Detection Methods for Peer-to-Peer System
Authors: Daxin Tian, Yanheng Liu, Bin Li
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Peer-to-peer systems and applications are the hotspot of research of network applications. As peer-to-peer system has no central system and is deployed on an open network, new concerns regarding security have been raised. As an additional security measure, the intrusion detection system would help determine whether unauthorized users are attempting to access, have already accessed, or have compromised the network. Intrusion detection, as the second line of defense, is an indispensable tool for highly survivable networks. In this paper two anomaly intrusion detection methods are proposed for peer-to-peer system. The main characters of the methods are that they can detect intrusion in real-time without any expert knowledge and attack signatures. One method uses hidden Markov model to check reflector DoS attacks, another based on adaptive resonance theory, which can learn the normal behavior with unsupervised method. The experimental P2P system is built on FreePastry 1.4_01 and JDK 1.5.0. The results have indicated that the methods can find DoS attacks immediately and find new intruders with low false alarm rate.
A new smoothing quasi-Newton method for nonlinear complementarity problems
Authors: Sandra Buhmiler, Nataša Krejić
Venue: Journal of Computational and Applied Mathematics (2008)

A new smoothing quasi-Newton method for nonlinear complementarity problems is presented. The method is a generalization of Thomas' method for smooth nonlinear systems and has similar properties as Broyden's method. Local convergence is analyzed for a strictly complementary solution as well as for a degenerate solution. Presented numerical results demonstrate quite similar behavior of Thomas' and Broyden's methods.
Automatic Assembler Source Translation from the Z80 to the MC6809
Authors: M. Smith, B. Luff
Venue: IEEE Micro (1984)

Though technically feasible, the automatic translation of source code from the Z80 to the MC6809 is inefficient and probably impractical.
Impact of Routing Metrics on Path Capacity in Multirate and Multihop Wireless Ad Hoc Networks
Authors: Hongqiang Zhai, Yuguang Fang
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

Finding a path with enough throughput in multihop wireless ad hoc networks is a critical task of QoS Routing. Previous studieson routing algorithms focused on networks with a single channel rate. The capability of supporting multiple channel rates,which is common in wireless systems, has not been carefully studied in routing algorithms. In this paper, we first carry outa comprehensive study on the impacts of multiple rates, interference and packet loss rate on the maximum end-to-end throughputor path capacity. A linear programming problem is formulated to determine the path capacity of any given path. This problemis also extended to a joint routing and link scheduling optimization problem to find a path with the largest path capacity.We show that interference clique transmission time is inversely proportional to the upper bound of the path capacity, andhence we propose to use it as a new routing metric. Moreover, we evaluate the capability of various routing metrics such ashop count, expected transmission times, end-to-end transmission delay or medium time, link rate, bandwidth distance product,and interference clique transmission time to discover a high throughput path. The results show that different routing metricslead to paths with significantly different path capacity, and the interference clique transmission time tends to discoverpaths with higher throughput than other metrics.
Segmentation of step-like signals using fuzzy clustering
Authors: Ali M. Reza, Mahmood Doroodchi
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1998)

Segmentation of step-like signals arises in several application areas&semi; e.g., well-log signal segmentation, ionic-channel signal detection and image segmentation. The objective in processing these signals is to optimally segment the measured signal based on optimization of a criterion function. Recently a sequentially optimum segmentation algorithm is proposed by Moghaddamjoo [13, 14] which performs a reasonable segmentation with affordable computation. This approach, at intermediate and low signal-to-noise ratios (SNRs) has large variances in its estimates. In this work, we apply fuzzy clustering approaches to improve the performance of the aforementioned algorithm at any SNR. In our first approach, we associate a degree of uncertainty to each of the intermediate decisions made by assigning fuzzy membership functions to samples of the signal. These uncertainties, i.e., membership functions, are updated whenever a new decision is made. At the end, a defuzzification approach is used to crystallize the final segmentation of the signal. In the second approach, the fuzzy algorithm starts when the sequentially optimum approach completes its segmentation. Based on this initial segmentation, the fuzzy algorithm defines a set of membership values for each sample point of the signal. The segmentation is then updated by using these membership values. Based on the new estimates of the parameters of the signal, the memberships are recalculated. This updating is continued iteratively until the parameters of the signal converge. At this time a defuzzification algorithm finalizes the segmentation results. Improvement of the results, due to these modifications is significant, especially at low SNRs.
A smoothing Newton-type method for generalized nonlinear complementarity problem
Authors: Xinzhen Zhang, Hefeng Jiang, Yiju Wang
Venue: Journal of Computational and Applied Mathematics (2008)

By using a new type of smoothing function, we first reformulate the generalized nonlinear complementarity problem over a polyhedral cone as a smoothing system of equations, and then develop a smoothing Newton-type method for solving it. For the proposed method, we obtain its global convergence under milder conditions, and we further establish its local superlinear (quadratic) convergence rate under the BD-regular assumption. Preliminary numerical experiments are also reported in this paper.
Towards Skolemize Clauses Binding for Reasoning in Inference Engine
Authors: Rabiah A.K., T. M. T. Sembok, Halimah B.Z.
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

The paper presents a reasoning technique for opendomain Question Answering (QA) system. QA system has attracted more attention to meet information needs providing users with more precise and focused retrieval answers. We proposed a Skolemize Clauses Binding (SCB) for reasoning, along with the theorem proving to provide the basis answer extraction. QA systems employing combination of SCB and resolution theorem proving have been used to provide both satisfying and hypothetical answers. Satisfying answers are associated with ground term corresponding with questions whose logical form contains variables. Hypothetical answer is an answer which comes from the story or plot of text, and required logical thinking because it is not explicitly stated in the knowledge domain. In this case, the answer can be considered as a set of logical formula called skolemize clauses defining sufficient conditions characteristic the tuples of individuals which satisfying the query.
Sandboxing for a free-to-join grid with support for secure site-wide storage area
Authors: Edjozane Cavalcanti, Leonardo Assis, Matheus Gaudencio, Walfredo Cirne, Francisco Brasileiro
Venue: Proceedings of the 2nd International Workshop on Virtualization Technology in Distributed Computing (2006)

Grid computing enables different institutions to access each other's resources, and hence requires very strong security guarantees. We here explore how virtualization was used to provide security for OurGrid, an easy-to-use free-to-join grid that supports Bag-of-Tasks applications. OurGrid poses interesting security challenges. It is free-to-join (which means one runs unknown applications) and strives for simplicity (which means that configuration must be trivial). We show how we have dealt with such challenges by using Xen to virtualize a single machine, and VNET, OCFS2 and NFS to virtualize a site-wide shared file system, creating a sandboxing solution called SWAN. We evaluate SWAN's security and performance. Our results indicate that SWAN is efficient in the single machine virtualization, but less so for the shared file system. Yet, a site-wide file system enables grid jobs to reuse files already transferred to other machines in the site, avoiding expensive inter-site file transfer.
Structured materialized views for XML queries
Authors: Andrei Arion, Véronique Benzaken, Ioana Manolescu, Yannis Papakonstantinou
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

The performance of XML database queries can be greatly enhanced by rewriting them using materialized views. We study the problem of rewriting a query using materialized views, where both the query and the views are described by a tree pattern language, appropriately extended to capture a large XQuery subset. The pattern language features optional nodes and nesting, allowing to capture the data needs of nested XQueries. The language also allows describing storage features such as structural identifiers, which enlarge the space of rewritings. We study pattern containment and equivalent rewriting under the constraints expressed in a structural summary, whose enhanced form also entails integrity constraints. Our approach is implemented in the ULoad [7] prototype and we present a performance analysis.
Robustness analysis of the E.coli chemosensory system to perturbations in chemoattractant concentrations
Authors: Pratap R. Patnaik
Venue: Bioinformatics (2007)

Motivation: Cells of Escherichia coli sense and move toward chemical attractants. This is done through an intricate sensory system that eventually directs the movements of flagellae which regulate the ‘runs’ and ‘tumbles’ of the cells. Under realistic conditions, chemical stimuli often fluctuate due to noise from the environment. The effect of noise on the chemosensory system has been investigated here through the sensitivity coefficients of the concentrations of four key proteins—the phosphorylated forms of CheA, CheB and CheY, and the FliM-CheY∼P complex—that govern chemotactic motility. The letter P denotes phosphorylation. Results: All sensitivities increased with time and then stabilized. However, the four sets of sensitivities differed in their magnitudes and the durations of their transient phases before stabilization. CheA∼P was the least sensitive and CheY∼P the most sensitive. Moreover, while the sensitivities of CheA∼P, CheB∼P and CheY∼P increased with chemoattractant concentration, that of the FliM complex decreased. These differences have been interpreted in terms of the mechanism of the chemosensory system and they have important implications for practical applications of chemotaxis. Contact: pratap@imtech.res.in
A Survey of Enterprise Software Development Risks in a Flat World
Authors: Jesal Bhuta, Sudeep Mallick, S. V. Subrahmanya
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

COTS-based development and global delivery are two major disruptors in modern software development arena. Economic benefits offered by these disruptors cannot be neglected by organizations of any size. Unfortunately, alongside these benefits are several risk factors, which if ill-managed can cost the organizations both in terms of revenue and time. At Infosys, one of India's leading software services organizations, built upon global delivery model we conducted a study by interviewing representatives from 23 projects to identify risks pertinent to COTS-based development in a global setting. We found 6 frequently occurring risks that will be summarized in this paper.
A Flexible Schema Method to Model the Web Data
Authors: Zhiqiang Zhang, Qi Guo
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Nowadays finding relevant information on the World Wide Web (WWW) is often a frustrating task, due to its unstructured nature and the limitations of existing search engines. In this paper, we introduce a schema model for querying the web data which have been used in a specific-domain web data engine SESQ. This model uses an ontology-based method for modeling the Web data, and employs the directedlabeled multi-graph as concept schema for describing the web data of a specific domain at a high abstract level. Users can easily express their query requests with an SQL-like query language over a tree-structure view schema which could be defined based on their real query intent. Underlying schema will help system to organize the data extracted from web and give a logical view to upper components of SESQ.
A Feasible Key Management Scheme in Adhoc Network
Authors: Ya-tao Yang, Ping Zeng, Yong Fang, Ya-Ping Chi
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Because of no centralized administration or fixed network infrastructure, there are many difficulties to carry out key management in dynamic and self-organized adhoc network. A new feasible two-layered key management scheme in Layered and Grouped adhoc Network Structure is proposed in this paper, which can reduce the calculating overheads and improve communication efficiency. Improved Asmuth- Bloom (n, t) threshold key management scheme is designed, which cut down the data traffic of key management between higher leaders, and the calculating complexity is reduced greatly, hence the key-exchange efficiency is improved.
One New In-Operation Self-Testability Mechanism Designed for SoC Microchips following IEEE STD 1500
Authors: Tianjia Sun, Li Guo
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Because of changing temperature, silicon's wearing out, and the other unpredictable factors, besides testing on chips when leaving factory, in some applications, such like life-protected and aviation system, microchips need real-time and in-operation test even if they have been used in system. This paper focuses on a new in-operation self-testing mechanism. This mechanism is used to detect the silicon defects of cores of SoC chips in working state. It makes embedded cores to automatically check their failures by themselves based on IEEE std 1500TM and Core Test Language. According to Experiments, as a compromise, this In-operation Self-Test mechanism slows down the computation performance of SoC chips. Using this mechanism ensures finding exception in time and in turn adopting spare scheme in time, as well as it outperforms previous approaches in reducing cost of importing failure tolerance mechanisms into SoC chips.
Probabilistic incremental program evolution
Authors: Rafal Salustowicz, Jürgen Schmidhuber
Venue: Evolutionary Computation (1997)

Probabilistic incremental program evolution (PIPE) is a novel technique for automatic program synthesis. We combine probability vector coding of program instructions, population-based incremental learning, and tree-coded programs like those used in some variants of genetic programming (GP). PIPE iteratively generates successive populations of functional programs according to an adaptive probability distribution over all possible programs. Each iteration, it uses the best program to refine the distribution. Thus, it stochastically generates better and better programs. Since distribution refinements depend only on the best program of the current population, PIPE can evaluate program populations efficiently when the goal is to discover a program with minimal runtime. We compare PIPE to GP on a function regression problem and the 6-bit parity problem. We also use PIPE to solve tasks in partially observable mazes, where the best programs have minimal runtime.