ppxscal/embedding_network huggingface dataset:
An Approach to Identify Unique Styles in Online Handwriting Recognition
Authors: A. Bharath, V. Deepu, Sriganesh Madhvanath
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

We describe a method for identifying different writing styles of online handwritten characters based on clustering. The motivation of this experiment is to develop automatic characterization of different writing styles that arise due to variation in stroke number or stroke ordering. An ef- ficient agglomerative hierarchical clustering technique with the nearest neighbor approach was implemented to cluster strokes. The results obtained from our experiment indicate that the resulting prototypes are unique and essentially capture different writing styles.
Federated Exploitation of All-Source Imagery
Authors: D. M. Booth, N. J. Redding, R. Jones, M. Smith, I. J. Lucas, K. L. Jones
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

This paper deals with the provision of cueing aids for Imagery Analysts (IAs) who may need to integrate many types of imagery, intelligence, collateral data, and military doctrine to be effective. This task is becoming increasingly difficultas the volume and diversity of inputs increases and as adversaries become more sophisticated technologically. We outline the issues (particularly that of interoperability with other systems) that have influenced the development and use of our reconfigurable analysts' exploitation infrastructure. At the centre is The Analysts' Detection Support System (ADSS) which provides a flexible processing engine for sensor data. We describe ADSS, some of its current functionality, and it's context and use within a federated exploitation regime. Examples of it's use in wide-area search and surveillance applications are outlined.
CRM Systems Used for Targeting Market: A Case at Cisco Systems
Authors: Rahul Bhaskar, Yi Zhang
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

One of the most significant changes in the practice of marketing during the last decade is the shift in emphasis from a transaction orientation customer interaction to the customer relationship management (CRM). However, in large organizations, it is not very easy to collect, collate, and transform the customer data necessary for creating systems to support Customer Relationship Management as the basis of the enterprise-wide customer relationship strategy. There are many reasons for this difficulty, including organizational structure and the resulting complexity in the enterprise systems. In this paper, we use the example of Cisco Systems Inc. to demonstrate how to build an effective customer relationship management system that integrates with the organization processes to help an enterprise recognize more targeted market. The new CRM system helps Cisco integrate all customers' data in a single data repository to support quantifiable and measurable needs of 'knowledge marketing' functions. It led to new marketing processes that are more effective and efficient. The experience in Cisco allows us to identify successful design practices and develop recommendations for organizations that are interested in deploying a similar system.
Virtual Software Engineering Laboratories in Support of Trade-off Analyses
Authors: Jürgen Münch, Dietmar Pfahl, Ioana Rus
Venue: Software Quality Control (2005)

Due to demanding customer needs and evolving technology, software organizations are forced to trade individual functional and non-functional product quality profiles against other factors such as cost, time, or productivity. The ability to influence or even control these factors requires a deep understanding of the complex relations between process and product attributes in relevant contexts. Based on such understanding, decision support is needed to adjust processes so that they match the product quality goals without violating given project constraints. We propose to use a Virtual Software Engineering Laboratory (VSEL) to establish such decision support cost-effectively. VSELs can be considered as being complementary to existing (empirical) Software Engineering Laboratories. This paper gives an introduction into the cornerstones of VSELs, discusses how they complement traditional empirically based Software Engineering Laboratories (SELs), and illustrates with the help of case examples from industrial and research environments, how to use them in support of product-focused trade-off analyses.
Adaptive Power control Algorithm for Ad Hoc NetworksWith Short and Long Term Packet Correlations
Authors: Jun Zhang, Zuyuan Fang, Brahim Bensaou
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Power control is often invoked in mobile ad hoc networks to achieve one of two popular goals: i) increasing network throughput by mitigating the effects of mutual interference of nodes or; ii) ensuring minimal power consumption. This paper proposes a new adaptive power control algorithm for ad hoc networks to save energy while maintaining a similar throughput as that achieved by the IEEE802.11 MAC protocol. The contributions of this proposed scheme are two fold. First, we define and invoke the concept of MAC packet delivery curve to guide the power control algorithm in the adaptation decision under different possible scenarios. In particular when choosing among different service profiles the packet curve can tell which is better in the long term. Secondly, the power control algorithm takes into consideration the short term correlations between transmit powers of RTS/CTS frames and those of DATA/ACKs frames, to ensure robustness.
Wireless Sensor Network Implementation for Industrial Linear Position Metering
Authors: Mikko Kohvakka, Marko Hannikainen, Timo D. Hamalainen
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

