ppxscal/embedding_network huggingface dataset:
Using Software Component Models and Services in Embedded Real-Time Systems
Authors: Frank Luders, Shoaib Ahmad, Faisal Khizer, Gurjodh Singh-Dhillon
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

While the use of software component models has become popular in the development of desktop applications and distributed information systems, such models have not been widely used in the domain of embedded real-time systems. Presumably, this is due to the requirements such systems have to meet with respect to predictable timing and limited use of resources. There is a considerable amount of research on component models for embedded real-time systems that focuses on source code components, statically configured systems, and relatively narrow application domains. This paper explores the alternative approach of using a mainstream component model based on binary components. The effects of using the model on timing and resource usage have been measured by implementing example applications both with and without using the model. In addition, the use of a prototype tool for supporting software component services has been investigated in the same manner.
Multiobjective control with frictional contacts
Authors: Yeuhi Abe, Marco da Silva, Jovan Popović
Venue: Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation (2007)

Standing is a fundamental skill mastered by humans and animals alike. Although easy for adults, it requires careful and deliberate manipulation of contact forces. The variation in contact configuration (e.g., standing on one foot, on uneven ground, or while holding on for support) presents a difficult challenge for interactive simulation of humans and animals, especially while performing tasks in the presence of external disturbances. We describe an analytic approach for control of standing in three-dimensional simulations based upon local optimization. At any point in time, the control system solves a quadratic program to compute actuation by maximizing the performance of multiple motion objectives subject to constraints imposed by actuation limits and contact configuration. This formulation is suitable for interactive animation and it adapts to the proportions of any character model in any non-planar, frictional contact configuration.
Non-orthogonal Binary Expansion of Gabor Filters with Applications in Object Tracking
Authors: Feng Tang, Hai Tao
Venue: Proceedings of the IEEE Workshop on Motion and Video Computing (2007)

Gabor filter response is widely used in many computer vision applications for its effectiveness in representing local image details. The major drawback of Gabor features is the high computation cost involved in the convolution between the image and the filter bank. This paper presents a method to approximate the Gabor filters as a linear combination of Haar-like features. These features are selected from a large redundant feature pool using a generative feature selection scheme - optimized orthogonal matching pursuit (OOMP). Major advantage of this representation is that the convolution between the image and the approximated Gabor filters can be computed very efficiently using integral image trick. We applied the proposed method to object tracking, promising results are demonstrated.
ISBN 0-7803-8686-8 [Back Cover]
Venue: Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium (2004)

IEEE 802.11 wireless LAN technology is mainly used as an access network within corporate enterprises. All the WLAN access points are eventually connected to a wired backbone to reach the Internet or enterprise computing resources. We aim to expand WLAN into an enterprise-scale backbone network technology by developing a multichannel wireless mesh network architecture called Hyacinth. Hyacinth equips each node with multiple IEEE 802.11a/b NICs and supports distributed channel assignment/routing to increase the overall network throughput. We present the results of a detailed performance evaluation study on the multichannel mesh networking aspect of Hyacinth, based on both NS-2 simulations and empirical measurements collected from a 9-node Hyacinth prototype testbed. A key result of this study is that equipping each node of a Hyacinth network with just 3 NICs can increase the total network bandwidth by a factor of 6 to 7, as compared with single-channel wireless mesh network architecture. 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
Model-Driven HMI Development: Can Meta-CASE Tools do the Job?
Authors: Carsten Bock
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Today metamodeling and domain-specific languages represent many promising beginnings to create non-generic tool support for project specific modeling tasks. Due to the inherent complexity and numerous variants of human-machine interfaces (HMIs) model-driven development becomes increasingly interesting for manufacturers and suppliers in the automobile industry. Particularly, the development of powerful user interfaces requires appropriate development processes as well as easy-to-use software tools. Since suitable tool kits are missing in the field of HMI development this paper describes the utilization of visual domain-specific languages for model-driven useware engineering in general and model-based specification of automotive HMIs in special. Moreover, results from a survey among developers are presented revealing the requirements for HMI specific tool support. Additionally, experiences with using current meta-CASE tools as well as standard office applications for creating a visual domain-specific language are presented. Based on these experiences requirements for future meta-CASE tools are derived.
Scalable content-aware request distribution in cluster-based networks servers
Authors: Mohit Aron, Darren Sanders, Peter Druschel, Willy Zwaenepoel
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

