ppxscal/embedding_network huggingface dataset:
Stability of IMEX Runge-Kutta methods for delay differential equations
Authors: Toshiyuki Koto
Venue: Journal of Computational and Applied Mathematics (2008)

Stability of IMEX (implicit-explicit) Runge-Kutta methods applied to delay differential equations (DDEs) is studied on the basis of the scalar test equation du/dt=@lu(t)+@mu(t-@t), where @t is a constant delay and @l,@m are complex parameters. More specifically, P-stability regions of the methods are defined and analyzed in the same way as in the case of the standard Runge-Kutta methods. A new IMEX method which possesses a superior stability property for DDEs is proposed. Some numerical examples which confirm the results of our analysis are presented.
Sub-pixel Mapping of Remote Sensing Image Based on MAP model
Authors: Ke Wu, Pingxiang Li, Liangpei Zhang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Mixed pixel is a common problem in Remotely Sensed classification. Even though the composition of these pixels for different classes can be estimated with pixel un-mixing model, the output provides no indication of how such classes are distributed spatially within these pixels. Sub-pixel mapping is a technique designed to obtain the spatial distribution of these classes in these pixels with information contained in mixed pixels. In this paper, the work introduces a subpixel mapping algorithm exploiting spatial dependence. The spatial arrangement of the different class fractions in surrounding pixels is used to find the location of the sub-pixels inside the central pixel. The sub-pixel mapping algorithm is intended to be applied to fraction images of a high spatial resolution, a regularized super-resolution image reconstruction method can be proposed to solve the problem called the Maximum A Posteriori (MAP) formulation, which based on the assumption of spatial dependence and the application of the soft classification result. With the upscale factor the proposed algorithm was tested on both artificial text image and real TM image, the result shows that it is a simple and efficient method to solve the sub-pixel mapping problem!
An alternative model for integrated vendor-buyer inventory under controllable lead time and its heuristic solution
Authors: M. A. Hoque
Venue: International Journal of Systems Science (2007)

Researchers have given a lot of attention to the integrated vendor-buyer problem. Both deterministic and stochastic models on the subject are available in the literature. Most of the models have appeared with the need and requirement of a Just-in-Time (JIT) system environment. The close tie between a vendor and a buyer helps to deliver products in a shorter lead time with reduced inventory cost. Based on this idea, recently, some researchers have presented such a stochastic model with equal sized batch (part of a lot) transfer under controllable lead time. They have shown that their model provides a lower total cost for a numerical problem. To enrich the JIT system literature, considering transportation cost of a batch, this article develops an alternative model of the problem with equal or unequal sized batches transfer under controllable lead time. Then it develops a heuristic solution technique of the model and applying it solves the same numerical example to show a reasonable cost reduction.
Solving Computation Slicing Using Predicate Detection
Authors: Neeraj Mittal, Alper Sen, Vijay K. Garg
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Given a distributed computation and a global predicate, predicate detection involves determining whether there exists at least one consistent cut (or global state) of the computation that satisfies the predicate. On the other hand, computation slicing is concerned with computing the smallest subcomputation--with the least number of consistent cuts--that contains all consistent cuts of the computation satisfying the predicate. In this paper, we investigate the relationship between predicate detection and computation slicing and show that the two problems are equivalent. Specifically, given an algorithm to detect a predicate b in a computation C, we derive an algorithm to compute the slice of C with respect to b. The time-complexity of the (derived) slicing algorithm is O(n|E|T), where n is the number of processes and E is the set of events, and O(T) is the time-complexity of the detection algorithm. We discuss how the "equivalence" result of this paper can be utilized to derive a faster algorithm for solving the general predicate detection problem in many cases.Slicing algorithms described in our earlier papers are all off-line in nature. In this paper, we also present two on-line algorithms for computing the slice. The first algorithm can be used to compute the slice for a general predicate. Its amortized time-complexity is O(n(c + n)T), where c is the average concurrency in the computation and O(T) is the time-complexity of the detection algorithm. The second algorithm can be used to compute the slice for a regular predicate. Its amortized time-complexity is only O(n^2).
Semantic and Context-based Information Management in SCUDWare Middleware for Ubiquitous Computing
Authors: Qing Wu, Jianhua Yang, Ying Li
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

