ppxscal/embedding_network huggingface dataset:
Lagrangean relaxation with clusters for point-feature cartographic label placement problems
Authors: Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lorena
Venue: Computers and Operations Research (2008)

This paper presents two new mathematical formulations for the point-feature cartographic label placement problem (PFCLP) and a new Lagrangean relaxation with clusters (LagClus) to provide bounds to these formulations. The PFCLP can be represented by a conflict graph and the relaxation divides the graph in small subproblems (clusters) that are easily solved. The edges connecting clusters are relaxed in a Lagrangean way and a subgradient algorithm improves the bounds. The LagClus was successfully applied to a set of instances up to 1000 points providing the best results of those reported in the literature.
Strong Completeness and Limited Canonicity for PDL
Authors: Gerard Renardel De Lavalette, Barteld Kooi, Rineke Verbrugge
Venue: Journal of Logic, Language and Information (2008)

Propositional dynamic logic ( $$\mathsf{PDL}$$ ) is complete but not compact. As a consequence, strong completeness (the property $$\Gamma \models \varphi \Rightarrow \Gamma \vdash \varphi$$ ) requires an infinitary proof system. In this paper, we present a short proof for strong completeness of $$\mathsf{PDL}$$ relative to an infinitary proof system containing the rule from [¿; β n ]¿ for all $$n \in {\mathbb{N}}$$ , conclude $$[\alpha;\beta^*] \varphi$$ . The proof uses a universal canonical model, and it is generalized to other modal logics with infinitary proof rules, such as epistemic knowledge with common knowledge. Also, we show that the universal canonical model of $$\mathsf{PDL}$$ lacks the property of modal harmony, the analogue of the Truth lemma for modal operators.
Grid Middleware Development in Large International Projects - Experience and Recommendations
Authors: Peter Kunszt
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

The development process in large international projects with multiple partners and different lines of management is not only technically challenging; it is also an organizational and a communication issue. In this paper we summarize the experience in two large European Grid projects, describe the lessons learned, some of the measures taken and finally we give recommendations on what to consider in future large middleware development projects.
Statistical signatures for fast filtering of instruction-substituting metamorphic malware
Authors: Mohamed R. Chouchane, Andrew Walenstein, Arun Lakhotia
Venue: Proceedings of the 2007 ACM workshop on Recurring malcode (2007)

Introducing program variations via metamorphic transformations is one of the methods used by malware authors in order to help their programs slip past defenses. A method is presented for rapidly deciding whether or not an input program is likely to be a variant of a given metamorphic program. The method is defined for the prominent class of metamorphic engines that work by probabilistically selecting instruction-substituting program transformations. A model of the probabilistic engine is used to predictthe expected distribution of instruction forms for different generations ofvariants. These predicted distributions form a type of "statistical signature" for the output of the metamorphic engines. A classifier is defined based on distance between the observed and the predicted instruction form distributions. A case study using the W32.Evol virus shows the classifier can distinguish between malicious samples from multiple generations. The classification method may be useful for practical malware detection by serving as an inexpensive filter to avoid more in-depth analyses where they are unnecessary
A Development of Ubiquitous Biomedical Interface for Facilitating Medical Device Connectivity
Authors: Tung Tran, Hwa-Sun Kim, Hune Cho
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Medical environments incorporate complex and integrated data networks to transfer vast amounts of patient information, such as images, waveforms, and other digital data. To assure interoperability of images and waveforms, HL7 was developed as an international standard to facilitate the communication and storage of medical data. In this study, we developed middleware capable of receiving and converting data into HL7 conformant format from patient monitoring devices. This ubiquitous biomedical interface streamlines clinical workflow and supports patients. Therefore, quality of care will be greatly improved while helping to reduce length of stay.
Boolean dynamics of genetic regulatory networks inferred from microarray time series data
Authors: Shawn Martin, Zhaoduo Zhang, Anthony Martino, Jean-Loup Faulon
Venue: Bioinformatics (2007)

Motivation: Methods available for the inference of genetic regulatory networks strive to produce a single network, usually by optimizing some quantity to fit the experimental observations. In this article we investigate the possibility that multiple networks can be inferred, all resulting in similar dynamics. This idea is motivated by theoretical work which suggests that biological networks are robust and adaptable to change, and that the overall behavior of a genetic regulatory network might be captured in terms of dynamical basins of attraction. Results: We have developed and implemented a method for inferring genetic regulatory networks for time series microarray data. Our method first clusters and discretizes the gene expression data using k-means and support vector regression. We then enumerate Boolean activation–inhibition networks to match the discretized data. Finally, the dynamics of the Boolean networks are examined. We have tested our method on two immunology microarray datasets: an IL-2-stimulated T cell response dataset and a LPS-stimulated macrophage response dataset. In both cases, we discovered that many networks matched the data, and that most of these networks had similar dynamics. Contact: jfaulon@sandia.gov Supplementary information: Supplementary data are available at Bioinformatics online.
A Mathematical Programming Formulation for the Budding Yeast Cell Cycle
Authors: Thomas D. Panning, Layne T. Watson, Clifford A. Shaffer, John J. Tyson
Venue: Simulation (2007)

