ppxscal/embedding_network huggingface dataset:
Non-linear Optimization of Performance Functions for Autonomic Database Performance Tuning
Authors: Gennadi Rabinovitch, David Wiese
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

Modern OnDemand environments are coined by a heterogeneous diversity of components, architectures and applications. High performance, availability and further service level agreements need to be satisfied under any circumstances in order to please customers. Today, highly skilled database administrators (DBAs) are required to tune the DBMS within their complex environments. Achieved DBMS' performance depends on individual DBA skills, home-grown tuning scripts and in most cases is reactive to obvious and urgent performance problems. This paper addresses the idea of classifying, formalizing, obtaining, storing, maintaining, exchanging and individually adapting DBA expert tuning-knowledge as shared domain of understanding in the autonomic management process. Hereby, we focus our attention on the development of a resource dependency model that allows for (precise) optimization and decision-support at run-time, in contrast to traditional trial-anderror, feedback-based tuning methodologies based on best-practices.
New fast search algorithm for base layer of H.264 scalable video coding extension
Authors: Livio Lima, Daniele Alfonso, Luca Pezzoni, Riccardo Leonardi
Venue: Proceedings of the 2007 Data Compression Conference (2007)

In this contribution, a fast search motion estimation algorithm for H.264/AVC SVC (scalable video coding) [2] base layer with hierarchical B-frame structure for temporal decomposition is presented and compared with fast search motion estimation algorithm in JSVM software [1], that is the reference software for H.264/AVC SVC.
ITS-Engineering: providing adaptive teaching in the engineering tutor
Authors: C. Srisethanil, N. Baker
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

The successful learning of an engineering student depends substantially on the instructor's ability to adapt instruction, both the content and the various teaching styles, to individual differences among students. The emergence of computer applications in education and training, such as intelligent tutoring systems, provides a viable alternative to achieve these teaching tasks. Computerized instruction is a significant tool for the effective application of adaptive teaching. ITS-Engineering is a tutoring system shell intended to provide a developing framework for applications in the engineering domains with less time and cost. Based on R.M. Gagne's (1985) instructional design and the multiple teaching style paradigm, the application is able to deliver instruction that adapts in both content and teaching styles. The available teaching styles in ITS-Engineering include instructor oriented, guided discovery, user initiated and exploratory styles. The instructor oriented and the guided discovery style represents the teacher control paradigm. In contrast, the user initiated and the exploratory style represent the learner control paradigm. The application of these teaching styles and their adapting capabilities are demonstrated in ITS-CPM (Intelligent Tutoring System for Construction and Project Management); an ITS application developed within the framework of ITS-Engineering.
Affine invariant shape representation and recognition using Gaussian kernels and multi-dimensional indexing
Authors: J. Ben-Arie
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

This paper presents a new approach for object recognition using affine-invariant recognition of image patches that correspond to object surfaces that are roughly planar. A novel set of affine-invariant spectral signatures (AISSs) are used to recognize each surface separately invariant to its 3D pose. These local spectral signatures are extracted by convolving the image with a novel configuration of Gaussian kernels. The spectral signature of each image patch is then matched against a set of iconic models using multi-dimensional indexing (MDI) in the frequency domain. Affine-invariance of the signatures is achieved by a new configuration of Gaussian kernels with modulation in two orthogonal axes. The proposed configuration of kernels is Cartesian with varying aspect ratios in two orthogonal directions. The kernels are organized in subsets where each subset has a distinct orientation. Each subset spans the entire frequency domain and provides invariance to slant, scale and limited translation. The complete set of orientations is utilized to achieve invariance to rotation and tilt. Hence, the proposed set of kernels achieve complete affine-invariance.
Designing Self-Adaptive Service-Oriented Applications
Authors: Giovanni Denaro, Mauro Pezze, Davide Tosi
Venue: Proceedings of the Fourth International Conference on Autonomic Computing (2007)

The integration of third-party web services can solve complex business problems and reduce risks, costs and time-to-market. However, the task of the integrators is challenged by services that are maintained by different organizations, and may evolve dynamically and autonomously. The impossibility of statically determining which service implementation is bound at runtime may lead to unexpected failures [2].
A fire scout robot with accurate returning for urban environment
Authors: Jun Qian, Jian Jun Zeng, Ru-Qing Yang, Xin-Hua Weng
Venue: Robotica (2007)

