ppxscal/embedding_network huggingface dataset:
A Haptic Robot Reveals the Adaptation Capability of Individuals with Multiple Sclerosis
Authors: Maura Casadio, Vittorio Sanguineti, Claudio Solaro, Pietro G. Morasso
Venue: International Journal of Robotics Research (2007)

A prerequisite for rehabilitation is that patients preserve their ability to adapt to novel dynamic environments, an ability that has been associated with the cerebellar system. In this study, we use a robot manipulandum to assess the ability of multiple sclerosis (MS) subjects in the early phase of the disease to adapt to a speed-dependent force field. Their performance is compared with an equal number of age-matched controls. We found that MS subjects display subtle in-coordination problems but do not significantly di fer from controls in their ability to adapt to the force field. These findings are discussed in terms of the possible benefits that MS subjects might receive from robot-assisted therapy that is specifically aimed at impaired visuomotor coordination.
Research on Building Polygon Map Generalization Algorithm
Authors: Zhong Xie, Zi Ye, Liang Wu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Generalization of the building polygon maps is a challenging problem within the world range. The paper discusses the automatic generalization algorithm of urban building polygon in GIS environment. The main research focuses on the rectangular adjustment of building polygon, partial concave and convex simplification of the large polygon, partial exaggeration of the small polygon and polygon cluster aggregation. In the practical development, we sort the different building polygon by its shape and characteristic, and simplify it with different methods. The experiment proves that the building polygon simplification products a reasonable result through this algorithm and the morph feature of block has been well preserved.
Frequency and voltage effects on the dielectric properties and electrical conductivity of Al-TiW-Pd2Si/n-Si structures
Authors: İ. M. Afandiyeva, İ. Dökme, Ş. Altındal, M. M. Bülbül, A. Tataroğlu
Venue: Microelectronic Engineering (2008)

Different from conventional metal-Si compounds-n-Si structures, the thin film of TiW alloy was deposited on Pd"2Si-n-Si to form a diffusion barrier between aluminum (Al) and Pd"2Si-n-Si. Dielectric properties and electrical conductivity of TiW-Pd"2Si/n-Si structures in the frequency range of 5kHz-10MHz and voltage range of (-4V) to (10V) have been investigated in detail by using experimental C-V and G-V measurements. Experimental results indicate that the values of @e' show a steep decrease with increasing frequency for each voltage. On the other hand, the values of @e'' show a peak, and its intensity increases with decreasing voltage and shifts towards the lower frequency side. The ac electrical conductivity (@s"a"c) and the real part of electric modulus (M') increase with increasing frequency. Also, the imaginary part of electric modulus (M'') shows a peak and the peak position shifts to higher frequency with increasing applied voltage. It can be concluded that the interfacial polarization can be more easily occurred at low frequencies, and the majority of interface states at metal semiconductor interface, consequently contributes to deviation of dielectric properties of TiW-Pd"2Si/n-Si structures.
A New Multi-modal Immune Algorithm and its Complete Convergence Analysis
Authors: Kongyu Yang, Zhiheng Sun, Yan Liang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Many available multi-modal optimization algorithms have good search effects on functions with equivalence peaks, but they cannot find all extremum points in the definition fields, i.e. they are not complete convergence. So a strategy of peaks poised is proposed and a new Multi-modal Immune Algorithm (MIA) based on the antibody evolution in immune system with this strategy is designed. Then the algorithm's complete convergence and its computation complicacy are analyzed. Simulation experimental results testify that MIA has excellent availability on finding all extremum points of a multi-modal functions, especially those functions with non-equivalence peaks.
BM3E: Discriminative Density Propagation for Visual Tracking
Authors: Cristian Sminchisescu, Atul Kanaujia, Dimitris N. Metaxas
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