We present a scalable architecture for content-aware request distribution in web server clusters. In this architecture, a level-4 switch acts as the point of contact for the server on the Inernet and distributes the incoming requests to a number of back-end nodes. The switch does not perform any contect-based distribution. This function is performed by each of the back-end nodes, which may forward the incoming request to another back-end based on the requested contect. In terms of scalability, this architecture compares favorably to existing approaches where a front-end node performs contect-based distribution. In our architecture, the expensive operations of TCP connection estabilishment and handoff are distributes among the back-ends, rather than being centralized in the front-end node. Only a minimal additional latency penatly is paid for much improved scalability. We have implemented this new architecture, and we demonstrate its superior scalability by comparing it to a system that performs contect-aware distribution in the front-end, both under synthetic and trace-drive workloads.
Utilization of SECDED for soft error and variation-induced defect tolerance in caches
Authors: Luong D. Hung, Hidetsugu Irie, Masahiro Goshima, Shuichi Sakai
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Combination of SECDED with a redundancy technique can effectively tolerate a high variation-induced defect rate in future processes. However, while a defective cell in a block can be repaired by SECDED, the block becomes vulnerable to soft errors. This paper proposes a technique to deal with the degraded resilience against soft errors. Only clean data can be stored in defective blocks of a cache. This constraint is enforced through selective write-through mechanism. An error occurring in a defective block can be detected and the correct data can be obtained from the lower level caches.
A Bayesian, Exemplar-Based Approach to Hierarchical Shape Matching
Authors: Dariu M. Gavrila
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

This paper presents a novel probabilistic approach to hierarchical, exemplar-based shape matching. No feature correspondence is needed among exemplars, just a suitable pairwise similarity measure. The approach uses a template tree to efficiently represent and match the variety of shape exemplars. The tree is generated offline by a bottom-up clustering approach using stochastic optimization. Online matching involves a simultaneous coarse-to-fine approach over the template tree and over the transformation parameters. The main contribution of this paper is a Bayesian model to estimate the a posteriori probability of the object class, after a certain match at a node of the tree. This model takes into account object scale and saliency and allows for a principled setting of the matching thresholds such that unpromising paths in the tree traversal process are eliminated early on. The proposed approach was tested in a variety of application domains. Here, results are presented on one of the more challenging domains: real-time pedestrian detection from a moving vehicle. A significant speed-up is obtained when comparing the proposed probabilistic matching approach with a manually tuned nonprobabilistic variant, both utilizing the same template tree structure.
Designing your Next Empirical Study on Program Comprehension
Authors: Massimiliano Di Penta, R. E. K. Stirewalt, Eileen Kraemer
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

The field of program comprehension is characterized by both the continuing development of new tools and techniques and the adaptation of existing techniques to address program comprehension needs for new software development and maintenance scenarios. The adoption of these techniques and tools in industry requires proper experimentation to assess the advantages and disadvantages of each technique or tool and to let the practitioners choose the most suitable approach for a specific problem. The objective of this working session is to encourage researchers and practitioners working in the area of program comprehension to join forces to design and carry out studies related to program comprehension, including observational studies, controlled experiments, case studies, surveys, and contests, and to develop standards for describing and carrying out such studies in a way that facilitates replication of data and aggregation of the results of related studies.
A Generalization of Kotzig&rsquo;s Theorem and Its Application
Authors: Richard Cole, Łukasz Kowalik, Riste S&caron;krekovski
Venue: SIAM Journal on Discrete Mathematics (2007)

An edge of a graph is light when the sum of the degrees of its end-vertices is at most 13. The well-known Kotzig theorem states that every 3-connected planar graph contains a light edge. Later, Borodin [J. Reine Angew. Math., 394 (1989), pp. 180-185] extended this result to the class of planar graphs of minimum degree at least 3. We deal with generalizations of these results for planar graphs of minimum degree 2. Borodin, Kostochka, and Woodall [J. Combin. Theory Ser. B, 71 (1997), pp. 184-204] showed that each such graph contains a light edge or a member of two infinite sets of configurations, called 2-alternating cycles and 3-alternators. This implies that planar graphs with maximum degree $\Delta \geq 12$ are $\Delta$-edge-choosable. We prove a similar result with 2-alternating cycles and 3-alternators replaced by five fixed bounded-sized configurations called crowns. This gives another proof of $\Delta$-edge-choosability of planar graphs with $\Delta \geq 12$. However, we show efficient choosability; i.e., we describe a linear-time algorithm for $\max\{\Delta,12\}$-edge-list-coloring planar graphs. This extends the result of Chrobak and Yung [J. Algorithms, 10 (1989), pp. 35-51].
Low-power visual pattern classification in analog vlsi
Authors: Chris Diorio
Venue:  (2006)

