ppxscal/embedding_network huggingface dataset:
Simulated fault injections and their acceleration in SystemC
Authors: Silvio Misera, Heinrich Theodor Vierhaus, André Sieber
Venue: Microprocessors Microsystems (2008)

SystemC has found a large acceptance for the description of electronic systems. An essential advantage of a SystemC description is the possibility of a built-in compiled-code simulation. Beyond the functional simulation for validation of a hardware design, there are additional requirements for an advanced simulation of faults in order to analyze the system behavior under fault conditions. The article introduces known and novel methods of SystemC-based simulations with fault injections and provides simulation results. Some strategies are shown to accelerate the SystemC simulation by parallel computing. Furthermore, we present gate level and switch level models for an effective simulation in SystemC.
Intuitive application-specific user interfaces for mobile devices
Authors: Stefan Winkler, Karthik Rangaswamy, Jefry Tedjokusumo, ZhiYing Zhou
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

The user interfaces on current-day mobile devices are limited owing to their small form factor. In this paper, we propose intuitive user interfaces for two applications on mobile phones with built-in cameras, namely, a car-racing game and a map navigation application. These user interfaces are based on the visual detection of the device's self-motion. We discuss three different methodologies to implement same and conduct user studies to analyze people's acceptance of the interfaces in comparison to controlling the applications with keys on the phone. Results show that our proposed interfaces are well appreciated for their intuitiveness, even though there is a learning curve.
Decreasing the diameter of cycles
Authors: Elena Grigorescu
Venue: Journal of Graph Theory (2003)

Alon, Gy&aacute;rf&aacute;s, and Ruszink&oacute; [1] established a bound for the minimum number of edges that have to be added to a graph of n &ge; n0 vertices in order to obtain a graph of diameter 2. Alon et al. approximated n0 by a polynomial function of the maximum degree of the initial graph. They conjectured that the minimum value for n0 is 12 for the case of Cn, as opposed to n0 = 274 obtained by calculations for the general case. In this paper we prove their conjecture. For the reduction to diameter 3 of a cycle, we also improve the bounds from [1] showing that the minimum number of edges that need to be added to the cycle Cn is between n - 59 and n - 8. &copy; 2003 Wiley Periodicals, Inc. J Graph Theory 43: 299&ndash;303, 2003
A system for processing and recognition of old Greek manuscripts the D-SCRIBE project
Authors: S. J. Perantonis, B. Gatos, K. Ntzios, I. Pratikakis, I. Vrettaros, A. Drigas, C. Emmanouilidis, A. Kesidis, D. Kalomirakis
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

After many years of scholar study, manuscript collections continue to be an important source of novel information for scholars, concerning both the history of earlier times as well as the development of cultural documentation over the centuries. In this paper we present research efforts leading to the creation of a comprehensive software product, which can assist the content holders in turning an archive of manuscripts into a digital collection using automated methods. The system aims at supporting and facilitating current and future efforts in Early Christian Greek manuscript digitization and processing. A number of modules have been developed for the study and processing of the digital collections and are integrated under a common software environment. These modules include a document management system particularly adapted for manuscripts, a module for automatic processing and transliteration of manuscripts incorporating OCR techniques and a self study tool for the use of paleographers. In this paper, we focus on the description of the aforementioned modules that comprise the final system for processing and recognition of old Greek Manuscripts.
A coding approach to the multicast stream authentication problem
Authors: Christophe Tartary, Huaxiong Wang, Josef Pieprzyk
Venue: International Journal of Information Security (2008)

We study the multicast stream authentication problem when an opponent can drop, reorder and introduce data packets into the communication channel. In such a model, packet overhead and computing efficiency are two parameters to be taken into account when designing a multicast stream protocol. In this paper, we propose to use two families of erasure codes to deal with this problem, namely, rateless codes and maximum distance separable codes. Our constructions will have the following advantages. First, our packet overhead will be small. Second, the number of signature verifications to be performed at the receiver is O(1). Third, every receiver will be able to recover all the original data packets emitted by the sender despite losses and injection occurred during the transmission of information.
Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types
Authors: Alain Frisch, Giuseppe Castagna, Véronique Benzaken
Venue: Journal of the ACM (JACM) (2008)

