ppxscal/embedding_network huggingface dataset:
Abstraction in Cryptography
Authors: Ueli Maurer
Venue: Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology (2009)

Abstraction means to eliminate irrelevant details from consideration, thereby focusing only on the relevant aspects of a problem or context. Abstraction is of paramount importance in most scientific fields, especially in computer science and mathematics. The purpose of abstraction is to provide, at the same time, simpler definitions, higher generality of results, simpler proofs, improved elegance, and often better didactic suitability.Abstraction can be a gradual process and need not be unique, but in many contexts, the highest achievable level of abstraction, once identified, appears natural and stable. For example, the abstract and natural concepts of a group or a field in algebra capture exactly what is required to prove many important results.In the spirit of algebraic abstraction, we advocate the definition and use of higher levels of abstraction in cryptography, with the goal of identifying the highest possible level at which a definition or theorem should be stated and proved. Some questions one can ask are: What are abstractions of a system, a game, indistinguishability, a hybrid argument, a reduction, indifferentiability, or of (universal) composability? What are abstractions of efficient and negligible, and at which level of abstraction can computational and information-theoretic models be unified? And, of course: Can the abstract viewpoint lead to new concepts and results that are perhaps otherwise missed?
The I of BCIs: Next Generation Interfaces for Brain---Computer Interface Systems That Adapt to Individual Users
Authors: Brendan Allison
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

Brain-computer interfaces (BCIs) have advanced rapidly in the last several years, and can now provide many useful command and control features to a wide variety of users---if an expert is available to find, assemble, setup, configure, and maintain the BCI. Developing BCI systems that are practical for nonexperts remains a major challenge, and is the principal focus of the EU BRAIN project and other work. This paper describes five challenges in BCI interface development, and how they might be addressed with a hypothetical easy BCI system called EZBCI. EZBCI requires a new interface that is natural, intuitive, and easy to configure without expert help. Finally, two true scenarios with severely disabled users highlight the impact that EZBCI would have on users' lives.
Evaluation of a system for noun concepts acquisition from utterances about images (SINCA) using daily conversation data
Authors: Yuzu Uchida, Kenji Araki
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers (2009)

For a robot working in an open environment, a task-oriented language capability will not be sufficient. In order to adapt to the environment, such a robot will have to learn language dynamically. We developed a System for Noun Concepts Acquisition from utterances about Images, SINCA in short. It is a language acquisition system without knowledge of grammar and vocabulary, which learns noun concepts from user utterances. We recorded a video of a child's daily life to collect dialogue data that was spoken to and around him. The child is a member of a family consisting of the parents and his sister. We evaluated the performance of SINCA using the collected data. In this paper, we describe the algorithms of SINCA and an evaluation experiment. We work on Japanese language acquisition, however our method can easily be adapted to other languages.
A Note on the Recognition of Nested Graphs
Authors: Mark Korenblit, Vadim E. Levit
Venue: Graph Theory, Computational Intelligence and Thought: Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday (2009)

We consider a two-terminal directed acyclic graph (st-dag) characterized by a special structure of its mincuts and call it a nested graph. This graph is of interest as an st-dag with a minimum possible number of mincuts.We present a linear-time algorithm for recognizing nested graphs.
O(m logn) Split Decomposition of Strongly Connected Graphs
Authors: Benson L. Joeris, Scott Lundberg, Ross M. Mcconnell
Venue: Graph Theory, Computational Intelligence and Thought: Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday (2009)

In the early 1980's, Cunningham described a unique decomposition of a strongly-connected graph. A linear time bound for finding it in the special case of an undirected graph has been given previously, but up until now, the best bound known for the general case has been O(n 3). We give an O(m logn) bound.
CMOS Nanostructures with Improved Temperature Behavior Using Double Differential Structures
Authors: Cosmin Radu Popa
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

An original superior-order curvature-corrected integrated nanostructure will be presented. In order to improve the temperature behavior of the circuit, a double differential structure will be used, implementing linear and superior-order curvature corrections. The superior-order curvature-correction is achieved by taking the difference between two gate-source voltages of subthreshold-operated MOS transistors, biased at drain currents having different temperature dependencies: PTAT (Proportional To Absolute Temperature) and PTAT2. The SPICE simulations confirm the theoretical estimated results, showing a temperature coefficient under 11ppm/K for an extended input range 223K
A Mutual Information Approach to Data Integration for Alzheimer's Disease Patients
Authors: Italo Zoppis, Erica Gianazza, Clizia Chinello, Veronica Mainini, Carmen Galbusera, Carlo Ferrarese, Gloria Galimberti, Alessandro Sorbi, Barbara Borroni, Fulvio Magni, Giancarlo Mauri
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

