ppxscal/embedding_network huggingface dataset:
Pooled marginal slicing approach via SIRα with discrete covariables
Authors: Benoît Liquet, Jérôme Saracco
Venue: Computational Statistics (2007)

In this paper, we consider a semiparametric regression model involving both p-dimensional quantitative covariable X and categorical predictor Z, and including a dimension reduction of X via K indices X¿β k . The dependent variable Y can be real or q-dimensional. We propose an approach based on SIR ¿ and pooled marginal slicing methods in order to estimate the space spanned by the β k 's. We establish $$\sqrt{n}$$ -consistency of the proposed estimator. Simulation studies show the numerical qualities of our estimator.
Reducing the PAR In OFDM Systems by Clipping Scheme
Authors: L. J. Wu, Y. W. Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Orthogonal Frequency Division Multiplexing (OFDM) signals suffer from a large Peak-to-Average- Power-Ratio, which requires large power back-offs in the transmitter and receiver. This paper studies a digital post-processing method that mitigates clipping by the analog-to-digital converter in the receiver. The Peak to Average power Ratio (PAR) is baneful in OFDM systems. The clipping signal scheme, which is a useful and simple method to reduce the PAR, but introduces additional noise that degrades the systems performance. An oversampling scheme, which can be used to recover the original signal and to eliminate clipping artifacts at receiver, is proposed by using finite impulse response (FIR) filter. Coefficients of the filter are obtained by correlation function of the received signal and the oversampling information at receiver. The performance of the proposed technique is evaluated for frequency selective channel. Results show that the proposed scheme can mitigate the clipping noise significantly for OFDM systems and in order to maintain the systems capacity.
Combinational and sequential mapping with priority cuts
Authors: Alan Mishchenko, Sungmin Cho, Satrajit Chatterjee, Robert Brayton
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

An algorithm for technology mapping of combinational and sequential logic networks is proposed and applied to mapping into K-input lookup-tables (K-LUTs). The new algorithm avoids the hurdle of computing all K-input cuts while preserving the quality of the results, in terms of area and depth. The memory and runtime of the proposed algorithm are linear in circuit size and quite affordable even for large industrial designs. For example, computing a good quality 6-LUT mapping of an AIG with IM nodes takes 150Mb of RAM and 1 minute on a typical laptop. An extension of the algorithm allows for sequential mapping, which searches the combined space of all possible mappings and retimings. This leads to an 18--22% improvement in depth with a 3--5% LUT count penalty, compared to combinational mapping followed by retiming.
Improve Peer Cooperation Using Social Networks
Authors: Victor Ponce, Jie Wu, Xiuqi Li
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Due to the dynamic nature of P2P systems, it is impossible to keep an accurate history of the transactions that take place while avoiding security attacks such as whitewashing and collusion, and abuse such as freeriding. This is why it is important to develop a mechanism that both rewards cooperative peers and punishes misbehaving peers. Modelling P2P networks as social structures can allow incentive mechanisms to be developed that prevent the negative behaviors mentioned. In a social structure, peers make and receive payments for services provided to and from each other. In this paper we extend a social network algorithm to include the transfer of credit between peers to reduce the path length in queries. We also develop a selection strategy that involves different aspects of peer interactions in a P2P network and a credit transfer mechanism that helps to dis-incent misbehaving peers by taking away credits that they have with good peers and transferring them to more cooperative ones. The simulation results show that our algorithm is effective in reducing the amount of debt between peers, meaning that peers become more cooperative, and shortening the average path length to a satisfied query, while increasing delivery ratio.
Applying Hypothetical Queries to E-Commerce Systems to Support Reservation and Personal Preferences
Authors: Yu Zhang, Huajun Chen, Hao Sheng, Zhaohui Wu
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

