ppxscal/embedding_network huggingface dataset:
Integration modelling and decision support: A case study of the Coastal Lake Assessment and Management (CLAM) Tool
Authors: Jenifer L. Ticehurst, Rebecca A. Letcher, David Rissik
Venue: Mathematics and Computers in Simulation (2008)

Decision Support Tools (DSTs) are designed to assist in making more informed management decisions, through prediction of the outcomes from various future scenarios and as an education resource. The many coastal lakes in New South Wales, Australia are areas where DSTs are able to assist in making management and planning decisions. A variety of economic, ecological and social demands on the lakes and their catchment's finite resources are increasing conflict over their use and sustainable management. The issues are intricately linked, so that understanding trade-offs and making management decisions about coastal lakes and their catchments requires knowledge of the processes and interactions between all key components of the system. This is a complex problem requiring the integration of, often minimal, information, from various disciplines. This paper describes an approach for developing a DST to provide information about the potential impacts of management decisions on key components of a coastal lake system. Integration of the catchment components was completed using a Bayesian Decision Network (BDN). This paper uses a case study of a DST for Merimbula Lake on the east coast of Australia to illustrate the strengths of the BDN approach, and to show how the design of the DST helps to address some of the limitations inherent in the integrative method.
Matching from the first iteration: an iterative switching algorithm for an input queued switch
Authors: Saad Mneimneh
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

An iterative switching algorithm for an input queued switch consists of a number of iterations in every time step, where each iteration computes a disjoint matching. If input i is matched to output j in a given iteration, a packet (if any) is forwarded from i to j in the corresponding time step. Most of the iterative switching algorithms use a Request Grant Accept (RGA) arbitration type (e.g. iSLIP). Unfortunately, due to this particular type of arbitration, the matching computed in one iteration is not necessarily maximal (more input and output ports can still be matched). This is exactly why multiple iterations are needed. However, multiple iterations make the time step larger and reduce the speed of the switch. We present a new iterative switching algorithm (based on the RGA arbitration) called π-RGA with the underlying assumption that the number of iterations is possibly limited to one, hence reducing the time step and allowing the switch to run at a higher speed. We prove that π-RGA achieves throughput and delay guarantees with a speedup of 2 and one iteration under a constant burst traffic model, which makes π-RGA as good as any maximal matching algorithm in the theoretical sense. We also show by simulation that π-RGA achieves relatively high throughput in practice under uniform and non-uniform traffic patterns with one iteration and no speedup.
SIP-Based Cross-Domain Proxy Handoff for Mobile Streaming Services
Authors: Chung-Ming Huang, Chao-Hsien Lee, Jun-Hao Zhuang, Tsung-Yi Tsai, Chi-Chang Liu
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

Proxy servers are widespread to be adopted in network applications. Applying proxies over wireless networks not only uses the cached data efficiently but also improves transmission quality effectively. However, if a mobile node(MN) keeps changing its location and getting streaming service simultaneously, it is unreasonable that the MN connects to the same proxy for receiving data all the way. In order to resolve this problem, an application-layer proxy handoff is defined to help MNs switch their proxy servers dynamically. In the current network environment, users can access the Internet via different Internet Service Providers (ISPs). Regarding the traversal among the network domains belonging to different ISPs, this paper proposes a SIP-based proxy handoff mechanism to help the cross-domain proxy switching process. Besides, the proposed mechanism takes multimedia streaming services into consideration and employs MPEG-4 layering technique to smooth the transition from one proxy to another one.
Load sharing and session preservation with multiple mobile routers for large scale mobile networks
Authors: Eun Kyoung Paik, Hosik Cho, Thierry Ernst, Yanghee Choi
Venue: International Journal of Wireless and Mobile Computing (2008)

By means of NEtwork MObility (NEMO) support, users can organise their various communication devices into a subnet called mobile network. The Mobile Router (MR) provides the connectivity to the internet and mobility management transparency for the rest of the mobile nodes in the mobile network. So, the MR must assure reliable communications and a high data rate for the group of nodes behind it. In support of broadband wireless communications, the use of multiple MRs would allow the transfer of large volumes of data to a group of mobile nodes. This paper addresses the protocol issues arising from the use of multiple MRs, and analyses the influence of mobility patterns on load sharing and session preservation. Then, two mobility-aware selection schemes are proposed, which select a MR. Firstly, the best-connected MR selection scheme is designed for regular mobility and is based on the fact that the most recently updated binding remains effective for the longest period of time. It preserves the connection from the mobile network to the internet whether the accessible area is continuous or not, and this even in a fast handoff environment. Secondly, the most-beneficial MR selection scheme is designed for random mobility. The simulation results show that the performance varies depending on the hardware configuration. Based on these results, it was found that application-awareness is critical to achieve good performance.
The Fine Intersection Problem for Steiner Triple Systems
Authors: Yeow Meng Chee, Alan C. H. Ling, Hao Shen
Venue: Graphs and Combinatorics (2008)

