ppxscal/embedding_network huggingface dataset:
Finite difference methods for approximating Heaviside functions
Authors: John D. Towers
Venue: Journal of Computational Physics (2009)

We present a finite difference method for discretizing a Heaviside function H(u(x->)), where u is a level set function u:R^n@?R that is positive on a bounded region @W@?R^n. There are two variants of our algorithm, both of which are adapted from finite difference methods that we proposed for discretizing delta functions in [J.D. Towers, Two methods for discretizing a delta function supported on a level set, J. Comput. Phys. 220 (2007) 915-931; J.D. Towers, Discretizing delta functions via finite differences and gradient normalization, Preprint at http://www.miracosta.edu/home/jtowers/; J.D. Towers, A convergence rate theorem for finite difference approximations to delta functions, J. Comput. Phys. 227 (2008) 6591-6597]. We consider our approximate Heaviside functions as they are used to approximate integrals over @W. We prove that our first approximate Heaviside function leads to second order accurate quadrature algorithms. Numerical experiments verify this second order accuracy. For our second algorithm, numerical experiments indicate at least third order accuracy if the integrand f and @?@W are sufficiently smooth. Numerical experiments also indicate that our approximations are effective when used to discretize certain singular source terms in partial differential equations. We mostly focus on smooth f and u. By this we mean that f is smooth in a neighborhood of @W, u is smooth in a neighborhood of @?@W, and the level set u(x)=0 is a manifold of codimension one. However, our algorithms still give reasonable results if either f or u has jumps in its derivatives. Numerical experiments indicate approximately second order accuracy for both algorithms if the regularity of the data is reduced in this way, assuming that the level set u(x)=0 is a manifold. Numerical experiments indicate that dependence on the placement of @W with respect to the grid is quite small for our algorithms. Specifically, a grid shift results in an O(h^p) change in the computed solution, where p is the observed rate of convergence.
Method of fundamental solutions with optimal regularization techniques for the Cauchy problem of the Laplace equation with singular points
Authors: Takemi Shigeta, D. L. Young
Venue: Journal of Computational Physics (2009)

The purpose of this study is to propose a high-accuracy and fast numerical method for the Cauchy problem of the Laplace equation. Our problem is directly discretized by the method of fundamental solutions (MFS). The Tikhonov regularization method stabilizes a numerical solution of the problem for given Cauchy data with high noises. The accuracy of the numerical solution depends on a regularization parameter of the Tikhonov regularization technique and some parameters of the MFS. The L-curve determines a suitable regularization parameter for obtaining an accurate solution. Numerical experiments show that such a suitable regularization parameter coincides with the optimal one. Moreover, a better choice of the parameters of the MFS is numerically observed. It is noteworthy that a problem whose solution has singular points can successfully be solved. It is concluded that the numerical method proposed in this paper is effective for a problem with an irregular domain, singular points, and the Cauchy data with high noises.
Cognitive load and science text comprehension: Effects of drawing and mentally imagining text content
Authors: Detlev Leutner, Claudia Leopold, Elke Sumfleth
Venue: Computers in Human Behavior (2009)

One hundred and eleven 10th graders read an expository science text on the dipole character of water molecules (ca. 1600 words). Reading instruction was varied according to a 2x2 experimental design with factors 'drawing pictures of text content on paper' (yes, no) and 'mentally imagining text content while reading' (yes, no). The results indicate that drawing pictures, mediated through increased cognitive load, decreased text comprehension and, thus, learning (d=-0.37), whereas mental imagery, although decreasing cognitive load, increased comprehension only when students did not have to draw pictures simultaneously (d=0.72). No evidence was found that the effects were moderated by domain-specific prior knowledge, verbal ability, or spatial ability. The results are in line with cognitive theories of multimedia learning, self-regulated learning, and mental imagery as well as conceptions of science learning that focus on promoting mental model construction by actively visualizing the content to be learned. Constructing mental images seems to reduce cognitive load and to increase comprehension and learning outcome when the mental visualization processes are not disturbed by externally drawing pictures on paper, whereas drawing pictures seems to increase cognitive load resulting in reduced comprehension and learning outcome.
Targeting spam control on middleboxes: Spam detection based on layer-3 e-mail content classification
Authors: Muhammad N. Marsono, M. Watheq El-Kharashi, Fayez Gebali
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

This paper proposes a spam detection technique, at the packet level (layer 3), based on classification of e-mail contents. Our proposal targets spam control implementations on middleboxes. E-mails are first pre-classified (pre-detected) for spam on a per-packet basis, without the need for reassembly. This, in turn, allows fast e-mail class estimation (spam detection) at receiving e-mail servers to support more effective spam handling on both inbound and outbound (relayed) e-mails. In this paper, the naive Bayes classification technique is adapted to support both pre-classification and fast e-mail class estimation, on a per-packet basis. We focus on evaluating the accuracy of spam detection at layer 3, considering the constraints on processing byte-streams over the network, including packet re-ordering, fragmentation, overlapped bytes, and different packet sizes. Results show that the proposed layer-3 classification technique gives less than 0.5% false positive, which approximately equals the performance attained at layer 7. This shows that classifying e-mails at the packet level could differentiate non-spam from spam with high confidence for a viable spam control implementation on middleboxes.
Managing WIP and cycle time with the help of loop control
Authors: Steffen Kalisch, Robert Ringel, Jörg Weigang
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

As an adaptation of the CONWIP concept, AMD has developed a heuristic approach to control the WIP in its wafer fabrication facilities (fabs). The so called "Loop Control" concept helps to utilize the installed equipment in an efficient way and reduces the overall cycle time. Two dynamic constraints (the WIP-Limit and the THP-Limit) are defined to limit the WIP (work in progress) per photo layer and to tackle high WIP situations at individual operations inside a photo layer. Loop Control has been evaluated with help of a fab simulation study prior to implementation in the fab dispatching system. Since its development three years ago, this system operates successfully in the AMD Dresden fabs.
Why industry won't hire your graduates
Authors: Gary B. Shelly
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Vocational or career oriented education as used in this paper is defined as that type of education, at less than a baccalaurete degree, that is aimed at preparing an individual for employment in industry in a specific occupational area. The remarks included in this paper are directed at instructors, administrators, and other educators concerned with this area of data processing education, whether it is in the high school, the vocational school (public or private), the community college, and, in some instances, the universities. During the past year, while serving as an educational consultant in computer education, I have had the opportunity to contact over 400 schools throughout the United States and Canada with career oriented programs in data processing and frequently the comment was heard "What can be done to improve our program to make our students employable?" "Why won't industry hire our graduates?" 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
Refining Method Of Business Process Model - Scenario Oriented Approach For Cross Organizational Business Process
Authors: Satoshi Kumagai, Yoshitaka Tomita
Venue: Journal of Integrated Design Process Science (2007)

Using scenario is an effective way to acquire knowledge about business process. Scenario describes business process in users' perspective using their vocabulary. In cross organizational business process, scenario description is often fragmentary because each expert in the business process tends to be focused within his/her organizational scope. Each expert might be less knowledgeable about cross organizational aspects of business process. His/her description sometimes assumes ambiguous order of events in the scope. Clear terminology describing collaboration is missing. System analyst needs to supplement the description to obtain a business process model for consensus building beyond the scope. This paper presents a method for refining cross-organizational business process model through the use of complementary relationship in diagrammatic representations of scenario. It allows analyst to grasp the entire view of the business process through interactions with experts. Level of refinement is measured and evaluated.
Parameterized Complexity for Domination Problems on Degenerate Graphs
Authors: Petr A. Golovach, Yngve Villanger
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

Domination problems are one of the classical types of problems in computer science. These problems are considered in many different versions and on different classes of graphs. We explore the boundary between fixed-parameter tractable and W-hard problems on sparse graphs. More precisely, we expand the list of domination problems which are fixed-parameter tractable(FPT) for degenerate graphs by proving that Connected k -Dominating set and k -Dominating threshold set are FPT. From the other side we prove that there are domination problems which are difficult (W[1] or W[2]-hard) for this graph class. The Partial k -dominating set and (k,r)-Center for r ¿ 2 are examples of such problems. It is also remarked that domination problems become difficult for graphs of bounded average degree.
A Hybrid Clustering Algorithm Based on Honey Bees Mating Optimization and Greedy Randomized Adaptive Search Procedure
Authors: Yannis Marinakis, Magdalene Marinaki, Nikolaos Matsatsinis
Venue: Learning and Intelligent Optimization: Second International Conference, LION 2007 II, Trento, Italy, December 8-12, 2007. Selected Papers (2008)

This paper introduces a new hybrid algorithmic nature inspired approach based on the concepts of the Honey Bees Mating Optimization Algorithm (HBMO) and of the Greedy Randomized Adaptive Search Procedure (GRASP), for optimally clustering N objects into K clusters. The proposed algorithm for the Clustering Analysis, the Hybrid HBMO-GRASP, is a two phase algorithm which combines a HBMO algorithm for the solution of the feature selection problem and a GRASP for the solution of the clustering problem. This paper shows that the Honey Bees Mating Optimization can be used in hybrid synthesis with other metaheuristics for the solution of the clustering problem with remarkable results both to quality and computational efficiency. Its performance is compared with other popular stochastic/metaheuristic methods like particle swarm optimization, ant colony optimization, genetic algorithms and tabu search based on the results taken from the application of the methodology to data taken from the UCI Machine Learning Repository.
Relating initial turns of human-robot dialogues to discourse
Authors: Maxim Makatchev, Min Kyung Lee, Reid Simmons
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

Similarly, User models can be useful for improving dialogue management. In this paper we analyze human-robot dialogues that occur during uncontrolled interactions and estimate relations between the initial dialogue turns and patterns of discourse that are indicative of such user traits as persistence and politeness. The significant effects shown in this preliminary study suggest that initial dialogue turns may be useful in modeling a user's interaction style.
Finding occurrences of protein complexes in protein-protein interaction graphs
Authors: Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
Venue: Journal of Discrete Algorithms (2009)

In the context of comparative analysis of protein-protein interaction graphs, we use a graph-based formalism to detect the preservation of a given protein complex G in the protein-protein interaction graph H of another species with respect to (w.r.t.) orthologous proteins. Two problems are considered: the Exact-(@m"G,@m"H)-Matching problem and the Max-(@m"G,@m"H)-Matching problems, where @m"G (resp. @m"H) denotes in both problems the maximum number of orthologous proteins in H (resp. G) of a protein in G (resp. H). Following [I. Fagnot, G. Lelandais, S. Vialette, Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs, Journal of Discrete Algorithms 6 (2) (2008) 178-191], the Exact-(@m"G,@m"H)-Matching problem asks for an injective homomorphism of G to H w.r.t. orthologous proteins. The optimization version is called the Max-(@m"G,@m"H)-Matching problem and is concerned with finding an injective mapping of a graph G to a graph H w.r.t. orthologous proteins that matches as many edges of G as possible. For both problems, we essentially focus on bounded degree graphs and extremal small values of parameters @m"G and @m"H.
Distributed Management of Massive Data: An Efficient Fine-Grain Data Access Scheme
Authors: Bogdan Nicolae, Gabriel Antoniu, Luc Bougé
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

