ppxscal/embedding_network huggingface dataset:
Research on the Coordination Optimization Method between Traffic Control and Traffic Guidance Based on Genetic Algorithm
Authors: Qing Guan, Zhaosheng Yang, Yuan Wang, Jianmeng Hu, Jian Qin
Venue: Proceedings of the 2008 Fourth International Conference on Natural Computation - Volume 06 (2008)

This paper proposes a coordination optimization method between traffic control and traffic guidance so as to alleviate traffic congestion spatially and temporally. Firstly, this paper summarizes the state of art in this field and brings forward the existing problems. Secondly, considering both network equilibrium control optimization and signal timing optimization, a coordination optimization model including optimization objective function and restriction is proposed. Then, a solution algorithm based on genetic algorithm is proposed. Finally, this paper selects a region with 30 intersections in Changchun city as field test region, uses field data and simulation data to test the method. It comes a conclusion that this method could alleviate traffic congestion to some extent.
Original papers: A methodology to support decision-making on sugar distribution for export channel: A case study of Thai sugar industry
Authors: N. Chiadamrong, R. Kawtummachai
Venue: Computers and Electronics in Agriculture (2008)

Supply chain research can lead to an increase in efficiency, business integration, responsiveness and ultimately market competitiveness. In the sugar industry, such research has expanded rapidly over the past two decades, and has been motivated by low world sugar prices and rising costs of production. However, in the present competitive business environment, a more customer-driven and holistic approach to supply chain management is required. This study focuses on warehouse and distribution management for the export channel of Thai sugar industry. The aim is to suggest the best inventory position and transportation route in the distribution system based on Genetic Algorithm (GA). It provides a systematic and flexible framework to solve the problem of cost minimization of sugar transport from the mills to seaports. The results demonstrate that the tool is not only useful for minimizing the cost, but also for managing sugar warehousing, distribution route and seaport exporting. While the focus of this paper is on sugar supply chain, much of the information is relevant to distribution management of other agricultural commodities as well.
Approximating optimization problems over convex functions
Authors: N&#x00e9;stor E. Aguilera, Pedro Morin
Venue: Numerische Mathematik (2008)

