ppxscal/embedding_network huggingface dataset:
Using Dependence Matrix to Support Change Impact Analysis for CBS
Authors: Chengying Mao, Jinlong Zhang, Yansheng Lu
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

Component-based software development technique and its extensive application have led to the wide research in various aspects of component-based software (CBS). The rapid evolution of CBS brings great challenges to its maintenance in the later phase, so it is quite necessary to measure the change impact on the whole system. By using component dependence matrix to represent component-based software system, the paper mainly discusses the case of component modification, including the single component change and the changes of multi-components, and proposes the corresponding algorithms (i.e. Appxm_RM, Generate_SP, and Calculate_CR) for analyzing the change impacts in CBS. In addition, the calculation process of change impact analysis and its effectiveness are also validated by a simple CBS.
Design of efficient routing method for USN based Large-scale Glass Greenhouses
Authors: Hyun-joong Kang, Meong-hun Lee, Hyun Yoe
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Recently, wireless communication technology and state-of-the-art miniaturization have enabled the wireless sensor network with smart environmental sensors. The sensor network is a new field which has been vigorously researched in the ubiquitous computing and Ad hoc network. How efficiently use the limited energy in this USN (Ubiquitous Sensor Network) has been debated recently. Utilizing the Directed Diffusion and Gossiping algorithm which is based on the Large-scale Glass Greenhouses, we present a method to prolong the lifespan of the sensor network by transmitting the relevant control packet on an aperiodic basis. In the paper, we present a method to minimize the energy consumption of sensor nodes within Glass Greenhouses and ensure stable network operation at the same time through energy efficient routing between sensor nodes.
An Accurate Image Registration Method Using a Projective Transformation Model
Authors: Felix Calderon, Leonardo Romero
Venue: Proceedings of the Eighth Mexican International Conference on Current Trends in Computer Science (2007)

Given a model structure, an input image and a reference image, the parametric registration task is to find a parameters vector (of the model) that transform the input image into the reference image. This paper reviews the general projective model and develops a new method of computing the set of image derivatives needed. It shows how the classical method reported in the literature is only accurate under translation, and it fails when other transformations are involved. Analytical derivations and experimental tests show the superior accuracy of the new method against the classical method.
Investigation of voltage-swing effect and trap generation in high-k gate dielectric of MOS devices by charge-pumping measurement
Authors: Chun-Yuan Lu, Kuei-Shu Chang-Liao, Chun-Chang Lu, Ping-Hung Tsai, Yin Yin Kyi, Tien-Ko Wang
Venue: Microelectronic Engineering (2008)

Charge-pumping (CP) techniques with various rise and fall times and with various voltage swings are used to investigate the energy distribution of interface-trap density and the bulk traps. The charge pumped per cycle (Q"c"p) as a function of frequency was applied to detect the spatial profile of border traps near the high-k gate dielectric/Si interface and to observe the phenomena of trap migration in the high-k dielectric bulk during constant voltage stress (CVS) sequence. Combining these two techniques, a novel CP technique, which takes into consideration the carrier tunneling, is developed to measure the energy and depth profiles of the border trap in the high-k bulk of MOS devices.
Simulated Annealing Algorithm for Independent Tasks Assignment in Heterogeneous Computing Systems
Authors: RongYing Cai, ZhengYuan Ning, LiShan Li, YiWen Zhong
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Efficient tasks assignment is critical for achieving high performance in heterogeneous computing systems (HCS). The tasks assignment problem is NP-hard in general. In order to obtain better solutions, many assignment heuristics have been presented in the literature. Simulated Anneal- ing (SA) algorithm is a powerful stochastic search method. It has been successfully used in many discrete optimization problems, such as TSP, JSP, and QAP, etc. After analyz- ing the impact of SA's neighborhood on its performance, this paper defines two neighborhood structures first, then it presents a SA algorithm to tackle independent tasks as- signment problem in HCS. The simulation results show that after using a suitable neighborhood system, SA algorithm is effective for independent tasks assignment problem in HCS.
Discrete Cosine Transfom
Authors: N. Ahmed
Venue: IEEE Transactions on Computers (1974)

A discrete cosine transform (DCT) is defined and an algorithm to compute it using the fast Fourier transform is developed. It is shown that the discrete cosine transform can be used in the area of digital processing for the purposes of pattern recognition and Wiener filtering. Its performance is compared with that of a class of orthogonal transforms and is found to compare closely to that of the Karhunen-Loève transform, which is known to be optimal. The performances of the Karhunen-Loève and discrete cosine transforms are also found to compare closely with respect to the rate-distortion criterion.
In pursuit of peace: Attitudinal and behavioral change with simulations and Multiple Identification Theory
Authors: Robert Howard Williams, Alexander Jonathan Williams
Venue: Simulation and Gaming (2007)

