ppxscal/embedding_network huggingface dataset:
A Run-Time Re-configurable Parametric Architecture for Local Neighborhood Image Processing
Authors: Reid B. Porter, Jan R. Frigo, Maya Gokhale, C. Wolinski, F. Charot, C. Wagner
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

We propose a run-time re-configurable parametric architecture (Fabric) for local neighborhood image processing. The proposed architecture is composed of polymorphous cells where each cell accesses neighborhood data from a local cell memory, and executes a neighborhood function sequentially. The architecture is flexible since different neighborhood functions can be implemented by rewriting a cell's software micro-code. High throughput is achieved because many cells execute concurrently. We show that for a satellite image feature extraction application, our architecture, implemented on Stratix II and Virtex 2 Field Programmable Gate Arrays, achieves similar performance, hardware resource utilization, and throughput as a fully pipelined systolic array architecture, yet offers improved flexibility to the developer. We compare and contrast these two architectures for their usability to the image processing community.
Class Noise Handling for Effective Cost-Sensitive Learning by Cost-Guided Iterative Classification Filtering
Authors: Xingquan Zhu, Xindong Wu
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

Recent research in machine learning, data mining, and related areas has produced a wide variety of algorithms for cost-sensitive (CS) classification, where instead of maximizing the classification accuracy, minimizing the misclassification cost becomes the objective. These methods often assume that their input is quality data without conflict or erroneous values, or the noise impact is trivial, which is seldom the case in real-world environments. In this paper, we propose a Cost-guided Iterative Classification Filter (CICF) to identify noise for effective CS learning. Instead of putting equal weights on handling noise in all classes in existing efforts, CICF puts more emphasis on expensive classes, which makes it attractive in dealing with data sets with a large cost-ratio. Experimental results and comparative studies indicate that the existence of noise may seriously corrupt the performance of the underlying CS learners and by adopting the proposed CICF algorithm, we can significantly reduce the misclassification cost of a CS classifier in noisy environments.
Design for Testability of Software-Based Self-Test for Processors
Authors: Masato Nakazato, Satoshi Ohtake, Michiko Inoue, Hideo Fujiwara
Venue: Proceedings of the 15th Asian Test Symposium (2006)

In this paper, we propose a design for testability method for test programs of software-based self-test using test program templates. Software-based selftest using templates has a problem of error masking where some faults detected in a test generation for a module are not detected by the test program synthesized from the test. The proposed method achieves 100% template level fault efficiency in a sense that the proposed method completely resolves the problem of error masking. Moreover, the proposed method adds only observation points to the original design, and it enables at-speed testing and does not induce delay overhead.
Understanding Effects and Determinants of Mobile Support Tools: A Usability-Centered Field Study on IT Service Technicians
Authors: Key Pousttchi, Bettina Thurnher
Venue: Proceedings of the International Conference on Mobile Business (2006)

The integration of mobile workplaces is a major challenge for companies. First-wave mobile solutions mostly support existing business processes through adding value in terms of increased efficiency. Second-wave mobile solutions comprise a re-engineering of the mobile business processes, add value through increased effectiveness and may even enable new forms of mobility. In order to achieve a systematic approach to mobile integrated business processes it is important to analyze existing processes, focusing on the effects and determinants of mobile solutions that might be used to support those processes. For this purpose we examined a typical example, the field technician support process of an IT service providing company. Our research approach combines usability and process performance issues. The results show which tasks are suitable for mobile application support, which personnel is most likely to benefit from mobile technology and what improvements on business metrics such as labor time, back office capacity, and invoice cycle are to be expected.
RADIC: a generic component for the integration of existing reactive and deliberative layers
Authors: Matthias Scheutz, James Kramer
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Hybrid architectures have been developed to preserve the responsiveness of reactive layers while also providing the benefits of higher level deliberative capabilities. The challenge of hybrid architecture design is to integrate layers of very different functional roles. We propose a component, called RADIC, that uses a generic technique for the construction of hybrid architectures from pre-existing reactive and deliberative layers that requires only minimal modifications to each layer. In particular, we give a high-level description of the operation and benefits of the component and its algorithms.
Total Variation Models for Variable Lighting Face Recognition
Authors: Terrence Chen, Wotao Yin Xiang Sean Zhou, Dorin Comaniciu, Thomas S. Huang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

