ppxscal/embedding_network huggingface dataset:
Denoising aerial gamma-ray surveying through non-linear dimensionality reduction: Research Articles
Authors: Fabio Ramos, Bruce Dickson, Suresh Kumar
Venue: Journal of Field Robotics (2007)

This paper addresses the problem of denoising aerial gamma-ray surveying in mining exploration. Conventional methods for denoising spectral data make strong assumptions about the levels and type of noise which reduces their efficiency. The proposed methodology cast the problem as manifold learning followed by non-linear regression. The model makes no assumptions about the level and type of noise and performs significantly better than previous techniques on both synthetic and real data. &copy; 2007 Wiley Periodicals, Inc.
VLSI implementation of a real time fuzzy processor
Authors: G. C. Cardarilli, M. Re, R. Lojacono
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1998)

In this paper, the realization of a new fuzzy processor is described. Original approaches are used for the implementation of both the fuzzifier and defuzzifier. The fuzzifier architecture is simplified by using input membership functions of suitable shape. The robustness of the fuzzy inference mechanism well tolerates this simplification. The defuzzifier uses the Center of Gravity (COG) method whose performance is improved by a new look-up table based computation. Moreover, the whole system has been simplified by accepting small approximations in the evaluation of the more expensive arithmetic operations. These approximations are obtained by supposing some constraints on the input values and imply small errors in the final results. The proposed architecture is very efficient and its implementation requires small area. In fact, the layout of the processor, using a 1&thinsp;&mu;m CMOS technology, requires only 7 mm 2 of silicon area. A speed greater than 100 KFLIPS is obtained with a 20 MHz clock. As consequence, this architecture can be used as a core cell in complex system integrating a whole processing structure.
A New Split and Merge Algorithm for Structure Identification in Takagi-Sugeno Fuzzy Model
Authors: Ahmad Kalhor, Babak N. Araabi, Caro Lucas
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

In this paper a novel algorithm for structure identification of Takagi-Suegno (TS) fuzzy models based on split and merge clustering is purposed. In this algorithm, by using a sequential split procedure on data space, initial Gaussian functions as constructor blocks are created. By merging these initial blocks, new composite validity functions for locally linear models with a high degree of flexibility are estimated. The proposed algorithm results in TS-type locally linear fuzzy models with an abstract structure as well as high generalization. Desirable performance of this algorithm is illustrated at case study section.
An On-Line Square Root Algorithm
Authors: V. G. Oklobdzija
Venue: IEEE Transactions on Computers (1982)

In this correspondence a systematic derivation of an on-line square root algorithm is presented. The algorithm operates on variables represented in the normalized radix r floating-point system in a digit-by-digit fashion with an on-line delay of 1. The approach used in deriving the square root algorithm is described in detail. The basic characteristics of hardware-level implementation are also discussed.
Fine-Grained Software Metrics in Practice
Authors: Michael English, Jim Buckley, Tony Cahill
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Modularity is one of the key features of the Object- Oriented (OO) paradigm. Low coupling and high cohesion help to achieve good modularity. Inheritance is one of the core concepts of the OO paradigm which facilitates modularity. Previous research has shown that the use of the friend construct as a coupling mechanism in C++ software is extensive. However, measures of the friend construct are scarse in comparison with measures of inheritance. In addition, these existing measures are coarse-grained, in spite of the widespread use of the friend mechanism. In this paper, a set of software metrics are proposed that measure the actual use of the friend construct, inheritance and other forms of coupling. These metrics are based on the interactions for which each coupling mechanism is necessary and sufficient. Previous work only considered the declaration of a relationship between classes. The software metrics introduced are empirically assessed using the LEDA software system. Our results indicate that the friend mechanism is used to a very limited extent to access hidden methods in classes. However, access to hidden attributes is more common.
Optimization for the Process Parameters of Hydroforming Using Genetic Algorithm in Combination with FE Codes
Authors: Zhao Shengdun, Zhang Yong, Zhang Zhiyuan, Zhang Chengwei
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Hydroforming is relatively a new technology to manufacture ball valve shell, and the process parameters in hydroforming have the critical effects on the final part quality. In this paper, a novel method of optimization for the process parameters is developed. On basis of the quality demand of parts, the objective function is defined. Using the stress ratios as the optimization variables, the genetic algorithm in combination with FE coeds is applied to search the optimal process parameters. According to the optimal process parameters, the verified experiment is carried out. The results show that genetic algorithm is a feasible optimization method for obtaining the optimal process parameters in hydroforming.
A FDRS-Based Data Classification Method Used for Abnormal Network Intrusion Detection
Authors: Zhenxiang Chen, Haiyang Wang, Bo Yang, Lin Wang, Runyuan Sun
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