In order to allow people to explore potential fire environments without risk of danger, a new fire scout mobile robot used in urban environments is introduced in this paper. It adapts itself to stair climbing by using articulated-chain-wheeled mobile style with differential wheels. The positive pressure with continuous flow of protected gas inside the body endows the robot with explosion protection capability. When the wireless control signal is interrupted, it could automatically return to safe place along previous path based on sensorial data. Since position estimation only using encoders reading has serious limitations as mobile robot movement proceeds, a novel method integrating data of encoders and ultrasonic sensors is built, which uses iterative closest point algorithm to do data matching so as to adjust position and orientation of the mobile robot. This path retracing method realizes high accuracy and fast speed of automatic returning when the mobile robot is working in static urban environment even if the environment is unknown.
Performance Evaluation of Memory Caches in Multiprocessors
Authors: Yung-Chin Chen, Alexander V. Veidenbaum
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

Large-scale MIN-based shared-memory multiprocessor systems have long shared memory latency. Private caches can improve memory access latency but they may suf fer from the cache coherence problem and potentially lower data locality due to data sharing and multiproces sor scheduling. These two problems also increase shared memory load and may result in frequent memory stalls. In this paper, we evaluate the performance of memory caches, a cache memory placed in front of shared memory, in a large-scale multiprocessor system in the presence of pro cessor caches. The memory cache is shown to have good performance and scalability.
MirrorDir
Authors: Paul Sheer
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

Mirrordir began as a program to mirror directories recursively with a minimal set of changes as an alternative to RAID devices. It later evolved to support the VFS layer of the Midnight Commander and can hence mirror to and from ftp sites. A further encrypted socket layer was added to transparently facilitate the same mirroring and general file transfer capabilities. The socket layer has the interesting feature that all encryption code exists only within 4kB of interpreted scripts. Since these can be distributed separately from the application, Mirrordir can be exported from countries that would otherwise restrict export of cryptographic software. Mirrordir also features secure socket forwarding and a secure login program using the same socket layer, somewhat belying the name of the package.
GeoPPRA: An Energy-Efficient Geocasting Protocol in Mobile Ad Hoc Networks
Authors: Paul Barom Jeon, George Kesidis
Venue: Proceedings of the Sixth International Conference on Networking (2007)

In this paper, a variant of the conventional multicasting called geocasting, or location-based multicasting, is presented. The proposed scheme combines anycasting, restricted broadcasting, and local broadcasting to deliver packets to a group of nodes presented in a specific geographic region called geocast region. Also, the proposed scheme utilizes a pheromone-aided multipath algorithm (PPRA) to perform energy-efficient load balancing that increases the network lifetime. We compare the performance of GeoPPRA with well-known geocasting protocol GAMER via simulation. The simulation results show significant reductions of energy consumption, while maintaining comparable delivery ratio defined as the ratio of successfully delivered data packets to the total data packets sent from the source to one of the geocast group members.
A variational shape optimization framework for image segmentation
Authors: Ricardo H. Nochetto
Venue:  (2006)

Image segmentation is one of the fundamental problems in image processing. The goal is to partition a given image into regions that are uniform with respect to some image features and possibly to extract the region boundaries. Recently methods based on PDEs have been found to be an effective way to address this problem. These methods in general fall under the category of shape optimization, as the typical approach is to assign an energy to a shape, say a curve in 2d, and to deform the curve in a way that decreases its energy. In the end when the optimization terminates, the curve is not only at a minimum of the energy, but also at a boundary in the image. In this thesis, we emphasize the shape optimization view of image segmentation and develop appropriate tools to pursue the optimization in 2d and 3d. We first review the classes of shape energies that are used within the context of image segmentation. Then we introduce the analytical results that will help us design energy-decreasing deformations or flows for given shapes. We describe the gradient flows minimizing the energies, by taking into account the shape derivative information. In particular we emphasize the flexibility to accommodate different velocity spaces, which we later demonstrate to be quite beneficial. We turn the problem into the solution of a system of linear PDEs on the shape. We describe the corresponding space discretization based on the finite element method and an appropriate time discretization scheme as well. To handle mesh deterioration and possibly singularities due to motion of nodes, we describe time step control, mesh smoothing and angle width control procedures, also a topology surgery procedure that allows curves to undergo topological changes such as merging and splitting. In addition we introduce space adaptivity algorithms that help maintain accuracy of the method and reduce computational cost as well. Finally we apply our method to two major shape energies used for image segmentation: the minimal surface model (a.k.a geodesic active contours) and the Mumford-Shah model. For both we demonstrate the effectiveness of our method with several examples.
Development and analysis of comprehensive website software test plan information packages
Authors: Pam Sallee, Al Endres
Venue:  (2007)

