ppxscal/embedding_network huggingface dataset:
Common Misconceptions about Service-Oriented Architecture
Authors: Grace A. Lewis, Edwin Morris, Soumya Simanta, Lutz Wrage
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

You don't have to look far to become aware of the effect that Service-Oriented Architecture (SOA) is having on software systems. Vendors are aggressively marketing hardware, software, tools, and services that support SOA implementation within organizations as diverse as the Department of Defense, banks, federal agencies, manufacturing companies, and health care providers. Even more significantly, customers are embracing SOA as a way to successfully achieve business agility and interoperability among systems. However, our experience from working with current and potential adopters of SOA is that they often have a variety of misconceptions that lead them to oversimplify the effort required to implement SOA. Chief among these misconceptions is the belief that simply by adopting an SOA strategy for the enterprise, an organization has established a well-crafted architecture that will help the organization achieve its many IT goals. In reality, SOA is not an architecture, but an architectural pattern from which an infinite number of architectures can be derived-both good and bad. In this experience report, we discuss at a high level this and several other misconceptions about SOA derived from our experiences.
A blind spatio-temporal equalizer using cyclic prefix in OFDM systems
Authors: Hyunsoo Cheon
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

We proposes a blind equalization algorithm that enables spatio-temporal diversity in OFDM systems. The proposed algorithm is based on the least-squares approach, which exploits the OFDM signal structure and multiple outputs of an antenna array. The sensitivity of the proposed equalizer to the input signal and noise are presented, and the proposed algorithm is evaluated in simulation results.
Deleted interpolation and density sharing for continuous hidden Markov models
Authors: X. D. Huang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

As one of the most powerful smoothing techniques, deleted interpolation has been widely used in both discrete and semi-continuous hidden Markov model (HMM) based speech recognition systems. For continuous HMMs, most smoothing techniques are carried out on the parameters themselves such as Gaussian mean or covariance parameters. HMMs this paper, we propose to smooth the probability density values instead of the parameters of continuous HMMs. This allows us to use most of the existing smoothing techniques for both discrete and continuous HMMs. We also point out that our deleted interpolation can be regarded as a parameter sharing technique. We further generalize this sharing to the probability density function (PDF) level, in which each PDF becomes a basic unit and can be freely shared across any Markov state. For a wide range of dictation experiments, deleted interpolation reduced the word error rate-by 11% to 23% over other simple parameter smoothing techniques like flooring. Generic PDF sharing further reduced the error rate by 3%.
Bayesian training of neural networks using genetic programming
Authors: Tshilidzi Marwala
Venue: Pattern Recognition Letters (2007)

Bayesian neural network trained using Markov chain Monte Carlo (MCMC) and genetic programming in binary space within Metropolis framework is proposed. The algorithm proposed here has the ability to learn using samples obtained from previous steps merged using concepts of natural evolution which include mutation, crossover and reproduction. The reproduction function is the Metropolis framework and binary mutation as well as simple crossover, are also used. The proposed algorithm is tested on simulated function, an artificial taster using measured data as well as condition monitoring of structures and the results are compared to those of a classical MCMC method. Results confirm that Bayesian neural networks trained using genetic programming offers better performance and efficiency than the classical approach.
Backbone construction in selfish wireless networks
Authors: Seungjoon Lee, Dave Levin, Vijay Gopalakrishnan, Bobby Bhattacharjee
Venue: ACM SIGMETRICS Performance Evaluation Review (2007)

We present a protocol to construct routing backbones in wireless networks composed of selfish participants. Backbones are inherently cooperative, so constructing them in selfish environments is particularly difficult; participants want a backbone to exist (soothers relay their packets) but do not want to join the backbone (so they do not have to relay packets for others). We model the wireless backbone as a public good and use impatience as an incentive for cooperation. To determine if and when to donate to this public good, each participant calculates how patient it should be in obtaining the public good. We quantify patience using the Volunteer's Timing Dilemma (VTD), which we extend to general multihop network settings. Using our generalized VTD analysis, each node individually computes as its dominant strategy the amount of time to wait before joining the backbone. We evaluate our protocol using both simulations and an implementation. Our results show that, even though participants in our system deliberately wait before volunteering, a backbone is formed quickly. Further, the quality of the backbone (such as the size and resulting network lifetime) is comparable to that of existing backbone protocols that assume altruistic behavior.
E-Quality and E-Service Equality
Authors: Pnina Shachaf, Shannon M. Oltmann
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Research is divided about the potential of e-service to bridge communication gaps, particularly to diverse user groups. According to the existing body of literature, e-service may increase or decrease the quality of service received. This study analyzes the level of service received by different genders and ethnic groups when public librarians answer online reference queries. Quality of e-service was evaluated along three dimensions: responsiveness, reliability, and courtesy. This study found no significant differences among different user groups along any of these dimensions, supporting the argument that the virtual environment facilitates equitable service and may overcome some challenges of diverse user groups.
On the Asymptotic Spectrum of Finite Element Matrix Sequences
Authors: Bernhard Beckermann, Stefano Serra-Capizzano
Venue: SIAM Journal on Numerical Analysis (2007)

