ppxscal/embedding_network huggingface dataset:
Experience report: playing the DSL card
Authors: Mark P. Jones
Venue: ACM SIGPLAN Notices (2008)

This paper describes our experience using a functional language, Haskell, to build an embedded, domain-specific language (DSL) for component configuration in large-scale, real-time, embedded systems. Prior to the introduction of the DSL, engineers would describe the steps needed to configure a particular system in a handwritten XML document. In this paper, we outline the application domain, give a brief overview of the DSL that we developed, and provide concrete data to demonstrate its effectiveness. In particular, we show that the DSL has several significant benefits over the original, XML-based approach including reduced code size, increased modularity and scalability, and detection and prevention of common defects. For example, using the DSL, we were able to produce clear and intuitive descriptions of component configurations that were sometimes less than 1/30 of the size of the original XML.
Adaptive Routing Strategies for Modern High Performance Networks
Authors: Patrick Geoffray, Torsten Hoefler
Venue: Proceedings of the 2008 16th IEEE Symposium on High Performance Interconnects (2008)

Today's scalable high-performance applications heavily depend on the bandwidth characteristics of their communication patterns. Contemporary multi-stage interconnection networks suffer from network contention which might decrease application performance. Our experiments show that the effective bisection bandwidth of a non-blocking 512-node Clos network is as low as 38% if the network is routed statically.In this paper, we propose and analyze different adaptive routing schemes for those networks. We chose Myrinet/MX to implement our proposed routing schemes. Our best adaptive routing scheme is able to increase the effective bisection bandwidth to 77% for 512 nodes and 100% for smaller node counts. Thus, we show that our proposed adaptive routing schemes are able to improve network throughput significantly.
Local Structure and Behavior of Boolean Bioregulatory Networks
Authors: Heike Siebert
Venue: Proceedings of the 3rd international conference on Algebraic Biology (2008)

A well-known discrete approach to modeling biological regulatory networks is the logical framework developed by R. Thomas. The network structure is captured in an interaction graph, which, together with a set of Boolean parameters, gives rise to a state transition graph describing the dynamical behavior. Together with E. H. Snoussi, Thomas later extended the framework by including singular values representing the threshold values of interactions. A systematic approach was taken in [10] to link circuits in the interaction graph with character and number of attractors in the state transition graph by using the information inherent in singular steady states. In this paper, we employ the concept of local interaction graphs to strengthen the results in [10]. Using the local interaction graph of a singular steady state, we are able to construct attractors of the regulatory network from attractors of certain subnetworks. As a comprehensive generalization of the framework introduced in [10], we drop constraints concerning the choice of parameter values to include so-called context sensitive networks.
Combining Modes of Reasoning: An Application of Abstract Argumentation
Authors: Henry Prakken
Venue: Proceedings of the 11th European conference on Logics in Artificial Intelligence (2008)

Many reasoning problems involve subproblems that can be solved in different ways. Therefore, hybrid reasoning architectures have long been a research topic in AI. However, most work in this area has either focused on particular combinations of reasoning methods or has ignored the problem of handling alternative solutions to subproblems. The present paper proposes an abstract framework for combining modes of reasoning and handling alternative solutions. It is argued that current abstract argumentation systems are either too abstract or too specific for this purpose, so that an intermediate level of abstraction is needed.
Stochastic optimization with mean absolute negative deviation measure for portfolio selection problem
Authors: K. Ibrahim, A. A. Kamil, A. Mustafa
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

Portfolio optimization has been one of the important research fields in financial decision making. The most important character within this optimization problem is the uncertainty of the future returns. To handle such problems, we utilize probabilistic methods alongside with optimization techniques. We develop single stage and two stage stochastic programming with recourse for risk-averse investors and the objective of the stochastic programming models is to minimize the mean absolute negative deviation. We use the so-called "Here-and-Now" approach where the decision-maker makes decision "now" before observing the actual outcome for the stochastic parameter. We compare the optimal portfolios between the single stage and two stage models that hedge against the risk of investment. These models are applied to the optimal selection of stocks listed in Bursa Malaysia and the return of the optimal portfolio is compared between the two stochastic models. The results show that the optimal portfolios of the two stage model out performs the single stage model.
Empirical Analysis of Certificate Revocation Lists
Authors: Daryl Walleck, Yingjiu Li, Shouhuai Xu
Venue: Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security (2008)