This paper presents the design and performance measurements of a prototype Wireless Sensor Network (WSN) for industrial linear position metering. Design includes two different prototype platforms and a user application. Prototypes combine energy efficient commercial off-the-shelf components including a 2.4 GHz radio, and the custom TUTWSN communication protocols resulting high robustness, autonomous operation and very low power consumption. The user application displays sensor data graphically and enables further data analysis. Measurements contain component power analysis and prototype performance measurements. The measurements indicate 200 µW to 400 µW average node power consumption, as 16-bit sample is measured with 1 Hz sample rate, and routed to a WSN gateway with 1 s latency per hop and 512 bps throughput between nodes. Predicted lifetime of implemented WSN is 2 months with a small rechargeable battery or over 2 years with two AA batteries.
Gate dielectrics on compound semiconductors
Authors: R. Droopad, M. Passlack, N. England, K. Rajagopalan, J. Abrokwah, A. Kummel
Venue: Microelectronic Engineering (2005)

article-33-abstract
Fingerprint Warping Using Ridge Curve Correspondences
Authors: Arun Ross, Sarat C. Dass Anil K. Jain
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

The performance of a fingerprint matching system is affected by the nonlinear deformation introduced in the fingerprint impression during image acquisition. This nonlinear deformation causes fingerprint features such as minutiae points and ridge curves to be distorted in a complex manner. A technique is presented to estimate the nonlinear distortion in fingerprint pairs based on ridge curve correspondences. The nonlinear distortion, represented using the thin-plate spline (TPS) function, aids in the estimation of an "average” deformation model for a specific finger when several impressions of that finger are available. The estimated average deformation is then utilized to distort the template fingerprint prior to matching it with an input fingerprint. The proposed deformation model based on ridge curves leads to a better alignment of two fingerprint images compared to a deformation model based on minutiae patterns. An index of deformation is proposed for selecting the "optimal” deformation model arising from multiple impressions associated with a finger. Results based on experimental data consisting of 1,600 fingerprints corresponding to 50 different fingers collected over a period of two weeks show that incorporating the proposed deformation model results in an improvement in the matching performance.
Fault Tolerant Scheduling for Fixed-Priority Tasks with Preemption Threshold
Authors: Lei Wang, Zhaohui Wu, Mingde Zhao, Guoqing Yang
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Fixed-priority with preemption threshold (FPPT) is an important form of real-time scheduling algorithm, which fills the gap between fixed-priority preemptive (FPP) and fixed-priority non-preemptive (FPNP). However, this scheduling scheme together with the requirements of fault tolerance makes the prediction of a real-time system¿s behaviors more difficult than traditional scheduling scheme. The major contribution of this work is twofold. First, we present an appropriate schedulability analysis, based on response time analysis, for supporting fault-tolerant FPPT scheduling in hard real-time systems. The error-recovery techniques are considered to be used to carry out fault tolerance. Second, we propose the optimal priority assignment algorithm which can be used, together with the schedulability analysis, to improve system fault resilience.
Mining Sequential Association-Rule for Improving WEB Document Prediction
Authors: Yong Wang, Zhanhuai Li, Yang Zhang
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

Currently, researchers have proposed several sequential association-rule models for predicting the next HTTP request. These researches focus on using sequence and temporal constrains for pruning to improve prediction precision. In this paper, we provide a comparative study on different kinds of sequential association rules for web document prediction. Firstly, we give algorithms on mining sequential association rules, which is based on different sequence and temporal constrains combination. Then, the performance of all such algorithms has been compared on a real web log dataset. Based on the comparison, by the method of variance analysis, we explore the effect of sequence and temporal information on influencing the precision of prediction. We show that the sequence constrains, the temporal constrains and the interaction between these two constrains can affect the precision of prediction. Furthermore, temporal constrains can affect more than sequence constrains. These results show light on the future research on improving the precisions of prediction.
Band Controllability and Observability Tests
Authors: M. Sh. Misrikhanov
Venue: Automation and Remote Control (2005)

New controllability and observability tests for linear stationary dynamic systems are derived in the form of special banded matrices. Band tests aid in determining the conditionality of rank controllability and observability tests.
Performance analysis of Bluetooth piconets with finite baseband buffers: Research Articles
Authors: Jelena Mišić, Vojislav B. Mišić
Venue: Wireless Communications Mobile Computing (2005)

We analyze the performance of Bluetooth piconets under bursty traffic and finite buffer sizes. We model the joint probability distributions of uplink and downlink queues using the M[x]&#x002F;G&#x002F;1&#x002F;K model with vacations and derive buffer blocking probabilities at slaves and at the master. The results, which are confirmed through simulations, provide some practical guidelines as to the sizing of device buffers. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Diagnostic Rules Induced by an Ensemble Method for Childhood Leukemia
Authors: Jinyan Li, Huiqing Liu, Ling Li
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