Many problems of theoretical and practical interest involve finding an optimum over a family of convex functions. For instance, finding the projection on the convex functions in Hk(&#x03a9;), and optimizing functionals arising from some problems in economics. In the continuous setting and assuming smoothness, the convexity constraints may be given locally by asking the Hessian matrix to be positive semidefinite, but in making discrete approximations two difficulties arise: the continuous solutions may be not smooth, and functions with positive semidefinite discrete Hessian need not be convex in a discrete sense. Previous work has concentrated on non-local descriptions of convexity, making the number of constraints to grow super-linearly with the number of nodes even in dimension 2, and these descriptions are very difficult to extend to higher dimensions. In this paper we propose a finite difference approximation using positive semidefinite programs and discrete Hessians, and prove convergence under very general conditions, even when the continuous solution is not smooth, working on any dimension, and requiring a linear number of constraints in the number of nodes. Using semidefinite programming codes, we show concrete examples of approximations to problems in two and three dimensions.
VLSI Architecture Design of Fractional Motion Estimation for H.264/AVC
Authors: Yi-Hau Chen, Tung-Chien Chen, Shao-Yi Chien, Yu-Wen Huang, Liang-Gee Chen
Venue: Journal of Signal Processing Systems (2008)

The H.264/AVC Fractional Motion Estimation (FME) with rate-distortion constrained mode decision can improve the rate-distortion efficiency by 2---6 dB in peak signal-to-noise ratio. However, it comes with considerable computation complexity. Acceleration by dedicated hardware is a must for real-time applications. The main difficulty for FME hardware implementation is parallel processing under the constraint of the sequential flow and data dependency. We analyze seven inter-correlative loops extracted from FME procedure and provide decomposing methodologies to obtain efficient projection in hardware implementation. Two techniques, 4×4 block decomposition and efficiently vertical scheduling, are proposed to reuse data among the variable block size and to improve the hardware utilization. Besides, advanced architectures are designed to efficiently integrate the 6-taps 2D finite impulse response, residue generation, and 4×4 Hadamard transform into a fully pipelined architecture. This design is finally implemented and integrated into an H.264/AVC single chip encoder that supports realtime encoding of 720×480 30fps video with four reference frames at 81 MHz operation frequency with 405 K logic gates (41.9% area of the encoder).
ADI 2008 PC Co-chairs' Message
Authors: Christoph Bussler, Olivier Curé, Stefan Jablonski
Venue: Proceedings of the OTM Confederated International Workshops and Posters on On the Move to Meaningful Internet Systems: 2008 Workshops: ADI, AWeSoMe, COMBEK, EI2N, IWSSA, MONET, OnToContent + QSI, ORM, PerSys, RDDS, SEMELS, and SWWS (2008)

Welcome to the First International Workshop on Ambient Data Integration (ADI 2008). The workshop was held in conjunction with the On The Move Federated Conferences and Workshops (OTM 2008), November 9-14, 2008 in Monterrey, Mexico.This workshop is concerned with the subjects that are relevant for the success of data integration systems, such as distribution and conceptualization. The five accepted papers propose an interesting mix of conceptual, technical and application-oriented solutions.
An improved DFA for fast regular expression matching
Authors: Domenico Ficara, Stefano Giordano, Gregorio Procissi, Fabio Vitucci, Gianni Antichi, Andrea Di Pietro
Venue: ACM SIGCOMM Computer Communication Review (2008)

Modern network devices need to perform deep packet inspection at high speed for security and application-specific services. Finite Automata (FAs) are used to implement regular expressions matching, but they require a large amount of memory. Many recent works have proposed improvements to address this issue. This paper presents a new representation for deterministic finite automata (orthogonal to previous solutions), called Delta Finite Automata (δFA), which considerably reduces states and transitions and requires a transition per character only, thus allowing fast matching. Moreover, a new state encoding scheme is proposed and the comprehensive algorithm is tested for use in the packet classification area.
The profile of temperature and voltage dependent series resistance and the interface states in (Ni/Au)/Al0.3Ga0.7N/AlN/GaN heterostructures
Authors: Z. Tekeli, Ş. Altındal, M. Çakmak, S. Özçelik, E. Özbay
Venue: Microelectronic Engineering (2008)

The temperature dependence of capacitance-voltage (C-V) and the conductance-voltage (G/w-V) characteristics of (Ni/Au)/Al"0"."3Ga"0"."7N/AlN/GaN heterostructures were investigated by considering the effect of series resistance (R"s) and interface states N"s"s in a wide temperature range (79-395K). Our experimental results show that both R"s and N"s"s were found to be strongly functional with temperature and bias voltage. Therefore, they affect the (C-V) and (G/w-V) characteristics. The values of capacitance give two peaks at high temperatures, and a crossing at a certain bias voltage point (~3.5V). The first capacitance peaks are located in the forward bias region (~0.1V) at a low temperature. However, from 295K the second capacitance peaks appear and then shift towards the reverse bias region that is located at ~-4.5V with increasing temperature. Such behavior, as demonstrated by these anomalous peaks, can be attributed to the thermal restructuring and reordering of the interface states. The capacitance (C"m) and conductance (G/w-V) values that were measured under both reverse and forward bias were corrected for the effect of series resistance in order to obtain the real diode capacitance and conductance. The density of N"s"s, depending on the temperature, was determined from the (C-V) and (G/w-V) data using the Hill-Coleman Method.
Obligations with Deadlines and Maintained Interdictions in Privacy Regulation Frameworks
Authors: Guillaume Piolle, Yves Demazeau
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02 (2008)

We aim at providing artificial agents with logical tools to reason specifically on privacy-related regulations, in order to comply with them. In order to express these regulations, we propose a deontic and temporal logic based on predicates dealing with personal data management. Using an example, we show the need for specific operators to express obligations with deadlines and maintained interdictions. We define a set of eight specific requirements for such operators, we evaluate the existing proposals with respect to these requirements and we adapt our own ones, to better suit to our formalism.
Prediction models for multi-dimensional power-performance optimization on many cores
Authors: Matthew Curtis-Maury, Ankur Shah, Filip Blagojevic, Dimitrios S. Nikolopoulos, Bronis R. de Supinski, Martin Schulz
Venue: Proceedings of the 17th international conference on Parallel architectures and compilation techniques (2008)

Power has become a primary concern for HPC systems. Dynamic voltage and frequency scaling (DVFS) and dynamic concurrency throttling (DCT) are two software tools (or knobs) for reducing the dynamic power consumption of HPC systems. To date, few works have considered the synergistic integration of DVFS and DCT in performance-constrained systems, and, to the best of our knowledge, no prior research has developed application-aware simultaneous DVFS and DCT controllers in real systems and parallel programming frameworks. We present a multi-dimensional, online performance predictor, which we deploy to address the problem of simultaneous runtime optimization of DVFS and DCT on multi-core systems. We present results from an implementation of the predictor in a runtime library linked to the Intel OpenMP environment and running on an actual dual-processor quad-core system. We show that our predictor derives near-optimal settings of the power-aware program adaptation knobs that we consider. Our overall framework achieves significant reductions in energy (19% mean) and ED2 (40% mean), through simultaneous power savings (6% mean) and performance improvements (14% mean). We also find that our framework outperforms earlier solutions that adapt only DVFS or DCT, as well as one that sequentially applies DCT then DVFS. Further, our results indicate that prediction-based schemes for runtime adaptation compare favorably and typically improve upon heuristic search-based approaches in both performance and energy savings.
Partially Ordered Monads for Monadic Topologies, Rough Sets and Kleene Algebras
Authors: P. Eklund, M. A. Galán, Werner Gähler
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

In this paper we will show that partially ordered monads contain sufficient structure for modelling monadic topologies, rough sets and Kleene algebras. Convergence represented by extension structures over partially ordered monads includes notions of regularity and compactness. A compactification theory can be developed. Rough sets [Z. Pawlak, Rough sets, Int. J. Computer and Information Sciences 5 (1982) 341356] are modelled in a generalized setting with set functors. Further, we show how partially ordered monads can be used in order to obtain monad based examples of Kleene algebras building upon a wide range of set functors far beyond just strings [S. C. Kleene, Representation of events in nerve nets and finite automata, In: Automata Studies (Eds. C. E. Shannon, J. McCarthy), Princeton University Press, 1956, 3-41] and relations [A. Tarski, On the calculus of relations, J. Symbolic Logic 6 (1941), 65-106].
Trends in interactive services for digital television infrastructure
Authors: Bojan Bakmaz, Zoran Bojkovic
Venue: WSEAS TRANSACTIONS on COMMUNICATIONS (2008)

The challenge of multimedia communications is to provide applications that integrate text, image, and video information and to do it in a way that presents ease of use and interactivity. This paper deals with trends in interactive services for digital television infrastructure from the point of view of return channel and flow of information. We start with a short overview concerning previous work on this hot topic. Then, we deal with the interactive services in digital television infrastructure. After that adequate solutions for return channel are presented. Finally, flow of information in the interactive TV services for mobile devices is described including applications on mobile devices.
Automatic decomposition of kinetic models of signaling networks minimizing the retroactivity among modules
Authors: Julio Saez-Rodriguez, Stefan Gayer, Martin Ginkel, Ernst Dieter Gilles
Venue: Bioinformatics (2008)

Motivation: The modularity of biochemical networks in general, and signaling networks in particular, has been extensively studied over the past few years. It has been proposed to be a useful property to analyze signaling networks: by decomposing the network into subsystems, more manageable units are obtained that are easier to analyze. While many powerful algorithms are available to identify modules in protein interaction networks, less attention has been paid to signaling networks de.ned as chemical systems. Such a decomposition would be very useful as most quantitative models are de.ned using the latter, more detailed formalism. Results: Here, we introduce a novel method to decompose biochemical networks into modules so that the bidirectional (retroactive) couplings among the modules are minimized. Our approach adapts a method to detect community structures, and applies it to the so-called retroactivity matrix that characterizes the couplings of the network. Only the structure of the network, e.g. in SBML format, is required. Furthermore, the modularized models can be loaded into ProMoT, a modeling tool which supports modular modeling. This allows visualization of the models, exploiting their modularity and easy generation of models of one or several modules for further analysis. The method is applied to several relevant cases, including an entangled model of the EGF-induced MAPK cascade and a comprehensive model of EGF signaling, demonstrating its ability to uncover meaningful modules. Our approach can thus help to analyze large networks, especially when little a priori knowledge on the structure of the network is available. Availability: The decomposition algorithms implemented in MATLAB (Mathworks, Inc.) are freely available upon request. ProMoT is freely available at http://www.mpi-magdeburg.mpg.de/projects/promot Contact: gayers@mpi-magdeburg.mpg.de Supplementary information:Supplementary data are available at Bioinformatics online.
Traceability of slash-and-burn land-use history using optical satellite sensor imagery: a basis for chronosequential assessment of ecosystem carbon stock in Laos
Authors: Y. Inoue, J. Qi, A. Olioso, Y. Kiyono, T. Horie, H. Asai, K. Saito, Y. Ochiai, T. Shiraiwa, L. Douangsavanh
Venue: International Journal of Remote Sensing (2007)

This study examined the use of satellite sensor imagery for chronosequential assessment of land use and ecosystem carbon stock in slash-and-burn (S/B) regions of Laos. The segmentation approach was useful because the boundaries of S/B patches are subject to change due to natural or anthropogenic factors. Polygon-based classification using six optical bands of Landsat Enhanced Thematic Mapper Plus (ETM+) imagery showed that S/B patches could be discriminated with high accuracy (0.98). Normalized difference spectral indices, NDSI[i, j] = [Rj -Ri ]/[Rj +Ri ], using reflectances Rj and Ri at j and i nm wavelengths for S/B polygons during four consecutive years (1999-2002) showed that NDSI[2215, 830], NDSI[1650, 830] and NDSI[660, 830] ( = the normalized difference vegetation index, NDVI) values decreased significantly in S/B years compared to those under fallow conditions (by 0.21±0.04, 0.20±0.04 and 0.17±0.03, respectively). Only slight differences were found before and after the S/B year, regardless of fallow length or biomass estimated by the allometry method. Relating reflectance signatures directly to fallow biomass was unsuitable, but these NDSIs were also useful for distinguishing S/B patches. Land-use history, including the community age of fallow vegetation, can be traced on a pixel basis using a superimposed set of segmented classified images.
HapCUT
Authors: Vikas Bansal, Vineet Bafna
Venue: Bioinformatics (2008)

Motivation: The goal of the haplotype assembly problem is to reconstruct the two haplotypes (chromosomes) for an individual using a mix of sequenced fragments from the two chromosomes. This problem has been shown to be computationally intractable for various optimization criteria. Polynomial time algorithms have been proposed for restricted versions of the problem. In this article, we consider the haplotype assembly problem in the most general setting, i.e. fragments of any length and with an arbitrary number of gaps. Results: We describe a novel combinatorial approach for the haplotype assembly problem based on computing max-cuts in certain graphs derived from the sequenced fragments. Levy et al. have sequenced the complete genome of a human individual and used a greedy heuristic to assemble the haplotypes for this individual. We have applied our method HapCUTto infer haplotypes from this data and demonstrate that the haplotypes inferred using HapCUT are significantly more accurate (20–25% lower maximum error correction scores for all chromosomes) than the greedy heuristic and a previously published method, Fast Hare. We also describe a maximum likelihood based estimator of the absolute accuracy of the sequence-based haplotypes using population haplotypes from the International HapMap project. Availability: A program implementing HapCUT is available on request. Contact: vibansal@cs.ucsd.edu
Automated Optic Nerve Disc Parameterization
Authors: Povilas Treigys, Vydūnas Šaltenis, Gintautas Dzemyda, Valerijus Barzdžiukas, Alvydas Paunksnis
Venue: Informatica (2008)

New information technologies provide a possibility of collecting a large amount of fundus images into databases. It allows us to use automated processing and classification of images for clinical decisions. Automated localization and parameterization of the optic nerve disc is particularly important in making a diagnosis of glaucoma, because the main symptoms in these cases are relations between the optic nerve and cupping parameters. This article describes the automated algorithm for the optic nerve disc localization and parameterization by an ellipse within colour retinal images. The testing results are discussed as well.
A new paradigm: Data-aware scheduling in grid computing
Authors: Tevfik Kosar, Mehmet Balman
Venue: Future Generation Computer Systems (2009)

Efficient and reliable access to large-scale data sources and archiving destinations in a widely distributed computing environment brings new challenges. The insufficiency of the traditional systems and existing CPU-oriented batch schedulers in addressing these challenges has yielded a new emerging era: data-aware schedulers. In this article, we discuss the limitations of the traditional CPU-oriented batch schedulers in handling the challenging data management problem of large-scale distributed applications; give our vision for the new paradigm in data-intensive scheduling; and elaborate on our case study: the Stork data placement scheduler.
Proceedings of the 2008 ACM conference on Recommender systems
Venue: ACM Conference On Recommender Systems (2008)

Recommender systems have emerged as an important part of the solution to the information overload problem facing today's Web users. Combining ideas and techniques from information filtering, user modeling, artificial intelligence, user interface design and human-computer interaction, recommender systems provide users with proactive suggestions that are tailored to meet their particular information needs and preferences. Indeed recommender systems have enjoyed considerable commercial success and continue to play an increasingly important role in many online services, from Amazon and Yahoo! to iTunes and Last.fm. It is our great pleasure to welcome you to the Second ACM International Conference on Recommender Systems (RecSys), which builds on a wonderful legacy of research workshops, the Recommenders Summer School held in Bilbao in 2006, and the First ACM International Conference on Recommender Systems held in Minneapolis in 2007. This conference brings together leaders in the field, from both research and practice, to explore the latest innovations, challenges, and opportunities for recommender systems technologies. The call for papers attracted 121 submissions, a more than 100% increase compared to 2007, with authors from nearly 30 different countries. After a detailed scientific review process the program committee selected 38 papers for publication in the proceedings and presentation at the conference, a 31% acceptance rate. Of these 38 papers, 20 full-length papers were accepted for oral presentation and 18 papers for poster presentation, of which 15 were full-length papers and 3 were short-papers. In addition, the conference program includes a keynote presentation by Yahoo!'s Andrei Broder; two panel sessions filled with industry leaders sharing experiences and raising challenges for the research community; and presentations of six early-stage recommender start-ups, each bidding to win a $100,000 prize from Strands, Inc. The conference also includes three tutorials, in which leaders of the field explore hot topics in more detail; and a doctoral symposium to provide an opportunity for doctoral students to explore and develop their research interests in an interdisciplinary workshop, under the guidance of a panel of distinguished research faculty.
An efficient architecture of bitplane coding with high frame rate for VC-1
Authors: Yo-Han Lim, Jung-Sun Kang
Venue: Image Communication (2008)

In this paper, we present an efficient hardware architecture of bitplane coding in VC-1. Bitplane coding has demerit of implementation area because bitplane coding supports seven different decoding modes. Also, particular mode consumes many clock cycles. In order to reduce the area, we use suitable register banks that different modes share for decoding and use two SRAMs that are shared for different frames. Also, we designed MODE2 and DIFF modules with high-performance capability to account for the intensive processing that Differential-2 mode undergoes. The hardware implementation, based on 0.065-@mm standard cell library, consumes only 19.52K (excluding two 135x40 SRAMs) gates at a clock frequency of 133MHz. Our architecture supports real-time bitplane coding for high-resolution (1280x720) video at 30fps.