We introduce BM³E, a Conditional Bayesian Mixture of Experts Markov Model, for consistent probabilistic estimates in discriminative visual tracking. The model applies to problems of temporal and uncertain inference and represents the unexplored bottom-up counterpart of pervasive generative models estimated with Kalman filtering or particle filtering. Instead of inverting a non-linear generative observation model at run-time, we learn to cooperatively predict complex state distributions directly from descriptors that encode image observations — typically bag-of-feature global image histograms or descriptors computed over regular spatial grids. These are integrated in a conditional graphical model in order to enforce temporal smoothness constraints and allow a principled management of uncertainty. The algorithms combine sparsity, mixture modeling, and non-linear dimensionality reduction for efficient computation in high-dimensional continuous state spaces. The combined system automatically self-initializes and recovers from failure. The research has three contributions: (1) We establish the density propagation rules for discriminative inference in continuous, temporal chain models; (2) We propose flexible supervised and unsupervised algorithms for learning feedforward, multivalued contextual mappings (multimodal state distributions) based on compact, conditional Bayesian mixture of experts models; (3) We validate the framework empirically for the reconstruction of 3d human motion in monocular video sequences. Our tests on both real and motion capture-based sequences show significant performance gains with respect to competing nearest-neighbor, regression, and structured prediction methods.
Utilize Fuzzy Data Mining to Find the Living Pattern of Customers in Hotels
Authors: Xu Xu, Zhongfu Zhang, Zhihong Feng, Yansong Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

The different criteria are usually used in real data min- ing,in our study of finding the living pattern of customers in hotels,we adopt fuzzy data mining that combine Apriori al- gorithm with different min-support and min-confidence and fuzzy set theory to copy with the criteria,the yielded rules are not only useful to the hotel decision-makers,but also to those who want to do the business.In this paper,the ap- proach and steps are listed,we can see the method is sci- entific and meaningful from the actual example,so the ap- proach can be further used in other facets.
The Bump Hunting Method and Its Accuracy Using the Genetic Algorithm with Application to Real Customer Data
Authors: H. Hirose, T. Yukizane, T. Deguchi
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Suppose that we are interested in searching for denser regions showing response 1 with many feature variables (explanation variables) in a z-dimensional space, where each point is assigned response 1 or response 0 as its target value; such a region is called the bump. In a series of previous studies, we have shown that the bump hunting method using the decision tree combined with the genetic algorithm is useful for certain smaller simulated data case mimicked to a real customer case. We have developed a trade-off curve with its accuracy evaluation between the pureness rate and the capture rate to the simulated data. This paper deals with a real customer data case, and we have found that it is crucial to know the relation between the number of feature variables and the number of samples.
Review article: A review of structured document retrieval (SDR) technology to improve information access performance in engineering document management
Authors: S. Liu, C. A. McMahon, S. J. Culley
Venue: Computers in Industry (2008)

Information retrieval (IR) is a well-established research and development area. Document formats such as SGML (Standard Generalised Mark-up Language) and XML (eXtensible Mark-up Language) have become widely used in recent years. Traditional IR systems demonstrate limitations when dealing with such documents, which motivated the emergence of structured document retrieval (SDR) technology intending to overcome these limitations. This paper reviews the work carried out from the inception to the development and application of SDR in engineering document management. The key issues of SDR are discussed and the state of the art of SDR to improve information access performance has been surveyed. A comparison of selected papers is provided and possible future research directions identified. The paper concludes with the expectation that SDR will make a positive impact on the process of engineering document management from document construction to its delivery in the future, and undoubtedly provide better information retrieval performance in terms of both precision and functionality.
Power Estimation of Time Variant SoCs with TAPES
Authors: Andreas Lankes, Thomas Wild, Johannes Zeppenfeld
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

During the design process of modern SoCs (systems on chip), design tools and methods are required for the exploration of promising solutions. Evaluation criteria in this process are performance and often also power consumption. The design space is expanded by a trend towards time variant SoCs, which adapt their behaviour at run time to improve reliability or power consumption. This paper presents an extension to the TAPES system simulator in order to enable not only the exploration of architectures but also the investigation of power minimization strategies. The usefulness of the simulator is demonstrated in an architecture exploration of a network processor.
On Parallel-Acting Index Registers
Authors: D. Mandelbaum
Venue: IEEE Transactions on Computers (1971)

It is shown how index registers can be made so as to act parallel to the computer instruction flow, thus not requiring a programmed instruction to decrement (or increment) and jump. This method would save one instruction per loop but would require more hardware.
A Framework for Software Fault Tolerance in Real-Time Systems
Authors: T. Anderson
Venue: IEEE Transactions on Software Engineering (1983)