In this paper, we present the logarithmic total variation (LTV) model for face recognition under varying illumination, including natural lighting conditions, where we rarely know the strength, direction, or number of light sources. The proposed LTV model has the ability to factorize a single face image and obtain the illumination invariant facial structure, which is then used for face recognition. Our model is inspired by the SQI model but has better edge-preserving ability and simpler parameter selection. The merit of this model is that neither does it require any lighting assumption nor does it need any training. The LTV model reaches very high recognition rates in the tests using both Yale and CMU PIE face databases as well as a face database containing 765 subjects under outdoor lighting conditions.
A Comparison of Single and Multi-Class Classifiers for Facial Expression Classification
Authors: Nectarios Rose
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

This paper compares various Kernel, Neural Network and statistical approaches for the task of novel facial classification. In addition to multi-class classifiers, it explores the use of the single-class methods known as autoassociators, including the recently proposed Kernel Autoassociator which reconstructs feature vectors from Kernel feature space to input space. Comparisons are made using feature vectors composed of image pixel values, as well as image points convolved with Gabor filters. Results show an advantage to using multi-class methods, with Linear Disriminant Analysis and Kernel based approaches providing the best results.
On the Complexity of Design in Imaging Software
Authors: Magnus E. Larsson, Phillip A. Laplante
Venue: Proceedings of the 11th IEEE International Conference on Engineering of Complex Computer Systems (2006)

Recent evidence raised the possibility that algorithm rich software, such as in imaging processing, is more complex than other kinds (Sangwan, 2005). To further investigate this contention a set of complexity metrics were computed for two sets of open source Java software systems. The results suggest that there is little or no difference in software complexity between an imaging application, and "conventional" software, such as a simple database querying system. The tests suggest that the overall complexity of the system depends more on the software design knowledge of the engineers than the kind of system that is constructed.
On the impossibility of building secure cliques-type authenticated group key agreement protocols
Authors: Olivier Pereira, Jean-Jacques Quisquater
Venue: Journal of Computer Security (2006)

The A-GDH.2 and SA-GDH.2 authenticated group key agreement protocols showed to be flawed in 2001. Even though the corresponding attacks (or some variants of them) have been rediscovered in several different frameworks, no fixed version of these protocols has been proposed until now.In this paper, we prove that it is in fact impossible to design a scalable authenticated group key agreement protocol based on the same design assumptions as the A-GDH ones. We proceed by providing a systematic way to derive an attack against any A-GDH-type protocol with at least four participants and exhibit protocols with two and three participants which we cannot break using our technique. As far as we know, this is the first generic insecurity result reported in the literature concerning authentication protocols.
Zone Services - An Approach for Location-Based Data Collection
Authors: Diana Weiss, Isabelle Kramer, Georg Treu, Axel Kupper
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

Classical Location-based Services (LBSs) automatically derive the current location of known persons in order to select, compile, or filter location-dependent information and present it to their users. Zone services work the other way round: they estimate the amount of persons which are located in a given geographic zone and optionally obtain personal information from them in order to compile statistical information like the number of persons staying in a zone, their average age, and marital status. Zone services address a broad field of applications, ranging from emergency services to mobile marketing and research. This paper presents an approach for realizing such services by using broadcast technologies in combination with terminal-based positioning like GPS. Because data collected in this way always runs the risk of being misused, the paper also presents a framework that allows observed persons to define and enforce their privacy preferences.
Improved Three-step Phase Shifting Profilometry Using Digital Fringe Pattern Projection
Authors: Yingsong Hu, Jiangtao Xi, Joe Chicharo, Zongkai Yang
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

In this paper, an improved method for three-step phase shifting profilometry (PSP) is presented to eliminate the errors introduced by the second order harmonic when digital projection are used to generate fringe patterns. Firstly, the error caused by the second order harmonic is theoretically analyzed. Then based on the error analysis and principle of PSP, we propose a novel approach, called improved threestep phase shifting profilometry (I3PSP), to eliminate the influence of the second order harmonic. Finally, simulations are performed to verify the effectiveness of the proposed I3PSP, which demonstrate that the reconstruction accuracy of using three-step PSP has been significantly improved by the proposed I3PSP.
Fast Human Detection Using a Cascade of Histograms of Oriented Gradients
Authors: Qiang Zhu, Mei-Chen Yeh, Kwang-Ting Cheng, Shai Avidan
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We integrate the cascade-of-rejectors approach with the Histograms of Oriented Gradients (HoG) features to achieve a fast and accurate human detection system. The features used in our system are HoGs of variable-size blocks that capture salient features of humans automatically. Using AdaBoost for feature selection, we identify the appropriate set of blocks, from a large set of possible blocks. In our system, we use the integral image representation and a rejection cascade which significantly speed up the computation. For a 320 × 280 image, the system can process 5 to 30 frames per second depending on the density in which we scan the image, while maintaining an accuracy level similar to existing methods.
Boosting Kernel Models for Regression
Authors: Ping Sun, Xin Yao
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