Online travel continues to be one of the most successful e-commerce categories on the Internet. As increasing number of people book online, existing e-ticket systems can not satisfy customers' growing demand. Customers complain about most of the current e-ticket systems for the lack of "reservation" functionality. They also complain that these systems are not "intelligent" enough as a traditional travel agent who can deal with more complicated personal preferences. In this paper, we propose a transaction model for e-commerce system to support reservation functionality while balancing the benefits and risks of both customers and airlines. We introduce the theory of hypothetical query to avoid unnecessary transactions and rollbacks on underlying database. Hypothetical queries can be generated automatically and transformed into relational algebra queries which can be optimized with conventional techniques. We extend the lazy approach for evaluating hypothetical queries with integrity constraints to deal with customers' personal preferences. We also provide the "watch" and "remind" mechanism to help customers to purchase their most desirable tickets. Although we have chosen ticket booking system as our target application, the framework presented in this paper is also applicable to other e-commerce systems.
A Novel Approach to Detect the Presence of LSB Steganographic Messages
Authors: Zongyuan Deng, Xi Shao, Zhen Yang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Digital steganography introduces statistical distortion to some extent. Thus, steganalysis can be used to classify an object with or without hidden information. In this paper, we present a novel approach to detect the presence of LSB (Least Significant Bit) steganographic messages in the voice secure communication system. A distance measure, which has been proved to be sensitive to LSB steganography by ANOVA (analysis of variance), is denoted to estimate the difference between the host signal and the stego signal. Then a ML (maximum likelihood) decision is combined to form the classifier. Statistical experiments show that the proposed approach has highly accurate rate and low computational complexity.
Architecture: an emerging core competence for IT professionals
Authors: Keith A. Morneau, Sue Talley
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

With the emergence of globalization, IT organizations have begun to shift from service organizations to solutions organizations. IT professionals must now mitigate complexity by understanding both the enterprise and IT solutions. An IT professional has to balance the business needs of the enterprise with the possibilities that technology offers. At the same time, technology itself has enabled hard IT skills jobs to become commodities that can be outsourced around the world and performed at a fraction of the cost. This shift has changed the core competencies needed by IT professionals in the developed countries. IT professionals must now have the competencies of leadership/followership, communication and collaboration, problem solving and critical thinking, creativity and innovation, global business expertise, systems thinking, and self management, in addition to the technology expertise and project management skills we expected in the past. Arising from all these competencies, architecture has emerged as an overarching core competence for IT professionals. The purpose of this paper is to provide an overview of how IT competencies have changed in the last decade and to introduce architecture as a critical component of an IT education curriculum. We will discuss the implications this might have for the SIGITE model curriculum framework.
Landscapes, learning costs, and genetic assimilation
Authors: Giles Mayley
Venue: Evolutionary Computation (1996)

The evolution of a population can be guided by phenotypic traits acquired by members of that population during their lifetime. This phenomenon, known as the Baldwin effect, can speed the evolutionary process as traits that are initially acquired become genetically specified in later generations. This paper presents conditions under which this genetic assimilation can take place. As well as the benefits that lifetime adaptation can give a population, there may be a cost to be paid for that adaptive ability. It is the evolutionary trade-off between these costs and benefits that provides the selection pressure for acquired traits to become genetically specified. It is also noted that genotypic space, in which evolution operates, and phenotypic space, in which adaptive processes (such as learning) operate, are, in general, of a different nature. To guarantee that an acquired characteristic can become genetically specified, these spaces must have the property of neighborhood correlation, which means that a small distance between two individuals in phenotypic space implies that there is a small distance between the same two individuals in genotypic space.
Building place ontologies for the semantic web:: issues and approaches
Authors: A. I. Abdelmoty, P. Smart, C. B. Jones
Venue: Proceedings of the 4th ACM workshop on Geographical information retrieval (2007)

Place geo-ontologies have a key role to play in the development of thegeospatial-semantic web, with regard to facilitating the search for geographical information and resources. They normally hold large amounts of geographicinformation and undergo a continuous process of revision and update. This papers reviews the limitations of the OWL ontology language for the representation of Place and proposes two novel approaches to frameworks that combine rules and OWL for building and managing Place ontologies.
The need for a multi-perspective approach to solve the DDos problem
Authors: Jorge Hernandez-Herrero, Jon A. Solworth
Venue: Bell Labs Technical Journal (2007)

