ppxscal/embedding_network huggingface dataset:
The depleted hydrogen atoms in chemical graph theory
Authors: Lionello Pogliani
Venue: Journal of Computational Methods in Sciences and Engineering (2008)

A new algorithm which explicitly describes the depleted hydrogen atoms is proposed for chemical graph computations, and especially for molecular connectivity model studies. The new algorithm continues to be centred on the concepts of complete graphs and general graphs, but considers the contribution of the bonded hydrogen atoms as a kind of perturbation, which does not need any new graph concept for its formulation. The model quality of the new algorithm is tested and compared with properties, which have already been modelled without the hydrogen perturbation. Chosen classes of compounds display quite different percentages of bonded hydrogen atoms, allowing thus a checking of the contribution of the hydrogen perturbation as a function of the hydrogen content. Obtained results underline the importance of the property, and, in a minor way, the importance of the number of data points, i.e., the number of compounds, in determining the importance of the hydrogen perturbation. Molecular connectivity terms do not always show the same behaviour as the combination of basis indices relatively to the perturbation introduced by the hydrogen atoms.
Technology Diffusion in Social Networks
Authors: Nicole Immorlica
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

Social networks form the basic structure for the diffusion of technologies throughout a society. We present a simple model of Morris [8] for this diffusion based on myopic best-response behavior of the agents and derive necessary and sufficient conditions for a new technology to inflitrate a network in which all agents are intially using an incumbant technology. We then discuss an extention of this model based on joint work with Kleinberg, Mahdian, and Wexler [6] which incorporates compatibility between technologies and discuss how this effects the diffusion. We find some surprising results: in some cases, for one technology to survive the introduction of another, the cost of adopting both technologies must be balanced within a narrow, intermediate range. We also extend our framework to the case of multiple technologies, where we find that a simple model captures the phenomenon of two firms adopting a limited "strategic alliance" to defend against a new, third technology.
Augmented digital zero crossing timing error detector
Authors: Jiri Sebesta
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

Improvements of data timing synchronization algorithms applying an augmentation of zero cross error detector are presented in this paper. Describing methods are destined for high speed PSK coherent demodulator. Timing error synchronizers are usually the most complicated subsystems in the demodulator, and they can be often limitary for their implementation in the DSP hardware above all for high-rate data transmission. This contribution is focused on feedback timing estimators based on ML-criterion. There are analyzed a modification of zero crossing detection and shown an easy implementation into DSP system.
Analysis of burstiness monitoring and detection in an adaptive Web system
Authors: Katja Gilly, Salvador Alcaraz, Carlos Juiz, Ramon Puigjaner
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

Due to the heavy tailed pattern of Internet traffic, it is crucial to monitor the incoming arrival rate in a Web system to preserve its performance. In this study, we focus on the arrival rate processing mechanism as part of the design of an adaptive load balancing Web algorithm. The arrival rate is one of the most important metrics to be monitored in a Web site to avoid the possible congestion of Web servers. Six methods are analysed to detect the burstiness of incoming traffic in a Web system. We define six burstiness factors to be individually included in an adaptive load balancing algorithm, which also needs to monitor some Web servers' parameters continuously, such as the arrival rate at the server or its CPU utilization in order to avoid an unexpected overload situation. We also define adaptive time slot scheduling based on the burstiness factor, which reduces considerably the overhead of the monitoring process by increasing the monitoring frequency when bursty traffic arrives at the system and by decreasing the frequency when no bursts are detected in the arrival rate. Simulation results of the behaviour of the six burstiness factors and adaptive time slot scheduling when sudden changes are detected in the arrival rate are presented and discussed. We have considered a scenario made up of a locally distributed cluster-based Web information system for simulations.
Out-of-band cooperative spectrum sensing in cognitive radio system of multiple spectrum bands
Authors: Bub-Joo Kang, Hee-Soo Park, Yang-Soo Kim, Soo-Min Woo, Sang-Woo Ban
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