Clinical data alignment plays a critical role in identifying important features for significant experiments. A central problem is data fusion i.e., how to correctly integrate data provided by different labs. This integration is done in order to increase ability of inferring target classes of controls and patients. Our paper proposes an approach based both on a information theoretic perspective, generally used in a feature construction problem [3] and on the approximated solution for a mathematical programming task (i.e. the weighted bipartite matching problem [6]). Numerical evaluations with two competitive approaches show the improved performance of the proposed method. For this evaluation we used data sets from plasma / ethylenediaminetetraacetic acid (EDTA) of controls and Alzheimer patients collected in three different hospitals.
A Practical Approach to a Reliable Electronic Election
Authors: Kwangwoo Lee, Yunho Lee, Seungjoo Kim, Dongho Won
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

A receipt used for electronic voting is a key component of voting techniques designed to provide voter verifiability. In this paper, we propose electronic voting scheme involving issuing a receipt based on the cut-and-choose mechanism. Compared with Chaum et al.'s scheme[3], this scheme does not require large amounts of physical ballots and trust assumptions on tellers. Furthermore, it is as efficient and user-friendly as any of the existing electronic voting schemes issuing receipts described in the relevant literature. They only require simple comparisons between the screen and the receipt during voter's voting process. This scheme is provably secure under the fact that the ElGamal encryption cryptosystem is semantically secure. We implemented the proposed scheme in according to the defined implementation requirement and provide the security analysis of the scheme.
Automatic treebank-based acquisition of Arabic LFG dependency structures
Authors: Lamia Tounsi, Mohammed Attia, Josef van Genabith
Venue: Proceedings of the EACL 2009 Workshop on Computational Approaches to Semitic Languages (2009)