The intersection of two Steiner triple systems $$(X,{\mathcal{A}})$$ and $$(X,{\mathcal{B}})$$ is the set $${\mathcal{A}}\cap{\mathcal{B}}$$. The fine intersection problem for Steiner triple systems is to determine for each v, the set I(v), consisting of all possible pairs (m, n) such that there exist two Steiner triple systems of order v whose intersection $${\mathcal{I}}$$ satisfies $$|\cup_{A\in{\mathcal{I}}} A|=m$$ and $$|{\mathcal{I}}|=n$$. We show that for v &#x2261; 1 or 3 (mod 6), |I(v)|&#x00a0;=&#x00a0;&#x0398;(v 3), where previous results only imply that |I(v)|&#x00a0;=&#x00a0;&#x03a9;(v 2).
Harvesting needed to maintain scientific literature online
Authors: Nikolay Nikolov, Peter Stoehr
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Millions of scientific articles are accessible freely on the web. While some of them are stored in institutional repositories many are made available on personal pages which are exposed to the net's transience. We found that nearly 11% of URLs of PDF documents containing references to life science publications were not accessible within 5 months after being harvested using a search engine's (SE) API. For most of them (8.4%) no SE cache backup could be found. Although we have yet to estimate the exact rate at which the scientific literature disappears and the duration of its disappearance the results so far are a clear indicator that web harvesting is needed to preserve the online scientific literature.
Research on Author's Semantic Similarity Based on Collaborative Network
Authors: Kai-Zhong Jiang, Yuan-Qiong Wu, Zhao Lv, Jun-Zhong Gu
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The community is not only one kind of widely existing organization in networks, but also contains distinct information about topics. The present paper is to define a metric between community members, weigh their semantic similarity, and finally make use of the metric to find more about the web. In order to achieve this, the usual practice is to establish a “plane” adjacency matrix according to the citation relationship among all community members. However, it is easy to trigger the problem of topic drift. To overcome this weak point, the present paper puts forward firstly the strategy of establishing a three-order adjacency tensor on the 3-dimensional relationship between the seed document, simple document and the author. Secondly, the adjacency tensor is decomposed to obtain the principal component in each dimension. Thirdly, the semantic similarity between authors is defined. The experiment makes it clear that the semantic similarity between the author and people of importance tends to be stable under a particular circumstance.
How to compare small multivariate samples using nonparametric tests
Authors: Arne C. Bathke, Solomon W. Harrar, Laurence V. Madden
Venue: Computational Statistics Data Analysis (2008)

In the life sciences and other research fields, experiments are often conducted to determine responses of subjects to various treatments. Typically, such data are multivariate, where different variables may be measured on different scales that can be quantitative, ordinal, or mixed. To analyze these data, we present different nonparametric (rank-based) tests for multivariate observations in balanced and unbalanced one-way layouts. Previous work has led to the development of tests based on asymptotic theory, either for large numbers of samples or groups; however, most experiments comprise only small or moderate numbers of experimental units in each individual group or sample. Here, we investigate several tests based on small-sample approximations, and compare their performance in terms of @a levels and power for different simulated situations, with continuous and discrete observations. For positively correlated responses, an approximation based on [Brunner, E., Dette, H., Munk, A., 1997. Box-type approximations in nonparametric factorial designs. J. Amer. Statist. Assoc. 92, 1494-1502] ANOVA-Type statistic performed best; for responses with negative correlations, in general, an approximation based on the Lawley-Hotelling type test performed best. We demonstrate the use of the tests based on the approximations for a plant pathology experiment.
Note on the Pair-crossing Number and&#x00a0;the&#x00a0;Odd-crossing Number
Authors: G&#x00e9;za T&#x00f3;th
Venue: Discrete Computational Geometry (2008)

The crossing number ${\mbox{\sc cr}}(G)$ of a graph G is the minimum possible number of edge-crossings in a drawing of G, the pair-crossing number ${\mbox{\sc pair-cr}}(G)$ is the minimum possible number of crossing pairs of edges in a drawing of G, and the odd-crossing number ${\mbox{\sc odd-cr}}(G)$ is the minimum number of pairs of edges that cross an odd number of times. Clearly, ${\mbox{\sc odd-cr}}(G)\le {\mbox{\sc pair-cr}}(G)\le {\mbox{\sc cr}}(G)$. We construct graphs with $0.855\cdot {\mbox{\sc pair-cr}}(G)\ge {\mbox{\sc odd-cr}}(G)$. This improves the bound of Pelsmajer, Schaefer and &#x0160;tefankovi&#x010d;. Our construction also answers an old question of Tutte. Slightly improving the bound of Valtr, we also show that if the pair-crossing number of G is k, then its crossing number is at most O(k 2/log&#x2009;2 k).
Clarifying the semantics of value in use cases through Jackson's Problem Frames
Authors: José M. Caòete-Valdeón, Fernando Enríquez, Javier Ortega, Ernesto Veláquez
Venue: Information Processing Letters (2008)

