ppxscal/embedding_network huggingface dataset:
Study on Scheduling Model for Arrival Aircraft in the Terminal Area
Authors: Chen Shuang, Xia Xuezhi
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Based on structure of terminal area in airspace, aircraft scheduling problem can be divided into sequencing problem and merging problem. FCFS principle and chain model merging algorithms are discussed to resolve aircraft scheduling problem. In order to get the weight of chain model, synthetic decision-making method is used. Then an algorithm for chain model in merging scheduling is proposed. At last, scheduling algorithms are tested on simulation cases. The result shows that the optimal scheduling algorithms have preferable scheduling performance and they can relieve burden of controller.
A high-order cell-centered Lagrangian scheme for compressible fluid flows in two-dimensional cylindrical geometry
Authors: Pierre-Henri Maire
Venue: Journal of Computational Physics (2009)

The goal of this paper is to present high-order cell-centered schemes for solving the equations of Lagrangian gas dynamics written in cylindrical geometry. A node-based discretization of the numerical fluxes is obtained through the computation of the time rate of change of the cell volume. It allows to derive finite volume numerical schemes that are compatible with the geometric conservation law (GCL). Two discretizations of the momentum equations are proposed depending on the form of the discrete gradient operator. The first one corresponds to the control volume scheme while the second one corresponds to the so-called area-weighted scheme. Both formulations share the same discretization for the total energy equation. In both schemes, fluxes are computed using the same nodal solver which can be viewed as a two-dimensional extension of an approximate Riemann solver. The control volume scheme is conservative for momentum, total energy and satisfies a local entropy inequality in its first-order semi-discrete form. However, it does not preserve spherical symmetry. On the other hand, the area-weighted scheme is conservative for total energy and preserves spherical symmetry for one-dimensional spherical flow on equi-angular polar grid. The two-dimensional high-order extensions of these two schemes are constructed employing the generalized Riemann problem (GRP) in the acoustic approximation. Many numerical tests are presented in order to assess these new schemes. The results obtained for various representative configurations of one and two-dimensional compressible fluid flows show the robustness and the accuracy of our new schemes.
The Role of Intermediaries in the Development of Asynchronous Rural Access
Authors: Jerry Watkins, Jo Tacchi, M. S. Kiran
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

In Orissa state, India, the DakNet system supports asynchronous Internet communication between an urban hub and rural nodes. DakNet is noteworthy in many respects, not least in how the system leverages existing transport infrastructure. Wi-Fi transceivers mounted on local buses send and receive user data from roadside kiosks, for later transfer to/from the Internet via wireless protocols. This store-and-forward system allows DakNet to offer asynchronous communication capacity to rural users at low cost. The original ambition of the DakNet system was to provide email and SMS facilities to rural communities. Our 2008 study of the communicative ecology surrounding the DakNet system revealed that this ambition has now evolved --- in response to market demand --- to the extent that e-shopping (rather than email) has become the primary driver behind the DakNet offer.
Social Network Analysis as Knowledge Discovery Process: A Case Study on Digital Bibliography
Authors: Michele Coscia, Fosca Giannotti, Ruggero Pensa
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

Today Digital Bibliographies are a powerful instrument that collects a great amount of data about scientific publications. Digital Bibliographies have been used as basis of many studies focused on the knowledge extraction in databases. Here we present anew methodology for mining knowledge in this field. Our approach aims to apply the potential of social network analysis techniques to accomplish this task, using a network representation of bibliography data. Besides we use some data mining techniques applied on social network representations in order to enrich this new point of view and to evolve our methodology towards a comprehensive local and global bibliography analysis workflow seen as a Knowledge Discovery process.
Lexical Chains Segmentation in Summarization
Authors: Doina Tatar, Andreea Diana Mihis, Gabriela Serban Czibula
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

In this paper we propose a new method of linear textsegmentation based on lexical cohesion of a text. The usualsteps ( to compute the lexical chains according to relatednesscriteria, to score the chains after different parameters,to select the strong chains, to obtain the segments) arereplaced by a single procedure. Namely, a single chain ofdisambiguated words in a text is established and the ripsof this single chain are considered as boundaries of thesegments of the cohesion structure of the text (CohesionTextTiling or CTT).The summaries of arbitrarily length are obtained by extractionusing three different methods applied to the obtainedsegments. The informativeness of the obtained summaries iscompared with the informativeness of the pair summaries ofthe same length obtained using an earlier method of logicalsegmentation (coherence segmentation) by text entailment(Logical TextTiling or LTT). Some experiments about CTTand LTT methods are made for four ”classical” texts insummarization literature. The conclusion is that the qualityof the summarization using cohesion segmentation (CTT) isbetter than the quality using logical (coherence) segmentation(LTT).
Learning generalized plans using abstract counting
Authors: Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