Managing public key certificates revocation has long been a central issue in public key infrastructures. Though various certificate revocation mechanisms have been proposed to address this issue, little effort has been devoted to the empirical analysis of real-world certificate revocation data. In this paper, we conduct such an empirical analysis based on a large amount of data collected from VeriSign. Our study enables us to understand how long a revoked certificate lives and what the difference is in the lifetime of revoked certificates by certificate types, geographic locations, and organizations. Our study also provides a solid foundation for future research on optimal management of certificate revocation for different types of certificates requested from different organizations and located in different geographic locations.
A Distributed Generative CSP Framework for Multi-site Product Configuration
Authors: Markus Zanker, Dietmar Jannach, Marius C. Silaghi, Gerhard Friedrich
Venue: Proceedings of the 12th international workshop on Cooperative Information Agents XII (2008)

Today's configuration systems are centralized and do not allow manufacturers to collaborate online for offer-generation or sales-configuration activities. However, the integration of configurable products into the supply-chain of a business requires the cooperation of the various manufacturers' configuration systems to jointly offer valuable solutions to customers. As a consequence, there is a need for methods that enable independent specialized agents to compute such configurations. Several approaches to centralized configuration are based on constraint satisfaction problem (CSP) solving. Most of them extend traditional CSP approaches in order to comply to the specific expressivity and dynamism requirements of configuration and similar synthesis tasks.The distributed generative CSP (DisGCSP) framework proposed here builds on a CSP formalism that encompasses the generative aspect of variable creation and extensible domains of problem variables. It also builds on the distributed CSP (DisCSP) framework, supporting configuration tasks where knowledge is distributed over a set of agents. Notably, the notions of constraint and nogood are further generalized, adding an additional level of abstraction and extending inferences to types of variables. An example application of the new framework describes modifications to the ABT algorithms and furthermore our evaluation indicates that the DisGCSP framework is superior to classic DisCSP for typical configuration task problem encoding.
On Calibration Error of Randomized Forecasting Algorithms
Authors: Vladimir V. V'Yugin
Venue: Proceedings of the 18th international conference on Algorithmic Learning Theory (2007)

Recently, it was shown that calibration with an error less than ¿> 0 is almost surely guaranteed with a randomized forecasting algorithm, where forecasts are chosen using randomized rounding up to ¿ of deterministic forecasts. We show that this error can not be improved for a large majority of sequences generated by a probabilistic algorithm: we prove that combining outcomes of coin-tossing and a transducer algorithm, it is possible to effectively generate with probability close to one a sequence "resistant" to any randomized rounding forecasting with an error much smaller than ¿.
A glimpse of symbolic-statistical modeling by PRISM
Authors: Taisuke Sato
Venue: Journal of Intelligent Information Systems (2008)

We give a brief overview of a logic-based symbolic modeling language PRISM which provides a unified approach to generative probabilistic models including Bayesian networks, hidden Markov models and probabilistic context free grammars. We include some experimental result with a probabilistic context free grammar extracted from the Penn Treebank. We also show EM learning of a probabilistic context free graph grammar as an example of exploring a new area.
Distance-Based Classification in OWL Ontologies
Authors: Claudia D'Amato, Nicola Fanizzi, Floriana Esposito
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

We propose inductive distance-based methods for instance classification and retrieval in ontologies. Casting retrieval as a classification problem with the goal of assessing the individual class-memberships w.r.t. the query concepts, we propose an extension of the k-Nearest Neighbor algorithm for OWL ontologies based on an epistemic distance measure. The procedure can classify the individuals w.r.t. the known concepts but it can also be used to retrieve individuals belonging to query concepts. Experimentally we show that the behavior of the classifier is comparable with the one of a standard reasoner. Moreover we show that new knowledge (not logically derivable) is induced. It can be suggested to the knowledge engineer for validation, during the ontology population task.
Secure Computation from Random Error Correcting Codes
Authors: Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert Haan, Vinod Vaikuntanathan
Venue: Proceedings of the 26th annual international conference on Advances in Cryptology (2007)

Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure computation is that security is maintained even in the presence of an adversary who corrupts a quorum of the processors and who exercises full, malicious control over them. One of the fundamental primitives at the heart of secure computation is secret-sharing. Typically, the required secret-sharing techniques build on Shamir's scheme, which can be viewed as a cryptographic twist on the Reed-Solomon error correcting code. In this work we further the connections between secure computation and error correcting codes. We demonstrate that threshold secure computation in the secure channels model can be based on arbitrary codes. For a network of size n, we then show a reduction in communication for secure computation amounting to a multiplicative logarithmic factor (in n) compared to classical methods for small, e.g., constant size fields, while tolerating $t players to be corrupted, where ¿> 0 can be arbitrarily small. For large networks this implies considerable savings in communication. Our results hold in the broadcast/negligible error model of Rabin and Ben-Or, and complement results from CRYPTO 2006 for the zero-error model of Ben-Or, Goldwasser and Wigderson (BGW). Our general theory can be extended so as to encompass those results from CRYPTO 2006 as well. We also present a new method for constructing high information rate ramp schemes based on arbitrary codes, and in particular we give a new construction based on algebraic geometry codes.
Proceedings of the 4th annual workshop on Cyber security and information intelligence research: developing strategies to meet the cyber security and information intelligence challenges ahead
Authors: Frederick Sheldon, Axel Krings, Robert Abercrombie, Ali Mili
Venue: CSIIRW; Vol. 288 (2008)