A number of papers have reported on methods for the automatic acquisition of large-scale, probabilistic LFG-based grammatical resources from treebanks for English (Cahill and al., 2002), (Cahill and al., 2004), German (Cahill and al., 2003), Chinese (Burke, 2004), (Guo and al., 2007), Spanish (O'Donovan, 2004), (Chrupala and van Genabith, 2006) and French (Schluter and van Genabith, 2008). Here, we extend the LFG grammar acquisition approach to Arabic and the Penn Arabic Treebank (ATB) (Maamouri and Bies, 2004), adapting and extending the methodology of (Cahill and al., 2004) originally developed for English. Arabic is challenging because of its morphological richness and syntactic complexity. Currently 98% of ATB trees (without FRAG and X) produce a covering and connected f-structure. We conduct a qualitative evaluation of our annotation against a gold standard and achieve an f-score of 95%.
A Two Stage Feature Selection Method for Gear Fault Diagnosis Using ReliefF and GA-Wrapper
Authors: Bing Li, Peilin Zhang, Guoquan Ren, Zhi Xing
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

This paper presents a novel two stage feature selection method for gear fault diagnosis based on ReliefF and genetic algorithm. Prior to the feature selection, 114 parameters were extracted as the original feature set based on EMD, AR model, statistical methods and entropy. Then the ReliefF was employed to evaluate the quality of every individual feature and a sequential feature sets were obtained according to the marks evaluated by ReliefF. Then the cross validation technique was used to get the candidate feature set from the sequential sets. At the second stage, the genetic algorithm was utilized to search a more compact feature set based on the candidate set.Three different classifiers means the LDC (linear discriminant classifier), KNNC (k nearest neighbors classifier) and NBC (naïve bayes classifier) were employed to evaluate the proposed method. The application results to the real gear fault diagnosis have shown that the proposed method can obtain a higher performance with a small size feature set.
Researches on Optimal Scheduling Model for Aircraft Landing Problem
Authors: Chen Shuang, Xia Xuezhi
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

In order to solve the aircraft landing optimal scheduling problem, a scheduling model based on single machine scheduling is proposed. Considering the influence on scheduling, multifactor decision-making is used to solve weight of the scheduling model. In order to work out the model, a scheduling algorithm based on greedy heuristic algorithm is proposed. Lastly, the algorithm is tested on some simulation cases. The results show that the algorithm has preferable scheduling performance and can solve the aircraft landing problem.
The Non-equidistant Optimum GM(1,1) with Modified nth Component be Taken as Initial Value and Its Application to Metal Cutting
Authors: Youxin Luo, Xiaoyi Che
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Based on the exponential trait of grey model and the definition of integral, the reconstruction method of GM(1,1) model’s background value of non-equal distance sequence was put forward and a kind of non-equidistant optimum grey model GM(1,1) with optimizing modified the nth components taken as initial value to test data process was proposed, the method of precision inspection was introduced. The example was given. The method can be used for model establishing on equal interval, as well as on non-interval. Moreover, GM(1,1) model’s fitting precision and prediction is advanced and the scope of application is enlarged. The model is simple and practical, and has a generalizing value in metal cutting data process.
Photocatalytic Degradation of Diphenolic Acid in the Presence of Beta-Cyclodextrin under UV Light
Authors: Li Guo, Beibei Wang, Wenyu Huang, Feng Wu, Jin Huang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

This paper investigated the photocatalysis degradation of diphenolic acid (DPA) in the presence of beta-cyclodextrin (β-CD) under a 30W UV lamp ( λmax=254nm ). In control experiment, the photodegradation rate of DPA is enhanced 33.5% after 30min irradiation. The interaction of DPA with β-CD yielded the formation of inclusion complexes at 1:1 stoichiometric ratio in solution, and β-CD can form steady host/guest inclusion complex with DPA. The photodegradation of 10–100μmol/L DPA irradiated UV lamp in aqueous solution was found to follow the pseudo-first-order law. Obviously, the photocatalytic degradation reaction rate constant of DPA in the system containing β-CD is higher than that without β-CD, and the first-order rate constant increased by 9.18-fold in the presence of β-CD. With the addition of β-cyclodextrin, the enhancement of photodegradation of DPA mainly results from moderate inclusion depth of DPA molecule in the β-CD cavity. This kind of inclusion structure allows DPA molecule sufficient proximity to secondary hydroxyl groups of the β-CD cavity, and these hydroxyl groups could be activated and converted to hydroxyl radicals under UV irradiation, which can enhance the photooxidation of DPA. This could be a promising method for Endocrine disrupting compounds in water remediation.
Stability and Efficiency of Social Networks with Strategic, Resource Constrained Nodes
Authors: Ramasuri Narayanam, Y. Narahari
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Recently, the topic of social network formation has received significant attention since the structure of thenetworks has a profound impact on the economic outcomes inmany real world applications such as large exchange markets, sponsored search auctions, and viral marketing. Stability and efficiency are two important properties which are sought in such networks. These two properties are both desirable but not always compatible. This paper investigates the tradeoff between stability and efficiency in a noncooperative game model of social network formation. In our model, we consider network formation in which each node can form at most k links due toscarcity of the resources. We formulate the network formation process as a strategic form game.We view the notion of stability as obtaining a Nash equilibrium outcome and efficiency as maximizing the value of the network. In this setting, we show that all efficient networks are stable in both the cases: (i) k = 1 and (ii) k = 2.
The Expressive Power of Binary Submodular Functions
Authors: Stanislav Živný, David A. Cohen, Peter G. Jeavons
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

We investigate whether all Boolean submodular functions can be decomposed into a sum of binary submodular functions over a possibly larger set of variables. This question has been considered within several different contexts in computer science, including computer vision, artificial intelligence, and pseudo-Boolean optimisation. Using a connection between the expressive power of valued constraints and certain algebraic properties of functions, we answer this question negatively.Our results have several corollaries. First, we characterise precisely which submodular polynomials of arity 4 can be expressed by binary submodular polynomials. Next, we identify a novel class of submodular functions of arbitrary arities which can be expressed by binary submodular functions, and therefore minimised efficiently using a so-called expressibility reduction to the Min-Cut problem. More importantly, our results imply limitations on this kind of reduction and establish for the first time that it cannot be used in general to minimise arbitrary submodular functions. Finally, we refute a conjecture of Promislow and Young on the structure of the extreme rays of the cone of Boolean submodular functions.
A Wide Antimicrobial Peptides Search Method Using Fuzzy Modeling
Authors: Fabiano C. Fernandes, William F. Porto, Octavio L. Franco
Venue: Proceedings of the 4th Brazilian Symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology (2009)

The search for novel antimicrobial peptides in free databases is a key element to design new antibiotics. Their amino acid physicochemical features impact into the antimicrobial peptides activities. The relationship between the amino acid physicochemical properties and the antimicrobial target might have a fuzzy behavior. This study proposes a sequence similarity and physicochemical search method followed by a fuzzy inference system to find the most appropriated antimicrobial peptides for each domain. The proposed system was tested with NCBI's NR protein data file and the obtained peptide sub dataset will be tested in vitro.
Retinex Combined with Total Variation for Image Illumination Normalization
Authors: Luigi Cinque, Gabriele Morrone
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

This paper presents a method for the normalization of human facial images in arbitrary illumination conditions. The enhanced image is suitable to be used as an input to a face recognition system.
An Image Encryption Algorithm Based on N-Dimension Affine Transformation
Authors: Fangchao Wang, Sen Bai, Guibin Zhu, Zhenghui Song
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

This paper proposes the n-dimension affine transformation based image encryption scheme, which changes the values of the pixels of an image. The property of the n-dimension affine transformation was analyzed in detail and the security of the proposed algorithm was described. The experimental results demonstrate that the suggested image encryption algorithm has the advantages of large key space and sensitivity to the secret keys. It also has the abilities of resisting brute-force attacks and statistical attacks.
Revisiting the impact of different annotation schemes on PCFG parsing: a grammatical dependency evaluation
Authors: Adriane Boyd, Detmar Meurers
Venue: Proceedings of the Workshop on Parsing German (2008)

Recent parsing research has started addressing the questions a) how parsers trained on different syntactic resources differ in their performance and b) how to conduct a meaningful evaluation of the parsing results across such a range of syntactic representations. Two German treebanks, Negra and T&uuml;Ba-D/Z, constitute an interesting testing ground for such research given that the two treebanks make very different representational choices for this language, which also is of general interest given that German is situated between the extremes of fixed and free word order. We show that previous work comparing PCFG parsing with these two treebanks employed PARSEVAL and grammatical function comparisons which were skewed by differences between the two corpus annotation schemes. Focusing on the grammatical dependency triples as an essential dimension of comparison, we show that the two very distinct corpora result in comparable parsing performance.
The Prediction Tracking Method of Weak Aerial Target Based on GM (1,1) Model
Authors: Zhonghai Li, Li Wang, Jianguo Cui, Desheng Song, Changjun Xu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