This paper addresses the problem of efficiently storing and accessing massive data blocks in a large-scale distributed environment, while providing efficient fine-grain access to data subsets. This issue is crucial in the context of applications in the field of databases, data mining and multimedia. We propose a data sharing service based on distributed, RAM-based storage of data, while leveraging a DHT-based, natively parallel metadata management scheme. As opposed to the most commonly used grid storage infrastructures that provide mechanisms for explicit data localization and transfer, we provide a transparent access model, where data are accessed through global identifiers. Our proposal has been validated through a prototype implementation whose preliminary evaluation on the Grid'5000 testbed provides promising results.
Different wideband direction of arrival(DOA) estimation methods: an overview
Authors: Sandeep Santosh, O. P. Sahu, Monika Aggarwal
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

This paper presents an overview of different types of wideband direction of Arrival (DOA) estimation methods. Direction-finding algorithms have straight forward applications in Sonar and Radar, and are also useful in advanced satellite and cellular communication systems for adaptive beamforming of smart antennas. Coherent Signal Subspace Processing (CSSM), one of the earliest wideband DOA estimation method constructs a single signal subspace for high resolution estimation of angles of arrival of multiple-wideband plane waves. The second approach called the Weighted Average of Signal Subspaces (WAVES) combines a robust near-optimal data-adaptive statistic. This method is used with an enhanced design of focusing matrices to ensure a statistically robust preprocessing of wideband data. Test of Orthogonality of Projected Subspaces (TOPS), the most recent wideband DOA estimation method estimates DOAs by measuring the orthogonal relation between the signal and noise subspaces of multiple frequency components of the sources. The TOPS method performs better than others in mid signal-to-noise ratio (SNR) ranges, while CSSM and WAVES work better in low SNR. Incoherent methods like IMUSIC works best at high SNR.
A readiness assessment framework for e-government planning: design and application
Authors: Mohamed Shareef, Adegboyega Ojo, Tomasz Janowski
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