The data mining techniques used for extracting patterns that represent abnormal network behavior for intrusion detection is an important research area in network security. Based on the new proposed theoretical model of recognition space and further division method, this paper introduces a novel improvement of neural network classification: Further Division of Recognition Space(FDRS).Then studied the method to classify samples by mapping what to further divided recognition space.The proposed approach was applied to an Intrusion Detection System (IDS) with 41 inputs (features). Experimental results show that the proposed method was efficient in data classification and suitable for abnormal detection using network processor-based platforms.
Stability of solutions of differential equations under generalized pulse perturbations
Authors: A. D. Myshkis
Venue: Automation and Remote Control (2007)

Consideration was given to stability of the solution of the system of differential equations to the function of a locally bounded variation added to the right-hand side of the derivative (understood in the general sense). Simple attributes of stability and asymptotic stability were established for different classes of these equations.
Optimal BPC Permutations on a Cube Connected SIMD Computer
Authors: D. Nassimi
Venue: IEEE Transactions on Computers (1982)

In this correspondence we develop an algorithm to perform BPC permutations on a cube connected SIMD computer. The class of BPC permutations includes many of the frequently occurring permutations such as matrix transpose, vector reversal, bit shuffle, and perfect shuffle. Our algorithm is shown to be optimal in the sense that it uses the fewest possible number of unit routes to accomplish any BPC permutation.
Research on Extension to Role Based Access Control Mechanism on Workflow Platform
Authors: Wenyan Wang, Yunliang Long
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Based on the popular RBAC mechanism, the paper analyzed the new requirement of access control mechanism in workflow environment an built an RBACEx-AWE model to realize the function of dynamic access control. An integrated framework, which effectively combined the RBACEx-AWE, based authorization services and workflow engine component was presented. A secure authorization was successfully achieve in an individual secure domain.
Interest-aware information dissemination in small-world communities
Authors: A. Iamnitchi, I. Foster
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

Information dissemination is a fundamental and frequently occurring problem in large, dynamic, distributed systems. We propose a novel approach to this problem, interest-aware information dissemination, that takes advantage of small-world usage patterns in data-sharing communities. These small-world characteristics suggest that users naturally form groups of common interest. We propose algorithms for identifying these groups dynamically, without a need for explicit classification of topics or declaration of user interests. These algorithms use information about the data consumed by users to identify, via online computation, groups with similar interests. As a proof of concept, we apply this methodology to the problem of locating files in large user communities. Using real-world traces from a scientific community and from a peer-to-peer system, we show that proactive information dissemination within groups of common interest can reduce the search load by up to 70%. In addition, this approach naturally supports the efficient discovery of collections of files, a requirement specific to scientific data analysis tasks. We hypothesize that our algorithms can find numerous other uses in distributed systems, such as reputation management.
Scientific Visualization: A Necessary Chore
Authors: Joel E. Tohline
Venue: Computing in Science and Engineering (2007)

From the perspective of a computational scientist who models astrophysical fluid flows, the author describe successes and frustrations that he's had with developing and using scientific visualization techniques over the past few decades. He also presents a biased view toward the future.
Dependence of electrical properties on interfacial layer of Ta2O5 films
Authors: Jae-Woong Lee, Moon-Ho Ham, Wan-Joo Maeng, Hyungjun Kim, Jae-Min Myoung
Venue: Microelectronic Engineering (2007)

The change in the thickness and chemical states of the interfacial layer and the related electrical properties in Ta"2O"5 films with different annealing temperatures were investigated. The high-resolution transmission electron microscopy and X-ray photoelectron spectroscopy analyses revealed that the 700^oC-annealed Ta"2O"5 film remained to be amorphous and had the thinnest interfacial layer which was caused by Ta-silicate decomposition to Ta"2O"5 and SiO"2. In addition, the electrical properties were improved after annealing treatments. Our results suggest that an annealing treatment at 700^oC results in the highest capacitance and the lowest leakage current in Ta"2O"5 films due to the thinnest interfacial layer and non-crystallization.
On Improving the Energy Efficiency of Wireless Sensor Networks under Time-Varying Environment
Authors: Xiao-Hui Lin, Yu-Kwong Kwok, Hui Wang
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