Today's mobile devices---cell phones, hand-held computers, sensor networks, etc.---require large amounts of computational power to realize applications such as adaptive filtering, noise cancellation, activity recognition, biometric identification, and robotic control. The addition of cameras to many of these devices further increases this computational load by adding image processing tasks. Unfortunately, the general-purpose digital microcontrollers on which these devices compute consume tens or hundreds of milliwatts---power levels that limit battery operation to several days. This thesis seeks to reduce the power and area consumption of these algorithms by employing analog and mixed-signal circuits that compute continuously-valued quantities using transistor physics. This thesis makes the following contributions. First, I present a reconfigurable silicon learning array with on-chip learning for implementing adaptive feed-forward networks in silicon. Built from an array of homogeneous, synapse-transistor-based programmable learning blocks (PLBs), this system can implement a variety of algorithms including Radial Basis Function neural networks, mixture models, and linear perceptions. I present results from a prototype chip that consumes only 15uW per PLB from a 5V supply. Second, I present the architecture of a digitally-programmable, high-dynamic-range CMOS imager that computes real-time linear projections using analog circuit techniques. I can readily combine this imager with the reconfigurable learning array to compose a complete hardware learning system. I present results from a prototype of the imager that consumes 1mW from a 5V supply while performing about 1 billion operations per second (1GOPS). This power/performance level is 2 to 3 orders of magnitude better than comparable DSP-based systems.
Face recognition through mismatch driven representations of the face
Authors: S. Lucey, Tsuhan Chen
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

Performance of face verification systems can be adversely affected by a number of different mismatches (e.g. illumination, expression, alignment, etc.) between gallery and probe images. In this paper, we demonstrate that representations of the face used during the verification process should be driven by their sensitivity to these mismatches. Two representation categories of the face are proposed, parts and reflectance, each motivated by their own properties of invariance and sensitivity to different types of mismatches (i.e. spatial and spectral). We additionally demonstrate that the employment of the sum rule gives approximately equivalent performance to more exotic combination strategies based on support vector machine (SVM) classifiers, without the need for training on a tuning set. Improved performance is demonstrated, with a reduction in false reject rate of over 30% when compared to the single representation algorithm. Experiments were conducted on a subset of the challenging face recognition grand challenge (FRGC) v1.0 dataset.
Performance Analysis of Various Techniques Applied in Human Identification Using Dental X-Rays
Authors: A. Banumathi, B. Vijayakumari, A. Geetha, N. Shanmugavadivu, S. Raju
Venue: Journal of Medical Systems (2007)

This paper proposes a novel approach for automating the analysis of identifying the person based on their ante mortem and postmortem reports. This approach involves three techniques (i.e.) morphological contour detector, Gaussian filtering and an existing semi-automatic contour extraction method. Forensic dentistry involves the identification of people based on their dental records, mainly available as radiograph images. Our goal is to automate this process using image processing and pattern recognition techniques. Given a postmortem radiograph, we search a database of antemortem radiographs in order to retrieve the closest match with respect to some salient features. In this paper, we use the contours of the teeth as the feature for matching. The algorithm completes the task in three steps: radiograph segmentation, pixel classification and contour matching. In this paper a hit rate of 0.7 is achieved by the Morphological contour detectors which are comparable with the other two methods.
Nondeterministic Multithreading
Authors: P. Leadbitter, D. Page, N. P. Smart
Venue: IEEE Transactions on Computers (2007)

The physical security of application-specific embedded processors such as those found in smart-cards has become increasingly important since they are used more and more as conduits for sensitive financial and identity information. The advent of side-channel attacks has meant that a combination of algorithm, software, and hardware defense is required. In this paper, we reexamine the issue of nondeterministic processors, simplifying previous designs using a multithreaded architecture. From this simplification, we are able to construct a formally reasoned assessment of the security level offered by such a device.
A logic-based semantic approach to recognizing textual entailment
Authors: Marta Tatu, Dan Moldovan
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