This paper proposes a general boosting framework for combining multiple kernel models in the context of both classification and regression problems. Our main approach is built on the idea of gradient boosting together with a new regularization scheme and aims at reducing the cubic com- plexity of training kernel models. We focus mainly on using the proposed boosting framework to combine kernel ridge regression (KRR) models for regression tasks. Numerical experiments on four large-scale data sets have shown that boosting multiple small KRR models is superior to training a single large KRR model on both improving generalization performance and reducing computational requirements.
Visualization of Temporal-Oriented Datasets
Authors: Jun Gao, Peter Revesz
Venue: Proceedings of the conference on Geometric Modeling and Imaging: New Trends (2006)

Visualization and interpolation naturally go together and strengthen each other. The paper presents an interpolation method as a pre-processing tool to generate the missing data to be visualized. The method is applied in election prediction, a typical temporal-oriented spatiotemporal dataset. The experimental results demonstrate the ability of the methods to accurately predict the presidential election.
A Strategy to Reduce Control Packet Load of MANETs with Bidirectional Links using DSR
Authors: Tamilarasi M, Palanivelu T.G
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

High overhead is a limiting factor of Dynamic Source Routing(DSR) protocol applied for mobile ad hoc networks(MANETs).In this paper, a modification is proposed for basic DSR to enhance its performance. In the modified- DSR(MDSR), for a source destination pair, the destination responds to the first received route request packet(RREQ) with a route reply packet(RREP), and the subsequently received RREQs bearing same sequence number are responded only if the hop count is less than that of all the previously received RREQs. The performance of MDSR has been compared with that of basic DSR and simulation results show that MDSR reduces the overhead and the number of control packets.
ADI Method: domain decomposition
Authors: Younbae Jun, Tsun-Zee Mai
Venue: Applied Numerical Mathematics (2006)

A domain decomposition algorithm which is based on an implicit prediction and fully implicit scheme for the interior values, for solving parabolic partial differential equations, is presented. It is shown that this algorithm without the correction procedure is unconditionally stable. The modified ADI algorithm is deduced from this algorithm so that the ADI method is considered as the extreme case of the domain decomposition algorithm.
Strong types for relational databases
Authors: Alexandra Silva, Joost Visser
Venue: Proceedings of the 2006 ACM SIGPLAN workshop on Haskell (2006)

Haskell's type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the level of types. This emergent capability has been exploited for instance to model arbitrary-length tuples (heterogeneous lists), extensible records, functions with variable length argument lists, and (homogenous) lists of statically fixed length (vectors).We explain how type-level programming can be exploited to define a strongly-typed model of relational databases and operations on them. In particular, we present a strongly typed embedding of a significant subset of SQL in Haskell. In this model, meta-data is represented by type-level entities that guard the semantic correctness of database operations at compile time.Apart from the standard relational database operations, such as selection and join, we model functional dependencies (among table attributes), normal forms, and operations for database transformation. We show how functional dependency information can be represented at the type level, and can be transported through operations. This means that type inference statically computes functional dependencies on the result from those on the arguments.Our model shows that Haskell can be used to design and prototype typed languages for designing, programming, and transforming relational databases.
Estimating Potential IT Security Losses: An Alternative Quantitative Approach
Authors: Vincent C. S. Lee, Linyi Shao
Venue: IEEE Security and Privacy (2006)

In a highly network-centric open economy, network-based information plays a pivotal role in all business firms and institutional organizations. The authors have developed a novel model for implementing quantitative measurement of possible IT security losses by mining records of port scan data.
Parallel CBIR implementations with load balancing algorithms
Authors: José L. Bosque, Oscar D. Robles, Luis Pastor, Angel Rodríguez
Venue: Journal of Parallel and Distributed Computing (2006)

