ppxscal/embedding_network huggingface dataset:
On a class of spline-collocation methods for solving second-order initial-value problems
Authors: S. M. Mahmoud, M. Sh. Osman
Venue: International Journal of Computer Mathematics (2009)

We propose global collocation methods for second-order initial-value problems y''=f(x, y) and y''=f(x, y, y'). The present methods are based on quintic C2-splines S(x) with three collocation points [image omitted] , j=1,..., 3 in each subinterval [xi-1, xi], i=1,..., N. It is shown that the method (c1=(5-√5)/10, c2=(5+√ 5)/10) has a convergence of order six, while in the remaining cases (c1, c2∈(0, 1), with c1≠c2) the order is five. The absolute stability properties appear that for all c1, c2∈[0.8028, 1) with c1≠c2, the methods are A-stable independent of the particular choice of the collocation points, while the sixth-order method has a large region of absolute stability. Moreover, the sixth-order method has a phase-lag of order six with actual phase-lag (3/25(8!))v6, and it possesses (0, 37.5)∪(60, 122.178) as the interval of periodicity and absolute stability. The superiority of the obtained methods is demonstrated by considering periodic stiff problems of practical interest.
Networking for English Majors
Authors: Paul Pomerleau
Venue:  (2008)

What can you do with your college education?You can become a well-paid computer networking professional.Your major in the liberal arts or social sciences has prepared you for much more than you might imagine. You don't need to struggle to make a living as a writer or a proofreader. You don't have to be a high school teacher, if that's not what you want to do.A degree in English, linguistics, psychology, history, political science or any other social science or liberal art enables you to think and learn faster than the graduates of most technical degree programs. The truth is that you can out-perform most computer science majors soon after taking a job in computer networking.Networking for English Majors teaches you what you need to know to get your first job and then to move ahead in a career that pays well.
A Virtual Reality-Based Framework for Experiments on Perception of Manual Gestures
Authors: Sebastian Ullrich, Jakob T. Valvoda, Marc Wolter, Gisela Fehrmann, Isa Werth, Ludwig Jaeger, Torsten Kuhlen
Venue: Gesture-Based Human-Computer Interaction and Simulation: 7th International Gesture Workshop, GW 2007, Lisbon, Portugal, May 23-25, 2007, Revised Selected Papers (2009)

This work contributes an integrated and flexible approach to sign language processing in virtual environments that allows for interactive experimental evaluations with high ecological validity. Initial steps deal with real-time tracking and processing of manual gestures. Motion data is stereoscopically rendered in immersive virtual environments with varying spatial and representational configurations. Besides flexibility, the most important aspect is the seamless integration within a VR-based neuropsychological experiment software. Ongoing studies facilitated with this system contribute to the understanding of the cognition of sign language. The system is beneficial for experimenters because of the controlled and immersive three-dimensional environment enabling experiments with visual depth perception that can not be achieved with video presentations.
The antialiased textural analysis of aeromagnetic data
Authors: G. R. J. Cooper
Venue: Computers Geosciences (2009)

Textural analysis is a powerful tool that can be used to enhance subtle detail in raster datasets. It is often used as an input to data classification methods to improve the accuracy of the result. This paper suggests the application of unweighted area sampling to the calculation of texture using grey-level co-occurrence matrices because it gave much improved results compared to the standard method, particularly when global classes are used. Source code in Matlab format can be downloaded from the IAMG server at www.iamg.org/CGEditor/index.htm.
Packet-Level FEC Research Over Wireless Networks
Authors: Lin Liu, Yunyi Zhang, Xiaoshe Dong
Venue: International Journal of Distributed Sensor Networks (2009)

Over wireless networks, interference caused by external sources, multipath fading due to terrestrial obstruction, and the mobility of transmitters or receivers will result in bursty errors of transmitted packets. To deal with the problem, a packet-level XOR-FEC (forward error control), which improves an FEC scheme what Nachum Shacham and Paul McKenney proposed in an IEEE conference paper in 1990 named Packet recovery in high-speed networks using coding and buffer management, is proposed. The improved scheme, under certain conditions, can recover packets of both corruption and erasure. Because its main operation only involves the use of exclusive-or (XOR), it is low complexity. The scheme has been simulated and can be implemented with software. Simulation experiment results show that the improved scheme could decrease the number of redundant packets, so that the amount of computing to encode and decode can be saved and under certain conditions the XOR-FEC scheme could decrease the PER (packet error rate) without increasing the redundant rate. From the scheme that Nachum Shacham and Paul McKenney proposed, it can be seen that: The scheme does not provide a method to check errors in a packet, so only lost packets can be recovered but corrupted packets can not be corrected. Using both row and column parity packets increases the number of redundant packets. While receivers gain packets and correct errors in every batch of packets, there is much delay among batches. To improve the scheme of Nachum Shacham and Paul McKenney: Using checksum field in every packet to distinguish damaged packets. Only add to each column of the array of data packets a parity packet. To recover packets in multimedia data transport, a double-window scheme is proposed to decrease the delay among batches of packets and to smooth the jitter among packets in receivers. Experiments show that by adjusting sending windows, under almost the same PER and redundant rate, improved scheme could recover more packets than a packet-level software FEC scheme based on the Reed-Solomon code. Besides, in an experiment, using the improved XOR-FEC, the packet error rate was reduced from about 5.7% to 0.7% and only around 33.3% of redundant packets were injected.
Validation of compact models of microcantilever actuators for RF-MEMS design
Authors: Eugenio Brusa, Mircea Gh. Munteanu
Venue: Analog Integrated Circuits and Signal Processing (2009)

Electromechanical behavior of microcantilever specimens for in-plane and out-of-plane bending tests, currently designed by industry for Radio-Frequency application, are here analyzed. Main features of these two layouts are discussed. In particular, a comprehensive experimental validation of 2D and 3D numerical models implemented to predict the coupled electromechanical behavior of these microsystems is performed. Effectiveness of plane models to predict pull-in, in presence of geometric non-linearity, due to large tip displacement and initial curvature of microbeam, is investigated. Three dimensional models are then used to investigate the local effects of the electric field and the limits of the two dimensional approach. In addition, this paper investigates the effectiveness of 2D models to be used as compact numerical tools in substitution of some known Model Order Reduction techniques, which unfortunately are unsuitable to predict simultaneously the effects of both the electromechanical and geometric non-linearities.
How Public Opinion Forms
Authors: Fang Wu, Bernardo A. Huberman
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

No aspect of the massive participation in content creation that the web enables is more evident than in the countless number of opinions, news and product reviews that are constantly posted on the Internet. Given their importance we have analyzed their temporal evolution in a number of scenarios. We have found that while ignorance of previous views leads to a uniform sampling of the range of opinions among a community, exposure of previous opinions to potential reviewers induces a trend following process which leads to the expression of increasingly extreme views. Moreover, when the expression of an opinion is costly and previous views are known, a selection bias softens the extreme views, as people exhibit a tendency to speak out differently from previous opinions. These findings are not only robust but also suggest simple procedures to extract given types of opinions from the population at large.
Web services: current solutions and open problems
Authors: Florije Ismaili, Bogdan Sisediev
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

The term "service-oriented" has been used in different contexts and for different purposes. If we take a look to the cosmopolitan cities, they are already full of service-oriented businesses. Individual companies are service-oriented in that each provides a distinct service that can be used by multiple consumers. Collectively, these businesses comprise a business community. Web services have received much interest due to their potential in facilitating seamless business-to-business or enterprise application integration. They allow interoperability between software components by providing standards based mechanisms for description, discovery and messaging/integration. Web services are self-contained, Internet-enabled applications which are capable to perform business activities on their on, but also can engage other Web Services in order to complete higher order business transactions. The act of building applications as a sets of services is enabled by Service Oriented Architecture-SOA. In this paper we suggest a new XML&Web Services Framework in order to address the major challenges in the field of SOA and Web Services.
Architecture and protocols for a Mobile Broadband System
Authors: Paolo Conforto, Francesco Delli Priscoli, Vincenzo Marziale
Venue: Space Communications (1999)

This paper, is mainly based on work performed in the framework of the European Union Advanced Communications, Technology and Services (EU-ACTS) ACCORD project. This project, by collecting the main results carried out from four other different ACTS projects (SECOMS, EXODUS, MEDIAN and SAMBA), aims at the validation, from both a theoretical and an experimental viewpoint, of a truly global Mobile Broadband System (MBS) consisting of multiple (satellite/terrestrial) System components with different complementary characteristics. One of the key aspects is the design of a mobile Multi Mode Terminal (ACCORD MMT), which allows mobile users to access the same ATM-based Core Network through four different Access Systems, each one designed and optimised to operate in a specific environment (satellite, Digital European Cordless Telecommunications (DECT), indoor Wireless Local Area Network(W-LAN), urban digital cellular). This paper describes the ACCORD System way of working and the Mobility Management procedures.
Computing the fault tolerance of multi-agent deployment
Authors: Yingqian Zhang, Efrat Manisterski, Sarit Kraus, V. S. Subrahmanian, David Peleg
Venue: Artificial Intelligence (2009)

A deployment of a multi-agent system on a network refers to the placement of one or more copies of each agent on network hosts, in such a manner that the memory constraints of each node are satisfied. Finding the deployment that is most likely to tolerate faults (i.e. have at least one copy of each agent functioning and in communication with other agents) is a challenge. In this paper, we address the problem of finding the probability of survival of a deployment (i.e. the probability that a deployment will tolerate faults), under the assumption that node failures are independent. We show that the problem of computing the survival probability of a deployment is at least NP-hard. Moreover, it is hard to approximate. We produce two algorithms to accurately compute the probability of survival of a deployment-these algorithms are expectedly exponential. We also produce five heuristic algorithms to estimate survival probabilities-these algorithms work in acceptable time frames. We report on a detailed set of experiments to determine the conditions under which some of these algorithms perform better than the others.
Approximating dynamic global illumination in image space
Authors: Tobias Ritschel, Thorsten Grosch, Hans-Peter Seidel
Venue: Proceedings of the 2009 symposium on Interactive 3D graphics and games (2009)

Physically plausible illumination at real-time framerates is often achieved using approximations. One popular example is ambient occlusion (AO), for which very simple and efficient implementations are used extensively in production. Recent methods approximate AO between nearby geometry in screen space (SSAO). The key observation described in this paper is, that screen-space occlusion methods can be used to compute many more types of effects than just occlusion, such as directional shadows and indirect color bleeding. The proposed generalization has only a small overhead compared to classic SSAO, approximates direct and one-bounce light transport in screen space, can be combined with other methods that simulate transport for macro structures and is visually equivalent to SSAO in the worst case without introducing new artifacts. Since our method works in screen space, it does not depend on the geometric complexity. Plausible directional occlusion and indirect lighting effects can be displayed for large and fully dynamic scenes at real-time frame rates.
On the independent spanning trees of recursive circulant graphs G(cdm,d) with d>2
Authors: Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang
Venue: Theoretical Computer Science (2009)

Two spanning trees of a graph G are said to be independent if they are rooted at the same vertex r, and for each vertex v=2, m>=1, and 1=2, where the number of independent spanning trees matches the connectivity of G(cd^m,d).
Incorporating global positioning data in real time P2P audio/video streams for mobile devices
Authors: José-Vicente Aguirre, Rafael Álvarez, Leandro Tortosa, José-Francisco Vicent
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

We propose an original method to geoposition an audio/video stream with multiple emitters that are at the same time receivers of the mixed signal. The achieved method is suitable for those comes where a list of positions within a designated area is encoded with a degree of precision adjusted to the visualization capabilities; and is also easily extensible to support new requirements. This method extends a previously proposed protocol, without incurring in any performance penalty.
Letters: Mean square exponential stability of stochastic fuzzy Hopfield neural networks with discrete and distributed time-varying delays
Authors: Hongyi Li, Bing Chen, Chong Lin, Qi Zhou
Venue: Neurocomputing (2009)

It is well known that a complex nonlinear system can be represented as a Takagi-Sugeno (T-S) fuzzy model that consists of a set of linear sub-models. This paper is concerned with the problem of mean square exponential stability for a class of stochastic fuzzy Hopfield neural networks with discrete and distributed time-varying delays. By using the stochastic analysis approach and Ito@^ differential formula, delay-dependent conditions ensuring the stability of the considered neural networks are obtained. The conditions are expressed in terms of linear matrix inequalities (LMIs) and can be easily checked by standard software. A numerical example is given to illustrate the effectiveness of the proposed method.
The O-Sequence: Representation of 3D-Dissection
Authors: Hidenori Ohta, Toshinori Yamada, Chikaaki Kodama, Kunihiro Fujiyoshi
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

A 3D-dissection (A rectangular solid dissection) is a dissection of a rectangular solid into smaller rectangular solids by planes. In this paper, we propose an O-sequence, a string of representing any 3D-dissection which is dissected by only non-crossing rectangular planes. We also present a necessary and sufficient condition for a given string to be an O-sequence.
gBoost: a mathematical programming approach to graph classification and regression
Authors: Hiroto Saigo, Sebastian Nowozin, Tadashi Kadowaki, Taku Kudo, Koji Tsuda
Venue: Machine Learning (2009)

Graph mining methods enumerate frequently appearing subgraph patterns, which can be used as features for subsequent classification or regression. However, frequent patterns are not necessarily informative for the given learning problem. We propose a mathematical programming boosting method (gBoost) that progressively collects informative patterns. Compared to AdaBoost, gBoost can build the prediction rule with fewer iterations. To apply the boosting method to graph data, a branch-and-bound pattern search algorithm is developed based on the DFS code tree. The constructed search space is reused in later iterations to minimize the computation time. Our method can learn more efficiently than the simpler method based on frequent substructure mining, because the output labels are used as an extra information source for pruning the search space. Furthermore, by engineering the mathematical program, a wide range of machine learning problems can be solved without modifying the pattern search algorithm.
Replicator Dynamics in the Iterative Process for Accurate Range Image Matching
Authors: Yonghuai Liu
Venue: International Journal of Computer Vision (2009)

Iterative algorithms are often used for range image matching. In this paper, we treat the iterative process of range image matching as a live biological system: evolving from one generation to another. Whilst different generations of the population are regarded as range images captured at different viewpoints, the iterative process is simulated using time. The well-known replicator equations in theoretical biology are then adapted to estimate the probabilities of possible correspondences established using the traditional closest point criterion. To reduce the effect of image resolutions on the final results for efficient and robust overlapping range image matching, the relative fitness difference (rather than the absolute fitness difference) is employed in the replicator equations in order to model the probability change of possible correspondences being real over successive iterations. The fitness of a possible correspondence is defined as the negative of a power of its squared Euclidean distance. While the replicator dynamics penalize those individuals with low fitness, they are further penalised with a parameter, since distant points are often unlikely to represent their real replicators. While the replicator equations assume that all individuals are equally likely to meet each other and thus treat them equally, we penalise those individuals competing for the same points as their possible replicators. The estimated probabilities of possible correspondences being real are finally embedded into the powerful deterministic annealing scheme for global optimization, resulting in the camera motion parameters being estimated in the weighted least squares sense. A comparative study based on real range images with partial overlap has shown that the proposed algorithm is promising for automatic matching of overlapping range images.
On efficient Monte Carlo-based statistical static timing analysis of digital circuits
Authors: Javid Jaffari, Mohab Anis
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

The Monte-Carlo (MC) technique is a well-known solution for statistical analysis. In contrast to probabilistic (non-Monte Carlo) Statistical Static Timing Analysis (SSTA) techniques, which are typically derived from simple statistical or timing models, the MC-based SSTA technique encompasses complicated timing and process variation models. However, a precise analysis that involves a traditional MC-based technique requires many timing simulation runs (1000s). In this paper, the behavior of the critical delay of digital circuits is investigated by using a Legendre polynomial-based ANOVA decomposition. The analysis verifies that the variance of the critical delay is mainly due to the pairwise interactions among the Principal Components (PCs) of the process parameters. Based on this fact, recent progress on the MC-based SSTA, through Latin Hypercube Sampling (LHS), is also studied. It is shown that this technique is prone to inefficient critical delay variance and quantile estimating. Inspired by the decomposition observations, an efficient algorithm is proposed which produces optimally low L2-discrepancy Quasi-MC (QMC) samples which significantly improve the precision of critical delay statistical estimations, compared with that of the MC, LHS, and traditional QMC techniques.
Modeling with Data: Tools and Techniques for Scientific Computing
Authors: Ben Klemens
Venue:  (2008)

Modeling with Data fully explains how to execute computationally intensive analyses on very large data sets, showing readers how to determine the best methods for solving a variety of different problems, how to create and debug statistical models, and how to run an analysis and evaluate the results. Ben Klemens introduces a set of open and unlimited tools, and uses them to demonstrate data management, analysis, and simulation techniques essential for dealing with large data sets and computationally intensive procedures. He then demonstrates how to easily apply these tools to the many threads of statistical technique, including classical, Bayesian, maximum likelihood, and Monte Carlo methods. Klemens's accessible survey describes these models in a unified and nontraditional manner, providing alternative ways of looking at statistical concepts that often befuddle students. The book includes nearly one hundred sample programs of all kinds. Links to these programs will be available on this page at a later date. Modeling with Data will interest anyone looking for a comprehensive guide to these powerful statistical tools, including researchers and graduate students in the social sciences, biology, engineering, economics, and applied mathematics.
Gene Expression Programming Neural Network for Regression and Classification
Authors: Weihong Wang, Qu Li, Xing Qi
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

Gene Expression Programming(GEP) is a kind of heuristic method based on evolutionary computation theory. Basic GEP method has been proved to be powerful in symbolic regression and data mining tasks. However, GEP's potential for neural network learning has not been well studied. In this paper, we prove that basic GEP neural network(GEPNN) is unable to solve difficult regression and classification problems. Based on our proof, we propose an extended method for evolving neural network with GEP. The extended GEPNN is used in function finding and classification problems. Results on multiple learning methods show the effectiveness of our method.
An adaptable FSA simulator
Authors: Stoyan Bonev
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

The paper describes the author's experience in building applications that simulate the behaviour of finite state machine or finite state automata /FSM, FSA/ as recognizers of strings that belong to automata languages or languages defined with regular expressions or languages defined with linear grammars. The solution of two tasks is being discussed: First, the external and internal representation of the FSA transition function. Second, the implementation of an algorithm to simulate FSA behaviour. The principle to fill the transition table at run time after reading data for internal states, valid input characters and transition function produces a flexible universal table-driven adaptable FSA simulator. The program illustrates the lectures given in the COS401 Compiler Theory course at the American University in Bulgaria.