The availability of information on electronic government readiness is a critical factor in developing effective e-government policies and strategies. Although there are many readiness assessment instruments in the public domain, there are no clear guidelines on how these instruments can be reused as frameworks in carrying out assessment in specific contexts, such as in e-government planning or implementation. The design of readiness assessment frameworks requires clear specification of the assessment purpose and the design of concrete instruments explicitly based on the information requirements. Usually, these information needs are modular and can be satisfied by any instrument composed from the required set of assessment components. In this paper, we examine the requirements for a readiness assessment framework to support e-government planning and propose an assessment framework consisting of a set of assessment perspectives. Each of these perspectives is mapped to a corresponding set of concrete assessment components (partly derived from other major e-government assessment frameworks) satisfying the information requirements of these perspectives. The componentized framework allows for easy substitution or specialization of specific components to suit different contexts or assessment scenarios. As an example, we show how this framework can be used for developing a readiness assessment instrument to support e-government planning in Maldives.
Implementation of rich metadata formats and semantic tools using DSpace
Authors: Imma Subirats, Areti Ramachandra Durga Prasad, Johannes Keizer, Andrew Bagdanov
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

This poster explores the customization of DSpace to allow the use of the AGRIS Application Profile metadata standard and the AGROVOC thesaurus. The objective is the adaptation of DSpace, through the least invasive code changes either in the form of plug-ins or add-ons, to the specific needs of the Agricultural Sciences and Technology community. Metadata standards such as AGRIS AP, and Knowledge Organization Systems such as the AGROVOC thesaurus, provide mechanisms for sharing information in a standardized manner by recommending the use of common semantics and interoperable syntax (Subirats et al., 2007).
Tool-supported requirements prioritization: Comparing the AHP and CBRank methods
Authors: Anna Perini, Filippo Ricca, Angelo Susi
Venue: Information and Software Technology (2009)