Use cases constitute a popular technique to problem analysis, partly due to their focus on thinking in terms of the user needs. However this is not a guarantee for discovering all the subproblems that compose the structure of a given software problem. Moreover, a rigorous application of the technique requires a previous consensus about the meaning of I. Jacobson's statement ''a use case must give a measurable value to a particular actor'' (The Rational Edge, March 2003). This paper proposes a particular characterisation of the concept of ''value'' with the purpose of problem structuring. To this aim we base on the catalogue of frames for real software problems proposed by M. Jackson (Problem Frames, 2001) and we reason about what could be valuable for the user on each problem class. We illustrate our technique with the analysis of a web auction problem.
Artifact-centered operational modeling: lessons from customer engagements
Authors: K. Bhattacharya, N. S. Caswell, S. Kumaran, A. Nigam, F. Y. Wu
Venue: IBM Systems Journal (2007)

For almost a decade, the artifact-centered operational-modeling approach for modeling business operations, also referred to as the "business artifact method," has been practiced and refined. This approach has been used in a variety of engagements, and each engagement has brought forth innovations that have enriched and strengthened the approach. In this paper, we describe three of these engagements in order to illustrate the method and highlight some of the lessons learned. The main objective of this paper is to establish the value of operational modeling in business transformation and to incorporate the lessons we have learned into a more comprehensive account of the method. We also describe the model-driven business transformation toolkit, which adds a unique value proposition to the method-the rapid and effective transformation of operational models into implementations that are manageable and can be monitored.
Implementing peer-led team learning in introductory computer science courses
Authors: Rita A. Sperry, Phyllis Tedford
Venue: Journal of Computing Sciences in Colleges (2008)

This paper describes the implementation of Peer-Led Team Learning (PLTL) in the first two introductory programming courses at Texas A&M University - Corpus Christi in an attempt to attract and retain competent computer science majors through cooperative and active learning sessions. Preliminary results suggest that the students participating in the PLTL program are directly benefiting from the learning experiences facilitated by the peer leaders.
Generalization from Observed to Unobserved Features by Clustering
Authors: Eyal Krupka, Naftali Tishby
Venue: The Journal of Machine Learning Research (2008)

We argue that when objects are characterized by many attributes, clustering them on the basis of a random subset of these attributes can capture information on the unobserved attributes as well. Moreover, we show that under mild technical conditions, clustering the objects on the basis of such a random subset performs almost as well as clustering with the full attribute set. We prove finite sample generalization theorems for this novel learning scheme that extends analogous results from the supervised learning setting. We use our framework to analyze generalization to unobserved features of two well-known clustering algorithms: k-means and the maximum likelihood multinomial mixture model. The scheme is demonstrated for collaborative filtering of users with movie ratings as attributes and document clustering with words as attributes.
JPEG2000 Arbitrary ROI Coding through Rate-Distortion Optimization Techniques
Authors: Joan Bartrina-Rapesta, Francesc Aulí-Llinàs, Joan Serra-Sagristà, Jose Lino Monteagudo-Pereira
Venue: Proceedings of the Data Compression Conference (2008)

Region Of Interest (ROI) coding is a mechanism deployed in several image coding systems to enable different degrees of coding priority to specific regions of the image. JPEG2000 standard provides two ROI coding methods. However, both of them are based in mechanisms that scale the quantized coefficients. This compels to encode the additional bit-planes needed for the scaling, causing a penalization in the overall coding performance, and the ROIs can not be modified without a complete re-encoding of the image. This paper introduces two ROI coding methods that use Rate-distortion optimization techniques toprioritize arbitrary ROIs over the rest of the image without penalizing the overall coding performance. Experimental results suggest that the proposed methods achieve a close tooptimal accuracy, improving the Implicit ROI coding method in terms of ROI rate distortion performance.
Leveraging sequential equivalence checking to enable system-level to RTL flows
Authors: Pascal Urard, Asma Maalej, Roberto Guizzetti, Nitin Chawla
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

