ppxscal/embedding_network huggingface dataset:
Output Remapping Technique for Soft-Error Rate Reduction in Critical Paths
Authors: Qian Ding, Yu Wang, Hui Wang, Rong Luo, Huazhong Yang
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

It is expected that the soft error rate (SER) of combinational logic will increase significantly. Previous solutions to mitigate soft errors in combinational logic suffer from delay penalty or area/power overhead. In this paper, we proposed an output remapping technique to reduce SER of critical paths. Experimental results show up to about 20X increase in Qcritical. So the SER is reduced significantly. This method does not introduce any delay penalty. The area/power overhead is limited as well. The output remapping method is based on our novel glitch width model. The analysis shows that output remapping technique works well along with technology scaling.
New horizontal frustum optical waveguide fabrication using UV proximity printing
Authors: Tsung-Hung Lin, Hsiharng Yang, Ruey Fang Shyu, Ching-Kong Chao
Venue: Microsystem Technologies (2008)

This paper presents a novel method for fabricating the horizontal frustum structure as a planar optical waveguide using the proximity printing technique. A horizontal frustum optical waveguide with both lateral and vertical taper structure was produced. The orthogonal and inclined masks with the diffraction effect were employed in the lithography process. This method can precisely control each horizontal frustum optical waveguide geometric profile in the fabrication process. The horizontal frustum optical waveguide and its array with the same inclined angle were generated. The beam propagation simulation software (BPM_CAD) was used to model the optical performance. The simulation results reveal that the mode profile matched into horizontal frustum optical waveguide and fiber from the laser diode. The optical loss of the horizontal hemi-frustum optical waveguide structure was less than 0.2&#x00a0;dB. The horizontal hemi-frustum waveguide will be used for fiber coupling on boards for future optical communication systems.
Alkali compounds catalyzed low temperature methanol synthesis over Cu-based catalyst
Authors: Baoshan Hu
Venue: Proceedings of the 1st WSEAS International Conference on Computational Chemistry (2007)

A novel mixed catalyst system containing alkali compounds over Cu/MgO-Na catalyst was developed to synthesize methanol from syngas via ethyl formate in a slurry reactor. The results exhibited that among the used alkali formates (HCOOM, M=Li, Na, Cs, Ca, Ba), sodium formate showed the optimizing catalytic function with Cu/MgO-Na catalyst, and high CO conversion(>80%) and methanol selectivity(∼90%) with a mass space velocity of 1800L(STP)/h.kg was achieved at low temperature of 433K and 5.0Mpa. In addition, Na2CO3, NaHCO3 and NaOH could catalyze the methanol synthesis through their transformation into HCOONa.
Locally adaptive subspace and similarity metric learning for visual data clustering and retrieval
Authors: Yun Fu, Zhu Li, Thomas S. Huang, Aggelos K. Katsaggelos
Venue: Computer Vision and Image Understanding (2008)

Subspace and similarity metric learning are important issues for image and video analysis in the scenarios of both computer vision and multimedia fields. Many real-world applications, such as image clustering/labeling and video indexing/retrieval, involve feature space dimensionality reduction as well as feature matching metric learning. However, the loss of information from dimensionality reduction may degrade the accuracy of similarity matching. In practice, such basic conflicting requirements for both feature representation efficiency and similarity matching accuracy need to be appropriately addressed. In the style of ''Thinking Globally and Fitting Locally'', we develop Locally Embedded Analysis (LEA) based solutions for visual data clustering and retrieval. LEA reveals the essential low-dimensional manifold structure of the data by preserving the local nearest neighbor affinity, and allowing a linear subspace embedding through solving a graph embedded eigenvalue decomposition problem. A visual data clustering algorithm, called Locally Embedded Clustering (LEC), and a local similarity metric learning algorithm for robust video retrieval, called Locally Adaptive Retrieval (LAR), are both designed upon the LEA approach, with variations in local affinity graph modeling. For large size database applications, instead of learning a global metric, we localize the metric learning space with kd-tree partition to localities identified by the indexing process. Simulation results demonstrate the effective performance of proposed solutions in both accuracy and speed aspects.
Investigation of Stakeholders Commitment to Information Security Awareness Programs
Authors: Jemal Abawajy, Kasey Thatcher, Tai-hoon Kim
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Organisations have become increasingly dependenton technology in order to compete in their respective markets. As IT technology advances at a rapid pace, so does its complexity, giving rise to new IT security vulnerabilities and methods of attack. Even though the human factors have been recognized to have a crucial role in information security management, the effects of weakness of will and lack of commitment on the stakeholders (i.e., employers and employees) parts has never been factored into the design and delivery of awareness programs. To this end, this paper investigates the impacts of the availability of awareness programs and end-user drive and lack of commitment to information security awareness program design, delivery and success.
Covariate Shift Adaptation by Importance Weighted Cross Validation
Authors: Masashi Sugiyama, Matthias Krauledat, Klaus-Robert Müller
Venue: The Journal of Machine Learning Research (2007)

