ppxscal/embedding_network huggingface dataset:
Database development and 3D modeling of textural variations in heterogeneous, unconsolidated aquifer media: Application to the Milan plain
Authors: Tullia Bonomi
Venue: Computers Geosciences (2009)

The textural and hydrogeologic properties of loose deposits are closely connected to the sedimentary processes occurring in fluvial and glacio-fluvial systems. The proposed procedure combines geologic knowledge, coded well data logs stored in a hydrogeologic georeferenced database, geographic information system (GIS) and 3D calculation software to reconstruct the detailed distribution of the subsoil's hydrogeologic parameters. The calculations may apply to any subsoil part, bounded by one or more surfaces. This methodological approach may be applied to diverse investigation depths, vertical intervals detailed to varying extents, on a local or regional scale. Employing great quantities of well data logs, recorded in different ways and distributed across large areas, has enabled significant spatial sedimentologic reconstruction. Two groups of parameters were considered: textural (percentages of gravel, sand and clay) and hydrogeologic (hydraulic conductivity and porosity). In terms of sedimentology, the method reconstructs spatial heterogeneity both along cross-sections and for an entire user-defined volume to analyze the sediments' energy functions and their distribution; deposition rates are proportional to process intensity and distribution with time. In terms of hydrogeology, detailed 3D hydrogeologic structural data provide detailed input for hydrogeologic models in groundwater resource management and planning, such as for transport models.
On the optimal design of two-tier wireless relay networks
Authors: Vahid Pourahmadi, Shervan Fashandi, Aladdin Saleh, Amir K. Khandani
Venue: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems (2008)

It is known that the achievable data rate per user can be increased when relays are deployed in wireless networks. However, the drawback with this solution is that some of the network resources should be allocated to the relays. In this paper, we consider a two-tier network where all users should send/receive data in two hops (via a relay). Applying vector quantization, we approximately find the location of the relays. These approximate relays' locations are also computed analytically when the number of relays is less than six. Having the relays' locations, the network average transmission rate is evaluated in terms of a set of network parameters. Then, in the multi-dimensional space of these network parameters, we introduce the concept of neutrality-surface. The neutrality-surface is defined such that the performance of any relay network operating below this surface is inferior to that of a simple no-relay network with the same parameters. Finally, we study the relative and differential relaying gain for different network configurations.
The PARSEC benchmark suite: characterization and architectural implications
Authors: Christian Bienia, Sanjeev Kumar, Jaswinder Pal Singh, Kai Li
Venue: Proceedings of the 17th international conference on Parallel architectures and compilation techniques (2008)

This paper presents and characterizes the Princeton Application Repository for Shared-Memory Computers (PARSEC), a benchmark suite for studies of Chip-Multiprocessors (CMPs). Previous available benchmarks for multiprocessors have focused on high-performance computing applications and used a limited number of synchronization methods. PARSEC includes emerging applications in recognition, mining and synthesis (RMS) as well as systems applications which mimic large-scale multithreaded commercial programs. Our characterization shows that the benchmark suite covers a wide spectrum of working sets, locality, data sharing, synchronization and off-chip traffic. The benchmark suite has been made available to the public.
On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP
Authors: Hubert Garavel, Gwen Salaün, Wendelin Serwe
Venue: Science of Computer Programming (2009)

Hardware process calculi, such as Chp (Communicating Hardware Processes), Balsa, or Haste (formerly Tangram), are a natural approach for the description of asynchronous hardware architectures. These calculi are extensions of standard process calculi with particular synchronisation features implemented using handshake protocols. In this article, we first give a structural operational semantics for value-passing Chp. Compared with the existing semantics of Chp defined by translation into Petri nets, our semantics is general enough to handle value-passing Chp with communication channels open to the environment, and is also independent of any particular (2- or 4-phase) handshake protocol used for circuit implementation. We then describe the translation of Chp into the process calculus Lotos (ISO standard 8807), in order to allow asynchronous hardware architectures expressed in Chp to be verified using the Cadp verification toolbox for Lotos. A translator from Chp to Lotos has been implemented and successfully used for the compositional verification of two industrial case studies, namely an asynchronous implementation of the Des (Data Encryption Standard) and an asynchronous interconnect of a NoC (Network on Chip).
EPoS
Authors: Thasso Griebel, Malte Brinkmeyer, Sebastian Böcker
Venue: Bioinformatics (2008)