This paper proposes the scheme of the out-of-band cooperative spectrum sensing in the cognitive radio (CR) base station to be operated by the multiple spectrum bands. And it suggests signal detection results for the ATSC TV signal as an incumbent signal, and derives signal detection probability and false-alarm probability for the out-of-band cooperative spectrum sensing in the frequency selective Rayleigh fading channel. Numerical results demonstrate that sensing performance for the incumbent signal is improved by the out-of-band cooperative spectrum sensing in case the power strengths of the incumbent signal to be measured by the CR users of the multiple channels are almost similar.
Prediction by Integration of Phase Space Reconstruction and a Novel Evolutionary System under Deregulated Power Market
Authors: Wenyu Zhang, Jinxing Che, Jianzhou Wang, Jinzhao Liang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In deregulated power markets, forecasting electricity loads is one of the most essential tasks for system planning, operation and decision making. Based on an integration of two machine learning techniques: a hybrid evolutionary algorithm which combines PSO and Artificial Fish Swarm Algorithm Search approach based on test-sample error estimate criterion (PSO-AFSAS-TEE) and support vector regression (SVR), this paper proposes a novel evolutionary model for future electricity load forecasting. The proposed evolutionary model adopts an integrated architecture to optimize the prediction of time series. Firstly, the theory of Phase Space Reconstruction (PSR) technique was used for nonlinear dynamic system analysis and prediction with the chaotic load series. Then, a PSO-AFSAS-TEE evolutionary system is proposed to choose the parameters of SVR automatically in time series prediction. The effectiveness of the proposed model is demonstrated with actual data taken from the Australia Power Grid.
Performance evaluation of similarity join for real time information integration
Authors: Manish Kumar, Shane Moriah, Srikumar Krishnamoorthy
Venue: Proceedings of the 2nd Bangalore Annual Compute Conference (2009)

Approximate join processing serves a key role in many application areas such as data cleansing, data integration, text mining, and bio-informatics. There has been much research interest in approximate join processing based on the concept of an edit distance metric. Approximate join processing algorithms generally use a variety of qgram based filtering techniques to improve the scalability of the system. The primary approach taken in the literature involves the exploitation of methods inside a particular database language. However, this is impractical in the case of heterogeneous data spread across multiple databases. A popular alternative approach involves the direct comparison of all permutations of two string pairings. However, such algorithms don't scale well for very large databases, even after applying qgram filters. Here we design a novel, stand-alone filtering technique, essentially a modification of the HashJoin algorithm, to improve the scalability of similarity join processing algorithms. We implement the algorithm and conduct a number of experiments to study the performance of the system. The presented algorithm is also integrated with a real-life data federation solution called Infosys Gradient. The paper presents the performance results on a real-life test bed.
MSNS: A Top-Down MPI-Style Hierarchical Simulation Framework for Network-on-Chip
Authors: Zhongqi Li, Xiang Ling, Jianhao Hu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

As the scale of System-on-Chip (SoC) grows rapidly in recent years, the communication burden between on-chip elements becomes much greater than before. Network-on-Chip (NoC) has been proposed as a solution for this issue. However, it is difficult to use mathematical models to analyze the application-specific NoC with various topologies, switching architectures and routing algorithms. Existing simulators tend to divide the whole simulation flow into independent stages. This division causes inaccurate simulation results in packet delay, traffic load, power consumption, etc. In this paper, we propose a top-down Message passing Interface (MPI) style hierarchical simulation framework, MSNS (MPI Style NoC Simulator), for the NoC systems. It integrates the layers from application down to network infrastructure. This simulation framework can achieve more reliable and accurate simulation results for application-specific NoC system. It is based on SystemC to adapt to both high level abstraction and RTL (Register Transfer Level) implementation. In order to achieve the generality, MPI standard for parallel processes is used as the communication interface. Both a specific parallel computation system and the NoC infrastructure can be evaluated in this simulation framework. The more accurate simulation results can be achieved with dynamic traffic in MSNS. The availability of MSNS is proved with case study.
Data protection utilizing trusted platform module
Authors: Elior Vila, Plamenka Borovska
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

Data protection has become a major requirement for computer systems which process sensitive information especially in daily commercial activities. It is mainly achieved through encryption based on software protections measures that have constantly shown lacks of security against attacks or malicious codes. In this paper we present and explore a real scenario for data encryption utilizing trusted computing technology and its core named trusted platform module (TPM). This new technology, which assists with encryption at the hardware level instead of the software, makes more difficult for intruders and attackers to break into the system and compromise the data stored there. The processes from activation of TPM to the encryption of data are investigated. At the end, an analysis of the advantages and limitations of protection has been made in respect to the functions of TPM and some other models as well.
Automatic recognition of handwritten medical forms for search engines
Authors: Robert Jay Milewski, Venu Govindaraju, Anurag Bhardwaj
Venue: International Journal on Document Analysis and Recognition (2009)

