ppxscal/embedding_network huggingface dataset:
Improving GEOS-Chem Model Tropospheric Ozone through Assimilation of Pseudo Tropospheric Emission Spectrometer Profile Retrievals
Authors: Kumaresh Singh, Paul Eller, Adrian Sandu, Kevin Bowman, Dylan Jones, Meemong Lee
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

4D-variational or adjoint-based data assimilation provides a powerful means for integrating observations with models to estimate an optimal atmospheric state and to characterize the sensitivity of that state to the processes controlling it.In this paper we present the improvement of 2006 summer time distribution of global tropospheric ozone through assimilation of pseudo profile retrievals from the Tropospheric Emission Spectrometer (TES) into the GEOS-Chem global chemical transport model based on a recently-developed adjoint model of GEOS-Chem v7. We are the first to construct an adjoint of the linearized ozone parameterization (linoz) scheme that can be of very high importance in quantifying the amount of tropospheric ozone due to upper boundary exchanges. Tests conducted at various geographical levels show that the mismatch between adjoint values and their finite difference approximations could be up to 87% if linoz module adjoint is not used, leading to a divergence in the quasi-Newton approximation algorithm (L-BFGS) during data assimilation. We also present performance improvements in this adjoint model in terms of memory usage and speed. With the parallelization of each science process adjoint subroutine and sub-optimal combination of checkpoints and recalculations, the improved adjoint model is as efficient as the forward GEOS-Chem model.
Automated software license analysis
Authors: Timo Tuunanen, Jussi Koskinen, Tommi Kärkkäinen
Venue: Automated Software Engineering (2009)

Software license is a legal instrument governing the usage or redistribution of copyright-protected software. License analysis is an elaborate undertaking, especially in case of large software consisting of numerous modules under different licenses. This paper describes an automated approach for supporting software license analysis. The approach is implemented in a reverse engineering tool called ASLA. We provide a detailed description of the architecture and features of the tool. The tool is evaluated on the basis of an analysis of 12 OSS (open source software) packages. The results show that licenses for (on average) 89% of the source code files can be identified by using ASLA and that the efficiency of the automated analysis is (on average) 111 files per second. In a further comparison with two other open source license analyzers--OSLC and FOSSology--ASLA shows a competitive performance. The results validate the general feasibility of the ASLA approach in the context of analyzing non-trivial OSS packages.
Fast information retrieval from web pages
Authors: Hazem M. El-Bakry, Nikos Mastorakis
Venue: Proceedings of the 7th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics (2008)

In this paper, a new fast algorithm for information retrieval is presented. Such algorithm relies on performing cross correlation in the frequency domain between input data and the input weights of fast neural networks (FNNs). It is proved mathematically and practically that the number of computation steps required for the presented FNNs is less than that needed by conventional neural networks (CNNs). The main objective of Internet users is to find the required information with high efficiency and effectiveness. Finding information on an object's visual features is useful when specific keywords for the object are not known. Since intelligent mobile agent technology is expected to be a promising technology for information retrieval, there is a number of intelligent mobile agent based-information retrieval approaches have been proposed in recent years. Here, the work presented in [25] for image-based information retrieval using mobile agents is greatly enhanced. Multiple information agents continuously traverse the Internet and collect images that are subsequently indexed based on image information such as the URL location, size, type and the date of indexation. In the search phase, the intelligent mobile agent receives the image of object as a query and searches the set of web pages that contain information about the object. This is done by matching the query to images on web pages faster than the work presented in [25].
A combinatorial algorithm for the TDMA message scheduling problem
Authors: Clayton W. Commander, Panos M. Pardalos
Venue: Computational Optimization and Applications (2009)

In this paper, we introduce a combinatorial algorithm for the message scheduling problem on Time Division Multiple Access (TDMA) networks. In TDMA networks, time is divided in to slots in which messages are scheduled. The frame length is defined as the total number of slots required for all stations to broadcast without message collisions. The objective is to provide a broadcast schedule of minimum frame length which also provides the maximum throughput. This problem is known to be $\mathcal{NP}$ -hard, thus efficient heuristics are needed to provide solutions to real-world instances. We present a two-phase algorithm which exploits the combinatorial structure of the problem in order to provide high quality solutions. The first phase finds a feasible frame length in which the throughput is maximized in phase two. Computational results are provided and compared with other heuristics in the literature as well as to the optimal solutions found using a commercial integer programming solver. Experiments on 63 benchmark instances show that the proposed method is able to provide optimal frame lengths for all cases with near optimal throughput.
Global exponential stability and global attractivity of impulsive Hopfield neural networks with time delays
Authors: Xilin Fu, Xiaodi Li
Venue: Journal of Computational and Applied Mathematics (2009)

