ppxscal/embedding_network huggingface dataset:
A nonredundant set for the bispectrum of 2-D signals
Authors: A. T. Erdem
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The author presents a nonredundant set for the bispectrum of 2-D discrete signals, based on the 12-fold symmetry property of the bispectrum. A nonredundant set for the bispectrum contains the minimum number of points such that the samples of the bispectrum at these points completely determine the bispectrum everywhere. The proposed nonredundant set provides considerable savings in computer time and memory space since by using the nonredundant set, it is necessary to compute and store each distinct bispectrum sample of a 2-D signal only once.
Application of class Im variable transformations to numerical integration over surfaces of spheres
Authors: Avram Sidi
Venue: Journal of Computational and Applied Mathematics (2005)

Class Im variable transformations with integer m for finite-range integrals were introduced by the author (Numerical Integration IV, International series of Numerical Mathematics, Basel, 1993, pp. 359-373) about a decade ago. These transformations "periodize" the integrand functions in a way that enables the trapezoidal rule to achieve very high accuracy, especially with even m. In a recent work by the author (Math. Comp. (2005)), these transformations were extended to arbitrary m, and their role in improving the convergence of the trapezoidal rule for different classes of integrands was studied in detail. It was shown that, with m chosen appropriately, exceptionally high accuracy can be achieved by the trapezoidal rule. In the present work, we make use of these transformations in the computation of integrals on surfaces of spheres in conjunction with the product trapezoidal rule. We treat integrands that have point singularities of the single-layer and double-layer types. We propose different approaches and provide full analyses of the errors incurred in each. We show that surprisingly high accuracies can be achieved with suitable values of m. We also illustrate the theoretical results with numerical examples. Finally, we also recall analogous procedures developed in another work by the author (Appl. Math. Comput. (2005)) for regular integrands.
ModelingWeb Services Policy with Corporate Knowledge
Authors: Dong Huang, Yi Yang, Jacques Calmet
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Web Services Policy is used to specify service con- straints. Although many efforts like WS-Policy have been done to provide declarative configuration languages, it is still hard to discover and exchange the configuration infor- mation in the service computing environment. A novel ap- proach to share service knowledge and application-specific information is needed. In this paper, we model web ser- vice policy with corporate knowledge, which is defined as the amount of knowledge provided by individual agents. This approach provides a distributed knowledge manage- ment method to our proposed semantic policy framework that enables reasoning, which is necessary for policy cre- ation, conflicts resolution and negotiation.
Mosquito attack optimization
Authors: Samir Kumar Bandyopadhyay, Debnath Bhattacharyya, Poulami Das
Venue: Ubiquity (2006)

Ant Colony Optimization and Swarm Optimization are the classical areas of researches in the field of Computer Science. Computer Scientists are trying to map the Biological and Natural Solution with the Artificial one, since last 2 decades. Finally, Genetic Algorithm (GA), Genetic Programming (GP) and Artificial Neural Network (ANN), ACO[13], etc were derived from the Biological, Genetical and Natural characteristics of the living organisms.We have developed a population based stochastic optimization technique inspired by social behavior of Mosquito (Female). This research will open a new side of 'Particle Swarm Optimization', in future.
Optimality conditons for infinite order hyperbolic differential system
Authors: H. A. El Saify
Venue: Journal of Dynamical and Control Systems (2006)

In this paper, first, we establish the solvability of (n × n)-systems of hyperbolic type with inhomogeneous mixed Neumann conditions involving operator of infinite order. Using theorems of J. L. Lions, quadratic boundary control problem for this system is considered. The necessary and sufficient conditions for the optimality of the control is obtained and the set of inequalities that characterize these conditions is formulated. Finally, by applying the Dubovitskii-Milyutin theorem of W. Kotarski, necessary and sufficient conditions of optimality are derived for the same problem, where the performance index is more general than the quadratic one and has an integral form.
Adaptive power saving mechanisms for DCF in IEEE 802.11
Authors: Shihong Zou, Haitao Wu, Shiduan Cheng
Venue: Mobile Networks and Applications (2005)

Distributed Coordination Function (DCF) is the basis of IEEE 802.11 MAC sublayer. To improve energy efficiency, IEEE 802.11 has specified power saving mechanism (PSM) for DCF. However, the performance of PSM degrades seriously when load is heavy. In this paper we first analyze the reason of performance degradation, and then propose two adaptive mechanisms: PSM+ and fairPSM+. Numerous simulation results have shown that these two mechanisms can achieve high performance with heavy load and still get the same performance as PSM when load is light.
LabGrid: Integrated Problem Solving Environment System for High Throughput Computing
Authors: Young Jun Choi, Takashige Oroguchi, Yoshinori Kato, Makoto Takeda, Yoshio Tago
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

