ppxscal/embedding_network huggingface dataset:
Graph Spectral Segmentation of SAR Image Based on Information Similarity Measure
Authors: Haixia Xu, Zheng Tian, Mingtao Ding
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

In this paper, an information theory based similarity measure, calculable from synthetic aperture radar (SAR) image based on pixels, but relying on global image statistics, is proposed. It considers the texture of speckle noise which often carries useful information about the scene being imaged, thus can capture subtle variations of scene texture whenever they are embedded in a heavy speckle. Graph spectral segmentation method based on the information similarity measure is carried out on two real SAR images. Experimental results are very encouraging compared with the commonly used similarity measure.
Hardening Network Infrastructure: Not Suitable for Everyone
Authors: Antonio Izquierdo Manzanares
Venue: IEEE Distributed Systems Online (2007)

A review of "Hardening Network Infrastructure" by Wesley Noonan
Filter Design Based on the Theory of the Generalized Morphological Filter with Omnidirectional Structuring Element
Authors: Xiang-guang Zhang, Yun Liu, Chuan-xu Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

The close-opening or open-closing filter based on the morphological filters with the same size structuring element cannot remove all the positive or negative impulse noise effectively. To improve the performance of these two kinds of filter, the generalized close-opening and open-closing filter based on the morphological filter with the different size structuring element are put forward. Based on the generalized morphological filter, this paper suggests a kind of designing project of the filter that applies a new structuring element to the generalized morphological filter. The theoretical analysis and the simulation experiments of the image processing indicate that this kind of filter can not only remove noise effectively but also keep the details of the image sufficiently.
Fault-tolerant multi-level logic decoder for nanoscale crossbar memory arrays
Authors: M. Haykel Ben Jamaa, Kirsten E. Moselund, David Atienza, Didier Bouvet, Adrian M. Ionescu, Yusuf Leblebici, Giovanni De Micheli
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Several technologies with sub-lithographic features are targeting the fabrication of crossbar memories in which the nanowire decoder is playing a major role. In this paper, we suggest a way to reduce the decoder size and keep it defect tolerant by using multiple threshold voltages (VT), which is enabled by our underlying technology. We define two types of multi-valued decoders and model the defects they undergo due to the VT variation. Multi-valued hot decoders yield better area saving than n-ary reflexive codes (NRC), and under severe conditions, NRC enables a non-vanishing part of the code space to recover. There are many combinations of decoder type and number of VT's yielding equal effective memory capacities. The optimal choice saves area up to 24%. We also show that the precision of the addressing voltages for decoders with unreliable VT's is a crucial parameter for the decoder design and permits large savings in memory area.
An Improved Immune Evolutionary Algorithm for Multimodal Function Optimization
Authors: Xuesong Xu, Jing Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Based on the inspiration of immune system, a new multi-objective optimization algorithm is presented. The proposed approach adopts a cluster mechanism in order to divide the population into subpopulations for the stage of selection and reproduction. In the immune clonal selection process, a hybrid hypermutation operator is introduced to improve the variety of antibodies and affinity maturation, thus it can quickly obtain the global and local optima. The simulation results illustrated that the efficiency of the proposed algorithm for complicated function optimization and verified it's remarkable quality of the global and local convergence reliability.
Concave Learners for Rankboost
Authors: Ofer Melnik, Yehuda Vardi, Cun-Hui Zhang
Venue: The Journal of Machine Learning Research (2007)

Rankboost has been shown to be an effective algorithm for combining ranks. However, its ability to generalize well and not overfit is directly related to the choice of weak learner, in the sense that regularization of the rank function is due to the regularization properties of its weak learners. We present a regularization property called consistency in preference and confidence that mathematically translates into monotonic concavity, and describe a new weak ranking learner (MWGR) that generates ranking functions with this property. In experiments combining ranks from multiple face recognition algorithms and an experiment combining text information retrieval systems, rank functions using MWGR proved superior to binary weak learners.
Hardware Neuro-Fuzzy Learning
Authors: Chunshien Li, Zhao-Yi Tsai
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

The research in the paper is about the hardware machine learning study of an intelligent neuro-fuzzy system (NFS). The NFS is embedded within a DSP-FPGA chip system. The well-known random optimization method is used as the learning algorithm for the NFS. It is applied to a laboratory-scale temperature control process to study the hardware learning ability. The experiment results show the intelligent hardware system is able to achieve the machine-learning task with good performance. This encourages us the future study of intelligent hardware systems.
Microarchitecture-Independent Workload Characterization
Authors: Kenneth Hoste, Lieven Eeckhout
Venue: IEEE Micro (2007)