In this paper, by means of constructing the extended impulsive delayed Halanay inequality and by Lyapunov functional methods, we analyze the global exponential stability and global attractivity of impulsive Hopfield neural networks with time delays. Some new sufficient conditions ensuring exponential stability of the unique equilibrium point of impulsive Hopfield neural networks with time delays are obtained. Those conditions are more feasible than that given in the earlier references to some extent. Some numerical examples are also discussed in this work to illustrate the advantage of the results we obtained.
Practical Java Project for Beginners, 1st edition
Authors: B. M. Harwani, Ivan Bayross
Venue:  (2007)

Special Features of The Book Any body can easily understand the working of JSP and Java Beans. Reader can easily understand how JSP fetches and updates a database. The reader must know core Java and HTML programming before reading this book All commands included in the project with syntax are explained. The working of programs is explained in easy English Theory is included wherever necessary for better understanding of a particular concept This book can be useful for students pursuing B.E. M.C.A, M.Sc.(C.S-), IGNOU, BCA, B.Sc. (I.T.), M.Sc(I.T.) courses who have to make and submit a project as part of their curriculum. Beside them, this book can be of great use for professionals involved in software development or technical services. This book is for anyone who wants to program dynamic, feature rich web applications in JSP The CD-ROM Contains: Tomcat 5.5, a popular servlet and JSP engine J2SE SDK version 1.5 Running JSP Project
Multi-document summarization by sentence extraction
Authors: Jade Goldstein, Vibhu Mittal, Jaime Carbonell, Mark Kantrowitz
Venue: NAACL-ANLP 2000 Workshop on Automatic Summarization (2000)

This paper discusses a text extraction approach to multi-document summarization that builds on single-document summarization methods by using additional, available information about the document set as a whole and the relationships between the documents. Multi-document summarization differs from single in that the issues of compression, speed, redundancy and passage selection are critical in the formation of useful summaries. Our approach addresses these issues by using domain-independent techniques based mainly on fast, statistical processing, a metric for reducing redundancy and maximizing diversity in the selected passages, and a modular framework to allow easy parameterization for different genres, corpora characteristics and user requirements.
New Perspectives on Blended HTML, XHTML, and CSS, 1st edition
Authors: Henry Bojack
Venue:  (2007)

This text offers a new approach to teaching HTML, XHTML and Cascading Styles Sheets (CSS). Beginning Web programming learners will get additional coverage and understanding of HTML, XHTML and CSS that combines reference, practice, and reinforcement all into one easy-to-understand text. CSS material is integrated throughout the HTML and XHTML content to give learners a cohesive understanding of how all the parts work together in creating and designing Web pages. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Stratified Composition of Web Services
Authors: Riina Maigre, Pavel Grigorenko, Peep Küngas, Enn Tyugu
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

We propose an automatic service composition methodology where, three levels of composition knowledge are distinguished: user level, logical level and implementation level knowledge. We use a knowledge-based software development environment CoCoViLa that enables composition throughout these three levels. A motivation for this approach is a need to overcome the complexity of service composition on very large sets of atomic services we are dealing with in our application domain. The domain concerns federated governmental information systems.
Achieving application quality of service in resource-constrained wireless sensor networks
Authors: Chenyang Lu, Gruia-Catalin Roman
Venue:  (2008)

Wireless sensor networks (WSNs) consist of autonomous devices that can sense the environment, process information and communicate wirelessly. They provide distributed monitoring capabilities and hence their applications include habitat monitoring, object tracking, military surveillance and search-and-rescue. These applications necessitate sensor nodes to be low cost, battery powered and have a small form factor, which results in their having very limited resources like bandwidth, computational power, memory and energy. Due to the limited resources, the diverse deployments and the non-deterministic communication medium it becomes highly challenging to provide the desired level of performance and Quality of Service (QoS) to the applications. This dissertation presents the design, development and evaluation of novel protocols and services that provide the required application QoS despite these challenges. The contributions of this dissertation are twofold. The first set of contributions include network protocols that provide application-specific QoS to a subset of WSN applications that involve mobility. Specifically, they include: (1) two wake-up and topology maintenance protocols that provide spatiotemporal performance guarantees to a class of applications involving mobility, (2) a data collection protocol called Roadmap Query which supports safe mobile entity navigation in dynamic environments, and (3) a multi-resolution location directory service that supports a rich set of multi-granular spatial queries about mobile entities, over wide areas covered by multiple sensor and IP networks. The second set of contributions involve a first look at achieving application QoS in multi-application shared WSNs. Since the concept of shared WSNs is relatively new, this dissertation aims to show the feasibility of using such systems to realize integrated sensing systems like automated building management. Significant contributions in this direction include the design, development and evaluation of a utility-based multi-application allocation and deployment environment (UMADE) for shared WSNs. UMADE achieves a near optimal distribution of sensor nodes among contending applications based on application QoS requirements, at deployment time. It supports the end-to-end process of (1) application QoS specification, (2) dynamic node allocation that maximizes overall system utility under sensor node memory constraints, (3) automatic application deployment, and (4) adaptation to network and application dynamics.
Discrete Hit-and-Run for Sampling Points from Arbitrary Distributions Over Subsets of Integer Hyperrectangles
Authors: Stephen Baumert, Archis Ghate, Seksan Kiatsupaibul, Yanfang Shen, Robert L. Smith, Zelda B. Zabinsky
Venue: Operations Research (2009)

