ppxscal/embedding_network huggingface dataset:
Method for stakeholder identification in interorganizational environments
Authors: Luciana C. Ballejos, Jorge M. Montagna
Venue: Requirements Engineering (2008)

Stakeholders are the first emerging challenge in any software project. Their identification is a critical task for success. Nevertheless, many authors consider them as a default product of a non-explained identification process. Several aspects must be considered when the project is carried out in environments where multiple organizations interact. These complex contexts demand extremely hard efforts. Stakeholders must be identified taking into account their attributes (types, roles), which must be extended and defined for these environments. In general, there are no methodologies that allow performing this task in a systematic way for the development of interorganizational information systems. The paper proposes a method for carrying out stakeholder identification considering the diverse dimensions involved in interorganizational environments: organizational, interorganizational and external. It allows the systematic specification of all the people, groups and organizations whose interests and needs can affect or are affected by the interorganizational system. Also diverse stakeholders&#x2019; attributes such as types, roles, influence and interest are defined, analyzed, and included in the method. They are all important in later stages of any software project.
Exploiting loop-dependent stream reuse for stream processors
Authors: Xuejun Yang, Ying Zhang, Jingling Xue, Ian Rogers, Gen Li, Guibin Wang
Venue: Proceedings of the 17th international conference on Parallel architectures and compilation techniques (2008)

The memory access limits the performance of stream processors. By exploiting the reuse of data held in the Stream Register File (SRF), an on-chip storage, the number of memory accesses can be reduced. In current stream compilers reuse is only attempted for simple stream references, those whose start and end are known. Compiler analysis from outside of stream processors does not directly enable the consideration of other complex stream references. In this paper we propose a transformation to automatically optimize stream programs to exploit the reuse supplied by loop-dependent stream references. The transformation is based on three results: algorithms to recognize the reuse supplied by stream references, a new abstract expression called the Stream Reuse Graph (SRG) to depict the reuse and the optimization of the SRG for the transformation. Both the reuse between whole sequences accessed by stream references and that between partial sequences are exploited in the paper. In particular, the problem of exploiting partial stream reuse does not have its parallel in the traditional data reuse exploitation setting (for scalars and arrays). Finally, we have implemented our techniques using the StreamC/KernelC compiler for Imagine. Experimental results show a resultant speedup of 1.14 to 2.54 times using a range of typical stream processing application kernels.
GNAT BoF: where would you like to see GNAT go?
Authors: Greg Gicca, Ben Brosgol
Venue: Proceedings of the 2008 ACM annual international conference on SIGAda annual international conference (2008)

This BoF will discuss future directions for the GNAT technology, including both the GAP and Pro versions. We at AdaCore will give some of our thoughts on interesting future possibilities, but mostly we would like to hear from the user community, so we see this session as an open discussion of interesting ideas for the future. This is a chance for you to say what you want -- for example, some additional libraries or bindings -- and have your ideas discussed!
An empirical evaluation of entropy-based traffic anomaly detection
Authors: George Nychis, Vyas Sekar, David G. Andersen, Hyong Kim, Hui Zhang
Venue: Proceedings of the 8th ACM SIGCOMM conference on Internet measurement (2008)

Entropy-based approaches for anomaly detection are appealing since they provide more fine-grained insights than traditional traffic volume analysis. While previous work has demonstrated the benefits of entropy-based anomaly detection, there has been little effort to comprehensively understand the detection power of using entropy-based analysis of multiple traffic distributions in conjunction with each other. We consider two classes of distributions: flow-header features (IP addresses, ports, and flow-sizes), and behavioral features (degree distributions measuring the number of distinct destination/source IPs that each host communicates with). We observe that the timeseries of entropy values of the address and port distributions are strongly correlated with each other and provide very similar anomaly detection capabilities. The behavioral and flow size distributions are less correlated and detect incidents that do not show up as anomalies in the port and address distributions. Further analysis using synthetically generated anomalies also suggests that the port and address distributions have limited utility in detecting scan and bandwidth flood anomalies. Based on our analysis, we discuss important implications for entropy-based anomaly detection.
Cache-Oblivious R-Trees
Authors: Lars Arge, Mark de Berg, Herman Haverkort
Venue: Algorithmica (2009)

We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point can be found efficiently. Our structure is an axis-aligned bounding-box hierarchy and as such it is the first cache-oblivious R-tree with provable performance guarantees. If no point in the plane is contained in more than a constant number of rectangles in S, we can construct, for any constant &#x03b5;, a structure that answers a rectangle query using $O(\sqrt{N/B}+T/B)$memory transfers and a point query using O((N/B)&#x03b5; ) memory transfers, where T is the number of reported rectangles and B is the block size of memory transfers between any two levels of a multilevel memory hierarchy. We also develop a variant of our structure that achieves the same performance on input sets with arbitrary overlap among the rectangles. The rectangle query bound matches the bound of the best known linear-space cache-aware structure.
Consistent Sets of Secondary Structures in Proteins
Authors: Piotr Berman, Jieun Jeong
Venue: Algorithmica (2009)