The adaptive modulation and coding (AMC) schemes has long been adopted at physical layer to combat time-varying properties of the wireless channel. However, transmitting packet over deep fading channel can render extra energy expenditure, due to the incorporation of more error protection or usage of lower modulation mode, which is unaffordable for energy-limited wireless sensor device. To avoid such inefficient energy usage, a simple approach is to temporally buffer the packet when the channel is in deep fading, until the channel quality recovers. Nevertheless, buffering packet can lead to communication performance degradations -- communication latency and packet overflow, which should be taken into consideration in sensing applications with QoS requirements. In this paper, by using previously proposed discrete time queuing model, we analyze the effects of Rayleigh fading on the sensor communication system, and propose a cross-layer design on power aware communication of sensor device. Specifically, in such channel adaptive system, each sensor can judiciously accesses the medium according to the channel condition, traffic load, and buffer variation. Simulation and analytical results indicate that, such cross-layer design can lead to energy conservation by as much as 30-40 per cent.
Role of bonding time and temperature on the physical properties of coupled anisotropic conductive-nonconductive adhesive film for flip chip on glass technology
Authors: M. J. Rizvi, H. Lu, C. Bailey, Y. C. Chan, M. Y. Lee, C. H. Pang
Venue: Microelectronic Engineering (2008)

Using thermosetting epoxy based conductive adhesive films for the flip chip interconnect possess a great deal of attractions to the electronics manufacturing industries due to the ever increasing demands for miniaturized electronic products. Adhesive manufacturers have taken many attempts over the last decade to produce a number of types of adhesives and the coupled anisotropic conductive-nonconductive adhesive film is one of them. The successful formation of the flip chip interconnection using this particular type of adhesive depends on, among factors, how the physical properties of the adhesive changes during the bonding process. Experimental measurements of the temperature in the adhesive have revealed that the temperature becomes very close to the required maximum bonding temperature within the first 1s of the bonding time. The higher the bonding temperature the faster the ramp up of temperature is. A dynamic mechanical analysis (DMA) has been carried out to investigate the nature of the changes of the physical properties of the coupled anisotropic conductive-nonconductive adhesive film for a range of bonding parameters. Adhesive samples that are pre-cured at 170, 190 and 210^oC for 3, 5 and 10s have been analyzed using a DMA instrument. The results have revealed that the glass transition temperature of this type of adhesive increases with the increase in the bonding time for the bonding temperatures that have been used in this work. For the curing time of 3 and 5s, the maximum glass transition temperature increases with the increase in the bonding temperature, but for the curing time of 10s the maximum glass transition temperature has been observed in the sample which is cured at 190^oC. Based on these results it has been concluded that the optimal bonding temperature and time for this kind of adhesive are 190^oC and 10s, respectively.
MOOSS2: a CPU with support for HLL memory structures
Authors: Radim Ballner, Pavel Tvrdik
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

A support for high level programming languages (HLLs) and operating systems was addressed by many researches for decades. This support usually addressed fast execution, security enhancements, and implementation of some HLLs abstraction. However, the main effort was always aimed to increase the performance. In the past, the limiting factor was the amount of resources (e.g., transistors) that could be used on a chip. Today's integration has overcome this limit. In this paper, we present memory hierarchy based on an enhanced segmentation model that provides support for fine-grained memory protection, data structures of high level programming languages, and GC. The memory sub-system was designed for fast execution and we designed special caches to achieve this goal. In following sections we describe the memory model and caches used for descriptors and local variables.
An analysis of the most cited articles in software engineering journals - 2001
Authors: Claes Wohlin
Venue: Information and Software Technology (2008)

Citations and related work are crucial in any research to position the work and to build on the work of others. A high citation count is an indication of the influence of specific articles. The importance of citations means that it is interesting to analyze which articles are cited the most. Such an analysis has been conducted using the ISI Web of Science to identify the most cited software engineering journal articles published in 2001. The objective of the analysis is to identify and list the articles that have influenced others the most as measured by citation count. An understanding of which research is viewed by the research community as most valuable to build upon may provide valuable insights into what research to focus on now and in the future. Based on the analysis, a list of the 20 most cited articles is presented here. The intention of the analysis is twofold. First, to identify the most cited articles, and second, to invite the authors of the most cited articles in 2001 to contribute to a special section of Information and Software Technology. Three authors have accepted the invitation and their articles appear in this special section. Moreover, an analysis has been conducted regarding which authors are most productive in terms of software engineering journal publications. The latter analysis focuses on the publications in the last 20 years, which is intended as a complement to last year's analysis focusing on the most cited articles in the last 20 years [C. Wohlin, An Analysis of the Most Cited Articles in Software Engineering Journals - 2007, Information and Software Technology 49 (1) 2-11]. The most productive author in the last 20 years is Professor Victor Basili.
Special Feature Program Measurements on a High-Level Language Computer
Venue: Computer (1980)