We consider the problem of sampling a point from an arbitrary distribution π over an arbitrary subset S of an integer hyperrectangle. Neither the distribution π nor the support set S are assumed to be available as explicit mathematical equations, but may only be defined through oracles and, in particular, computer programs. This problem commonly occurs in black-box discrete optimization as well as counting and estimation problems. The generality of this setting and high dimensionality of S precludes the application of conventional random variable generation methods. As a result, we turn to Markov chain Monte Carlo (MCMC) sampling, where we execute an ergodic Markov chain that converges to π so that the distribution of the point delivered after sufficiently many steps can be made arbitrarily close to π. Unfortunately, classical Markov chains, such as the nearest-neighbor random walk or the coordinate direction random walk, fail to converge to π because they can get trapped in isolated regions of the support set. To surmount this difficulty, we propose discrete hit-and-run (DHR), a Markov chain motivated by the hit-and-run algorithm known to be the most efficient method for sampling from log-concave distributions over convex bodies in Rn. We prove that the limiting distribution of DHR is π as desired, thus enabling us to sample approximately from π by delivering the last iterate of a sufficiently large number of iterations of DHR. In addition to this asymptotic analysis, we investigate finite-time behavior of DHR and present a variety of examples where DHR exhibits polynomial performance.
E-learning Evolution: From M-learning to Educational Semantic Web and Beyond
Authors: Cui Guangzuo, Yang Gongyi, Chen Hu, Fei Chen, Guo Jiuling
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

An e-learning model with ICT technology (ELM) is proposed in this paper. With this model, some education technologies and e-learning evolution are interpreted, such as network education, mobile education, ubiquitous education, educational semantic web, and etc. In the meantime, the way of how to combine new ICT technologies into education is also demonstrated. After discussing the convenience and challenge of various education technologies, a new model called intelligent education is introduced and some recent research results are presented. At last, the author looks ahead the future of information technology and human related disciplines and their effects on education.
The information flow of a mobile E-portfolios
Authors: Hsieh-Hua Yang, Jui-Chen Yu, Lung-Hsing Kuo, Li-Min Chen, Hung-Jen Yang
Venue: Proceedings of the 8th Wseas international conference on Telecommunications and informatics (2009)

Based on the applications of e-portfolios, a mobile system infrastructure was designed with the discussion of information flow scenarios. This study intended to figure out the impacts that mobile technology has exerted on the educational system through the portfolio. To fully understand the potential impact of the mobile electronic learning portfolio system on education, institutions need to take into account the current environment within higher education. Evaluating student performances always has been an important issue for academia.
License integration patterns: Addressing license mismatches in component-based development
Authors: Daniel M. German, Ahmed E. Hassan
Venue: Proceedings of the 2009 IEEE 31st International Conference on Software Engineering (2009)

In this paper we address the problem of combining software components with different and possibly incompatible legal licenses to create a software application that does not violate any of these licenses while potentially having its own. We call this problem the license mismatch problem. The rapid growth and availability of Open Source Software (OSS) components with varying licenses, and the existence of more than 70 OSS licenses increases the complexity of this problem. Based on a study of 124 OSS software packages, we developed a model which describes the interconnection of components in these packages from a legal point of view. We used our model to document integration patterns that are commonly used to solve the license mismatch problem in practice when creating both proprietary and OSS applications. Software engineers with little legal expertise could use these documented patterns to understand and address the legal issues involved in reusing components with different and possibly conflicting licenses.
The Collatz Problem in a New Perspective: Energy Consumption Analysis
Authors: Kostas Zotos, Andreas Litke, George Stephanides, Alexander Chatzigeorgiou
Venue: Proceeding of the 2005 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fourth SoMeT_W05 (2005)