For computer designers, understanding the characteristics of workloads running on current and future computer systems is of utmost importance during microprocessor design. A microarchitecture-independent method ensures an accurate characterization of inherent program behavior and avoids the weaknesses of microarchitecture-dependent metrics.
InfoPad - past, present and future
Authors: Robert W. Brodersen
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1999)

The InfoPad project was a large interdisciplinary effort, which had a goal of implementing a complete system for wireless access of multimedia data from a high bandwidth wired infrastructure. The basic approach was to minimize the cost and energy consumption of the portable user device by using network based resources. A system approach was taken in this investigation, which attempted to optimize all aspects of the design from the user interface to the low power design of the terminal hardware, which uncovered a need to deal with the issues of project management and intergroup communications. From what was learned in this project a new effort is now underway investigating the present and future capabilities of implementing single chip wireless systems in advanced CMOS technology.
Arbiter synthesis approach for SoC multi-processor systems
Authors: Abdelkrim Zitouni, Rached Tourki
Venue: Computers and Electrical Engineering (2008)

The increasing complexity of Multi-Processor System on Chip (MPSoC) is requiring communication infrastructures that will efficiently accommodate the communication needs of the integrated computation resources. Exploring the arbitration space is crucial for achieving low latency communication. This paper illustrates an arbiter synthesis approach that allows a high performance MPSoC communication for multi-bus and Network on Chip (NoC) architectures. A cost function has been formulated in order to affect the priority order to each component or each set of components in a manner that minimizes the communication latency and generates a multi-level arbiter. The performance of the proposed approach have been analyzed in a design of an 8x8 ATM switch subsystem and a MPEG4 decoder mapped onto a 2-D mesh NoC. The results demonstrate that the MPSoC arbiter is well suited to provide high priority communication traffic with low latencies by allowing a preemption of lower priority transport. The sum of the mean waiting time at the eight ports of the ATM switch is minimum under the MPSoC arbitration scheme (4.30 cycle per word) while it is 3.00 times larger under the poorer performance arbitration scheme. In the case of the MPEG4 decoder, the average packet latency of the MPSoC is about 480 cycles while it is 640 cycles in the poorer performance arbitration scheme under a 0.4 flits/cycle injection rate.
The Autocorrelation Structure of Tausworthe Pseudorandom, Number Generators
Authors: F. Neuman
Venue: IEEE Transactions on Computers (1976)

Given that the autocorrelations for any repeating number sequence are known, this paper gives an algorithm for determining the autocorrelation structure of a new sequence obtained from the original sequence by proper decimation. Therefore, for certain random number generators, it is possible to choose a proper decimation which results in a long interval in which the autocorrelations are small for all shifts.
Comparative Study of the IEEE 802.16 Random Access Mechanisms
Authors: Dirk Staehle, Rastin Pries
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

The WiMAX technology based on the IEEE802.16 standard is currently the most prospective candidate for broadband wireless access networks. One of the key issues is the design of the MAC layer, in particular the multiple access scheme. The IEEE 802.16 standard specifies different scheduling services with individual mechanisms for accessing the channel on the uplink. The non-real-time polling service and the best-effort service mainly rely on a contention mechanism to submit bandwidth requests to the base station. These two services are currently used for all types of traffic with unknown characteristics, i.e. typically all traffic except for some special VoIP connection with known codec. In this paper, we evaluate and compare the performance of the contention mechanisms for fixed and mobile WiMAX.
Semantic Contract Support for E-Business Processes
Authors: Carlos Laufer, Daniel Schwabe
Venue: Proceedings of the 2007 Latin American Web Conference (2007)

Traditional business transactions are established under well-defined contracts, agreed, explicitly or implicitly, by all the parties involved. To support such transactions in the Internet (and in the Web) it is necessary to characterize all of its aspects, such as agents, contracts, roles, relationships, interactions between partners, policies, etc. This paper presents the Contract Oriented Web Services Model (COWS) - a model for an appropriate environment for E-business dialogues, implemented using Web Services. COWS is based on well-defined contracts agreed upon by all concerned parties and incorporates various levels of applicable policies. Contracts may refer to other contracts and are valid within forae, which have default global policies. A prototype web environment supporting COWS has been implemented to test the concepts that extend the discovery process. All COWS models have been specified as ontologies, using Flora- 2.
New Key Insulated Signature Scheme: Mitigate the Damage of Key Exposure in Mobile Agents
Authors: Renwang Su
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