This paper proposes a knowledge representation model and a logic proving setting with axioms on demand successfully used for recognizing textual entailments. It also details a lexical inference system which boosts the performance of the deep semantic oriented approach on the RTE data. The linear combination of two slightly different logical systems with the third lexical inference system achieves 73.75% accuracy on the RTE 2006 data.
Freshman design projects: lessons learned in engineering coalitions
Authors: D. Sathianathan
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

Summary form only given. NSF established the Engineering Education Coalition programs for the purpose of creating systemic changes in engineering education. Coalitions are groups of institutions of higher learning who work collaboratively to achieve their coalition's mission. The first Coalition program was established in 1990. There are now eight Engineering Education Coalitions representing some 59 Universities (roughly 20% of all of the undergraduates institutions in the United States). Most coalitions have developed freshman design projects to increase the interest of new engineering students and to begin integration of design across the curriculum. These activities are a multi-week project approach, where students are engaged in experimental learning. The projects require that the members of the team must work together to complete the task. The multi-week projects dominate the course and the project theme motivates both the fixed and the flexible content covered during the course.
A multistep linear prediction approach to blind asynchronous CDMA channel estimation and equalization
Authors: Tong-Tong Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

A multistep linear prediction approach is presented for blind channel estimation and detection of asynchronous short-code DS-CDMA (direct sequence code division multiple access) signals in multipath channels. Only the spreading code of the desired user is assumed to be known; its transmission delay may be unknown. We exploit the previously proposed multistep linear prediction (MSLP) approach for blind multiple-input multiple-output (MIMO) channel estimation in conjunction with the structure imposed by the desired user's spreading code sequence. With the knowledge of the desired user's code sequence, only the second-order statistics of the data are needed under certain sufficient conditions on the underlying multiuser MIMO transfer function. An illustrative simulation example is provided.
Yield analysis via induction of process statistics into the design of MEMS and other microsystems
Authors: Shyam Praveen Vudathu, Kishore Kumar Duganapalli, Rainer Laur, Dorota Kubali&#x0144;ska, Angelika Bunse-Gerstner
Venue: Microsystem Technologies (2007)

This paper presents an emerging theory on the effects of unavoidable process variations during the fabrication of MEMS and other microsystems. The effects of parametric variations on device performance and design yield of the microsystems devices are analyzed and presented. A novel methodology in the design cycle of MEMS and other microsystems is introduced. The methodology is based on the concept of worst-case analysis having colossal advantages to offer. This paper describes some steps of this methodology with elaborated results. Also described in this paper is how each step contributes to counteract the effects produced by the parametric variations in the product cycle of microsystems.
Dynamic programming search techniques for across-word modelling in speech recognition
Authors: K. Beulen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

We describe the integration of across-word models in the RWTH large vocabulary continuous speech recognition system, where our main focus is on the realization of the acoustic recognition process. This paper presents a study of two search methods based on the principle of dynamic programming. For both methods we discuss the implementation details and give experimental results on the Verbmobil and on the Wall Street Journal data. In addition, we introduce a score interpolation of within-word and across-word models for both search methods. In combination with across-word models this interpolation technique gives an improvement of the recognition accuracy by 14% relative to our standard system.
New Frontiers of Reverse Engineering
Authors: Gerardo CanforaHarman, Massimiliano Di Penta
Venue: 2007 Future of Software Engineering (2007)

Comprehending and modifying software is at the heart of many software engineering tasks, and this explains the growing interest that software reverse engineering has gained in the last 20 years. Broadly speaking, reverse engineering is the process of analyzing a subject system to create representations of the system at a higher level of abstraction. This paper briefly presents an overview of the field of reverse engineering, reviews main achievements and areas of application, and highlights key open research issues for the future.
Sequential Monte Carlo sampling detector for Rayleigh fast-fading channels
Authors: J. H. Kotecha
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

Detection of symbols transmitted over a frequency flat Rayleigh fast-fading channel is considered. This problem can be modeled as a dynamic state space model. A novel method for channel estimation and detection of transmitted data is presented based on the Monte Carlo sampling filter methodology. The channel fading coefficients and transmitted variables are treated as hidden variables. The channel coefficients are modeled as an autoregressive (AR) process. Particles (samples) of hidden variables are sequentially generated from the so called importance sampling density based on past observations. These are then propagated and weighted according to the required conditional posterior distribution. The particles along with their weights provide an estimate of the hidden variables. It can be seen through the simulations that the performance of this detector is comparable to the matched filter with known channel fading coefficients. Moreover, the Gaussian noise assumption in the noisy channel can be easily relaxed and a solution provided by the same methodology.