As ubiquitous computing pursues naturalness and harmony, the need for context-ware ability in software middleware is growing to respond to highly dynamic computing environments. In order to facilitate the realization of such ability, the middleware infrastructure is required to acquisition, representation, fusion, and inference context information correctly and reliably. This paper is concerned with semantic and context-based information management in SCUDWare middleware for smart vehicle space. We emphasize on the "semantic" aspect of context information, by using semantic web technology and web ontology language to build the ontology of the context in this space. In addition, we propose an application scenario and a prototype system. The contribution is twofold. First, we present a semantic and context-based information model to develop a semantic and context management service in SCUDWare middleware. Second, we have built an ontology of the smart vehicle space, with which we make context fusion and inference for middleware adaptation.
Spring-Bead Animation of Viscoelastic Materials
Authors: Nobuhiko Tamura, Toshiya Nakaguchi, Norimichi Tsumura, Yoichi Miyake
Venue: IEEE Computer Graphics and Applications (2007)

An interactive animation method for viscoelastic materials builds on Rouse's spring-bead model. Particles are connected one dimensionally by spring forces to represent single polymer chains. The method approximates the collision's force between particles through the particle density's gradient. This model lets the viscoelasticity be changed dynamically by severing the interconnection of polymer chains.
Multiple pheromone deposition in ant-based clustering as an ant foraging concept
Authors: Warangkhana Ngenkaew, Satoshi Ono, Shigeru Nakayama
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

This paper focuses on Ant-Based Clustering algorithm from an ant foraging model's view, and proposes a method of using two kinds of deposited pheromones at each grid, Trailing Pheromone and Foraging Pheromone. The experimental results show that the use of two kinds of pheromones improves foraging time efficiency for ants compared with the basic algorithm without any pheromone and with only Trailing Pheromone.
The study of the relationship between the prediction error and AGO times in GM(1,1) model
Authors: Liu-Hsiang Hsu
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

The aim of this paper is by using the numerical method to design and to develop a toolbox, by which to analyze the relationship between the prediction error and AGO times in GM(1,1) model. Traditionally, the error analyses are all focused on the background value alpha, and most of GM(1,1) papers have only used AGO once. Although this method can decrease the value of error, we still feel that there are some insufficient exist. Hence, in this paper, we focus on the AGO times, and develop the toolbox, by which the Matlab and LabVIEW software platform can analyze the relationship between the AGO times and the prediction error. As the result, we can implement that the AGO times for GM(1,1) model are enough to be lower to once, and the prediction errors will be increased when AGO times are increasing as well.
Plugging a Space Leak with an Arrow
Authors: Hai Liu, Paul Hudak
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

The implementation of conceptually continuous signals in functional reactive programming (FRP) is studied in detail. We show that recursive signals in standard implementations using streams and continuations lead to potentially serious time and space leaks under conventional call-by-need evaluation. However, by moving to the level of signal functions, and structuring the design around arrows, this class of time and space leaks can be avoided. We further show that the use of optimal reduction can also avoid the problem, at the expense of a much more complex evaluator.
A syncro-parallel nonsmooth PGD algorithm for nonsmooth optimization
Authors: Shan Feng, Pang Li-Ping
Venue: Journal of Applied Mathematics and Computing (2007)

A nonsmooth PGD scheme for minimizing a nonsmooth convex function is presented. In the parallelization step of the algorithm, a method due to Pang, Han and Pangaraj (1991), [7], is employed to solve a subproblem for constructing search directions. The convergence analysis is given as well.
A Family of Mil-Spec Computers
Authors: L. Walsh
Venue: Computer (1977)

Rapid advances in the semiconductor industry have prompted the increased use of computer technology to produce better and "smarter" military systems. Rugged computer hardware, able to pass mil-spec testing, is needed and used to solve problems in a wide range of application areas including space exploration, research in severe environments, military communications systems, navigation systems, and weapons guidance systems.
Microprocessor Architecture
Authors: F. W. Clegg
Venue: Computer (1977)

This marks the second issue of Computer devoted to the Asilomar Workshop on Microprocessors. As with the first such issue (January 1976), no attempt has been made to cover the workshop in toto (a summary report appeared in the July 1976 Computer). Rather, the goal has been to spotlight a few of the more interesting developments and philosophies that were explored during the April 1976 workshop. 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
A time-domain fingerprint for BOC(m, n) signals
Authors: B. Muth, P. Oonincx, C. Tiberius
Venue: EURASIP Journal on Advances in Signal Processing (2007)

Binary offset carrier (BOC) describes a class of spread-spectrum modulations recently introduced for the next generation of global navigation satellite systems (GNSSs). The design strategies of these BOC signals have so far focused on the spectral properties of these signals. In this paper, we present a time-domain fingerprint for each BOC signal given by a unique histogram of counted time elapses between phase jumps in the signal. This feature can be used for classification and identification of BOC-modulated signals with unknown parameters.
Gene selection by sequential search wrapper approaches in microarray cancer class prediction
Authors: Iñaki Inza, Basilio Sierra, Rosa Blanco, Pedro Larrañaga
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2002)