The budding yeast cell cycle can be modeled by a set of ordinary differential equations with 143 rate constant parameters. The quality of the model (and an associated vector of parameter settings) is measured by comparing simulation results to the eXperimental data derived from observing the cell cycles of over 100 selected mutated forms. Unfortunately, determining whether the simulated phenotype matches eXperimental data is difficult since the eXperimental data tend to be qualitative in nature (i.e., whether the mutation is viable, or which development phase it died in). Because of this, previous methods for automatically comparing simulation results to eXperimental data used a discontinuous penalty function, which limits the range of techniques available for automated estimation of the differential equation parameters. This paper presents a system of smooth inequality constraints that will be satisfied if and only if the model matches the eXperimental data. Results are presented for evaluating the mutants with the two most frequent phenotypes. This nonlinear inequality formulation is the first step toward solving a large-scale feasibility problem to determine the ordinary differential equation model parameters.
Improving Student Performance Using Self-Assessment Tests
Authors: Eduardo Guzman, Ricardo Conejo, Jose-Luis Perez-de-la-Cruz
Venue: IEEE Intelligent Systems (2007)

Two empirical studies conducted in a university setting evaluate Siette, a set of tools for constructing and administering adaptive tests via the Internet. Such tests guarantee reliable and accurate student knowledge diagnosis. Adaptation depends on the question-selection process (performed dynamically during the test) and the test-finalization decision (which relies on the required accuracy of the diagnoses). The studies explore how self-assessment tests influence students' final grades. This article is part of a special issue on intelligent educational systems.
Continuous ant colony optimization algorithms in a support vector regression based financial forecasting model
Authors: Wei-Chiang Hong, Yu-Fen Chen, Peng-Wen Chen, Yi-Hsuan Yeh
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Traditional time series forecasting models are difficult to capture the nonlinear patterns. Support vector regression (SVR) has been successfully used to solve nonlinear regression and times series problems. However, parameters determination for a SVR model is competent to the forecasting accuracy. Several evolutionary algorithms, such as genetic algorithms and simulated annealing algorithms have been used to the parameters selection, however, these algorithms often suffer the problem of being trapped in local optimum. This investigation used continuous ant colony optimization algorithms in a SVR model for selecting suitable parameters, in which encouraging local search in areas where forecasting accuracy improvement continues to be made, then, autocatalytically converge to promising regions. Numerical examples of exchange rates forecasting from an existing literature are employed to compare the performance of the proposed model. Experiment results show that the proposed model outperforms the other approaches in the literature.
EEG Spike Detection Based on Qualitative Modeling of Visual Observation
Authors: Chenxi Shao, Shaobin Li, Jinfeng Fan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

An EEG spike wave detection method based on quali- tative modeling of visual observation is proposed in this paper. The method, based on qualitative measurement of sharpness degree of waves at spike wave frequencies, con- structs a qualitative description model of visual observation to discriminate spike waves from none spike waves. The ap- plication of this method is illustrated with an example. And the corresponding result shows that this method is effective and direct to a certain extent.
Bus Network Optimization Through Time-Dependent Hybrid Algorithm
Authors: Ana C. Olivera, Mariano Frutos, Jessica A. Carballido, Nelida B. Brignole
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This paper focuses on a new hybrid technique that combines a genetic algorithm with simulation to solve the bus-network scheduling problem (BNSP). The BNSP has several factors that complicate both the problem formulation and the selection of efficient algorithms for its resolution. This problem is challenging because not only the BNSP is NP- Complete, but also the existing methods fail to contemplate environment dependent dynamic variables. The hybrid algorithm proposed in this article comprises two stages: a modified GRASP (Greedy Randomized Adaptive Search Procedures) as an initialization method, and the genetic algorithm with simulation to find the values of the environment- dependent dynamic variables. The final goal consisted in designing a meta-heuristic technique that yields an adequate scheduling to solve this general problem. The BNSP, chosen as case study, satisfies both the demand and the offer of transport. The method was applied to a solution of experimental examples with good results.
MPP
Authors: Robert Davey, George Savva, Jo Dicks, Ian N. Roberts
Venue: Bioinformatics (2007)