We derive a new formula for the asymptotic eigenvalue distribution of stiffness matrices obtained by applying $P_1$ finite elements with standard mesh refinement to the semielliptic PDE of second order in divergence form $- \nabla (K \nabla^T u ) = f$ on &OHgr;, $u = g$ on $\partial \Omega$. Here $\Omega \subset \R^2$, and $K$ is supposed to be piecewise continuous and pointwise symmetric semipositive definite. The symbol describing this asymptotic eigenvalue distribution depends on the PDE, but also both on the numerical scheme for approaching the underlying bilinear form and on the geometry of triangulation of the domain. Our work is motivated by recent results on the superlinear convergence behavior of the conjugate gradient method, which requires the knowledge of such asymptotic eigenvalue distributions for sequences of matrices depending on a discretization parameter $h$ when $h \to 0$. We compare our findings with similar results for the finite difference method which were published in recent years. In particular we observe that our sequence of stiffness matrices is part of the class of generalized locally Toeplitz sequences for which many theoretical tools are available. This enables us to derive some results on the conditioning and preconditioning of such stiffness matrices.
A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
Authors: Yannis Marinakis, Athanasios Migdalas, Panos M. Pardalos
Venue: Journal of Global Optimization (2007)

The Vehicle Routing Problem (VRP) is one of the most well studied problems in operations research, both in real life problems and for scientific research purposes. During the last 50 years a number of different formulations have been proposed, together with an even greater number of algorithms for the solution of the problem. In this paper, the VRP is formulated as a problem of two decision levels. In the first level, the decision maker assigns customers to the vehicles checking the feasibility of the constructed routes (vehicle capacity constraints) and without taking into account the sequence by which the vehicles will visit the customers. In the second level, the decision maker finds the optimal routes of these assignments. The decision maker of the first level, once the cost of each routing has been calculated in the second level, estimates which assignment is the better one to choose. Based on this formulation, a bilevel genetic algorithm is proposed. In the first level of the proposed algorithm, a genetic algorithm is used for calculating the population of the most promising assignments of customers to vehicles. In the second level of the proposed algorithm, a Traveling Salesman Problem (TSP) is solved, independently for each member of the population and for each assignment to vehicles. The algorithm was tested on two sets of benchmark instances and gave very satisfactory results. In both sets of instances the average quality is less than 1%. More specifically in the set with the 14 classic instances proposed by Christofides, the quality is 0.479% and in the second set with the 20 large scale vehicle routing problems, the quality is 0.826%. The algorithm is ranked in the tenth place among the 36 most known and effective algorithms in the literature for the first set of instances and in the sixth place among the 16 algorithms for the second set of instances. The computational time of the algorithm is decreased significantly compared to other heuristic and metaheuristic algorithms due to the fact that the Expanding Neighborhood Search Strategy is used.
Engineering multirate convolutions for radar imaging
Authors: L. Bierens
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

We present a schematic design methodology for multirate convolution systems, based on combined algorithmic development and architecture design. It allows us to map the algebraic specification of a long convolution algorithm directly onto efficient fast convolution hardware based on short FFT processor elements or dedicated VLSI processors. The design methodology exploits the known relationship between multirate filter banks and fast convolution schemes in an implicit manner, and allows the hardware designer to concentrate on typical application specific constraints such as processing speed, processor size and memory utilization. The methodology has proven its usefulness in the design of a convolution processor for real-time on-board synthetic aperture radar imaging.
Institutionalization of mechatronics engineering curricular material
Authors: D. M. Auslander
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