Given the complexity of planning, it is often beneficial to create plans that work for a wide class of problems. This facilitates reuse of existing plans for different instances drawn from the same problem or from an infinite family of similar problems. We define a class of such planning problems called generalized planning problems and present a novel approach for transforming classical plans into generalized plans. These algorithm-like plans include loops and work for problem instances having varying numbers of objects that must be manipulated to reach the goal. Our approach takes as input a classical plan for a certain problem instance. It outputs a generalized plan along with a classification of the problem instances where it is guaranteed to work. We illustrate the utility of our approach through results of a working implementation on various practical examples.
Variational Bayesian learning of nonlinear hidden state-space models for model predictive control
Authors: Tapani Raiko, Matti Tornio
Venue: Neurocomputing (2009)

This paper studies the identification and model predictive control in nonlinear hidden state-space models. Nonlinearities are modelled with neural networks and system identification is done with variational Bayesian learning. In addition to the robustness of control, the stochastic approach allows for various control schemes, including combinations of direct and indirect controls, as well as using probabilistic inference for control. We study the noise-robustness, speed, and accuracy of three different control schemes as well as the effect of changing horizon lengths and initialisation methods using a simulated cart-pole system. The simulations indicate that the proposed method is able to find a representation of the system state that makes control easier especially under high noise.
Quantification of Anonymity for Mobile Ad Hoc Networks
Authors: Marie Elisabeth Gaup Moe
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We propose a probabilistic system model for anonymous ad hoc routing protocols that takes into account the a priori knowledge of the adversary, and illustrate how the information theoretical entropy can be used for quantification of the anonymity offered by a routing protocol as the adversary captures an increasing number of nodes in the network. The proposed measurement schema is applied to ANODR and ARM routing protocols.
Humor: prosody analysis and automatic recognition for F*R*I*E*N*D*S*
Authors: Amruta Purandare, Diane Litman
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

We analyze humorous spoken conversations from a classic comedy television show, FRIENDS, by examining acoustic-prosodic and linguistic features and their utility in automatic humor recognition. Using a simple annotation scheme, we automatically label speaker turns in our corpus that are followed by laughs as humorous and the rest as non-humorous. Our humor-prosody analysis reveals significant differences in prosodic characteristics (such as pitch, tempo, energy etc.) of humorous and non-humorous speech, even when accounted for the gender and speaker differences. Humor recognition was carried out using standard supervised learning classifiers, and shows promising results significantly above the baseline.
Forecasting broadband Internet adoption on trains in Belgium
Authors: Tom Evens, Dimitri Schuurman, Lieven De Marez, Gino Verleye
Venue: Telematics and Informatics (2010)

Thanks to the massive success of mobile access devices such as netbooks or Apple's iPhone 3G, Internet on the move has become one of the prominent features of today's information society. With the emergence of wireless and mobile communication networks, the railroad industry is now catching up on this new technology in their battle with low-cost operators to bring more productivity and entertainment possibilities to its passengers. With millions of daily commuters as potential service users, this transport branch offers high business opportunities. However, while most field trials and research effort have mainly focused on the enabling technology, little research effort has been conducted to forecast the demand-side. This article tries to fill this gap by presenting original results gathered from a large-scale survey amongst 1324 regular train travellers. By means of the Product Specific Adoption Potential method, we predict the potential market penetration of wireless Internet services onboard trains and estimate the size and nature of five adopter segments in terms of socio-demographics, drivers and thresholds, willingness to pay, applications and quality of service. We will discuss the practical implications of these insights in order to develop viable business models, set up introduction strategies and build out user-driven infrastructure networks.
Short and Stateless Signatures from the RSA Assumption
Authors: Susan Hohenberger, Brent Waters
Venue: Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology (2009)

