ppxscal/embedding_network huggingface dataset:
Modeling and simulation of critical infrastructures case: rescuing of intelligence and electronic security core applications (RIESCA)
Authors: Rauno Pirinen, Jyri Rajamäki
Venue: Proceedings of the 2nd conference on European computing conference (2008)

There are a number of systems, such as transport and logistic, electricity and telecommunication, hydropower and nuclear power stations that are critical to the day-to-day functioning of any advance society such as Finland. When assessing possible risks, it is only seldom taken into account that power, hydropower and nuclear power plants, are critically dependent on the reliability and security of information systems. Information security is often enhanced by purchasing and extending technical solutions without considering any systematic planning and knowledge of how to protect the different segments of the system. Hence, the risk is compounded not only by the investment of information security resources to the wrong targets but also by the unplanned integration of systems and the related information security components may even create new security risks. As a consequence, systems that are critical to the proper functioning of the society may not work as well as they should. The Rescuing of Intelligence and Electronic Security Core Applications (RIESCA) project is targeted to offer contributive and constructive solutions to this problem. The research project will produce information security management methods that can be used to ensure the proper functioning of critical systems under varying circumstances. Furthermore, it will also lead to the development of a learning and laboratory environment for critical systems management and development. This paper describes the RIESCA project and proposes new data collection and analysis model for critical systems evaluation as well as creation of new evaluation methods.
Inside Web Dynpro for Java -- 2nd Edition, 2nd edition
Authors: Chris Whealy
Venue:  (2007)

Fully updated and significantly expanded, this 2nd edition of the bestselling developers' guide teaches readers how to obtain the best results from Web Dynpro for Java in release SAP NetWeaver 7.0. Starting with the origins of Web Dynpro, the component concept, design principles and the phase model, this book leaves no questions about the backgrounds open. Then, learn everything you need to know about basic development topics like the context at design- and runtime, the handling of UI elements, and multi-language applications. Experienced developers will further benefit greatly from chapters on advanced topics like dynamic context manipulation, navigation and error handling, or the Adaptive RFC layer. The author's extensive experience with developing and implementing Web Dynpro applications since the very first Web Dynpro release, the invaluable tips, best practices and caveats he shares with his readers make this book a must-read reference for every serious Web Dynpro for Java developer. Highlights: Web Dynpro Component Concept Designing a Web Dynpro Application The Web Dynpro Phase Model The Context at design- and runtime Working with UI Elements Multilanguage Applications Navigation and Error Handling The Adaptive RFC Layer JCo Connection Management The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Overlay self-organization for traffic reduction in multi-broker publish-subscribe systems
Authors: Elisabetta Di Nitto, Daniel J. Dubois, Raffaela Mirandola
Venue: Proceedings of the 6th international conference on Autonomic computing (2009)

In this work we propose a heuristic-based strategy to modify the broker overlay of a multi-broker publish-subscribe system for optimizing the message flow. The approach we adopt is inspired by self-organization in biology and makes the broker overlay behave as an autonomic distributed system. We define our approach in the case of a topic-based publish-subscribe system, and show experimentally that it is able to reduce the overall network traffic in a faster way when compared to similar approaches.
Stability of Hopfield Neural Networks with Time-Varying Delay
Authors: Huimin Xiao
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

In this paper, the stability of Hopfield Neural Networks with Time-Varying Delay is investigated by means of Lyapunov functions and the generalized Halanay delay differential inequality. The obtained results are the algebraic criteria entirely and are obviously practical
The improvement of data quality --a conceptual model
Authors: Tatjana Welzer, Izidor Golob, Boštjan Brumen, Marjan Družovec, Ivan Rozman, Hannu Jaakkola
Venue: Proceeding of the 2008 conference on Information Modelling and Knowledge Bases XIX (2008)

Usage of data in various areas and its electronic availability has upgraded the importance of data quality to the highest level. In general, data quality has at least a syntactic and a semantic component. The syntactic component is relatively easily reached, mostly supported by tools, while the semantic component requires further research. In many cases, data is taken from different sources which are distributed among enterprises and vary in levels of quality. Special attention needs to be paid to data upon which critical decisions are met. In the paper we will focus on data quality in connection with conceptual modeling, including reuse of models and/or parts of them and data policy for increasing the quality of data.
Effect of heat treatments on electric dipole at metal/high-k dielectric interfaces measured by in situ XPS
Authors: Andrei Zenkevich, Yuri Lebedinskii, Yuri Matveyev, Sabina Spiga, Luca Lamagna, Marco Fanciulli
Venue: Microelectronic Engineering (2009)