Subtyping relations are usually defined either syntactically by a formal system or semantically by an interpretation of types into an untyped denotational model. This work shows how to define a subtyping relation semantically in the presence of Boolean connectives, functional types and dynamic dispatch on types, without the complexity of denotational models, and how to derive a complete subtyping algorithm.
Runtime Validation of Transactional Memory Systems
Authors: Kaiyu Chen, Sharad Malik, Priyadarsan Patra
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Transactional Memory (TM) has been proposed as a promising solution to effectively harness the increasing processing power of emerging multi/many-core systems. While there has been considerable research on the design and implementation of TM systems, it remains to be shown how to address the validation challenge of such systems in face of increasing design bugs and dynamic errors. This paper proposes a runtime validation methodology for ensuring the end-to-end correctness of a TM system. We use an extended constraint graph model to capture the correctness of a transactional execution, and provide efficient hardware support to perform online checking of this constraint graph. We describe the design ideas as well as the key optimization techniques to make this approach practical. Experiments based on a state-of-the-art TM system framework show that our design effectively performs system-level runtime validation with relatively small overhead.
Will the Overseas Expansion of Facebook Succeed?
Authors: Yun Wan, Vaishali Kumar, Amina Bukhari
Venue: IEEE Internet Computing (2008)

Social networking sites (SNSs) are becoming mainstream and are spreading worldwide. Here, the authors review Facebook and Orkut, two major SNSs, and analyze a recent survey conducted among Indian and Pakistani Orkut users. They aim to investigate Orkut users' experiences with Facebook, which has a stronghold in the US and is expanding globally to compete with Orkut. The survey indicates that the conservative and anticommercial Indian and Pakistani cultures might be a major challenge for Facebook in competing with Orkut in these societies.
The use of role play to simulate a tethered swarm of robots for urban search and rescue (USAR)
Authors: Adrian Albin-Clark, T. R. Vishnu Arun Kumar
Venue: Proceedings of the 13th annual conference on Innovation and technology in computer science education (2008)

A role play activity, in which people become tethered search robots, was trialled. The main constraint was space on the science centre floor, which reduced the effectiveness of the message.
The load, capacity and availability of quorum systems
Authors: M. Naor, A. Wool
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