As our dependence on the cyber infrastructure grows ever larger, more complex and more distributed, the systems that compose it become more prone to failures and/or exploitation. Intelligence is information valued for its currency and relevance rather than its detail or accuracy. Information explosion describes the pervasive abundance of (public/private) information and the effects of such. Gathering, analyzing, and making use of information constitutes a business- / sociopolitical- / military-intelligence gathering activity and ultimately poses significant advantages and liabilities to the survivability of "our" society. The combination of increased vulnerability, increased stakes and increased threats make cyber security and information intelligence (CSII) one of the most important emerging challenges in the evolution of modern cyberspace "mechanization." The goal of the workshop was to challenge, establish and debate a far-reaching agenda that broadly and comprehensively outlined a strategy for cyber security and information intelligence that is founded on sound principles and technologies. We aimed to discuss novel theoretical and applied research focused on different aspects of software security/dependability, as software is at the heart of the cyber infrastructure.
Letters: Global exponential stability of delayed BAM network on time scale
Authors: Anping Chen, Dejun Du
Venue: Neurocomputing (2008)

Some sufficient conditions are derived to ensure the global exponential stability of delayed bi-directional associative memory (BAM) neural network on time scale, using the time scale calculus theory and the Liapunov functional method. The conditions possess highly important significance and can be easily checked in practice by simple algebraic methods. This is the first time applying the time scale calculus theory to unify and improve discrete-time and continuous-time bi-directional associate memory neural network under the same framework.
Evolution of Computer Graphics and Its impact on Engineering Product Development
Authors: K. Sathyanarayana, G. V. V. Ravi Kumar
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

Computer graphics matured over many years and played an important role in the development of engineering products like automotive and aircraft components. The current CAx (CAD/ CAM/ CAE) tools use computer graphics extensively, while helping in conceiving better designs with improved quality. Nowadays, engineering product development is being done concurrently and collaboratively, due to the advances in computer graphics. This paper presents a brief overview on evolution of computer graphics over the years. It also attempts to present, how advances in computer graphics, have revolutionized the current engineering product development and what future technologies will offer.
The sense of touch: Embodied simulation in a visuotactile mirroring mechanism for observed animate or inanimate touch
Authors: Sjoerd J. H. Ebisch, Mauro G. Perrucci, Antonio Ferretti, Cosimo Del Gratta, Gian Luca Romani, Vittorio Gallese
Venue: Journal of Cognitive Neuroscience (2008)