The LabGrid is developed for usage inside university laboratory. The LabGrid is an integrated problem solving environment (PSE) to provide to the users tools of high throughput computing which is carried out using application packages for solving number of scientific and engineering problems. Several grid middleware are implemented on computing resources composed of Windows and Linux personal computer (PC) using a high-level integration technique. The usage of central processing unit of PCs at the laboratory increases remarkably, when high throughput computing is carried out with LabGrid. The university laboratory members need not waste their time for computation, data management, and computing resource connectivity issues. It is expected that LabGrid improves the ability of laboratory member to implement high throughput computing of various scientific and engineering problems by reducing the workload significantly and by making technology transfer to new students easier at every new university term in spring.
Multi-level index for global and partial content-based image retrieval
Authors: Genevieve Jomier, Maude Manouvrier, Vincent Oria, Marta Rukoz
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

This article presents a quadtree-based data structure for effective indexing of images. An image is represented by a multi-level feature vector, computed by a recursive decomposition of the image into four quadrants and stored as a full fixed-depth balanced quadtree. A node of the quadtree stores a feature vector of the corresponding image quadrant. A more general quadtree-based structure called QUIP-tree (QUadtree-based Index for image retrieval and Pattern search) is used to index the multi-level feature vectors of the images and their quadrants. A QUIP-tree node is an entry to a set of clusters that groups similar quadrants according to some pre-defined distances. The QUIP-tree allows a multi-level filtering in content-based image retrieval as well as partial queries on images.
Parametric timing estimation with Newton&ndash;Gregory formulae: Research Articles
Authors: Robert A. van Engelen, Kyle A. Gallivan, Burt Walsh
Venue: Concurrency and Computation: Practice Experience (2006)

This paper presents a novel method for parametric worst-case execution time (WCET) estimation of loops. The method determines a parametric bound on the iteration space size of loops with both affine and non-affine loop bounds in an efficient manner using a formulation based on Newton&ndash;Gregory interpolating polynomials. Parametric WCET formulae are used to support dynamic scheduling decisions at runtime, where the WCET of a scheduled task might not be known statically. To determine worst-case execution time estimates of scientific and multimedia codes, which spent most of the execution time on executing loop iterations, efficient and accurate symbolic loop WCET estimation methods must be capable of analyzing loops with symbolic bounds, non-rectangular loops, zero-trip loops, loops with multiple critical paths, and loops with non-unit strides. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Energy-efficient CPU scheduling for multimedia applications
Authors: Wanghong Yuan, Klara Nahrstedt
Venue: ACM Transactions on Computer Systems (TOCS) (2006)

This article presents the design, implementation, and evaluation of EScheduler, an energy-efficient soft real-time CPU scheduler for multimedia applications running on a mobile device. EScheduler seeks to minimize the total energy consumed by the device while meeting multimedia timing requirements. To achieve this goal, EScheduler integrates dynamic voltage scaling into the traditional soft real-time CPU scheduling: It decides at what CPU speed to execute applications in addition to when to execute what applications. EScheduler makes these scheduling decisions based on the probability distribution of cycle demand of multimedia applications and obtains their demand distribution via online profiling.We have implemented EScheduler in the Linux kernel and evaluated it on a laptop with a variable-speed CPU and typical multimedia codecs. Our experimental results show four findings: first, the cycle demand distribution of our studied codecs is stable or changes slowly. This stability implies the feasibility to perform our proposed energy-efficient scheduling with low overhead. Second, EScheduler delivers soft performance guarantees to these codecs by bounding their deadline miss ratio under the application-specific performance requirements. Third, EScheduler reduces the total energy of the laptop by 14.4&percnt; to 37.2&percnt; relative to the scheduling algorithm without voltage scaling and by 2&percnt; to 10.5&percnt; relative to voltage scaling algorithms without considering the demand distribution. Finally, EScheduler saves energy by 2&percnt; to 5&percnt; by explicitly considering the discrete CPU speeds and the corresponding total power of the whole laptop, rather than assuming continuous speeds and cubic speed-power relationship.
Neural networks based variable bit rate traffic prediction for traffic control using multiple leaky bucket
Authors: Yen Chieh Ouyang, Ching-Wen Yang, Wei Shi Lian
Venue: Journal of High Speed Networks (2006)

This work presents a novel feedback rate regulator using the multiple leaky bucket (MLB) for variable bit rate (VBR) self-similar traffic that is based on the traffic load prediction by time-delayed neural networks in ATM networks. In the MLB mechanism, the leak rate and buffer capacity of each leaky bucket (LB) can be dynamically adjusted based on the buffer occupancy. A finite-duration impulse response (FIR) multilayer neural network is used to predict the incoming traffic load and pass the information to the feedback rate regulator. Ten real world MPEG1 and ten synthesized traffic traces are used to validate the performance of the MLB and the MLB with an FIR prediction mechanism. Simulation results demonstrate that the cell loss rate using MLB and MLB with an FIR filter-based predictor can be significantly reduced compare to the conventional leaky bucket method.
Robust Boundary DetectionWith Adaptive Grouping
Authors: Francisco J. Estrada, Allan D. Jepson
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

