ppxscal/embedding_network huggingface dataset:
Volume and surface-area measurements using tomography, with an example from the Brenham pallasite meteorite
Authors: Jacob Spinsby, Heiner Friedrich, Peter R. Buseck
Venue: Computers Geosciences (2008)

Increased computer speed has helped to proliferate tomography throughout the geosciences. Although best known from the medical CATscan, tomography is also a powerful tool for geological problems. Whereas qualitative tomography is widely used, quantitative data from tomograms are not so commonly available. Presented here are two programs, Electron Tomography Segmentation, surface Area, and Volume (ETSAV) and Electron Tomography CUTter (ETCut), that were written to obtain quantitative volume and surface-area data from tomograms. Based on a specified threshold value, ETSAV distinguishes objects within a tomogram and then returns volume and surface-area data for each object. If object separation is unsatisfactory using a single threshold, ETCut is called to digitally separate objects that appear connected in the tomogram, allowing ETSAV to perform its functions. By knowing the nature of the object of interest, error can be corrected to, on average, less than 5% for a single object; combined volumes of many particles of different sizes may result in lesser errors. A section of the Brenham pallasite meteorite was examined using the programs. Olivine comprises 67.2% of the volume (50.4%wt%), followed by FeNi metal at 23.1% (39.3%wt%), troilite at 4.4% (4.8%wt%), and schreibersite at 3.4% (5.5%wt%). In all, 56.1% and 44.7% of the troilite and schreibersite surface areas, respectively, border olivine, suggesting that they wet olivine. Since the programs can be applied to any tomogram, from any field, there are many potential applications.
The Evolution of the Internal Offshore Software Development Model at Dell Inc.
Authors: Carlon Halmenschlager Szymanski, Rafael Prikladnicki
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

Global software development not only enables lower operational costs, but makes it possible for companies to have an organizational branch which can drive standardization across all IT segments. Dell Inc global development services took off in 2001 and since then has expanded to Brazil, two centers in India, and one center in Russia. For six years these centers were to some extent independent, and performed the role of a software development consulting/factory inside Dell. Now, the global development centers have migrated to a business centric model, on which they are no longer a separate structure, but directly bound to the IT segments of each business area. The purpose of this paper is to show the evolution of the internal offshore software development model adopted by Dell and the results achieved by this endeavor.
Convergence of a jump procedure in a semi-Markov environment in diffusion-approximation scheme
Authors: Ya. M. Chabanyuk
Venue: Cybernetics and Systems Analysis (2007)

The sufficient convergence conditions are obtained for a jump stochastic approximation procedure in a semi-Markov environment in a diffusion approximation scheme with balance conditions for a singular perturbation of the regression function. To this end, a singular perturbation problem is solved for the asymptotic representation of the compensating operator of an augmented Markov renewal process.
A new method for path prediction in network games
Authors: Shaolong Li, Changja Chen, Lei Li
Venue: Computers in Entertainment (CIE) (2008)

In almost all multiplayer network games, dead-reckoning (DR) is used to predict the movements of game players, who can then predict the future movements of other players via the DR vectors they received. DR vectors, referred to as network packages, generally contain the position and velocity of game roles controlled by a sender at sending time. To achieve more accurate prediction, some games include the timestamp and acceleration of game roles in DR vectors. However, DR does not work well under bad network conditions. In our previous work [Li and Chen 2006] we proposed a solution called the interest scheme (IS), which proved to be efficient when network latency was unsteady and package loss frequent. Thus, in order to achieve much more accurate prediction, we proposed a hybrid solution. IS assumes that the path prediction for a given player is related to nearby objects or players. That is, that the players' surroundings can affect their movements, and different players may behave differently under the same conditions. In IS, a given player's surroundings are taken into account, and in order to achieve more accuracy, his habitual preferences are also taken into consideration. Experience with network games indicates that the same player will almost always behave in the same way under the same circumstances---for example, use the same fighting style. Moreover, we consider that different prediction methods should be used for different network latencies. So we introduce a hybrid method, which is a combination of IS, DR, and personal preferences. We use a 2D tank game to experiment, and compare the results of our solution with those of traditional methods. To obtain information on the players' habitual movements, we observed each participant for 30 minutes of play. Simulation shows that our method achieves significant improvements in path prediction.
Evaluating Routing Protocols for the Wireless Mesh Backbone
Authors: Usman Ashraf, Guy Juanole, Slim Abdellatif
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