A common assumption in supervised learning is that the input points in the training set follow the same probability distribution as the input points that will be given in the future test phase. However, this assumption is not satisfied, for example, when the outside of the training region is extrapolated. The situation where the training input points and test input points follow different distributions while the conditional distribution of output values given input points is unchanged is called the covariate shift. Under the covariate shift, standard model selection techniques such as cross validation do not work as desired since its unbiasedness is no longer maintained. In this paper, we propose a new method called importance weighted cross validation (IWCV), for which we prove its unbiasedness even under the covariate shift. The IWCV procedure is the only one that can be applied for unbiased classification under covariate shift, whereas alternatives to IWCV exist for regression. The usefulness of our proposed method is illustrated by simulations, and furthermore demonstrated in the brain-computer interface, where strong non-stationarity effects can be seen between training and test sessions.
AMAP: automatically mining abbreviation expansions in programs to enhance software maintenance tools
Authors: Emily Hill, Zachary P. Fry, Haley Boyd, Giriprasad Sridhara, Yana Novikova, Lori Pollock, K. Vijay-Shanker
Venue: Proceedings of the 2008 international working conference on Mining software repositories (2008)

When writing software, developers often employ abbreviations in identifier names. In fact, some abbreviations may never occur with the expanded word, or occur more often in the code. However, most existing program comprehension and search tools do little to address the problem of abbreviations, and therefore may miss meaningful pieces of code or relationships between software artifacts. In this paper, we present an automated approach to mining abbreviation expansions from source code to enhance software maintenance tools that utilize natural language information. Our scoped approach uses contextual information at the method, program, and general software level to automatically select the most appropriate expansion for a given abbreviation. We evaluated our approach on a set of 250 potential abbreviations and found that our scoped approach provides a 57% improvement in accuracy over the current state of the art.
Safe-Time: Distributed Real-Time Monitoring of cKNN in Mobile Peer-to-Peer Networks
Authors: Kihwan Kim, Ying Cai, Wallapak Tavanapong
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

A continuous k nearest neighbor (cKNN) query is a query that continuously returns a set of k nearest moving objects (mobile hosts) to a given query point. For example, report three nearest moving sensors to a given location continuously. Most existing research efforts focus on centralized solutions. In a mobile peer-to-peer network (M-P2P), a centralized approach incurs expensive communication cost. In this paper, we propose Safe-Time —a distributed solution for cKNN given a stationary query point for M-P2P. The two key features are as follows. 1) Actual execution of a cKNN query is not needed during a safetime period since the query result is guaranteed to remain the same during this period. 2) Once the safe-time expires, execution of a cKNN query involves only objects in a circular band of width equal to the estimated distance between the kth and the k+1th nearest neighbors. To further reduce communication cost for dense queries, we introduce Unite-Safe-Time that executes one virtual query derived from nearby queries instead of executing each of them separately. Our simulation result shows that the proposed distributed solutions outperform a centralized solution under a range of conditions. Safe-Time incurs up to 2/3 less communication cost compared to a centralized solution. Unite-Safe-Time shows up to 1/3 less cmmunication cost than Safe-Time in our study.
Crimeware: Understanding New Attacks and Defenses (Symantec Press), 1 edition
Authors: Markus Jakobsson, Zulfikar Ramzan
Venue:  (2008)