Real-time systems often have very high reliability requirements and are therefore prime candidates for the inclusion of fault tolerance techniques. In order to provide tolerance to software faults, some form of state restoration is usually advocated as a means of recovery. State restoration can be expensive and the cost is exacerbated for systems which utilize concurrent processes. The concurrency present in most real-time systems and the further difficulties introduced by timing constraints suggest that providing tolerance for software faults may be inordinately expensive or complex. We believe that this need not be the case, and propose a straightforward pragmatic approach to software fault tolerance'which is believed to be applicable to many real-time systems. The approach takes advantage of the structure of real-time systems to simplify error recovery, and a classification scheme for errors is introduced. Responses to each type of error are proposed which allow service to be maintained.
A Unified Approach to Microcomputer Software Development
Authors: T. G. Rauscher
Venue: Computer (1978)

An ordered sequence of stages, well-supported development tools, good programming practices-management backing brings it all together in microprocessor-based development.
Directional lifting-based wavelet transform for multiple description image coding
Authors: Baocai Yin, Xin Li, Yunhui Shi, Feizhou Zhang, Nan Zhang
Venue: Image Communication (2008)

In this paper, we address the problem of image transmission over unreliable networks, such as the Internet, where packet losses occur. The most recent literature indicates that multiple description (MD) is a promising coding approach to handle this issue. The traditional spatial domain MD image coding techniques usually result in the very low coding efficiency. This paper proposes a new architecture for MD image coding, which is based on directional wavelet transform that removes redundancy among spatial and wavelet domain. In addition, a novel interpolation method using reproducing kernel filter (RKF) reconstructs one description with full resolution. The results show that the proposed technique is far better than other existing method.
Facial Shape-from-shading and Recognition Using Principal Geodesic Analysis and Robust Statistics
Authors: William A. Smith, Edwin R. Hancock
Venue: International Journal of Computer Vision (2008)

The aim in this paper is to use principal geodesic analysis to model the statistical variations for sets of facial needle maps. We commence by showing how to represent the distribution of surface normals using the exponential map. Shape deformations are described using principal geodesic analysis on the exponential map. Using ideas from robust statistics we show how this deformable model may be fitted to facial images in which there is significant self-shadowing. Moreover, we demonstrate that the resulting shape-from-shading algorithm can be used to recover accurate facial shape and albedo from real world images. In particular, the algorithm can effectively fill-in the facial surface when more than 30% of its area is subject to self-shadowing. To investigate the utility of the shape parameters delivered by the method, we conduct experiments with illumination insensitive face recognition. We present a novel recognition strategy in which similarity is measured in the space of the principal geodesic parameters. We also use the recovered shape information to generate illumination normalized prototype images on which recognition can be performed. Finally we show that, from a single input image, we are able to generate the basis images employed by a number of well known illumination-insensitive recognition algorithms. We also demonstrate that the principal geodesics provide an efficient parameterization of the space of harmonic basis images.
Secur(e/ity) Management: A Continuing Uphill Climb
Authors: John Hale, Paul Brusil
Venue: Journal of Network and Systems Management (2007)

With ever growing and evolving threats and cyber attacks, the management of enterprise security and the security of enterprise management systems are key to business--if not a nation's--operations and survival. Secur(e/ity) management, the moniker for the intertwined topics of secure management and security management, has evolved trying to keep pace. The history of secur(e/ity) management is traced from its origins in the disjoint silos of telecommunications, internetworking and computer security to today's recognition as necessary, interdisciplinary, interworking technologies and operations. An overview of threats and attacks upon managed and management systems shows that occurrences of ever more sophisticated, complex and harder to detect cyber misconduct are increasing as are the severity and costs of their consequences. Introduction of new technologies, expansion of the perimeters of an enterprise and trends in collaborative business partnerships compound the number of managed system targets of cyber compromise. Technical and marketplace trends in secur(e/ity) management reveal needs that must be bridged. Research attention should focus on developing axiomatic understanding of the natural laws of security, tools to realize vulnerability-free software, metrics for assessing the efficacy of secur(e/ity) management, tools for default-deny strategies so that signature-based security management can be retired, secur(e/ity) management approaches for virtualized and service-oriented environments, and approaches for composite, holistic, secur(e/ity) management.
Software evolution in open source projects&mdash;a large-scale investigation
Authors: Stefan Koch
Venue: Journal of Software Maintenance and Evolution: Research and Practice (2007)