With the explosively increasing cost/size-effectiveness of computers, mechatronic systems are becoming common in any engineering discipline dealing with the modulation of physical power. In this sense, mechatronic systems are physical systems for which the computing component is critical to effective operation. It is no longer adequate for engineering curricula to expose only a select group of students to mechatronic methodology. We describe the efforts within the NSF Synthesis Coalition to infuse mechatronics material into all four years of students' engineering studies. The working philosophy of this effort is that the mechatronics material will be integrated into existing disciplinary courses and programs. No new degrees and no new courses are anticipated, with the exception of courses designed for students interested in mechatronics as a professional specialty. Descriptions of the particular curricular projects that Synthesis is now working on are included.
Understanding what "success" means in assessment [of engineering education]
Authors: M. J. Piket-May
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

The University of Colorado at Boulder's Integrated Teaching and Learning Lab (ITLL) opened in the USA in April 1997. ITLL is an innovative facility designed to encourage experiential, hands-on learning across all engineering disciplines. The setting was designed to strengthen the creative problem solving skills of students while working in a multidisciplinary team. The lab has anecdotally been a great success in its use so far, however a focused general assessment plan must be developed to understand the long term impact. In order to develop a general assessment plan for the ITLL program, one first needs to identify what needs to be assessed. The general discussion of this paper focuses on "what does it mean to be a successful engineering student?" In order to come up with a definition of success, the authors looked at many issues and studied many current assessment techniques reported in literature. This paper discusses the definition of success for engineering education programs.
A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
Authors: Mikhail V. Solodov
Venue: SIAM Journal on Optimization (2007)

We consider the bilevel problem of minimizing a nonsmooth convex function over the set of minimizers of another nonsmooth convex function. Standard convex constrained optimization is a particular case in this framework, corresponding to taking the lower level function as a penalty of the feasible set. We develop an explicit bundle-type algorithm for solving the bilevel problem, where each iteration consists of making one descent step for a weighted sum of the upper and lower level functions, after which the weight can be updated immediately. Convergence is shown under very mild assumptions. We note that in the case of standard constrained optimization, the method does not require iterative solution of any penalization subproblems&mdash;not even approximately&mdash;and does not assume any regularity of constraints (e.g., the Slater condition). We also present some computational experiments for minimizing a nonsmooth convex function over a set defined by linear complementarity constraints.
Notes On Pulse Signaling
Authors: Jo Ebergen, Steve Furber, Arash Saifhashemi
Venue: Proceedings of the 13th IEEE International Symposium on Asynchronous Circuits and Systems (2007)

This paper reports results of a study on pulse signaling. In pulse signaling, components communicate by means of pulses instead of voltage transitions. The functionality of the components is very similar to the functionality of components used in so-called asynchronous transition signalling. In asynchronous transition signalling, communication events are represented by voltage transitions, whereas in pulse signaling communication events are represented by pulses. We describe various implementations of pulsesignaling components, report on the energy efficiencies of our implementations, and look at some robustness aspects.
Self-tuning adaptive delay sequential elements
Authors: Kambiz Rahimi, Chris Diorio
Venue: Microelectronics Journal (2007)

Random manufacturing variations and changes in operating conditions can alter the relative timing of data and clock signals and cause timing violations. Increasing relative magnitude of manufacturing variations and accommodating a wide range of operating conditions necessitate large design margins and decrease circuit performance. In-circuit tuning of clock latencies allows recovering some of the performance loss. In this paper, we introduce self-tuning adaptive-delay sequential elements (SASEs) that use PMOS floating gates to tune clock latencies of individual flip-flops. SASEs are capable of concurrent, in-circuit optimization of clock latencies under varying operating conditions. We use examples of implicit and explicit pulsed flip-flops to present SASEs operations and tuning methods. Our experiments with fabricated prototypes show that SASEs can tune their clock latencies with picosecond resolution over one half of the clock period. Our experiments also show that SASEs' sensitivities are comparable to non-adaptive flip-flops and do not pose any practical limitations. We also present a tuning procedure for pipeline circuits that tunes SASEs' clock latencies to maximize performance.
Segmentation and Tracking of the Left Ventricle in 3D MRI Sequences Using an Active Surface Model
Authors: Julien Mille, Romuald Bone, Pascal Makris, Hubert Cardot
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