The authors have developed a theory of simulation game design (Multiple Identification Theory; MIT) based on earlier research and several of their own studies. They utilize this theory to create a simulation game designed to change attitudes from a stance of competition to one of cooperation. Three questionnaires are constructed that measure participants' attitudes toward "cooperation versus competition," "truth and trust versus deception and mistrust," and "social view of conflict versus individual view of conflict." Participants play a simulation designed by the authors in accordance with MIT. All students complete pretests of the attitude questionnaires, play the simulation twice, and then complete posttests of the same questionnaires. In addition to these data, behavioral measures of the players' cooperative or aggressive conduct during the simulations are recorded. Quantitative and qualitative analysis found significant change (in a cooperative direction) for all measures. Robust e fect sizes are also reported. It is believed this study provides encouraging initial support for the e ficacy of simulations designed via MIT in changing attitudes and behavior. It is suggested that such research is of special importance for the promotion of cooperation and peace as alternatives to competition and aggression.
Client certificate and IP address based multi-factor authentication for J2EE web applications
Authors: Heesun Park, Stan Redford
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

Secure and encrypted authentication is an important aspect of J2EE web application security. SSL client certificate authentication provides an encrypted log-on mechanism and a single sign-on capability that does not involve the use of passwords. Unlike SPNEGO-protocol-based Kerberos authentication, which requires both parties to be in the same domain, client certificate authentication works across domain boundaries as long as the user registry for the application server is properly set up to handle the certificate. But client certificate authentication comes with some shortcomings---especially when the client certificate is used from an unauthorized machine. We will examine this potential vulnerability of client certificate authentication and show how to make this type of authentication more secure by using multi-factor authentication. Adding an IP-address-checking servlet filter to the web application is one good approach. We will provide implementation details as well.
Capacity Analysis for Flat and Clustered Wireless Sensor Networks
Authors: Min Song, Bei He
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

Wireless sensor networks are often divided into clusters to gain high-performance and prolong network lifetime. In this paper we analyze the network capacity of two different architectures, named flat sensor network and clustered sensor network. For each network, we first define the network model and then analyze the network capacity and the factors that affect the capacity. Numerical results suggest that clustering can significantly improve the network capacity. We also found that the capacity of a clustered network is saturated after the number of clusters is above a certain value. For clustered network architecture, we further study the capacity difference with or without the distributed coordination function. It is found that there is a critical value of the number of cluster heads beyond which the network capacity of two clustered models approaches the same. Results from this research will provide guidance in deploying highperformance wireless sensor networks.
Low-Power High-Speed 180-nm CMOS Clock Drivers
Authors: T. Enomoto, S. Nagayama, N. Kobayashi
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

The power dissipation (PT) and delay time (tdT) of a CMOS clock driver were minimized. Eight test circuits, each of which has 2 two-stage clock drivers, and a register array were fabricated using 0.18-mum CMOS technology. The first and second stages of the driver consisted of a single inverter and m inverters, respectively, and the register array stage was constructed with N delay flip-flops (D-FFs). A single inverter in the second stage drove N/m D-FFs where N was fixed at 40 and m varied from 1 to 40. Minimum PT and tdT were 251 muW and 0.640 ns, respectively and were both obtained at an m of 8. These values were 48.6% and 29.4% of maximum PT and tdT respectively. Simulated and measured results agreed well with these SPICE simulated results.
Figure of Merit for Fault-Tolerant Space Computers
Authors: H. Hecht
Venue: IEEE Transactions on Computers (1973)

To aid the computer designer in addressing the proper reliability goals, an economic model is proposed in which any increase in cost for reliability is evaluated against the expected decrease in cost of failure. These criteria are applied in an example to optimize the memory configuration of a computer that has a five-year lifetime requirement in space. An internal figure of merit is developed that can be used by the computer designer when little specific spacecraft and mission data are available. A more general external figure of merit can be used when mission parameters are defined. This latter is useful both for the computer designer and the spacecraft systems engineer.
Software/Hardware Co-Scheduling for Reconfigurable Computing Systems
Authors: Proshanta Saha, Tarek El-Ghazawi
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