Packet flooding attacks are a major threat against the availability of networked systems in next-generation networks. The lack of authentication and authorization controls in the core layer of the Internet, the Internet Protocol (IP) layer, enables this problem. Many distributed denial of service (DDoS) defense solutions have been proposed over recent years, but no general solution is widely accepted. Multiple perspectives should be considered when architecting a DDoS solution, including (1) a technical perspective that reconciles the network and endpoint needs, (2) an interorganizational perspective that considers trust and commitments among the participating organizations, (3) a perspective ensuring incentives for the solution participants, and (4) a perspective that considers the cost of deployment. A DDoS defense architecture that considers the multiple dimensions of this problem will be more likely to be widely accepted and deployed. &copy; 2007 Alcatel-Lucent.
Oscillations of a class of second-order nonlinear delay differential equations with variable sign coefficients
Authors: Jietao Zou, Jianguo Zhang, Xiaoyou Han, Hongxia Zhu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In this paper, we study the oscillations of a kind of second-order nonlinear delay differential equations with variable sign oscillation factors. Three sufficient conditions about the equation are obtained, which generalize the present oscillation results of second-order nonlinear differential equations and delay differential equations with invariable sign coefficients.
A Hybrid Case Based Reasoning System Using Fuzzy-Rough Sets and Formal Concept Analysis
Authors: Jirapond Tadrat, Veera Boonjing, Puntip Pattaraintakorn
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

In this paper, we propose a new hybrid case based reasoning system based on rough set theory, formal concept analysis and fuzzy sets. This system applies rough set theory to assure minimally sufficient cases in its case base. It uses formal concept analysis to reveal knowledge of attribute dependencies in terms of concept lattices. Numeric attributes are transformed to be suitable for formal concept analysis using fuzzy sets.
On the Performance of Location-Centric Storage in Sensor Networks
Authors: Kai Xing, Xiuzhen Cheng, Jiang Li
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

In this paper, we study the performance of locationcentric storage (LCS) theoretically. Our results indicate that LCS utilizes network resource efficiently. In particular, the storage load of sensors is independent of the network size, and is evenly distributed across the network. Moreover, the communication distance for getting event information is small. Therefore, the protocol has great scalability. In addition, we also propose algorithms for data retrieval in LCS. Our analysis shows that both the number of queries and the response cost involved in the algorithms could approach to the theoretical lower bound.
A Hardware-Software Platform for Design and Verification of In-Motorcycle Electronic Systems
Authors: F. Baronti, F. Lenzi, R. Roncella, R. Saletti
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

This paper describes a hardware-software platform suitable for rapid prototyping of electronic systems for in-motorcycle applications. The hardware platform architecture is characterized by two programmable components consisting of an 8-bit microcontroller and a PC-like device, such as a portable PC or a PDA, which communicate by means of a Bluetooth wireless link or a CAN bus. The application can dynamically be partitioned on the two processors, during the design and verification phases. This allows the hardware-inthe- loop simulation and the fine-tuning of the control algorithm before porting the application to the embedded processor. Two application examples for motorcycles are presented. They demonstrate that the designed hardware/software platform leads to rapid and low-cost implementations of innovative inmotorcycle electronic systems.
A generic solution for warehousing business process data
Authors: Fabio Casati, Malu Castellanos, Umeshwar Dayal, Norman Salazar
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Improving business processes is critical to any corporation. Process improvement requires analysis as its first basic step. Process analysis has many unique challenges: i) companies execute many business processes, and devising ad hoc solutions for each of them is too costly. Hence, generic approaches must be sought; ii) the abstraction level at which processes need to be analyzed is much higher with respect to the information available in the process execution environment; iii) the rapidly increasing need of co-developing the process analysis and the process automation solution and the scale of the problem makes it hard to cope with frequent changes in the sources of process data. To address these problems, we have developed a process warehousing solution, used by HP and its customers. In this paper we describe the solution, the challenges we had to face, and the lessons we learned in implementing and deploying it.
Liquid SIMD: Abstracting SIMD Hardware using Lightweight Dynamic Mapping
Authors: Nathan Clark, Amir Hormati, Sami Yehia, Scott Mahlke, Krisztian Flautner
Venue: Proceedings of the 2007 IEEE 13th International Symposium on High Performance Computer Architecture (2007)