This book is the most current and comprehensive analysis of the state of Internet security threats right now. The review of current issues and predictions about problems years away are critical for truly understanding crimeware. Every concerned person should have a copy and use it for reference. Garth Bruen, Project KnujOn Designer Theres a new breed of online predatorsserious criminals intent on stealing big bucks and top-secret informationand their weapons of choice are a dangerous array of tools called crimeware. With an ever-growing number of companies, organizations, and individuals turning to the Internet to get things done, theres an urgent need to understand and prevent these online threats. Crimeware: Understanding New Attacks and Defenses will help security professionals, technical managers, students, and researchers understand and prevent specific crimeware threats. This book guides you through the essential security principles, techniques, and countermeasures to keep you one step ahead of the criminals, regardless of evolving technology and tactics. Security experts Markus Jakobsson and Zulfikar Ramzan have brought together chapter contributors who are among the best and the brightest in the security industry. Together, they will help you understand how crimeware works, how to identify it, and how to prevent future attacks before your companys valuable information falls into the wrong hands. In self-contained chapters that go into varying degrees of depth, the book provides a thorough overview of crimeware, including not only concepts prevalent in the wild, but also ideas that so far have only been seen inside the laboratory. With this book, you will Understand current and emerging security threats including rootkits, bot networks, spyware, adware, and click fraud Recognize the interaction between various crimeware threats Gain awareness of the social, political, and legal implications of these threats Learn valuable countermeasures to stop crimeware in its tracks, now and in the future Acquire insight into future security trends and threats, and create an effective defense plan With contributions by Gary McGraw, Andrew Tanenbaum, Dave Cole, Oliver Friedrichs, Peter Ferrie, and others.
A Scratch-Pad Memory Aware Dynamic Loop Scheduling Algorithm
Authors: Ozcan Ozturk, Mahmut Kandemir, Sri Hari Krishna Narayanan
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Executing array based applications on a chip multiprocessor requires effective loop parallelization techniques. One of the critical issues that need to be tackled by an optimizing compiler in this context is loop scheduling, which distributes the iterations of a loop to be executed in parallel across the available processors. Most of the existing work in this area targets cache based execution platforms. In comparison, this paper proposes the first dynamic loop scheduler, to our knowledge, that targets scratch-pad memory (SPM) based chip multiprocessors, and presents an experimental evaluation of it. The main idea behind our approach is to identify the set of loop iterations that access the SPM and those that do not. Thisinformation is exploited at runtime to balance the loads of the processors involved in executing the loop nest at hand. Therefore, the proposed dynamic scheduler takes advantage of the SPM in performing the loop iteration-to-processor mapping. Our experimental evaluation with eight array/loop intensive applications reveals that the proposed scheduler is very effective in practice and brings between 13.7% and 41.7% performance savings over a static loop scheduling scheme, which is also tested in our experiments.
An adaptive approach to selecting a flow-partition exponent for a multiple-flow-direction algorithm
Authors: C. Qin, A. -X. Zhu, T. Pei, B. Li, C. Zhou, L. Yang
Venue: International Journal of Geographical Information Science (2007)

Most multiple-flow-direction algorithms (MFDs) use a flow-partition coefficient (exponent) to determine the fractions draining to all downslope neighbours. The commonly used MFD often employs a fixed exponent over an entire watershed. The fixed coefficient strategy cannot effectively model the impact of local terrain conditions on the dispersion of local flow. This paper addresses this problem based on the idea that dispersion of local flow varies over space due to the spatial variation of local terrain conditions. Thus, the flow-partition exponent of an MFD should also vary over space. We present an adaptive approach for determining the flow-partition exponent based on local topographic attribute which controls local flow partitioning. In our approach, the influence of local terrain on flow partition is modelled by a flow-partition function which is based on local maximum downslope gradient (we refer to this approach as MFD based on maximum downslope gradient, MFD-md for short). With this new approach, a steep terrain which induces a convergent flow condition can be modelled using a large value for the flow-partition exponent. Similarly, a gentle terrain can be modelled using a small value for the flow-partition exponent. MFD-md is quantitatively evaluated using four types of mathematical surfaces and their theoretical 'true' value of Specific Catchment Area (SCA). The Root Mean Square Error (RMSE) shows that the error of SCA computed by MFD-md is lower than that of SCA computed by the widely used SFD and MFD algorithms. Application of the new approach using a real DEM of a watershed in Northeast China shows that the flow accumulation computed by MFD-md is better adapted to terrain conditions based on visual judgement.
Design of PriServ, a privacy service for DHTs
Authors: Mohamed Jawad, Patricia Serrano Alvarado, Patrick Valduriez
Venue: Proceedings of the 2008 international workshop on Privacy and anonymity in information society (2008)

By decentralizing control, P2P systems provide efficient, scalable data sharing. However, when sharing data for different purposes (e.g., billing, purchase, shipping, etc.), data privacy can be easily violated by untrustworthy peers wich may use data for other purposes (e.g., marketing, fraudulence, profiling, etc.). A basic principle of data privacy is purpose specification which states that data providers should be able to specify the purpose for which their data will be collected and used. In the context of P2P systems, decentralized control makes it hard to enforce purpose-based privacy. And the major problem of data disclosure is not addressed. Hippocratic databases provide mechanisms for enforcing purpose-based disclosure control within a corporation datastore. In this paper, we apply the Hippocratic database principles to P2P systems to enforce purpose-based privacy. We focus on Distributed Hash Tables (DHTs), because they provide strong guarantees in terms of access performance. We propose PriServ, a privacy service which prevents privacy violation by prohibiting malicious data access. The performance evaluation of our approach through simulation shows that the overhead introduced by PriServ is small.
A Space-Time Network Optimization Model for Traffic Coordination and Its Evaluation
Authors: Nirav Shah, Subodha Kumar, Farokh Bastani, I-Ling Yen
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