Wireless Mesh Networks offer promising solutions for extending the coverage of wireless local area networks along with increased communication reliability. The wireless mesh backbone serves as an access network for a large number of heterogeneous networks, providing them internet connectivity. Comprising of dedicated routers, the backbone differs significantly from conventional ad hoc networks due to lack of mobility and energy constraints. Classical ad hoc routing protocols developed for typical ad hoc networks, concentrate on mobility and energy conservation and their suitability and possible adoption for the backbone warrants careful evaluation. In this paper, we analyze the performance of four popular ad hoc routing protocols including two reactive (DSR, AODV) and two proactive (OLSR, DSDV) protocols for the mesh backbone using simulation. We provide results for routing overhead, packet delivery fraction and end-to-end delay metrics. Optimizations for these protocols are proposed and design directions for future backbone routing protocols are outlined. Index Terms--Wireless mesh networks, Mesh backbone, Performance analysis, Optimization.
Voice Conversion Adopting SOLAFS
Authors: Lei Zhao, Yinqiu Gao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

An improved method of voice conversion is proposed to make the speech of a source speaker sound like uttered by a target speaker. Speaker individuality transformation is achieved by altering the spectral envelope and prosodic information. The main advantage of this method is to firstly apply the synchronized overlap-add fixed synthesis (SOLAFS) to modify the source speaker's speaking rate to match that of the target speaker, which enhances the performance of the whole conversion system compared with conventional systems without such a procedure. Besides, a precise estimation for the target excitation is advanced only with the information of the matched source's excitation and the average pitch period of the target speaker. The proposed scheme is evaluated using both subjective and objective measures. The experimental results show that the system is capable of effectively transforming speaker identity whilst the converted speech maintains high quality.
Robust Position Tracking for Mobile Robots with Adaptive Evolutionary Particle Filter
Authors: Zhuohua Duan, Zixing Cai, Jinxia Yu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Robust position tracking is a challengeable issue for mobile robot in presence of faults. In the paper, an adaptive evolutionary particle filter is designed to achieve robust position tracking for wheeled mobile robot when the robot is subjected to faults such as sensor faults and wheel slippage. Firstly, the kinematics models of wheeled mobile robots and the measurement models of laser range finder are derived, five kinds of residual features are extracted and faults are detected according residual features. Secondly, an adaptive evolutionary particle filter is designed for robust localization, which includes two key steps: (1) adapting the proposal distribution according to residual features, (2) evolutionary operators, which are tuned with unnormalized weights of particles, are designed to recover the diversity of particle sets. Lastly, the presented method is testified in a real mobile robot.
A two-stage design of adaptive fuzzy controllers for time-delay systems with unknown models
Authors: J. S. Taur, G. H. Lee, C. W. Tao
Venue: International Journal of Systems Science (2007)

In this article, a systematic two-stage design method for adaptive fuzzy controllers is presented. The proposed control scheme has low computational complexity. Moreover, the exact mathematical model of the plant to be controlled is not required. The fuzzy controller under consideration is based on the proportional-derivative fuzzy control scheme and triangular membership functions. In the design procedure, the domain intervals of the input and output variables are selected with a heuristic approach to minimize a cost function under the constraint of tolerable overshoots in the response curve. A learning scheme is then proposed to automatically adjust the parameters in the fuzzy controller to reduce the error of the system. It can also be used adaptively to improve the system performance of a time-varying system. Simulations and comparisons are included to demonstrate the effectiveness of the proposed method.
Unequal error protection for real-time video in mobile ad hoc networks via multi-path transport
Authors: Ahmed Abd El Al, Tarek Saadawi, Myung Lee
Venue: Computer Communications (2007)

In this paper, we propose a mechanism that combines retransmission-based error control with multi-path transport (MPT), to provide different levels of protection to real-time video in ad hoc networks. The mechanism factors in the importance of the retransmitted packets to the reconstructed video quality as well as the end-to-end latency constraints to minimize the overhead and maximize the reconstructed video quality at the receiver. Simulation results show that the proposed retransmission mechanism maintains the video quality under different loss rates and mobility speeds, with less overhead compared to error control methods that depend on controlling the intra-update rate. In addition, the mechanism is shown to be more robust to wireless losses and mobility than schemes that combine layered and multiple description coding with multi-path transport.
Logic Properties of Unate Discrete and Switching Functions
Authors: A. Thayse
Venue: IEEE Transactions on Computers (1977)

The total and local unateness of discrete and of switching functions are studied from a theoretical point of view. One shows that the local unateness leads to the concept of hazard-free transition for a discrete function. Unate covers for discrete functions are defined: they are either the smallest unate functions larger than a discrete function, or the largest unate functions smaller than a discrete function. These concepts play a key role in hazard-free design of multiple-valued networks. Three-level types of multiple-valued networks using MIN and MAX gates are presented. These networks improve, from a hazard point of view the well known two-level networks presented by Eichel-berger in the frame of switching theory.
A Flexible Filter Processor for Fading Channel Simulation
Authors: Amirhossein Alimohammad, Saeed Fouladi Fard, Bruce F. Cockburn, Christian Schlegel
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

