ppxscal/embedding_network huggingface dataset:
A comparison of a range of models for dispersion in a partially stratified room
Authors: M. Deevy, J. R. Stewart, Z. Ren, N. Gobeau, C. J. Saunders
Venue: Environmental Modelling Software (2008)

A comparative study of models used to predict contaminant dispersion in a partially stratified room is presented. The experiments were carried out in a ventilated test room, with an initially evenly dispersed pollutant. Air was extracted from the outlet in the ceiling of the room at 1 and 3 air changes per hour. A small temperature difference between the top and bottom of the room causes very low air velocities, and higher concentrations, in the lower half of the room. Grid-independent CFD calculations were compared with predictions from a zonal model and from CFD using a very coarse grid. All the calculations show broadly similar contaminant concentration decay rates for the three locations monitored in the experiments, with the zonal model performing surprisingly well. For the lower air change rate, the models predict a less well mixed contaminant distribution than the experimental measurements suggest. With run times of less than a few minutes, the zonal model is around two orders of magnitude faster than coarse-grid CFD and could therefore be used more easily in parametric studies and sensitivity analyses. For a more detailed picture of internal dispersion, a CFD study using coarse and standard grids may be more appropriate.
Distribution of subgraphs of random regular graphs
Authors: Zhicheng Gao, N. C. Wormald
Venue: Random Structures Algorithms (2008)

We obtain the asymptotic distribution of the number of copies of a fixed subgraph H in a random d-regular graph, provided H is strictly balanced and d = d(n) is chosen so that the expected number of copies of H tends to infinity (but not too quickly), and the expected number of copies sharing edges with two other copies is bounded. The proof of asymptotic normality of the distribution uses a method of factorial moments for variables with unbounded means that was recently derived by the authors. &copy; 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008
Evaluation of Logistics Service Provider Using Analytic Network Process
Authors: Kong Feng, Liu Hong-yan
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

This paper puts forward a comprehensive method for the Evaluation of a logistic service provider using ANP. The proposed method consists of two parts: preliminary screening of the available providers, and an analytic network process-based final Evaluation. The criteria, which are relevant in the Evaluation of a provider, have been identified and used to construct an ANP model. Thereafter, the application of ANP for the final Evaluation of a provider has been demonstrated through an illustration. This approach enables the decision-makers to better understand the complex relationships of the relevant attributes in the decision-making, which may subsequently improve the reliability of the decision.
Non-Bifurcated Routing in Wireless Multi-Hop Mesh Networks
Authors: Abdullah-Al Mahmood, Ehab S. Elmallah, Ahmed Kamal
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

In this paper we consider traffic routing in 802.11- based multi-hop Wireless Mesh Networks (WMNs). Interest in such networks arises since they offer flexible, and cost effective means of providing Internet connectivity to communities of subscribers. Successful deployment of such networks, however, hinges on the ability of the network to serve subscribers at the data rates specified by service agreements, as well as providing quality of service to certain key traffic types, such as TCP traffic, delay-jitter sensitive traffic, and traffic that requires synchronized delivery to end users. Since delays on different routes in such networks may vary widely, routing of the above traffic types can potentially benefit from non-bifurcated routing schemes that do not split flows among multiple paths. In this paper, we formalize the problem of non-bifurcated routing, while meeting subscriber demands, as an optimization problem. We present a heuristic algorithm that utilizes results from the theory of maximum flows, and insights into the routing problem to obtain efficient solutions. Simulation experiments indicate improved achieved throughput, and delay-jitter results over the use of the standard Dynamic Source Routing (DSR) algorithm.
SLOQUE: slot-based query expansion for complex questions
Authors: Maggy Anastasia Suryanto, Ee-Peng Lim, Aixin Sun, Roger H. L. Chiang
Venue: Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience (2007)

Searching answers to complex questions is a challenging IR task. In this paper, we examine the use of query templates with semantic slots to formulate slot-based queries. These queries have query terms assigned to entity and relationship slots. We develop several query expansion methods for slot-based queries so as to improve their retrieval effectiveness on a document collection. Each method consists of a combination of term scoring scheme, term scoring formula, and term assignment scheme. Our preliminary experiments evaluate these different slot-based query expansion methods on a collection of news documents,and conclude that:(1) slot-based queries yield better retrieval accuracy compared to keyword-based queries in the complex question problems; and (2)directly applying traditional query expansion on the query terms of each slot does not always work well.
The Determination of Loop Invariants for Programs with Arrays
Authors: H. A. Ellozy
Venue: IEEE Transactions on Software Engineering (1981)