The purpose of content-based information retrieval (CBIR) systems is to retrieve, from real data stored in a database, information that is relevant to a query. When large volumes of data are considered, as it is very often the case with databases dealing with multimedia data, it may become necessary to look for parallel solutions in order to store and gain access to the available items in an efficient way.Among the range of parallel options available nowadays, clusters stand out as flexible and cost effective solutions, although the fact that they are composed of a number of independent machines makes it easy for them to become heterogeneous. This paper describes a heterogeneous cluster-oriented CBIR implementation. First, the cluster solution is analyzed without load balancing, and then, a new load balancing algorithm for this version of the CBIR system is presented.The load balancing algorithm described here is dynamic, distributed, global and highly scalable. Nodes are monitored through a load index which allows the estimation of their total amount of workload, as well as the global system state. Load balancing operations between pairs of nodes take place whenever a node finishes its job, resulting in a receptor-triggered scheme which minimizes the system's communication overhead. Globally, the CBIR cluster implementation together with the load balancing algorithm can cope effectively with varying degrees of heterogeneity within the cluster; the experiments presented within the paper show the validity of the overall strategy.Together, the CBIR implementation and the load balancing algorithm described in this paper span a new path for performant, cost effective CBIR systems which has not been explored before in the technical literature.
TCP Congestion Window Controlling Algorithms on iSCSI Sequential Read Access
Authors: Machiko Toyoda, Masato Oguchi, Saneyasu Yamaguchi
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

iSCSI is one of the most promising technologies in IPSAN, which decreases a storage management cost. Congestion Window, one of TCP parameters, has a close relationship with system performance in accessing remote storage with iSCSI. In this paper, we propose a dynamic CongestionWindow control method to stabilize the uneven behavior of throughput observed on the iSCSI storage access, and examine the algorithms to make the Congestion Window stabilized as soon as possible in the dynamic Congestion Window control method. We have adopted a linear search method, binary search method, and Congestion Window notification method. These algorithms are implemented on the experimental system and evaluated.
Access control in ad hoc networks with selfish nodes: Research Articles
Authors: Dongmei Zhao
Venue: Wireless Communications Mobile Computing (2006)

We propose an access control scheme for ad hoc networks where nodes compete for transmissions selfishly in order to maximize their own payoffs. A game theory-based model is first formulated and an equilibrium transmission probability is derived based on the total number of competing nodes, packet transmission error probabilities and other parameters. Packet transmission performance, including both transmission throughput and delay, is then analyzed. Our results show that the proposed channel access scheme allows good spatial reuse of the same channel and its saturation throughput can be much higher than the physical transmission rate of the channel under relatively good channel conditions. The mean packet transmission delay can be kept very low (e.g., less than 10 ms) so long as the offered traffic load is below the capacity. The main advantage of this access control scheme is that it allows fair channel access even nodes are selfish and do not corporate with each other in competing for transmissions. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Car Plate Detection Using Cascaded Tree-Style Learner Based on Hybrid Object Features
Authors: Qiang Wu, Huaifeng Zhang, Wenjing Jia, Xiangjian He, Jie Yang, Tom Hintz
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

Car plate detection is a key component in automatic license plate recognition system. This paper adopts an enhanced cascaded tree style learner framework for car plate detection using the hybrid object features including the simple statistical features and Harr-like features. The statistical features are useful for simplifying the process on cascade classifier. The cascaded tree-style detector design will further reduce the false alarm and the false dismissal while retaining a high detection ratio. The experimental results obtained by the proposed algorithm exhibit the encouraging performance.
Agile Principles, Patterns, and Practices in C# (Robert C. Martin)
Authors: Robert C. Martin, Micah Martin
Venue:  (2006)

With the award-winning book Agile Software Development: Principles, Patterns, and Practices, Robert C. Martin helped bring Agile principles to tens of thousands of Java and C++ programmers. Now .NET programmers have a definitive guide to agile methods with this completely updated volume from Robert C. Martin and Micah Martin, Agile Principles, Patterns, and Practices in C#.This book presents a series of case studies illustrating the fundamentals of Agile development and Agile design, and moves quickly from UML models to real C# code. The introductory chapters lay out the basics of the agile movement, while the later chapters show proven techniques in action. The book includes many source code examples that are also available for download from the authors' Web site.Readers will come away from this book understanding Agile principles, and the fourteen practices of Extreme Programming Spiking, splitting, velocity, and planning iterations and releases Test-driven development, test-first design, and acceptance testing Refactoring with unit testing Pair programming Agile design and design smells The five types of UML diagrams and how to use them effectively Object-oriented package design and design patterns How to put all of it together for a real-world projectWhether you are a C# programmer or a Visual Basic or Java programmer learning C#, a software development manager, or a business analyst, Agile Principles, Patterns, and Practices in C# is the first book you should read to understand agile software and how it applies to programming in the .NET Framework.
About a consistent APL notation for structured programming
Authors: Géard A. Langlet
Venue: ACM SIGAPL APL Quote Quad (1996)

For now quite a number of years, I haven't used a label or a branch within the numerous APL functions I programmed for many purposes. So, the colon symbol ":" has become free... for a brand-new use.