Summary: Estimating Phylogenies of Species (EPoS) is a modular software framework for phylogenetic analysis, visualization and data management. It provides a plugin-based system that integrates a storage facility, a rich user interface and the ability to easily incorporate new methods, functions and visualizations. EPoS ships with persistent data management, a set of well-known phylogenetic algorithms and a multitude of tree visualization methods and layouts. Implemented algorithms cover distance-based tree construction, consensus trees and various graph-based supertree methods. The rendering system can be customized for, say, different edge and node styles. Availability: Executables and source code are available under the LGPL license at http://www.bio.informatik.uni-jena.de/epos. Contact: thasso@minet.uni-jena.de Supplementary information: The homepage contains tutorials and documentation for both users and programmers who want to develop plugins and extensions.
A semiparametric test to detect associations between quantitative traits and candidate genes in structured populations
Authors: Meijuan Li, Cavan Reilly, Timothy Hanson
Venue: Bioinformatics (2008)

Motivation: Although population-based association mapping may be subject to the bias caused by population stratification, alternative methods that are robust to population stratification such as family-based linkage analysis have lower mapping resolution. Recently, various statistical methods robust to population stratification were proposed for association studies, using unrelated individuals to identify associations between candidate genes and traits of interest. The association between a candidate gene and a quantitative trait is often evaluated via a regression model with inferred population structure variables as covariates, where the residual distribution is customarily assumed to be from a symmetric and unimodal parametric family, such as a Gaussian, although this may be inappropriate for the analysis of many real-life datasets. Results: In this article, we proposed a new structured association (SA) test. Our method corrects for continuous population stratification by first deriving population structure and kinship matrices through a set of random genetic markers and then modeling the relationship between trait values, genotypic scores at a candidate marker and genetic background variables through a semiparametric model, where the error distribution is modeled as a mixture of Polya trees centered around a normal family of distributions. We compared our model to the existing SA tests in terms of model fit, type I error rate, power, precision and accuracy by application to a real dataset as well as simulated datasets. Contact: meijuanl@biostat.umn.edu
Personalized recommendation in social tagging systems using hierarchical clustering
Authors: Andriy Shepitsen, Jonathan Gemmell, Bamshad Mobasher, Robin Burke
Venue: Proceedings of the 2008 ACM conference on Recommender systems (2008)

Collaborative tagging applications allow Internet users to annotate resources with personalized tags. The complex network created by many annotations, often called a folksonomy, permits users the freedom to explore tags, resources or even other user's profiles unbound from a rigid predefined conceptual hierarchy. However, the freedom afforded users comes at a cost: an uncontrolled vocabulary can result in tag redundancy and ambiguity hindering navigation. Data mining techniques, such as clustering, provide a means to remedy these problems by identifying trends and reducing noise. Tag clusters can also be used as the basis for effective personalized recommendation assisting users in navigation. We present a personalization algorithm for recommendation in folksonomies which relies on hierarchical tag clusters. Our basic recommendation framework is independent of the clustering method, but we use a context-dependent variant of hierarchical agglomerative clustering which takes into account the user's current navigation context in cluster selection. We present extensive experimental results on two real world dataset. While the personalization algorithm is successful in both cases, our results suggest that folksonomies encompassing only one topic domain, rather than many topics, present an easier target for recommendation, perhaps because they are more focused and often less sparse. Furthermore, context dependent cluster selection, an integral step in our personalization algorithm, demonstrates more utility for recommendation in multi-topic folksonomies than in single-topic folksonomies. This observation suggests that topic selection is an important strategy for recommendation in multi-topic folksonomies.
The petrol station replenishment problem with time windows
Authors: Fabien Cornillier, Gilbert Laporte, Fayez F. Boctor, Jacques Renaud
Venue: Computers and Operations Research (2009)

In the Petrol Station Replenishment Problem with Time Windows (PSRPTW) the aim is to optimize the delivery of several petroleum products to a set of petrol stations using a limited heterogeneous fleet of tank-trucks. More specifically, one must determine the quantity of each product to deliver, the assignment of products to truck compartments, delivery routes, and schedules. The objective is to maximize the total profit equal to the sales revenue, minus the sum of routing costs and of regular and overtime costs. This article first proposes a mathematical formulation of the PSRPTW. It then describes two heuristics based on arc preselection and on route preselection. Extensive computational tests on randomly generated instances confirm the efficiency of the proposed heuristics. Finally, a performance analysis on a real case shows a distance reduction of more than 20% over a solution obtained by an experienced dispatcher.
Available bandwidth-based association in IEEE 802.11 Wireless LANs
Authors: Heeyoung Lee, Seongkwan Kim, Okhwan Lee, Sunghyun Choi, Sung-Ju Lee
Venue: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems (2008)