In this paper, the evolution of a large sample of open source software systems will be analysed. The evolution of commercial systems has been an issue that has long been a centre of research, thus a coherent theoretical framework of software evolution has been developed and empirically tested, most notably the laws of software evolution. In exploring the evolutionary behaviour of open source systems, these results can serve as a point of reference, allowing to assess if differences exist, or which aspects of open and collaborative development styles have an impact on evolutionary behaviour. The data collection method relying on a large software repository and the respective source code control systems is described, and an overview on the collected data on several thousand projects is given. The evolutionary behaviour is explored using both a linear and a quadratic model, with the quadratic model being shown as better suited. The most interesting fact is that while in the mean the growth rate is linear or decreasing over time according to the laws of software evolution, a significant percentage of projects is able to sustain super-linear growth. There is a positive relationship between the size of a project, the number of participants, and the inequality in the distribution of work within the development team with the presence of super-linear growth patterns. On the other hand, there is evidence for a group of projects of moderate size which shows decreasing growth rates, while small projects in general exhibit linear growth. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Trends in Data Organization and Access Methods
Authors: P. C. Patton
Venue: Computer (1970)

There has been a trend in applications programming over the past fifteen years from highly structured programs and loosely structured data toward loosely structured programs and highly structured data. Transaction oriented systems and other data directed programs make greater demands on the memory hierarchy of a computer system and have given rise to the need for storage media which are to some degree structurable under program control. Overhead in operating systems and large on-line application programs is described as a symptom of "static" and "dynamic" mismatch problems in the storage hierarchy. Some new memory organization techniques beginning to appear on computers may allow greater efficiency in data directed systems since they allow the programmer to store the structure and the content of his data separately. 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
A Production IR-Drop Screen on a Chip
Authors: Zahi Abuhamdeh, Bob Hannagan, Jeff Remmers, Alfred L. Crouch
Venue: IEEE Design Test (2007)

Many modern designs have large, localized failures that can be attributed to excessive power consumption, which can be measured as IR drop. This IR drop is problematic because power rails may not be sized correctly for the load they must handle in both functional and test operation, so there might be localized hot spots, or conditions of overtesting or test escapes. This article describes a methodology that uses on-chip process-monitoring circuits to identify and localize IR-drop hot spots and power-related failures. This methodology employs a circuit that is easy to integrate on chip and use in a characterization or production environment. Furthermore, the authors have developed a production screen that helps identify mismatched power rails to device performance requirements.
Dynamic Fault Diagnosis of Combinational and Sequential Circuits on Reconfigurable Hardware
Authors: Fatih Kocan, Daniel G. Saab
Venue: Journal of Electronic Testing: Theory and Applications (2007)

This article describes an emulation-based method for locating stuck-at faults in combinational and synchronous sequential circuits. The method is based on automatically designing a circuit which implements a closest-match fault location algorithm specialized for the circuit under diagnosis (CUD). This method allows designers to perform dynamic fault location of stuck-at faults in large circuits, and eliminates the need for large storage required by a software-based fault dictionary. In fact, the approach is a pure hardware solution to fault diagnosis. We demonstrate the feasibility of the method in terms of hardware resources and diagnosis time by experimenting with ISCAS85 and ISCAS89 circuits. The emulation-based diagnosis method speeds up the diagnosis process by an order of magnitude compared to the software-based fault diagnosis. This speed-up is important, especially, when the on-line diagnosis of safety---critical systems is of concern.
Scatternet Formation Algorithm in Multi-hop Environment based on Bionics
Authors: Jingjing Wang, Mingbo Zhao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

There are very few scatternet formation algorithms among Bluetooth devices in multi-hop dynamical environment at present. The paper proposes a new BBSF(Based on Bionics Scatternet Formation) algorithm, using the ad hoc property of Swam Intelligence clustering pattern from the research of living being's group behaviors. BBSF achieves the merging of scatternet subnets using a tree-like but 'not true tree' topology structure, and achieves the control of the merging of scatternet concisely and efficiently. It provides a new design method of distributed dynamical net formation in multi-hop environment. Using NS-2 (Network Simulator) and it's expand plug-in component, the paper simulates the BBSF algorithm in different environments and conditions, and compares its property with those of a traditional net forming algorithm of the Bluetooth scatternet. The result shows the better property of BBSF.