A flexible and compact general-purpose filter processor is presented. This processor is intended for the hardware-based simulation of wireless channels on field-programmable gate arrays (FPGAs). When implemented on a Xilinx Virtex2P XC2VP100-6 FPGA, it utilizes 2% of the configurable slices, 9% of the dedicated 18×18-bitmultipliers, and 14 BlockRAMs. When paired with multiplicationfree interpolators, it can generate up to 300 million fading samples per second. The statistical properties of generated fading samples are shown to closely match the theoretical reference statistical properties.
Theory and experiment in cognitive science
Authors: Paul Thagard
Venue: Artificial Intelligence (2007)

Margaret Boden's Mind as Machine: A History of Cognitive Science is a masterfully broad and informative history of computational theories of mental operations. However, its relative neglect of research in psychology and neuroscience yields a somewhat misleading picture of cognitive science, which ideally combines theory and experiment.
Efficient skyline computation over low-cardinality domains
Authors: Michael Morse, Jignesh M. Patel, H. V. Jagadish
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Current skyline evaluation techniques follow a common paradigm that eliminates data elements from skyline consideration by finding other elements in the dataset that dominate them. The performance of such techniques is heavily influenced by the underlying data distribution (i.e. whether the dataset attributes are correlated, independent, or anti-correlated). In this paper, we propose the Lattice Skyline Algorithm (LS) that is built around a new paradigm for skyline evaluation on datasets with attributes that are drawn from low-cardinality domains. LS continues to apply even if one attribute has high cardinality. Many skyline applications naturally have such data characteristics, and previous skyline methods have not exploited this property. We show that for typical dimensionalities, the complexity of LS is linear in the number of input tuples. Furthermore, we show that the performance of LS is independent of the input data distribution. Finally, we demonstrate through extensive experimentation on both real and synthetic databsets that LS can results in a significant performance advantage over existing technqiues.
Novel approaches to principal component analysis of image data based on feature partitioning framework
Authors: Kadappagari Vijaya Kumar, Atul Negi
Venue: Pattern Recognition Letters (2008)

We present a feature partitioning framework for principal component analysis (PCA) on image data. Using this framework, we propose two novel methods, sub-image principal component analysis (SIMPCA) and flexible image principal component analysis (FLPCA). We prove the computational superiority of the approaches and also demonstrate improved performance through experimentation on standard face databases and a palmprint database. The proposed methods show a significantly superior performance as compared to conventional and improved implementations of PCA on images. It is seen that improvement in performance is in terms of both computational time and recognition rate. Experimentation shows that the novel partitioning approaches are in a different class of approaches. The success of proposed approaches may be attributed to the localization effect derived from partitioning. The proposed methods use a more appropriate matrix representation of the image data.
Conference Report Fourth International Conference on Software Engineering
Authors: P. I. Rosengard
Venue: Computer (1980)

This conference reflects the internationality of the effort to arrive at a genuine engineering discipline of programming-an effort which began at another conference 11 years ago. 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
Short-Circuit Compiler Transformation: Optimizing Conditional Blocks
Authors: Mohammad Ali Ghodrat, Tony Givargis, Alex Nicolau
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

We present the short-circuit code transformation technique, intended for embedded compilers. The transformation technique optimizes conditional blocks in high-level programs. Specifically, the transformation takes advantage of the fact that the Boolean value of the conditional expression, determining the true/false paths, can be statically analyzed to determine cases when one or the other of the true/false paths are guaranteed to execute. In such cases, code is generated to bypass the evaluation of the conditional expression. In instances when the bypass code is faster to evaluate than the conditional expression, a net performance gain is obtained. Our experiments with the Mediabench applications show that the short-circuit transformation yields a an average of 35.1% improvement in execution time for SPARC and an average of 36.3% improvement in execution time for ARM. We also measured an average of 36.4% reduction in power consumption for ARM.
Hierarchical Identification of Untestable Faults in Sequential Circuits
Authors: Jaan Raik, Raimund Ubar, Anna Krivenko, Margus Kruus
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Similar to sequential test pattern generation, the problem of identifying untestable faults in sequential circuits remains unsolved. Most of the previous works in untestability identification operate at the logic-level and, thus, the methods do not scale. Current paper points out a new class of sequentially untestable faults, called register input logic stuck-on faults. We show that it is possible to identify such faults from the registertransfer level (RTL) description of the circuit. Moreover, we prove by experiments that the considered faults form a large subclass of all the untested faults.
A BIST Technique for RF Voltage-Controlled Oscillators
Authors: Hsieh-Hung Hsieh, Yen-Chih Huang, Liang-Hung Lu, Guo-Wei Huang
Venue: Proceedings of the 16th Asian Test Symposium (2007)