We introduce a new ensemble method based on decision tree to discover significant and diversified rules for subtype classification of childhood acute lymphoblastic leukemia, a heterogeneous disease with individual subtypes differing in their response to chemotherapy. Our approach simply uses each of top-ranked features as root node to build up different trees in the ensemble. Since these trees are all generated from original training samples, rules derived by our algorithm are true and reliable. This is a characteristic of our method contrast to state-of-the-art methods such as Bagging, Boosting and Random Forest which may produce false rules. Experimental results on a large gene expression profilingdata set of childhood leukemia patients demonstrate that our proposed method is not only superior to other classifiers' performance, but also can identify a small subset of genes for biomarker analysis.
Automatic Query Refinement Using Mined Semantic Relations
Authors: Jens Graupmann, Jun Cai, Ralf Schenkel
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

With the Web of today being unstructured and semantically heterogeneous, keyword-based queries are likely to miss important results. Therefore, refining and expanding queries plays an important role today. This paper presents a novel approach for query expansion that applies dependency rules mined from a large Web crawl, combining several existing techniques for data extraction and mining. Additionally, the rules help binding keyword queries to the input fields of forms on Web portals, opening up the tremendous resources of the HiddenWeb. Preliminary, yet convincing experiments from a restricted application domain indicate the viability of our approach.
An electric fence for kernel buffers
Authors: Nikolai Joukov, Aditya Kashyap, Gopalan Sivathanu, Erez Zadok
Venue: Proceedings of the 2005 ACM workshop on Storage security and survivability (2005)

Improper access of data buffers is one of the most common errors in programs written in assembler, C, C++, and several other languages. Existing programs and OSs frequently access the data beyond the allocated buffers or access buffers that were already freed. Such programs and OSs may run for years before their problems can be detected because improper memory accesses frequently result in a silent data corruption. Not surprisingly, most computer worms exploit buffer overflow errors to gain complete control over computer systems. Only after recent worm epidemics, did code developers begin to realize the scale of the problem and the number of potential memory-access violations in existing code.Due to the syntax and flexibility of many programming languages, memory access violation problems cannot be detected at compile time. Tools that verify correctness before every memory access impose unacceptably high overheads. As a result, most of the developed techniques focus on preventing the hijacking of control by hackers and worms due to stack overflows. Consequently, hidden data corruption is given less attention.Memory access violations can be efficiently detected using the hardware support of the paging and virtual memory.Kefence is the general run-time solution we developed that allows to detect and avoid in-kernel overflow, underflow, and stale access problems for internal kernel buffers. Kefence is especially applicable to file system code because file systems operate at a high level of abstraction and require no direct access to the physical memory. At the same time, file systems use a large number of kernel buffers and file system errors are most harmful for users because users' persistent data can be corrupted.
Understanding and Comparing the Performance of Optimized JVMs
Authors: Dan Nicolaescu, Alex Veidenbaum
Venue: Proceedings of the Innovative Architecture on Future Generation High-Performance Processors and Systems (2005)

Java virtual machines have different performance characteristics depending on their interpretation and Just in Time Compilation strategies. These characteristics are even more complex when running on a modern Out-Of-Order superscalar processor. This paper analyzes the behavior of the SPECjvm98 benchmarks on IBM's JikesRVM Java Virtual Machine executing on the IBM Power4 Processor. Execution time parameters such as the number of instructions and cycles, the behavior of instruction and data caches, and the branching characteristics obtained from hardware performance counters are used to explain performance differences between interpreted, JIT compiled and dynamically optimized JVMs. Our goal is to understand benchmark and processor behavior with different JIT optimization options and strategies and to use this knowledge in design of future JVMs. The results show that the reduction in the number of executed instructions due to compiler optimizations is the main reason for improved performance. An increase in instruction level parallelism in compiled code provides further improvement. The increased ILP is in large part due to elimination of dependences in the optimized code.
Robust A Posteriori Error Estimates for Nonstationary Convection-Diffusion Equations
Authors: R. Verfürth
Venue: SIAM Journal on Numerical Analysis (2005)

We consider discretizations of convection dominated nonstationary convection-diffusion equations by A-stable $\theta$-schemes in time and conforming finite elements in space on locally refined, isotropic meshes. For these discretizations we derive a residual a posteriori error estimator. The estimator yields upper bounds on the error which are global in space and time and lower bounds that are global in space and local in time. The error estimates are fully robust in the sense that the ratio between upper and lower bounds is uniformly bounded in time, does not depend on any step-size in space or time nor on any relation between these both, and is uniformly bounded with respect to the size of the convection. Moreover, the estimates are uniform with respect to the size of the zero-order reaction term and also hold for the limit case of vanishing reaction.
Review of "Systems Analysis and Simulation In Ecology, by Bernard C. Patten", Academic Press, 1972
Venue: ACM SIGSIM Simulation Digest (1976)