We present the first signature scheme which is "short", stateless and secure under the RSA assumption in the standard model. Prior short, standard model signatures in the RSA setting required either a strong complexity assumption such as Strong RSA or (recently) that the signer maintain state. A signature in our scheme is comprised of one element in ${\mathcal {Z}{^*}_{N}}$ and one integer. The public key is also short, requiring only the modulus N, one element of ${\mathcal {Z}{^*}_{N}}$, one integer and one PRF seed.To design our signature, we employ the known generic construction of fully-secure signatures from weakly-secure signatures and a chameleon hash. We then introduce a new proof technique for reasoning about weakly-secure signatures. This technique enables the simulator to predict a prefix of the message on which the adversary will forge and to use knowledge of this prefix to embed the challenge. This technique has wider applications beyond RSA.We use it to provide an entirely new analysis of the security of the Waters signatures: the only short, stateless signatures known to be secure under the Computational Diffie-Hellman assumption in the standard model.
The Assessment of Driver's Arousal States from the Classification of Eye-Blink Patterns
Authors: Yoshihiro Noguchi, Keiji Shimada, Mieko Ohsuga, Yoshiyuki Kamakura, Yumiko Inoue
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

To realize the real-time assessment of driver's arousal states, we propose the assessment method based on the analysis of eye-blink characteristics form image sequences. The driver's arousal level while driving is not monotonous falling from high to low. We proposed the two-dimensional arousal states transition model which was taken into account the fact that a driver usually held out against sleepiness. The eye-blink pattern categories were classified from image sequence using HMM (Hidden Markov Model), then the driver's arousal states were finally assessed using HMM by histogram distribution of those typical eye-blink categories. The arousal assessment results are also verified against the rating results by trained raters.
Trace Semantics is Fully Abstract
Authors: Sumit Nain, Moshe Y. Vardi
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

The discussion in the computer-science literature of the relative merits of linear- versus branching-time frameworks goes back to the early 1980s. One of the beliefs dominating this discussion has been that the linear-time framework is not expressive enough semantically, making linear-time logics lacking in expressiveness. In this work we examine the branching-linear issue from the perspective of process equivalence, which is one of the most fundamental concepts in concurrency theory, as defining a notion of equivalence essentially amounts to defining semantics for processes. We accept three principles that have been recently proposed for concurrent-process equivalence. The first principle takes contextual equivalence as the primary notion of equivalence. The second principle requires the description of a process to specify all relevant behavioral aspects of the process. The third principle requires observable process behavior to be reflected in its input/output behavior. It has been recently shown that under these principles trace semantics for nondeterministic transducers is fully abstract. Here we consider two extensions of the earlier model: probabilistic transducers and asynchronous transducers. We show that in both cases trace semantics is fully abstract.
Fast communication: Generalized entropic uncertainty principle on fractional Fourier transform
Authors: Xu Guanlei, Wang Xiaotong, Xu Xiaogang
Venue: Signal Processing (2009)

The entropic uncertainty principle is an element in information theory and plays an important role in signal processing. Based on the relations between the original function and the definition of the fractional Fourier transform (FRFT), two novel entropic uncertainty principles in FRFT domains, in which one is Shannon entropy uncertainty principle and the other is Renyi entropy uncertainty principle, are derived, which are associated with the FRFT parameters. In addition, the extended Renyi entropy uncertainty principle for multiple functions and discrete entropy uncertainty principle are explored as well. These inequalities disclose the relations between the bounds and the transform parameters and sampling periods.
An Anonymous Trustful-Agents-Based Trust Model for P2P Network
Authors: Hao Liu, Lian-Ming Zhang, Bing Zeng
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Secure and efficient trust model is one of vital means for guaranteeing data authenticity in P2P network. An anonymous trustful-agents-based trust model is proposed in this paper, which comes from construction approach of trust relations in the social network. This model uses several public/ private key pairs and onion routing, as a result, which is capable of commendably guaranteeing peer anonymity and data authenticity. In addition, analysis and simulation results testify that this model can effectively restrain several typical security attacks, such as pretend, slander and exaggerate.
Summarizing email threads
Authors: Owen Rambow, Lokesh Shrestha, John Chen, Chirsty Lauridsen
Venue: Proceedings of HLT-NAACL 2004: Short Papers on XX (2004)

Summarizing threads of email is different from summarizing other types of written communication as it has an inherent dialog structure. We present initial research which shows that sentence extraction techniques can work for email threads as well, but profit from email-specific features. In addition, the presentation of the summary should take into account the dialogic structure of email communication.
Linear driving force models for dynamic adsorption of volatile organic compound traces by porous adsorbent beds
Authors: Agnès Joly, Alain Perrard
Venue: Mathematics and Computers in Simulation (2009)