The focus of this quantitative study was to examine if a relationship existed between the IEEE standards and the addition of maintenance and measurements. This study provided a series of development steps and evaluation rubrics used as a means for test plan generation and review. These steps can be used in addition to the current Institute of Electrical and Electronics Engineers standards. Developer and evaluator participants were randomly chosen from students and mentors at Northcentral University. Findings from the experimental design indicated that there was evidence of an increase (p=.15) in quality associated with the addition of the proposed maintenance and measurement standards. The additional standards could be used to enhance the website test planning generation and review process.
A Knowledge Management Platform for Optimization-based Data Mining
Authors: Xingsen Li, Yong Shi, Ying Liu, Jun Li, Aihua Li
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Multiple criteria linear programming (MCLP) approach to data mining has been used in many fields. But users need to understand well with math and technology in its working process. This prevents it from wide applications. Studied on standards of data mining process and its advantages to project operation with the analysis on the characters of MCLP method and its process, we found the current data mining process model can not support MCLP in detail. So a knowledge management platform was presented for standardization the MCLP process by referring to CRISP-DM and the researches on data mining process models. The platform collects the experts' experience in daily works of data mining and then accumulates knowledge for standardization. Its application in a web company shows that it makes easier for different types of users to work in optimization-based data mining process.
Low-power subband coding algorithm
Authors: E. N. Farag
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

This paper describes a video compression algorithm that has a reduced computational complexity. The subband video compression algorithm uses a simplified analysis/synthesis filter bank and a vector quantization coding algorithm. The use of the simplified analysis/synthesis filter banks reduces the power dissipation by 23 times over other algorithms at the expense of a 4 dB reduction in the signal to noise ratio. The vector quantization algorithm is a computational algorithm instead of the power consuming memory lookup algorithms.
Chinese-English term translation mining based on semantic prediction
Authors: Gaolin Fang, Hao Yu, Fumihito Nishino
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

Using abundant Web resources to mine Chinese term translations can be applied in many fields such as reading/writing assistant, machine translation and cross-language information retrieval. In mining English translations of Chinese terms, how to obtain effective Web pages and evaluate translation candidates are two challenging issues. In this paper, the approach based on semantic prediction is first proposed to obtain effective Web pages. The proposed method predicts possible English meanings according to each constituent unit of Chinese term, and expands these English items using semantically relevant knowledge for searching. The refined related terms are extracted from top retrieved documents through feedback learning to construct a new query expansion for acquiring more effective Web pages. For obtaining a correct translation list, a translation evaluation method in the weighted sum of multi-features is presented to rank these candidates estimated from effective Web pages. Experimental results demonstrate that the proposed method has good performance in Chinese-English term translation acquisition, and achieves 82.9% accuracy.
Joint DOA, frequency and model order estimation in additive /spl alpha/-stable noise
Authors: B. Kannan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Many classes of noise encountered in real-life exhibit outliers that will not fit into a Gaussian noise model. /spl alpha/-stable distributions are among the most important non-Gaussian models that can be used to accurately model impulsive noise environments. We introduce an algorithm that can be used to jointly estimate DOA (direction of arrival), frequency and model order in /spl alpha/-stable noise. Approximating /spl alpha/-stable noise by a Gaussian mixture, we use Bayesian principles to define a posterior density on the signal and noise parameter space. We describe an efficient stochastic algorithm called reversible jump RCMC (Markov chain Monte Carlo) that is used to evaluate our posterior density.
Cluster-based congestion control for supporting multiple classes of traffic in sensor networks
Authors: K. Karenos, V. Kalogeraki, S. V. Krishnamurthy
Venue: Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors (2005)