It has long been the practice to create models in C or C++ for architectural studies, software prototyping and RTL verification in the design of Systems-on-Chip (SoC). It is often the case that by the end of a design project, multiple C models exist for different uses. Since a lot of time is invested in ensuring the functional correctness of these models via their use in system-level simulations, they often become "golden" functional reference models. Design teams are moving towards leveraging these system-level models to reduce the time needed for design and verification of RTL. On the design side, the use of high-level synthesis tools to synthesize RTL from C/C++ models is gaining ground for certain classes of blocks within a design. On the verification front, temporal differences at interfaces and in internal states between system-level models and RTL prevent the use of combinational equivalence checkers. This paper focuses on the use of sequential equivalence checking to verify functional equivalence between system-level models and RTL and describes the challenges and vale of using it in system-level to RTL flows.
Determination of best focus and optimum dose for variable shaped e-beam systems by applying the isofocal dose method
Authors: Katja Keil, Kang-Hoon Choi, Christoph Hohle, Johannes Kretz, Tarek Lutz, Lutz Bettin, Monika Boettcher, Peter Hahmann, Karl-Heinz Kliem, Bernd Schnabel, Mathias Irmscher, Holger Sailer
Venue: Microelectronic Engineering (2008)

Electron beam direct write (EBDW) provides high resolution for device and technology development. A new variable shaped beam system with improved electron optics was introduced, which features the capability for the 32nm node. Because of the limited resolution of commercially available chemically amplified resists at this node, it is important to determine a stable and optimum resist process window. To compare a process window under different premises, a universally applicable and low error-prone method is needed. The isofocal dose method is investigated with regard to these properties for its use in EBDW. Experiments were performed on 50kV variable shaped electron beam direct writers using the new electron-optical column SB3050 DW (Vistec Electron Beam GmbH). Exposures are performed at different sites in Dresden (Fraunhofer CNT/Qimonda Dresden), Jena (Vistec) and Stuttgart (IMS Chips); also patterns are exposed on different layer stacks at one site. The strong need for a process window can be fulfilled by the isofocal dose method, which will be shown by contour plots.
A Proposal on Anticancer Therapy Based on Reversal of Entropy Flow through Magnetic Field
Authors: Changjiang Ding, Liaofu Luo
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

The entropy production rate of cancer cell is always higher than healthy cell under the case of no external field applied. Different entropy production between two kinds of cells determines the direction of entropy flow among cells. The entropy flow is the carrier of information flow. The entropy flow from cancers to healthy cells would take along the harmful information of cancerous cell, propagating its toxic action to healthy tissues. We demonstrate that an alternating magnetic field of moderate frequency may induce increasing entropy production rate in normal tissue around the tumor, consequently reverse the direction of entropy current. The reversal of entropy flow in biological tissue under magnetic field can avoid the propagation of harmful information from cancer cells. We suggest that this entropy mechanism possibly provides a basis for a novel approach to physiotherapy of anticancer.
XRPC: distributed XQuery and update processing with heterogeneous XQuery engines
Authors: Ying Zhang, Peter Boncz
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

We demonstrate XRPC, a minimal XQuery extension that enables distributed querying between heterogeneous XQuery engines. The XRPC language extension enhances the existing concept of XQuery functions with the Remote Procedure Call (RPC) paradigm. XRPC is orthogonal to all XQuery features, including the XQuery Update Facility (XQUF). Note that executing xquf updating functions over XRPC leads to the phenomenon of distributed transactions. XRPC achieves heterogeneity by an open SOAP-based network protocol, that can be implemented by any engine, and an XRPC Wrapper that allows even XRPC-oblivious XQuery engines to handle XRPC requests efficiently. XRPC is fully implemented in the open-source MonetDB/XQuery engine, and is demonstrated here to co-operate with Saxon, Galax and X-Hive through the XRPC wrapper. This demonstration will focus on the following features of XRPC: (i) glue-less interaction between AJAX style webbased applications with XQuery databases thanks to the SOAP-based nature of the XRPC network protocol, (ii) the efficiency of XRPC communication also for voluminous interserver communication thanks to the Bulk RPC feature that optimizes network communication and exposes set-at-a-time opportunities to the underlying XQuery engines, (iii) the interoperability between different XQuery engines that can handle both distributed transactions (both read-only requests and updates) (iv) support and performance trade-offs of two different isolation levels for distributed transactions among different XQuery engines.
Harmonic retrieval in complex noises based on wavelet transform
Authors: Meng Zhang, Lihua Fu, Hongwei Li, Gaofeng Wang
Venue: Digital Signal Processing (2008)

A novel approach for frequency estimation of one-dimensional harmonics in multiplicative and additive noises is presented. To overcome the resolution limitation inherent to the traditional Fourier-based algorithms, a wavelet transform is utilized. In this new approach, we use a wavelet mother function with a tunable parameter, which is constructed by modulating a window function. For a given harmonic retrieval problem, the tunable parameter can be adaptively adjusted to achieve a good performance. Some numerical experiments are included to illustrate the merits of this new approach.