The paper describes the application of X-ray photoelectron spectroscopy (XPS) based method to quantify changes in the electric dipole formed at the metal/dielectric interface following heat treatments of metal-oxide-semiconductor (MOS) stack in different environments. The presented results on Me (Me=Au, Ni)/dielectric (dielectric=HfO"2, LaAlO"3) evidence the oxygen vacancies generated in dielectric contribute to the effective work function changes.
A generating function for all semi-magic squares and the volume of the Birkhoff polytope
Authors: J. A. De Loera, F. Liu, R. Yoshida
Venue: Journal of Algebraic Combinatorics: An International Journal (2009)

We present a multivariate generating function for all n×n nonnegative integral matrices with all row and column sums equal to a positive integer t, the so called semi-magic squares. As a consequence we obtain formulas for all coefficients of the Ehrhart polynomial of the polytope B n of n×n doubly-stochastic matrices, also known as the Birkhoff polytope. In particular we derive formulas for the volumes of B n and any of its faces.
Face Recognition with LWIR Imagery Using Local Binary Patterns
Authors: Heydi Méndez, Cesar San Martín, Josef Kittler, Yenisel Plasencia, Edel García-Reyes
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

In this paper, the merits of the Local Binary Patterns (LBP) representation are investigated in the context of face recognition using long-wave infrared images. Long-wave infrared images are invariant to illumination, but at the same time they are affected by a fixed-pattern noise inherent to this technology. The fixed-pattern is normally compensated by means of a non-uniformity correction method. Our study shows that the LBP approach is robust to the fixed-pattern noise, as well as to the presence of glasses. Not only no noise suppressing preprocessing is needed, but in fact if a non-uniformity correction method is applied, the image texture is amplified and the performance of the LBP degraded.
Designing markets: economics, computer science and the real world
Authors: Susan Athey
Venue: Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (2009)

The recent explosion of electronic commerce has frequently brought together economists, computer scientists, and businesses in the pursuit of new designs for markets that succeed in attracting participants and becoming viable businesses. Real-world design has been guided by theoretical insights, empirical evidence and practical experience. This talk explores where new theory and evidence are needed to answer questions of practical importance, as well as what kinds of conceptual frameworks, insights and approaches have the most influence and relevance in practice. One key insight from the economics of market design is that the effect of the rules of a market, such as auction rules, on participation and division of surplus within a marketplace is often much more important than the impact of the rules on behavior for a fixed set of participants. The talk will also consider how to map between stylized models and practice, focusing on identifying the assumptions from theory that most often fail in practice and the new questions that this implies for theory; for example, in a realistic application there is typically no mechanism that yields efficient allocation in a prior-free, incentive-compatible model, and so the market designer needs a framework for evaluating tradeoffs between alternative mechanisms, and must consider the relative importance of different types of robustness and features of a mechanism. Finally, in online marketplaces with rapidly evolving market designs, theory can be used to guide real-world experiments and empirical analysis, and empirical evidence can in turn inform us about what theoretical issues are most important.
Development of a dual-modal information presentation of sequential relationship
Authors: Shuang Xu, Xiaowen Fang, Susy Chan
Venue: International Journal of Mobile Learning and Organisation (2009)

This study focuses on how to design a visual-auditory presentation to minimise the interference in information processing between modality channels; and to improve the effectiveness of mental integration of multimodal information. A method was proposed to convert textual information describing sequential relationships into a 'graphics &#43; voice' presentation. It was hypothesised that this dual-modal presentation would result in superior comprehension performance and user satisfaction as compared with the pure textual display. Findings of our experiment fully supported the hypothesis and would benefit interface design of mobile applications by alleviating the overabundance of information output in the visual channel.
Reproducible gene selection algorithm with random effect model in cDNA microarray-based CGH data
Authors: Mijung Kim
Venue: Expert Systems with Applications: An International Journal (2009)

cDNA microarray-based CGH with 30 pairs of normal and tumor gastric tissues using cDNA microarrays containing 17,000 human genes was performed to delineate the individual genes that undergo copy-number changes. Frequency analysis is more efficient than mean analysis for detecting subtle differences in copy-number when most of the data are from low spot intensities, such as those seen when performing cDNA microarray-based CGH. This article studies on how to deal with variation of data in replicated measurements for application of frequency analysis. A reproducible gene selection algorithm was developed for minimizing variation across array measurements. This algorithm incorporates a measurement of reproducibility with a random effect model and collects individual genes with reproducible copy-number change as a filtering process. This algorithm controls both reproducibility and number of remaining genes by dropping genes with large variations and results in increased reproducibility. Application of this algorithm allows for obtaining a well-filtered set of genes, thus dealing with variation in frequency analysis of the replicated data.
Spatial-Temporal relation-based Energy-Efficient Reliable routing protocol in wireless sensor networks
Authors: Min Chen, Taekyoung Kwon, Shiwen Mao, Victor C. M. Leung
Venue: International Journal of Sensor Networks (2009)

