ppxscal/embedding_network huggingface dataset:
Assessing Robustness of Reputation Systems Regarding Interdependent Manipulations
Authors: Ivo Reitzenstein, Ralf Peters
Venue: Proceedings of the 10th International Conference on E-Commerce and Web Technologies (2009)

Reputation systems are subject to several types of manipulations, often in context of fraud. The current literature offers mainly partial solutions for specific manipulations. However, in practice a reputation system should be robust against all relevant threats. This paper explores the combination of several partial solutions in an evolutionary simulation model. The analysis shows that some partial solutions interfere with each other. In particular, it turns out that there is a crucial tradeoff between sanctioning and rehabilitation of bad behaviour that can be solved by a minimal transaction fee.
Random Numbers for Quantum Key Distribution
Authors: Hugo Zbinden
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

Quantum Key Distribution (QKD) has seen an important development for the last ten years. Nowadays, different companies offer commercial solutions and key exchanges at pulse rates of up to 1 GHz and over distances of up to 00km have been demonstrated in research labs. However, the generation of random bit strings has often been neglected and it remains a technical problem, as physical random number generators have still insufficient bit rates for high speed QKD. In this talk, after an introduction in QKD, a state of the art prototype developed at the University of Geneva will be presented. This prototype allows generating keys at high rates over up to 200km of optical fiber. However, due to the lack of high rate physical random generators, random bits at a rate of 350 MHz are produced by a pseudo random number generator seeded by random bits originating from a quantum random number generator (4MHz, id Quantique). It will be shown how an eavesdropper could attack a QKD system based on pseudo random numbers. Finally, differentpossibilities to increase the rates of quantum random number generators will be discussed 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
BCD: To Achieve the Theoretical Optimum of Spatial Locality Based Cache Replacement Algorithm
Authors: Zhu Xudong, Ke Jian, Xu Lu
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

To achieve theoretical optimum of spatial locality based replacement algorithms, this paper proposes a Block Correlations Directed cache replacement policy (BCD) which uses both of history and runtime access information to predict spatial locality, designs a replacement policy to use prediction results to improve the utilization of the cache and reduces the penalty incurred by incorrect predications. For most of real system workloads, BCD can reduce the cache miss ratio by 11%~38% compared with LRU and the miss ratio is only high than the theoretical optimum by 0%-7.9%.
Relevance-Driven Evaluation of Modular Nonmonotonic Logic Programs
Authors: Minh Dao-Tran, Thomas Eiter, Michael Fink, Thomas Krennwallner
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

Modular nonmonotonic logic programs (MLPs) under the answer-set semantics have been recently introduced as an ASP formalism in which modules can receive context-dependent input from other modules, while allowing (mutually) recursive module calls. This can be used for more succinct and natural problem representation at the price of an exponential increase of evaluation time. In this paper, we aim at an efficient top-down evaluation of MLPs, considering only calls to relevant module instances. To this end, we generalize the well-known Splitting Theorem to the MLP setting and present notions of call stratification, for which we determine sufficient conditions. Call-stratified MLPs allow to split module instantiations into two parts, one for computing input of module calls, and one for evaluating the calls themselves with subsequent computations. Based on these results, we develop a top-down evaluation procedure that expands only relevant module instantiations. Finally, we discuss syntactic conditions for its exploitation.
Parallel Prefix Ling Structures for Modulo 2^n-1 Addition
Authors: Jun Chen, James E. Stine
Venue: Proceedings of the 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors (2009)

Parallel-prefix adders draw significant amounts of attention within general-purpose and application-specific architectures because of their logarithmic delay and efficient implementation in VLSI. This paper proposes a scheme to enhance parallel-prefix adders for modulo $2^n - 1$ addition by incorporating Ling equations into parallel-prefix structures. As opposed to previous research, this work clarifies the use of Ling equations for Modulo and provides enhancements to its implementation. Results are given in this work for a placed and routed design within a variation-aware 45nm technology.The implementation results show a significant improvement in delay and even a reduction in power dissipation.
Maltilex: a computational lexicon for Maltese
Authors: M. Rosner, J. Caruana, R. Fabri
Venue: Proceedings of the Workshop on Computational Approaches to Semitic Languages (1998)