A new paradigm, which models the relationships between handwriting and topic categories, in the context of medical forms, is presented. The ultimate goals are: (1) a robust method which categorizes medical forms into specified categories, and (2) the use of such information for practical applications such as an improved recognition of medical handwriting or retrieval of medical forms as in a search engine. Medical forms have diverse, complex and large lexicons consisting of English, Medical and Pharmacology corpus. Our technique shows that a few recognized characters, returned by handwriting recognition, can be used to construct a linguistic model capable of representing a medical topic category. This allows (1) a reduced lexicon to be constructed, thereby improving handwriting recognition performance, and (2) PCR (Pre-Hospital Care Report) forms to be tagged with a topic category and subsequently searched by information retrieval systems. We present an improvement of over 7% in raw recognition rate and a mean average precision of 0.28 over a set of 1,175 queries on a data set of unconstrained handwritten medical forms filled in emergency environments.
FastYield: variation-aware, layout-driven simultaneous binding and module selection for performance yield optimization
Authors: Gregory Lucas, Scott Cromar, Deming Chen
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

While technology scaling has presented many new and exciting opportunities, new design challenges have arisen due to increased density, and delay and power variations. High-level synthesis has been touted as a solution to these problems, as it can significantly reduce the number of man hours required for a design by raising the level of abstraction. In this paper, we propose a new variation-aware high-level synthesis binding/module selection algorithm, named FastYield, which takes into consideration multiplexers, functional units, registers, and interconnects. Additionally, FastYield connects with the lower levels of the design hierarchy through its inclusion of a timing driven floorplanner guided by a statistical static timing analysis (SSTA) engine which is used to modify/enhance the synthesis solution. FastYield is able to incorporate spatial correlations of process variations in its optimization, which are shown to affect performance yield. On average, FastYield achieves a clock period that is 14.5% smaller, and a performance yield gain of 78.9%, when compared to a variation-unaware algorithm. By making use of accurate timing information, FastYield's rebinding improves performance yield by an average of 9.8% over the initial binding, for the same clock period. To the best of our knowledge, this is the first high-level synthesis binding/module selection algorithm that is layout-driven and variation aware.
Robust Stability Criterion for Delayed Neural Networks with Discontinuous Activation Functions
Authors: Yi Zuo, Yaonan Wang, Lihong Huang, Zengyun Wang, Xinzhi Liu, Xiru Wu
Venue: Neural Processing Letters (2009)

The problem of global robust stability for a class of uncertain delayed neural networks with discontinuous activation functions has been discussed. The uncertainty is assumed to be of norm-bounded form. Based on Lyapunov---Krasovskii stability theory as well as Filippov theory, the conditions are expressed in terms of linear matrix inequality, which make them computationally efficient and flexible. An illustrative numerical example is also given to show the applicability and effectiveness of the proposed results.
Convergence of a semi-Lagrangian scheme for the reduced Vlasov&#x2013;Maxwell system for laser&#x2013;plasma interaction
Authors: Mihai Bostan, Nicolas Crouseilles
Venue: Numerische Mathematik (2009)

The subject matter of this paper concerns the numerical approximation of reduced Vlasov&#x2013;Maxwell models by semi-Lagrangian schemes. Such reduced systems have been introduced recently in the literature for studying the laser&#x2013;plasma interaction. We recall the main existence and uniqueness results on these topics, we present the semi-Lagrangian scheme and finally we establish the convergence of this scheme.
Evaluating Systems Assessing Face-Image Compliance with ICAO/ISO Standards
Authors: M. Ferrara, A. Franco, D. Maltoni
Venue: Biometrics and Identity Management: First European Workshop, BIOID 2008, Roskilde, Denmark, May 7-9, 2008. Revised Selected Papers (2008)

This paper focuses on the requirements for face images to be used in Machine Readable Travel Documents, defined in the ISO/IEC 19794-5 standard. In particular an evaluation framework is proposed for testing software able to automatically verify the compliance of an image to the standard. The results obtained for thee commercial software are reported and compared.
On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks
Authors: Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Katerina Potika
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

We study path multicoloring games that describe situations in which selfish entities possess communication requests in a multifiber all-optical network. Each player is charged according to the maximum fiber multiplicity that her color (wavelength) choice incurs and the social cost is the maximum player cost. We investigate the price of anarchy of such games and provide two different upper bounds for general graphs--namely the number of wavelengths and the minimum length of a path of maximum disutility, over all worst-case Nash Equilibria--as well as matching lower bounds which hold even for trees; as a corollary we obtain that the price of anarchy in stars is exactly 2. We also prove constant bounds for the price of anarchy in chains and rings in which the number of wavelengths is relatively small compared to the load of the network; in the opposite case we show that the price of anarchy is unbounded.
Alternative approaches to include exogenous variables in DEA measures: A comparison using Monte Carlo
Authors: José Manuel Cordero, Francisco Pedraja, Daniel Santín
Venue: Computers and Operations Research (2009)