To mitigate the damage of key exposure in mobile agents, in this paper, we present a new efficient key insulated signature scheme based on the bilinear pairings. Compared with other existing schemes, the signature size of our proposed scheme is short, and the computational complexity in signature generation phase is also low. Moreover, our proposed scheme can be proved to be existential unforgeable under the k-CAA assumption and random oracle model.
An Asynchronous Multisensor Spatial Registration Algorithm
Authors: Xin-hua Zhang, Hui-dong Guo, Zhi-jun Xia
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Bias registration is the prerequisite of data fusion. The constant bias can be estimated efficiently by two-stage Kalman filtering. An algorithm is proposed which includes the asynchronous sensor fusion models and spatial registration with feedback mechanism. In bias-free stage, the multisensor asynchronous fusion is employed to compensate the asynchronous error; fusion results are fed back to the estimation in constant bias estimation stage. The algorithm compensates both spatial bias and temporal bias registration; it can be applied to multi- sensor systems. Finally, simulation is processed. The results show that the algorithm is in effect.
Dynamic IP configuration of terminals in broadcasting networks
Authors: G. Gardikis, S. Orfanos, G. Kormentzas, E. Pallis, A. Kourtis
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

The concept of synergy between broadcasting and telecommunication networks has been strengthened by the emergence of multi-modal terminals, which are used in a broadcast environment (mainly in DTV-Digital Television networks) to provide IP-based multimedia services. The migration of IPv4/IPv6 applications, either interactive or not, in a broadcasting network, requires that certain parameters, such as Host, Gateway and DNS IP addresses are configured in the terminals, either statically or dynamically. This paper discusses issues of dynamic configuration of IP parameters for DTV terminals, based on an overview of relevant mechanisms usually used in access networks. It proposes an IP-based auto-configuration protocol tailored to the needs of an IP/DTV access platform, describes its implementation and evaluates its behaviour in a laboratory-based DVB-T network.
Number Image Recognition Based on Neural Network Ensemble
Authors: Jian Wang, Jingfeng Yang, Shaofa Li, Qiufang Dai, Jiaxing Xie
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Handwritten number is hard to recognize due to there existing much noise, and the shape, size, thickness and position of each number may be different. This paper investigates the recognition of number image of fixed pixels based on the neural network ensemble. Firstly, the Bagging technique is used to obtain the training samples, secondly, the discrete Hopfield neural network is employed to remove the noise among the samples and associate the samples, then 20 single three layers feed forward neural networks are built up to construct neural network ensemble to obtain the recognition results through voting. The research shows that the fault-tolerant and generalization ability of the neural network ensemble is superior to the single best model for visual number recognition.
Defect-Tolerant Gate Macro Mapping & Placement in Clock-Free Nanowire Crossbar Architecture
Authors: Ravi Bonam, Yong-Bin Kim, Minsu Choi
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

Recently, we proposed a new clock-free nanowire crossbar architecture based on a delayinsensitive paradigm called Null Convention Logic (NCL). The proposed architecture has simple periodic structure that is suitable for non-deterministic nanoscale assembly and does not require a clock distribution network - so it is intrinsically free from timing-related failure modes. Even though the proposed architecture offers improved manufacturability, it is still not free from defects. This paper elaborates on the different programming techniques to map a given threshold gate macro on a random PGMB (Programmable Gate Macro Block) with predefined dimension. Defect-Aware and Defect Unaware approaches have been considered to map a given threshold gate onto a PGMB without affecting its functionality. Defect aware approach uses a defect map, gate table which help in efficient programming and also conservative use of resources. Defect unaware approach on the other hand is faster than defect aware approach, does not use defect maps and is not as efficient as defect aware approach. Parametric simulation results using MATLAB are used to show the programmability of these approaches under various circumstances.
Mining User's Interest from Reading Behavior in E-learning System
Authors: Yongquan Liang, Zhongying Zhao, Qingtian Zeng
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

A method based on reading behavior is proposed for capturing user's interest in E-learning System. A topic ontology is necessary to be predefined which can be used as the reference to construct user's interest model. A behavior table is generated by profile agent to record user's behaviors including underline, highlight, circle, annotation and bookmark. We adopt a behavior matrix and weight matrix to compute the user's interests in each leaf topic in the topic ontology. The user's interest about the topic ontology can be extended via support factor. An experiment is conducted to estimate the performance of our approach. It shows that our approach can capture user's interest precisely.
Charge-Coupled Memories for Computer Systems
Authors: G. Panigrahi
Venue: Computer (1976)