The project described in this paper, which is still in the preliminary phase, concerns the design and implementation of a computational lexicon for Maltese, a language very much in current use but so far lacking most of the infrastructure required for NLP. One of the main characteristics of Maltese, a source of many difficulties, is that it is an amalgam of different language types (chiefly Semitic and Romance), as illustrated in the first part of the paper. The latter part of the paper describes our general approach to the problem of constructing the lexicon.
SaViT: Technique for Visualization of Digital Home Safety
Authors: Pushpa Kumar, Nary Subramanian, Kang Zhang
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Digital homes are expected to be the standard in the near future when all aspects of the home can be monitored and controlled remotely by the home owner.For example, if the home owner is unsure whether she closed the garage door before leaving for work, she can view the status of the garage door on her portable computing device such as laptop, PDA or cell phone, and if the garage door is indeed open, she can close it remotely from the same device.A chief requirement for this eventuality is proper visualization of the status as well as ability to control remotely.Among the more important aspects to be visualized for the digital home is “home safety” which lets the home owner know the current safety level of her home and reasons therefor.Current trends in home safety visualization provide separate interfaces for each device at home: home alarm system has its own web interface different from that provided by a home security camera.Visualizing home safety based on the data from different devices is not only labor and time consuming, but the decision regarding safety also needs to be made by the home owner.Moreover, current systems are bandwidth intensive and require expertise on the part of the home owner for proper usage.We have developed a novel home safety visualization technique called SaViT (Safety Visualization Technique) that not only provides an integrated safety view of the home but also automates safety computation and is extremely easy to use.
A brochette of socially interactive robots
Authors: F. Michaud, D. Létourneau, P. Lepage, Y. Morin, F. Gagnon, P. Giguère, É Beaudry, Y. Brosseau, C. Côté, A. Duquette, J.-F. Laplante, M.-A. Legault, P. Moisan, A. Ponchon, C. Raïevsky, M.-A. Roux, T. Salter, J.-M. Valin, S. Caron, P. Masson, F. Kabanza, M. Lauria
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 4 (2005)

The design of interactive mobile robots is a multidisciplinary endeavor that profits from putting robots with people and studying their effects and impacts. To do so, two main issues must be addressed: giving robots capabilities in order to interact in meaningful and efficient ways with people, and the ability to move in human settings. This paper briefly describes four robotic platforms that are going to be demonstrated at the AAAI 2005 Robot Competition.
Mind Monitoring via Mobile Brain-Body Imaging
Authors: Scott Makeig
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

Current brain-computer interface (BCI) research attempts to estimate intended operator body or cursor movements from his/her electroencephalographic (EEG) activity alone. More general methods of monitoring operator cognitive state, intentions, motivations, and reactions to events might be based on continuous monitoring of the operator's (EEG) as well as his of her body and eye movements and, to the extent possible, her or his multisensory input. Joint modeling of this data should attempt to identify individualized modes of brain/body activity and/or reactivity that appear in the operator's brain and/or behavior in distinct cognitive contexts, if successful producing, in effect, a new mobile brain/body imaging (MoBI) modality. Robust MoBI could allow development of new brain/body-system interface (BBI) designs performing multidimensional monitoring of an operator's changing cognitive state including their movement intentions and motivations and (`top-down') apprehension of sensory events.
Autonomicity in Universal Database DB2
Authors: Abdul Mateen, Basit Raza, Tauqeer Hussain, M. M. Awais
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Functionality, complexity, heterogeneity and dynamism in computing environment are increasing day by day. This enhanced utility of computers has a profound impact on the system’s brittleness, manageability and security.Self-management is important in systems, networks, communication as well as in Database Management Systems (DBMSs). Autonomic computing reduces the problems and increases accuracy and efficiency of the DBMSs. Recent years have seen an upsurge in research related to incorporation of autonomic computing within the computing systems. IBM is working on autonomic computing in systems and DBMSs from last many years. The paper [1] discussed the autonomic features and tools in DB2 from the literature available up to 2002. Our paper presents an extension of that paper which covers available autonomic features, components, utilities and tools up till now. A comparison of DB2 with Oracle is presented w.r.t autonomic computing. We have also identified the optional and essential human intervention (HI) in autonomic components, utilities and tools of IBM Universal Database DB2 that reveals the degree of autonomic computing in these.
An Application of Multicriteria Weighted Graph Similarity Method to Social Networks Analyzing
Authors: Zbigniew Tarapata, Rafal Kasprzyk
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

In the paper a concept of multicriteria weighted graphs similarity (MWGSP) method and its application to examine some properties of social networks is considered. The approach extends known approaches based on the graph similarity with two features: (1) the similarity is calculated as structural and non-structural (quantitative) in weighted graph, (2) choice of the most similar graph (subgraph) to graph (subgraph) representing examined objects is based on multicriteria decision. We test our similarity measures on email network for which the expected results are known, and on the terrorist net that prepared and executed September 11, 2001 attacks.
Augmented Cognition Design Approaches for Treating Mild Traumatic Brain Injuries
Authors: Kay Stanney, Kelly Hale, David Jones
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

