ppxscal/embedding_network huggingface dataset:
A Traceability Link Model for the Unified Process
Authors: Patrick Maeder, Ilka Philippow, Matthias Riebisch
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Traceability links are widely accepted as efficient means to support an evolutionary software development. However, their usage in analysis and design is effort consuming and error prone due to lacking or missing methods and tools for their creation, update and verification. In this paper we analyse and classify Unified Process artefacts to establish a traceability link model for this process. This model defines all required links between the artefacts. Furthermore, it provides a basis for the (semi)-automatic establishment and the verification of links in Unified Process development projects. We also define a first set of rules as step towards an efficient management of the links. In the ongoing project the rule set is extended to establish a whole framework of methods and rules.
Tempest: A portable tool to identify hot spots in parallel code
Authors: Kirk W. Cameron, Hari K. Pyla, Srinidhi Varadarajan
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Compute clusters are consuming more power at higher densities than ever before. This results in increased thermal dissipation, the need for powerful cooling systems, and ultimately a reduction in system reliability as temperatures increase. Over the past several years, the research community has reacted to this problem by producing software tools such as HotSpot and Mercury to estimate system thermal characteristics and validate thermal-management techniques. While these tools are flexible and useful, they suffer several limitations. For the average user such simulation tools can be cumbersome to use. These tools may take significant time and expertise to port to different systems. Lastly, such tools produce significant detail and accuracy at the expense of execution time enough to prohibit iterative testing. We propose a fast, easy to use, accurate, portable software tool called Tempest (for temperature estimator) that leverages emergent thermal sensors to enable user profiling, evaluating, and reducing the thermal characteristics of systems and applications. In this paper, we illustrate the use of Tempest to analyze the thermal effects of various parallel benchmarks in clusters.
Pseudo-ARQ for a Low Density Parity Check Code Decoder
Authors: Damien Alleyne, Janak Sodha
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

A pseudo automatic repeat request scheme for a LDPC decoder is presented which dramatically improves the probability of an error in an information binary digit over the signal-to-noise ratio (SNR) range 0 dB to 2 dB, by sacrificing the information throughput, with the added advantage of not being adversely affected by a fluctuation in the channel SNR. A frame, which consists of the concatenation of several code words, is retransmitted only if the channel signal- to-noise ratio estimate is found to be lower than a set threshold. Overall, the throughput is only briefly reduced as required to ensure excellent performance over low and high SNRs. Simulation results are presented for rate ½ (288, 576) WiMAX 802.16e LDPC code over an AWGN channel with binary phase shift keying (BPSK) modulation.
Perceptual Shape-Based Natural Image Representation and Retrieval
Authors: Xiaofen Zheng, Scott A. Sherrill-Mix, Qigang Gao
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Human visual recognition is based largely on shape, yet effectively using shapes in natural image retrieval is a challenging task. Most existing methods are based on the geometric equations of curves computed from processing an entire image. These processes are computationally intensive, lack flexibility and do not take advantage or with minimum use of the Gestalt rules of human vision. By applying certain mechanisms based on the human visual perception process, our methods extract generic shape features from real world images. We extract and group perceptually significant segments and use their properties to create a Euclidean distance matrix for image retrieval. As all the computing is based on simple calculation and one pixel width edges instead of the whole image, this method provides a novel and efficient image feature representation. Testing on standard benchmark datasets and comparison with other well-known methods show this shape analysis method using only compact feature vectors performs well and robustly for real world images.
Systolic Algorithnis for Local Operations on Images
Authors: C. Guerra
Venue: IEEE Transactions on Computers (1986)

Local operators, used in many image processing tasks, involve replacing each pixel in an image with a value computed within a local neighborhood of that pixel. Computing such operators at the video rate requires a computing power which is not provided by conventional computers. Though computationally expensive, local operators are highly regular. Thus, a VLSI implementation appears particularly appropriate. This correspondence presents systolic algorithms for tasks such as connected component determination, distance transform, and relaxation, which are defined in terms of local operators.
On Deadlock Detection in Distributed Systems
Authors: V. D. Gligor
Venue: IEEE Transactions on Software Engineering (1980)