Analysis of programs on the Symbol computer helped evaluate its unique architecture and provided insight into the use of programming languages in general. 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
Determining Modality and Factuality for Text Entailment
Authors: Roser Saurf, James Pustejovsky
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Recognizing textual entailment (TE) is a complex task involving knowledge from many different sources. One major source of information in this task is event factuality, since the inferences derivable from factual eventualities are different from those judged as possible or as non-existent. Some TE systems already factor in factuality features at the local level, but determining the factuality of events more generally involves dealing with information that is nonlocal to a particular textual event. In this paper, we present a tool providing events with their factuality values, characterized as pairs of modality and polarity features. In previous work, we identified polarity and modality at the local context with a performance of 92% precision and 56% recall. The research presented here extends and enhances our algorithm to incorporate the influence of non-local context as well as the identification of sources.
Segregation of moving objects using elastic matching
Authors: Vishal Jain, Benjamin B. Kimia, Joseph L. Mundy
Venue: Computer Vision and Image Understanding (2007)

We present a method for figure-ground segregation of moving objects from monocular video sequences. The approach is based on tracking extracted contour fragments, in contrast to traditional approaches which rely on feature points, regions, and unorganized edge elements. Specifically, a notion of similarity between pairs of curve fragments appearing in two adjacent frames is developed and used to find the curve correspondence. This similarity metric is elastic in nature and in addition takes into account both a novel notion of transitions in curve fragments across video frames and an epipolar constraint. This yields a performance rate of 85% correct correspondence on a manually labeled set of frame pairs. Color/intensity of the regions on either side of the curve is also used to reduce the ambiguity and improve efficiency of curve correspondence. The retrieved curve correspondence is then used to group curves in each frame into clusters based on the pairwise similarity of how they transform from one frame to the next. Results on video sequences of moving vehicles show that using curve fragments for tracking produces a richer segregation of figure from ground than current region or feature-based methods.
Routing wavelength and time-slot reassignment algorithms for TDM based optical WDM networks
Authors: P. Rajalakshmi, Ashok Jhunjhunwala
Venue: Computer Communications (2007)

In this paper, we consider the problem of maximizing the time of first lightpath request rejection, T in the circuit-switched time division multiplexed (TDM) wavelength-routed (WR) optical WDM networks. TDM is incorporated into WDM, to increase the channel utilization when the carried traffic does not require the entire channel bandwidth. In TDM-WDM network, multiple sessions are multiplexed on each wavelength by assigning a sub-set of the TDM slots to each session. Thus, given a session request with a specified bandwidth, a lightpath has to be established by using the routing, wavelength and time-slot assignment (RWTA) algorithms. If the lightpath cannot be established, lightpath request rejection or call blocking occurs. As each lightpath is substantial revenue and long-lived, lightpath request rejection is highly unfavourable in the optical backbone networks. In this paper, we are proposing an intelligent routing, wavelength and time-slot reassignment algorithm for multi-rate traffic demands, where, when a call gets blocked, the already established calls in the network are rerouted, wavelength and time-slot reassigned so as to accommodate the blocked call. Since we are talking of slow arrivals and long holding times for the lightpaths, it is possible to do this reassignment while provisioning a new call. Simulation based analyses are used to study the performance of the proposed reassignment algorithm. The results show that the proposed reassignment algorithm can be used to maximize the time of first call blocking, thereby accommodating more calls in the network before upgrading the network capacity.
The Challenge of Finding Intelligent Agents
Venue: IEEE Intelligent Systems (2007)

In the last issue, Editor in Chief James Hendler asked, "Where are all the intelligent agents?" Here, several readers offer answers.
Value-added treatment inference model for rule-based certainty knowledge
Authors: Min-Yuan Cheng, Chin-Jung Huang
Venue: Expert Systems with Applications: An International Journal (2008)

During various knowledge sources and expert comments in the knowledge base may lead to knowledge overlaps, conflicts or data size variations in the knowledge base, with wrong knowledge leads to wrong decisions. This study proposes using an O-A-RV structure to express rule-based knowledge, integrating conditional probability, vector matrix and artificial intelligence, and building a conditional probability knowledge similarity algorithm, so as to obtain a similarity matrix of knowledge and determines correlations among knowledge. Also proposed to use reliability factor theory to express knowledge conflicts, overlaps and data size variations. Based on knowledge correlations, a rule-based knowledge value-added treatment inference algorithm is set up to run value-added treatments, so that wrong decisions can be avoided.
Formal Techniques for Protocol Specification and Verification
Authors: C. Sunshine
Venue: Computer (1979)

Certain formal approaches, such as transition techniques and reachability analysis, show promising results when applied to protocol specification and verification.