We describe a 3D+T active surface model for segmentation and tracking of the left ventricular endocardium within 3D MRI sequences of the cardiac cycle. In order to perform segmentation and tracking simultaneously, the surface structure is divided through both time and space, and is therefore handled as an array of planar active contours, interconnected between adjacent slices and frames, providing spatial and temporal consistency. In a given frame, the stacking of slice contours constitute a 3D triangular mesh with a cylindrical topology. Extraction of ventricle border is performed by means of energy minimization, using a combination of boundary-based term and a new computationally efficient region-based term.
Segmented and unsegmented dialogue-act annotation with statistical dialogue models
Authors: Carlos D. Martínez Hinarejos, Ramón Granell, José Miguel Benedí
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

Dialogue systems are one of the most challenging applications of Natural Language Processing. In recent years, some statistical dialogue models have been proposed to cope with the dialogue problem. The evaluation of these models is usually performed by using them as annotation models. Many of the works on annotation use information such as the complete sequence of dialogue turns or the correct segmentation of the dialogue. This information is not usually available for dialogue systems. In this work, we propose a statistical model that uses only the information that is usually available and performs the segmentation and annotation at the same time. The results of this model reveal the great influence that the availability of a correct segmentation has in obtaining an accurate annotation of the dialogues.
Asynchronous random sleeping for sensor networks
Authors: Cunqing Hua, Tak-Shing Peter Yum
Venue: ACM Transactions on Sensor Networks (TOSN) (2007)

Sleeping scheduling is a common energy-conservation solution for sensor networks. For application whereby coordination of sleeping among sensors is not possible or inconvenient, random sleeping is the only option. In this article, we study the asynchronous random sleeping(ARS) scheme whereby sensors (i) do not need to synchronize with each other, and (ii) do not need to coordinate their sleeping schedules. The stationary coverage probability and the expected coverage periods for ARS are derived. For surveillance application, we derive in addition the detection probability and detection delay distribution. The correctness of our results is validated through extensive simulations. We compare ARS with other synchronous and asynchronous sleeping scheduling algorithms and show that ARS offers better performance in terms of detection delay in the lower duty-cycle regime. We also conduct simulations to demonstrate that our results can be a good approximation for clock drifting case.
Discovering event evidence amid massive, dynamic datasets
Authors: Robert M. Patton, Thomas E. Potok
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

Automated event extraction remains a very difficult challenge requiring information analysts to manually identify key events of interest within massive, dynamic data. Many techniques for extracting events rely on domain specific natural language processing or information retrieval techniques. As an alternative, this work focuses on detecting events based on identifying event characteristics of interest to an analyst. An evolutionary algorithm is developed as a proof of concept to demonstrate this approach. Initial results indicate that this approach represents a feasible approach to identifying critical event information in a massive data set with no apriori knowledgeof the data set.
Entropy and algorithmic complexity in quantum information theory
Authors: Fabio Benatti
Venue: Natural Computing: an international journal (2007)

A theorem of Brudno says that the entropy production of classical ergodic information sources equals the algorithmic complexity per symbol of almost every sequence emitted by such sources. The recent advances in the theory and technology of quantum information raise the question whether a same relation may hold for ergodic quantum sources. In this paper, we discuss a quantum generalization of Brudno's result which connects the von Neumann entropy rate and a recently proposed quantum algorithmic complexity.
Embedded programming with C++
Authors: Stephen Williams
Venue: Proceedings of the 3rd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 3 (1997)

This paper presents uCR, a C++ runtime package for embedded program development. We make the case that in certain situations embedded programming is best done without the aid of a conventional operating system. A programming environment in the form of a C++ runtime is presented, and the environment, including the C++ language, is evaluated for appropriateness. Important factors are code size, performance, simplicity and applicability to a wide range of embedded targets.
Laboratories teaching concepts in microcontrollers and hardware-software co-design
Authors: D. Beetner
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Hardware software co-design is becoming increasingly important to the embedded systems industry. It will soon be fundamental to digital systems design. As such, students in electrical and computer engineering and in computer science should be introduced to hardware-software co-design early in their undergraduate education. We are designing laboratory modules which introduce concepts of hardware-software co-design in an undergraduate's first course on microcontrollers and digital systems design. Students use design automation tools to develop FPGA-based hardware for use with an 8051-microcontroller and use common software development tools to develop microcontroller software in C or assembly language. Co-simulation of hardware and software is enabled using a simulation model of the 8051 that we developed. Preliminary results are encouraging. Students who take the lab perform better in the associated lecture class than those who do not take the lab and appear to develop a greater appreciation for digital systems design. We believe such laboratories will be a common component of computer engineering classes in the future.