A built-in self-test (BIST) architecture is proposed for voltage-controlled oscillators (VCO) operating at multigigahertz frequencies. By utilizing a frequency divider and a frequency-to-voltage converter (FVC), the output frequency and tuning range of the VCO can be extracted without external test instruments. The proposed BIST module is integrated with a wideband VCO as the DUT in a 0.18-ìm CMOS process for demonstration. Within the tuning range of the VCO from 4.4 to 5.5 GHz, a frequency extraction error less than ±0.4% is achieved. The active area and the power consumption of the BIST module are 0.038 mm2 and 11 mW, respectively.
Error Free Computation: A Direct Method to Convert Finite-Segment p-Adic Numbers into Rational Numbers
Authors: A. Froment
Venue: IEEE Transactions on Computers (1983)

Elements of finite-segment p-adic arithmetic are briefly recalled, and a new direct method to convert finite-segment p-adic numbers into rational numbers is described.
Algorithmic Design of a Fuzzy-Neural Method
Authors: William Franklin
Venue: Computing in Science and Engineering (2007)

This article presents an algorithmic approach to a fuzzy-neural method and shows how to couple fuzzy logic and neural networks to provide an efficient, adaptive transform method. The whole process is adaptive, and the neural network responds to fuzzy-logic input and logistics.
Efficient Stereo Vision for Obstacle Detection and AGV Navigation
Authors: Rita Cucchiara, Emanuele Perini, Giuliano Pistoni
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

The paper presents the design and implementation of a system of autonomous navigation of a mobile robot with stereo vision.
Non-Functional Attributes Modeling in Software Architecture
Authors: Zhang Jingjun, Li Furong, Zhang Yang, Wang Liguo
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Non-functional attributes, such as security, reliability, and maintainability in software architecture, typically can not be encapsulated with traditional objects and components, but AOP can. However, AOP is not mature enough to realize the reuse of aspect. In view of this, AOP is introduced to the architecture, and a new entity, aspect connector, is put forward to model the non-functional attributes. Furthermore, a new ADL is used to describe the aspect connector. Finally, a case of book management system is used to explain the method. The results show that the aspect connector not only model the non-functional attributes, but also reduce the complexity of the system and increase software's reusability and maintainability.
Secure probabilistic location verification in randomly deployed wireless sensor networks
Authors: E. Ekici, S. Vural, J. McNair, D. Al-Abri
Venue: Ad Hoc Networks (2008)

Security plays an important role in the ability to deploy and retrieve trustworthy data from a wireless sensor network. Location verification is an effective defense against attacks which take advantage of a lack, or compromise, of location information. In this work, a secure probabilistic location verification method for randomly deployed dense sensor networks is proposed. The proposed Probabilistic Location Verification (PLV) algorithm leverages the probabilistic dependence of the number of hops a broadcast packet traverses to reach a destination and the Euclidean distance between the source and the destination. A small number of verifier nodes are used to determine the plausibility of the claimed location, which is represented by a real number between zero and one. Using the calculated plausibility metric, it is possible to create arbitrary number of trust levels in the location claimed. Simulation studies verify that the proposed solution provides high performance in face of various types of attacks.
Grid Locality Enhanced by Job Schedule
Authors: Ai Lihua, Luo Siwei
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

It is highly needed on grid environment to have a high degree of data reuse to increase the performance. We present a concept of grid locality to identify it. We further propose a job scheduler with swarm intelligence (short for JSI) to enhance this grid locality. Experiments show that the performance has been improved explicitly by JSI scheduler and a better grid locality has been reached.
Underflow and the Denormalized Numbers
Authors: J. T. Coonen
Venue: Computer (1981)

Although there have been misconceptions about it, gradual underflow fits naturally into the proposed standard and leads to simple, general statements about the arithmetic.
SAWSDL: Semantic Annotations for WSDL and XML Schema
Authors: Jacek Kopecký, Tomas Vitvar, Carine Bournez, Joel Farrell
Venue: IEEE Internet Computing (2007)

Web services are important for creating distributed applications on the Web. In fact,they're a key enabler for service-oriented architectures that focus on service reuse and interoperability. The World Wide Web Consortium (W3C) has recently finished work on two important standards for describing Web services: the Web Services Description Language (WSDL) 2.0 and Semantic Annotations for WSDL and XML Schema (SAWSDL). Here, the authors discuss the latter, which is the first standard for adding semantics to Web service descriptions.