ppxscal/embedding_network huggingface dataset:
CAMEL: An Efficient Fault Simulator with Coupling Fault Simulation Enhancement for CAMs
Authors: Hsiang-Huang Wu, Jin-Fu Li, Chi-Feng Wu, Cheng-Wen Wu
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Content addressable memories (CAMs) are widely used in digital systems. A test algorithm for CAMs must be able to cover the random access memory (RAM) faults and com- parison faults. However, CAM circuits are usually cus- tomized for different products, so there are no standard tests, i.e., tests should be adapted to a specific design man- ufactured using specific technology. This paper presents a fault simulator, called CAM Evaluation tooL (CAMEL), for the evaluation of fault coverage of CAM test algorithms. It supports five common functional outputs, i.e., Data I/O, hit, multi-hit, matchout, and priority address for various CAM specifications. Since coupling fault simulation domi- nates the efficiency of a memory fault simulator, a concept of observability is proposed to simplify the coupling fault behavior. By exploiting the observability, a compression technique is also proposed to speed up the fault simula- tion and reduce memory usage. CAMEL can support both RAM faults and comparison faults. We have demonstrated the CAMEL using widely-used March tests and CAM tests. Simulation results show that the CAMEL can evaluate the fault coverage of tests accurately and efficiently.
A New Method for Face Recognition Based on Color Information and a Neural Network
Authors: Khalid Youssef, Peng-Yung Woo
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Recent study demonstrates that color information makes contribution and enhances robustness in face recognition. Yet, most of the approaches to face recognition still use gray-scale images, mainly due to the extra processing and storage costs of the larger input size for color images. Multi-layer neural networks (MLNs) have been widely used in face recognition applications and yielded highly competitive results. This paper proposes a new method that makes a full use of color information without noteworthy extra processing cost, and demonstrates that the neural network in the proposed method is compatible with the existing MLN training algorithms based on error back propagation (EBP). Experimental results verify the superiority of the proposed method in face recognition.
Unified adaptivity optimization of clock and logic signals
Authors: Shiyan Hu, Jiang Hu
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

VLSI design is increasingly sensitive to variations which often degrade the parametric yield. Post-silicon tuning techniques can compensate for specific variations on the die and thus significantly improve the yield. Previous works on adaptivity optimization for post-silicon tuning focus on either logic signal tuning or clock signal tuning. This paper proposes the first unified adaptivity optimization on logical and clock signal tuning, which enables us to significantly save resource. In addition, it does not need any assumption on variation distributions. Our unified optimization is based on a novel linear programming formulation which can be efficiently solved by an advanced robust linear programming technique. Due to the discrete nature of the problem, the continuous solution obtained from linear programming is then efficiently discretized. This procedure involves binary search accelerated dynamic programming, batch based optimization, and Latin Hypercube sampling based fast simulation. Our experimental results demonstrate that up to 50% area cost reduction can be obtained by the unified optimization compared to optimization on logic or clock alone. In addition, the proposed discretization approach significantly outperforms the alternatives in terms of solution quality and runtime.
Solving combined inverse problems for multicomponent parabolic distributed systems
Authors: I. V. Sergienko, V. S. Deineka
Venue: Cybernetics and Systems Analysis (2007)

The paper outlines a technique to construct computational algorithms for solving combined inverse problems for multicomponent parabolic systems with main and natural inhomogeneous interface conditions. Frechet derivatives are obtained in explicit form for quadratic residual functionals to construct gradient computational algorithms.
A Design Method of Bang-Bang and PID Integrated Controller Based on Rough Set
Authors: Shaomian Chen, Jun Zhao, Jixin Qian
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

An efficient design method to improve the control perfor- mance of rough controller which integrates the Bang-Bang control rules with PID control rules is presented in this pa- per. The two parts of rules extracted from Bang-Bang con- troller and PID controller by rough set, respectively, are combined to a uniform decision making system under a cer- tain selection mechanism. This rough controller reserved all the advances of Bang-Bang control and PID control en- ables to deal with different magnitudes of set point variation and large disturbance. Simulations show the effectiveness of this method.
Towards FineGrained Authorizations in Small Office and Home Networks
Authors: Jani Suomalainen
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Networking technologies, service gateways, and emerging middleware solutions are making development and deployment of services into heterogeneous Small Office and Home (SOHO) networks fast and easy. However, due to various users, untrustworthy components, and vulnerable technologies, critical assets of common users are threatened by insider attacks. Therefore, easytouse authorization solutions for protecting SOHO services are needed. This paper surveys security and privacy threats, requirements, and existing solutions. Further, architecture for middleware based authorization is proposed.
MULS: A General Framework of Providing Multilevel Service Quality in Sequential Data Broadcasting
Authors: Hao-Ping Hung, Ming-Syan Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