A formal methodology for automatic hardware-software partitioning and co-scheduling between the ìP and the FPGA has not yet been established. Current work in automatic task partitioning and scheduling for the reconfigurable systems strictly addresses the FPGA hardware, and does not take advantage of the synergy between the microprocessor and the FPGA. In this work, we consider the problem of co-scheduling task graphs on reconfigurable systems. The target systems have an execution model which allows any subtask that can run on the FPGA to also run on the microprocessor, and allows reconfigurability of the FPGA (subject to area, performance, resource, and timing constraints). In this paper, we introduce a new heuristic algorithm for such hardware/software co-scheduling, ReCoS. It will be shown that the proposed algorithm provides up to an order of magnitude improvement in scheduling and execution times when compared with hardware/software co-schedulers found in the embedded systems area, after adapting them for reconfigurable computing.
Conditional variance estimation using stochastic learning algorithm
Authors: Young-Bin Cho, Dae-Gab Gweon
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1999)

Aritificial neural networks may be used for a function approximator which includes not only deterministic but also probabilistic model. Conditional variance estimation using a neural network is a good example of probabilistic model approximation, because conditional variance, which is a function of input variable, is an important parameter to describe a Gaussian probabilistic model. The majority of learning algorithms are based on a concept of likelihood maximization or expectation maximization method. This article presents an alternative learning algorithm based on a different concept for a multilayer perceptron. The proposed variance learning algorithm can be regarded as a kind of modified delta rule, where delta is determined by an iterative estimation algorithm, which is also proposed in this article. The proposed learning algorithm has stochastic property because the delta is stochastically determined by the estimation algorithm. Relationships of delta to the transient and steady state of the learning process are also stochastic. First, the iterative variance estimation algorithm is explained. Second, the transient state behavior is investigated to have an insight into convergence and stability properties with respect to delta. Third, the steady state analysis is described to show the relationship of delta to steady state error bound. Theoretical analysis on steady state behavior produces analytic formula for steady state error bound of the variance learning algorithm in terms of the delta. Finally, multilayer perceptron using the proposed learning algorithm is simulated for the demonstration of variance estimation.
An Approach For Edge Detection Based On Beamlet Transform
Authors: Xiaoming Mei, Liang-pei Zhang, Ping-xiang Li
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Edge detection is very useful and important for image processing and computer vision, as it can locate significant variations of gray images. In this paper, an algorithm based on beamlet transform is proposed to detect edges in image. Beamlets can be generated by recursive dyadic partitioning, vertex marking and connecting, the beamlet transform is the collection of all line integrals formed by viewing the image as a piecewise constant object and integrating along line segment in the beamlet dictionary, for the maximal beamlet coefficient surviving the Canny criterion, draw a line segment depicting that beamlet, all these beamlets in different scales are fused to generate an edge map at the image pixel level. The propose method can detect lines with any orientation, location and length in different scales and avoids subjective setting. Experimental results show that the proposed method can detect edges accurately even from noise image and has a better performance. It can be suited to different images processing, in practice it has surprisingly powerful and apparently unprecedented capabilities.
Implementation of a Standby-Power-Free CAM Based on Complementary Ferroelectric-Capacitor Logic
Authors: S. Matsunaga, T. Hanyu
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

A complementary ferroelectric-capacitor (CFC) logic-circuit style is proposed for a compact and standby-power-free content-addressable memory (CAM). Since the use of the CFC logic circuit in designing a CAM cell makes it possible to merge both logic and non-volatile storage elements into serially connected ferroelectric capacitors, the CAM becomes compact. The standby power of the CAM is completely eliminated because the supply voltage can be cut off with maintaining stored data in the CAM. The test chip is fabricated by using 0.35-mum ferroelectric CMOS, and the basic behavior can be also measured.
Handover management based on the number of data frame retransmissions for VoWLAN
Authors: Shigeru Kashihara, Yuji Oie
Venue: Computer Communications (2007)

Ubiquitous networks enabling access by mobile nodes (MNs) at any time and at any location will consist of innumerable Wireless Local Area Networks (WLANs). In such ubiquitous networks, it is very likely that an MN will traverse several WLANs, due to each having a small service area, during VoIP communication. Thus, a single communication may experience several handovers between WLANs divided into different IP subnets by Internet Service Providers (ISPs), during which the communication quality may be degraded due to packet loss. In this paper, we propose an effective handover management scheme for Voice over IP (VoIP) communication in which the quality is sensitive to packet loss. For this purpose, our handover management scheme employs a transport protocol supporting multiple connections for VoIP communication and makes handover decisions based on a new criterion: the number of retransmissions experienced by a data frame on layer 2. Furthermore, to prevent packet loss during handover and to investigate the wireless link condition, the proposed handover management scheme selects single-path transmission or multi-path transmission according to the number of frame retransmissions. Through simulation experiments, we show that the proposed handover management scheme can promptly and reliably detect the degradation in a wireless link, and can reduce packet loss during handover.
Mobile ad hoc networking and the IETF
Authors: Joseph P. Macker, M. Scott Corson
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1999)