Previous studies have shown a shared neural circuitry in the somatosensory cortices for the experience of one's own body being touched and the sight of intentional touch. Using functional magnetic resonance imaging (fMRI), the present study aimed to elucidate whether the activation of a visuotactile mirroring mechanism during touch observation applies to the sight of any touch, that is, whether it is independent of the intentionality of observed touching agent. During fMRI scanning, healthy participants viewed video clips depicting a touch that was intentional or accidental, and occurring between animate or inanimate objects. Analyses showed equal overlapping activation for all the touch observation conditions and the experience of one's own body being touched in the bilateral secondary somatosensory cortex (SII), left inferior parietal lobule (IPL)/supramarginal gyrus, bilateral temporal-occipital junction, and left precentral gyrus. A significant difference between the sight of an intentional touch, compared to an accidental touch, was found in the left primary somatosensory cortex (SI/Brodmann's area [BA] 2). Interestingly, activation in SI/BA 2 significantly correlated with the degree of intentionality of the observed touch stimuli as rated by participants. Our findings show that activation of a visuotactile mirroring mechanism for touch observation might underpin an abstract notion of touch, whereas activation in SI might reflect a human tendency to “resonate” more with a present or assumed intentional touching agent.
Study on dynamic increasing the capacity of transmission line
Authors: Lijia Ren, Xiuchen Jiang, Gehao Sheng, Wu Bo
Venue: Proceedings of the 7th WSEAS International Conference on Instrumentation, Measurement, Circuits and Systems (2008)

It is substantially important to improve the transmission capacity of overhead lines, and delay to re-build transmission lines. The Dynamic Line Rating (DLR) system can be used to achieve the aims. It is composed of data acquisition terminals installed on dead-end configuration of a line and one control instrument equipped in dispatch center. The data between the data acquisition terminals and the control instrument is transmitted through GPRS/GSM. Through Ethernet, the control instrument exchanges data with SCADA interface in order to integrate DLR and SCADA system. The paper analyzed mechanical actions for overhead line concerned wind speeds and wind direction in a deflection plane. On this basis, a mechanical analysis model of line's tension and sags was established. Overhead line's state equation was corrected used the relation of temperature and sags, and deduced the ultimately line's temperature. Analyzed the advantages and drawbacks of the mathematical models used to calculate transmission capacity. In order that the DLR system received the optimum dynamic capacity curve, combined the WM and TS model. Finally, the necessity and significance to use DLR in power grid are presented.
A Neural Network Model Based MPC of Engine AFR with Single-Dimensional Optimization
Authors: Yu-Jia Zhai, Ding-Li Yu
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

This paper presents a model predictive control (MPC) based on a neural network (NN) model for air/fuel ration (AFR) control of automotive engines. The novelty of the paper is that the severe nonlinearity of the engine dynamics are modelled by a NN to a high precision, and adaptation of the NN model can cope with system uncertainty and time varying effects. A single dimensional optimization algorithm is used in the paper to speed up the optimization so that it can be implemented to the engine fast dynamics. Simulations on a widely used mean value engine model (MVEM) demonstrate effectiveness of the developed method.
Visualization of Three-Dimensional Flow Structures in the Wake of an Inclined Circular Cylinder
Authors: K. Matsuzaki, M. Shingai, Y. Haramoto, M. Munekata, H. Ohba
Venue: Journal of Visualization (2004)

In the previous measurements of the aerodynamic sound generated from an inclined circular cylinder, it is reported that the sound pressure level (SPL) changes with the aspect ratio and the inclined angle. Therefore, we have investigated the changes in the vortex structure of the wake considered as one of the causes of the SPL variation. Using the low-noise wind tunnel, the velocity fluctuation in the wake is measured to obtain the correlation length. Moreover, the flow visualization is performed with a hydrogen bubble method and a numerical analysis method in order to clarify how the wake structure changes by variations of aspect ratio and inclined angle. As a result of this investigation, it is shown that the spanwise structure of Karman's vortex is highly influenced by the interference of Karman's vortex with the bottom endplate, and that the influence on the spanwise structure in the wake becomes greater as the aspect ratio decreases and the inclined angle increases.
Development of a Methodology for Automated Crater Detection on Planetary Images
Authors: Lourenço P. Bandeira, José Saraiva, Pedro Pina
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

This paper presents a methodology for the automated detection of impact craters on images of planetary surfaces. This modular approach includes a phase of candidate selection, followed by template matching and finally the analysis of a probability volume that allows for the identification of craters on the image. It is applied to a set of images of the surface of the planet Mars, with results that are very promising, in face of future improvements in the methodology.
On dynamic load balancing on graphics processors
Authors: Daniel Cederman, Philippas Tsigas
Venue: Proceedings of the 23rd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware (2008)

To get maximum performance on the many-core graphics processors it is important to have an even balance of the workload so that all processing units contribute equally to the task at hand. This can be hard to achieve when the cost of a task is not known beforehand and when new sub-tasks are created dynamically during execution. With the recent advent of scatter operations and atomic hardware primitives it is now possible to bring some of the more elaborate dynamic load balancing schemes from the conventional SMP systems domain to the graphics processor domain. We have compared four different dynamic load balancing methods to see which one is most suited to the highly parallel world of graphics processors. Three of these methods were lock-free and one was lock-based. We evaluated them on the task of creating an octree partitioning of a set of particles. The experiments showed that synchronization can be very expensive and that new methods that take more advantage of the graphics processors features and capabilities might be required. They also showed that lock-free methods achieves better performance than blocking and that they can be made to scale with increased numbers of processing units.
A New Method Based on Goal Programming for Solving Transportation Problem with Fuzzy Cost
Authors: Lingyun Li, Zuqing Huang, Qingli Da, Jinsong Hu
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Factors affecting the shipping cost were not considered in conventional transportation problem. Using the calculation formula of two fuzzy numbers stemmed from the solution of fuzzy equation based on goal programming, the shipping cost of conventional transportation problem is considered and the tabular method for conventional transportation is developed to fuzzy environment in this paper. The optimal solution of fuzzy transportation problem is obtained successfully by using this tabular method. Compared with the result of conventional transportation problem, the result acquired by our method is more advantaged for decision makers.