This paper presents a perceptual grouping algorithm that performs boundary extraction on natural images. Our grouping method maintains and updates a model of the appearance of the image regions on either side of a growing contour. This model is used to change grouping behaviour at run-time, so that, in addition to following the traditional Gestalt grouping principles of proximity and good continuation, the grouping procedure favours the path that best separates two visually distinct parts of the image. The resulting algorithm is computationally efficient and robust to clutter and texture. We present experimental results on natural images from the Berkeley Segmentation Database and compare our results to those obtained with three alternate grouping methods.
Social coordination without communication in multi-agent territory exploration tasks
Authors: Paul Schermerhorn, Matthias Scheutz
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

In the recent past, several different methods for coordinating behavior in multi-robot teams have been proposed. Common to most of them is the use of communication to coordinate behavior. For many practical applications, however, communication might not be an option (e.g., because of energy constraints of embedded platforms, limited communication range of wireless transmitters, security risks of potential interception of messages in hostile territory, etc.).In this paper we examine low-complexity, low-cost strategies without communication for coordinated agent behavior. Specifically, we investigate the utility of a "social preference mechanism" and a "pairing mechanism" in territory exploration tasks, where agents have to explore their environment to find and visit k checkpoints, which only count as "visited" when n agents are present at them at the same time. Experimental results indicate that pairing is the better strategy, raising interesting questions about tradeoffs between agent complexity and group size (e.g., whether fewer, more expensive agents with the ability to visit checkpoints individually are a better choice than more less expensive agents).
An overlay network providing application-aware multimedia services
Authors: Maarten Wijnants, Bart Cornelissen, Wim Lamotte, Bart De Vleeschauwer
Venue: Proceedings of the 2nd international workshop on Advanced architectures and algorithms for internet delivery and applications (2006)

Real-time streaming of multimedia content is increasingly becoming a crucial part of networked applications. A logical consequence of this evolution is a growing demand for services that can be applied on these multimedia streams. In this paper, we present our overlay network which provides such multimedia services. Although these services are application-aware and can thus exploit application-specific knowledge, the overlay network itself is completely generic. Consequently, multiple applications can take advantage of the overlay network, even concurrently. Furthermore, the overlay network is highly extensible, meaning additional services can be added to it easily. Besides describing the architecture of the software component of our overlay network, we also discuss the implementation of two example multimedia services. The first service mixes multiple audio streams into a single stream to enable lightweight voice communication in a Networked Virtual Environment. The second service applies face detection on a video stream to generate meaningful avatars in a meeting system called iConnect. The experimental results produced by these two services clearly demonstrate that our overlay network is capable of providing valuable services for a wide range of networked multimedia applications.
A unified model for the implementation of both ISO 9001:2000 and CMMI by ISO-certified organizations
Authors: Chanwoo Yoo, Junho Yoon, Byungjeong Lee, Chongwon Lee, Jinyoung Lee, Seunghun Hyun, Chisu Wu
Venue: Journal of Systems and Software (2006)

ISO 9001 is a standard for quality management systems and CMMI is a model for process improvement. If an ISO-certified organization wishes to improve its processes continuously, implementing CMMI would be a good choice, as it provides more detailed practices for process improvement than the ISO standards. However, there are two issues that need to be resolved when an ISO-certified organization implements CMMI. First, it is not easy to identify any reusable parts of the ISO standards, and it would be advantageous to be able to reuse selected portions of the ISO standards during CMMI adoption in order to use existing resources to their best advantage. Second, it is difficult for an ISO-certified organization to implement CMMI in a straightforward, easy manner because of the differences in the language, structure, and details of the two sets of documents. In this paper, we present our unified model for ISO 9001:2000 and CMMI that resolves these two issues. Our model would be an extremely useful tool for ISO-certified organizations that plan to implement CMMI.
Multilayer grid embeddings of iterated line digraphs
Authors: Toru Hasunuma
Venue: Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51 (2006)

In this paper, we show that for any fixed d-regular digraph G, every iterated line digraph Lk(G)(k ≥ 1) can be embedded in d layers using O(n2) area, where n is the number of vertices in Lk(G). Also, we present Ω(n2/log2n) lower bound on the area of Lk(G) for any fixed number of layers. Besides, we apply the results to specific families of iterated line digraphs such as de Bruijn digraphs, Kautz digraphs, and wrapped butterfly digraphs.
Complexity and chaos in piecewise-smooth dynamical systems
Authors: Z. T. Zhusubaliyev, E. A. Soukhoterin, E. Mosekilde
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