In the last years, there has been a large growth in gene expression profiling technologies, which are expected to provide insight into cancer related cellular processes. Machine Learning algorithms, which are extensively applied in many areas of the real world, are not still popular in the Bioinformatics community. We report on the successful application of four well known supervised Machine Learning methods (IB1, Naive-Bayes, C4.5 and CN2) to cancer class prediction problems in three DNA microarray datasets of huge dimensionality (Colon, Leukemia and NCI-60). The essential gene selection process in microarray domains is performed by a sequential search engine, evaluating the goodness of each gene subset by a wrapper approach which executes, by a leave-one-out process, the supervised algorithm to obtain its accuracy estimation. By the use of the gene selection procedure, the accuracy of supervised algorithms is significantly improved and the number of genes of the classification models is notably reduced for all datasets.
Spare capacity provisioning for quasi-static traffic
Authors: Shu Huang, Rudra Dutta
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2007)

Resource provisioning has for long been an important area of research in network design. The traffic grooming problem in optical networks is a design problem of aggregating sub-wavelength traffic demands onto lightpaths and lightpaths onto fiber links such that the required electronic switching capability, hence network cost, can be minimized. Because of the reconfiguration cost in optical grooming networks, a reactive resource provisioning approach may become inefficient, and result in revenue loss. In this paper, we propose an over-provisioning scheme, which pre-allocates the spare capacity of lightpaths to dynamic sub-wavelength traffic demands such that the network can be more agile in responding to traffic increment requests. For the single-link case, we formulate the problem as a non-linear programming problem, and for under reasonable assumptions, we prove the objective function is convex. We provide an exact algorithm to find the optimal solution. The problem with general topologies is then studied. We prove the NP-hardness in this case, and propose heuristics. Numerical results show our heuristics perform well.
A Max-Min Measure for Image Texture Analysis
Authors: O. R. Mitchell
Venue: IEEE Transactions on Computers (1977)

A new technique for image texture analysis is described which uses the relative frequency of local extremes in grey level as the principal measure. This method is invariant to multiplicative gain changes (such as caused by changes in illumination level or film processing) and is invariant to image resolution and sampling rate if the image is not undersampled. The algorithm described is computationally simple and can be implemented in hardware for real-time analysis. Comparisons are made between this new method and the spatial dependence method of texture analysis using 49 samples of each of eight textures. The new method seems just as accurate and considerably faster.
Incorporating Feature Based Priors into the Geodesic Active Contour Model and its Application in Biomedical Imagery
Authors: Huaizhong Zhang, Philip Morrow, Sally McClean, Kurt Saetzler
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

This paper presents improvements to the geodesic active contour (GAC) model obtained by incorporating user defined prior information into the model itself. Specifically, the stopping function in the GAC model is revised by designing an indicator function derived from a-priori information. The numerical implementation is based on the level set technique. Experimental results illustrate that our approach is efficient and feasible for both artificial and real images. In particular, the proposed method performs well in situations where existing methods are known to fail.
Technology in finnish special education: toward inclusion and harmonized school days
Authors: Eija Kärn|ä-Lin, Kaisa Pihlainen-Bednarik, Erkki Sutinen, Marjo Virnes
Venue: Informatics in education (2007)

The increasing number of children who need special education in Finland also requires an increasing amount of resources from teachers and a restructuring of the education system. Technology can be a part of the solution to this resource problem; however, for the technological solution to work, technologies need to be designed and implemented in new ways. Technologies used in special education in Finland can roughly be divided into four main categories; assistive technologies, communication technologies, and learning software. Last and the newest category concretizing technologies, such as educational robotics, have successfully been used in the Technologies for Children with Individual Needs Project. Possibilities provided by educational robotics have been extensive, not only because of the technology itself, but also because of how the technology has been implemented in innovative projects with school students. From this point of view, students with individual educational needs as well as those involved in inclusive education and harmonized school days could benefit from the use of technology.
Srtre Computer Processing of Ambulatory Electrocardiograms
Authors: J. W. Fitzgerald
Venue: Computer (1975)