Requirements prioritization aims at identifying the most important requirements for a software system, a crucial step when planning for system releases and deciding which requirements to implement in each release. Several prioritization methods and supporting tools have been proposed so far. How to evaluate their properties, with the aim of supporting the selection of the most appropriate method for a specific project, is considered a relevant question. In this paper, we present an empirical study aiming at evaluating two state-of-the art tool-supported requirements prioritization methods, AHP and CBRank. We focus on three measures: the ease of use, the time-consumption and the accuracy. The experiment has been conducted with 23 experienced subjects on a set of 20 requirements from a real project. Results indicate that for the first two characteristics CBRank overcomes AHP, while for the accuracy AHP performs better than CBRank, even if the resulting ranks from the two methods are very similar. The majority of the users found CBRank the ''overall best'' method.
Regionalized Text-to-Speech Systems: Persona Design and Application Scenarios
Authors: Michael Pucher, Gudrun Schuchmann, Peter Fröhlich
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

This paper presents results on the selection of application scenarios and persona design for sociolect and dialect speech synthesis. These results are derived from a listening experiment and a user study. Most speech synthesis applications focus on major languages that are spoken by many people. We think that the localization of speech synthesis applications by using sociolects and dialects can be beneficial for the user since these language variants entail specific personas and background knowledge.
Small-footprint, waveform-resolving lidar estimation of submerged and sub-canopy topography in coastal environments
Authors: A. Nayegandhi, J. C. Brock, C. W. Wright
Venue: International Journal of Remote Sensing (2009)

The experimental advanced airborne research lidar (EAARL) is an airborne lidar instrument designed to map near-shore submerged topography and adjacent land elevations simultaneously. This study evaluated data acquired by the EAARL system in February 2003 and March 2004 along the margins of Tampa Bay, Florida, USA, to map bare-earth elevations under a variety of vegetation types and submerged topography in shallow, turbid water conditions. A spatial filtering algorithm, known as the iterative random consensus filter (IRCF), was used to extract ground elevations from a point cloud of processed last-surface EAARL returns. Filtered data were compared with acoustic and field measurements acquired in shallow submerged (0-2.5 m water depth) and sub-canopy environments. Root mean square elevation errors (RMSEs) ranged from 10-14 cm for submerged topography to 16-20 cm for sub-canopy topography under a variety of vegetation communities. The effect of lidar sampling angles and global positioning system (GPS) satellite configuration on accuracy was investigated. Results show high RMSEs for data acquired during periods of poor satellite configuration and at large sampling angles along the edges of the lidar scan. The results presented in this study confirm the cross-environment capability of a green-wavelength, waveform-resolving lidar system, making it an ideal tool for mapping coastal environments.