ppxscal/embedding_network huggingface dataset:
Symmetric Exponential Integrators with an Application to the Cubic Schr&#x00f6;dinger Equation
Authors: Elena Celledoni, David Cohen, Brynjulf Owren
Venue: Foundations of Computational Mathematics (2008)

In this article, we derive and study symmetric exponential integrators. Numerical experiments are performed for the cubic Schr&#x00f6;dinger equation and comparisons with classical exponential integrators and other geometric methods are also given. Some of the proposed methods preserve the L 2-norm and/or the energy of the system.
CompAA: A Self-Adaptable Component Model for Open Systems
Authors: Aniorté Philippe, Lacouture Jérôme
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

This paper describes the CompAA component model designed for adaptability management in open systems. Extension of the Ugatze component model validated for the static integration of components, CompAA aims to manage adaptable entities to resolve some problems due to the dynamics of open environments. The main contribution introduces the variability concept with the specification of adaptation points integrated by a mixed component/agent approach. An experimentation in the area of training on the grid validates our contribution.
Stereoselectivity of proline-catalyzed Mannich reaction: a density functional study
Authors: Waraporn Parasuk, Vudhichai Parasuk
Venue: Proceedings of the 1st WSEAS International Conference on Computational Chemistry (2007)

The stereoselective step of (S)-proline catalyzed Mannich reaction of cyclohexanone, formaldehyde, and aniline were theoretically investigated using density functional theory, B3LYP, with 6-31++g(d,p) basis set. From the proposed mechanism, cyclohexane and (S)-proline generate enamine and formaldehyde and aniline generate imine. The activation energies of the reaction between the enamine and imine which yield (S)- and (R)-intermediate are 8.5 and 12.4 kcal/mol, respectively. This is in agreement with experimental result that (S)-intermediate upon hydrolyzed yields major (S)-Mannich base product.
Knot graphs
Authors: S. D. Noble, D. J. A. Welsh
Venue: Journal of Graph Theory (2000)

We consider the equivalence classes of graphs induced by the unsigned versions of the Reidemeister moves on knot diagrams. Any graph that is reducible by some finite sequence of these moves, to a graph with no edges, is called a knot graph. We show that the class of knot graphs strictly contains the set of delta-wye graphs. We prove that the dimension of the intersection of the cycle and cocycle spaces is an effective numerical invariant of these classes. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 34: 100&ndash;111, 2000
The need to dig deep: V-spaces, product of interdisciplinary co-operation
Authors: Marcel van Buijtenen
Venue: Information Services and Use (2008)

The Communications Service Centre (CSC) and the library of the Technical University Eindhoven (TU/e) developed the search engine V-spaces in 2006, in co-operation with Infor, supplier of the Vubis Smart Library Management System, and the university library of the Free University of Brussels. Uniquely the inspiration for the development of the product came from a communications perspective; the high quality of the TU Eindhoven's digital library is the reason why the V-spaces search engine needs to dig so deep. V-spaces searches down to the document level and has the ability to retrieve information from within over 660 selected databases. A particular feature of the implementation of V-spaces is the integration with TYP03, the content management system used by CSC to develop and maintain the TU/e Web site (size approx. 20,000 pages).
Invited paper: Variability in nanometer CMOS: Impact, analysis, and minimization
Authors: Dennis Sylvester, Kanak Agarwal, Saumil Shah
Venue: Integration, the VLSI Journal (2008)

Variation is a significant concern in nanometer-scale CMOS due to manufacturing equipment being pushed to fundamental limits, particularly in lithography. In this paper, we review recent work in coping with variation, through both improved analysis and optimization. We describe techniques based on integrated circuit manufacturing, circuit design strategies, and mathematics and statistics. We then go on to discuss trends in this area, and a future technology outlook with an eye towards circuit and CAD-solutions to growing levels of variation in underlying device technologies.
VQ Based Image Retrieval Using Color and Position Features
Authors: Ajay H. Daptardar, James A. Storer
Venue: Proceedings of the Data Compression Conference (2008)