In recent years, data broadcasting becomes a promising technique to design a mobile information system with power conservation, high scalability and high bandwidth utilization. In many applications, the query issued by a mobile client corresponds to multiple items which should be accessed in a sequential order. In this paper, we study the scheduling approach in such a sequential data broadcasting environment. Explicitly, we propose a general framework referred to as MULS (standing for MUlti-Level Service) for an information system. There are two primary stages in MULS: on-line scheduling and optimization procedure. In the first stage, we propose an On- Line Scheduling algorithm (denoted by OLS) to allocate the data items into multiple channels. As for the second stage, we devise an optimization procedure SCI, standing for Sampling with Controlled Iteration, to enhance the quality of broadcast programs generated by algorithm OLS. Procedure SCI is able to strike a compromise between effectiveness and efficiency by tuning the control parameters. According to the experimental results, we show that algorithm OLS with procedure SCI outperforms the approaches in prior works prominently in both effectiveness (i.e., the average access time of mobile users) and efficiency (i.e., the complexity of the scheduling algorithm). Therefore, by cooperating algorithm OLS with procedure SCI, the proposed MULS framework is able to generate broadcast programs with flexibility of providing different service qualities under different requirements of effectiveness and efficiency: in the dynamic environment in which the access patterns and information contents change rapidly, the parameters used in SCI will perform online scheduling with satisfactory service quality. As for the static environment in which the query profile and the database are updated infrequently, larger values of parameters are helpful to generate an optimized broadcast program, indicating the advantageous feature of MULS.
Extracting Meaning from Abbreviated Identifiers
Authors: Dawn Lawrie, Henry Feild, David Binkley
Venue: Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (2007)

Informative identifiers are made up of full (natural language) words and (meaningful) abbreviations. Readers of programs typically have little trouble understanding the purpose of identifiers composed of full words. In addition, those familiar with the code can (most often) determine the meaning of abbreviations used in identifiers. However, when faced with unfamiliar code, abbreviations often carry little useful information. Furthermore, tools that focus on the natural language used in the code have a hard time in the presence of abbreviations. One approach to providing meaning to programmers and tools is to translate (expand) abbreviations into full words. This paper presents a methodology for expanding identifiers and evaluates the process on a code based of just over 35 million lines of code. For example, using phrase extraction, fs exists is expanded to file status exists illustrating how the expansion process can facilitate comprehension. On average, 16 percent of the identifiers in a program are expanded. Finally, as an example application, the approach is used to improve the syntactic identification of violations to Deiβenb¨ock and Pizka's rules for concise and consistent identifier construction.
Experiences with Performance Measurement and Modeling of a Processor Array
Authors: H. Fromm
Venue: IEEE Transactions on Computers (1983)

The evolution of technology provides the opportunity of forming large processor ensembles working closely together. When decomposing application programs and assigning subtasks to different processors we expect not only high throughput, but also the fastest possible execution of each individual demand. The level of performance in these areas is strongly influenced by the hardware interconnection structure and by the communication software.
Combining synchronous and asynchronous timing schemes for high-performance systems
Authors: Tim Cheng
Venue: IEEE Design Test (2007)

Globally asynchronous, locally synchronous (GALS) design is emerging as the architecture of choice for certain applications. In a GALS system, the circuitry in each timing domain is locally synchronized, and different clock domains are glued together according to asynchronous communication schemes. This issue of IEEE Design & Test introduces some basic design and validation issues of the GALS architecture. The editorial from the guest editors outlines the scope of this special theme. In addition to the special theme, this issue also includes a special section highlighting the International Test Conference (ITC). Finally, there is a short report of highlights from the 2007 Design Automation Conference held earlier this year.
Innovation or Notoriety?
Authors: Philip Emma
Venue: IEEE Micro (2007)