Augmented cognition could serve as an innovative rehabilitation approach for mild traumatic brain injuries, where issues with cognition, behavior, and affective responses are monitored in real-time and mitigation strategies are triggered to resolve performance or behavior issues. Such mitigations could guide individuals in addressing the current situation (e.g., performance decrement, undesired behavior, negative affective response), as well as provide rehabilitation support to improve performance and behavior in subsequent situations. This paper focuses on mitigation strategies that are suitable for an augmented cognition rehabilitation setting, with the goal of supporting recovery from suboptimal performance and providing rehabilitation tools in real-time, operational context.
Sketch-It-Up! Demo
Authors: Bulut Karakaya, Camilo Garcia, Daniel Rodriguez, Manoj Nityanandam, Nadia Labeikovsky, Theyab Al Tamimi
Venue: Proceedings of the 8th International Conference on Entertainment Computing (2009)

Every creative project needs to have an ideation process. A good ideation process relies on a simple yet effective way of putting ideas on the table and sorting through them, also discarding them easily if necessary. However, for this ideation to be successful it has to be a process in which cheap and simple ways of exploring ideas are used along with tools that are readily accessible to everyone in the field to use.
Semi-Supervised Multi-Task Regression
Authors: Yu Zhang, Dit-Yan Yeung
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II (2009)

Labeled data are needed for many machine learning applications but the amount available in some applications is scarce. Semi-supervised learning and multi-task learning are two of the approaches that have been proposed to alleviate this problem. In this paper, we seek to integrate these two approaches for regression applications. We first propose a new supervised multi-task regression method called SMTR, which is based on Gaussian processes (GP) with the assumption that the kernel parameters for all tasks share a common prior. We then incorporate unlabeled data into SMTR by changing the kernel function of the GP prior to a data-dependent kernel function, resulting in a semi-supervised extension of SMTR, called SSMTR. Moreover, we incorporate pairwise information into SSMTR to further boost the learning performance for applications in which such information is available. Experiments conducted on two commonly used data sets for multi-task regression demonstrate the effectiveness of our methods.
Multilevel Converters Criticism and a New Method to Improve High Power Applications: Restructured Controlled Transformer
Authors: Mohammad Golkhah, Mohammad Tavakoli Bina
Venue: Proceedings of the Advances in Electrical and Electronics Engineering - IAENG Special Edition of the World Congress on Engineering and Computer Science 2008 (2008)

Connecting power electronic devices to high voltage or high current grids has oriented relevant researches to a new challenge so called high power applications. To provide appropriate conditions to this aim, some new problems have been emerged. Multilevel power converter has been a proposed solution to increase output voltage level in the recent decades. However they really have some problems which are critically evaluated in this paper. A new solution to joint a power electronic device directly to a high voltage without any harmful effect is proposed as a high power application in the paper.
Designing testsuites for grammar-based systems in applications
Authors: Valeria de Paiva, Tracy Holloway King
Venue: Proceedings of the Workshop on Grammar Engineering Across Frameworks (2008)

In complex grammar-based systems, even small changes may have an unforeseeable impact on overall system performance. Regression testing of the system and its components becomes crucial for the grammar engineers developing the system. As part of this regression testing, the testsuites themselves must be designed to accurately assess coverage and progress and to help rapidly identify problems. We describe a system of passage-query pairs divided into three types of phenomenon-based test-suites (sanity, query, basic correct). These allow for rapid development and for specific coverage assessment. In addition, real-world testsuites allow for overall performance and coverage assessment. These testsuites are used in conjunction with the more traditional representation-based regression testsuites used by grammar engineers.
Vulnerabilities Analyzing Model for Alert Correlation in Distributed Environment
Authors: Wen Long, Yang Xin, Yixian Yang
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