The paper describes the main bifurcations and routes to chaos exhibited by piecewise-smooth dynamical systems. Emphasis is given to the study of complex behavior in multidimensional piecewise-smooth systems with border-collision bifurcations. The considered phenomena include usual period-doubling and quasiperiodic routes to chaos as well as sequences of different kinds of border-collision bifurcations. We also present a family of three-dimensional piecewise-smooth maps that can be used for analyzing typical nonlinear phenomena in nonsmooth systems.
MetaOCaml server pages: web publishing as staged computation
Authors: Christopher League
Venue: Science of Computer Programming (2006)

Modern dynamic web services are really computer programs. Some parts of these programs run off-line, others run server-side on each request, and still others run within the browser. In other words, web publishing is staged computation, either for better performance, or because certain resources are available in one stage but not another. Unfortunately, the various web programming languages make it difficult to spread computation over more than one stage. This is a tremendous opportunity for multi-stage languages in general, and for MetaOCaml in particular.We present the design of MetaOCaml Server Pages. Unlike other languages in its genre, the embedded MetaOCaml code blocks may be annotated with staging information, so that the programmer may safely and precisely control which computation occurs in which stage. A prototype web server, written in OCaml, supports web sites with both static and dynamic content. We provide several sample programs and demonstrate the performance gains won using multi-stage programming.
VFSim: concurrent fault simulation at register transfer level
Authors: Li Shen
Venue: Journal of Computer Science and Technology (2005)

VLSI testing is being pushed to the high-level based technology. In this paper a Verilog Register transfer level Model (VRM) for integrated circuits is proposed. The model provides a text format file, which is convenient and more practical for developing succeeding Register Transfer Level (RTL) test tools, such as fault simulation, test pattern generation and so forth. Based on the VRM, an RTL concurrent fault simulation approach is presented. After RTL fault models and super faults defined, the concurrent fault simulation algorithm is given. The corresponding RTL concurrent fault simulator, VFSim, was implemented. The initial experiments show that the RTL fault simulator is efficient for VLSI circuits.
Relevance Feedback Query Refinement for PDF Medical Journal Articles
Authors: Ammon Christiansen, D. J. Lee
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

This paper addresses relevance feedback as an alternative to keyword-based search engines for sifting through large PDF document collections and extracting the most relevant documents (especially for literature review purposes). Until now, relevance feedback has only been used in content-based image and video retrieval due to the inability to query those media types without keywords. Since PDF journal articles contain many valuable non-keyword features such as structure and formatting information as well as embedded figures, they would benefit from relevance feedback. Stripping a PDF into "full-text" for indexing purposes disregards these important features. We discuss how they can be used to our advantage and look to integrate the wealth of knowledge from relevance feedback text-based information retrieval. We argue for the benefits of placing the burden of relevance judgement on the user rather than the retrieval system and present alternative document views that quickly allow the user to deem relevance.
NetSpy: Automatic Generation of Spyware Signatures for NIDS
Authors: Hao Wang, Somesh Jha, Vinod Ganapathy
Venue: Proceedings of the 22nd Annual Computer Security Applications Conference (2006)

We present NetSpy, a tool to automatically generate network-level signatures for spyware. NetSpy determines whether an untrusted program is spyware by correlating user input with network traffic generated by the untrusted program. If classified as spyware, NetSpy also generates a signature characterizing the malicious substrate of the spyware's network behavior. Such a signature can be used by network intrusion detection systems to detect spyware installations in large networks. In our experiments, NetSpy precisely identified each of the 7 spyware programs that we considered and generated network-level signatures for them. Of the 9 supposedly-benign programs that we considered, NetSpy correctly characterized 6 of them as benign. The remaining 3 programs showed network behavior that was highly suggestive of spying activity.
The Clustered Causal State Algorithm: Efficient Pattern Discovery for Lossy Data-Compression Applications
Authors: Mendel Schmiedekamp, Aparna Subbu, Shashi Phoha
Venue: Computing in Science and Engineering (2006)

Pattern discovery is a potential boon for data compression. By identifying generic patterns without humansupervision, pattern discovery algorithms can extract the most relevant information for greatest fidelityin lossy compression. However, current approaches to pattern discovery are inefficient and producecumbersome descriptions of patterns. The Clustered Causal State Algorithm (CCSA) is a new pattern discovery algorithm incorporating recent clustering technology. This algorithmsacrifices accuracy for increased efficiency and smaller model sizes. This makes CCSA ideal for lossy datacompression and other real-time applications. This algorithm is compared to other pattern discoveryalgorithms and demonstrated in an image compression application.