Models for the dynamic adsorption of volatile organic compound (VOC) traces in air are considered. They are based on the linear driving force approximation associated with various adsorption isotherms characteristic of the couple VOC-adsorbent (Langmuir, Freundlich, Type V and Dubinin-Astakhov (D-A)). This versatile last model is useful not only for VOCs but also for water vapour according to the values of its three parameters. A necessary and sufficient condition for the existence of a constant pattern concentration front is given. The model involving the D-A isotherm provides an interesting case, which is discussed. Theoretical results are illustrated by numerical simulations carried out by means of the finite element method (with Comsol software) and typical behaviours of the breakthrough curves for various adsorbent bed lengths are described.
Design of Distributed Architecture Based on Java Remote Method Invocation Technology
Authors: Delin Hou, Huosong Xia
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

Remote method invocation is a distributed object model for the Java programming language that making distributed objects easy to implement and tousle. Remote method invocation applications are often comprised of two separate programs: a Server and a Client. A typical server application creates a number of remote objects, makes references to those remote objects accessible, and waits for clients to invoke methods on those remote objects. In view of the needs of the organization’s business and cross-platform of the system, the distributed object technology and component technology based on the java platform is an ideal choice of the large-scale distributed application system of the development of the enterprise. With respect to the current popular web-based distributed application system, from the point of the software design, this article puts forward the distributed architecture based on the java remote method invocation technology, and in the actual design and development have got more satisfactory results.
On the Computational Complexity of Verifying One-Counter Processes
Authors: Stefan Goller, Richard Mayr, Anthony Widjaja To
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems over one-counter processes: model checking with the temporal logic EF, where formulas are given as directed acyclic graphs, and weak bisimilarity checking against finite systems. We show that both problems are $\P^\NP$-complete. This is achieved by establishing a close correspondence with the membership problem for a natural fragment of Presburger Arithmetic, which we show to be$\P^\NP$-complete. This fragment is also a suitable representation for the global versions of the problems. We also show that there already exists a fixed EF formula(resp. a fixed finite system) such that model checking (resp. weak bisimulation) over one-counter processes is hard for $\P^{\NP[\log]}$. However, the complexity drops to $\P$ if the one-counter process is fixed.
Fast spectral learning using Lanczos eigenspace projections
Authors: Sridhar Mahadevan
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

The core computational step in spectral learning - finding the projection of a function onto the eigenspace of a symmetric operator, such as a graph Laplacian - generally incurs a cubic computational complexity O(N3). This paper describes the use of Lanczos eigenspace projections for accelerating spectral projections, which reduces the complexity to O(nTop + n2N) operations, where n is the number of distinct eigenvalues, and Top is the complexity of mUltiplying T by a vector. This approach is based on diagonalizing the restriction of the operator to the Krylov space spanned by the operator and a projected function. Even further savings can be accrued by constructing an approximate Lanczos tridiagonal representation of the Krylov-space restricted operator. A key novelty of this paper is the use of Krylov-subspace modulated Lanczos acceleration for multi-resolution wavelet analysis. A challenging problem of learning to control a robot arm is used to test the proposed approach.
Changes of Forest Landscape Based on Historical Management in Northeastern China
Authors: Wang Hui, Shao Guofan, Dai Limin
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Forest landscape change and its driving forces are becoming the major issues in forest management. Comprehension of historical changes in landscape and forest management will provide valuable insights into current ecosystem and will support future forest management and restoration strategies. This paper focused on the changes in the forest landscape of Baihe Forestry bureau in northeastern China from 1987 to 2000. We used a Geographic Information System(GIS) to investigate the landscape pattern based on interpretation of satellite images and forest stand maps. Landscape metrics calculated using the FRAGSTATS software for spatial pattern analysis. The results showed that forest lands are the main landscape type occupied over 85% both in 1987 and 2000. The area of shrub thicket increased at the percentage of 10.7% . Patch density and edge density increased from 4.46 to 7.23 per 100ha and from 40.46 to 133.64m/ha, respectively. Forest landscape became more fragmented from 1987 to 2000. Patch density of sub-patch decreased while the patch density of forest lands increased in Baihe Forestry bureau within the research period. It showed the functional heterogeneity of forest lands landscape declined with the management. The number of age sub-patches, stock volume sub-patches and canopy density sub-patches and their patch spacing depended on the type of forest management. The conclusions were made that forest harvesting is the main driving force for the landscapes change in Baihe Forestry bureau. This study revealed the relationships among landscape change and human activities.It can provide scientific basis for forest management at landscapes scales.