The tracking of the weak aerial target (WAT) is very important for the air action. The missing of WAT is often occurrence due to the barrier in the sky. A new method for WAT based on the Grey Model is proposed to improve the tracking ability, when there is some temporary barrier in front of the target in the sky. The GM theory is used to forecast the position of the instantaneous missing target by establishing the GM. The model not only provides prediction for the motion rule of the target centroid on line, but also improves the tracking precision. The calculations by practice examples indicate that the position of the WAT is forecasted accurately and quickly by the updated GM(1,1) model according to the estimation of flying law. The method we proposed has an better performance for the tracking of WAT with cloudy environment.
Attention to Effects of Different Cross-Cultural Levels in User Research Method's Interface: Discipline or Nationality --- Which Has Stronger Force?
Authors: Trang Thu Tran, Kun-Pyo Lee
Venue: Proceedings of the 3rd International Conference on Internationalization, Design and Global Development: Held as Part of HCI International 2009 (2009)

In the recent years, design research have developed a long way in investigating about the users and their contexts. It was aimed to challenge the way `cross-culture influence' has been considered in design research field: should there be better way than profiling users solely based on nationality in multinational research project for product specification. Major findings through this research included (1) Nationality factor influenced remarkably on user performance but not much on user attitude. In contrast, discipline factor influenced significantly on every elements of user participation. (2) The gaps of user attitude and performance with nationality as the function maintained same levels while the effects from discipline factor intensified upon the increase of task complexity and change of ask characteristic. Overall, Discipline factor dominated Nationality factor, insisting on the importance of considering different levels of participants' cultures in designing the interface of user experience research methods.
A Proportional Load Balancing for Wireless Sensor Networks
Authors: Ismail Tellioglu, Haci A. Mantar
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

This paper presents a new load balancing method for wireless sensor networks. In most routing schemes a sender forwards its packets destined for the same sink through the same neighbor. Thus, the nodes located in the intersection of multiple paths carry a large amount of workload and exhaust their energy rapidly. To overcome this problem, we propose a proportional load balancing method (PLB). In PLB, a sender chooses multiple paths for a destination (sink) and forwards its packets over these paths. By spreading the load over multiple paths, PLB prolong overall network life time, increases network efficiency and prevent fluctuation problem in load balancing. The experimental results verify the achievements of PLB compared to the previous studies.
A Model for Measurement and Analysis of the Workflow Processes
Authors: Pavel Ocenasek, Miroslav Sveda
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

This paper presents an approach based on 3-layered model that may be useful for analysis and measurement of workflow processes. The workflow system can evaluate a state of the products or services in each point of processing and is divided into three layers (sources, workflow management system and workflow processes), whereas each layer covers the processing of its specific tasks.