In wireless sensor networks, multiple flows from data collecting sensors to an aggregating sink could traverse paths that are largely interference coupled. These interference effects manifest themselves as congestion, and cause high packet loss and arbitrary packet delays. This is particularly problematic in event-based sensor networks where some flows are of greater importance than others and require fidelity in terms of higher packet delivery and timeliness. In this paper we present COMUT (congestion control for multi-class traffic), a distributed cluster-based mechanism for supporting multiple classes of traffic in sensor networks. COMUT is based on the self-organization of the network into clusters each of which autonomously and proactively monitors congestion within its localized scope. The clusters then exchange appropriate information to facilitate system wide rate control. Our simulation results demonstrate that our techniques are highly effective in dealing with multiple, randomly initiated flows.
Timing control for delay-constrained data aggregation in wireless sensor networks: Research Articles
Authors: Hong Li, HongYi Yu, BaiWei Yang, Ana Liu
Venue: International Journal of Communication Systems (2007)

Timing control for delay-constrained data aggregation is critical for improving the performance of a wireless sensor network. In this paper, we propose an adaptive timing control (ATC) mechanism to determine the proper time for data aggregation and forwarding. Given the maximum delay requirements of an application, the ATC mechanism determines the aggregation time for sensor nodes based on both the locations of the nodes and the number of children in the data aggregation tree. The nodes with more children are allocated a longer waiting time. The ATC mechanism maximizes the opportunity for data aggregation and ensures sufficient time to process data from the children. Analytical and simulation results show that the ATC mechanism leads to a higher data delivery rate and lower energy costs compared with existing similar algorithms. Moreover, since a lot of data packets can arrive at the sink earlier, the ATC mechanism is capable of responding more quickly to users. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Hierarchical adaptive regularisation method for depth extraction from planar recording of 3D-integral images
Authors: S. Manolache
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

The paper presents a novel algorithm for object space reconstruction from the planar (2D) recorded data set of a 3D-integral image. The integral imaging system is described and the associated point spread function is given. The space data extraction is formulated as an inverse problem, which proves ill-conditioned, and tackled by using a hierarchical multiresolution strategy and imposing additional conditions to the sought solution. The hierarchical strategy and the two-phase adaptive constrained 3D-reconstruction algorithm based on the use of two sigmoid functions are presented. Finally, illustrative simulation results are given.
Different is good: barriers to retention for women in software engineering
Authors: C. Radziemski
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

The study is the initial activity in a proposed longitudinal study of female students in the Software Engineering program at a small private technical university in the US. In imitation of a national trend, the female students were perceived to be dropping out of the software engineering program in greater numbers and for different reasons than the male students. An examination of the number of students leaving the university and a questionnaire for the newest students entering the university were completed. The results of the study confirmed the initial perception. To produce a large enough sample for meaningful analysis, the dropout tracking will continue and the questionnaire used initially will be given to a new group of students, after which the entire data set will be analyzed.
Representing Hierarchical Mobility in Software Architectures
Authors: Fernando J. Barros
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

The ability to move components from one hierarchical model to another becomes necessary to support arbitrary changes in software topologies. Mobility allows the access to the hidden interface of a hierarchical component without breaking encapsulation, keeping the architecture modular. Mobility permits also the introduction of new functionally in the application without requiring changes in the architecture, enabling its adaptation to dynamic requirements. To illustrate hierarchical mobility we employ the Connecton software architecture (CSA). CSA combines a modular and hierarchical software construction with the objectoriented architectural style to achieve an innovative software architecture that eliminates the limitations of the classical object-oriented technology in supporting modular components. The simulation of a queuing system whose clients are represented by mobile components is provided.
Multi-Agent System for Directed Diffusion in Wireless Sensor Networks
Authors: Haroon Malik, Elhadi Shakshuki, Travis Dewolf, Mieso K. Denko
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

This paper presents an agent based system to increase the life time of node in Wireless Sensor Networks. In environment where node density is massive, placement is heterogeneous and lot of sensory traffic with redundancy is produced; individual nodes waste limited wireless bandwidth and consume lot of energy. This minimizes their life time on the network. Directed diffusion paradigm for distributed sensing of the environment has stated to deal with the phenomenon. Directed diffusion approach is data centric in that all communication is for named data. All the nodes in the directed diffusion are application aware and achieve energy saving by choosing good paths and processing data in-network. We unmitigated our efforts to augment the node life time in sensor network by introducing mobile agents. Mobile agents can be used to greatly reduce the communication cost, especially over low bandwidth links, by moving the processing function to the data rather than bringing the data to a central processor (sink). Toward this end, we propose an agent based directed diffusion approach.