A hierarchically organized and a distributed protocol for deadlock detection in distributed databases are presented in [1]. In this paper we show that the distributed protocol is incorrect, and present possible remedies. However, the distributed protocol remains impractical because "condensations" of "transaction-wait-for" graphs make graph updates difficult to perform. Delayed graph updates cause the occurrence of false deadlocks in this as well as in some other deadlock detection protocols for distributed systems. The performance degradation that results from false deadlocks depends on the characteristics of each protocol.
Wavelet-based denoising using subband dependent threshold for ECG signals
Authors: S. Poornachandra
Venue: Digital Signal Processing (2008)

This paper employs a wavelet-based denoising technique for the recovery of signal contaminated by white additive Gaussian noise and investigates the noise free reconstruction property of universal threshold. A new thresholding procedure is proposed, called subband adaptive. The parameters of this procedure are chosen by difference in mean method. Simulations are carried out in MATLAB using various ECG signals. The results show that the proposed thresholding technique outperforms the existing thresholding techniques.
A Quasi-Lossless Data Embedding Technique Based on Euclidean Distance Calculation
Authors: Noura A. Saleh, Hoda N. Boghdady, Samir I. Shaheen, Ahmed M. Darwish
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

Recently data embedding over images have drawn tremendous interest, using either lossy or lossless techniques. Although lossy techniques can allow large hiding capacity, host image cannot be recovered with high fidelity. The aim of this work is to increase the embedding capacity for color palletized images while maintaining good visual quality of the stego image. The new technique is named "quasi-lossless" because the image histogram has been slightly changed but still satisfies high PSNR threshold that kept the stego image visually unchanged. The quasi-lossless technique is based on histogram analysis where least repeated colors are identified and manipulated to increase the embedding capacity. The proposed technique reported an embedding capacity that reached up to 60% and an improvement of more than 25% compared with other lossless method.
Research Challenges for On-Chip Interconnection Networks
Authors: John D. Owens, William J. Dally, Ron Ho, D. N. (Jay) Jayasimha, Stephen W. Keckler, Li-Shiuan Peh
Venue: IEEE Micro (2007)

On-chip interconnection networks are rapidly becoming a key enabling technology for commodity multicore processors and SoCs common in consumer embedded systems. Last year, the National Science Foundation initiated a workshop that addressed upcoming research issues in OCIN technology, design, and implementation and set a direction for researchers in the field.
An Algorithm of Discovering Approximate Periodicity Based on Self-Organizing Map for Temporal Data
Authors: Zhiqing Meng, Hua Jiang, Min Jiang, Yubao Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

This paper discusses an algorithm of discovering approximate periodicity for temporal data based on self- organizing map (SOM). First, an approximate periodic pattern based on the temporal type data is given. Then, some concepts of approximate precision and approximate periodic pattern mantle are introduced, where their relative properties are studied. Finally, an algorithm based on SOM to find approximate periodic pattern is proposed. Experiment results show that the proposed algorithm is efficient for finding out approximate periodicity for irregularity data.
Transport in Protein Crystals, Part I: Insights from Molecular Simulations
Authors: Kourosh Malek
Venue: Computing in Science and Engineering (2007)

In addition to simulations of transport processes in protein crystals, this article highlights the importance of protein–solvent interactions. It's important, for example, to know whether the catalytic properties of proteins are the same in crystal and in solution.
CMOS Photonics - Bringing Moore's Law to Optical Interconnect
Authors: Alex Dickinson
Venue: Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects (2007)

The acceleration of video as a key network application, combined with the scaling on-chip interconnect needs of multi-core processors, is driving the need for silicon-compatible high bandwidth low latency optical interconnect. CMOS Photonics is a technology that seamlessly merges optics and electronics within production silicon chips, enabling a completely new generation of optical interconnect. This talk will overview the technology, key application areas, and timing of its market rollout.
Error Detection Using Path Testing and Static Analysis
Authors: C. Gannon
Venue: Computer (1979)

How many types of errors can be detected through static analysis and branch testing? How many man-hours and machine hours do these techniques require? Here are some empirically determined answers.
Discovering global network communities based on local centralities
Authors: Bo Yang, Jiming Liu
Venue: ACM Transactions on the Web (TWEB) (2008)