Ab initio predictions of secondary structures in proteins have to combine local predictions, based on short fragments of the protein sequence, with consistency restrictions, as not all locally plausible predictions may be simultaneously true. We use the fact that secondary structures are patterns of hydrogen bonds and that a single residue can participate in hydrogen bonds of at most one secondary structure. Consistency of fixed-sized pieces of secondary structures is the easiest to approximate and we formalize it as 1-2 matching problem. Consistency of entire secondary structures is a version of set packing. We also investigate how to form a simple problem if we add the requirement that the secondary structure and the loops that connect them fit together in a metric space. Every problem that we investigated is MAX-SNP hard and it has a constant factor approximation. Computational experience suggests that in biological instances, we can find nearly optimal solutions using heuristics.
On increased VZN suspension performances
Authors: Adrian-Ioan Niculescu, Dan Dumitriu
Venue: WSEAS Transactions on Systems and Control (2008)

The paper present the increased suspension performances assured by VZN shock absorbers, comparative with standard ones, based on a theoretical evaluation of the pitch behaviour and a 2D, 1/2 car model simulation. The results present evolution of the front and rear body displacements, accelerations, forces in stop bumpers, piston displacement, for both VZN and standard shock absorbers. The new self-adjustable VZN shock absorber confers improved flexibility to adjust each stroke part according to the specific needs, providing a larger range of damping coefficients, function of the relative piston position in the cylinder. Both on rebound and compression, the VZN damping coefficients have low values at the beginning of the strokes, becoming medium at the middle of the strokes and high and very high to its end. So it gives a good correlation between loads and damping coefficients, decreasing body vertical acceleration and thus increasing the comfort, reducing speed at stroke ends and so the forces in stopper bumpers and thus increasing axles, body and passengers' protection, and increasing stability at pitch.
SOAs for scientific applications: Experiences and challenges
Authors: Sriram Krishnan, Karan Bhatia
Venue: Future Generation Computer Systems (2009)