In transportation systems, the existing infrastructure can potentially be used more efficiently by deploying intelligent net-centric solutions that coordinate vehicles and traffic signals in real-time. For capacity planning and assessing the cost/benefit tradeoffs of intelligent net-centric coordination infrastructures, it is essential to determine the performance of optimal solutions, i.e., the best possible traffic flow that can be achieved. Given the scale and complexity of transportation systems, it may not be feasible to actually achieve these optimal performances in practice. However, if the results show that substantial improvements are possible by simply using the current physical roadway infrastructures more effectively, then one can justify the cost of deploying intelligent vehicle/traffic-light coordination systems. In this paper, we demonstrate these concepts through a case study of scheduling vehicles on a grid of intersecting roads. We develop heuristic algorithms and an optimization model using the space-time network for this problem, and compare them. Moreover, we also compare the space-time network modeling technique with the integer programming optimization approach and show that the former is better for modeling traffic coordination systems.
New stability and stabilization conditions for systems with time-delay
Authors: Yuanqing Xia, G. P. Liu, P. Shi, D. Rees, E. J. C. Thomas
Venue: International Journal of Systems Science (2007)

In this article, the problems of stability and stabilization for systems with both constant and time-varying delays have been considered. By the so-called lifting method, time-delay systems are transformed into delay-free systems such that simple necessary and sufficient conditions have been developed for the stability analysis of systems with constant delays. For systems with time-varying delays, they have been converted to a switched system so that the existing results can be applied to analyze the problems of stability and stabilization. Linear matrix inequality (LMI) approach has been employed to the state feedback control design. Numerical examples are given to show the effectiveness of the proposed technique.
Brief paper: Extended results on robust state estimation and fault detection
Authors: C. P. Tan, F. Crusca, M. Aldeen
Venue: Automatica (Journal of IFAC) (2008)

A common requirement implicit in the current methods for the design of robust state estimators and robust fault detection filters is that the first Markov matrix must be non-zero, and indeed, full rank. We relax both of these restrictions in this paper to allow the applicability to a wider range of systems. The extended results are then applied to an aircraft fault detection for which the restrictive condition is not satisfied.
Holding Companies to Account in Cyberspace: The Threat Posed by Internet-based, Anti-corporate Campaigners
Authors: Tom Burns
Venue: International Review of Law, Computers and Technology (2007)

Companies are taking advantage of the opportunities offered by globalisation to reach new markets and to lower their costs. It is common for large companies to establish overseas subsidiaries. The different legal regimes and law enforcement policies that exist in many developing economies and the current weaknesses of international regulation means that it can be difficult to hold international companies to account when they transgress. However, this may be changing to some extent as a result of the Internet. This paper proposes to examine the extent to which the Internet can act as a medium for non-governmental organisations and pressure groups to bring about changes in corporate behaviour where the law or law enforcement has proved to be ineffective in curbing corporate abuses. New developments on the web (and particularly the rise of the 'blog') have been strengthening the persuasive power of pressure groups and the NGOs with regards to companies. However, this state of affairs may not last as companies seek new ways to limit the impact of these groups on their corporate strategies. This paper shall examine how companies are currently dealing with the threat to their corporate reputations from the Internet and shall consider whether companies can succeed in keeping effective regulation of their international commercial activities in the global market place at bay.
An introduction to real-time embedded systems
Authors: John W. McCormick
Venue: Journal of Computing Sciences in Colleges (2008)

A vast majority of all microprocessors manufactured today are used in embedded systems. These systems are distinguished by their interaction with unique hardware, concurrent measurement and control of analog environmental variables, predictable response times, reliability, and safety. Unfortunately, very few undergraduate computer science programs address the special issues involved in the specification, design, implementation, testing, or verification of real-time embedded software. As result, most embedded software is developed by electrical engineers with a course or two in C programming. As computing hardware continues to decline in price and increase in power, applications we had never dreamed of in the past are now possible. The inevitable increase in software complexity requires development team members with skills beyond basic C programming -- the skills of a computer science graduate.
A Practical Exact Algorithm for the Individual Haplotyping Problem MEC
Authors: Minzhu Xie, Jianxin Wang, Jianer Chen
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

The individual haplotyping problem MEC is a computational problem that, given a set of DNA sequence fragment data of an individual, induces the corresponding haplotypes by changing the smallest number of SNPs. MEC problem is NP-hard and there has been no practical exact algorithm to solve the problem. In DNA sequencing experiments, due to technical limits, the maximum length of a fragment sequenced directly is about 1kb. In consequence, the maximum number k of SNP sites that a fragment covers is usually small. Based on the observation above, the current paper introduces a new parameterized algorithm of runningtime O(m k 3^{k}+mlogm+mk), where m is the number of fragments. The algorithm solves the MEC problem efficiently even if the number of fragments and SNPs are large, and is practical in real biological applications.