The purpose of this column is to give some perspective and words of advice to new inventors. When you choose to be an innovator, you will have lots of fun intellectually, but the road can be pretty bumpy when it comes to the politics of receiving proper credit for your ideas, and when it comes to "selling" your ideas and seeing them through to implementation. This column documents some of the possible bumps in the road, including the three stages toward acceptance of a new idea: ridicule, opposition, and obviousness.
An empirical study of a reverse engineering method for the aggregation relationship based on operation propagation
Authors: Dowming Yeh, Pei-Chen Sun, William Chu, Chien-Lung Lin, Hongji Yang
Venue: Empirical Software Engineering (2007)

One of the major obstacles in reverse engineering legacy object-oriented systems is the identification of aggregation relationships. An aggregation relationship, also called whole---part relationship, is a form of association relationship where an object is considered as a part of another object. This characteristic is mostly of semantic nature; therefore, it is difficult to distinguish aggregation from association relationships by implementation mechanism. Most reverse engineering methods for aggregation relationships are based on the lifetime dependence of an object on another object since many implementations of aggregation relationships result in such dependence. However, research literature shows that lifetime dependence is not really a primary property of the aggregation relationships. A reverse engineering approach is proposed on the basis of a primary characteristic for aggregation relationship--propagation of operations. To compare the propagation-based method with the lifetime-based method, we apply both methods to ten class libraries, collect their output, and perform statistical analysis to determine the effectiveness of the two methods. The analysis results show that the propagation-based method performs significantly better than the lifetime-based method and by combining both methods simultaneously the complete aggregation relationships can be uncovered for the class libraries in our experiment.
Are MIS research instruments stable? An exploratory reconsideration of the computer playfulness scale
Authors: Alexander Serenko, Ofir Turel
Venue: Information and Management (2007)

Computer systems have changed significantly in the past decades and this means that MIS research instruments developed when surveying users of legacy systems could be out-of-date. However, these instruments are often considered stable. We undertook an empirical exploratory investigation of the unidimensionality of the computer playfulness scale because several academics had reported inconsistent item loadings that they could not explain. As a result of our investigation, we concluded that the original computer playfulness construct consists of two correlated but distinct factors when administered to today's IS users. Negatively worded items had no impact on the properties of the scale. Temporal structural stability was hypothesized as an explanation of the observed shift in this construct's psychometric properties.
VegaDLib: A Service-Oriented Platform for Building Digital Libraries
Authors: Ke Li, Haozhi Liu, Haiyan Yu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Many digital libraries are built with a solutionbased approach in which components are tightly coupled that makes them difficult to reuse when adapting to new application requirements. In this paper, we propose a generic, service-oriented platform called VegaDLib for building digital libraries in a modular, customizable, and standard-based way. This platform enables normal users to build their own digital libraries with little effort for its low cost barrier and knowledge barrier. VegaDLib consists of a federation of services that can meet the basic requirements in the field of digital library. Additional services can be easily integrated for particular needs. Service-Oriented Architecture, MVC framework and runtime configurable features, make it an extensible, customizable and flexible system. The implementation of standard OAI-PMH [1] facilitates the interoperability of distributed individual libraries; as a result, a federate digital library system can be built.
Efficient processing of top-k dominating queries on multi-dimensional data
Authors: Man Lung Yiu, Nikos Mamoulis
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

The top-k dominating query returns k data objects which dominate the highest number of objects in a dataset. This query is an important tool for decision support since it provides data analysts an intuitive way for finding significant objects. In addition, it combines the advantages of top-k and skyline queries without sharing their disadvantages: (i) the output size can be controlled, (ii) no ranking functions need to be specified by users, and (iii) the result is independent of the scales at different dimensions. Despite their importance, top-k dominating queries have not received adequate attention from the research community. In this paper, we design specialized algorithms that apply on indexed multi-dimensional data and fully exploit the characteristics of the problem. Experiments on synthetic datasets demonstrate that our algorithms significantly outperform a previous skyline-based approach, while our results on real datasets show the meaningfulness of top-k dominating queries.
Reorganizing and consolidating faculty development to support online teaching and learning: one university's experience
Authors: Anna T. McFadden, John LeBaron, Beth Tyson Lofquist, Patricia Brown
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