The ability to record ambulatory electrocardiograms, as initially developed by Holter,1 was an important step in medical technology. Until now, however, the usefulness of this procedure has been hampered by the difficulty in evaluating the recordings themselves.2 Not only is the qualitative evaluation directly related to the skill of the individual handling the processing, but quantitative evaluation is essentially impossible. As a result, techniques that maximize the information obtained from ambulatory electrocardiograms3 have become increasingly important-particularly in evaluating the role of arrhythmias in sudden death, the independent prognostic value of arrhythmias in the post-infarction period, and the response of arrhythmias to drugs.
An Artificial Immune Network Approach for Pattern Recognition
Authors: Jiuying Deng, Yongsheng Jiang, Zongyuan Mao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

The discrete models and learning algorithms of artificial immune network are adopted. The mechanism of artificial immune system is combine with the framework of artificial neural network. The method of RBF neural network should be improved for fitting to any complicated system. An algorithm of artificial immune network for pattern recognition is introduced. The parameter-tuned problems are mainly explored about the basis functions; and a formulation is induced. The precision of pattern identifying is greatly improved. When a typical function is used as the simulation object, the experiment results illustrate this algorithm with high accuracy and convergence speed.
A model for parameter setting based on Bayesian networks
Authors: Reyes Pavón, Fernando Díaz, Victoria Luzón
Venue: Engineering Applications of Artificial Intelligence (2008)

One of the difficulties that the user faces when using a model to solve a problem is that, before running the model, a set of parameter values have to be specified. Deciding on an appropriate set of parameter values is not an easy task. Over the years, several standard optimization methods, as well as various alternative approaches according to the problem at hand, have been proposed for parameter setting. These techniques have their merits and demerits, but usually they have a fairly restricted application range, including a lack of generality or the need of user supervision. This paper proposes a meta-model that generates the recommendations about the best parameter values for the model of interest. Its main characteristic is that it is an automatic meta-model that can be applied to any model. For evaluation purposes and in order to be able to compare our results with results obtained by others, a real geometric problem was selected. The experiments show the validity of the proposed adjustment model.
Comparing Wired-side and Wireless-side WLAN Monitoring Techniques: A Case Study
Authors: Aniket Mahanti, Carey Williamson, Martin Arlitt, Anirban Mahanti
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Wireless Local Area Networks (WLANs) have become omnipresent: WLANs are available at airports, coffee shops, university campuses, corporate environments, and homes. This surge in the popularity of WLANs motivates the study of how these networks are used. Characterizing WLANs, however, is complicated by a number of factors including the geographic diversity of WLAN deployments and the need for capturing activity in the wireless environment instead of the wired environment. In this paper, we describe our experiences with the deployment and use of a remote passive wireless-side measurement infrastructure for monitoring usage of WLANs, and compare our results with a commonly used wired-side measurement technique.
R68-14 Microprogrammed Control in Problem-Oriented Languages
Authors: F. G. Curl
Venue: IEEE Transactions on Computers (1968)

Hawryszkiewycz describes a dual-mode problem-oriented simulation language. He utilizes the microprogram capability of the CIRRUS computer to simulate the function of certain analog components in the solution of differential equations. These equations are presented to the analyst in block-diagram form. 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
Computing the Availability and MTTF of Shared Protection Systems
Authors: Hirokazu Ozaki, Atsushi Kara
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

In this paper we investigate the reliability of shared protection systems such as one for N (1:N) that can be applied to access network node devices. We describe the effectiveness of such a protection system in a quantitative manner. The mathematical analysis gives closed form solutions of the availability and MTTF (Mean Time to Failure) perceived by an arbitrary end user. We also describe the effectiveness of priority switching control in shared protection systems. These analyses provide some useful information for the design and control of not only the access network node devices but also other general shared protection systems that are subject to service level agreements (SLA) involving reliability measures.
A Run-Time Scheduling Framework for a Reconfigurable Hardware Emulator
Authors: R. Beckert, T. Fuchs, St. Ruelke, W. Hardt
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Dynamic run-time scheduling of design modules in partial reconfigurable (pRTR) platforms have recently become an active area. The pRTR integration in System-on- Chips depends on the efficiency of the technique for scheduling the modules. In this paper, an event based dynamic scheduling technique for hardware emulation is proposed. In consideration of given functional modules (e.g. controller, signal processing parts, memory) of a Design-under-Test (DuT), the emulator is directly scheduled by the run-time behavior of the modules. The events for controlling and reconfiguring the emulator depend on the communication activity of the functional modules itself. A HW/SW based generic emulator environment implemented on a state-of-the-art FPGA platform controls the reconfiguration sequence. The benefits are a decreasing number of run-time reconfigurations and an improved utilization of the FPGA resources of the emulator.