MPP is a Java application, encompassing both new and established algorithms, for the analysis of gene and marker content datasets arising from high-throughput microarray techniques. MPP analyses flat file output from microarray experiments to determine the probability of the presence or absence of genes or markers within a genome. MPP can construct gene or marker content datasets for a number of genomes and can use the data to estimate an evolutionary tree or network. Results from gene content analyses may be validated by comparing them to known gene contents. MPP was initially developed to analyse data derived from comparative genome hybridization (CGH) microarray experiments in fungi and bacteria. It has recently been adapted to analyse retrotransposon-based insertion polymorphism (RBIP) marker scores derived from tagged microarray marker (TAM) experiments in pea. New analytical procedures may be added easily to MPP as plugins in order to increase the scope of the software. Availability: MPP source code, executables and online help are available at http://cbr.jic.ac.uk/dicks/software/ Contact: robert.davey@bbsrc.ac.uk
Structured Programming: Retrospect and Prospect
Authors: H. D. Mills
Venue: IEEE Software (1986)

Structured programming has changed how programs are written since its introduction two decades ago. However, it still has a lot of potential for more change.
A Real-Time Database Testbed and Performance Evaluation
Authors: Kyoung-Don Kang, Phillip H. Sin, Jisu Oh
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

A lot of real-time database (RTDB) research has been done to process transactions in a timely fashion using fresh data reflecting the current real world status. However, most existing RTDB work is based on simulations. Due to the absence of a publicly available RTDB testbed, it is very hard to evaluate real-time data management techniques in a realistic environment. To address the problem, we design and develop an initial version of a RTDB testbed, called Chronos, atop an open source database [5]. We develop soft real-time database workloads that model online stock trades, providing several knobs to specify workloads for RTDB performance evaluation. In addition, we develop a QoS management scheme in Chronos to detect overload and reduce workloads, via admission control and adaptive temporal data updates, under overload. From the extensive experiments using the stock trading workloads developed in Chronos, we observe that adaptive updates can considerably improve the transaction timeliness. We also observe that admission control can only enhance the timeliness under severe overload, possibly causing underutilization problems for moderate workloads. Overall, we observe several results different from simulation-based work, warranting the need for RTDB performance evaluation in a real database system.
Deploying Low-Latency Anonymity: Design Challenges and Social Factors
Authors: Roger Dingledine, Nick Mathewson, Paul Syverson
Venue: IEEE Security and Privacy (2007)

Tor (the Onion Routing) is an open source, distributed, low-latency anonymity network. This article examines how Tor works, the underlying design philosophy, and some of the challenges in building, deploying, and sustaining a network for anonymous communications.
Fragment-based approximate retrieval in highly heterogeneous XML collections
Authors: I. Sanz, M. Mesiti, G. Guerrini, R. Berlanga
Venue: Data Knowledge Engineering (2008)

Due to the heterogeneous nature of XML data for internet applications exact matching of queries is often inadequate. The need arises to quickly identify subtrees of XML documents in a collection that are similar to a given pattern. Similarity involves both tags, that are not required to coincide, and structure, in which not all the relationships among nodes in the tree structure are strictly preserved. In this paper we present an efficient approach to the identification of similar subtrees, relying on ad-hoc indexing structures. The approach allows to quickly detect, in a heterogeneous document collection, the minimal portions that exhibit some similarity with the pattern. These candidate portions are then ranked according to their actual similarity. The approach supports different notions of similarity, thus it can be customized to different application domains. In the paper, three different similarity measures are proposed and compared. The approach is experimentally validated and the experimental results are extensively discussed.
Modeling and computing throughput capacity of wireless multihop networks
Authors: Patrick Stuedi, Gustavo Alonso
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

Capacity is an important property for QoS support in Mobile Ad Hoc Networks (MANETs) and has been extensively studied. However, most approaches rely on simplified models (e.g., protocol interference, unidirectional links, perfect scheduling or perfect routing) and either provide asymptotic bounds or are based on integer linear programming solvers. In this paper, we present a probabilistic approach to capacity calculation by linking the normalized throughput of a communicating pair in an ad hoc network to the connection probability of the two nodes in a so-called schedule graphG"T(N,E). The effective throughput of a random network is modeled as a random variable and its expected value is computed using Monte-Carlo methods. A schedule graph G"T(N,E) for a given network is directly derived from the physical properties of the network like node distribution, radio propagation and channel assignment. The modularity of the approach leads to a capacity analysis under more realistic network models. In the paper, throughput capacity is computed for various forms of network configurations and the results are compared to simulation results obtained with ns-2.
Rough Neural Network Modeling Through Supervised G-K Fuzzy Clustering
Authors: Dongbo Zhang, Yaonan Wang, Huixian Huang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