This paper describes a method for the generation of loop predicates (or invariant assertions) for programs operating on arrays. The technique described is an application of difference equations.
Permutable Queue as a 1-in-N-out Message Router
Authors: Gongzhu Hu
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

The basic queue is a first-in-first-out linear data structure (software component). It can be considered as a communication device with one input port and one output port. In the paper, we investigate the behavior of an extended queue that has one input channel and multiple output channels. An enter-queue command enters a data item into the queue as does an ordinary queue, but a de-queue command removes the front item and sends it to a specific output channel. This is similar to the function of a simplified message router. We define a set of stream functions to map between input stream and output stream to describe the behavior of the queue. Because of the items in the input stream may be re-ordered to meet the "routing" requirements, we call the software component "permutable queue."
An extension of three-parameter Burr III distribution for low-flow frequency analysis
Authors: Quanxi Shao, Yongqin D. Chen, Lu Zhang
Venue: Computational Statistics Data Analysis (2008)

In this paper we propose an extension of the three-parameter Burr III distribution with the consideration of both theoretical and practical reasons. The research is motivated by low-flow frequency analysis in water resources research. Three commonly used parameter estimation methods were evaluated, including the method of moments, probability-weighted moments (or L-moments) and maximum likelihood method. The computing issues in the parameter estimation are also discussed. The performance of the proposed distribution is examined using a simulation study and real data from large number of catchments from Australia.
An Approach for Network Security Analysis Using Logic Exploitation Graph
Authors: Han-dong Mao, Wei-Ming Zhang
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Recent work in network security has focused on the fact that combinations of exploits are the typical means by which an attacker breaks into a network. Researchers have proposed a variety of graph-based analysis approach, and there is often a lack of logical formalism. This paper describes a new approach to represent and analyze network vulnerability. We propose logical exploitation graph, which directly illustrate logical dependencies among exploitation goals and network configure. Our logical exploitation graph generation tool builds upon LEG-NSA, a network security analyzer based on Prolog logical programming. We demonstrate how to reason all exploitation paths using bottom-up and top-down evaluation algorithms in the Prolog logic- programming engine. We show experimental evidence that our logical exploitation graph generation algorithm is very efficient.
A New Double Scheduling DBA Algorithm for Next Generation Access Network
Authors: Wei Chen, Jingtao Song, Jinan Leng, Hanyang Lu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Ethernet-based passive optical network (EPON) has emerged as one of the most promising access network technologies. A critical issue of EPON is the shared upstream channel control algorithm. In this paper, we propose a new Double Scheduling DBA algorithm based on Token Switching and Double Scheduling procedure. The algorithm provides improvements in comparison to two previously proposed algorithms, the Hybrid Granting algorithm (HG) and the High Utilization and the Hybrid Granting algorithm (HUHG). The simulation results show that our proposed algorithm can provide very low queuing delay and delay jitter for the real-time services and can satisfy specific real-time services QoS demand. In addition, it can provide higher bandwidth utilization than former HG and HUHG.
Extending systems-on-chip to the third dimension: performance, cost and technological tradeoffs
Authors: Roshan Weerasekera, Li-Rong Zheng, Dinesh Pamunuwa, Hannu Tenhunen
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Because of the today's market demand for high-performance, high-density portable hand-held applications, electronic system design technology has shifted the focus from 2-D planar SoC single-chip solutions to different alternative options as tiled silicon and single-level embedded modules as well as 3-D integration. Among the various choices, finding an optimal solution for system implementation dealt usually with cost, performance and other technological trade-off analysis at the system conceptual level. It has been identified that the decisions made within the first 20% of the total design cycle time will ultimately result upto 80% of the final product cost. In this paper, we discuss appropriate and realistic metric for performance and cost trade-off analysis both at system conceptual level (up-front in the design phase) and at implementation phase for verification in the three-dimensional integration. In order to validate the methodology, two ubiquitous electronic systems are analyzed under various implementation schemes and discuss the pros and cons of each of them.
Using animation courseware in the teaching of database security
Authors: Mario Guimaraes, Meg Murray
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

Information security, and particularly, data security, are primary concerns especially as more and more data are shared over mediums such as the Internet and the Web. Traditionally database security focused on user authentication and managing user privileges to database objects. This has proven to be inadequate given the growing number of successful database hacking incidents and the increase in the number of organizations reporting loss of sensitive.
Special Feature: Interactive Graphics Teleconferencing
Authors: W. Pferd
Venue: Computer (1979)