One of the central problems in studying and understanding complex networks, such as online social networks or World Wide Web, is to discover hidden, either physically (e.g., interactions or hyperlinks) or logically (e.g., profiles or semantics) well-defined topological structures. From a practical point of view, a good example of such structures would be so-called network communities. Earlier studies have introduced various formulations as well as methods for the problem of identifying or extracting communities. While each of them has pros and cons as far as the effectiveness and efficiency are concerned, almost none of them has explicitly dealt with the potential relationship between the global topological property of a network and the local property of individual nodes. In order to study this problem, this paper presents a new algorithm, called ICS, which aims to discover natural network communities by inferring from the local information of nodes inherently hidden in networks based on a new centrality, that is, clustering centrality, which is a generalization of eigenvector centrality. As compared with existing methods, our method runs efficiently with a good clustering performance. Additionally, it is insensitive to its built-in parameters and prior knowledge.
Design and Path Planning for a Remote-Brained Service Robot
Authors: Shigang Cui, Zhengguang Lian, Li Zhao, Zhigang Bing, Hongda Chen
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

This paper presents a novel robot named "TUT03-A" with expert systems, speech interaction, vision systems etc. based on remote-brained approach. The robot is designed to have the brain and body separated. There is a cerebellum in the body. The brain with the expert systems is in charge of decision and the cerebellum control motion of the body. The brain-body interface has many kinds of structure. It enables a brain to control one or more cerebellums. The brain controls all modules in the system and coordinates their work. The framework of the robot allows us to carry out different kinds of robotics research in an environment that can be shared and inherited over generations. Then we discuss the path planning method for the robot based on ant colony algorithm. The mathematical model is established and the algorithm is achieved with the Starlogo simulating environment. The simulation result shows that it has strong robustness and eligible path finding efficiency.
Some Aspects of Gaussian-Hermite Moments in Image Analysis
Authors: Lin Wang, Youfu Wu, Mo Dai
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

The normalized orthogonal (orthonormal) Hermite moments, or Gaussian-Hermite moments, have a good performance to recover the original image, although with a limited number of moments. Hence, Gaussian- Hermite moments can be used to characterize images patterns due to its good properties. The paper also compares the noise sensibility between Gaussian- Hermite moments and geometric ones and gives experimental results in some applications. It is shown that Gaussian-Hermite moments are effective tools for image analysis.
Learning query-biased web page summarization
Authors: Changhu Wang, Feng Jing, Lei Zhang, Hong-Jiang Zhang
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Query-biased Web page summarization is the summarization of a Web page reflecting the relevance of it to a specific query. It plays an important role in search results representation of Web search engines. In this paper, we propose a learning-based query-biased Web page summarization method. The summarization problem is solved within the typical sentence selection framework. Different from existing Web page summarization methods that use page content or link context alone, both of them are considered as the sources of sentences in this work. Most of existing learning-based summarization methods treat summarization as a sentence classification problem and train a classifier to discriminate between extracted sentences and non-extracted sentences of all training documents. The basic assumption of these methods is that sentences from different documents are comparable with respect to the class information. In contrast to the classification scheme, a ranking scheme is introduced to rank extracted sentences higher than non-extracted sentences of each training document. The underlying assumption that sentences within a document are comparable is weaker and more reasonable than the assumption of classification-based scheme. Extensive results using intrinsic evaluation metrics gauge many aspects of the proposed method.
An Experimental Study of Software Metrics for Real-Time Software
Authors: H. A. Jensen
Venue: IEEE Transactions on Software Engineering (1985)

The rising costs of software development and maintenance have naturally aroused intere5t in tools and measures to quantify and analyze software complexity. Many software metrics have been studied widely because of the potential usefulness in predicting the complexity and quality of software. Most of the work reported in this area has been related to nonreal-time software. In this paper we report and discuss the results of an experimental investigation of some important metrics and their relationship for a class of 202 Pascal programs used in a real-time distributed processing environment. While some of our observations confirm independent studies, we have noted significant differences. For instance the correlations between McCabe's control complexity measure and Halstead's metrics are low in comparison to a previous study. Studies of the type reported here are important for understanding the relationship between software metrics.
Design, fabrication and performance of a new vibration-based electromagnetic micro power generator
Authors: Pei-Hong Wang, Xu-Han Dai, Dong-Ming Fang, Xiao-Lin Zhao
Venue: Microelectronics Journal (2007)

This paper presents a new vibration-based electromagnetic micro power generator fabricated using microelectromechanical systems (MEMS) technology, which can convert ambient vibration energy into electric power. The microgenerator consists of a permanent magnet of NdFeB, a copper planar spring and a two-layer copper coil. ANSYS modal analysis was used to predict the resonant frequencies and resonant vibration modes of the spring-mass system. The detailed fabrication processes of the microgenerator are given. Experimental results show that the prototype microgenerator can generate open-circuit voltage of 60mV ac peak-peak with 121.25Hz input frequency and the acceleration of 1.5g (g=9.8m/s^2). The experimental and simulated results were compared and discussed.
Enhancement of Dynamic Encoding Algorithm for Searches (DEAS) via Modified Decoding Function and Hopping Operation
Authors: Nam-Geun Kim, Jong Pil Yun, Sang Woo Kim
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