On the basis of fuzzy rough data model (FRDM), a method to construct rough neural network is proposed. By adaptive Gaustafason-Kessel (G-K) clustering algorithm, fuzzy partition can be accomplished in input data space. Then based on the search of cluster number, optimal FRDM will be found, and by integrating it with neural network technique, corresponding rough neural network is constructed. The experiment results indicate that rough neural network is superior to traditional Bayesian and learning vector quantization (LVQ) methods, moreover, rough neural network has more powerful synthetic decision-making ability than single FRDM model.
Successful Global Development of a Large-scale Embedded Telecommunications Product
Authors: Marek Leszak, Manfred Meier
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

This paper describes a success story in large-scale global systems & software development. Carried out at several company locations and associated supplier sites, we describe how we manage and develop a complex embedded product in a global dynamic environment. Main acting locations are at Germany and China. Organizational key success factors include very experienced project management team, partnership-based collaboration in cross-functional teams across locations, and well-defined roles & responsibilities on all project levels. Sociological key factors include frequent cross-site visits on engineering and management level, cross-cultural trainings, and high process and quality focus of the whole project team. Technical key factors include feature-driven and timeboxing based iterative process, effective multi-site tools for configuration control, for change management, for joint asynchronous reviews, for software integration and release, and full traceability of all product changes. Evidence by some process measurements is provided supporting our view that our project is very successful.
A Compiler for an Array and Vector Processing Language
Authors: R. H. Perrott
Venue: IEEE Transactions on Software Engineering (1985)

A compiler for a Pascal-based language Actus is described. The language is suitable for the expression of the type of parallelism offered by both array and vector processors. The implementation described is for the Cray-1 computer. An objective of the implementation has been to construct an optimizing compiler which can be readily adapted for a range of array and vector processors. As a result the machine-dependent sections of the compiler have been clearly identified.
Efficient XML-to-SQL query translation: where to add the intelligence?
Authors: Rajasekar Krishnamurthy, Raghav Kaushik, Jeffrey F. Naughton
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

We consider the efficiency of queries generated by XML to SQL translation. We first show that published XML-to-SQL query translation algorithms are suboptimal in that they often translate simple path expressions into complex SQL queries even when much simpler equivalent SQL queries exist. There are two logical ways to deal with this problem. One could generate suboptimal SQL queries using a fairly naive translation algorithm, and then attempt to optimize the resulting SQL; or one could use a more intelligent translation algorithm with the hopes of generating efficient SQL directly. We show that optimizing the SQL after it is generated is problematic, becoming intractable even in simple scenarios; by contrast, designing a translation algorithm that exploits information readily available at translation time is a promising alternative. To support this claim, we present a translation algorithm that exploits translation time information to generate efficient SQL for path expression queries over tree schemas.
A Signal-Aware Uplink Resource Allocation Strategy in IEEE 802.16 Systems
Authors: Jenhui Chen, Chiang-Wei Chang
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

Arranging an appropriate channel to a subscriber so that the bit error rate (BER) of the received packets is signif- icantly reduced and thus enhances the system throughput is an important research direction. This approach can be achieved by considering the received signal-to-noise ratio (SNR) value of each subscriber station (SS) and finds an optimum channel arrangement according to the current sta- tus of SSs. According to the digital communication theory, the BER of a modulation scheme depends on the received SNR; the higher the received SNR, the lower the BER. Thus, in this paper, we exploit the Markov chain to estimate the steady state of the received SNR values at BS from its SSs and propose a resource allocation algorithm (RAA), which dynamically allocates channels according to the SNR esti- mate function, for improving the system capacity. Simula- tion results show that RAA enhances the system capacity as well as reduces the BER.
Enabling Reconfigurable SoC in Multimedia Processing
Authors: Ying Wang, Wei-Nan Chen, Xiao-Wei Wang, Hong-Jun You, Cheng-Lian Peng
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Multimedia processor designers are always challenged by performance, cost and flexibility. Due to the technological advance in FPGA, one of the promising solutions is to enable dynamically reconfigurable SoC in multimedia application. This paper utilizes Reconfigurable SoC (RSoC) in multimedia processing. We propose a feasible run-time reconfigurable system where dynamically Reconfigurable Processing Unit (RPU) is integrated with General Purpose Processor (GPP) at different abstraction level. Furthermore, a simple analysis on performance improvement is given accordingly. As a proof-of-concept, an RSoC prototype based on Xilinx Virtex-II Pro FPGA is also presented at last.