ppxscal/embedding_network huggingface dataset:
On the Hardness of Orthogonal-Order Preserving Graph Drawing
Authors: Ulrik Brandes, Barbara Pampel
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

There are several scenarios in which a given drawing of a graph is to be modified subject to preservation constraints. Examples include shape simplification, sketch-based, and dynamic graph layout. While the orthogonal ordering of vertices is a natural and frequently called for preservation constraint, we show that, unfortunately, it results in severe algorithmic difficulties even for the simplest graphs. More precisely, we show that orthogonal-order preserving rectilinear and uniform edge length drawing is ${\mathcal NP}$-hard even for paths.
MVT: a schema mapping validation tool
Authors: Guillem Rull, Carles Farré, Ernest Teniente, Toni Urpí
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Schema mappings define relationships between schemas in a declarative way. We demonstrate MVT, a mapping validation tool that allows the designer to ask whether the mapping has certain desirable properties. The answers to these questions will provide information on whether the mapping adequately matches the intended needs and requirements. MVT is able to deal with a highly expressive class of mappings and database schemas, which allows the use of negations, order comparisons and null values. The tool does not only provide a Boolean answer as test result, but also a feedback for that result. Depending on the tested property and on the test result, the provided feedback can be in the form of example schema instances, or in the form of an explanation, that is, highlighting the mapping assertions and schema constraints responsible for getting such a result.
Guidelines for conducting and reporting case study research in software engineering
Authors: Per Runeson, Martin Höst
Venue: Empirical Software Engineering (2009)

Case study is a suitable research methodology for software engineering research since it studies contemporary phenomena in its natural context. However, the understanding of what constitutes a case study varies, and hence the quality of the resulting studies. This paper aims at providing an introduction to case study methodology and guidelines for researchers conducting case studies and readers studying reports of such studies. The content is based on the authors' own experience from conducting and reading case studies. The terminology and guidelines are compiled from different methodology handbooks in other research domains, in particular social science and information systems, and adapted to the needs in software engineering. We present recommended practices for software engineering case studies as well as empirically derived and evaluated checklists for researchers and readers of case study research.
Combining quantitative trait loci analyses and microarray data: An empirical likelihood approach
Authors: Dong Wang, Song Xi Chen
Venue: Computational Statistics Data Analysis (2009)

Selective transcriptional profiling is an attractive approach for alleviating the high cost of genetical genomics research as it requires only a subset of individuals in the QTL mapping study for microarray experiments. Current statistical methods for this approach are based on parametric models that might not be appropriate for all experiments. To provide a nonparametric method for analyzing data obtained in selective transcriptional profiling studies, an empirical-likelihood-based inference is derived for multi-sample comparisons when information is available on surrogate variables. The results show that when testing for the association between the transcriptional abundance of a given gene and a known QTL, using relatively inexpensive trait data on extra individuals significantly improves the power for the proposed test.
Information disclosure by answers to XPath queries
Authors: Stefan Böttcher, Rita Hartel
Venue: Journal of Computer Security (2009)

We consider information disclosure caused by answering queries to an XML database. We introduce an audit framework to determine &lsquo;suspicious&rsquo; user queries, i.e. those queries that returned results being sufficient to derive disclosed secret information. We describe secret information in form of a secret query and provide a formal definition of &lsquo;suspicious&rsquo; user queries based on what we call &lsquo;readset fragments&rsquo;, i.e. XML fragments that have been read to produce certain query result nodes. Our approach performs two steps to detect &lsquo;suspicious&rsquo; user queries. First, we analyze the structure of user queries and of the secret query to exclude &lsquo;non-suspicious&rsquo; queries. Second, we derive a formula from user query, query result and secret query, which is satisfiable if and only if the query is &lsquo;non-suspicious&rsquo;.
Aggregated 3D-visualization of a distributed simulation experiment of a queuing system
Authors: Wilhelm Dangelmaier, Matthias Fischer, Daniel Huber, Christoph Laroque, Tim Süß
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The paper describes an approach for an aggregated animation of a simulation experiment in an interactive 3D environment, visualizing multiple, distributed simulation runs. Although the general approach of a 3-dimensional visualization of material flow simulation helps to understand the dynamic behavior of a system better as well as faster, it remains unclear, how typical the animated simulation represents the model, if there is a stochastic influence for even some parameters. By the integrated visualization of multiple distributed simulation runs, this uncertainty can be solved, which will be shown in this paper for a typical simulation study of a queuing system.
Improved scaffolding for Ruby on Rails
Authors: Paul Barry
Venue: Linux Journal (2009)

Ruby on Rails makes pretty code; ActiveScaffold make pretty output.
Conditional matching preclusion sets
Authors: Eddie Cheng, Linda Lesniak, Marc J. Lipman, László Lipták
Venue: Information Sciences: an International Journal (2009)