We present a new lower complexity approach for content based image retrieval based on a relative compressibility similarity measure using VQ codebooks employing feature vectors based on color and position. In previous work we have developed a system that employs feature vectors that are a combination of color and position. In this paper, we present a new approach that decouples color and position. We present this approach as two methods. The first trains separate codebooks for color and position features, eliminating the need for potentially application specific feature weightings during training. The second method achieves nearly the same performance at greatly reduced complexity by partitioning images into regions and training high-rate TSVQ codebooks for each region (i.e., position information is made implicit). Features extracted from query regions are encoded with the corresponding database region codebooks. The maximum number of codewords that a database region codebook may contain is determined at runtime and is a function of the query features. Region codebooks are then pruned appropriately before encoding query features. Experiments performed on the COREL image database show this new approach to provide almost equivalent retrieval precision to our previous method of jointly trained codebooks (and an improvement over previous methods) at much lower complexity.
A Minimalist Visual Notation for Design Patterns and Antipatterns
Authors: Demis Ballis, Andrea Baruzzo, Marco Comini
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Achieving a quality software system requires UML designers to have a good understanding of both design patterns and antipatterns. Unfortunately, UML models for real systems tend to be huge and hard to manage, especially for models automatically generated from source code. Thus, it would be advisable to have tools to automatically identify particular instances of patterns. So, a formal language to express them is needed. However, a textual formalization of such a language is barely usable by UML practitioners. In this paper we propose a visual notation obtained by adding to UML as few graphical elements as possible in order to express both patterns and antipatterns (with the needed formality). This approach has low cognitive load so is easily usable by practitioners but is still rigorous enough for implementation. This notation will be exploited by a GUI front-end for a prototypical tool (that we have recently developed) which is able to discover (anti)patterns in models.
An expert system based on linear discriminant analysis and adaptive neuro-fuzzy inference system to diagnosis heart valve diseases
Authors: Abdulkadir Sengur
Venue: Expert Systems with Applications: An International Journal (2008)

In the last two decades, the use of artificial intelligence methods in biomedical analysis is increasing. This is mainly because of the effectiveness of classification and detection systems have improved in a great deal to help medical experts in diagnosing. In this paper, we investigate the use of linear discriminant analysis (LDA) and adaptive neuro-fuzzy inference system (ANFIS) to determine the normal and abnormal heart valves from the Doppler heart sounds. The proposed heart valve disorder detection system is composed of three stages. The first stage is the pre-processing stage. Filtering, normalization and white-denoising are the processes that were used in this stage. The feature extraction is the second stage. During feature extraction stage, Wavelet transforms and short-time Fourier transform were used. As next step, wavelet entropy was applied to these features. For reducing the complexity of the system, LDA was used for feature reduction. In the classification stage, ANFIS classifier is chosen. To evaluate the performance of proposed methodology, a comparative study is realized by using a data set containing 215 samples. The validation of the proposed method is measured by using the sensitivity and specificity parameters. 95.9% sensitivity and 94% specificity rate was obtained.
An efficient integrity-preserving scheme for hierarchical sensor aggregation
Authors: Keith B. Frikken, Joseph A. Dougherty,  IV
Venue: Proceedings of the first ACM conference on Wireless network security (2008)

Sensor networks have proven to be useful in many application domains. Having the sensor nodes aggregate their results inside the network before sending the results to a base station has been shown to increase the lifetime of the network. However, sensor networks that are deployed in hostile environments need aggregation protocols that protect the integrity of the result. Recently, Chan et al. [3] introduced such a scheme that requires O(Δlog2n) communication per node, where Δ$ is the degree of the aggregation tree for the network and n is the number of nodes in the network. In this paper, we introduce modifications of this approach that reduce the maximum communication per node to O(Δlog2n).
Complexity of service value networks: conceptualization and empirical investigation
Authors: R. C. Basole, W. B. Rouse
Venue: IBM Systems Journal (2008)

This paper explores how service value is created in a network context and how the structure and dynamics of the value network as well as customer expectations influence the complexity of the services ecosystem. The paper then discusses what transformative role information and communication technology (ICT) plays in coordinating and delivering value and managing this complexity. A conceptual model is developed for understanding and investigating the nature, delivery, and exchange of service value and assessing the complexity of a service value network. Three central arguments are presented. First, value in the services economy is driven and determined by the end consumer and delivered through a complex web of direct and indirect relationships between value network actors. Second, the complexity of service value networks not only depends on the number of actors but also on the conditional probabilities that these actors are involved in delivering the service to the consumer. Third, ICT plays a central role in reducing complexity for consumers by providing greater levels of value network integration, information visibility, and means to manage and anticipate change.
Privacy Aspects of eHealth
Authors: Daniel Slamanig, Christian Stingl
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