The purpose of this paper is 1) to offer a case history of one university's attempt to rethink faculty development for teaching and learning and 2) to specifically detail the reorganization and consolidation of services related to online teaching and learning. Authors will outline the research and resulting data that informed the processes leading to a redesigned center for teaching and learning and will identify the resulting key features aligned to a needs assessment and research-based practice for effective faculty development for online teaching and learning.
B72-26 Computer Organization and the System/370
Authors: I. Flores
Venue: IEEE Transactions on Computers (1972)

Goal and Result: The author states that the aim of this book is "1) to present an introduction to computers and programming using the System/370 as the primary vehicle; and 2) to present an introduction o the System/370 for people experienced in computer science. I have found that this book contains a lot of useful information and, in fact, I can say that I learned quite a bit from the book. However, this does not mean that the author has met his goals. As for the beginner, hewould not come out with a thorough understanding of S/370 or computers in general because so little space was devoted to his initiation. The intermediate or advanced computer scientist would learn much about S/370 but I am afraid he would be left with many questions about the beast, just as I was. 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
Improving Management Productivity with Computer Graphics
Authors: A. T. Paller
Venue: IEEE Computer Graphics and Applications (1981)

By avoiding a few common errors, managers can ensure the productivity of their investment in business chartmaking systems. 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
Team flexibility's relationship to staffing and performance in complex projects: An empirical analysis
Authors: Sara A. McComb, Stephen G. Green, W. Dale Compton
Venue: Journal of Engineering and Technology Management (2007)

We examine the role of flexibility in project team effectiveness. Specifically, we hypothesize that (1) it will mediate the relationship between staffing quality and effectiveness and (2) its relationship with team effectiveness will be moderated by project complexity, where more flexibility will be required when projects are complex. Hypotheses are tested using data collected from 60 cross-functional project teams. The results indicated that flexibility mediates the relationship between staffing quality and team performance (goal achievement and cohesion, but not project efficiency). Additionally, we find that two-dimensions of project complexity moderate the flexibility-performance relationship. Specifically, the more alternatives a team must consider, the stronger the negative relationship between flexibility and project efficiency is. The flexibility-cohesion relationship also was moderated, such that the relationship is more positive when the project is more ambiguous and more negative when the project team faces many alternatives. Implications for research and practice are discussed.
Deciding orthogonal bisimulation
Authors: Thuy Duong Vu
Venue: Formal Aspects of Computing (2007)

Bergstra, Ponse and van der Zwaag introduced in 2003 the notion of orthogonal bisimulation equivalence on labeled transition systems. This equivalence is a refinement of branching bisimulation, in which consecutive tau&#x2019;s (silent steps) can be compressed into one (but not zero) tau&#x2019;s. The main advantage of orthogonal bisimulation is that it combines well with priorities. Here we solve the problem of deciding orthogonal bisimulation equivalence in finite (regular) labeled transition systems. Unlike as in branching bisimulation, in orthogonal bisimulation, cycles of silent steps cannot be eliminated. Hence, the algorithm of Groote and Vaandrager (1990) cannot be adapted easily. However, we show that it is still possible to decide orthogonal bisimulation with the same complexity as that of Groote and Vaandrager&#x2019;s algorithm. Thus if n is the number of states, and m the number of transitions then it takes O(n(m&#x00a0;+&#x00a0;n)) time to decide orthogonal bisimilarity on finite labeled transition systems, using O(m&#x00a0;+&#x00a0;n) space.
Prediction of Frequent Items to One Dimensional Stream Data
Authors: Duck Jin Chai, Eun Hee Kim, Long Jin, Buhyun Hwang, Keun Ho Ryu
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

Data mining in the stream data handles quality and data analysis using extremely large and infinite amount of data and disk or memory with limited volume. In such traditional transaction environment it is impossible to perform frequent items mining because it requires analyzing which item is a frequent one to continuously incoming stream data and which is probable to become a frequent item. This paper proposes a way to predict frequent items using regression model to the continuously incoming one dimensional stream data like the time series data. By establishing the regression model from the stream data, it may be used as a prediction model to uncertain items. The proposing way will exhibit its effectiveness through experiment in stream data.
Adding a True 3-D Display to a Raster Graphics System
Authors: H. Fuchs
Venue: IEEE Computer Graphics and Applications (1982)

This Experimental 3-D Graphics System Can Be Added to Standard Raster Graphics Systems at Modest Expense. It Promises Much Broader Access to Effective 3-D Display.