Interactive graphic displays of layouts or design plans, already in widespread use as design aids, can be even more effective when used in conjunction with teleconferencing.
An adaptive approach to schema classification for data warehouse modeling
Authors: Hong-Ding Wang, Yun-Hai Tong, Shao-Hua Tan, Shi-Wei Tang, Dong-Qing Yang, Guo-Hui Sun
Venue: Journal of Computer Science and Technology (2007)

Data warehouse (DW) modeling is a complicated task, involving both knowledge of business processes and familiarity with operational information systems structure and behavior. Existing DW modeling techniques suffer from the following major drawbacks -- data-driven approach requires high levels of expertise and neglects the requirements of end users, while demand-driven approach lacks enterprise-wide vision and is regardless of existing models of underlying operational systems. In order to make up for those shortcomings, a method of classification of schema elements for DW modeling is proposed in this paper. We first put forward the vector space models for subjects and schema elements, then present an adaptive approach with self-tuning theory to construct context vectors of subjects, and finally classify the source schema elements into different subjects of the DW automatically. Benefited from the result of the schema elements classification, designers can model and construct a DW more easily.
Performance Analysis of Single Cell IEEE 802.16e Wireless MAN
Authors: Thierry Peyre, Rachid ElAzouzi
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

We analyze IEEE 802.16e medium access control (MAC) sublayer and provides a simple analytical model to compute the 802.16e MAC throughput. Our approach is to begin with a key approximation made by [1] in IEEE 802.11. This study leads to a fixed point equation, which characterizes the operating point of system. It allows us to compute the attempt rate of a mobile in saturated case as well as the throughput formulas for the overall network. Moreover, our performance model deals with a recently released IEEE802.16 criterium : the tr parameter, which have a main impact on the MAC performance.
Leveraging Legacy Workflow Capabilities in a Grid Environment
Authors: Zhang Liyong, Zhao Zhuofeng, Li Houfu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

A large number of workflow systems are in existence, offering various orchestration capabilities. How to make full use of the legacy workflow capabilities in a grid environment is of importance for saving investments as well as enabling dynamic collaboration and boundary-crossing problem solving. In this paper, we propose a concept model for leveraging and aggregating legacy workflow capabilities. The model contains a general way to describe capabilities of legacy workflow systems, two main abstractions for transparent workflow capability usage and an abstract way for boundary-crossing workflow definition. The presented is evaluated with a case study.
A System for Database Visual Querying and Query Visualization: Complementing Text and Graphics to Increase Expressiveness
Authors: Claudio Cerullo, Marco Porta
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In this paper we present a system intended for both visual specification of relational database queries and visual description of "ordinary" (textual) SQL queries. Through the GraphSQL visual language, SQL state-ments can be expressed graphically, which may be useful to help inexperienced users learn the principles at the basis of the interaction with relational data-bases, as well as to allow expert users to better express non-trivial queries. On the other hand, through the automatic translation functionality of our system, tex-tual SQL statements can be turned into GraphSQL graphical representations, thus highlighting the parts of which they are composed and their interrelations.
Automatic attack plan recognition from intrusion alerts
Authors: Wang Li, Li Zhi-tang, Ma Jie, Ma Yang-ming, Zhang Ai-fang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

The amount of security application products connected to the Internet increased so dramatically that they usually generate huge volumes of security audit data. Therefore, it is important to develop an advanced alert correlation system that can reduce data redundancy and provide effective direction. This paper describes the framework, SATA, for Security Alerts and Threats analysis. Using SATA, raw audit data is first preprocessed into hi-alerts, which are refined and verified as true threat. We further analyze the correlation-ship of real-time hi-alerts to achieve the goal of online attack plan recognition. A key contribution of the paper is thus in automatic "multi-stage attack plan recognition". It also solves the problem of detecting novel multi-stage attacks. Experiment shows our approach can effectively correlate multi-stage attack behaviors and identify true attack threats.
Locality Sensitive Pseudo-Code for Document Images
Authors: K. Terasawa, Y. Tanaka
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

