ppxscal/embedding_network huggingface dataset:
Ased: availability, security, and debugging support usingtransactional memory
Authors: JaeWoong Chung, Woongki Baek, Nathan Grasso Bronson, Jiwon Seo, Christos Kozyrakis, Kunle Olukotun
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

We propose ASeD that uses the hardware resources of transactional memory systems for non transactional memory purpose. We show that the hardware components for register checkpointing, data versioning, and conflict detection can be reused as basic building blocks for reliability, security, and debugging support.
Production of Landsat ETM+ reference imagery of burned areas within Southern African savannahs: comparison of methods and application to MODIS
Authors: A. M. S. Smith, N. A. Drake, M. J. Wooster, A. T. Hudak, Z. A. Holden, C. J. Gibbons
Venue: International Journal of Remote Sensing (2007)

Accurate production of regional burned area maps are necessary to reduce uncertainty in emission estimates from African savannah fires. Numerous methods have been developed that map burned and unburned surfaces. These methods are typically applied to coarse spatial resolution (1 km) data to produce regional estimates of the area burned, while higher spatial resolution (
Losing Faith: How the (Andy) Grove Survivors Led the Decline of Intel's Corporate Culture, First edition
Authors: Bob Coleman, Logan Shrine
Venue:  (2007)

What has happened to Andy Grove's Intel? A Wall Street Journal article dated November 1, 2006 stated that Andy Grove "won't talk about current goings on at Intel. He does, though, talk about its past and wistfully. He helped make Intel one of the world's greatest brands; for most men, that would be the prelude to a retirement full of self-satisfaction. Instead, there is much regret that Andy Grove's Intel wasn't able to use its brand name for even one other great thing besides microprocessors." The cult of Andy Grove consisted of a core set of values expressed as certain behaviors that Grove himself forced on employees long before the Intel values were formally published and put on employee badges. What many outsiders don t know is that management s actions within Intel's corporate culture were inconsistent with the published values. After Grove's departure, this gap between management behaviors and the published values was amplified, establishing the impetus for the decline of Intel's performance-based corporate culture. In light of Intel spending over $10 billion on 35 acquisitions, its diversification strategy lacked an overall execution plan for tying it all together and making it work within their existing business and economic models. Intel s lackluster stock market performance over the past six years has not prevented many investors from hoping that the stock will once again repeat its past stellar performance. The world has changed and the business model that made Intel the behemoth that it is today may have lost its relevance. More importantly, the culture that in the past fueled Intel s growth has now become ossified. In contrast to Andy Grove's reticence about the current Intel, the authors of Losing Faith share their objective observations on the post-Grove Intel, with its cultural anomalies that attempt to explain why the company has not been able to successfully diversify beyond its Grove-led dominance in microprocessors.
Local text reuse detection
Authors: Jangwon Seo, W. Bruce Croft
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Text reuse occurs in many different types of documents and for many different reasons. One form of reuse, duplicate or near-duplicate documents, has been a focus of researchers because of its importance in Web search. Local text reuse occurs when sentences, facts or passages, rather than whole documents, are reused and modified. Detecting this type of reuse can be the basis of new tools for text analysis. In this paper, we introduce a new approach to detecting local text reuse and compare it to other approaches. This comparison involves a study of the amount and type of reuse that occurs in real documents, including TREC newswire and blog collections.
Optimizing AES for embedded devices and wireless sensor networks
Authors: Shammi Didla, Aaron Ault, Saurabh Bagchi
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

The increased need for security in embedded applications in recent years has prompted efforts to develop encryption algorithms capable of running on resource constrained systems. The inclusion of the Advanced Encryption Standard (AES) in the IEEE 802.15.4 Zigbee protocol has driven its widespread use in current embedded platforms. We propose an implementation of AES in a high-level language (C in this case) that is the first software-based solution for 16-bit microcontrollers capable of matching the communication rate of 250 kbps specified by the Zigbee protocol, while also minimizing RAM and ROM usage. We discuss a series of optimizations and their effects that lead to our final implementation achieving an encryption speed of 286 kbps, RAM usage of 260 bytes, and code size of 5160 bytes on the Texas Instruments MSP430 microprocessor. We also develop rigorous benchmark experiments to compare other AES implementations on a common platform, and show that our implementation outperforms the best available implementation by 85%.
Dynamic Video Transcoding in Mobile Environments
Authors: Bo Shen, Wai-Tian Tan, Frederic Huve
Venue: IEEE MultiMedia (2008)

A transcoder with dynamic feedback addresses interactivity, packet loss, and client power constraints in mobile communication systems.
Integrated process planning and scheduling in a supply chain
Authors: Chiung Moon, Young Hae Lee, Chan Seok Jeong, YoungSu Yun
Venue: Computers and Industrial Engineering (2008)

This paper deals with the integration of process planning and scheduling, which is one of the most important functions in a supply chain to achieve high quality products at lower cost, lower inventory, and high level of performance. Solving the problem is essential for the generation of flexible process sequences with resource selection and for the decision of the operation schedules that can minimize makespan. We formulate a mixed integer programming model to solve this problem of integration. This model considers alternative resources: sequences and precedence constraints. To solve the model, we develop a new evolutionary search approach based on a topological sort. We use the topological sort to generate a set of feasible sequences in the model within a reasonable computing time. Since precedence constraints between operations are handled by the topological sort, the developed evolutionary search approach produces only feasible solutions. The experimental results using various sizes of problems provide a way to demonstrate the efficiency of the developed evolutionary search approach.
A hybrid thin-client protocol for multimedia streaming and interactive gaming applications
Authors: D. De Winter, P. Simoens, L. Deboosere, F. De Turck, J. Moreau, B. Dhoedt, P. Demeester
Venue: Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video (2006)

Despite the growing popularity and advantages of thin-client systems, they still have some important shortcomings. Current thin-client systems are ideally suited to be used with classic office-applications but as soon as multimedia and 3D gaming applications are used they require a large amount of bandwidth and processing power. Furthermore, most of these applications heavily rely on the Graphical Processing Unit (GPU). Due to the architectural design of thin-client systems, they cannot profit from the GPU resulting in slow performance and bad image quality. In this paper, we propose a thin-client system which addresses these problems: we introduce a realtime desktopstreamer using a videocodec to stream the graphical output of applications after GPU-processing to a thin-client device, capable of decoding a videostream. We compare this approach to a number of popular classic thin-client systems in terms of bandwidth, delay and image quality. The outcome is an architecture for a hybrid protocol, which can dynamically switch between a classic thin-client protocol and realtime desktopstreaming.
Retrieval sensitivity under training using different measures
Authors: Ben He, Craig Macdonald, Iadh Ounis
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Various measures, such as binary preference (bpref), inferred average precision (infAP), and binary normalised discounted cumulative gain (nDCG) have been proposed as alternatives to mean average precision (MAP) for being less sensitive to the relevance judgements completeness. As the primary aim of any system building is to train the system to respond to user queries in a more robust and stable manner, in this paper, we investigate the importance of the choice of the evaluation measure for training, under different levels of evaluation incompleteness. We simulate evaluation incompleteness by sampling from the relevance assessments. Through large-scale experiments on two standard TREC test collections, we examine retrieval sensitivity when training - i.e. if a training process, based on any of the four discussed measures has an impact on the final retrieval performance. Experimental results show that training by bpref, infAP and nDCG provides significantly better retrieval performance than training by MAP when relevance judgements completeness is extremely low. When relevance judgements completeness increases, the measures behave more similarly.
Static analysis of medical device software using CodeSonar
Authors: Raoul Praful Jetley, Paul L. Jones, Paul Anderson
Venue: Proceedings of the 2008 workshop on Static analysis (2008)

Post-market investigators at the United States Food and Drug Administration may need to review medical device software to assess its integrity. They have to do this with little or no prior knowledge of the software. Historically, the only way to perform such a review has been to manually search the code for potential sources of error --- a process that is both tedious and error-prone. Static analysis tools can improve this process by providing a means for automated error detection. By using symbolic execution techniques to explore execution paths of the software, static analysis provides complete, or almost complete, coverage of the code, and helps detect potentially fatal errors that may not easily be detected through conventional testing methods. Using automated static analysis tools can help reduce the effort involved in analysis and provide a more accurate assessment of the software. In this paper, we discuss CodeSonar, a whole-program interprocedural static analysis tool for C/C++ programs, and illustrate how it was used to facilitate error detection during a post-market investigation.
A methodology for statistical estimation of read access yield in SRAMs
Authors: Mohamed H. Abu-Rahma, Kinshuk Chowdhury, Joseph Wang, Zhiqin Chen, Sei Seung Yoon, Mohab Anis
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

The increase of process variations in advanced CMOS technologies is considered one of the biggest challenges for SRAM designers. This is aggravated by the strong demand for lower cost and power consumption, higher performance and density which complicates SRAM design process. In this paper, we present a methodology for statistical simulation of SRAM read access yield, which is tightly related to SRAM performance and power consumption. The proposed flow enables early SRAM yield predication and performance/power optimization in the design time, which is important for SRAM in nanometer technologies. The methodology is verified using measured silicon yield data from a 1 Mb memory fabricated in an industrial 45nm technology.
Polynomial algorithm for the k-cut problem
Authors: O. Goldschmidt, D. S. Hochbaum
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

The k-cut problem is to find a partition of an edge weighted graph into k nonempty components, such that the total edge weight between components is minimum. This problem is NP-complete for arbitrary k and its version involving fixing a vertex in each component is NP hard even for k=3. A polynomial algorithm for the case of a fixed k is presented.
An analytic hierarchy process and two-sided matching based decision support system for military personnel assignment
Authors: İbrahim Korkmaz, Hadi Gökçen, Tahsin Çetinyokuş
Venue: Information Sciences: an International Journal (2008)

Assignment of military personnel to positions is very demanding, primarily a manual process performed by detailers. Detailers try to satisfy needs and preferences of commands and personnel. In this paper, an analytic hierarchy process (AHP) and two sided matching based Decision Support System is proposed to assist detailers. The DSS is programmed to generate positions' preferences from position requirement profiles and personnel competence profiles by using analytic hierarchy process and matches personnel to positions by using two-sided matching. The use of the proposed DSS is demonstrated with an example. Also, the effects of preference list length on two-sided matching are examined.
POREI: patterns-oriented requirements elicitation integrated -- proposal of a metamodel patterns-oriented for integration of the requirement elicitation process
Authors: Kleber Rocha de Oliveira, Mauro de Mesquita Spínola
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

The requirements elicitation is essential to the success of software development projects. Many papers have been written that promulgate specific elicitation methods. However, none have yet modeled elicitation in a way that makes clear the critical role played by situational knowledge. This paper presents a unified model of the requirements elicitation process that emphasizes the applying the concepts of patterns as it transforms the current state of the business requirements and the situation to an improved understanding of the requirements and, potentially, a modified situation. One meta-model of requirements elicitation, selection of an appropriate elicitation technique, is also captured in the model. The values of this model are: (a) an improved understanding of elicitation helps analysts improve their elicitation efforts and (b) as we improve our ability to perform elicitation, we improve the likelihood that systems we create will meet their intended customers' needs. These patterns are elicited from coordination and transaction costs economics theories and they are validated through a wide variety of relevant situation.
Diagrammatic Education For Software Engineering
Authors: Ryo Kawabata, Kiyoshi Itoh
Venue: Journal of Integrated Design Process Science (2006)

In the education of software engineering, it is important to educate learners about diagrammatic representations for analyzing configurations or functions of a target system. In systems analysis two or more diagrammatic representation are described in appropriate order, which experts know as the effective analysis process. Education of the analysis process using diagrammatic representations is more important and essential rather than education of notations of diagrammatic representations. This paper proposes an intelligible analysis process which is suitable for education. Learners of systems analysis can acquire the process model effectively by using the process model, which includes Petri Net, STD, DFD, and IDEF0, in this order. It is easy to reuse components between the diagrammatic representations according to the analysis process.
50 Years young
Authors: Scott E. Delman
Venue: Communications of the ACM (2008)

I've received dozens of email messages providing feedback on the July issue.
Transparently Adding Security Properties to Service Orchestration
Authors: Stéphanie Chollet, Philippe Lalanda, André Bottaro
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In this paper, we present a tool allowing the design of service orchestration at a high level of abstraction. This tool also allows specifying security properties, also in an abstract way, as annotations on the services orchestration. Our purpose is to generate code, including security code, from this specification. This is especially important in the context of complex execution platforms like Enterprise Service Buses. Our tool is used in the context of industrial plants using more and more services like DPWS to implement applications.
Bagging with Adaptive Costs
Authors: Yi Zhang, W. Nick Street
Venue: IEEE Transactions on Knowledge and Data Engineering (2008)

Ensemble methods have proved to be highly effective in improving the performance of base learners under most circumstances. In this paper, we propose a new algorithm that combines the merits of some existing techniques, namely bagging, arcing and stacking. The basic structure of the algorithm resembles bagging. However, the misclassification cost of each training point is repeatedly adjusted according to its observed out-of-bag vote margin. In this way, the method gains the advantage of arcing - building the classifier the ensemble needs - without fixating on potentially noisy points. Computational experiments show that this algorithm performs consistently better than bagging and arcing with linear and nonlinear base classifiers. In view of the characteristics of bacing, a hybrid ensemble learning strategy, which combines bagging and different versions of bacing, is proposed and studied empirically.
The Elements of Computing Systems: Building a Modern Computer from First Principles (History of Computing S.)
Authors: Noam Nisan, Shimon Schocken
Venue:  (2008)

In the early days of computer science, the interactions of hardware, software, compilers, and operating system were simple enough to allow students to see an overall picture of how computers worked. With the increasing complexity of computer technology and the resulting specialization of knowledge, such clarity is often lost. Unlike other texts that cover only one aspect of the field, The Elements of Computing Systems gives students an integrated and rigorous picture of applied computer science, as its comes to play in the construction of a simple yet powerful computer system. Indeed, the best way to understand how computers work is to build one from scratch, and this textbook leads students through twelve chapters and projects that gradually build a basic hardware platform and a modern software hierarchy from the ground up. In the process, the students gain hands-on knowledge of hardware architecture, operating systems, programming languages, compilers, data structures, algorithms, and software engineering. Using this constructive approach, the book exposes a significant body of computer science knowledge and demonstrates how theoretical and applied techniques taught in other courses fit into the overall picture. Designed to support one- or two-semester courses, the book is based on an abstraction-implementation paradigm; each chapter presents a key hardware or software abstraction, a proposed implementation that makes it concrete, and an actual project. The emerging computer system can be built by following the chapters, although this is only one option, since the projects are self-contained and can be done or skipped in any order. All the computer science knowledge necessary for completing the projects is embedded in the book, the only pre-requisite being a programming experience. The book's web site provides all tools and materials necessary to build all the hardware and software systems described in the text, including two hundred test programs for the twelve projects. The projects and systems can be modified to meet various teaching needs, and all the supplied software is open-source.
Clustering search results for mobile terminals
Authors: Michiko Yasukawa, Hidetoshi Yokoo
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Mobile terminals such as cell phones are much more restricted in terms of input/output functionality and, therefore, some special techniques must be incorporated to enable them to be easily used for Web searching. Further, searching for a location name is related to a dazzling variety of topics. We relate these two factors to each other to yield a new search system for map and text information. Presenting search results as clusters is helpful for users, especially in a mobile environment. The system makes mobile web searching easier and more efficient.
Color and texture image segmentation using uniform local binary patterns
Authors: Sara Arasteh, Chih-Cheng Hung
Venue: Machine Graphics Vision International Journal (2006)

The paper describes a new algorithm for image segmentation based on the color and texture features. The Uniform Local Binary Pattern (ULBP) method is used to extract texture features. Color features are defined based on the pixels color bands. Image segmentation is carried out using the K-means algorithm on feature vectors, including color and texture features. The distance measure is defined as a function of the color and texture feature vector distances from the K-means defined centers. The weighting parameter is used to adjust the relative contribution of the color and texture features. The proposed algorithm is applied to color images in the RGB, HSV and IHLS color spaces. Experimental results show that the proposed algorithm yields good performance in combining color and texture features to distinguish different texture patterns. In particular, for textures with high color contrast, the results are prominent. The main advantage of the method is its speed and simplicity, which are inherited from the K-means algorithm.
Optimal approximation for the submodular welfare problem in the value oracle model
Authors: Jan Vondrak
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

In the Submodular Welfare Problem, m items are to be distributed among n players with utility functions wi: 2[m] → R+. The utility functions are assumed to be monotone and submodular. Assuming that player i receives a set of items Si, we wish to maximize the total utility ∑i=1n wi(Si). In this paper, we work in the value oracle model where the only access to the utility functions is through a black box returning wi(S) for a given set S. Submodular Welfare is in fact a special case of the more general problem of submodular maximization subject to a matroid constraint: max{f(S): S ∈ I}, where f is monotone submodular and I is the collection of independent sets in some matroid. For both problems, a greedy algorithm is known to yield a 1/2-approximation [21, 16]. In special cases where the matroid is uniform (I = S: |S| ≤ k) [20] or the submodular function is of a special type [4, 2], a (1-1/e)-approximation has been achieved and this is optimal for these problems in the value oracle model [22, 6, 15]. A (1-1/e)-approximation for the general Submodular Welfare Problem has been known only in a stronger demand oracle model [4], where in fact 1-1/e can be improved [9]. In this paper, we develop a randomized continuous greedy algorithm which achieves a (1-1/e)-approximation for the Submodular Welfare Problem in the value oracle model. We also show that the special case of n equal players is approximation resistant, in the sense that the optimal (1-1/e)-approximation is achieved by a uniformly random solution. Using the pipage rounding technique [1, 2], we obtain a (1-1/e)-approximation for submodular maximization subject to any matroid constraint. The continuous greedy algorithm has a potential of wider applicability, which we demonstrate on the examples of the Generalized Assignment Problem and the AdWords Assignment Problem.