Since their invention in 1970 by Boyle and Smith,1,2charge-coupled devices (CCD's) have evolved rapidly and are finding wide-ranging applications in three major areas: imaging, memory, and analog signal processing. In this papers, we will primarily concentrate on the memory applications of CCD's. 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
Fault-Tolerant Computing
Authors: D. K. Pradhan
Venue: Computer (1980)

Critical computer applications will grow explosively in the next decade, demanding systems that are reliable and available. Fault tolerance provides the tools to build such systems.
Enhancing Edge Computing with Database Replication
Authors: Yi Lin, Bettina Kemme, Marta Patino-Martinez, Ricardo Jimenez-Peris
Venue: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)

As the use of the Internet continues to grow explosively, edge computing has emerged as an important technique for delivering Web content over the Internet. Edge computing moves data and computation closer to end-users for fast local access and better load distribution. Current approaches use caching, which does not work well with highly dynamic data. In this paper, we propose a different approach to enhance edge computing. Our approach lies in a wide area data replication protocol that enables the delivery of dynamic content with full consistency guarantees and with all the benefits of edge computing, such as low latency and high scalability. What is more, the proposed solution is fully transparent to the applications that are brought to the edge. Our extensive evaluations in a real wide area network using TPC-W show promising results.
Lane tracking with omnidirectional cameras: algorithms and evaluation
Authors: Shinko Yuanhsien Cheng, Mohan Manubhai Trivedi
Venue: EURASIP Journal on Embedded Systems (2007)

With a panoramic view of the scene, a single omnidirectional camera can monitor the 360-degree surround of the vehicle or monitor the interior and exterior of the vehicle at the same time. We investigate problems associated with integrating driver assistance functionalities that have been designed for rectilinear cameras with a single omnidirectional camera instead. Specifically, omnidirectional cameras have been shown effective in determining head gaze orientation from within a vehicle. We examine the issues involved in integrating lane tracking functions using the same omnidirectional camera, which provide a view of both the driver and the road ahead of the vehicle. We present analysis on the impact of the omnidirectional camera's reduced image resolution on lane tracking accuracy, as a consequence of gaining the expansive view. And to do so, we present Omni-VioLET, a modified implementation of the vision-based lane estimation and tracking system (VioLET), and conduct a systematic performance evaluation of both lane-trackers operating on monocular rectilinear images and omnidirectional images. We are able to show a performance comparison of the lane tracking from Omni-VioLET and Recti-VioLET with ground truth using images captured along the same freeway road in a specified course. The results are surprising: with 1/10th the number of pixels representing the same space and about 1/3rd the horizontal image resolution as a rectilinear image of the same road, the omnidirectional camera implementation results in only three times the amount the mean absolute error in tracking the left lane boundary position.
BeamStar: An Edge-Based Approach to Routing in Wireless Sensor Networks
Authors: Shiwen Mao, Y. Thomas Hou
Venue: IEEE Transactions on Mobile Computing (2007)

Current expectations on sensor node in terms of size, cost, and energy efficiency have led to severely limited design space on hardware and software. In this paper, we explore capabilities at the network edge for sensor networks, aiming to reduce the hardware and software complexity of a sensor node without sacrificing network performance. We present a novel edge-based routing protocol, nicknamed BeamStar, for wireless sensor networks. Under BeamStar, the base station exploits some nice properties associated with directional antenna and power control at the base station. We devise a simple protocol so that each sensor node can determine its location information passively with minimum control overhead. We also show how to design a robust routing protocol based on the location information at each sensor node. Under the proposed protocol, sensor nodes are relieved of the activities (or burdens) that are associated with control and routing, thus enabling much simpler hardware and software implementation at sensor nodes. Simulation results demonstrate that BeamStar achieves high reliability at comparable energy consumptions as compared with prior work. It is a viable approach to pursue size and cost reduction for future sensor node design.
Why you should run TPC-DS: a workload analysis
Authors: Meikel Poess, Raghunath Othayoth Nambiar, David Walrath
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

The Transaction Processing Performance Council (TPC) is completing development of TPC-DS, a new generation industry standard decision support benchmark. The TPC-DS benchmark, first introduced in the "The Making of TPC-DS" [9] paper at the 32nd International Conference on Very Large Data Bases (VLDB), has now entered the TPC's "Formal Review" phase for new benchmarks; companies and researchers alike can now download the draft benchmark specification and tools for evaluation. The first paper [9] gave an overview of the TPC-DS data model, workload model, and execution rules. This paper details the characteristics of different phases of the workload, namely: database load, query workload and data maintenance; and also their impact to the benchmark's performance metric. As with prior TPC benchmarks, this workload will be widely used by vendors to demonstrate their capabilities to support complex decision support systems, by customers as a key factor in purchasing servers and software, and by the database community for research and development of optimization techniques.