This is a multi-volume series with Volume II (currently reviewed) containing chapters which describe applications of selected dynamic analsysis (sensitivity analysis and frequency response), as well as ecological systems theory and an extensive section of specific applications. 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
Energy Awareness and Uncertainty in Microarchitecture-Level Design
Authors: Diana Marculescu, Emil Talpes
Venue: IEEE Micro (2005)

The authors present microarchitecture-level statistical models for characterizing process and system parameter variability, concentrating on gate length and on-chip temperature variations. To assess the effect of microarchitecture decisions on these variations, and vice versa, they propose a joint performance, power, and variability metric that distinguishes among various design choices.
Adaptive middleware for dynamic component-level deployment
Authors: Mick Jordan, Christopher Stewart
Venue: Proceedings of the 4th workshop on Reflective and adaptive middleware systems (2005)

Utility hosting centers can reduce resource consumption by optimally distributing and load balancing their client's application components. However, current state-of-the-art middleware systems either rely on the application to deploy itself, and/or provide the hosting center with course-grained and static deployment mechanisms. In this paper, we present our adaptive middleware system and API that allows the hosting-center to dynamically exchange component-level deployment generators for all hosted applications. To demonstrate our system's capabilities, we provide experimental results on the speed and effectiveness of dynamic deployment strategies.
Curriculum development related to information security policies and procedures
Authors: Allyson Mader, S. Srinivasan
Venue: Proceedings of the 2nd annual conference on Information security curriculum development (2005)

Policies and procedures communicate and control access to information assets and other resources. Developing effective policies and procedures involves understanding the environment within which one is working. They should encompass multiple layers. The level of trust needed for various levels of the organization must be determined. Policies are developed for accomplishing the business objectives and the procedures then support how they will be enforced. Internal control is established through design of sound policies and procedures. Also discussed are concepts such as risk assessment, risk control, disaster recovery and business continuity. This paper describes these important topics that would be covered in an information security policies course.
An aspect-oriented ambient intelligence middleware platform
Authors: Lidia Fuentes, Daniel Jiménez
Venue: Proceedings of the 3rd international workshop on Middleware for pervasive and ad-hoc computing (2005)

Currently, the interest in Ambient Intelligence (or AmI) has increased exponentially due to the widespread use of portable devices. Users demand more and more functionality from these devices, especially in order to perform collaborative tasks and interchange information. As a result, this technology proposes new challenges that must be addressed by both the hardware manufacturers and Software Engineers. The first challenge is to provide a middleware platform providing specific AmI services like communication or device discovery and able to cope with several challenges posed by AmI applications. One of these challenges is to manage heterogeneity of devices that are present in AmI environments in a transparent way, and in particular to manage the evolution of such devices without breaking the code of already developed applications. Moreover, an AmI middleware platform has to support the evolution of the software architecture of AmI applications over time, making it possible to add new functionalities, to adapt applications to any technological changes, and to produce a product line of AmI platforms to be executed in different devices. A final challenge is that the middleware platform has to support the adaptation of AmI applications to unexpected and dynamic changes in AmI environments. Aspect Oriented Programming (AOP) provides good and advanced solutions to the evolution management problem at different levels, so our work focuses on applying AOP to develop an AmI platform. In this paper, we will discuss these problems, propose solutions and present how these problems are handled in our AmI aspect-oriented platform named AOPAmI. This paper describes the internal platform structure and how it provides support to AmI devices. We will focus on the dynamic nature of AmI applications and on how to solve the above mentioned problems.
Hermes: LUT FPGA technology mapping algorithm for area minimization with optimum depth
Authors: M. Teslenko, E. Dubrova
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

This work presents Hermes, a depth-optimal LUT based FPGA mapping algorithm. The presented algorithm is based on a new strategy for finding LUTs allowing to find a good LUT in a significantly shorter time compared to the previous methods. The quality of results is improved by enabling LUT re-implementation and by introducing a cost function which encourages input sharing among LUTs. The experimental results show that, on average, the presented algorithm computes 15.5% and 3.5% smaller LUT mappings compared to the ones obtained by FlowMap and CutMap, respectively, using two orders of magnitude less CPU time. The speed of Hermes makes it suitable for running in an incremental manner during logic synthesis.