The performance of an IEEE 802.11 station heavily depends on the selection of an AP (Access Point) that the station is associated with to access the Internet. The conventional approach to the AP selection is based on the received signal strength called RSSI (Received Signal Strength Indication) from APs within the transmission range. This approach however, might yield unbalanced traffic load among APs as the station chooses an AP only based on the signal strength, instead of considering the AP load and the level of contention on medium access. Accordingly, the station that is associated with the highest-RSSI AP might suffer from poor network performance. In this paper, we propose a new association metric, EVA (Estimated aVailable bAndwidth) with which a station can find the AP that provides the maximum achievable throughput among scanned APs. EVA is designed to estimate the available bandwidth on a channel with respect to a station that is to join a WLAN (Wireless Local Area Network). A station equipped with EVA observes a channel state in a per-slot basis, and yet does not request any external information from nearby APs or neighbor stations. Our estimation mechanism is non-intrusive, fully distributed, and independent of the infrastructure. Through simulation study, we evaluate the accuracy of the estimation and show that EVA-based association yields enhanced throughput performance compared with the legacy scheme.
Particle swarm optimization with adaptive population size and its application
Authors: DeBao Chen, ChunXia Zhao
Venue: Applied Soft Computing (2009)

A particle swarm optimization (PSO) that uses an adaptive variable population size and periodic partial increasing or declining individuals in the form of ladder function is proposed in the paper. The aim is to enhance the overall performance of PSO. The proposed scheme adjusts the population size automatically according to the value of diversity of the population in ultimate time of current ladder. The processing of adding and declining the number of population is designed. The validity of the given algorithm is tested for a variety of benchmark problems and neural network training problems. The results of the proposed scheme are compared with the linearly decreasing inertia weight PSO (LDWPSO) and mutation PSO (MPSO), from which it is evident that the proposed scheme enhances the overall performance of PSO.
Innovation in scholarly communication: Vision and projects from High-Energy Physics
Authors: Rolf-Dieter Heuer, Annette Holtkamp, Salvatore Mele
Venue: Information Services and Use (2008)

Having always been at the forefront of information management and open access, High-Energy Physics (HEP) proves to be an ideal test-bed for innovations in scholarly communication including new information and communication technologies. Three selected topics of scholarly communication in High-Energy Physics are presented here: a new open access business model, SCOAP3, a world-wide sponsoring consortium for peer-reviewed HEP literature; the design, development and deployment of an e-infrastructure for information management; and the emerging debate on long-term preservation, re-use and (open) access to HEP data.
Emotion Classification of Online News Articles from the Reader's Perspective
Authors: Kevin Hsin-Yih Lin, Changhua Yang, Hsin-Hsi Chen
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01 (2008)

Past studies on emotion classification focus on the writer’s emotional state. This research addresses the reader aspect instead. The classification of documents into reader-emotion categories has several applications. One of them is to integrate reader-emotion classification into a web search engine to allow users to retrieve documents that contain relevant contents and at the same time instill proper emotions. In this paper, we automatically classify documents into reader-emotion categories, and examine classification performance under different feature settings. Experiments show that certain feature combinations achieve good accuracy. We also compare the best classifier’s classification results with the emotional distributions of documents to determine how closely the classifier models the underlying reader behavior. Finally, we investigate the feasibility of emotion ranking.
MADIK: A Collaborative Multi-agent ToolKit to Computer Forensics
Authors: Bruno W. Hoelz, Célia G. Ralha, Rajiv Geeverghese, Hugo C. Junior
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)

In this article, we present MADIK, a Multi-Agent Digital Investigation ToolKit to help experts during the forensic examination process. MADIK uses a four layer multi-agent architecture, as a metaphor to the organizational hierarchy levels: strategic, tactical, operational and specialist. The proposed architecture and tool was developed under a blackboard approach, implemented with Java Agent DEvelopment Framework - JADE, using Java Expert System Shell - JESS as an inference engine. We have done some experiments with MADIK using real data, on stand alone and distributed environments with encouraging results.
Modelling incentives and protocols for collaboration in mobile ad hoc networks
Authors: Johannes Göbel, Anthony E. Krzesinski
Venue: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems (2008)