The theory for measuring efficiency of producers has developed alternative approaches to correct for the effect of non-discretionary variables in the analysis. A review of different options in the specific literature of Data envelopment analysis (DEA) allows us to identify three main approaches: one-stage, two-stage and multi-stage models. Recently, some of these models have been improved through the development of bootstrap methods making it possible to make inference and to avoid bias in the estimation of efficiency scores. The aim of this paper is to test the performance of these recent models and to compare among them using simulated data from a Monte Carlo experimental design.
Research on SVG-based Remote Visualization System of Digital Mine Information
Authors: Y. K. Wang, D. F. Ma
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

This paper analyzed data features and configuration characteristics of digital mine [1], researched on its structure and system framework, discussed the principle and designed concept of the remote data services and data exchange, then built on the remote visualization model of digital mine information, used SVG[2] to describe structure data and real time data of monitoring based on plug-in technology, and then published it by Web modal, so that realized remote visualization of digital mine information. This remote visualization system had a strong structural flexibility, maintainability, expandability, and it had widely applied and played an important role in the "digital mine" process.
Computers in architectural education
Authors: Jens G. Pohl
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

It is perhaps difficult to understand that even today the design of the built environment is best described as an "art" rather than a "science." The designer or architect is an artist who relies heavily on creativity and intuition to solve technological problems.
Term transformers: A new approach to state
Authors: Joseph M. Morris, Alexander Bunkenburg, Malcolm Tyrrell
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2009)

We present a new approach to adding state and state-changing commands to a term language. As a formal semantics it can be seen as a generalization of predicate transformer semantics, but beyond that it brings additional opportunities for specifying and verifying programs. It is based on a construct called a phrase, which is a term of the form C &rtri; t, where C stands for a command and t stands for a term of any type. If R is boolean, C &rtri; R is closely related to the weakest precondition wp(C,R). The new theory draws together functional and imperative programming in a simple way. In particular, imperative procedures and functions are seen to be governed by the same laws as classical functions. We get new techniques for reasoning about programs, including the ability to dispense with logical variables and their attendant complexities. The theory covers both programming and specification languages, and supports unbounded demonic and angelic nondeterminacy in both commands and terms.
Approximation algorithms for the weighted independent set problem in sparse graphs
Authors: Akihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson
Venue: Discrete Applied Mathematics (2009)

The approximability of the unweighted independent set problem has been analyzed in terms of sparseness parameters such as the average degree and inductiveness. In the weighted case, no corresponding results are possible for average degree, since adding vertices of small weight can decrease the average degree arbitrarily without significantly changing the approximation ratio. In this paper, we introduce two weighted measures, namely weighted average degree and weighted inductiveness, and analyze algorithms for the weighted independent set problem in terms of these parameters.
Data space animation for learning the semantics of C++ pointers
Authors: Amruth N. Kumar
Venue: ACM SIGCSE Bulletin (2009)

We incorporated animation of the data space into a web-based tutor for solving problems on C++ pointers and made the tutor available to students. In evaluation of the tutor, we found that data space animation indeed helps students learn the semantics of pointers. But, it is no more effective at this than text explanation of the step-by-step execution of the program.
Remembrance of things tagged: how tagging effort affects tag production and human memory
Authors: Raluca Budiu, Peter Pirolli, Lichan Hong
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We developed a low-effort interaction method called Click2Tag for social bookmarking. Information foraging theory predicts that the production of tags will increase as the effort required to do so is lowered, while the amount of time invested decreases. However, models of human memory suggest that changes in the tagging process may affect subsequent human memory for the tagged material. We compared (1) low-effort tagging by mouse-clicking (Click2Tag), (2) traditional tagging by typing (type-to-tag), and (3) baseline, no tagging conditions. Our results suggest that (a) Click2Tag increases tagging rates, (b) Click2Tag improves recognition of facts from the tagged text when compared to type-to-tag, and (c) Click2Tag is comparable to the no-tagging baseline condition on recall measures. Results suggest that tagging by clicking strengthens the memory traces by repeated readings of relevant words in the text and, thus, improves recognition.