Delivering sensory data to the sink reliably in Wireless Sensor Networks (WSNs) calls for a scalable, energy-efficient and error-resilient routing solution. In this paper, a Spatial-Temporal relation-based Energy-Efficient Reliable (STEER) routing protocol is proposed to achieve the above goals. As opposed to the next-hop-selection-first, data-relay-next approach, which is typical in traditional routing protocols in WSNs, STEER reverses these two steps. In STEER, each data packet is relayed by broadcasting, and, among the neighbours (closer to the sink) that receive the data, one next-hop node will be elected. In so doing, eligibility as a next hop is evaluated by temporal gradient, which is similar to backoff for channel access in IEEE 802.11 systems. The value of temporal gradient is determined locally by the spatial information of each neighbour. To quantify the temporal gradient systematically, a spatial-temporal mapping function is proposed. Comprehensive simulations show that STEER performs well to provide efficient and robust routing in highly unreliable WSNs.
Efficient spectral ultraspherical-dual-Petrov-Galerkin algorithms for the direct solution of (2n+1)th-order linear differential equations
Authors: E. H. Doha, W. M. Abd-Elhameed
Venue: Mathematics and Computers in Simulation (2009)

Some efficient and accurate algorithms based on ultraspherical-dual-Petrov-Galerkin method are developed and implemented for solving (2n+1)th-order linear elliptic differential equations in one variable subject to homogeneous and nonhomogeneous boundary conditions using a spectral discretization. The key idea to the efficiency of our algorithms is to use trial functions satisfying the underlying boundary conditions of the differential equations and the test functions satisfying the dual boundary conditions. The method leads to linear systems with specially structured matrices that can be efficiently inverted. Numerical results are presented to demonstrate the efficiency of our proposed algorithms.
A theoretical and empirical study of computing earnings per share
Authors: Oliver Kim
Venue:  (2008)

In this dissertation, I propose a theoretic foundation to compute earnings per share (EPS) for firms with both common shares and dilutive securities outstanding. I derive a new EPS measure, market EPS, which is defined as the expectation of the future earnings per share. From the view of investors, market EPS naturally captures EPS information in stock prices. It is compared to basic EPS and diluted EPS, which are suggested in the dual presentation under the current U.S. rule. The comparisons show that market EPS is below the range defined by basic EPS and diluted EPS as long as the expected future abnormal earnings is zero. This indicates a weakness behind the thinking of the current rule. I also find that the diluted EPS by the treasury stock method overstates market EPS more than that by the if-converted method. In addition, given all conditions the same, the upward bias of diluted EPS of growth firms is smaller than that of non-growth firms. To support the proposed theory, I conduct an empirical study using a dataset containing 3130 firm-year employee stock option plans from 1997 to 2006. The results show that diluted EPS under the rule is, on average, larger than market EPS by 1%. Furthermore, the bias is larger for firms that are heavy users of employee stock options and for firms that have higher earnings volatility.
Separating invariants
Authors: Gregor Kemper
Venue: Journal of Symbolic Computation (2009)

This paper studies separating subsets of an invariant ring or, more generally, of any set consisting of functions. We prove that a subset of a finitely generated algebra always contains a finite separating subset. We also show that a general version of Noether's degree bound holds for separating invariants, independently of the characteristic. While the general finiteness result is non-constructive, the Noether bound provides an easy algorithm for computing separating invariants of finite groups. The paper also contains a conceptual investigation of the difference between separating and generating subsets.
Finding the longest isometric cycle in a graph
Authors: Daniel Lokshtanov
Venue: Discrete Applied Mathematics (2009)

A cycle in a graph G is isometric if the distance between two vertices in the cycle is equal to their distance in G. Finding the longest isometric cycle of a graph is then a natural variant of the problem of finding a longest cycle. While most variants of the longest cycle problem are NP-complete, we show that quite surprisingly, one can find a longest isometric cycle in a graph in polynomial time.
Lifetime reliability studies for microprocessor chip architecture
Authors: Timothy M. Pinkston
Venue:  (2008)