A quorum system is a collection of sets (quorums) every two of which have a nonempty intersection. Quorum systems have been used for a number of applications in the area of distributed systems. We investigate the load, capacity and availability of quorum systems. We present four novel constructions of quorum system, all featuring optimal or near optimal load, and high availability. These desirable properties of the constructions translate into improvements of any protocol using them: a low work load on the processors and a high resilience to processor failures. The best construction, based on paths in a grid, has a load of O(1//spl radic/n), and a failure probability of exp(-O(/spl radic/n)) when the elements fail with probability p
Fairchild Symbol Computer
Authors: Stanley Mazor
Venue: IEEE Annals of the History of Computing (2008)

Under the leadership of Gordon Moore, Fairchild Semiconductor embarked on the design of a high-level time-sharing computer, Symbol IIR. In the mid-1960s, the falling costs of semiconductors made hardware seem like the logical design choice to replace common software functions. Symbol embodied that design, but to what effect?
Decidability and expressiveness for first-order logics of probability
Authors: M. Abadi
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

Decidability and expressiveness issues for two first-order logics of probability are considered. In one the probability is on possible worlds, whereas in the other it is on the domain. It turns out that in both cases it takes very little to make reasoning about probability highly undecidable. It is shown that, when the probability is on the domain, if the language contains only unary predicates, then the validity problem is decidable. However, if the language contains even one binary predicate, the validity problem is Pi /sub 1//sup 2/ as hard as elementary analysis with free predicate and function symbols. With equality in the language, even with no other symbol, the validity problem is at least as hard as that for elementary analysis, Pi /sub infinity //sup 1/. Thus, the logic cannot be axiomatized in either case. When the probability is on the set of possible worlds, the validity problem is Pi /sub 1//sup 2/ complete with as little as one unary predicate in the language, even without equality. With equality, Pi /sub infinity //sup 1/ hardness with only a constant symbol is obtained. In many applications it suffices to restrict attention to domains of a bounded size; it is shown that the logics are decidable in this case.
New efficiency results for makespan cost sharing
Authors: Yvonne Bleischwitz, Florian Schoppmann
Venue: Information Processing Letters (2008)

In the context of scheduling, we study social cost efficiency for a cost-sharing problem in which the service provider's cost is determined by the makespan of the served agents' jobs. For identical machines, we give surprisingly simple cross-monotonic cost-sharing methods that achieve the essentially best efficiency Moulin mechanisms can guarantee. Still, our methods match the budget-balance of previous (yet rather intricate) results. Subsequently, we give a generalization for arbitrary jobs. Finally, we return to identical jobs in order to perform a fine-grained analysis. We show that the universal worst-case efficiency bounds from [T. Roughgarden, M. Sundararajan, New trade-offs in cost-sharing mechanisms, in: Proceedings of the 38th ACM Symposium on Theory of Computing, 2006] are overly pessimistic.
Findings from a participatory evaluation of a smart home application for older adults
Authors: George Demiris, Debra Parker Oliver, Geraldine Dickey, Marjorie Skubic, Marilyn Rantz
Venue: Technology and Health Care (2008)

The aim of this paper is to present a participatory evaluation of an actual "smart home" project implemented in an independent retirement facility. Using the participatory evaluation process, residents guided the research team through development and implementation of the initial phase of a smart home project designed to assist residents to remain functionally independent and age in place. We recruited nine residents who provided permission to install the technology in their apartments. We conducted a total of 75 interviews and three observational sessions. Residents expressed overall positive perceptions of the sensor technologies and did not feel that these interfered with their daily activities. The process of adoption and acceptance of the sensors included three phases, familiarization, adjustment and curiosity, and full integration. Residents did not express privacy concerns. They provided detailed feedback and suggestions that were integrated into the redesign of the system. They also reported a sense of control resulting from their active involvement in the evaluation process. Observational sessions confirmed that the sensors were not noticeable and residents did not change their routines. The participatory evaluation approach not only empowers end-users but it also allows for the implementation of smart home systems that address residents' needs.
A competitive environment for exploratory query expansion
Authors: David Milne, David M. Nichols, Ian H. Witten
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Most information workers query digital libraries many times a day. Yet people have little opportunity to hone their skills in a controlled environment, or compare their performance with others in an objective way. Conversely, although search engine logs record how users evolve queries, they lack crucial information about the user's intent. This paper describes an environment for exploratory query expansion that pits users against each other and lets them compete, and practice, in their own time and on their own workstation. The system captures query evolution behavior on predetermined information-seeking tasks. It is publicly available, and the code is open source so that others can set up their own competitive environments.
A new time-frequency transform for non-stationary signals with any nonlinear instantaneous phase
Authors: Len Gelman, Jeremy Gould
Venue: Multidimensional Systems and Signal Processing (2008)

A new generic adaptive time-frequency transform based on the Wigner distribution is proposed for amplitude estimation of transient signals with any nonlinear non-polynomial variation of the instantaneous frequency. It is for use in situations where independent synchronous measurements of the instantaneous frequency are available. It shows that the new transform tracks the instantaneous frequency and estimates signal amplitude without errors along the curve of the instantaneous frequency. The paper also applies the new transform to signals with the non-linear sinusoidal and exponential variations in the instantaneous phase and determines formulae for transform in these cases. The paper compares the new transform with the Wigner distribution in several cases and demonstrates that the new transform is more effective at amplitude estimation of signals with nonlinear variation of the instantaneous frequency. New analytic formulae are obtained for the new transform and the Wigner distribution in both the sinusoidal and the exponential cases. An analytic formula is obtained which relates the new transform to the Wigner distribution in the sinusoidal case. This formula is inverted to obtain a previously unknown formula for the Wigner distribution of any signal. It is shown that the new transform could be used for adaptive processing of transient signals with instantaneous frequency variations. The paper studies the performance of the new transform with no adaptation, partial adaptation and complete adaptation.
Image classification using feature subset selection
Authors: Sang-Sung Park, Kwang-Kyu Seo, Ho-Seok Moon, Young-Geun Shin, Dong-Sik Jang
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

Classification technology is essential for fast retrieval in large database. This paper proposes a combining GA and SVM model to content-based image retrieval. The proposed method is also used to classification similar images from database. Joint HSV histogram and average entropy computed from gray-level co-occurrence matrices in the localized image region is employed as input vectors. Genetic algorithm is employed to select feature subsets eliminated irrelevant factors as used inputs and to determine the optimal parameters of Support Vector Machine. Experimental results show that the proposed model outperforms existing method.
Performance Evaluation Model for the Face Recognition System
Authors: YongNyuo Shin, Jason Kim, YongJun Lee, Woochang Shin, Jinyoung Choi
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Due to usability features, practical applications, and its lack of intrusiveness, face recognition technology, based on information derived from individuals' facial features has been attracting considerable attention recently. Reported recognition rates of commercialized face recognition systems cannot be admitted as official recognition rates, as they are based on assumptions that are beneficial to the specific system and face database. Therefore, performance evaluation methods and tools are necessary to objectively measure the accuracy and performance of any face recognition system. In this paper, we propose a performance evaluation model for biometric recognition evaluation tools, implementing an evaluation tool for face recognition systems based on the proposed model. Furthermore, we performed evaluations objectively, by providing guidelines for the design and implementation of a performance evaluation system, formalizing the performance test process.
Verification, validation, qualification and certification of enterprise models: Statements and opportunities
Authors: V. Chapurlat, C. Braesch
Venue: Computers in Industry (2008)

The first aim of this article is to demonstrate the high level of dependency between modeling activities and verification, validation, qualification and certification (VVQC) activities during the entire course of a project in an enterprise. It therefore aims to show the interest and relevance of VVQC to the enterprise-modeling domain, before highlighting the objectives to be achieved and requirements to be fulfilled by future work on VVQC. The first part introduces the concepts and definitions required. The second part describes the state of the art concerning the uses, best practices and main current research related to VVQC in the enterprise field. The third part proposes some orientations for future research to be prioritized in order to deal with crucial challenges in the enterprise. It appears that these research orientations have been applied for some years by both academic- and industry-based researchers.
Globally Optimal Surface Mapping for Surfaces with Arbitrary Topology
Authors: Xin Li, Yunfan Bao, Xiaohu Guo, Miao Jin, Xianfeng Gu, Hong Qin
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

Computing smooth and optimal one-to-one maps between surfaces of same topology is a fundamental problem in computer graphics and such a method provides us a ubiquitous tool for geometric modeling and data visualization. Its vast variety of applications includes shape registration/matching, shape blending, material/data transfer, data fusion, information reuse, etc. The mapping quality is typically measured in terms of angular distortions among different shapes. This paper proposes and develops a novel quasi-conformal surface mapping framework to globally minimize the stretching energy inevitably introduced between two different shapes. The existing state-of-the-art inter-surface mapping techniques only afford local optimization either on surface patches via boundary cutting or on the simplified base domain, lacking rigorous mathematical foundation and analysis. We design and articulate an automatic variational algorithm that can reach the global distortion minimum for surface mapping between shapes of arbitrary topology, and our algorithm is sorely founded upon the intrinsic geometry structure of surfaces. To our best knowledge, this is the first attempt towards numerically computing globally optimal maps. Consequently, our mapping framework offers a powerful computational tool for graphics and visualization tasks such as data and texture transfer, shape morphing, and shape matching.
A group-based multi-channel MAC protocol for wireless ad hoc networks
Authors: Yung-Da Cheng, Jang-Ping Sheu
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

When we exploit multiple channels in MAC protocol, we can achieve a higher network throughput than using one single channel due to that multiple transmissions can take place simultaneously. In this paper, we proposed a novel group-based multichannel MAC protocol which cannot only utilize multiple channels to transmit data packets but allow using multiple channels to propagate control packets. The protocol we presented is simple and suitable for wireless ad hoc networks with multiple available channels. The simulation results show that our protocol has the superior performances in network throughput to previous work.
DFT-based decision directed channel estimation algorithm for OFDM systems
Authors: Jun-Hee Jang, Se-Bin Im, Hyung-Jin Choi, Hee-Jin Roh
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

An enhanced discrete Fourier transform (DFT)-based channel estimation for OFDM system is proposed. Conventional DFT-based channel estimations improve the performance by suppressing time domain noise. However, the disadvantage is that the effect of noise reduction is dependent upon the number of pilot signals. In order to overcome the disadvantage, the proposed algorithm improves performance by using the decision directed method for data subcarriers, and it is confirmed by computer simulation. Simulation results demonstrate that the proposed algorithm outperforms the conventional DFT-based estimation in terms of BER and MSE performance.