In this paper, we propose a novel scheme for represent- ing character string images in the scanned document. We converted conventional multi-dimensional descriptors into pseudo-codes which have a property that: if two vectors are near in the original space then encoded pseudo-codes are `semiequivalent' with high probability. For this conversion, we combined Locality Sensitive Hashing (LSH) indices and at the same time we also developed a new family of LSH functions that is superior to earlier ones when all vectors are constrained to lie on the surface of the unit sphere. Word spotting based on our pseudo-code becomes faster than multi-dimensional descriptor-based method while it scarcely degrades the accuracy.
Design tool solutions for mixed-signal/RF circuit design in CMOS nanometer technologies
Authors: Georges G. E. Gielen
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

The scaling of CMOS technology into the nanometer era enables the fabrication of highly integrated systems, which increasingly contain analog and/or RF parts. However, scaling into the nanometer era also brings problems of leakage power, increasing variability and degradation, reducing supply voltages and worsening signal integrity conditions, all this in combination with tightening time-to-market constraints. Design methodologies and tools need to be developed to address these problems. This invited paper describes progress in modeling techniques for design and verification of complex integrated systems, in circuit and yield optimization tools for analog/RF circuits, as well as in signal integrity analysis methods such as EMC/EMI analysis.
Parameter Selection for Sub-hyper-sphere Support Vector Machine
Authors: Peng Chen, Tao Wen
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Sub-hyper-sphere support vector machines (SVMs) are proposed for solving the classification of the intersections of hyper-spheres when dealing with multi-class classification problem. Since the Gaussian kernel parameter influences the overlap position of the hyper-spheres, the resulting minimum bounding sphere-based classifier must be chosen optimally. This paper presents a new GA-based parameter selection method to get better generalization accuracy. Experimental results show the proposed approach is feasible and efficient.
A Survey of Reasoning in Parallelization
Authors: Mikhail Chalabine, Christoph Kessler
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

We elaborate on reasoning in contemporary (semi) automatic parallelizing refactoring. As the main contribution we summarize contemporary approaches and show that all attempts to reason in parallelization thus far, have amounted to local code analysis given data and control dependencies. We conclude that, by retaining this perspective only, parallelization continues to exploit merely a subset of the reasoning methods available today and is likely to remain limited. To address this problem we suggest to expand the local analyses, such that, they take seriously relations between individual local parallelizing transformations. We argue that such a coupling allows to process sparser parallelizable constructs, such as, Producer-Consumer Coordination. We identify questions to be addressed to put this principle into action and report on-going work on (reasoning) mechanisms able to support this.
Simulation of a molecular motor based communication network
Authors: Michael Moore, Akihiro Enomoto, Tadashi Nakano, Tatsuya Suda, Atsushi Kayasuga, Hiroaki Kojima, Hitoshi Sakakibara, Kazuhiro Oiwa
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

Molecular communication provides a mechanism for the coordination and control of micro-scale and nano-scale devices. In this paper, we describe simulation models to evaluate a molecular communication system that uses molecular motors to transport information molecules over a filament network. The molecular communication system includes an abstracted sender device that releases the information molecules into the environment and a receiver device that detects those molecules as information. In biological systems, molecules move through the environment using methods such as molecular motors that walk on filaments (for certain intracellular transport) or passive diffusion through Brownian motion (for both inter and intracellular transport). We perform simulations to compare the molecular motor system and a Brownian diffusion system and measure the success rate and delay of communicating to receivers. Recent research in engineering biological systems focuses on communication on a two-dimensional surface, and thus we focus on characterizing communications between a sender and receiver that are randomly located on a surface.
New bounds for Morse clusters
Authors: Tamás Vinkó, Arnold Neumaier
Venue: Journal of Global Optimization (2007)

This paper presents new, simple arguments improving the lower bounds for the total energy and the minimal inter-particle distance in minimal energy atom cluster problems with interactions given by a Morse potential, where the atom separation problem is difficult due to the finite energy at zero atom separation. Apart from being sharper than previously known bounds, they also apply for a wider range ¿ ¿ 4.967 of the parameter in the Morse potential. Most results also hold for more general pair potentials.
SiteRank-Based Crawling Ordering Strategy for Search Engines
Authors: Qiancheng Jiang, Yan Zhang
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Search engines are playing a more and more important role in discovering information nowadays. Due to limi- tations of time-consuming, network bandwidth and hard- wares, we cannot obtain the whole information on the web and have to download important information first. In this paper we propose a novel crawling ordering strategy which is based on SiteRank. Experimental results running on over 15 million pages indicate that it can work efficiently in dis- covering important pages under the PageRank evaluation of page quality. Furthermore, it exhibits the ability of anti- spamming.