A central aspect of eHealth is the electronic healthcare record (EHR) which integrates all relevant medical information of a person and represents a lifelong documentation of the medical history. By virtue of their sensitive character it is crucial that medical data can only be accessed by the patient herself and persons who are directly involved in the treatment of the patient. Since eHealth portals can be accessed via the Internet, security and privacy issues arise that have to be considered carefully. Besides traditional security properties, we mainly focus on additional threats, namely the trivial disclosure attack and the statistical analysis of metadata. Thereby a disclosure attack takes place if a person enforces another person to present her EHR, e.g. during a job interview. Additionally, by applying statistical analysis on the metadata of an eHealth portal, it is possible to determine relevant information (e.g. psychological treatment) which could have negative effects on the patient. In this paper we present a concept including pseudonymization of medical data, identity management, obfuscation of metadata and anonymous authentication to prevent disclosure attacks and statistical analysis.
Harmonic placement: file system support for scalable streaming of layer encoded object
Authors: Sooyong Kang, Youjip Won, Seunghyun Roh
Venue: Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video (2006)

From file system's point of view, scalable streaming introduces another dimension of complexity in disk scheduling. This is particularly because when a subset of information is retrieved, the playback does not necessarily coincides with the sequential access. We propose a new file organization technique called Harmonic placement. The basic idea is to cluster the frequently accessed layers together. We develop elaborate analytical models for different file organization techniques: Progressive placement, Interleaved placement and Harmonic placement. We investigate the performance of file organization techniques under varying workload conditions. The models developed in this work enables us to predict the performance and efficiency of the storage system in scalable streaming environment. We find that the Harmonic placement outperforms other schemes in scalable streaming environment.
An empirical analysis of software effort estimation with outlier elimination
Authors: Yeong-Seok Seo, Kyung-A Yoon, Doo-Hwan Bae
Venue: Proceedings of the 4th international workshop on Predictor models in software engineering (2008)

Accurate software effort estimation has always been challenge for software engineering communities. To improve the estimation accuracy of software effort, many studies have focused on effort estimation methods without any consideration of data quality, although data quality is one of important factors to impact to the estimation accuracy. In this paper, we investigate the influence of outlier elimination upon the accuracy of software effort estimation through empirical studies applying two outlier elimination methods(Least trimmed square and K-means clustering) and three effort estimation methods( Least squares, Neural network and Bayesian network) associatively. The empirical studies are performed using two industry data sets(the ISBSG Release 9 and the Bank data set which consists of the project data performed in a bank in Korea) with or without outlier elimination.
Holistic pathfinding: virtual wireless chip design for advanced technology and design exploration
Authors: Matt Nowak, Jose Corleto, Christopher Chun, Riko Radojcic
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

As CMOS technology is scaled beyond 45nm, SOC/SiP design for wireless chips is increasingly constrained by fundamental technology limits, resulting in challenges including parametric variability, leakage, active power, signal integrity, and diminished performance improvement. New materials and innovative device structures are needed to extend CMOS scaling and integrate disruptive "More than Moore" functionality, but these can have adverse impact on manufacturing cost and risk. Hence, tradeoff analysis spanning process, device, circuit, memory, package, architecture, software, and business disciplines is required during the advanced technology development cycle to explore and co-optimize technology and design choices. Such methodology, in conjunction with judicious use of test chips, also provides for a bridge from innovative technology solutions to mainstream product adoption. Several approaches are currently in use for ad-hoc exploration of advanced technology and design - typically based on spreadsheet analysis, guru consultation, and/or full trial designs. With the exploding complexity of the optimization space, subject matter knowledge and expert experience needs to be complemented with a structured methodology and tools. A "Holistic Pathfinding" methodology is proposed for addressing technology and design tradeoffs early in the development cycle to allow co-optimization all the way up to the system architecture level. A virtual design flow that allows rapid estimation of performance, power and cost attributes of a potential product, as a function of a given set of process or design assumptions is described as shown in Figure 1. Key target features of such a virtual flow and a summary of the attributes of several candidate point tools is presented. Requirements for the tools and methodologies to be used for Pathfinding across the span of disciplines are outlined. In order to enable system cost and performance/power analyses, the requirements for predictive models that describe variability, leakage, devices, interconnect, and DFM attributes are identified. Examples of Pathfinding application for co-optimization of memory technology and architecture, reduced parametric variability using restricted physical design rules, and exploration of 3D chip stacking are presented to highlight the requirements and gaps in the existing EDA tool solutions. The vision is for a design exploration platform that outputs performance, active and standby power, and cost estimates in reasonable response time, and with physical and variation awareness at the architectural level.
A tree-structured perception approach for robot operations in modeling of unknown targets
Authors: S. Y. Chen, Qiu Guan, Gang Xiao, Chunyan Yao, Wanliang Wang
Venue: Proceedings of the 4th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision (2004)