Over the past several years, with the advent of the Open Grid Services Architecture (OGSA) [I. Foster, C. Kesselman, J. Nick, S. Tuecke, Grid Services for Distributed System Integration, Computer 35 (6) (2002)] and the Web Services Resource Framework (WSRF) [K. Czajkowski, et al., WS-resource framework. http://www-106.ibm.com/developerworks/library/ws-resource/ws-wsrf.pdf, 2004. [25]], Service-oriented Architectures (SOA) and Web service technologies have been embraced in the field of scientific and Grid computing. These new principles promise to help make scientific infrastructures simpler to use, more cost effective to implement, and easier to maintain. However, understanding how to leverage these developments to actually design and build a system remains more of an art than a science. In this paper, we present some positions learned through experience, that provide guidance in leveraging SOA technologies to build scientific infrastructures. In addition, we present the technical challenges that need to be addressed in building an SOA, and as a case study, we present the SOA that we have designed for the National Biomedical Computation Resource (NBCR) [The National Biomedical Computation Resource (NBCR). http://nbcr.net/] community. We discuss how we have addressed these technical challenges, and present the overall architecture, the individual software toolkits developed, the client interfaces, and the usage scenarios. We hope that our experiences prove to be useful in building similar infrastructures for other scientific applications.
A fast and flexible method for the segmentation of aCGH data
Authors: Erez Ben-Yaacov, Yonina C. Eldar
Venue: Bioinformatics (2008)

Motivation: Array Comparative Genomic Hybridization (aCGH) is used to scan the entire genome for variations in DNA copy number. A central task in the analysis of aCGH data is the segmentation into groups of probes sharing the same DNA copy number. Some well known segmentation methods suffer from very long running times, preventing interactive data analysis. Results: We suggest a new segmentation method based on wavelet decomposition and thresholding, which detects significant breakpoints in the data. Our algorithm is over 1000 times faster than leading approaches, with similar performance. Another key advantage of the proposed method is its simplicity and flexibility. Due to its intuitive structure, it can be easily generalized to incorporate several types of side information. Here, we consider two extensions which include side information indicating the reliability of each measurement, and compensating for a changing variability in the measurement noise. The resulting algorithm outperforms existing methods, both in terms of speed and performance, when applied on real high density CGH data. Availability: Implementation is available under software tab at: http://www.ee.technion.ac.il/Sites/People/YoninaEldar/ Contact: yonina@ee.technion.ac.il
Connect the dots
Authors: Yaniv Loewenstein, Michal Linial
Venue: Bioinformatics (2008)

Motivation: Mapping of remote evolutionary links is a classic computational problem of much interest. Relating protein families allows for functional and structural inference on uncharacterized families. Since sequences have diverged beyond reliable alignment, these are too remote to identify by conventional methods. Approach: We present a method to systematically identify remote evolutionary relations between protein families, leveraging a novel evolutionary-driven tree of all protein sequences and families. A global approach which considers the entire volume of similarities while clustering sequences, leads to a robust tree that allows tracing of very faint evolutionary links. The method systematically scans the tree for clusters which partition exceptionally well into extant protein families, thus suggesting an evolutionary breakpoint in a putative ancient superfamily. Our method does not require family pro.les (or HMMs), or multiple alignment. Results: Considering the entire Pfam database, we are able to suggest 710 links between protein families, 125 of which are con.rmed by existence of Pfam clans. The quality of our predictions is also validated by structural assignments. We further provide an intrinsic characterization of the validity of our results and provide examples for new biological.ndings, from our systematic scan. For example, we are able to relate several bacterial pore-forming toxin families, and then link them with a novel family of eukaryotic toxins expressed in plants,.sh venom and notably also uncharacterized proteins from human pathogens. Availability: A detailed list of putative homologous superfamilies, including 210 families of unknown function, has been made available online: http://www.protonet.cs.huji.ac.il/dots Contact: lonshy@cs.huji.ac.il
Convergence Time Analysis of Self-stabilizing Algorithms in Wireless Sensor Networks with Unreliable Links
Authors: Hirotsugu Kakugawa, Toshimitsu Masuzawa
Venue: Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems (2008)

Wireless sensor network is a set of many tiny sensor nodes each of which consists of a microprocessor with sensors and wireless communication device. Because centralized control is hard to achieve in a large scale sensor network, self-* is a key concept to design such a network. In this paper, as one of self-* properties, we investigate self-stabilization algorithms which is a promising theoretical background for wireless sensor network protocols. T. Herman [Procs. International Workshop of Distributed Computing, 2003] proposed a transformation scheme of self-stabilizing algorithm in abstract computational model to sensor network model. However, it is not known that whether expected convergence time of transformed algorithms is finite or not. We show upper bound of expected convergence time of some self-stabilizing algorithms in explicit formulas.
Variations in soil structure and reflectance during a controlled crusting experiment
Authors: K. Anderson, N. J. Kuhn
Venue: International Journal of Remote Sensing (2008)

The results of an experiment to show variations in the directional reflectance factor of a Luvisol during a controlled crusting experiment are described. Soil sampled in the field after tillage was sieved into free-draining trays, and exposed to artificial rainfall for differing periods of time, ranging from 5 to 60 min. The resulting samples demonstrated different stages in the development of the soil's structural crust. The topography of each dried sample was characterized over a 5×5 cm area using a laser profilometer, and digital surface models (DSMs) were subsequently analysed using variogram models. DSMs were also used to generate statistical measures of random roughness. Directional reflectance factors of each sample were characterized in the solar principal plane under clean skies using an ASD FieldSpec Pro spectroradiometer, using an 8° foreoptic attached to an A-frame device. Directional reflectance factors were analysed in relation to spatial statistical measures obtained from the laser profilometer data. The results demonstrate that changes in the sill variance of soil samples following crusting, and hence changes in soil structure, were best described by backscattered radiation measured at +30° in the visible and near-infrared (e.g. R 2 = 0.947 (658 nm)), and at +15° in the short-wave infrared (e.g. R 2 = 0.992 (1700 nm)). View zeniths are expressed from the nadir, and were relative to the solar zenith angle, which ranged from 80.76° to 74.55° during the measurement sequences. The results from these tests show great promise for broader-scale monitoring of soil condition, particularly when considered in the context of the new pointable remote sensing systems in operation, coupled with new-generation sensors with in-built directional capabilities.
Application note: Definition of a SCADA system for a microirrigation network with effluents
Authors: M. Duran-Ros, J. Puig-Bargués, G. Arbat, J. Barragán, F. Ramírez de Cartagena
Venue: Computers and Electronics in Agriculture (2008)

A supervisory control and data acquisition (SCADA) system has been developed to monitor and control microirrigation system performance. The microirrigation system had four types of filtration units and, placed after each one of them, twenty-four irrigation laterals using urban effluents. The SCADA system activated the irrigation system and the backwashing filter procedure. It also monitored pressure and flow at the filtration units and irrigation laterals to assess clogging problems and measure the consumed water volume in filter backwashing. The system was also prepared for remote access via Internet.
Initial results of the land surface temperature (LST) validation with the Evora, Portugal ground-truth station measurements
Authors: E. Kabsch, F. S. Olesen, F. Prata
Venue: International Journal of Remote Sensing (2008)

Meteosat second generation (MSG) provides multispectral data with a high temporal resolution of 15 min. On the basis of these data, the Land Surface Analysis-Satellite Applications facility (LSA-SAF), patronized by Eumetsat, generates and distributes many MSG products. The land surface temperature (LST) is one of its main products. It is generated from the MSG spinning enhanced visible and infra red imager (SEVIRI) data with a split-window algorithm, using 10.8 and 12.0 µm channels. Based on the accuracy of the parameters used in the LST algorithm, the SAF-LST quality is estimated to be ±2°C. However, this estimation must be proven with ground-truth data. This article presents the concept of the first LST validation station for the MSG in Evora, Portugal. The validation results calculated for cloud-free days during 2006 reveal very good agreement of the satellite-and ground-based LST at night (average difference of 1.0±1.5°C). During the day, however the average bias reaches 3.0±1.5°C. The largest disagreements take place on hot summer days with very intense direct solar radiation. This systematical bias reveals that the algorithm overestimates LST at high surface temperatures.
Record path header for triangle routing attacks in IPv6 networks
Authors: Su-Kit Tang, Kin-Yeung Wong, Kai-Hau Yeung
Venue: WSEAS TRANSACTIONS on COMMUNICATIONS (2008)

Triangle routing is one of the serious attacks to the Internet infrastructure. It can be caused by malicious routers which misroute packets to wrong directions. This kind of attacks creates network problems such as network congestion, denial of service and network partition and results in degrade of network performance. This paper gives a comprehensive study on how the path analysis combats the triangle routing attacks. We discuss the method, implementation and limitation of path analysis to detect triangle routing in IPv4 network. We also discuss the implementation of path analysis in IPv6 by proposing a new extension header, called Record Path Header.
On the twin measure and queueing systems predictability
Authors: David Raz, Hanoch Levy, Benjamin Avi-Itzhak
Venue: Performance Evaluation (2008)

Two identical jobs with deterministically identical processing times arrive at a web server simultaneously (Twins), but leave the system thirty seconds apart. Is the service predictable? Is their sojourn time predictable? This issue arises in modern day networking systems such as call centers and web servers as well as in other queueing systems. We propose a novel measure based on the principle that in a predictable system, ''twin'' jobs should not depart the system very far apart. We analyze this measure for a number of common scheduling policies and compare the results. We compare the results to those of other predictability approaches proposed recently and discuss the measure's usefulness.
Q-Strategy: A Bidding Strategy for Market-Based Allocation of Grid Services
Authors: Nikolay Borissov, Niklas Wirström
Venue: Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems: (2008)

The application of autonomous agents by the provisioning and usage of computational services is an attractive research field. Various methods and technologies in the area of artificial intelligence, statistics and economics are playing together to achieve i) autonomic service provisioning and usage of Grid services, to invent ii) competitive bidding strategies for widely used market mechanisms and to iii) incentivize consumers and providers to use such market-based systems.The contributions of the paper are threefold. First, we present a bidding agent framework for implementing artificial bidding agents, supporting consumers and providers in technical and economic preference elicitation as well as automated bid generation by the requesting and provisioning of Grid services. Secondly, we introduce a novel consumer-side bidding strategy, which enables a goal-oriented and strategic behavior by the generation and submission of consumer service requests and selection of provider offers. Thirdly, we evaluate and compare the Q-strategy, implemented within the presented framework, against the Truth-Telling bidding strategy in three mechanisms --- a centralized CDA, a decentralized on-line machine scheduling and a FIFO-scheduling mechanisms.
Computer Assisted Vegetation Analysis: Handbook of Vegetation Science, 1 edition
Authors: E. Feoli, L. Orlci
Venue:  (2007)

X
Discriminating Meaningful Web Tables from Decorative Tables Using a Composite Kernel
Authors: Jeong-Woo Son, Jae-An Lee, Seong-Bae Park, Hyun-Je Song, Sang-Jo Lee, Se-Young Park
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01 (2008)

Information extraction from world wide web has been paid great attention to. Since a table is a well-organized and summarized knowledge expression for a domain, it is of great importance to extract information from the tables. However, many tables in web pages are used not to transfer information but to decorate the pages. Therefore, it is one of the most critical tasks in web table mining to discriminate the meaningful tables from the decorative ones. The main obstacle of this task comes from the difficulty of generating relevant features for the discrimination. This paper proposes a novel method to discriminate them using a composite kernel which combines a parse tree kernel and a linear kernel. Since a web table is represented as a parse tree by a HTML parser, the parse tree kernel can be naturally used in determining the similarity between trees, and the linear kernel with content features is used to make up for the weak points of the parse tree kernel. The support vector machines with the composite kernel distinguish with high accuracy the meaningful tables from the decorative ones. A series of experiments show that the proposed method achieves the state-of-the-art performance.