Microprocessor designers commonly utilize SIMD accelerators and their associated instruction set extensions to provide substantial performance gains at a relatively low cost for media applications. One of the most difficult problems with using SIMD accelerators is forward migration to newer generations. With larger hardware budgets and more demands for performance, SIMD accelerators evolve with both larger data widths and increased functionality with each new generation. However, this causes difficult problems in terms of binary compatibility, software migration costs, and expensive pensive redesign of the instruction set architecture. In this work, we propose Liquid SIMD to decouple the instruction set architecture from the SIMD accelerator SIMD instructions are expressed using a processor's baseline scalar instruction set, and light-weight dynamic translation maps the representation onto a broad family of SIMD accelerators. Liquid SIMD effectively bypasses the problems inherent to instruction set modification and binary compatibility across accelerator generations. We provide a detailed description of changes to a compilation framework and processor pipeline needed to support this abstraction. Additionally, we show that the hardware overhead of dynamic optimization is modest, hardware changes do not affect cycle time of the processor, and the performance impact of abstracting the SIMD accelerator is negligible. We conclude that using dynamic techniques to map instructions onto SIMD accelerators is an effective way to improve computation efficiency, without the overhead associated with modifying the instruction set.
Similarity search for web services
Authors: Xin Dong, Alon Halevy, Jayant Madhavan, Ema Nemes, Jun Zhang
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Web services are loosely coupled software components, published, located, and invoked across the web. The growing number of web services available within an organization and on the Web raises a new and challenging search problem: locating desired web services. Traditional keyword search is insufficient in this context: the specific types of queries users require are not captured, the very small text fragments in web services are unsuitable for keyword search, and the underlying structure and semantics of the web services are not exploited. We describe the algorithms underlying the Woogle search engine for web services. Woogle supports similarity search for web services, such as finding similar web-service operations and finding operations that compose with a given one. We describe novel techniques to support these types of searches, and an experimental study on a collection of over 1500 web-service operations that shows the high recall and precision of our algorithms.
A new single-ended SRAM cell with write-assist
Authors: Richard F. Hobson
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

A 6T static random access memory (SRAM) cell with a new write-assist (WA) feature is presented. The WA technique reduces the problem of writing a "one" through an nMOS pass device, thereby making a single-ended bit line more attractive. Both active power and leakage power can be significantly reduced. Leakage charge can be pooled to help precharge bit lines. Cell area and performance are competitive with traditional SRAM cell area and performance.
Software Reliability Status and Perspectives
Authors: C. V. Ramamoorthy
Venue: IEEE Transactions on Software Engineering (1982)

It is essential to assess the reliability of digital computer systems used for critical real-time control applications (e.g., nuclear power plant safety control systems). This involves the assessment of the design correctness of the combined hardware/software system as well as the reliability of the hardware. In this paper we survey methods of determining the design correctness of systems as applied to computer programs.
Image Skew Detection for Formulas without Fraction Bars Using Connected Components Analysis
Authors: Lichun Zhang, Yue Lu, Guoyue Chen, Patrick S. P. Wang
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Skew detection acts as an important role in document image analysis systems. Many methods have been designed for text-dominant document images, but they usually fail in handling formula-dominant images. Hough transform is an effective method to estimate the skew angle of formulas with fraction bars, but cannot dealing with formulas without fraction bars. This paper presents a skew angle detection method for formula images that have not fraction bars, by analyzing connected components. All of connected components in a formula are clustered to two classes based on their widths and heights. The connected components in the class that have good alignment characteristics are selected to calculate the skew angle of the formula. Experimental results on various types of skewed formulas without fraction bars have showed the validity of the proposed method.
Byzantine Fault Tolerance for Nondeterministic Applications
Authors: Wenbing Zhao
Venue: Proceedings of the Third IEEE International Symposium on Dependable, Autonomic and Secure Computing (2007)

All practical applications contain some degree of nondeterminism. When such applications are replicated to achieve Byzantine fault tolerance (BFT), their nondeterministic operations must be controlled to ensure replica consistency. To the best of our knowledge, only the most simplistic types of replica nondeterminism have been dealt with. Furthermore, there lacks a systematic approach to handling common types of nondeterminism. In this paper, we propose a classification of common types of replica nondeterminism with respect to the requirement of achieving Byzantine fault tolerance, and describe the design and implementation of the core mechanisms necessary to handle such nondeterminism within a Byzantine fault tolerance framework.