Ad hoc networks are self-configuring networks of mobile nodes, connected by wireless links. If a destination node is beyond the transmission range of an origin node, then the nodes must cooperate to provide a multi-hop route. Any node can act as a sender, receiver or transit node. It is in a node's interest to be a sender or receiver, but it is less clear what the value is of forwarding traffic on behalf of other nodes. The nodes should therefore be given incentives to act as transit nodes, because otherwise the network would fail to function. A way to do so is by introducing for each node a credit balance, where nodes use credits to pay for the costs of sending their own traffic, and earn credits by forwarding traffic from other nodes. The incentive scheme requires that the information needed to compute the credit balance at each node must be locally available at the node. In this paper we present a model of a signalling protocol that obtains and distributes the prices that the nodes charge for processing flows so that the credit balances can be locally computed at each node. Simulation experiments show that the protocol can efficiently gather and distribute the control information such that effective flow allocation takes place for reasonable values of the signalling rate and signal processing delays.
Analysis of the problem of continuous-product inventory control under deterministic lead time
Authors: P. V. Shnurkov, R. V. Mel'Nikov
Venue: Automation and Remote Control (2008)

Consideration was given to the control of the continuous-product inventory in the storage system delivering to the end consumers. In the system, the product is replenished at a deterministic lead time of duration obeying the volume of order. The system behavior is described by a regenerative random or deterministic process. The general task of control lies in determining the optimal time to place the replenishment order. Functionals of the mean specific income and mean specific costs were constructed, and a theorem of solution existence and uniqueness was given. For several variants of the model, explicit solutions of the problem of control under different inter-parameters relations were obtained. A number of examples of particular economic systems obeying the model under study were discussed. A procedure for seeking numerical parameters of the optimal control was analyzed in detail.
Pivot language approach for phrase-based statistical machine translation
Authors: Hua Wu, Haifeng Wang
Venue: Machine Translation (2007)

This paper proposes a novel method for phrase-based statistical machine translation based on the use of a pivot language. To translate between languages L s and L t with limited bilingual resources, we bring in a third language, L p , called the pivot language. For the language pairs L s ¿ L p and L p ¿ L t , there exist large bilingual corpora. Using only L s ¿ L p and L p ¿ L t bilingual corpora, we can build a translation model for L s ¿ L t . The advantage of this method lies in the fact that we can perform translation between L s and L t even if there is no bilingual corpus available for this language pair. Using BLEU as a metric, our pivot language approach significantly outperforms the standard model trained on a small bilingual corpus. Moreover, with a small L s ¿ L t bilingual corpus available, our method can further improve translation quality by using the additional L s ¿ L p and L p ¿ L t bilingual corpora.
A growing network model with high hub connectivity and tunable clustering coefficient
Authors: Yihjia Tsai, Ping-Nan Hsiao
Venue: WSEAS Transactions on Information Science and Applications (2007)

The paper investigates a model for social network based on a growing network. The model we propose can fit the following two basic properties: (1) 'scale-free property' which has power law degree distribution, and (2) 'small-world property' which has high clustering coefficient. In addition, the model is modified for high hub connectivity which is a new concept in scale-free network. This study also provided an analysis of empirical data.
Empowering the users? A critical textual analysis of the role of users in open source software development
Authors: Netta Iivari
Venue: AI Society (2008)

This paper outlines a critical, textual approach for the analysis of the relationship between different actors in information technology (IT) production, and further concretizes the approach in the analysis of the role of users in the open source software (OSS) development literature. Central concepts of the approach are outlined. The role of users is conceptualized as reader involvement aiming to contribute to the configuration of the reader (to how users and the parameters for their work practices are defined in OSS texts). Afterwards, OSS literature addressing reader involvement is critically reviewed. In OSS context, the OSS writers as readers configure the reader and other readers are assumed to be capable of and interested in commenting the texts. A lack of OSS research on non-technical reader involvement is identified. Furthermore, not only are the OSS readers configured, but so are OSS writers. In OSS context while writers may be empowered, this clearly does not apply to the non-technical OSS readers. Implication for research and practice are discussed.
Attainability of optimal solutions to a linear problem of multicriterion optimization with respect to the weighed sum of variously important and transitively subordinated criteria
Authors: A. Yu. Brila
Venue: Cybernetics and Systems Analysis (2008)

This paper presents methods of finding criteria coefficients such that optimal solutions are obtained to a linear problem of multicriteria optimization with respect to the weighed sum of variously important and transitively subordinated criteria. The case of a partial transitive subordination is also considered, and a method is founded that finds coefficients such that optimal solutions to the problem of multicriteria optimization are attainable with respect to the weighed sum of variously important and partially transitively subordinated criteria.