Deep submicron semiconductor technologies enable greater degrees of device integration and performance, but they also pose many new microprocessor design challenges. Chip lifetime reliability as affected by wearout-related failures, for one, has become a major concern. Atomic-range dimensions, escalating power densities, process/operational variation and other consequences of extreme scaling all contribute to this concern. Much recent research has been conducted to understand and model the effects of wearout failure mechanisms such as negative bias temperature instability (NBTI), electromigration, gate oxide breakdown, etc., on chip lifetime reliability. Circuit and architectural techniques for mitigating and/or tolerating such wearout failures are also being explored for extending chip lifetime. Nonetheless, the challenge of modeling and improving the effects of low-level failures at the architecture-level continues to be a rather daunting one. This research tackles the issue of modeling chip lifetime reliability at the architecture level. We propose a new and robust structure-aware lifetime reliability model at the architecture-level, where only devices vulnerable to wearout failure mechanisms and the effective stress condition of these devices are taken into account for the failure rate of microarchitecture structures. In formulating the proposed model, we separate architecture-level factors from technology-dependent parameters which are encapsulated into a newly proposed technology-independent unit of reliability, called the FIT of reference circuit (FORC). This allows architects to abstract processor reliability analysis from technology-level effects. In addition, the proposed model is extended for processor systems employing microarchitectural redundancy which has been used as a means of improving chip lifetime reliability. Microarchitectural redundancy is typically used in a reactive way, allowing chips to maintain operability in the presence of failures, by detecting and isolating, correcting and/or replacing components on a first-come, first-served basis only after they become faulty. In this research, we explore an alternative, more preferred method of exploiting microarchitectural redundancy to enhance chip lifetime reliability. In our approach, redundancy is used proactively to allow non-faulty microarchitecture components to be temporarily deactivated (i.e., in recovery mode) on a rotating basis, to suspend and/or recover from certain wearout effects. This approach improves chip lifetime reliability by warding off the onset of wearout failures as opposed to reacting to them posteriorly. To make our proactive approach more effective, we also propose circuit-level techniques to exploit the recovery effect of wearout failure mechanisms such as NBTI while components operate in recovery mode. Finally, the proposed approach is applied to cache SRAM susceptible to failure caused by NBTI for exploiting microarchitectural redundancy targeted to enhancing cache SRAM lifetime reliability.
Human-aided computer cognition for e-discovery
Authors: Christopher Hogan, Robert Bauer, Dan Brassil
Venue: Proceedings of the 12th International Conference on Artificial Intelligence and Law (2009)

Throughout its history, AI researchers have alternatively seen their mission as producing computer behavior that is indistinguishable from that of humans or as providing computational tools to augment human intelligence. The legal context provides a particularly rich domain for exploring the benefits of both approaches because human judgments are central to the delivery of just outcomes with formal mechanisms for challenging any and all judgments within its core practices and institutions. Through exploration of legal e-discovery, we explicitly address these alternative paradigms for applying interdisciplinary sciences to knowledge-based systems. We demonstrate through a series of quantitative studies that a system architecture for Human-Aided Computer Cognition automates and replicates judgments significantly better than the ubiquitous, traditional Computer-Aided Human Cognition of senior attorney relevance as is defined in legal practice.
Automatic exploration of datacenter performance regimes
Authors: Peter Bodik, Rean Griffith, Charles Sutton, Armando Fox, Michael I. Jordan, David A. Patterson
Venue: Proceedings of the 1st workshop on Automated control for datacenters and clouds (2009)

Horizontally scalable Internet services present an opportunity to use automatic resource allocation strategies for system management in the datacenter. In most of the previous work, a controller employs a performance model of the system to make decisions about the optimal allocation of resources. However, these models are usually trained offline or on a small-scale deployment and will not accurately capture the performance of the controlled application. To achieve accurate control of the web application, the models need to be trained directly on the production system and adapted to changes in workload and performance of the application. In this paper we propose to train the performance model using an exploration policy that quickly collects data from different performance regimes of the application. The goal of our approach for managing the exploration process is to strike a balance between not violating the performance SLAs and the need to collect sufficient data to train an accurate performance model, which requires pushing the system close to its capacity. We show that by using our exploration policy, we can train a performance model of a Web 2.0 application in less than an hour and then immediately use the model in a resource allocation controller.
Heuristics in Argumentation: A Game-Theoretical Investigation
Authors: Régis Riveret, Henry Prakken, Antonino Rotolo, Giovanni Sartor
Venue: Proceeding of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008 (2008)

This paper provides a game-theoretical investigation on how to determine optimal strategies in dialogue games for argumentation. To make our ideas as widely applicable as possible, we adopt an abstract dialectical setting and model dialogues as extensive games with perfect information where optimal strategies are determined by preferences over outcomes of the disputes. In turn, preferences are specified in terms of expected utility combining the probability of success of arguments with the costs and benefits associated to arguments.