The importance of low power consumption is widely acknowledged due to the increasing use of portable devices, which require minimizing the consumption of energy. Energy dissipation is heavily dependent on the software used in the system. In this paper we analyze the energy consumption of the Collatz Problem and draw some useful conclusions.
Nonlinear approaches on dynamics of multibody mechanical systems with advanced computing tools
Authors: Carmen Debeleac
Venue: Proceedings of the 10th WSEAS international conference on Automation & information (2009)

The study deal with nonlinear approaches in dynamic behavior analysis for multibody mechanical systems by using advanced computing and simulation tools. The main application of this work consist by dynamics estimation of a construction equipments during technological processes, with strong various and intensive dynamic working states. The proposed methodology is capable to simulate the nonlinear behavior of interaction between machine and uneven terrain, and involve innovative modeling and computing tools. Nonlinear approach leads to a high efficacy on dynamic behavior evaluation, with direct impact in optimization of design and exploitation of technological equipments.
A curriculum customization service
Authors: Tamara Sumner, Holly Devaul, Lynne Davis, John Weatherley
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

We demonstrate a prototype Curriculum Customization Service designed and developed with significant teacher input. This prototype illustrates a model for embedding digital library resources into mainstream classroom use. A 10 week pilot study suggests that this Service can increase teachers' use of digital library resources in their class, and encourage them to use resources to customize instruction.
Equivalence of the Lagrange interpolator for uniformly sampled signals and the scaled binomially windowed shifted sinc function
Authors: Mohammad Mahdi Jahani Yekta
Venue: Digital Signal Processing (2009)

The maximally flat (MF) fractional delay (FD) filter which is in fact a Lagrange interpolator for uniformly sampled signals, has previously been shown to be equal to the scaled binomially windowed shifted version of the sinc function; the ideal interpolation kernel for band-limited signals. In this paper, another proof for this equivalence is presented. Unlike its counterparts available in the literature, the proof given here is neither strictly algebraic, nor deploys the explicit coefficient formulas of the MFFD filter. It follows a frequency domain approach based on the definition of this filter instead, and aims to provide more insight into the corresponding equivalence.
Information, Knowledge and Confirmation Holism
Authors: Steve McKinlay
Venue: Proceeding of the 2008 conference on Current Issues in Computing and Philosophy (2008)

An emerging alternative to the problem of knowledge looks towards information as playing a critical role in support of an externalist epistemology, a new theory of knowledge that need not rely upon the traditional but problematic tenets of belief and justification. In support of this information-theoretic epistemology, the relationship between information and knowledge both within philosophical and information technology scholarship has been viewed as an asymmetric one. This relationship is captured by the commonsense view that objective semantic information is prior to and encapsulated by knowledge [1]. This paper develops an argument that challenges this asymmetric assumption. Drawing on the ideas of Gareth Evans [6] and Timothy Williamson [5] we shall argue that (at least in some cases) a coextensive relationship must exist between information and knowledge. We conclude with the view that this relationship throws up problems similar to those discussed by Quine [15] in relation to confirmation holism.
Research on the Reconfigurable Implementation of Neural Network Controller Based on FPGA for DC-DC Converters
Authors: Yanxia Shen, Tai Li, Zhicheng Ji
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

A neural network controller for DC/DC buck converters is proposed, and then the hardware implementation problem of the controller based on FPGA is discussed in this paper. The neural network is trained using bp method. The reconfigurable feature is analyzed and then three basic reconfigurable units are built based on SG / Simulink. The simulation results show that the FPGA-based reconfigurable neural network controller can not only achieve good performances but effectively save resources.
Asynchronous Forward-Bounding for Distributed Constraints Optimization
Authors: Amir Gershman, Amnon Meisels, Roie Zivan
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchronously. The asynchronous forward-bounding algorithm (AFB) is a distributed optimization search algorithm that keeps one consistent partial assignment at all times. Forward bounding propagates the bounds on the cost of solutions by sending copies of the partial assignment to all unassigned agents concurrently. The algorithm is described in detail and its correctness proven. Experimental evaluation of AFB on random Max-DisCSPs reveals a phase transition as the tightness of the problem increases. This effect is analogous to the phase transition of Max-CSP when local consistency maintenance is applied [3]. AFB outperforms Synchronous Branch & Bound (SBB) as well as the asynchronous state-of-the-art ADOPT algorithm, for the harder problem instances. Both asynchronous algorithms outperform SBB by a large factor.