With the growing deployment of host and network intrusion detection systems, managing alerts from these systems becomes critically important. A promising approach is to develop a cooperation module between several IDS to achieve alerts correlation and generate more global and synthetic alerts. Some approaches (e.g. TIAA) have developed an available solution to correlate intrusion alerts using prerequisites of intrusions, which constructs attack scenarios by correlating alerts on the basis of prerequisites and consequences of attacks. The biggest defect of these approaches lies in the complexity of the relation of consequences so that the correlation graphs maybe very huge and unreadable. The phenomenon occurs mainly because these approach correlation all alerts on an equal footing, which aren’t consider the influencing factors of different alerts on the same information system. We propose a model to achieve alert correlation which supplies information about the vulnerabilities. Similar to TIAA, we use a hyper-alert type to encode our knowledge about each type of attacks. Our approach is differing with TIAA on the definition of hyper-alert type and correlation measure. In addition, our proposal has a relational database implements parts and the corresponding tables are automatically generated from data sources. IDS and vulnerability scanner fill the database with events.
Ambiguous Keyboards and Scanning: The Relevance of the Cell Selection Phase
Authors: Julio Miró-Borrás, Pablo Bernabeu-Soler, Raul Llinares, Jorge Igual
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

This paper focuses on the relevance of the cell selection phase in the overall performance of a text entry system based on scanning and with an ambiguous keyboard. Most of the layouts are designed trying only to minimize the ambiguity of the keyboard, and taking into consideration only the disambiguation process when entering text. Nevertheless, the number of scan cycles necessary for selecting the cells has great importance in the overall performance. As we show, the performance depends on the number of cells and the linguistic model used in the cell selection phase.
Trichotomy in the Complexity of Minimal Inference
Authors: Arnaud Durand, Miki Hermann, Gustav Nordh
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

We study the complexity of the propositional minimal inference problem. Its complexity has been extensively studied before because of its fundamental importance in artificial intelligence and nonmonotonic logics. We prove that the complexity of the minimal inference problem with unbounded queries has a trichotomy (between P, coNP-complete, and Pi_2^P-complete). This result finally settles with a positive answer the trichotomy conjecture of Kirousis and Kolaitis[A dichotomy in the complexity of propositional circumscription, LICS'01] in the unbounded case. We also present simple and efficiently computable criteria separating the different cases.
Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum
Authors: Seong-in Kim, Junghee Han, Youngho Lee, Eunkyung Park
Venue: Computers and Operations Research (2010)

In this paper, we deal with a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost, and inventory cost. Incorporating the constraints of setup carry-over and overlapping as well as demand splitting, we develop a mixed integer programming (MIP) formulation. In the formulation, problem size does not increase as we enhance the precision level of a time period; for example, by dividing a time period into a number of microtime periods. Accordingly, in the proposed model, we treat the time horizon as a continuum not as a collection of discrete time periods. Since the problem is theoretically intractable, we develop a simple but efficient heuristic algorithm by devising a decomposition scheme coupled with a local search procedure. Even if in theory the heuristic may not guarantee finding a feasible solution, computational results demonstrate that the proposed algorithm is a viable choice in practice for finding good quality feasible solutions within acceptable time limit.
Are Gabor phases really useless for face recognition?
Authors: Wenchao Zhang, Shiguang Shan, Laiyun Qing, Xilin Chen, Wen Gao
Venue: Pattern Analysis Applications (2009)

Gabor features have been recognized as one of the best representations for face recognition. Usually, only the magnitudes of the Gabor coefficients are thought of as being useful for face recognition, while the phases of the Gabor features are deemed to be useless and thus usually ignored by face recognition researchers. However, in this paper, our findings show that the latter should be reconsidered. By encoding Gabor phases through local binary patterns and local histograms, we have achieved very impressive recognition results, which are comparable to those of Gabor magnitudes-based methods. The results of our experiments also indicate that, by combining the phases with the magnitudes, higher accuracy can be achieved. Such observations suggest that more attention should be paid to the Gabor phases for face recognition.
Data Hemorrhages in the Health-Care Sector
Authors: M. Eric Johnson
Venue: Financial Cryptography and Data Security: 13th International Conference, FC 2009, Accra Beach, Barbados, February 23-26, 2009. Revised Selected Papers (2009)

Confidential data hemorrhaging from health-care providers pose financial risks to firms and medical risks to patients. We examine the consequences of data hemorrhages including privacy violations, medical fraud, financial identity theft, and medical identity theft. We also examine the types and sources of data hemorrhages, focusing on inadvertent disclosures. Through an analysis of leaked files, we examine data hemorrhages stemming from inadvertent disclosures on internet-based file sharing networks. We characterize the security risk for a group of health-care organizations using a direct analysis of leaked files. These files contained highly sensitive medical and personal information that could be maliciously exploited by criminals seeking to commit medical and financial identity theft. We also present evidence of the threat by examining user-issued searches. Our analysis demonstrates both the substantial threat and vulnerability for the health-care sector and the unique complexity exhibited by the US health-care system.