This is a continuing article in a series [2, 3, 4, 5] providing a snapshot of work underway within the Mobile Ad hoc Networks (manet) Working Group (WG) of the Internet Engineering Task Force (IETF) [1]. This article summarizes proceedings of the last manet WG meeting held in December 1998 and presents issues currently under discussion within the WG.
An Efficient Peak Power Reduction Technique for Scan Testing
Authors: Meng-Fan Wu, Kai-Shun Hu, Jiun-Lang Huang
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Power management is posing serious challenges for scan-based testing. In this paper, we propose a low power test pattern generation technique which minimizes the peak power consumption associated with the scan and capture operations. Given a set of fully specified test patterns, the proposed technique iteratively replaces the high power consumption patterns with low power ones generated by a PODEM-based low power ATPG. The proposed technique has been validated using ISCAS89 benchmark circuits. Compared to a commercial ATPG using high merge ratio and random-fill options, the proposed technique reduces the peak shift and capture power by 27.3% and 19.6%, respectively, and the average power by 49.9%.
A Road Extraction Approach Based on Fuzzy Logic for High-Resolution Multispectral Data
Authors: Youchuan Wan, Shaohong Shen, Yang Song, Shufan Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

In this paper, we present an approach based on information fusion for road networks extraction from high-resolution multi-spectral satellite image data that builds upon pixel-b a s e d f u z z y logic segmentation approach. This road networks extraction system includes three different modules: geometrical features processing based on local context; segmentation based on fuzzy classification; angular texture signature to refine road clusters. Experimental results show that this method is efficient and distinct in the discrimination of roads and other spectral similar land cover classes. Keywords: Road extraction; Image geometrical feature; Fuzzy logic; Image segmentation
Pascal: An Overview
Authors: G. M. Schneider
Venue: Computer (1979)

Pascal-even with its flaws-offers significant advantages over simplistic languages such as Fortran or Basic, without requiring the enormous resources of PL/I or Algol 68.
Conclusions
Authors: G. de Balbine
Venue: Computer (1975)

The main trends discernible both in Session IV and in the general discussion that ended the 1974 Lake Arrowhead Workshop can be summarized as follows: 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
An Improved Hybrid Genetic Algorithm for the Stochastic Loader Problem
Authors: Hong Wang, Jun Ma, Peixin Zhao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

In this paper, we extend Tang's basic loader problem model by proposing the stochastic quantity of load and unload at each station so that the model is more applicable in practice. For finding the optimal solutions, we present an improved hybrid genetic algorithm that combines self-adapting crossover, learning process and stochastic mutation operators. Comparing with the genetic algorithm, this improved algorithm adequately utilizes the adaptability information of current individuals and has better convergence efficiency and higher solution precision. Two numerical examples illustrate the validity and efficiency of the new hybrid genetic algorithm.
Testing of Asynchronous NULL Conventional Logic (NCL) Circuits in Synchronous-Based Desig
Authors: Waleed K. Al-Assadi, Sindhu Kakarla
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

Conventional Automatic Test Pattern Generation (ATPG) algorithms would fail when applied to asynchronous circuits due to the absence of a global clock and presence of more state holding elements that synchronize the control and data paths, leading to poor fault coverage. This paper presents a Design for Test (DFT) approach aimed at making asynchronous NCL circuits testable using conventional ATPG tools when incorporated with synchronous-based designs. The proposed approach performs scan and test points insertion on NCL designs using custom ATPG library. Experimental results show significant increase in fault coverage for NCL cyclic and acyclic pipelined designs.
The Boolean Difference and Multiple Fault Analysis
Authors: Chia-Tai Ku
Venue: IEEE Transactions on Computers (1975)

The Boolean difference is a well-known mathematical concept which has found significant application in the single fault analysis of combinational logic circuits. One of the primary attributes of the Boolean difference in such situations is its completeness. In this paper we extend the Boolean difference concept to cover multiple fault situations. Expressions are developed which give all possible input patterns that can be applied to combinational logic circuits to demonstrate the presence or absence of a specified multiple fault of the stuck-type class. Such expressions are useful in situations where at most, say, p simultaneous faults need be considered, as well as situations where any multiple fault can exist. In addition the expressions developed are also shown to complete some existing single fault analysis concepts.