In this paper, two techniques are proposed for global- izing and accelerating the Dynamic Encoding Algorithm for Searches (DEAS) method which is developed within the framework of applying the binary representation in op- timization and modified for global search using a multi- start approach. These techniques make DEAS fitted better to global optimization than the previously developed ones. The results of numerical simulations show that the proposed techniques are effective in discontinuous and multimodal cost functions.
A traveling wave-based self-organizing communication mechanism for WSNs
Authors: Yoshiaki Taniguchi, Naoki Wakamiya, Masayuki Murata
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

We have proposed a simple and energy-efficient communication mechanism which can organize a variety of communication depending on dynamically changing application requirements. In this demonstration, we show that our mechanism can gather or diffuse information in accordance with application requirements in a dynamic wireless sensor network.
Measuring knowledge assets in companies using computational intelligence
Authors: Freimut Bodendorf, Manfred Schertler
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Measuring knowledge assets of a company is difficult. Most existing approaches either fail to select the right indicators, to facilitate aggregation of indicators, to reveal correlations between indicators or to forecast future indicator values. An approach to overcome these obstacles using Computational Intelligence (CI) is introduced. Different CI techniques are used to enhance two prominent knowledge assessment approaches, the Intellectual Capital Navigator and the Technology Balance.
An asynchronous scheme with local time stepping for multi-scale transport problems: Application to gas discharges
Authors: Thomas Unfer, Jean-Pierre Boeuf, François Rogier, Frédéric Thivet
Venue: Journal of Computational Physics (2007)

This paper presents an asynchronous integration scheme with local time stepping for transport problems. The concept consists in associating refresh time tags to the interface fluxes between cells and to the source terms within the cells rather than to the cell themselves. This scheme is less diffusive numerically than its synchronous equivalent. This method is very effective in terms of computation time for problems with localized sharp minima in the CFL condition. The method is then applied to dielectric barrier discharges for aerodynamic flow control.
QoS Enhancement for PDES Grid Based on Time Series Prediction
Authors: Suihui Zhu, Zhihui Du, Yinong Chen, Xudong Chai, Bohu Li
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

The combination of parallel/distributed discrete event simulation (PDES) and Grid technology is a new trend in simulation. QoS is important yet difficult in this process. With the special features of Gird architecture and PDES input, such as periodical and predictable inputs, we could enhance QoS with a PDES-specific prediction. A Grid-based framework is presented that is designed to help predict the performance of PDES. Based on this framework, a prediction algorithm using time series theory is presented in the context of large scale Grid simulations. Experiments are executed in the context of GridSim, which shows methods discussed before to help to improve QoS level.
Xbox360TM Front Side Bus - A 21.6 GB/s End-to-End Interface Design
Authors: David Siljenberg, Steve Baumgartner, Tim Buchholtz, Mark Maxson, Trevor Timpane, Jeff Johnson
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

With a bandwidth of 21.6 GB/s, the Front Side Bus (FSB) of the Microsoft Xbox360¿ is one of the fastest, commercially available Front Side Bus interfaces in the consumer market. This paper explains the end-to-end system approach used in designing the bus that achieved volume production ramp 18 months after design start. The 90 nm SOI-CMOS CPU and 90 nm bulk CMOS GPU designs are described. The chip carrier, circuit board, and signal integrity analyses are described. The design approach used to achieve high volume, low cost, and short development time is explained.
Improved algorithms for the random cluster graph model
Authors: Ron Shamir, Dekal Tsur
Venue: Random Structures Algorithms (2007)

We model noisy clustering data using random graphs: Clusters correspond to disjoint sets of vertices. Two vertices from the same set (resp., different sets) share an edge with probability p (resp., r < p). We give algorithms that reconstruct the clusters from the graph with high probability. Compared to previous studies, our algorithms have lower time complexity and apply under wider parameter range. &copy; 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007 A preliminary version containing some of the results has been published in the Proceedings of the Eighth Scandinavian Workshop on Algorithm Theory (SWAT 02).