The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. In this paper, we look for obstruction sets beyond these sets. We introduce the conditional matching preclusion number of a graph. It is the minimum number of edges whose deletion results in a graph with no isolated vertices that has neither perfect matchings nor almost-perfect matchings. We find this number and classify all optimal sets for several basic classes of graphs.
An O(n5/2logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions
Authors: David P. Wagner, Robert Scot Drysdale, Clifford Stein
Venue: Computational Geometry: Theory and Applications (2009)

In this paper we consider the Rectilinear Minimum Link Path Problem among rectilinear obstacles in three dimensions. The problem is well studied in two dimensions, but is relatively unexplored in higher dimensions. We solve the problem in O(@bnlogn) time, where n is the number of corners among all obstacles, and @b is the size of a binary space partition (BSP) decomposition of the space containing the obstacles. There exist methods to find a BSP where in the worst-case @b=@Q(n^3^/^2), giving us an overall worst-case time of O(n^5^/^2logn). Previously known algorithms have had worst-case running times of @W(n^3).
Practical exhaustive optimization phase order exploration and evaluation
Authors: Prasad A. Kulkarni, David B. Whalley, Gary S. Tyson, Jack W. Davidson
Venue: ACM Transactions on Architecture and Code Optimization (TACO) (2009)

Choosing the most appropriate optimization phase ordering has been a long-standing problem in compiler optimizations. Exhaustive evaluation of all possible orderings of optimization phases for each function is generally dismissed as infeasible for production-quality compilers targeting accepted benchmarks. In this article, we show that it is possible to exhaustively evaluate the optimization phase order space for each function in a reasonable amount of time for most of the functions in our benchmark suite. To achieve this goal, we used various techniques to significantly prune the optimization phase order search space so that it can be inexpensively enumerated in most cases and reduce the number of program simulations required to evaluate program performance for each distinct phase ordering. The techniques described are applicable to other compilers in which it is desirable to find the best phase ordering for most functions in a reasonable amount of time. We also describe some interesting properties of the optimization phase order space, which will prove useful for further studies of related problems in compilers.
Stability Properties of Neighbourly Random Polytopes
Authors: Piotr Mankiewicz, Nicole Tomczak-Jaegermann
Venue: Discrete Computational Geometry (2009)

We introduce a quantitative parameter measuring m-neighbourliness of symmetric convex polytopes in &#x211d;k . We discuss this parameter for random polytopes generated by subgaussian vectors and show its stability properties.
An Algorithm of Fertilization Model Fitting Based On Mixed Intelligent Computation
Authors: Li Miao, Jian Zhang, Hu Ze-lin, YuanYuan, Li Lu-jiu
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

During the process of pluralistic fertilization model construction, the unreasonable ratio of nitrogen, phosphorus and kalium easily results in the deviation of fertilizing model. This paper has proposed an adaptive algorithm of fertilization model fitting based mixed intelligent computing of GP/GA, and solved the issue of structure and parameters optimization of adaptive fertilization model. This algorithm has carried out the research of applying control factors to adjust the parameters of fitting function, the appropriate ratio of nitrogen, phosphorus and kalium is regarded as control factors of heuristic search to adjust models, on the basis of history test data dynamical models are generated, and the optimization and correction of models based appropriate ratio of nutrients are achieved.
Fault masking by multiple timing faults in timed EFSM models
Authors: Y. Wang, M. í. Uyar, S. S. Batth, M. A. Fecko
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

Detection of multiple timing faults is a challenging task because these faults, although may be detectable individually, can mask each other's faulty behavior, making a faulty implementation under test (IUT) indistinguishable from a non-faulty one during testing. This phenomenon, called fault masking, is formally defined in this paper. It is proven that graph augmentation algorithms proposed for timed Extended Finite State Machines (EFSMs) with multiple timers can detect pairwise occurrences of classes of timing faults in an IUT and, hence, detects fault masking.
Bio-scale engine: reaction mechanism of nitric oxide reductase cytochrome P450nor from Fusarium oxysporum
Authors: Koki Tsukamoto, Kazuhiko Fukui
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

A unique enzyme mechanism named a bio-scale engine was proposed for a nitric oxide reductase, cytochrome P450nor (P450nor). P450nor has some structural similarities with a combustion engine: the heme pocket, the heme and NADH correspond to a combustion chamber, a piston head, and a spark plug, respectively. Each putative step of this reaction occurred in the heme pocket was characterized using Hartree-Fock calculations. The MO analysis revealed that the NO ligand dissociates from the heme immediately after one-electron reduction by NADH. Analysis of the MO energy revealed that NADH acts as a one-electron reducer, not as a two-electron reducer. Our results divulged that all reaction steps are too fast to become rate-limiting. Therefore, the rate-limiting steps are the process of inhaling NO and NADH into the heme pocket and the process of exhaust a reaction product. Kinetics of these processes was discussed based on a large-amplitude vibration, which helps inhaling and exhaust processes in a heme pocket. The reaction mechanism proposed can explain the published experimental data consistently.
Observability of 4th order dynamical systems
Authors: Jerzy Stefan Respondek
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

The paper is devoted to analyse the observability of 4th order system.. Following the aim of formulation the conditions of initial observability of mentioned fourth order system spectral theory for linear unbounded operators is involved. In the article the theorem on necessary and sufficient conditions on initial observability are formulated and proved.
Multi-clock SVA synthesis without re-writing
Authors: Jiang Long, Andrew Seawright, Paparao Kavalipati
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

This paper presents a compilation procedure for synthesizing multiclock SVA properties for formal verification. The synthesis framework is built upon an existing compilation algorithm for single-clock SVA properties. While we could use the SVA rewriting rules to transform a multi-clock property into a single-clocked property and then apply existing techniques, instead we propose techniques to selectively model the multi-clock operators to produce a smaller checker logic. Through recursive construction and syntactic transformation, we are able demonstrate the efficiency of the technique and the generated checker logic is provably equivalent to the rewritten version.
E-discovery: Creating and Managing an Enterprisewide Program - A Technical Guide to Digital Investigation and Litigation Support
Authors: Karen A. Schuler
Venue:  (2008)

One of the hottest topics in computer forensics today, electronic discovery (e-discovery) is the process by which parties involved in litigation respond to requests to produce electronically stored information (ESI). According to the 2007 Socha-Gelbmann Electronic Discovery Survey, it is now a $2 billion industry, a 60% increase from 2004, projected to double by 2009. The core reason for the explosion of e-discovery is sheer volume; evidence is digital and 75% of modern day lawsuits entail e-discovery.A recent survey reports that U.S. companies face an average of 305 pending lawsuits internationally. For large U.S. companies ($1 billion or more in revenue)that number has soared to 556 on average, with an average of 50 new disputes emerging each year for nearly half of them. To properly manage the role of digital information in an investigative or legal setting, an enterprise--whether it is a Fortune 500 company, a small accounting firm or a vast government agency--must develop an effective electronic discovery program. Since the amendments to the Federal Rules of Civil Procedure, which took effect in December 2006, it is even more vital that the lifecycle of electronically stored information be understood and properly managed to avoid risks and costly mistakes. This books holds the keys to success for systems administrators, information security and other IT department personnel who are charged with aiding the e-discovery process.*Comprehensive resource for corporate technologists, records managers, consultants, and legal team members to the e-discovery process, with information unavailable anywhere else*Offers a detailed understanding of key industry trends, especially the Federal Rules of Civil Procedure, that are driving the adoption of e-discovery programs*Includes vital project management metrics to help monitor workflow, gauge costs and speed the process*Companion Website offers e-discovery tools, checklists, forms, workflow examples, and other tools to be used when conducting e-discovery strategy
Self-tuning query mesh for adaptive multi-route query processing
Authors: Rimma V. Nehme, Elke A. Rundensteiner, Elisa Bertino
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

In real-life applications, different subsets of data may have distinct statistical properties, e.g., various websites may have diverse visitation rates, different categories of stocks may have dissimilar price fluctuation patterns. For such applications, it can be fruitful to eliminate the commonly made single execution plan assumption and instead execute a query using several plans, each optimally serving a subset of data with particular statistical properties. Furthermore, in dynamic environments, data properties may change continuously, thus calling for adaptivity. The intriguing question is: can we have an execution strategy that (1) is plan-based to leverage on all the benefits of traditional plan-based systems, (2) supports multiple plans each customized for different subset of data, and yet (3) is as adaptive as "plan-less" systems like Eddies? While the recently proposed Query Mesh (QM) approach provides a foundation for such an execution paradigm, it does not address the question of adaptivity required for highly dynamic environments. In this work, we fill this gap by proposing a Self-Tuning Query Mesh (ST-QM) --- an adaptive solution for content-based multi-plan execution engines. ST-QM addresses adaptive query processing by abstracting it as a concept drift problem --- a well-known subject in machine learning. Such abstraction allows to discard adaptivity candidates (i.e., the cases indicating a change in the environment) early in the process if they are insignificant or not "worthwhile" to adapt to, and thus minimize the adaptivity overhead. A unique feature of our aproach is that all logical transformations to the execution strategy get translated into a single inexpensive physical operation --- the classifier change. Our experimental evaluation using a continuous query engine shows the performance benefits of ST-QM approach over the alternatives, namely the non-adaptive and the Eddies-based solutions.
Encouraging the Reuse of Knowledge in Communities of Practice by Using a Trust Model
Authors: Aurora Vizcaíno, Javier Portillo-Rodríguez, Juan Pablo Soto, Mario Piattini
Venue: Proceedings of the 2009 International Conference on Information, Process, and Knowledge Management (2009)

One technique with which to foster knowledge reuse in organizations is that of Communities of Practice where the feeling of trust between members is highly important in the sharing and reuse of knowledge. However, CoPs members are currently often geographically distributed, which decreases this feeling of trust. It is consequently more difficult for them to know how trustworthy a fellow-member is. This work attempts to assist CoPs members in deciding what or who to trust. One contribution of this work is a trust model which takes into account certain factors that human beings consciously or unconsciously use when they have to decide whether or not to trust in something or somebody. Moreover, in order to illustrate how the model can be used, a tool with which to recommend documents is described.
A cost-effective distributed file service with QoS guarantees
Authors: Kien Le, Ricardo Bianchini, Thu D. Nguyen
Venue: Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware (2007)

Large-scale, value-added Internet services composed of independent cooperating or competing services will soon become common place. Several groups have addressed the performance, communication, discovery, and description aspects of these services. However, little work has been done on effectively composing paid services and the quality-of-service (QoS) guarantees that they provide. We address these issues in the context of distributed file storage in this paper. In particular, we propose, implement, and evaluate a cost-effective, QoS-aware distributed file service comprising a front-end file service and back-end (third-party) storage services. Our front-end service uses mathematical modeling and optimization to provide performance and availability guarantees at low cost by carefully orchestrating the accesses to the back-end services. Experimental results from our prototype implementation validate our modeling and optimization. We conclude that our approach for providing QoS at low cost should be useful to future composite Internet services.
Emotion on FPGA: Model driven approach
Authors: M. R. Jamali, A. Arami, M. Dehyadegari, C. Lucas, Z. Navabi
Venue: Expert Systems with Applications: An International Journal (2009)

Implementation of intelligent and bio-inspired algorithms in industrial and real applications is arduous, time consuming and costly; in addition, many aspects of system from high level behavior of algorithm to energy consumption of targeted system must be considered simultaneously in the design process. Advancement of hardware platforms such as DSPs, FPGAs and ASICs in recent years has made it increasingly possible to implement computationally complex intelligent systems; on the other hand, however, the design and testing costs of these systems are high. Reusability and extendibility features of the developed models can decrease the total cost and time-to-market of an intelligent system. In this work, model driven development approach is utilized for implementation of emotional learning as a bio-inspired algorithm for embedded purposes. Recent studies show that emotion is a mechanism for fast decision making in human and other animals, and can be assumed as an expert system. Mathematical models have been developed for describing emotion in mammals from cognitive studies. Here brain emotional based learning intelligent controller (BELBIC), which is based on mammalian middle brain, is designed and implemented on FPGA and the obtained embedded emotional controller (E-BELBIC) is utilized for controlling real laboratorial overhead traveling crane in model-free and embedded manner. Short time-to-market, easy testing and error handling, separating concerns, improving reusability and extendibility of obtained models in similar applications are some benefits of the model driven development methodology.
Bound and free excitons in ZnO. Optical selection rules in the absence and presence of time reversal symmetry
Authors: M. R. Wagner, H. W. Kunert, A. G. J. Machatine, A. Hoffmann, P. Niyongabo, J. Malherbe, J. Barnas
Venue: Microelectronics Journal (2009)

The correlation between ionized donor bound exciton recombinations and neutral donor bound exciton recombinations in ZnO has been investigated. The experimental data obtained by means of magneto-photoluminescence (MPL) concerning charge state and localization energies of ionized and neutral donor bound excitons are in good agreement with theoretical predictions. The optical selection rules in absence and presence of time reversal symmetry (TRS) are investigated. It is shown that the inclusion of extra degeneracy due to TRS reveals a number of new states of the same symmetries and essentially does not change the existing optical selection rules.
The design of e-traveler's check with efficiency and mutual authentication
Authors: Chin-Chen Chang, Shih-Chang Chang
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Nowadays, traveling has become a popular leisure activity in our daily lives. Travelers can either use cash or credit cards to pay their bills. However, there is risk of cash being robbed or credit cards being copied. The traveler's check, which is a third choice, comes in to get travelers around such risks and to protect their rights. Nevertheless, traditional travelers' checks cannot keep imposters from forging and cashing them illegally. Hence, we propose a new type of check, called the e-traveler's check, to preserve the rights of holders of e-traveler's check and to prevent the check-issuing banks from being damaged.