For automatic modeling of three-dimensional unknown objects or environments by an active robot system, the perception strategy is a critical issue since sensing operations have to be decided dynamically and sequentially. This paper presents a tree-structured approach for merging, splitting, and viewpoint deciding. Further development of the algorithms will lead to a very robust method for applying in such complex vision tasks. Repetitive processes, system states, and complete condition are also discussed for exploring the unknown portion of the object or the environment. This paper also treats uncertainties and occlusions, as well as many robot environmental or sensing constraints. Redundant viewpoints are eliminated and new views are planned according to a max-min criterion for achieving lowest cost for robot operations.
IRVR Algorithm: A New Volume Rendering Accelerating Method Based on Image Recognition
Authors: Yuanlie He, Ping Chen
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In this paper, a new algorithm (Image Recognition Volume Rendering ---- IRVR) is developed, which can remarkably reduce the redundant data during volume rendering. The IRVR algorithm applies the cross-entropy threshold selection method to identifying the object and background voxels from a three dimensional dataset. An iterating ray tracing method combined with the objects detection sampling strategy is developed to sample the original dataset. The fast iterative method is applied to sampling the classification dataset for locating the intersection position of the viewing ray and the original dataset. And the precise normal sampling method (for example, trilinear interpolation, spline interpolation, etc.) is used to extract the gray value from the original dataset for volume rendering. The experiment result is given in this paper. It is proved that the IRVR algorithm can increase the volume rendering speed and guarantee the quality of the volume rendering results.
Underwriter reputation and switching
Authors: C. R. McKenzie, Sumiko Takaoka
Venue: Mathematics and Computers in Simulation (2008)

The purpose of this paper is to examine the determinants of firms switching the lead underwriter they use to underwrite their first and second public issues of straight corporate bonds in Japan between 1994 and 2002. In particular, the paper focuses on the role of the lead underwriter's reputation in determining the degree of switching of underwriters between the first and second issues. As measures of an underwriter's reputation, the lead underwriter's rating at the time of the initial issue, the changes in the underwriter's ratings and market shares between the initial and second issue, and the degree of mispricing of the first issue are used. It is found that the probability of a switch of lead underwriters between the first and second issues is significantly increased if the securities company subsidiary of a bank was the initial lead underwriter, or the rating of the lead underwriter of the initial issue falls. There is some evidence to suggest that lead underwriters who can increase the degree of overpricing of the initial issue are more likely to be chosen to act as the lead underwriter of the second issue.
Towards a Framework for Scalable Model Checking of Concurrent C Programs
Authors: Ji Wang, Xiaodong Yi, Xuejun Yang
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

The paper presents a novel framework for scalable model checking of concurrent C programs. With the idea of verification reuse, it shows an integrated approach to efficient reduction of state space by abstraction, symbolic representation and dynamic partial-order reduction (DPOR) techniques. The framework is founded on an over-approximated model of the concurrent program by variable abstraction, and combines DPOR with lightweight symbolic execution to generate the symbolic conditions for all locations, called alpha-conditions, which are intended for verification reuse. The alpha-conditions of a location are weak approximation of the conditions that must be satisfied at that location so as to guarantee the temporal safety properties to be verified. The seconditions will be checked for reusing the previous exploration in verification, and will be iteratively refined under the guidance of spurious counterexamples. The presented framework is demonstrated by several experiments including a concurrent software system whose server and client processes are derived from open ssl-0.9.6c C source codes implementing the SSL protocol.
Inference versus evidence in reasoning remote sensing recognition, with an information foraging perspective
Authors: M. Shoshany, Y. Cohen
Venue: International Journal of Remote Sensing (2007)

Spatial, temporal and spectral complexity of remote sensing recognition tasks necessitates the use of Knowledge-Based Expert Systems (KBS). These systems are composed mainly of evidence and inference mechanisms: either domain-dependent inference (DDI) or domain-independent inference (DII). Selection of recognition strategies are typical of information foraging tasks and involve decisions regarding combinations of evidence and inference. This is highly dependent on the expected information gain (e.g. recognition accuracy and reliability) versus the cost/effort of constructing the evidential basis and the inference mechanism. This paper assessed a rule-based system (DDI) utilizing a sequent-oriented inference and a DII system utilizing the Dempster-Shafer evidential reasoning method. Quantification of evidence-inference-complexity-effort-accuracy relationships for a case study of land-use mapping on a wide regional scale allow a preliminary assessment of the relative performance of each strategy. Initial results indicate that a DII-based recognition system may function significantly better than a DDI-based system in large areas representing cases that had not been learnt during the evidence-extraction phase.