dblp-ref-1k.json

{"abstract": "The purpose of this study is to develop a learning tool for high school students studying the scientific aspects of information and communication net- works. More specifically, we focus on the basic principles of network proto- cols as the aim to develop our learning tool. Our tool gives students hands-on experience to help understand the basic principles of network protocols.", "authors": ["Makoto Satoh", "Ryo Muramatsu", "Mizue Kayama", "Kazunori Itoh", "Masami Hashimoto", "Makoto Otani", "Michio Shimizu", "Masahiko Sugimoto"], "n_citation": 0, "references": ["51c7e02e-f5ed-431a-8cf5-f761f266d4be", "69b625b9-ebc5-4b60-b385-8a07945f5de9"], "title": "Preliminary Design of a Network Protocol Learning Tool Based on the Comprehension of High School Students: Design by an Empirical Study Using a Simple Mind Map", "venue": "international conference on human-computer interaction", "year": 2013, "id": "00127ee2-cb05-48ce-bc49-9de556b93346"}
{"abstract": "This paper describes the design and implementation of a methodology for the visualisation and hypothetical virtual reconstruction of Roman polychrome statuary for research purposes. The methodology is intended as an attempt to move beyond visualisations which are simply believable towards a more physically accurate approach. Accurate representations of polychrome statuary have great potential utility both as a means of illustrating existing interpretations and as a means of testing and revising developing hypotheses. The goal of this methodology is to propose a pipeline which incorporates a high degree of physical accuracy whilst also being practically applicable in a conventional archaeological research setting. The methodology is designed to allow the accurate visualisation of surviving objects and colourants as well as providing reliable methods for the hypothetical reconstruction of elements which no longer survive. The process proposed here is intended to limit the need for specialist recording equipment, utilising existing data and those data which can be collected using widely available technology. It is at present being implemented as part of the 'Statues in Context' project at Herculaneum and will be demonstrated here using the case study of a small area of the head of a painted female statue discovered at Herculaneum in 2006.", "authors": ["Gareth Beale", "Graeme Earl"], "n_citation": 50, "references": ["10482dd3-4642-4193-842f-85f3b70fcf65", "3133714c-f979-4d84-9224-97361cf053ab", "3a926fef-7422-4654-8776-8e31b45be563", "52f480e8-85e6-4c01-9e5b-d75eabf6a8ec", "6f52f995-7c4c-4a92-83aa-d1c9fbd2465c", "8bd964d6-c45f-448c-9e65-efe5f98ca0a0", "8fa0a362-6522-48fc-bd5e-24de00ed6511", "9bfa8c24-8fb6-44d9-ba42-38b22f9cf34b", "b57cc9ef-64b6-479d-9918-5f283af3219d", "b678b546-e867-4a57-8963-c5545b04f32d", "e5c40bf5-7ee2-4cff-a75a-b708ab69997b", "f0dccb0c-c17a-4fcb-a89f-fe4bdfa3356d", "fdd93623-31c8-487b-8554-d6c6b25af5f6"], "title": "A methodology for the physically accurate visualisation of roman polychrome statuary", "venue": "visual analytics science and technology", "year": 2011, "id": "001c58d3-26ad-46b3-ab3a-c1e557d16821"}
{"abstract": "This article applied GARCH model instead AR or ARMA model to compare with the standard BP and SVM in forecasting of the four international including two Asian stock markets indices.These models were evaluated on five performance metrics or criteria. Our experimental results showed the superiority of SVM and GARCH models, compared to the standard BP in forecasting of the four international stock markets indices.", "authors": ["Altaf Hossain", "Faisal Zaman", "Mohammed Nasser", "M. Mufakhkharul Islam"], "n_citation": 50, "references": ["2d84c0f2-e656-4ce7-b018-90eda1c132fe", "a083a1b9-8dfb-45d6-99a9-fa30c4a6e9f5"], "title": "Comparison of GARCH, Neural Network and Support Vector Machine in Financial Time Series Prediction", "venue": "pattern recognition and machine intelligence", "year": 2009, "id": "001c8744-73c4-4b04-9364-22d31a10dbf1"}
{"authors": ["Jea-Bum Park", "Byungmok Kim", "Jian Shen", "Sun-Young Kim", "Dae-Seok Rho"], "n_citation": 0, "references": ["8c78e4b0-632b-4293-b491-85b1976675e6", "9cdc54f0-f1a0-4422-ac16-d9164d9371ee"], "title": "Development of Remote Monitoring and Control Device for 50KW PV System Based on the Wireless Network", "venue": "", "year": 2011, "id": "00338203-9eb3-40c5-9f31-cbac73a519ec"}
{"authors": ["Giovanna Guerrini", "Isabella Merlo"], "n_citation": 2, "title": "Reasonig about Set-Oriented Methods in Object Databases.", "venue": "", "year": 1998, "id": "0040b022-1472-4f70-a753-74832df65266"}
{"authors": ["Rafael \u00c1lvarez", "Leandro Tortosa", "Jos\u00e9-Francisco Vicent", "Antonio Zamora"], "n_citation": 0, "title": "COMPARING GNG3D AND QUADRIC ERROR METRICS METHODS TO SIMPLIFY 3D MESHES", "venue": "international conference on computer graphics theory and applications", "year": 2009, "id": "005ce28f-ed77-4e97-afdc-a296137186a1"}
{"authors": ["Jovan Dj. Golic", "Guglielmo Morgari"], "n_citation": 2, "title": "Vectorial fast correlation attacks.", "venue": "", "year": 2004, "id": "00638a94-23bf-4fa6-b5ce-40d799c65da7"}
{"authors": ["Guzin Ulutas", "Mustafa Ulutas", "Vasif V. Nabiyev"], "n_citation": 0, "references": ["5626736c-e434-4e2d-8405-54940fab88ab", "8e87e87b-87a8-4dd2-8365-e79fbe1b4b93", "98f543e3-d61c-4099-ae96-237816472592", "99e7103c-1f1c-4ac6-8cb1-e0af35606848"], "title": "Improved Secret Image Sharing Method By Encoding Shared Values With Authentication Bits", "venue": "international symposium on computer and information sciences", "year": 2011, "id": "00701b05-684f-45f9-b281-425abfec482c"}
{"authors": ["Pranay Chaudhuri", "Hussein Thompson"], "n_citation": 0, "title": "A Self-Stabilizing Algorithm for Finding the Cutting Center of a Tree.", "venue": "parallel and distributed processing techniques and applications", "year": 2003, "id": "00745041-3636-4d18-bbec-783c4278c40d"}
{"authors": ["Dominik Szajerman", "Adam Jurczy\u0144ski"], "n_citation": 0, "references": ["3fcd7cdc-20e6-4ea3-a41c-db126fcc5cfe", "bf3a11ca-5c4b-4b26-9b7a-0881b8d0f6c2"], "title": "Fur Visualisation for Computer Game Engines and Real-Time Rendering", "venue": "international conference on computer vision and graphics", "year": 2014, "id": "00964544-cbe2-4da9-bb5a-03333160eb34"}
{"abstract": "Recent achievements in Natural Language Processing (NLP) and Psychology invoke the challenges to identify the insight of emotions. In the present study, we have identified different psychology related theme words while analyzing emotions on the interview data of ISEAR (International Survey of Emotion Antecedents and Reactions) research group. Primarily, we have developed a Graphical User Interface (GUI) to generate visual graphs for analyzing the impact of emotions with respect to different background, behavioral and physiological variables available in the ISEAR dataset. We have discussed some of the interesting results as observed from the generated visual graphs. On the other hand, different text clusters are identified from the interview statements by selecting individual as well as different combinations of the variables. Such textual clusters are used not only for retrieving the psychological theme words but also to classify the theme words into their respective emotion classes. In order to retrieve the psychological theme words from the text clusters, we have developed a rule based baseline system considering unigram based keyword spotting technique. The system has been evaluated based on a Top-n ranking strategy (where n=10, 20 or 30 most frequent theme words). Overall, the system achieves the average F-Scores of .42, .32, .36, .42, .35, .40 and .40 in identifying theme words with respect to Joy, Anger, Disgust, Fear, Guilt, Sadness and Shame emotion classes, respectively.", "authors": ["Ankita Brahmachari", "Priya Singh", "Avdhesh Garg", "Dipankar Das"], "n_citation": 0, "references": ["84d47128-58d0-4187-aa44-389fde7d5c83", "e0dce69e-5bb6-4835-a624-066f5cd0420b", "f4b32fa0-8bc6-422b-999c-d2c32e261e1f"], "title": "Identifying Psychological Theme Words from Emotion Annotated Interviews", "venue": "", "year": 2013, "id": "00a119c4-d367-4607-b3c8-b237f2971bff"}
{"authors": ["David Al-Dabass", "Christopher Goodwin", "K. Sivayoganathan"], "n_citation": 0, "title": "Simulation of a vision steering system for road vehicles", "venue": "", "year": 1995, "id": "00ba1eb4-d1aa-4587-892b-d9dcc38c1a78"}
{"abstract": "Recently, Bridges and Reich introduced the concept of multisymplectic spectral discretizations for Hamiltonian wave equations with periodic boundary conditions [5]. In this paper, we show that the ID nonlinear Schrodinger equation and the 2D Gross-Pitaevskii equation are multi-symplectic and derive multi-symplectic spectral discretizations of these systems. The effectiveness of the discretizations is numerically tested using initial data for multi-phase solutions.", "authors": ["Alvaro L. Islas", "Constance M. Schober"], "n_citation": 50, "references": [], "title": "Multisymplectic Spectral Methods for the Gross-Pitaevskii Equation", "venue": "international conference on conceptual structures", "year": 2002, "id": "00bcf2d5-1592-46b0-81fd-933f90b5ecca"}
{"abstract": "Most applications of the abstract interpretation framework[2] have been foranalyzing functional programs use functions on abstract values to approxi-mate functions, thus assuming that functions may be called at all arguments.When the abstract domain is \ufb01nite, this approach can easily be generalizedto higher order functional languages as shown for example by [1]. In practicethis leads to combinatorial explosion problems as observed, for example, instrictness analysis of higher order functional languages.", "authors": ["Patrick Cousot", "Radhia Cousot"], "n_citation": 50, "references": ["6e8a3ec3-9a99-4fac-ac4d-f8d1bf0fa208", "7bb71afa-91b8-46e7-9008-da84e0427b93", "838d99b5-5b05-41a8-adc7-a597195fefad", "9a4984f9-27d4-47eb-8bc8-0469bf540f94", "afa6d820-c762-4285-a25d-9dd985929ec3"], "title": "Relational Abstract Interpretation of Higher Order Functional Programs (extended abstract)", "venue": "", "year": 1991, "id": "00c85316-bddf-4bcb-93f5-097adadd73c2"}
{"abstract": "Three speech training systems for hearing-impaired children were designed and constructed using a minicomputer and a microprocessor. The first system displays the lateral shape of the vocal tract for each vowel estimated from the speech sound. In this system, three storages are prepared. One of them can be used to store a reference shape which may be estimated from a teacher's voice or a prepared standard shape. A child can articulate seeing the reference shape and re-articulate comparing his own first articulation with the reference shape. The system can also compare the estimated shape with the reference one and produce instructions with animated cartoons which show where any articulatory defects exist. The second system displays successively the lateral shapes for articulation of any phoneme sequences containing consonants. The third system displays the first two formant frequencies extracted from speech as a spot on the F1-F2 plane, where the regions of vowels are shown in color. Preliminary use of these devices has shown that they complement each other to form a more effective system of speech training.", "authors": ["Minoru Shigenaga", "Yoshihiro Sekiguchi"], "n_citation": 0, "title": "Speech training systems using lateral shapes of vocal tract and F1-F2 diagram for hearing-impaired children", "venue": "international joint conference on artificial intelligence", "year": 1979, "id": "00ca027b-5174-40fa-bf63-9a97c2a5f518"}
{"authors": ["Reiko Heckel", "Tom Mens", "Michel Wermelinger"], "n_citation": 50, "title": "Software Evolution through Transformations.", "venue": "Electronic Notes in Theoretical Computer Science", "year": 2003, "id": "00dc2bba-3237-4d4e-b541-1205b97df981"}
{"abstract": "This paper focuses on knowledge engineering for the development of a system that provides affective interaction in mobile devices. The system bases its inferences about users' emotions on user input evidence from the keyboard and the microphone of the mobile device. For this purpose different experimental studies have been conducted with the participation of mobile users and human experts. The experiments' aim was twofold. They aimed at revealing the criteria that are taken into account in each mode for emotion recognition as well as their weight of importance. The results of the studies are further used for the application of a multi-criteria decision making model.", "authors": ["Efthymios Alepis", "Maria Virvou", "Katerina Kabassi"], "n_citation": 50, "references": ["522bea13-bd45-4918-9478-e87ae2f039f7", "60507d41-633f-4a9d-8265-b66b895a6af2", "6ab0f76f-a0b4-4747-aba0-4dbb43683dd3", "ce3efb6d-06c0-44ba-9b5b-1c03c5ee39d5", "e00936e8-c5b3-4833-871a-938a7b11e501"], "title": "Knowledge Engineering for Affective Bi-Modal Interaction in Mobile Devices", "venue": "joint conference on knowledge-based software engineering", "year": 2008, "id": "00dd5ece-1339-4cb6-a08e-43742ae2dac6"}
{"authors": ["Milos Zelezn\u00fd", "Petr C\u00edsar", "Zdenek Krnoul", "Jan Nov\u00e1k"], "n_citation": 7, "title": "Design of an audio-visual speech corpus for the czech audio-visual speech synthesis.", "venue": "conference of the international speech communication association", "year": 2002, "id": "00e02aeb-b424-4ca8-b3ca-6e18e322f79e"}
{"authors": ["Abdullah Alsubaie", "Antonio Di Pietro", "Jose R. Marti", "Pranab Kini", "Ting Fu Lin", "Simone Palmieri", "Alberto Tofani"], "n_citation": 6, "references": ["0293844d-7244-4562-a6ca-d84bcd9c10a5", "14cd3cf4-7086-4387-8b96-8f64359ac38e", "6f833909-d73b-41f1-ac80-93855a8a9492", "9af84bb2-1378-4ad1-bb14-0377896b057d", "bbd5674c-05fa-4ccf-9999-36b436c1ce89", "ca159adb-f25e-4246-9624-42b422ffc5a9"], "title": "A Platform for Disaster Response Planning with Interdependency Simulation Functionality", "venue": "", "year": 2013, "id": "00e3940b-201b-40ba-bd20-dbdaf26ad324"}
{"authors": ["Tien Ho-Phuoc", "Anne Gu\u00e9rin-Dugu\u00e9", "Nathalie Guyader"], "n_citation": 3, "title": "A COMPUTATIONAL SALIENCY MODEL INTEGRATING SACCADE PROGRAMMING", "venue": "international conference on bio-inspired systems and signal processing", "year": 2009, "id": "00fd4f6f-c7a1-49a2-a029-d583d1d7a8b1"}
{"abstract": "Embedded systems often have limited amounts of available memory, thus encouraging the development of compact programs. This paper presents a link-time program compactor for the embedded MIPS architecture. The application of several important data flow and control flow analyses and the related program transformations at link-time are discussed and evaluated for a collection of typical embedded applications compiled against the uClibc library targeted at the embedded market. With the presented link-time compactor, code size reductions of up to 27% are obtained, and speedups of up to 17%.", "authors": ["Matias Madou", "Bjorn De Sutter", "Bruno De Busscher", "Ludo Van Put", "Koen De Bosschere"], "n_citation": 50, "title": "Link-time compaction of MIPS programs", "venue": "european symposium on algorithms", "year": 2004, "id": "01047814-b615-4449-9a30-8ef36c3c1693"}
{"authors": ["Marco Baroni", "Francis Chantree", "Adam Kilgarriff", "Serge Sharoff"], "n_citation": 101, "title": "Cleaneval: a Competition for Cleaning Web Pages.", "venue": "language resources and evaluation", "year": 2008, "id": "01082175-d4e3-456a-9557-668b2449be05"}
{"abstract": "Xax is a browser plugin model that enables developers to leverage existing tools, libraries, and entire programs to deliver feature-rich applications on the web. Xax employs a novel combination of mechanisms that collectively provide security, OS-independence, performance, and support for legacy code. These mechanisms include memory-isolated native code execution behind a narrow syscall interface, an abstraction layer that provides a consistent binary interface across operating systems, system services via hooks to existing browser mechanisms, and lightweight modifications to existing tool chains and code bases. We demonstrate a variety of applications and libraries from existing code bases, in several languages, produced with various tool chains, running in multiple browsers on multiple operating systems. With roughly two person-weeks of effort, we ported 3.3 million lines of code to Xax, including a PDF viewer, a Python interpreter, a speech synthesizer, and an OpenGL pipeline.", "authors": ["John R. Douceur", "Jeremy Elson", "Jon Howell", "Jacob R. Lorch"], "n_citation": 50, "references": ["0abc9de7-e047-44fc-998d-4bf02b9bc9ab", "2c9ebc3d-713f-42d8-a867-0ff2d24644d3", "3c60b421-a347-4d55-b603-bc34f5c2a40d", "4176c232-fa9d-4540-a778-d2fe285cd2ae", "419b6c55-1573-4f46-b922-fe738c4cfde0", "440c32ee-b296-47b4-bd9e-c57e9743fd47", "474ceb1b-cb0f-4567-b72d-e80b2436d9e7", "485eeb4b-a2f8-4796-9b1e-ed3c793bc6b1", "569b777f-eb40-4fa8-9567-c5844c8c3522", "5aa9499d-836a-4b54-9db7-f67a6d849dfa", "5d51741f-f7df-44ca-ac2d-44071ab608c2", "7596d96c-6c5a-4fef-9471-a461ef44e747", "7d3ad5e5-f72e-4670-9e3e-4abda6124c52", "a4d42fcb-07bd-4069-bf66-4c1a07110534", "a59d52f1-2a9a-4432-807f-fe3c090a5755", "b1344aa2-8641-43ea-8f44-3e41148a4134", "b4889853-7347-4c70-9de3-b827a7ab4fa4", "b826aeb6-49f6-42a8-878b-4b45d69c9fbb", "b9c5935f-eff4-450d-98ab-c9b75dd59db8", "c2c345e8-59c0-4140-9e27-8fcd2518f1f2", "c80941b6-fa1b-488b-9f39-b7a642132a74", "df8373df-b271-4477-9c98-612aa569aac0", "dfe956b4-b304-497f-8db3-40b2b990282e", "fb33c0b8-9b3d-4245-a25a-bba6bce64b69", "fd5b4339-0328-41fc-90b7-12d5f093072c"], "title": "Leveraging legacy code to deploy desktop applications on the web", "venue": "operating systems design and implementation", "year": 2008, "id": "010d4ce9-0279-4166-ae73-14551ded6404"}
{"abstract": "In recent years, most of mobile phones have a function of pedestrian navigation guidance. It was reported that users sometimes feel anxiety because of low accuracy of the position estimation especially in urban area and delay of information updating. In order to reduce the anxiety, a route planning algorithm is proposed in this study, which weighs user's difficulty (or easiness) of locating own current position as well as total physical distance of courses. The difficulty is estimated by valuation functions based on the \"recognizability\" and \"visibility\" of landmarks. An experimental study conducted in real situation using a prototype system to examine and refine the model for the optimal route planning. As the result, a modified model is proposed as a promising method of route planning for user's easy wayfinding.", "authors": ["Hiroshi Furukawa", "Yutaka Nakamura"], "n_citation": 7, "references": ["b2f0e0d3-0071-4076-921e-f93f30160c1c", "f030524f-f3fa-472b-9c08-f87559998132"], "title": "A pedestrian navigation method for user's safe and easy wayfinding", "venue": "international conference on human computer interaction", "year": 2013, "id": "010d9907-45ef-459a-a293-8e1f41cef2b7"}
{"authors": ["Nebojsa M. Ralevic", "Lidija \u010comi\u0107"], "n_citation": 0, "references": ["17d92951-cd71-4945-b1c5-c9c558d92157", "4892fa7f-81bc-4718-baa1-8e166f6f6137", "510eec1d-f82c-4b19-b116-b8fd4c66531a"], "title": "Algorithms for the Construction of Digital Convex Fuzzy Hulls.", "venue": "", "year": 2007, "id": "010fda73-e708-489c-95b8-cccc1e9b089b"}
{"authors": ["William Perrizo", "Qiang Ding", "Masum Serazi", "Taufik Fuadi Abidin", "Baoying Wang"], "n_citation": 0, "title": "Vertical Database Design for Scalable Data Mining.", "venue": "", "year": 2005, "id": "01103168-55d8-42bd-b8f1-fece74c61fd2"}
{"abstract": "Previous language modeling approaches to information retrieval have focused primarily on single terms. The use of bigram models has been studied, but the restriction on word order and adjacency may not be justified for information retrieval. We propose a new language modeling approach to information retrieval that incorporates lexical affinities, or pairs of words that occur near each other, without a constraint on word order. The use of compound terms in the vector space model has been shown to outperform the vector model with only single terms (Nie & Dufort, 2002). We explore the use of compound terms in a language modeling approach, and compare our results with the vector space model, and unigram and bigram language model approaches.", "authors": ["Carmen Fern\u00e1ndez-Daza \u00c1lvarez", "Philippe Langlais", "Jian-Yun Nie"], "n_citation": 50, "references": ["00515e82-3da6-497a-83d3-459e93247123", "0cd820ed-2c9c-4713-91f9-a82f2ec9ada9", "34236c35-f8cc-4d1e-9b84-5f65240046fc", "65e9d883-cc87-4505-ab64-99a181371d6f", "88ce4013-25cd-45c2-ab63-bda1f3d8044c", "894abe0d-19ac-44cc-9e25-d8f4ce1ee44f", "a3a30fff-664e-4e0f-86d5-5eb9a61a6af1", "bf6f92c2-ec4a-44ae-9c42-0873d42811c9", "cc4a8a25-44f1-40ea-b67a-2daad6b54cf8", "db09268d-72cd-43f2-82cf-23c8224052c8", "ea30c29e-bb26-4e39-8a0a-085bbe14a494", "f5b13f47-134a-4b0f-9daf-81a44d94d6f2", "fbbe3725-f139-483c-80d3-bd015b133551"], "title": "Word pairs in language modeling for information retrieval", "venue": "", "year": 2004, "id": "012b88ae-a763-45d6-8f19-2ec9ff739d5f"}
{"authors": ["Norihiko Moriwaki", "Kazuo Yano", "Dai Senoo"], "n_citation": 0, "references": ["08704b8d-70a1-44b7-b7a6-ad47c0df57c1", "0d3b3887-1f81-4025-81b5-e8d80ea3bb37", "1b21d5d4-d897-45f6-8a66-4870caedab50", "631e0e61-9cc6-42b2-ac12-dc84b488f98f", "99bbadef-b293-421a-a03e-35f928122cff", "d4a99107-babb-4bf7-a6e1-2a6a95b99c45", "ddfb9bd5-0447-4c30-9a2f-2f8523853009"], "title": "Sensor-Data-Driven Knowledge Creation Model: A Model and Empirical Test", "venue": "", "year": 2014, "id": "014df191-abb2-44c0-a5c5-a943551fdd74"}
{"authors": ["Prudence W. H. Wong", "Fencol C. C. Yung", "Mihai Burcea"], "n_citation": 6, "references": ["08784bb3-09b9-4bd2-a191-2606f3b3a8b8", "16bf10ea-67a2-48e5-8d95-6ed620f63e2e", "2ead5bd3-0315-4a85-bf25-f629fcdb4818", "36f6b946-0085-401b-adf7-511254b5995c", "44e536f1-985a-4c5d-95dc-4f4787104366", "7e12f3db-9b54-4fa7-88e2-58794ef13d31", "869e6a00-3db6-41cf-9b72-871e4686d205", "90e1fe1c-222d-410f-9405-dec0f24c01b1", "911c3ef7-f941-4276-8ead-05e91ddf23b6", "aa323c35-2745-441b-a194-640f1bb258c2", "da3d18de-7d4e-4b51-9df5-ff3a48d1e33c"], "title": "An 8/3 Lower Bound for Online Dynamic Bin Packing", "venue": "international symposium on algorithms and computation", "year": 2012, "id": "01546472-0ac9-47fa-acca-ffcb7fc99097"}
{"abstract": "Spatial encryption is a generic public-key cryptosystem where vectors play the role of public keys and secret keys are associated to affine spaces. Any secret key associated to a space can decrypt all ciphertexts encrypted for vectors in that space, and the delegation relation is defined by subspace inclusion. Though several constructions of spatial encryption schemes have been proposed in the literature, none of them are known to remain secure in the leakage-resilient setting, in which the adversary may be capable of learning limited additional information about the master secret key and other secret keys in the system. In this paper, we propose the first spatial encryption scheme achieving leakage resilience in the standard model, based on existing static assumptions over bilinear groups of composite order. Our new scheme is based on the leakageresilient HIBE scheme by Lewko, Rouselakis, and Waters in TCC 2011 and can be seen as a generalization of Moriyama-Doi spatial encryption scheme to the leakage-resilient setting.", "authors": ["Michel Abdalla", "Jill-J\u00eann Vie"], "n_citation": 50, "references": ["3140c9ba-8d98-42a7-b6b8-c58fdaa8fe75", "4708b4d5-ddd8-48f7-ab7f-e14f925fbe62", "7432d716-a4ae-42f8-9dae-6599b6f3b475", "ad0777e4-aab4-41b1-928a-2844e2da585e", "b6aea9c9-30b3-4fcb-bf8f-adb19920c137", "c086c363-f6a2-475e-9ffa-23f3c5fffcf7", "f40ff3ec-979e-4f88-ab47-520879876fed", "fb9ea451-ad58-40da-be73-6e60b6607f8f"], "title": "Leakage-Resilient spatial encryption", "venue": "", "year": 2012, "id": "016a9a21-e882-4cda-a2b1-b2b46f10601e"}
{"authors": ["Olivia Mendoza", "Patricia Melin", "Oscar Castillo", "Juan R. Castro"], "n_citation": 50, "references": ["159fdfd2-921e-4258-9e28-1b2c030e840e", "1a1e2640-6ff2-4903-b5a7-00e5a1ee88ac", "2067d340-12f9-45ff-b2ee-7c7e03e8b31b", "26e9d4da-63b3-4d8b-b1e5-c44da561317a", "563ad81b-436a-49cd-8ad6-715f26cb7093", "5e8b0e8a-d687-4333-bfe9-73b4c1bebde5", "60c8fac6-b4ce-43e1-80a7-d5fef740dc98", "65106f7a-8bce-4521-ac08-a545f9fd59fa", "85a340e0-b502-44d4-b720-fc632eee4602", "92435821-32a7-4c7e-a449-fba924253ad2", "b4f9c7c7-2e12-4c0f-8f3e-e62a89d8ad89", "bd2e8f8e-9e8f-4807-a68e-da0bdbce8c0c", "bf0eb96c-851f-450f-8058-dc086f0aaf21", "c0e956de-4a59-4e41-9dca-f6c04b41b371", "d735328f-1ed7-4969-b042-a7f77f425fd9", "fe50dabf-1f31-49a9-94d0-3b3656cd17ce"], "title": "Comparison of Fuzzy Edge Detectors Based on the Image Recognition Rate as Performance Index Calculated with Neural Networks", "venue": "soft computing", "year": 2010, "id": "016eba4d-f912-4927-874b-b0679bea78d2"}
{"abstract": "In system operations the term rollback is often used to imply that arbitrary changes can be reversed i.e. \u2018rolled back\u2019 from an erroneous state to a previously known acceptable state. We show that this assumption is flawed and discuss error-correction schemes based on absolute rather than relative change.#R##N##R##N#Insight may be gained by relating change management to the theory of computation. To this end, we reformulate previously-defined \u2018convergent change operators\u2019 of Burgess into the language of groups and rings. We show that, in this form, the problem of rollback from a convergent operation becomes equivalent to that of \u2018division by zero\u2019 in computation. Hence, we discuss how recent work by Bergstra and Tucker on zero-totalized fields helps to clear up long-standing confusion about the options for \u2018rollback\u2019 in change management.", "authors": ["Mark Burgess", "Alva L. Couch"], "n_citation": 8, "references": ["363278e2-6c9d-45f5-90cd-0c4aaeb36631", "3a6f3221-72f5-45d4-9fc4-8e7f8944bf50", "4f3ff5a9-25d1-4390-a354-9bb398d6cf45", "5ae21162-79ec-4c93-a2c1-b77c3ad94362", "5afceaf5-ed1d-413e-88c4-2670b3468ad7", "695329b3-4785-4e2f-aa1e-bd9b51079f24", "6e8f862a-1706-4f2c-beb5-8784df31f8d2", "8310ea3b-7fe3-4f53-ad7e-b298b507742a", "84c8fbdb-ec78-45e1-b8ca-d273ea43786a", "a322685d-16d8-4746-ab7a-392281ca58b0", "ba78ca8a-5950-4c25-8441-992bdadbbacc", "c05c3549-ddf2-4c1f-a8c6-c7b16288cccd", "cab6b3f1-7525-424f-ae13-1fd1790c4c6a", "d67da751-078c-48ba-9871-819e4e0c5526", "e2c57efb-188e-41ca-a0ef-5d79443bc9be"], "title": "On system rollback and totalized fields: An algebraic approach to system change", "venue": "The Journal of Logic and Algebraic Programming", "year": 2011, "id": "01705f09-d395-4a0f-a89f-8d18382c81cc"}
{"authors": ["Martine Collard", "Ricardo Martinez"], "n_citation": 3, "references": ["0102f234-e30b-4b35-88a4-27e57838947a", "0361ea07-d858-4cc5-86b0-531e2de6c9d0", "15a4cc4f-91ca-465a-882c-5beb6bc736e1", "2dd9df26-ad59-40db-8ecd-7cedba93c47e", "52aa4fcb-9b77-446d-aae4-8d18c600b8a0", "601aaafd-9b76-4fee-bce8-8d2257de0f12", "6184088e-8d62-4968-b2cd-f02823d5e18a", "61eff47d-5889-4525-bcb5-7510387cf39c", "62b04eff-efd2-41d3-883d-d4383060204b", "6fb8c97c-2a05-452c-b04f-4252ac70e39a", "93107c6a-088d-47b3-b1e6-5263744d583d", "9ea124fc-abf1-4217-8c4d-21c7493abe83", "a2a06bf4-5637-4949-9780-d057ac30bfeb", "b2943581-6453-4301-8d90-48b1f3575bfc", "b508d43a-b597-4c9a-bb7e-359d01f85804", "ba0c73c2-be8a-4078-a8e0-ea6c590fef78", "c615de1a-d45d-46b0-bf34-371df6f81d14", "d7652123-2599-47cb-9542-bac164fa7ebb", "e5bfd133-3b8c-4469-980d-be26f412e278", "f455cb3b-53c7-4e11-8d4b-b58c1b5c33cb", "fbc36fbe-7284-497a-a504-c9d21063a770"], "title": "Extracted Knowledge Interpretation in mining biological data: a survey.", "venue": "research challenges in information science", "year": 2007, "id": "01733dc2-4910-40db-8a4e-eca926637b00"}
{"authors": ["Yosuke Furukawa", "Yusuke Kamoi", "Tatsuya Sato", "br", "Tomohiro Takagi"], "n_citation": 50, "title": "Context Dependent Automatic Textile Image Annotation Using Networked Knowledge", "venue": "Journal of Advanced Computational Intelligence and Intelligent Informatics", "year": 2007, "id": "019a51de-5136-41cb-81fa-ed659c915913"}
{"abstract": "Business strategy should be well understood in order to support an enterprise to achieve its vision and to define an architecture supporting that vision. While business views are identified in many Enterprise Architecture (EA) proposals, business strategy formulations from the area of Strategic Management are overlooked. Thus, IT solutions cannot be traced back to business strategy in a clear and unambiguous way. Our intended proposal, a Unified Business Strategy Meta-Model (UBSMM), aims at establishing such a link. UBSMM is a formalization of the integration of known business strategy formulations with precise semantics enabling its model-level usage to provide strategic awareness to Enterprise Architecture. In this paper we present the development process of UBSMM, and further, we propose conceptual relationships towards Enterprise Architecture (EA).", "authors": ["Constantinos Giannoulis", "Jelena Zdravkovic", "Micha\u00ebl Petit"], "n_citation": 12, "references": ["0ce446cf-4f4f-49d5-b08c-e7dcacebf53b", "2819d0c5-ecb8-47bf-a039-6ae12e308990", "62441d8d-61e5-447f-904a-3f0df62ca637", "9a7a02ff-85da-4025-92cd-be697b78a9d2", "9de6730b-9e66-46fb-8745-12878a7ad952", "db685543-19b7-46ba-a09c-5c14ac26758a", "eb284910-ca3f-44d3-8362-6d2fff451705", "f47687ef-397f-4414-96e1-97d0b5cd43b0", "feb84715-8166-4c1a-a051-435119d5b31c"], "title": "Model-Driven Strategic Awareness: From a Unified Business Strategy Meta-Model (UBSMM) to Enterprise Architecture", "venue": "", "year": 2012, "id": "01b6f2ca-3903-4196-a932-47a4be4c00bf"}
{"abstract": "FTP Mirror Tracker is a software package (written in Perl and C++) that enables transparent, user-controlled redirection to the nearest anonymous FTP mirror sites that are exact replicas of the original source. This redirection can be achieved by using a Web Cache server or by making HTTP requests to the FTP Mirror Tracker directly. The Mirror Tracker also has internal URN support and can be used as a URN resolver for FTP requests. Underlying the system is a MySQL database recording FTP mirror site details. In this report we explain how this database is constructed, and show how it may be used - directly by end users, and under the policy based control of Web Cache and mirror service administrators.", "authors": ["Alexei Novikov", "Martin Hamilton"], "n_citation": 0, "references": [], "title": "FTP Mirror Tracker: A Few Steps Towards URN", "venue": "usenix large installation systems administration conference", "year": 2000, "id": "01ccb92f-46f1-400e-be19-f6d755115693"}
{"abstract": "There are a number of alternative techniques for dealing with uncertainty. Here we discuss rough set, fuzzy rough set, and intuitionistic rough set approaches andhowtoincorporateuncertaintymanagementusingthemintherelationaldatabase model. The impacts of rough set techniques on fundamental database concepts such as functional dependencies and information theory are also considered.", "authors": ["Theresa Beaubouef", "Frederick E. Petry"], "n_citation": 0, "references": ["09b666de-6279-486c-beb2-f56881de7a0f", "1aeb1263-29f6-4705-9f5e-848cd63cc32c", "2adfb010-af13-4f71-935e-2abe11f7a876", "43176bdf-6bce-40dc-8cb1-bc55467ce0dd", "5d0d245e-a76b-49cf-907b-56eafc98cf25", "799c6f85-729f-43bf-a704-daca592c5ec1", "7b7b8ac1-d61f-4b87-b745-73352713e600", "85738c92-0ea0-46f3-af5e-89ee93a5c084", "86d86a0c-fab3-423d-b9e1-16057c039c54", "8ed7c007-dcdc-4d28-9e8b-8d9bc08e17b4", "91780b5c-8756-443c-81b4-4952f24697b3", "9630838e-eeae-4997-b71d-988d85a78458", "a4589cfe-15e7-4c34-9349-d002d1d2c9df", "aa0cd751-33a0-4cab-aeaa-13bbb460f46b", "b30ac9e1-8884-48cb-95b8-21b1d600ac7d", "b3df01ec-8e5f-4a29-81d7-496abc3c1174", "b49c1e2b-0cd0-4950-a724-00c698e5b49d", "b4ddda4c-b212-4c88-83e6-4546ed32d630", "d4018737-0a3c-4600-b4c1-f0d08d31e60e", "e156b52f-9890-4e9e-9302-a441b1b69272", "e4c13418-9142-4276-b15e-0fb265243c0f", "e930195e-baa4-4d42-9d5f-e042fcaf5a9e", "ec2e20b9-e75a-47b4-9b32-3fe556dcc7f8", "f9653b50-d09f-4ecf-a679-4f6100d6b200"], "title": "Information Systems Uncertainty Design and Implementation Combining: Rough, Fuzzy, and Intuitionistic Approaches", "venue": "", "year": 2014, "id": "01edeac9-cd8b-46f9-a8a8-25445b959abc"}
{"authors": ["Tegegne Marew", "Doo-Hwan Bae"], "n_citation": 1, "references": ["2134bf3b-fd89-4724-90ce-5993b4fa3218", "906c17e0-db09-407b-b760-41df5a3f0293", "94f4382e-cfa6-4aec-92b8-3711fc55da54", "9f172585-8d42-4fce-b6ae-aede321f3fd4", "a3aee287-efd0-4b9d-9cda-d47dd192c9f4", "a9a7fd07-ef71-4b3c-8fcf-d7fe114d2148", "d63dd4ae-4b30-484b-8ffc-88d21839ddad"], "title": "Using Classpects for Integrating Non-Functional and Functional Requirements.", "venue": "international conference on software engineering", "year": 2006, "id": "01f1d231-80ae-4cce-b56c-9d821e0924d0"}
{"authors": ["\u0141ukasz Kobyli\u0144ski"], "n_citation": 0, "references": ["5413e164-f614-4fce-a5e1-1e568cd36f9e", "563ae8c8-1d75-4aba-a9df-bd675a1f556c", "ecd6a845-8439-49b0-abe8-f71fff81da23", "fa322496-211b-447b-9400-fee2d75b3b60"], "title": "Automatic Detection of Annotation Errors in Polish-Language Corpora", "venue": "intelligent information systems", "year": 2013, "id": "01f6ef00-cb36-4306-a4b5-d3a894594185"}
{"authors": ["William L. Hibbard", "Haim Levkowitz", "J. Haswell", "Penny Rheingans", "F. Schroeder"], "n_citation": 50, "references": ["11f0ece4-d29f-4ac6-98f0-9e62e79b8653"], "title": "Interaction in Perceptually-Based Visualization", "venue": "", "year": 1995, "id": "022a8af2-f75a-4b5e-8163-90b986cb33f7"}
{"authors": ["Yasubumi Sakakibara", "Satoshi Hiyama"], "n_citation": 0, "references": ["1228c212-976b-46c0-b891-1bad42a19dd8", "1b888aaa-9075-455f-b701-39ce15cb6dc8", "42cbbd27-afa3-43fc-8d99-ec25853aa504", "6b49a165-ebe4-4ac6-9869-fbcf5091a343", "972ae154-9446-439c-bc40-b53917f391f2", "9d14d68b-9c42-4192-8515-8625426e984a", "a38c9378-baa0-411d-bcbd-2aac8be41f06", "bed9c059-a2ac-4181-8aa5-58d105d2a743", "cf6406a3-d251-4046-9568-dea14f551e00", "d629a873-45f9-4375-adcd-95acb7c3ff9c", "e29b3b68-e508-4397-97cc-15c09a6cdc87", "e8e94444-ff69-4447-9e5c-526c3deb4c53", "ff80ea73-4981-41d0-b6c5-bde80e3e23d8"], "title": "Bacterial Computing and Molecular Communication", "venue": "", "year": 2012, "id": "023c6be5-68d9-4948-9727-0b2e5be0ffb0"}
{"authors": ["Harald Weinreich", "Hartmut Obendorf", "Winfried Lamersdorf"], "n_citation": 0, "references": ["259ff48c-d0b9-4fd4-8275-8169c6152224"], "title": "HyperScout: Linkvorschau im World Wide Web.", "venue": "Zeitschrift F\u00fcr Interaktive Und Kooperative Medien", "year": 2004, "id": "024ed70c-dba7-4e26-870d-57abf1cccd46"}
{"authors": ["Filipe Crist\u00f3v\u00e3o", "Sara C. Madeira"], "n_citation": 1, "references": ["380555c0-e802-458f-9c8d-248b82b55f48", "434778a0-92b1-4bf3-8d78-77f6f34737cd", "77439662-5048-4812-ad75-3927b933a82d", "8f3c2c52-f66d-40bb-b68f-eb1185941d0c"], "title": "Parallel e-CCC-Biclustering: Mining Approximate Temporal Patterns in Gene Expression Time Series Using Parallel Biclustering", "venue": "", "year": 2012, "id": "025bf71b-be4c-48d4-9c70-20abfd2d5095"}
{"abstract": "Breast cancer is the most common form of cancer in women. Early diagnosis is necessary for effective treatment and therefore of crucial importance. Medical thermography has been demonstrated an effective and inexpensive method for detecting breast cancer, in particular in early stages and in dense tissue. In this paper, we propose a medical decision support system based on analysing bilateral asymmetries in breast thermograms. The underlying data is imbalanced, as the number of benign cases significantly exceeds that of malignant ones, which will lead to problems for conventional pattern recognition algorithms. To address this, we propose an ensemble classifier system which is based on the idea of Clustering and Selection. The feature space, which is derived from a series of image symmetry features, is partitioned in order to decompose the problem into a set of simpler decision areas. We then delegate a locally competent classifier to each of the generated clusters. The set of predictors is composed of both standard models as well as models dedicated to imbalanced classification, so that we are able to employ a specialised classifier to clusters that show high class imbalance, while maintaining a high specificity for other clusters. We demonstrate that our method provides excellent classification performance and that it statistically outperforms several state-of-the-art ensembles dedicated to imbalanced problems.", "authors": ["Bartosz Krawczyk", "Gerald Schaefer", "Shao Ying Zhu"], "n_citation": 50, "references": ["16f0341b-538d-40f3-996c-8de7cc4dc675", "1ca19102-96fb-4b4b-a469-88ad17f36b11", "38135245-8eff-4078-af6a-ea559ffa660b", "3cbd262f-bf3c-4fcd-a143-dd1a6be49e4b", "5355c319-b80d-40de-bf24-5ab2f95cb7b1", "64b37c52-2186-4398-ba45-5566f33642ce", "87b6c1da-c179-412e-8934-228784c9c82b", "9075487a-8183-4565-ac94-0197da31e056", "a6e178c8-d55f-460c-8e5b-c9d5cfb04c20", "af647f42-0b8d-480b-a36e-c7f351a95473", "b1e0b2d0-8a1e-42f5-8645-9fae30b8636f", "c52208d6-0dfb-400f-a19b-ed6fedfaea19", "e6b6e8f4-3c7d-4435-8ca9-192c3a76cdf8"], "title": "Breast Cancer Identification Based on Thermal Analysis and a Clustering and Selection Classification Ensemble", "venue": "", "year": 2013, "id": "0265aea8-65f3-4f46-b8b1-6b65bcb1d38f"}
{"authors": ["Ted H. Szymanski"], "n_citation": 7, "title": "On the Universality of Multistage Interconnection Networks.", "venue": "international conference on parallel processing", "year": 1986, "id": "02804a61-a180-4f77-8edf-ff630ddd5ceb"}
{"abstract": "The development of an automated system for the quality assessment of aerodrome ground lighting (AGL), in accordance with associated standards and recommendations, is presented. The system is composed of an image sensor, placed inside the cockpit of an aircraft to record images of the AGL during a normal descent to an aerodrome. A model-based methodology is used to ascertain the optimum match between a template of the AGL and the actual image data in order to calculate the position and orientation of the camera at the instant the image was acquired. The camera position and orientation data are used along with the pixel grey level for each imaged luminaire, to estimate a value for the luminous intensity of a given luminaire. This can then be compared with the expected brightness for that luminaire to ensure it is operating to the required standards. As such, a metric for the quality of the AGL pattern is determined. Experiments on real image data is presented to demonstrate the application and effectiveness of the system.", "authors": ["J. Niblock", "Jian-Xun Peng", "Karen McMenemy", "George W. Irwin"], "n_citation": 0, "references": ["8fc06656-ed2a-4610-8112-7cb9eb734e1e", "99c6b256-2b1c-40d1-8899-af0be027d3db", "cf14524e-0b45-463b-8abd-2b1a28e6fb10", "e0f789e5-3781-44b6-a06a-373728228a07"], "title": "Automated Object Identification and Position Estimation for Airport Lighting Quality Assessment", "venue": "international conference on computer vision", "year": 2008, "id": "028d37c8-b571-41b3-8101-539252f411dd"}
{"authors": ["Nadine Kafa", "Yasmina Hani", "Abederrahman El Mhamedi"], "n_citation": 50, "references": ["dbc1afc4-ea36-4175-a495-3fc0291b2731"], "title": "A Fuzzy Multi Criteria Approach for Evaluating Sustainability Performance of Third \u2013 Party Reverse Logistics Providers", "venue": "", "year": 2014, "id": "029385b7-b9fc-4c62-b0b4-f6ce31a99a9b"}
{"authors": ["Lawrence J. Mazlack"], "n_citation": 0, "title": "Heuristic Principles Supporting Making Time Critical Decisions in Knowledge-Based Systems.", "venue": "international syposium on methodologies for intelligent systems", "year": 1988, "id": "02a186be-84bc-4c44-9fd6-2b15d9123607"}
{"authors": ["Balan Venkatesh", "S. Palanivel", "B. Yegnanarayana"], "n_citation": 50, "references": ["56f4b72a-ec39-47ac-8220-899296e7fb18", "5d738b72-476a-48cb-a789-d11c01794c2e", "66e4459a-d337-4515-9710-7fb0ee7ba528", "aee71707-aeae-4d10-ab0c-b6e518b235b9", "b85ac095-a9f2-4954-b2bf-f53fde98958c", "bf4faf61-b2b7-460f-810f-c423797a3754", "d6e37fb1-5f7e-448e-847b-7d1f1271c574", "e41b2fd1-c576-453e-9a22-9b0eeafe308c"], "title": "Face Detection, Recognition in an Image Sequence Using Eigenedginess.", "venue": "", "year": 2002, "id": "02a58862-0024-4e20-9993-35a8706681b3"}
{"abstract": "Quality specified image retrieval is helpful to improve the user experiences in mobile searching and social media sharing. However, the model for evaluating the quality of the user generated images, which are popular in social media sharing, remains unexploited. In this paper, we propose a scheme for quality assessment on user generated image. The scheme is formed by four attribute dimensions, including intrinsic quality, favorability, relevancy and accessibility of images. Each of the dimensions is defined and modeled to pool a final quality score of a user generated image. The proposed scheme can reveal the quality of user generated image in comprehensive manner. Experimental results show that the scores obtained by our scheme have high correlation coefficients with the benchmark data. Therefore, our scheme is suitable for quality specified image retrieval on mobile applications.", "authors": ["Qiong Liu", "You Yang", "Xu Wang", "Liujuan Cao"], "n_citation": 3, "references": ["04f8d077-765a-4145-bf14-bace8fc3a7c9", "07b11cc1-12ca-44d4-bcca-702d4d306dfd", "0d2e42c4-595d-449f-8738-2f0553763772", "117fa766-80c7-414e-9f65-5ae1a057fdd6", "19b5f75e-faec-42bb-a795-d6728e493ae8", "27ac42a2-1eb4-4060-80a6-c0a0566bfaf0", "30da015e-fc53-4de5-91b8-18e28f1281d2", "4c859183-ef97-49be-ba88-e096def9acf2", "638ae38d-2880-4c40-8bfc-86510ec17c96", "71198e87-8fba-4bb9-9b0e-286820c815b1", "7dff52ca-5ee1-416f-9e54-8e4a2e42ef9e", "7f1214b2-e070-4ff2-a5d3-647e7c16c2d7", "8575572a-2b87-4cbb-b260-746ddedc4637", "900e5460-9bf1-4fc9-a709-48f16cad4b77", "96564de0-6158-4564-abdf-1533164ae91f", "adea5377-3a51-4831-add5-80ebf31685e1", "c09dd382-6958-408b-aea7-4f5972031e4e", "c2b03f8f-8de3-40a2-ba0e-f0c9142151d3", "c5799806-44a9-4e53-a9ef-0482abc74bf2", "c8263f04-6d4e-4828-89de-f5418cefd1d7", "caaff64a-e3cb-4f06-a292-34994f34417c", "dd4eb389-91ba-498c-b37e-ff757fd1a30f", "ea0912eb-9116-42e7-b7db-fdd1f0b2d6f1", "eb3f6c15-20d6-4d73-8412-cbe15df31bbf", "feddae21-3c05-4743-80fa-b8e101f1b93f"], "title": "Quality Assessment on User Generated Image for Mobile Search Application", "venue": "conference on multimedia modeling", "year": 2013, "id": "02a5e8a8-061e-4c1f-ab16-bda035578e54"}
{"authors": ["Jos\u00e9 Luis Mart\u00edn", "Aitzol Zuloaga", "Josu Cruzado"], "n_citation": 1, "title": "Software Workbench for Movement Estimation based on Optical Flow Computation.", "venue": "", "year": 2001, "id": "02a6e069-9672-496e-8566-bcd436fadfc2"}
{"authors": ["Mark Northover"], "n_citation": 50, "references": ["382b7b47-1cd7-4236-8457-42c3e527f1f2"], "title": "Online discussion boards - friend or foe?", "venue": "", "year": 2002, "id": "02ad7019-1c4c-4a23-85ac-086e4cfcfcb2"}
{"authors": ["Christian S. Jensen", "Simonas \u0160altenis"], "n_citation": 50, "references": ["137de291-af63-4fe8-92f2-44a1e11a2ada", "23f7e828-eb70-4a4f-ad6a-ad7a034fffca", "34015997-30bf-4bff-a639-7eefa7773c46", "56090a8a-25e0-4117-8c8a-b005962570ab", "82dceba1-1fdc-49d8-89ac-abf76496e74c", "a8c06314-9736-451b-b39b-1b58083e6fe3", "ae3ea321-d857-4f6d-a6f2-cf27993c3b47", "b3fcec7f-72e8-467f-b563-5aa7aef8b70a", "e1a0c763-1224-4560-885c-113d3b59874d", "ed1db967-7ead-47fd-9382-c3bedc3f81be"], "title": "Towards Increasingly Update Efficient Moving-Object Indexing", "venue": "IEEE Data(base) Engineering Bulletin", "year": 2002, "id": "02b94941-769d-479c-8746-b1d8be9e6b52"}
{"authors": ["Jim Hunter", "Nicholas Mark Gotts", "Ian Michael Hamlet", "Ian K. Kirby"], "n_citation": 50, "references": ["67e983a6-1b1f-41b6-b418-5509db1d0508"], "title": "Qualitative Spatial and Temporal Reasoning in Cardiac Electrophysiology", "venue": "artificial intelligence in medicine in europe", "year": 1989, "id": "02d48327-6f23-4906-b2fb-c1ff66bf6b74"}
{"authors": ["Claudius Gl\u00e4ser", "Martin Heckmann", "Frank Joublin", "Christian Goerick"], "n_citation": 2, "references": ["18b17dbd-4f51-411e-a099-efadf521f0d8", "24c79482-a7f4-4fe1-b4c3-30de5467420f", "84e00e22-868e-4a9c-9937-2e63a0d2462d", "c80d3d76-2d40-4d31-93b2-cf99ecc8f8dc", "c9820b80-35f6-48c0-b3ff-561c39d0ad34", "dd7f939b-8a5d-4835-9e8d-a34a6228f43d"], "title": "Auditory-based formant estimation in noise using a probabilistic framework.", "venue": "conference of the international speech communication association", "year": 2008, "id": "02e8e38f-ed5c-43a4-b3a4-c5064a725a2d"}
{"authors": ["Kshiti D. Joshi", "Joe Brooks"], "n_citation": 0, "title": "Knowledge Flows: Knowledge Transfer, Sharing and Exchange in Organizations: Minitrack Introduction", "venue": "hawaii international conference on system sciences", "year": 2004, "id": "032a34b6-559f-44b8-a7ad-6f9c56acbb5b"}
{"authors": ["Michael A. Henning"], "n_citation": 7, "title": "On the signed total chromatic number of a graph.", "venue": "Ars Combinatoria", "year": 2006, "id": "03385413-7c3a-44ce-b40c-58ff21304270"}
{"abstract": "We discuss traveling wave solutions to the Yukawa equations, a system of nonlinear partial differential equations which has applications to meson\u2013nucleon interactions. The Yukawa equations are converted to a six-dimensional dynamical system, which is then studied for various values of the wave speed and mass parameter. The stability of the solutions is discussed, and the methods of competitive modes is used to describe parameter regimes for which chaotic behaviors may appear. Numerical solutions are employed to better demonstrate the dependence of traveling wave solutions on the physical parameters in the Yukawa model. We find a variety of interesting behaviors in the system, a few of which we demonstrate graphically, which depend upon the relative strength of the mass parameter to the wave speed as well as the initial data.", "authors": ["Robert A. Van Gorder"], "n_citation": 6, "references": ["36905344-ad94-4e1c-8c44-d535e5d53fcf", "ac39e859-a361-4eab-9f5b-b8f5431bd9c6"], "title": "Traveling wave solutions of the n-dimensional coupled Yukawa equations", "venue": "Applied Mathematics Letters", "year": 2012, "id": "034261a4-1e9b-463f-9549-c0b890af6a41"}
{"authors": ["Munish Gandhi", "Edward L. Robertson"], "n_citation": 10, "title": "A Data Model for Audio-Video Data .", "venue": "conference on management of data", "year": 1994, "id": "03697436-022a-4255-8a77-c5719ea719fb"}
{"authors": ["Etiel Petrinja", "Giancarlo Succi"], "n_citation": 1, "references": ["1814833f-fcc7-40ad-bbd0-af5a57817dba", "4c291f96-8035-4fb1-9901-097fd7d32823", "55ef6882-6450-4c11-b579-f7a0ea2dd4bc", "68c15951-edf4-4ca2-86ec-ca9b2cba07b5", "753aca71-0ad0-471e-9940-e5ce83f8623b", "821f75f6-5a93-44bb-873e-0d0a067eebdc", "90e61cdc-2694-45c1-9927-281300ffe7c4", "9e79cd42-28e6-43da-b4cf-ad37752f9122", "b188df7e-6c55-4016-be88-0f02ed9a654e", "b541380f-8e36-4fd8-91b3-04cf1f8d2736", "b924b762-d39e-433a-ab43-19fe84c5ec8a", "b98c775f-6239-4065-a5b8-a836e7b5895c", "cd208086-cc29-49ce-81be-af4cda450278", "f48f4e3b-19b9-4c13-9554-c6f7e81e32ca"], "title": "Two Evolution Indicators for FOSS Projects", "venue": "open source systems", "year": 2012, "id": "037537be-76ff-4f96-88bc-6aebdd4b65ed"}
{"authors": ["Carlos E. Salgado", "Juliana Teixeira", "Ricardo J. Machado", "Rita Suzana Pitangueira Maciel"], "n_citation": 50, "references": ["15a08ea9-a40d-487c-aecc-1b38b39d7e96", "24418cb5-96b1-4a61-af3c-032ed7d42799", "407b7c6e-6858-4378-91fd-18e00c23f097", "63adcdaa-a52f-4ab4-bdbf-6ba01b58afb1", "69220232-821f-4e21-8d99-3decfb2f9da6", "6dbd7296-0c4b-4876-8dd0-a522cb7a2ebb", "853c8386-e527-4a84-bcb8-fc1ec42df7e4", "b43bd96e-643a-44ce-82de-acbd3800bdf5", "d928788b-9bf1-497b-886e-babe3932081b", "e2dc9c51-9c04-4e06-95a8-57ee82d55963", "edc5580a-d01d-4456-8d7f-03366ceb5e65", "f6fefe9b-0729-4d45-a1b7-ca6292de2a4c", "fd211b78-dd1e-4a2c-96be-33970968a365"], "title": "Generating a Business Model Canvas through Elicitation of Business Goals and Rules from Process-Level Use Cases", "venue": "", "year": 2014, "id": "038a0eb8-5350-4cf6-b86b-1effa9ad405f"}
{"abstract": "In this paper, we investigate the multi-layer topology preserving mapping for K-means. We present a Multi-layer Topology Preserving Mapping (MTPM) based on the idea of deep architectures. We demonstrate that the MTPM output can be used to discover the number of clusters for K-means and initialize the prototypes of K-means more reasonably. Also, K-means clusters the data based on the discovered underlying structure of the data by the MTPM. The standard wine data set is used to test our algorithm. We finally analyse a real biological data set with no prior clustering information available.", "authors": ["Ying Wu", "Thomas K. Doyle", "Colin Fyfe"], "n_citation": 50, "references": ["2834deb1-eaf2-40c8-899c-fdf2d28e556f", "32c1bdf2-cea7-4d60-8289-2207eaa41a77", "42ff270c-343d-4691-a894-cd191ddbc325", "4453fa3b-308f-472a-be61-65d1ce5c3de2", "6aec5778-8b3b-42f2-915b-ad44fab47236", "79c9d21e-2070-4a0a-a0d4-482438c14647", "89f10062-acf1-4171-b882-f3222c3a357e"], "title": "Multi-layer topology preserving mapping for K-means clustering", "venue": "intelligent data engineering and automated learning", "year": 2011, "id": "03990c4b-45be-4913-80d6-27d3b3381b36"}
{"authors": ["Robert D. Austin", "Richard L. Nolan", "Shannon O'Donnell"], "n_citation": 3, "title": "A 'Novel' Approach to the Design of an IS Management Course", "venue": "Communications of The Ais", "year": 2009, "id": "03b0d33b-450a-4742-b10f-aa28f56a192c"}
{"authors": ["Kook Jin Ahn", "Sudipto Guha", "Andrew McGregor"], "n_citation": 26, "references": ["19275f14-6372-4748-adaa-b9b3b25310fa", "40f70152-d340-4f94-9fd2-332c79fba0ea", "645cf994-f85e-4ad5-9498-a954c35c96df", "6ba767a4-0d47-4eaa-8528-c7c6f3290781", "8fed7067-5f57-4f15-88cc-c948bcdd83f4", "9e2da831-0b8e-46af-a13a-034915cfcd15", "a53a3dda-b003-4d5c-96b1-e9afd8e35692", "aaa548b1-1c83-4325-8218-ee1efbf9a484", "b27e040f-8737-433b-a6e5-46c8f6c906b9", "c111bfb4-d946-4dfe-b08d-e603e0de6b0f", "d55d0887-6ae4-4ef0-a87b-d1f08cb4145a", "df235328-685d-4722-a9e8-7c127c69ee08", "ea24fe55-8af2-443d-ba4b-b2bb08697521", "f56b877b-4060-4754-b303-e8140968544c"], "title": "Spectral Sparsification in Dynamic Graph Streams", "venue": "", "year": 2013, "id": "03bec38d-39fb-4bc8-be7b-9622e86ff5ff"}
{"abstract": "The paper discusses the design principles and current status of a natural language front end for access to data bases. This Is based on the use, first, of a semantically-oriented question analyser exploiting general, language-wide semantic categories and patterns, rather than data base-specific ones; and, second, of a data base-oriented translation component for obtaining search specifications from the meaning representations for questions derived by the analyser. This approach is motivated by the desire to reduce the effort of providing data base-specific material for the front end, by the belief that a general analyser is well suited to the \"casual\" data base user, and by the assumption that the rich semantic apparatus used will be both adequate as a means of analysis and appropriate as a tool for linking the characterisations of input and data language items. The paper describes this approach in more detail, with emphasis on the existing, tested, analyser.", "authors": ["B. K. Bog", "K. Sparck Jones"], "n_citation": 50, "references": ["11aceee0-863e-4bae-81d1-899bc1edaac3", "982ac74b-be8b-4d5c-ab4c-70673857817f", "9ba308df-c0ff-4a32-b9e0-a6e83e01c706"], "title": "A general semantic analyser for data base access", "venue": "international joint conference on artificial intelligence", "year": 1981, "id": "03cda805-9746-48bb-a04d-02c2dac201c7"}
{"abstract": "State-space explosion is a major obstacle in verification of time-critical distributed systems. An important factor with a negative influence on the tractability of the analysis is the size of constants that clocks are compared to. This problem is particularly accented in ex- plicit state-space exploration techniques. We suggest an approximation method for reducing the size of constants present in the model. The proposed method is developed for Timed-Arc Petri Nets and creates an under-approximation or an over-approximation of the model behaviour. The verification of approximated Petri net models can be considerably faster but it does not in general guarantee conclusive answers. We im- plement the algorithms within the open-source model checker TAPAAL and demonstrate on a number of experiments that our approximation techniques often result in a significant speed-up of the verification.", "authors": ["Sine Viesmose Birch", "Thomas Stig Jacobsen", "Jacob Jon Jensen", "Christoffer Moesgaard", "Niels N\u00f8rgaard Samuelsen", "Ji\u0159\u00ed Srba"], "n_citation": 2, "references": ["05187588-ada5-47d3-ab0d-a282be6fc447", "2230c340-e108-418b-a1ab-c40ef3eaefe5", "260b34ec-bd5e-487e-9e8a-b479dc679345", "26ba289c-7209-4d40-a7c3-3acc2bd88f65", "2a8da6cc-4c7e-480a-929b-d41ee021ccf4", "357c3e46-8be2-422d-b54f-74dbc52e0d3e", "4fccb3c3-45e6-46b9-8806-50d8451fb840", "50f10b22-b641-47ba-b594-d8af05f4c3d5", "80c5d053-0786-4d72-9cb8-a0a3217bd49e", "8512d397-7900-4842-81eb-8a7935a772df", "871abaad-e9bb-4f97-8dc5-081305d73bb9", "92d10f3d-c071-49d4-b9ee-b53151d80aa7", "9849d9c4-a97f-452f-882c-42a8c6cab0b5", "a02087e5-151c-4061-b172-7770f51f84f6", "b9406df7-db37-4dd8-83d9-90b6b1713f2d", "c45016d5-4794-4c33-a2d0-f7d30a38f9ef", "d196ebe5-517e-4423-a021-ec7206cad311", "d50cac03-25bc-47fd-9a27-2be1052bd5e9", "e2f00686-d81e-4d69-b5e3-88a9d8d2e7f9", "e67d1f2b-624c-424e-a4e0-7ba8ff810b14", "ecf23f31-b26e-45aa-8b56-674b89ef15f7", "ff3e5819-210a-4ada-b654-33a95105d77a"], "title": "Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets", "venue": "formal modeling and analysis of timed systems", "year": 2014, "id": "03dd4db1-3540-4de6-b8f4-5d79cc538dd7"}
{"abstract": "We focus on covariance criteria for flnding a suitable sub- space for regression in a reproducing kernel Hilbert space: kernel princi- pal component analysis, kernel partial least squares and kernel canonical correlation analysis, and we demonstrate how this flts within a more gen- eral context of subspace regression. For the kernel partial least squares case some variants are considered and the methods are illustrated and compared on a number of examples.", "authors": ["Luc Hoegaerts", "Johan A. K. Suykens", "Joos Vandewalle", "Bart De Moor"], "n_citation": 13, "references": ["3246059e-cd3b-4d95-8ca9-59f2238c6bb4", "94898e1d-1e50-41ab-9dcc-2c2e030cddd0", "d6b9ff71-cbbb-4801-947c-b4e1224cb649"], "title": "Kernel PLS variants for regression", "venue": "the european symposium on artificial neural networks", "year": 2003, "id": "04136c62-06a9-4c74-9da2-547448a9dc6f"}
{"authors": ["M. Prim", "Joan Oliver", "Vicen\u00e7 Soler"], "n_citation": 0, "title": "Aprendizaje de Sistemas Digitales Utilizando Tecnolog\u00edas Interactivas.", "venue": "Revista Iberoamericana De Tecnolog\u00edas Del Aprendizaje", "year": 2009, "id": "042fb9d9-840e-445a-84d0-591887d3e880"}
{"abstract": "In recent years, several advanced methods for image steganalysis were proposed. During research process, some concerns are more and more addressed by steganalyzer. In this paper, we focus on several of these concerns. The first one is how to utilize SVM classifier in practical steganalysis, we use clustering analysis to divide training samples and train several SVM for detecting stego image. In this part we also discussed building an image database that can be used for evaluating steganography/steganalysis fairly. The second is how to designed proper classifier for steganalysis, especially how to take information of cover/stego image pair into account. We will discuss several notions regard to these two concerns.", "authors": ["Qingxiao Guan", "Jing Dong", "Tieniu Tan"], "n_citation": 1, "references": ["24f4d12f-46d3-48c3-873f-353c99b0f939", "7cf849c0-c163-4da0-b88a-c4ed255e8911", "96f3dfb4-d7ae-4391-98f5-87922010fd1b", "ac2c54f7-4843-4799-a38a-36265ca56f30", "b0443264-6199-4cec-b991-ef1b0860cfd1", "d829955b-baee-4df9-9bfb-19f181b2f7c9", "e4f5197a-867f-410c-a526-339eef9d878b"], "title": "Two notes from experimental study on image steganalysis", "venue": "international conference on intelligent computing", "year": 2013, "id": "0440e3ec-6f52-4cd4-8d97-bc25440a233e"}
{"abstract": "This paper presents an experimental evaluation of a rapid, adaptive assessment of the difference threshold (DL) of passive metacar- pophalangeal index finger joint flexion using a robotic device. Parameter Estimation by Sequential Testing (PEST) is compared to the method of constant stimuli (MOCS) using a two-alternative forced-choice par- adigm. The pilot study with 13 healthy subjects provided DLs within similar ranges for MOCS and PEST, averaging at 2.15 \u25e6 \u00b1 0.77 \u25e6 and 1.73 \u25e6 \u00b10.78 \u25e6 , respectively, in accordance with the literature. However, no significant correlation was found between the two methods (r(11) = 0.09, p =0 .762). The average number of trials required for PEST to converge was 58.7\u00b1 17.6, and significantly lower compared to 120 trials for MOCS ( p< 0.001), leading to an assessment time of under 15 min. These results suggest that rapid, adaptive methods, such as PEST, could be success- fully implemented in novel robotic tools for clinical assessment of sensory deficits.", "authors": ["Mike D. Rinderknecht", "Werner L. Popp", "Olivier Lambercy", "Roger Gassert"], "n_citation": 50, "references": ["daaf1ef7-4015-4244-ba53-21d84d0b1674"], "title": "Experimental Validation of a Rapid, Adaptive Robotic Assessment of the MCP Joint Angle Difference Threshold", "venue": "", "year": 2014, "id": "045c16e3-35e1-473d-9083-7f165526c45c"}
{"authors": ["Diana Inkpen", "Graeme Hirst"], "n_citation": 25, "references": ["2a387921-04ce-43a6-bf83-334116e8dbe4", "6d986416-3e63-41bd-89e4-3668e30e0e5a", "8f00d033-f73d-4319-ac53-f6230f37a704", "fa120211-756b-47c8-93b0-0c2df711ba3f"], "title": "Near-synonym choice in natural language generation", "venue": "recent advances in natural language processing", "year": 2003, "id": "0467f064-6a97-4a62-a371-296953f4acfe"}
{"authors": ["Bart Demoen", "Andr\u00e9 Mari\u00ebn", "Allain Callebaut"], "n_citation": 50, "title": "Indexing Prolog clauses", "venue": "", "year": 1989, "id": "048e0b4f-5685-4507-8d38-d65b45b3adaf"}
{"authors": ["Reinhard Klein"], "n_citation": 6, "references": ["00ad420f-8d10-4d6f-9dd3-729809a95567", "5fa53ae5-d541-4335-a903-d842c68b7bf7", "6478ee27-4f7d-4cf9-99e4-af171af38e58", "6dd8b562-6a84-4423-a1c1-aa2723ed6593", "d6396f5e-a606-47cc-b7bd-bca58b54d26a"], "title": "Linear Approximation of Trimmed Surfaces", "venue": "", "year": 1994, "id": "04a259d4-1c49-4192-a1ec-c20b1fab56ec"}
{"abstract": "The paper describes user behavior as a result of introducing monetization in the freemium educational online platform. Monetization resulted in alternative system growth mechanisms, causing viral increase in the number of users. Given different options, users choose the most advantageous and simple ones for them. System metrics in terms of the K-factor was utilized as an indicator of the system user base growth. The weekly K-factor almost doubled as a result of monetization introduction. Monetization and viral growth can be both competing and complementary mechanisms for the system growth.", "authors": ["Ilya V. Osipov", "Anna Y. Prasikova", "Alex A. Volinsky"], "n_citation": 0, "references": ["20bd450e-1e64-4350-8b4e-16c25ece050f", "22ab2de7-1e10-4b34-bd95-b40b044412f4", "43a92b7b-b065-43b3-921a-fbb90b7ec63f", "5432e816-4fcc-4ca2-8a22-66ab19e7d8bd", "77a3f5e6-6a65-4b94-96a3-7674234f9c07", "8e4fdc2d-34f5-4cf4-a140-e9de62109350", "a165b812-6dc4-4906-9efb-8890644f5155", "d2645c86-a994-471a-bf55-8f4a4f1914d0", "df406472-de42-42c7-ab8b-f899db0e8640", "e0c6d05c-2dba-424e-9d5c-7b965f892474", "e1f32b0f-7af0-4c63-8699-6e850daddde6"], "title": "Monetization as a Motivator for the Freemium Educational Platform Growth", "venue": "arXiv: Computers and Society", "year": 2015, "id": "04b38d22-d10c-4b84-8a9d-bd610400aa4e"}
{"authors": ["Probir Kumar Banerjee", "Hamid Bagha"], "n_citation": 1, "references": ["18463ed3-0acb-49b8-a688-f1a8575a26d5", "4bb4252d-a762-4e33-be87-786936391419", "79c40824-1c6d-4362-8eb0-f5a535230668", "b962d42b-7757-4393-b17e-03e24990c6a3", "be65e3c9-3377-477f-a728-236350eaba66", "f130d8c8-6246-4749-aea4-524fa1300c1b"], "title": "EMR ADOPTION BY SMALL CLINICS IN MALAYSIA: AN EXPLORATORY STUDY AND THEORETICAL EXPLANATION", "venue": "pacific asia conference on information systems", "year": 2014, "id": "04b3a8d0-427b-442f-a43a-561f7c3473de"}
{"authors": ["Volker Frehe", "Florian Stiel", "Frank Teuteberg"], "n_citation": 0, "references": ["059b9c75-15cd-40ce-8ee7-88f85ffa4140", "139c9725-d5df-49b0-b64c-1de5f43ffa4d", "358685cd-228e-4010-8d58-f2c7c7abee68", "885cfaf9-43e5-4101-9554-40962d09fe53", "8d5b3416-84e6-4926-bd61-7b2f3c7d2714", "92b354ec-be2f-46cd-a1b6-641b40e776cd", "ba76c3e1-dbba-479f-8b50-e27299668d51", "d9a58b32-b840-4f7a-b4f2-009595749032", "e173a9e7-14ca-4519-8e69-aaf60439896b"], "title": "A Maturity Model and Web Application for Environmental Management Benchmarking", "venue": "", "year": 2014, "id": "04b48a27-aff7-4276-9952-17cd6d7a7761"}
{"authors": ["Eleanor Leist", "Dan J. Smith"], "n_citation": 0, "references": ["063178c7-d67b-46bd-885f-04def86e0fb5", "115cc928-34e7-47a5-a036-2cefd8dfddeb", "193f995e-e724-42e5-8b2e-0725fefc1310", "2eaf0ea0-aad7-4f41-9452-7ec940aecb55", "42702730-1904-4680-95b5-71c7fffef58b", "42b38486-efb3-41bf-8ccb-7e6f5ef4d27d", "443e333d-90c4-4710-bf4c-f61208be52ba", "586c38ee-1a29-47b7-95e3-4215a1d90de6", "589f331e-50cd-4fd2-9ced-b03b4bc972b2", "66175cb2-3e0a-450a-9ee8-2ac66bdb7b93", "84559446-915b-4f06-b72f-272b79e3dfdf", "92925368-fa60-4ed6-8fed-43773aaed3ad", "9741c791-615f-40e6-ac20-0c5334827069", "98c72ca3-c9fa-436f-9726-caaa65600448", "a0a94809-4f1a-4b42-a3e9-6eb54b53b82f", "c247aa9f-9d52-4b34-bfe0-b11d8cd3c4c0", "cb1817aa-5a35-465e-b429-9cdec14279ee", "fa848c17-06c5-4cd8-9cee-fefb667d436a"], "title": "Accessibility Issues in E-Government", "venue": "electronic government", "year": 2014, "id": "04c98093-dea5-4e53-b7de-9cf9b0e3d42d"}
{"authors": ["Jesper Boserup Thestrup", "Tamas Gergely", "Peter Beck"], "n_citation": 50, "references": [], "title": "Exploring New Care Models in Diabetes Management and Therapy with a Wireless Mobile eHealth Platform", "venue": "", "year": 2011, "id": "04dfa431-3118-4092-9238-93c2261ad157"}
{"abstract": "The acquisition of concepts induced by structural descriptions of pictures is discussed and a representation scheme is presented which allows the construction of various abstractions based on different points of views and their storage in a simulated associative memory.", "authors": ["Pierre E. Bonzon"], "n_citation": 0, "references": ["84d1c991-a589-4b22-8341-f6f8e5bade27", "f9bb0c0c-ef66-46b1-9781-be57b8033f59"], "title": "Learning of abstractions from structural descriptions of pictures", "venue": "international joint conference on artificial intelligence", "year": 1979, "id": "04f16960-42b0-4f58-a1ff-23844582c40c"}
{"authors": ["Kenro Yatake", "Toshiaki Aoki", "Takuya Katayama"], "n_citation": 2, "title": "Collaboration-based verification of Object-Oriented models in HOL.", "venue": "", "year": 2004, "id": "05207a8a-9956-48d7-b925-870ec70a0892"}
{"authors": ["Peter Herrmann", "Manfred No\u00ebl"], "n_citation": 0, "title": "Formale Verifikation eines Reglers f\u00fcr Fahrbahnmarkierungsmaschinen.", "venue": "", "year": 1999, "id": "0534fb16-add3-4811-b952-7f9814280978"}
{"abstract": "We study a hypergraph transversal computation: given a hypergraph, the problem is to generate all minimal transversals. This problem is related to many applications in computer science and vari- ous algorithms have been proposed. We present a new efficient algorithm using the compressed data structures BDDs and ZDDs, and we analyze the time complexity for it. By conducting computational experiments, we show that our algorithm is highly competitive with existing algorithms.", "authors": ["Takahisa Toda"], "n_citation": 50, "references": ["0e581d6e-5ee2-4f4e-8cb7-504792a9d074", "16fa7ec5-e52d-45fe-b2da-b58421e675d9", "1883008e-4f9e-4a53-a93d-38aa0552c0f4", "3f2468a2-3197-4721-8c17-d581265bf373", "4bccdaf0-63d9-4657-9e47-5f7bd5882d5f", "57ba4fab-d952-4879-a6a6-5a348fd49095", "5f3acae9-b017-46bc-93e4-63e9047682e1", "60f72d5e-cd9f-44fb-86d1-5e25a6b7486c", "8ac6b5f4-9db2-4f4b-a651-d14d169f38dd", "98a8bad9-a456-4f38-836c-5a5b5e19384d", "a8cc518b-bd85-469e-bee3-32adc0470fc8", "aa42c53f-0236-4252-b2a5-6dbe1e3d9c2e", "b2015b68-3e0b-4338-b200-d06c86dccc27", "dc1687d4-611e-4322-a94b-9602958636ee", "e39f6caf-0f32-4f2e-9a0e-5e6212a5c6b5"], "title": "Hypergraph Transversal Computation with Binary Decision Diagrams", "venue": "symposium on experimental and efficient algorithms", "year": 2013, "id": "05440797-8533-4496-b6ea-c414a4379fea"}
{"authors": ["Vladimir V. Lukin", "Victor I. Chemerovsky", "Vladimir P. Melnik", "Sari Peltonen", "Pauli Kuosmanen"], "n_citation": 13, "title": "Iterative procedures for nonlinear filtering of images.", "venue": "", "year": 1999, "id": "0558312a-fb1c-47b8-bbd6-e1080ee4d0e4"}
{"authors": ["Thomas Portele", "Silke Goronzy", "Martin Emele", "Andreas Kellner", "Sunna Torge", "J\u00fcrgen te Vrugt"], "n_citation": 50, "references": ["6bb66751-ba4a-4740-9bc6-a41500f33022", "a89dda25-6df0-4efc-bca4-ef78e27d8c8a", "df5af344-3a10-417b-8f9a-1cc7fdf2039c", "f105e516-20b9-4bbb-97db-68ed4b396d31"], "title": "Smartkom-home - an advanced multi-modal interface to home entertainment.", "venue": "conference of the international speech communication association", "year": 2003, "id": "0564b85b-eac4-4a59-951e-3d8badc0c3e7"}
{"abstract": "We present the application of software process modeling and simulation using an agent-based approach to a real case study of soft- ware maintenance. The original process used PSP/TSP; it spent a large amount of time estimating in advance maintenance requests, and needed to be greatly improved. To this purpose, a Kanban system was success- fully implemented, that demonstrated to be able to substantially improve the process without giving up PSP/TSP. We customized the simulator and, using input data with the same characteristics of the real ones, we were able to obtain results very similar to that of the processes of the case study, in particular of the original process. We also simulated, using the same input data, the possible application of the Scrum process to the same data, showing results comparable to the Kanban process.", "authors": ["David J. Anderson", "Giulio Concas", "Maria Ilaria Lunesu", "Michele Marchesi", "Hongyu Zhang"], "n_citation": 19, "references": ["838e45e4-6acf-4762-8840-51b9ca45cc7b", "851fb1f6-fb31-424d-b2ed-dc78ad7a7133", "92da2130-2873-421f-900b-ea9697adca1e", "9c923cfa-f349-4063-a4c5-0b78bef18d53", "ad95051e-603c-4a97-b0fe-67585fae10b9", "bc328964-b2d8-4c18-a11e-6d3e17bd409e", "e54cba34-36b4-4572-9482-cd24e6d9ff09", "f65186e6-fa84-4ef3-8fe9-d139c330b836", "fd8c821b-9b88-4523-bfc4-1622252ed74f"], "title": "A Comparative Study of Scrum and Kanban Approaches on a Real Case Study Using Simulation", "venue": "", "year": 2012, "id": "0572f1eb-2193-4dd6-b32e-b168806a1531"}
{"authors": ["Jeff Conklin", "Susan Leigh Star"], "n_citation": 50, "title": "Panel: Organisational Memory.", "venue": "european conference on computer supported cooperative work", "year": 1991, "id": "059af7d6-e56c-4790-bfc7-13fadd01df05"}
{"authors": ["Philipp Marcus", "Moritz Kessel", "Claudia Linnhoff-Popien"], "n_citation": 13, "references": ["4405ae69-8ae3-4e86-9259-9c5c3d211cf9", "467e0525-1567-43d6-9f47-9a8b4ccff4ad", "6946939e-bdfd-4c24-bb66-97da46ebafa0", "6b1cee08-8df3-42dd-879b-e1a69d070e85", "8cbc12d4-23d6-41b4-9386-cb2fcce447a0", "923fb0b7-fa34-4ad2-8fd4-e3dac99607e7", "97e485ed-fcac-4da8-9a83-b3615d8f0626", "b0d52b8a-a7b1-4feb-b066-c8e47d3bfe6a", "d9820ec9-e4aa-4f52-847e-17d0ee837d73"], "title": "Securing Mobile Device-Based Machine Interactions with User Location Histories", "venue": "security and privacy in mobile information and communication systems", "year": 2012, "id": "05a244dd-3c1b-4131-99d0-3085a1c9cbf7"}
{"authors": ["Jason Cope", "Henry M. Tufo"], "n_citation": 50, "references": ["00733fe9-f946-4777-8bf8-c2b6b1f18741", "073967ef-95fb-4f34-8de6-82dd0fd1aea5", "11dc5180-699a-4065-91ae-aad6b7e548a0", "18fd0fcf-05d2-4af0-9fe8-d2e3e20066f3", "19ca47ba-08b4-41cd-8302-c1d6862f1649", "1c25ba38-01cc-4bdc-a496-314912d5c3be", "214063f7-c5e1-4099-a7f2-5de67cdb99db", "4e3410e1-0f6e-4530-b0bb-b37f5051f219", "9501fa6a-4b22-4ba5-9fef-ff5e20a78b23", "9660d5fa-c6a7-49ce-8460-94e2f6c664b7", "9726dd4c-d85a-40f6-8f63-111ae18e92f2", "9d9f1617-b14c-4fcb-8c4a-501e8cebd6c9", "b49d3cc8-af03-45da-939a-7e796a2fc0e3", "c0fbd059-ec96-4859-acee-1a3d32675722", "c734c405-d1c9-4ffe-b305-481eb0b17a71", "de5a2355-8378-4699-998f-ccf708159d82"], "title": "ADAPTING GRID SERVICES FOR URGENT COMPUTING ENVIRONMENTS", "venue": "international conference on software and data technologies", "year": 2008, "id": "05dd7770-f1d8-4e46-8e06-a4d90ea706b0"}
{"authors": ["Klaus-Dieter Althoff", "Frank Maurer", "Ralph Traph\u00f6ner", "Stefan Wei\u00df"], "n_citation": 0, "title": "Die Lernkomponente der MOLTKE 3 -Werkbank zur Diagnose technischer Systeme.", "venue": "", "year": 1991, "id": "05e43bad-5939-4c38-b856-07cdfe6651fd"}
{"abstract": "Entailment pairs are sentence pairs of a premise and a hypothesis, where the premise textually entails the hypothesis. Such sentence pairs are important for the development of Textual Entailment systems. In this paper, we take a closer look at a prominent strategy for their automatic acquisition from newspaper corpora, pairing first sentences of articles with their titles. We propose a simple logistic regression model that incorporates and extends this heuristic and investigate its robustness across three languages and three domains. We manage to identify two predictors which predict entailment pairs with a fairly high accuracy across all languages. However, we find that robustness across domains within a language is more difficult to achieve.", "authors": ["Manaal Faruqui", "Sebastian Pad\u00f3"], "n_citation": 3, "references": ["484d1994-e9da-477d-9be2-1f1e154cd919", "68453f24-4276-4d0c-b37e-19d23af549be", "71103b6f-e0a7-4eff-9759-b101db960813", "740934af-33dd-4725-9755-5905b5b2950b", "c3f183fc-1f5d-44a9-85c4-c81a03e89586", "c92afebe-c430-4bb8-9ef9-6a46981d2008", "f82b5743-01a4-45f3-bce7-b0ea605b77a1"], "title": "Acquiring entailment pairs across languages and domains: a data analysis", "venue": "", "year": 2011, "id": "05e535a9-2021-4393-a19e-6a0277034323"}
{"authors": ["Guo-Hong Ding", "Yifei Zhu", "Chengrong Li", "Bo Xu"], "n_citation": 14, "title": "Implementing vocal tract length normalization in the MLLR framework.", "venue": "conference of the international speech communication association", "year": 2002, "id": "0602535c-1d37-4e96-9882-9be45ecd334a"}
{"authors": ["John Newman", "Ali Abu-El Humos", "Tesfa Haile", "Hyunju Kim"], "n_citation": 0, "title": "Telecommunication Information Tracking Application.", "venue": "", "year": 2008, "id": "061420be-adce-4a4b-a32e-cd69fad1f2d9"}
{"authors": ["Simone Gaffling", "Florian J\u00e4ger", "Volker Daum", "Miyuki Tauchi", "Elke L\u00fctjen-Drecoll"], "n_citation": 4, "references": ["3a241ddf-3bde-4740-b9fe-d7f8acb5b475", "45e96681-bae7-45cb-86cf-c6f89b96a8a6", "4dd05f61-4df3-482c-8d2f-787a149019c0"], "title": "Interpolation of Histological Slices by Means of Non-rigid Registration", "venue": "", "year": 2009, "id": "06194bd4-c96e-4193-a56f-82b96886e767"}
{"authors": ["Jaewook Chung", "M. Anwar Hasan"], "n_citation": 50, "references": ["b68fc787-7817-421e-8e66-8a98ab9db1ad"], "title": "More Generalized Mersenne Numbers: (Extended Abstract).", "venue": "", "year": 2003, "id": "062b0f9f-b8bb-44aa-995d-893e47fc6187"}
{"abstract": "Resource tagging has become an integral and important feature in enabling community users to easily access relevant content in a timely manner. Various methods have been proposed and implemented to optimize the identification of and access to tags used to characterize resources across different types of social web-based communities. While these user-focused tagging methods have shown promise in their limited application, they do not transfer well to internal business applications where the cost, time, tagged content, and user resources needed to implement them is prohibitive. This paper provides a case study of the process, tools, and methods used to engage users in the development and management of a tag taxonomy (folksontology) used to characterize content in an internal technical support community in the Cisco Global Technology Center.", "authors": ["Donald M. Allen", "Thomas Schneider"], "n_citation": 0, "references": ["4b494e20-c3a2-4ce5-b30f-39cc65467c68", "58a1b425-203d-4692-990b-182f5bf06d85", "8b3d6c32-ead9-4956-a865-62c24fdc5f07", "8b4c7f2c-a96f-4a2e-bf72-37bc684ca721", "a6139ee6-b91b-4e60-9170-2c32e0090abf", "aceb7f01-ad0f-4e5f-a1f5-3f779193c3cb", "cf4616c7-ca42-47b9-9169-b48acadaf93b"], "title": "The role of the community in a technical support community: a case study", "venue": "", "year": 2013, "id": "062d5c3a-c174-46e4-89a4-10bfad040e57"}
{"authors": ["Pascal Nicolas", "Laurent Garcia", "Igor St\u00e9phan"], "n_citation": 0, "references": ["050a45a4-47a6-482f-b7d1-fd364216b025", "2a6f84dd-fa5d-4471-95e3-68af96fd1d36", "5c50a384-c52c-4389-bee4-fc0b4cee9c7b", "adf71b1d-caf5-439b-b9e5-c07f2685b259", "bcb2a694-1be7-498f-96b4-1b02878c9e8e", "c696266d-df8e-4fcb-ba65-e18008ff9356", "db658327-1f48-4f80-8f7d-09d88096f297", "e22908da-10e5-49ec-93ed-2d7b1e1e8da3"], "title": "A possibilistic approach to restore consistency in answer set programming.", "venue": "non-monotonic reasoning", "year": 2004, "id": "06416621-0398-45af-82da-aa80e5fad7ba"}
{"authors": ["Thanh Tra Luu", "Nadia Boukhatem"], "n_citation": 0, "references": [], "title": "Generic IP Signaling Service Protocol", "venue": "", "year": 2005, "id": "064d85e2-8e79-482b-8ffd-9a9a047f3f78"}
{"authors": ["Catarina Lucena", "Joao Sarraipa", "Ricardo Jardim-Goncalves"], "n_citation": 1, "references": ["0e151275-9ec5-4a28-b8bb-95da437c07fb", "53cdb6b9-5815-40b8-a585-82e6bcc0a772", "92a96944-2acd-40fe-94d1-cce8f9644fda", "97ac45dc-20f2-43c2-b89d-7c3ead7026b3", "a1b84695-00d4-4f75-9791-1f7d0008424d", "b440d002-b55b-4acf-a5c3-73ebe407a9d3", "fc5520e7-b30a-4c25-aaa4-00581bd35266"], "title": "Semantic Adaptation of Knowledge Representation Systems", "venue": "doctoral conference on computing, electrical and industrial systems", "year": 2013, "id": "06780863-8bc5-4614-a866-0fe0e45f0f24"}
{"authors": ["Christine Bauer", "Sarah Spiekermann"], "n_citation": 29, "references": ["024de376-3477-41d1-9075-acf633652fea", "04a51ca7-4eab-4227-b14f-b0f7ca8347ad", "081b1c58-3040-4c57-9758-d213c6646b83", "0d19e770-eb9c-4890-9807-939c6c131eb7", "2b8c4575-897f-40ee-8023-9b4ce82f6fce", "59912729-8d73-401d-b622-96914f45138e", "5a3c03e5-8de3-4bfd-ae4b-7cbef45a423b", "684d6dc5-1fc3-4867-8b55-994c079fc882", "779000e1-bfe6-40f7-ac5a-f0f9dab2f9d9", "939bf743-015e-46af-90ec-a2e7bc9423e7", "a8f817e7-756a-4ade-bdbb-9499d24e8c23", "d2f431da-276b-4ded-866a-e55cdd68125f", "d32acd03-508a-4c3d-8b26-170b0c2fe41d", "f4896738-7b31-420e-9b23-6093f05dd8d5", "feddae21-3c05-4743-80fa-b8e101f1b93f"], "title": "Conceptualizing Context for Pervasive Advertising", "venue": "", "year": 2011, "id": "06ea3e80-8ff1-49ae-acc5-516171e36263"}
{"authors": ["Fevzi Belli", "Hinrich E. G. Bonin"], "n_citation": 0, "references": ["4a9503da-e1fc-47d7-aef9-6901833c6e25"], "title": "Einsatz eines Gefahrgut-Informationssystems - Beobachtungen und Konsequenzen f\u00fcr die Weiterentwicklung", "venue": "", "year": 1989, "id": "06edffe0-60f0-45a1-9986-5d4ba41c7f21"}
{"authors": ["Nils Joachim", "Daniel Beimborn", "Tim Weitzel"], "n_citation": 9, "references": ["0eef6869-df60-4dda-a984-ecb1ab8593c1", "2670d639-ef64-420e-adfe-a58f39b5d8fb", "38bf5171-1723-4ed1-970f-d7285e601b89", "440c7fe2-014f-42a5-a60a-a7126ac6818a", "5f1584c0-e0f5-490e-99a2-27585f42eb5d", "758d0bad-c1fd-4c32-b52b-4b46a254b7da", "8e4a5834-8382-47fc-81ff-f26c48b71e94", "904b00a8-6e34-42bc-9b5a-8dd0f7d14711", "917882ba-7729-448c-8d89-86e52c3eb08c", "93eb0792-585b-456e-8bf3-da6b80e71824", "a2034ea1-85a9-4c65-8559-41158ffdcfc2", "a636da6c-f1db-4d8b-a054-4742a637bb5a", "ccfc718e-2fae-4918-bf64-d278cbcd5fba", "d250805c-3a5c-497e-94e6-65e992c74ab5", "d3050483-329b-42d5-ab0b-f3291ade3e13", "d41c5a78-1310-414b-9f4a-dd5a1e29b726", "d885b006-45ff-48cd-91ce-250c13fe2844", "f0e868ea-b60d-48a9-af32-cbbccca0a20a", "ffcaf602-01e0-427d-a913-794af6891da4"], "title": "SOA-Governance f\u00fcr effektive serviceorientierte Architekturen \u2013 Eine empirische Studie in der deutschen Dienstleistungswirtschaft", "venue": "Wirtschaftsinformatik \\/ Angewandte Informatik", "year": 2011, "id": "06f630bc-11c3-4df0-b4f4-d9ff79d55ce0"}
{"abstract": "This paper addresses an optimization-based approach for the design of RF integrated inductors. The methodology presented deals with the complexity of the design problem by formulating it as a multi-objective optimization. The multi-modal nature of the underlying functions combined with the need to be able to explore design trade-offs leads to the use of niching methods. This allows exploring not only the best trade-off solutions lying on the Pareto-optimum surface but also the quasi-optimum solutions that would be otherwise discarded. In this paper we take advantage of the niching properties of lbest PSO algorithm using ring topology to devise a simple optimizer able to find the local-optima. For the efficiency of the process analytical models are used for the passive/active devices. In spite the use of physics-based analytical expressions for the evaluation of the lumped elements, the variability of the process parameters is ignored in the optimization stage due to the significant computational burden it involves. Thus in the final stage both the Pareto- optimum solutions and the quasi-optimum solutions are evaluated with respect to the sensitivity to process parameter variations.", "authors": ["Pedro Pereira", "Fernando Vieira Coito", "M. Helena Fino"], "n_citation": 0, "references": ["1c795eed-d85b-405e-bfc7-8173a1d963d5", "25b84783-26cb-4b0b-9f37-2a42cf67bd76", "bc980aad-d132-417a-9be2-397b46f7d125", "cc59c47e-d690-4a68-85f3-0ec2a4851f4b", "dedc582e-5d73-46e7-8667-0682de05e394"], "title": "PSO-Based Design of RF Integrated Inductor", "venue": "doctoral conference on computing, electrical and industrial systems", "year": 2012, "id": "07157b26-42b5-45d4-b451-c9acfdfcece6"}
{"authors": ["Arun C. Surendran", "Chin-Hui Lee"], "n_citation": 10, "title": "Predictive adaptation and compensation for robust speech recognition.", "venue": "", "year": 1998, "id": "071ce98c-8125-43d8-83c2-3c421774141c"}
{"authors": ["Hsinchun Chen"], "n_citation": 3, "references": ["1bbdd6f1-ab81-4815-bfe3-3fe965a38014"], "title": "From Terrorism Informatics to Dark Web Research", "venue": "", "year": 2011, "id": "07366d12-8ec9-4673-ad17-7a38c426dd49"}
{"authors": ["Dmitry Kropotov", "Dmitry P. Vetrov"], "n_citation": 2, "title": "One Approach to Fuzzy Expert Systems Construction.", "venue": "international conference on enterprise information systems", "year": 2003, "id": "074b2794-468e-4e3d-95ed-669a2e447217"}
{"abstract": "Process-based context-aware applications are increasingly be- coming more complex and dynamic. Besides the large sets of process vari- ants to be managed in such dynamic systems, process variants need to be context sensitive in order to accommodate new user requirements and intrinsic complexity. This paradigm shift forces us to defer decisions to runtime where process variants must be customized and executed based on a recognized context. However, there exists a lack of deferral of the entire process variant configuration and execution to perform an auto- mated decision of subsequent variation points at runtime. In this paper, we present a holistic methodology to automatically resolve process vari- ability at runtime. The proposed solution performs a staged configuration considering static and dynamic context data to accomplish effective de- cision making. We demonstrate our approach by exemplifying a storage operation process in a smart logistics scenario. Our evaluation demon- strates the performance and scalability results of our methodology.", "authors": ["Aitor Murguzur", "Xabier De Carlos", "Salvador Trujillo", "Goiuria Sagardui"], "n_citation": 17, "references": ["0c44460f-f903-491d-86aa-cb9acc6195ce", "1c59b784-f37e-4f91-830a-1854c71a9d67", "1cf5d426-6fcd-4f7e-bea8-47563995fdf1", "1e262154-167f-47a4-863b-bf7090bc12f6", "2183a9e6-5c3e-40c4-9242-ea601dbcf269", "287d3a10-73c3-44b5-afc2-92b344ce55fc", "3ac62a82-475e-436d-9cb2-2ff40e7c52c2", "623f9f85-224d-4e84-83d9-f47ff6fd530a", "6f63bfe9-a11a-4ef9-9fc7-99d844d2dd1f", "74424e38-e59b-434f-b1bd-725e88efa24c", "7cd163f9-71ac-44a7-810d-0dcff00497f0", "c9cf5470-888a-434e-85a6-e27c79094a92", "d22c1316-0dec-489c-b2ae-c678666945be", "ded566c6-89e7-465d-bbfd-a5e0c4546953", "e2f91e8c-b0b9-4ce1-a8b5-e5f28893f483", "f3c71e61-e69d-4411-bda1-d63c988507b1", "fac86b5d-de78-4185-9f40-b8309796f067", "ff7adeba-edb8-4b2d-a8d4-71afaf90f285"], "title": "Context-Aware Staged Configuration of Process Variants@Runtime", "venue": "conference on advanced information systems engineering", "year": 2014, "id": "074ff4d0-27b3-4854-8996-0c7adff14ce8"}
{"authors": ["Michael T. Goodrich", "Roberto Tamassia"], "n_citation": 383, "title": "Data structures and algorithms in Java (3. ed.)", "venue": "", "year": 2003, "id": "077f98c2-4f57-4dcc-96ba-2268e26590ad"}
{"authors": ["Arno Rolf", "Dirk Siefkes"], "n_citation": 0, "title": "\u00d6kologische Orientierung in der Informatik", "venue": "", "year": 1994, "id": "07aa345d-3339-4887-a57b-8ec6bdc3114a"}
{"abstract": "We investigate the problem of inserting rhetorical predicates (e.g. \"to present\", \"to discuss\", \"to indicate\", \"to show\") during non extractive summary generation and compare various algorithms for the task which we trained over a set of human written summaries. The algorithms which use a set of features previously introduced in the summarization literature achieve between 57% to 62% accuracy depending on the machine learning algorithm used. We draw conclusions with respect to the use of context during predicate prediction.", "authors": ["Horacio Saggion"], "n_citation": 0, "references": ["135c7d8b-578a-462d-98d0-0288eec3a9fc", "2616451f-9c95-4137-8868-459a58df74e5", "e96f028e-c688-4f2c-87c2-f85862587f0a", "f6ce8b22-b33a-4ffc-9137-1afc40e2aaab"], "title": "Inserting rhetorical predicates for quasi-abstractive summarization", "venue": "", "year": 2010, "id": "07b09815-8c3c-4247-a2c8-f49f82459f9d"}
{"authors": ["Mira Balaban", "Azzam Maraee"], "n_citation": 17, "title": "A UML-Based Method for Deciding Finite Satisfiability in Description Logics.", "venue": "", "year": 2008, "id": "07c690b1-a0a4-4c3b-83d8-a05a8950ed1b"}
{"authors": ["Li Zhang"], "n_citation": 0, "references": ["4272b80d-a4d9-4a89-bf8f-60d23bbd6d04", "55c92fa1-96ed-4bda-96c7-803900e9b783", "72452f5e-c1e1-4675-8fd8-25b70690e1f0", "86f95aae-4e69-4d3e-9e8e-08b151a528ea"], "title": "The Design and Completion of Jiangsu Tourism Q&A System", "venue": "", "year": 2013, "id": "07d5c3e9-06d7-4c6d-8466-99305999cd07"}
{"abstract": "Gene tree parsimony (GTP) problems infer species supertrees from a collection of rooted gene trees that are confounded by evolutionary events like gene duplication, gene duplication and loss, and deep coalescence. These problems are NP-complete, and consequently, they often are addressed by effective local search heuristics that perform a stepwise search of the tree space, where each step is guided by an exact solution to an instance of a local search problem. Still, GTP problems require rooted input gene trees; however, in practice, most phylogenetic methods infer unrooted gene trees and it may be difficult to root correctly. In this work, we (i) define the first local NNI search problems to solve heuristically the GTP equivalents for unrooted input gene trees, called unrooted GTP problems, and (ii) describe linear time algorithms for these local search problems. We implemented the first NNI based local search heuristics for unrooted GTP problems, which enable analyses for thousands of genes. Further, analysis of a large plant data set using the unrooted NNI search provides support for an intriguing new hypothesis regarding the evolutionary relationships among major groups of flowering plants.", "authors": ["Pawe\u0142 G\u00f3recki", "J. Gordon Burleigh", "Oliver Eulenstein"], "n_citation": 14, "references": ["5e593712-4f16-4542-a2af-95dd6213302a", "68b52750-ad96-4b14-bd94-a669f0200e93", "8559019b-05c6-4435-bf93-8f1e017c7f6d", "8a9a5557-a600-4258-8a1f-42720106c986", "a342e039-96b4-4e56-acbc-c8064bca6787", "af77fabb-5d9a-4f8c-901a-80867cbfe939", "c292a7c3-417c-4824-a50b-fdbd69bcc15f", "d5193ddf-2539-4aeb-85cd-3d4438b50dc7", "f3f78c6c-0060-4705-b062-d7cfe6edee26"], "title": "GTP supertrees from unrooted gene trees: linear time algorithms for NNI based local searches", "venue": "international symposium on bioinformatics research and applications", "year": 2012, "id": "07de0f5d-2770-4950-affa-28f03dbc3c29"}
{"authors": ["J.C. Walraven", "J.W.A.M. Alferdinck"], "n_citation": 36, "title": "Color displays for the color blind.", "venue": "color imaging conference", "year": 1997, "id": "07de159b-ea9a-44cb-a040-9f295c9867d2"}
{"authors": ["Richard Sproat", "Julia Hirschberg", "David Yarowsky"], "n_citation": 97, "title": "A corpus-based synthesizer.", "venue": "", "year": 1992, "id": "07e69de2-70f9-4e4c-b1de-fa3a92b63d73"}
{"authors": ["Robert Warrender", "David Nelson", "Sue Stirk"], "n_citation": 0, "title": "Database Interoperability using a Database's own Natural Query Language.", "venue": "british national conference on databases", "year": 2003, "id": "07ea5ba4-3bba-43a1-8044-8249de92fd3b"}
{"authors": ["Maik Herfurth", "Thomas Schuster", "Peter Wei\u00df"], "n_citation": 0, "references": ["7384c8dd-c89b-401f-b893-ba419d4d32ff", "eafe9070-ec42-4439-96db-5e2cf7d3a0f7"], "title": "Simulation-Based Service Process Benchmarking in Product-Service Ecosystems", "venue": "working conference on virtual enterprises", "year": 2013, "id": "07f339ca-50c9-43c0-b299-a6860b4baf74"}
{"abstract": "We propose and show a parallel and distributed runtime environment for multi-agent systems that provides spatial agent migration ability by employing code morphing. The focus of the application scenario lies on sensor networks and low-power, resource-aware single System-On-Chip designs. An agent approach provides stronger autonomy than a traditional object or remote-procedure-call based approach. Agents can decide for themselves which actions are performed, and they are capable of reacting on the environment and other agents with flexible behaviour. Data processing nodes exchange code rather than data to transfer information. A part of the state of an agent is preserved within its own program code, which also implements the agent's migration functionality. The practicability of the approach is shown using a simple distributed Sobel filter as an example.", "authors": ["Stefan Bosse", "Florian Pantke", "Frank Kirchner"], "n_citation": 50, "references": ["a4d227fc-da17-4bd8-996d-9053c3a03e2f"], "title": "Distributed computing in sensor networks using multi-agent systems and code morphing", "venue": "international conference on artificial intelligence and soft computing", "year": 2012, "id": "07f6d4ba-fb98-4988-bf9a-79225234ea1d"}
{"abstract": "Introduction: Public health surveillance systems need to be refined. We intend to use a generic approach for early identification of patients with severe influenza-like illness (ILI) by calculating a score that estimates a patient\u2019s disease-severity. Accordingly, we built the Intelligent Severity Score Estimation Model (ISSEM), structured so that the inference process would reflect experts\u2019 decisionmaking logic. Each patient\u2019s disease-severity score is calculated from numbers of respiratory ICD9 encounters, and laboratory, radiologic, and prescription-therapeutic orders in the EMR. Other ISSEM components include chronic disease evidence, probability of immunodeficiency, and the provider\u2019s general practice-behavior patterns. Results: Sensitivity was determined from 200 randomly selected patients with upper- and lowerrespiratory tract ILI; specificity, from 300 randomly selected patients with URI only. For different age groups, ISSEM sensitivity ranged between 90% and 95%; specificity was 72% to 84%. Conclusion: Our preliminary assessment of ISSEM performance demonstrated 93.5% sensitivity and 77.3% specificity across all age groups. Background", "authors": ["Zaruhi R. Mnatsakanyan", "Daniel J. Mollura", "John R. Ticehurst", "Mohammad Reza Hashemian", "Lang M. Hung"], "n_citation": 10, "references": ["156d2884-bfd1-4487-ad05-308b73963e0b", "56504a00-421f-4a0a-a00d-65c6c941608b", "689d3492-d394-4bc4-bd62-d21e6f876f31"], "title": "Electronic Medical Record (EMR) Utilization for Public Health Surveillance", "venue": "", "year": 2008, "id": "07fe8b6f-a9f5-4119-bbc5-5598d89b2c1e"}
{"authors": ["Jarom\u00edr Savelka"], "n_citation": 1, "references": ["29f196b0-3df4-43c9-bf33-6411f5adf879", "5ffc5bea-a503-46ab-af8f-652eeb8a770b", "9e529d7c-0531-4545-a2e6-2666a57f2426", "c6301afc-201d-4416-acff-f2f125dc235f", "ee02d177-32aa-40f7-8d1b-f98851ec233a"], "title": "Coherence as Constraint Satisfaction: Judicial Reasoning Support Mechanism.", "venue": "", "year": 2013, "id": "0832a3b8-fb85-4b19-8d4e-0d22c370227f"}
{"authors": ["Damaso Perez-Moneo Suarez", "Claudio Rossi"], "n_citation": 50, "references": ["38252f11-1931-4fd3-a99a-216d54384de8", "96824d4e-c386-4ceb-a682-98b4377f2726", "b6df584b-80e4-4818-9103-8ce733d6793b", "ba4e22e2-e912-4ec9-94ea-18e0197cf683", "ca2f264c-21f4-4ce3-ad9a-4b6b4d4d706b", "d53d36ff-2a2d-4349-b6a1-44da48eea179", "fb88eb90-b28a-4911-84f4-43bf6711d744", "fd444ee7-569c-4b0a-bdb9-3b8f773c0bae"], "title": "Evolutionary Learning of Basic Functionalities for Snake-Like Robots", "venue": "Robot", "year": 2014, "id": "084fb561-f6c8-4ab6-a47b-0b6d973f7f7e"}
{"abstract": "Data skewness is a challenge encountered, in particular, when apply- ing supervised machine learning approaches in various domains, such as in healthcare and biomedical information engineering. Evidence Based Medicine (EBM) is a clinical strategy for prescribing treatment based on current best evi- dence for individual patients. Clinicians need to query publication repositories in order to find the best evidence to support their decision-making processes. This sophisticated information is materialised in the form of scientific artefacts in scholarly publications and the automatic extraction of these artefacts is a technical challenge for current generic search engines. Many classification ap- proaches have been proposed for identifying key scientific artefacts in EBM, however their performance is affected by the imbalanced characteristic of data in this domain. In this paper, we present four data balancing approaches applied in a binary ensemble classifier framework for classifying scientific artefacts in the EBM domain. Our balancing approaches improve the ensemble classifier's F-score by up to 15% for classes of scientific artefacts with extremely low cov- erage in the domain. In addition, we propose a classifier selection method for choosing the best classifier based on the distributional feature of classes. The resulting classifiers show improved classification performances when compared to state of the art approaches.", "authors": ["Hamed Hassanzadeh", "Tudor Groza", "Anthony Nguyen", "Jane Hunter"], "n_citation": 3, "references": ["03299260-9046-4b00-b1f0-6fe94c6bee31", "0ce65577-0bcd-418a-990e-2866cd3d6914", "2076f2d8-e5eb-4f82-98ae-0cc80f69c0fb", "2e747b99-e8d9-4983-9e0d-8c316484dc2c", "4435e965-4037-4be0-84c8-fb12fc6e9df3", "5ccce3c6-6967-41c5-a266-1f19b9f3595f", "5e148b25-36a0-4715-b14c-08a2ea6edadc", "6f620bdf-5879-4e2e-9c2c-ab3cd2f9eff7", "9742db56-9481-414f-9f78-c8f1ad4f8688", "aee42a83-57cf-4624-8579-c1a81b2af264", "af647f42-0b8d-480b-a36e-c7f351a95473"], "title": "Load Balancing for Imbalanced Data Sets: Classifying Scientific Artefacts for Evidence Based Medicine", "venue": "pacific rim international conference on artificial intelligence", "year": 2014, "id": "08633eb6-25d0-45c7-b2c3-219e0b7248a4"}
{"authors": ["Yuu Tanaka", "Atsushi Yamashita", "Toru Kaneko", "Kenjiro T. Miura"], "n_citation": 8, "references": ["1bb2e8bc-0dba-4a40-bf0f-75d7c6d32ae3", "750dfaaf-c536-4122-b850-b30ec6633119", "c79fa5f7-bd43-4fb6-97cc-e1c56e044062", "e4157601-20e1-4795-89a8-81e7d09fab85"], "title": "Restoration of Images Stained with Waterdrops on a Protection Glass Surface by Using a Stereo Image Pair.", "venue": "Journal of Machine Vision and Applications", "year": 2005, "id": "086402d3-4f8b-40fd-b1ad-19c07deb2c08"}
{"abstract": "Distributed computing systems are of huge importance in a number of recently established and future functions in computer science. For example, they are vital to banking applications, communication of electronic systems, air traf\ufb01c control, manufacturing automation, biomedical operation works, space monitoring systems and robotics information systems. As the nature of computing comes to be increasingly directed towards intelligence and autonomy, intelligent computations will be the key for all future applications. Intelligent distributed computing will become the base for the growth of an innovative generation of intelligent distributed systems. Nowadays, research centres require the development of architectures of intelligent and collaborated systems; these systems must be capable of solving problems by themselves to save processing time and reduce costs. Building an intelligent style of distributed computing that controls the whole distributed system requires communications that must be based on a completely consistent system. The model of the ideal system to be adopted in building an intelligent distributed computing structure is the human body system, speci\ufb01cally the body\u2019s cells. As an arti\ufb01cial and virtual simulation of the high degree of intelligence that controls the body\u2019s cells, this chapter proposes a Cell-Oriented Computing model as a solution to accomplish the desired Intelligent Distributed Computing system.", "authors": ["Ahmad Karawash", "Hamid Mcheick", "Mohamed Dbouk"], "n_citation": 0, "references": ["02cb4167-1568-4833-ad80-e6d56053bf4d", "0f9558a8-a990-40a7-a550-c790eb8f2591", "12311ca4-714e-4f98-98cf-9fc0b7f18e80", "1661a38e-2c43-4f5c-b1f9-7ddb5aa3d9cc", "16f60c39-a919-4d9b-9574-4d774f2e8cee", "4c5376db-0e69-4a2f-8acd-1993525d4d79", "7a2fccd2-ce51-4b09-9f76-2e002fb4be8e", "b30da332-fe9d-440c-8b42-b9e25310f737", "bb2caec9-4ddc-4d01-a059-dcb2bd28416e", "cd3a4006-a0cc-4292-bfb9-f3d77d512768", "d6aaf578-98ee-49ac-9b44-dcd23fc6f847", "dc0c45ea-ea2c-4299-9bb6-d9fd98ea3037"], "title": "Towards intelligent distributed computing : cell-oriented computing", "venue": "", "year": 2015, "id": "086c091e-d905-4f1c-9385-eec41ad55723"}
{"abstract": "In this paper we re-examine the well known problem of asynchronous black hole search in a ring. It is well known that at least 2 agents are needed and the total number of agents' moves is at least \u03a9(n log n); solutions indeed exist that allow a team of two agents to locate the black hole with the asymptotically optimal cost of \u0398(n log n) moves.#R##N##R##N#In this paper we first of all determine the exact move complexity of black hole search in an asynchronous ring. In fact, we prove that 3n log3 n-O(n) moves are necessary. We then present a novel algorithm that allows two agents to locate the black hole with at most 3n log3 n + O(n) moves, improving the existing upper bounds, and matching the lower bound up to the constant of proportionality. Finally we show how to modify the protocol so to achieve asymptotically optimal time complexity \u0398(n), still with 3n log3 n + O(n) moves; this improves upon all existing time-optimal protocols, which require O(n2) moves. This protocol is the first that is optimal with respect to all three complexity measures: size (number of agents), cost (number of moves) and time; in particular, its cost and size complexities match the lower bounds up to the constant.", "authors": ["Balasingham Balamohan", "Paola Flocchini", "Ali Miri", "Nicola Santoro"], "n_citation": 10, "references": ["084fdbdf-147e-40c9-bbde-3f402e70aee0", "0863919a-7f04-422f-a3fb-f32451886d06", "0e34dac8-fbb0-45e1-95e3-351b3f4489a1", "14e44f98-d133-4f6e-b27e-9cb770fdb68d", "1fe312d0-b1bb-495d-add2-cfc74dd7fee8", "28fd05bd-40c6-4449-b2d8-f7043e45540e", "29292e0c-b4ca-440f-bb34-9244f4ee91ae", "2ed9dca1-26a1-438d-9991-f7e1ab3f569d", "4835d03a-3f83-46cc-a273-381200f612f0", "538d2009-f810-495d-a30e-d626ba893ca9", "723c59a7-9faf-4b3b-bb66-ff250e5414f8", "74968918-a562-4a00-9531-a9cde2e55879", "80abf684-d4b9-4b6b-be8e-bef94437484c", "842f4121-d4c4-4e30-b71e-21157f999234", "8c319c10-0b45-4807-b0ea-e034107df31f", "8f1f4c71-0ba2-4407-99ce-b6fe0e1b9697", "bca41329-1f39-4929-957d-581675aa24a1", "e87a9331-c89b-4d5b-a754-952477b7ab10", "eeb4b412-6675-4db7-890e-03913c9774ed", "fa6e1cca-0703-4229-803d-274ee88f7b81"], "title": "Improving the optimal bounds for black hole search in rings", "venue": "", "year": 2011, "id": "08785973-8224-40f9-bf67-324cfb78238b"}
{"abstract": "This paper presents WorkCellSimulator, a software platform that allows to manage an environment for the simulation of robot tasks. It uses the most advanced artificial intelligence algorithms in order to define the production process, by controlling one or more robot manipulators and machineries present in the work cell. The main goal of this software is to assist the user in defining customized production processes which involve specific automated cells. It has been developed by IT+Robotics, a spin-off company of the University of Padua, founded in 2005 from the collaboration between young researchers in the field of Robotics and a group of professors from the Department of Information Engineering, University of Padua.", "authors": ["Stefano Tonello", "Guido Piero Zanetti", "Matteo Finotto", "Roberto Bortoletto", "Elisa Tosello", "Emanuele Menegatti"], "n_citation": 50, "references": ["6f77b214-9d71-41c8-b51a-3dbff153ad5a", "882f7993-a554-4c64-9b46-cabf492e95da", "90381473-5ab7-4137-a716-6992c9b93f55", "fd5c3e36-a94c-42c8-8ce3-c01ef4420dbb"], "title": "WorkCellSimulator: a 3d simulator for intelligent manufacturing", "venue": "simulation, modeling, and programming for autonomous robots", "year": 2012, "id": "0880ff73-c71c-4eb4-9927-c410300b59f8"}
{"authors": ["Vadim Ermolayev", "Frank Dengler", "Eyck Jentzsch", "Wolf-Ekkehard Matzke"], "n_citation": 0, "references": ["0547383e-7c8d-4823-9f41-411c3b2ed50a", "2f2944f6-013a-4fb0-9746-32cc31df1de9", "3da4eebe-2f00-4f01-b6dd-edc8245204cf", "595ca2cb-dae0-4a84-8b47-ae1120dcd2af", "60f5be67-f697-49a2-9f1f-e97a51bcbeb8", "8f0ee7cd-1998-439c-8dfa-f48a3adfb41a", "8f9e4cd6-8020-4ffd-be5d-c65196f9eae7", "9baca3cb-d6df-4668-a14f-c99cd4c79fd8", "9d79fa25-0da2-4189-850b-def8223867fc", "c8ddb4b8-8423-4706-b229-1fdff37c6244"], "title": "Articulation and Sharing of Distributed Design Project and Process Knowledge", "venue": "", "year": 2010, "id": "08b217c7-b56f-46fa-8e04-c4e3ec1ba631"}
{"authors": ["Eunsung Kim", "Hyoung-Woo Park", "Sangsan Lee", "Jin-Wook Chung"], "n_citation": 0, "title": "Third-party Multitransfer for the Efficient Distribution and Deployment of High Volume Data in the Grid.", "venue": "", "year": 2003, "id": "08b481f6-397a-4586-9342-bbf5dcada9c9"}
{"abstract": "Unsupervised keyphrase extraction techniques generally consist of candidate phrase selection and ranking techniques. Previous studies treat the candidate phrase selection and ranking as a whole, while the effectiveness of identifying candidate phrases and the impact on ranking algorithms have remained undiscovered. This paper surveys common candidate selection techniques and analyses the effect on the performance of ranking algorithms from different candidate selection approaches. Our evaluation shows that candidate selection approaches with better coverage and accuracy can boost the performance of the ranking algorithms.", "authors": ["Rui Wang", "Wei Liu", "Chris McDonald"], "n_citation": 50, "references": ["05fdccf2-3ead-40f5-b336-611f579d548f", "0895c22d-37c5-4c8f-9202-a32ebd2cb0c0", "17d7af76-386c-4094-9f45-2d5f975c3c4d", "39058eb5-778f-41eb-85aa-fc630f5c2d92", "50d272c7-2d9c-405c-8b37-510bd1098398", "5317fbe4-f12c-414c-93e3-2bb094131ddd", "634c5fbb-bcda-44bc-93e2-e140cd139afe", "65b66d17-3e07-4bba-863f-cbb1e46b8160", "673d71b8-b693-4e62-b409-028435c8bbe3", "737eda32-47a4-430a-9797-8558d5985835", "7e1ecd3f-f88e-4e9a-a1d2-7d5ab6cf5e64", "9686b6c4-dfd5-4641-9b99-1fc508a334e4", "9fa870d5-b145-4c7e-aa11-dc37c9421497", "a7761d31-5e2a-45a3-ae7b-d95694a8ab0f", "c7e4e04b-45da-4bae-8c8a-d17ca0087361", "d8aaf2f4-06f1-4e01-8146-d71744b3cb68", "e11f7035-2fe4-48a9-bafa-db2fb5ab7a58", "e3268ea5-cb63-46a2-9c50-c2b5c708f27b", "f405e3e3-2bb8-43c0-abf4-bb6a4a59ffa2"], "title": "How Preprocessing Affects Unsupervised Keyphrase Extraction", "venue": "international conference on computational linguistics", "year": 2014, "id": "08b6e1fd-b9da-4fe3-8c3e-7bdaedca19b3"}
{"authors": ["Philip J. Murphy", "Naicong Li", "Roy C. Averill-Murray", "Paul Burgess", "Nathan W. Strout"], "n_citation": 3, "references": ["870670f0-47e8-446b-8be1-f044131ad41f"], "title": "Smart Knowledge Capture for Developing Adaptive Management Systems", "venue": "", "year": 2008, "id": "08cb9566-92f6-45a0-92c0-ac831455cf0a"}
{"authors": ["Junji Tomita", "Genichiro Kikui"], "n_citation": 12, "references": ["24c2864a-61af-4473-ba13-4850e7602f68", "e9abffef-c6bf-44da-a673-be480773dbbb"], "title": "Interactive Web Search by Graphical Query Refinement.", "venue": "international world wide web conferences", "year": 2001, "id": "08eeae5a-bd73-452b-b4a8-bd7186ca8693"}
{"authors": ["Thomas Fuhrmann"], "n_citation": 0, "references": ["4edf5ca9-1d53-4f00-b26c-81fa4061abdb", "7f9d2a8a-12d1-4944-8c82-99eade0d7442", "80a9f383-ff93-4afa-b650-a98724490fc5"], "title": "Software Engineering for Ambient Intelligence Systems.", "venue": "", "year": 2006, "id": "09000f69-1dd2-4808-89ed-62f77fd12f8c"}
{"authors": ["P. K. A. Menon", "Vipin Chaudhary", "James G. Pipe"], "n_citation": 5, "title": "Parallel algorithms for deblurring of MR images.", "venue": "computers and their applications", "year": 1998, "id": "090dcf97-39d3-45f9-9e72-97dca352d30a"}
{"abstract": "We propose an indexing data structure based on a novel variation of Bloom filters. Signature files have been proposed in the past as a method to index large text databases though they suffer from a high false positive error problem. In this paper we introduce COCA Filters, a new type of Bloom filters which exploits the co-occurrence probability of words in documents to reduce the false positive error. We show experimentally that by using this technique we can reduce the false positive error by up to 21.6 times for the same index size. Furthermore Bloom filters can be replaced by COCA filters wherever the co-occurrence of any two members of the universe is identifiable.", "authors": ["Kamran Tirdad", "Pedram Ghodsnia", "J. Ian Munro", "Alejandro L\u00f3pez-Ortiz"], "n_citation": 0, "references": ["15ea05e5-6f54-4572-973b-a7ec37f5bd26", "1601695a-dffe-4f9a-8dba-97ceb5de317e", "233bba97-2ca8-480c-95d6-e41269ae73d6", "235c6719-c3dd-4700-a43b-404bb6bd7f48", "5d6913f3-c1ef-4c34-8ee9-b985324ab970", "5fa02a95-51ad-4cca-83b0-1e55187ecea7", "67b5e105-ec80-4edc-aca2-637cf8ae439c", "6979da37-9cdf-49f2-bb90-616b4a5501b5", "74de9f8a-ef46-4dfe-8178-44269c6cd77c", "7ec4fe78-80e2-4831-9f33-9cc49dfaa53a", "8fc0f295-5cec-4698-8da1-2a592663f9d5", "a8da49e6-f1f7-4d71-a205-f1021c24bc69", "ae173085-8451-46d2-bc88-362590d9d905", "b1dedeb6-d7d4-4b6a-92a7-c3728c2e215e", "bec8659e-64c8-4614-adc1-7567b8e93d75", "cc9efe76-4069-40b4-971c-e07c0bb765b2", "e568f435-4be6-45ca-bcc9-30d85a98d677", "e69a0ee3-9e25-494a-9fb1-2d182ca148e4", "ebf47a36-9ca1-46e7-b705-585d57aedcd4", "eedfaee1-a3cb-4589-930c-66709d1c7fff", "f019b456-3fcf-4cf6-ba93-99284af888d6"], "title": "COCA filters: co-occurrence aware bloom filters", "venue": "string processing and information retrieval", "year": 2011, "id": "091092e0-c559-4e90-8bdc-055ac86530a1"}
{"authors": ["Werner Horn"], "n_citation": 0, "title": "Special issue on causal modeling: Preface.", "venue": "Applied Artificial Intelligence", "year": 1989, "id": "092bdf49-c5fc-4183-a027-b54c4addcdae"}
{"authors": ["Alexander Redei", "Ed Tumbusch", "Josh Koberstein", "Sergiu M. Dascalu", "C Frederick Harris"], "n_citation": 0, "references": [], "title": "AVRATAR: A virtual environment for puppet animation.", "venue": "software engineering and data engineering", "year": 2007, "id": "092cb622-f417-4220-b010-e0964a9d0181"}
{"authors": ["Anna Rumshisky", "Patrick Hanks", "Catherine Havasi", "James Pustejovsky"], "n_citation": 50, "references": ["628b37c7-ad0d-47b0-8d05-35ef3781c03c", "ae03012a-61fd-4a6c-b5c0-e04c4e08d82d", "e0a68aa2-88c9-4c16-8e74-943107434fea", "e9259a46-84fe-4b3b-8cd7-d8d97855a313"], "title": "Constructing a Corpus-based Ontology Using Model Bias.", "venue": "the florida ai research society", "year": 2006, "id": "092edef1-8e7d-44eb-8126-49443b689aba"}
{"authors": ["Abdelkader Adla"], "n_citation": 0, "title": "INTEGRATING AGENTS INTO COOPERATIVE INTELLIGENT DECISION SUPPORT SYSTEMS", "venue": "international conference on enterprise information systems", "year": 2007, "id": "09358f7b-d236-41f1-879d-e6f9eb5444d2"}
{"authors": ["Paolo Renna"], "n_citation": 0, "references": ["07fca525-0c1e-45e5-83f4-53a286c750b1", "30e9c3d0-aa6f-4db2-8c1d-62b661fb521d", "4a163178-9b23-4ab7-9af4-950ff94ef4b6", "7357abf6-f160-49e7-8795-ac51e3fa883d", "8e63f343-19bd-46da-be3c-bcaa35ad6783", "a54abad3-4b35-4c12-9658-90786d17cf3b"], "title": "Integrating ERP with Negotiation Tools in Supply Chain", "venue": "", "year": 2014, "id": "095b4635-4b05-47fe-ab7f-52beaaae8e46"}
{"authors": ["Ory Chowaw-Liebman", "Karl-Heinz Krempels", "Janno von St\u00fclpnagel", "Christoph Terwelp"], "n_citation": 1, "references": ["06d5ee43-254e-4c7c-a401-b6bc29b08579", "1bc1923c-5602-446a-83f8-c3ddbf401aa6", "36145380-2c07-4da1-acac-1fc17da09253", "a505497e-cca6-4406-a6bd-7bf284630fd9", "c146fe70-b870-4da0-b3b9-0a39eaaa6a38", "c5c16b04-86af-4f2b-a309-f31409c9f8ff", "dea661a6-5d9c-4d97-9d51-d3dc08d971d6"], "title": "INDOOR NAVIGATION USING APPROXIMATE POSITIONS", "venue": "international conference on wireless information networks and systems", "year": 2009, "id": "095c0854-cbf7-4be7-b2c5-f57dd72f7237"}
{"authors": ["Davy Van Nieuwenborgh", "Stijn Heymans", "Dirk Vermeir"], "n_citation": 0, "references": ["03492901-5505-421d-8482-8763b715bde1", "66af02bc-ff71-4504-9425-53227b29573b", "aa528e2a-3389-497e-9f77-4ac6765e3035", "c5e6c207-d985-4e9b-8a70-4ab7458d8996", "e22908da-10e5-49ec-93ed-2d7b1e1e8da3", "f9753efa-33bd-4264-ac60-f540cbeb4c8e", "fdbe5f54-0e72-4ecd-ae22-f378a321267f"], "title": "Intelligence Analysis Using Quantitative Preferences.", "venue": "", "year": 2005, "id": "0976a3ab-a764-421f-97fe-8b9a270671d8"}
{"authors": ["Ren\u00e9 Krenz", "Elena Dubrova", "Andreas Kuehlmann"], "n_citation": 6, "references": ["34b259b2-8c1b-4df0-bd65-cbc3536bc826", "6ec12ff5-7f3b-4668-a5cf-9808323d956a", "763d79d6-2777-4782-a13b-c9a0ee86bcb7", "8d432896-b75e-4ae1-8380-2c493abfdbee", "8d4ba580-4531-4696-b59f-eff201135bf4", "8d6dc616-8728-49a3-8962-71a2530d16bc", "90571887-c29a-4df4-aded-087323d7b34b", "97acc40c-0d4f-4a42-bee4-da688c5af45c", "a47ef242-d9c0-486f-a939-c980434d3008", "b86000a2-cd6f-4669-935c-4a2468fd210b", "cd8113c3-39d4-49e0-872e-c91bc4de33bd", "d09ce98d-6d72-412d-ae30-dc4016d6d11b", "db36aaa7-21d9-4618-a55d-1a324816a81c", "e73667e9-deaa-48aa-a575-a0f8d17d7ad2", "efc211ac-e3f1-4ebe-a0b1-3858a09dd0b2", "f75bcadd-313e-420f-8d7d-7bab40a87c4c", "fa2a95dc-be2d-46a5-9867-5cbf4d0b9e61"], "title": "Circuit-Based Evaluation of the Arithmetic Transform of Boolean Functions.", "venue": "", "year": 2002, "id": "099d8c2e-f02a-4a67-89a3-ab5819231baf"}
{"abstract": "The Shared Pathology Informatics Network (SPIN), a research initiative of the National Cancer Institute, will allow for the retrieval of more than 4 million pathology reports and specimens. In this paper, we describe the special query tool as developed for the Indianapolis/Regenstrief SPIN node, integrated into the ever-expanding Indiana Network for Patient care (INPC). This query tool allows for the retrieval of de-identified data sets using complex logic, auto-coded final diagnoses, and intrinsically supports multiple types of statistical analyses. The new SPIN/INPC database represents a new generation of the Regenstrief Medical Record system \u2013 a centralized, but federated system of repositories.", "authors": ["Clement J. McDonald", "Paul R. Dexter", "Gunther Schadow", "Henry C. Chueh", "Greg Abernathy", "John Hook", "Lonnie Blevins", "J. Marc Overhage", "Jules J. Berman"], "n_citation": 20, "references": ["65456e87-e013-405e-b559-1e4a20dce049", "fd785487-4157-47c5-9593-b547fc288b69"], "title": "SPIN Query Tools for De-identified Research on a Humongous Database", "venue": "", "year": 2005, "id": "09bd2488-93ff-43e2-bac9-9ff2a9ec1fd5"}
{"abstract": "Modular exponentiation is a cornerstone operation to several public-key cryptography systems such as the RSA. It is performed using successive modular multiplications. The latter is time consuming for large operands. Accelerating public-key cryptography software or hardware needs reducing the total number of modular multiplication needed. This paper introduces a novel idea based on genetic algorithms for evolving an optimal addition chain that allows one to perform precomputations necessary in the window modular exponentiation methods. The obtained addition chain allows one to perform exponentiation with a minimal number of multiplication and hence implementing efficiently the exponentiation operation. We compare our results with those obtained using the algorithm of Brun.", "authors": ["Nadia Nedjah", "Luiza de Macedo Mourelle"], "n_citation": 1, "references": ["3fb43b00-905c-4a08-934d-198ea4eb66c3", "9b80e173-2d0d-4e2d-8cd0-0fcfe230fd81", "bacd65d3-a4e3-499b-9b30-81dbe60ea12b", "eff76af4-9137-46e1-a630-2b0ddb51e66a"], "title": "AST Pre-Processing For The Sliding Window Method Using Genetic Algorithms.", "venue": "The International Journal of Computers, Systems and Signal", "year": 2003, "id": "09ce5481-a5ec-4a05-99fe-7c9232f3a15c"}
{"abstract": "This paper presents the systems that we participated with in the Semantic Text Similarity task at SEMEVAL 2012. Based on prior research in semantic similarity and relatedness, we combine various methods in a machine learning framework. The three variations submitted during the task evaluation period ranked number 5, 9 and 14 among the 89 participating systems. Our evaluations show that corpus-based methods display a more robust behavior on the training data, yet combining a variety of methods allows a learning algorithm to achieve a superior decision than that achievable by any of the individual parts.", "authors": ["Carmen Banea", "Samer Hassan", "Michael Mohler", "Rada Mihalcea"], "n_citation": 50, "references": ["01b486c4-8955-403b-a0c6-1de74298b215", "11d6d688-f542-4d4e-8a9e-50150c7f08e3", "1268112c-a3a5-411d-9469-c9937aed533e", "1ce7a9a3-91c4-45d6-984a-e1d240fd81aa", "1f73723c-b904-4d93-8045-d8de3772fb27", "2e5b14fa-c54a-4191-9711-6dda5f0eb75d", "4a23bcc9-2320-4889-b7c3-6c01f4204051", "540f653d-dc81-4160-9755-3cd96bc46bb0", "73f6b15e-509c-4f2f-9160-35cab954ce59", "785adb42-a91c-485d-866c-69385a666083", "7e4dba22-3e36-462f-9220-a8ccd8b75bd4", "8026f56a-a93e-4933-8ead-c9aa9e3f0498", "8876115b-93b8-4f61-b5b2-46e9e273b74b", "892d5d27-8e30-4ab2-b157-3eb1639e2a1d", "aafffa69-1bc3-4d18-8f3b-296c03a13557", "adaaafab-aa7a-4b1e-842d-e29c8c2f049b", "b23adb78-65ed-4bbb-bce9-fdd70d14699e", "b855e4aa-03af-4fda-95a9-269138319fc1", "ccd672d4-2f77-471e-abfc-cae8abd6ec16", "cd34e1c4-2cdb-42b6-bb14-ee7cea07f58b"], "title": "UNT: A Supervised Synergistic Approach to Semantic Text Similarity", "venue": "north american chapter of the association for computational linguistics", "year": 2012, "id": "09d09df9-c52b-42dd-8b7c-05c902697027"}
{"authors": ["Arvind Hulgeri", "Gaurav Bhalotia", "Charuta Nakhe", "Soumen Chakrabarti", "S. Sudarshan"], "n_citation": 50, "references": ["84ced05e-90b8-4cd9-bd7e-2a4f21296b1b", "8bc2eb8c-6014-4eca-9de8-e4cc85713c62", "8f9e92cf-f266-4e51-807f-c098a260a0dc", "95400b8f-4ab1-4cf2-bb94-a56df730ffc0", "9785caef-a673-488d-9eaf-cf6d24108013", "9fe9e71c-f790-4b7b-b163-c2c0d2da061f", "b9111683-1151-4542-8a10-d1eeb730087e", "c5931a9a-ff7e-4e51-9529-16e185a40250", "d5d305ad-246a-414b-b1dd-01e30861fbd5", "de974db4-6a68-45b3-9366-57da45c4e452", "ff269dbf-6570-4409-8cab-6ac142450d05"], "title": "Keeyword Search in Databases.", "venue": "IEEE Data(base) Engineering Bulletin", "year": 2001, "id": "09d74961-7c38-4c1d-a0ca-2c34fb6628d3"}
{"abstract": "Comunicacio presentada a 9th Annual Conference of the International Speech Communication Association celebrada a Brisbane (Australia) del  22 al 26 de setembre de 2008.", "authors": ["Mireia Farr\u00fas", "Michael Wagner", "Jan Anguita", "Javier Hernando"], "n_citation": 50, "references": ["23af12d9-481d-459a-a1e2-23390f7b3c9a", "40475584-8aa6-4753-acff-155c340ba5c9", "72f2cea3-9d67-49f7-96df-a627e7cc25de", "9f1c57c9-ae6c-4e00-b3ee-10256adb3cb1", "aca9b3c7-4810-49ad-ade4-cb01c92e5b8d"], "title": "Robustness of prosodic features to voice imitation", "venue": "conference of the international speech communication association", "year": 2008, "id": "0a11cd87-659d-45b8-b140-d8a8ff0974ee"}
{"authors": ["Adler Diniz de Souza", "Ana Regina Rocha"], "n_citation": 50, "references": ["7c7abe07-b61d-4841-952e-88c103515ed9", "c1af6ed1-3e80-40b0-8fab-e8af74c27619"], "title": "A Proposal for the Improvement Predictability of Cost Using Earned Value Management and Quality Data", "venue": "", "year": 2013, "id": "0a1eab6e-032b-42a7-8ef7-286f414dbf58"}
{"abstract": "PiQASso is a Question Answering system based on a combination of modern IR techniques and a series of semantic filters for selecting paragraphs containing a justifiable answer. Semantic filtering is based on several NLP tools, including a dependency-based parser, a POS tagger, a NE tagger and a lexical database. Semantic analysis of questions is performed in order to extract key word used in retrieval queries and to detect the expected answer type. Semantic analysis of retrieved paragraphs includes checking the presence of entities of the expected answer type and extracting logical relations between words. A paragraph is considered to justify an answer if similar relations are present in the question. When no answer passes the filters, the process is repeated applying further levels of query expansions in order to increase recall. We discuss results and limitations of the current implementation.", "authors": ["Giuseppe Attardi", "Antonio Cisternino", "Francesco Formica", "Maria Simi", "Alessandro Tommasi"], "n_citation": 69, "references": ["01f443e7-ea4c-48a7-8081-745c3fa62769", "659896a8-67ef-451e-8b9a-3b67f12349e9", "aae40566-1432-4b7a-8d37-2924cd4e04e7"], "title": "PIQASso: PIsa Question Answering System", "venue": "text retrieval conference", "year": 2001, "id": "0a22ed40-c8b3-410c-a8f0-b1d7713430ad"}
{"authors": ["Mats Ljungqvist", "Anders Lindstr\u00f6m", "Kjell Gustafson"], "n_citation": 50, "title": "A new system for text-to-speech conversion, and its application to Swedish.", "venue": "conference of the international speech communication association", "year": 1994, "id": "0a27e879-9915-47fe-9f45-0d819cf5bc85"}
{"abstract": "We introduce data musicalization as a novel approach to aid analysis and understanding of sleep measurement data. Data musicalization is the process of automatically composing novel music, with given data used to guide the process. We present Sleep Musicalization, a methodology that reads a signal from state-of-the-art mattress sensor, uses highly non-trivial data analysis methods to measure sleep from the signal, and then composes music from the measurements. As a result, Sleep Musicalization produces music that reflects the user's sleep during a night and complements visualizations of sleep measurements. The ultimate goal is to help users improve their sleep and well-being. For practical use and later evaluation of the methodology, we have built a public web service at http://sleepmusicalization.net for users of the sleep sensors.", "authors": ["Aurora Tulilaulu", "Joonas Paalasmaa", "Mikko Waris", "Hannu Toivonen"], "n_citation": 7, "references": ["382faab2-e0e9-4e2e-8ff3-19f1e6f76813", "5318635d-7cc0-40fd-9f4d-c37b62a15f1a", "98b14d61-c8a5-4144-b6a0-0f133bd86c60", "d625e5e8-2b71-4034-a86d-0a097bd6f4fb", "f745868b-e833-45ed-b4d8-7020ab2a46da"], "title": "Sleep musicalization: automatic music composition from sleep measurements", "venue": "intelligent data analysis", "year": 2012, "id": "0a2a7d40-85d1-40bc-95c7-96676ee94da6"}
{"abstract": "Mobile health (mHealth) has been receiving more and more attention recently as an emerging paradigm that brings together the evolution of advanced mobile and wireless communication technologies with the vision of \"connected health\" aiming to deliver the right care in the right place at the right time. However, there are several cardinal problems hampering the successful and widespread deployment of mHealth services from the mobile networking perspective. On one hand, issues of continuous wireless connectivity and mobility management must be solved in future heterogeneous mobile Internet architectures with ever growing traffic demands. On the other hand, Quality of Service (QoS) and Quality of Experience (QoE) must be guaranteed in a reliable, robust and diagnostically acceptable way. In this paper we propose a context- and content-aware, jointly optimized, distributed dynamic mobility management architecture to cope with the future traffic explosion and meet the medical QoS/QoE requirements in varying environments.", "authors": ["Andr\u00e1s Tak\u00e1cs", "L\u00e1szl\u00f3 Bokor"], "n_citation": 3, "references": ["090840ca-9c95-461e-8000-aca00919b4b1", "0ee53010-06e6-45e7-932d-67b27fe1bb0d", "1a43fadb-2804-4682-a857-1cf32cfac168", "2ac0087a-b4d4-45f8-9b21-f0b5356bccc8", "3cd1ef63-ade4-4bf6-ae3e-ed9a6a7aaf81", "5da9c958-ec9c-4884-b518-7464be3e6207", "5e78279c-c114-45d1-b5bc-679d0b2a4aa6", "64c3c8e6-5d53-4f8e-8f84-c2225ec0ab64", "68fcb199-d316-4c11-90d1-62dce1eb5fd5", "6f21f0fc-e45c-4d2f-9423-76f0702a37fd", "8ac816c6-0ee8-4987-9524-c7951510760f", "9a404ba6-49bb-4459-8e1f-874c86ab76a1", "9b9e8d6b-ba2d-4e48-ab58-03a1991a3acd", "a7aaf1ed-bec7-479c-8bda-284d0e3666a3", "ab09aeeb-9c34-42ad-b073-4ff573e6cde9", "b5629dbc-68e9-4d35-b7d0-ca183254fcc8", "de8d72d1-9ada-470e-8ffd-b0c4ee6f0a77", "ee5adf0f-217c-449e-b8d8-cac59887ad98"], "title": "A Distributed Dynamic Mobility Architecture with Integral Cross-Layered and Context-Aware Interface for Reliable Provision of High Bitrate mHealth Services", "venue": "", "year": 2012, "id": "0a2f9484-9355-4a24-904d-2018f3fc3a17"}
{"abstract": "Les donnees temporelles peuvent etre traitees de nombreuses facons afin d'en extraire des connaissances. La decouverte de motifs sequentiels met en evidence des sous-sequences frequentes contenues dans des sequences d'enregistrements annotes temporellement. L'analyse des acces a un site web permet par exemple de decouvrir que \"5% des utilisateurs accedent a la page register.php puis a la page help.html\". Cependant, les motifs sequentiels ne permettent pas d'extraire des tendances temporelles, du type \"une augmentation du nombre de requetes au formulaire d'inscription precede souvent une augmentation des requetes a la page d'aide quelques secondes plus tard\". Dans cet article, nous proposons d'extraire des motifs caracterisant ces evolutions frequentes gr\u00e2ce a deux algorithmes, TED et EVA. Nous presentons notre approche, implementee et testee sur des donnees reelles.", "authors": ["C\u00e9line Fiot", "Florent Masseglia", "Anne Laurent", "Maguelonne Teisseire"], "n_citation": 0, "title": "Des s\u00e9quences aux tendances.", "venue": "", "year": 2008, "id": "0a54e609-8dfb-4979-ad7d-5f361e64c2bc"}
{"authors": ["Tatsuya Kawahara", "Toru Ogawa", "Shigeyoshi Kitazawa", "Shuji Doshita"], "n_citation": 7, "title": "Phoneme recognition by combining Bayesian linear discriminations of selected pairs of classes.", "venue": "conference of the international speech communication association", "year": 1990, "id": "0a67e9a1-e387-439a-9f19-109180f872d7"}
{"abstract": "Utilization of camera systems for surveillance tasks (e. g. traffic monitoring) has become a standard procedure and has been in use for over 20 years. However, most of the cameras are operated locally and data analyzed manually. Locally means here a limited field of view and that the image sequences are processed independently from other cameras. For the enlargement of the observation area and to avoid occlusions and non-accessible areas multiple camera systems with overlapping and non-overlapping cameras are used. The joint processing of image sequences of a multi-camera system is a scientific and technical challenge. The processing is divided traditionally into camera calibration, object detection, tracking and interpretation. The fusion of information from different cameras is carried out in the world coordinate system. To reduce the network load, a distributed processing concept can be implemented.#R##N##R##N#Object detection and tracking are fundamental image processing tasks for scene evaluation. Situation assessments are based mainly on characteristic local movement patterns (e.g. directions and speed), from which trajectories are derived. It is possible to recognize atypical movement patterns of each detected object by comparing local properties of the trajectories. Interaction of different objects can also be predicted with an additional classification algorithm.#R##N##R##N#This presentation discusses trajectory based recognition algorithms for atypical event detection in multi object scenes to obtain area based types of information (e.g. maps of speed patterns, trajectory curvatures or erratic movements) and shows that two-dimensional areal data analysis of moving objects with multiple cameras offers new possibilities for situational analysis.", "authors": ["Ralf Reulke", "Dominik Rue\u00df", "Kristian Manthey", "Andreas Luber"], "n_citation": 1, "references": ["0fd21eb3-a0fa-47df-81b3-3decd40e7f41", "11b36e1c-c93b-4e12-820c-30e43cca673c", "27afbfc7-d29a-4061-a67b-d8e124bf3f7c", "2a8729d8-0911-4ea6-88d1-17bd24e53aa1", "2d479dbc-9e18-4ea1-8b70-eaacb0b06b7a", "34b61f45-4695-404b-b59f-d9ff4d0d4a0f", "4deecabf-7a1b-44ee-870d-237d7fcf925c", "60285266-7da2-474e-b05a-b380c836f665", "7802ebdc-6e4c-4501-b1cf-899ad51c0c1a", "91979159-37d8-410f-a245-a33ef80a092b", "947c177a-cdcd-42c1-9999-3bf5f5811735", "94e708cf-5cf4-40f2-bc87-1ac8ddb6bef9", "9775a0d7-bf2c-4dcc-8682-5cabeabd33c7", "a2a72c14-fed4-47f1-b913-c97119529fb0", "a941db08-2328-441a-9f7a-f52dd000fec9", "ac2a8c3c-cb85-487e-80d0-937f17959002", "c98c332d-0aa7-4c94-a3fe-3f131e2fdb7a", "c9fa31f7-f6ce-49ea-b42c-8d03ae59dbe4", "e0a4505e-ceb4-47ec-8c95-8b22c07cb53b", "ebfca554-7a3c-4597-954b-07336a2e3030", "ed1f198d-d98c-4cee-a565-286ae5d4801b"], "title": "Traffic observation and situation assessment", "venue": "international conference on computer vision", "year": 2011, "id": "0a89c062-028f-43bf-a2cb-92e54f0b4d72"}
{"authors": ["Stephan Busemann"], "n_citation": 0, "references": ["cff1f8d3-d17c-40b1-81b0-a54345f6e7f2"], "title": "Using pattern-action rules for the generation of GPSG structures from MT-oriented semantics", "venue": "international joint conference on artificial intelligence", "year": 1991, "id": "0a8a486d-f594-4633-8e53-4773bd4734b1"}
{"abstract": "Yunnan Radio and TV University tried to \"explore the Open Univer- sity building model\" that was approved by the State Council in October 2010. Having tried for more than two years, the university explores building the \"Four in One\" hybrid-practice teaching model which is an integration of network virtual training, entities training inside school, outside expand training, and learning package individual training. It aims to break through the bottleneck of open and distance education. The model has been applied gradually in practice teaching, and it shows positive initial results.", "authors": ["Xiao\u2010Jun Zhou", "Ji Luo"], "n_citation": 0, "title": "Structure and Practice of \"Four in One\" Hybrid-Practice Teaching Mode", "venue": "international conference on hybrid learning and education", "year": 2013, "id": "0a8c213c-8776-41b3-9c57-b88efeaa96fd"}
{"authors": ["Jennifer Lennon", "Hermann A. Maurer"], "n_citation": 7, "title": "Aspects of large World Wide Web systems.", "venue": "", "year": 1996, "id": "0a8f150f-b10c-42d6-a744-324b804168c1"}
{"abstract": "The Web is evolving from a repository for text and images to a provider of services - both information-providing services, and services that have some effect on the world. Today's Web was designed primarily for human use. To enable reliable, large-scale automated interoperation of services by computer programs or agents, the properties, capabilities, interfaces and effects of Web services must be understandable to computers. In this paper we propose a vision and a partial realization of precisely this. We propose markup of Web services in the DAML family of semantic Web markup languages. Our markup of Web services enables a wide variety of agent technologies for automated Web service discovery, execution, composition and interoperation. We present one logic-based agent technology for service composition, predicated on the use of reusable, task-specific, high-level generic procedures and user-specific customizing constraints.", "authors": ["Sheila Mcllraith", "Tran Cao Son", "Honglei Zeng"], "n_citation": 117, "references": ["00fef322-2fb3-403e-9ae5-e69009726677", "40ec5a76-44fd-4a35-9341-3bb191b8da97", "87bc2daf-8d61-4e48-8c63-e98cc4a2d749", "bf4f34e9-9a54-4448-a13f-4bc6734b6d31", "db229d9e-2e77-4110-b439-224b2551c418", "e6bf3d28-74da-4e7d-ab8d-70a4bed9d496"], "title": "Mobilizing the semantic web with DAML-enabled web services", "venue": "international semantic web conference", "year": 2001, "id": "0a960ce7-3a3a-4c83-bce2-e40b1f69f53e"}
{"authors": ["Siddharth Gopal", "Yiming Yang"], "n_citation": 46, "references": ["04c47f14-8533-41ff-bafd-affc1eb52287", "36ee0c5c-c06b-4229-aeb9-6b375f64c5b5", "407ceb18-464f-4ab3-b731-68f7681fb26d", "504ae192-4804-4eeb-8699-ca13eb504477", "5d270f8a-61e7-481e-8a63-ff7a52b2d67c", "68453f24-4276-4d0c-b37e-19d23af549be", "771191dc-2e77-4fd9-bca3-02b2496370ec", "7c460e8e-5c9e-45f5-9d18-461f27fcef43", "a4e895a1-9e7f-4ced-a183-299ce40869f7", "d38a74f0-1628-4d0e-92cf-72e3f6f6b6f7", "d507592b-621b-47c8-a10d-29f9e9953393", "e75d8e62-a86d-4241-953f-1b315005d920"], "title": "Von Mises-Fisher Clustering Models", "venue": "international conference on machine learning", "year": 2014, "id": "0a9a0d16-aa72-4c7e-8303-ac29cb519bd0"}
{"abstract": "Gaze tracking is an aspect of human-computer interaction still growing in popularity. Tracking human eye fixation points can help control user interfaces and eventually may help in the interface evalu- ation or optimization. Unfortunately professional eye-trackers are very expensive and thus hardly available for researchers and small companies. The paper presents very effective, exponentially smoothed, low cost, ap- pearance based, improved gaze tracking method. The method achieves very high absolute precision (1 deg) at 20 fps, exploiting a simple HD web camera with reasonable environment restrictions. The paper de- scribes results of experimental tests, both static on absolute gaze point estimation, and dynamic on gaze controlled path following.", "authors": ["Adam Wojciechowski", "Krzysztof Fornalczyk"], "n_citation": 3, "references": ["10c8adc2-5710-4672-af81-628f8e30d81c", "1e2669e0-779c-4919-bdea-ec4def8274c8", "1fb5dd80-1d3c-4257-bdd1-04dbae780be9", "2832d86d-c6a9-4e1a-9e5f-922e530c1361", "2b7a2f7a-159d-4610-abf1-2cd9117e3001", "3da6e080-6c99-43b2-bdab-b96045c5afb3", "7be3b21a-5f5d-4bf1-9403-45e483049f59", "8458569d-486b-4ae7-80b8-9ffdcaebaf1d", "95b511d5-4f03-4e8b-891b-56e674f15ae8", "cb1817aa-5a35-465e-b429-9cdec14279ee", "d866d775-bd7c-4e31-860d-259ac2504b12", "da1d9e31-3238-43f5-8505-5d57fcff401d", "e40ca2db-1cab-4748-9aba-38cb4dad6ccd", "e649a9fd-f6d9-4aac-b428-29b82c20a484", "eae87537-052f-494c-be1b-c875d3d79538", "ee5f5477-295f-4cb7-99b9-2e612aa86f5f", "efd0600a-5e2f-4dc4-888e-9a39b82d0315", "f26f20bb-832c-447d-8fa5-9c72d3e51c94", "f38db47a-5b50-48d7-8382-9a9372cd3114"], "title": "Exponentially Smoothed Interactive Gaze Tracking Method", "venue": "international conference on computer vision and graphics", "year": 2014, "id": "0aac0ff9-dd0b-489e-8ae2-54df56edf867"}
{"authors": ["Lisa-Jane Brown", "John Locke", "Peter Blundell Jones", "Sandra P. Whiteside"], "n_citation": 0, "references": [], "title": "Language development after extreme childhood deprivation: a case study.", "venue": "conference of the international speech communication association", "year": 1998, "id": "0aace172-8a74-4cf3-80d6-ae6aff4b1491"}
{"authors": ["Tatsuya Yamaguchi", "Takashi Kawashimo", "Toshiyuki Matsumoto", "Daisuke Doyo"], "n_citation": 0, "references": [], "title": "Development of a Training System for Lathe Operation Using a Simulator", "venue": "", "year": 2013, "id": "0abcb52f-581b-4a42-a965-ef4c25934ddf"}
{"authors": ["Kedian Mu", "Zhi Jin", "Ruqian Lu"], "n_citation": 0, "title": "A Logical Approach for Testing Requirements.", "venue": "", "year": 2005, "id": "0abe0382-3849-45eb-9276-2d1b3e36e12e"}
{"abstract": "The construction of a program that generates crossword puzzles is discussed. As in a recent paper by Dechter and Meiri, we make an experimental comparison of various search techniques. The conclusions to which we come differ from theirs in some areas - although we agree that directional arc consistency is better than path-consistency or other forms of lookahead, and that backjumping is to be preferred to backtracking, we disagree in that we believe dynamic ordering of the constraints to be necessary in the solution of more difficult problems.", "authors": ["Matthew L. Ginsberg", "Michael Patrick Frank", "Michael P. Halpin", "Mark C. Torrance"], "n_citation": 93, "references": ["8ac3ec28-bc52-4546-9358-867cea3cf992", "90a09517-844c-4a73-9a61-8e89d1b93921", "951a0ab2-8896-42a9-83f2-f0aafb216c2c", "bb52dd8b-078b-4e5c-a179-43b8132ceaeb", "be657e8b-f27a-4917-a31e-cafe79f4f286"], "title": "Search lessons learned from crossword puzzles", "venue": "national conference on artificial intelligence", "year": 1990, "id": "0abff4a0-03b4-4739-b460-aa5313e7c0f1"}
{"authors": ["Jo\u00e3o Laranjeira", "Carlos Filipe Freitas", "Goreti Marreiros", "Carlos Ramos", "Jo\u00e3o Carneiro"], "n_citation": 2, "references": ["2830e603-4555-4046-9d71-dc6277293f1c", "914a98b3-8985-47b0-87ef-705ec062c55d", "fd51d78a-e2f5-46b6-b041-4dae9aebdc76"], "title": "A Digital Secretary for Smart Offices Setup Up", "venue": "", "year": 2011, "id": "0ac3d0f4-4eaa-47ac-8292-dd382e81b275"}
{"abstract": "Dans le cadre de la theorie des traces, un graphe de dependance represente le comportement d'un systeme distribue (par exemple un reseau de Petri) par analogie avec la relation mot-automate dans le cas sequentiel. Un langage reconnaissable de graphes de dependances represente ainsi l'ensemble de tous les comportements d'un systeme distribue satisfaisant des conditions de regularite. Dans cet article nous caracterisons les languages de graphes obtenus a partir des precedents par suppression des etiquettes sur les sommets", "authors": ["Andrzej Ehrenfeucht", "Hendrik Jan Hoogeboom", "Grzegorz Rozenberg"], "n_citation": 1, "references": ["1166e597-9ddc-4d5a-ac97-1edafd88c50b", "84bf436c-c7d1-4dd7-9005-8ce174ab0bc1", "9652a616-7dfa-4fe3-a64a-7024167c36df", "f7312583-41eb-4ab3-8790-d38b835a7d9d"], "title": "On the structure of recognizable languages of dependence graphs", "venue": "Theoretical Informatics and Applications", "year": 1993, "id": "0ad7a2e4-22c8-4c42-96b0-77fc776c0708"}
{"abstract": "The mediaeval logic of Aristotelian privation, represented by Ockham's expositionof All A is non-P as All S is of a type T that is naturally P and no S is P, iscritically evaluated as an account of privative negation. It is argued that there aretwo senses of privative negation: (1) an intensifier (as in subhuman), the dualof Neoplatonic hypernegation (superhuman), which is studied in linguistics asan operator on scalar adjectives, and (2) a (often lexicalized) Boolean complementrelative to the extension of a privative negation in sense (1) (e.g., Brute). Thissecond sense, which is the privative negation discussed in modern linguistics, isshown to be Aristotle's. It is argued that Ockham's exposition fails to capture muchof the logic of Aristotelian privation due to limitations in the expressive power of thesyllogistic.", "authors": ["John N. Martin"], "n_citation": 1, "references": ["42f9b707-4a98-4e34-a7ff-f4b9f66e16f4", "bc843a3f-a344-4549-95ed-f0897e39e5a9"], "title": "All brutes are Subhuman: Aristotle and Ockham on private negation", "venue": "Synthese", "year": 2003, "id": "0aeda1f1-3e6a-40e1-877c-3e45107e68db"}
{"authors": ["Krzysztof Goczy\u0142a", "Wojciech Waloszek", "Aleksander Waloszek"], "n_citation": 6, "references": ["2a0e7cf5-47fe-42cf-bf93-b0ec12d77f45", "43128b51-6522-418d-8f29-78da3548d72c", "591bf46d-f30f-488c-8ebc-da7809bee7a7", "593820e2-6695-4293-85f4-364e43c966a4", "ad2883c4-91e5-441e-897c-996da24735eb", "adf4ad46-2a3c-43f5-8d43-fad69a9a3de3", "ae010b99-f625-4498-a2a2-706aad6e33ff", "bf06c66c-b76e-49c4-a273-95e7f69cd265"], "title": "A Semantic Algebra for Modularized Description Logics Knowledge Bases.", "venue": "", "year": 2009, "id": "0af8b455-ebd8-4630-80ca-a526cdc049d4"}
{"abstract": "An asymmetric relation, called a weak similarity relation, is introduced as a more realistic relation in representing the relationship between two elements of data in a real-world application. A conditional probability relation is considered as a concrete example of the weak similarity relation by which a covering of the universe is provided as a generalization of a disjoint partition. A generalized concept of rough approximations regarded as a kind of fuzzy rough set is proposed and defined based on the covering of the universe. Additionally, a more generalized fuzzy rough approximation of a given fuzzy set is proposed and discussed as an alternative to provide interval-valued fuzzy sets. Their properties are examined.", "authors": ["Rolly Intan", "Masao Mukaidono"], "n_citation": 0, "references": ["0fa4b1f5-a70b-4855-a268-d38175013e35", "17d92951-cd71-4945-b1c5-c9c558d92157", "4b22283e-f2a7-4077-8838-86175c8634bd", "4f675199-2160-45e2-a65f-f3c91c5745d8", "6c9aac4e-465d-449d-81da-a4ad1470dd42", "a4589cfe-15e7-4c34-9349-d002d1d2c9df", "b9d8478c-52b8-4ca9-b2b8-7d9502250551", "def088ed-0621-4a94-ad74-aa54426fe948", "e8857216-9a19-4909-9d80-534a6472922d", "f6e33042-36ae-4374-855e-1b699ff7fd73"], "title": "On The Generalization of Fuzzy Rough Approximation Based on Asymmetric Relation", "venue": "", "year": 2005, "id": "0b18df27-88a9-43e8-abda-de9dd33cbe5f"}
{"authors": ["Boaz Ben-Moshe", "Binay K. Bhattacharya", "Qiaosheng Shi"], "n_citation": 0, "references": ["5ca6988f-8bec-4bb7-a320-a68604ba653c", "6867a27b-4b3c-4bfc-8dd1-286630cb69cd", "9e0c81a1-e8f6-444e-b83c-b779e88ea26b", "c1920ae0-12a3-4c6d-af24-cbe63ef96a63"], "title": "Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles.", "venue": "canadian conference on computational geometry", "year": 2005, "id": "0b1c3cfd-17e1-4585-ae7b-49f2a95dfc08"}
{"authors": ["Samir R. Das", "Richard M. Fujimoto"], "n_citation": 50, "title": "An Adaptive Memory Management Protocol for Time Warp Simulation.", "venue": "measurement and modeling of computer systems", "year": 1994, "id": "0b2c122e-0e88-4cf3-a0f6-899054b42472"}
{"abstract": "This chapter considers \u2018T\u2019 to be a countable complete \u03c9 -stable theory. The notion \u201cdimension\u201d is used for classes of non-orthogonal regular types over models. T is nonmultidimensional if the number \u03bc (T) of dimensions is bounded. Models of non-multidimensional \u03c9-stable theories can be classified by \u03bc (T)-tuples of cardinals. The chapter also presents some preliminaries from stability theory and focuses on the algebra of models of Th(F c (p n , N  O )). The chapter also discusses the Lascar rank computation and dimensions.", "authors": ["Andreas Baudisch"], "n_citation": 4, "references": ["43251fa0-4d73-46ac-a971-9e12ffc2424d", "47d0e0c0-58ed-4978-ab02-1590de1ed0bd", "a7c8bcff-22fd-4685-ae1f-a4140ac60044", "cadba62c-971f-42ea-9d37-061b6c4e05e8"], "title": "On Lascar rank in non-multidimensional omega-stable theories.", "venue": "", "year": 1985, "id": "0b3eeeaa-7422-462e-bbc3-0ac04cf26963"}
{"authors": ["Won-Ho Lee", "Kee-Won Kim", "Nam-Yeun Kim", "Kee-Young Yoo", "Chang Hoon Kim", "Chun Pyo Hong"], "n_citation": 0, "title": "Architecture for AB 2 Operation over GF(2 m ) using Irreducible AOP and Its Applications.", "venue": "computers and their applications", "year": 2002, "id": "0b4f8389-8a90-4f60-a0b6-8f3d213be253"}
{"abstract": "The Soft Systems Methodology (SSM) was developed to deal with soft systems, systems in which the human components predominate. Any kind of soft- ware is a hard system, since technical factors predominate in it. But when the software is a component of an Information System its success depends heavily on soft aspects. This paper analyzes the potential contribution of SSM to Software Engineering in order to propose a method to support requirements elicitation for the development of Information System that helps to understand and consider the human, social and political factors that will influence the system success. A real situation of the Integration and Testing Laboratory (LIT) of INPE (Brazilian Insti- tute for Space Research) was used to perform the study and to exemplify the use of the proposed method.", "authors": ["Ana Claudia de Paula Silva", "Geilson Loureiro"], "n_citation": 0, "references": [], "title": "Soft Systems Methodology for Hard Systems Engineering - The Case of Information Systems Development at LIT/INPE/BRAZIL", "venue": "", "year": 2013, "id": "0b58c0f4-9d3e-4802-8722-1a64485cd2a8"}
{"abstract": "Channel correlation has the effect to reduce the sum rate and user capacity of multiuser multi-input multi-output (MU-MIMO) systems considerably. In this paper, receive antenna selection is proposed for uplink MU-MIMO system to maximize the sum rate and to maintain high user capacity over correlated Rayleigh fading channel. Two antenna selection criteria are presented to tradeoff the computational complexity and performance. Capacity based selection criterion (CBSC) provides optimal performance at the cost of high complexity compared with the suboptimal norm based selection criterion (NBSC). Simulation results demonstrate and validate the effectiveness of proposed method compared with conventional MU-MIMO systems.", "authors": ["Walid A. Al-Hussaibi", "Falah H. Ali"], "n_citation": 50, "references": ["1a6067c9-4f4c-43a8-bdee-9dc7b5b337b0", "2d768689-c0fd-4fe3-b1ed-0319adf8b49a", "3bb51ab3-a18e-423d-8599-dfe8217b1956", "7fc888ce-ff8e-406c-acc5-ecb8c02647ba", "87f93827-73d6-4a78-834c-638dd9c6a6eb", "c1c17a46-8580-4635-99a2-6dee33afe774", "d36d43f3-63da-49c8-8daa-8ecd81862d9d", "e664eef4-51c4-4560-a7ac-c26c29df9a9c"], "title": "Receive antenna selection for uplink multiuser MIMO systems over correlated rayleigh fading channels", "venue": "wireless personal multimedia communications", "year": 2011, "id": "0b81095f-be4e-433e-8355-265e214eb25a"}
{"authors": ["Siu Wa Lee", "Frank K. Soong", "Pak-Chung Ching"], "n_citation": 2, "title": "Harmonic filtering for joint estimation of pitch and voiced source with single-microphone input.", "venue": "conference of the international speech communication association", "year": 2005, "id": "0b8e7cb8-380f-48e0-b7ad-2eeb59c0432f"}
{"authors": ["Francisco O. Redelico", "Araceli N. Proto"], "n_citation": 0, "references": ["85012d18-8706-4ade-b59e-6db4e84d0867"], "title": "Complex Networks Topology: The Statistical Self-similarity Characteristics of the Average Overlapping Index", "venue": "", "year": 2013, "id": "0bca325a-647e-4fca-aa81-d829f98d7430"}
{"abstract": "Finding information is a problem shared by people and intelligent systems. This paper describes an experiment combining both human and machine aspects in a knowledgebased system to help people find information in text. Unlike many previous attempts, this system demonstrates a substantial improvement in search effectiveness by using linguistic and world knowledge and exploiting sophisticated knowledge representation techniques. It is also an example of practical subsumption technology on a large scale and with domainindependent knowledge. Results from this experiment are relevant to general problems of knowledge-based reasoning with large-scale knowledge bases.", "authors": ["William A. Woods"], "n_citation": 50, "references": ["0cf317c3-089e-4e13-843a-4f63d8799742", "23623676-0603-45a6-85f5-35c3068fc4ee", "26849375-ba5e-4ed7-92b0-2e1c0633e7b2", "55019977-b259-457f-b6df-bc4607239c43", "9566bd1c-79e4-4f6f-b641-4076386e1966", "a1b55c3e-c0f8-4f58-b6a3-e11be6706436"], "title": "Conceptual Indexing: Practical Large-Scale AI for Efficient Information Access", "venue": "national conference on artificial intelligence", "year": 2000, "id": "0bd9e14d-7e27-4360-b028-dd023387409a"}
{"abstract": "Open learner models (OLMs) available independently from specific tutoring or guidance, such as an intelligent tutoring system may provide, can encourage learners to take greater responsibility for learning., Our results suggest that finer grained OLM information, in this context, can support learners in identifying strengths/weaknesses, planning and focussing learning, when different OLM granularities exist. Learners drew regular comparison between OLM and domain information, showing the flexibility of interaction to be important.", "authors": ["Matthew D. Johnson", "Susan Bull"], "n_citation": 0, "references": ["2c7e86b3-ac93-42ef-8d9b-63dc27f49988", "b9304658-2d9b-4a6e-b197-612bf9672cc4", "d04a6ed7-360f-4a60-a404-e448418ff96b", "fab89141-de48-4b95-b0f6-9dc3dfdab0ac"], "title": "Optional finer granularity in an open learner model", "venue": "artificial intelligence in education", "year": 2011, "id": "0bdc5157-e49d-4c4d-bb38-1f4d33c60ea8"}
{"authors": ["Thilo Schuler", "Sebastian Garde", "Sam Heard", "T. A. W. Beale"], "n_citation": 7, "references": ["16493357-9eeb-4e30-9def-3768f1465b5f", "c1a5093d-7a2b-4829-94df-e5daf5cd2b69", "c339aa1b-0f24-4763-84c5-a2280df00e2f", "c8eedb2d-47ac-47fb-b4fb-13d6063bd128", "e4dacd69-97a4-4f9d-80fc-a695f8f0639f", "f322f52e-70e0-438d-81db-17629580783f"], "title": "Towards automatically generating graphical user interfaces from openEHR archetypes.", "venue": "medical informatics europe", "year": 2006, "id": "0be48eb0-accc-4205-8559-ea7dd9d254e3"}
{"abstract": "Conversational Agents have been shown to be effective tutors in a wide range of educational domains. However, these agents are often ignored and abused in collaborative learning scenarios involving multiple students. In our work presented here, we design and evaluate interaction strategies motivated from prior research in small group communication. We will discuss how such strategies can be implemented in agents. As a first step towards evaluating agents that can interact socially, we report results showing that human tutors employing these strategies are able to cover more concepts with the students besides being rated as better integrated, likeable and friendlier.", "authors": ["Rohit Kumar 0001", "Carolyn Penstein Ros\u00e9"], "n_citation": 50, "references": ["154622cf-0be7-443a-82cb-b72dfacfe61f", "21e996eb-100e-4e69-afa7-507921d3eceb", "3cb7383b-0ef9-437d-bd82-5cc5a1f8a255", "5703ac24-cbe8-4ded-9628-cde52305d338", "5c086544-e0ab-4548-9340-21c25dea4b13"], "title": "Engaging learning groups using Social Interaction Strategies", "venue": "north american chapter of the association for computational linguistics", "year": 2010, "id": "0be8d5ff-bf74-456f-a35c-4079545af975"}
{"authors": ["Umit H. Yapanel", "X. Zhang", "John H. L. Hansen"], "n_citation": 16, "title": "High performance digit recognition in real car environments.", "venue": "conference of the international speech communication association", "year": 2002, "id": "0bfe6821-bac5-42cd-842a-e46e24f08ccf"}
{"authors": ["Masami Ito"], "n_citation": 1, "title": "Input sets of strongly connected automata.", "venue": "fundamentals of computation theory", "year": 1979, "id": "0c0a229e-077b-4cfa-a186-0cecd2b6ece0"}
{"abstract": "In this work, we study simultaneously resettable arguments of knowledge. As our main result, we show a construction of a constant-round simultaneously resettable witness-indistinguishable argument of knowledge (simresWIAoK, for short) for any NP language. We also show two applications of simresWIAoK: the first constant-round simultaneously resettable zero-knowledge argument of knowledge in the Bare Public-Key Model; and the first simultaneously resettable identification scheme which follows the knowledge extraction paradigm.", "authors": ["Chongwon Cho", "Rafail Ostrovsky", "Alessandra Scafuro", "Ivan Visconti"], "n_citation": 50, "references": ["0dd040aa-d2e6-447d-ad59-c2a19b828c99", "1ee68967-435a-4b08-9d5e-bbf1c98bdc92", "3edcf409-162f-4d7c-bbff-c728e1782369", "40ba9700-6e58-4001-821f-63339abd1456", "4977f43e-d634-4e31-8fc1-8656ceb2841a", "4997440f-20c2-41ea-ad28-ba2869df1339", "4ed0828d-d9c9-4224-8904-7facbe951b00", "67afbee5-9b02-45a3-aeda-c46c0e5728cd", "70df52a7-d155-44b9-80ee-dae954f41fdf", "9fe2fa2b-88ea-4a66-bbbb-e413d364decd", "abe9b730-dd0d-4b01-a903-e0990c04012f", "b0c55bde-4155-400c-b9cb-c127067c4023", "d7f731c6-59e5-4871-9c22-38af2701d8dd", "d9dc4f5b-08a4-49e1-b0f9-4ab8552373c3", "dc403ade-4b12-4356-856a-a0b27ed9f258"], "title": "Simultaneously resettable arguments of knowledge", "venue": "theory of cryptography conference", "year": 2012, "id": "0c1960c9-00f9-4228-aec7-508ad5496d59"}
{"abstract": "The tool USE (UML-based Specification Environment) supports analysts,#R##N#designers and developers in executing UML models and checking OCL#R##N#constraints and thus enables them to employ model-driven techniques#R##N#for software production. USE has been developed since 1998 at the#R##N#University of Bremen. This paper will discuss to what extent and how#R##N#USE relates to the questions and topics (Model quality, Modelling#R##N#method, Model Effectiveness, Model Maintainability) raised for this#R##N#seminar.", "authors": ["Martin Gogolla"], "n_citation": 4, "references": ["42ea6086-62ba-4bfa-b59c-4e454c848818"], "title": "Model Development in the UML-based Specification Environment (USE)", "venue": "", "year": 2006, "id": "0c6d6e0d-6b6c-43a0-90dc-a9121608842f"}
{"authors": ["Helena Vranesic", "Christoph Rosenkranz"], "n_citation": 1, "references": ["04827753-a857-4d89-b911-a702541985e8", "0a189ea8-eb4e-4b52-8628-8517ca90c9fb", "0a34e0bc-f20a-42ec-944d-3b9c09617443", "19d91703-c00f-4df5-8063-e06190745f90", "1d26765a-c2b4-4ba4-9e97-7d9038b6997a", "25e6a17c-de4e-4a51-926a-1dbe71cd4cc5", "41a1b4e3-d24c-4403-8a83-55c98363d542", "48781111-6d37-40ba-af55-6ff34568dea7", "4b31d382-7563-4ade-a085-00766043dff4", "4c869ae8-4535-42f4-a1bb-c006988530d3", "66c73221-c6f2-43ec-8b11-cfe42ee3a3c1", "75b61ce2-db99-47c7-b730-57e908b842ce", "82f5a3d2-c720-426c-b328-443b8462c369", "8f59f509-b204-4e45-a9c4-1229031dc797", "910575c3-5422-4a2b-aeb5-56863c6a5a19", "9a3effd1-167c-4992-a4ac-702aa8a8e062", "b62ea6cc-181f-4cd9-a604-4116de56dc8b", "c2c845da-f43d-49b3-a351-3804112c6770", "c374aaa4-d48c-463f-b32b-7ae6ece33ac4", "c51488c4-f2bc-479e-b4c0-d1a2e7628138", "ca2b6b6f-2afa-41be-a9bf-9d524bf5a329", "d5e061a5-185d-49b4-9cc1-013feb6c6c9d", "ebd042ed-292d-4d30-9da0-d22c8d099d6c", "f982cb3d-81c9-4ecf-84e7-ad8c5b896e50", "ff94d7ff-28d3-4ff2-805b-26b2ace20c2c"], "title": "Eliciting And Connecting Information Requirements: A Study Of Brokering Situations In Data Warehouse Development", "venue": "pacific asia conference on information systems", "year": 2011, "id": "0c8cb22e-5275-4c55-98a7-afa59a0fc2f4"}
{"abstract": "Rough set theory has been attracting researchers and practitioners over three decades. The theory and its applications experienced unprecedented prosperity especially in the recent ten years. It is essential to explore and review the progress made in the field of rough sets. Mainly based on Web of Science database, we analyze the prolific authors, impact authors, impact groups, and the most impact papers in the past three decades. In addition, we also examine rough set development in the recent five years. One of the goals of this article is to use scientometrics approaches to study three decade research in rough sets. We review the historic growth of rough sets and elaborate on recent development status in this field.", "authors": ["Jingtao Yao", "Yan Zhang"], "n_citation": 7, "references": ["00491bda-aedf-4041-9607-e05de9e41828", "0970a53a-1461-4084-b165-cee4791eae60", "0b9943ae-7302-4fa2-9991-3bedeeb9fb15", "0be8cbb6-6fc6-4b69-b014-971b45df35ef", "130241df-030e-469a-822a-65897466a5af", "1a740a4c-b247-40e0-804d-93d69f474b4e", "1d875d66-deda-49b9-b8b5-abb9d83544bd", "3146ec1f-d1e6-4743-bb88-41b41c3bac92", "3f61a962-d24b-48a6-bec2-e09db41679a6", "4a0923dd-8a9e-4af0-9ddb-89cff339b2a2", "4f44ef50-b5a6-48ce-b4a2-5fe208f7d237", "54cdba28-ee3c-4ab3-97f8-a460acbf5bb9", "5586fe69-27f9-4e26-8922-9e7d99b228c7", "59d8963d-741d-45f1-af55-65b343297a4b", "5efb58ee-e983-436c-9c63-f9c356dbac59", "66b473fd-99ff-4726-8d3b-3d361c946af0", "6ebc3fcd-df6d-42c8-bc78-b3d54f3af44c", "728d262c-d832-426b-926a-805a3f5f3e83", "7b0aad61-f1e1-402a-8285-abf50e6046ce", "7f8c54c9-e253-419e-ad92-a1235cac06f3", "8b4f6640-e5da-425c-beb2-512f37735691", "91a5508d-baa5-48e6-be7f-33c9775a6e3f", "9535f9ba-b0f9-4b05-a93a-314ba400cb7a", "95b90002-23c1-4577-b38e-9aabdd4858e3", "975f0e37-1502-4b9d-815b-1473a6bb5554", "993d4630-3e02-46cd-95a3-7c39fe6b8470", "99ce8f78-1b51-4ca7-a48c-050c80436189", "9e5bd0df-5e29-42a5-8f69-451b28de69b5", "9eaa1ee1-99bc-4cce-858d-92dd79a250fb", "9fbb8fa1-a0e3-4792-a96a-31a7b8e36719", "a4589cfe-15e7-4c34-9349-d002d1d2c9df", "a495a0bf-d7d4-41c3-82aa-005d410ea006", "a61e2d39-bc10-46a4-a079-8b0167f26da4", "a8a99319-2bcc-4a12-81be-64b2ae5068da", "abb6edfc-5eb2-4d8c-82db-48a82621c529", "ace947cf-5186-44b8-9d5e-0a82b21a133a", "aeada210-6366-4ee9-8c30-f275f211fe8f", "b1de407e-19d4-4a0f-a4a6-ab451701e205", "b9ee93fa-224e-4450-a20f-1b2a99754d47", "c315c904-4da8-42a5-bd83-9866ef5c34a9", "cfd0333c-7044-414e-ac73-bd9cd97815bd", "cfff3892-760a-4d1a-a8ae-abb924bf9e87", "d21a24fb-c691-4f74-b7fe-623dbe6dc0f2", "d261ca99-ab84-4292-b9bf-934585b881be", "d3fa7dd4-9930-463f-8a8b-06db9f025e62", "d407f39a-92fe-4b3f-983b-53f7f0d05ab7", "dd8d28da-88ab-4d3d-aed1-912ab97cf09a", "e12bac93-20bf-4623-9284-e762ff23c040", "e4f7a2e7-a0f3-4683-b376-98044a72ff7f", "e8857216-9a19-4909-9d80-534a6472922d", "edf1793e-a5db-4032-a800-c738db845208", "ee40ebc6-12fb-4cd7-9916-ff26133007c5", "f37f998d-9db7-4645-bfdb-a5cbff98c276", "fa37e167-9e49-4d2d-a54f-0a2ad1fe1745", "ff6baa6e-97dd-49c9-8e62-0b46e681cf4a"], "title": "A Scientometrics Study of Rough Sets in Three Decades", "venue": "rough sets and knowledge technology", "year": 2013, "id": "0c8fea6a-df23-480b-a67e-9003767efcbc"}
{"abstract": "The appeals for interoperable and decentralized Electronic Identity Management are rapidly increasing, especially since their contribution towards interoperability across the entire \"electronic\" public sector, effective information sharing and simplified access to electronic services, is unquestioned. This paper presents an efficient and user-centric method for storing multiple users' identifiers in X.509 digital certificates while preserving their confidentiality, allowing for interoperable user identification in environments where users cannot be identified by an all embracing unique identifier.", "authors": ["Prokopios Drogkaris", "Stefanos Gritzalis"], "n_citation": 0, "references": ["b68fc787-7817-421e-8e66-8a98ab9db1ad", "f9c5eef3-e804-4416-8244-56315e629e75"], "title": "Attaching multiple personal identifiers in X.509 digital certificates", "venue": "european public key infrastructure workshop", "year": 2010, "id": "0c9164ed-044f-4b8c-ae9d-ec80c5944278"}
{"abstract": "Four front-end processing techniques developed for noise robust speech recognition are tested with the Aurora 2 database. These techniques include three previously published algorithms: variable frame rate analysis [Zhu and Alwan, 2000], peak isolation [Strope and Alwan, 1997], and harmonic demodulation [Zhu and Alwan, 2000], and a new technique for peak-to-valley ratio locking. Our previous work has focused on isolated digit recognition. In this paper, these algorithms are modified for recognition of connected digits. Recognition results with the Aurora 2 database show that a combination of these four techniques results in 40% error rate reduction when compared to the baseline MFCC front-end for the clean training condition, with no significant increase in computational complexity.", "authors": ["Qifeng Zhu 0001", "Markus Iseli", "Xiaodong Cui", "Abeer Alwan"], "n_citation": 21, "references": ["27964664-322e-421f-b525-ea22b4e710ae", "3274a5b8-c9ed-4c94-8732-a9e614681f00", "8a7378ec-c51d-4506-b259-66443e5cde6c", "ba8a80b1-9367-487a-a440-7613d5abda13", "e7ddb08d-46f6-4d32-a6b9-f36638607c45"], "title": "Noise Robust Feature Extraction for ASR using the Aurora 2 Database", "venue": "conference of the international speech communication association", "year": 2001, "id": "0c93141c-4672-4bea-915b-46ec68853a7a"}
{"abstract": "Relevance feedback algorithm is proposed to be an effective way to improve the precision of information retrieval. However, most researches about relevance feedback are based on vector space model, which can't be used in other more complicated and powerful models, such as language model and logic model. Meanwhile, other researches are conceptually restricted to the view of a query as a set of terms, and so cannot be naturally applied to more general case when the query is considered as a sequence of terms and the frequency information of a query tern is considered. In this paper, we mainly focuses on relevant feedback Algorithm based on language model. We use a mixture model to describe the process of generating document and use EM to solve model's parameters. Our research also employs semi-supervised learning to calculate collection model and proposes an effective way to obtain feedback from irrelevant documents to improve our algorithm.", "authors": ["Sheng-Long Lv", "Zhi-Hong Deng", "Hang Yu", "Ning Gao", "Jia-Jian Jiang"], "n_citation": 50, "references": ["01b00e66-1524-4925-8c90-647a6349f990", "0661d9e2-bffe-4a32-8229-b6c08c154793", "3a88eaaf-1956-4fd6-8601-f582c343a8a3", "6a54e65a-d417-472e-b65a-c3e8bbef9a83", "88aac5cb-119b-4c92-8271-d94d51e18b90", "cc4a8a25-44f1-40ea-b67a-2daad6b54cf8", "d3873d22-1eeb-4fef-ba19-0c4f81b3b50d", "f5b13f47-134a-4b0f-9daf-81a44d94d6f2", "fbbe3725-f139-483c-80d3-bd015b133551"], "title": "Fully utilize feedbacks: language model based relevance feedback in information retrieval", "venue": "advanced data mining and applications", "year": 2011, "id": "0c9c8b81-7e97-4277-ac51-0a074eb94b2f"}
{"authors": ["Andrew J. Best", "Balasubramaniam Natarajan"], "n_citation": 0, "title": "Carrier Interferometry/OFDM Performance in the Presence of Multipath and Impulse Noise.", "venue": "international conference on wireless networks", "year": 2004, "id": "0ca08f64-95ad-451a-8c0b-31d82395b1df"}
{"authors": ["Hui Yang", "Rajesh Swaminathan", "Abhishek Sharma", "Vilas Ketkar", "Jason de Lima e Silva"], "n_citation": 3, "references": ["02336222-ebca-4de7-b0e9-9a656c454bac", "07e88ff8-8f96-45e7-97be-1583b238d49d", "203312b9-1b7c-42ee-aacd-90a16412e1a8", "237bf733-61f1-49c1-aa65-3fa0df8a34e4", "2397bc7f-373d-4c30-a39e-1506b049fec2", "3ac6ac87-34a1-4da4-b4d0-2ba204e2c0c5", "3c259702-e442-4dad-b9f9-539c3bfda18d", "4fb87930-7f6c-4f03-ae22-32445138ec83", "533f0376-1fdf-4237-a874-b3e0e1add95e", "54e17abd-d996-4e4e-b0f6-699747bf8989", "5b264ef5-d326-4056-b2ed-b898c1fbb4ce", "5ee1e223-768e-4934-a529-14bc4afe7c21", "65ac0e2b-9b1f-4899-8739-41d20ed6dec6", "676ba424-b02d-42e3-afb3-20b8138bc381", "6c15bf75-1d4e-4b2e-819b-9f664910d083", "707ad313-8047-4f3c-84c0-90cd574aeeec", "7bb21127-98a3-485e-864e-8bfc23bac520", "91033314-dbcc-40d1-b49d-6a35fba616a4", "afda5a93-f9d6-4efd-89d0-3ffe2b16e0f7", "dd40937c-37ad-473f-86f6-d06aacf41f59", "e4ddbe5d-0c8d-4950-b047-e48d1bfcc611", "e60e0069-119c-4ce8-972d-885eb26e8854", "ea1ad010-4789-403d-b2b5-e18b08a531a1", "ed543a19-85d9-427a-a2d3-88e7c59a100e", "f80c6608-0b39-4f77-853a-40dc9f5e260d"], "title": "Mining Biomedical Text towards Building a Quantitative Food-Disease-Gene Network", "venue": "", "year": 2011, "id": "0cb478b6-6b55-4dd7-b7d6-9529c11aaefa"}
{"authors": ["John Rosenberg", "James Leslie Keedy"], "n_citation": 29, "title": "Object Management and Addressing in the MONADS Architecture.", "venue": "", "year": 1987, "id": "0cc17051-bb86-445d-b34e-57e442c4e3f6"}
{"authors": ["Vivy Suhendra"], "n_citation": 10, "references": ["01f9999d-70b1-4cc3-8c49-db98bbe71c2b", "1ed56b13-5e17-4a6c-b882-4a66ccfaecbd", "2141d31d-971b-4fd5-bdeb-6002522f310a", "268eb124-9dca-4feb-a0d7-af936cd7c64b", "3ab62f56-6263-494f-a09b-6e19f818d745", "407fa854-36f0-4fef-b41f-0f5337ed3435", "42aa228c-d608-4d22-9432-c12be9c78c18", "450d4bb6-2482-4f67-9bbf-6ce361cf492e", "4bce15b4-f0e0-4edc-bfd9-8d9403cbc9cf", "4e588588-c8b0-463a-a73c-4de2ecbe37dc", "668ca59f-99e5-4e4a-92f4-06153a597946", "7678e16c-4ef4-4065-8379-465a169cba36", "9fd655b3-e967-4d58-bc0e-a6813e40e72d", "aa615066-c380-4001-be7d-253ebba99423", "b0be615e-37a2-4cc1-879a-2c781438a27b", "b7d66f09-ab65-44c6-b29d-fb5a416d0945", "bd3f6f55-d625-4453-8f7d-66e779956689", "c57b52c3-8d6b-477e-92b4-3659e14ea546", "c57eaecc-996e-4b55-b3d8-76b0a3dc0dae", "ca6b7b18-d26c-4067-87e7-eae2d9714499", "e59e6287-3b9c-4c7a-9c09-f18151790ac4", "e689823d-c399-4224-b0a3-5179ba54ce0d", "ecfb2022-e18c-4e5e-8733-d8bc6f4c8fc9"], "title": "A Survey on Access Control Deployment", "venue": "", "year": 2011, "id": "0ce42e3f-2be2-4ae4-859c-895ac7dc91b0"}
{"authors": ["Marc Abrams"], "n_citation": 6, "title": "Design of a Measurement Instrument for Distributed Systems.", "venue": "measurement and modeling of computer systems", "year": 1988, "id": "0ce9ffa8-46c6-40f2-a515-2a98a15ffa27"}
{"abstract": "In this chapter, I discuss my experiences applying Problem-Based Learn- ing to technical IT courses such as mathematics and computer application design and programming. One of the hallmarks of nearly any technical concentration is a critical need to develop strong individual, and typically challenging, technical skill sets early in the program, and high dependence on these skill sets in later courses, internships, and ultimately professional work or graduate studies. Another hallmark of the IT field is a need for strong metacognitive skills to analyze complex scenarios and the ability to creatively use their technical skill sets to synthesize new solutions and create working systems, much like an artist creates new works. The chapter is a reflection of how I try to: (1) Structure early courses to help stu- dents rapidly gain difficult technical skill sets without crushing their will to contin- ue as a result of harsh weed-out techniques, but at the same time rigorously demand and assess progress; (2) Balance conflicts between the desire for rapid and efficient assessment versus the need for detailed and careful assessment that avoids gaming of the assessment system by students; (3) Gradually push technical students away from memorize-and-regurgitate learning approaches and towards an independent learning model; and (4) Help students make the transition from early individual- ized skill set development to wider-scale analysis and creative synthesis of complex systems.", "authors": ["David R. Mudgett"], "n_citation": 0, "references": [], "title": "Teaching and Learning in Technical IT Courses", "venue": "", "year": 2014, "id": "0cee3929-a4ef-418e-832b-18a1a0a854ee"}
{"authors": ["Yong Chen", "Surendra Byna", "Xian-He Sun", "Rajeev Thakur", "William Gropp"], "n_citation": 0, "references": ["00082f40-6fe1-4d34-8de1-0ef5a73c01c8", "222d319b-108c-4ec2-9ef2-f14beb669e2a", "4f5e1344-8ae4-419b-b120-c99eeb9e9fec", "ba612849-dc68-4538-a157-74314ac7c332"], "title": "2008 International Conference on Parallel Processing September 8-12, 2008 Portland, Oregon Exploring Parallel I/O Concurrency with Speculative Prefetching.", "venue": "international conference on parallel processing", "year": 2008, "id": "0ceec168-5058-4d34-86ad-3bc193b8401f"}
{"authors": ["Frank Philip Seth", "Ossi Taipale", "Kari Smolander"], "n_citation": 50, "references": ["1c4da30f-e01f-456c-8a17-364c21ba2f54", "2d4053db-9f0e-4b30-83ad-f4a08ba1a9e0", "43671a4c-a59c-4b7d-869c-1cb5fe53ac4d", "640e5817-5395-45de-ab5c-a5f4425ac1ca", "8bf33e92-9e15-49f0-92e0-1fb7c5da6580", "920ea0e8-f46c-4357-83b1-e6f69af613f8", "9f41413e-db76-4403-a9af-9896ecc7b231", "aa3f4fe6-7118-4b2f-a036-aead716c624b", "ab9b13fc-9bb9-4be8-b8f8-723d564f4238", "afd63c47-1b9b-4ca0-8693-e8f3efd61b64", "c6a27c8d-2a63-40bc-b2e1-40d04dcc7fd8", "ce8590af-a70c-4370-aa90-35904818b067"], "title": "Role of Software Product Customer in the Bring Your Own Device (BYOD) Trend: Empirical Observations on Software Quality Construction", "venue": "product focused software process improvement", "year": 2014, "id": "0cf6b7ad-c1a5-4602-8bb0-2c30dd0df0cc"}
{"abstract": "This paper discloses the potential of OWL (Web Ontology Language) ontologies for generation of rules. The main purpose of this paper is to identify new types of rules, which may be generated from OWL ontologies. Rules, generated from OWL ontologies, are necessary for the functioning of the Semantic Web Expert System. It is expected that the Semantic Web Expert System (SWES) will be able to process ontologies from the Web with the purpose to supplement or even to develop its knowledge base.", "authors": ["Olegs Verhodubs"], "n_citation": 3, "references": ["0d38a213-4930-450e-9507-dd84f1efba9f", "39a81c3e-46e6-465c-8c61-8fa4d0798c02", "e0f56cf0-5b44-45d3-b1c9-fe3b3f2c377d"], "title": "Ontology as a Source for Rule Generation", "venue": "arXiv: Artificial Intelligence", "year": 2014, "id": "0d18459d-d14d-4de9-8067-7fdf672962a3"}
{"authors": ["Aitor Mendaza-Ormaza", "Oscar Miguel-Hurtado", "Ivan Rubio-Polo", "Raul Alonso-Moreno"], "n_citation": 6, "title": "On-line Signature Biometrics using Support Vector Machine.", "venue": "biometrics and electronic signatures", "year": 2009, "id": "0d6ad586-5a0b-4379-bcef-5c73fb8ff1cf"}
{"authors": ["Owen P. Kenny", "Douglas J. Nelson"], "n_citation": 1, "title": "A model for speech reverberation and intelligibility restoring filters.", "venue": "", "year": 1998, "id": "0d6e73a9-896c-4957-baf2-7a51026826ed"}
{"authors": ["Annan Li", "Luoqi Liu", "Shuicheng Yan"], "n_citation": 50, "references": ["02641dba-51f3-493d-9085-48df3c646b60", "08bda27c-51a5-472f-b3a9-b44c951e3003", "0abd55df-41fe-48c5-a2f0-d09bdf4cca77", "170ee4dc-25d3-4227-a140-4d646ef586bd", "3634361a-34df-4b9e-924e-93baa70c00a6", "3c282c8c-de5c-4110-b681-c2489494fa22", "3c56cdac-160a-48ab-900e-bf29dff5374e", "3c84199b-49c7-4adb-804a-7c42ef15bfc0", "4c2ef1d4-9837-4239-8b08-0270c1ff0a62", "4cbd7765-c47a-4004-a5f8-c2da7c7d1c7b", "5965ec81-fe04-48a3-b573-f61f80708ea1", "7707af1c-6e64-4ce9-86f1-10dba228a3f1", "7f8246d2-9c49-4637-992a-246c01c188f3", "84bf3e86-4a8b-427c-aa89-251011b63f1b", "8d233be0-dfb9-4228-931b-2ea36edb3a81", "8e705325-4a89-44b1-8ee5-5a5331771ab8", "936ea7c7-0d10-461a-b7c0-c33c976708b1", "ac3a4ff4-f8cf-49f1-a1c4-cf57d1936355", "c542d360-a1f1-43d8-81f7-572e41546ac9", "d75f054e-b4b1-4777-9574-f61cc08013fb", "dd83785a-dd19-41e3-9b25-ebabbd48d336", "e4ec2acd-9be1-41b1-ac5f-4fe78f549c7c", "f2d49150-35de-4fd5-ac46-eb071d1cc73e"], "title": "Person Re-identification by Attribute-Assisted Clothes Appearance", "venue": "", "year": 2014, "id": "0d781e47-7a60-4929-83f4-9d1b339544e8"}
{"authors": ["Alberto O. Mendelzon"], "n_citation": 0, "title": "Editorial - Objects, Databases, and the WWW.", "venue": "Theory and Practice of Object Systems", "year": 1998, "id": "0d9d0e38-d472-4dc9-84dd-76b38d8ac6b7"}
{"authors": ["Im\u00e8ne Bessedik", "Noria Taghezout"], "n_citation": 0, "references": ["0fbb5be4-c693-43c5-8063-9a4ada8dbac7", "37126866-e0ac-46f6-a85a-61c73b546464", "37abbba9-a21b-47ff-895f-5f65cd9f0ef8", "3ca34745-c931-408b-ab66-c7a1d1000c21", "4006e468-bf7c-4d77-b001-058eed3f1bc1", "45e8c35d-08fa-4f8d-a017-d582cbfe2ddf", "485ca9b4-0855-4fa7-bef1-e95aaa7595d0", "56a2e34e-363f-4998-98df-28e81c970052", "a320ab88-82a6-402b-a687-06e601aaf3b4", "b0c5fc63-51a5-4a70-a908-8dde4b14fede", "b34481a0-a0ef-4886-b346-0b51a0aa22d8", "bcf53f76-5f61-4d19-91aa-f0831837fb14", "c8fbd62d-5ee6-4296-baf1-49fa03cc6601", "fbde16b8-670c-47aa-a559-6d1c5418af17", "fc724a1e-e503-4967-b02f-3f30c451b3dd"], "title": "A Multi-agent Framework for a Web-based Decision Support System Applied to Manufacturing System.", "venue": "", "year": 2009, "id": "0dbd4ad0-6a3f-430e-846d-ed62e7c45e60"}
{"authors": ["Marc Frappier", "Beno\u00eet Fraikin", "Fr\u00e9d\u00e9ric Gervais", "R\u00e9gine Laleau", "Mario Richard"], "n_citation": 17, "references": ["141b5472-fb38-438e-971b-5704d35c671b", "230570ae-0f29-4b0e-b24a-c4dbc8d58959", "41a204bc-ddd0-4120-8983-bead8fe38fdc", "5d64ab8c-c9e4-4f21-83f0-46d8477350b3", "62dd418b-ebfb-416b-8d93-251fb8fb21c8", "657fd54f-e635-4dee-aa25-8107068c030b", "74fbab4b-f74a-4918-9680-978617282d4f", "858b4767-ab93-4123-ac68-a18633ed8722", "b246ad5d-da56-4c0c-898a-699de6caf193", "b3a3a4a6-d8ce-4167-99a2-5412fe69902f", "c67fd4a0-59fa-49ed-b7eb-e3ca850bc1b0", "d31adb49-7a4d-4fdd-8b05-b1ad01ccee57", "f3154a05-2df8-478a-afd2-060ed0f54bf6"], "title": "Synthesizing Information Systems: the APIS Project.", "venue": "research challenges in information science", "year": 2007, "id": "0dd26308-521f-48ee-89c0-847c3160bcc5"}
{"authors": ["Aistis Raudys", "Vaidotas Len\u010diauskas", "Edmundas Mal\u010dius"], "n_citation": 50, "references": ["0ce1a66a-c563-48cf-b5f6-9a1c978ed983"], "title": "Moving Averages for Financial Data Smoothing", "venue": "", "year": 2013, "id": "0dd3d713-9b86-42d5-881f-af336a52b8bd"}
{"abstract": "It is well known that, as the dimensionality of a metric space increases, metric search techniques become less effective and the cost of indexing mechanisms becomes greater than the saving they give. This is due to the so-called curse of dimensionality. One effect of increasing dimensionality is that the ratio of unit hypersphere to unit hypercube volume decreases rapidly, making the solution to a similarity query (the query ball, or hypersphere) ever more difficult to identify by using metric invariants such as triangle inequality. In this paper we take a different approach, by identifying points within a query polyhedron rather than a ball. We show how this can be achieved by constructing a surrogate metric space, such that a query ball in the surrogate space corresponds to a polyhedron in the original space. If the polyhedron contains the ball, the overall cost of the query is likely to be increased in high dimensions; however, we show that shrinking the polyhedron can capture a surprisingly high proportion of the points within the ball, whilst at the same time giving a more efficient, and more scalable, search. We show results which confirm our underlying hypothesis. In some cases we can retrieve significant volumes of query results from spaces which are otherwise intractable.", "authors": ["Richard C. H. Connor", "Stewart MacKenzie-Leigh", "Robert George Moss"], "n_citation": 0, "references": ["0b95a5f9-903e-48b8-b51e-61293f0df6d2", "42554d5b-2dd8-4e46-8c11-334f4aa4ae3a", "4a57f54d-7af6-438e-b731-6cd7edbe7bfa", "4e132d4a-8823-4c38-98b3-6071bdc12ddf", "535da5d6-9841-40ce-b9e4-69fd6b855f93", "79ece8f8-0e7b-44b8-b89d-f0ee98c88835", "7ee8487b-7253-4e84-9fe8-93f9eedd7b62", "907c0462-8da4-4a42-9d86-c0c99c2fede4", "aa93a6aa-068f-4c04-a7a2-46a39aa260ca", "ab3afb93-8ca0-4556-ae60-11199dc263c2", "c8f294f4-4cb8-4daf-a850-8f1f105e0c5d", "cfc92c81-c2a2-4148-8bc0-2001d6117bb8", "eec1aacd-bae4-46fb-bc8c-0f5a1267d626"], "title": "High Dimensional Search Using Polyhedral Query", "venue": "similarity search and applications", "year": 2014, "id": "0dd4e5b5-cbf5-4a46-bdee-853096489520"}
{"authors": ["Tim Reichling", "Andreas Becks", "Oliver Bresser", "Volker Wulf"], "n_citation": 6, "title": "Koordinationswerkzeuge zur Bildung von Lerngruppen.", "venue": "", "year": 2004, "id": "0dd5cb6a-82c9-4b3f-8b66-1cd3bd01d610"}
{"authors": ["Yoshihiro Kawai", "Fumiaki Tomita"], "n_citation": 4, "references": ["639547ef-90d2-47f1-adf9-b41200926918", "66766617-d1ac-4a2c-b5dc-9b72c9d9dac4", "7e8da9a2-2382-4d7f-b0b9-64e485e85555", "f7037864-4b92-437b-a90e-509d4ec350c8", "f77d869a-d411-483e-9eb7-6fd3dc317490"], "title": "Intensity Calibration for Stereo Images Based on Segment Correspondence.", "venue": "Journal of Machine Vision and Applications", "year": 1998, "id": "0dfcafae-b287-4f99-90cf-0e2875e97b59"}
{"authors": ["Jianying Gu", "Jennifer L. Neary", "Audrey Moshfeghian", "Hong Cai", "Sos S. Agaian", "Timothy Lilburn", "Yufeng Wang"], "n_citation": 0, "title": "Lineage Specific Expansion in Vibrio Species.", "venue": "", "year": 2007, "id": "0dfeac2c-36e0-46a7-aa63-023708d367ab"}
{"authors": ["Chunfeng Liu", "Haiming Wu", "Jincai Chang"], "n_citation": 0, "references": [], "title": "Research on a Class of Ordinary Differential Equations and Application in Metallurgy", "venue": "", "year": 2010, "id": "0e05b850-fa4b-4885-ad2e-755944b8026f"}
{"authors": ["Jon T. Butler"], "n_citation": 0, "title": "Multiple-Valued Logic - Guest Editor's Introduction.", "venue": "IEEE Computer", "year": 1988, "id": "0e063e54-b71f-4207-9677-4074899634be"}
{"abstract": "Many annotation tasks in computational linguistics are tackled with manually constructed pipelines of algorithms. In real-time tasks where information needs are stated and addressed ad-hoc, however, manual construction is infeasible. This paper presents an artificial intelligence approach to automatically construct annotation pipelines for given information needs and quality prioritizations. Based on an abstract ontological model, we use partial order planning to select a pipeline's algorithms and informed search to obtain an efficient pipeline schedule. We realized the approach as an expert system on top of Apache UIMA, which offers evidence that pipelines can be constructed ad-hoc in near-zero time.", "authors": ["Henning Wachsmuth", "Mirko Rose", "Gregor Engels"], "n_citation": 5, "references": ["03f4361e-e252-46f0-a6b3-766a35cc16ca", "0a72fadc-7a2e-43f7-b2e3-21a5a7ec0d1e", "380ce983-19cd-4292-b741-18dd02768964", "4fe39d4a-0427-4878-b585-30c1f75fcb8a", "57a70ffc-e3b7-4547-adae-d59e12c9e50d", "640c2316-b195-44b9-9e82-18db188130ef", "6e0e444a-a974-4d7d-8166-368cd702dc37", "837f98b0-21a8-4cd4-863e-071dda1fa615", "88591ede-7bf5-44a8-8b8a-30d311bb886b", "89c4c986-221a-4ed8-b8bb-30499c84d53b", "b5f74013-faee-4012-b503-90408f4cea95", "c82ee9a9-fe7d-44bb-aafb-96173675eec8", "d8b485d0-701b-447f-880b-2908f6e2f8cd", "eeee0b01-dd70-4c8d-862a-104194bcf04b", "fd84301d-d771-4cc8-8b57-56b9692dad38", "fea77781-83eb-466e-86bc-0515f2dc85d3", "ffad9620-16a2-4b48-ad28-bebfc84686a6"], "title": "Automatic pipeline construction for real-time annotation", "venue": "international conference on computational linguistics", "year": 2013, "id": "0e08de32-0004-40d3-8d99-ea9713f79aae"}
{"abstract": "Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order logics, without function symbols. Sound and complete reasonings w.r.t. associated logic formulas are obtained through a kind of graph homomorphism called projection. Conceptual Graphs Rules (or CG rules) are a standard extension to SGs, keeping sound and complete reasonings w.r.t. associated logic formulas (they have the same form as tuple generating dependencies in database): these graphs represent knowledge of the form \u201cIF ... THEN\u201d. We present here an optimization of the natural forward chaining algorithm for CG rules. Generating a graph of rules dependencies makes the following sequences of rule applications far more efficient, and the structure of this graph can be used to obtain new decidability results.", "authors": ["Jean-Fran\u00e7ois Baget"], "n_citation": 18, "references": ["08b25a74-67b0-4c1f-a134-83f469998dcc", "1b978417-c775-4777-bad6-ee3ee15f2025", "4fdd4ebe-cf78-40cc-b19a-ef0a6664e236", "9f413072-61a3-4bc3-a3c3-30fb8bc8830d", "baa948cb-b9cb-43bb-a083-dfd63001ca5d", "f2fc3cbe-8745-4e1b-902b-9109c3e58a77"], "title": "Improving the Forward Chaining Algorithm for Conceptual Graphs Rules", "venue": "principles of knowledge representation and reasoning", "year": 2004, "id": "0e0a6a83-161e-4f17-9d2e-411615a7fb83"}
{"abstract": "In terms of supervised face recognition, linear discriminant analysis (LDA) has been viewed as one of the most popular approaches during the past years. In this paper, taking advantage of the equivalence between LDA and the least square problem, we propose a new fusion method for face classification, based on the combination of least square solutions for local mean and local texture into multiple optimization problems. Extensive experiments on AR_Gray and Yale face database indicate the competitive performance of the proposed method, compared to the traditional LDA.", "authors": ["Yuting Tao", "Jian Yang"], "n_citation": 50, "references": ["17373dba-934f-4ae0-bb50-8cc00dd7c19f", "630a9813-e6ee-4a8f-a24f-4c6d205eee32", "e2204e92-e6dc-4884-9bbc-200029491fc7", "e3a5cec9-7e82-4c14-86ab-0d95a92712a7"], "title": "Fusion of local features for face recognition by multiple least square solutions", "venue": "", "year": 2012, "id": "0e0ca9b6-9d87-46f3-b915-9cce3bc2954b"}
{"authors": ["Nasser Sherkat", "Chi-Hsien Victor Shih", "Peter Thomas"], "n_citation": 50, "references": ["c3bcea28-aa48-49ee-9d5c-0d21d44cb98a"], "title": "A Fuzzy Reasoning Rule-Based System for Lace Pattern Detection.", "venue": "Journal of Machine Vision and Applications", "year": 1994, "id": "0e10437a-7ad2-45ff-8a1f-c73da61297cf"}
{"authors": ["Joaquin Gracia", "Juan Carlos Baraza", "Daniel Gil", "Pedro J. Gil"], "n_citation": 8, "references": ["09c27f8a-5ec2-48d9-8394-c4aae5e75165", "cd3613c5-4424-4167-8d48-7356f74d9764"], "title": "A Study of the Experimental Validation of Fault-Tolerant Systems Using Different VHDL-Based Fault Injection Techniques.", "venue": "international on-line testing symposium", "year": 2001, "id": "0e25e5c5-b837-4b36-b651-f6bd83dbd84e"}
{"authors": ["Jo\u00e3o Pedro Cerveira Cordeiro", "Gilberto C\u00e2mara", "Ubirajara F. Moura", "Cl\u00e1udio Clemente Faria Barbosa", "Felipe Schaedler de Almeida"], "n_citation": 50, "references": ["68f92f8f-864f-4da2-8916-fa86a4be9c05", "9ed6c6f8-d94f-49a9-9de1-edad4c977ad4", "fa0b4274-c58c-464c-9e29-dc87e62b414f"], "title": "Algebraic Formalism over Maps.", "venue": "brazilian symposium on geoinformatics", "year": 2005, "id": "0e2b4274-a09e-4324-88b0-d99c3d761b38"}
{"abstract": "Presently, retrieving images from a digital library requires different retrieval techniques to those used to retrieve text documents. In this paper, we demonstrate the possibility of converting the contents of images into texts, which enables us to utilise text-base retrieval techniques for image retrieval. The potential advantages and applications of this approach are also illustrated in this paper.", "authors": ["Shyh Wei Teng", "Kai Ming Ting"], "n_citation": 0, "references": ["b9764420-1418-41c5-a517-f39091d84a0d", "e59269c2-72bb-4392-b786-5b3b43f9e88e", "ed2ce4a3-8d0f-44cd-b89e-5eacc3632711"], "title": "Ehipasiko: A Content-based Image Indexing and Retrieval System", "venue": "active media technology", "year": 2006, "id": "0e320aef-3a6b-44b7-a9a9-685b1bcbe91b"}
{"authors": ["Andy Hospodor", "Ethan L. Miller"], "n_citation": 0, "references": ["387ef962-bbd0-4e7e-acc1-96c66fa156be", "6e95430e-5563-482f-b546-f30085d151e2", "772254ca-a3dc-4911-a083-f8efa2fb730d", "8c776548-3673-434f-af70-cd21a390ff87", "aa83d655-ac5b-42f6-8200-78929e22b66d"], "title": "Interconnection Architectures for High-Performance Object-Based File Systems.", "venue": "", "year": 2004, "id": "0e3f2d29-11fb-41ac-b5dc-860cd19a76a1"}
{"authors": ["Marco Cadoli", "Marco Schaerf"], "n_citation": 19, "title": "Approximation in Concept Description Languages.", "venue": "principles of knowledge representation and reasoning", "year": 1992, "id": "0e646938-e772-45da-9cff-68004c4763ff"}
{"authors": ["Yohsuke Kinouchi"], "n_citation": 0, "title": "Oscillatory modes in a neuronal network model with transmission latency", "venue": "Chemistry and Physics of Lipids", "year": 2002, "id": "0e68f6ac-6952-4469-a0a1-6758f9af87b2"}
{"authors": ["Lei Zhang", "Xuan Zhang", "Meiping Chai", "Yibing Tan", "Shigeru Miyake", "Yoji Taniguchi", "Jun Hosoya", "Ryota Mibe"], "n_citation": 2, "references": ["3e3b524c-70c5-4008-b349-fd7ae950e655", "4929a7b3-0d81-4123-973a-82b075304713", "563bdfaf-91c2-4440-b146-54954bf7ee48", "6e9dad6f-50db-467b-959c-18881450ee2f", "a1485664-bc1c-4cc7-9cc2-6234571d4a70", "de8bc699-183a-4e37-8883-c01565ccfe4f", "e41c93b8-75b8-48b5-a5ad-5c2833f7cd0d", "e8218c23-52bb-4ec8-9574-98181f7e38bd"], "title": "Solution Proposals for Japan-Oriented Offshore Software Development in China", "venue": "international conference on software engineering", "year": 2009, "id": "0e6ce7a9-6456-437b-9f3f-4bda192a6fae"}
{"authors": ["Lucas Paletta", "Gerhard Paar"], "n_citation": 0, "references": ["41b26b0a-076d-464e-a3b9-5a20aee27b84", "4423e524-cda6-4d7b-a81f-1fad66125b04", "5ebbd1f5-dfe5-4eec-9883-b8b5efea366c", "60985c9a-ca14-4324-882d-95cedabefdeb", "6e8cc926-79a1-4676-a2bd-f9d49f3144cf", "96a2b29f-1fc2-4b2e-91ba-cfc2973929cc", "9ecf11c2-77ec-4629-8a67-a45e07a4c4fc", "e4bd826f-8762-4186-abf0-94b28342c79b", "ed6148cb-70c1-4732-9958-060ecfe47b5d"], "title": "Dynamic Multi-Cue Information Fusion for Robust Detection of Traffic Infrastructure.", "venue": "Journal of Machine Vision and Applications", "year": 2002, "id": "0e776a6a-3975-4685-b6c4-17ad1422c901"}
{"authors": ["Sherif M. Yacoub", "Hany H. Ammar"], "n_citation": 29, "title": "Finite State Machine Patterns.", "venue": "", "year": 1998, "id": "0e892bc6-bb00-46e0-9ac6-9a49b5fc19db"}
{"authors": ["Dennis Abts"], "n_citation": 12, "references": ["023f7ca3-15c8-4869-81bf-a5e65925104b", "2dacd005-7b11-421d-bad3-8377b2a1db4c", "4dc3293f-a5fd-4d91-b53b-a964b090d7e0", "73739568-56c1-4153-a32c-3961d4edb81f", "9f17cf51-a348-4a29-87be-76a627e240a4", "c629aa2c-f5ee-4dda-a86a-11955ef81277", "e3921df5-00a4-4ca4-85f8-96cf0aea79af", "e7b327d7-c44f-416b-80a5-f13af22a8e3f", "f0931af9-3c18-41ae-9a02-1b09d3115f11"], "title": "Cray XT4 and Seastar 3-D Torus Interconnect", "venue": "parallel computing", "year": 2011, "id": "0e8e1246-b8c4-4ac9-9254-2a4a650c582b"}
{"authors": ["Marco Corazza", "Stefania Funari", "Riccardo Gusso"], "n_citation": 0, "references": ["4343ec02-e078-4386-85bb-b6c7e27b1690", "5c2eeea2-0691-4db5-95dd-3610dc5864f2", "769b247a-e951-464b-906d-5e6a81470766", "da29f35e-4c10-44de-8384-c24a3e1a297e"], "title": "A Methodological Proposal for an Evolutionary Approach to Parameter Inference in MURAME-Based Problems", "venue": "italian workshop on neural nets", "year": 2014, "id": "0e9922a9-05b6-4ab7-a01e-5232a6f3aaf6"}
{"abstract": "We present an architecture and software framework for semantic allies: Semantic systems that complement existing software applications with semantic services and interactions based on a background ontology. On the one hand, our Semantic Alliance framework follows an invasive approach: Users can profit from semantic technology without having to leave their accustomed workflows and tools. On the other hand, Semantic Alliance offers a largely application-independent way of extending existing (open API) applications with MKM technologies. Semantic Alliance framework presented in this paper consists of three components: i.) a universal semantic interaction manager for given abstract document types, ii.) a set of thin APIs realized as invasive extensions to particular applications, and iii.) a set of renderer components for existing semantic services. We validate the Semantic Alliance approach by instantiating it with a spreadsheet-specific interaction manager, thin APIs for LibreOffice Calc 3.4 and MS Excel'10, and a browser-based renderer.", "authors": ["Catalin David", "Constantin Jucovschi", "Andrea Kohlhase", "Michael Kohlhase"], "n_citation": 50, "references": ["02971f2f-01b0-4330-ab05-78b330fb656b", "147e55df-c943-47dd-904d-6cc2423edc47", "2e3c8031-1b4c-40c0-ad62-b266210411ee", "2f0291ba-1117-4ee8-8476-98496a86aa9a", "42ef7bbd-7370-4e33-bfef-776b94137618", "4a8db9e7-6c0b-45e5-bb1b-b255ccd5d2ed", "5532d469-9765-436e-80d9-01634fd40d87", "5b2552a1-70ad-4d98-aa93-5631add5ed86", "5ffb4bfe-5b77-49c0-991f-94d62e37a7de", "6faf8814-a451-4099-8562-0e4e876d46ae", "a01490bb-0f52-47de-8dcd-8b7b5cc7d2e4", "a5ce12a9-812a-410a-9fd9-31e5345b4754", "b823bdad-034d-4645-b33b-5836671887d6", "d0dff712-e351-4b4e-8097-2e8e0e0d4f9c"], "title": "Semantic Alliance: a framework for semantic allies", "venue": "", "year": 2012, "id": "0ea204b7-6fdf-45e3-a4a6-075b05bbf71c"}
{"abstract": "Organizations are a powerful way to coordinate complex behavior in human society. Thus, human organizations can serve as a basis for better understanding and designing open multi-agent systems. Organizational models have been recently used in agent theory for modelling coordination in open systems and to ensure social order in multi-agent system applications. This work discusses several organizational features of organization-oriented multiagent system methodologies and analyzes whether they take into account human organizational designs. Moreover, several guidelines that any organization-oriented MAS methodology must take into account are proposed.", "authors": ["Estefania Argente", "Vicente Juli\u00e1n", "Soledad Valero", "Vicente J. Botti"], "n_citation": 1, "references": ["365ac4aa-5611-41ad-8018-6dba33f27ada", "7281029e-9726-4dfb-b64e-fbc1d4cc3c13", "87806e77-2ac7-4cd6-8bdf-2dca42ee3f8c", "9b9c464b-2a7e-4063-b2f3-0c1653964207", "bff54864-b50e-4ed1-b44d-e45c74526cee", "e852dced-1395-486e-be34-42889ac69e91", "f7ac93a4-0033-4b64-b09f-f6d34ca695a6", "faedc70d-a701-41e9-97eb-d662199f8baa"], "title": "Towards an Organizational MAS Methodology", "venue": "", "year": 2005, "id": "0ea35efb-4f82-4d90-a274-3580eeb95ba4"}
{"abstract": "Accurately locating users in a wireless environment is an important task for many pervasive computing and AI applications, such as activity recognition. In a WiFi environment, a mobile device can be localized using signals received from various transmitters, such as access points (APs). Most localization approaches build a map between the signal space and the physical location space in a offline phase, and then using the received-signal-strength (RSS) map to estimate the location in an online phase. However, the map can be outdated when the signal-strength values change with time due to environmental dynamics. It is infeasible or expensive to repeat data calibration for reconstructing the RSS map. In such a case, it is important to adapt the model learnt in one time period to another time period without too much recalibration. In this paper, we present a location-estimation approach based on Manifold co-Regularization, which is a machine learning technique for building a mapping function between data. We describe LeManCoR, a system for adapting the mapping function between the signal space and physical location space over different time periods based on Manifold Co-Regularization. We show that LeManCoR can effectively transfer the knowledge between two time periods without requiring too much new calibration effort. We illustrate LeMan-CoR's effectiveness in a real 802.11 WiFi environment.", "authors": ["Sinnojialin Pan", "James Tin Yau Kwok", "Qiang Yang", "JeffreyJunfeng Pan"], "n_citation": 95, "references": ["463395aa-a071-4486-800b-0d73942a1786", "565cbb5e-981b-4f7b-bba9-b9520c674f4c", "6ad3f9de-ac57-4051-9fe0-8d44e5be86b1", "76af63ce-91b3-4f77-8534-50135bdae74f", "81a77512-99d1-4b1d-af2f-2ef56a51fc70", "81b12e54-fba3-43df-930d-ed1b4dbd0661", "98b907cd-3c27-4be0-9bad-2ade8d45dbd1", "9b589c09-e3b0-43d2-a1f7-c8d56a5c5e45", "a083a1b9-8dfb-45d6-99a9-fa30c4a6e9f5", "b0c0dea8-bb68-45af-92ef-4ae846c6bcab", "c1c9f3f1-446f-492a-929a-b0629b163d72", "c9820b80-35f6-48c0-b3ff-561c39d0ad34"], "title": "Adaptive localization in a dynamic WiFi environment through multi-view learning", "venue": "national conference on artificial intelligence", "year": 2007, "id": "0eb354cc-0423-4717-985b-4066e2605c47"}
{"abstract": "Intelligent robot control using multiprocessors, sensors, and actuators requires real-time flexible networks for communicating various types of real-time data, e.g., sensing data and interrupt signals. Furthermore, serial data transfer is required for implementing the network using a few wiring lines. To meet these requirements, we propose a CDMA serial communication interface utilizing novel two-step synchronization. The transmitter and receiver chip fabricated with 0.25\u00b5m digital CMOS technology achieved 2.7Gcps (chips per second) and 7-multiplex communication. The experimental interface board was developed for demonstrating flexible transfer of multiimage data by installing CDMA chips in addition to an FPGA.", "authors": ["Mitsuru Shiozaki", "Toru Mukai", "M. Ono", "M. Sasaki", "Atsushi Iwata"], "n_citation": 0, "references": [], "title": "A 2.7 Gcps and 7-Multiplexing CDMA Serial Communication Chip for Real-Time Robot Control with Multiprocessors", "venue": "", "year": 2005, "id": "0ebc915e-9919-49bf-86f7-e3f7a3b94d14"}
{"authors": ["Jeffrey M. DiCarlo", "Brian A. Wandell"], "n_citation": 24, "references": ["93378e13-0f38-429d-964b-abf990d6a37d", "fa8167b1-8d7a-482c-b0d6-07ca5db8d823"], "title": "Illuminant Estimation: Beyond the Bases.", "venue": "color imaging conference", "year": 2000, "id": "0edc42dd-e13c-454b-904c-91d1261acf56"}
{"authors": ["Hannes Kenngott", "Jochen Neuhaus", "Carsten N. Gutt", "Ivo Wolf", "Hans-Peter Meinzer", "Marcus Vetter"], "n_citation": 2, "references": ["a00b26f6-367f-4913-ba84-91853ddd2fa3"], "title": "Entwicklung eines Navigationssystems f\u00fcr die telemanipulatorgest\u00fctzte Oesophagektomie", "venue": "", "year": 2006, "id": "0eed3b89-28df-48fd-a988-3b14aaee50f2"}
{"authors": ["Murat Komesli", "Tuncay Ercan", "G\u00f6k\u00e7e \u00d6zdemir"], "n_citation": 0, "references": ["703bc466-37a1-4d4f-994b-88700285f3db"], "title": "OWL Ontology Development for Destination Marketing", "venue": "metadata and semantics research", "year": 2011, "id": "0ef1cf4b-4010-4e3c-84e6-c389ba675bb8"}
{"authors": ["Akio Sashima", "Koichi Kurumatani"], "n_citation": 3, "references": ["2d619c11-b749-4a60-b083-882b2c82e3a3", "377c3a5e-b6da-4979-96f3-a715eac7afea", "39d8aa81-2208-44d2-8499-61c87c173a71", "82cba6f2-8a58-49d4-a6c0-a8d29dd829c3"], "title": "MAEP: A Standard Communication Protocol for Artificial Economy - An Instance of X-SS.", "venue": "", "year": 2002, "id": "0ef2a082-8233-47af-9085-090e68364484"}
{"abstract": "Knowledge of how a science data product has been generated is a critical component to determining its fitness-for-use for a given analysis. One objective of science information systems is to allow users to search for data products based on a wide range of criteria; spatial and temporal extent, observed parameter, research domain, and organizational project are common search criteria. Currently, science information systems are geared towards helping users find data, but not in helping users determine how the products were generated. An information system that exposes the provenance of available data products, that is what observations, assumptions, and science processing were involved in the generation of the data products, would contribute significant benefit to user fitness-for-use decision-making.#R##N##R##N#In this work we discuss semantics-driven provenance extensions to the Virtual Solar Terrestrial Observatory (VSTO) information system. The VSTO semantic web portal uses an ontology to provide a unified search and product retrieval interface to data in the fields of solar, solar-terrestrial, and space physics. We have developed an extension to the VSTO ontology that allows it to express item-level data product records. We will show how the Open Provenance Model (OPM) and the Proof Markup Language (PML) can be used to express the provenance of data product records. Additionally, we will discuss ways in which domain semantics can aid in the formulation - and answering - of provenance queries. Our extension to the VSTO ontology has also been integrated with a solar-terrestrial profile of the Observation and Measurement (OM we utilize this integration to connect observation events to the data product record lineage.#R##N##R##N#Our additions to the VSTO ontology will allow us to extend the VSTO web portal user interface with search criteria based on provenance and observation characteristics. More critically, provenance information will allow the VSTO portal to display important knowledge about selected data records; what science processes and assumptions were applied to generate the record, what observations the record derives from, and the results of quality processing that had been applied to the record and any records it derives from. We conclude by showing our interface for showing record provenance information and discuss how it aids users in determining fitness-for-use of the data.", "authors": ["Stephan Zednik", "James R. Michaelis", "Peter A. Fox"], "n_citation": 0, "title": "Integrating provenance into an operational data product information system", "venue": "international provenance and annotation workshop", "year": 2012, "id": "0f00aaf2-fa52-45eb-aaa7-3a185825a36c"}
{"abstract": "This study is focused on querying accomplished on structured spaces of information. Querying is understood in terms of mining structures of information and of knowledge understanding. We consider information as a subject of descriptions expressed in some language. Information is hidden behind such descriptions. Operations done on structured spaces of information are performed on language constructions describing such structures. However, automatic operations not always can be performed directly on language constructions. In such cases it is necessary to expand performance to the space of information. The study concerns paginated (i.e. printed and handwritten) music notation. It is shown that querying in the space of music information requires syntactic structuring as well as its expansion to semantic analysis. It is worth underlining that data understanding requires analysis of uncertainty: analyzed data are usually incomplete, uncertain and with some incorrectness. Such imperfectness of information is hidden under the level of syntax and semantics. Due to limitation of the paper this problem is not studied.", "authors": ["Wladyslaw Homenda", "Mariusz Rybnik"], "n_citation": 5, "references": ["0ebb0b84-824a-47c4-8daf-3ef005e1aafc", "1a4c73cc-532a-42f0-bb59-0489f33c9640", "1dd6aa6d-f794-4153-85e9-84b626cf49f2", "7f1cde3b-b069-4245-8dbb-510cf42974f7", "b60d309d-11f0-424e-8ad0-db741eabb70d", "ee80ce42-8969-4006-b0e3-1fa8f69c69d1"], "title": "Querying in spaces of music information", "venue": "", "year": 2011, "id": "0f27b0a9-4520-44e7-a589-4b9ab4248821"}
{"abstract": "Agriculture is the dominant sector in the Ethiopian economy but it is characterized by low productivity. Ethiopia is interested in creating access to agricultural knowledge through an agricultural knowledge management system (AKMS). Such a system has been developed using a web-based portal named Ethiopian Agriculture Portal (EAP). It is facilitated through Woreda Knowledge Centers (WKCs) which are in 10 Pilot Learning Woredas (PLW). Providing knowledge in the appropriate format, identification of affordable technological infrastructure, and integrating indigenous agricultural knowledge into the knowledge system is vital to empowering development agents (extension workers) in Ethiopia. This study addresses two research questions: 1)To what extent does the centralized AKMS support WKCs access and utilization of agricultural knowledge? 2) How can the existing AKMS support capturing and sharing of indigenous agricultural knowledge and best practices?", "authors": ["Monica J. Garfield", "Getahun Semeon Weldemariam", "Million Meshesha", "Dessa David"], "n_citation": 0, "references": ["68767263-e39e-4870-aa6c-444e6d6e76b9"], "title": "Agricultural Knowledge Management Systems in Practice: The Ability to Support Wereda Knowledge Centers in Ethiopia", "venue": "", "year": 2013, "id": "0f3ee71a-eaa8-4838-a2e0-2f4d50d33f99"}
{"abstract": "It has been widely observed that different NLP applications require different sense granularities in order to best exploit word sense distinctions, and that for many applications WordNet senses are too fine-grained. In contrast to previously proposed automatic methods for sense clustering, we formulate sense merging as a supervised learning problem, exploiting human-labeled sense clusterings as training data. We train a discriminative classifier over a wide variety of features derived from WordNet structure, corpus-based evidence, and evidence from other lexical resources. Our learned similarity measure outperforms previously proposed automatic methods for sense clustering on the task of predicting human sense merging judgments, yielding an absolute F-score improvement of 4.1% on nouns, 13.6% on verbs, and 4.0% on adjectives. Finally, we propose a model for clustering sense taxonomies using the outputs of our classifier, and we make available several automatically sense-clustered WordNets of various sense granularities.", "authors": ["Rion Snow", "Sushant Prakash", "Daniel Jurafsky", "Andrew Y. Ng"], "n_citation": 73, "references": ["11d6d688-f542-4d4e-8a9e-50150c7f08e3", "3cb76cc7-f94b-4648-904f-f201ff22e3ad", "3f1763a5-473c-4e5c-94fa-454cc860712c", "4a23bcc9-2320-4889-b7c3-6c01f4204051", "5217c53d-0ae2-4127-951b-cf55269a013f", "693f01b1-a59e-4e2c-bbde-f2e0923e39b8", "69df0789-a06f-4166-9c34-93047de2673d", "6b556b52-df8a-4587-bc75-9d3730b87a70", "7f0d4b60-4c1b-4bcd-91ac-78fa596c304c", "8645143e-5049-4e4a-8d70-fefdbb347a99", "8717e743-62ea-44f7-b8a9-fe9239859554", "8876115b-93b8-4f61-b5b2-46e9e273b74b", "892d5d27-8e30-4ab2-b157-3eb1639e2a1d", "c2403eb1-6c4d-4c0d-b15f-80526f24141c", "c85d03bd-c71b-4995-b48d-907219ea38a3", "cbed8d6e-5287-404f-bc5c-1f6e2a7db907", "ccd672d4-2f77-471e-abfc-cae8abd6ec16", "ed8f96b0-dd29-4a5d-8af6-dc1d3ae400a6"], "title": "Learning to Merge Word Senses", "venue": "empirical methods in natural language processing", "year": 2007, "id": "0f41bbcc-4343-4fe6-adbc-449478441cea"}
{"authors": ["Nematollaah Shiri", "Zhi Hong Zheng"], "n_citation": 6, "references": ["1362de0c-a571-494c-a0d8-a2ce95e5dada", "20405b87-b1dd-445a-a8a2-1e820548f000", "20baead4-8302-4520-a7d7-dfd3f4291cb2", "20c92498-e000-4781-a9b5-5d49b59b6eba", "27ed4efc-5acd-4c99-8c3b-549054613d72", "3af1db81-ea45-4174-a65c-3c086556150a", "441dba92-2e3e-4958-9237-d9957b30c290", "4a41abc2-f115-41aa-8dc9-6af04dc2735d", "5b8505c8-341d-4521-b288-dcaa19b1579e", "66e3a53c-4b57-4e17-8d24-967a04fb553e", "89f1f525-4014-4123-b2fa-5175ae9983a1", "934c16f6-d096-420d-be91-6b88905bd62a", "a75e5171-b3be-4007-8889-02b2beeedc8f", "b836ee20-ee6e-4c48-b9cd-b9251dfc38c7", "c11a584f-a73b-4fee-b8b1-57bbe682e052", "c1cdab92-ca97-491f-a447-1452b6f31d57", "de03f8d2-f24d-491d-8835-fee34a4312b7", "df8c9d07-997b-4f7b-9cf0-341ec8642e75", "ebd4b416-1990-4eec-ac18-c2f68c04fd55", "eca97fce-b910-4bf0-80f5-e9c422711d88"], "title": "Challenges in Fixpoint Computation with Multisets", "venue": "foundations of information and knowledge systems", "year": 2004, "id": "0f4a4ef6-419b-4556-9b01-e9f21ff48fa9"}
{"authors": ["Andreas Spillner 0002"], "n_citation": 1, "title": "Integrationstest - Das aktuelle Schlagwort.", "venue": "Informatik Spektrum", "year": 1992, "id": "0f6352e0-522c-4f39-b7c3-02008371fc4f"}
{"abstract": "Patch management of networks is essential to mitigate the risks from the exploitation of vulnerabilities through malware and other attacks, but by set- ting too rigorous a patching policy for network devices the IT security team can also create burdens for IT operations or disruptions to the business. Different patch deployment timelines could be adopted with the aim of reducing this op- erational cost, but care must be taken not to substantially increase the risk of emergency disruption from potential exploits and attacks. In this paper we ex- plore how the IT security policy choices regarding patching timelines can be made in terms of economically-based decisions, in which the aim is to minimize the expected overall costs to the organization from patching-related activity. We introduce a simple cost function that takes into account costs incurred from dis- ruption caused by planned patching and from expected disruption caused by emergency patching. To explore the outcomes under different patching policies we apply a systems modelling approach and Monte Carlo style simulations. The results from the simulations show disruptions caused for a range of patch dep- loyment timelines. These results together with the cost function are then used to identify the optimal patching timelines under different threat environment con- ditions and taking into account the organization's risk tolerance.", "authors": ["Yolanta Beres", "Jonathan Griffin"], "n_citation": 50, "references": ["05db0573-9e8e-4144-a1cf-996b6b2eece6", "1fa9751a-1578-430a-96b2-e513439ec70a", "2fcee12b-62d3-419d-80f7-4a491438fad9", "379f4c41-3cab-4b95-bacd-17f8a49ace43", "5baa351c-3a76-4a21-b499-a81f048b628c", "bca6d5e8-c1e9-4180-b551-cfc6e3ba6ac4"], "title": "Optimizing Network Patching Policy Decisions", "venue": "information security", "year": 2012, "id": "0f6f82ba-6712-4985-a9cb-11ebbb388dbd"}
{"authors": ["Lu\u00eds Felipe I. Cunha", "Luis Antonio Brasil Kowada", "Rodrigo de A. Hausen", "Celina M. Herrera de Figueiredo"], "n_citation": 4, "references": ["19d8eee5-a001-4dfe-92a2-ed38b5d7f3cf", "2e2fbe94-3aee-4a71-8e88-fc0155728aa7", "74c6bff6-a0cc-4832-adc3-1d07df1ce7b2", "88da445e-2f97-40ad-88ef-d8121eba42ea", "8a510b05-ac95-478b-8c36-eab61e86966c", "a6e7926f-1586-4555-abb2-fe188460ec4e", "fad0db3d-7b85-46a7-80ea-cc50e532054a", "fcfe22b0-2e7e-4fad-a06c-1d7b2e755506"], "title": "Transposition Diameter and Lonely Permutations", "venue": "brazilian symposium on bioinformatics", "year": 2012, "id": "0f7321a5-c01b-40f1-948d-45f887e82c39"}
{"abstract": "We present a framework for pen-based, multi-user, online collaboration in mathematical domains. This environment provides participants, who may be in the same room or across the planet, with a shared whiteboard and voice channel. The digital ink stream is transmitted as InkML, allowing special recognizers for different content types, such as mathematics and diagrams. Sessions may be recorded and stored for later playback, analysis or annotation. The framework is currently structured to use the popular Skype and Google Talk services for the communications channel, but other transport mechanisms could be used. The goal of the work is to support computer-enhanced distance collaboration, where domain-specific recognizers handle different kinds of digital ink input and editing. The first of these recognizers is for mathematics, which allows converting math input into machine-understandable format. This supports multi-party collaboration, with sessions recorded in rich formats that allow semantic analysis and manipulation of the content.", "authors": ["Rui Hu", "Vadim Mazalov", "Stephen M. Watt"], "n_citation": 4, "references": ["542233f7-4c81-43a2-9842-70c0a760c831", "5cbf20d8-52a7-4f97-bee8-89615e09dde8", "8c004e18-548b-4fe3-8101-1ce1ce5a075a", "a9184646-1601-4310-adb7-96ef1c8f8e10", "b4b8a809-b4b4-4f2e-97a8-d8cbc2e81390", "d001126a-b7e7-440f-a4ef-0d86272ffcbf", "f5ce845e-ccb6-47fe-8466-3e292f176ceb"], "title": "A streaming digital ink framework for multi-party collaboration", "venue": "", "year": 2012, "id": "0f792388-f0e6-408a-809c-76dc293ef18b"}
{"abstract": "Nous considerons dans cet article des reseaux de Petri etiquetes sans \u03bb. On les appelle normalises si leurs arcs ne sont pas values et si leurs marquages initiaux et finals sont des sous-ensembles de l'ensemble des places. Nous prouvons que tout reseau de Petri general peut etre (effectivement) transforme en un reseau de Petri normalise ayant exactement le meme comportement concurrent. Ses comportements sequentiels finis et infinis ainsi que ses suites de pas sont egalement preserves. Ceci permet de toujours considerer des reseaux de Petri sous une forme normalisee quand on travaille sur le comportement des reseaux, sans restreindre la generalite des resultats. Ainsi un bon nombre de recherches futures devrait se trouver facilite", "authors": ["Elisabeth Pelz"], "n_citation": 8, "references": ["5889743f-662a-4172-923e-ebcf373a6c2e", "63c17056-a8e9-4fbd-9f75-673559256731"], "title": "Normalization of place/transition-systems preserves net behaviour", "venue": "Theoretical Informatics and Applications", "year": 1992, "id": "0f7b2021-2491-45de-bcb9-ad0bf498c591"}
{"abstract": "One of the goals of translational science is to shorten the time from discovery to clinical use. Clinical trial registries were established to increase transparency in completed and ongoing clinical trials, and they support linking trials with resulting publications. We set out to investigate precision and negative predictive value (NPV) of links between ClinicalTrials.gov (CT.gov) and PubMed. CT.gov has been established to increase transparency in clinical trials and the link to PubMed is crucial for supporting a number of important functions, including ascertaining publication bias. We drew a random sample of trials downloaded from CT.gov and performed manual review of retrieved publications. We characterize two types of links between trials and publications (NCT-link originating from MEDLINE and PMID-link originating from CT.gov).The link precision is different based on type (NCT-link: 100%; PMID-link: 63% to 96%). In trials with no linked publication, we were able to find publications 44% of the time (NPV=56%) by searching PubMed. This low NPV shows that there are potentially numerous publications that should have been formally linked with the trials. Our results indicate that existing trial registry and publisher policies may not be fully enforced. We suggest some automated methods for improving link quality.", "authors": ["Vojtech Huser", "James J. Cimino"], "n_citation": 8, "references": [], "title": "Precision and negative predictive value of links between ClinicalTrials.gov and PubMed.", "venue": "", "year": 2012, "id": "0f931025-4800-4f35-9cda-fad45de72c1e"}
{"authors": ["Hongxia Wang", "Gui Ye", "Chuanjing Ju"], "n_citation": 0, "references": [], "title": "Risk-Based Determination of the Prenium Rate of Construction Work Safety Liability Insurance", "venue": "", "year": 2011, "id": "0fa5af3f-c03a-411d-b65f-1df9ca71f4ef"}
{"authors": ["Peyman Afshani", "Timothy M. Chan"], "n_citation": 8, "title": "Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs.", "venue": "canadian conference on computational geometry", "year": 2005, "id": "0fb1ba5d-f668-416f-bb8b-f2b41a03c56d"}
{"abstract": "The last few years have seen an explosion in the amount of text becoming available on the World Wide Web as online communities of users in diverse domains emerge to share documents and other digital resources. In this paper we explore the issue of how to provide a low-level information extraction tool based on hidden Markov models that can identify and classify terminology based on previously marked-up examples. Such a tool should provide the basis for a domain portable information extraction system, that when combined with search technology can help users to access information more effectively within their document collections than today's information retrieval engines alone. We present results of applying the model in two diverse domains: news and molecular biology and discuss the model and term markup issues that this investigation reveals.", "authors": ["Nigel Collier"], "n_citation": 4, "references": ["3595fa71-68db-476e-9cb7-ad6ece6f446e", "73b52e09-331c-49e6-80ac-94decc5aa6d3", "e0cc534b-e7d4-4b82-976d-1739f0392c14", "e403cdaf-3dbb-4660-815e-c7a61ba3451d", "e55bb6e5-9e29-4feb-9555-7e494209d83b"], "title": "Machine learning for information extraction from XML marked-up text on the semantic web", "venue": "international semantic web conference", "year": 2001, "id": "0fe15185-9403-4e19-99ed-faaa9e855fed"}
{"authors": ["Alexander Bertram", "Sebastian Iwanowski"], "n_citation": 0, "references": ["c2bfce6c-b09b-470a-bab1-61da26b2c230", "c6082f75-3e21-463c-8368-988c9012e54c", "c7d92228-dce8-48b1-91e4-e61e3fbce7b2"], "title": "Dynamic Routing on OpenStreetMap Using Ant Colonies", "venue": "international conference on computational logistics", "year": 2013, "id": "0fee143e-f36b-4e80-8b06-a06d6ca48f72"}
{"authors": ["Kiril Simov"], "n_citation": 3, "title": "Ontology-Based Lexicon of Bulgarian.", "venue": "Ldv Forum", "year": 2009, "id": "0ffa0a40-f572-4473-965b-7638ba42023a"}
{"authors": ["Gillat Kol", "Ran Raz"], "n_citation": 2, "title": "Bounds on 2-Query Locally Testable Codes with Affine Tests.", "venue": "Electronic Colloquium on Computational Complexity", "year": 2009, "id": "10048a04-d891-425f-a9a4-2a44d2189674"}
{"authors": ["Taimur Qureshi", "Djamel Abdelkader Zighed"], "n_citation": 50, "title": "Discretization of Continuous Features by Resampling.", "venue": "", "year": 2008, "id": "100f222f-97fd-4d64-9af4-65580ee3937d"}
{"authors": ["Janusz Kacprzyk", "Gabriella Pasi", "Peter Vojt\u00e1\u0161", "S\u0142awomir Zadro\u017cny"], "n_citation": 28, "references": ["1ce7a9a3-91c4-45d6-984a-e1d240fd81aa", "33d6dabd-c086-4a6e-939a-c322b6ada724", "5d0d245e-a76b-49cf-907b-56eafc98cf25", "6c14cbf8-28ed-4400-b913-4cbd5f971168", "ba5e74d4-c76e-4f01-a3ee-381351a2f384"], "title": "Fuzzy Querying: Issues and Perspectives", "venue": "Kybernetika", "year": 2000, "id": "100f5d9e-869a-40da-9c6f-9ea4bdaea9ed"}
{"abstract": "Authentication, Authorization, and Accounting (AAA) technologies are widely considered to be the key to the growth of e-commerce. Mobile network operators may be one of the first to offer such services thanks to a number of advantages. They will face some issues, however, if they attempt to launch AAA services for e-commerce. This paper introduces some of the issues including ID mappings, certificate validation, security awareness, and environments. Some of the solutions for these issues are also discussed.", "authors": ["Etsuo Kawada"], "n_citation": 50, "references": [], "title": "Authentication Services in Mobile Networks", "venue": "Wireless Personal Communications", "year": 2002, "id": "10276085-7afc-4a8c-8716-c63bd5414409"}
{"authors": ["Philip S. Yu"], "n_citation": 43, "title": "Modeling and analysis of concurrency control schemes", "venue": "", "year": 1995, "id": "102e346b-9a2d-4827-925b-58fffbda1412"}
{"abstract": "The Self-organizing map (SOM) has been widely used in financial applications, not least for time-series analysis. The SOM has not only been utilized as a stand-alone clustering technique, its output has also been used as input for second-stage clustering. However, one ambiguity with the SOM clustering is that the degree of membership in a particular cluster is not always easy to judge. To this end, we propose a fuzzy C-means clustering of the units of two previously presented SOM models for financial time-series analysis: financial benchmarking of companies and monitoring indicators of currency crises. It allows each time-series point to have a partial membership in all identified, but overlapping, clusters, where the cluster centers express the representative financial states for the companies and countries, while the fluctuations of the membership degrees represent their variations over time.", "authors": ["Peter Sarlin", "Tomas Eklund"], "n_citation": 50, "references": ["2197c3c2-99c7-4c74-a35e-c184e684e909", "32c5cd23-bcfc-4c4b-89a3-b29e93b6042c", "4074838c-c163-44cd-b239-8e836c44db3c", "5602fc01-8870-4b63-9979-2fde1038796b", "62f81e82-e2f3-4b8e-a010-6ee9b1542d83", "6f6288b6-dc7c-44e3-9f87-5f528f1a615e", "d6c7f84c-2686-4287-9746-7c62907fe4fb", "e8ef24d9-a5ef-4e32-85f2-750d0658e1e8"], "title": "Fuzzy clustering of the self-organizing map: some applications on financial time series", "venue": "", "year": 2011, "id": "1037df0c-e573-4968-8e97-c2db20842708"}
{"abstract": "In previous works a novel flexible and versatile handling concept, called PARAGRIP(Parallel Gripping), was introduced. This concept is based ona reconfigurable architecture with a modular and alterable layout. The robot system is able to handle objects with six DOF by forming a parallel kinematic structure including several robotic arms and the object itself. As many kinematic parameters, like the grasp- and base-points of the arms as well as the arm combination can be designed freely, the handling system offers a fast and economic possibility to adapt the performances to the requirements of the task. This adaption can proceed before or even during manipulation. The latter is realized by dynamic re-grasping, where the object is passed from one arm to the next, if more than three arms are available in the layout.#R##N##R##N#This Paper deals with the question how an optimal configuration set can be planned automatically, if the robot layout offers the possibility of dynamic re-grasping. It shows the benefits and the challenges as well as the strategies of the planning process and the realization. The focus of this paper is how to manage the complexity of this numerousness of configuration possibilities and choose the optimal one within the shortest computation time.", "authors": ["Burkhard Corves", "Tom Mannheim", "Martin Riedel"], "n_citation": 50, "references": ["658c73a3-2ecd-408d-8b46-a6fb9730578d"], "title": "Re-grasping: improving capability for multi-arm-robot-system by dynamic reconfiguration", "venue": "international conference on intelligent robotics and applications", "year": 2011, "id": "10679cac-c356-40ef-a7df-9430954e58c3"}
{"authors": ["Teresa W. Haynes", "Michael A. Henning"], "n_citation": 1, "title": "The domatic numbers of factors of graphs.", "venue": "Ars Combinatoria", "year": 2000, "id": "10785f7c-90b9-448d-93cd-7aa666d2eb37"}
{"authors": ["Adnan Umar", "James J. Sluss", "Pramode K. Verma"], "n_citation": 0, "title": "An XML-based system for configuration management of telecommunications networks using web-services.", "venue": "", "year": 2005, "id": "107b3465-d75f-4962-94bb-a49bf22dc61a"}
{"authors": ["Geert-Jan Houben", "Peter A. C. Verkoulen"], "n_citation": 4, "title": "An Integrated Approach to Modelling Structural and Behavioural Aspects of Complex Objects.", "venue": "", "year": 1991, "id": "109c2642-1291-402a-a039-a7f8d7789f70"}
{"authors": ["Klaus Beulen", "Lutz Welling", "Hermann Ney"], "n_citation": 28, "title": "Experiments with linear feature extraction in speech recognition.", "venue": "", "year": 1995, "id": "10a37ed1-7bb2-47d2-9b53-3050ce245826"}
{"authors": ["Anna Grim\u00e1n", "Mar\u00eda A. P\u00e9rez", "Luis Eduardo Mendoza", "Edumilis Maria M\u00e9ndez"], "n_citation": 4, "references": ["305a37c1-9675-4370-ab0b-0aa97fe5cb36", "e4866318-8f8b-480a-8c9b-1862b2d0e314"], "title": "A method proposal for architectural reliability evaluation.", "venue": "international conference on enterprise information systems", "year": 2007, "id": "10a92a94-9ad1-4e72-a9b0-4a51f3e9a349"}
{"authors": ["Alistair G. Sutcliffe", "Ian Bennett", "Ann Doubleday", "Michele Ryan"], "n_citation": 12, "title": "Designing Query Support for Multiple Databases", "venue": "international conference on human-computer interaction", "year": 1995, "id": "10b5c7fe-5c1d-45fd-a8f2-6517dc3a6e49"}
{"authors": ["Dongyun Liu", "Hong Mei"], "n_citation": 39, "references": ["4b837f17-7e38-4175-82bc-daa37f162933", "65acba26-3449-48c8-ac84-83465430d11b", "dde8d7b9-5f2b-44b4-977a-9755a6484ac7"], "title": "Mapping Requirements to Software Architecture by Feature-Orientation.", "venue": "international conference on software engineering", "year": 2003, "id": "10c7185a-f2b7-4810-b1d6-1340c2949922"}
{"abstract": "This book offers a state-of-the-art introduction to the mathematical theory of supply chain networks, focusing on supply chain networks described by partial differential equations (PDEs). The authors discuss modeling of complex supply networks as well as their mathematical theory; explore modeling, simulation, and optimization of some of the discussed models; and present analytical and numerical results on optimization problems. Real-world examples are given to demonstrate the applicability of the presented approaches. Audience: Graduate students and researchers who are interested in the theory of supply chain networks described by PDEs will find this book useful. It can also be used in advanced graduate-level courses on modeling of physical phenomena, as well as introductory courses on supply chain theory. Contents: Preface; Chapter 1: Introduction; Chapter 2: Mathematical Preliminaries Chapter 3: Basic Queueing Models; Chapter 4: Models Based on Ordinary Differential Equations; Chapter 5: Models Based on Partial Differential Equations; Chapter 6: Continuum-Discrete Models; Chapter 7: Control and Optimization Problem for Networks; Chapter 8: Computational Results; Bibliography; Index", "authors": ["Ciro D'Apice", "Simone Gttlich", "Michael Herty", "Benedetto Piccoli"], "n_citation": 54, "title": "Modeling, Simulation, and Optimization of Supply Chains: A Continuous Approach", "venue": "", "year": 2010, "id": "10c8367b-1e0f-4710-9530-af997f5b42a1"}
{"abstract": "Business processes are recognized by organizations as one of the most important intangible assets, since they let organizations improve their competitiveness. Business processes are supported by enterprise information systems, which can evolve over time and embed particular business rules that are not present anywhere else. Thus, there are many organizations with inaccurate business processes, which prevent the modernization of enterprise information systems in line with the business processes that they support. Therefore, business process mining techniques are often used to retrieve reliable business processes from the event logs recorded during the execution of enterprise systems. Unfortunately, such event logs are represented with purpose-specific notations such as Mining XML and still don't apply the recent software modernization standard: ISO 19506 (KDM, Knowledge Discovery Metamodel). This paper presents an exogenous model transformation between these two notations. The main advantage is that process mining techniques can be effectively reused within software modernization projects according to the standard notation. This paper is particularly focused on the empirical evaluation of this transformation by simulating different kinds of business process models and several event logs with different sizes and configurations from such models. After analyzing all the model transformation executions, the study demonstrates that the transformation can provide suitable KDM models in a linear time in accordance with the size of the input models.", "authors": ["Mar\u00eda Fern\u00e1ndez-Ropero", "Ricardo P\u00e9rez-Castillo", "Barbara Weber", "Mario Piattini"], "n_citation": 4, "references": ["08e139c7-baf8-4ed3-a927-31c62d2a5a5c", "0a565bab-0582-425b-bc05-84441a637b23", "0f4e538e-9062-45be-af32-49466c4d3e39", "3b7888ce-f0ad-4f99-a8b9-a2091f9f3096", "40cea306-08e1-4228-abb5-2051a463ced6", "4185a249-a450-48bc-bf2c-94d7b86cc862", "4a7f8af0-c721-4958-9043-0d9ba37ad064", "51e2a1cd-ea17-4040-95bd-1a036b58213d", "6519f146-d16f-4912-8d95-3a67c1ae8625", "659063dd-f2d7-491a-a83c-d372beabc85b", "73a51074-5f46-41b5-a271-d5b1a3176206", "873aac9a-7ae4-44d7-a9be-b03a4453f473", "9d90c20c-6d4c-45a3-8388-977099a2abd1", "b409eb3e-db34-49a4-99d5-48e6edb05eb6", "b7a2ec6b-8ba0-43e1-9834-be800dbfcac4", "b8c3a82f-79fa-4397-90df-20ae83158e7a", "c284d49e-c5dc-47be-816f-ac804c862de6", "d532c8e3-647b-4b28-848f-e891f6861754"], "title": "Empirical assessment of business model transformations based on model simulation", "venue": "international conference on model transformation", "year": 2012, "id": "10de5912-723f-4edc-8d3f-5fc723169498"}
{"authors": ["Weisong Shi", "Cheng Zhong Xu", "Xiaobo Zhou"], "n_citation": 0, "title": "Introduction: special issue: Security in grid and distributed systems", "venue": "Journal of Parallel and Distributed Computing", "year": 2006, "id": "10e47cd9-cdc9-45f9-b70b-38fe57fdf6b6"}
{"authors": ["Nobuyoshi Kaiki", "Katsuhiko Mimura", "Yoshinori Sagisaka"], "n_citation": 3, "title": "Statistical modeling of segmental duration and power control for Japanese.", "venue": "conference of the international speech communication association", "year": 1991, "id": "10f83cbc-18ba-4163-bd19-de04c7f6b0bb"}
{"authors": ["Joxan Jaffar", "Jean-Louis Lassez"], "n_citation": 3, "title": "Reasoning about Array Segments.", "venue": "european conference on artificial intelligence", "year": 1982, "id": "10fc4c4f-d5b4-46af-a811-01718d18daca"}
{"authors": ["Jacques Ferber", "Fr\u00e9d\u00e9ric Koriche", "John Tranier"], "n_citation": 2, "title": "Un mod\u00e8le efficace de normes pour les syst\u00e8mes multi-agents organisationnels.", "venue": "Technique Et Science Informatiques", "year": 2003, "id": "11172def-643b-4d96-8155-a6bb17a4d319"}
{"authors": ["Miguel A. Barron", "Dulce Y. Medina", "I. Hilerio"], "n_citation": 0, "title": "Computer Simulation of Fluid Flow in an Oxygen Steelmaking Converter.", "venue": "", "year": 2009, "id": "112aadf3-acce-4e75-88e5-d97ab7e1c56d"}
{"abstract": "This paper presents an evolutionary Multiobjective learning model achieving positive synergy between the Inference System and the Rule Base in order to obtain simpler and still accurate linguistic fuzzy models by learning fuzzy inference operators and applying rule selection. The Fuzzy Rule Based Systems obtained in this way, have a better trade-off between interpretability and accuracy in linguistic fuzzy modeling applications.", "authors": ["Antonio A. M\u00e1rquez", "Francisco Alfredo M\u00e1rquez", "Antonio Peregr\u00edn"], "n_citation": 50, "references": ["10c4b074-0be3-4c80-a839-f9ed7a60ae97", "2e7d0127-c28e-4c63-9317-e6c150ec787e", "325453cd-e080-4648-bd64-51d264aba1da", "441667da-4d23-4862-b80d-36664fec7240", "65d5ccdc-7022-45b0-adf9-0385273b1283", "6a027227-a948-4db7-9dfc-52ba6d761fa9", "750e35d7-3aef-4baf-9855-e1fddc46893a", "aac56882-01e5-41ea-8ec9-883105b8468c", "c88e2f74-2bcd-4ef7-b904-f23076f3a455", "eaeffb0e-1c84-4337-85ab-18c88e8c4835", "f9c8fd74-3820-4b06-a974-a3aac98f9c92"], "title": "Cooperation between the Inference System and the Rule Base by Using Multiobjective Genetic Algorithms", "venue": "hybrid artificial intelligence systems", "year": 2008, "id": "1147e921-5f94-4167-9c87-60a60674f623"}
{"authors": ["Amarendran R. Subramanian"], "n_citation": 0, "title": "Segment-based multiple sequence alignment", "venue": "", "year": 2009, "id": "11671948-b0fb-4452-9e89-f9c0a419093b"}
{"abstract": "In the domain of ontology design as well as in Knowledge Representation, modeling universals is a challenging problem. Most approaches that have addressed this problem rely on Description Logics (DLs) but many difficulties remain , due to under-constrained representation which reduces the inferences that can be drawn and further causes problems in expressiveness. In mathematical logic and program checking, type theories have proved to be appealing but, so far they have not been applied in the formalization of ontologies. To bridge this gap, we present in this paper a theory for representing ontologies in a de pendently- typed framework which relies on strong formal foundations including both a constructive logic and a functional type system. The language of this theory defines in a precise way what ontol ogical primitives such as classes, relations, properties, etc., and thereof roles, are. The first part of the paper details how the se primitives are defined and used within the theory. In a seco nd part, we focus on the formalization of the role primitive. A review of significant role properties leads to the specificati on of a role profile and most of the remaining work details through nu merous examples, how the proposed theory is able to fully satisfy this profile. It is demonstrated that dependent types can mod el several non-trivial aspects of roles including a formal s olution for generalization hierarchies, identity criteria for roles a nd other contributions. A discussion is given on how the theory is able to cope with many of the constraints inherent in a good role representation.", "authors": ["Patrick Barlatier", "Richard Dapoigny"], "n_citation": 50, "references": ["02820152-4296-4e06-9104-ce4a54b6dca3", "04edcaec-b50d-41a4-88ef-e44f78341d95", "0606831b-4490-4f0e-9a17-429fdae696fd", "07ec78ab-3d0f-4581-b778-ccc356f6fd46", "08960518-5fb7-408b-a812-43e935face3b", "0c57c1fc-b8b7-469a-bd8b-8056ba72632b", "0d5f2eae-f748-4286-8f63-9bcc43f3aaa3", "119c95bf-d999-4f7f-bf23-123a7794abaa", "1c906634-46e9-4bc6-9cbe-3cb57ffb5a28", "23af7984-1394-4270-84a2-1b01b35dabfc", "2c6ba557-37e1-46e8-b108-0631fe1ca4f2", "350df4f6-ddf7-46a0-a5fc-e680da21423f", "35ae8959-22a6-45c5-b5f9-51bb6342d8d6", "40ab296a-db74-419c-a81b-e016d4929199", "42ea6086-62ba-4bfa-b59c-4e454c848818", "43df1764-f766-4e24-b765-0dd6a26fd1bc", "45ec0bdb-6e26-4bbd-a311-b410ae947445", "48a31150-e17c-4ded-a124-f1fbca300338", "534622c5-a19e-48d8-9253-521f321c3d23", "53abf736-2a17-47c4-82cf-7f6d5ea31337", "5447b29f-87ab-4256-8928-23ee3120297c", "57edf159-2cc8-44d7-a1da-5b03c0e744db", "5c32b10a-de2f-4e89-8651-a5235a68863a", "6832defa-3186-470b-8d8b-2509416a6802", "6f21d24f-8227-4c35-87c3-47b7a664d763", "747598a7-0b4e-4f5d-89de-2bc5db2c639d", "7abd6364-bb52-4041-99be-2ae330b8731e", "8028aecc-1569-49ea-b319-6726105a93ee", "80a4bf7a-2283-4b7e-8b17-33cf6b1bb0af", "822b3043-dbf8-4b4f-a7bc-243b39b4149a", "84a66ce3-6c67-4839-b3f8-9d627f1a1d36", "84da7a7f-33b9-4a69-aeed-550aeed4d015", "8907ca33-433c-4750-9212-540abcd9284d", "8a19d900-fb03-418a-a54c-186f23bf8621", "8aa3fa57-36ab-4b19-8bc1-fabe568e1526", "8cf80590-eba6-4709-b017-8bdb970839f2", "8f20541f-b2be-4dac-ae1f-bf137e388abc", "9328c443-f08b-48cc-be07-c5bbe802a1b3", "953cb449-ec71-45ad-a063-43f2cdccacc3", "96406430-a308-44da-ace7-f8e902560001", "a52c089c-9222-4085-91c7-93b217adc8a8", "a6c13b12-6562-42b8-8062-8ff08ac1dcdb", "a9b12a52-7ec0-4a9b-b3b2-1065df9fe78d", "aac42eb9-c856-47c1-b3c7-b5cbbd8b47db", "ad9def37-73cd-4e06-8a51-49a1dfd3b0a8", "af96fd5a-b78a-4424-8e12-a854988fef6a", "b41b51ad-9aae-49d2-b2ab-a2a73a6d1b8b", "c5b4c9f2-a58e-4110-9f65-af0ddad21c6c", "c8fc9f4a-4004-4f82-850b-a70cb7f24b74", "cac3fade-381c-4f94-9b19-b3d6aa0553c4", "d4f5860d-0fa6-4ffd-b940-b0773b27b0ad", "d84ee860-5736-4169-a73e-caaa37d2ed62", "dfaefc6b-783d-4a23-a25a-f2236b033467", "e7fda079-9f7c-4f1d-a889-aaaebbad668d", "e8529a4e-7df7-405f-9ea3-30ff0d1261a1", "ec02bd03-1909-4362-a565-fd08669a8c67", "ecfb2022-e18c-4e5e-8733-d8bc6f4c8fc9", "f67b5f23-8c2d-45f7-b82d-8b52350668eb", "fa84ddb9-42f4-4b55-95a3-2d40e493c852", "ff259fbc-bf17-4de5-81dd-b624ba957170", "ff9769f1-5d32-432b-9213-f8b38dea912b"], "title": "A type-theoretical approach for ontologies: The case of roles", "venue": "Applied Ontology", "year": 2012, "id": "11755fa7-5aa6-4a90-ad8d-931db56eb3df"}
{"authors": ["Shuo Chen", "John Dunagan", "Chad Verbowski", "Yi-Min Wang"], "n_citation": 50, "references": ["1390c17b-4f7b-4b81-a844-f4e712f3d762", "485eeb4b-a2f8-4796-9b1e-ed3c793bc6b1", "7596d96c-6c5a-4fef-9471-a461ef44e747", "77ca595f-08ba-4715-a785-8cf76caef0a8", "9827e22d-5a79-4e1e-a12a-d1f25474c382", "988814d0-12b5-40b8-b602-2bc039ea0491", "a07cb9ae-0b35-4173-a8ea-be9ee54661d1", "a5dc676a-3d8e-4e1b-a8c0-00d25693eda5", "a5e8bf03-c257-4f05-af7b-a4dbb861a4aa", "c6eda076-429c-4430-9118-f3dd27176ddb", "de36e98d-454e-423e-bacb-4217c8653531", "e599a6bf-6dc3-4375-a255-28e5363ce36e", "eafbd356-d8ac-4bcf-b9ed-9d50bf806d84", "f0333553-8971-4b32-a2f2-c120e50fd101", "fb33c0b8-9b3d-4245-a25a-bba6bce64b69", "fcfad71b-c1e2-4661-b5ac-c19f449a8db1"], "title": "A Black-Box Tracing Technique to Identify Causes of Least-Privilege Incompatibilities", "venue": "network and distributed system security symposium", "year": 2005, "id": "11758d7c-f829-46a0-ae42-a0815201c5ba"}
{"authors": ["Vic Grout", "Stuart Cunningham", "Rich Hebblewhite"], "n_citation": 1, "references": ["03f45a1f-73d4-4af8-8593-c9e01f788d1a", "2222f1f9-b357-45ef-8943-ae096e660c5f", "3bb9b6ca-18dd-4d95-8c16-e7003ef32df4", "771c9f57-b245-4519-9213-ee6a132b40a3", "af1ce9e9-9be1-4266-a455-e685498c3bc0", "b4b5ce47-604f-4776-923e-0f62b5158d80", "bc6a3602-4c40-41af-8e35-fa222ba427e3"], "title": "An Illustrative Discussion of Different Perspectives in Network Engineering.", "venue": "", "year": 2008, "id": "117f3c62-0940-4923-ab9e-3a7fd405a238"}
{"abstract": "This paper proposes an efficient two stage demosaicing method to interpolate color filter array images. The proposed method based on the edge sensing technique improves the interpolation performance by adopting the color difference model for a green channel as well as a red/blue channel. In particular, the green channel interpolation method with a new concept includes the gradient operator, which uses the total amount of slope changes in adjacent color information, and the missing green color estimation, which uses Approximated Directional Line Averages. Comparing with various comparative experiments between the conventional results and the proposed ones, the performances of the proposed method in this paper outperform to existing algorithms in terms of visual performance both in numerical and visual aspects. Our method of demosaicing improves the standard performance by8.927dB on the average in comparison of other methods in MSE(Mean square Error).", "authors": ["Hyeon-Mi Yang", "Sea-Ho Kim", "Yang-Ki Cho", "Joo-Shin Lee", "Hi-Seok Kim"], "n_citation": 0, "references": ["2c486034-dd1b-4f24-b927-c05b0b83055c", "b36ed418-fdfe-45e7-95b0-bcfaa17891f8", "f494def4-8be7-4045-a711-aa564ab6bdff"], "title": "Two Stage Demosaicing Algorithm for Color Filter Arrays", "venue": "", "year": 2009, "id": "11868628-b2f5-4517-9e0a-62b2035bd112"}
{"abstract": "Ubiquitous computing has led to an ever-increasing cascade of information about us, our friends, our societies, and the planet. Lima and others view this \"new data\" as an opportunity for individuals to develop network thinking; once people understand the whole, they can better control their contribution to global social issues like climate change. However, at present, such data is difficult to interpret by anyone, let alone by non-specialist users.#R##N##R##N#I believe that a variety of issues stand in the way of individuals understanding complex data sets. I will begin by discussing cognitive style (deductive and inductive logic). Then, after considering existing graphic principles for dealing with \"visual complexity,\" I suggest interfaces need to provide indications of place, date, validity, probability, and privacy. Finally, I briefly discuss some of the boundaries that exist between my networks of data and yours due to the hidden algorithms of search engines and the challenge of creating common ground when visualizations are increasingly personalized.", "authors": ["Emilie West Gould"], "n_citation": 0, "references": ["6d7557f2-7bd9-4726-98f4-035e75710860", "fcedcf9e-add1-4d02-8976-dca1f02d1fac"], "title": "Dot, line, network: helping individuals make sense of New data", "venue": "", "year": 2013, "id": "1189dd87-5e7b-418d-bd5a-9c7edf6e6805"}
{"authors": ["Fevzi Belli"], "n_citation": 50, "references": ["199a85f7-a844-4ccf-a1dd-b9c7c70d81e0", "2105d8f3-41b2-4d68-bd61-d693f4c1a167", "552d7352-9a75-49e6-a7bf-339f71118abd", "ad23da68-a32e-4bb7-abb2-e836dcacb364", "e9aa85ab-e984-4452-a6c0-2b91303d1db2"], "title": "Assuring Dependability of Software Reuse: An Industrial Standard", "venue": "", "year": 2013, "id": "118e40d9-0f3d-464f-9fd0-697c669d1feb"}
{"authors": ["Makoto J. Hirayama", "Taro Sugahara", "Zhiyong Peng", "Junichi Yamazaki"], "n_citation": 50, "references": [], "title": "Interactive listening to structured speech content on the internet.", "venue": "", "year": 1998, "id": "119b1c6e-721f-4a73-9c3a-5a4e6e8150eb"}
{"abstract": "Action research is used to gain understanding of how an IS development methodology emerges in practice and how it can contribute to value creation in organizations. The Multiview framework is used to guide the action research project. A graphical notation for mapping the unfolding of IS development projects is developed and applied to the project. Reflection on the project leads to a number of lessons being drawn about the organization of the IS development process, addressing themes such as vision, time pacing, and the role of architecture. The paper concludes with ideas about how the theoretical underpinnings of IS development might be bolstered by complex adaptive systems.", "authors": ["Richard T. Vidgen", "Sabine Madsen", "Karlheinz Kautz"], "n_citation": 22, "references": ["313a07b9-302c-44ed-84f2-3c490aca4d10", "569141ff-ef2f-4c2d-9af2-92c1c203296d", "68286b25-7776-46fe-bfdc-8b1f3bfa11a1", "6d05e6fe-a3af-4e09-a8c4-8789f6e24c73", "80698658-ee39-4df4-bd1a-a09150149d00", "80fe8011-0010-420c-a3c0-4868693f0bce", "96f3acc6-e630-4a55-9385-b747a9dccee6", "e363f369-bf5e-49e7-8347-6620c0231dba", "f4dc499b-cd41-4a82-841e-efe6d6fd4d92"], "title": "Mapping the Information System Development Process", "venue": "", "year": 2004, "id": "11a1414c-2890-42f5-bec5-be7b0991e115"}
{"abstract": "Air pollution in big cities is a major health problem. Pollutants in the air may have severe consequences in humans, creating conditions for several illness and also affect tissues and organs, and also affect other animals and crop productivity. From several years now, the air quality has been monitored by stations distributed over major cities, and the concentration of several pollutants is measured. From these data sets, and applying the data visualization capabilities of the self-organized map, we analyzed the air quality in Mexico City. We were able to detect some hidden patterns regarding the pollutant concentration, as well as to study the evolution of air quality from 2003 to 2010.", "authors": ["Antonio Neme", "Leticia Hern\u00e1ndez"], "n_citation": 50, "references": ["d17ba9f9-4dca-43fd-a194-96241f498323"], "title": "Visualizing patterns in the air quality in mexico city with self-organizing maps", "venue": "", "year": 2011, "id": "11afbe96-56a3-4bb2-838c-fcf3f55e396e"}
{"authors": ["Deqiang Han", "Jean Dezert", "Yi Yang"], "n_citation": 50, "references": ["01a9db75-38e0-4834-b769-f119e4cba13c", "2a42a0d5-e96c-4390-bf4e-4ca23a09bd6c", "3ad94fa0-6bcb-4d32-aa9d-759fc5f8e126", "3efbac1e-8a7d-45f0-81c7-483e6230ba45", "5ec6607e-6a04-4739-952f-3a8f4d93548b", "9295234c-c601-403b-8d24-d1c6bf880876", "95e4930d-ae8f-4641-b773-6f330cc690ba", "a42a620f-3f76-4e69-8a1c-2717863a8593", "d2f7ec60-87ab-4665-8e4e-2af2abc633e1", "d9573bc6-998e-4183-979a-5307b8f06cc3"], "title": "Evaluations of evidence combination rules in terms of statistical sensitivity and divergence", "venue": "", "year": 2014, "id": "11c5b329-ddd7-419e-bfb3-cd9e00d89f32"}
{"abstract": "The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of prefix-, suffix-, and bifix-free regular languages. We prove that nn-2 is a tight upper bound for prefix-free regular languages. We present properties of the syntactic semigroups of suffix- and bifix-free regular languages, and conjecture tight upper bounds on their size.", "authors": ["Janusz Brzozowski", "Baiyu Li", "Yuli Ye"], "n_citation": 50, "references": ["1f15903f-23de-48c9-af08-397724abb014", "2ce0de3b-41e8-4801-8c5d-6e93add9a56d", "4d785fd4-9e27-4225-a117-40a0de29789f", "721f1da7-096d-4a06-a773-e1267e8c0fd3", "ab66f9b6-ee48-468c-9ada-a16b2481ebd8"], "title": "Syntactic complexity of Prefix-, Suffix-, and Bifix-free regular languages", "venue": "", "year": 2011, "id": "11c8ce25-3fb2-48fa-9e18-76955fa34222"}
{"authors": ["Stephen W", "Jonathan Allen", "J. Duley"], "n_citation": 0, "title": "Engineering education: trends and needs (panel).", "venue": "international conference on computer aided design", "year": 1992, "id": "11dc19cb-1914-4805-9f06-06bc2a7b2d12"}
{"authors": ["Manfred Broy", "Martin Wirsing"], "n_citation": 12, "title": "Ultra-loose algebraic specifications.", "venue": "Bulletin of The European Association for Theoretical Computer Science", "year": 1988, "id": "11efe42d-47af-4645-8fb1-3813ab467972"}
{"abstract": "IEEE 802.11e Medium Access Control (MAC) is an emerging extension of the IEEE 802.11 Wireless Local Area Network (WLAN) standard to support Quality of Service (QoS). The IEEE 802.11e uses both centrally-controlled as well as contention-based channel access mechanisms to transfer data across the wireless medium. It also provides the mechanism to specify and negotiate the resource based on the user's QoS requirement. This paper presents a MAC-level QoS signaling for IEEE 802.11e WLAN and addresses its interaction with higher layer signaling protocols including Resource ReSerVation Protocol (RSVP) and Subnet Bandwidth Manager (SBM). We also explain a novel way of setting up sidestream connections for direct station-to-station streaming within an 802.11e WLAN.", "authors": ["N. Sai Shankar", "Sunghyun Choi"], "n_citation": 50, "title": "QoS Signaling for Parameterized Traffic in IEEE 802.11e Wireless LANs", "venue": "Lecture Notes in Computer Science", "year": 2002, "id": "11f0bd37-ae5a-43e6-b14a-a59bc00fdd90"}
{"authors": ["Ronald L. Rivest", "Matthew J. B. Robshaw", "Yiqun Lisa Yin"], "n_citation": 23, "references": ["18adbc09-0ab0-4bf3-b49b-68b5572ce060", "25bc511a-b4f6-46c5-8642-a92e54a0ca64", "28fa59f0-eca3-4c79-a2e8-2a60a9180b1c", "477dfdb6-47b0-4aa0-ac3a-42c0bf83e437", "6e831aac-7d00-4c49-89ce-7596e955401c", "84993360-9549-4c41-8d80-ef4b2685a8a1", "b132080c-34fe-4398-b0f5-8cd37e2e238c"], "title": "RC6 as the AES.", "venue": "", "year": 2000, "id": "121b1a6a-0930-4454-abf5-c8d675d86c3a"}
{"authors": ["Jiri Lebl", "Daniel Lichtblau"], "n_citation": 0, "title": "Uniqueness of certain polynomials constant on a hyperplane", "venue": "", "year": 2008, "id": "123b2a79-08a4-417a-8b3e-d7ac1896ab6d"}
{"authors": ["Sea Ling", "Bohdan Durnota"], "n_citation": 3, "title": "A Comparison of Techniques for Specifying Concurrent Systems Using the Object-Oriented Paradigm.", "venue": "", "year": 1993, "id": "123e64e7-8384-4e2b-8bd1-2a750e9b956a"}
{"authors": ["Minzhong LiuP", "Xiufen ZouP", "Lishan KangP"], "n_citation": 50, "references": ["0b1363e0-b6a4-4c99-8a2a-5f82850aee67", "0cc8a4bb-8bb1-4526-ab1e-ae8ff4eccc6d", "32db0b6b-7326-4bd6-9404-fa88ce9e0746", "63d2ea00-e29e-46b5-8b36-b63e9c494513", "65d5ccdc-7022-45b0-adf9-0385273b1283", "6a6b9aa6-683f-4c7c-b06e-9c3018d10fd3", "b13ca83a-21cb-459d-8e16-ee29b631f156"], "title": "An Effective Dynamical Multi-objective Evolutionary Algorithm for Solving Optimization Problems with High Dimensional Objective Space", "venue": "", "year": 2007, "id": "126dcb7c-4ddf-4e77-a8f6-d261f39d1e1f"}
{"authors": ["Hiroshi Dozono", "Shinsuke Ito", "Hisao Tokushima", "Masanori Nakakuni"], "n_citation": 4, "title": "The Analysis of Key Typing Sounds using Self Organizing Maps.", "venue": "system analysis and modeling", "year": 2007, "id": "1288f5ac-d009-4fee-a6b8-0ec7c877d93b"}
{"authors": ["Pierluca Di Cagno", "Bianca D\u2019Agostinis", "Barbara Livieri"], "n_citation": 0, "references": ["2e6558e7-022d-496f-9ee7-63b5784d11ba", "42ea6086-62ba-4bfa-b59c-4e454c848818", "ca53d6ca-e92c-4f2a-a3b1-e10aa3c988c1"], "title": "Organizational Sustainability and Value Creation in Collaborative Networks", "venue": "working conference on virtual enterprises", "year": 2014, "id": "128e6a3a-5ad1-45cf-8efc-499cce1f4650"}
{"abstract": "Environments with frequent changes in application requirements demand an evolutionary approach for database modeling. The challenge is greater when the database must support multiple applications simultaneously. An existing solution for database evolution is refactoring with a transition period. During this period, both the old and the new database schemas coexist and data is replicated in a synchronous process. This solution brings several difficulties, such as interference with the operation of applications. To minimize these difficulties, in this paper we present an asynchronous approach to keep these schemas updated. This paper presents the design for an experimental assessment of this novel approach for evolutionary database development.", "authors": ["Helves Humberto Domingues", "Fabio Kon", "Jo\u00e3o Eduardo Ferreira"], "n_citation": 0, "references": ["019615bb-f450-4270-b463-ca132fb166c7", "282ff120-4c46-4525-96f9-a9ff9518a1f9", "374ca2c5-8ce6-4d58-b135-ce68d83e7159", "427b42ab-4694-40ee-8bcd-ec54361acb0d", "4a506eb3-4a5a-4b69-8ae5-eb64ef797b25", "7f6f7d6d-344a-4794-a0ef-f8ed5d2d978b", "c20cd8bd-085f-4057-8332-83a17e8b8eca", "cdef4e3f-fe6b-43a6-9fb1-da6bcbff37a8"], "title": "Asynchronous replication for evolutionary database development: a design for the experimental assessment of a novel approach", "venue": "", "year": 2011, "id": "12998d4d-9835-4262-b529-10f72df12cfb"}
{"abstract": "As multi-core technology is currently being deployed in computer industry primarily to limit power consumption and improve throughput, continued performance improvement of a single application on such systems remains an important and challenging task. Because of the shortened on-chip communication latency between cores, using thread-level parallelism (TLP) to improve the number of instructions executed per clock cycle, i.e., to improve ILP performance, has shown to be effective for many general-purpose applications. However, because of the program characteristics of these applications, effective speculative schemes at both thread- and instruction-level are crucial.", "authors": ["Pen Chung Yew"], "n_citation": 0, "title": "A compiler framework for supporting speculative multicore processors", "venue": "annual computer security applications conference", "year": 2007, "id": "12b74aa7-348b-460e-85f6-fe5da1d1abb6"}
{"abstract": "Game theory is concerned with optimization problems involving several players with conflicting interests. Differential games are an interesting area inside this field in which the problem is formulated by means of dynamical systems. In spite that the theoretical solution of differential games is well known, faced with large-scale, complex systems, analytical or, even, numerical methods are not usually suitable. Genetic algorithms appear to be useful for solving such problems when dealing with nonlinear, large-scale systems. This paper shows how co-evolutionary algorithms can be applied to solve differential games and presents a computer tool to formulate and solve these problems. The differential equations which define the system under study are written in Vensim, a visual modeling tool. The usefulness of the presented tool is shown by means of two examples.", "authors": ["Francisco Gordillo", "Ismael Alcal\u00e1", "Javier Aracil"], "n_citation": 1, "references": ["34f89657-e0ea-4f28-923d-4a5f9555f9f8", "7a3bdd50-75ef-4c62-9272-62bd7347b925", "c061069f-29d1-46d4-9974-dede8d5461f9"], "title": "A tool for solving differential games with co-evolutionary algorithms", "venue": "genetic and evolutionary computation conference", "year": 1999, "id": "12b7fa44-0c12-40a3-8692-ea02d97b21eb"}
{"authors": ["Martin Schickel", "Volker Nimbler", "Martin Braun", "Hans Eveking"], "n_citation": 0, "title": "On Consistency and Completeness of Property-Sets.", "venue": "forum on specification and design languages", "year": 2006, "id": "12c6a7b6-94b2-4772-8e47-2db95ab89414"}
{"abstract": "The gulf separating the real-time research, product development, and application development communities appears to be the largest in the entire computing field. This gulf has an unfortunate tendency to obscure the research opportunities of most value to the real-time application domains. It is an unsurprising consequence of factors historically intrinsic to each of those communities.Almost all academic, and much industrial, research in the area of real-time computing - and especially distributed real-time computing - suffers from two handicaps. First is the necessity for unusually extensive application domain-specific knowledge and understanding compared with what is required in most other computer science and engineering research. Second is the directly contrary reality that few real-time researchers have the option of obtaining such knowledge and understanding, because they lack access to non-trivial, deployed, real-time application environments - particularly to distributed ones (e.g., in process control or discrete manufacturing plants, defense systems, telecommunication intelligent network architectures) - and to the developers and users of those environments.The real-time application domain practitioners (real-time computer product and application developers and users) contribute to this gulf as well. First, the historical focus on traditional small, static, centralized, sampled-data subsystems has often subjected real-time computers to severe constraints on hardware cost, size, weight, and power. And although software development and maintenance costs per line of source code are generally one or two orders of magnitude greater for real-time software than for non-real-time software, the smallest scale instances of these subsystems actually have negligible costs for software compared with hardware. These two factors tend to discourage many of the application developers and users from believing that they need or can afford technology advances from the software and real-time research communities. Second, hardware parsimony makes it necessary, and application simplicity makes it possible, for the application programmers to do the majority of the system's resource management - most of it a' priori, and as little as possible at run time.The increasing importance and deployment of larger scale, more complex, more distributed real-time computer systems makes this gulf an increasingly greater obstacle to their cost-effectiveness and even viability. The purpose of this session is to assist in reducing this gulf by bringing to ISORC2K's researcher audience some of the most prominent visionaries in some of real-time computing's most important application domains.", "authors": ["E. Douglas Jensen", "Jay S. Bayne", "Kirk Rheinholtz", "Michael W. Masters", "Thomas F. Saunders"], "n_citation": 0, "title": "Real-Time Application Domain Visionaries", "venue": "international symposium on object/component/service-oriented real-time distributed computing", "year": 2000, "id": "12cf8d9a-ee90-49c1-bc6d-a972c441fcde"}
{"abstract": "A significant shortcoming of traditional modeling methodologies is the limited access they provide for decision-makers who are not modeling specialists. This paper presents an expert system approach to address this shortcoming. An expert system called the experimental frame expert system (EFES) was developed for this purpose within an advanced modeling environment for manufacturing systems. EFES reduces the dependence upon modeling specialists, and thus, makes models, both analytical and simulation, more accessible to decision-makers. This is accomplished by using two knowledge bases, one related to the manufacturing system specific symptoms and problems, and the other to system analysis and optimization tools. This paper presents the dissertation research effort that led to development of these two knowledge bases as well as the EFES framework within the advanced modeling environment.", "authors": ["Dursun Delen", "David B. Pratt", "Manjunath Kamath"], "n_citation": 6, "references": ["20f4c248-c9f0-4e3e-90f4-657cab6caa55", "3079056a-c940-4da2-afe2-d97f1c8d2f19"], "title": "Enabling multi-use, multi-tool models of manufacturing systems through an experimental frame expert system", "venue": "Journal of Intelligent Manufacturing", "year": 2001, "id": "12dd4940-79bf-4410-9b91-856ccc98da01"}
{"abstract": "In this paper we present an original semi-supervised method for the segmentation of in situ tree color images which combines color quantization, adaptive fragmentation of learning areas defined by the human operator and labeling propagation. A mathematical morphology post-processing is introduced to emphasize the narrow and thin structures which characterize branches. Applied in the L*a*b* color system, this method is well adapted to easily adjust the learning set so that the resultant labeling corresponds to the accuracy achieved by the human operator. The method has been embarked and evaluated on a tablet to help tree professionals in their expertise or diagnosis. The images, acquired and processed with a mobile device, present more or less complex background both in terms of content and lightness, more or less dense foliage and more or less thick branches. Results are good on images with soft lightness without direct sunlight.", "authors": ["Philippe Borianne", "G\u00e9rard Subsol"], "n_citation": 1, "references": ["0b274997-5bc1-44d4-b90b-7d4919ee3fee", "4d4bcdf4-fe15-4c81-a0ab-5bf3fa85f320", "5549e47b-c48b-41e4-87b5-f683b9df6175", "98018d90-ee66-426e-b97b-b403ca7af6ea", "b0128d48-506a-494c-8ba5-14ec2246e608", "b96f91dd-a663-4135-b08f-8430a7267f73", "e3297431-8bf2-4405-a14a-978fdc1bdbe3", "e3a5cec9-7e82-4c14-86ab-0d95a92712a7", "e7ae9f33-0e2a-4417-ade7-339c93591fb4", "f5ce9b78-1f9a-4615-a6c7-779110280a75"], "title": "Fast semi-supervised segmentation of in-situ tree color images", "venue": "international conference on image and signal processing", "year": 2014, "id": "13182f14-9b78-4c2d-b918-b50262a5fbbb"}
{"abstract": "The morphological changes of the vertebrae associated with normal aging are still subject of debate, whereas this knowledge is important in detecting vertebral fractures and degenerative shape changes. The aim of this study is to present a method to statistically analyze the vertebral shape and determining the morphometric changes related to normal aging. The analysis is performed on the L2 lumbar vertebrae from a large dataset of Computed Tomography scans. The surface meshes of all vertebrae, with a groupwise vertex correspondence between them, are first acquired by an intensity based registration process onto a segmented reference. Principal component analysis then reduces the dimensionality to the main modes of variation which were subsequently analyzed by multiple linear regression to acquire the global shape variations with respect to the age of the subjects. In addition, the correlation with age of the deformation at each mesh vertex is analyzed, giving a significance map of the age related changes. This analysis shows several shape changes which are in agreement with previous studies while also giving a more detailed global shape analysis. Understanding the normal shape changes allows for a better diagnosis of vertebral fractures and spinal pathologies.", "authors": ["Tristan Whitmarsh", "Luis Miguel del R\u00edo Barquero", "Silvana Di Gregorio", "Jorge Malouf Sierra", "Ludovic Humbert", "Alejandro F. Frangi"], "n_citation": 2, "references": ["43d73924-325a-42f8-a1b6-8b616ea22b2f", "50b1abc6-dedb-4f55-978b-396b2e7a62c4", "967d9f48-1401-4a55-adad-96ac352690aa", "cad707d8-9405-43c7-9370-42f3829e02ed", "ce3529cd-23a8-409e-b9fc-7fef67c0d6b1"], "title": "Age-Related changes in vertebral morphometry by statistical shape analysis", "venue": "", "year": 2012, "id": "13343b60-2a7d-4dfa-81c1-69e4aa5aa462"}
{"authors": ["Pavel Kr\u00f6mer", "Jan Platos", "Vaclav Snasel"], "n_citation": 50, "references": ["13179fd4-5daa-4083-8d9e-dd1f1d14f890", "25fad365-44cc-4755-b78b-cfe260ce7575", "4c1ac57a-7b03-40c3-9f85-c1c977124a9e", "4e08dd8c-3bf8-4022-8b09-7f4e1d5b23ff", "57889f4a-2bed-44ad-85e2-f52df62edd19", "5e0b824c-7468-41e1-9abe-e8c2e89ff917", "6704da51-ba1e-495f-9224-5d5d08ef5cc9", "6d5026bb-a713-42fc-a09d-fe9ca56dcc63", "72e01173-2825-40c0-a00a-1f50d37387ed", "7d95a1ad-8a74-475f-92db-8f65d9cd101a", "7e5fc76e-cab8-44c2-8d7e-b5a3119d46b7", "8a430f41-83b2-4c1d-befd-d128d475d2ba", "939ed9e6-6981-48b1-b4f9-3a056a5c453e", "9740040f-e6e6-4a65-821c-1dacab572afe", "9b53c793-8933-4ce6-bdee-9b03cf87a1e9", "9e850792-2aa7-4ab2-83d2-d6f6788333f1", "abfc9495-5569-45cb-8801-6c1b2d8e498e", "b6ebdfc8-1348-48a0-b48f-e32b948527bf", "bac5da35-9009-41a3-b758-21aec812a9ee", "d3c26239-bd64-4260-82f7-47064dd99d7a", "d400e3c2-b55a-4a93-a2b8-3d2ad940996a", "f002e5dd-8da0-4fc0-9449-b01ad6c4679e", "f44dd7a2-28b5-4368-8265-e16f62ae21df"], "title": "Implementing Artificial Immune Systems for the Linear Ordering Problem", "venue": "Soft Computing", "year": 2013, "id": "133bed87-8c09-467d-a7e4-0245c120da81"}
{"authors": ["Clifford Nass", "Li Gong"], "n_citation": 50, "references": ["4e96e830-7148-4a45-97bc-fc76f62cb8ea", "98ed8106-978b-426c-b330-e50e996526e5"], "title": "Maximized Modality or constrained consistency", "venue": "", "year": 1999, "id": "133f67d8-c533-4752-ac8c-0a810a24b987"}
{"authors": ["Don Libes", "David W. Flater", "Evan K. Wallace", "Michelle Potts Steves", "Allison Barnard Feeney", "Edward Barkmeyer"], "n_citation": 2, "references": ["57ffaea2-7fcc-4245-b9a9-59cfc77ee358", "7fd7e80a-a324-4fe5-9d50-6f20cae27106", "e3c2765e-cd8d-4f31-95db-1feacb0fe0bb"], "title": "The challenges of automated methods for integrating systems.", "venue": "", "year": 2004, "id": "1360b928-766b-4fab-ac73-3a3061994668"}
{"abstract": "Automated system deployment frameworks and configuration management systems have been in wide use for a number of years. However, due to increasing pressures to maintain high availability, coupled with the price effects of commodity servers, administrators may be required to deploy large numbers of systems in shorter time frames than is normally possible with available staff. In this paper, we describe a straightforward procedure using commonly-available infrastructure to enable rapid simultaneous deployment of hundreds of machines by temporary staff. As an example of the efficacy of this approach, we present a case study in rapid systems deployment at Purdue University. On May 5th, we deployed Purdue's \"Steele\" cluster, installing over 500 compute nodes in a single business day.", "authors": ["Donna D. Cumberland", "Randy Herban", "Rick Irvine", "Michael Shuey", "Mathieu Luisier"], "n_citation": 4, "references": ["31057a8b-6377-40c4-9d27-fecb6b05e366", "39fe22d7-b7b6-4247-aed3-f086bd59d727", "f5379b3c-a41f-4ae7-bfb6-f3b1632819f5"], "title": "Rapid parallel systems deployment: techniques for overnight clustering", "venue": "usenix large installation systems administration conference", "year": 2008, "id": "13708adf-b4fc-4610-91a2-c7dcc03e48de"}
{"authors": ["Nathan P. Johnson", "James H. Graham"], "n_citation": 0, "title": "Predicting Makespan with Latin Square Replication on Computational Grids.", "venue": "computers and their applications", "year": 2010, "id": "13a6de18-8d24-4ef8-878a-f2393e0ce527"}
{"authors": ["Jos\u00e9 J\u00falio Alferes", "Antonio Brogi", "Jo\u00e3o Leite", "Lu\u00eds Moniz Pereira"], "n_citation": 4, "references": ["218317da-31f4-4f4c-a4d7-4e869e42ba85", "a89e2444-7b48-4ddb-a7d6-5160dc5bd52e", "b8707f2e-3356-41ba-8a98-3eceec4d9d10", "c5092b7b-aca1-4346-a34a-8bf6c572607a", "f5736b74-fbb0-4a33-a65d-2cba7eff1b52"], "title": "An Evolving Agent with EVOLP.", "venue": "", "year": 2003, "id": "13baa625-b7be-485d-a83b-5e3e3a4eafd3"}
{"authors": ["Dalila Boughaci", "Habiba Drias"], "n_citation": 2, "title": "A Performance Comparison of Evolutionary Meta-heuristics and Solving MAX-SAT Problems.", "venue": "computational intelligence", "year": 2004, "id": "13c4d595-41c6-4faa-8a2c-f6c063f9f509"}
{"authors": ["Peter J. Cameron"], "n_citation": 1, "title": "An Extremal Problem Related to Biplanes", "venue": "", "year": 1999, "id": "13ce918a-60bc-44e8-984d-1d39ad083cd7"}
{"authors": ["John Jenq", "Wing Ning Li"], "n_citation": 0, "references": ["12383caa-bd26-4ab1-a13b-5aa4cdc0850a", "3acb2cf5-0e3d-43a5-9777-42c67637caf5", "41588633-e313-4d5e-8339-713c353a4a59", "589a7bda-91a9-4645-ab3e-d1ea0b288e08", "625cc57d-bb46-4feb-9e6c-cd5ddaca090c", "8caac975-a51c-48cb-9273-b2f252cd05bb", "b2c845ec-995a-43eb-9ef7-c0e15bf87f6d", "e058cff1-d5bd-4d4a-a41f-02734ec73955", "ee8083bd-dfae-4c63-b8a7-3c01e7cf1dc2"], "title": "Parallel Thinning on Rmesh.", "venue": "computers and their applications", "year": 2004, "id": "13d9d591-b237-42f4-af3f-05c7cecce4e8"}
{"authors": ["Roger E. Kirk"], "n_citation": 50, "title": "Simple Random Sample", "venue": "", "year": 2011, "id": "13dcf1f0-abd9-46bd-baad-bdd231e133d0"}
{"abstract": "We study the role of help in Non-Interactive Zero-Knowledge protocols and its relation to the standard interactive model. In the classical case, we show that help and interaction are equivalent, answering an open question of Ben-Or and Gutfreund. This implies a new complete problem for the class SZK, the Image Intersection Density. For this problem, we also prove a polarization lemma which is stronger than the previously known one. #R##N#In the quantum setting, we define the notion of quantum help and show in a more direct way that help and interaction are again equivalent. Moreover, we define quantum Non-Interactive Zero-Knowledge with classical help and prove that it is equal to the class of languages that have classical honest-Verifier Zero Knowledge protocols secure against quantum Verifiers. Last, we provide new complete problems for all these quantum classes. #R##N#Similar results were independently discovered by Dragos Florin Ciocan and Salil Vadhan.", "authors": ["Andr\u00e9 Chailloux", "Iordanis Kerenidis"], "n_citation": 1, "references": ["0dd040aa-d2e6-447d-ad59-c2a19b828c99"], "title": "The role of help in Classical and Quantum Zero-Knowledge", "venue": "arXiv: Quantum Physics", "year": 2007, "id": "13f052cc-382b-437e-af19-84140b4a3a1e"}
{"authors": ["P. Melin", "Felma Gonzalez", "Gabriela E. Martinez"], "n_citation": 20, "title": "Pattern Recognition Using Modular Neural Networks and Genetic Algorithms.", "venue": "", "year": 2004, "id": "141be240-431a-40e0-9327-f5d7cb953230"}
{"authors": ["Stphane Airiau", "Ulle Endriss", "Umberto Grandi", "Daniele Porello", "Joel Uckelman"], "n_citation": 50, "title": "Aggregating Dependency Graphs into Voting Agendas in Multi-Issue Elections", "venue": "Hernia", "year": 2010, "id": "141c5dfe-96c3-49c0-9a69-a55861dfe835"}
{"authors": ["Laurent Amanton", "Mohamed Naimi"], "n_citation": 0, "title": "A Multicast Algorithm for Dynamic Closed Groups.", "venue": "international conference on principles of distributed systems", "year": 1997, "id": "1432867d-6a47-4544-a598-6cbae7a18e87"}
{"authors": ["Francois Caron", "Emily B. Fox"], "n_citation": 4, "title": "Bayesian nonparametric models of sparse and exchangeable random graphs", "venue": "", "year": 2014, "id": "14385971-3850-41de-b2aa-0ac5d9e9db7d"}
{"abstract": "Multiple datasets that add high value to biomedical research have been exposed on the web as a part of the Life Sciences Linked Open Data (LSLOD) Cloud. The ability to easily navigate through these datasets is crucial for personalized medicine and the improvement of drug discovery process. However, navigating these multiple datasets is not trivial as most of these are only available as isolated SPARQL endpoints with very little vocabulary reuse. The content that is indexed through these endpoints is scarce, making the indexed dataset opaque for users. In this paper, we propose an approach for the creation of an active Linked Life Sciences Data Roadmap, a set of congurable rules which can be used to discover links (roads) between biological entities (cities) in the LSLOD cloud. We have catalogued and linked concepts and properties from 137 public SPARQL endpoints. Our Roadmap is primarily used to dynamically assemble queries retrieving data from multiple SPARQL endpoints simultaneously. We also demonstrate its use in conjunction with other tools for selective SPARQL querying, semantic annotation of experimental datasets and the visualization of the LSLOD cloud. We have evaluated the performance of our approach in terms of the time taken and entity capture. Our approach, if generalized to encompass other domains, can be used for road-mapping the entire LOD cloud.", "authors": ["Ali Hasnain", "Syeda Sana e Zainab", "Maulik R. Kamdar", "Qaiser Mehmood", "Claude N. Warren", "Qurratal Ain Fatimah", "Helena F. Deus", "Muntazir Mehdi", "Stefan Decker"], "n_citation": 16, "references": ["16fbe51f-8a05-4f17-92c0-6f9e77e68dc4", "18b55f49-6d1f-4867-9cee-d186bc0a1b69", "1a09e8cf-a288-487b-b2e6-df5338b37ba6", "1c4f9a17-37d8-42fe-886d-0dd249e9646c", "26035fe4-f9dd-47c1-98af-eb316b559ca0", "4582b5b0-c698-4a6c-ac06-2446d2e619c8", "61a59fd2-04fa-4a6c-8166-845b8d8631aa", "6c83cf87-38a3-4012-8fdd-dccce3ff53e7", "6f6a0807-0eb5-4d70-8702-d46130c643ee", "c1526357-c8da-4357-b551-343f0aafb4e8", "d091bcf2-656e-4e82-a02f-81f6f76a1fca", "e4d8d9d2-2ce0-49da-93ba-1e59a512c64c", "e4eb0630-e250-4637-8278-cbd51cf27698", "e8d48526-dc52-42cb-b8e6-684c22614e52"], "title": "A Roadmap for Navigating the Life Sciences Linked Open Data Cloud", "venue": "", "year": 2014, "id": "1448928a-7205-455a-a3d1-0d84279aaa55"}
{"authors": ["Nachiappan Veerappan Nachiappan", "Jarred Blount", "J. Nelson Rushton"], "n_citation": 4, "title": "A System for Checking Semi-formal Proofs.", "venue": "", "year": 2008, "id": "147720b8-ea80-4488-a023-8ae3b35684f4"}
{"authors": ["Hiroyuki Hatakeyama", "Shingo Mabu", "Kotaro Hirasawa", "br", "Jinglu Hu"], "n_citation": 0, "title": "Genetic Network Programming with Actor-Critic", "venue": "Journal of Advanced Computational Intelligence and Intelligent Informatics", "year": 2007, "id": "148b1f03-d18f-4977-bccb-3507820156b3"}
{"abstract": "A physical synthesis flow for data path circuits is proposed that integrates bit-slice tiling and gate size selection in traditional P&R tool, which outperforms traditional P&R tool in power and timing. This approach also reduces effort and multiple iterations of manual flow.", "authors": ["Vikram Singh Saun", "Suman Chatterjee", "Anand Arunachalam"], "n_citation": 1, "references": [], "title": "Integrated placement and optimization flow for structured and regular logic", "venue": "vlsi design and test", "year": 2012, "id": "14a2165d-a95c-4041-b05a-d863ed90d50c"}
{"authors": ["Daniel S. Schneider", "Jano Moreira de Souza", "Ercilia de Stefano"], "n_citation": 1, "title": "CONEWS: A COLLABORATIVE APPROACH TO ONLINE NEWS STORIES", "venue": "international conference on enterprise information systems", "year": 2007, "id": "14ad7903-4080-4ee8-bd92-a2e5e87d9b25"}
{"abstract": "In recent years the plunging costs of sensors/storage have made it possible to obtain vast amounts of medical telemetry, both in clinical settings and more recently, even in patient's own homes. However for this data to be useful, it must be annotated. This annotation, requiring the attention of medical experts is very expen- sive and time consuming, and remains the critical bottleneck in medical analysis. The technique of Semi-supervised learning is the obvious way to reduce the need for human labor, however, most such algorithms are designed for intrinsically discrete objects such as graphs or strings, and do not work well in this domain, which requires the ability to deal with real-valued objects arriving in a streaming fashion. In this work we make two contributions. First, we demonstrate that in many cases a sur- prisingly small set of human annotated examples are sufficient to perform accurate classification. Second, we devise a novel parameter-free stopping criterion for semi- supervised learning. We evaluate our work with a comprehensive set of experiments on diverse medical data sources including electrocardiograms. Our experimental results suggest that our approach can typically construct accurate classifiers even if given only a single annotated instance.", "authors": ["Nurjahan Begum", "Bing Hu 0001", "Thanawin Rakthanmanon", "Eamonn J. Keogh"], "n_citation": 50, "references": ["0df206c8-7029-4e88-b770-bc3e7940263d", "12c253c7-3370-4e51-9661-08387e32ba34", "13916e83-8451-47cf-9055-7e8e13eb8575", "15433144-7620-46fc-92d0-c967f8336f35", "19c35bfd-3c1b-4c2a-b956-42e79a9aca91", "1e925317-250d-473a-803b-bce3f1aaa57d", "1e965ffc-62b4-41f3-bb4c-c998220c179c", "2912dad4-5d08-41a3-8b31-e9d13994cdde", "5130a70a-0511-4965-89a3-c49cd2b763e5", "7c430c1f-fc34-4359-a40f-fd0ce9422e81", "80713402-4af8-4580-bc2a-444f1e48884d", "861a29de-d1bd-496a-986e-b8086fea2b70", "895c9eda-5882-4a60-b63d-3ff352fe65fa", "92d83501-4d09-4418-be94-50aa81dd99fa", "9dd7825f-b1e8-45f9-8196-703a7d6eb145", "a06d1b48-8fee-44ed-896d-da631ecac2b5", "a76c6566-712c-4dab-8032-512473f817fd", "aa767a83-de19-4421-bfb4-f63808992758", "bd73cef4-eb81-4abd-a73f-c1d6188bf68e", "c7eb4d15-b6e4-43a7-9b4a-381c23071f66", "d12390d8-2079-4f1f-b1b4-414f0ecfa3a9", "da30e2b3-143b-4877-89dc-24559aa2756f", "dc56b59f-9e8c-41dd-bfb4-9b39910fc428", "dff7265b-97c2-4320-8c06-316ca294bbae", "e2d81dd6-fd8f-4c22-a4b3-6d0507538465", "e80fddf5-5896-492b-b7f6-437e0023ca3a"], "title": "A Minimum Description Length Technique for Semi-Supervised Time Series Classification", "venue": "", "year": 2014, "id": "14bb496e-d2f0-4628-9ccb-ac1cfd88c558"}
{"authors": ["Monika Malinova", "Jan Mendling"], "n_citation": 3, "references": ["1937c920-6851-48be-98ac-84643201141a", "63ffd00a-7bab-418f-b92e-24e2bd8b7a02", "aac83822-bcd0-4ede-9d66-a8f965d10554", "d532c8e3-647b-4b28-848f-e891f6861754", "efbd9dae-b761-4ca8-93be-30e6510d581d"], "title": "Leveraging Innovation Based on Effective Process Map Design: Insights from the Case of a European Insurance Company", "venue": "business process management", "year": 2015, "id": "14c2aa2d-7fc4-4a32-8fae-323e16264240"}
{"abstract": "Nowadays, not only CPU but also GPU goes along the trend of multi-core processors. Parallel processing presents not only an opportunity but also a challenge at the same time. To explicitly parallelize the software by programmers or compilers is the key for enhancing the performance on multi-core chip. In this paper, we first introduce some of the automatic parallel tools based OpenMP, which could save the time to rewrite codes for parallel processing on multicore system. Then we focus on ROSE and explore it in depth. And we also implement an interface to reduce its complexity of use and use some automatic parallelization for CUDA.", "authors": ["Chao-Tung Yang", "Tzu-Chieh Chang", "Kuan-Lung Huang", "Jung-Chun Liu", "Chih-Hung Chang"], "n_citation": 2, "references": ["2d53db71-8ef0-48a9-b2f0-0d02da26258c", "2f9f6c0a-3e12-4d50-9159-199c608e30cd", "31e045b9-5575-4a86-af05-cdfc00898944", "50bcd71f-603a-4856-babc-073c02e0b8f0", "6a29977c-6301-48d2-8fcc-ff7d9b9b33ad", "6c3ce525-921e-449a-8609-55859415972e", "c710ea1e-a0af-406a-9a53-a808b5974512", "e39cee7e-b1ec-4d8f-b8ac-63a855d20ad9", "f6d79a98-9d66-4be5-9b26-e07229afc778"], "title": "Performance evaluation of OpenMP and CUDA on multicore systems", "venue": "international conference on algorithms and architectures for parallel processing", "year": 2012, "id": "14eff3c9-7085-4f33-9a2e-3ecdcf78c0e9"}
{"authors": ["Surajit Chaudhuri", "Eric R. Christensen", "Goetz Graefe", "Vivek R. Narasayya", "Michael James Zwilling"], "n_citation": 131, "title": "Self-Tuning Technology in Microsoft SQL Server.", "venue": "IEEE Data(base) Engineering Bulletin", "year": 1999, "id": "14f1b48a-b159-413e-846b-16c82b78ae9f"}
{"authors": ["Yongsheng Bai", "Bob P. Weems"], "n_citation": 0, "references": ["899d23d6-9aae-4a18-9f5b-2f6da78c2f9a", "e9d04f71-c81a-4edf-8d29-680884a67365"], "title": "Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences.", "venue": "", "year": 2006, "id": "14f28874-b7f6-4041-b111-384d40b2ba94"}
{"authors": ["Rachel Pottinger"], "n_citation": 9, "references": ["0b170a3d-e49c-4982-92c0-d274e093a7de", "0b7f1957-bf31-41a6-8e92-884a9c66a59f", "0f046337-4d56-4dd6-98f1-623e3df6e06e", "11398a57-cd11-4fb9-b579-b6f2f3fb0982", "1da8d19d-36ba-4ace-9f77-6062bd718f2a", "2a6ec9e5-08b7-41ca-a070-d0b4a12e6914", "301a9d34-fc04-4787-9da2-99420ceb54e6", "38906553-285e-44a3-931d-b16fbb99a297", "38b239f1-a241-40fc-9ed6-14d279849a8f", "4382d7d7-1d9b-4f25-9131-b068c54de687", "4992d1a2-a7b1-42c6-9172-f9a2312d614d", "4d15c3e5-7111-4ffb-8353-5b0086837ea3", "4db2087f-8af5-424a-a440-9cff5718042f", "57ffaea2-7fcc-4245-b9a9-59cfc77ee358", "62e50676-8f99-42c6-aa6d-676ba159fb39", "67a6c092-2038-44d4-81a8-e026bb696c60", "67de6191-94c2-46ed-b1fb-27a1f7c07b1d", "68fdf460-3740-4419-a6cd-99de361cbd70", "762afc1b-b9c9-4a0d-8930-7753b3993d81", "777e359b-cb2e-45c3-977a-1535086107e4", "7ed4f860-209f-4162-8444-b0765b087acd", "8d6e8fd5-6bca-4862-ad26-4dfa7448dc57", "95b353a8-2201-49dc-9bc6-2ee0a27181e6", "9b86181a-7598-4d70-9607-c5fa158416cc", "a046fe06-8c73-42e4-8888-d2fc13865405", "c6f48c54-64c0-440e-8b77-fb37376f331f", "c88f6dea-7d62-4f93-9392-bb124c85d2e2", "c9322ce2-8d89-4801-8bba-8cd9bb0a87ce", "cefb680c-2ec6-48fc-9ddc-c193835804e9", "dd1602f6-68d1-45a9-89d6-fa1d7a558394", "e298ffe9-16b8-465a-92ef-ff427472a8a2", "e8bce5fe-620d-4837-9490-015b332d641c", "e98394c8-2c06-436b-873f-760c66148b66", "ea20ecfd-7507-4159-b2a0-479533aec7ed", "ecb42a5b-2622-4e18-92b2-92e55bf833bb", "ef9e8bd8-28fa-41eb-99a7-3355869c3e9d", "f47687ef-397f-4414-96e1-97d0b5cd43b0", "fbd0e911-36d2-45e9-a1d4-a1bfa2e88f90"], "title": "Mapping-Based Merging of Schemas", "venue": "", "year": 2011, "id": "1507adce-ce11-4f7e-826a-24acce6d66f5"}
{"authors": ["Limin Xiang", "Kazuo Ushijima"], "n_citation": 1, "title": "O(1) Time Algorithm on BSR for Computing Convex Hull.", "venue": "parallel and distributed computing systems (isca)", "year": 2002, "id": "153d5c2d-db2b-4926-903b-48d671a7effe"}
{"authors": ["Congnan Luo", "Soon Myoung Chung"], "n_citation": 54, "references": ["718562ef-10d7-43a7-b958-cdcdca367151", "8a6134db-0705-46b1-a883-c3bdc6b64bbf", "cb47b9ec-f611-4ead-a41d-616543bc6fa3", "d1c93534-82a5-41fa-a5fa-9d18f5c2577f", "e97695ef-712a-43d7-b685-5ead1dce1139", "fe858af6-c573-42b7-af5e-7a9a87f28211"], "title": "Efficient Mining of Maximal Sequential Patterns Using Multiple Samples.", "venue": "siam international conference on data mining", "year": 2005, "id": "1546062a-7274-43cf-9acb-882734f4b1a4"}
{"authors": ["Agnieszka Nowak-Brzezi\u0144ska", "Tomasz Jach"], "n_citation": 50, "references": ["00746968-1e3a-4043-abbd-3007d9135880", "20916d10-4a34-4c08-b815-0878e11728f5", "e247f25f-1111-4bde-a8a6-91cd6bf5b312"], "title": "The Incompleteness Factor Method as a Support of Inference in Decision Support Systems", "venue": "", "year": 2014, "id": "15511434-d527-4fea-a597-a9210150a831"}
{"abstract": "The aim of this paper is to develop an executable prototype ofan unconventional model ofcomputation. Using the PVS verification system (an interactive environment for writing formal specifications and checking formal proofs), we formalize the restricted model, based on DNA, due to L. Adleman. Also, we design a formal molecular program in this model that solves SAT following Lipton's ideas. We prove using PVS the soundness and completeness of this molecular program. This work is intended to give an approach to the opportunities offered by mechanized analysis of unconventional model of computation in general. This approach opens up new possibilities of verifying molecular experiments before implementing them in a laboratory.", "authors": ["C. Graciani D\u00edaz", "Francisco-Jes\u00fas Mart\u00edn-Mateos", "Mario J. P\u00e9rez-Jim\u00e9nez"], "n_citation": 50, "references": ["c17481ca-9511-4793-8dad-a2486e0b2713"], "title": "Specification of Adleman's Restricted Model Using an Automated Reasoning System: Verification of Lipton's Experiment", "venue": "Lecture Notes in Computer Science", "year": 2002, "id": "155dec16-36d6-44f4-976b-1afb5d1924af"}
{"authors": ["Jos\u00e9 Miguel D\u00edaz-B\u00e1\u00f1ez", "Francisco G\u00f3mez", "Ferran Hurtado"], "n_citation": 3, "title": "Some problems on approximation of set of points by polygonal curves.", "venue": "canadian conference on computational geometry", "year": 1998, "id": "157deb47-490e-4f0e-a682-a9793560a182"}
{"authors": ["Matthias Gr\u00e4uler", "Frank Teuteberg"], "n_citation": 1, "references": ["33968d34-9843-4cd5-8494-4d98ae8b92e0", "3dffb3ad-079d-44c0-9201-37c3066f5b45", "99b9a668-8fa7-4b05-ab4f-5eeca2fe775b", "9d73a0f6-4fc2-4cbc-8271-0bf567788e42", "b31b5c66-fdfd-4a3e-8160-712c70546333", "ba1feff9-0eb8-4b26-8f19-2b2775fea4fb", "c02f6582-218b-46f3-9ac1-1859c4711757", "d5951c85-5647-4c0b-9728-6b36ead98c37", "e173a9e7-14ca-4519-8e69-aaf60439896b", "fcc9d6d0-6b6a-4a0f-863b-0e2f98b2dacb"], "title": "Ergebnisse einer qualitativen Befragung zur Gestaltung von Nachhaltigkeitsberichten", "venue": "", "year": 2013, "id": "159a8c62-b5bd-4322-a7dc-fe6f629cdbb1"}
{"abstract": "This paper contains a PhD research proposal related to the domain of automatic emotion recognition from speech signal. We started by identifying our research problem, namely the acute confusion problem between emotion classes and we have cited different sources of this ambiguity. In the methodology section, we presented a method based on simililarity concept between a class and an instance patterns. We dubbed this method as Weighted Ordered classes - Nearest Neighbors. The first result obtained exceeds in performance the best result of the state-of-the art. Finally, as future work, we have made a proposition to improve the performance of the proposed system.", "authors": ["Yazid Attabi", "Pierre Dumouchel"], "n_citation": 1, "references": ["19ac1309-2616-4f3a-a34e-a2c393b2a3ef", "1cb83245-8943-437b-b967-15045847f563", "21e2901b-3e86-49df-aebd-c5f96c4e97fc", "2b94411a-1c5d-4c27-9035-feecf7c4b7bb", "32763ca7-280e-421c-a07f-831a21ef1023", "37e046de-a6b8-4738-8cb8-12900b80037c", "39a1ac00-ec0e-4b65-a3a5-87f0d0845d8b", "508c2a65-1d18-4fd5-916b-6d0050686465", "635dbb09-4364-4559-a03c-5b1fbc88ca25", "7443b473-a59c-4f9f-9736-0af1f52ed4c0", "934bc5f2-68a7-49e2-a1af-2d4dbb9fe849", "989e70a4-cd4c-4bc8-83a1-eda62d580679", "b8269cfc-76b9-40ea-8a61-a4d52c91493d", "c1feca3f-475b-456f-a584-b7c685bd224d", "d4108018-f179-4554-8520-df5bc2c6dfd3", "f0642a49-3307-45c3-8a9f-811783b0cefd", "f8c28378-2439-4887-ae36-521808549f1f"], "title": "Automatic emotion recognition from speech a PhD research proposal", "venue": "affective computing and intelligent interaction", "year": 2011, "id": "159e4cfc-3c88-4edb-848a-a763597e0186"}
{"authors": ["Dilkeshwar Pandey", "Rajive Kumar"], "n_citation": 4, "references": ["029c914f-62c5-4f50-9179-696441f80cc6", "074c981c-97d5-4cd7-9d4f-0fe4e3db9396", "091033ac-f2b8-4b63-945d-e607501cf0d9", "0b44ebf7-4eae-409f-b741-b2db25325411", "0de7f981-5fe8-4177-aaf2-c2fbbbbb5092", "116d46a3-aad8-464f-a6b3-72f8da4107bc", "214cf2b0-4304-4821-8634-84d2d0815205", "22b99f97-1bfb-4a70-9ea8-d105ce6a5366", "3a770bd2-20c6-45e1-b98e-46d6f31f1966", "4692ae23-5e7b-4148-9a20-c43de265df2d", "46fbe86b-ea9e-4a4f-b1bd-d8f19ba17281", "4b30b6ab-9b88-4788-b699-3d1d3efb8f50", "5d014368-d402-46e3-b7bb-30908fcf588c", "72d4c9c4-cbe1-4b1c-ae2d-052bd1153ab4", "9270a9b5-940a-4394-814f-433c6440f286", "93f0cbdd-c2a0-4e9e-9342-d8c8ab8e37c0", "e2204e92-e6dc-4884-9bbc-200029491fc7", "e3a5cec9-7e82-4c14-86ab-0d95a92712a7", "ffa725d2-7538-4f0d-a353-06b3e91951df"], "title": "Hybrid Algorithm Using Fuzzy C-Means and Local Binary Patterns for Image Indexing and Retrieval", "venue": "soft computing", "year": 2012, "id": "15c2ee8a-2de9-49f6-a645-3ae2bf5411da"}
{"authors": ["Ram\u00f3n Alonso-Sanz", "Larry Bull"], "n_citation": 6, "title": "Elementary coupled cellular automata with memory", "venue": "", "year": 2008, "id": "15e54fd0-c87d-4841-b4d3-03550f9e1c30"}
{"abstract": "E-learning management systems use an interactive approach that presents the learner with learning objects to interact with during the learning process. Several interactive platforms for sharing learners' ideas, integrating mutual knowledge or providing feedback have been proposed. However, these approaches have met with limited success. Furthermore, although design education is already taking full advantage of the current state and economy of online information, online teaching materials suffer from scanty content, poor interactivity, and insufficient participation. This paper proposes an interactive agent-based approach to real-time feedback (IAARF) generation in e-learning systems for higher institutions of learning. This approach presents the possible way to use agents in an interactive manner to create learner profiles, guide the learners to set the learning goals, learner activities, and extract learner resources during the learning process. The major strength of this approach is the high level of learner engagement, with real-time feedback (RF) to the learner, shaping and transforming their learning dynamics.", "authors": ["Godfrey Omoda-Onyait", "Jude T. Lubega", "Gilbert Maiga", "R. Angole"], "n_citation": 2, "references": ["06712b5e-acf1-4798-ad45-035911685138", "0a1614fc-b2c7-4973-91f6-4f6d316d4427", "0c5c8cf3-8767-47e6-bbdb-5dd85b0c0ef0", "29111d96-e921-490d-a5b9-6837d71a9d04", "2aea0d55-226e-49dc-8c48-c5ea64871268", "32eb8afd-6094-4c8e-b11b-32607b9777fa", "506f61de-db7c-45fc-b6d8-2c68aafd84ee", "892ebd25-5307-451b-bfc4-b137a14db860", "ccb33043-2bdf-43e3-b540-a90f9f9d0736", "fb994242-c8b8-4b44-9d64-02c6f833fedf"], "title": "Towards an interactive agent-based approach to real-time feedback (IAARF) in e-learning system", "venue": "international conference on hybrid learning and education", "year": 2012, "id": "15e6afdb-24fd-4f89-ae28-1c278c416a07"}
{"authors": ["Jean-Marc Petit", "Farouk Toumani"], "n_citation": 0, "title": "Discovering Inclusion and Approximate Dependencies in Relational Databases.", "venue": "", "year": 1999, "id": "15f16340-131e-41a9-99b6-cc03d1368b4b"}
{"abstract": "Simulation is an interesting alternative to solve Markovian models. However, when compared to analytical and numerical solutions it suffers from a lack of precision in the results due to the very nature of simulation, which is the choice of samples through pseudorandom generation. This paper proposes a different way to simulate Markovian models by using a Bootstrap-based statistical method to minimize the effect of sample choices. The effectiveness of the proposed method, called Bootstrap simulation, is compared to the numerical solution results for a set of examples described using Stochastic Automata Networks modeling formalism.", "authors": ["Ricardo M. Czekster", "Paulo Fernandes", "Afonso Sales", "Dione Taschetto", "Thais Webber"], "n_citation": 50, "references": ["0be7200a-1601-42e8-b437-e23adda69aa9", "204a4c0b-66b4-4c1b-8d4c-24873a0dcab1", "26983b4e-855a-4548-a696-aecce3a3c124", "2d3b1b03-84a1-43fe-b3c8-d4163b9b4275", "51dfbad6-d76c-4557-b9fb-82fc61e3305c", "6fa0203b-090f-450e-a0cd-f551f0e7790b", "8383cef0-73c7-43bf-9130-3f5919d614c9", "920b5116-734c-4718-859f-a665dfeb88e6", "974e6f0e-e049-4ec3-aa05-50367f4303af", "becc43bc-a7b6-46e1-817e-553c84a4a6dd", "dc3b36e0-8fcb-4772-8e53-91388baf088d"], "title": "Simulation of Markovian models using bootstrap method", "venue": "summer computer simulation conference", "year": 2010, "id": "1617c7f8-cc65-49c2-a552-1d2ee292663b"}
{"authors": ["Jorge Puente", "Ramiro Varela", "Camino R. Vela", "C\u00e9sar Luis Alonso"], "n_citation": 2, "title": "A Parallel Programming Approach to Job Shop Scheduling Constrain Satisfaction Problems.", "venue": "", "year": 1998, "id": "16412312-c3af-4b08-b8ab-14b243e9c864"}
{"authors": ["Haftu Hailu", "Kassu Jilcha", "Eshetie Birhan"], "n_citation": 0, "references": ["8a20e042-a0ee-4e24-8ac9-1a280c1ce605", "abf838e8-e1b4-4f7d-9576-6c0ed90d8667", "bb4f41b7-5cc0-4987-9bbb-9235cd33bcc3", "d553aaaf-42b8-42d2-847b-2c945ecc8785"], "title": "Response Time Reduction in the Leather Products Manufacturing Industry Using Arena Simulation Method", "venue": "", "year": 2015, "id": "16478a16-8608-4018-8848-ba4a1f60fde5"}
{"authors": ["Xavier Chabot", "Roger B. Dannenberg", "Georges Bloch"], "n_citation": 2, "title": "A Workstation in Live Performance: Composed Improvisation.", "venue": "", "year": 1986, "id": "16742a8f-766e-4f00-9e96-fa167a3de9b4"}
{"abstract": "For the past several years YouTube has been by far the largest user-driven online video provider. While many of these videos contain a significant number of user comments, little work has been done to date in extracting trends from these comments because of their low information consistency and quality. In this paper we perform sentiment analysis of the YouTube comments related to popular topics using machine learning techniques. We demonstrate that an analysis of the sentiments to identify their trends, seasonality and forecasts can provide a clear picture of the influence of real-world events on user sentiments.", "authors": ["Amar Krishna", "Joseph Zambreno", "Sandeep Krishnan"], "n_citation": 7, "references": ["041d31b8-0dcd-4db1-a0cc-7bedfc58a54e", "18de32a2-8006-4bdd-97c4-71044d00c4f4", "1a5ad2e4-80fe-4b53-9372-f9e03e61c672", "40d9a6c9-b99e-43cc-90eb-5259cf4416a0", "4360e990-7ca9-497b-b9b8-d06b52921e9c", "4d7b8578-ed96-4ec5-815b-2b7eaa26027b", "57c6673d-31c7-4ba4-9450-87e48d321746", "595d6c6a-97e0-4004-84e3-e15d47ef1dea", "691983e4-67cb-4456-9462-42b22c620c64", "6f8f9bc0-3c9a-4583-8819-2bd39263bd15", "73e2351c-68de-48a8-96c7-8de34874fc22", "79c3c944-9ff5-49e8-a417-7c7ac330f173", "7c34784a-8e63-4567-b81e-ee2151280d6e", "8026f56a-a93e-4933-8ead-c9aa9e3f0498", "9e94c8cd-dfc0-4d63-be98-79c88ac8a94b", "b099c8ef-a537-445b-9796-de1fa6f0fdd1", "baf11223-a0ff-42da-be55-f5aee2a33f53", "c90860b1-5c52-4331-bbb7-84987c99c85a", "d3eba760-a42c-464d-ad74-4e705a84b626", "dd95e6c3-080a-4172-af71-88d3ec7838a2", "ed543a19-85d9-427a-a2d3-88e7c59a100e", "edc9ac42-597c-425f-aa22-54012cd32d7d", "f3493daa-be6b-4efa-9116-fa6386b643a9", "fad8c847-0808-4fa2-871b-c1a8083d4e2f", "fd3961fe-42e4-4c92-88fe-26f91ed463a3"], "title": "Polarity trend analysis of public sentiment on YouTube", "venue": "international conference on management of data", "year": 2013, "id": "16786d62-b0ce-4e48-bdac-40ceaa7fc7e5"}
{"authors": ["Yuka Takai", "Masahiko Yamada", "Akihiko Goto", "Wang Zelong", "Akira"], "n_citation": 0, "title": "Comparative Study on the Feature of Kitchen Knife Sharpening Skill between Expert and Non-Expert", "venue": "", "year": 2014, "id": "167d892b-28c5-4165-abd1-42f94504f74c"}
{"authors": ["Masahiko Sato", "Randy Pollack"], "n_citation": 5, "title": "External and internal syntax of the lambda-calculus.", "venue": "Journal of Symbolic Computation", "year": 2010, "id": "16828f2f-787f-4180-a16f-3996fd98431c"}
{"authors": ["Seonah Lee", "Sungwon Kang"], "n_citation": 50, "references": ["0afeccb4-9d47-4b74-b93f-a4c359d69102", "118d3afc-32c9-49ad-a25b-2ea688d2018e", "222ae4f1-7662-4c7e-88ba-5b00aa4bbf15", "22cba7e6-658b-4785-89b7-3658575dcb2d", "259c2a82-15f9-4709-bb22-458fa038d5e6", "2d5968b8-f1dc-4724-9181-36f28735c6d1", "334981f8-f535-4e82-bb73-babea01da24d", "39dbbb11-74b5-49a6-8fae-51582181a8ce", "513c0069-67a2-4e9c-8d28-f5d1bd619a88", "6c4d90c8-cc2a-47c6-a6fc-361c36d01ddc", "7277965d-e1ce-4be2-b419-945d684272f4", "73fca154-36d4-460b-a683-ca4a6ee68b44", "7ef3cfc1-fe4e-47f0-9679-202db28f2461", "b0365da4-0fe4-451a-a9ea-b9cd48162130", "bc3eee18-dec3-47c8-8908-d9dc1e1197ee", "c70302cf-fa1e-4b2b-91a2-5b31e65ed828", "d24b9cd1-0e46-4783-90a8-4a8ec3fcb53b", "da1212e7-b03d-4324-89cf-9a7ae46fd1ec", "e2d26a69-721f-4238-a8df-c0a5724546b9", "e97e1eb8-f45b-4aad-80e8-3b3f3268c823", "ede8a6d8-dbde-4e4f-ac34-2a3076bae2f3"], "title": "A Study on Guiding Programmers\u2019 Code Navigation with a Graphical Code Recommender", "venue": "", "year": 2012, "id": "168b9e24-2967-4e7a-8b8d-8852c9b7b9b3"}
{"abstract": "Today's machinery and equipment industry is a highly volatile market, giving rise to frequently instable and inapprehensible buyer-supplier-relationships and to turbulences with respect to reliability of deliveries. With this paper we propose a minimal invasive approach how to overcome existing capability limitations in production planning, scheduling and procurement of ERP-systems by using real options as means for coordinating the divergent interest of buyers and suppliers. Following the design research paradigm, we first describe how real options can be integrated in a contemporary ERP-system. In a supplemental evaluation, the attitude toward using this approach is discussed. This final discussion provides insights whether companies in the machinery and equipment industry are willing to adopt our real options approach, or if they prefer the use of other, not necessarily IT-enabled, means for handling the poor delivery reliability.", "authors": ["Tobias Mettler", "David Raber", "Hagen Hoffmann"], "n_citation": 2, "references": ["120355f4-35d5-4867-8158-f2e6da318a24", "a0f6dd02-547d-4501-8c94-f4201a0331ea", "ba76c3e1-dbba-479f-8b50-e27299668d51"], "title": "Using Real Options in ERP-Systems for Improving Delivery Reliability", "venue": "", "year": 2011, "id": "16b3896c-a25c-4f32-92af-8b9ab2e566f5"}
{"abstract": "Ensembles are committees of neural networks used to achieve better classification and generalization accuracy in contrast to just using a single neural network. Traditionally incomprehensible models such as artificial neural networks presents a problem in its application to safety critical domains where not only accuracy but also model transparency is a requirement. This problem is not only inherited but further multiplied in ensembles. Furthermore, the aspect of diversity by which ensembles achieve improved classification ability cannot be reflected in rule extraction methods designed for single neural networks hence the need for rule extraction methods specifically designed for ensembles. This paper presents a decompositional rule extraction algorithm for ensembles which is able to approximately decompose the neural networks in an ensemble and reflect their collective diversity to identify significantly contributing inputs.", "authors": ["Fabian H. P. Chan", "Ali Chekima", "Augustina Sitiol", "S. M. A. Kalaiarasi"], "n_citation": 0, "references": ["7cd3d1bf-4df0-46c8-9e75-701534e5d93c", "f1db0913-8f42-447a-8f39-8e1b6cd86190"], "title": "Depicting diversity in rules extracted from ensembles", "venue": "international symposium on neural networks", "year": 2009, "id": "16d2d1d6-d28e-4f94-8975-cf92c648f032"}
{"abstract": "AbstractThe goal of this paper is to analyse a method of validating a subset of gesturesto be used as elements of a HCI interface. We investigate the applicability ofLDA for gesture data dimensionality reduction. An Gesture mutual separabilityanalysis of a diverse dataset of 22 natural gestures captured with two motion-capture devices is provided. Fisher criterion is used to produce measures of classseparability and class overlap.Keywords: LDA, gestures, separability, HCI, motion-capture1. IntroductionWith a widespread use of motion-tracking devices, both traditional e.g. com-puter mouse and new Nintendo Wii Remote TM , cell phone accelerometer ar-rays, the importance of motion-based interfaces in Human-Computer Interac-tion (HCI) systems became unquestionable. The commercial success of simplemotion-capture devices led to the development of more robust and versatileacquisition systems, both mechanical e.g. Cyberglove Systems Cyberglove TM ,Measurand ShapeWrap TM , DGTech DG5VHand and optical e.g. MicrosoftKinect", "authors": ["Micha\u0142 Romaszewski", "Piotr Gawron", "Przemys\u0142aw G\u0142omb"], "n_citation": 1, "references": ["2b46141b-41bf-46b8-be0c-577ac840b450", "32348352-91bb-4236-8246-b83494b58784", "341a6e12-e30b-40a0-a746-de0bc30f15e2", "48853211-02a5-4f29-80d7-f278bf4a0e07", "cc530502-5209-4524-ab4d-fef5002e08ee"], "title": "Towards a natural gesture interface: LDA-based gesture separability", "venue": "", "year": 2011, "id": "16d61825-439f-4972-a2aa-a508621fc930"}
{"authors": ["Soeli T. Fiorini", "Julio Cesar Sampaio do Prado Leite", "Carlos Jos\u00e9 Pereira de Lucena"], "n_citation": 15, "references": ["e7b4f48e-4740-4c87-a4cd-2afcdaf58935"], "title": "Organizando Processos de Requisitos.", "venue": "", "year": 1998, "id": "16dce60f-75b2-4a06-b5de-68bf9f607951"}
{"abstract": "State-of-the-art score normalization methods use generative models that rely on sometimes unrealistic assumptions. We propose a novel parameter estimation method for score normalization based on logistic regression, using the expected parameters from past queries. Experiments on the Gov2 and CluewebA collection indicate that our method is consistently more precise in predicting the number of relevant documents in the top-n ranks compared to a state-of-the-art generative approach and another parameter estimate for logistic regression.", "authors": ["Robin Aly"], "n_citation": 0, "references": ["06f1575a-c67e-47bc-a442-0980a147ab0b", "0fe14115-712a-4113-94cc-1efef71cf835", "3ea7dc3b-ce46-4db7-ba5b-4fe6838f9068", "43d05ba5-52a1-46e4-be2e-7d6844cdc537", "4cbd7765-c47a-4004-a5f8-c2da7c7d1c7b", "68e30607-d575-4dd2-9a05-b254b9fe42f8", "81e0bb5c-07cd-417b-b532-534ccc9eff7d", "8ff7c0cc-5380-41f5-8813-63c31ae35744", "d36f50b1-58fb-4d77-bd29-3ec2e4d28c5c", "e2853037-6730-43ca-b056-27976ac19c4d", "f916a558-f4e8-4321-9696-4c4a89fbe1fd"], "title": "Score Normalization Using Logistic Regression with Expected Parameters", "venue": "european conference on information retrieval", "year": 2014, "id": "16eb86f5-ff07-4834-90fc-3add9b1956be"}
{"authors": ["Anne Schlicht", "Heiner Stuckenschmidt"], "n_citation": 26, "references": ["0f8f496d-9144-4eed-aab1-549f6bf3c6f6", "2ed50546-1ad9-4d14-9865-11a2808ce855", "4d1e29b8-d332-4da6-b7e1-effe07120f39", "adf4ad46-2a3c-43f5-8d43-fad69a9a3de3", "bb2caec9-4ddc-4d01-a059-dcb2bd28416e"], "title": "Distributed Resolution for ALC", "venue": "", "year": 2008, "id": "16f60c39-a919-4d9b-9574-4d774f2e8cee"}
{"abstract": "One of the most critical steps in 3D GIs database establishment and revision as well as automated digital photogrammetry is to capture the 3D man-made structures from stereo images automatically and accurately. The key problem for fulfilling such a task is to resolve the correspondence problem between image pairs. The most challenging problems exist in the large scale imagery of dense urban or suburban areas where the structures are very complex, unsmooth and quite different in size. In this paper, we address an reliable and effective system aiming at reconstructing the ground surface and extracting houses with relative disparity from the complex aerial imagery in urban areas.", "authors": ["Zhongchao Shi", "Ryosuke Shibasaki"], "n_citation": 0, "references": ["010e8977-1ff2-4c21-b2c6-3d15a6788d09", "45a087f4-1a1d-4410-832f-5c104f7cf936", "949fed91-42ee-41f0-b9ba-b02b436a043f", "9d5dc99a-788b-4b84-a52a-5177b64659d9", "a7a13d2f-a585-42de-8ce6-d23703a52fe3", "f18744e0-0932-480c-bf08-46ef41626e7d"], "title": "An Approach to Automated House Recognition from Digital Stereo Imagery", "venue": "Journal of Machine Vision and Applications", "year": 1996, "id": "16ff54bc-4aea-4789-985b-8ccae0ff08b6"}
{"abstract": "Automated image interpretation is an important task with numerous applications. Until recently, designing such systems required extensive subject matter and computer vision expertise resulting in poor cross-domain portability and expensive maintenance. Recently, a machine-learned system (ADORE) was successfully applied in an aerial image interpretation domain. Subsequently, it was re-trained for another man-made object recognition task. In this paper we propose and implement several extensions of ADORE addressing its primary limitations. These extensions enable the first successful application of this emerging AI technology to a natural image interpretation domain. The resulting system is shown to be robust with respect to noise in the training data, illumination, and camera angle variations as well as competitively adaptive with respect to novel images.", "authors": ["Ilya Levner", "Vadim Bulitko"], "n_citation": 20, "references": ["09f84a0b-d836-49bf-8dc9-204e12a7dbdc", "664ae07f-2d1b-4dae-bced-6d6ecce50279", "7005ed91-51b0-4893-bd78-7598b8b4dc8f", "e0f3a738-4ab2-40d1-ba44-506d81c1d230", "f7b9d56c-d316-423d-b678-33480506e957"], "title": "Machine learning for adaptive image interpretation", "venue": "national conference on artificial intelligence", "year": 2004, "id": "171ddf02-2ccf-40da-b9a2-c9c998e94517"}
{"authors": ["Andr\u00e9 Ahuja", "Wilhelm R\u00f6dder"], "n_citation": 0, "references": ["12b005df-332b-4a28-a95e-d87b78782a0b", "3e1a3e04-9327-4823-839a-e54ee65ba960", "6c1cbae0-b86f-4802-96ae-6afbd11aaf5d"], "title": "Project Risk Management by a Probabilistic Expert System", "venue": "A Quarterly Journal of Operations Research", "year": 2003, "id": "171f033a-8190-49a0-91d4-78572a7b0100"}
{"abstract": "Twitter is extremely useful for connecting with other users, because, on Twitter, following other users is simple. On the other hand, people are often followed by unknown and anonymous users and are sometimes shown tweets of unknown users through the tweets of the users they follow. In such a situation, they wonder whether they should follow such unknown users. This paper proposes a system for visualizing impression-based preferences of Twitter users to help people select whom to follow. The impression-based preference of a user is derived based on the impressions of the tweets the user has posted and those of the tweets of users followed by the user under consideration. Our proposed system enables people to select whom to follow depending on whether or not another user adheres to the user's own sensibilities, rather than on whether or not another user provides valuable information.", "authors": ["Tadahiko Kumamoto", "Tomoya Suzuki", "Hitomi Wada"], "n_citation": 0, "references": ["37724a79-05bd-43b9-a5e2-53d853bf9881", "3f57ed9f-706c-486f-b413-aaa4371ff485", "60798bc3-51e5-41b8-8276-4afaa47fd0d3", "699f58b4-0b69-4574-9de7-33ca0e454d61", "69f56230-b6db-4617-be5a-7213d8cfb4f5", "96ee260d-b218-4e21-8ebd-741bdb46246c", "bd73cef4-eb81-4abd-a73f-c1d6188bf68e", "cca70d16-59c3-47bc-bc1a-58ea35a7acad", "da773e14-5247-4600-8da8-2452699899d9", "e2783d80-103d-42b3-9e2c-7be06db3686a", "e7a80228-dd3a-40b5-ae3f-086972315bb6"], "title": "Visualizing Impression-Based Preferences of Twitter Users", "venue": "international conference on social computing", "year": 2014, "id": "172dcad7-1af0-44ab-a369-9fa1958ec329"}
{"abstract": "An active security system assures that interacting robots don't collide or that a robot operating independently doesn't hit any obstacle that is encountered in the robots workspace. In this paper, an active security system for a FANUC industrial robot is introduced. The active security problem where one robot needs to avoid a moving obstacle in its workspace is considered. An obstacle detection and localization mechanism based on stereoscopic vision methods was successfully developed. To connect the vision system, an operator's pc and the robot environment a real-time communication is set up over Ethernet using socket messaging. We used fuzzy logic for intelligent trajectory planning. A multitask oriented robot application in the KAREL programming language of FANUC Robotics was implemented and tested.", "authors": ["Bart Fevery", "Bart Wyns", "Luc Boullart", "J.R. Llata Garcia", "C. Torre Ferrero"], "n_citation": 1, "title": "Active security system for an industrial robot based on artificial vision and fuzzy logic principles", "venue": "international conference on informatics in control, automation and robotics", "year": 2008, "id": "173f857e-f2fa-4035-84b2-613974a110b1"}
{"abstract": "Knowledge-based recommenders support users in the identification of interesting items from large and potentially complex assortments. In cases where no recommendation could be found for a given set of requirements, such systems propose explanations that indicate minimal sets of faulty requirements. Unfortunately, such explanations are not personalized and do not include repair proposals which triggers a low degree of satisfaction and frequent cancellations of recommendation sessions. In this paper we present a personalized repair approach that integrates the calculation of explanations with collaborative problem solving techniques. In order to demonstrate the applicability of our approach, we present the results of an empirical study that show significant improvements in the accuracy of predictions for interesting repairs.", "authors": ["Alexander Felfernig", "Gerhard Friedrich", "Monika Schubert", "Monika Mandl", "Markus Mairitsch", "Erich Christian Teppan"], "n_citation": 66, "references": ["2a73f987-98cc-4d8b-bf27-9d8d0834c57c", "2b31c2c7-4c00-42d1-ab15-48ced2fdcc43", "39317a51-3069-482f-aeeb-7b5117879523", "44e91111-b413-4143-85a9-81872a97fa9d", "4ccb7308-48e7-47a2-a013-38c319831130", "6ad18b77-64b9-4b89-b10a-166162597c55", "8ee057e3-64d4-4e7a-b2e8-b24c18c73c67", "9e656663-b756-4172-b88e-429805834e16", "a3dff565-d97f-4982-82e6-111e5332f375", "a7192436-9790-4cdd-a585-3e9ef0c1d32b", "e4209f92-6f22-406c-9d10-10ebccb8bbc2"], "title": "Plausible repairs for inconsistent requirements", "venue": "international joint conference on artificial intelligence", "year": 2009, "id": "1740b58a-bdb0-4171-9255-c32b1784ba6e"}
{"authors": ["Jose Maria Elvira", "Juan Carlos Torrecilla", "Javier Caminero"], "n_citation": 0, "references": ["5dce227d-1e03-4b93-a066-dd898e347084", "b808f543-8b3f-43b3-814d-3ad86092fc31", "d884df9f-fd5f-41a4-859a-e0ce7b9da6e4", "ffa9d0a8-d9e3-4411-bc53-7fe88cd9a29f"], "title": "Creating user defined new vocabularies for voice dialing.", "venue": "conference of the international speech communication association", "year": 1997, "id": "1741df92-a8e2-451f-866d-b293bdb2ae4e"}
{"abstract": "A queueing system of the M/M/1/(\u221e,V) type with generally distributed packet volumes and bounded capacity (total packets volume) is considered. The queue length is controlled by means of the accepting function that enqueues the arriving packet with probability depending on the free capacity volume in the system at the pre-arrival epoch. Explicit representations for stationary probabilities are derived via solving the system of differential equations. Sample numerical results are attached in which stationary queue-size distributions with and without dropping packets are compared.", "authors": ["Oleg M. Tikhonenko", "Wojciech M. Kempa"], "n_citation": 50, "references": ["0e997e74-622c-4c49-92cc-51ace34b09f1", "6af44776-cd08-4180-b9ac-ac954a61fc0c", "79d1216f-124f-43cc-9b0b-3227fb4f8547", "860f6061-a44c-4176-b752-2c8af0507af0", "a46749c2-ebbb-4330-9ac6-55e2cebf9aaa", "d2b7db5d-bc47-48c7-a173-865fed9bff96"], "title": "The generalization of AQM algorithms for queueing systems with bounded capacity", "venue": "parallel processing and applied mathematics", "year": 2011, "id": "17664585-99f0-47bd-bf12-d8408e48a526"}
{"abstract": "This study has tried to suggest a new model that can effectively redistribute the tickets in the online ticket resale market, while suggesting a new allocation mechanism based on an agent negotiation. To this end, this study has analyzed and simulated the secondary ticket market through System dynamics. As a result of these simulations, it has been proved that the price stability of ticket resale market leads to an increase in revenue. An agent negotiation helps to stabilize the ticket prices that are usually inclined to rise at auction, benefiting all the participants in the negotiations, consequently showing a Pareto solution.", "authors": ["Jae Hyung Cho", "Hyun Soo Kim", "Hyung Rim Choi", "Jae Un Jung"], "n_citation": 3, "references": ["4bf5bd45-b1b0-4457-857a-8f8bf4e7bab5", "78d98145-3094-41da-99c4-8bbcf5df57cf", "86a84459-4a2e-4e99-b539-153217c97a02"], "title": "Agent system for online ticket resale", "venue": "agent and multi agent systems technologies and applications", "year": 2008, "id": "178010f0-1afb-4438-82d0-83080101f62a"}
{"abstract": "Psychotic disorders are the most disabling of all mental illnesses and place a heavy demand on limited mental health services. Consequently, this research aims to develop novel approaches to care which are less demanding of public resources. This research-in-progress is based in an innovative youth mental health service in Australia. It presents a model for a web-based platform which provides support for relapse prevention in young people with first-episode psychosis (FEP). This study combines Information Systems and Psychology theory and research to develop an advanced web-based interactive psychosocial intervention for relapse prevention and recovery in FEP. While web-based applications to support schizophrenia, depression and anxiety have been researched such approaches have not been applied to the problem of relapse prevention in young people with FEP. The research uses focus groups to study case managers, clients of the support organisation and usability experts to inform an initial prototype which has then been presented to a group of clients for evaluation. It concludes that an intervention based on intelligent technologies which combine social networking and web-based treatment to promote independent home based care would best suit the characteristics of the target group and should be tested in large-scale in the community.", "authors": ["Reeva Lederman", "Gregory Wadley", "John Gleeson", "Mario Alvarez-Jimenez", "Anneliese Spiteri-Staines"], "n_citation": 6, "references": ["207c1b25-bd5a-4fc3-8be5-624fc53e103c", "bc4b1e0b-a87b-4601-bc91-9c1e7248610f", "d1d3af51-ebad-4d51-b89e-5f98b46118b6"], "title": "SUPPORTING YOUNG PEOPLE WITH PSYCHOSIS IN THE COMMUNITY: AN ICT ENABLED RELAPSE PREVENTION TOOL", "venue": "pacific asia conference on information systems", "year": 2011, "id": "1786d0e0-6235-4287-a920-f0af1d1a3572"}
{"abstract": "An important aim in bilateral negotiations is to achieve a win-win solution for both parties; therefore, a critical aspect of a negotiating agent's success is its ability to take the opponent's preferences into account. Every year, new negotiation agents are introduced with better learning techniques to model the opponent. Our main goal in this work is to evaluate and compare the performance of a selection of state-of-the-art online opponent modeling techniques in negotiation, and to determine under which circumstances they are beneficial in a real-time, online negotiation setting. Towards this end, we provide an overview of the factors influencing the quality of a model and we analyze how the performance of opponent models depends on the negotiation setting. This results in better insight into the performance of opponent models, and allows us to pinpoint well-performing opponent modeling techniques that did not receive much previous attention in literature.", "authors": ["Tim Baarslag", "Mark Hendrikx", "Koen V. Hindriks", "Catholijn M. Jonker"], "n_citation": 50, "references": ["1bf9f837-176b-4c10-850c-6d7fbd088231", "20e0bbf5-13ed-4210-a563-554790d25426", "252bfd61-1b5d-4919-933b-1bc44b080dbb", "290b227f-2739-413d-9e09-30f8db9e879d", "42dcc539-ec57-4057-b925-f5ad8c22fd2a", "52246c56-9031-4c95-a21e-aaba5e920a30", "55f9c2d5-33af-4a6e-a666-b9a85fcbf625", "58eb6aba-c8f0-49d6-8739-cee5ab13406d", "5b37c5ac-0f80-4d48-b37c-698a097ed3cb", "8ec75bba-42a3-4564-8f7a-a685bebdc115", "929860d7-012d-4ba1-b5da-0de07a516b6a", "a64da5d5-94e9-4c8e-a895-519d8e274876", "d3e06ab3-47b2-4aae-a97c-88265f01f912", "eecd7789-8492-4dba-857e-e1166005e6c5"], "title": "Measuring the performance of online opponent models in automated bilateral negotiation", "venue": "", "year": 2012, "id": "178f772c-95e3-478e-b6ab-8833e98e91d3"}
{"authors": ["Michael H. Bowling", "Manuela M. Veloso"], "n_citation": 277, "references": ["1e13f910-e5b8-4f1c-89fc-d3b9c70d6b6b", "42f10be9-da7b-4d94-baec-d02efbb0815e", "5db638c0-4803-4de6-a2b0-8ad21a2305bd", "64a1ab41-2b4e-42ac-b9e3-3ec68cb069b2", "7d4aa8eb-58cc-4a7c-8f54-8498c9e309b5", "d72b168f-3163-4314-a48e-5d6471840519", "e47a1602-0813-48a1-bf41-bcbbb01a362e", "fceead9c-1a82-4ee4-9e12-1a99f990b7c1"], "title": "Rational and convergent learning in stochastic games", "venue": "international joint conference on artificial intelligence", "year": 2001, "id": "1797a9c0-5d78-4643-a608-05d54cc3da0e"}
{"authors": ["Shlomo Dubnov", "G\u00e9rard Assayag", "Ran El-Yaniv"], "n_citation": 61, "title": "Universal Classification Applied to Musical Sequences", "venue": "", "year": 1998, "id": "17a17836-a647-45bc-afe7-05bef19b6f86"}
{"abstract": "Correlated patterns are an important class of regularities that exist in a database. The all-confidence measure has been widely used to discover the patterns in real-world applications. This paper theoretically analyzes the all-confidence measure, and shows that, although the measure satisfies the null-invariant property, mining correlated patterns involving both frequent and rare items with a single minimum all-confidence (minAllConf) threshold value causes the \"rare item problem\" if the items' frequencies in a database vary widely. The problem involves either finding very short length correlated patterns involving rare items at a high minAllConf threshold, or generating a huge number of patterns at a low minAllConf threshold. The cause for the problem is that the single minAllConf threshold was not sufficient to capture the items' frequencies in a database effectively. The paper also introduces an alternative model of correlated patterns using the concept of multiple minAllConf thresholds. The proposed model facilitates the user to specify a different minAllConf threshold for each pattern to reflect the varied frequencies of items within it. Experiment results show that the proposed model is very effective.", "authors": ["R. Uday Kiran", "Masaru Kitsuregawa"], "n_citation": 50, "references": ["04af6fed-07e2-4dd4-834e-5a021a9ca04d", "101bc171-1661-486a-9ba2-11afe756528c", "28a1c09b-cfe5-497d-b828-47bc62c02694", "2952b845-26f6-464f-9bee-02be21ffeac5", "3502be66-bee8-437a-b09e-0866459c48ba", "46f6963a-2459-4e2c-8667-a8d0fcde43e9", "60cdc92a-4047-4634-addd-17a161f7ca76", "7482cc04-8a43-4494-b41a-e6e42259b30f", "7e578899-6e08-4604-bbfa-fd66137daf38", "8a6a4c08-fdc8-49c4-8e73-23e7fdb466d6", "b84f14ac-2d35-4ff5-92e4-f5465a99c2ec", "c732ddac-d337-4149-b55f-3e717e3859eb", "cc72f406-7f47-43bd-90df-9efe42aac82b", "de03f8d2-f24d-491d-8835-fee34a4312b7", "de0a39d5-300b-4ade-ace4-39a983d3725b", "e8634808-d804-4309-b5d3-d313c0df4ab7", "ecd6a845-8439-49b0-abe8-f71fff81da23"], "title": "Mining Correlated Patterns with Multiple Minimum All-Confidence Thresholds", "venue": "knowledge discovery and data mining", "year": 2013, "id": "17bc0791-8cb5-418d-beb4-23487f3b203e"}
{"abstract": "We suggest the use of two learning techniques - short term and long term - to enhance search efficiency in a multi-agent design system by letting the agents learn about non-local requirements on the local search process. The first technique allows an agent to accumulate and apply constraining information about global problem solving, gathered as a result of agent communication, to further problem solving within the same problem instance. The second technique is used to classify problem instances and appropriately index and retrieve constraining information to apply to new problem instances. These techniques will be presented within the context of a multi-agent parametric-design application called STEAM. We show that learning conclusively improves solution quality and processing-time results.", "authors": ["M. V. Nagendra Prasad", "Susan E. Lander", "Victor R. Lesser"], "n_citation": 11, "references": ["043e87c7-0eb4-459d-9f1f-e945e2b2cc3c", "29a6b975-d7cc-4a8a-9c29-6084a0e690cf", "465b050b-b3d4-43d1-94b3-ef8b7d11c1c7", "57cf99d2-dbb3-452e-90ed-a54fcd487115", "66829cc0-5092-4541-853e-cb4d18c9c573", "cf68936c-1b07-4edb-9f3d-2ce6765b0732"], "title": "Cooperative learning over composite search spaces experiences with a multi-agent design system", "venue": "national conference on artificial intelligence", "year": 1996, "id": "17c547df-6149-48a1-b02a-bf0cb5197b1f"}
{"authors": ["Satoshi Tojo", "Hideki Yasukawa"], "n_citation": 4, "title": "Situated Inference of Temporal Information.", "venue": "Future Generation Computer Systems", "year": 1992, "id": "17e07dea-20fe-4601-9253-23e6cabd15af"}
{"authors": ["Agn\u00e8s Conte", "Mounia Fredj", "Jean-Pierre Giraudin", "Dominique Rieu"], "n_citation": 27, "references": ["aac6cb6a-4552-4956-a6c2-4562591510c5", "e3d3dd16-8d48-4570-8046-336d9efe35f8"], "title": "P-Sigma : un formalisme pour une repr\u00e9sentation unifi\u00e9e de patrons.", "venue": "", "year": 2001, "id": "17f2ce8a-8d80-453a-9dec-b4b9f6631f99"}
{"abstract": "Abstract#R##N#The interpretation of a mammogram and decisions based on it involve reasoning and management of uncertainty. The wide variation of training and practice among radiologists results in significant variability in screening performance with attendant cost and efficacy consequences. We have created a Bayesian belief network to integrate the findings on a mammogram, based on the standardized lexicon developed for mammography, the Breast Imaging Reporting And Data System (BI-RADS). Our goal in creating this network is to explore the probabilistic underpinnings of this lexicon as well as standardize mammographic decision-making to the level of expert knowledge.", "authors": ["Elizabeth S. Burnside", "Daniel L. Rubin", "Ross D. Shachter"], "n_citation": 81, "references": [], "title": "A Bayesian network for mammography.", "venue": "", "year": 2000, "id": "1808966a-048f-4e6c-a799-4ee9f0d9f784"}
{"authors": ["Ren Kanehira", "Weiping Yang", "Miyoko Tateishi", "Makoto Yagihashi", "Hirohisa Narita", "Hideo Fujimoto"], "n_citation": 2, "title": "INSERTION ANGLE TEACHING FOR AN ACUPUNCTURE TRAINING SYSTEM", "venue": "international conference on computer supported education", "year": 2009, "id": "18518c77-2667-4fe6-a199-17740609ffff"}
{"abstract": "The number of mobile phone users has been steadily increasing due to the development of microtechnology and human needs for ubiquitous communication. Menu design features play a significant role in cell phone design from the perspective of customer satisfaction. Moreover, small screens of the type used on mobile phones are limited in the amount of available space. Therefore, it is important to obtain good menu design. Review of previous menu design studies for human-computer interaction suggests that design guidelines for mobile phones need to be reappraised, especially 3D display features. We propose a conceptual model for cell phone menu design with 3D displays. The three main factors included in the model are: the number of items, task complexity, and task type.", "authors": ["Kyungdoh Kim", "Robert W. Proctor", "Gavriel Salvendy"], "n_citation": 3, "references": ["14b86f69-153e-4e0e-b38b-344ac566419c", "1d08ae3f-0554-493c-bcbe-bd66607f86c6", "3d81dcf1-b7a3-41ff-88c4-95195abf68c4", "3f523b8b-54b0-4da1-999f-6a79b9ae94fc", "45a35c4e-746e-4750-9cc7-40f82f78bfcb", "552ba52e-c6c9-45d9-bb6e-7806f1ff9df9", "5cb097c8-8760-4db4-80cb-60bbf7ebc214", "70bc1188-7655-4f7f-ab60-bf7cb9f24978", "712fe125-d1bf-4ec7-a9f6-a3eefc3b484b", "74f72fd2-c94e-4a45-8431-66294cb6b70f", "89a2be3b-0a4a-4ec1-ae90-e8aad5f1b72c", "89e692fd-db7d-48fc-af14-3d99f453cdcb", "8d5c4c4a-d7a0-4c29-bab3-cbaed9340c43", "993253f7-c046-4605-9db8-208b914bdb04", "bb2bf89e-1175-4e93-a517-0e6a5e5cdb2b", "cd1a97ee-d828-44d7-95c7-6df629e36b79", "d830631c-89a7-40a4-9c66-2805cacecda7", "e2063e05-e6c0-4780-adf0-080248747a5b", "ebbad2a8-bd0d-4bfc-b9a0-d13facc03271", "f81043bd-29c9-45d6-854a-1adf0826565e"], "title": "Menu Design in Cell Phones: Use of 3D Menus", "venue": "international conference on human computer interaction", "year": 2009, "id": "185a62ee-9e4b-4350-b7f2-b9f0a495ca6a"}
{"abstract": "Parallel Computing:Current & Future Issues of High-End Computing,Proceedings of the International Conference ParCo 2005,G.R. Joubert, W.E. Nagel, F.J. Peters, O. Plata, P. Tirado, E. Zapata(Editors),John von Neumann Institute for Computing, Ju\u00a8lich,NIC Series, Vol. 33, ISBN 3-00-017352-8, pp. 333-340, 2006.c 2006 by John von Neumann Institute for ComputingPermission to make digital or hard copies of portions of this workfor personal or classroom use is granted provided that the copiesare not made or distributed for pro\ufb01t or commercial advantage andthat copies bear this notice and the full citation on the \ufb01rst page. Tocopy otherwise requires prior speci\ufb01c permission by the publishermentioned above.http://www.fz-juelich.de/nic-series/volume33", "authors": ["Jos\u00e9 Ignacio Aliaga", "Francisco Almeida", "Jos\u00e9 M. Bad\u00eda", "Sergio Barrachina", "Vicente Blanco P\u00e9rez", "Maribel Castillo", "Rafael Mayo", "Enrique S. Quintana-Ort\u00ed", "Gregorio Quintana-Ort\u00ed", "Casiano Rodr\u00edguez", "Francisco de Sande", "A. Santos"], "n_citation": 2, "references": ["00c86e99-d2ec-4273-a5a7-72cf48bd4b27", "20b468f4-9477-489f-bf82-f98009989db8", "fd0f00ce-c794-47b1-8316-f58ca9ede955"], "title": "Parallelization of GSL on Clusters of Symmetric Multiprocessors", "venue": "parallel computing", "year": 2005, "id": "188d86c7-ef53-4471-ac36-cde7f0fe28d7"}
{"authors": ["Florian Schiel", "Hannes M\u00f6gele"], "n_citation": 5, "references": ["b3b49545-d2b9-4dd5-aa7a-5e6d93e767b2", "bd786f8e-1d7a-400f-a536-d4032a26ef89", "befdd754-47f2-4ca9-8e36-6dd8acf11123", "faea6860-fb64-42a8-84bd-131f28f785e7"], "title": "Talking and Looking: the SmartWeb Multimodal Interaction Corpus.", "venue": "language resources and evaluation", "year": 2008, "id": "18ba39aa-4c0b-4f1d-9f86-7450c421bc28"}
{"authors": ["Xuchang Zou", "Raffaella Settimi", "Jane Cleland-Huang"], "n_citation": 9, "references": ["0bf79ef4-1a2d-4a1d-ad92-898d8ccaa9e9", "15e0548a-c0eb-4fc6-9bea-52df3df6098f", "1ce7a9a3-91c4-45d6-984a-e1d240fd81aa", "4b768e94-c115-4baf-833e-f534e7d2226b", "abe5bd58-6d6d-48b0-bd0c-29ec7b163a2e", "be4d9059-a8d3-45b2-8199-b03fdc4beb4d", "e427f800-7a52-4845-a774-fd5c823634d2"], "title": "Evaluating the Use of Project Glossaries in Automated Trace Retrieval.", "venue": "", "year": 2008, "id": "18d170d5-8c41-49d9-b4ac-fdc29ea7599f"}
{"abstract": "In this paper we generalise Pawlak's rough approach for simplifying a decision table in an information system. We consider an information system where attribute values are not always quantitative, rather subjective having vague or imprecise meanings. Some objects may have attribute values which are almost identical i.e., they can't be distinguished clearly by the attributes. Considering this observation we present a generalised method for reduction of decision table for different choice values of ? and s, ? being for condition attributes and s for decision attributes where ?, s ? [ 0, 1 ]. For ? = 1 and s = 1, the method reduces to Pawlak's method.", "authors": ["Shrabonti Ghosh", "Sk Safikul Alam"], "n_citation": 0, "references": ["a4589cfe-15e7-4c34-9349-d002d1d2c9df", "b2452c3b-1101-4269-a1c8-3b18c799ff33"], "title": "(alpha, beta) Reduction of Decision Table: A Rough Approach", "venue": "soft computing", "year": 2002, "id": "18ec794a-c30e-4a6a-be2a-cea8e703e519"}
{"abstract": "In text classification the amount and quality of training data is crucial for the performance of the classifier. The generation of training data is done by human labelers - a tedious and time-consuming work. We propose to use condensed representations of text documents instead of the full-text document to reduce the labeling time for single documents. These condensed representations are key sentences and key phrases and can be generated in a fully unsupervised way. The key phrases are presented in a layout similar to a tag cloud. In a user study with 37 participants we evaluated whether document labeling with these condensed representations can be done faster and equally accurate by the human labelers. Our evaluation shows that the users labeled word clouds twice as fast but as accurately as full-text documents. While further investigations for different classification tasks are necessary, this insight could potentially reduce costs for the labeling process of text documents.", "authors": ["Christin Seifert", "Eva Ulbrich", "Michael Granitzer"], "n_citation": 8, "references": ["379938bf-60e9-4873-b6ea-cd2b2eabcd11", "4123bb52-0909-4dbd-a750-441db6e97953", "4adb467d-dacf-4019-b0d5-28ce1f323cf4", "4cbd7765-c47a-4004-a5f8-c2da7c7d1c7b", "633dbe31-9df1-4058-a1e3-01aa043c0c1e", "6a361b17-96a8-43db-a101-e1d0dd889fbf", "702a38fc-fa83-434f-89a6-cb50b574b695", "8026f56a-a93e-4933-8ead-c9aa9e3f0498", "8571378e-6886-4c62-9e80-8cf60a237083", "9a7da388-3ee0-473b-bf14-6eecceeb66ef", "efbfab76-9d48-4581-8061-9a2a4f82a266"], "title": "Word clouds for efficient document labeling", "venue": "discovery science", "year": 2011, "id": "18eeebc2-1ca5-4750-95cd-8494309561f8"}
{"authors": ["Mauro Prevostini", "Sivakumar Ganesan"], "n_citation": 1, "references": ["c99658ac-bd8f-455e-ac3c-e48c59eb19ba", "e2bec25f-bebc-49ee-a1c5-a0b32ce2c29b", "f81cd366-5095-4c4a-b645-2cd27b8a38fd"], "title": "Bridging the Gap Between SysML and Design Space Exploration.", "venue": "forum on specification and design languages", "year": 2006, "id": "18f67514-ea0f-4beb-a6e5-9aa31d2b72d0"}
{"authors": ["Leandro Loss", "Ricardo J. Rabelo", "Alexandra A. Pereira-Klen"], "n_citation": 1, "references": ["3796988f-166d-48d3-b6b0-ab8e1a5a20ae", "a6bd9b2c-39f7-4d0e-8686-5744962fdc91", "dd923140-ce57-4937-9bdb-9a72e7b90a01", "e2f22331-954f-44cd-9d82-c3ccd1dea20b"], "title": "A Generic Framework Based on Machine Learning Techniques for Virtual Organization Management", "venue": "working conference on virtual enterprises", "year": 2005, "id": "19265cdd-e06d-45a8-9eb4-7c51a3fad199"}
{"authors": ["Edgard Thomas Martins", "Isnard Thomas Martins", "Marcelo M\u00e1rcio Soares"], "n_citation": 0, "references": [], "title": "The Encourage Operators to Promote Manual Flight Operations- a Pandemic in Modern Aviation", "venue": "", "year": 2014, "id": "192d6a21-bde7-4d69-9003-a70f9a6824fb"}
{"abstract": "During a rehabilitation session, patient activity should be continuously monitored in order to correct wrong movements and to follow patient improvements. Therefore, the application of human motion tracking techniques to rehabilitation is finding more and more consensus. The aim of this paper is to propose a novel, low-cost method for hand pose estimation by using a monocular motion sensing device and a robust marker-based pose estimation approach based on the Unscented Kalman Filter. The hand kinematics is used to enclose geometrical constraints in the estimation process. The approach is applied for evaluating some significant kinematic parameters necessary for understanding human hand motor improvements during rehabilitation. In particular, the parameters evaluated for the hand fingers are joint positions, angles, Range Of Motion and trajectory. Moreover, the position, orientation and velocity of the wrist are estimated.", "authors": ["Francesca Cordella", "Francesco Di Corato", "Loredana Zollo", "Bruno Siciliano"], "n_citation": 2, "references": ["0e6b8506-f5c8-4a83-aad0-7a7a4d943ccb", "4c927ffe-7253-4922-ab42-6c144345c797", "61e09f39-642f-4dd3-98f2-8849339d5c75", "8bb53ded-ea13-40aa-a943-39ef4f4b38df", "a1fb7d7f-fb69-468e-8a17-d3c27a36616c", "ceb3f0ba-9e88-47f6-a173-40dba1f7271c", "e544930f-f489-4e82-8664-098b109d6727", "e6fc8f14-14a8-4272-893d-5f7bc6299b21", "f40d6047-67c3-44c8-9e97-12665db64157"], "title": "A Robust Hand Pose Estimation Algorithm for Hand Rehabilitation", "venue": "international conference on image analysis and processing", "year": 2013, "id": "19406a3e-477f-40a2-9bfe-0324f3b37900"}
{"authors": ["J\u00f6rg Becker", "Dominic Breuker", "Patrick Delfmann", "Hanns-Alexander Dietrich", "Matthias Steinhorst"], "n_citation": 6, "references": ["05446ffd-ac21-469b-b061-d6ceefc9c01a", "1596d6df-ae21-4519-acf8-f0ad8617d5a6", "2dbd1339-2b25-492f-b7ea-091b8a1d9bbb", "37c410d1-04e8-4c71-be54-b945dcbf883b", "383d0893-567f-4983-93e6-3cd522c3427e", "41f91329-2d13-4cc2-9333-7e5ed6ad37d2", "4f736331-4663-4b8b-8317-c04c59b32a25", "536b005f-2909-4a87-a8c2-01a0c722849f", "58951be9-14df-4324-8dc7-be3af28ccbd6", "5c759cf4-9b03-4b71-9864-2982764f6f0b", "61195a79-c9da-4895-b5a8-2007ab38b9ed", "66af02bc-ff71-4504-9425-53227b29573b", "9c896040-487a-46ef-857e-18c6e9deaa0d", "9d6dea63-3859-4854-bec7-d9a3ae9f105c", "acecf9ba-65aa-4167-be07-db21f67120a9", "afa2f2c1-1abd-437d-ae3f-e7853d7095ff", "bd73cef4-eb81-4abd-a73f-c1d6188bf68e", "c1ae6be5-8324-4416-96e8-74839dee9a06", "d96aa9d1-c262-44f9-90d5-e14eb21b4e17", "e3b0069c-7e5e-443c-a347-342296aacf6a", "eed310ff-99dc-424b-a2a5-21de4cce3bb5", "f4c210f8-34e7-4aff-b93b-ee423388998d", "f4e7b9b0-e1dc-41a9-9ac8-d731b9a4cc2f", "fabf6595-1331-4f1a-a6e0-24e1001a1fe7"], "title": "A Runtime Analysis of Graph-Theoretical Algorithms to Detect Patterns in Process Model Collections", "venue": "business process management", "year": 2012, "id": "195325f0-7e90-42c9-adfd-0a69e1730d2a"}
{"authors": ["Youssef Amghar", "Madjid Meziane"], "n_citation": 8, "references": [], "title": "Designing Databases Using the Activity Paradigm.", "venue": "advances in databases and information systems", "year": 1996, "id": "195ab741-3900-441b-9750-c28ad871b5ab"}
{"abstract": "Computer adaptive testing is a form of educational measurement that is adaptable to examinee's proficiency. The usage of a computer adaptive testing brings many benefits but requires creation of a big and a calibrated item bank. The calibration of an item bank made by statistical methods is expensive and time consuming. Therefore, in this paper we worked out an easy item bank calibration method based on experts' opinions. The proposed algorithm used the Consensus Theory. The researches pointed out that the proposed calibration procedure is efficient. As little as three experts' opinions were enough to obtain the calibrated item bank where values of items' parameters estimated by an expert-based method were not statistically different from values of items' parameter estimated by a statistical calibration method. The statistical calibration method required engaging over 50 persons.", "authors": ["Adrianna Kozierkiewicz-Hetma\u0144ska", "Rafa\u0142 Poniatowski"], "n_citation": 0, "references": ["60a7ead2-863a-46ad-9d8a-8102bda59415", "8314daf4-e25c-4790-a1d5-2061bc01d461", "8743ede7-167a-48a8-9f43-9953bef5e7e5", "ca72aa1d-37f5-44be-98af-aef6f8f5b750"], "title": "An Item Bank Calibration Method for a Computer Adaptive Test", "venue": "asian conference on intelligent information and database systems", "year": 2014, "id": "1964a6d7-0647-4e2b-9a37-bf20bca780c5"}
{"authors": ["Daniel N. Klein"], "n_citation": 0, "title": "Data-Oriented Parsing edited by Rens BodRemko SchaRemko Scha.", "venue": "Computational Linguistics", "year": 2004, "id": "197139f1-0b44-44dd-af15-98dd5f907966"}
{"authors": ["Jos\u00e9 Maria Duarte", "Magal\u00ed Gonz\u00e1lez", "Luca Cernuzzi", "Oscar Pastor"], "n_citation": 0, "title": "Evaluaci\u00f3n del Desarrollo de Software Mediante una Herramienta MDA: Un Caso de Estudio.", "venue": "conferencia iberoamericana de software engineering", "year": 2008, "id": "198d7c62-c707-4e2e-9794-ef1c80843e9e"}
{"authors": ["HamidReza Haydari", "Ali Moeini", "MahdiReza Mohajerani"], "n_citation": 0, "title": "An Approach to Reduce False Alarms in an Intrusion Detection System.", "venue": "system analysis and modeling", "year": 2005, "id": "19931b86-15df-4fc1-a17a-37aaae8cee79"}
{"authors": ["Shoei Sato", "Kazuo Onoe", "Akio Kobayashi", "Shinichi Homma", "Toru Imai", "Tohru Takagi", "Tetsunori Kobayashi"], "n_citation": 0, "title": "Dynamic integration of multiple feature streams for robust real-time LVCSR", "venue": "conference of the international speech communication association", "year": 2007, "id": "1999773e-8512-4736-8f2a-622d338621bf"}
{"authors": ["Jesus Crespo", "Juan Carlos Galende D\u00edaz", "Pimitivo Matas"], "n_citation": 0, "title": "FPGA Implementation of an ATM Traffic Shaper: ATS (Abstract).", "venue": "field programmable gate arrays", "year": 1998, "id": "19a14645-4277-417b-9f5c-9c53ef36d183"}
{"authors": ["Fadoua Ataa-Allah", "Siham Boulaknadel"], "n_citation": 10, "references": ["050f3d56-45c0-4c32-86fb-db2fe9b5fb88", "6461b862-b1d2-47d8-8cc2-5cbf88028cba", "9e3c2ff9-9363-428e-a3b8-0d387e959b42", "b0ddb561-dca2-4e92-9ffa-01a7cd57ac2f", "b8c26d07-706a-4505-9126-a90ef64c96ae"], "title": "Amazigh Search Engine: Tifinaghe Character Based Approach.", "venue": "", "year": 2010, "id": "19dae39f-870a-4a2c-ad26-582d87b71f79"}
{"authors": ["Nitin Kanaskar", "Remzi Seker", "Srinivasan Ramaswamy"], "n_citation": 3, "references": ["4b5e938b-6bb4-4a4a-b60a-0fe355ab24ef", "5e9c9bd8-8df5-44ab-ba81-157ec376d6ec", "779e6d93-bb02-4f45-a6dc-ff996f1e03b5", "b183a338-50d9-4195-b2d1-78243b3de3e8"], "title": "A Dynamical System Approach to Intrusion Detection Using System Call Analysis.", "venue": "software engineering and knowledge engineering", "year": 2007, "id": "19ebda1e-2843-41bc-b1c9-b8ac520218c8"}
{"authors": ["Barbro Back", "Daniel E. O'Leary", "Richard J. Nowakowski", "Christian D. Mueller", "Marinos Themistocleous", "Eija Koskivaara"], "n_citation": 1, "title": "Panel: The impact of IT on accounting and auditing.", "venue": "european conference on information systems", "year": 2002, "id": "19f7a2d2-4aee-4e0f-99dc-5bd128b5704c"}
{"authors": ["Virgil Emil Cazanescu", "Grigore Rosu"], "n_citation": 16, "title": "Weak Inclusion Systems: Part Two.", "venue": "Journal of Universal Computer Science", "year": 2000, "id": "19ffe682-9348-4951-b189-1ba398ade6aa"}
{"authors": ["Jerzy Wechta"], "n_citation": 0, "title": "B. Haverkort: Performance of computer communication systems.", "venue": "Computer Communications", "year": 1999, "id": "1a155398-d482-4a7d-bdaf-26b0e1ab9fde"}
{"authors": ["Jon Doyle"], "n_citation": 0, "title": "Big Problems for Artificial Intelligence - Guest Editorial.", "venue": "Ai Magazine", "year": 1988, "id": "1a26655c-7635-45ba-9ce5-8c0cd0dc81ff"}
{"authors": ["Fernando Lu\u00eds Dotti", "Leila Ribeiro"], "n_citation": 4, "title": "Code Mobility in Open Systems: A Formal Approach.", "venue": "parallel and distributed processing techniques and applications", "year": 2000, "id": "1a2bc494-4190-42d0-bbd7-599baaf1727f"}
{"authors": ["Jean-Pierre Martens", "Annemie Vorstermans", "Nick Cremelie"], "n_citation": 10, "title": "A new dynamic programming/multi-layer perceptron hybrid for continuous speech recognition.", "venue": "conference of the international speech communication association", "year": 1993, "id": "1a2f8020-5d64-4117-89b5-a00134bd9c38"}
{"authors": ["Ashar Nisar", "Henry G. Dietz"], "n_citation": 8, "title": "Optimal Code Scheduling for Multiple-Pipeline Processors.", "venue": "international conference on parallel processing", "year": 1990, "id": "1a45213a-e825-42d9-a394-b68984c4c5f8"}
{"abstract": "In the context of the User Interface design process, diverse user requirements are likely to dictate differentiated design decisions. When developing user-adapted interfaces, which are capable of personalizing to end-user attributes, it is required to identify all the necessary alternative design artifacts emerging from diverse user requirements, and organize them in a form more usable for the implementation process. Currently, design methodologies do not provide adequate support for structuring alternative design decisions for user-adapted interaction in a unified form, thus not supporting a concise architectural model for mapping the design outcomes to an implemented user-adapted interface. We have developed the unified design method for driving the design process of user-adapted interfaces. The unified design method, which produces a fusion of all alternative designs (in a single form), is based on task definition and incremental physical polymorphic specialization (the polymorphism criterion being the user attribute values). We have implemented a target architectural model for mapping the design outcomes of the unified design process to implemented interactive systems.", "authors": ["Anthony Savidis", "Constantine Stephanidis", "Pier Luigi Emiliani"], "n_citation": 50, "title": "Abstract Task Definition and Incremental Polymorphic Physical Instantiation: The Unified Interface Design Method", "venue": "international conference on human computer interaction", "year": 1997, "id": "1a45fe12-23e7-4229-b41e-564b534742b9"}
{"authors": ["Felix T. S. Chan", "Ralph W. L. Ip"], "n_citation": 0, "title": "Explore the Operational Problems of FMSs through Analytical Hierarchy Process and Simulation Approach.", "venue": "industrial and engineering applications of artificial intelligence and expert systems", "year": 1996, "id": "1a4ffbdf-a530-4b25-ac28-c755053631b6"}
{"authors": ["Jianyun Zhou", "Tor St\u00e5lhane"], "n_citation": 10, "references": ["01decf54-7cc6-42a9-9450-f94d3f33c722", "180bc6bd-a378-401d-8cf3-a8cfeec41ba5", "1885e9f0-b340-43bc-a9a1-79f939125d21", "3e57ae8c-5d4c-434c-8a5a-cfcbfa09a04f", "652ddd03-70bf-41b3-8ce5-01abe7a355d6", "7eb4279a-a0c3-49e7-810a-0ee6c9fbf57f", "b3494da1-f978-4adb-978a-5b7099d5a2cd", "ea058348-b77a-4fd2-ad45-48dcd3522231"], "title": "A framework for early robustness assessment.", "venue": "", "year": 2004, "id": "1a624439-8fd4-4241-a5ff-cde6081a5578"}
{"authors": ["Hiroaki Hattori", "Satoshi Nakamura", "Kiyohiro Shikano", "Shigeki Sagayama"], "n_citation": 2, "title": "Speaker weighted training of HMM using multiple reference speakers.", "venue": "conference of the international speech communication association", "year": 1990, "id": "1a68fdad-505d-40d4-a441-d92305b2bad2"}
{"authors": ["Steven S. Beauchemin", "Quentin Brandon", "Mohamed Kotb", "Hussein O. Hamshari", "Michael Anthony Bauer"], "n_citation": 0, "title": "Parallel Simulation of Atmospheric Gas Dispersion.", "venue": "parallel and distributed processing techniques and applications", "year": 2006, "id": "1a6e0da6-eac3-4957-a6f1-afc6edb6983b"}
{"authors": ["Gregor Engels", "Manfred Nagl", "Wilhelm Sch\u00e4fer", "Bernhard Westfechtel"], "n_citation": 0, "title": "Tight integration on one document: the programming environment", "venue": "", "year": 1996, "id": "1a857ed7-e6b4-4cde-98db-58257058bf26"}
{"abstract": "Simulation can benefit from cloud computing that often comes with thousands of processors and its software is structured as Software-as-a-Service (SaaS) with its multi-tenancy architecture (MTA). This paper proposes Simulation Software-as-a-Service (SimSaaS) with a MTA configuration model and a cloud-based runtime to support rapid simulation development to be run in an elastic cloud environment.", "authors": ["Wei-Tek Tsai", "Wu Li", "Hessam S. Sarjoughian", "Qihong Shao"], "n_citation": 50, "references": ["2a411de0-5ea0-4ff2-a64e-b5968357360e", "a10376d8-209d-4c22-9210-ba4ca4949bfc", "c6a45ed2-3c7c-4c9c-a902-126a274a6a71", "e8f70072-72d8-4034-b213-5e5627490c8c", "f01d3ed3-de14-428f-b79e-673de97334d1", "f787a754-bc89-4038-be83-9d77797374e0"], "title": "SimSaaS: simulation software-as-a-service", "venue": "", "year": 2011, "id": "1a9aa75c-9295-4f6f-9e0e-29652dc568f9"}
{"abstract": "BPMN 2.0 is an OMG standard and one of the leading process modelling notations. Although the current language specification recognises the importance of defining a visual notation carefully, it does so by relying on common sense, intuition and emulation of common practices, rather than by adopting a rigorous scientific approach. This results in a number of suboptimal language design decisions that may impede effective model-mediated communication between stakeholders. We demonstrate and illustrate this by looking at BPMN 2.0 through the lens of the Physics of Notations, a collection of evidence-based principles that together form a theory of notation design. This work can be considered a first step towards making BPMN 2.0's visual notation more cognitively effective.", "authors": ["Nicolas Genon", "Patrick Heymans", "Daniel Amyot"], "n_citation": 38, "references": ["06b073fd-0617-40d2-9295-9373b7ed4e90", "0a7972b3-0bff-428a-a29f-466314d8f064", "0e894253-6341-4a18-baae-88b1f266ad2d", "1f882493-1a38-4738-83c8-72b61073fc62", "23f9183c-555a-40d9-87d6-70294387b67c", "2d2839b5-e3b4-4f02-bf71-57b580c62a43", "3091ea67-f46d-462e-bd12-12ef378c4083", "33968d34-9843-4cd5-8494-4d98ae8b92e0", "36ad98d6-0cf7-430a-ac90-21515cde5b37", "3be2cb00-6aed-4930-a73a-360a673d9e63", "3e281137-db85-44ef-b49a-18b32af72b0a", "502ec0b7-ce4c-4379-82c5-bf9a9876cfde", "69b84637-4e16-4362-86a4-e5f972e43314", "74ded4b5-078b-412d-8a00-d405247780d6", "8b20d54f-f4d6-446b-862d-9a9dc8b9c27e", "8bdbebee-dda7-4f51-9ded-c2bf84ecd82f", "a47b9978-2c01-4199-b79b-fa9f28010e1f", "c4ed7a5e-55bf-4697-917b-f07f9ecd8e0d", "f4154349-17cf-4ad9-b032-23a653b62b5b"], "title": "Analysing the cognitive effectiveness of the BPMN 2.0 visual notation", "venue": "software language engineering", "year": 2010, "id": "1a9def4b-8f59-4a5f-ab45-0dbc16ff8934"}
{"authors": ["HongSoo Kim", "EunJoung Byun", "Joon-Min Gil", "Jaehwa Chung", "Soon Young Joung"], "n_citation": 0, "title": "Fuzzy-based Adaptive Replication Mechanism in Desktop Grid Systems.", "venue": "", "year": 2008, "id": "1aa462b7-becb-4111-a1ac-dd3cae569ad3"}
{"authors": ["Joohan Lee", "Hua Zhang 0018", "Ratan K. Guha"], "n_citation": 0, "title": "Virtual Cluster Computing Architecture.", "venue": "parallel and distributed processing techniques and applications", "year": 2005, "id": "1aae046f-eb0b-4db4-be2f-aecf1b68797c"}
{"authors": ["Masami Hagiya", "Satoshi Kobayashi", "Ken Komiya", "Fumiaki Tanaka", "Takashi Yokomori"], "n_citation": 0, "references": ["0879274a-c09e-4ae0-9bfb-697bc596b86c", "14725fa6-9adc-479a-8d6e-dc5cc77359ef", "193a42d8-3ba3-4804-a553-73a6a02b457b", "1a55a103-b846-425a-ab36-a7315ac226ac", "2498688e-3226-4251-af6f-36da538c25c3", "24f59df5-7241-4618-978c-5236831a3865", "25225eaa-44e5-4e88-bec1-fe8c99b99f1d", "264a3560-1f20-482f-a986-6ce3955e0940", "290098c6-5120-423d-84cd-3c53ae752237", "2f6e03c0-396d-42ec-a35f-0c6949bcdd32", "34498080-6a59-401c-9f54-55bfc41850ed", "358fca06-f489-4ae2-a77a-fdbf28687bbe", "44183391-0c35-4320-863d-adb617915f45", "446de6ea-1d73-417f-bbf0-58137f8ca189", "459e733c-8912-4e3d-9d05-90779a73cdcf", "55642dc9-2269-4858-ae65-642a362915ee", "603705ab-011d-44bf-be7d-101610100954", "630534e8-eb7e-4620-99bd-fe9327b8101a", "66430911-f290-4e78-a3f4-f95f9a1e987f", "674c58cf-5019-424a-b0a8-26a06641c629", "6ec6a75b-8da9-4311-9163-33242a97388d", "795bb734-94e4-4fa5-827d-4cb5e51784a7", "7b0e938c-8aaa-460d-8e77-cbc115b9e6fb", "7d66e144-0e35-4832-ad14-2e87e70a7424", "84e2c109-7174-491c-b738-a07cd6def539", "84e5094c-eb44-4814-abb8-1b84c51ce655", "8f2fd4ee-da84-408f-8d9a-efd0f8139b0d", "912a8e60-5e0d-4a68-a21a-d60e7024080a", "949a2fe8-d5ee-452d-9803-98e88c83feb0", "972ae154-9446-439c-bc40-b53917f391f2", "a8d5a712-9b44-4f66-ada4-147c5d64f684", "ac128902-a505-4ac4-8041-8d1b854752f2", "ac32e5cf-680e-4b43-9642-7514c39a9e85", "afbf6768-40ec-4185-aff1-7a230949ec57", "b73da99c-e6d5-4fd5-b432-3bf259ecd90f", "bed9c059-a2ac-4181-8aa5-58d105d2a743", "c17481ca-9511-4793-8dad-a2486e0b2713", "ccac395e-2455-46f2-a666-29ba8b84cf3e", "cfaf079c-ed59-43ae-836d-171a4600d096", "df7b2ef7-ef0e-42a9-91c2-0bb0288c6ac4", "f07e898a-15e7-45c4-953a-ebafeac47a1a", "f9321ddb-74aa-4ffb-9c80-0b69c30ca9f3", "fbee8ed3-3eb6-4d33-bdd7-095b2b1a46bb"], "title": "Molecular Computing Machineries \u2014 Computing Models and Wet Implementations", "venue": "", "year": 2012, "id": "1ae5cb30-de3e-4357-8252-b764c67c30bf"}
{"authors": ["Guy L. Steele"], "n_citation": 0, "references": ["3920e4a7-20cb-4e81-999e-c162e9adbf9c", "ac69fbd6-8031-4a85-a0b7-fdc99071b3f5", "b46729b5-b576-44b2-8f97-c5ba901246d1"], "title": "Connection Machine Lisp", "venue": "parallel computing", "year": 2011, "id": "1afd78ae-56dd-4bfb-9dce-ddc02fe25bf2"}
{"abstract": "The Multilevel Load Balancing algorithm (MLB) is a parallel algorithm that determines the communication schedule that is necessary to balance a distributed discrete load function. The MLB algorithm focuses on structured grid computations and their load balancing requirements, which we feel are largely unsupported within the load balancing community. The interface to MLB is inherently simple; a distributed discrete load function is provided by the user and a communication schedule is returned. The load function can, for example, map to one or more distributed arrays. So far the implementation includes a parallel version of only the one dimensional MLB algorithm and produces a communication schedule that requires at most log(p) communication steps, where p is the number of processors (log() stands for the logarithm of base two). This work forms just one of the object-oriented class libraries within the OVERTURE Framework, an object-oriented environment for the numerical solution of partial differential equations in serial and parallel environments.", "authors": ["Daniel J. Quinlan", "Markus Berndt"], "n_citation": 8, "title": "MLB: multilevel load balancing for structured grid applications", "venue": "", "year": 1997, "id": "1b0c93ba-b5d0-46b4-960a-968e0a7160fe"}
{"authors": ["Jennifer L. Boes", "Charles R. Meyer", "Terry E. Weymouth"], "n_citation": 50, "title": "Liver Definition in CT Using a Population-Based Shape Model", "venue": "international conference on computer vision", "year": 1995, "id": "1b215d47-196f-4fc0-9987-23cde267230b"}
{"authors": ["Gregory L. Alexander", "Susan E. Hauser", "Karen Steely", "Glenn Ford", "Dina Demner-Fushman"], "n_citation": 50, "references": ["02464ed3-1d33-48cc-9192-90797703b477", "21393bdb-55ca-488d-ba06-eabfbef3127a"], "title": "A usability study of the PubMed on Tap user interface for PDAs.", "venue": "", "year": 2004, "id": "1b509a20-8d53-4732-b8e3-b54d028d9b92"}
{"authors": ["Heike Hufnagel", "Xavier Pennec", "Gr\u00e9goire Malandain", "Heinz Handels", "Nicholas Ayache"], "n_citation": 12, "references": ["33459f8e-0a10-49dc-ba4a-883872dc35cd", "4c30186f-7d00-458b-9203-f7e534623c49", "b829f13c-e9e1-4721-8860-37ac303bfe8f", "de601f4b-4f61-470c-8695-7d4a183794e9"], "title": "Non-Linear 2D and 3D Registration Using Block-Matching and B-Splines", "venue": "", "year": 2005, "id": "1b61c7da-166a-4ac9-bda6-cc431defe3c9"}
{"authors": ["Yulong Pei", "Chuanyun Fu", "Weiwei Qi", "Ting Peng"], "n_citation": 0, "references": [], "title": "Model of Fuzzy Comprehension Evaluation of Traffic Operations Safety on Urban Ice and Snow Road", "venue": "", "year": 2011, "id": "1b81d619-9ea4-4188-aa46-8a86a34ef342"}
{"abstract": "An exact parameterization for the boundary of the Minkowski product of N circular disks in the complex plane is derived. When N> 2, this boundary curve may be regarded as a generalization of the Cartesian oval that bounds the Minkowski product of two disks. The derivation is based on choosing a system of coordinated polar representations for the N operands, identifying sets of corresponding points with matched logarithmic Gauss map that may contribute to the Minkowski product boundary. By means of inversion in the operand circles, a geometrical characterization for their corresponding points is derived, in terms of intersections with the circles of a special coaxal system. The resulting parameterization is expressed as a product of N terms, each involving the radius of one disk, a single square root, and the sine and cosine of a common angular variable \u03d5 over a prescribed domain. As a special case, the N-th Minkowski power of a single disk is bounded by a higher trochoid. In certain applications, the availability of exact Minkowski products is a useful alternative to the naive bounding approximations that are customarily employed in \"complex circular arithmetic.\" 1. Preamble", "authors": ["Rida T. Farouki", "Helmut Pottmann"], "n_citation": 25, "references": ["4228edc7-3cee-4f4c-9e0d-d2c6ebab8187", "5b5e95d5-62fb-4ffc-9ce8-a740135db86f", "72c3e39d-5f7b-4db8-a940-5cdd0011ed54", "b3313c71-7b69-4d82-bee8-22c7b784935e"], "title": "Exact Minkowski Products of N Complex Disks", "venue": "Reliable Computing", "year": 2002, "id": "1b90eaa1-8540-4545-a9d3-054352aaa481"}
{"authors": ["BalaKrishna Kolluru", "Yoshihiko Gotoh"], "n_citation": 1, "title": "Relative evaluation of informativeness in machine generated summaries.", "venue": "conference of the international speech communication association", "year": 2007, "id": "1ba3e00e-8277-45bb-b2cb-880a87ca15ec"}
{"authors": ["Wendy A. Lawrence-Fowler", "Jorge Williams", "Richard H. Fowler", "Xiannong Meng"], "n_citation": 1, "title": "Personalizing the Web through Interactive Content-based Indexing.", "venue": "", "year": 1998, "id": "1bb95f71-e786-4a60-b481-5a00980d092a"}
{"abstract": "Biomedical domain and proteomics in particular are faced with an increasing volume of data. The heterogeneity of data sources implies heterogeneity in the representation and in the content of data. Data may also be incorrect, implicate errors and can compromise the analysis of experiments results. Our approach aims to ensure the initial quality of data during import into an information system dedicated to proteomics. It is based on the joint use of models, which represent the system sources, and ontologies, which are use as mediators between them. The controls, we propose, ensure the validity of values, semantics and data consistency during import process.", "authors": ["Pierre Naubourg", "Marinette Savonnet", "Eric Leclercq", "Kokou Yetongnon"], "n_citation": 1, "references": ["13419559-132a-464f-849e-84a6a894ec15", "48717831-ae01-4c61-81c2-881dc2778cd0", "57ffaea2-7fcc-4245-b9a9-59cfc77ee358", "6127e078-94db-4833-b825-d0a54f90c83c", "6598199d-6009-4036-bd07-0800eaa6117f", "6abdec1e-d456-4875-95b6-b07edf5f4480", "7348a725-9f23-48ca-a943-2d1a6f93aea8", "7d3726d8-21e5-4321-833d-dfde277c3693", "8e062d42-e0a8-47dc-987f-b0c790ec23d4", "9d01958c-f261-4534-8e05-c7604a4bd595", "9ecc664f-e8a8-4d95-875f-da3cceab85f9", "abc285c8-40d8-4d5c-b1f6-dfdf82f9553a", "be089b5e-0d71-4898-b8d1-4eae10602754", "d2e0594b-5a08-447b-966c-59df2561229b", "d4402f3a-4a8f-46eb-b56a-b1a0cb6d7a13", "e7fda079-9f7c-4f1d-a889-aaaebbad668d"], "title": "A approach to clinical proteomics data quality control and import", "venue": "", "year": 2011, "id": "1bc4c4b3-d3be-4289-941d-c5993ea97fb0"}
{"authors": ["Takeshi Ikenaga", "Takeshi Ogura"], "n_citation": 0, "title": "CAM2: A Highly-Parallel Two-Dimensional Cellular Architecture", "venue": "IEEE Transactions on Computers", "year": 1998, "id": "1bcaf9c8-15e5-4c2c-9f0a-9e18a3475cfc"}
{"authors": ["Joan Lu", "Feng Gu", "Andrew Ball"], "n_citation": 0, "title": "Information Management System for Machine Diagnostics - IMSMD on the road map.", "venue": "", "year": 2009, "id": "1c08fcf6-8831-4b85-b14e-dabf9db2bd32"}
{"abstract": "To reduce the roll of a surface ship, a robust fin controller based on functional-link neural networks is proposed. The plant consists of the ship roll dynamics and that of the fin actuators. Modeling errors and the environmental disturbance induced by waves are considered in the cascaded roll system, which are identified by the neural networks. Lyapunov function is employed in the controller design, which guarantees the stability of the fin stabilizer. Numerical simulation demonstrates the good performance of the roll reduction based on the controller proposed.", "authors": ["Weilin Luo", "Wenjing Lv", "Zaojian Zou"], "n_citation": 0, "references": ["0ed0c0e8-b65d-4460-93d5-0c884dac2d80"], "title": "Robust fin control for ship roll stabilization by using functional-link neural networks", "venue": "international symposium on neural networks", "year": 2013, "id": "1c144528-bca8-4357-bf6b-506da29b90af"}
{"abstract": "Black hole search (Bhs) is the problem of mapping or exploring a network where there are dangerous sites (black holes) that eliminate any incoming searcher without leaving a discernible trace. Dangerous graph exploration (Dge) extends the Bhs problem to include dangerous links (black links). In the literature, both problems have only been studied under the assumption that no faults occur in the network during the exploration. In this paper, we examine the impact that link failures can have on the exploration of dangerous graphs. We study the Dge problem under the following conditions: there are multiple black holes and black links, the network topology is unknown, the searchers are initially scattered in arbitrary locations, and the system is totally asynchronous. In this difficult setting, we assume that links can fail during the computation. We present an algorithm that solves the Dge in the presence of such dynamic link failures. Our solution to the problem works with an optimum number of searchers in a polynomial number of moves. This is the first result dealing with fault-tolerant computations in dangerous graphs.", "authors": ["Paola Flocchini", "Matthew Kellett", "Peter C. Mason", "Nicola Santoro"], "n_citation": 50, "references": ["084fdbdf-147e-40c9-bbde-3f402e70aee0", "0863919a-7f04-422f-a3fb-f32451886d06", "08785973-8224-40f9-bf67-324cfb78238b", "0e34dac8-fbb0-45e1-95e3-351b3f4489a1", "14e44f98-d133-4f6e-b27e-9cb770fdb68d", "1f986414-fbd2-4d1a-bf13-f1fa658379e4", "1fe312d0-b1bb-495d-add2-cfc74dd7fee8", "20b9321d-5e62-4620-909c-a978666ad3bf", "28fd05bd-40c6-4449-b2d8-f7043e45540e", "29292e0c-b4ca-440f-bb34-9244f4ee91ae", "2ed9dca1-26a1-438d-9991-f7e1ab3f569d", "538d2009-f810-495d-a30e-d626ba893ca9", "7058673d-72b3-4fd9-8f8a-223c2b979f70", "723c59a7-9faf-4b3b-bb66-ff250e5414f8", "842f4121-d4c4-4e30-b71e-21157f999234", "8c319c10-0b45-4807-b0ea-e034107df31f", "a168a825-caa7-4ee5-bc0a-1c03e2546df2", "bca41329-1f39-4929-957d-581675aa24a1", "e87a9331-c89b-4d5b-a754-952477b7ab10", "eeb4b412-6675-4db7-890e-03913c9774ed", "fa6e1cca-0703-4229-803d-274ee88f7b81"], "title": "Fault-Tolerant exploration of an unknown dangerous graph by scattered agents", "venue": "", "year": 2012, "id": "1c240c01-14ba-4c42-90b7-b8948c1fd323"}
{"abstract": "The increased use of multimedia applications pose more problems concerning the preservation of confidentiality and authenticity of the transmission of digital data. These data, in particular the images should be protected from tampering. The solution is the use of fragile watermarking. Fragile watermarking can be modeled as a problem of communication of a signal over a noisy and hostile channel, where the attack takes place. Indeed, the use of error checking algorithms appear natural. . Cyclic redundancy check (CRC) code provides a simple, yet powerful, method for the detection of burst errors during digital data transmission and storage. CRC is one of the most versatile error checking algorithm used in various digital communication systems. In this paper, we propose a novel fragile watermarking scheme based CRC checksum and public key cryptosystem for RGB color image authentication.", "authors": ["Nour El-Houda Golea"], "n_citation": 0, "references": ["0fef7e80-d35f-4fae-b49c-bd291bc70942", "1f72f36a-565c-4e75-bd03-625fe7937290", "3d4acf45-5f76-48a0-a4ad-06bc54c7ecd7", "3fb43b00-905c-4a08-934d-198ea4eb66c3", "582d62ec-1c76-462e-9be5-1344ccb474ad", "909e9b98-9692-4087-b0e7-dd31d737a1a2", "e3d2fb5f-81b2-4fac-b0b1-5f6be75d3bc7", "ecf556ae-c7ab-4c82-81c8-853f59f35369", "f45e1d96-686a-4b59-8f2d-d6f4622b693d"], "title": "A Fragile Watermarking Scheme Based CRC Checksum and Public Key Cryptosystem for RGB Color Image Authentication", "venue": "international conference on image and signal processing", "year": 2012, "id": "1c397f39-a7fc-4531-8193-df5e6b46ca13"}
{"authors": ["Vasile Rus", "Kirtan Desai"], "n_citation": 0, "title": "Few Models for Grammatical Relations Recovery.", "venue": "the florida ai research society", "year": 2005, "id": "1c4b5267-cef8-43b3-b661-9c81f1025d17"}
{"authors": ["Lemma F. Lessa", "Solomon Negash", "Mesfin Belachew"], "n_citation": 0, "title": "Lessons Learned from an e-Government Implementation: The Case of Ethiopia", "venue": "", "year": 2012, "id": "1c61b682-022e-4eac-9c62-40d30fdfbaa1"}
{"abstract": "In immune clonal selection algorithm for remote sensing images classification problem, only clonal selection mechanism is adopted. It makes the exploitation and exploration of the algorithm limited. To solve above problem, adaptive immune clonal selection culture algorithm is introduced in the paper. It fully uses the dual evolution mechanism of culture algorithm to extract implicit knowledge in belief space. According to the evolution situation noted in topological knowledge, a hybrid selection strategy integrating clonal selection and ($#956;+\u03bb) selection are proposed in population space. Simulation results indicate that the classification method based on adaptive immune clonal selection culture algorithm can improve the classifier performance better.", "authors": ["Yi-nan Guo", "Dawei Xiao", "Shuguo Zhang", "Jian Cheng"], "n_citation": 50, "references": ["4ae37709-48ad-4a0f-8d62-08f65cd8f66c", "bada396e-8f5f-444f-8e1a-2ce1a83768b1"], "title": "Multi-spectral remote sensing images classification method based on adaptive immune clonal selection culture algorithm", "venue": "international conference on intelligent computing", "year": 2011, "id": "1c675b28-d742-4a63-8ee4-e89dceb516fe"}
{"authors": ["Yuichiro Tokumaru", "Akihiro Fujiwara"], "n_citation": 0, "title": "Procedures for Floating Point Operations with DNA Molecules.", "venue": "", "year": 2009, "id": "1c88f4fe-fe1f-4767-95aa-919c370880ef"}
{"authors": ["Marek Musial", "Uwe Wolfgang Brandenburg", "G\u00fcnter Hommel"], "n_citation": 0, "title": "MARVINs Sieg im Millennial Event - Erfolg durch minimale L\u00f6sungen", "venue": "", "year": 2000, "id": "1ca11e82-7292-4b9b-bd4b-74b56c6ace25"}
{"authors": ["Daniele Salvati", "Sergio Canazza", "Gian Luca Foresti"], "n_citation": 3, "references": ["05ce8ce4-fef2-4a6d-aed3-ad6ebd492ae9", "3b4e07e3-069f-4c82-b229-490cf7882a78", "51ba8ac9-82db-4e83-b979-4aec6af82d53", "da810f63-7bab-449b-bb47-ea2d123f558f", "f7189842-11e3-4a66-9964-6eb773c3d378"], "title": "A microphone array Interface for Real-Time Interactive Music Performance.", "venue": "", "year": 2012, "id": "1cb4fc48-86ec-4a5e-9673-f7639ece568a"}
{"authors": ["Svetlana Sheremetyeva", "Sergei Nirenburg"], "n_citation": 18, "references": ["05d0ec98-5acc-4675-b1eb-59a960f106e3", "146f034b-d4e4-48ef-b0f9-fdff1e9fc25e", "33b2232f-1504-4a45-ad39-3d29f86045af", "7fb71be8-65ef-41b5-9b58-65e03d37dcea", "8b1ed9b3-3c71-4ee6-ba94-fec427d9a85a", "b332682a-c261-4e32-ab35-2ca44aabea73", "cc44a042-5ed1-4aa7-b2e6-e5f0e89601e9", "fd5ef867-459c-4408-ad70-838920a7dc7e"], "title": "Towards A Universal Tool For NLP Resource Acquisition.", "venue": "language resources and evaluation", "year": 2000, "id": "1ce434e7-6121-45b5-88c6-7b93df46aa93"}
{"authors": ["Christian S. Jensen", "Richard T. Snodgrass"], "n_citation": 50, "references": ["1f9d31e9-c9bd-4c05-9bec-92bcd47bc1a6", "2d131a55-48fc-4315-b79f-dd9fcdf24ce6", "6776bc5d-2358-4d94-af8e-6bfdafc6df32", "9505b840-176e-488a-bbfc-e488442e45e8", "9e697eef-4bb3-43d1-8978-e2816b48196c", "a52c089c-9222-4085-91c7-93b217adc8a8"], "title": "Temporal Query Languages", "venue": "", "year": 2009, "id": "1ce4e1f6-1322-42d5-a844-108578dd599d"}
{"authors": ["Da-Jinn Wang", "Thou-Ho Chen", "Yen-hui Yin", "Tsong-Yi Chen"], "n_citation": 4, "title": "Smoke Detection for Early Fire-Alarming System Based on Video Processing.", "venue": "Journal of Digital Information Management", "year": 2008, "id": "1d01fc41-6893-4014-9ed9-1873b04f8ad9"}
{"abstract": "We propose an axiomatization of global utility functions that can be factorized as a composition of a Choquet integral with local utility functions, without assuming any commensurability condition. This was an open problem in the literature. The main axiom, called Commensu- rability Through Interaction (CTI), allows to construct commensurate sequences and by consequence, the utility functions, thanks to the pres- ence of interaction between criteria. There exist several axiomatizations of the Choquet integral in the literature. The Choquet integral has been characterized as an aggregation function which has certain properties such as comonotone additivity (1), horizontally min-additivity (2,3) or stability to positive linear transformations (4). In the context of Decision Under Uncertainty (all partial utility functions are similar), we can mention the axiomatization of the preference relation induced by a Choquet integral by Schmeidler (5), and of the Choquet integral and its utility function by Couceiro and Marichal (6). The axiomatic characterization of the Choquet integral in the context of Multi-Criteria Decision Making has not been addressed so far. The difficulty comes from the fact that the partial utility functions are different, which entails commensurability issues. The main idea of this paper is summarized as follows. Commensurability between the criteria is required for the Choquet integral since this aggregation function is based on a ranking of the values of the criteria. Yet, the Choquet integral is a piecewise weighted sum in which the weights of the criteria are the same whenever the criteria are ranked in the same order. Considering two criteria i and k, the weight of criterion i depends on the relative values of criteria i and k. This means that, if the value of criterion k varies while the other criteria are fixed, then one may observe that the weight of criterion i suddenly changes when the value of criterion k is equal to that of criterion i .F rom this remark, it is possible to construct from an element of attribute i, an element of attribute k that is commensurate to the previous element. This construction does not work if the weight of criterion i does not depend on criterion k. If this holds for", "authors": ["Christophe Labreuche"], "n_citation": 1, "references": ["4727962a-0f77-48a1-b6db-6d6efdec58b9", "aa24f1a6-7345-43e3-aa58-8ac8cd095c88"], "title": "An Axiomatization of the Choquet Integral and Its Utility Functions without Any Commensurability Assumption", "venue": "information processing and management of uncertainty", "year": 2012, "id": "1d07a549-988b-4760-b5c0-ad9533a07d10"}
{"abstract": "While introducing the HTML standard to present information on the World Wide Web, the importance of being able to express the deep structure and meaning of the information was neglected. This has lead to some of the limitations of the current web (e.g. its restricted query possibilities). Work has started in the domain of the semantic web which tries to solve this problem by annotating web pages with semantic information. A crucial aspect to the success of the semantic web is that we have methods available to create, integrate and use this semantic information. In this paper, we present a new approach to generate semantic information by taking the annotation process to a conceptual level and by integrating it into an existing website design method.", "authors": ["Peter Plessers", "Olga De Troyer"], "n_citation": 50, "references": ["84feff37-05d1-426c-8744-1fa7358ee272", "9f911e92-370a-4bd2-9e50-bff3df3e8d2f", "fb83f6e5-e2fe-49bc-8578-5b9570c8849c"], "title": "Annotation for the Semantic Web During Website Development", "venue": "international conference on web engineering", "year": 2004, "id": "1d0c33c2-8327-4667-b29b-9c0771f2cd4b"}
{"authors": ["Andy Tams", "Mark Tatham", "Julian Henry Page"], "n_citation": 2, "title": "Describing speech styles using prosody: a pilot study.", "venue": "conference of the international speech communication association", "year": 1995, "id": "1d16b1c7-b441-4574-a5fb-e1199d84fc05"}
{"abstract": "Many freely available tools exist for analysing functional enrichment among short filtered or long unfiltered gene lists. These analyses are typically performed against either Gene Ontologies (GO) or KEGG pathways (Kyoto Encyclopedia of Genes and Genomes) database. The functionality to carry out these various analyses is currently scattered in different tools, many of which are also often very limited regarding result visualization. GeneFuncster is a tool that can analyse the functional enrichment in both the short filtered gene lists and full unfiltered gene lists towards both GO and KEGG and provide a comprehensive result visualisation for both databases. GeneFuncster is a simple to use publicly available web tool accessible at    http://bioinfo.utu.fi/GeneFuncster       .", "authors": ["Asta Laiho", "Andr\u00e1s Kir\u00e1ly", "Attila Gyenesei"], "n_citation": 2, "references": [], "title": "GeneFuncster: a web tool for gene functional enrichment analysis and visualisation", "venue": "computational methods in systems biology", "year": 2012, "id": "1d20bdc6-f06e-421a-98a1-732f0912525b"}
{"abstract": "A powerful method in knowledge discovery and cluster extraction is the use of self-organizing maps (SOMs), which provide adaptive quantization of the data together with its topologically ordered lower-dimensional representation on a rigid lattice. The knowledge extraction from SOMs is often performed interactively from informative visualizations. Even though interactive cluster extraction is successful, it is often time consuming and usually not straightforward for inexperienced users. In order to cope with the need of fast and accurate analysis of increasing amount of data, automated methods for SOM clustering have been popular. In this study, we use spectral clustering, a graph partitioning method based on eigenvector decomposition, for automated clustering of the SOM. Experimental results based on seven real data sets indicate that spectral clustering can successfully be used as an automated SOM segmentation tool, and it outperforms hierarchical clustering methods with distance based similarity measures.", "authors": ["Kadim Tasdemir"], "n_citation": 5, "references": ["0aa3ea99-91cc-4a8d-9de8-ff2bb5e8d58e", "32c5cd23-bcfc-4c4b-89a3-b29e93b6042c", "38135245-8eff-4078-af6a-ea559ffa660b", "4af43d64-b39c-4ca3-af98-c5f717104721", "68453f24-4276-4d0c-b37e-19d23af549be", "7c90045b-63b9-4f29-82a0-bf7c914a6ef6", "8d964e94-2cf8-47fb-89f5-e7667299c384", "9c19e13e-96b1-49f5-a552-e1d53bf4d2ef", "a8368e56-2e18-4168-9eb5-f0ead08c59ea", "bcef37e6-ffc9-47ef-b2b6-5b53dd0b5328", "bd55a32a-8dab-4551-806c-bce9e4a32c67", "df81d673-335a-480a-bec5-4e6a3a22416b", "e8ef24d9-a5ef-4e32-85f2-750d0658e1e8", "e9f3f2b2-e38e-4cb7-aa36-4994ef334a6e", "ea8cd3d8-17ae-4a1e-8f83-1609469087af", "eacc33ff-a680-4d3e-bb5f-ba6cf54041ac", "f2aadfc2-cda0-4dea-b786-29b578bfae0f"], "title": "Spectral clustering as an automated SOM segmentation tool", "venue": "", "year": 2011, "id": "1d2c0db5-13f8-4701-9f38-e15d9b6facdf"}
{"authors": ["Michael L. Mauldin"], "n_citation": 20, "title": "Performance in FERRET: A Conceptual Information Retrieval System.", "venue": "international acm sigir conference on research and development in information retrieval", "year": 1991, "id": "1d42d1dc-db64-4c69-ace7-f5269bb8f42e"}
{"authors": ["Sibel Adali", "Tina Liu", "Malik Magdon-Ismail"], "n_citation": 46, "references": ["0222af13-1041-40b6-9ff7-64ff84b5a7df", "3c719704-f39d-4e20-8c3a-65e9981de61d", "3f610d75-809b-4a12-858f-95e346c17e8c", "97ce7ea4-bd5e-4529-ac35-69b954643fae", "c7e4e04b-45da-4bae-8c8a-d17ca0087361", "f5dc6a45-c79e-4796-bed8-20805568f8e4", "f8adc637-d546-4e7c-9c58-76ee33371997", "f978a89a-6f27-48e4-aa6f-0cbe195b838e"], "title": "Optimal Link Bombs are Uncoordinated.", "venue": "adversarial information retrieval on the web", "year": 2005, "id": "1d55283f-d753-4ea6-b4e7-1a796340ed7e"}
{"authors": ["Joao Carreira", "Jo\u00e3o Gabriel Silva", "Koen Langendoen", "Henri E. Bal"], "n_citation": 8, "references": ["08cdcea0-6512-49e6-bbe1-31ad93e7d9a9", "36c05ec1-7f89-44d4-a180-49820c36e4a0", "53e2e1b8-1670-49da-9d87-5cbb17415063", "57514bd3-3d76-4439-97d6-c235a56ef9ba", "67295724-ea11-43d6-9c78-54c216bcb059", "975da8f0-98dc-4631-b422-b2fd9d100f3c", "db47b49a-352b-4dbe-8a94-ff334b3a9b9d", "e0f88696-6a82-4016-b5fe-28696d0dad3f", "faab003d-26c1-4c8a-b1fa-ee04c906e151"], "title": "Implementing Tuple Space with Threads.", "venue": "", "year": 1997, "id": "1d591b7a-6342-4b6a-b047-9b7bb88fea73"}
{"authors": ["Martin Naumann", "Matthias Bengel", "Alexander Verl"], "n_citation": 3, "title": "Automatic Generation of Robot Applications Using a Knowledge Integration Framework", "venue": "", "year": 2010, "id": "1d61c8b5-9f74-46dd-8241-f3e718b441c6"}
{"authors": ["Adriaan ter Mors", "Cees Witteveen"], "n_citation": 4, "title": "Coordinating Self Interested Autonomous Planning Agents.", "venue": "belgium-netherlands conference on artificial intelligence", "year": 2005, "id": "1d8163e9-8cd2-4037-8c9a-60bdc11348d9"}
{"authors": ["Akash Singh", "Janet Wesson"], "n_citation": 13, "title": "Improving the Usability of ERP Systems through the Application of Adaptive User Interfaces.", "venue": "international conference on enterprise information systems", "year": 2009, "id": "1da8e56e-c9dd-49b7-aad3-239f4babdeed"}
{"abstract": "In this paper, an overview of the XMU statistical machine translation (SMT) system for the 2007 IWSLT Speech Translation Evaluation is given. Our system is a phrase-based system with a reordering model based on chunking and reordering of source language. In this year\u2019s evaluation, we participated in the open data track for Clean Transcripts for the Chinese-English translation direction. The system ranked the 12th among the 15 participating systems.", "authors": ["Yidong Chen", "Xiaodong Shi", "Changle Zhou"], "n_citation": 50, "references": ["76523290-bd8e-40e0-984f-638e82321135", "aa27b71c-ff8e-44ba-9931-dcde5f99b337", "c1c634fa-13aa-4e6e-8273-f1365b43b246", "c3575d4a-31ba-4089-abbc-0d47a81929dd"], "title": "The XMU SMT system for IWSLT 2007.", "venue": "", "year": 2007, "id": "1dc0d49c-5f4f-4068-b654-a8e0489385ca"}
{"authors": ["Peter Thiemann"], "n_citation": 3, "title": "Interpreting Specialization in Type Theory.", "venue": "partial evaluation and semantic-based program manipulation", "year": 1999, "id": "1dc8df06-394a-4a10-be54-7c9c8533af80"}
{"abstract": "In the French DocPatient project, we work on documentary functionalities to improve the use of the electronic medical record. We suggest that integration of specific uses for paper medical documents in the design of the electronic medical record will improve its utility, use and acceptance. We propose in this paper to add a functionality of annotations in the electronic medical record to reinforce collaboration, coordination and awareness.", "authors": ["Sandra Bringay", "Catherine Barry", "Jean Charlet"], "n_citation": 5, "title": "Annotations for the collaboration of the health professionals.", "venue": "", "year": 2006, "id": "1dcd4c12-fe1f-43cf-8412-f806ab81fef4"}
{"authors": ["Shalini Chandra", "Yin Leng Theng", "May O. Lwin", "Schubert Shou-Boon Foo"], "n_citation": 6, "references": ["305a6f0c-7519-4c1d-9b6c-a7e604082703", "3a621213-31eb-4eb1-9005-d0e35b0427ab", "5065a688-aab6-4f5a-9d07-87ba6f94e12e", "67316eeb-77f8-43f4-b0bd-d604387e80f1", "68ba98d6-3b26-469b-8c15-e0bf3ddc3441", "6c0fd3d6-585d-4664-bcee-2af0d015a172", "8fc8cb21-3b6f-4c75-9c95-7088d3fb2d44", "9d912297-e52f-4ab6-add4-633e0f263933", "b22700c1-46c2-4f61-b84b-57530341b94f", "c517f47d-e19a-4792-b8c6-7c7ae5e589eb", "cde25fd0-5bb8-4240-9ae7-5585e6cf2c65", "cfc24bb0-31dc-432e-a7c7-0c43280eefd9", "debafb9e-50a7-4b56-bf3b-ef8feb72921a", "ee3f66e5-6921-4320-9125-944eb33a04f1"], "title": "Understanding Collaborations in Virtual World", "venue": "pacific asia conference on information systems", "year": 2010, "id": "1df6f900-9d53-42ed-b7a8-5d218b6bcaf3"}
{"authors": ["Yun Wan", "Jinku Liu", "Min-quan Xia", "Lan Chen"], "n_citation": 0, "references": [], "title": "The Evolution Model and Controlling Factors Analysis of the Pore Space of Oolitic Shoal Reservoir", "venue": "international conference of fuzzy information and engineering", "year": 2009, "id": "1dfaed6a-cece-47bc-93f8-e142aeea98c0"}
{"authors": ["Micha\u0142 Rychlik", "W. Stankiewicz", "Marek Morzynski"], "n_citation": 4, "title": "Application of Modal Analysis for Extraction of Geometrical Features of Biological Objects Set.", "venue": "international conference on biomedical electronics and devices", "year": 2008, "id": "1e10ab3c-b2bb-461f-a3ca-af9f392494cf"}
{"authors": ["Yanpeng Zheng", "Sugoog Shon", "Sanghyup Lee", "Dongpyo Oh"], "n_citation": 50, "references": ["7c104cb3-4641-401d-b87a-e23de95c5316", "fec7c95e-f9e7-43d8-ac39-f73e33cc53ca"], "title": "Determinant of the Generalized Lucas RSFMLR Circulant Matrices in Communication", "venue": "", "year": 2013, "id": "1e1cf160-4208-471d-bd53-ad0acf01d18d"}
{"authors": ["Philippe Moser"], "n_citation": 1, "title": "RP is Small in SUBEXP else ZPP equals PSPACE and NP equals EXP", "venue": "Electronic Colloquium on Computational Complexity", "year": 2003, "id": "1e4bf9f6-65aa-48fc-a07f-b1b8ea700311"}
{"authors": ["Alessandro Fantechi", "Stefania Gnesi", "Gianluca Mazzarini"], "n_citation": 7, "title": "How Expressive Are LOTOS Behaviour Expressions", "venue": "formal techniques for (networked and) distributed systems", "year": 1990, "id": "1e5cb3d3-6fdf-4ce6-b134-d4f8a3411511"}
{"abstract": "To improve the integration between Software Engineering (SE) and Usability Engineering (UE) this paper identifies areas of overlap and develops proposals for their integration. The focus is on key requirements that were derived using semi-structured interviews and questionnaires. The principles and activities in the standards ISO 13407 and ISO/PAS 18152 were concretized to establish specific quality aspects. The identified requirements provide a foundation for systematic modification of existing development processes with established best practices from both disciplines.", "authors": ["Karsten Nebe", "Volker Paelke"], "n_citation": 50, "references": ["0dd230a4-afeb-4e68-b16a-d0686a607b82", "765993b4-ff8d-4242-8447-99bd2c878283", "f304c4d5-6822-4c43-ab47-bfff569b1e82"], "title": "Key requirements for integrating usability engineering and software engineering", "venue": "international conference on human computer interaction", "year": 2011, "id": "1e653ffd-573d-4f56-abcb-170cba38061b"}
{"authors": ["Gemma Grau", "Carlos Cares", "Xavier Franch", "Fredy Navarrete"], "n_citation": 35, "references": ["25726ecd-dc33-4a4b-b025-9cac7bb2e152", "2b4eb49d-4096-42b2-8094-0d1852079670", "2d0eb2b5-abc5-48bc-b15d-d3e77728cdba", "365ac4aa-5611-41ad-8018-6dba33f27ada", "394ca337-5668-4b98-963c-3315edaa1bec", "5c933b8c-2f95-49a1-82f0-65e3b5f89e59", "68975f50-cd20-4e55-96df-b9824b33fa4a", "75d03451-c5ab-42ff-a507-c8dbf1a69828", "81c0d08e-2a9a-4564-9cd8-4f35e2fecf46", "a39bb763-ac8d-4962-9a70-3c07ced20508", "ae10fa68-44d5-435b-97fd-46365d69fa1c", "c72d3bde-7cca-46a2-8d0b-66bc5e1d23c7", "f9dfb3f5-f102-44f0-84c9-a29b83974e08", "fba7d2a2-b6ef-48cb-8f39-e6f556f46d2a"], "title": "A Comparative Analysis of i*Agent-Oriented Modelling Techniques.", "venue": "software engineering and knowledge engineering", "year": 2006, "id": "1e7489ad-2d83-43f8-9a90-3310d1395073"}
{"authors": ["Aviezri S. Fraenkel"], "n_citation": 50, "references": ["e6fb8ed0-df36-4e83-b6aa-dbcf7ae369d6"], "title": "From Enmity to Amity", "venue": "American Mathematical Monthly", "year": 2010, "id": "1e81777a-70e3-4ec0-8c85-a97427a11f62"}
{"authors": ["Encarna Segarra", "Pedro Garc\u00eda"], "n_citation": 7, "title": "Automatic learning of acoustic and syntactic-semantic levels in continuous speech understanding.", "venue": "conference of the international speech communication association", "year": 1991, "id": "1eb0e49b-2380-41a6-9a83-8d6f1658f470"}
{"authors": ["Eduardo Rivera-Campo", "Virginia Urrutia-Galicia"], "n_citation": 1, "title": "A note on the tree graph of a set of points in the plane.", "venue": "canadian conference on computational geometry", "year": 1997, "id": "1ecb4b78-885a-40fa-8207-cf0caeb4af95"}
{"authors": ["Anton Vitko", "Michal Savel", "Dusan Kameniar", "Ladislav Juri\u0161ica"], "n_citation": 50, "references": ["19176b29-f9b7-49b6-a376-a79724d0c278", "a24cb345-f658-4e58-b081-809f36d67388"], "title": "Information Processing in Reactive Navigation and Fault Detection of Walking Robot", "venue": "", "year": 2006, "id": "1ecb5a40-d213-45ee-9542-6662bcf18575"}
{"authors": ["Gopal Datt Joshi", "Jayanthi Sivaswamy"], "n_citation": 7, "references": ["2f9af079-4874-4bdd-bfd6-3c1f40cba74f", "48b2f9f3-f780-4f6b-95b9-b650bb93ef65", "50deb9e0-e10b-40bd-a73f-c544285457e3", "585cedc2-df23-4325-92e0-4726d068ec7a", "a4f0f562-bbfb-43ac-a175-fa17ca2ff0fb", "b608af66-6368-44dc-a670-2a3e42561ee1", "e148f34d-37f3-4821-867a-50338b47e9bb"], "title": "A simple scheme for contour detection.", "venue": "international conference on computer vision theory and applications", "year": 2006, "id": "1ee96eb6-bd40-45f2-a02b-379c45e67c16"}
{"authors": ["Michel Feron", "Erwin Bellon", "Werner Aerts", "Brigitte Stevens", "Joost Wauters", "Bart Van den Bosch", "Guy Marchal", "Paul Suetens"], "n_citation": 0, "title": "Exploiting advanced technology for interactive viewing inside a web browser in radiological teaching pages", "venue": "", "year": 2000, "id": "1f00b695-b303-45ad-bf8a-efee92b7ab52"}
{"abstract": "The \u201csmall world\u201d-paradigm oers a new interesting viewpoint for the analysis of contemporary legal networks and artificial intelligence. This topological approach sheds further light on such dierent fields as case-based legal reasoning, knowledge discovery in legal databases, or legal ontologies, as far as clustering coecients, diameter and hubs of the network are involved. Moreover, empirical evidence shows that even P2P systems as Gnutella present small world-features. So it becomes possible to deepen our understanding of how spontaneous communities organize themselves in the network. While opening new horizons in the field of recommender systems, it also widens our perspective in dealing with such important issues as privacy and digital copyright.", "authors": ["Ugo Pagallo", "Giancarlo Ruffo"], "n_citation": 6, "references": ["499f74eb-b341-4921-9006-40299faaa718", "b0ef6e4d-4c86-4b10-9e0a-7b630ca8d7f7", "f7b4c658-dd55-41ee-b1c0-547c467c76ee"], "title": "P2P Systems in Legal Networks: Another \"Small World\" Case", "venue": "international conference on artificial intelligence and law", "year": 2007, "id": "1f0b65ff-2eb2-42bc-9e81-9897f345ac61"}
{"abstract": "This paper investigates the main causes that make the application migration to Cloud complicated and error-prone through two case studies. We first discuss the typical configuration errors in each migration case study based on our error categorization model, which classifies the configuration errors into seven categories. Then we describe the common installation errors across both case studies. By analyzing operator errors in our case studies for migrating applications to cloud, we present the design of CloudMig, a semi-automated migration validation system with two unique characteristics. First, we develop a continual query (CQ) based configuration policy checking system, which facilitate operators to weave important configuration constraints into CQ-based policies and periodically run these policies to monitor the configuration changes and detect and alert the possible configuration constraints violations. Second, CloudMig combines the CQ based policy checking with the template based installation automation to help operators reduce the installation errors and increase the correctness assurance of application migration. Our experiments show that CloudMig can effectively detect a majority of the configuration errors in the migration process.", "authors": ["Gong Zhang", "Ling Liu"], "n_citation": 50, "references": ["0625e224-dfa3-4135-9393-af066b8e605a", "0e051611-1d69-4df3-9429-54bde1925551", "a0653609-07ca-4482-9f20-22a5bedb6521", "ec69f31d-9bc5-4cab-8949-0c9421aa326a"], "title": "Why do migrations fail and what can we do about it", "venue": "usenix large installation systems administration conference", "year": 2011, "id": "1f20a48a-e4c5-4352-a05c-b8713bd0e0bc"}
{"abstract": "Public administration institutions - as well as citizens and businesses - have to meet challenges of the constantly changing business and legal environment. The complexity and quantity of information to be faced with by these actors is increasing at an alarming rate. Research and development projects must turn to the development of innovative, modern technologies which enable citizens and businesses to access, understand and apply complex information easily. Ontology-based content management systems can contribute to the improvement of quality and effectiveness of significant processes, requiring the application of complex information, within the public administration or in a corporation. Compared to traditional content management systems, these systems can support further functions, such as semantic enabled search, explication of relations between documents, drafting of new documents, and version management, as well. Ontologies, in addition to the definition of concepts, support the most detailed and complete exploration of semantic relations between the concepts of a given domain.", "authors": ["Barna Kov\u00e1cs"], "n_citation": 50, "references": ["996508c2-53bd-4a53-8c7a-0101ce7c3343", "d7fea094-92a6-48a4-93ce-ee69ef981403"], "title": "Improving content management: a semantic approach", "venue": "Acta Cybernetica", "year": 2008, "id": "1f604a86-d9c5-4346-982d-9acc4e233d65"}
{"authors": ["Jeongho Park", "Suk-Hyon Yoon", "Changeon Kang", "Daesik Hong"], "n_citation": 0, "title": "Antenna Array Receiver Using Channel Estimation in an M-ary Orthogonal DS/CDMA System.", "venue": "international conference on communications", "year": 2000, "id": "1f8ba376-bcfd-4333-89b4-960645a36e98"}
{"authors": ["Oscar Avila", "Virginie Goepp", "Fran\u00e7ois Kiefer"], "n_citation": 3, "title": "Towards an Extended Alignment Model for a Complete Alignment of Manufacturing Information Systems.", "venue": "international conference on enterprise information systems", "year": 2008, "id": "1fe10edf-6c7f-493a-a154-0d39716721c7"}
{"authors": ["Johannes Mayer"], "n_citation": 4, "references": ["04f299de-bae3-4465-b4d5-1fd399bfa1e7", "26eccd10-022c-491a-9ba8-b40d1c835f43", "69308e7c-ef9f-410c-b52d-4a869ade9269", "8e006fa6-0502-4abb-9de8-bcc725a8f118", "8e7d5994-4281-42ac-a6f2-339ade8c2849", "98006a1e-8833-45b6-86ed-d6b535383456", "c0eb34db-9803-40a2-9508-06c9f3486382", "d0938309-5648-4b16-acf0-d66d4b313cde"], "title": "Restricted Adaptive Random Testing by Random Partitioning.", "venue": "", "year": 2006, "id": "1fe4fc55-d483-48c4-bc30-7ce7644ffcfd"}
{"abstract": "Design a system that combines the professional intelligent evacuation system and GIS (Geographic Information Systems), which can dynamically guide people to leave the fire site in the shortest time through a safe route according to instantaneity situation.", "authors": ["Weijie He", "Zhouxiong Wu", "Qingrui Liu"], "n_citation": 0, "references": [], "title": "Research of Intelligent Evacuation System", "venue": "", "year": 2013, "id": "1ffe22a7-29bc-4bf6-8be1-30b8c070c30f"}
{"authors": ["Shie-Rei Huang", "Larry S. Davis"], "n_citation": 9, "title": "Speedup Analysis of Centralized Parallel Heuristic Search Algorithms.", "venue": "international conference on parallel processing", "year": 1990, "id": "200104bf-a60a-458d-bb50-29d06c178866"}
{"authors": ["Rajender Nath", "Naresh Kumar", "Sneha Tuteja"], "n_citation": 0, "references": ["24599647-87de-45c2-b929-fd7636790190", "308b1576-882f-4b3a-80e0-ac9970d5cc65", "a312dfd9-8539-4867-b585-6a3ef56b5c2c", "b2f1d79b-d47a-4f2a-b810-ac3c837d7ee4", "e3b0069c-7e5e-443c-a347-342296aacf6a", "e9ca7abe-08ba-43fa-aa5a-a1858ac083e2"], "title": "A Survey on Reduction of Load on the Network", "venue": "Ing\u00e9nierie Des Syst\u00e8mes D'information", "year": 2015, "id": "2008e12c-771a-4597-9179-dbc62bdd681d"}
{"abstract": "Electrification is foremost actor in superseding internal combustion en- gine vehicles with electric vehicles (EV). The EV technology will lead to funda- mental shift in existing power grid as well as transportation systems. In Smart grid, EVs play vital roles to reduce dependence on fossil fuel, in turn, minimize green house gas emissions. In Vehicle-to-Grid (V2G) network, EVs communicate with power grid operators to trade demand response services by delivering stored electricity into the electric power grid. Communication between aggregator and EVs is central for such an approach. Viewing security and privacy requirements for V2G communications, privacy-preserving technique is central for efficacious V2G network implementation. In this paper, we have proposed effective security and privacy-preserving mechanism for aggregator based V2G network, which is built on ECC-based restrictive partially blind signature. We have provided securi- ty analysis and shown that the proposed mechanism is efficient than existing ones in terms of computational overheads.", "authors": ["Binod Vaidya", "Dimitrios Makrakis", "Hussein T. Mouftah"], "n_citation": 50, "references": ["456bf77f-76be-4bb9-8a33-02b04e5a15df", "586de464-6aa6-407b-9af0-499a494d380d", "68d4d3fe-4937-453f-9289-adc64c8d689a", "89342c2c-9a62-4679-a9be-785c7955a73b", "aaf93a82-60df-4177-b259-c577990f644d", "b7a29f54-9045-427c-82ca-8bf683d4396d", "f045bf8a-f8dd-4c60-973c-05854a2361e2", "f325a891-69ea-4f3f-9fe3-511e3eee8127"], "title": "Security and Privacy-Preserving Mechanism for Aggregator Based Vehicle-to-Grid Network", "venue": "ad hoc networks", "year": 2014, "id": "2009175e-2ba9-4a66-97eb-b0da75122f2b"}
{"abstract": "Identifying human capabilities in perceiving affective expressions is essential for developing interactive machines that can engage with their human users. In order to ensure that the behaviour of the interactive machine is perceived as intended, any gender\u2013specific differences in the perception of affective expressions are an important design consideration. This paper presents a preliminary study investigating the role of gender in the perception of affective hand movements displayed on both anthropomorphic and non-anthropomorphic structures. The results show that gender significantly influences the participants' perception and that the impact of the display structure and intended-emotion on the perception of the affective movements differs between male and female observers.", "authors": ["Ali-Akbar Samadani", "Rob Gorbet", "Dana Kulic"], "n_citation": 5, "references": ["46bc7a7a-4344-4a25-a804-3b360c814b9c", "4f173e69-06f8-4c53-9c3f-4b0327826e4d", "51618d50-86bd-44f1-b82d-4fa7f6cb617e", "54b667cf-9361-4a3a-92f2-ccba4eb6986d", "b82b4e10-6ecd-4b5d-9dfc-ac649e274e5c", "c78688ee-dc49-477f-afa9-faaee694f2e4", "fbcb1c83-9316-4211-af6b-9cb27fc9659f"], "title": "Gender differences in the perception of affective movements", "venue": "", "year": 2012, "id": "2013cfa9-8543-46d4-a31c-011a3d989ea2"}
{"authors": ["Mingdong Zhu", "Derong Shen", "Ge Yu", "Yue Kou", "Tiezheng Nie"], "n_citation": 50, "references": ["06e17da3-977f-4508-8cb2-d9b4e8bd780f", "0b2b5b0c-74d1-486b-88ae-7280fcd09c27", "0d647328-1ac4-420a-b18e-db0a20411406", "12a12404-429d-44c2-ad5a-def40e384c3c", "16615d59-cbcd-4475-9db0-7a7ba81c273c", "196c8df0-91ad-4340-a9c9-faee3f753113", "22cee14e-9066-4c67-8b45-1f98f648d874", "3061a657-1e98-4936-93e7-d2265311163a", "36f4419a-7567-4ee9-beda-2406db7788f8", "569dd9ed-013a-43d0-9f54-bfd809ae60e0", "64c52060-f573-4a4c-9d15-029997df0813", "64df1833-928f-443a-81e0-4ded006e1477", "677ae648-8a5d-40bf-8f08-197e22e7528d", "86f9af44-3bd9-4862-aa0c-2c3e891f5807", "b5a1abbd-cda8-4fe6-b828-2399caef7529", "bf0cc300-51e3-4088-b47a-6b1ce10a99ac", "c1d75373-9748-4b4f-9a2f-c14cc1f9c355", "cbec2519-f41d-418a-bbdb-c85869e1fdcb", "f3cf094c-b12c-4dd2-be12-57e1c16751ae"], "title": "Computing the Split Points for Learning Decision Tree in MapReduce", "venue": "database systems for advanced applications", "year": 2013, "id": "2014c701-4e35-4247-b5df-ac6d43555ce2"}
{"abstract": "In this paper we present a light-weight interprocedural side-effect analysis on assembly code. We represent the modifying potential of a procedure f by classifying all write accesses, occurring within f, relative to the parameter registers. In particular our approach is the first to accurately handle reference parameters. We demonstrate the usefulness of this approach by integrating this analysis into our assembly analyser and provide an evaluation of the precision of our approach. Approximately 50 per cent of all procedures can be statically shown to have side-effects.", "authors": ["Andrea Flexeder", "Michael Petter", "Helmut Seidl"], "n_citation": 7, "references": ["048ace17-a9d7-4000-9985-8c2d2448a0fe", "27f1e1a2-045c-4944-a71c-8bbac426fd6e", "2a3a3ebb-3913-419d-84f3-bd887abdb9ac", "450e3069-6012-4265-803a-666dc22ae8a4", "4c20e343-7e82-420c-ad1e-0b05f66189dc", "4ef68d66-9882-4d1c-8802-d6547e0cfc6e", "4fbcf15f-c15b-4e9d-bef1-2e57e403da82", "5a882837-748d-499b-bdb3-f69ce8d281d1", "6aec0cf3-52c8-4b68-bc14-0e0c89e7416f", "73c1dcb8-e5c5-4c5d-9d79-b6561266c69d", "7bb71afa-91b8-46e7-9008-da84e0427b93", "7fd611cf-c683-4bb7-b3bc-b4273ad206cd", "96f5f708-0eb6-4b9c-b8fa-e2fcd1743ce2", "97e193ae-5c65-488c-8891-0884fafdbd9a", "9bf8a324-8636-476a-9915-2b75302f7e19", "aab9f66b-a138-4e43-918a-ab7f04d0dfa0", "afddbf4f-1aa5-4764-a1ad-e4a369b80140", "ba2055b0-ba5e-4822-8d47-42c3f4d9759d", "d9f61013-c562-42df-9910-dfb8e02abda1", "f08a744a-de82-4dc1-b58e-3ec2f4b33425", "fe716acd-294b-4f46-bb0e-1a5ee7470e83"], "title": "Side-effect analysis of assembly code", "venue": "static analysis symposium", "year": 2011, "id": "2040154e-9d59-4321-94f2-92c14874b004"}
{"abstract": "We investigate the problem of mining closed sets in multi-relational databases. Previous work introduced different semantics and associated algorithms for mining closed sets in multirelational databases. However, insight into the implications of semantic choices and the relationships among them was still lacking. Our investigation shows that the semantic choices are important because they imply different properties, which in turn affect the range of algorithms that can mine for such sets. Of particular interest is the question whether the seminal LCM algorithm by Uno et al. can be upgraded towards multi-relational problems. LCM is attractive since its run time is linear in the number of closed sets and it does not need to store outputs in order to avoid duplicates. We provide a positive answer to this question for some of the semantic choices, and report on experiments that evaluate the scalability and applicability of the upgraded algorithm on benchmark problems.", "authors": ["Gemma C. Garriga", "Roni Khardon", "Luc De Raedt"], "n_citation": 50, "references": ["0df8cc1d-5dd6-4ecc-89cf-87b65286063d", "29ecc9ea-5384-4335-96cd-5a355b4acbfa", "2fa89208-874a-4fb9-9386-b6a366913fab", "3c0a12b2-a2f6-40b5-b062-b65f470f6e75", "47c36be8-a259-4c89-b8b5-a6f918d18192", "5c465d52-e805-42e1-934d-4d65d305e2ad", "666d0c4b-13bf-483a-b6b1-c1a830a07798", "71019192-97d4-4fa6-812b-d9a22a890615", "8afef1a5-6b09-410b-9520-6fd9d082f70c", "929abc46-4b62-459b-a972-caa1d09e0fcc", "be7c12ab-3cba-460d-a856-a2ea0f648521", "c4710c73-497d-44f0-ae10-64613eca18d4", "ece18d8d-a11d-4d1b-a870-697eefca00aa", "ffd92e42-c11f-4ad5-b30a-1daf38af7684"], "title": "On mining closed sets in multi-relational data", "venue": "international joint conference on artificial intelligence", "year": 2007, "id": "2044d4cf-a873-4102-b46e-8a590df70c54"}
{"authors": ["Hiroki Kageyama", "Fumiaki Saitoh", "Syohei Ishizu"], "n_citation": 0, "references": ["de2afa6a-6255-4206-9464-8f8ff962c77b"], "title": "Development of Brand Selection Model Considering Customer Service", "venue": "international conference on human-computer interaction", "year": 2013, "id": "204ff331-7e0a-4a26-9c81-c60dc457a0f3"}
{"authors": ["Soo-Young Jung", "Taehyun Kim", "Myung-Un Lee", "Seung-Il Moon", "Wook Hyun Kwon"], "n_citation": 3, "title": "Modeling and Control of DSTATCOM for Voltage Sag.", "venue": "", "year": 2003, "id": "2075c8c1-8594-4caa-bde3-05c289e6a070"}
{"abstract": "A massive-training artificial neural network (MTANN) has been investigated for reduction of false positives (FPs) in computer-aided detection (CADe) of polyps in CT colonography (CTC). A major limitation of the MTANN is a long training time. To address this issue, we investigated the feasibility of a support vector regression (SVR) in the massive-training framework and developed a massive-training SVR (MTSVR). To test the proposed MTSVR, we compared it with the original MTANN in FP reduction in CADe of polyps in CTC. With MTSVR, we reduced the training time by a factor of 190, while achieving a performance (by-polyp sensitivity of 94.7% with 2.5 FPs/patient) comparable to that of the original MTANN (which has the same sensitivity with 2.6 FPs/patient).", "authors": ["Jian-Wu Xu", "Kenji Suzuki"], "n_citation": 3, "references": ["01b486c4-8955-403b-a0c6-1de74298b215", "9206deed-8d57-428b-a6a5-0105af37c74a"], "title": "False-positive reduction in computer-aided detection of polyps in CT colonography: a massive-training support vector regression approach", "venue": "", "year": 2010, "id": "20842fd1-58b7-443f-acf0-d15676b2b6bf"}
{"abstract": "We empirically study the computational complexity of diagnosing systems with real-world structure. We adopt the structure specified by a small-world network, which is a graphical structure that is common to a wide variety of naturally-occurring systems, ranging from biological systems, the WWW, to human-designed mechanical systems. We randomly generate a suite of digital circuit models with small-world network structure, and show that diagnosing these models is computationally hard.", "authors": ["Gregory M. Provan"], "n_citation": 2, "references": ["288dce14-855c-4502-a7d2-cbc4dee2a31e", "2a73f987-98cc-4d8b-bf27-9d8d0834c57c", "8f12317e-0ea6-455c-a973-7c7440af5f37", "a3173cae-9934-4b80-9d59-d94be9c92247", "b0ef6e4d-4c86-4b10-9e0a-7b630ca8d7f7"], "title": "An Empirical Analysis of the Complexity of Model-Based Diagnosis", "venue": "european conference on artificial intelligence", "year": 2006, "id": "20a64c98-26be-41a3-ad61-dcd83b29f63d"}
{"authors": ["Robert F. Chen", "Catherine Cramer", "Pam DiBona", "Russel Faux", "Stephen M. Uzzo"], "n_citation": 0, "references": [], "title": "Ripple Effects: Small-Scale Investigations into the Sustainability of Ocean Science Education Networks", "venue": "", "year": 2013, "id": "20ad39b3-43e8-4b80-9775-6d5d0ed346c9"}
{"authors": ["Daniel Fritsi", "Csaba Nagy", "Rudolf Ferenc", "Tibor Gyim\u00f3thy"], "n_citation": 1, "references": ["07f53476-9df8-489d-be5e-81032a7e9075", "0c17e501-95c5-4c5a-98c7-a00c054817f7", "386f9322-6372-4e44-a5a0-7c306bfb9b46", "76da0939-540e-4c94-9594-051f2dc30619", "a7ba0e8d-fe33-4158-8083-95c0045ce25e", "dd71df05-760c-4fd2-99f6-85def12a7ec9", "f0da0661-a305-4b3a-a5a3-4d1f6c77c1f7"], "title": "A Methodology and Framework for Automatic Layout Independent GUI Testing of Applications Developed in Magic xpa", "venue": "international conference on computational science and its applications", "year": 2013, "id": "20ce8090-fe69-4510-941a-4bcc6d253a73"}
{"abstract": "At present a great deal of research is being done in different aspects of Content-Based Image Retrieval System (CBIR). Unfortunately, these aspects are mostly analysed separately. We propose how to put together vectors of features for segmented objects and a spatial relationship of the objects. To achieve this goal we have constructed a search engine taking into account multi-set data mining and object spatial relationship. Additionally, we have constructed a graphical user interface (GUI) to enable the user to build a query by image. The efficiency of our system will be evaluated in the near future. In this paper we present the search engine for our CBIR.", "authors": ["Tatiana Jaworska"], "n_citation": 50, "references": ["024ede57-e07f-4c11-88ca-19aeff379b69", "031bc444-78f4-47f6-9f1e-660499adda3a", "10447dc1-f4cf-4add-b390-886c51027e98", "130caaba-3586-4a97-9d34-8951b0a65b71", "16fb90c7-64db-4630-81a8-1cbe11b50f63", "1dd916f1-ca84-45a9-98a7-cbf6d5ae8016", "33c4f44d-674f-440d-be79-ecca2edce186", "3896c4f7-e5e1-4199-a74f-500162668f65", "4d70b9f5-f321-476d-9f03-c2523bf936be", "5184aab6-8f7f-4f74-a2f1-d157360bfee8", "71bbf2ac-bbe2-4c4b-8695-20e007b18be3", "78cca582-bf02-48c5-83be-b103afa65561", "c53a717f-dcdd-49e4-b92c-62648c6ed20a", "d77d2585-d702-48e0-859f-4b375e98d148", "eb6fa62c-27a3-4d6f-9026-ec20cd9a5800"], "title": "A search-engine concept based on multi-feature vectors and spatial relationship", "venue": "flexible query answering systems", "year": 2011, "id": "20d76b10-e425-49bb-b8ad-c3fd8f94f2a9"}
{"authors": ["Hui Shi", "Bernd Krieg-Br\u00fcckner"], "n_citation": 0, "title": "Qualitative Semantic Representations.", "venue": "", "year": 2008, "id": "20e59047-bb30-424a-96fc-ad3cff3f1c98"}
{"abstract": "It is widely accepted that a common precept for the choice under uncertainty is to use the expected utility maximization principle, which was established axiomatically. Recently, a formal equivalence between this principle of choice and the target-based principle, that suggests that one should select an action which maximizes the (expected) probability of meeting a (probabilistic) uncertain target, has been established and extensively discussed. In this paper, we discuss the issue of how to bring fuzzy targets within the reach of the target-based model for a class of decision making under uncertainty problems. Two methods for inducing utility functions from fuzzy targets are discussed and illustrated with an example taken from the literature.", "authors": ["Van-Nam Huynh", "Yoshiteru Nakamori", "Tu Bao Ho"], "n_citation": 4, "references": ["5fe2f07f-4093-4c1a-94e6-39666362ec48", "b2e6bac3-d426-41b7-8dd4-7c426c70df2e", "bb1b9290-2219-4b35-91c9-2cb688b369bb", "f3186203-081a-495f-80f3-67f152a4abb1"], "title": "Utility function induced by fuzzy target in probabilistic decision making", "venue": "Lecture Notes in Computer Science", "year": 2006, "id": "20f0a5af-395a-487f-854d-9888295f2508"}
{"authors": ["Eriko Yoshimura", "Seiji Tsuchiya", "Hirokazu Watabe", "Tsukasa Kawaoka"], "n_citation": 0, "title": "A Detection Method of Illogical Adjective Phrase for Computer Conversation.", "venue": "", "year": 2008, "id": "21050ce3-c432-4cc7-8db0-2ecb72efd8f4"}
{"authors": ["Takeaki Uno", "Tatsuya Asai", "Yuzo Uchida", "Hiroki Arimura"], "n_citation": 180, "references": ["0cbb8a06-52b1-4117-a5af-79ebe41ff0de", "2b0b64ec-d360-46e4-ac2d-32cd667f1078", "2b49e5f8-1481-48c3-ac9c-a386c2ed8e00", "34b7e270-80d7-46d5-a6f1-e50087a8d045", "64690021-73a4-48b6-b0c9-8177e58310d4", "723165be-6207-4bcb-8b98-6dee09464e37", "7482cc04-8a43-4494-b41a-e6e42259b30f", "82d2b72d-225d-4036-a416-bc97107a58d7", "97592cf7-e5f6-4c30-981f-fe439f350afd", "97f0f520-6175-409f-8a18-6878fa620ed4", "c4710c73-497d-44f0-ae10-64613eca18d4", "d1dcc639-060f-419e-8ef5-16d05b290692", "d3ac511c-799f-4268-b101-1f2df6b6baee"], "title": "LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets.", "venue": "", "year": 2003, "id": "21063fe9-e1ff-4267-bc78-667b988b5a42"}
{"authors": ["S. S. Airey", "Mark J. F. Gales"], "n_citation": 0, "title": "Product of Gaussians as a distributed representation for speech recognition", "venue": "conference of the international speech communication association", "year": 2003, "id": "2108ef4f-7abf-4c0b-ac37-a70525a197b6"}
{"authors": ["Roberto Navigli", "Paola Velardi"], "n_citation": 2, "references": ["0606831b-4490-4f0e-9a17-429fdae696fd", "18a0cb7a-05ec-4ffd-9b09-af22f183c52e", "30b9ff17-94d7-4b9f-8c36-086e277c64d7", "38f0c0f5-c928-42d6-acb9-cc6a319bb990", "606ca6bf-c2e3-4f1c-ad9a-311571c32625", "9566bd1c-79e4-4f6f-b641-4076386e1966", "a4ef427f-133c-4eab-9617-7ab2d169b000", "c85d03bd-c71b-4995-b48d-907219ea38a3", "cbed8d6e-5287-404f-bc5c-1f6e2a7db907", "d97a2166-4940-450d-8366-a64ab7a4ec54"], "title": "A knowledge-based approach to ontology learning and semantic annotation.", "venue": "conference on advanced information systems engineering", "year": 2004, "id": "210b70fe-58cd-4c55-8ec3-f846c67adc77"}
{"authors": ["Yisheng Guan", "Teresa R. Ho", "Hong Zhang"], "n_citation": 0, "title": "An Integrated Robotic Hand/Simulator System for Tele-manipulation via the Internet.", "venue": "international conference on robotics and automation", "year": 2001, "id": "210d708b-080c-46ce-850f-0588450de08b"}
{"abstract": "The ability of hospital staff to get a patient to the right bed at the right time is dependent on bed occupancy, and is a key issue in all acute hospitals. This paper seeks to identify the impact of admission and discharge timing on hospital occupancy with reference to the peak in daily admissions and discharges. Patient admissions data from 23 Queensland public hospitals was classified into categories based on the relative timing of daily admission and discharge curves. We found statistically significant differences in mean and peak occupancy and patient length of stay between categories (one-way univariate ANOVA p0.0001). The results support early patient discharge initiatives to reduce hospital occupancy rates.", "authors": ["Sankalp Khanna", "Justin Boyle", "Norm Good", "James Lind"], "n_citation": 22, "references": [], "title": "Impact of Admission and Discharge Peak Times on Hospital Overcrowding", "venue": "", "year": 2011, "id": "2111e227-205c-453d-ad32-8e52c2ed6b12"}
{"abstract": "Abstract#R##N#Clinical guidelines aim to eliminate clinician errors, reduce practice variation, and promote best medical practices. Computer-interpretable guidelines (CIGs) can deliver patient-specific advice during clinical encounters, which makes them more likely to affect clinician behavior than narrative guidelines. To reduce the number of errors that are introduced while developing narrative guidelines and CIGs, we studied the process used by the ACP-ASIM to develop clinical algorithms from narrative guidelines. We analyzed how changes progressed between subsequent versions of an algorithm and between a narrative guideline and its derived clinical algorithm. We recommend procedures that could limit the number of errors produced when generating clinical algorithms. In addition, we developed a tool for authoring CIGs in GLIF3 format and validating their syntax, data type matches, cardinality constraints, and structural integrity constraints. We used this tool to author guidelines and to check them for errors.", "authors": ["Mor Peleg", "Vimla L. Patel", "Vincenza Snow", "Samson W. Tu", "Christel Mottur-Pilson", "Edward H. Shortliffe", "Robert A. Greenes"], "n_citation": 50, "references": ["0f36d083-9176-44ba-9c40-4821f5a90899", "14c7b457-0cd8-4a3f-be02-8e0fb8fd7286", "1e7e3481-8e26-4abe-b438-d072614700c7", "2a20c4ec-1ea0-4834-8576-150022230a19", "73e717af-1bcb-440d-ab38-f0d1a72da29c"], "title": "Support for guideline development through error classification and constraint checking.", "venue": "", "year": 2002, "id": "2117f3ca-cc30-4cc7-a165-a6bc25ee5875"}
{"authors": ["Hee-Ae Ko", "Jong-Keun Kim", "Kunjung Sim", "Keunho Sim", "Young-Hwan Lim"], "n_citation": 0, "title": "A Study on the Mobile Web Generating using Mobile Computing - Focused on News Website.", "venue": "advances in mobile multimedia", "year": 2007, "id": "211b0cfe-d1de-4c44-92a1-8bbe21d29a33"}
{"authors": ["Luis Fernando Gutierrez-Marfileno", "Eunice Ponce-de-Leon", "Elva Diaz-Diaz", "Leoncio Ibarra-Martinez"], "n_citation": 0, "references": ["13fc52dc-b393-4671-b70d-ea9a6fed129e", "63d2ea00-e29e-46b5-8b36-b63e9c494513", "74dacf66-5449-42fa-b348-f6174d9d3b64", "7d2aa3d7-46a2-4351-b711-2871a7cf6503", "8b826b73-03ed-4dfa-9304-a90030cd16c6", "93ebdd87-1778-49cd-9c4d-88345c56eeb1", "9b5ebc3d-59dc-473b-b633-b3eaee1ed2a4", "d0f3d2fb-6794-47b5-8a6b-3c99f682d633", "e2fb17f0-5943-439e-a5da-61c9397d237d"], "title": "Wasp Colony with a Multiobjective Local Optimizer for Dynamic Task Planning in a Production Plant", "venue": "", "year": 2013, "id": "211ccbad-3c58-4a08-9a8d-e200d6891cf7"}
{"abstract": "In the vision of an IoT, trillions of tiny devices extend the Internet to the physical world and enable novel applications that have not been possible before. Such applications emerge out of the interaction of these devices with each other and with more powerful server-class computers on the Internet. Programming such applications is challenging due to the massively distributed nature of these networks combined with the challenges of embedded programming. In addition, resource constraints, device heterogeneity, and the integration with the Internet further complicate this situation. In this paper, we present a programming-in-the-large approach for resource-constraint devices such as wireless sensor nodes. Our approach is to model such applications using the Business Process Execution Language (BPEL), which is successfully and widely used in the Internet to model complete applications and business processes. However, BPEL and its associated technologies are too resourcedemanding to be directly applied in resource-constraint environments. We therefore use the BPEL model as input to a code generation process that generates custom-tailored, lean code for different target platforms. The resulting code is fully standard-compliant and allows a seamless integration of IoT devices in enterprise IT environments. We present an exhaustive evaluation on real hardware showing the first-rate performance of the approach.", "authors": ["Nils Glombitza", "Sebastian Ebers", "Dennis Pfisterer", "Stefan Fischer"], "n_citation": 50, "references": ["02f9e979-9aab-4554-91ef-d35757ce8fdc", "0c5b9fa3-6eec-4c52-af14-85e5d5b0e58f", "1aa7b81b-5e9e-428b-8c3f-3f548c5280e2", "83228db6-3d7f-4acd-a225-ff851f94dd6a", "a6999103-8c23-4c45-b150-f10d32d52fa1", "fa94ca04-772c-43fd-a643-1226357e3110", "ff26e02e-a117-4ca7-9ef5-4fdeabeb6167", "ffa2993d-e1af-458e-ae43-5be01f03ebfe"], "title": "Using BPEL to realize business processes for an internet of things", "venue": "ad hoc mobile and wireless networks", "year": 2011, "id": "216bcdf6-f86f-4c12-b510-d492108d27a6"}
{"authors": ["Olivier Tulet", "Mohamed-Chaker Larabi", "Christine Fernandez-Maloigne"], "n_citation": 1, "references": ["13bd34b5-b101-4af4-9b2d-c071abe79299", "7f1214b2-e070-4ff2-a5d3-647e7c16c2d7", "9a6107d2-dfd5-4762-8764-816627b37301"], "title": "Use of spatial adaptation for image rendering based on an extension of the CIECAM02", "venue": "international conference on computer vision theory and applications", "year": 2008, "id": "2186cd99-253c-4287-a4bf-52f1883881b9"}
{"abstract": "Voting is a simple mechanism to aggregate the preferences of agents. Many voting rules have been shown to be NP-hard to manipulate. However, a number of recent theoretical results suggest that this complexity may only be in the worst-case since manipulation is often easy in practice. In this paper, we show that empirical studies are useful in improving our understanding of this issue. We demonstrate that there is a smooth transition in the probability that a coalition can elect a desired candidate using the veto rule as the size of the manipulating coalition increases. We show that a rescaled probability curve displays a simple and universal form independent of the size of the problem. We argue that manipulation of the veto rule is asymptotically easy for many independent and identically distributed votes even when the coalition of manipulators is critical in size. Based on this argument, we identify a situation in which manipulation is computationally hard. This is when votes are highly correlated and the election is \"hung\". We show, however, that even a single uncorrelated voter is enough to make manipulation easy again.", "authors": ["Toby Walsh"], "n_citation": 87, "references": ["0181b1dc-346e-4c70-bff0-2768954ecd5f", "06678ba3-931f-4a35-b9eb-6b6f7e5e9a6f", "0ba81bf9-2175-4acc-a9e6-44d99b476204", "0f41c7e6-6eaf-443a-8fca-adacc859c133", "113dac8f-c770-41a3-9929-7114df306150", "20ac1eea-b13e-4355-ad61-b1371afbc5cd", "26af2d48-9d88-4461-bd80-73bd81ca7a4f", "288dce14-855c-4502-a7d2-cbc4dee2a31e", "45147d7b-255d-45e0-85c6-5646b1f039c7", "502e0498-5719-455a-8859-eced8d57e8cf", "70c0371b-3648-4513-a31f-764a09a800cb", "720f7c91-96b0-4e32-928c-9e60f6e57963", "77688f15-5878-4c40-80c3-1f567ab6ea20", "7d13466a-ddc8-49fd-a55d-eec7222dbb38", "84732c65-2a0f-4bdc-9001-bae7b5418b6a", "9a0aad07-b223-4ab1-8686-9bb9fcd91a41", "9dc3e527-4602-4fa1-86fa-697a92da0c91", "9f3c236c-fad9-4f36-ba6d-6b773bf86aa3", "acc5b8ef-c541-454a-bdc1-5ada474c26c6", "e73da790-9b08-4e42-b1cb-c35479704b5c"], "title": "Where are the really hard manipulation problems? the phase transition in manipulating the veto rule", "venue": "international joint conference on artificial intelligence", "year": 2009, "id": "21ab7cbc-12ec-4def-a407-48fbee0fcb06"}
{"authors": ["James D. Foley"], "n_citation": 0, "title": "Information Visualization: The Need for a Data Base Approach", "venue": "discovery science", "year": 1995, "id": "21d69ecd-521f-4da9-960f-76f852862937"}
{"abstract": "Modern architectures are becoming more heterogeneous. OpenMP currently has no mechanism for assigning work to specific parts of these heterogeneous architectures.We propose a combination of thread mapping and subteams as a means to give programmers control over how work is allocated on these architectures. Experiments with a prototype implementation on the Cell Broadband Engine show the benefit of allowing OpenMP teams to be created across the different elements of a heterogeneous architecture.", "authors": ["Leo White"], "n_citation": 4, "references": ["24226ecd-0567-4cb9-9a3d-baca40425c21", "32b36be7-6710-4db2-926c-d7340af48f52", "33613e3a-edde-4f55-8ac1-f562d4947fe3", "4e28b8f0-2fd7-4a53-b274-d1416b1cbf26", "5262d102-d30b-4062-a2a6-03560b97063b", "6694778e-df4b-4013-9878-44659ab3f9e8", "d40a9db6-8af6-46d5-ac7e-a531632d3a4b", "d429099c-d724-4ad6-9c13-dcef3b206e06", "f31f25c4-4a3e-48ab-a938-01e3526f2aba"], "title": "OpenMP extensions for heterogeneous architectures", "venue": "international workshop on openmp", "year": 2011, "id": "21ec892c-edd7-4d33-8294-6508c5c729bd"}
{"abstract": "Touchscreen interfaces do more than allow users to execute speedy interactions. Three interfaces (touchscreen, mouse-drag, on-screen button) were used in the service of performing an object manipulation task. Results showed that planning time was shortest with touch screens, that touchscreens allowed high action knowledge users to perform the task more efficiently, and that only with touchscreens was the ability to rotate the object the same across all axes of rotation. The concept of closeness is introduced to explain the potential advantages of touchscreen interfaces.", "authors": ["Rachelle Kristof Hippler", "Dale S. Klopfer", "Laura Marie Leventhal", "G. Michael Poor", "Brandi A. Klein", "Samuel D. Jaffee"], "n_citation": 3, "references": ["09407f38-3183-4c8c-a65b-ff2b67dd598c", "41cf234f-4634-482f-bf7e-badb16744caa", "4f8e9b6e-4781-450c-a51f-0b487ad52bb6", "566cbae9-6567-47ec-96b1-f5d91006d133", "6e428a7d-f9cc-493f-859d-a4b59df59519", "acaffb1d-6515-485f-a0bd-a233d7967db4", "b5b3c8a3-1bb7-415a-acf2-58a2a6371a56"], "title": "More than speed? an empirical study of touchscreens and body awareness on an object manipulation task", "venue": "international conference on human computer interaction", "year": 2011, "id": "220ce166-1ecd-4f39-a780-cdbaae681d0b"}
{"authors": ["Johann Schumann"], "n_citation": 11, "references": ["8e43146a-84a1-4ff8-b726-da65be6063d7"], "title": "DELTA - A Bottom-up Preprocessor for Top-Down Theorem Provers - System Abstract", "venue": "conference on automated deduction", "year": 1994, "id": "221518d3-5a8a-4d58-8f77-913ed3f0fdc6"}
{"authors": ["Jean Fonlupt", "Andr\u00e1s Seb\u00f6"], "n_citation": 11, "title": "On the Clique-Rank and the Coloration of Perfect Graphs", "venue": "integer programming and combinatorial optimization", "year": 1990, "id": "2232198d-96dc-405f-b430-838fb7f0690f"}
{"authors": ["Mark Burgin", "Marc L. Smith"], "n_citation": 2, "references": ["3491feb2-bf31-4fde-b199-b652007cd999", "f7b8e6cd-5702-4b6c-b6cb-d4205d04863f"], "title": "From Sequential Processes to Grid Computation.", "venue": "", "year": 2006, "id": "227b887e-e7d5-436b-8c5b-f57ba5d672df"}
{"abstract": "Most association rule mining techniques concentrate on finding frequent rules. However, rare association rules are in some cases more interesting than frequent association rules since rare rules represent unexpected or unknown associations. All current algorithms for rare association rule mining use an Apriori level-wise approach which has computationally expensive candidate generation and pruning steps. We propose RP-Tree, a method for mining a subset of rare association rules using a tree structure, and an information gain component that helps to identify the more interesting association rules. Empirical evaluation using a range of real world datasets shows that RP-Tree itemset and rule generation is more time efficient than modified versions of FP-Growth and ARIMA, and discovers 92-100% of all the interesting rare association rules.", "authors": ["Sidney Tsang", "Yun Sing Koh", "Gillian Dobbie"], "n_citation": 24, "references": ["34b7e270-80d7-46d5-a6f1-e50087a8d045", "98e89fb2-4a95-4739-b6c7-d16549f8d96b", "9beea59d-ec8d-4fb4-9e3d-5cc8e5e54fe0", "b41cdcba-fcf5-4e67-b20e-975f2cbd2207", "bfc032d0-be49-45b2-888d-7037b454a554", "c4710c73-497d-44f0-ae10-64613eca18d4", "e1b82554-9124-4cc8-b5b5-c700ce27d68e"], "title": "RP-Tree: rare pattern tree mining", "venue": "data warehousing and knowledge discovery", "year": 2011, "id": "22809def-89d4-4753-91a9-43f30cdc3d1f"}
{"authors": ["Patrice Sbold"], "n_citation": 50, "references": ["227d7775-961f-4f84-979c-aac4546e37f7", "523d35ea-13f9-4d34-bb34-bb96b9aaaf19", "968c41e5-3f19-4cf7-93b4-8e2bd07717ea"], "title": "Generalized Thue-Morse sequences", "venue": "fundamentals of computation theory", "year": 1985, "id": "22956150-5402-43a6-86d7-13c4f6123484"}
{"authors": ["Nadja Damij", "Talib Damij"], "n_citation": 0, "references": [], "title": "AN APPROACH FOR CLASS MODEL DEVELOPMENT", "venue": "international conference on health informatics", "year": 2010, "id": "229cfc4e-f7f5-404f-8a17-6ed02ab196ad"}
{"authors": ["Matti Saarikallio", "Pasi Tyrv\u00e4inen"], "n_citation": 2, "references": ["24a7c967-e1dd-4883-b3bf-332f74f3222e", "329adcf2-e20d-48d7-bebe-0f07ca3b6e9b", "3bfd47e8-2d96-4887-b343-e68968964bbd", "4a7405ff-892e-4d78-afa9-182392b2c669", "8cfee3c8-13e6-4935-aeda-3d13b1867586", "be453f8e-a353-4540-9856-89b4bc5a913a", "f9e20356-3d04-4d44-acbd-1b42d4cf12cb"], "title": "Following the Money: Revenue Stream Constituents in Case of Within-firm Variation", "venue": "international conference on software business", "year": 2014, "id": "22a3f26b-dc89-4636-aaf9-c12e999789f2"}
{"authors": ["Klaus R. Dittrich"], "n_citation": 3, "title": "Migration von konventionellen zu objektorientierten Datenbanken: soll man, mu\u00df man - oder nicht?", "venue": "Wirtschaftsinformatik \\/ Angewandte Informatik", "year": 1993, "id": "22b37c7b-5065-4636-bcdf-3a5b61466c3e"}
{"abstract": "The problem of finding an enclosure for the range of a bivariate polynomial p over the unit triangle is considered. The polynomial p is expanded into Bernstein polynomials. If p has only real coefficients the coefficients of this expansion, the so-called Bernstein coefficients, provide lower and upper bounds for the range. In the case that p has complex coefficients the convex hull of the Bernstein coefficients encloses the range. The enclosure is improved by subdividing the unit triangle into squares and triangles and computing enclosures for the range of p over these regions. It is shown that the sequence of enclosures obtained in this way converges to the convex hull of the range in the Hausdorff distance. Furthermore, it is described how the Bernstein coefficients on these regions can be computed economically.", "authors": ["Ralf Hungerb\u00fchler", "J\u00fcrgen Garloff"], "n_citation": 10, "references": ["3ce9b2a8-eed7-4d37-9f40-ef057e3308ac", "4ce7799d-ab51-4974-87f4-1e10c33830f4", "6a58414d-d3cb-40b9-9ac9-42ee04a680f5", "7532a20d-2fa5-404c-ac11-04d4115a389f", "7d286be7-9019-4023-8ebc-e9f7a31d669f", "97500e59-5c21-4d72-8b72-082664191795", "a412b188-2ecc-4078-b68a-ba37e300c61b", "a58b7223-6cfb-480e-9067-6b2d7b985bfb", "d2b3bc9f-6bfa-466d-a331-58c1b5476403", "f2c89257-a3e7-4355-a83d-1573417743b5"], "title": "BOUNDS FOR THE RANGE OF A BIVARIATE POLYNOMIAL OVER A TRIANGLE", "venue": "Reliable Computing", "year": 1998, "id": "22b7eb7e-e82a-4cfc-8ed2-4d8ab0c20558"}
{"authors": ["Grzegorz Dogil", "Bernd M\u00f6bius"], "n_citation": 14, "references": ["00055221-1d5d-4dff-b8b7-5c62cc2bdf7f", "09f98b3c-4414-40f0-914c-689ae0c4d00f", "db23bab7-94ee-4b0f-9fdc-281a5cd3608c"], "title": "Towards a model of target oriented production of prosody.", "venue": "conference of the international speech communication association", "year": 2001, "id": "22dc353d-dc23-4ed4-82e7-309b82973320"}
{"authors": ["Ab\u00edlio Costa", "Jo\u00e3o Paulo Pereira"], "n_citation": 0, "references": ["0588d20c-3a47-416f-988e-e46b4dd29d54", "262307cf-4a86-49ee-bbea-97bfd5c26595", "41e8e23b-44e7-4bb4-8fb0-4e60c9cdffe5", "7ab8db70-334a-4889-b552-c0581d9d8b45", "9011d71e-7c6e-4293-bfc9-563e610e5418", "bd27df88-053f-4ed0-aef5-75be5a83658a", "c0cc908b-c799-46b2-84ab-8bf81aaba439", "ceb73b60-9204-4f64-b1c2-6458508b6fd2", "e2c721f4-3bc6-4641-bf5a-1c394b81dde1"], "title": "SketchyDynamics: A Sketch-Based Library for the Development of Physics Simulation Applications", "venue": "", "year": 2013, "id": "22e70fc1-b373-4e46-9b87-f7c1847bc235"}
{"authors": ["Rapha\u00eblle Chaine"], "n_citation": 4, "title": "A geometric-based convection approach of 3-D reconstruction.", "venue": "symposium on geometry processing", "year": 2003, "id": "22f6c159-5f70-4c6f-85a4-bacd85b2b14a"}
{"authors": ["Tiko Iyamu", "Tefo Sekgweleo", "Sharol Sibongile Mkhomazi"], "n_citation": 0, "references": ["04a9b431-2039-4e4f-ae4c-1ce9d22b415b", "2698ee95-8314-4d78-994a-e13e18ce54cd", "68573691-b8cd-4698-b7ea-00117627b98d", "6afd5b6f-8356-4ddb-af6a-7828303190a2", "9770e86b-d91c-4ca3-9555-e95a7951d81f", "b7a9191f-e2ee-4c46-a36c-e32c02ffdfcc", "c557aeeb-8d96-4b1c-8fcd-416601fbc884"], "title": "Actor Network Theory in Interpretative Research Approach", "venue": "", "year": 2013, "id": "22fa0d41-8b8b-4286-8d82-4611fa5b64be"}
{"authors": ["Dan Vodislav"], "n_citation": 1, "title": "HandMove: a system for creating animated user interface components by direct manipulation", "venue": "", "year": 1995, "id": "22fc3e84-95fa-4f1a-bd46-c8488d3b59ce"}
{"authors": ["Jun Zheng", "Mingzeng Hu", "Hongli Zhang"], "n_citation": 1, "title": "Usage Behavior Profiling for Anomaly Detection using Vector Quantization.", "venue": "computer science and its applications", "year": 2005, "id": "230b1afc-f25c-41ed-b7f4-efdd21792376"}
{"abstract": "The deployment of knowledge representation formalisms to the Web has created the need for hybrid formalisms that combine heterogeneous knowledge bases. The aim of this research is to improve the reasoning efficiency over hybrid knowledge bases (KBs). The traditional way of reasoning over hybrid KBs is to use different underlying reasoners to access the different data sources, which causes overhead. To remedy this, we propose a new strategy, called inline evaluation, which compiles the whole hybrid KB into a new KB using only one single formalism. Hence we can use a single reasoner to do the reasoning tasks, and improve the efficiency of hybrid reasoning.", "authors": ["Guohui Xiao", "Thomas Eiter"], "n_citation": 1, "references": ["02f22c84-497b-4301-bc06-39019d38caa7", "166cb1ca-ab45-4efb-9bae-240604e14193", "19316e17-f5b5-42c4-ba55-84c28d5af392", "41ca3a1b-6776-4912-8d53-bff81f5916fe", "4d1e29b8-d332-4da6-b7e1-effe07120f39", "6f15cf46-c40b-4c37-8697-814f58fc07d7", "9ecc664f-e8a8-4d95-875f-da3cceab85f9", "db3607e1-099c-44ca-9cb7-00356f0455d3", "dfe63c5d-9f89-466d-92f9-2995338a1965", "ee618afe-251b-444b-a507-afa0591d2fd3", "f89e3a8a-9d91-44d3-b83b-b464ec02d5d8", "f9732e99-f06f-46a4-af66-34c0c6e225c0", "fb60de03-8948-48cf-8dc6-c2873a0babe4"], "title": "Inline evaluation of hybrid knowledge bases PhD description", "venue": "web reasoning and rule systems", "year": 2011, "id": "2327f410-d70f-44a3-b209-97954016b17c"}
{"abstract": "In this work, we study the structure of skew constacyclic codes over the ring R = F4(v)/\ufffd v 2 \u2212 vwhich is a non chain ring with 16 elements where F4 denotes the field with 4 elements and v an indetermi- nate. We relate linear codes over R to codes over F4 by defining a Gray map between R and F 2 4 . Next, the structure of all skew constacyclic codes is completely determined. Furthermore, we construct DNA codes over R.", "authors": ["Aysegul Bayram", "Elif Segah Oztas", "Irfan Siap"], "n_citation": 1, "references": ["19924453-05bb-4102-900b-d1a54dd2ace6", "3ac7b2d2-35eb-49bf-9320-35ae0211d70c", "83b2ec97-2298-4f8c-8f8d-2b78e56ad718", "e015b0da-c2fd-4742-88af-67e058cfcc38"], "title": "Codes over a Non Chain Ring with Some Applications", "venue": "international congress on mathematical software", "year": 2014, "id": "233c0475-7443-4270-b0c0-d28fa4d370d9"}
{"authors": ["Alvaro del Val", "Pedrito Maynard-Reid", "Yoav Shoham"], "n_citation": 13, "title": "Qualitative Reasoning about Perception and Belief.", "venue": "international joint conference on artificial intelligence", "year": 1997, "id": "233c1e87-5b5e-48f1-8fa0-daf489c2b0fb"}
{"authors": ["Micheline Hancock-Beaulieu", "Helene Fowkes", "Nega Alemayehu", "Mark Sanderson"], "n_citation": 8, "references": ["e8b0c5b3-7dad-40ee-9a93-7bdb36e739c9"], "title": "Interactive Okapi at Sheffield - TREC-8.", "venue": "text retrieval conference", "year": 1999, "id": "234ae014-7760-419c-b6a8-2ce3fa5d9136"}
{"authors": ["Kamrul Islam", "Selim G. Akl"], "n_citation": 8, "references": ["23cd7ce3-0ed4-405d-aeb8-cae406544f91", "23dd7fc0-1ebd-43ce-ab3e-43896512c209", "51143b04-a709-49f6-8e72-052888336af7", "d871c754-4f5c-4d16-9add-21e4eb0d1175", "dbc996b4-e926-40e8-8636-487a30b72555", "e5dde2f1-9fd2-4c2d-8905-b342a7c0a1b0", "ea949fa2-f7a6-4644-9352-9b0a45554897", "f1580e55-32fc-479f-bff6-a5fe1819a0fc", "f1b78884-4799-4582-9284-6b74fe16e804", "f699578c-c859-4e95-9e8c-5a56629a3a09"], "title": "Target Monitoring in Wireless Sensor Networks: A Localized Approach.", "venue": "Ad Hoc & Sensor Wireless Networks", "year": 2010, "id": "235c3490-37a0-420c-9535-0e1c8605ea0c"}
{"authors": ["Mouayad Albaghdadi", "Cynthia S. Hood", "Mark Hamlen"], "n_citation": 2, "title": "A Framework for Distributed Event Correlation.", "venue": "Applied Informatics", "year": 1999, "id": "239545b4-d0a7-40e0-8dd3-48cba563936a"}
{"authors": ["Steven Huss-Lederman", "Elaine M. Jacobson", "Anna Tsao", "Guodong Zhang"], "n_citation": 61, "title": "Matrix Multiplication on the Intel Touchstone Delta.", "venue": "", "year": 1993, "id": "239b8b95-92cb-41ee-889c-1e145c8971b9"}
{"abstract": "Decision making under uncertainty is one of the most important challenges within the research field of artificial intelligence, as they present many everyday situations that agents have to face. Within these situations, an agent has to choose from a set of options, whose payoff is uncertain (i.e. unknown and nondeterministic) to the agent. Common to such decision making problems is the need of balancing between exploration and exploitation, where the agent, in order to maximise its total payoff, must decide whether to choose the option expected to provide the best payoff (exploitation) or to try an alternative option for potential future benefit (exploration). Among many decision under uncertainty abstractions, multi\u2013armed bandits are perhaps one of the most common and best studied, as they present one of the clearest examples of the trade\u2013off between exploration and exploitation. Whilst the standard bandit model has a broad applicability, it does not completely describe a number of real\u2013world decision making problems. Specifically, in many cases, pulling choice of arm (i.e. making a decision)is further constrained by several costs or limitations. In this thesis, we introduce the budget\u2013limited bandit model, a variant of the standard bandits, in which pulling an arm is costly, and is limited by a fixed budget. This model is motivated by a number of real\u2013world applications, such as wireless sensor networks, or online advertisement.#R##N##R##N#We demonstrate that our bandit model cannot be reduced to other existing bandits, as it requires a different optimal behaviour. Given this, the main objective of this thesis#R##N#is to provide novel pulling algorithms that efficiently tackle the budget\u2013limited bandit problem. Such algorithms, however, have to meet a number of requirements from both#R##N#the empirical and the theoretical perspectives. The former refers to the constraints desired by the motivations of real\u2013world applications, whilst the latter aims to provide#R##N#theoretical performance guarantees. To begin with, we propose a simple pulling algorithm, the budget\u2013limited ?\u2013first, that addresses the empirical requirements. In more detail, the budget\u2013limited ?\u2013first algorithm is an empirically efficient algorithm with low computational cost, which, however, does not fulfil the theoretical requirements. To provide theoretical guarantees, we introduce two budget\u2013limited UCB based algorithms, namely: KUBE and fractional KUBE,iv that efficiently tackle the theoretical requirements. In particular, we prove that these algorithms achieve asymptotically optimal performance regret bounds, which only differ from the best optimal bound by a constant factor. However, we demonstrate in extensive simulations that these algorithms are typically outperformed by the budget\u2013limited ?\u2013first. As a result, to efficiently trade off between theoretical and empirical requirements, we develop two decreasing ?\u2013greedy based approaches, namely: KDE and fractional KDE, that achieve good performance from both the theoretical and the empirical perspective. Specifically, we show that, similar to the budget\u2013limited UCB based algorithms, both KDE and fractional KDE achieve asymptotically optimal performance regret bounds. In addition, we also demonstrate that these algorithms perform well, compared to the budget\u2013limited ? first.#R##N##R##N#To provide a grounding for the algorithms we develop, the second part of this thesis contains a running example of a wireless sensor network (WSN) scenario, in which we tackle#R##N#the problem of long\u2013term information collection, a key research challenge within the domain of WSNs. In more detail, we demonstrate that by using the budget\u2013limited bandit algorithms, we advance the state\u2013of\u2013the\u2013art within this domain. In so doing, we first decompose#R##N#the problem of long\u2013term information collection into two sub\u2013problems, namely the energy management and the maximal information throughput routing problems. We then tackle the former with a budget\u2013limited multi\u2013armed bandit based approach, and we propose an optimal decentralised algorithm for the latter. Following this, we demonstrate that the budget\u2013limited bandit based energy management, in conjunction with the optimal routing algorithm, outperforms the state\u2013of\u2013the\u2013art information collecting algorithms in the domain of WSNs.", "authors": ["Long Tran-Thanh"], "n_citation": 10, "title": "Budget-limited multi-armed bandits", "venue": "", "year": 2012, "id": "23abc3f8-2fc3-4dd9-a752-31928d7fb2ba"}
{"abstract": "We present the Adaptive Vector Pattern Matching (AVPM) method, a novel method for the detection of vortical structures specifically designed for velocity encoded 4D PCMRI datasets. AVPM is based on vector pattern matching combined with robust orientation estimation. This combination provides for a simple yet robust algorithm, which is a priori axial flow invariant. We demonstrate these properties by comparing the performance of AVPM with Heiberg's Vector Pattern Matching algorithm.", "authors": ["Johann Drexl", "Haider Riaz Khan", "Michael Markl", "Anja Hennemuth", "Sebastian Meier", "Ramona Lorenz", "Horst K. Hahn"], "n_citation": 1, "references": ["90c36acc-cee9-44aa-8ff9-b685bc6e3d90"], "title": "Detection of vortical structures in 4D velocity encoded phase contrast MRI data using vector template matching", "venue": "", "year": 2013, "id": "23ad0c15-7004-4ab0-8d41-7636d9672eac"}
{"authors": ["Linda Candy", "Sam Ferguson"], "n_citation": 17, "references": ["02971f2f-01b0-4330-ab05-78b330fb656b", "927443ed-ed21-4079-acbd-959e7794a583", "bad167d5-8c3b-468c-8510-f0ec28bb29c3"], "title": "Interactive Experience, Art and Evaluation", "venue": "", "year": 2014, "id": "23c140da-e565-44c0-ad64-f7a71c93ea94"}
{"authors": ["Yasuyo Hatcho", "Kiyohiko Hattori", "Keiki Takadama"], "n_citation": 0, "title": "Time Horizon Generalization in Reinforcement Learning: Generalizing Multiple Q-Tables in Q-Learning Agents", "venue": "Journal of Advanced Computational Intelligence and Intelligent Informatics", "year": 2009, "id": "23c509de-e35e-4dd4-8e9d-c023c9a19763"}
{"abstract": "Learning research has argued the importance of providing authentic contexts for learning. However, traditional learning environments are often disconnected from external communities of practice. For example, students might design and carry out scientific experiments that are valuable pedagogically, but do not contribute to science itself. In this study, we used the Game Ontology Project (GOP), a wiki-enabled hierarchy of elements of gameplay used by games studies researchers, in a game design class. Students found it useful for learning. However, encouraging sustained participation was challenging because students tended to view the GOP as a static source, rather than a participatory and editable resource. Expert analysis of the student's contributions to the ontology found them to be useful and significant. We conclude with thoughts on the importance of these kinds of authentic environments in traditional learning.", "authors": ["Jos\u00e9 Pablo Zagal", "Amy Bruckman"], "n_citation": 50, "references": ["1d13398f-8dee-4e3f-af73-024f2dae4b8b", "33d63c7f-3df6-4310-9ea3-93836ef151d8", "7c0f8ab1-ce59-4e71-a82d-cebf3eee8117", "a633330d-c81c-4d81-bad2-1b6577b82039", "affb4cff-9de1-479a-8adb-f6953e50e783"], "title": "The game ontology project: supporting learning while contributing authentically to game studies", "venue": "", "year": 2008, "id": "23e39d5e-940b-478a-a47e-e93fb9ebfe66"}
{"abstract": "The standard approach to calculating electrostatic forces and capacitances involves solving a surface integral equation of the first kind. However, discretizations of this problem lead to ill-conditioned linear systems and second-kind integral equations usually solve for the dipole density, which can not be directly related to electrostatic forces. This paper describes a second-kind equation for the monopole or charge density and investigates different discretization schemes for this integral formulation. Numerical experiments, using multipole accelerated matrix\u2013vector multiplications, demonstrate the efficiency and accuracy of the new approach.", "authors": ["Johannes Tausch", "Jacob K. White"], "n_citation": 33, "references": ["7248dd71-f46e-4314-9b93-e6d98fe6056c", "a629bf04-15de-49b1-9d3e-d22a58d4508f", "cd3c6869-5298-4f08-876c-9cf01df327da"], "title": "Second-kind integral formulations of the capacitance problem", "venue": "Advances in Computational Mathematics", "year": 1998, "id": "2438e347-04fa-4d09-8296-1b3e74826dcc"}
{"authors": ["Werner Bux", "Davide Grillo"], "n_citation": 2, "title": "End-To-End Performance in Local-Area Networks of Interconnected Token Rings.", "venue": "international conference on computer communications", "year": 1984, "id": "2480b89c-f9ef-444e-819d-bc3d3df5ba72"}
{"abstract": "In this note we first develop a new computationally zero-knowledge interactive proof system of knowledge, which then is modified into an authentication scheme with secret key exchange for subsequent conventional encryption. Implemented on a standard 32-bit chip or similar, the whole protocol, which involves mutual identification of two users, exchange of a random common secret key and verification of certificates for the public keys (RSA, 512 bits) takes less than 0.7 seconds.", "authors": ["J. Brandt", "Ivan Damg\u00e5rd", "Peter Landrock", "Torben P. Pedersen"], "n_citation": 2, "references": ["29c593e2-6811-440d-b195-872b25fe4085", "99b6d948-83ec-41aa-8c83-8d20cf4e713e", "ad413a89-91bb-47fb-94b3-a94e3d7baef4", "bc4663ed-e242-4e26-89e1-a473e53c9490"], "title": "Zero-Knowledge Authentication Scheme with Secret Key Exchange (Extended Abstract)", "venue": "international cryptology conference", "year": 1988, "id": "249589e6-5d60-429a-933b-3e5f52f4f79f"}
{"authors": ["Stephen T. Margulis"], "n_citation": 50, "references": ["a8039776-cc03-4d1c-9b34-074ca09c973c", "b497a01e-1b71-44cb-beea-ba6b13475064"], "title": "Three Theories of Privacy: An Overview", "venue": "", "year": 2011, "id": "24b1d94e-e4a7-429a-b296-c3093707f253"}
{"authors": ["Davide Sangiorgi", "Robert de Simone"], "n_citation": 0, "title": "Ninth International Conference on Concurrency Theory 1998 - Editorial.", "venue": "Theoretical Computer Science", "year": 2002, "id": "24c3d465-769a-40f0-b85b-ebf108560551"}
{"authors": ["Femida Gwadry-Sridhar", "Ali Hamou", "Benoit Lewden", "Claudio Martin", "Michael Anthony Bauer"], "n_citation": 0, "references": ["b49c1e2b-0cd0-4950-a724-00c698e5b49d"], "title": "Predicting Sepsis: A Comparison of Analytical Approaches", "venue": "electronic healthcare", "year": 2010, "id": "24c54a5d-c90c-4105-9fa8-7a03f6daddc8"}
{"authors": ["Alexander Pokahr", "Lars Braubach"], "n_citation": 50, "references": ["020410d3-9cc9-4af2-b0ab-9ee0cbea3388", "1c432e1f-725c-4bb9-bdd7-714cebc02b29", "2a3defdb-a33c-422b-99e4-e2cfd04467f5", "352838dd-9583-402f-be39-52df4810a25f", "3952a107-1d47-4765-86d8-76471c2714ee", "40568132-03b1-4f2e-8d30-e6b66d3e884f", "5b19ea9e-b22c-45e8-a4b3-5a008f8a8333", "75d03451-c5ab-42ff-a507-c8dbf1a69828", "766273da-a900-44d3-872c-de9d00857e9a", "8660ddb3-b7ff-4efe-837e-c5b323ef3e02", "8af1ccd4-c29f-4122-a4e6-4805ef1af715", "94b4c1e8-504a-4f32-a208-a359efd31057", "9a4e9eb1-9d17-4a0f-b649-f8a598f0c588", "9c109ff9-6b23-41aa-93f6-907160601163", "ade9cd6f-33e2-4f21-9078-61df94918cf2", "b77c9f31-e087-4c78-bcfc-44c6205ecf54", "ce8d0327-69e9-489e-9a05-362c67f2a193"], "title": "Towards Elastic Component-Based Cloud Applications", "venue": "", "year": 2015, "id": "24c9aff2-6438-4fbe-acf1-112b64aaf1cd"}
{"authors": ["Yanhui Gu", "Zhenglu Yang", "Miyuki Nakano", "Masaru Kitsuregawa"], "n_citation": 0, "references": ["13b79798-2bef-4968-8a0d-dfee29dcc925", "339c137d-9ab8-41f7-8395-2826d4e07782", "3731b47d-2c98-41d8-b209-73c55b5d5470", "52fba968-6ab6-4ede-862f-4dd7b8fd9895", "5569318e-2a73-4e13-8b69-abf15bdabd4c", "5b7dbc85-bff1-46a3-bc1a-fa5db8d57fcb", "76b1e4ef-3815-4d73-ae0f-f4d4e95deeaa", "77b70045-845b-4fa4-8fee-7729ed232e7d", "80dfe03d-9e11-4207-9a08-8d6961fd48f3", "8fc0f295-5cec-4698-8da1-2a592663f9d5", "94617485-8810-4f47-86ca-c8b19a0806ba", "9fc5dda6-7bbc-4ee9-a275-d546c5b12560", "aafffa69-1bc3-4d18-8f3b-296c03a13557", "ba136777-f919-45bf-b9b8-e475927ceecf", "ca03f301-81a8-46d8-9fa7-51e6aea3527d", "d071594e-145b-47c0-8d00-c6046e40f1ad", "d4645b63-0fa6-473c-acd6-c4d97a32a7df", "de03f8d2-f24d-491d-8835-fee34a4312b7", "f601f85b-724b-4e3a-9d4a-69dc384b0ff0"], "title": "Exploration on Similar Spatial Textual Objects Retrieval", "venue": "", "year": 2013, "id": "24d0d145-133c-41ab-a0a5-9dcb8bc4f925"}
{"authors": ["Yu Ting Yeung", "Yao Qian", "Tan Lee", "Frank K. Soong"], "n_citation": 2, "title": "Prosody for Mandarin speech recognition: a comparative study of read and spontaneous speech.", "venue": "conference of the international speech communication association", "year": 2008, "id": "24d2d222-7bbd-471f-93b2-2c499545309e"}
{"abstract": "Optical cross-connects are expected to be the key element in future optical transport networks. In this paper, a simple OXC architecture is proposed and its performance evaluated by means of simulations. The main advantage of the proposed design in front of previously reported structures consists in the absence of any tunable component. Obtained results show that the proposed device performance is close to that given by an OXC with full wavelength conversion capability.", "authors": ["Jaume Comellas", "Josep Conesa", "Gabriel Junyent"], "n_citation": 50, "references": ["2391a6a1-8588-41ac-9cd4-88f392ec0bda", "655e5f19-d511-4fcb-886d-d496be818426", "96c2f02a-bc73-4212-af0b-9336cafdffa0", "97208e0e-6ccb-4794-9542-c7a69cb5a5cc"], "title": "Design and Performance Analysis of a Simple OXC", "venue": "Photonic Network Communications", "year": 2003, "id": "25131170-197c-40a9-8cb1-047118078ab0"}
{"abstract": "In this paper, we present a novel approach in automatic discourse segmentation without a full semantic understanding. In order to analyse the textual bonds and determine the degree of coherence that a discourse may exhibit, we first represent the tremendous diversity of textual relations into a discourse network. A set of mutual linguistic constraints that largely determines the similarity of meaning among lexical items is encoded. Topic boundaries in a discourse are identified through a computational method which identifies the segment cluster from a higher order structure in the discourse network. Our segmentation is regarded as a process of identifying the shifts from one segment cluster to another. Experimental results show that our formulation is capable to address the topic shifts of texts. Comparison with a related method demonstrates that the combination of constraints is closely related, to the topic boundaries among textual segments. Evaluation using recall and precision shows the effectiveness of our approach in a collection of Chinese newswire articles.", "authors": ["Samuel W. K. Chan", "Benjamin K. Tsou"], "n_citation": 1, "references": ["0652d37d-8430-48cf-b769-883a6490643a", "20cfd8c7-6f02-4984-8719-80edd50599d2", "276cf0f1-6384-4e0c-b411-1b36ffce8d00", "5a40b6d7-8960-4620-a461-9e6e0d1db049", "61480cc2-3693-4aea-9063-87a97ae9e376", "708f92bc-9eb0-4a03-9c1e-1e54b3261eb9", "b23adb78-65ed-4bbb-bce9-fdd70d14699e", "b263ca09-f1f0-4f8f-99d6-4153ef683d04", "f0a5e86a-36b0-4c47-b085-0d35f15e9e8e", "f0c983e5-26cd-4311-a6c2-56021d04456b"], "title": "Segmentation of Chinese discourse in content-based information retrieval", "venue": "", "year": 2000, "id": "25377e07-5400-4f78-8e01-4abf4fc0172e"}
{"abstract": "Computer vision system is one of the newest approaches for human computer interaction. Recently, the direct use of our hands as natural input devices has shown promising progress. Toward this progress, we introduce a hand gesture recognition system in this study to recognize real time gesture in unconstrained environments. The system consists of three components: real time hand tracking, hand-tree construction, and hand gesture recognition. Our main contribution includes: (1) a simple way to represent the hand gesture after applying thinning algorithm to the image, and (2) using a model of complex-valued neural network (CVNN) for real-valued classification. We have tested our system to 26 different gestures to evaluate the effectiveness of our approach. The results show that the classification ability of single-layered CVNN on unseen data is comparable to the conventional real-valued neural network (RVNN) having one hidden layer. Moreover, convergence of the CVNN is much faster than that of the RVNN in most cases.", "authors": ["Abdul Rahman Hafiz", "Md. Faijul Amin", "Kazuyuki Murase"], "n_citation": 18, "references": ["103855de-1d9f-45bc-b963-3f499e91e041", "1d2788b4-e230-4f87-af65-bc4dd0715c93", "bb948ac3-8ffc-492f-b738-46ebe8c8093b", "f3993194-6c7c-4d28-a83c-0bfa369ea2c3"], "title": "Real-time hand gesture recognition using complex-valued neural network (CVNN)", "venue": "international conference on neural information processing", "year": 2011, "id": "2566230a-74b1-49f4-b86f-63f45f0a5285"}
{"abstract": "Since the introduction of the ubiquitous computing vision by Mark Weiser, we observed quite some research from various R&D projects as well as groups that focused on different aspects in the area of context-awareness. However, there is yet no result which we can easily apply in a real environment. The context-aware service development and deployment process seldom focused on reusability and realistic implementation issues. We believe these issues can be tackled by proposing a complete context-aware system package. In this package both developers and users will be supported. This idea is realised at our department as a context-aware playground. This paper explains the observation on current work and the shortcomings, and proposes how the context-aware playground approach can be a solution.", "authors": ["Sian Lun Lau", "Niklas Klein", "Andreas Pirali", "Immanuel K\u00f6nig", "Klaus David"], "n_citation": 0, "references": ["081b1c58-3040-4c57-9758-d213c6646b83", "0e83d955-1070-4354-9cac-b7887781fc71", "4753cdda-4a7c-42d8-a395-ece21e3b1348", "6ec52c29-fc7f-43cd-90c6-441da0341e74", "b4ee2292-e959-43e9-a2f4-a36861986e44", "d7825e13-b803-413c-924c-7aea5e2a1159"], "title": "Implementation of a User-Centric Context-Aware Playground", "venue": "Electronic Communication of The European Association of Software Science and Technology", "year": 2009, "id": "257b70cc-c9f0-4046-9ed4-2923ec8c118e"}
{"abstract": "This paper proposes a purpose-based framework for support- ing privacy preserving access control policies and mechanisms. The mech- anism enforces access policy to data containing personally identifiable information. The key component of the framework is purpose involved access control models (PAC ) that provide full support for expressing highly complex privacy-related policies, taking into account features like purposes and conditions. A policy refers to an access right that a subject can have on an object, based on attribute predicates, obligation actions, and system conditions. Policy conflicting problems may arise when new access policies are generated. The structure of purpose involved access control policy is studied, and efficient conflict-checking algorithms are developed. Finally a discussion of our work in comparison with other access control and frameworks such as EPAL is presented.", "authors": ["Hua Wang", "Lili Sun", "Vijay Varadharajan"], "n_citation": 3, "references": ["0741243e-63ad-4ae5-a610-7a12074f505e", "3f29ebc4-cda8-41e3-bbb2-07b949fbfc03", "4e4837d8-3f23-4727-85a0-ebf14e0e39e2", "4fdafc08-2ed2-406a-939a-d55212c9fd48", "57253f49-e036-473a-acda-362badce51f8", "6a0ba86f-6f26-4b62-b74c-fc45b65011ac", "6c02fc37-6dba-4abd-b3e5-2d41f44ddd9b", "70981731-17c5-46e5-b0c3-84820969a64a", "711b0f7c-b80a-47f3-9f5b-2eaff0aeea25", "77c6bd50-9641-4f84-85ef-5a7e4380f943", "81221a96-6f50-4adb-808f-fb7b410e61a6", "9d1e81d0-92d7-4471-ab3c-bbfc078f57d5", "a335df7a-579b-48bb-aea1-46b2d55bb8c6", "a70ce88a-8574-4e7e-866b-a32e4f9f3eb7", "bd73cef4-eb81-4abd-a73f-c1d6188bf68e", "c533dc19-a37f-4bed-bb66-0adfcf46d505", "c762bc2e-eb61-4073-b49d-3d4e7c1eca29", "ddd58209-3c87-4e39-addc-fcc6abd31313", "e4d8274b-786e-4a79-ae91-449bde1340bb", "e67f27dc-a7e7-492d-a3f4-5a42b488569a", "e9137284-44ef-4d00-b528-cd698b2d428c"], "title": "Purpose-based access control policies and conflicting analysis", "venue": "information security", "year": 2010, "id": "257d7afc-236a-4e95-8570-d619c4b27107"}
{"abstract": "Much of the research and development effort in the IDS community is guided by a design approach, according to which user desires, expectations and agency are central. This approach may place unnecessary limitations on the design space. I argue for the validity and significance of an alternative, expressive approach, which may be more appealing to artists, and offer some formal parameters of IDS-as-Art. These open up for authors the ability to explore the creation of vastly complex and dynamic storyworlds that highlight contingency and probability; and the possibility of manipulating agency as subject matter to implicate users, through userly performance, in the storyworld's meaning. IDS can thus offer users an opportunity to reflect upon various aspects of their performance, including un- and subintentional aspects.", "authors": ["Noam Knoller"], "n_citation": 6, "references": ["082b33c9-610c-4365-b0e5-b87c26003064", "2013db5e-6fc3-4b0d-97d1-80d93f8a5020", "24d11b3a-0f28-4343-8da0-4f0ec52174cb", "30345dff-d172-4dca-8bab-27a72ee15e43", "30c1f15a-bf44-4951-ad28-0964e606b530", "3ade95b2-43fa-42d0-a618-692a5708d8a8", "e16a5831-6982-4148-8adb-53d97031f8af", "ea50ccd9-d378-4362-816e-2b28f59f897a", "eb88dfd1-7ffb-4b10-b2d2-732f726b6bbb", "efd42983-86d4-4274-81dc-6b11a1e498c7", "efef42d5-01ca-4143-bbfb-799fd7e0f068"], "title": "The expressive space of IDS-as-Art", "venue": "international conference on interactive digital storytelling", "year": 2012, "id": "2580e7ef-0fad-4e62-8ce6-e59f8e0d9c9b"}
{"authors": ["P\u00e1draig Cunningham", "Tony Veale"], "n_citation": 17, "references": ["2040c714-17ef-4a0d-8a72-33cf66bb4fa2", "d551a0f8-c93b-486c-bdaa-fbd7313bd293"], "title": "Organizational issues arising from the integration of the lexicon and concept network in a text understanding system", "venue": "international joint conference on artificial intelligence", "year": 1991, "id": "25938200-ad6a-471e-93c2-122527255a99"}
{"authors": ["Robert Buckley"], "n_citation": 0, "title": "Color Imaging with JPEG 2000.", "venue": "color imaging conference", "year": 2001, "id": "259855ff-7b58-4662-af38-6e908c0694c2"}
{"abstract": "Most of process-centered software engineering environments and those languages focus on process-oriented software development process. However, recent software development tends to require to focus on product-oriented software development, because of emergence of various types of software developments; e.g., software reuse, component-based composition, and so on. To achieve this, we propose in this paper a new development environment named MonoProcess/SME (Software process Management Environment), which is based on an object-centered software process model MonoProcess we also propose. MonoProcess consists of a set of objects which represent artifacts and resources in the software development. An object has attributes and methods, which represent characteristics and operations of the object, respectively. MonoProcess/SME is an software development environment for project management and development support, using the idea of MonoProcess modeling. MonoProcess/SME illustrates software development environment as it is, and provides an environment for software process execution, management, and improvement.", "authors": ["Makoto Matsushita", "Makoto Oshita", "Hajimu Iida", "Katsuro Inoue"], "n_citation": 7, "references": ["269663ea-4dc4-4e99-86da-b04240bfdf5c", "3ff297f0-d5bd-4629-8a18-5d508e413e9c", "63f12ac6-639c-404b-8f2a-27bf2d2551cd", "c660d926-a480-4afb-b692-2cf3a4f8ca6e"], "title": "Distributed Process Management System Based on Object-Centered Process Modeling", "venue": "Lecture Notes in Computer Science", "year": 1998, "id": "25e09f2e-c606-469f-a763-5d20b4704a86"}
{"authors": ["Hubert Lyskawa", "Stanislaw Szejko", "Hongji Yang"], "n_citation": 0, "title": "Integrating Reverse Engineering into Reuse Process.", "venue": "", "year": 1997, "id": "25e3e74c-fdfa-4e78-aa74-980034722a8a"}
{"abstract": "The Intensive Care Unit (ICU) population is heterogeneous. At individual ICUs, the quality of care may vary within subgroups. We investigate whether poor outcomes of an ICU can be traced back to excess deaths in specific patient subgroups, by discovering candidate subgroups, with a modified adaptive decision tree boosting algorithm applied to 80 Dutch ICUs. Genuine subgroups were selected from candidate subgroups when the case-mix adjusted outcomes were poorer than those of the five top performing ICUs. For 59 ICUs we discovered 122 genuine subgroups and most were defined by one to four variables, with a median of three [2\u20134]. Variables Glasgow Coma Scale and age were used most. There were 29 ICUs with overall poor outcomes, and for 22 our algorithm found all excess deaths. A new method based on adaptive decision tree boosting discovered many subgroups of ICU patients for which there is potentially room for outcomes improvement.", "authors": ["Antonie Koetsier", "Nicolette de Keizer", "Ameen Abu-Hanna", "Niels Peek"], "n_citation": 0, "title": "A modified real AdaBoost algorithm to discover intensive care unit subgroups with a poor outcome.", "venue": "", "year": 2013, "id": "26017a16-e4d2-455c-aba6-e95358317f45"}
{"abstract": "Recommender Systems RS have risen in popularity over the years, and their ability to ease decision-making for the user in various domains has made them ubiquitous. However, the sparsity of data continues to be one of the biggest shortcomings of the suggestions offered. Recommendation algorithms typically model user preferences in the form of a profile, which is then used to match user preferences to items of their interest. Consequently, the quality of recommendations is directly related to the level of detail contained in these profiles. Several attempts at enriching the user profiles leveraging both user preference data and item content details have been explored in the past. We propose a method of constructing a user profile, specifically for the movie domain, based on user preference for keyword clusters, which indirectly captures preferences for various narrative styles. These profiles are then utilized to perform both content-based CB filtering as well as collaborative filtering CF. The proposed approach scores over the direct keyword-matching, genre-based user profiling and the traditional CF methods under sparse data scenarios as established by various experiments. It has the advantage of a compact user model representation, while at the same time capturing the essence of the styles or genres preferred by the user. The identification of implicit genres is captured effectively through clustering without requiring labeled data for training.", "authors": ["Deepa Anand", "Bonson Sebastian Mampilli"], "n_citation": 50, "references": ["0ea745c7-58b2-48e8-9115-42e9b0d20f2a", "0f4787f1-ccf1-4aab-ad94-4161b32ecee0", "58342d36-e657-4ef3-a3ec-7a5bce1fdb7e", "6436f6ee-7ec7-4cee-b590-ffc39cc2578a", "669c4126-0a9c-4692-be13-b65c1c9f032d", "92e490f5-6b38-4cab-a848-90368f04540f", "93cf69a3-9ef3-431e-8731-9d99d1535d7a"], "title": "User Profiling Based on Keyword Clusters for Improved Recommendations", "venue": "international conference on distributed computing and internet technology", "year": 2014, "id": "2614625d-a98b-4de7-a115-96c702014e63"}
{"authors": ["Francesco Amigoni"], "n_citation": 0, "title": "Map Building and Fragment Reassembly: Two Instances of The Same Problem?", "venue": "Intelligenza Artificiale", "year": 2005, "id": "262e7173-8e92-4c5b-911c-ddb300e424f8"}
{"abstract": "This paper presents and evaluates ORiNoCo, a novel data-collection and event-reporting protocol for sensor networks. ORiNoCo is built upon the asynchronous duty-cycle protocol RI-MAC and breaks with the tradition of exchanging extensive neighborhood information, a cornerstone of many competing collection protocols and one of their major source of communication overhead and energy expenditure. The merit of this venture is an opportunistic, energy-efficient, latency-reducing, and self-stabilizing protocol. ORiNoCo comes at virtually no extra costs in terms of memory demand and communication overhead compared to RI-MAC. We derive theoretical boundaries for the improvements in radio efficiency, latency, and energy-consumption. ORiNoCo is verified with these findings via simulation and compared with CTP. ORiNoCo achieves lower energy-consumption while reducing end-to-end delays.", "authors": ["Stefan Untersch\u00fctz", "Christian Renner", "Volker Turau"], "n_citation": 50, "references": ["15f7fee5-ccaa-44bd-a61b-386bf430db59", "16a43bb9-ad3d-4310-9034-f06427d81af3", "197f73b4-fe75-46c5-a812-c30ed3656185", "314c5a50-5eb8-4377-9861-e4367ff86462", "314d7304-a00e-4f73-bfc7-8a87dec8cf5c", "5833c841-09ca-40f0-8433-26cbe714ad47", "8be4f96f-035c-4f05-a329-0bfadcaffe27", "96b245c2-47a5-4aec-89f0-d2a362124845", "afb68332-5c98-4ec4-a9c7-b1e218a0d894", "b1cc0550-bea3-448b-83da-870c743db074", "b5b8132d-0a8c-4e6c-999f-839f0cef48b7", "bdb195c7-7e08-4d51-8961-3a71b132dff8", "c1f5f444-6e58-4de8-bfbe-39f14bb67a28", "c41e853f-d1f4-4755-9981-cddb023d68f1", "cc62f28c-544c-4845-a1f8-95ba363bbc66", "d8164b0c-6d5d-48a7-b1e2-7a54c5f2636c", "e2ed1093-7749-419b-8a6e-e4088a15fcfa"], "title": "Opportunistic, receiver-initiated data-collection protocol", "venue": "international conference on embedded wireless systems and networks", "year": 2012, "id": "2643b9fd-f5c8-4999-8edf-690e50f6fd3d"}
{"authors": ["Haitian Xu", "Zheng-Hua Tan", "Paul Dalsgaard", "B\u00f8rge Lindberg"], "n_citation": 20, "references": ["cdd174a5-9939-4aa8-9bdc-1218a4ca8ad3"], "title": "Robust speech recognition based on noise and SNR classification - a multiple-model framework.", "venue": "conference of the international speech communication association", "year": 2005, "id": "267ede7a-3d11-416b-82ca-061c8b377dc7"}
{"authors": ["Michael Ehret", "Tobias Fritsch", "Benjamin Voigt"], "n_citation": 0, "title": "The Profi League Continues - An Online Gaming Community for Professional Players.", "venue": "", "year": 2009, "id": "26bb3732-ff42-4e61-b409-8b75db7d2c88"}
{"authors": ["Liang-Liang Xie", "P. R. Kumar"], "n_citation": 50, "title": "Wireless Network Information Theory.", "venue": "", "year": 2003, "id": "270cca74-df16-45d4-b507-05be65bad9a2"}
{"abstract": "The application of formal methods especially, model checking and static analysis techniques for the verification of safety critical embedded systems has produced very good results and raised the interest of system designers up to the application of these technologies in real size projects. However, these methods usually rely on specific verification oriented formal languages that most designers do not master. It is thus mandatory to embed the associated tools in automated verification toolchains that allow designers to rely on their usual domain-specific modeling languages DSMLs while enjoying the benefits of these powerful methods. More precisely, we propose a language to formally express system requirements and interpret verification results so that system designers DSML end-users avoid the burden of learning some formal verification technologies. Formal verification is achieved through translational semantics. This work is based on a metamodeling pattern for executable DSML that favors the definition of generative tools and thus eases the integration of tools for new DSMLs.", "authors": ["Faiez Zalila", "Xavier Cr\u00e9gut", "Marc Pantel"], "n_citation": 11, "references": ["36b12f15-f892-4a7a-b5cc-f76172910803", "39cbd5b7-d48a-409e-b642-83f7f5984836", "44f1976e-9b26-48b8-8704-f1eddda98e9f", "46c8d6cb-94fe-4b83-8086-f0dc713177ba", "6788580c-4a96-48d6-a810-593a449b9293", "9849d9c4-a97f-452f-882c-42a8c6cab0b5", "9ed087ab-6c81-4122-8561-d7eb2265e347", "b0f10460-1c4e-4e9c-8d30-397644798fa3", "b9c5f4c2-2870-42c9-9d4e-45a0a726b0d6", "baf3cc15-87d0-4f0d-94f1-31df22cea410", "c6b144a8-2239-406c-878a-3f8a6c73f830", "f82b989d-722f-44bc-80be-08983f06aca6", "fe404c3c-2eee-4fd5-b105-9c60ec5dd1d3"], "title": "Formal Verification Integration Approach for DSML", "venue": "model driven engineering languages and systems", "year": 2013, "id": "271d75bc-c48a-4d2c-8a05-05c17089505f"}
{"abstract": "The inference of temporal information from past event occurences in imagistic domains is relevant in several applications in knowledge engineering. In such applications, the order in which events have happened is imprinted in the domain as visual-spatial relations among its elements. Therefore, the interpretation of the relative ordering in which those events have occured is essential for understanding the domain evolution. We propose a cognitive model for event ordering reasoning within domains whose elements have been modified by past events. From the analysis of cognitive abilities of experts we propose new ontology constructs for knowledge modelling associated to Problem-Solving Methods. We illustrate the effectiveness of the model by means of an applications to an imagistic domain.", "authors": ["Laura S. Mastella", "Mara Abel", "Luis C. Lamb", "Luis Fernando De Ros"], "n_citation": 50, "references": ["95566e30-a32d-486d-92c4-2d05b59bc7df", "983920ca-8383-4580-b93d-0e99428b43fe", "a8846295-a520-4f08-8343-6db86e49b2f5", "dbe5ae2e-bbc0-4508-8df5-3ec95c784fa8", "dec2e01c-0148-448f-94cc-c5a30d658b9e"], "title": "Cognitive modelling of event ordering reasoning in imagistic domains", "venue": "international joint conference on artificial intelligence", "year": 2005, "id": "271e5c86-927b-4e26-b86e-d5c8e7098c59"}
{"authors": ["Amine Kerzazi", "Ismael Navas Delgado", "Jos\u00e9 Francisco Aldana Montes", "Othmane Chniber"], "n_citation": 4, "title": "A Semantic Mediation Architecture for RDF Data Integration.", "venue": "semantic web applications and perspectives", "year": 2008, "id": "271f3857-7291-45e3-b58c-307d0089e2d1"}
{"authors": ["Michael K\u00fchn"], "n_citation": 50, "references": ["02846de9-fc21-4c6c-b9e0-add9100573ab", "31583720-d414-4f31-99a8-ebaa86e8e79d", "39a1ac00-ec0e-4b65-a3a5-87f0d0845d8b", "4581945d-845f-4081-a07d-24007a7308fc", "651d9620-739e-433a-8df5-92e565583539", "778bf21f-d1ef-49f3-b8e6-bf0ffed4620b", "7853ec59-161c-4a18-a36f-1fa4f3a97a86", "9b48fe78-1133-4e60-83b5-c551785b055f", "abc2eaf4-3bb4-444d-bcbb-6dc7c8bbd84d", "dae6077e-462b-4e43-a0c4-a8a99c332c44", "f1365786-59ee-4a5c-9802-23531bcf8eaf", "ff3f9bab-a88a-4779-8078-0d310903c228"], "title": "A Semantics-Aware I/O Interface for High Performance Computing", "venue": "", "year": 2013, "id": "2742b7c8-da9c-4ad3-ac6e-3e50bf964fe5"}
{"abstract": "The implementation of information systems (IS) in organizations often triggers new situations in which users experience a disruption of existing work patterns and rou - tines. Sensemaking becomes central in making users' meanings explicit, serving as a foun - dation for further actions and interactions with the new technology. The purpose of this paper is to study how users make sense of new technologies by building on existing re - sponse repertoires. Empirically, we present findings from a study of an Electronic Patient Record (EPR) system implementation in two Danish hospital wards. Our findings illustrate: (1) how doctors' and nurses' existing routines are disrupted by the new technology, (2) how identity construction plays an important part in the users' meaning construction pro - cess, and (3) how self-fulfilling prophecies are formed as a natural part of their sensemak - ing. The study contributes to existing literature by providing a detailed account of how users' early sensemaking of a technology influences their subsequent actions and reac - tions towards it. Our findings support managers in understanding users' perceptions of a new technology, helping them in planning and executing the implementation process.", "authors": ["Annemette Kj\u00e6rgaard", "Peter Nielsen", "Karlheinz Kautz"], "n_citation": 16, "references": ["08704b8d-70a1-44b7-b7a6-ad47c0df57c1", "0fab17a5-ebb5-4355-ac60-806d89aadc70", "11b9310c-6196-4365-be6b-996f8190155f", "12d38d1c-f327-4dae-b07a-23b06f7c2362", "1a4fa108-d0f2-49ba-afe8-253e209bee26", "1ac05b3d-554f-4683-abf3-3ba893e9a3ee", "216a4d11-1668-4ac3-b15c-2da155ad2b2e", "26825da4-9fa2-4eab-81c7-492b37db22ee", "297da3bd-0f50-4f9a-a205-5d9d2d7e5537", "424d775f-b5d6-419f-a791-67e510e86e01", "428adab0-e700-410c-ab1f-07face240174", "567528b2-21b7-4b4a-94df-67a19e048d93", "65b77410-bd92-4488-bb59-a00c95a8ad50", "67b2d2c0-d122-489e-a230-525c0d4ac8c2", "743c8ca2-6dea-4182-880e-3192b8b5500a", "775d770b-3798-4c01-ae70-d50fd57a0e51", "7c714cdf-45bc-4b2f-9cb0-4b9aea28e385", "8090f2d5-0539-4015-a2ba-1f86a1bddb2b", "840b8bee-a2b8-4697-a190-705c79127f12", "907e673a-4c39-4cbb-83be-b72d18cc5338", "a850ff3f-18ce-4c49-8177-730f8e7b670b", "b21d1f58-5a83-4abd-a9c6-b603c35fa247", "b85ee069-8954-4a74-af44-16798ac16ee9", "c6ff8fa0-642f-42e9-a930-5f976d31e74c", "d21b4e5c-0621-426f-ab06-c13aec05d2c2", "d9ece8ef-bedb-47ad-9f4d-dbcd82c9e58b", "de541b93-4c8d-41ae-8c8f-d2a408124728", "e577c0ef-12bc-421a-b6d6-11a38462646c", "e75a5968-bc9b-49ae-9a56-3e5869fdd87b", "e7867800-39c6-4e63-b63b-307670bbd85f", "f0becb29-87f5-4aa8-9f59-1566237f6554", "f24ea7e0-a0e6-462a-9cb8-a208dd0417ef", "fb6843e4-d73c-4823-bbc9-67ba950dc48b", "ffc44518-aeec-49bd-88cc-dbd72d3f94f4"], "title": "Making Sense of Software Project Management: A case of knowledge sharing in software development", "venue": "Scandinavian Journal of Information Systems", "year": 2010, "id": "27461917-93ed-449b-91a8-cdbd8c37a8b7"}
{"abstract": "Software protection is one of the most important issues concerning computer practice. The problem is to sell programs that can be executed by the buyer, yet cannot be duplicated and/or distributed by him to other users. There exist many heuristics and ad-hoc methods for protection, but the problem as a whole did not receive the theoretical treatment it deserves.In this paper, we make the first steps towards a theoretic treatment of software protection: First, we distill and formulate the key problem of learning about a program from its execution. Second, we present an efficient way of executing programs (i.e. a interpreter) such that it is infeasible to learn anything about the program by monitoring its executions. A scheme that protects against duplication follows.How can one efficiently execute programs without allowing an adversary, monitoring the execution, to learn anything about the program ? Current cryptographic techniques can be applied to keep the contents of the memory unknow throughout the execution, but are not applicable to the problem of hiding the access pattern. Hiding the access pattern efficiently is the essence of our solution. We show how to implement (on-line and in an \"oblivious manner\") t fetch instructions to a memory of size m by making less than t?m? actual accesses, for every fixed ?>0.", "authors": ["Oded Goldreich"], "n_citation": 50, "references": ["29c593e2-6811-440d-b195-872b25fe4085", "48a829fd-7c8f-4bb7-b481-ae23d55570a2", "98db48cc-68f2-4464-ac90-a02fcfc37e48", "994a10f1-05ae-4daf-ad34-55c8aad137a6", "9f5c6d03-cc7f-4fea-a050-a3c7c3648711", "a662a4e7-415e-417e-8a8f-fe085d7e487f", "b2bd7e0c-7cc0-4c25-80af-c0086065192e", "e53cf47b-42d4-4624-9ea0-d1e1e9e889e7"], "title": "Towards a theory of software protection", "venue": "international cryptology conference", "year": 1987, "id": "2751c2ed-6536-426d-9669-bfdee11b3222"}
{"authors": ["Robil Daher", "Heiko Kopp", "Djamshid Tavangarian"], "n_citation": 2, "references": ["1bc94ba5-5a29-4b7a-9e2e-bee91860984e", "4d0f2c57-7f08-416a-9721-eb333c88433e"], "title": "Aktives Load-Balancing in Wireless LAN Hotspots.", "venue": "", "year": 2004, "id": "275a4557-4276-4888-8697-2af8ed74e18f"}
{"abstract": "One of the elementary tasks of an autonomous mobile robot is the execution of different behavior patterns in order to fulfill a given task. The complexity of this problem is especially high if the robot operates in a dynamic, unpredictable environment and requires the parallel control of multiple actuators. In this paper we present a novel architecture for robust and fast mobile robot control. The architecture is based on Teleo-Reactive Programs. We discuss the benefits and drawbacks of such programs, extend the basic definition for the parallel control of multiple actuators, and propose a new language and a compiler for extended Teleo-Reactive Programs. These tools simplify the creation of new behavior patterns and increase the runtime performance. Finally, we discuss implementation issues of the architecture when applying it to RoboCup Middle-Size soccer robots.", "authors": ["Gerhard Gubisch", "Gerald Steinbauer", "Martin Weiglhofer", "Franz Wotawa"], "n_citation": 50, "references": ["039ceaf4-a19a-4639-b090-f1afbdd9886f", "079090cb-9ba8-419b-845c-7cccb6039da3", "471a44d2-bd0b-429e-acdd-f804a8cb5ab7", "65c61cd4-fc36-4cf8-bc81-d423949f7a51", "87b0f6c0-e9f8-4151-946b-16166e85c8b0", "fe146c56-6d15-472c-89cc-97ea8797f9b7"], "title": "A Teleo-Reactive Architecture for Fast, Reactive and Robust Control of Mobile Robots", "venue": "industrial and engineering applications of artificial intelligence and expert systems", "year": 2008, "id": "2767f0d9-499d-45a4-b5c5-1f8b352ae197"}
{"abstract": "Semantic web technologies show great promise in usage scenarios that involve information logistics. This paper is an experience report on improving the semantic web ontology underlying an application used in expert finding. We use ontology design patterns to find and correct poor design choices, and align the application ontology to commonly used semantic web ontologies in order to increase the interoperability of the ontology and application. Lessons learned and problems faced are discussed, and possible future developments of the project mapped out.", "authors": ["Karl Hammar", "Vladimir Tarasov", "Feiyu Lin"], "n_citation": 5, "references": ["0547383e-7c8d-4823-9f41-411c3b2ed50a", "05796449-cfdd-47c8-bb6a-4893a21671b6", "42f58713-567e-46b5-9154-5bcc04add60c", "b77249b3-74d7-4a7e-b51e-444f713da184", "ba45e4ca-67e3-43bd-8767-ba5e09d2f784", "e11674df-a9b6-49e8-a097-7325a88b87cb", "f5161e98-28f5-4ff5-a5d0-dbf715b539b1"], "title": "Information Reuse and Interoperability with Ontology Patterns and Linked Data : First Experiences from the ExpertFinder Project", "venue": "business information systems", "year": 2010, "id": "276b91b1-f097-4540-9441-91c8971df390"}
{"authors": ["Changliang Li", "Bo Xu", "Gaowei Wu", "Tao Zhuang", "Xiuying Wang", "Wendong Ge"], "n_citation": 0, "references": ["12f40b38-cd99-4801-8074-d765a29a2101", "492f4525-17a3-43b4-88cc-2cb691dad52b", "6609ae2b-11c2-4da2-97c3-a77b29aabbcc", "67e6d747-520d-4853-8fbe-cb06c95648df", "998e48b9-7d74-42c5-ac15-a0cd80c345b0", "af421dd3-1938-4035-9182-2d3a9e573b14", "cfc571c4-574d-4835-ac41-ead585c71d29", "e45a03a2-923b-40d7-8ad9-f60b0fe9c5f8"], "title": "Improving Word Embeddings via Combining with Complementary Languages", "venue": "canadian conference on artificial intelligence", "year": 2014, "id": "2790c9b3-0af6-41e4-b518-ded06c43fab1"}
{"authors": ["Ben C. F. Choi", "Zhenhui Jack Jiang"], "n_citation": 50, "title": "Responses to Social Predicament on Online Social Networks", "venue": "", "year": 2013, "id": "2793c39d-1f1f-4949-b306-5fa7dcf3325f"}
{"authors": ["Cl\u00e9ment Gosselin", "Alexandre Lecours", "Thierry Lalibert\u00e9", "Fr\u00e9d\u00e9ric Lessard"], "n_citation": 50, "references": ["5892576f-b7e1-4731-b72f-9a25317de941", "72a84f6a-9512-4b90-8372-c01e8f23a8af", "88fe2b9c-a834-4f95-80b5-655d3e582973", "c4751b44-3f27-45d7-aa8f-b4d89dbd2fae", "d2ed3d30-aab3-4d43-ba91-a6beb8460a6b", "f8d1f604-fb80-49e3-b23d-e1c005df1123", "fd40e527-dec1-435c-ab0f-8d31de40efdc"], "title": "On the Development of a Programmable Inertia Generator", "venue": "international symposium on experimental robotics", "year": 2013, "id": "27ae1bc8-59f4-4d8d-8378-c3c3096dc76b"}
{"authors": ["Tinyee Lo", "Man-Wai Mak", "Kwok-Kwong Yiu"], "n_citation": 10, "references": ["3f44a107-c786-4975-9419-c0ad7472b099", "b0599338-dfb3-4436-b3cc-d37d9f7a7b43", "ef791953-a3e2-415e-8bbd-f4915e4dda13", "fc95b916-1e4d-4c45-862c-dd34a49e64ad"], "title": "A new cepstrum-based channel compensation method for speaker verification.", "venue": "", "year": 1999, "id": "27bfa330-2388-4c8a-91a1-e30f3567d441"}
{"authors": ["Monika Joshi", "Hui Wang", "Sally I. McClean"], "n_citation": 0, "references": ["10918bbc-f3c5-4a70-88ef-ddbf34910b66", "164b9736-d261-4c8a-8a9a-2d92c3c5cd1d", "17de24ee-0ac2-447a-ac2b-6cd87c78ebd8", "3268d2e1-c734-4618-910c-15302ba3e953", "5a8ab00d-04e1-40a7-80d1-8a9c71507e5a", "5cf21bc5-1d26-4705-9b59-0a6200928a9f", "66006e2a-ee44-404a-8059-631502b2ad9a", "7f5a7de9-bc3e-4a0f-b265-9d9092a4f45e", "86c14857-9251-40e0-9a75-31d9e0c3aac0", "a583695f-cf27-4c65-92c8-21d32f7af950", "ae3e4165-4d66-4256-a3d7-f69de72d28be", "b4e7ea0e-5a1b-45a7-8ca8-4c3a7d7520b0", "b89fbbce-9288-4dae-8156-a2aa5ee746a8", "cf1c5485-0dc2-4ab8-9af6-c494443324c9", "dbe03b4f-3042-4e80-97e0-81a0f72e72b8", "ec217317-bfc6-4548-9204-b1134b5a50ba"], "title": "Generating Object-Oriented Semantic Graph for Text Summarisation", "venue": "", "year": 2014, "id": "27c29b3b-98e0-44bc-beb9-84dfe5d1ea33"}
{"authors": ["Stephen Ades", "Roy Want", "Roger Calnan"], "n_citation": 50, "title": "Protocols for Real Time Voice Communications on a Packet Local Network.", "venue": "international conference on communications", "year": 1986, "id": "27cdbaed-03dd-4510-8510-0b7dd7fe092a"}
{"authors": ["Peter Linz", "R. L. C. Wang"], "n_citation": 50, "references": [], "title": "Irregular Solutions of an Ill-Posed Problem.", "venue": "conference on scientific computing", "year": 2006, "id": "27cf8afb-c254-42f5-b11b-21794f4cec8a"}
{"authors": ["B. Richards", "Diana Khoury"], "n_citation": 0, "title": "The Use of a Touch-screen Computer for Dental Charting", "venue": "medical informatics europe", "year": 1991, "id": "27d98b84-4c4a-454a-9b56-018420ddee15"}
{"authors": ["Matthieu Exbrayat", "Lionel Martin"], "n_citation": 0, "title": "Explorer3D: classification et visualisation de donn\u00e9es.", "venue": "", "year": 2009, "id": "27dbe99d-543e-4452-9ae0-a976365913c2"}
{"abstract": "The literature suggests that business-IT alignment is an important antecedent of IS success, business process performance, and competitive advantage. Additionally, IT governance practices are highlighted as being instrumental to fostering business-IT alignment. In this paper, we derive various IT governance practices (in terms of structures, processes, relational mechanisms, and enterprise architecture characteristics) from literature and expert interviews. While prior investigations only considered the effect of such practices on strategic business-IT alignment, we also incorporate alignment at operational level. Using results from a case study in the IT services division of a large multi-national, multi-divisional company acting in diverse industries we highlight the effect of various IT governance practices and offer new insights by showing which mechanisms are effective in facilitating strategic or operational business-IT alignment. Our results indicate the most important practices for both strategic and operational alignment.", "authors": ["Frank Schlosser", "Heinz-Theo Wagner"], "n_citation": 6, "references": ["0f95bfbb-6fe0-487f-ae7e-cef09262d3b4", "10b24f7a-01d2-446e-b35e-1ddc0c592c17", "2819d0c5-ecb8-47bf-a039-6ae12e308990", "33a355b2-0bfd-4ad2-ad35-fdad404320b6", "4c362a72-93f6-466a-932a-894a2a7e21cc", "5e6ba10f-32c8-45c5-8e2d-52f5fc53c5f5", "6158ca0b-ee8e-43c2-b896-b0b93f08c39f", "64a8dbbf-7e6c-4fb8-8905-c0e3f482345f", "6a281c66-0156-48fe-93b4-0ecf7eb59ed5", "73d60330-2c02-43d2-8552-0438748a0364", "75aa36b5-c66d-4269-adf6-efae9ad1da44", "7bb8cdec-c00f-46a9-ae1e-80af777ff347", "7f39e3c4-82f1-4a9a-b4ab-29130826e373", "8d2d7baf-b156-4e61-b13f-8a07d4180a65", "90c732ce-9365-486e-bd5a-be52236504f7", "9a8d1944-bbbc-42cf-baca-b2f6a176f90f", "9da39d15-65c3-4eee-a208-fac0547a2db8", "a323c213-137f-429e-8476-b61ab2feb598", "b1ee7315-9410-43c1-b4de-d2269ede2d63", "ba361ed3-8325-4c97-ab0c-ddeb101dc6e2", "bb5cdc94-da2e-4fd9-b0a8-6465f3ede1ca", "c37fff00-dc07-4cbe-a4b2-3925b506a507", "c933ccc2-92df-4fb9-8412-4f1d10fa676f", "e1762b5c-6758-4cc9-a62c-2f58fd8f054d", "e34fa5fe-b8ef-4198-a709-138ca6340ba6", "feb84715-8166-4c1a-a051-435119d5b31c"], "title": "IT GOVERNANCE PRACTICES FOR IMPROVING STRATEGIC AND OPERATIONAL BUSINESS-IT ALIGNMENT", "venue": "pacific asia conference on information systems", "year": 2011, "id": "27e35413-71c6-46e0-840b-9f4279203215"}
{"abstract": "Developers of ontologies and Semantic Web applications have to decide on languages and environments for developing the ontology schema, asserting statements, specifying and executing queries, specifying rules, and inferencing. Such languages and environments are not well-integrated and lack common abstraction mechanisms. This paper presents a concept framework to alleviate those problems. This is demonstrated by a complex sample application: reasoning over business process models.", "authors": ["Bernhard Humm", "Alexey Korobov"], "n_citation": 50, "references": ["3f082b15-f86f-47bc-92d4-65a8c6cbe50a", "b453a0cf-4987-4de6-87f0-e9ad85f9a2dc", "ba413c68-f64d-4a92-852f-d3f2855ed0d6", "c65c869b-7322-475f-bfdf-77bcd1f96348", "f26f1cdc-be80-426a-a05d-d4fdb7ff8ff2"], "title": "Introducing layers of abstraction to semantic web programming", "venue": "", "year": 2011, "id": "27e58372-99b8-4275-84ef-8255a7baf189"}
{"authors": ["Chiemi Kamakura", "Yuka Shimajiri", "Hirohisa Seki", "Hidenori Itoh"], "n_citation": 0, "title": "Efficient Transformation for Bottom-up Computation of Stable Models.", "venue": "", "year": 1997, "id": "27e65646-c081-4bec-b4de-9f9bf4ec9d76"}
{"authors": ["Davor Petrinovic", "Davorka Petrinovic"], "n_citation": 3, "title": "Sparse vector linear prediction matrices with multidiagonal structure.", "venue": "", "year": 1999, "id": "2806ae16-7dc7-4919-a929-b44e7d2cbe14"}
{"authors": ["Kazuyuki Takagi", "Shuichi Itahashi"], "n_citation": 2, "title": "Prosodic pattern of utterance units in Japanese spoken dialogs.", "venue": "conference of the international speech communication association", "year": 1994, "id": "2820cbc6-b355-46d3-976e-ee6cadeb055b"}
{"authors": ["Elmer P. Dadios", "Patrick S. Fern", "ez", "David J. Williams"], "n_citation": 18, "title": "Genetic Algorithm On Line Controller for the Flexible Inverted Pendulum Problem", "venue": "Journal of Advanced Computational Intelligence and Intelligent Informatics", "year": 2006, "id": "2829ed0a-58a8-425d-9376-87dcfcc1394f"}
{"abstract": "Modern process control systems are increasingly vulnerable to subver- sion. Attacks that directly target production processes are difficult to detect because signature-based approaches are not well-suited to the unique requirements of process control systems. Also, anomaly detec- tion mechanisms have difficulty coping with the non-linearity of indus- trial processes. This paper focuses on the problem where attackers gain supervisory control of systems and hide their manipulations in signal noise or con- ceal computational states. To detect these attacks, we identify suitable proxy measurements for the output of a control system. Utilizing control laws, we compare the estimated system output using real-time numerical simulation along with the actual output to detect attacker manipula- tions. This approach also helps determine the intervention required to return the process to a safe state. The approach is demonstrated using a heat exchange process as a case study. By employing an explicit control model rather than a learning system or anomaly detection approach, the minimal requirements on proxy sensors and the need for additional sensors can be characterized. This significantly improves resilience while minimizing cost.", "authors": ["Thomas Richard McEvoy", "Stephen D. Wolthusen"], "n_citation": 8, "references": ["20ac1cd9-0e66-48cf-9359-d6e5f1f658b0", "58dba14e-f175-49da-9f4a-573eaf9d81cc", "6be3e168-be3f-4608-abdc-1a09827a291c", "98f22c3c-bd81-40bd-b241-af669d4fe17f", "a3fa54b2-45fa-403c-a456-29275d711a1b", "bc9d455e-5d57-4fea-bf34-ab0b28d7599d"], "title": "Detecting Sensor Signal Manipulations in Non-Linear Chemical Processes", "venue": "", "year": 2010, "id": "2831c4c8-697d-499f-9e75-d339bf6cb051"}
{"abstract": "In this paper we develop and implement a parallel algorithm for a real-world application: finding optimal designs for multiproduct batch plants. We describe two parallelization strategies - for systems with shared-memory and distributed-memory - based on the branch-and-bound paradigm and implement them using OpenMP (Open Multi-Processing) and MPI (Message Passing Interface), correspondingly. Experimental results demonstrate that our approach provides competitive speedup on modern clusters of multi-core processors.", "authors": ["Andrey Borisenko", "Philipp Kegel", "Sergei Gorlatch"], "n_citation": 50, "references": ["334e7c90-7cc1-4737-9e35-6579b28d14b6", "33d41fc7-5305-4164-9f06-5de1882380e2", "35d2ba29-2ca5-41bc-853a-3b4d1d8aa5c8", "36e2ddb1-28af-45ad-860e-225e8e05ba18", "3c33b883-0158-4451-845e-44fd9d8fe3b2", "60215fd4-05c8-4246-9c05-4380ce40346a", "771af850-895d-49f7-b02c-d8c9a466bdd2", "bb1945f6-6e79-4e44-9ffa-15e709b7382d", "dedbf3b5-a54a-4a08-b515-eb0b06bdb62d", "fc7802ef-d4b7-43a5-9033-20fe2a4c1304"], "title": "Optimal design of multi-product batch plants using a parallel branch-and-bound method", "venue": "parallel computing", "year": 2011, "id": "287c7e1c-eff6-4d47-82fc-9a6ebdafb448"}
{"authors": ["Adam Tinniswood", "Michael Pernice", "Cynthia Furse"], "n_citation": 0, "title": "Large-Scale Parallel Simulation of Bioelectromagnetic Interactions.", "venue": "", "year": 1997, "id": "288a7556-feac-4801-98e1-714f684aa87f"}
{"authors": ["Marco Alberti", "Marco Gavanelli", "Evelina Lamma", "Paola Mello", "Paolo Torroni"], "n_citation": 17, "references": ["113c4f39-7e28-44f3-81c5-44983e52c5b5", "119488d7-1070-4662-8980-118d452a23cd", "145f59dd-9863-488c-b958-68faf467b3d8", "4ac3f993-0e08-4a64-85f2-2d16a105c81f", "4f74386d-50c4-41c7-89c8-e0893e22c6a1", "5a568ce9-f7db-4f4c-a604-094cb719e5b4", "6dcf9f47-7a83-40b6-890b-9f6bc8585986", "7804b282-147d-4804-a663-c2f726179127", "8c77e418-03d7-456b-a635-f041fa2b4aeb", "a5f0b6b7-e9ea-4bc4-a793-56aba16b5d56", "ac2f9102-e02d-4cea-b059-bfc0172288ae", "c24278c4-5209-47b5-b2b8-11f0684f1d64", "c5092b7b-aca1-4346-a34a-8bf6c572607a", "cf93b634-f7ce-4053-ae41-e3846c726adf", "d1e201a8-e697-42f4-9e72-63ee73d8e38c", "de2f7f59-c726-49de-9417-9cf17a345724", "e07fc98c-4373-47b4-a485-20fa1569721a", "ee7eab43-d5fa-4911-ad83-7e1b5429cc50", "fad120ec-01d4-4642-89aa-3174ba78bb0a"], "title": "Abduction with hypotheses confirmation", "venue": "international joint conference on artificial intelligence", "year": 2005, "id": "2895fd07-9732-47d5-9f4b-4bd134dad450"}
{"abstract": "Self-regulated learning (SRL) involves a complex set of interactions between cognitive, metacognitive, motivational and affective processes. The key to understanding the influence of these self-regulatory processes on learning with open-ended, non-linear learning computerbased environments involves detecting, capturing, identifying, and classifying these processes as they temporally unfold during learning. Understanding the complex nature of these processes is key to building intelligent learning environments that are capable of adapting to the inherent fluctuations in learners' SRL processes and emerging understanding of the embedded educational content and related disciplinary knowledge. Recent developments in the use of and advances in the design of artificial pedagogical agents have begun to address these issues. However, we are still experiencing major theoretical, conceptual, methodological, and analytical challenges that may impede our ability to design more intelligent agents that are effectively and reliably able to detect, model, and foster learners SRL processes during learning. As such, the foci of this presentation are to: (1) introduce the complexity of SRL with current intelligent agent systems, (2) briefly present a hybrid theoretical model of SRL and describe how it can be used to analyze the temporally, unfolding sequences of processes during learning, (3) present and describe sample data to illustrate the nature and complexity of these processes and the various challenges they pose for designers and learners, and (4) present challenges for future research that combines several techniques and methods to design pedagogical agents and intelligent learning environments that effectively and reliably trace, model, and foster SRL.", "authors": ["Roger Azevedo"], "n_citation": 50, "title": "Can we design artificial pedagogical agents to be intelligent enough to detect, model, and foster regulatory learning processes?", "venue": "", "year": 2011, "id": "2897d44a-b32b-4797-ad68-d689b603d369"}
{"authors": ["Abdallah Mohamed", "G\u00fcnther Ruhe", "Armin Eberlein"], "n_citation": 50, "title": "Towards a customizable approach for COTS selection.", "venue": "", "year": 2004, "id": "28a04246-90b0-446d-bec6-5bf66ec15eb1"}
{"authors": ["Hajer Ben-Romdhane", "Sihem Ben Jouida", "Saoussen Krichen"], "n_citation": 0, "references": ["063bb0da-d16a-4a8b-b495-aa2c9e104d4f", "0e845e99-da65-4a62-b0a0-c5e69d24bab0", "1f51e631-3b5c-4c22-a22d-649d8fdeec41", "2f692dbb-0b06-49a3-92f7-77f60dd0732a", "44d2ef4f-67dd-40b7-a8a5-c69bb37b50b9", "45a95aaf-b026-4dd4-8ed9-7d62b2e8629c", "537c5c37-0c57-4eb1-81c5-ad3f69284d65", "6e2ee924-d893-4376-bed4-c6e32e9a482d", "802ccedc-f599-44fd-a64c-09d80b0699fa", "986ae107-bef2-421f-8190-2f8273ed0e2c", "b1bf880b-137d-46fd-9c62-f53f2320375f", "d8db8de8-773d-4e26-b75a-60585e4d99d4", "e6ef4ecc-95bc-49de-a0b3-d4964d462bfc"], "title": "A Dynamic Approach for the Online Knapsack Problem", "venue": "modeling decisions for artificial intelligence", "year": 2014, "id": "28a044ea-6e17-47cd-adb3-bd17be6bf3dc"}
{"authors": ["Patrice Buche", "Ollivier Haemmerl\u00e9"], "n_citation": 2, "references": ["1b978417-c775-4777-bad6-ee3ee15f2025", "268ed7b1-3a26-452e-a5e5-1031c68a6e26", "271a69ab-de56-4fc7-993b-9704049c810d", "730919a6-2f4d-427b-a3b2-fd6a44df04c6", "74ac48a7-0959-4d9e-a346-eaa851b78f9e", "900cd613-0ff4-4453-b4af-649960db47c3", "b673e6cd-dae2-4b66-b58e-00e4d6d9e06e", "e618a577-052a-43f1-92d0-d06323fbf52e", "e6f52274-8f92-45ef-a4c0-80991026868e", "ef78330f-d706-48b4-a37d-4a971ab0c1d5", "f004d32f-45ae-4e3b-aa68-2ead10740b13"], "title": "Vers un syst\u00e8me unifi\u00e9 d'interrogation de donn\u00e9es impr\u00e9cises structur\u00e9es et semi-structur\u00e9es utilisant des vues floues.", "venue": "", "year": 2000, "id": "28b56cb5-937e-4bf4-a62d-34c1a742b8b7"}
{"authors": ["Y. C. Nuckchady", "Jyrki Nummenmaa"], "n_citation": 0, "references": [], "title": "An architecture for building collaborative tools in Java.", "venue": "", "year": 2003, "id": "28b7a147-0f2e-404b-bdf9-7318c613b80d"}
{"authors": ["Fran\u00e7ois-Xavier Jollois", "Mohamed Nadif"], "n_citation": 0, "title": "Clustering and assessing the number of clusters with accelerated EM variant.", "venue": "research challenges in information science", "year": 2007, "id": "28e77bcc-be4d-462f-95af-7af09eb47fb2"}
{"abstract": "This paper describes the evaluation of the system for selective dissemination of Broadcast News that we developed in the context of the European project ALERT. Each component of the main processing block of our system was evaluated separately, using the ALERT corpus. Likewise, the user interface was also evaluated separately. Besides this modular evaluation which will be briefly mentioned here, as a reference, the system can also be evaluated as a whole, in a field trial from the point of view of a potential user. This is the main topic of this paper. The analysis of the main sources of problems hinted at a large number of issues that must be dealt with in order to improve the performance. In spite of these pending problems, we believe that having a fully operational system is a must for being able to address user needs in the future in this type of service.", "authors": ["Isabel Trancoso", "Jo\u00e3o Paulo Neto", "Hugo Meinedo", "Rui Amaral"], "n_citation": 50, "references": ["4aa4a890-2793-4a80-933c-a8787d37a8cc", "926a7b48-5990-474e-917c-7ccd5a2ecb51"], "title": "Evaluation of an alert system for selective dissemination of broadcast news", "venue": "conference of the international speech communication association", "year": 2003, "id": "2911b464-c802-4c4e-a56a-dfd193e4d31d"}
{"abstract": "The power of mobile devices has increased dramatically in the last few years. These devices are becoming more sophisticated allowing users to accomplish a wide variety of tasks while on the move. The increasingly mobile nature of business has meant that more users will need access to spreadsheets while away from their desktop and laptop computers. Existing mobile applications suffer from a number of usability issues that make using spreadsheets in this way more difficult. This work represents the first evaluation of mobile spreadsheet applications. Through a pilot survey the needs and experiences of experienced spreadsheet users was examined. The range of spreadsheet apps available for the iOS platform was also evaluated in light of these users' needs.", "authors": ["Derek Flood", "Rachel Harrison", "Kevin McDaid"], "n_citation": 50, "references": ["2102c5a7-8e0c-4ba2-afa4-e37ba60705d5", "31907400-7900-4f88-9f8c-2aa8a9e2bc5f", "3ae230fe-d17e-4992-a3ce-b3cd26382990", "7e371fcc-59b1-4ac4-a4fd-d3bcb8628412", "8ac25166-d692-4b2f-9461-ab5e1f16bb43", "c0efc8b0-a488-463e-94b8-ee55df1e08bd"], "title": "Spreadsheets on the Move: An Evaluation of Mobile Spreadsheets", "venue": "arXiv: Human-Computer Interaction", "year": 2011, "id": "292a2549-24ab-460b-94b0-cdce398d6ef3"}
{"authors": ["Ruxandra Vr\u00e2nceanu", "Corneliu Florea", "Laura Florea", "Constantin Vertan"], "n_citation": 50, "references": ["000c8c4a-405e-4da2-8c2a-1337038729aa", "161c96a7-6dd3-4d9f-bc40-e06c21d9b6d8", "271ceb3a-d4d3-4d50-95c1-8ac8199f3724", "3a8fbc53-3805-4e6f-9f45-6881b640eb5e", "4509ba68-a534-4b7c-8de9-72e91083a982", "5f93b590-b0d1-4406-94a3-34e51e7f058b", "6a8c159e-174b-4ba2-8ea0-694957f80202", "78c995b4-f5e5-4042-b1f1-63c8db6a4cff", "88339c9a-620d-42ed-a63a-788f883019ca", "8b8a2247-bd77-4736-b493-449734f56b9a", "c8f80ea6-4602-458c-9a70-daf1c646c89b", "ee5f5477-295f-4cb7-99b9-2e612aa86f5f", "f7c6e3b6-7de4-4555-9b0d-91679107be76"], "title": "NLP EAC Recognition by Component Separation in the Eye Region", "venue": "computer analysis of images and patterns", "year": 2013, "id": "29316d7b-973b-4560-a988-5925bcde4146"}
{"authors": ["Orly Kremien", "Michael Kemelmakher", "Irit Eshed"], "n_citation": 0, "title": "Preserving Mutual Interests in High Performance Computing Clusters.", "venue": "Informatica (slovenia)", "year": 1999, "id": "29338d37-0e66-4fca-a0b1-dc1ad1c03191"}
{"abstract": "Memory constitutes an essential cognitive capability of humans and animals. It allows them to act in very complex, non-stationary environments. In this paper, we propose a perceptual memory system, which is intended to be applied on a humanoid robot learning affordances. According to the properties of biological memory systems, it has been designed in such a way as to enable life-long learning without catastrophic forgetting. Based on clustering sensory information, a symbolic representation is derived automatically. In contrast to alternative approaches, our memory system does not rely on pre-trained models and works completely unsupervised.", "authors": ["Marc Kammer", "Marko Tscherepanow", "Thomas Schack", "Yukie Nagai"], "n_citation": 50, "references": ["07d4517f-1b9d-450c-ba1a-ec9efcf1f2fa", "39937da7-eefe-4db3-9a2a-de8501d6324f", "3d647129-3e34-4098-b06b-0996f405a9f8", "53d18f24-6b72-4235-a59b-44b24be0bf8b", "5f32771f-97b6-420d-abd2-732ceb21f610", "74cb8336-e1d4-4318-8936-aa520ef6ca88", "c6fd6ff6-0227-46ed-ae7c-aae50246e7cd", "cc40d181-8c1b-4e12-a577-d02782c5995f", "d3fa1c31-9417-47ca-a284-8d4565361071", "e6a85fa1-05dc-4a96-a79a-bf9ae4517c8a", "e7f62791-828a-42fa-8244-ba261aa65d91", "f0c872b6-3b91-45da-82fb-3a7eeec6952a"], "title": "A perceptual memory system for affordance learning in humanoid robots", "venue": "international conference on artificial neural networks", "year": 2011, "id": "295be87f-f3dd-4fa2-8cc4-873f71674326"}
{"abstract": "In this paper we investigate the potential use of GeneticProgramming for the solution of the one-machine totaltardiness problem, which has been the subject ofacademic research for almost four decades. To ourknowledge, no previous effort has been made to solvestatic scheduling problems in a GP-framework, in contrastto other evolutionary computation techniques that havebeen extensively used for this scope.", "authors": ["Christos Dimopoulos", "A.M.S. Zalzala"], "n_citation": 50, "references": [], "title": "Evolving scheduling policies through a Genetic Programming framework", "venue": "genetic and evolutionary computation conference", "year": 1999, "id": "29970e95-9b05-4236-ace7-820ec361984d"}
{"authors": ["Marco Calautti", "Sergio Greco", "Cristian Molinaro", "Irina Trubitsyna"], "n_citation": 5, "references": ["08cf4cec-baa2-4e6f-8937-b3e3c30e34bc", "090ca0a8-c748-4bc9-ae20-467eee5705fd", "12667a29-14c4-453f-9e61-31478ed9046b", "2a1bf3de-604e-4efb-b742-b3d9f755460d", "30781d96-acc1-4418-9525-e46cdfacb1fa", "35e566b1-e6ad-48b5-b2b2-1a6f2e5635c2", "5265e583-232b-4ce3-8b3c-bf9a6ff7591e", "58c12637-335e-4f0e-bb51-e7cb05cd6d79", "6033423c-3ab0-40fc-93bc-6c3e7e452339", "6ce4bf41-18d5-402f-90da-cb690dcfd8d7", "7241e91a-eac1-494d-8ea8-16fbb20d1039", "879f371f-443c-44f2-92df-b42006ec59f0", "88934332-dc49-4117-8668-3f28994b1417", "898e85fe-0e6e-4ed4-8dad-94932263ac65", "8b4a690a-e70a-4b35-a390-acdf0bce6fb1", "8c58f42e-83e8-4262-936d-9a0d1e4c93bc", "8d5f87fa-7730-45d9-be3e-9422dc34a9bc", "8f93bfa8-5f26-4083-a226-a95fbeaa31ea", "98bc4515-0a7e-4a11-b01e-2a3f971d7d6a", "9c54153f-bf14-44d9-9edd-56e1ecefe86b", "aab100c3-0570-4aed-8cc4-9e64f8045993", "b23d33fa-3920-4bc0-b868-3d9687ee8dce", "b54cb781-701d-4ad1-8dfd-c9b5508a8b47", "c1b6c0d9-81bf-4d21-b1ad-806421cbeb55", "c5bd5414-dc86-4663-bd00-521c3e94e510", "c5ddf89e-57df-4dc3-b43c-30e642db6924", "cf7a2bdf-2a81-4303-92f9-f93f02da52b1", "d1e0b16b-711a-4b27-aa23-344813f8ac18", "d4219c7c-0258-41a4-9d3d-93a806e84aef", "db0df7c2-fccf-4fa5-b4dc-245c5460cbbe", "db658327-1f48-4f80-8f7d-09d88096f297", "e22908da-10e5-49ec-93ed-2d7b1e1e8da3", "ec3ac88c-dede-4db4-9fef-998ac7e002dc", "f6d48b7b-aceb-474e-9700-44b0dc83e0e7", "fa2884a1-3777-4683-adb1-4edd4497c479"], "title": "Checking Termination of Logic Programs with Function Symbols through Linear Constraints", "venue": "rules and rule markup languages for the semantic web", "year": 2014, "id": "29a7caa9-086a-4615-8d93-9992859a2c04"}
{"abstract": "We consider the problem of scheduling n jobs with release dates on m identical parallel batch processing machines so as to minimize the maximum lateness. Each batch processing machine can process up to B (B < n) jobs simultaneously as a batch, and the processing time of a batch is the largest processing time among the jobs in the batch. Jobs processed in the same batch start and complete at the same time. We present a polynomial time approximation scheme (PTAS) for this problem.", "authors": ["Shuguang Li", "Guojun Li", "Shaoqiang Zhang"], "n_citation": 13, "references": ["62ac32e5-6768-466f-a1e3-b91f53557e54", "a513aa57-b9bb-4c90-82a7-6bada833af16"], "title": "Minimizing maximum lateness on identical parallel batch processing machines", "venue": "computing and combinatorics conference", "year": 2004, "id": "29c3059b-4841-4559-969f-09b06c3900ea"}
{"authors": ["Takahiro Urano", "Shun'ichi Kaneko", "Takayuki Tanaka", "Munetoshi Imada"], "n_citation": 4, "title": "Using Orientation Code Difference Histogram (OCDH) for Robust Rotation-invariant Search.", "venue": "Journal of Machine Vision and Applications", "year": 2005, "id": "29f60133-4f37-48bc-9d43-ed52c9678860"}
{"abstract": "Planetary gear reducer has a lot of advantages, such as high transmission and efficiency, compact structure, and has a variety of applications in construction machinery and equipment, hoisting and conveying machinery and so on. The optimization design of the planetary gear train could make the volume at minimum(as well as the weight at minimum) under the conditions of carrying capacity. This paper focus on the optimization of two stage planetary gear train with the differential evolution algorithm, based on Mathmatica. The author established mathematical model and source program is present in this paper. After the optimization, the author verifies the optimal result, including the contact fatigue stress and tooth bending strength fatigue stress. The verification infers that the optimization based on Mathmatica with differential evolution algorithm is effective and correct.", "authors": ["Tianpei Chen", "Zhengyan Zhang", "Dingfang Chen", "Yongzhi Li"], "n_citation": 0, "references": [], "title": "The optimization of two-stage planetary gear train based on mathmatica", "venue": "international conference on pervasive computing", "year": 2012, "id": "2a1f0f85-0d07-4f4b-bff2-95e9d3fef18b"}
{"abstract": "This paper is devoted to the evaluation of quantified statements in flexible querying of relational databases. Its contribution is a new approach based on the arithmetic on fuzzy numbers (\u2115f, \u2124f, \u211af) expressing well-known but gradual numbers. The advantage of this proposition is that no particular assumption is made on the monotonicity of the linguistic quantifier. In addition, this approach is a generalization of the OWA-based evaluation.", "authors": ["Ludovic Lietard", "Daniel Rocacher"], "n_citation": 5, "references": ["66c41ef7-bdd6-4815-b933-cf6e2a120765", "86d86a0c-fab3-423d-b9e1-16057c039c54", "bccbac77-22e8-49d7-a03f-9eb037104605"], "title": "A generalization of the OWA operator to evaluate non monotonic quantifiers.", "venue": "", "year": 2005, "id": "2a5a226e-4f16-4d74-b6d5-979e681f4718"}
{"authors": ["Franz Baader", "Carsten Lutz", "Boontawee Suntisrivaraporn"], "n_citation": 72, "references": ["5dff42ad-e16b-4b6a-bce3-fe808d109177", "69493f95-7d9b-48b5-b98f-9652f82a3c9a", "71b16787-aa28-42ee-8713-43a33f80c6b8", "8b852cd4-961e-42d5-a068-2e35844bca67", "b63992f7-e438-4875-bd97-903f0eb76098", "c83a138c-0463-4120-bd9c-059607f0c9a8", "dfe63c5d-9f89-466d-92f9-2995338a1965"], "title": "Efficient Reasoning in EL", "venue": "", "year": 2006, "id": "2a66502d-1856-4421-b511-f8cc861a73f5"}
{"abstract": "In this article, we show how to compute the width of a dynamic set of low-dimensional points in the streaming model. In particular, we assume that the stream contains both insertions of points and deletions of points to a set  S , and the goal is to compute the width of the set  S , namely the minimal distance between two parallel hyperplanes sandwiching the point set  S .   Our algorithm (1 p e) approximates the width of the set  S  using space polylogarithmic in the size of  S  and the aspect ratio of  S . This is the first such algorithm that supports both insertions and deletions of points to the set  S : previous algorithms for approximating the width of a point set only supported additions [Agarwal et al. 2004; Chan 2006], or a sliding window [Chan and Sadjad 2006].   This solves an open question from the \u201c2009 Kanpur list\u201d of open problems in data streams, property testing, and related topics [Indyk et al. 2011].", "authors": ["Alexandr Andoni", "Huy L. Nguy\u00ea\u0771n"], "n_citation": 0, "references": ["04d59cae-87b1-4706-9f5f-009ee3e94626", "228e0750-0bd6-48a9-af4c-d9ff5a4d4dc4", "241824b5-a126-4367-893f-1d5c1173fe2b", "40068678-5b84-49ec-9e61-2ccf3bc3a0da", "4b89450e-fa9f-44b8-916b-11858e03931f", "545f2a54-d33c-466c-8459-684884d4cc87", "a72a1bab-08b9-490f-a706-f5011f0b90e5", "bd946072-288a-4c6b-ae2c-d08238ab29aa", "e04e026f-69b0-4137-b63b-9029f68fd848"], "title": "Width of Points in the Streaming Model", "venue": "symposium on discrete algorithms", "year": 2016, "id": "2a68616f-ae27-46aa-8d7b-292a23e3291f"}
{"abstract": "The beeping channel model is a multiple access channel (MAC) model where active nodes can only send/hear a \"jamming\" signal (i.e. a beep) through the communication channel in each time slot [2]. A listening node hears a beep signal if at least one node is beeping; otherwise it hears nothing. The beeping model was recently proposed to model carrier-sensing-based wireless communication [2], and the Delta-Notch signalling mechanism between biological cells [1]. The motivation of our work, however, is to design efficient digital circuits. It turns out that the beeping channel model well characterizes the behaviors of a group of sequential logic modules connected by a logical-OR gate. A strictly synchronized global clock is available in such a circuit. In a clock cycle, a high electrical level in each input wire of the OR gate corresponds to the choice to beep made by the module connecting to this input wire while a low level corresponds to the choice not to beep. The output of the OR gate is wired back to each module as the source signal in the next cycle. We focus on deterministic protocols, which is preferred in hardware design and other applications requiring safety guarantee.", "authors": ["Bojun Huang"], "n_citation": 0, "references": ["16832cf9-de66-497a-9255-e65590480e34"], "title": "Brief announcement: deterministic protocol for the membership problem in beeping channels", "venue": "international symposium on distributed computing", "year": 2012, "id": "2a6ca585-e468-4df6-a9d6-236ee0a5472d"}
{"authors": ["Joon-Min Gil", "Chong-Sun Hwang"], "n_citation": 1, "title": "A Location Area Partitioning Strategy Using Genetic Algorithms for Mobile Location Tracking.", "venue": "Applied Informatics", "year": 1999, "id": "2a700ac8-3363-4032-9a7d-66c1b81622b8"}
{"authors": ["Christoph Appel", "Thomas Jungbluth", "Eberhard Hartung"], "n_citation": 0, "title": "LEIA - low-end image analysis to continously monitorgrowth and body conformation of fattening pigs.", "venue": "", "year": 2007, "id": "2a97f2d1-8058-405a-b929-5bb6ee412f2c"}
{"abstract": "This paper presents a method to analyse the consistency and completeness of process models according to the principles of the \u03c8-theory and the underlying concept of business transaction. Transactions specify the collaborative behaviour between actors while services are being requested and provided. The method assesses the consistency of a process in terms of the business transactions that can be inferred from it. To do so, it takes as input a process model that is converted to a transactional model. The transactional model is then analysed and revised so that all transactions become consistent and complete according to the transactional pattern. This enables to identify the problems on the original process model and to prompt areas of improvement.", "authors": ["Artur Caetano", "Aur\u00e9lio Assis", "Jos\u00e9 Luis Borbinha", "Jos\u00e9 Tribolet"], "n_citation": 50, "references": ["3e497d78-896d-45ae-9907-2b9981af2aa3", "3f1f916d-3bcb-433b-8998-a4c37880169f", "5775011f-8d79-4ff8-8fe5-f7d0140ef4ec", "af13a3af-1d11-47e7-a490-ea8d963a0d01", "b50afbf8-f529-4b7d-8906-57fbc805349f", "bda27a55-b13d-441b-adb8-4880760ee326", "c9db6cfc-332d-4a6d-881a-88339dc5b61e", "e40ff5ec-f45f-4082-b5b3-cb4bda09a957", "ece087e5-170f-4ba5-a5e8-3c2bf4f29d11"], "title": "An Application of the \u03c8-Theory to the Analysis of Business Process Models", "venue": "", "year": 2013, "id": "2a9a16ed-fc94-4f66-b023-86d9410208c2"}
{"authors": ["Kazumi Kurihara", "Tomotsugu Kubota", "Yuki Imaizumi"], "n_citation": 0, "references": [], "title": "Simple and Fast Algorithms for the Optimal Design of Complex Electrical Machines", "venue": "", "year": 2010, "id": "2aaf6791-91cb-43e2-b96f-97e493748fd5"}
{"abstract": "We exploit the Justification Logic capabilities of reasoning about justifications, comparing pieces of evidence, and measuring the complexity of justifications in the context of argumentative agents. The research can be integrated into the larger context of integrating logic and argumentation. The paper introduces distributed justification logic $\\mathcal{DJL}$ as an extension of justification logic for multi-agent systems, and it also investigates the expressivity of $\\mathcal{DJL}$ for argumentative agents. Not knowing all of the implications of their knowledge base, agents use justified arguments for reflection and guidance.", "authors": ["Ioan Alfred Letia", "Adrian Groza"], "n_citation": 6, "references": ["068a42e1-8403-449f-ab27-214a6a28db21", "0a2386c7-0e3e-43f4-a60c-f0c189877e57", "1c7ddbd7-046a-4333-aa6b-c4ce698d6fad", "27bc38ae-9500-4450-a85b-98da4785c2bf", "2ee23354-e010-4b18-b10b-d6a759df47b3", "318609ea-b0a9-4167-b68a-58cad42f3739", "3efa26e5-b15a-46a2-9358-32bcafda7304", "41951c64-fafb-4922-b48b-12f17ed5ff87", "4663719b-ce58-45f8-ac70-e159aa1eaf7e", "6ac296d9-c187-47d9-8d03-8235388e3383", "906b1864-8946-4728-b5ad-1ecd614de578", "9ad87915-7668-4cde-9e92-56c646431c40", "a7c70d9d-443c-46b4-9f8f-f45e512d8c8f", "ac2ee8f2-feff-4980-8a97-d1406928fe68", "c0922087-128d-4e76-bb20-ca344c0d19e5", "f783e5b8-7fa2-4e56-b23e-48241e17250f"], "title": "Arguing with justifications between collaborating agents", "venue": "", "year": 2011, "id": "2ac325ce-bdfd-4f85-890c-24522f57daf2"}
{"authors": ["Peretz Shoval", "Judith Kabeli"], "n_citation": 2, "title": "Essentials of Functional and Object-Oriented Methodology.", "venue": "", "year": 2005, "id": "2ad034f0-ad6b-43f0-b81d-3d882485e936"}
{"abstract": "In a recent work we have proposed a comprehensive set of evaluation criteria for argumentation semantics and we have shown that none of a set of semantics including both traditional and recent proposals is able to meet all criteria. This naturally raises the question whether such criteria are actually satisfiable altogether: this paper provides a positive answer to this question by introducing a new family of argumentation semantics, called resolution-based and showing that all the desirable criteria are met by the resolution-based version of grounded semantics.", "authors": ["Pietro Baroni", "Massimiliano Giacomin"], "n_citation": 28, "references": ["1c7ddbd7-046a-4333-aa6b-c4ce698d6fad", "4b16b37a-9578-4606-a9b2-b84145d99ca1", "6590e815-58f7-4c8f-98b9-7559c26b0407", "6e45b9c2-729f-4a7d-912e-9d62b7e23b84"], "title": "Resolution-Based Argumentation Semantics", "venue": "computational models of argument", "year": 2008, "id": "2af4e55e-8117-452a-b0b5-b274a1cc7980"}
{"authors": ["Raul Murillo-Garcia", "F. Womle", "Brian G. Stewart", "D.K. Harrison"], "n_citation": 0, "title": "Hard real-time control using simulink target for real-time linux", "venue": "International Journal of Computers and Their Applications", "year": 2004, "id": "2afc48d8-e291-4af1-ae72-e9d6736cf728"}
{"authors": ["Heiko Kern", "Holger Krem\u00df", "Stefan K\u00fchne"], "n_citation": 0, "title": "Modellinteroperabilit\u00e4t zwischen Microsoft Visio und Eclipse EMF als Mittel zur modellgetriebenen Integration.", "venue": "", "year": 2009, "id": "2b00fdf5-c75c-47a4-8881-1aacaa4757f2"}
{"authors": ["Wenlun Cao", "Bei Chen", "Yuyao He"], "n_citation": 0, "references": [], "title": "The Inverter Testing System of Asynchronous Motor Based on Modbus Communication", "venue": "", "year": 2011, "id": "2b075a34-e8c7-45de-ba68-30ca59b7a54e"}
{"abstract": "This paper concerns labelled Markov processes (LMPs), probabilistic models over uncountable state spaces originally introduced by Prakash Panangaden and colleagues. Motivated by the practical ap- plication of the LMP framework, we study its formal semantics and the relationship to similar models formulated in control theory. We consider notions of (exact and approximate) probabilistic bisimulation over LMPs and, drawing on methods from both formal verification and control the- ory, propose a simple technique to compute an approximate probabilistic bisimulation of a given LMP, where the resulting abstraction is charac- terised as a finite-state labelled Markov chain (LMC). This construction enables the application of automated quantitative verification and pol- icy synthesis techniques over the obtained abstract model, which can be used to perform approximate analysis of the concrete LMP. We illustrate this process through a case study of a multi-room heating system that employs the probabilistic model checker PRISM.", "authors": ["Alessandro Abate", "Marta Z. Kwiatkowska", "Gethin Norman", "David Parker"], "n_citation": 12, "references": ["0bc5b618-b064-4321-bec9-ca82e700ebb4", "16d2d479-a501-47b1-a990-06c90a97ec98", "18c93e26-9d63-4cb0-ab68-d3ee37d05e60", "1bd7bd98-d72c-479e-ba80-ae4740f1a598", "1ef74256-a040-47b4-81a2-8ab106c83bb7", "204b0894-1530-401b-9758-b28fa2e86933", "23a953a7-f1f9-42f9-99b7-9ee5d57d5ab4", "252b9e3e-4e30-426b-b4fc-2859b4e5503c", "27a777fc-116f-43e2-83a1-f25f8e260cda", "2c606544-f7ec-407d-986c-b47d7d68c973", "2db89cdc-d2c6-490b-b1e4-acdfae5023c8", "396a6e61-d055-4f20-9b8f-22a91dbe6fb5", "3b2617fd-23e0-4856-8f87-dd8e8f8573f5", "3e67122d-adaa-40ce-9287-d0962c2afc9d", "47c9336f-9b26-409b-8630-d4d835d9ec79", "4b7630f3-21eb-42f9-93e5-7e482edde91c", "4c5ad9ac-6380-4bc7-9887-68dbc3412229", "53b64be0-9b18-4a21-b35e-788ba1592fd1", "5becb0ec-85d2-4b39-9ef0-05bdab1055e3", "6253e651-1ef6-4181-a202-942a3a91482d", "642827d0-b554-43c9-82ac-864b28bf25c3", "64c09c46-11e3-4b8c-8d7f-1c3452245da5", "6935e91f-cf94-4637-ba93-b4b0db860174", "75b8d116-39cf-42c6-bb8f-f916d5420f2b", "81f6beca-e5b5-4703-8c8b-f4b03b01a6a1", "98f5968e-56c3-4f6b-a84c-5649e1f76968", "995d0eaa-653b-4180-9e37-36a96170f489", "a2833288-6d3f-45c5-8c14-dbe91b28567d", "a32667dc-f2f3-4784-8104-06c396a947a2", "bd644d8f-1bf9-4526-8c56-44ffbf99482d", "be90d735-aae7-44f1-934c-713ec59f1f18", "d303a6e6-e303-4aef-a244-22de89ed31d1", "dc7d8157-b03d-4467-a661-360ef87869ee", "dc9d5881-abf0-45b0-b613-39b902d03941", "de6fdc5b-01e1-4354-8084-3a1d696f0544", "e35d097f-6d71-4306-8bd4-628a7d1bf4b0", "e736441b-424b-448f-bddd-96fe6fc043fd", "f1029115-54b8-42a1-a30c-9e76a2fcc3c7", "fc9a9a08-19ca-4f17-9267-a9dc7ce5a1bb"], "title": "Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations", "venue": "", "year": 2014, "id": "2b220cf3-8a3f-4f51-a958-9118d32cc00a"}
{"authors": ["Roger Tagg", "Tamara Beames"], "n_citation": 0, "title": "HOW CAN A QUANTUM IMPROVEMENT IN PERSONAL AND GROUP INFORMATION MANAGEMENT BE REALIZED", "venue": "international conference on enterprise information systems", "year": 2009, "id": "2b367521-f34a-4506-91b5-0fb9aeca957d"}
{"abstract": "Cross-domain text classification aims to automatically train a precise text classifier for a target domain by using labeled text data from a related source domain. To this end, the distribution gap between different domains has to be reduced. In previous works, a certain number of shared latent features (e.g., latent topics, principal components, etc.) are extracted to represent documents from different domains, and thus reduce the distribution gap. However, only relying the shared latent features as the domain bridge may limit the amount of knowledge transferred. This limitation is more serious when the distribution gap is so large that only a small number of latent features can be shared between domains. In this paper, we propose a novel approach named Topic Correlation Analysis (TCA), which extracts both the shared and the domain-specific latent features to facilitate effective knowledge transfer. In TCA, all word features are first grouped into the shared and the domain-specific topics using a joint mixture model. Then the correlations between the two kinds of topics are inferred and used to induce a mapping between the domain-specific topics from different domains. Finally, both the shared and the mapped domain-specific topics are utilized to span a new shared feature space where the supervised knowledge can be effectively transferred. The experimental results on two real-world data sets justify the superiority of the proposed method over the stat-of-the-art baselines.", "authors": ["Lianghao Li", "Xiaoming Jin", "Mingsheng Long"], "n_citation": 50, "references": ["28903e7b-aa3b-4840-b634-916029ed6c77", "312e54ca-e7e9-4129-99f4-36f3aeff827e", "34a35de8-db8b-4b1d-bdcf-96e10e0587fa", "3796757e-4c43-4459-b65b-927d8bc7f6f2", "449d0b2e-d401-4831-ba26-564e18178573", "4cbd7765-c47a-4004-a5f8-c2da7c7d1c7b", "5855e2d7-bd7f-416a-a1cc-fa1c625f49a2", "9f79df9c-625a-4df0-aafb-3e6eaf98e736", "ab68780d-3419-4b9f-be4a-354c01e6ca6c", "c0c6f8d0-ca71-4813-a271-065926bb2662", "d0a24b88-3a63-4cf1-bb51-8161643082af", "e9f5e156-5766-4494-ae9a-33ffbc4ef53b"], "title": "Topic correlation analysis for cross-domain text classification", "venue": "national conference on artificial intelligence", "year": 2012, "id": "2b78e1ff-184f-4314-9de5-82a92e8591fc"}
{"authors": ["Jan Je\u017eek", "Tomas Mildorf", "Karel Charvat"], "n_citation": 50, "title": "The Plan4business Approach to Transfer Open Data into Real Estate Businesses", "venue": "international symposium on environmental software systems", "year": 2013, "id": "2bb24cf1-4461-47a0-ad34-59aae49484eb"}
{"authors": ["Heather A. Smith", "James D. McKeen"], "n_citation": 4, "references": ["2832ac67-865f-45e1-b84b-465fd3610ec7"], "title": "Developments in Practice XVII: A Framework for KM Evaluation", "venue": "Communications of The Ais", "year": 2005, "id": "2bb46be9-61fe-4d52-9ad3-245242c6bea0"}
{"authors": ["Han-min Huang", "Gang Hu"], "n_citation": 1, "references": [], "title": "Disposing Face Images Based on Kalman Filter", "venue": "international conference of fuzzy information and engineering", "year": 2009, "id": "2bc0d540-1349-4b9e-b7ee-e9fa2202a5e3"}
{"abstract": "As enterprise use of social media platforms to support collaborative work continues to increase, studies that investigate the ways in which traditional group support systems can integrate with social media platforms are increasingly important. In this paper, we report on the results of a study in which we implemented a Delphi decision-making approach in SAP StreamWork, a web-based social media platform that supports social interaction and decision making. As with most social media systems, contributions by individuals in SAP StreamWork are shared immediately and attributed to the contributors. At first glance, these characteristics are at odds with the anonymity and iterative structure of the Delphi approach. We describe how we integrated the structured processes of the Delphi approach into the open collaboration model of SAP StreamWork and report on an evaluation of our system in which two groups used the resulting prototype tool for a real-life decision-making activity.", "authors": ["Fan Dong", "Adam Binnie", "Kelly A. Lyons", "Rob Lee", "Francis T. Lui", "Michael McAllister", "Mike Tsumura"], "n_citation": 0, "references": ["21228f36-8797-4741-a38e-89ebc9734b3f", "352737af-38f0-4844-971d-7727c99535f8", "63f5dab0-6da2-439b-a254-853297c453bb", "6b120687-239a-45f7-ab9a-448647009fb5", "768673a3-c63d-41e3-ad47-0f913757aa4f", "dd9bcab7-35b9-4cb7-9a89-2a5b039ef304"], "title": "Collaborative decision making: an implementation of the Delphi approach in a social platform", "venue": "conference of the centre for advanced studies on collaborative research", "year": 2012, "id": "2bc57202-2f22-4ddc-8d95-7c6599a01968"}
{"authors": ["Gabriella Crocco", "Philippe Lamarre"], "n_citation": 44, "title": "On the Connection between Non-monotonic Inference Systems and Conditional Logics.", "venue": "principles of knowledge representation and reasoning", "year": 1992, "id": "2bc7255d-0e0b-41b2-bc74-eea0403a8d45"}
{"authors": ["Duc-Phong Le", "Matthieu Rivain", "Chik How Tan"], "n_citation": 10, "references": ["0d7be36d-a14e-433d-b129-47f86c97ed56", "15496392-6673-4df2-ba1f-9c2c582a263e", "1e07eeee-1cd0-4dbe-92bc-3f3f17c9d033", "2c146ab2-ffe1-4581-ba4c-e675232312a9", "3997c721-b53d-425d-bc4e-6689334669f0", "3ecba135-f5ae-474b-a011-03493f10204e", "3fb43b00-905c-4a08-934d-198ea4eb66c3", "47632ed2-d4d8-47b5-b6f6-f8a86bda9111", "54425234-7acf-4957-baec-909dd74cac2d", "8cf8adb1-f01c-44d6-a202-0c5894d6eee7", "a4bf33d7-b2b1-42d5-ac0a-d19bd84f4aa6", "a6311b05-1ee0-4cf1-bcfc-65efcf1e9db2", "a9b73d0b-4189-4851-9ff9-ae3078044f6b", "ad8d44ea-54cc-4c58-85c1-ca1bfa0c25be", "b3a5fd99-cc66-411d-871c-bce055102c80", "b68fc787-7817-421e-8e66-8a98ab9db1ad", "bfbe5c30-4840-4274-bc9c-872864ec3ec1", "d044eb8e-9d68-4c4a-9a27-c0f4cd3f6972", "d0887dbf-65be-480d-8b40-bf954406ad11", "d1862ff1-de8c-4516-b0a8-30dac719079a", "fb04e0d5-74ec-4b70-b77c-fc6e3498a679"], "title": "On Double Exponentiation for Securing RSA against Fault Analysis", "venue": "", "year": 2014, "id": "2bcb4136-875f-4178-beae-3dcc9bce60d6"}
{"authors": ["Geraldine Clarebout", "Jan Elen", "Joost Lowyck", "Jef Van den Enden", "Erwin Van den Ende"], "n_citation": 0, "title": "Evaluation of an open learning environment", "venue": "", "year": 2005, "id": "2bd9a795-3345-4046-a870-7c61710769ca"}
{"abstract": "Coiling is possibly the most widespread endovascular treatment for intracranial aneurysms. It consists in the placement of metal wires inside the aneurysm to promote blood coagulation. This work presents a virtual coiling technique for pre-interventional planning and post-operative assessment of coil embolization procedure of aneurysms. The technique uses a dynamic path planning algorithm to mimic coil insertion inside a 3D aneurysm model, which allows to obtain a plausible distribution of coils within a patient-specific anatomy. The technique was tested on two idealized geometries: an sphere and a hexahedron. Subsequently, the proposed technique was applied in 10 realistic aneurysm geometries to show its reliability in anatomical models. The results of the technique was compared to digital substraction angiography images of two aneurysms.", "authors": ["Hern\u00e1n G. Morales", "Ignacio Larrabide", "Minsuok Kim", "Maria-Cruz Villa-Uriol", "Juan Macho", "Jordi Blasco", "Luis San Rom\u00e1n", "Alejandro F. Frangi"], "n_citation": 11, "references": ["882e12d8-b279-4715-a1c4-cecf2429b00e", "fbc5545c-a2c0-473e-a35a-5262d7d1f0b8"], "title": "Virtual coiling of intracranial aneurysms based on dynamic path planning", "venue": "medical image computing and computer assisted intervention", "year": 2011, "id": "2bdbf78f-cf0d-4006-a15b-2b97cadb1d35"}
{"abstract": "So-called Smart Dust is envisioned to combine sensing, computing, and wireless communication capabilities in an autonomous, dust-grain-sized device. Dense networks of Smart Dust should then be able to unobtrusively monitor real-world processes with unprecedented quality and scale. In this paper, we present and evaluate a prototype implementation of a system for tracking the location of real-world phenomena (using a toy car as an example) with Smart Dust. The system includes novel techniques for node localization, time synchronization, and for message ordering specifically tailored for large networks of tiny Smart Dust devices. We also point out why more traditional approaches developed for early macro prototypes of Smart Dust (such as the Berkeley Motes) are not well suited for systems based on true Smart Dust.", "authors": ["Kay R\u00f6mer"], "n_citation": 50, "references": ["0ab618bf-f2a8-46cd-8b7d-6a4a1c8c97e2", "103e12c7-7e82-4a02-a695-155e93f74e14", "136c4780-2f25-4068-90a5-aed6afaf2890", "239e0847-5e35-4e0a-91ab-a4065613a3e6", "32b7988a-f873-44c9-bacb-0d660fe12f01", "4f5530bf-de86-4f1d-a55f-24202a7aa691", "6258bfb5-3acb-4750-b2d3-f35f5d7f43ef", "a080f0ca-50a1-4753-859b-1cd6708dda14", "a1aef7a4-2e75-4c4f-b0f4-520410012fc9", "e3284cc8-30cb-4cd1-bc5e-9ff3115e7210", "f3267c01-b670-4b7a-a3a5-79088c0d90ab", "fd51d78a-e2f5-46b6-b041-4dae9aebdc76"], "title": "Tracking real-world phenomena with Smart Dust", "venue": "international conference on embedded wireless systems and networks", "year": 2004, "id": "2be57e36-5e45-46fa-b9ca-a20e7dc2e754"}
{"authors": ["Marco Hubert", "Marc Linzmajer", "Ren\u00e9 Riedl", "Peter Kenning", "Mirja Hubert"], "n_citation": 12, "title": "Introducing Connectivity Analysis to NeuroIS Research", "venue": "international conference on information systems", "year": 2012, "id": "2be60ac2-c2b3-4dec-8ead-2e63424882b0"}
{"authors": ["Francisco Javier Fern\u00e1ndez Nieto", "Leire Bastida", "Marisa Escalante", "Alayn Gortazar"], "n_citation": 50, "references": [], "title": "Development of Dynamic Composed Services Based on the Context", "venue": "", "year": 2007, "id": "2beecfab-fa41-45d3-a1f0-048fd5a660f5"}
{"authors": ["Yucheng Liu", "Yubin Liu"], "n_citation": 0, "references": ["be0d5620-8a3c-4d4b-b665-7e76227c25d9"], "title": "OPC Server Technology Development in the System Software Integration", "venue": "", "year": 2011, "id": "2c140d23-16f9-4c79-928f-ee49a36731fd"}
{"abstract": "Triplet Markov fields (TMFs) model recently proposed is to deal with nonstationary image segmentation and has achieved promising results. In this paper, we propose a multiscale and multidirection TMF model for nonstationary synthetic aperture radar (SAR) image multiclass segmentation in nonsubsampled contourlet transform (NSCT) domain, named as NSCT-TMF model. NSCT-TMF model is capable of capturing the contextual information of image content in the spatial and scale spaces effectively by the construction of multiscale energy functions. And the derived multiscale and multidirection likelihoods of NSCT-TMF model can capture the dependencies of NSCT coefficients across scale and directions. In this way, the proposed model is able to achieve multiscale information fusion in terms of image configuration and features in underlying labeling process. Experimental results demonstrate that due to the effective propagation of the contextual information, NSCT-TMF model turns out to be more robust against speckle noise and improves the performance of nonstationary SAR image segmentation.", "authors": ["Yan Wu", "Peng Zhang", "Ming Li", "Qiang Zhang", "Fan Wang", "Lu Jia"], "n_citation": 5, "references": ["20b49c64-9895-47b4-b3fe-dbacde06c333", "22c09b2c-4645-482e-8604-2a5a8df9eb88", "280b800e-0332-4f68-bedf-796cd448d3a1", "31e350c1-0600-4d59-9171-d2085a17d7bd", "359f6d66-2b48-4c61-9682-5b69f429e925", "44d19695-15ab-438c-9b85-0b70e3059664", "4ccb0a41-65db-4638-8834-5ee0a5eea3e2", "4efed829-8069-4591-b6de-e88b7a4fff02", "592f27a3-fce4-4c93-8693-c76a07da3881", "7a878d25-51ce-4b05-8cb1-828f3f2d7f5c", "7f552c4f-bcc8-47fd-b43c-e0c757932d49", "834863b2-34f0-40dc-b4d2-f4189eaa262a", "944aff76-5934-49bc-9e19-e09587cd717c", "9afb0b55-c32c-4ebb-8915-821141e8e9aa", "9c71b428-e65d-47fc-bf40-cae795d2495a", "a5e48653-fcf4-40e9-b8fb-8dc8fd7caf35", "c0d8e485-5e1f-4473-8e8c-5ca393e2fabc", "c8a8bd71-9f48-46d7-84a3-9aa934ed87f0", "d4980471-6a3a-47cd-8fff-26955f8099f4", "dd223664-302f-456b-9d4c-ee26db3394e7", "ede1cd6f-4c65-4c44-bce7-d5ca8b4df9b3", "ee1d8749-edd6-4f30-9aaa-f6aa32a0f304"], "title": "Full Length Article: SAR image multiclass segmentation using a multiscale and multidirection triplet Markov fields model in nonsubsampled contourlet transform domain", "venue": "Information Fusion", "year": 2013, "id": "2c16f3e3-85ec-46d5-977a-158034745a17"}
{"authors": ["Thomas Jansen"], "n_citation": 5, "references": ["18fea3e3-83d7-4905-b8d8-fe856f0be7e2", "1d0492ea-6b7a-4380-b904-67e4460f6e75", "22e1edc3-fca0-4a5f-a5c9-7441becb681e", "42e9cddc-f262-42c6-a300-7ed8924ce7fc", "441186cd-f367-4fde-b51d-13cb73cb1e5c", "4909403c-8071-4fba-b31f-70eb672a8887", "7f2b922e-659f-4b7d-b75e-2aed7f911ae6", "85e3ba0c-7e60-4b98-92ed-ae946f79d252", "9c8988be-d123-4894-9c9e-c6f0e6e5b8be", "bac5da35-9009-41a3-b758-21aec812a9ee", "bd2731b7-3207-40ee-93e8-8dd81d709138", "cd559989-d627-4bb5-847a-f9730a797488", "d88b2707-a0de-40d2-b4aa-4ded2cd19eb3", "e85d4c94-9a3a-471d-aff5-0a0d9bbb2f38"], "title": "Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics", "venue": "", "year": 2014, "id": "2c4ceb3a-fd3f-43d5-995d-4b856bebb832"}
{"abstract": "In this paper we explore how to construct a Jensen-Shannon kernel for hypergraphs. We commence by calculating probability distribution over the steady state random walk on a hypergraph. The Shannon entropies required to construct the Jensen-Shannon divergence for pairs of hypergraphs are obtained from steady state probability distributions of the random walk. The Jensen-Shannon divergence between a pair of hypergraphs is the difference between the Shannon entropies of the separate hypergraphs and a composite structure. Our proposed kernel is not restricted to hypergraphs. Experiments on (hyper)graph datasets extracted from bioinformatics and computer vision datasets demonstrate the effectiveness and efficiency of the Jensen-Shannon hypergraph kernel for classification and clustering.", "authors": ["Lu Bai", "Edwin R. Hancock", "Peng Ren"], "n_citation": 50, "references": ["0752f9a1-5273-4a3d-9a5e-d5ad673a80fd", "27733f7f-89b3-479a-8a89-869e212c526e", "2ed9dca1-26a1-438d-9991-f7e1ab3f569d", "34eca591-8a6a-49ad-b24f-783811eb8839", "39ed6f99-cd63-45fe-a915-00bf32713038", "51c5ba66-d036-4992-80c7-530e50be081a", "9094d2fd-ae57-47db-b24e-776eec7fb1a5", "9c8df835-563e-4320-a950-b12b2777ce1c", "ab3afb93-8ca0-4556-ae60-11199dc263c2", "ac874ce1-5649-4f97-a85d-7108bbeffa81", "b74ba440-a7b5-42ba-be05-e793aa4ed338", "d9378e7f-6e87-4baa-9386-f4f54ba2821a", "f5c7eec7-f583-4244-b109-9fdfd40279ae"], "title": "A jensen-shannon kernel for hypergraphs", "venue": "", "year": 2012, "id": "2c579907-67d2-4bed-8144-6d1f1c099b85"}
{"authors": ["Alexander Hilliger von Thile"], "n_citation": 0, "references": ["b4c5de16-182d-446a-b4e7-fc79f69a96e8", "e726fe14-7133-47dc-885b-68faaebf8ea0"], "title": "Managing the Desktop Document Dataspace.", "venue": "", "year": 2007, "id": "2c64fe0b-8843-4e33-a86e-df64e5ae845a"}
{"authors": ["Teresa Maria Altomare Basile", "Floriana Esposito", "Stefano Ferilli"], "n_citation": 50, "references": ["2d51da2f-6085-4b6f-bbd7-edd23ac68b1a", "62549bc2-e0b3-46e8-8d32-390dded105d5", "b49c1e2b-0cd0-4950-a724-00c698e5b49d", "d4d4286f-609d-42cb-a3a5-47f057ff4a7e", "e2e84b99-ac3e-4942-afea-870d3ede8579", "e34e229a-3058-4581-968a-83005b501591"], "title": "Improving User Stereotypes through Machine Learning Techniques", "venue": "italian research conference on digital library management systems", "year": 2011, "id": "2c817e8e-af09-42e7-9529-e1504c0cd2be"}
{"abstract": "A recently proposed fast image alignment algorithm is the inverse compositional algorithm based on Lucas-Kanade. In this paper, we present an overview of different brightness and gradient constraints used with the inverse compositional algorithm. We also propose an efficient and robust data constraint for the estimation of global motion from image sequences. The constraint combines brightness and gradient constraints under multiple quadratic errors. The method can accommodate various motion models. We concentrate on the global efficiency of the constraint in capturing the global motion for image alignment. We have applied the algorithm to various test sequences with ground truth. From the experimental results we conclude that the new constraint provides reduced motion error at the expense of extra computations.", "authors": ["Ahmed Fahad", "Tim Morris"], "n_citation": 0, "references": ["1ba94a3f-ba8a-4aff-8151-3a855803711c", "32148a0b-6ce4-4a1e-a1d2-98a96b27b24f", "4db6c10f-b1bb-49c2-b00c-bca8425aa979", "4e961b41-f797-4e5e-8b52-a864f8b5359b", "5b4f33a1-9689-4b0d-a60f-095a210df75b", "67b0b9ad-1096-40c2-9f98-3296430043df", "8b519a65-db09-4764-b8e3-70e8b6d64449", "976eff9e-bbb1-41aa-bf35-60273c072ca0", "aabd3fe1-94b6-4f7d-8afe-57f5ff1daec0", "b5f505be-ccca-4db1-9a4f-e5a249f79b47", "b631774a-545a-4c38-b049-fb5258dece65", "df69f056-b320-4800-aabc-324dabc7aa97", "ec58e4ba-8843-4a2d-b4f0-57d725da1d84", "ecc70973-d45e-45d9-a8b0-88f9967d6afa"], "title": "Lucas-kanade inverse compositional using multiple brightness and gradient constraints", "venue": "international conference on computer vision theory and applications", "year": 2008, "id": "2c81a06a-cf99-4e32-a49e-181abfce652b"}
{"authors": ["Umar Shoaib", "Nadeem Ahmad", "Paolo Ernesto Prinetto", "Gabriele Tiotto"], "n_citation": 6, "references": ["6e3241e3-d490-4510-a0fb-9d6880b39d1b"], "title": "A platform-independent user-friendly dictionary from Italian to LIS", "venue": "language resources and evaluation", "year": 2012, "id": "2c88290c-eb8e-4187-a2a8-c77891b242ec"}
{"authors": ["Eugenio Aguirre", "Miguel Garc\u00eda-Silvente", "Rui Pa\u00fal", "Rafael Mu\u00f1oz-Salinas"], "n_citation": 3, "title": "A FUZZY SYSTEM FOR INTEREST VISUAL DETECTION BASED ON SUPPORT VECTOR MACHINE", "venue": "international conference on informatics in control, automation and robotics", "year": 2007, "id": "2ca97c4b-f409-4449-94d7-a315e2477e2e"}
{"authors": ["Michael H. Zack"], "n_citation": 3, "title": "Some antecedents and consequences of computer-mediated communications use in an ongoing management group: a field study", "venue": "international conference on information systems", "year": 1991, "id": "2cccabb5-2aa9-447b-ba77-c14f6f9e624a"}
{"abstract": "Organizational researchers have acknowledged that understanding the relationship between technology and organization is crucial to understanding modern organizing and organizational change. There has been a significant amount of debate concerning the theoretical foundation of this relationship. Our research draws and extends Deleuze and DeLanda\u2019s work on assemblages and Callon\u2019s concept of performation to investigate how different sociomaterial practices are changed and stabilized after the implementation of new technology. Our findings from an in-depth study of two ambulatory clinics within a hospital system indicate that \u201cperforming\u201d of constituting, counter-performing, calibrating, and stratifying explained the process of sociomaterial change and that this process is governed by an overarching principle of \u201cperformative exigency\u201d. Future studies on sociomateriality and change may benefit from a deeper understanding of how sociomaterial assemblages are rendered performative.", "authors": ["Adrian Yeow", "Samer Faraj"], "n_citation": 0, "references": ["01e2b3fa-7b6c-4c86-8126-53960ddd7502", "14412408-6389-4962-9fd7-2a7470a8de29", "250f5d69-92d9-4d99-b2ce-64ade8a158d8", "36298af7-ba46-4c81-9527-d42e3c354e8f", "3e278a71-6787-4eba-a0c3-a4108195d9ab", "47f3271e-a9f1-4482-bee5-c2e997b698f2", "9d4e9a9a-c0fc-4e01-9759-3ac85f856bdb", "bbb56571-2003-48a9-90fc-0a3cd55e4cce", "c37d5d1f-fa99-4ffc-a1ea-4a5767b41414", "fa11478f-de67-43a5-998a-d008cb0f5f5b"], "title": "Technology and Sociomaterial Performation", "venue": "", "year": 2014, "id": "2cdec927-48a4-400c-bcb2-9be44723be16"}
{"authors": ["Mikael Kerttu", "Per Lindgren", "Rolf Drechsler", "Mitchell A. Thornton"], "n_citation": 0, "title": "Low Power Optimization Techniques for BDD Mapped Finite State Machines.", "venue": "", "year": 2002, "id": "2cf01e4f-3d28-4759-a4f1-dcf5c5672286"}
{"authors": ["Petr Blaha", "Jan Rozhon", "Miroslav Voznak", "Jan Skapa"], "n_citation": 0, "references": ["0b29f029-afbd-41c4-a433-72e6ab02e63f", "125bebac-166b-4179-8f0e-502f09ab9c19", "73de347a-8743-4645-af1a-eccc4d83a22d", "9de51795-c32d-4207-a9fe-df1478325f9e", "cd59684a-7727-4f0f-a8d9-efa8230a152b", "d400e3c2-b55a-4a93-a2b8-3d2ad940996a"], "title": "Correlation between Speech Quality and Weather", "venue": "Soft Computing", "year": 2013, "id": "2d043448-bc7b-4df0-ae6a-985643c03179"}
{"abstract": "An active set is a unifying space being able to act as a \"bridge\" for transferring information, ideas and results between distinct types of uncertainties and different types of applications. An active set is a set of agents who independently deliver true or false values for a given proposition. An active set is not a simple vector of logic values for different propositions, the results are a vector but the set is not. The difference between an ordinary set and active set is that the ordinary set has passive elements with values of the attributes defined by an external agent, in the active set any element is an agent that internally defines the value of a given attribute for a passive element. In this paper we show the connection between classical, fuzzy, evidence theory and active sets. In conclusion at one external agent we substitute a set of experts or agents that evaluate in a conflicting way the logic value of a given proposition or attribute. Under the same meta level of active sets we can discover analogy and similarity among distinct theories of uncertainty and types of many valued logics.", "authors": ["Germano Resconi", "Chris J. Hinde"], "n_citation": 0, "references": ["414bc70c-7a8b-4552-bcb8-84ff5348bcdd", "a42f3897-038e-47ff-a85b-4d06f650eae0", "b1017096-dd68-4df1-a51b-8aa1136df22b", "e9926e5c-89e6-439c-a554-54be8b164630"], "title": "Active sets and unification", "venue": "agent and multi agent systems technologies and applications", "year": 2011, "id": "2d32d473-f2a5-4827-8b56-1c38b3279d84"}
{"abstract": "Fuzzy property-oriented concept lattices are a formal tool for modeling and processing incomplete information in information systems. This paper relates this theory to fuzzy mathematical morphology, which scope, for instance, is to process and analyze images and signals. Consequently, the theory developed in the concept lattice framework can be used in these particular settings.", "authors": ["Cristina Alcalde", "Ana Burusco", "Juan Carlos D\u00edaz", "Ram\u00f3n Fuentes-Gonz\u00e1lez", "Jes\u00fas Medina-Moreno"], "n_citation": 7, "references": ["38ff63a2-34c8-4436-a68d-4c53d249373f", "5469a842-cadd-4af5-a25a-a56cd35b1de0", "5d3c8794-c963-4b40-b24a-37df983578f0", "88a19086-fb38-4b5b-bb89-813b68b2c5b0", "9f7420dc-41dc-4562-a72c-f686faf39a02", "d08e11cd-d0c0-4327-bc8a-9d407a78166e", "d90e38ac-2c48-4c50-b96a-1142a7a639e9", "fe11e65a-e518-46a7-8033-5b857b451af3"], "title": "Fuzzy property-oriented concept lattices in morphological image and signal processing", "venue": "international conference on artificial neural networks", "year": 2013, "id": "2d3b3e55-16bb-42cd-b9cf-14135be2b0f2"}
{"authors": ["John P. Penny", "Paul J. Ashton", "David Tripp"], "n_citation": 0, "title": "Instrumenting systems to measure components of interactive response times", "venue": "Journal of Research and Practice in Information Technology", "year": 1988, "id": "2d43b3b9-5c05-48da-bcfa-6f77c673f0b9"}
{"authors": ["Stavros Christodoulakis", "Anil K. Garg", "C. C. Gotlieb", "Geovane Cayres Magalh\u00e3es"], "n_citation": 0, "title": "Database Design Research at the University of Toronto.", "venue": "IEEE Data(base) Engineering Bulletin", "year": 1982, "id": "2d56d8a2-75b1-47ea-8d24-073f52f6c56d"}
{"authors": ["Vladimir A. Fomichov", "Alexander A. Razorenov"], "n_citation": 0, "references": ["2ecd6706-d987-4414-ab7a-85a1946ae840"], "title": "A New Method of Extracting Structured Meanings from Natural Language Texts and Its Application", "venue": "applications of natural language to data bases", "year": 2014, "id": "2d715110-4196-4a5f-8ef3-f8fe9a8d8803"}
{"authors": ["Niko Kleiner", "Stefan Sarstedt"], "n_citation": 1, "title": "Einsatz von Standardprozessen bei der Gestaltung von Lehrveranstaltungen.", "venue": "", "year": 2001, "id": "2d75a07e-7103-48b6-a458-ec0616f591c1"}
{"abstract": "Even though the Dublin Core Metadata Element Set is well accepted as a general solution, it fails to describe more complex information assets and their cross-correlation. These include data from political history, history of arts and sciences, archaeology or observational data from natural history or geosciences. Therefore IFLA and ICOM are merging their core ontologies, an important step towards semantic interoperability of metadata schemata across all archives, libraries and museums. It opens new prospects for advanced global information integration services. The first draft of the combined model was published in June 2006.", "authors": ["Martin Doerr", "Patrick LeBoeuf"], "n_citation": 78, "references": ["1d933ace-2ca9-435c-8f63-c8e923da1fc2"], "title": "Modelling intellectual processes: the FRBR-CRM harmonization", "venue": "", "year": 2007, "id": "2d77aa62-60e9-4d28-a57b-771d2eb6c4fc"}
{"authors": ["J. Ramirez", "Andr\u00e9s B. Fern\u00e1ndez-Revelles", "Mikel Zabala", "Bernardo Requena S\u00e1nchez", "Luis Lozano Moreno"], "n_citation": 6, "title": "Computerized Application for Analysing the Time and Instructional Parameters in Sport Coaching and Physical Education Teaching.", "venue": "", "year": 2003, "id": "2dbe3d60-69fa-4974-84c4-6803016ed13e"}
{"abstract": "Fingerprint images captured in real world applications always include some variations, called intra-class variations, due to various uncontrolled conditions like scratching, aging, moisting, drying, etc. It is important for current fingerprint identification systems to adaptively deal with these variations. In this paper, we propose a semi-supervised FSS based fingerprint identification method. We use unlabeled samples to train FSS Center for each finger in a semi-supervised setting, which significantly improves the robustness of the FSS based method. We evaluate our method on the DIEE Fingerprint database. The experimental results show favorable performance of our method as compared to state-of-the-art.", "authors": ["Xuzhou Li", "Ying Li", "Yilong Yin", "Gongping Yang"], "n_citation": 50, "references": ["3bf7ed5f-fed5-472c-8705-4d4c01fe822e", "8041409d-c638-46c6-824c-0c948e205511", "8f27ae17-da83-4c24-bbc5-8344fd46dfdd", "a5c71bbc-d3e5-4ea9-bb04-1ff5d6b8b6d6", "bd80a129-9187-40ce-84ae-ee7a5acb9155", "c35d7e21-eeb3-446e-bf56-e04dce78a5ab", "e85985ec-801f-4644-9add-94c15945975c"], "title": "Fingerprint identification based on semi-supervised FSS", "venue": "", "year": 2012, "id": "2dc6e5a6-0be9-45f8-b3d1-7f75faa312fd"}
{"abstract": "This paper presents a combined packet loss compensation system for distributed speech recognition (DSR). Compensation is applied at three stages within the DSR process beginning with interleaving on the terminal device to reduce burst lengths in the received feature vector stream. On the receiver side estimation of missing vectors is applied to reconstruct the feature vector stream prior to recognition. Finally, the decoding process of the recogniser is modified to take into account the varying reliability of these estimated feature vectors. Experiments performed on both the Aurora connected digits task and the WSJCAM0 large vocabulary task show substantial gains in recognition accuracy across a range of packet loss conditions.", "authors": ["Alastair Bruce James", "Ben Milner"], "n_citation": 50, "title": "Combining Packet Loss Compensation Methods for Robust Distributed Speech Recognition", "venue": "conference of the international speech communication association", "year": 2005, "id": "2dd2e7b7-2613-4e1a-9b9f-7e9216dcf15f"}
{"abstract": "Nous avons tous l'intuition qu'un travail peut etre realise en beaucoup moins de temps s'il est reparti entre plusieurs personnes ou sur plusieurs machines. Cette notion se nomme le parallelisme qui peut se definir comme l'etat de ce qui se developpe dans la meme direction ou en meme temps. C'est naturellement que la notion de parallelisme a ete appliquee aux ordinateurs. De ce fait, il a ete possible de repondre aux besoins de puissance necessaire a la realisation de projets gourmands en temps de calculs et en taille memoire. Le parallelisme combine a une algorithmique performante permet de gagner du temps afin de repondre au mieux a d'importants besoins. Il rompt avec l'approche classique qui consiste a gagner de la vitesse en effectuant plus rapidement chaque operation, approche bornee par les lois de la physique. La notion de parallelisme a donc grandement contribue a la multiplication des modeles informatiques.   Nous nous interesserons au modele systolique et au modele parallele a gros grains baptise (Coarse Grained Multicomputers). Le modele CGM a ete propose par F. Dehne et al. et il possede des proprietes qui le rendent tres interessant d'un point de vue pratique. Il est parfaitement adapte a la modelisation des architectures existantes pour lesquelles le nombre de processeurs peut etre de plusieurs milliers et la taille des donnees peut atteindre plusieurs milliards d'octets. Un algorithme developpe pour ce modele est constitue de calculs locaux utilisant, si possible, des algorithmes sequentiels optimaux et de rondes de communication dont le nombre doit etre independant de la taille des donnees a traiter. Le modele CGM est donc tres interessant d'un point de vue economique. En effet, ce modele est independant des architectures reelles et permet de reutiliser des algorithmes sequentiels efficaces, ce qui le rend tres portable.   Dans cette these nous nous interessons a des problemes d'algorithmique du texte. Ces problemes peuvent ameliorer la compression de donnees ou bien etre utilises en bio-informatique. Ainsi, nous proposons des solutions CGM aux problemes de recherche de la plus longue sous-suite croissante, de la plus longue sous-suite commune a deux mots, du plus long suffixe repete en chaque caractere d'un mot et de repetitions. Pour cela, nous sommes partis de solutions systoliques existantes que nous avons adaptees au modele CGM. Le but de ce travail est en fait double. D'une part, nous proposons pour la premiere fois des solutions CGM a ces quatre problemes. D'autre part, nous montrons comment des solutions systoliques peuvent etre derivees en algorithmes CGM. En effet, de nombreux problemes ont ete etudies sur des architectures systoliques, c'est a dire des machines dediees, non reutilisables pour d'autres problemes. Le modele CGM quant a lui permet de travailler avec des machines peu couteuses et reutilisables a souhaits. De plus, l'experience acquise au cours de ces travaux nous permet d'avoir une bonne idee des solutions systoliques adaptables au modele CGM. Ceci pourrait permettre de consolider le pont existant entre modeles a grains fins et modeles a gros grains.   Nous finissons cette these par une discussion sur l'equilibrage de charge des solutions proposees et sur la predictivite de l'adaptation d'autres solutions systoliques au modele CGM.", "authors": ["Thierry Garcia"], "n_citation": 1, "title": "Algorithmique parall\u00e8le du texte : du mod\u00e8le systolique au mod\u00e8le CGM", "venue": "", "year": 2003, "id": "2dee3eab-90e5-42b9-b996-924b973ad7d9"}
{"abstract": "Nowadays, blogs are regarded as standard text-based communication tools on the internet. In contrast to traditional web pages, the blog has several significant features: it allows authoring via a web browser, and offers automatic backlink requesting, called trackback. The latter provides direct communication between blog servers. In this paper, we propose a distributed computation method based on trackback communication and present the implementation of a software verification system based on distributed computing. The software verification system consists of ordinary blog systems which are used as frontend interfaces, and verification blog bots which are used as backend inference engines. One of the prominent features is that one can limit the danger of intrusion into vulnerable verifier programs to the private networks where the verification blog bots are operated.", "authors": ["Takayuki Sasajima", "Shin-ya Nishizaki"], "n_citation": 50, "references": [], "title": "Blog-Based distributed computation: implementation of software verification system", "venue": "", "year": 2012, "id": "2df218e6-e626-4135-a994-13cae04f6bde"}
{"abstract": "It is common between teachers of mathematics to assess the difficulty of the problems they gave to students. The evaluation is mostly based on subjective appreciation with no explicit consideration of difficulty factors. However, in a computerized environment for mathematics instruction it would be highly beneficial to dispose of such explicit factors and automated assessment of problem difficulty. In the present paper a set of factors for sequence problems in analysis are proposed. For the automated detection of these factors a set of rules was defined. Knowledge representation and implementation details are described.", "authors": ["Ildik\u00f3 Pelczer", "Fernando Gamboa"], "n_citation": 0, "references": [], "title": "Automated Assessment of Problem Difficulty in Mathematical Analysis", "venue": "artificial intelligence in education", "year": 2007, "id": "2df7e8fe-7f0a-4814-8a54-4359ebdd6de8"}
{"authors": ["Lubjana Beshaj", "Tony Shaska"], "n_citation": 7, "references": ["007fc57f-b0a8-4cee-9d65-39d34398d807", "051cbaae-27ef-4837-923a-ab512608f4ac", "bc957a16-be57-430c-848a-8565fd83397b"], "title": "Decomposition of Some Jacobian Varieties of Dimension 3", "venue": "artificial intelligence and symbolic computation", "year": 2014, "id": "2dfff82b-7806-48c8-9193-22e47d7cd5f6"}
{"authors": ["Bowon Lee", "Debargha Muhkerjee"], "n_citation": 6, "title": "Spectral entropy-based voice activity detector for videoconferencing systems.", "venue": "conference of the international speech communication association", "year": 2010, "id": "2e1a1ff0-ef93-4739-b5c8-131797ad48d8"}
{"authors": ["Muhammad Asiful Islam", "Faisal Ahmed", "Yevgen Borodin", "Jalal Mahmud", "I. V. Ramakrishnan"], "n_citation": 6, "title": "Improving Accessibility of Transaction-centric Web Objects.", "venue": "siam international conference on data mining", "year": 2010, "id": "2e30739c-e826-4422-ba23-22995377b1f5"}
{"abstract": "The Generate-and-Solve is a hybrid framework to cope with hard combinatorial optimization problems by artificially reducing the search space of solutions. In this framework, a metaheuristic engine works as a generator of reduced instances of the problem. These instances, in turn, can be more easily handled by an exact solver to provide a feasible (optimal) solution to the original problem. This approach has commonly employed genetic algorithms and it has been particularly effective in dealing with cutting and packing problems. In this paper, we present an instantiation of the framework for tackling the constrained two-dimensional non-guillotine cutting problem and the container loading problem using a simulated annealing generator. We conducted computational experiments on a set of difficult benchmark instances. Results show that the simulated annealing implementation overachieves previous versions of the Generate-and-Solve framework. In addition, the framework is shown to be competitive with current state-of-the-art approaches to solve the problems studied here.", "authors": ["Rommel Dias Saraiva", "Napole\u00e3o Nepomuceno", "Pl\u00e1cido Rog\u00e9rio Pinheiro"], "n_citation": 50, "references": ["1ffd6155-ff53-4502-b367-836f55dea5d1", "2d301441-2ae4-4cbe-a5ff-ca692e3014ff", "3814cc36-a982-407e-a985-acbdc127a668", "42b2d668-e86f-4b65-9f6c-090370778996", "6070e611-f1f0-4954-bceb-b90cee229ea2", "72d20273-10df-467a-a9d4-46a6b2a96ba5", "aab2281e-c57e-4bed-ba0a-cfed36b30ab7", "b73da57e-70de-40c3-bec9-779a304bbeef", "c0e45a18-25ab-4a1c-8dce-72e2f8607629", "d9f5b7a0-8489-4795-8fb6-dc740cc0ac3b", "f2996175-e522-462c-a58f-e2382f733913"], "title": "The generate-and-solve framework revisited: generating by simulated annealing", "venue": "", "year": 2013, "id": "2e33e1a5-5cdf-41f2-bafd-12adb45ad79f"}
{"authors": ["Petr Veverka", "Bohdan Maslowski"], "n_citation": 0, "title": "Infinite horizon maximum principle for the discounted control problem - Incomplete version", "venue": "", "year": 2011, "id": "2e39c934-89f6-4e1a-adb0-0b9f40a78c6f"}
{"authors": ["Jennifer Hui-Chan Tsai", "Justie Su-Tzu Juan"], "n_citation": 0, "title": "A Simple Multi-Secret Sharing Scheme to Achieve Both Optimal Improvement Ratios.", "venue": "", "year": 2007, "id": "2e658f0d-c272-407f-a7d8-54cf881e81c2"}
{"authors": ["Antonio Corral", "Michael Vassilakopoulos"], "n_citation": 1, "title": "Approximate Computation of Distance-Based Queries.", "venue": "", "year": 2005, "id": "2e720792-3250-4da5-be66-ede2d7a1f2b6"}
{"authors": ["Toshiro Minami", "Yoko Ohura"], "n_citation": 50, "references": [], "title": "An Attempt on Effort-Achievement Analysis of Lecture Data for Effective Teaching", "venue": "", "year": 2012, "id": "2e721d7f-4479-4097-ab9e-fb402e5671a4"}
{"authors": ["Mario J. P\u00e9rez-Jim\u00e9nez"], "n_citation": 1, "references": ["09898bee-7a0f-4bb2-bb0b-c7dd287742c4", "0fe50cba-358b-4c30-806e-e32f0e1f62b1", "261f30c2-4443-440f-841f-ccd98951612a", "3b4edea2-1f0c-4ee3-82b0-4366fea1b305"], "title": "Computational complexity in P systems", "venue": "Scholarpedia", "year": 2009, "id": "2e8c9441-51cc-457a-83ae-f00d5bc3b986"}
{"authors": ["Miguel Enrique M\u00e1rquez-Cid", "Gloria M. Comesa\u00f1a", "Roger L. Milne", "G. Andr\u00e9s", "N\u00faria Malats", "David G. Pisano"], "n_citation": 0, "references": ["9cac7f89-42c6-40c0-8cfd-c4518911c653", "b136f264-85ba-4300-af1c-51dab1e3e19c", "fb849392-bcaa-42a0-a771-f910af57cd41"], "title": "EPIQuest: A Multiuser and Multiproject Web Tool to Build Online Forms for Biomedical Studies", "venue": "", "year": 2011, "id": "2eaf3164-652e-4502-9164-56d3502c10f8"}
{"abstract": "The ability to express \"derived predicates\" in the formalization of a planning domain is both practically and theoretically important. In this paper, we propose an approach to planning with derived predicates where the search space consists of \"Rule-Action Graphs\", particular graphs of actions and rules representing derived predicates. We present some techniques for representing rules and reasoning with them, which are integrated into a method for planning through local search and rule-action graphs. We also propose some new heuristics for guiding the search, and some experimental results illustrating the performance of our approach. Our proposed techniques are implemented in a planner that took part in the fourth International Planning Competition showing good performance in many benchmark problems.", "authors": ["Alfonso Gerevini", "Alessandro Saetti", "Ivan Serina", "Paolo Toninelli"], "n_citation": 22, "references": ["17d1ecd0-224c-484d-b35c-0d6d13e89558", "1c58d08a-682e-469a-8c98-2070408f406f", "387395e6-6712-4dda-9cb7-cf0fd7de42c7", "507d931e-d5bb-48a5-ae7d-90ca0420847e", "78177b8f-531b-40f0-8656-9ea74ec3e0d5", "b35f49cd-7503-4add-af99-79850702e600"], "title": "Fast planning in domains with derived predicates: an approach based on rule-action graphs and local search", "venue": "national conference on artificial intelligence", "year": 2005, "id": "2ec16102-322d-41c7-892e-3a9ed0132a99"}
{"abstract": "This article is about community detection algorithms in graphs. First a new method will be introduced, which is based on an extension [16] of the commonly used modularity [17, 18, 19, 20] and gives overlapping communities. We list and compare the results given by our new method and some other algorithms yileding either overlapping or non-overlapping communities. While the main use of the proposed algorithm is benchmarking, we also consider the possibility of hot starts, and some further extensions that considers the degree distribution of the graphs.", "authors": ["Erika Griechisch", "Andr\u00e1s Pluh\u00e1r"], "n_citation": 13, "references": ["0718dc34-4b49-4b24-8a2e-b5cd0d9d82c6", "60ef3852-fa16-44bf-9434-9909268ba5d8", "68faab18-b537-4f62-85cf-ddc9ef352362", "87d8ffaa-9e66-4e1f-88fd-cdfdab02fb29", "b6c8bcad-70a8-4d76-82f7-109c0439a645", "d7ad566c-4a36-49b8-9a55-8421d3285176", "e96828f8-70d7-4df8-a75a-5cf81e168601"], "title": "Community detection by using the extended modularity", "venue": "Acta Cybernetica", "year": 2011, "id": "2ed9abbc-b2ec-4e38-b0ca-5e8ddea36cea"}
{"abstract": "A VLSI sorter of sizeO(n) can sortn elements in linear time when the input and output time are taken into account. If the input contains more thann elements, some prepocessing has to be performed. A VLSI partition algorithm that provides a solution to this problem is presented. The algorithm partitions the input data into two smaller parts as the quicksort algorithm does. That is, the elements of the first part will be smaller than the elements of the second part. The partition is repeated until the parts are small enough to fit in the sorter. It is shown that the average number of times each element must go through the partitioner isO(logk) for a data file of sizekn wheren is the size of the sorter. In the worst case where the partitioner fails to divide the input evenly, the elements must goO(k) times through the partitioner like in the quicksort algorithm. The partitioner can also be used, with simple modifications, as a sorter, a stack, a queue, or as a priority queue. Other advantages of the VLSI algorithm are also discussed.", "authors": ["Shou-Hsuan Stephen Huang"], "n_citation": 0, "references": ["224ab868-2c68-4041-a533-a46fdad013b0", "71671678-81df-46f9-8de6-7c76920225cc", "c6dd1a99-5028-4e82-a8a6-1aaa04ada2bf"], "title": "A VLSI partition algorithm", "venue": "Bit Numerical Mathematics", "year": 1988, "id": "2ef6b82c-54cb-4972-a6db-e3520efc68d7"}
{"abstract": "Typically, the service quality in the hotel industry is analyzed using cross-sectional empirical studies. For example, to examine current causal relationships among various latent and manifest variables using structural equation modeling plays a key role in understanding how services are provided at a given hotel. Note that accurate prediction of service quality certainly helps decision-makers better manage their services operations to sustain quality services to meet the ever-changing needs of customers. In this paper, by integrating continued fraction interpolation theory and genetic algorithms, an innovative service quality prediction model in the hotel industry is presented. An illustrative example is provided, which essentially shows the applicability of this proposed innovative methodology.", "authors": ["Robin G. Qiu", "Zhengpeng Wu", "Yan Yu"], "n_citation": 50, "references": ["ae56e614-2dfa-4134-9218-b559fe5c372c"], "title": "A tractable approximation approach to improving hotel service quality", "venue": "", "year": 2011, "id": "2efe1dee-3a60-4039-aba8-c239fb78c2f0"}
{"authors": ["Yunhui Zhuang", "Anjia Yang", "Duncan S. Wong", "Guomin Yang", "Qi Xie"], "n_citation": 10, "references": ["6b727e8c-85bf-42ae-8bf4-715f82aedd9a"], "title": "A Highly Efficient RFID Distance Bounding Protocol without Real-Time PRF Evaluation", "venue": "network and system security", "year": 2013, "id": "2f008992-3b8b-4374-b00c-3b62c0035dff"}
{"authors": ["Johan Schalkwyk", "Jacques de Villiers", "Sarel van Vuuren", "Pieter J. Vermeulen"], "n_citation": 19, "title": "CSLUsh: an extendible research environment.", "venue": "", "year": 1997, "id": "2f0b42a3-f33a-4de7-a037-928774d2d6aa"}
{"abstract": "This work presents an object-oriented approach to the concurrent computation of eigenvalues and eigenvectors in real symmetric and Hermitian matrices on present memory shared multicore systems. This can be considered the lower level step in a general framework for dealing with large size eigenproblems, where the matrices are factorized to a small enough size. The results show that the proposed parallelization achieves a good speedup in actual systems with up to four cores. Also, it is observed that the limiting performance factor is the number of threads rather than the size of the matrix. We also find that a reasonable upper limit for a \"small\" dense matrix to be treated in actual processors is in the interval 10000-30000.", "authors": ["Alfonso Ni\u00f1o", "Camelia Mu\u00f1oz-Caro", "Sebasti\u00e1n Reyes"], "n_citation": 0, "references": ["10523a56-e1a8-46f5-b9ee-f777967334cb", "20d88618-1e2d-4cde-a075-48db6fd94b1a", "2c5fda61-4ea4-4ab2-8085-b890d17c0953", "36653de4-ccd6-49d2-8f6d-25c1b7f4f856", "61739ddf-2c79-4492-b900-51a1262cd301", "b145ffe0-0d29-40f0-8db8-e66542058da4", "b61e6b6c-8830-409d-9481-b5aac8cc2632", "e9072090-c9ba-4a3a-bf3b-ce369ee66bc9", "fa312c2a-943b-4157-a767-ac47b72f3b43"], "title": "A concurrent object-oriented approach to the eigenproblem treatment in shared memory multicore environments", "venue": "international conference on computational science and its applications", "year": 2011, "id": "2f0fbe86-4579-4a4d-8fdb-5f7cdcdee6a8"}
{"abstract": "We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specifically, we consider on-line algorithms for this problem in which goods are considered on-line, and each good is assigned an irrevocable price. Since exact equilibria will not be found in such a setting, we appeal to the concept of approximate equilibrium defined in previous studies of the problem, to characterize the quality of our solutions. We consider both deterministic and randomized algorithms for finding approximate equilibria. We prove a tight bound on the performance of deterministic algorithms, and show that under certain natural conditions, randomized algorithms lead to market prices which are closer to equilibrium.", "authors": ["Spyros Angelopoulos", "Atish Das Sarma", "Avner Magen", "Anastasios Viglas"], "n_citation": 1, "references": ["17255105-c1c1-479f-bc47-4d8443027af0", "a38d857f-9747-41dc-9fcb-812e1e600225", "bb8b146f-b09c-448f-b23f-ec217c0f6578", "c2edc32e-13d3-4483-8378-6ce405c8c3d6", "ce3dfac2-2e90-4677-a80a-3f29cbd79a99"], "title": "On-line algorithms for market equilibria", "venue": "computing and combinatorics conference", "year": 2005, "id": "2f27171d-7a41-42f1-9247-b1444c1f8d1a"}
{"abstract": "A prerequisite of any attempt to build intelligent tools to assist in the programming process is a representation language for encoding programming knowledge. Languages that have been used for this purpose include the predicate calculus [5] and various program-schema languages [1,4]. This paper advocates a new candidate which is as expressive as the predicate calculus but more intimately connected w i th programming: the lambda calculus. Its advantages lie in its close resemblance to conventional programming languages, and in a straighforward model of inference by rewriting, which can be applied to automatic programming and program understanding. The use of the lambda calculus in an automatic program understander is described.", "authors": ["Stanley Letovsky"], "n_citation": 50, "references": ["55df2738-f876-4833-8215-5c535dab52a6", "a10b9a76-866b-47cd-aa2a-78c20d3180bd", "dc21d7d2-af2f-49ae-9ed2-4ec126118eed"], "title": "Program understanding with the lambda calculus", "venue": "international joint conference on artificial intelligence", "year": 1987, "id": "2f335ce7-185b-4ad3-a78b-53499565efa2"}
{"abstract": "Several authors proposed to import in Natural Language (NL) the ideas lying behind the well-known Skolem Theorem, defined in standard logic. In these proposals, logical forms aiming at capturing the meaning of NL sentences include referential (functional) terms. Nevertheless, whether referentiality is allowed for non-indefinites NPs, two main problems arise: the need to refer to the maximal sets of entities involved in the predications, and the need to cope with readings where two or more sets of entities are introduced at the same level of scope and have to be evaluated in parallel. Particularly problematic is the representation of sentences featuring nested quantifications. The paper shows how it is possible to incorporate referential terms in the standard Generalized Quantifier account in order to properly deal with nested quantifications.", "authors": ["Livio Robaldo"], "n_citation": 50, "references": ["033d9cd6-d4a9-4912-927f-5587c263d1db", "391548b4-abc3-44db-85b8-c6f4f047dae1", "86fa2ac0-340e-4ff9-83cc-2dc9e903a83d"], "title": "Skolem Theory and Generalized Quantifiers", "venue": "workshop on logic, language, information and computation", "year": 2008, "id": "2f383f82-4eb5-423c-8d6f-d18ece9ce6bc"}
{"abstract": "We consider the performance of a number of DPLL algorithms on random 3-CNF formulas with n variables and m=rn clauses. A long series of papers analyzing so-called \"myopic\" DPLL algorithms has provided a sequence of lower bounds for their satisfiability threshold. Indeed, for each myopic algorithm ${\\mathcal A}$ it is known that there exists an algorithm-specific clause-density, $r_{\\mathcal A}$, such that if $r  2.78 and the same is true for generalized unit clause for all r>3.1. Our results imply exponential lower bounds for many other myopic algorithms for densities similarly close to the corresponding $r_{\\mathcal A}$.", "authors": ["Dimitris Achlioptas", "Ricardo Menchaca-Mendez"], "n_citation": 6, "references": ["00d7f7a9-6c77-4d36-b60f-4ece1ed099da", "32452ae0-75b8-4864-980e-5d6e161e1a9c", "3bf80069-50ed-4514-9b21-81f27604933f", "438d100d-2736-4d70-abbd-37ff0dc6fa19", "534eaad2-4efc-409c-a95b-be85bd3d708d", "66e25c15-7854-4c64-afee-209d2413ce8b", "6a202dc6-90b8-46c4-93b1-82e0891d1b84", "88b8456b-1126-4022-a0c2-f400443003ca", "ab9d2238-0301-4694-b088-564b34d8bb09", "ad0c679c-01bd-4117-88d7-e65e984363a3", "c036c033-9216-44f8-88a2-2355f57e647b", "c1adfb7a-4c15-4ed4-a566-570cecc68a18"], "title": "Exponential lower bounds for DPLL algorithms on satisfiable random 3-CNF formulas", "venue": "theory and applications of satisfiability testing", "year": 2012, "id": "2f4d2208-7972-4e96-8ce1-ec73e7d5d6ff"}
{"authors": ["Peng Cao", "Dazhe Zhao", "Osmar R. Za\u00efane"], "n_citation": 62, "references": ["135182c7-9d27-4d71-9e12-63bcecf965da", "19d8e565-399d-47a8-bd30-8ff4fe857892", "3e87efcf-8162-4c08-a234-3a5df570c5d6", "40ab97bc-ab6b-44f9-bbd6-5667394ee34a", "4ec29d6b-fb27-4bb1-8926-e70de71cbebe", "5cffd78e-d2d8-4ed4-81d5-5fab46f248c8", "67ee0b47-908f-4205-a35a-af3ed53cac4d", "7432a3ec-e941-4c11-9914-9f62cfda24d2", "852a8a91-3de7-46e3-afcd-756ea72c3986", "8f105981-def7-4140-a221-9b77f7ad4ae7", "a6e178c8-d55f-460c-8e5b-c9d5cfb04c20", "aedfd2bf-2a47-4874-910e-1430aa646767", "af647f42-0b8d-480b-a36e-c7f351a95473", "bdcdd410-c37a-4c0e-adc9-33b782ef2d60", "ea6c65c4-e688-4129-9cef-75c884099cc8"], "title": "An Optimized Cost-Sensitive SVM for Imbalanced Data Learning", "venue": "pacific-asia conference on knowledge discovery and data mining", "year": 2013, "id": "2f9a0337-c299-496f-93c7-192cc071dbb8"}
{"authors": ["Zhaoming Yin", "Jijun Tang", "Stephen W. Schaeffer", "David A. Bader"], "n_citation": 50, "references": ["02ed122f-8651-4ac7-8d48-2700c3f66168", "36508af5-ae8b-4d37-aee7-fbb6c07a62ca", "4fca84b6-e185-49e8-bd72-77d6ceb84a3a", "56d2b741-75f6-43f1-a98f-612b3a59b7ed", "61af5830-082a-4be0-9add-fc11c9f55718", "716ff462-a0fc-464b-b0d3-ac826ade9954", "7a03dc03-9ff1-422c-89e9-84525aedc7dc", "8d77026f-2f9b-4060-bc28-8375d99c221c", "9085b868-5f2e-45d2-ae24-72427c28ef8c", "9600dfc8-6d37-4048-bf3b-4e4670767e73", "97e75bdf-c18b-4155-ba85-57d3f753d257", "97f9d9dc-b26a-4f38-8410-e21e400ffd88", "9b371b54-0406-45fb-ad75-098ea16c1ddc", "9c0e991a-0d92-42dc-bc19-d8e8b7fd45be", "abacf0f5-9038-4b64-968a-fec16e5cbfd3", "b4592920-2c24-4486-857a-7b827000bca5", "b9820deb-42dd-4a09-883c-b32ab6728e96", "c1548e68-5973-4234-91da-bc3e79fdadfe", "cb123232-0d28-4fe0-a1b3-f9d9dd1d8bb7", "cb266b17-1a4f-4bd4-8312-ffea083bdd1c", "d25418df-7afb-4955-8c8c-5e055a86d70f", "d7dfe30b-bbdd-4d15-815c-c299cda0917b", "d83db4bf-9980-438d-960a-2fab4553604d", "daeb6a49-77ee-4ea0-ae6c-103daab55be2", "f6d6da0b-ea90-4aae-a299-05631dd0ce84", "f735f10f-eeec-4278-9f8b-3b8c79a1d432"], "title": "A Lin-Kernighan Heuristic for the DCJ Median Problem of Genomes with Unequal Contents", "venue": "computing and combinatorics conference", "year": 2014, "id": "2fa18c0a-d834-4f29-9841-833d33603652"}
{"authors": ["Fernando Rinc\u00f3n", "Julio Dondo", "Jes\u00fas Barba", "Francisco Moya", "Juan Carlos L\u00f3pez"], "n_citation": 50, "references": ["027b41e6-a233-4b7d-ab29-1057554893aa", "480f5be6-5444-45e9-8f81-24e4ac1dca89", "53d4a8a2-c3cd-458d-8118-1f46de1e08c0", "706095f8-d52d-4c42-9fbc-5cda906474c0", "b55f47a5-b5fe-4de6-b161-786251cb0125", "b5c0ebe4-ac97-4c5f-b2e4-e00e0aeeb7a1", "e34b45e5-18f9-4eff-86f6-180b7a08b48b"], "title": "Supporting Operating Systems for Reconfigurable Computing: A Distributed Service Oriented Approach.", "venue": "", "year": 2009, "id": "2fc27998-d33b-4b1c-be98-283b8022a5be"}
{"authors": ["Adam Naumowicz"], "n_citation": 3, "references": ["022b0d85-3777-44eb-a19a-cf11c22d6389", "0cdd1794-36d8-4464-b8cf-54d33f3d7196", "147e55df-c943-47dd-904d-6cc2423edc47", "1725655b-9d5d-4d82-901c-e16dde3845ce", "483bae55-cc9f-42a7-97f1-cd2a71fd92f2", "5e78fafd-7fd2-421c-a64d-766b09fd4843", "6453c7a4-f9df-4b59-af2c-5d82dd0e0d38", "8b2533d2-9fd2-4d0e-bf23-443f8ea5ec75", "950f5cff-ccdc-440e-860e-b60402312d6b", "98440a82-2fa0-4b2e-a4f7-47f6ad7bd744", "9fa5bb08-a2ed-44ee-ad33-5ef9adcc3b71", "b568fcd1-91ee-485c-bfd3-f71cb802545c", "b7fdf9cc-1ee5-4c22-b200-44d1c8033a49", "bca64879-0f9f-4d7a-9292-24fe14b2ec4b", "d0739847-502b-461d-aea7-8b27ddbb12d6", "ecfc7e41-bf8b-4458-846d-d42d33b2add5", "f346aec4-576a-4fdf-a300-77eda094231c", "fe9c7ac5-8c01-4b5c-890a-37f705ec982c"], "title": "SAT-Enhanced Mizar Proof Checking", "venue": "", "year": 2014, "id": "2fc8082e-abce-4d95-82a5-09a0929d5dc7"}
{"authors": ["Raj Bhatnagar", "Sriram Srinivasan"], "n_citation": 37, "title": "Pattern Discovery in Distributed Databases.", "venue": "national conference on artificial intelligence", "year": 1997, "id": "2fcaac44-b9cd-4e71-af77-bc10d63c7102"}
{"authors": ["Changwoo Byun", "Seog Park"], "n_citation": 0, "references": ["2c64bc5b-b9a1-41e5-b718-8182e58112b5", "53b892fa-f1a4-4616-b28a-9be0878f3b90", "5d9f74d5-3833-4ca0-ae74-89a74039549a", "a209206d-6f63-4af6-b80d-a44ff883c44b", "db075cac-0c7a-49ef-a990-94367a3bf431", "e1669ca1-b822-42ec-b299-5ac0c20cf0d4", "e61fd2ef-4730-4889-a3af-2cd7ce4422b3", "f437177a-7cc7-427f-a081-3eaf87443568"], "title": "Efficient Filtering System to accelerate XML Access Control Enforcement.", "venue": "", "year": 2006, "id": "2fe0570a-e8c9-4d24-8bda-e5ac0a61b203"}
{"authors": ["L. Mart\u00ednez", "Macarena Espinilla", "Ricaurte Rodr\u00edguez"], "n_citation": 0, "title": "A Fresh Breeze of Excellence in Ja\u00e9n", "venue": "", "year": 2013, "id": "3030b1c8-cd08-48c6-af22-179f3f437495"}
{"abstract": "Based on image contents, the better to simulate the process pattern of human eyes vision, a fusion algorithm of integration and highlight for the image details is proposed. Through wavelet transform, a regional cross entropy fusion rule is used for the low-frequency component which reflects approximate content, and a region brightness details priority weighted fusion rule is used for the high-frequency component which reflects detail features of image. Finally, the fusion image is reconstructed through an inverse transform of wavelet. Experimental results show that by using this algorithm, the mutual information between the images can be fused organically, the image clarity is raised, the fusion image details and brightness information are enhanced. Strong support for the follow-up information analysis and extractive ability of the images are provided.", "authors": ["Wen Ge", "Peng Li", "Jing Li Xu"], "n_citation": 0, "references": [], "title": "Multi-resolution image fusion algorithm based on regional cross entropy and regional priority", "venue": "artificial intelligence and computational intelligence", "year": 2012, "id": "304f43e8-2ae0-4d53-800e-310998cfd385"}
{"authors": ["Sebastian Geier", "Bernhard Fleischmann"], "n_citation": 0, "references": [], "title": "Demand Fulfillment in an Assemble-to-Order Production System", "venue": "A Quarterly Journal of Operations Research", "year": 2014, "id": "305ec30c-bd85-4988-9d60-205f5bb7d7d5"}
{"abstract": "A period of almost 150 years (since the middle of 19th century#N#until the present) was analysed in the second phase of the#N#students\u2019 project studying old maps of Liberec. In the#N#submitted paper the problems of usage graphical devices that#N#are used for displaying urban environment and its close#N#neighbourhood are explored. Consequently, the chosen places#N#that are different or interesting in particular ways are#N#described with use of six old maps and the present map#N#sequenced in a chronological line. The places are characterised#N#through the use of the old maps and attributes of the places#N#are described via statements elicited from the system of map#N#symbols displayed in the surrounding of the particular place.#N#Afterwards the statements are verified by comparison of#N#information received from maps and secondary historical#N#materials and the current situation of the urban places. The#N#conclusion presents the enumeration of positives and negatives#N#of usage of old maps for characterization of geographical space#N#concept in time.", "authors": ["Vojt\u011bch Bla\u017eek", "Vojt\u011bch H\u00e1jek", "Ladislav Li\u010d\u00edk", "Branislav Ni\u017enansk\u00fd", "Kl\u00e1ra Popkov\u00e1"], "n_citation": 0, "references": [], "title": "Changes in Urban Area Discovered by Analysis of Chosen Places in Old Maps of Liberec", "venue": "", "year": 2015, "id": "3089c330-983b-4d83-9b82-fdc7ba8b316c"}
{"authors": ["S\u00e9rgio Lima", "Jo\u00e3o Paulo da Silva Cunha", "Miguel Tavares Coimbra", "Jos\u00e9 M. Soares"], "n_citation": 0, "title": "A Tool for Endoscopic Capsule Dataset Preparation for Clinical Video Event Detector Algorithms.", "venue": "international conference on health informatics", "year": 2009, "id": "3093464b-a6a4-4e22-866a-40d0b2d6c560"}
{"authors": ["Alejandro L\u00f3pez-Ortiz", "Alejandro Salinger"], "n_citation": 0, "references": ["27c2d0e6-de1e-4dac-a2eb-38373b8107ce", "4891dace-9f88-497f-b6aa-6ed18877e7ec", "7fd59d12-51bf-4ebb-b015-69f7f17c8d63", "90e1fe1c-222d-410f-9405-dec0f24c01b1", "945b20e1-fa26-407c-8812-3d29eae3c70e", "977745c4-804e-424a-b093-b21fbd89757f", "a52ed153-4609-45d0-b7ec-cfb96f4c5d0c", "f1953601-48a1-4506-ac90-be5b9182b7a0"], "title": "Analyzing Cache Behaviour in Multicore Architectures", "venue": "", "year": 2016, "id": "30b5060e-394d-4688-ae7d-05e15209a5ae"}
{"authors": ["Swarnim Kulkarni", "Doina Caragea"], "n_citation": 16, "references": ["021d39bc-772a-45e4-93cf-f59159f3743e", "47aabb7f-a7b0-4655-9983-ff1b699707a2", "540f653d-dc81-4160-9755-3cd96bc46bb0", "a72bbcde-da26-47c4-ba78-6ee97e06f303", "b9b22d93-8d2b-4c98-a2f4-eae7d61db2bb", "c56215d1-2973-4b41-9bfb-5a67547bf188", "dbc228a4-d1b4-40d8-8e1f-d221f3ad8b37", "e0d12ab6-1474-4cc4-826e-530d348da7a0", "eaa0bd36-29ca-4b9e-9529-26cc79fe4cea"], "title": "COMPUTATION OF THE SEMANTIC RELATEDNESS BETWEEN WORDS USING CONCEPT CLOUDS", "venue": "international conference on knowledge discovery and information retrieval", "year": 2009, "id": "30bad70c-c78c-4729-b925-b7b6c2cea085"}
{"abstract": "We propose an in-home living activity recognition method using only off-the-shelf sensors, namely, an accelerometer and a microphone, which are commonly applied in mobile phones. The proposed method firstly estimates a user's movement condition roughly by acceleration sensing. Secondly, it classifies the working condition in detail by acoustic sensing when it estimates the condition to be working by acceleration sensing. We developed a prototype system to recognize the user's living activity in real time and conducted two experiments to confirm the feasibility of the proposed method. As a result of the first experiment, three movement conditions; quiet, walking, and working, are classified with more than 95% accuracy by acceleration sensing. And it classified working into seven conditions with 85.9% accuracy by acoustic sensing. Moreover, the result of the second experiment shows that it is effective to adopt instance-based recognition according to the assumed application.", "authors": ["Kazushige Ouchi", "Miwako Doi"], "n_citation": 4, "references": ["448fcf27-5265-4c92-8ae7-3841f58a6955", "511f1560-26c6-49b0-9c86-ef20b370de72", "85061d0b-6200-4af6-8358-07bf4e634dea", "9764ba3f-b269-4bd9-a89e-54ad8bf2e72b", "b6dd1973-46bb-4b4f-b097-a5803d4e22f8", "df78dbad-a315-4f24-9933-525529bce43f"], "title": "A real-time living activity recognition system using off-the-shelf sensors on a mobile phone", "venue": "Contexts", "year": 2011, "id": "30d6644e-dfad-45b7-96b6-6926fcb62080"}
{"abstract": "Location Based Services (LBS) are evolving very fast but despite this are still at an early phase of their evolution. The future LBS services will be more anticipatory of users needs and will exploit a broader range of information on users. In order to anticipate users' needs, LBS providers should be able to understand users' behaviours, preferences and interests automatically and with- out asking the user to specify them. Then using the user's current situation and previously extracted behaviours, interests and dislikes, the user's needs can be predicted at the relevant moment and provide the most appropriate sets of ser- vices. This paper shows the application of data mining techniques over anony- mous sets of tracking data to recognise mobility behaviours and preferences of users such as Point of Interest (PoI). Tracking data are first anonymised then stored in a spatio-temporal database. Then, using data mining techniques, rules, models and patterns are recognised. Such knowledge, patterns and models are subsequently used for intelligent navigation services as input making suggestions.", "authors": ["Anahid Basiri", "Pouria Amirian"], "n_citation": 0, "references": ["11db345e-64a8-41bd-a6bf-433a50c1c1c1", "12235f49-8896-442a-bbf1-a74088fff73d", "1b469f23-2f7d-452b-a8fb-0352097f6488", "23483dc9-618b-4f87-9fea-c765726a8c41", "2a75c5ca-0f31-4a4a-9a81-c16feaef03c3", "323fe206-8682-415d-83bc-551def3171a5", "38fb68f8-6818-4e52-afa7-949b27c54d50", "58800e89-b865-4610-b150-095301a8b99d", "919625d0-5dd1-41c8-9bc8-087754ae50d2", "a3fba5c6-2823-4f8a-bb20-9963de16bff4", "b4ca9e3f-d878-430d-a354-aa1731291b73", "bf5c36ab-5fcd-4b2e-bdaa-684a9da6559d", "e5d85b26-6ecc-4fa7-b239-9d0567883deb", "f517581b-80da-4453-b52a-75b77359ba2b"], "title": "Automatic Point of Interests Detection Using Spatio-Temporal Data Mining Techniques over Anonymous Trajectories", "venue": "international conference on computational science and its applications", "year": 2014, "id": "30ecafcd-b2c2-497e-9388-68f8c493fcc5"}
{"abstract": "Low Earth Orbit Satellite (LEOS) systems have started providing communication with one phone number throughout the world. In this paper, the diffusion process of the two LEOS systems is analyzed under competition. We simulate the diffusion process under different scenarios. In these scenarios, we analyze issues related to the timing of product introduction, technology advantage and potential customer base. A model of the potential customer base with network externality is presented. We found that the timing of product introduction can have significant impact on the follower in the market. We found that a follower firm with more advanced technology would have higher probability to succeed in competing against the first mover. In addition, the increase in the potential customer base favors the firm with advanced technology. The network externality effect in the growth of the customer base favors both firms but could be an barrier for the follower to create a critical mass and beat the incumbent firm.", "authors": ["Kemal Altinkemer", "Wei T. Yue", "Liang Yu"], "n_citation": 9, "references": ["174ceea0-f2ad-4fc6-9852-2f35188f5de5", "e7ec91ad-8020-4de4-8d7f-34bb6ecac338"], "title": "Adoption of Low Earth Orbit Satellite Systems: A Diffusion Model under Competition", "venue": "Information Technology & Management", "year": 2003, "id": "30f9d4dd-a4a7-49f5-971f-f95540bc982b"}
{"authors": ["M Day"], "n_citation": 50, "title": "Preserving the Fabric of Our Lives: A Survey of Web.", "venue": "european conference on research and advanced technology for digital libraries", "year": 2003, "id": "311a56bc-a9d5-4f4f-98d8-dfbbd1c460c5"}
{"authors": ["Becka Morgan", "Carlos Jensen"], "n_citation": 50, "references": ["0331f459-20b4-479a-a137-0c4b9e5cc973", "23612fe0-2fd3-4e3d-b287-c50a23fb7beb", "2c037879-e659-4d7e-94f5-20d12d376905", "2ced18b0-dce6-483c-8dbf-59b964bb00f2", "3dfa1b06-2aa1-47f1-8ac2-7b5ff38d5965", "4f2f1cc9-0a25-40a2-85ff-0a5c23ced727", "5245ebc5-794b-42cf-87b0-82012d589c52", "63bfc3ab-1018-46a4-8003-aeb25ffbcc12", "93d8746d-9b2d-495f-bb77-d1a00af468a4", "d7a5db40-693f-47dd-95e7-13e0a986be2d", "edc4d1f5-a838-4525-b227-81fbed9e4c62"], "title": "Lessons Learned from Teaching Open Source Software Development", "venue": "open source systems", "year": 2014, "id": "315e2087-309c-408f-a6c6-62abd32ba444"}
{"authors": ["Randy Heiland", "M. Pauline Baker"], "n_citation": 0, "title": "A Survey of Visualization Tools for High Performance Computing.", "venue": "", "year": 1999, "id": "317a4a81-e6e3-4a7a-9ee9-81d62a838002"}
{"abstract": "The long-rising number of electronic control units (ECUs) in cars is a major problem for OEMs, because of high costs and installation space requirements. The complexity could be reduced by the use of multi-core processors, where several ECUs can be repartitioned into virtual machines (VMs) running on one multi-core processor. Such a consolidation of ECUs is challenging, because I/O devices for real-time capable interconnects have to be shared by multiple VMs. In this paper we present a concept for offloading the functionality for CAN controller virtualization into a self-virtualized controller. By means of a thorough real-time analysis, it is shown that proposed solution is capable of real-time message transmission with additional latencies, that are multiple orders smaller than the common deadlines.", "authors": ["Christian Herber", "Andre Richter", "Holm Rauchfuss", "Andreas Herkersdorf"], "n_citation": 12, "references": ["48f63b41-8867-4e05-871a-dae30f3dd7a2", "4a736224-6989-4ef9-98c3-78ffaf22ec4b", "4eae873b-17e5-4ed6-8cc1-f38c040ad4e4", "78991392-db9c-45a4-86a2-b4ce93ab0ec0", "bcb357f4-2470-4181-bd1a-cdf3c12fd880", "f551c049-fcc5-497e-a739-b7b7fb008584"], "title": "Self-virtualized CAN controller for multi-core processors in real-time applications", "venue": "automation, robotics and control systems", "year": 2013, "id": "319535a7-c832-4798-a0ed-0f7982cd2aa2"}
{"abstract": "Loose particles left inside aerospace components or equipment can cause catastrophic failure in aerospace industry. It is vital to identify the material type of these loose particles and eliminate them. This is a classification problem, and autoregressive (AR) model and Learning Vector Quantization (LVQ) networks have been used to classify loose particles inside components. More recently, the test objects have been changed from components to aerospace equipments. To improve classification accuracy, more data samples often have to be dealt with. The difficulty is that these data samples contain redundant information, and the aforementioned two conventional methods are unable to process redundant information, thus the classification accuracy is deteriorated. In this paper, the wavelet Fisher discriminant is investigated for loose particle classifications. First, the fisher model is formulated as a least squares problem with linear-in-the-parameters structure. Then, the previously proposed two-stage subset selection method is used to build a sparse wavelet Fisher model in order to reduce redundant information. Experimental results show the wavelet Fisher classification method can perform better than AR model and LVQ networks.", "authors": ["Long Zhang", "Kang Li", "Shujuan Wang", "Guofu Zhai", "Shaoyuan Li"], "n_citation": 3, "references": ["4c79ab50-7adc-4d71-b6d9-7fe5de1ec0b3", "7228b5b2-53fa-4537-ab84-d928bf0297ab", "9836613c-d506-47ca-be5c-9b126f250ddc", "e8160be2-a4fc-437e-b673-4e58425de482"], "title": "Loose particle classification using a new wavelet fisher discriminant method", "venue": "international symposium on neural networks", "year": 2013, "id": "31b14d8b-a520-43fe-a86b-d10650d9561f"}
{"abstract": "We investigate the computational properties of cellular automata on countable (equivalently, zero entropy) sofic shifts with an emphasis on nilpotency, periodicity, and asymptotic behavior. As a tool for proving decidability results, we prove the Starfleet Lemma, which is of independent interest. We present computational results including the decidability of nilpotency and periodicity, the undecidability of stability of the limit set, and the existence of a $\\mathrm{\\Pi}^0_1$-complete limit set and a $\\mathrm{\\Sigma}^0_3$-complete asymptotic set.", "authors": ["Ville Salo", "Ilkka T\u00f6rm\u00e4"], "n_citation": 10, "references": ["57e19493-1398-4863-9bbf-60824cbb1620", "9f70de5f-3607-483e-8b3f-48fb9a88e4ec", "f96d26f1-5d6d-46c1-a1e4-ccc45f569e6a", "ff86f5d2-1a47-4bb6-beb1-a029e6518225"], "title": "Computational aspects of cellular automata on countable sofic shifts", "venue": "mathematical foundations of computer science", "year": 2012, "id": "31d6d54f-48e2-4361-ab15-31c916db4cfc"}
{"abstract": "Effective network coverage and operational life span is key concern of randomly deployed Wireless Sensor Network (WSN) for performing monitoring function in designated region. Intrinsically, WSN consists of resource constraints sensor nodes. For effective coverage, it is undesirable activating all deployed set of nodes for getting the desired degree of coverage if the same result can be obtained by activating a small subset of deployed nodes for providing the sensing function in the concerned region. We study the problem of extending the life span of the sensor network for fault tolerant area coverage. The proposed genetic algorithm based approach aims to cover a sensed area with minimum number of active nodes and compute the maximum number of Sensing Cover Set (SCS) so that network life time can be prolonged by calculating the working schedule of cover set. Each SCS has been assigned the cover set ID. Each SCS works for the specified amount of time in an alternate fashion. Simulation experiment indicates that genetic algorithm based approach is able to optimally partition the nodes into different SCS.", "authors": ["Rameshwar Nath Tripathi", "Shekhar Verma", "S. V. Rao"], "n_citation": 0, "references": ["160ff360-6cac-4ea8-853d-b1c8e656ff84", "79f4a99d-ea1f-40ac-84be-0b1df513b225", "821274ab-bbce-4699-8008-e90e7c744434", "f699578c-c859-4e95-9e8c-5a56629a3a09"], "title": "Nature-Inspired Fault Tolerant Area Monitoring in Sensor Network", "venue": "", "year": 2012, "id": "31d6fab8-51d9-42b9-b040-68cee208daca"}
{"authors": ["Hiroshi Sakai", "Mao Wu", "Michinori Nakata", "Dominik \u015al\u0119zak"], "n_citation": 50, "references": ["08281eb6-a820-4e91-86b0-fb7ec3a1c7a6", "1742170e-b8b2-455e-b716-10f6be305730", "1a740a4c-b247-40e0-804d-93d69f474b4e", "1bb5f8e8-464d-453b-b8e2-5c6a42c8f5ab", "34b7e270-80d7-46d5-a6f1-e50087a8d045", "3c4206ca-fd9b-4f3d-af6d-e3b672908d4b", "4c2b4f95-e978-4cda-a838-5b13925c88b1", "4fd0c388-9b9e-45f0-ac04-0f2bc11655c9", "85372e17-51ed-40d7-8dd5-4b83f07608e4", "9b40e901-9705-4cec-9728-18634c4a9333", "d719f4e5-f113-420e-bda3-becbc3fcfab2"], "title": "Rough Sets-Based Machine Learning over Non-deterministic Data: A Brief Survey", "venue": "", "year": 2012, "id": "31de902b-835c-4c58-9d39-c531899184e9"}
{"authors": ["Jared L. Darlington"], "n_citation": 3, "title": "Theorem provers as question answerers", "venue": "international joint conference on artificial intelligence", "year": 1969, "id": "31eef161-0363-44e2-91f5-2c1bf055605e"}
{"authors": ["Joao Marques-Silva", "Alessandro Previti"], "n_citation": 50, "references": ["01e7bdb6-63a2-416f-ad65-beab28c587e2", "02ff8bb0-383f-46f9-87b1-2ab5221447b8", "14d1ef6c-a9d0-4461-b79a-d5823e388344", "1ceae9cd-3cc4-4d9d-bca5-49515eaa3b27", "20192894-849d-42d7-b269-8e2c361c971e", "29669d58-b50c-4028-a8e7-de247af95647", "2a73f987-98cc-4d8b-bf27-9d8d0834c57c", "3042f6bd-eb69-47c6-ac3e-24b478de309d", "3246aabe-e86b-4b86-a106-76623d97bd14", "33375940-ab0f-43d9-8be6-a8843e60f1cf", "38c2beca-220b-43a4-9b77-d7788c3eeb8d", "39317a51-3069-482f-aeeb-7b5117879523", "3fa467c8-9099-4505-a219-9368ad577e76", "4de0db29-e8b6-467b-8173-d3e60eef71e6", "6acb216e-3e5c-4e61-91f7-e5fc73fec6b9", "80cffdac-fc47-4915-90fd-75b7d0ef574f", "86270df4-452d-47bc-95a5-fbf1963f7597", "8a194b5f-4e14-4e02-a514-ebeb2f1e1c35", "926bd46e-c4b1-4547-991e-f477fcfbdff1", "9605cfe5-3c12-4020-825e-d265af17b219", "b8090cc7-74ac-4e2d-a368-77d9f1658236", "b8b37de5-909a-4577-8ae9-ff377a82c5b6", "c6d19071-b4c3-4f45-a4d7-f7f341499e09", "d0fa3fca-c86b-4f8b-a54b-88aa37219220", "d574101d-0398-4b11-a1a5-2d13299da519", "d73db90e-399d-413d-b689-9dd8d5b672b7", "d817ce48-926e-4982-b670-745f5bb35969", "dd9c7d62-b988-444c-82f7-e0dd6fb57c2f", "df324180-72e8-4358-b5be-38a8045a96ab", "e1406549-31de-4c58-8576-0d1118ab8b71", "e8f286a0-ee26-4940-b4a9-0a5771cb79e4", "efa4046c-bc9a-4785-be56-fcfd3cdf03fe"], "title": "On Computing Preferred MUSes and MCSes", "venue": "theory and applications of satisfiability testing", "year": 2014, "id": "31fba5ff-67f4-4bad-aad1-7c3585b0db1d"}
{"abstract": "Usually, people access and control technical devices through various peripheries, e.g. PC mouse, computer keyboard or other remote control devices with buttons. Construction of these peripheries assumes that the user can hold them in his/her hand and handle them. Our team has designed and developed several peripheries and helpful software programs, which are ready to provide assistance for people with some disabilities. Our peripheries are named e.g. I4Control\u00ae, BlinkSwitch, FingerSwitch and others. Universal control system named EasyControl was developed by our team to enable primary to control PC through several input devices. Using these input devices and system EasyControl user cannot control only our PC but olsou other devices in surounding environment. Some applications and toys were developed to unable users to master some input devices.", "authors": ["Marcela Fejtov\u00e1", "Petr Nov\u00e1k", "Olga \u0160t\u011bp\u00e1nkov\u00e1"], "n_citation": 0, "references": ["f30fc7e8-8f02-415f-84fe-6d72d89ff245"], "title": "EasyControl --- Universal Control System", "venue": "", "year": 2008, "id": "32018791-59a6-412d-9d2c-65409ba2a96f"}
{"authors": ["R. Benjamin Shapiro", "Hisham Petry", "Louis M. Gomez"], "n_citation": 0, "references": ["33a95a76-769d-4cc2-b7b1-fe79888b90f4", "b380fdbf-6114-4649-a66c-07dc26295d6d", "c5da1713-3832-492b-9b0c-7dc19006e8a6"], "title": "Computational Infrastructures for School Improvement: A Way to Move Forward.", "venue": "educational data mining", "year": 2008, "id": "320a205a-606c-47d9-98b3-4b81e2a7159b"}
{"authors": ["Yenumula B. Reddy"], "n_citation": 3, "references": ["1a484c9b-6067-4b89-9c56-f38562468e28", "68f3a7d4-d842-4d5f-ab20-f20b8a43444d", "833a3da6-94ea-4e91-8684-57040cd5e691", "bdbf984d-bb13-48c9-972e-78b0e1af287a", "f1e74152-3f7c-4c44-b628-cdf47a17587f"], "title": "Detecting Primary Signals Using Time and Space Model.", "venue": "international conference on wireless networks", "year": 2008, "id": "321896a0-f4ec-46aa-941e-9f2394eb07b4"}
{"authors": ["Fernando Herrera", "Eugenio Villar", "Christoph Grimm", "Markus Damm", "Jan Haase"], "n_citation": 7, "references": ["16956b33-859f-40bc-84d0-5de313be3aa6", "4f423ad3-1406-4d2f-9e45-43ecbbe02d16", "4f4ef7cb-61a1-417e-a7c8-b180d8129e41"], "title": "A general approach to the interoperability of HetSC and SystemC-AMS.", "venue": "forum on specification and design languages", "year": 2007, "id": "32267589-2b04-4aa7-b991-6a7438fc2c50"}
{"authors": ["Hongzhi Liu", "Jieqiong Xiong"], "n_citation": 7, "references": [], "title": "Research on the City Emergency Logistics Scheduling Decision Based on Cloud Theory-Based Genetic Algorithm", "venue": "", "year": 2011, "id": "322918a4-f724-4b3a-b21b-2abf7f5a3f09"}
{"authors": ["Auroop R. Ganguly", "Joseph Whitmeyer", "Olufemi Omitaomu", "Peter Brecke", "Mirsad Had\u017eikadi\u0107", "Paul Gilman", "Moutaz Khouja", "Steven J Fernandez", "Christopher Eichelberger", "Thom McLean", "Cathy Jiao", "Erin Middleton", "Ted Carmichael", "Amar Saric", "Min Sun"], "n_citation": 0, "title": "Towards a Characterization and Systematic Evaluation Framework for Theories and Models of Human, Social, Behavioral, and Cultural Processes within Agent-Based Models", "venue": "", "year": 2013, "id": "323c1d33-f150-4d7a-863d-7790b41d9842"}
{"authors": ["Ankur Moitra"], "n_citation": 11, "title": "Efficiently Coding for Interactive Communication.", "venue": "Electronic Colloquium on Computational Complexity", "year": 2011, "id": "3246ba30-93f2-4982-ba9e-a2583982943d"}
{"authors": ["Jo\u00e3o Ricardo Silva", "Ant\u00f3nio Branco"], "n_citation": 50, "references": ["0b2c9b2d-3e1b-4ee0-8425-1118efec730e", "13ab3d76-d678-4de8-9709-5e2eba776837", "499a9190-69f5-473d-8aaf-8dc76f16b709", "516d8d10-bba9-490e-af32-7953e5e7dcef", "8654c567-16e7-4ee2-825d-58f625a73168", "d02653f7-6854-4619-8a48-a3f1e47c9b84", "d7944382-3a32-4c74-9bf5-adf5a7689e97"], "title": "Assigning Deep Lexical Types", "venue": "text speech and dialogue", "year": 2012, "id": "32526d9b-7756-4fd9-a9dc-4a387e0e177a"}
{"abstract": "Location based services are becoming an emerging market due to technological advances achieved both at GSM phone operators and the multimedia nature of the mobile handsets. In this paper, a new methodology of mobile positioning integrating both GSM network using signal strengths and GPS readings in the light of an assisted GPS based approach. The methodology employs an extended Kalman filter approach in which the stochastic errors related to various measurements are appropriately characterized and modeled. The methodology uses Netmonitor software to retrieve network information including signal strength and cell-identities of various base transmitter stations (BTS). The distance from the mobile station (MS) to each BTS is therefore determined using Hata-Okumura radio propagation model. The different distances and the GPS readings are therefore combined in the framework of extended static Kalman filter. Once positioning is achieved, a .NET like application is implemented to access the Microsoft MapPoint Web Service, via the Internet (http protocol), which visualises the mobile's location on a map, finds nearby points of interest (POI) and computes routes between them. In order to demonstrate the feasibility of the proposal, experiment is carried out in Birmingham area and compared to the result yielded by the commercial software of MobileLocate Ltd. An accuracy of less than 70 meters has been achieved, which shows substantial improvement over standard Timing Advance related techniques and the commercial software.", "authors": ["Sadek Hamani", "Mourad Oussalah", "Peter Hall"], "n_citation": 50, "references": [], "title": "Combination of GSM and GPS signals for Mobile Positioning and Location Service Using Kalman Filter.", "venue": "world congress on engineering", "year": 2007, "id": "32583a95-d87c-45ca-a7f8-523efa8338fa"}
{"authors": ["Kennedy Nduati Njenga", "Irwin Brown"], "n_citation": 0, "references": ["1db3d2ca-4a6d-4e8e-b6cc-d646070070a2", "50160e47-0d68-48f8-86e7-40a1b9f31648", "7fe7eb74-aaf5-4a6a-af46-b78565372a28"], "title": "Conceptualising the Influence of Tacit Knowledge in Security Risk Management Activities.", "venue": "information security for south africa", "year": 2006, "id": "3260af2a-3b01-4119-806c-177a76f25a04"}
{"authors": ["Elisa Bertino", "Bruno Crispo", "Pietro Mazzoleni"], "n_citation": 1, "title": "Supporting Multi-Dimensional Trustworthiness for Grid Workflows.", "venue": "", "year": 2004, "id": "3260f031-a040-4dce-83be-7eb439c7668c"}
{"abstract": "Jstacs is an object-oriented Java library for analysing and classifying sequence data, which emerged from the need for a standardized implementation of statistical models, learning principles, classifiers, and performance measures. In Jstacs, these components can be used, combined, and extended easily, which allows for a direct comparison of different approaches and fosters the development of new components. Jstacs is especially tailored to biological sequence data, but is also applicable to general discrete and continuous data. Jstacs is freely available at http://www.jstacs.de under the GNU GPL license including an API documentation, a cookbook, and code examples.", "authors": ["Jan Grau", "Jens Keilwagen", "Andr\u00e9 Gohr", "Berit Haldemann", "Stefan Posch", "Ivo Grosse"], "n_citation": 30, "references": ["2fc852a8-3a6f-4543-afb0-538fa8580fae", "39a0415d-abe0-41ea-931b-1ef632129b9d", "644eacb0-b0e3-4b38-85d3-09480e0f2d6b", "b54503ab-7075-410f-a829-ca8dfb83e77d"], "title": "Jstacs: a java framework for statistical analysis and classification of biological sequences", "venue": "Journal of Machine Learning Research", "year": 2012, "id": "326352ae-73eb-437b-ac28-c28939135e38"}
{"authors": ["Antoine Laurent", "T\u00e9va Merlin", "Sylvain Meignier", "Yannick Est\u00e8ve", "Paul Del\u00e9glise"], "n_citation": 2, "references": ["30ac49e4-6e96-4d2a-bfc8-61d0d9448c31", "3cef1f28-71a6-4359-9fb2-3a17fa16f0d8", "4ae5d6f3-b5e2-4ea5-ab2d-bd6b0ca916e0"], "title": "Combined Systems for Automatic Phonetic Transcription of Proper Nouns.", "venue": "language resources and evaluation", "year": 2008, "id": "32676c0e-9ec8-4fbc-8741-4331c6c736d5"}
{"authors": ["Kaoru Kurosawa", "Shigeo Tsujii"], "n_citation": 0, "title": "An Efficient Method to Find Invalid Loops in a Communication Protocol and Its Application to HDLC.", "venue": "international conference on communications", "year": 1986, "id": "3277f69b-e503-41d0-a380-7078861a419e"}
{"authors": ["Charles J. Petrie", "Holger Lausen", "Michal Zaremba"], "n_citation": 8, "title": "SWS Challenge - First Year Overview.", "venue": "international conference on enterprise information systems", "year": 2007, "id": "3281a3c2-df97-4cdd-b0cc-bb63d2745f63"}
{"authors": ["Alessandro Panconesi", "Desh Ranjan"], "n_citation": 1, "title": "Quantifiers and Approximation (Extended Abstract)", "venue": "symposium on the theory of computing", "year": 1990, "id": "328e51d4-9a72-4772-8c58-f05c75315d8f"}
{"abstract": "The final publication is available at Springer via https://doi.org/10.1007/978-3-319-10422-5_36", "authors": ["Gema Bello-Orgaz", "Julio C. Hernandez-Castro", "David Camacho"], "n_citation": 50, "references": ["04eb8911-a003-481f-8272-a75f43d2c041", "0d954353-c5a3-40c8-8046-5a0c33a403a8", "18e474dc-f595-4f42-90ec-ee2889f380c1", "19857a90-3424-4859-9459-c563d00a0f2e", "27e60e90-3f57-45b3-a034-df7b906425bc", "4963b9cf-d717-4ec3-b94a-08b81ca63658", "5fd38888-eaeb-4122-9b0b-f0f7097a15e6", "642f1dc6-c11c-4657-bcb6-948b60723fac", "67bc5993-262a-473f-85a9-e439cc142794", "6dc1228c-18b7-4c91-9357-8de7c830ccf1", "794862f0-9d72-4b56-961f-280064018e93", "82cfc38e-1b32-4370-a9fa-707cac6d5961", "91832006-a677-4ecd-9029-f54dee398b5b", "948fdf8e-4214-4143-bde2-7b24b87b5966", "98e67229-36db-4902-af27-db2195f85f57", "b695853a-52ea-49db-acfc-7dad6c4a0362", "f4a99f00-3d3b-49ea-9bca-d6720970833b", "ff949ed3-8bf3-4c12-a21a-dd667b1ca99d"], "title": "A Survey of Social Web Mining Applications for Disease Outbreak Detection", "venue": "", "year": 2015, "id": "328ff460-ca4e-4f83-b100-0b3535b5f30a"}
{"abstract": "The objective of this survey is to present the ideal theory of monoids, the so-called Green's relations, and to illustrate the usefulness of this tool for solving automata related questions.#R##N##R##N#We use Green's relations for proving four classical results related to automata theory: The result of Schutzenberger characterizing star-free languages, the theorem of factorization forests of Simon, the characterization of infinite words of decidable monadic theory due to Semenov, and the result of determinization of automata over infinite words of McNaughton.", "authors": ["Thomas Colcombet"], "n_citation": 7, "references": ["103a2e94-e037-4f32-9a16-1f005aac5123", "360e465a-3228-40f4-ac4e-f78e5e08fc29", "3c309e6e-d8d2-4cf1-b4a2-21433c5b5591", "44f2798e-2293-441b-95f1-01ae0ccfe467", "692c9091-9c99-45ee-bdbd-f8f9cfc8725f", "6eda05ac-33d8-4729-ab1b-00149e1f0386", "7e9a4761-13e0-4383-a0dc-f76468e05bc9", "8bd3734f-12b3-4209-99b9-2ce18558853f", "987e8878-1ec1-4703-8176-6b7b09e68f37", "b0f6455a-6f99-42c5-8502-4fa535768ceb"], "title": "Green's relations and their use in automata theory", "venue": "language and automata theory and applications", "year": 2011, "id": "3293328c-f35a-4a9a-a359-5525e61f4549"}
{"abstract": "Millions of research funding has been put down to develop - what I call - old forms - of reasoning that are characterized by strong focus on theoretical properties and strict adherence to the completeness properties of reasoning procedures. Despite the large amount of work and results that have been achieved, various benchmarks reinstate that the progress does not suffice for needs in the scale of many enterprise applications and the Web.#R##N##R##N#We believe that a fundamental change in research on reasoning is required, giving up basic assumptions such as completeness to gain performance required in many real-world applications. These new paths should start with a deriving a clear understanding of what types of questions should be solved, where reasoning can help, where properties like soundness and completeness are really required and what impact of departing from those properties is acceptable.", "authors": ["Raphael Volz"], "n_citation": 3, "references": ["4d1e29b8-d332-4da6-b7e1-effe07120f39", "77abe687-a569-45ac-b44c-69c23c8a78e2", "dbb1c921-e178-4a2b-a72b-cd7e4a764858", "dfe63c5d-9f89-466d-92f9-2995338a1965"], "title": "Change paths in reasoning", "venue": "", "year": 2007, "id": "32a03fc6-b328-4340-8c80-994bbce6ef42"}
{"abstract": "With the increasing size of web data and widely adopted parallel cloud computing paradigm, distributed database and other distributed data processing systems, for example Pregel and GraphLab, use data partitioning technology to divide the large data set. By default, these systems use hash partitioning to randomly assign data to partitions, which leads to huge network traffic between partitions. Fine-grained partitioning can better allocate data and minimize the number of nodes involved within a transaction or job while balancing the workload across data nodes as well. In this paper, we propose a novel prototype system, Lute, to provide highly efficient fine-grained partitioning scheme for these distributed systems. Lute maintains a lookup table for each partitioned data set that maps a key to a set of partition ID(s). We use a novel lookup table technology that provides low cost of reading and writing lookup table. Lute provides transaction support and high concurrency writing with Multi Version Concurrency Control (MVCC) as well.   We implemented a prototype distributed DBMS on Postgresql and used Lute as a middle-ware to provide fine-grained partitioning support. Extensive experiments conducted on a cluster demonstrate the advantage of the proposed approach. The evaluation results show that in comparison with other state-of-the-art lookup table salutations, our approach can significantly improve throughput by about 20% to 70% on TPC-C benchmark.", "authors": ["Ning Xu"], "n_citation": 1, "references": ["12b5f05e-19e3-42ba-82e5-030ad311e3ae", "425ef4cd-313d-4559-b97d-2539022e51eb", "526789d7-2b83-44d7-8956-4bd0814f2189", "62416ed8-212e-4911-9348-f82d8477154c", "74e65052-3f72-4f4c-8899-c62715b68dac", "7f52f2f6-74e0-4fe2-8671-9edae50c6c35", "e2a02781-401a-48bf-a12e-a48ac4ef4432", "fa619312-6a30-40c5-bd8e-f09dffce0543"], "title": "Fine-grained data partitioning framework for distributed database systems", "venue": "international world wide web conferences", "year": 2014, "id": "32a04b21-acb9-4708-8da3-154d8e851b4a"}
{"authors": ["Hubert L. Dreyfus", "Stuart E. Dreyfus"], "n_citation": 1, "title": "Making a Mind vs. Modeling the Brain: AI Back at a Branchpoint.", "venue": "Informatica (slovenia)", "year": 1995, "id": "32aad8e9-22cd-45e2-b63f-5ee88bad8b79"}
{"authors": ["Nadja Damij", "Talib Damij"], "n_citation": 0, "title": "HEALTHCARE PROCESS IMPROVEMENT USING SIMULATION", "venue": "international conference on health informatics", "year": 2010, "id": "32acbc00-a7a4-4cba-936b-1cbfa7f99789"}
{"authors": ["Shawndra Hill", "Adrian Benton"], "n_citation": 50, "title": "Social TV: Linking TV Content to Buzz and Sales.", "venue": "international conference on information systems", "year": 2012, "id": "32d15b5b-cfc8-4286-85dc-199130c62325"}
{"abstract": "Mach bands are the pronounced light and dark bands visible where a luminance plateau meets a ramp as in a penumbra. A great deal of effort has been devoted to study these in order to understand the underlying neural circuitry. A number of theoretical models, linear and non-linear, have consequently been proposed starting from the seminal studies of Ernst Mach himself. In this work we demonstrate why no linear model of visual perception can explain the Mach band illusion although many such attempts have been made starting from that of Mach to some recent ones. From the same approach, we also systematically demonstrate why the Mach bands are weak or inexistent at step changes of intensity. A new aspect, viz. the scaling properties of the widths of Mach band has been studied to provide a unified approach to solve both these problems in vision.", "authors": ["Ashish Bakshi", "Kuntal Ghosh"], "n_citation": 0, "references": ["0dfc1e91-cb58-4753-921d-6b67947e38fd", "2b93e280-10de-4883-a17c-68f416c157fb"], "title": "Scaling properties of mach bands and perceptual models", "venue": "", "year": 2012, "id": "32d3eba0-cda7-4eb8-b4e1-6a96c64068c3"}
{"authors": ["Ka Kit Leung", "Kin-Hong Lee", "Kwong-Sak Leung"], "n_citation": 0, "title": "Adaptive Algorithm in Glossary Search.", "venue": "", "year": 2003, "id": "32df5fd9-95ef-4224-8a22-869f69b9fe5e"}
{"authors": ["Kristin Carlson", "Thecla Schiphorst", "Steve DiPaola"], "n_citation": 50, "references": ["10e45a76-ea35-41f2-9c39-20c6457c5cb3", "24dad73f-80b6-40ea-bb63-c7d7f3feff82", "33e4f444-6959-43f5-b42d-23851e057136", "3ea7ecce-dd21-46a4-a595-983d49f95a09", "42fff28e-3495-4354-9f81-bd90beef83e5", "66cef6b7-e77b-48b9-9367-23db29a03d3b", "67ed3510-5d73-4f2d-828a-b1ef27a55833", "6f5f215c-de12-44eb-8244-a8681c73d8b0", "73d3f845-6394-45af-925e-ef85ae7dcc13", "89dd777d-c900-47ce-9a82-531839592840", "8be56304-5dee-4c7a-a18a-b9710e322c5b", "ab127081-c47f-4f06-a4b4-97da5bf06d16", "be945546-684a-4ba4-9611-05cae811b319", "d4eb28ba-01e0-4ec3-9642-61ea860a609d", "e1e6afa0-6115-496a-9362-63b3fe0030ab", "e4ac7e38-78b5-425d-a315-99e7013ab02d"], "title": "Collaborative Choreography: A Critical Inquiry into Designing Creative Interactive Systems", "venue": "intelligent technologies for interactive entertainment", "year": 2014, "id": "3319ac6a-3d9c-4757-bb8e-0a494bb2a9da"}
{"authors": ["Durga Toshniwal"], "n_citation": 0, "title": "Using Moments for Feature Extraction from Time Series Data.", "venue": "software engineering and data engineering", "year": 2008, "id": "332b553f-47e8-4cda-80a8-38bab81c9580"}
{"authors": ["Hani Safadi", "Samer Faraj"], "n_citation": 31, "references": ["2227e9b9-6314-4da4-bb43-34fe1f9df681", "25e6a17c-de4e-4a51-926a-1dbe71cd4cc5", "3a2ee782-09ec-4f30-866a-8cc792ec64bd", "42454a8a-0cd9-4eee-8519-378485d80f4a", "50795edc-aae2-4f05-9024-6affe997141f", "5f317b3a-9a89-446c-b3b6-fc83c3bc315d", "6767faa0-5a5b-48c4-bfad-91bf34d652da", "762296ad-e194-4403-bf5e-c3baf67891d6", "7d6524e2-9a50-4d2d-9030-eb0a6e16e2cd", "7f3a17fb-3761-41fe-9bd2-50c720fe8e4b", "95de7144-651b-40af-9a3c-60b742bffadd", "a43a4272-9038-4802-9ad7-e1848566cfcb", "ca48d434-3b5d-4c23-829d-bf1fb8c4afcd", "f0fef4a6-0a6b-442a-80b1-ef2f848013c5"], "title": "The Role of workarounds during an OpenSource Electronic Medical Record System Implementation.", "venue": "international conference on information systems", "year": 2010, "id": "337dcc3d-f453-48a0-aec4-e0550ed38bbf"}
{"authors": ["Anna Jaglarz"], "n_citation": 0, "references": [], "title": "The Evolution of Public Hygiene and Sanitary Facilities in the Context of Urbanization Processes and Social Conditions", "venue": "", "year": 2014, "id": "33876943-f64d-4d70-a09b-425ac31078ed"}
{"authors": ["David Redlich", "Thomas Molka", "Wasif Gilani", "Gordon S. Blair", "Awais Rashid"], "n_citation": 50, "references": ["08e139c7-baf8-4ed3-a927-31c62d2a5a5c", "15c67eca-f869-457a-b844-cd174e4ac3af", "341efec9-398c-44f1-922c-a5fee0c4ac84", "880d815c-9ffd-4075-b8ac-5c0745c51750", "95e63df9-6be3-43e3-a482-5924927d60e0", "b90abb45-3f1c-466e-a696-49df1341d16a", "c0d941f1-e9b0-4206-b25f-46dde41ef7ac", "d33e5a73-9e22-46d2-80d4-aa016ff9b620", "fb63a144-94aa-479f-b9ca-cf14bef3112c"], "title": "Constructs Competition Miner: Process Control-Flow Discovery of BP-Domain Constructs", "venue": "business process management", "year": 2014, "id": "3390e18d-6159-4aa7-bb7d-53cf5a85a589"}
{"abstract": "In a directed flow network we assign capacities on vertices as well as on edges. We consider a (\u03b4, \u03b7)-balanced flow problem of single commodity case. A (\u03b4, \u03b7)-balanced flow is defined as a flow such that the flow value at each edge is not more than \u03b4, \u010b f and the flow value at each vertex is not more than \u03b7 \u010b f, where f is the total amount of the flow. Based on (\u03b4, \u03b7)-balanced flow, the (\u03b4, \u03b7)- capacity is defined for a mixed cut in a network. A mixed cut in a network is a set of edges and vertices removal of those separates the network. Then the max-flow min-cut theorem for this (\u03b4, \u03b7)-balanced flow is proved for the single commodity case in a directed network. The theorem for (\u03b4, \u03b7)-balanced flow is not easily to be proved by only applying the max-flow min-cut theorem of ordinary flows. Then we show a method for evaluating the maximum (\u03b4, \u03b7)-balanced flow. The algorithm gives the maximum value of (\u03b4, \u03b7)-balanced flow between s and t in N with at most |V| \u010b |E| evaluations of maximum flow in a network, where V is the vertex set of N and E is the edge set of N, respectively. Each evaluations of the maximum flow is performed in N with altered capacities on edges and on vertices. We can apply all the results to undirected networks.", "authors": ["Wataru Kishimoto"], "n_citation": 50, "references": ["11cba3a2-8832-42a6-8027-c11c4a595d34", "1b41d9a0-3857-4fb6-b7ba-d39da73c04dd", "40e83483-0cf7-4af9-af5b-df0f85903260", "4e413a95-6a4e-4d06-bdfa-c7e8b190981a", "592b5465-d378-4a95-a58b-2882727efc9b", "7943047d-0d04-40a8-9c89-b79d1d03755f", "8285353b-138b-4dcf-a960-2e307d8e6fd1", "a6d12155-6e7b-4992-bdce-27f6e5ca2b20", "bd485cf3-2982-4fe3-be65-895f4878fcc1", "dc2381b4-fd0c-4b97-9e2f-7075c1c0f3c7", "f85ab39e-dccc-4117-9b0d-5aa5876753d8"], "title": "A method for obtaining the maximum (\u03b4, \u03b7)-balanced flow in a network", "venue": "", "year": 2011, "id": "3397b8e0-d09f-470c-a746-309dde822c33"}
{"authors": ["Laurent Bussard", "Gregory Neven", "Franz-Stefan Preiss"], "n_citation": 50, "title": "Matching Privacy Policies and Preferences:Access Control, Obligations, Authorisations, and Downstream Usage", "venue": "", "year": 2011, "id": "3399d7a7-2e27-4431-aeac-5a0356811f15"}
{"authors": ["Hirotaka Osawa", "Jun Mukai", "Michita Imai"], "n_citation": 13, "references": ["4e96e830-7148-4a45-97bc-fc76f62cb8ea", "6243838a-c60a-458a-a1e4-81b5f4f888c1", "c075f11b-4ea0-4642-9910-17b3524667a8", "d4a3cdff-ec97-421e-a04c-f901a0d58c91", "d8598340-2bf1-453e-80ec-864bfe11a67b"], "title": "Anthropomorphization Framework for Human-Object Communication", "venue": "Journal of Advanced Computational Intelligence and Intelligent Informatics", "year": 2007, "id": "339acf8c-2f4e-42c8-8981-f1d8dccc23e7"}
{"authors": ["Boon-Yuen Ng", "Atreyi Kankanhalli"], "n_citation": 5, "title": "IT Impact on Individual Work: A Study in the Context of Healthcare Services", "venue": "international conference on information systems", "year": 2009, "id": "33a6fda1-1b33-45b1-aba0-dc1949e1601a"}
{"authors": ["Michael Eberhardt", "Robert Hecht", "Andreas K\u00f6nig"], "n_citation": 0, "title": "Einsatz des Konzepts Machine-in-the-Loop-Learning.", "venue": "", "year": 2002, "id": "33b32ca7-1fa4-4284-b191-9846c8b65609"}
{"abstract": "The spectral transform method is a standard numerical technique for solving partial differential equations on the sphere and is widely used in global climate modeling. In this paper, we outline different approaches to parallelizing the method and describe experiments that we are conducting to evaluate the efficiency of these approaches on parallel computers. The experiments are conducted using a testbed code that solves the nonlinear shallow water equations on a sphere, but are designed to permit evaluation in the context of a global model. They allow us to evaluate the relative merits of the approaches as a function of problem size and number of processors. The results of this study are guiding ongoing work on PCCM2, a parallel implementation of the Community Climate Model developed at the National Center for Atmospheric Research.", "authors": ["Ian T. Foster", "Patrick H. Worley"], "n_citation": 19, "title": "Parallelizing the spectral transform method: A comparison of alternative parallel algorithms", "venue": "", "year": 1993, "id": "33ba11b9-1761-49ad-9d34-4a1a02c0267d"}
{"authors": ["Debra Howcroft", "Elaine Ferneley"], "n_citation": 0, "title": "A Critical Approach to Information Systems Development", "venue": "european conference on information systems", "year": 1996, "id": "33bbd9f4-73c2-4e83-a3bd-86e70a4cca5e"}
{"authors": ["J.R. Rook", "Klaus Fellbaum"], "n_citation": 0, "title": "Ermittlung einer einfachen Wortprosodie aus orthografischem Text f\u00fcr die Sprachsynthese.", "venue": "", "year": 1987, "id": "33c84be1-1927-4d91-ad77-14db2ed5c64d"}
{"authors": ["Benjamin Fabian", "Florian Goertz", "Steffen Kunz", "Sebastian M\u00fcller", "Mathias Nitzsche"], "n_citation": 22, "references": ["0e4805b4-96fe-4fdd-aa3c-88e710467053", "2c2687a9-cf16-40a7-a4d7-6329e683b342", "3a1ae747-111b-4415-a700-9f3f14690093", "803af80f-0a91-4916-86f6-73965b65a56c", "a3d748c3-2e1c-49c2-8ed3-5b3ae05e4d96", "a83f24af-27ed-4717-85a7-e048b4a9e3c2", "b4bfd4d3-2691-4609-8bac-a5b0bfe0d8c8", "b7f8f6bc-94a0-46c7-9527-5a119b99ade4", "c1e4e16c-7152-4ddd-a763-5ad856c105f1", "e6b169a3-8f9e-4696-bb0e-828298937415"], "title": "Privately Waiting \u2013 A Usability Analysis of the Tor Anonymity Network", "venue": "", "year": 2010, "id": "33c98ab7-e2a0-4993-b1de-8c18df3544c3"}
{"authors": ["Aura Castillo-Matias", "Rosemary R. Seva"], "n_citation": 50, "references": ["a63c21fb-cf83-4306-8594-d8dde95d6069", "ee2ff4d5-5127-4a41-8c6c-c406dbe26c2b"], "title": "Usability in Philippines", "venue": "", "year": 2011, "id": "33cf8415-666b-423a-aed3-da4ef901a53b"}
{"authors": ["Mark Z. Mao", "Vincent Vanhoucke"], "n_citation": 50, "references": ["0aa0a468-f6c1-4240-bedd-9898923d0fcc", "23491293-08d9-4dfd-9e57-69538579baa3", "3b31f305-b2ac-4d8f-9962-ed25351e7280", "46461a54-4632-4df6-9c4a-a16a39809295", "5f43cb56-aa46-40d5-a6f6-276fdb00b9ae", "60d8c35e-e5f8-4f7d-bff7-6db1c274dbe4", "89d3929b-57f4-4ac0-aa7e-850e58426f25", "963c865e-e5f2-4d68-818a-c7fba63689b7", "9f871291-1a0a-48b7-9f4b-c607f12fd5aa", "a5435244-bf45-4fb1-8ee1-d947f713f5d3", "a67a99c7-9beb-40ed-b1a7-1cb413d83c4a", "d2a36e2e-00db-4998-80be-df66f40e16b6", "f179ab87-ee9d-47ba-af4a-970f5fd9ea22"], "title": "Design of compact acoustic models through clustering of tied-covariance Gaussians.", "venue": "conference of the international speech communication association", "year": 2004, "id": "33f07af8-41b1-4c80-a585-57d5a4f87e20"}
{"authors": ["Jungmin Park", "Sung-Hwa Hong", "Ingeol Chun"], "n_citation": 0, "references": ["00199e54-1891-4e79-b6e5-ca2b631753d4", "169f29a8-22b9-4411-b6cd-e6d64982e810", "40d5d62c-353e-408b-8256-2c59128ca519", "66bfb6f3-aaa9-4920-a320-c2926d2332e0", "99265ee3-4e2c-42a3-ac6b-e283349e6516", "c4ccc9a2-48b9-4fa8-b5c8-0fe948e74c9e", "d6285e34-13fa-4327-b4f9-203181baa8c6"], "title": "Approach to Generating Monitoring Code toward Advanced Self-healing", "venue": "", "year": 2011, "id": "34022ba7-35a5-422a-984f-13361b1afed0"}
{"abstract": "Estimation of Distribution Algorithms (EDAs) require flexible probability models that can be efficiently learned and sampled. Restricted Boltzmann Machines (RBMs) are generative neural networks with these desired properties. We integrate an RBM into an EDA and evaluate the performance of this system in solving combinatorial optimization problems with a single objective. We assess how the number of fitness evaluations and the CPU time scale with problem size and complexity. The results are compared to the Bayesian Optimization Algorithm (BOA), a state-of-the-art multivariate EDA, and the Dependency Tree Algorithm (DTA), which uses a simpler probability model requiring less computational effort for training the model. Although RBM\u2013EDA requires larger population sizes and a larger number of fitness evaluations than BOA, it outperforms BOA in terms of CPU times, in particular if the problem is large or complex. This is because RBM\u2013EDA requires less time for model building than BOA. DTA with its restricted model is a good choice for small problems but fails for larger and more difficult problems. These results highlight the potential of using generative neural networks for combinatorial optimization.", "authors": ["Malte Probst", "Franz Rothlauf", "J\u00f6rn Grahl"], "n_citation": 0, "references": ["018eb665-354d-4c90-a6f7-9711671fff0e", "0455679a-3b58-4d49-9201-71deccaea00f", "13f20a5b-b701-4083-95cf-1ae43bf28302", "17a6c30b-3b48-4246-8d34-b7c0212052ec", "19ee8d2a-1dca-40f7-bfb9-ad800108410e", "1af22edc-af0b-4539-9720-33b76466a068", "2090f4f6-ae88-4aa1-b078-4c203d5eb24c", "2d032539-3a12-4d9c-8723-cbb593b7b4ec", "312e18ce-76ed-4964-a03e-59d51e8671bf", "37a9e2f5-edd7-4d36-a01a-5adda693a5a7", "3da39db9-c58f-4ec4-8056-4b9463e2e879", "430acbd2-45ef-47c9-91e0-f5785658fa02", "4453fa3b-308f-472a-be61-65d1ce5c3de2", "48035b1b-b2ac-47a0-975e-1bbef6e396c5", "49e15f5d-44e6-47e9-b94b-db0291609b30", "4fb54171-f2d0-428a-a826-43a7a5d0d9a8", "62b6cf29-8074-4dbc-82d1-cac9fd40ab63", "63100618-a929-4b3f-bed4-4b51a487f1ee", "6a414f2d-2125-4ff2-98c1-e8231751bdfd", "6a6b9aa6-683f-4c7c-b06e-9c3018d10fd3", "6b605105-c55a-4d99-b3b0-2c4924e36988", "6dd62e22-a626-45b8-b686-6e6d647b1179", "6ebf5506-5b54-431b-8a4f-f90e4622d630", "70f4f89a-a7ed-430d-b149-81e5cc6a7610", "717d6a25-0da0-4134-84a9-4bc18d822bdf", "7aa454b2-47c6-4117-b823-1df65289e8e7", "83f9cd35-3885-47ba-90d3-42ad44563553", "89f10062-acf1-4171-b882-f3222c3a357e", "8e2d5908-b081-48af-b896-a7d24fced952", "9e7d5d76-e050-4873-bb11-feb35db765ee", "a8146c80-d1a2-4d06-866b-719dd4048e8c", "ae22966a-0564-44bc-9be2-3d5111b1a6bd", "c411de16-9084-4bf4-b192-81fdf64af622", "cc97888b-86b5-4c55-ac8a-e1321779d87b", "cdafb83b-4b7c-4276-88fd-aba2e6fc3edd", "cfa3c687-2753-470a-9ff8-3e07dd7dd0cf", "cff535d0-5cea-4ef6-9fd1-21338b33752c", "d6903719-3dd6-4d33-a4fa-95b473539dc7", "e4b468aa-2b23-4229-8872-f9286464a19f", "eb67c40d-674c-4229-80d0-9da8965c506d", "eea790f8-29ea-4136-8fb2-95a955ea51f9", "f3fda42d-2a78-4b65-b9e1-c28378dbe84c", "f6102128-ce04-4998-bc36-8ceb253a8eff", "f8431861-d556-41ea-b826-b43a05878caf", "fa1f216b-1841-4430-9aab-614723afc42d", "fd1d065e-4a4b-430a-a1c5-e549a6843b21", "ff4538b7-12dc-457a-b2a7-9a74a36a8538"], "title": "Scalability of using Restricted Boltzmann Machines for Combinatorial Optimization", "venue": "European Journal of Operational Research", "year": 2017, "id": "34066529-0350-49aa-bfa4-31561cbf3c9f"}
{"authors": ["Manuel \u00c1lvarez", "Juan Raposo", "Fidel Cacheda", "Alberto Pan"], "n_citation": 16, "title": "A Task-specific Approach for Crawling the Deep Web.", "venue": "Engineering Letters", "year": 2006, "id": "341218a0-de63-40bc-896c-f0ada8653ed7"}
{"authors": ["Ponnuthurai N. Suganthan", "Eam Khwang Teoh", "D.P. Mital"], "n_citation": 1, "title": "On Attributed Relational Graph Matching Using Hopfield Network.", "venue": "european conference on artificial intelligence", "year": 1994, "id": "3422ca0b-5bce-4bf4-9727-356c92260bbf"}
{"authors": ["Karl Aberer"], "n_citation": 0, "references": ["68f19de1-c05e-4b12-91db-cddde5a1a9d7"], "title": "Call for Book Reviews.", "venue": "Sigmod Record", "year": 2003, "id": "3437395c-37c2-4632-bb83-d49a2a07beb2"}
{"abstract": "We present a fully-automated, model based, multilayer cache partitioning scheme for multiprogram workloads running on multicore machines. As opposed to prior efforts, this scheme partitions shared caches at multiple layers simultaneously in a coordinated fashion. This scheme tries to achieve two objectives. First, it tries to satisfy the specified quality of service (QoS) values for all applications by partitioning the shared cache hierarchy across them, and second, it distributes the remaining excess cache capacity (if any) across applications such that a global performance metric is maximized. Our experimental analysis shows that the proposed multilayer partitioning scheme generates, on average, 33.1% improvement (on the weighted speedup metric) over the next best-performing scheme and is very successful in satisfying the QoS requirements of applications. Also, we show that partitioning each layer in isolation cannot generate the benefits obtained through our coordinated partitioning scheme. In addition, we observed that the difference between our scheme and an optimal scheme (that derives best dynamic partitions) was less than 15% for all the workloads tested and 6.6% on average.", "authors": ["Mahmut T. Kandemir", "Ramya Prabhakar", "Mustafa Karak\u00f6y", "Yuanrui Zhang"], "n_citation": 2, "references": ["0347098e-1005-4266-9c6e-2f2e64037412", "184e86a1-1103-4744-a50b-8d9604119351", "20d28824-b9e3-4ab2-a7e4-9b3c4ac9a5f4", "26d36318-b26e-4bfd-adfb-a64c05a456b0", "437b6b56-a171-42dd-adce-5be215a3d2e1", "4a769ef8-7b0b-4cf8-bd5a-b84011a58f74", "5394d502-c504-45ab-b691-307206182f20", "5bc4eaba-3dbd-4725-b41c-ad6819e5f7ea", "6374a07c-68d4-4cb7-bd48-f0700e80ef74", "8e2cf649-0dbf-4142-82df-698dc848fe3f", "a0cfbea4-310b-4762-a451-6b8b58391e4e", "e52bccf1-85ce-4636-8cbc-6652e0cdf900", "faf6f023-8f76-4c49-9d14-5230d81d8b60", "ff4b84a7-8e8e-4379-ae3b-f92f23ef8291"], "title": "Multilayer cache partitioning for multiprogram workloads", "venue": "european conference on parallel processing", "year": 2011, "id": "344d9591-20c2-4a3c-9a11-e9116e930465"}
{"authors": ["Bjoern Niehaves", "Ralf Plattfaut"], "n_citation": 7, "references": ["152d6885-2f57-4b60-ac5d-6a62a528ee94", "358685cd-228e-4010-8d58-f2c7c7abee68", "47ab027f-d4a0-465e-ad5d-fd577323b5d2", "4cc56c96-040e-4881-b521-8a2122fa3218", "5365f156-c4fc-49b4-8c5e-13c68e4a12de", "5a378186-6824-4a4a-83c5-a1789d7f379e", "5ae718f5-5a2e-4f03-b312-f714a553764a", "5c4d1a87-7ced-4b17-a1b2-d9520f097b58", "60277d80-b66e-473e-a3d1-42b89faf99b6", "678e244a-239e-481e-8944-8d73bc688129", "6e1500b0-e197-4756-b057-d536bcc7e7b9", "6e19e199-a9b3-40f2-a748-ef17fa9dc6ed", "721bfadc-e62a-4452-aa08-da02251ca754", "76e6d167-718e-468e-acac-3f939e06785a", "7d7fa307-8355-4c61-aaf7-1b032dd9c105", "7e4aa297-0815-4d53-92c5-7c915baf2f06", "8346d9dd-281a-4d8a-84e5-40024be4e5c5", "85d58551-ad9d-4915-8abe-f9fe92ad4b75", "8a562bbb-b08b-4540-9529-9b6f44100919", "8fe825bb-a68b-4c4c-baa4-b9960d56a0d4", "94ad211d-7419-40d0-b3eb-447ddf17f462", "9e9fe771-f7b6-4869-a6ce-e48ef4cc68ba", "a14a3b08-f4ae-4e66-b4fc-7b40c31c0ef9", "bc29f7d8-f109-4d68-bfa8-d829ef4fd472", "bfb86453-27d8-41a3-a8b3-06051ba57044", "d3b390ee-d76a-4eed-b220-9df9c41d5c4a", "d821e362-c524-44c6-a333-dd3e3ba58dcc", "da89367c-8248-44dd-a158-a6806fa21ab9", "dc82f487-c652-4403-b231-4d288777f280", "dececa6c-f2cf-4d98-b2ad-371830c3c858", "e054ebd7-e48f-4f0e-8a93-a6353f023b02", "e1148f35-5fd3-4acd-8156-5b7fd01d5cfd", "e247a6b0-6f5e-4e9b-9d7c-72b65ae59467", "e907eb55-c4b8-4bc3-8def-60091299f7ed", "f23d3ca7-3f0a-4e28-b957-00b7b0f44952", "f505579a-e46c-4297-8c15-f541d8ee60fa", "f68cb9f7-b668-4a14-b882-2beb964961ee", "f83ac39a-3bb8-41ec-8b45-e6c10a5a5e8c", "fea60884-bcd8-4501-8224-cb2ee478c837", "ffd1a51e-0306-4108-a199-1be39e622bd6"], "title": "Collaborative Business Process Management: Exploring Themes, Achievements, and Perspectives", "venue": "european conference on information systems", "year": 2010, "id": "3469ebd1-536a-46c1-98cd-f6a9dafc75c0"}
{"abstract": "Traditional methods on video summarization are designed to generate summaries for single-view video records, and thus they cannot fully exploit the mutual information in multi-view video records. In this paper, we present a multi-view metric learning framework for multi-view video summarization. It combines the advantages of maximum margin clustering with the disagreement minimization criterion. The learning framework thus has the ability to find a metric that best separates the input data, and meanwhile to force the learned metric to maintain underlying intrinsic structure of data points, for example geometric information. Facilitated by such a framework, a systematic solution to the multi-view video summarization problem is developed from the viewpoint of metric learning. The effectiveness of the proposed method is demonstrated by experiments.", "authors": ["Linbo Wang", "Xianyong Fang", "Yanwen Guo", "Yanwei Fu"], "n_citation": 3, "references": ["0f80ec27-572e-473b-a403-f0f7c47c4743", "18a85687-dde6-45b0-a9cf-9b027936496f", "1bc3f1ed-b02d-4e02-b463-3d290482d4af", "1d0a0a4e-2992-4f52-9086-93b0b717fb56", "22ebb916-bab4-45ea-80b5-42bea948a7bf", "246cd5c0-3eab-4d2b-aaec-beaf690586d4", "2c1ef298-fe10-4e4b-b525-1ea157169245", "2d702c22-e809-4c78-b18b-fd033ece0367", "4ac29cff-96ad-4302-85df-e58452b591e5", "4f5502fe-eb5f-465f-bfd0-7d1f2f3a6ab3", "5e10d054-8376-4d02-8f82-d7f3b974fde3", "62571797-cf9b-48c4-8cbc-291472416816", "77adda5f-376e-45b7-bf88-5af91f461965", "7b73c7a4-ee6b-42aa-8ba6-33d978938cd7", "7c3f444f-8c22-4780-aeac-01b711ecb77a", "7c90045b-63b9-4f29-82a0-bf7c914a6ef6", "7d49dc28-d04c-4906-a803-b17e67149da2", "845dad06-cc47-4646-946c-66d343f0d449", "87d794c5-9089-43d7-a812-de7fd55b1953", "9901fc6e-3411-41b1-a480-f9046baaab79", "b9248e98-b76f-4f1d-b938-c9af0b748f33", "b95eafd4-a941-4f12-8a47-e306e42552e9", "dbc33fa2-82c1-4ac5-853e-0b3e350c2e78", "fedae3c7-b796-43d1-93ad-da8f93c48276"], "title": "Multi-view Metric Learning for Multi-view Video Summarization", "venue": "cyberworlds", "year": 2016, "id": "348045c5-4d43-4c96-b106-e1038e5d4aaa"}
{"authors": ["Vincent Nollet", "Prabhat Avasare", "Diederik Verkest", "Henk Corporaal"], "n_citation": 50, "references": ["13ceb3d4-df9c-4834-ba85-d25c29e5e929", "1cc42278-9418-4470-aa05-451fb14d0525", "3920c118-f4e1-40a8-ac7a-84b8307ab703"], "title": "Exploiting Hierarchical Configuration to Improve Run-Time MPSoC Task Assignment.", "venue": "", "year": 2006, "id": "348c81f8-b4cd-479c-9e5e-e9ea8a0faccd"}
{"authors": ["Wei Li", "Rayford B. Vaughn"], "n_citation": 0, "title": "Efficient Update on Exploitation Graphs for Vulnerability Analysis.", "venue": "computer applications in industry and engineering", "year": 2007, "id": "348db979-12a6-4c2e-b741-3e88d6a5dcef"}
{"authors": ["Atsushi Kaneko", "Yoshiaki Oda", "Kiyoshi Yoshimoto"], "n_citation": 0, "references": ["836ae94c-c0bd-4774-b08a-aba51da3f86d", "9960a5f4-3d6b-4b9a-a872-874e7ef366df"], "title": "Some results on geometric independency trees.", "venue": "canadian conference on computational geometry", "year": 1999, "id": "3490cbe3-fdf1-428e-b668-fc8b5a8459fd"}
{"authors": ["Stephen E. Ross", "Chen-Tan Lin"], "n_citation": 1, "references": ["855491e5-81ad-4672-808e-32cee662e901"], "title": "A Randomized Controlled Trial of a Patient Accessible Medical Record.", "venue": "", "year": 2003, "id": "349fa7d4-3f59-43d8-992f-7a0a46f807ea"}
{"authors": ["Mark B. Beintema", "Jeffrey T. Bonn", "Robert W. Fitzgerald", "Joseph L. Yucas"], "n_citation": 5, "title": "Orderings of Finite Fields and Balanced Tournaments.", "venue": "Ars Combinatoria", "year": 1998, "id": "34b3b760-85ab-4e82-9dc8-663277f36c15"}
{"authors": ["J.P. Babary"], "n_citation": 0, "title": "On-line estimation and adaptive control of bioreactors\u2014Process measurement and control 1: G. Bastin and D. Dochain \u2606", "venue": "Automatica", "year": 1993, "id": "34d2a748-37f7-4c37-bb60-aa3c56f02e13"}
{"abstract": "The Information Age is upon us and it heralds a new paradigm in the way universities conduct research. Lack of understanding and a cautionary stance towards the Internet has left many universities lagging far behind the needs of its student population. Research shows that both students and academics are struggling on their own to learn about these new channels of information with little, or no, guidance from their educational institution. As a consequence, the Internet remains a little understood and poorly utilised mode of gathering resource information for many of today's and tomorrow's researchers.", "authors": ["Sally Foster"], "n_citation": 2, "references": ["e6083dd4-c121-4456-aa2e-45ea737546e2"], "title": "Australian undergraduate Internet usage: self-taught, self-directed, and self-limiting?", "venue": "Education and Information Technologies", "year": 2000, "id": "34d59b46-e75e-4bcb-8108-d0d5c4c17956"}
{"abstract": "Reconstructing binary matrices from their row, column, diagonal, and antidiagonal sums (also called projections) plays a central role in discrete tomography. One of the main difficulties in this task is that in certain cases the projections do not uniquely determine the binary matrix. This can yield an extremely large number of (sometimes very different) solutions. This ambiguity can be reduced by having some prior knowledge about the matrix to be reconstructed. The main challenge here is to find classes of binary matrices where ambiguity is drastically reduced or even completely eliminated. The goal of this paper is to study the class of hv-convex matrices which have decomposable configurations from the viewpoint of ambiguity. First, we give a negative result in the case of three projections. Then, we present a heuristic for the reconstruction using four projections and analyze its performance in quality and running time.", "authors": ["P\u00e9ter Bal\u00e1zs"], "n_citation": 7, "references": ["52114c6c-1019-4c10-9670-4d6e7b770603", "6650eab0-31a0-41a1-9db8-0c7467e6cd11", "6ff07323-50eb-48e1-99e4-740e2bbfc443", "7510895c-71e0-4378-ad0b-8d33651c799b", "aafb43fa-783c-4998-bfb0-0ebd421c334b", "d1f31b28-597b-491d-8bb1-54b8dff1d76e", "d567631f-687b-49ce-9033-dddd43e18221", "e18ea4a3-29b4-4472-92d5-9c837fba42c5"], "title": "On the ambiguity of reconstructing hv-convex binary matrices with decomposable configurations", "venue": "Acta Cybernetica", "year": 2008, "id": "34d5f23a-4e81-4ec4-94b6-c103a0e19d78"}
{"abstract": "In this paper, we address the lexicon design problem in Turkish large vocabulary speech recognition. Although we focus only on Turkish, the methods described here are general enough that they can be considered for other agglutinative languages like Finnish, Korean etc. In an agglutinative language, several words can be created from a single root word using a rich collection of morphological rules. So, a virtually infinite size lexicon is required to cover the language if words are used as the basic units. The standard approach to this problem is to discover a number of primitive units so that a large set of words can be created by compounding those units. Two broad classes of methods are available for splitting words into their sub-units; morphology-based and data-driven methods. Although the word splitting significantly reduces the out of vocabulary rate, it shrinks the context and increases acoustic confusibility. We have used two methods to address the latter. In one method, we use word counts to avoid splitting of high frequency lexical units, and in the other method, we recompound splits according to a probabilistic measure. We present experimental results that show the methods are very effective to lower the word error rate at the expense of lexicon size.", "authors": ["Kadri Hacioglu", "Bryan L. Pellom", "Tolga Ciloglu", "\u00d6zlem \u00d6zt\u00fcrk", "Mikko Kurimo", "Mathias Creutz"], "n_citation": 61, "references": ["1aa4acd3-304a-474e-a5c1-cb27ad3f46c2", "3dda09de-2fa2-42ed-99a9-fc8dc61e29e8", "49686c87-4796-43e1-922a-6fa694aef8c5", "4985c2fd-1a88-42c5-b043-dc266d9a956e", "4f1f92fb-c0cd-4e49-b47f-41fd2b51e8cd", "642a024c-d572-4695-ad8a-07895da1eb3e", "7acb36de-0d92-4b6f-b19c-0bf8d598317b", "81db7a34-1c60-4fa2-9472-9d1c47e33695"], "title": "On Lexicon Creation for Turkish LVCSR", "venue": "conference of the international speech communication association", "year": 2003, "id": "3521e1a1-1a8a-4b0e-b992-fcff7d8d6211"}
{"authors": ["Wolfgang K\u00f6nig", "Rolf Benken"], "n_citation": 0, "title": "Interview zu einem Unternehmensnetzwerk zur F\u00f6rderung der Pers\u00f6nlichkeitsentwicklung.", "venue": "Wirtschaftsinformatik \\/ Angewandte Informatik", "year": 2000, "id": "35250921-a19a-4b3b-9a8d-bd983617350a"}
{"authors": ["Xiaolei Li", "Wei Song", "Yanan Zhang", "Xu Liu"], "n_citation": 0, "references": ["32d63bb5-ca76-4125-ab4c-ac7624fef4bc", "c72783e7-a67c-41f6-801e-2d6484b459a4"], "title": "OpenGL Simulation System for ICF Target-Positioning", "venue": "asian simulation conference", "year": 2012, "id": "354a59ab-736e-4493-8d16-239ad43ceb95"}
{"abstract": "In this paper, we present a software keyboard called Ley- board that enables users to type faster. Leyboard makes typing easier by placing keys at the positions of fingers and their surroundings. To this end, Leyboard automatically adjusts its key positions and sizes to users' hands. This design allows users to type faster and more accurately than using ordinary software keyboards, the keys of which are unperceptive. We have implemented a prototype and have performed a long-term user study. The study has proved the usefulness of Leyboard and its pros and cons.", "authors": ["Yuki Kuno", "Buntarou Shizuki", "Jiro Tanaka"], "n_citation": 2, "references": ["279e4746-d6c8-4dd1-8f8a-9bdb5491cb9b", "47d9128d-df87-46c2-ad5a-c22c25f79e59", "4d28415a-e9f3-4a9e-ab5a-2f8092d70dd8", "55bced7c-78fd-4345-a8f6-5033f9a70e7c", "97e427cc-93eb-4dab-b8c8-00afabe9445a", "c5b12995-6be5-449c-b101-a7763f911fcc", "cc0bc93c-7daf-4c95-8ef7-f26e45c8ba7a", "cebc84ef-686b-43dd-ae70-90208e78cb83", "f96ff341-9e37-4ed7-98c4-d99ebfddd9d7"], "title": "Long-Term Study of a Software Keyboard That Places Keys at Positions of Fingers and Their Surroundings", "venue": "international conference on human-computer interaction", "year": 2013, "id": "35584323-09ea-4684-8217-aa076c494831"}
{"authors": ["Hermann Kopetz"], "n_citation": 2, "references": ["10ea52d8-56d3-4506-aab7-b1b64f5344c8", "26f6f06b-4504-4a8e-8ca9-1186357b6d82", "b4fc51da-aa32-4ad0-98f0-19b9bb10a6ad", "d0b6a903-17e7-44d9-bb28-8d390fdcba8f"], "title": "Temporal Uncertainties in Cyber-Physical Systems", "venue": "", "year": 2012, "id": "35800472-09c2-4cb9-a6c9-d422a849c372"}
{"authors": ["Kurt Freudenthaler", "Rolf Eisenhauer", "Hans-J\u00fcrgen Stenger", "Uwe M. Borghoff"], "n_citation": 0, "title": "Entwicklung eines KM Framework und Implementation Guide.", "venue": "", "year": 2003, "id": "35a76b28-3ab3-4d4f-9107-9adad113941c"}
{"authors": ["R. Bugalho", "Bruno Carri\u00e7o", "Claudia S. Ferreira", "Manuel Jo\u00e3o Oliveira Ferreira", "Rui Moura", "Catarina Ortigao", "Jo\u00e3o Pinheiro", "P. Rodrigues", "J. C. Silva", "Andreia Trindade", "Jo\u00e3o Varela"], "n_citation": 0, "title": "AVALANCHE PHOTODIODES FOR HIGH-RESOLUTION PET IMAGING SYSTEMS", "venue": "international conference on biomedical electronics and devices", "year": 2009, "id": "35d87a92-4c79-447e-87be-fd192c24a488"}
{"authors": ["Roberto Armenise", "Daniele Caso", "Cosimo Birtolo"], "n_citation": 0, "references": ["0c9fb3d4-8498-4569-b169-483cb0c40b56", "31797cc0-e8d6-47ab-a8a9-a6b3c13fce54", "73e33483-3e89-499e-8e43-4f8dbf81b680"], "title": "Evaluating Semantic Technology: Towards a Decisional Framework", "venue": "", "year": 2012, "id": "36030edb-ea51-4bc1-81cd-7590d4efff1a"}
{"authors": ["Margaret A. Boden"], "n_citation": 2, "title": "The logic of creativity", "venue": "international conference on logic programming", "year": 1993, "id": "3612262d-1aec-49a4-8855-d631b4964e04"}
{"abstract": "Social network games in Facebook are played by millions of players on daily basis. Due to their design characteristics, new challenges for game design and playability evaluations arise. We present a study where 18 novice inspectors evaluated a social game using playability heuristics. The objective is to explore possible domain-specific playability problems and to examine how the established heuristics suit for evaluating social games. The results from this study show that some implementations of the social games design characteristics can cause playability problems and that the established heuristics are suitable for evaluating social games. The study also revealed that inspectors had problems in interpreting cause and effect of the found problems.", "authors": ["Janne Paavilainen", "Kati Alha", "Hannu Korhonen"], "n_citation": 7, "references": ["1390dba8-429c-4022-835e-2fc26a9796d8", "3535e972-6db0-4c9d-8527-b5894c1a36b5", "6f16341e-b43a-4e2a-99ad-0f7cf7cb0227", "a0588e32-6fce-4a2c-ab20-8115516cc9b9", "b47e50b4-a87a-4c7b-aa6e-180fc54a8474", "becf8747-4a1b-446e-9695-9ccbf2ff799f", "c00087d5-92dd-4bc1-9256-a63b14cb0c79", "d8a515f5-2ff9-46d1-ae7b-6233a7785948", "f85354a9-14b7-453e-a388-dd4598ae94e2", "fe4d8598-fd97-4a5f-9b1d-f5f305e27d90"], "title": "Exploring playability of social network games", "venue": "", "year": 2012, "id": "3643b04f-b12f-4872-8b68-72962f6c249f"}
{"authors": ["Marcos Antonio Vaz Salles", "Eduardo Terra Morelli", "S\u00e9rgio Lifschitz"], "n_citation": 50, "references": ["054adb37-d881-4d23-aac4-e049f28d78df", "15f3cba0-0ac4-461a-a05c-028d94c46acd", "175b07a3-cc65-4be6-bdd4-61778d64e599", "1a1c3b4d-969c-4f70-8b87-f6ac734a53c4", "1f671093-a1cd-4b0f-a9ff-d73a59977a60", "29bc4581-c40b-455d-a2f9-e65dfe1e08fc", "489d1dc3-8c64-4612-8f57-99a0c0b76ca4", "5adbc7b1-c2dc-499b-83eb-40bbde93d68e", "6cad9bb5-d397-4464-a82d-7dd1354d7748", "7c1af1b2-d7a6-4990-9d96-0670d2a06df4", "90311064-2128-4afb-996d-a51d34c84055", "9c2edeee-3115-49b3-8cf6-effa50b63176", "9f7983cf-bf82-4e48-9d56-d680ec15efd3", "a203c42d-f50f-4add-a6b0-a4576f3b1580", "a378ca32-2b7b-4e03-942d-9214234b329f", "a3ab2a48-3936-4347-afff-e0be7b0ada5f", "afc6b7f2-4b3c-4a20-bc25-fdfe64fcf56c", "afe265a9-6a8d-4d1d-8629-e8d7de0dc8c4", "b001c2c0-80b5-4aa1-b5b3-783aaaa8f2f1", "b4885745-af35-4e66-9f60-5a34c1775d0c", "b4a7b782-fe42-4d63-b067-44e40cc12c28", "b8b40ab8-0ca9-4409-9d27-e31306c52514", "bed42bd3-2c25-4115-9e4c-a130144a3d0c", "d5e4f781-e72c-4099-ae57-4e22a1ef07ec", "e93bbf4b-dd52-4353-bdda-7ec917d1abbd", "eb4b6605-7038-4d36-8ea2-417d748f8255", "ecc5a5c5-3926-4f75-b7a2-30ea62a343ee", "f17350d0-99e9-4316-b563-e2b13fe4727f", "f3522661-5a05-4761-aa54-ac740ddd905b", "f457fade-c67c-4bef-ad8a-2c161848f6e5"], "title": "Towards Autonomic Index Maintenance.", "venue": "brazilian symposium on databases", "year": 2006, "id": "3653be87-a393-4d26-a816-8b86c2e882e4"}
{"abstract": "This paper explores the feasibility of constructing a document relevance calculating model based on lexical cohesion with structure analysis. In this model, by extracting the semanticrelative word clusters in documents according to the lexicon cohesion principle, documents are formalized in expressions which are composed of lexicon chains with structure information. And based on this kind of representation, document relevance calculation is substituted by semantic distance calculation of lexical chains. The feasibility of this novel approach has been examined by experiments conducted on Chinese Library Classification (CLC) dataset. The results show that the method makes good use of the background knowledge of ordinary users, and it is an effective method for relevance calculation of documents.", "authors": ["Yuming Zhao", "Bingquan Liu", "Xiaolong Wang"], "n_citation": 50, "references": ["0c4aa9b4-f955-4836-b8dc-1ca2dc92ab2e", "67288135-af65-4979-99ef-75e7d603e190", "708f92bc-9eb0-4a03-9c1e-1e54b3261eb9", "909b9060-0701-47c3-8abc-8455351e88fb", "e0164854-5b82-4502-bd31-a1580b8a931a"], "title": "Document relevance calculation based on Lexical cohesion with structure analysis.", "venue": "Journal of Chinese Language and Computing", "year": 2008, "id": "3664e43c-aeb0-47c3-ba0e-7f1e70bb2cfe"}
{"authors": ["Osman Yagan", "Armand M. Makowski"], "n_citation": 0, "title": "Random Key Graphs.", "venue": "international conference on networks and communications", "year": 2009, "id": "3670fbda-03ce-4d6c-be53-ff4c03100aa1"}
{"authors": ["Chun-Po Yin", "Hsiu-Chia Ko", "Li-Chun Huang", "Fan-Chuan Tseng", "Hsiu-Hua Chang"], "n_citation": 0, "references": ["00bb9a1e-3c2e-49ba-89dd-edb6e3a1d798", "02d99023-f12f-4c8f-b450-67d5339a92ad", "0ffbba6a-4711-4e10-ad37-358bd8cb6873", "22c866d0-81fe-4011-8149-676ac1fa02b8", "31c97d63-f96c-4895-b9a0-9e4b578aaea2", "36919094-c38d-4c4d-8228-a64818802246", "3bac5d08-74d8-4776-b976-c80acffe44d7", "67316eeb-77f8-43f4-b0bd-d604387e80f1", "6a08d18f-dc52-47bc-ae2d-e06e368e62a0", "6a5737b2-6b6e-4b6b-a536-7d2f71857606", "8593d600-aefc-4fc0-b7d6-6ab4393ef9cb", "97aa25fc-a728-47a0-b8c8-793db5777041", "9d912297-e52f-4ab6-add4-633e0f263933", "aaaf5963-f8b3-4e40-b79d-b541638105bd", "b541380f-8e36-4fd8-91b3-04cf1f8d2736", "d2f8e7b6-6290-486c-981b-44db12bce30e", "d5707c9f-323b-4336-8c0f-fa28062045b3", "ec9c6754-5d5a-47d0-84a8-4cbd0abd6eec", "f77240e7-7bff-4496-907b-f31675cc9b90"], "title": "An Empirical Evaluation Of User Satisfaction With A School Nursing Information System.", "venue": "pacific asia conference on information systems", "year": 2011, "id": "367e889f-7d1e-4de3-94bc-f3712f6fb8a1"}
{"authors": ["Michael Zock", "Gil Francopoulo", "Abdellatif Laroui"], "n_citation": 3, "title": "Language learning as problem solving.", "venue": "international conference on computational linguistics", "year": 1988, "id": "36ac20dd-d8de-4481-bd85-7c26a636f421"}
{"authors": ["Fabian Schmidt", "Martin Spott"], "n_citation": 50, "references": ["143c8393-3079-4db5-8f28-4eda5594b5a4", "20f52f8a-2e4f-45d0-9d9c-d9ede400c265", "530a99f9-c234-401c-931d-0c1836208105", "53fe4ed7-a7ad-43f1-a461-c6bce03e2967", "554eae2a-10ca-4d66-9ecd-e733f6dfa526", "5685129e-5cdc-493c-9118-230e7258a5e8", "576bd9d1-5e1c-4a2d-aae2-9e656fd129c0", "5a3e0fd9-1df9-41a5-8f93-588ad2f827ed", "805f8b0a-488a-43cb-acbd-bfeed60d69ba", "81a24061-fe7f-4313-a9ea-dba6fb7f05eb", "8e95338b-27d6-46f0-89a8-45060321900b", "a9e1f5aa-b60f-4ef4-84fd-1b749046bd03", "af0acfe5-7afe-4f1a-a305-89c361d0c8a0", "c0ac77b3-0e25-4556-9f2d-29c6c2c4d7d2", "cb3a659c-bf9b-43a2-a905-32ec7448bb96", "e959176d-982a-41d5-b4a0-a816ed340310"], "title": "Visualising Temporal Item Sets: Guided Drill-Down with Hierarchical Attributes", "venue": "soft methods in probability and statistics", "year": 2013, "id": "36b0eae7-e37a-4853-a740-9e9468242942"}
{"authors": ["Judith Ellen Devaney", "John G. Hagedorn"], "n_citation": 1, "references": ["4b7d2545-5eee-4b96-bd69-3d0abb83e255"], "title": "The Role of Genetic Programming in Describing the Microscopic Structure of Hydrating Plaster.", "venue": "genetic and evolutionary computation conference", "year": 2002, "id": "36ef6890-e998-46f6-99e3-22203f526289"}
{"authors": ["Chenghui Huang", "Jian Yin", "Dong Han"], "n_citation": 0, "references": ["101843a4-5784-4e13-a715-f10196ca3f40", "48891495-cf70-4fd7-bde4-3566f4d430ce", "48a9170d-0348-4b32-9db7-a53982153459", "52b9639b-57a6-4b3a-ac6c-16afe6b386bb", "ac14afe6-de4d-4056-b2ac-0f6e36f369a2", "c0e60e0f-5efb-4a1c-9093-8855a8ec07d5", "e5fea480-e629-4561-9d36-96242854195b", "e9abffef-c6bf-44da-a673-be480773dbbb", "f3fddc67-a655-42cf-8575-553976fe3264", "fc8a32b8-87d0-41ce-9b58-368948b270aa"], "title": "An Improved Text Retrieval Algorithm Based on Suffix Tree Similarity Measure", "venue": "", "year": 2010, "id": "3714b1a0-2057-4499-af7d-d138fd9eca9c"}
{"authors": ["Hichem Ayed Harhira", "Samuel Pierre"], "n_citation": 0, "title": "A novel connection admission control mechanism with statistical delay constraints in MPLS networks.", "venue": "high performance computing, networking and communication systems", "year": 2008, "id": "371791c0-aebc-428b-a37f-10f241bad768"}
{"authors": ["Jean Beney", "Jean-Fran\u00e7ois Boulicaut"], "n_citation": 50, "references": ["06f01e12-ad3a-4bfa-8b11-de300badbaa0", "624e099c-756f-4261-934e-ab673ca4c448", "d9f103d5-e560-427b-b9eb-22520a0c72f4", "dad10223-c1b9-413a-9585-32a11674cc7f"], "title": "STARLET: an affix-based compiler compiler designed as a logic programming system", "venue": "compiler construction", "year": 1990, "id": "371e301a-68df-45ad-80da-dc3c2a9bfff7"}
{"authors": ["Holger Giese"], "n_citation": 26, "title": "Object-Oriented Design and Architecture of Distributed Systems", "venue": "", "year": 2001, "id": "372379be-6a45-410c-b50b-d2810c6be5f6"}
{"abstract": "This paper presents a feature fusion approach to the recognition of human actions from multiple cameras that avoids the computation of the 3D visual hull. Action descriptors are extracted for each one of the camera views available and projected into a common subspace that maximizes the correlation between each one of the components of the projections. That common subspace is learned using Probabilistic Canonical Correlation Analysis. The action classification is made in that subspace using a discriminative classifier. Results of the proposed method are shown for the classification of the IXMAS dataset.", "authors": ["Rodrigo Cilla", "Miguel A. Patricio", "Antonio Berlanga", "Jos\u00e9 M. Molina"], "n_citation": 2, "references": ["0f80ec27-572e-473b-a403-f0f7c47c4743", "13d83701-8e72-482a-882e-fc1450146d6e", "177b7083-bfca-472b-833a-515f1ad77735", "1a29de7b-13f8-42b6-a44e-838ac8a839b3", "298b078c-074b-4bbb-be84-d6cf7975b950", "3baf7125-32d2-4b68-be3b-148377f12718", "477909c4-4d70-4a7d-a156-4fab18ed1434", "58d89a71-b6dc-4845-94fe-c46439a96899", "6018522a-423a-4d59-870f-fe8fe748dd3a", "6f55ea8b-1c1f-4348-ae81-d47854eedaf2", "70b1b07b-db3c-4268-8031-e55124e781e7", "8f42289f-0240-44ba-af28-bcc1c9ceb7e1", "a8a774b3-ab88-45a9-a764-c29783ec9138", "ada882eb-ed49-4b81-8f3f-72869d6e88da", "ae829318-5d10-461d-9c99-34a95a3f8732", "b9523824-d642-4fd5-a7b7-e220cbc71e07", "c7b3703f-be12-47bc-8357-64b58aafb67b", "e08291f0-068d-45fe-8a91-63f9c48386d0", "ea0481c6-5a8d-40ea-b0d4-a25469d4cd07", "fa5801c8-952d-474f-a2bb-a0480d67ce74"], "title": "Multicamera action recognition with canonical correlation analysis and discriminative sequence classification", "venue": "international work-conference on the interplay between natural and artificial computation", "year": 2011, "id": "37361655-acdc-43ec-a5cb-9b2e0352a6cf"}
{"abstract": "Cluster analysis is one area of machine learning of particular interest to data mining. It provides for the organization of a collection of patterns, represented as a vector in a multidimensional space, into clusters based on the similarity of these patterns. Medical decision support is also of increasing research interest. Ongoing collaborations between cardiovascular clinicians and computer science are looking at the application of neural networks, and in particular clustering, to the area of individual patient diagnosis, based on clinical records. The cardiovascular domain is characterized as a mixture of continuous and discrete data. This limits the use of the K-means algorithm, which is widely used for partitioning clusters in data mining. This paper presents an improvement on the K-means algorithm (KMIX) and allows its application to the mixture of attribute types found in the cardiovascular domain.", "authors": ["Thuy Nguyen Thi Thu", "Darryl N. Davis"], "n_citation": 50, "references": ["1017d9d4-9a4c-423d-ad40-6d9bebbd6b31", "38135245-8eff-4078-af6a-ea559ffa660b", "3c70ef99-f6ec-49dc-b425-ba3f3e5fca5d", "8494f847-142e-467e-9c9f-a9a78d88137d", "b3056cc8-2d01-40af-833e-8928a232030f"], "title": "A Clustering Algorithm for Predicting CardioVascular Risk", "venue": "world congress on engineering", "year": 2007, "id": "37373177-03f7-42b2-b267-7301323ae124"}
{"abstract": "Avec l'essor du Web 2.0 et des technologies collaboratives qui y sont rattachees,le Web est aujourd'hui devenu une vaste plate-forme d'echanges entre internautes.La majeure partie des sites Web sont actuellement soit dedies aux interactionssociales de leurs utilisateurs, soit proposent des outils pour developper ces interactions.Nos travaux portent sur la comprehension de ces echanges, ainsi que desstructures communautaires qui en decoulent, au moyen d'une approche semantique.Pour repondre aux besoins de comprehension propres aux analystes de siteWeb et autres gestionnaires de communautes, nous analysons ces structures communautairespour en extraire des caracteristiques essentielles comme leurs centresthematiques et contributeurs centraux. Notre analyse semantique s'appuie notammentsur des ontologies legeres de reference pour definir plusieurs nouvelles metriques,comme la centralite semantique temporelle et la probabilite de propagationsemantique. Nous employons une approche \" en ligne \" afin de suivre l'activiteutilisateur en temps reel, au sein de notre outil d'analyse communautaire Web-Tribe. Nous avons implemente et teste nos methodes sur des donnees extraites desystemes reels de communication sociale sur le Web", "authors": ["Damien Leprovost"], "n_citation": 0, "title": "D\u00e9couverte et analyse des communaut\u00e9s implicites par une approche s\u00e9mantique en ligne : l'outil WebTribe", "venue": "", "year": 2012, "id": "373f0bba-a664-42aa-b69a-b0406853b9da"}
{"authors": ["Takeshi Inaba", "Lifeng He", "Kenji Suzuki", "Kazuhito Murakami", "br", "Yuyan Chao"], "n_citation": 5, "title": "A Genetic-Algorithm-Based Temporal Subtraction for Chest Radiographs", "venue": "Journal of Advanced Computational Intelligence and Intelligent Informatics", "year": 2009, "id": "374451b6-37bd-4053-93e8-401ea5815542"}
{"authors": ["Uk-Pyo Han", "Sang-Eon Park", "Seung-Nam Kim", "Young-Jun Chung"], "n_citation": 0, "title": "An Enhanced Cluster Based Routing Algorithm for Wireless Sensor.", "venue": "parallel and distributed processing techniques and applications", "year": 2006, "id": "37584185-4d12-4890-aea8-2011a69f6e65"}
{"authors": ["Ashley L. Podhradsky", "Rob D'Ovidio", "Cindy Casey"], "n_citation": 50, "title": "Identity Theft and Used Gaming Consoles: Recovering Personal Information from Xbox 360 Hard Drives", "venue": "", "year": 2011, "id": "3769c5d2-048c-44d1-ba3a-c1cc15bd9aa3"}
{"abstract": "This work deals with a global model of PGA. A short overview of the model is introduced. Our research is concentrated on a master-slave algorithm (somewhere also called global). The complexity analysis of the algorithm is created and the processor optimality is derived from the analysis. Based on the optimality derivation, theoretical results with results from the real implementation are compared and the limitations of the algorithm are stated.", "authors": ["Zden\u011bk Konfr\u0161t"], "n_citation": 0, "references": [], "title": "Master-slave PGA and performance metrics", "venue": "", "year": 2007, "id": "37733caf-6ce7-4988-8799-04f9424007d2"}
{"abstract": "Proposed as a subclass of directed evidential network with conditional belief functions (DEVN), dynamic directed evidential network with conditional belief functions (DDEVN) was introduced as a new approach for modeling systems evolving in time. Considered as an alternative to dynamic Bayesian network and dynamic possibilistic network, this framework enables to reason under uncertainty expressed in the belief function formalism. In this paper, we propose a new propagation algorithm in DDEVNs based on a new computational structure, namely the mixed binary join tree, which is appropriate for making the exact inference in these networks.", "authors": ["Wafa La\u00e2mari", "Boutheina Ben Yaghlane", "Christophe Simon"], "n_citation": 0, "references": ["23cfe93d-5ed8-481f-9d83-033930c9d9e5", "3cd6d7f8-e8f3-4327-8c94-ce5ae5e3bc2d", "597ac6ec-c37a-403e-ac35-97fb7977f65c", "d13f9934-68d6-43e4-abb3-79ee3618afff", "d3e00e7e-1c64-4d7a-b2b2-1ad98ba4c706", "e503b334-526e-4d36-8cb0-f13199ef46e4", "f7c6a1a5-49a1-4026-ac20-75aad6420cec"], "title": "New propagation algorithm in dynamic directed evidential networks with conditional belief functions", "venue": "", "year": 2013, "id": "377fb68b-44c1-49ba-886d-d1963f87398a"}
{"authors": ["Lalit R. Bahl", "Steven Vincent De Gennaro", "Pieter de Souza", "Edward A. Epstein", "J. Le Roux", "Burn L. Lewis", "Claire Waast"], "n_citation": 5, "references": ["40acb9ec-92e5-44bd-9729-aecfdeb66522", "5957c188-3453-42eb-a47c-a2cc20c7485d", "74592f74-33bc-40c5-a5a5-2a88539488ab", "a35a3dec-4ee1-4939-8317-76162f063e60"], "title": "A method for modeling liaison in a speech recognition system for French.", "venue": "", "year": 1998, "id": "377fd1cc-82c4-47e9-9ebb-3f9eaf42bbe0"}
{"authors": ["Nagehan Ilhan", "\u015eule G\u00fcnd\u00fcz-\u00d6\u011f\u00fcd\u00fcc\u00fc", "A. \u015eima Etaner-Uyar"], "n_citation": 5, "references": ["14179fc1-43a8-49e6-bcf4-5318b27f43d7", "220f9c24-f0fa-40df-8c3a-f93aca477c40", "3ed217e8-1075-448f-9d4e-a59930a83cc9", "430eea26-094d-43b8-a37a-af7c7574ea8e", "4aadf69a-1333-442c-9874-471dc626825a", "5b8c5fdf-8f91-432c-b614-6acc807b83b9", "68faab18-b537-4f62-85cf-ddc9ef352362", "82dbd9f3-022a-4d6a-bd39-9d0c12160280", "a7656926-7e18-40b8-920b-71109a3357de", "c2f02124-9433-4747-b8e5-90683e9c37c1", "f2e9390b-1d9f-4f42-87ad-0d49f36f6096", "f9081dfc-541b-4acd-a7f5-e06ea6f93279"], "title": "Introduction to Social Networks: Analysis and Case Studies", "venue": "", "year": 2014, "id": "37907e6d-f6be-48f7-9b3f-7c0fa75ca6fd"}
{"abstract": "In this paper we propose the use of immersive virtual reality to visualize and explore query results in 3D object retrieval. These results are shown in a three-dimensional virtual space as 3D objects, organized according to their similarity to the query. Therefore, instead of browsing through a list of thumbnails, the user can explore the query results by navigating among 3D objects in a virtual space and even manipulate these objects for closer a inspection. We performed a preliminary user study and concluded that the proposed solution provides better performance than traditional approaches.", "authors": ["Pedro B. Pascoal", "Alfredo Ferreira", "Joaquim A. Jorge"], "n_citation": 50, "references": ["0cb4d1cd-c26d-4348-ad47-eb8d1bb3109d", "36bdf4fe-a0d3-43b8-b5d3-ebd7d7979117", "3f54e9c5-dd3a-44a9-a4b8-f96bd1af03bc", "6fb08275-1aef-4e72-83ea-1baca2d48768", "8795b122-3f1d-42de-8048-1be2886f36b5", "a2f139c3-0bf6-4457-9576-ca63a6e3ab96", "a36e6a05-6a96-4172-be66-8c49d000917d", "d89c47f7-1778-46f2-9cf8-a11ba2c63d59", "d942dca9-d3cb-407a-92e3-b9f53ba3751c"], "title": "Towards an immersive interface for 3D object retrieval", "venue": "", "year": 2012, "id": "379422ce-de1b-432e-bc56-48d30b816240"}
{"abstract": "Choosing a good variable order is crucial for making symbolic state-space generation algorithms truly efficient. One such algorithm is the MDD-based Saturation algorithm for Petri nets implemented in SmArT, whose efficiency relies on exploiting event locality.#R##N##R##N#This paper presents a novel, static ordering heuristic that considers place invariants of Petri nets. In contrast to related work, we use the functional dependencies encoded by invariants to merge decision-diagram variables, rather than to eliminate them. We prove that merging variables always yields smaller MDDs and improves event locality, while eliminating variables may increase MDD sizes and break locality. Combining this idea of merging with heuristics for maximizing event locality, we obtain an algorithm for static variable order which outperforms competing approaches regarding both time-efficiency and memory-efficiency, as we demonstrate by extensive benchmarking.", "authors": ["Gianfranco Ciardo", "Gerald L\u00fcttgen", "Andy Jinqing Yu"], "n_citation": 19, "references": ["04a516e7-0cc9-4783-aae0-4c76ca7c61e4", "05aed872-1d9b-4a3e-80c6-d5a004d90230", "0757710e-2b31-4e3a-9413-d90fbaab1cce", "0d4485d7-5db4-4001-a3f5-3ab5677ba00c", "0ed8c347-0774-4a51-9d64-47b847d8897a", "16e0969d-e059-4216-bccc-6da8127ac2c4", "18f27076-289e-4bd1-93bc-fd059e603e66", "1ac7e02c-0b35-408f-8c0a-250ddb376db7", "29597bd7-43bd-4d38-89f8-cc2393958ccc", "3efc96b8-643a-48d7-8c3f-1e832ece3811", "41a523c5-25a1-4b2f-bd6f-20edaa601018", "478bd8c1-2518-4742-92d9-6da2d3754884", "52d4e359-081d-417c-a398-c081c351c7ea", "59017aa0-f73b-4a69-87ca-457fa1d2504e", "6d5a95c6-6907-4d34-b942-fc6c74f6b994", "75e7134e-9434-47f9-8804-b5eca00680d9", "88216e1e-e037-4f80-976e-6459b98ff099", "975f93fb-3274-493c-be18-81998544e5e0", "9849d9c4-a97f-452f-882c-42a8c6cab0b5", "99216410-e85b-4f34-b89d-c6785c5b7686", "a8e0f15b-63ca-4edc-86e2-8f577a9388d5", "ac81d787-5bac-4f20-ab5b-e231046fa6d8", "b01db01a-b38f-47fc-8207-be8d4600fcf2", "b05f1793-9c2c-40db-9d1b-037ef94107be", "d1616cec-8c7a-4a03-9a9f-d7f176075d46", "d4418609-fffe-4cc9-ad42-3b5f245f2d12", "da3faf06-2485-4386-a820-a8b708400067", "debc553a-5618-4ffe-8d2c-ce454fb00ec7", "e3f92aa8-6ca2-4fe0-babe-da31345f9466", "e4cfd64a-1cb6-426c-b1be-0c55c349d0a4", "e7af69f3-4105-4401-9edd-a0b13f50761b", "f863a45a-8af0-4369-aee6-6d74e05a73a9"], "title": "Improving static variable orders via invariants", "venue": "applications and theory of petri nets", "year": 2007, "id": "37b003c9-9226-4cda-b6d7-f57b978cc422"}
{"authors": ["Markus Becker", "Matthias Teschner"], "n_citation": 46, "references": ["0effbbf7-f9b5-4965-936b-035b1854b5fe", "22f10fe8-7271-4089-9147-155aab22140e", "27b39036-3906-4f43-9287-a27ee7b61099", "867f8f75-eb31-41c0-a7ff-22e56334f06d", "8cd9ce5e-9737-4f06-8d07-fa47775c594c", "990cb5fc-962f-4526-b5c5-509cd7eeae0f", "9c07e1ad-8164-4974-8adb-d56e24651dbd", "9e3526cf-90bd-4241-92d5-3f6e05ae749e", "a119dfba-1ef4-497f-ab39-1983f952fb23", "d7545306-14de-4a9c-8dfb-9d5341b196ec"], "title": "Robust and Efficient Estimation of Elasticity Parameters using the linear Finite Element Method.", "venue": "", "year": 2007, "id": "37b0f100-46e6-4665-af87-eac4f7a82c05"}
{"authors": ["David A. Randell", "Zhan Cui", "Anthony G. Cohn"], "n_citation": 2531, "title": "A Spatial Logic based on Regions and Connection.", "venue": "principles of knowledge representation and reasoning", "year": 1992, "id": "37b7dee1-e972-4f4e-b0d1-818a78ff275c"}
{"authors": ["Krzysztof Skabek", "Dawid \u0141apczynski"], "n_citation": 0, "references": ["37576172-f046-4e30-87cd-19406939b105", "568d90fc-472b-44f0-a78c-9d3e9e0605af", "7ddaf8f0-870a-4a8b-b350-351a143e08ae", "b71d547b-53ea-4867-893e-eeb056946f0c", "c4b27d83-b67d-464e-813a-440f23dcbd81", "db35ff6a-c4e2-4215-a8e7-eabdbee12c45", "ee61feb6-aeb9-4729-bae3-aee1548caea7", "fad8b2f3-ebe1-4728-af00-2e0949dd6175"], "title": "Reconstruction of Head Surface Model from Single Scan", "venue": "computer recognition systems", "year": 2013, "id": "37bdee80-ff66-44f5-8200-b937b1535a45"}
{"authors": ["Hui Zhang", "Qing Guo", "Costas S. Iliopoulos"], "n_citation": 0, "references": ["27725ea2-c095-45b7-bc79-c3a84dde118a", "27f995f6-ccf4-4da2-a147-18d9e590c897", "33834a31-132a-409b-b646-c8918a85afb0", "3c0a897c-b183-4d9d-bca2-b5e170b0917d", "4be1eb2a-35c7-44c4-bebf-b71e740d0fbe", "758b14b9-963e-40d2-9430-3414c1252b7c", "ca1ffed5-b093-4b47-97cb-cfbf4b305f58", "d32fc416-fd40-40b9-8109-756a769cfbf4", "fef7c2a8-7437-4997-bc16-03cbe2e3606f"], "title": "Locating Tandem Repeats in Weighted Biological Sequences", "venue": "international conference on intelligent computing", "year": 2012, "id": "37c166f0-e314-4a9b-b9db-677cfdc4dcc0"}
{"abstract": "We propose a novel approach to preference change. We treat a set of preferences as a special kind of theory, and define minimal change contraction and revision operations in the spirit of minimal change as advocated by the Alchourron, Gardenfors, and Makinson AGM theory of belief revision. We characterise minimal contraction of preference sets by a set of postulates and prove a representation theorem. We also give a linear time algorithm which implements minimal contraction by a single preference. We also define minimal contraction by a set of preferences, and for a significant special case state postulates, prove a representation theorem, and provide an efficient algorithm implementing minimal contraction by a set of preferences.", "authors": ["Natasha Alechina", "Fenrong Liu", "Brian Logan"], "n_citation": 50, "references": ["07cc589c-d678-416b-9c59-42adbc88abe5", "0a645567-b4ac-43e7-b7ad-d190dafca869", "602d6359-e792-4989-b16a-ed1c1f38e154", "70c2be0d-8b12-4132-b93f-e818c4e101e9", "81d3562c-0740-4f87-b15c-8252f98b5067", "a64670c1-88a7-4b20-a3af-9c31707a856a", "a6aa343d-12bd-4a24-b00b-9345c40f4102", "e2eaa562-935f-4b14-95c8-4e60e01b4e05"], "title": "Minimal Preference Change", "venue": "", "year": 2013, "id": "37ca1235-1736-4ad8-869f-0a3071e47a35"}
{"authors": ["Tri-Thanh Nguyen", "Akira Shimazu"], "n_citation": 0, "references": ["145e57eb-d121-435e-888e-066601384cd5", "d9558f6a-6fd0-4ba1-adcc-9fea85f4409e", "df7a2dba-5272-44c0-b613-e6423fbd085a"], "title": "Acquisition of Named-Entity-Related Relations for Searching", "venue": "", "year": 2007, "id": "37e0babf-7425-4032-96fd-3c3b38d9cad2"}
{"abstract": "For a doctor to determine the most accurate diagnosis of diseases of the respiratory tract, it must be as accurate as possible insight into the problem. Imaging technology allows to look into the body, unfortunately for example lung is an organ, where without contrast agent does not buy the picture. Furthermore, the methods that can be used are whole body plethysmography or, a better option, spirometry. A measurement of spirometry is performed by the pneumotachograph or the spirometry. Spirometer measures lung volumes and lung capacity. Pneumotachograph is the flow rate measuring device, but can also be used for indirect measurement of lung volumes and capacities. Spirogram is the result of spirometry measurements.", "authors": ["Martin Augustynek", "Ondrej Adamec", "David Mi\u010dan\u00edk"], "n_citation": 0, "references": [], "title": "Using a differential pressure sensor as spirometer", "venue": "computer information systems and industrial management applications", "year": 2012, "id": "380e4d8b-72ce-4abb-b361-27248a9299b2"}
{"authors": ["Petra Becker-Pechau", "Wolf-Gideon Bleek", "Axel Schmolitzky", "Heinz Z\u00fcllighoven"], "n_citation": 5, "references": ["c28cf51b-79cf-4b24-9234-8b304f11e6ca", "c6045537-5b41-4de6-8ae4-6754bf8f92af"], "title": "Integration agiler Prozesse in die Softwaretechnik- Ausbildung im Informatik-Grundstudium", "venue": "", "year": 2003, "id": "381a443f-b130-4f09-8520-5ae29063a523"}
{"abstract": "\u5831\u544a\u756a\u53f7: ; \u5b66\u4f4d\u6388\u4e0e\u65e5: 2013-03-25 ; \u5b66\u4f4d\u306e\u7a2e\u5225: \u4fee\u58eb ; \u5b66\u4f4d\u306e\u7a2e\u985e: \u4fee\u58eb\uff08\u60c5\u5831\u7406\u5de5\u5b66\uff09 ; \u5b66\u4f4d\u8a18\u756a\u53f7: ; \u7814\u7a76\u79d1\u30fb\u5c02\u653b: \u60c5\u5831\u7406\u5de5\u5b66\u7cfb\u7814\u7a76\u79d1\u30fb\u96fb\u5b50\u60c5\u5831\u5b66\u5c02\u653b", "authors": ["Oraphan Krityakien", "Keikichi Hirose", "Nobuaki Minematsu"], "n_citation": 0, "references": ["13d6f677-64ec-44a0-b34d-b0e7e6c2ac8f", "2114b958-20bd-48c8-bfde-103d6035c53b", "43ecd157-8d0b-4c7f-8197-618d4283f046", "46eadcfe-4c7d-4382-89bb-0064998c4ed4", "6512acc9-deaa-452d-8403-102c75d25653", "769a5857-537c-45f7-8ba1-e9f7381a3523", "89dcf2b8-9cc7-4ed9-be26-e7c82be11b64", "94385c9d-399b-48db-a37d-415a3e897a39", "9627e052-b2dd-4254-b8e1-362bfd7aa442", "b148bd47-69af-4f93-8e76-ca98a0dc105b", "b381914d-85c3-44d2-8eb8-668a73f6f4e8", "c0a48ea3-664e-4569-b511-ac711a7db2dd", "df1c70ad-51b0-49da-b031-9fd1e5cd5115", "e7562456-f580-41cf-946b-7f0569f151c9", "f20a7ffb-de45-41e1-8b11-7c2b9455fc6b", "f90a759a-306f-43b8-8479-d7a7b049ec43", "fed1970b-68af-4dfe-a74f-9911ce9a90d6"], "title": "Generation of fundamental frequency contours for Thai speech synthesis using tone nucleus model.", "venue": "conference of the international speech communication association", "year": 2013, "id": "381ee03f-09a5-4d8e-aa3a-e4f109b9af71"}
{"authors": ["Chiaki Sakama", "Katsumi Inoue"], "n_citation": 24, "title": "Relating disjunctive logic programs to default theories", "venue": "logic programming and non-monotonic reasoning", "year": 1993, "id": "382f9fd2-5daf-47a5-a8fa-565fabbb73ec"}
{"authors": ["Jin-Ho Shin", "Jae-Ju Song", "Bong-Jae Yi", "Seon-Ku Cho"], "n_citation": 0, "title": "Implementation of Automatic Tubesheet Mapping System for Nuclear Power Plant Heat Exchanger.", "venue": "", "year": 2003, "id": "383dd6dd-3c24-416a-b29e-222c4fc73128"}
{"abstract": "In CT-RSA 2011, Maji et.al proposed an attribute-based sig- nature (ABS) scheme, which is the most efficient ABS scheme that sup- ports general predicates until now. They claimed that their ABS scheme is unforgeable under generic group model. Unfortunately, we found a forgery attack on this ABS scheme. In this paper, we firstly give a forgery exam- ple, then analyze the reason cause this attack and gives the conditions this attack worked. We found this attack is fatal to Maji et.al's ABS scheme.", "authors": ["Yan Zhang", "Dengguo Feng", "Zhengfeng Zhang", "Liwu Zhang"], "n_citation": 50, "references": ["81a36a71-b93a-435e-b7ae-bb3784cbaa0f", "906471cb-299a-4d03-98f8-af55e283eb51", "e975d8d6-5df0-4fe6-9ed3-ff551a56b66c", "e9d4cefe-1f3e-4f53-8461-904e0c30cc8b"], "title": "On the Security of an Efficient Attribute-Based Signature", "venue": "network and system security", "year": 2013, "id": "38ac906a-ffa7-4729-b34f-2102d7359250"}
{"abstract": "A semantic feature for statistical machine translation, based on Latent Semantic Indexing, is proposed and evaluated. The objective of the proposed feature is to account for the degree of similarity between a given input sentence and each individual sentence in the training dataset. This similarity is computed in a reduced vector-space constructed by means of the Latent Semantic Indexing decomposition. The computed similarity values are used as an additional feature in the log-linear model combination approach to statistical machine translation. In our implementation, the proposed feature is dynamically adjusted for each translation unit in the translation table according to the current input sentence to be translated. This model aims at favoring those translation units that were extracted from training sentences that are semantically related to the current input sentence being translated. Experimental results on a Spanish-to-English translation task on the Bible corpus demonstrate a significant improvement on translation quality with respect to a baseline system.", "authors": ["Rafael E. Banchs", "Marta Ruiz Costa-Juss\u00e0"], "n_citation": 50, "references": ["0096859a-c41a-426c-ac38-7a086a6b86d0", "3f601f4d-a74f-43a8-86e0-b6d468bcd867", "5443ee2f-a083-4829-bfd3-b92e50b6d78e", "c1c634fa-13aa-4e6e-8273-f1365b43b246", "c3575d4a-31ba-4089-abbc-0d47a81929dd", "ca705603-7337-4b30-aa9e-7ae2e5f6b78a", "d876156c-06f8-46d1-b3c4-f8d84f9075fb", "e9abffef-c6bf-44da-a673-be480773dbbb"], "title": "A Semantic Feature for Statistical Machine Translation", "venue": "", "year": 2011, "id": "38b05e95-9f1c-4b4c-b391-16965bd7f8cf"}
{"abstract": "Using Bayesian networks (BNs) for classification tasks has received significant attention as BNs can encode and represent domain-experts' knowledge as well as data in their structures and conditional probability tables. While structure learning and constructing the structure by hand according to an ensemble of domain-expert opinions are two common approaches to make a BN structure, finding an optimal structure to attain a high correct classification rate -especially for high dimensional problems- is still a challenging task. In this paper we propose a framework - called Local Bayesian Network Experts Fusion (LoBNEF) - in that, instead of making a single network, multiple Bayesian Network Classifiers (BNCs) are built and their outputs are attentively fused. The attentive fusion process is learned interactively using a Bayesian reinforcement learning method. We demonstrate that learning different BNCs in the first step and then fusing their decisions in an attentive and sequential manner is an efficient and robust method in terms of correct classification rate.", "authors": ["Sepehr Eghbali", "Majid Nili Ahmadabadi", "Babak Nadjar Araabi", "Maryam S. Mirian"], "n_citation": 0, "references": ["021c5a97-47be-49b9-a77b-66d2406f867f", "0aecc356-c1b3-41cb-a291-54902844d464", "14abb0bd-1147-4e44-acb1-5425b834ee6e", "27d5880d-9d27-42f5-a16f-320164fa36b3", "55fff3f7-2df2-4ff1-833a-f040099a0958", "65b04ebb-5303-41c8-b238-1ebf7d963ffc", "719c7fb6-d601-47d9-a1fa-6b5c24217ce5", "80ee4343-400a-48cc-b6b8-d66ad6ebb235", "8c289402-3834-4167-a32f-2deb827d8cc5", "97e55485-2ec4-4167-92bd-fec145e593f4", "d20df5c3-667b-42d4-a128-d5f0b649cc32", "d3042c15-bbcc-4179-a200-1dba534ee1e2", "fa70488d-1d06-4967-8c8e-c678cf1052c8"], "title": "Learning attentive fusion of multiple bayesian network classifiers", "venue": "international conference on neural information processing", "year": 2012, "id": "38b8ecf8-ae01-41ad-9e7c-f120dab1e10b"}
{"abstract": "It is important for development of education game to get the correct balance and find the best hybrid mode between education and game. In this paper, the factor considered during the design of education game is discussed, and several hybrid modes of education and game are proposed. Specifically for elementary historical education, the paper research on education game scheme of network role-play from the perspective of educational psychology, and design a case of historical education game using RPG mode with fully considering of knowledge and education. Players experience history by historical role-play, convey the sentiment of history by communication of players, and do with the hybrid integration of the game and education.", "authors": ["Haiyan Wu", "Xun Wang"], "n_citation": 50, "references": ["032abc2f-5cdb-4555-ba7f-a5146cb7be0a"], "title": "Study of Game Scheme for Elementary Historical Education", "venue": "international conference on e-learning and games", "year": 2008, "id": "38e26d19-aafb-4943-8138-a1cadd9d866c"}
{"abstract": "This article briefly describes the topic of quan- tized control with limited data rates. The focus is on the problem of stabilizing a linear time-invariant plant over a digital channel, and the associated data rate theorems. It is shown that the deepest results in this area require a unified treatment of its communications and control aspects.", "authors": ["Girish N. Nair"], "n_citation": 2, "references": ["1dc870d2-34d5-4c0c-a0b0-a3ad1d5a3ffa", "1ef59da7-1107-47d5-9a79-c6bd97e95d78", "2ff0549d-31c7-48b7-8b31-97b29cc2f4bc", "50d6a29d-68e6-4615-9662-e968111e8935", "54354660-2923-4898-90c8-774326e74d24", "58abefa2-aeec-4996-ae98-c2c1211eba92", "5c4dbc13-638a-495d-96cb-6528f3989f8a", "6361898b-c7df-42c5-923f-d5a3853edb13", "af17e8df-90d9-4f07-9158-3a5ec64d1a1e", "c11a3278-73e0-409a-8b5c-d0763f9ee6a0", "ca52b934-af8a-4202-b59a-036547bc7425", "cd319808-b861-409f-a3a1-53b5439df662", "d5641016-2f14-4aaf-bf15-78a05e7e5653", "e6929043-e58a-441d-8937-92db518e6dc6", "ef165ccf-d4c9-47ca-962e-89c28b099999"], "title": "Quantized Control and Data-Rate Constraints", "venue": "", "year": 2015, "id": "38f94267-fdf2-4c45-b930-df351b7fc6a8"}
{"abstract": "We have developed environments that use teaching as a metacognitive, reflective, and iterative process to help middle school students learn about complex processes. We demonstrate that metacognition and self-regulation are crucial in developing effective learners and preparing them for future learning tasks. As evidence, we discuss the impact of metacognitive support on students' learning performance and behavior patterns that promote better learning through self-monitoring.", "authors": ["Jason Tan", "John Wagster", "Yanna Wu", "Gautam Biswas"], "n_citation": 5, "references": ["8ab3d842-3ffb-4de9-bc52-bca6e6fa3fd8"], "title": "Effect of Metacognitive Support on Student Behaviors in Learning by Teaching Environments", "venue": "artificial intelligence in education", "year": 2007, "id": "38fe830e-12ec-419c-85d1-c2513f4dbd04"}
{"authors": ["Maazen Alsabaan", "Kshirasagar Naik", "Tamer Abdelkader", "Tarek Khalifa", "Amiya Nayak"], "n_citation": 50, "references": ["1545dfd3-2c25-4ff1-b43c-df4a2a501d06", "8963d437-1ef1-4d83-8ac2-b203963a2737", "a1f21129-1d24-4217-badf-9f989a0a14ce", "dfe76cb0-bd52-4d80-92fa-d1f63539651c", "e9a37596-66c4-4f06-9614-cde5145ad2b3"], "title": "Geocast Routing in Vehicular Networks for Reduction of CO2 Emissions", "venue": "", "year": 2011, "id": "392e6c5a-9a6b-4ed7-afc6-2081db82a621"}
{"abstract": "We extend the expressive power of the region connection calculus RCC-8 by allowing applications of the 8 binary relations of RCC-8 not only to atomic regions but also to Boolean combinations of them. It is shown that the statisfiability problem for the extended language in arbitrary topological spaces is still in NP; however, it becomes PSPACE-complete if only the Euclidean spaces \u211dn, n > 0, are regarded as possible interpretations. In particular, in contrast to pure RCC-8, the new language is capable of distinguishing between connected and non-connected topological spaces.", "authors": ["Frank Wolter", "Michael Zakharyaschev"], "n_citation": 79, "references": ["27aad8e4-4090-4766-86d9-706e184f8f4a", "33f1d8e3-e566-4c0c-a805-bd7393f534ba", "37b7dee1-e972-4f4e-b0d1-818a78ff275c", "5bb73136-edcf-44e3-bc83-0b4256c05b8b", "6e2a0c9c-e5c0-4ff8-b257-f89753e1103f", "8e77a968-75de-447e-88f2-fd3e42e22501", "af7094e3-5891-40ec-a1b7-d6651af0c2d1", "b382c113-3636-43ee-94cc-d310854f053f", "e5970001-b20d-49c9-8d36-197ceacc2b93"], "title": "Spatial reasoning in RCC-8 with Boolean region terms", "venue": "european conference on artificial intelligence", "year": 2000, "id": "392e7c51-de11-464b-8a06-96db39bf83c9"}
{"authors": ["Heikki Topi", "Venkataraman Ramesh"], "n_citation": 50, "title": "Toward an Extended Framework for Human Factors Research on Data Modeling.", "venue": "", "year": 2004, "id": "3931921f-1f53-4241-85ae-3dc1cdc0d489"}
{"authors": ["Chang-Hoon Kang", "Kiejin Park", "Sungsoo Kim"], "n_citation": 0, "title": "A Performance Isolation Technique Ensuring SLA of Web Systems Having Primary-backup Web Switch.", "venue": "", "year": 2005, "id": "3937c4b7-49d9-4488-a243-488e67a33ada"}
{"authors": ["Apostolos P. Fournaris", "Daniel M. Hein"], "n_citation": 6, "references": ["019d6b65-92f1-40af-b0d0-482b1cf2cb06", "01d0b8a2-cd17-4455-a3fb-46ac6d221686", "033ebb72-0119-4cc9-89b8-f011c55ddd79", "095303f1-61cb-47dc-834d-5990a4480ff8", "0ac86888-8359-4ff6-a521-6b216173c842", "2c146ab2-ffe1-4581-ba4c-e675232312a9", "36511357-91c6-486b-829b-809c2d0e9ded", "4b03b17f-04e9-451e-a967-9d3f7fef67b6", "4b544302-de13-4226-825f-f10ef086ce94", "4d931ca7-9bac-4f44-8209-83c0b2cc4382", "a1b436c3-c888-4c97-b463-5b6151dd6b4e", "a41f8b91-ee7e-43ac-9782-c4162be0db00", "bd91e09f-b07b-4385-9758-3a2233ddae4d", "d39392d9-9010-477e-bb8a-4f63db370c16", "dd50f6a1-38d0-4a7e-b692-34889e5cfe28", "f804a722-dc07-4bbb-b3cd-29bf24aef3a9"], "title": "Trust Management Through Hardware Means: Design Concerns and Optimizations", "venue": "", "year": 2011, "id": "3945632d-8366-4d05-bcba-00a3e5a06a14"}
{"authors": ["Hans H. K. Andersen", "Verner Andersen"], "n_citation": 1, "title": "Evaluation of an e-commerce Agent.", "venue": "", "year": 2002, "id": "394883b2-0e35-4556-b6d7-a09574aa6cd4"}
{"abstract": "With the start of the widespread use of discrete wavelet transform the need for its effective implementation is becoming increasingly more important. This work presents a novel approach to discrete wavelet transform through a new computational scheme of wavelet lifting. The presented approach is compared with two other. The results are obtained on a general purpose processor with 4-fold SIMD instruction set (such as Intel x86-64 processors). Using the frequently exploited CDF 9/7 wavelet, the achieved speedup is about 3\u00d7 compared to naive implementation.", "authors": ["David Barina", "Pavel Zemcik"], "n_citation": 50, "references": ["233a9e6b-4c12-4585-8e34-7efcac46e7f0", "62209ce2-fc6d-456e-82d0-fcc023d84621"], "title": "Minimum Memory Vectorisation of Wavelet Lifting", "venue": "advanced concepts for intelligent vision systems", "year": 2013, "id": "39575764-e2b6-4ccd-8ea5-f4592c7616bb"}
{"authors": ["Thomas Martin Lehmann", "W. Schmitt", "Klaus Spitzer"], "n_citation": 0, "title": "IDEFIX - Identifizierung dentaler Fixturen in intraoralen R\u00f6ntgenbildern.", "venue": "", "year": 1996, "id": "397b1d26-26be-4ded-8de9-c1dd1c324732"}
{"abstract": "Due to high interest of social online systems, there exists a huge and still increasing amount of image data in the web. In order to handle this massive amount of visual information, algorithms often need to be redesigned. In this work, we developed an efficient approach to find visual similarities between images that runs completely on GPU and is applicable to large image databases. Based on local self-similarity descriptors, the approach finds similarities even across modalities. Given a set of images, a database is created by storing all descriptors in an arrangement suitable for parallel GPU-based comparison. A novel voting-scheme further considers the spatial layout of descriptors with hardly any overhead. Thousands of images are searched in only a few seconds. We apply our algorithm to cluster a set of image responses to identify various senses of ambiguous words and re-tag similar images with missing tags.", "authors": ["Katharina Schwarz", "Tobias H\u00e4u\u00dfler", "Hendrik P. A. Lensch"], "n_citation": 0, "references": ["0b6495d8-41cd-421a-9d4e-c645cf187da9", "46bfb00c-f366-4962-9825-169559fcea03", "6018a516-8149-4bce-bc33-5449d86e58c2", "6e1c18af-5c7f-4915-a611-702a3d4b9c53", "79f26b36-98eb-4a5f-b61d-4c3baf9e0ad6", "8bd8c988-9fa1-4c19-a3eb-0fe8809d7625", "a33f0d9b-dda4-433f-af99-344c2e1651f9", "ab3afb93-8ca0-4556-ae60-11199dc263c2", "c9482f1f-6600-44a7-a69a-e63ef13cdff8", "e45e023e-b988-4675-9e47-2ae7f2dc5c35", "f527d85b-2491-4c24-8347-8c80ed8d1eb3", "fb784607-e8bc-4e5f-a52c-a395c224643c"], "title": "An efficient parallel strategy for matching visual self-similarities in large image databases", "venue": "international conference on computer vision", "year": 2012, "id": "398abf1b-29bc-4135-a682-2e90e91c6abf"}
{"abstract": "Given a preselected set of relations extracted from the AURA knowledge base on biology, the KBGEN Task consisted in generating a sentence verbalising these relations. Three team submitted the results of their systems. The systems were compared using both automatic metrics (BLEU, NIST) and subjective ratings by 12 human users for three dimensions namely, fluency, grammaticality and meaning similarity. In this report, we summarise the KBGen Task, the evaluation methods and the results obtained.", "authors": ["Eva Banik", "Claire Gardent", "Eric Kow"], "n_citation": 17, "title": "The KBGen Challenge", "venue": "natural language generation", "year": 2013, "id": "3992ae10-531a-4d98-a5c3-ac4edc1f5eac"}
{"authors": ["Simon Buckingham Shum", "Nick Hammond"], "n_citation": 30, "title": "Transferring HCI modelling and design techniques to practitioners: a framework and empirical work", "venue": "", "year": 1994, "id": "39a3d297-6bad-4b59-bbbb-ae4d1bb852d8"}
{"authors": ["Werner Dostal"], "n_citation": 0, "title": "IT-Arbeitsmarkt - Katastrophe oder Normalisierung?", "venue": "Informatik Spektrum", "year": 2002, "id": "39a5ed5e-9c9f-450e-8baa-c90f54d91d64"}
{"authors": ["W. Brent Seales", "Charles R. Dyer"], "n_citation": 0, "title": "An occlusion-based representation of shape for viewpoint recovery", "venue": "european conference on artificial intelligence", "year": 1992, "id": "39b991c6-f77b-4432-8a8b-c197d07ded34"}
{"authors": ["Yilun Luo", "Kai He", "Ruxu Du"], "n_citation": 0, "references": [], "title": "Studies on a New Incremental Sheet Metal Forming Process: Using Geometric, Fem and Experiments", "venue": "", "year": 2009, "id": "39c1a17e-e8f6-40a1-afdc-e1d31a207c59"}
{"authors": ["Robert Baumgartner", "Georg Gottlob", "Marcus Herzog"], "n_citation": 11, "references": ["07324ef1-2892-4669-ba93-b341e0f228ad", "161fd9f8-11b7-4c4c-9433-be56dfeea1be", "16c1e1e0-037c-4197-8577-f45473ac794f", "23a7f153-9eb8-4177-950c-945229f59980", "3aaae841-f472-438c-8b15-4589200a96b8", "6ece887c-ce5f-4b03-a3f0-a6296671dd16", "8d6e8fd5-6bca-4862-ad26-4dfa7448dc57", "91556b20-c53e-4687-82e2-7c3c1e893f0b", "af9d69d5-91c5-4315-bb5d-13b231292e87", "c7e4e04b-45da-4bae-8c8a-d17ca0087361", "f2c968b1-c238-4cd1-9932-1001c208f189"], "title": "Visual Programming of Web Data Aggregation Applications", "venue": "international joint conference on artificial intelligence", "year": 2003, "id": "39d2e1e8-03ae-4c7a-9996-cbec00941c17"}
{"abstract": "This paper presents some algorithms for a novel simulation of the folding and cut crafts in Chinese Paper-cut. All algorithms in simulation are designed by consideration of the real Paper-cut's whole process. We applies area filling algorithm, polygon clipping algorithm, contour extraction algorithm and subdivision curve algorithm, with the proper improvement that meets the technique of the art in the nature, to yield some vivid Paper-cut works. Our approach is feasible to anyone with the desire, due to Paper-cut illumines itself in 2D and all the operations are also in 2D.Moverover, recent compelling graphic systems, such as Flash, Photoshop, Maya and 3DMax, did not provide a similar interface for paper's fold and decorative pattern which are primary elements in Paper-cut. However, our approach not only meets the interest of the Paper-cut, but also holds an interface for these compelling systems because of measuring up the SVG.", "authors": ["Hanwen Guo", "Minyong Shi", "Zhiguo Hong", "Rui Yang", "Li Zhang"], "n_citation": 50, "references": ["1254ce03-81ea-44bf-981e-873b1f27b9b1", "1c63e1d5-b963-455b-829d-e4f3eb63a36a", "54d3b99b-17e0-443f-bd4c-23db90ce9c26", "a3315188-55a1-4193-93e2-19a26c6416bf", "bcc2ed34-6616-499b-9b50-d19d3c4f1c1b", "ef4ae978-7f25-4d9c-8f35-c10dbabefc67", "f25fbde9-abd5-42f6-a945-11e55ec56113", "ffe02677-9236-40ba-b8e0-1c695b844439"], "title": "Virtual Artistic Paper-Cut", "venue": "international conference on e-learning and games", "year": 2008, "id": "39ecc6d8-be47-42ad-9d34-9d71f86f1e27"}
{"authors": ["Michael Tiedge", "Udo W. Lipeck"], "n_citation": 2, "title": "Graphbasiertes Matching in r\u00e4umlichen Datenbanken.", "venue": "", "year": 2007, "id": "3a19ab9c-4ac7-4bc9-a537-44173c1070c7"}
{"authors": ["Tomasa Calvo", "Radko Mesiar"], "n_citation": 50, "title": "Distance aggregation operators.", "venue": "", "year": 1999, "id": "3a89f7a6-61f3-469a-bedf-b43a3ff6d341"}
{"authors": ["Rob Gleasure", "Joseph Feller"], "n_citation": 0, "references": ["358b1315-9953-4b7a-89e8-ff5658c6621a", "38afe051-a8a6-42bf-98bc-86e4b3f0edf7", "53f05d4e-4269-4180-bf37-e460ac868bbf", "628b2f86-eaa2-4980-af70-7ef950a42894", "8843d85a-8fa7-4961-92c4-63b36632d05d", "896f7156-d4a9-42a6-b1c0-5ff44fdf73d1"], "title": "Observations of Non-linear Information Consumption in Crowdfunding", "venue": "", "year": 2014, "id": "3a98046d-358d-4baa-a122-d94c8ae4c54e"}
{"authors": ["Sebastiano Battiato", "Giovanni Maria Farinella", "Nicol\u00f2 Grippaldi", "Giovanni Puglisi"], "n_citation": 50, "references": ["5b4f33a1-9689-4b0d-a60f-095a210df75b", "6a5e9cd0-60f9-4623-ac93-6bc92d505b6a", "6d121e97-e351-4cf9-8c44-d7ab3ce9d9fe", "8e6187cd-8009-4d27-8262-24942356bba1", "9813771c-de4e-43e3-b8ad-a9e207e18e53", "e1ce3494-6a4c-45b5-95ef-aee5a0f5f9fd", "eb0f7462-f0d7-4be5-857f-2d78e3d9aa98"], "title": "CONTENT-BASED IMAGE RESIZING ON MOBILE DEVICES", "venue": "international conference on computer vision theory and applications", "year": 2012, "id": "3aa659ef-346a-4895-8530-2752487afe90"}
{"authors": ["France Henri", "Bernadette Charlier"], "n_citation": 0, "title": "Overview of stream C: Measuring quality: evaluation and assessment.", "venue": "", "year": 2003, "id": "3abdfe9d-ccfc-42ee-bf62-e36cca45d01d"}
{"abstract": "We present a mobile head-mounted device for detecting and tracking text that is encased in an ordinary flat-cap hat. The main parts of the device are an integrated camera and audio webcam together with a simple remote control system, all connected via a USB hub to a laptop. A near to real-time text detection algorithm (around 14 fps for 640\u00d7480 images) which uses Maximal Stable Extremal Regions (MSERs) for image segmentation is proposed. Comparative text detection results against the ICDAR 2003 text locating competition database along with performance figures are presented.", "authors": ["Carlos Merino-Gracia", "Karel Lenc", "Majid Mirmehdi"], "n_citation": 53, "references": ["10c2e1a1-7394-4101-be88-b69129fb3edd", "1b6ba2d5-0933-45bb-9f0b-309bd1555044", "21a08d3f-f3b0-4d05-8ad0-18a0f34914d1", "263062eb-8e38-4af9-9bf9-68906888070f", "26e549cb-9936-4abf-8423-6cf6a3a67e6f", "2a118595-bb1a-4ace-84d4-180d497391cf", "3baf7125-32d2-4b68-be3b-148377f12718", "55aa256e-9082-4d1e-bc04-07f6ec33637e", "59baa2a6-5b5e-4570-8268-53ad2210b970", "60285266-7da2-474e-b05a-b380c836f665", "757d0350-2019-4231-ab6c-9fcbff6d1c16", "76b9651d-fff3-47b8-a5ad-19045179ff72", "771f27d2-b98e-4959-90a1-1155d71badd2", "81724e3a-2719-4178-92b7-579afa2e0ed5", "94a9bcfb-844e-4861-baf5-85115c33471f", "9b6c8959-f24c-41a6-960a-cefab87512f3", "baeb18c6-a796-402c-beac-97bbc919c914"], "title": "A head-mounted device for recognizing text in natural scenes", "venue": "", "year": 2011, "id": "3ac03cb8-e9d0-43a3-a30e-86097fb6f6b8"}
{"abstract": "A methodology to predict underwater acoustic channel communica- tion properties (capacity, bandwidth, range) from the environmental conditions in the ocean is proposed. The methodology is based on the use of acoustic propagation models coupled to a set of equations proposed firstly by Stojanovic (1). A parametric study of channel characteristics as a function of changing en- vironmental conditions is presented, showing in particular how channel range and/or source transmission power are influenced by the relative position of source and receiver with respect to the ocean temperature thermocline. This kind of results is crucial to adaptively configure the relative position of mobile nodes (typically AUVs - Autonomous Underwater Vehicles) in underwater sensor networks, with the final goal of mitigating the effects of environmental changes on the network communication capabilities.", "authors": ["Andrea Caiti", "Emanuele Crisostomi", "Andrea Munafo"], "n_citation": 22, "references": ["2963074e-7883-4fb2-9b54-ab45a5185cb1", "748a2ab3-8b5f-4d0a-9e2d-af685089843a", "a124cc0b-5f67-4158-ac56-44395788ca57"], "title": "Physical Characterization of Acoustic Communication Channel Properties in Underwater Mobile Sensor Networks", "venue": "", "year": 2009, "id": "3ad26829-fa94-473a-a071-9ad04c8a6dd0"}
{"abstract": "This paper proposes a scheme of building in single chip microcom- puter laboratory based on Proteus software simulation, Protel software to make PCB card. It proves the feasibility of scheme by analyzing some application ex- amples. This scheme solves the problems of capital shortage for traditional sin- gle chip labs and difficulty in equipment maintenance to a certain extent.", "authors": ["Tao Wu", "Shi-Xu Wang"], "n_citation": 0, "references": ["0a494bf6-85d0-4a2f-a900-552d78a82295", "5ba0f7ad-3ad3-46b4-bb64-66ba6321baa3"], "title": "Application of EDA Technology in the Education of Automatic Control System Design", "venue": "", "year": 2011, "id": "3aece4a9-161f-456c-bf6d-d699c0e9428f"}
{"authors": ["Glynn Winskel"], "n_citation": 17, "title": "A Category of Labelled Petri Nets and Compositional Proof System (Extended Abstract)", "venue": "logic in computer science", "year": 1988, "id": "3b06b9c1-c506-4511-99b1-bef0f40f3d93"}
{"authors": ["Oscar Nierstrasz"], "n_citation": 0, "title": "Taming Software Change.", "venue": "", "year": 2006, "id": "3b219bb7-9330-4613-aacb-2871f73b7f15"}
{"abstract": "We provide stronger and more general primal-dual convergence results for Frank-Wolfe-type algorithms (a.k.a. conditional gradient) for constrained convex optimization, enabled by a simple framework of duality gap certificates. Our analysis also holds if the linear subproblems are only solved approximately (as well as if the gradients are inexact), and is proven to be worst-case optimal in the sparsity of the obtained solutions.#R##N##R##N#On the application side, this allows us to unify a large variety of existing sparse greedy methods, in particular for optimization over convex hulls of an atomic set, even if those sets can only be approximated, including sparse (or structured sparse) vectors or matrices, low-rank matrices, permutation matrices, or max-norm bounded matrices.#R##N##R##N#We present a new general framework for convex optimization over matrix factorizations, where every Frank-Wolfe iteration will consist of a low-rank update, and discuss the broad application areas of this approach.", "authors": ["Martin Jaggi"], "n_citation": 405, "references": ["15dc096e-33c9-42cc-b33c-a22b11d73ab0", "1957521d-82b3-4a54-b577-124cb1a85a2e", "1bfaea19-9ccb-4a78-9572-773eca9143be", "29f196b0-3df4-43c9-bf33-6411f5adf879", "29fb1e37-1263-4895-ac45-838142515a50", "2bb6beda-7ca9-4aaf-a44c-52aa7de25094", "34f65f0d-9b85-4dc9-82ad-f61de420c1a2", "3c238aad-5025-4264-8189-08af97771b84", "553d5bba-c95f-4a24-89a1-3682ee025259", "5d7a9476-3fdc-41b3-8ede-70e2e8a5772f", "645e5492-3ded-4d82-91f5-6816c0a476c3", "69b9ef96-11d5-49b0-9ae3-492763e02ca8", "6ec4a90a-7722-4899-81b9-5432b733c65c", "9c32ba39-2347-4895-9b28-54365b4f6fc5", "bb3c38fa-c2b0-4d4f-8c9d-ca1884343474", "bc7c9d8d-0f3e-45b8-99d2-4864629cbcf1", "cd3710d3-d8c3-4d1a-ab18-0812d83ccacf", "cf5e1f21-34d6-4545-9682-11a1761fbdd2", "d969927f-ce36-4536-ae18-8eca00636374", "dda4e5c8-41d5-4534-ae29-4f44c6ff2841", "e01ddf5e-1d09-4ca0-9925-1fe3e8a61255", "ed44a853-35d9-45d7-b1bf-9a641a9f793a", "ed87ded9-78f7-48e2-99cb-cba925170a0d", "ee9078cc-6b23-4f88-a639-c255570322ac", "f266cfb1-9d30-4e2f-ac22-64307debf787", "f49fb38c-20c2-4122-a082-301dcf2c40f6", "f97917c7-d436-4388-be58-377336bd1559", "f9aa3b88-351b-4cb8-89e9-7147b31efa05", "fb409b06-8a16-4c90-b6ec-47c6c6c94d3a"], "title": "Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization", "venue": "international conference on machine learning", "year": 2013, "id": "3b2a5324-7b66-4101-9982-3a26e82afa3d"}
{"abstract": "We present a sharing analysis for the functional language Safe. This is a first-order eager language with facilities for programmer-controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts of the heap where the programmer may allocate data structures. The language and its associated type syste m guaranteeing that destruction facilities and region management are done in a safe way were presented in a previous paper [6]. That type system uses two functions, called sharerec and shareall, which are supposed to give upper approximations to the set of variables respectively sharing a recursive substructure, or any substructure, of a given variable. In this paper we present the formal definition of such functio ns. In order to have a modular and efficient analysis, we provide signatures for functions , which summarize their sharing behaviour. The paper ends up describing the implementation of the analysis and some examples.", "authors": ["Ricardo Pe\u00f1a-Mar\u00ed", "Clara Segura", "Manuel Montenegro"], "n_citation": 27, "references": ["21df750a-d0a9-4981-a1c6-3b759751c474", "30ccc8ec-434d-496e-ab40-d669add4041c", "9469dba9-4205-4782-a3d3-b83b86658620", "a362a1e7-f895-40e0-90ef-75daff6354a9", "b2ee0ee6-0988-486e-b4fd-96ff0fa5f0ca", "caa462ae-080b-4466-9f0d-51a79316994c", "d62ca6a2-610b-4124-a5fe-7ba0de684d8d", "f10cfb56-1737-4597-87cf-75f35143a3e5"], "title": "A Sharing Analysis for SAFE", "venue": "trends in functional programming", "year": 2006, "id": "3b2d1ec6-8658-49e1-b5d9-7a14d47fbec6"}
{"abstract": "Merging operators aim at defining the beliefs/goals of a group of agents from the beliefs/goals of each member of the group. Whenever an agent of the group has preferences over the possible results of the merging process (i.e. the possible merged bases), she can try to rig the merging process by lying on her true beliefs/goals if this leads to a better merged base according to her point of view. Obviously, strategy-proof operators are highly desirable in order to guarantee a fair merging process even when some of them are not sincere. In fact, when strategy-proofness is not guaranteed, it may be questioned whether the result of the merging process actually represents the beliefs/goals of the group. In this paper, the strategy-proof landscape for many merging operators from the literature, including model-based ones and formula-based ones, is drawn. Both the general case and several restrictions on the merging process (among others, the number of agents and the presence of integrity constraints), are considered.", "authors": ["Patricia Everaere", "S\u00e9bastien Konieczny", "Pierre Marquis"], "n_citation": 16, "references": ["19f03043-d536-4801-8b67-b7445175091c", "20073be0-de83-4717-aad1-a7374d34e7b2", "2f80d332-b489-4423-a7ef-0d71ab9ab2ea", "44cb204a-71b9-4ceb-a283-92bd4d373ffc", "4c21b97b-4c8a-4f45-b0e8-422e544ad8a4", "5d52debd-d39c-424e-949d-0409ac461a96", "6094cedc-5b08-42ab-bbc5-96f1f42e1d7b", "78ece605-27ee-4575-b5a6-786ee699a4b9", "7a7d0744-2ce6-4c26-b9f1-0e6b974e2f33", "7ff75bb6-a70d-40b3-a9cb-52868de08cee", "8853313d-665c-48e1-9899-09fb036d2bb8", "aa7543f0-6bd4-451c-9a1b-bac6d06e2048", "bd7c5a3f-61fa-41b0-b90a-bfbe89638c62", "cc0d64d0-9153-4818-9e75-2da36e41a55c", "fd5894cd-79b2-4ead-9ae2-f48f9d29a013"], "title": "On merging strategy-proofness", "venue": "principles of knowledge representation and reasoning", "year": 2004, "id": "3b43e33c-9fd6-439b-a1b4-d28a3a0c9b3a"}
{"authors": ["Stephanie Ryschka", "Benjamin Rodewyk", "Kyung-Hun Ha", "Markus Bick"], "n_citation": 0, "references": ["2b881989-0ba6-41e8-82ef-544c09dead8d", "2e757072-f172-4997-b120-9621dc33e5bc", "384b7cb3-f67d-4695-b80c-5254dcc47f75", "633d48bc-d0c2-4de0-a5eb-384398fdd3b5", "68ba98d6-3b26-469b-8c15-e0bf3ddc3441", "6d145db1-62a7-45af-8871-c260972101d3", "792bbe8b-1908-4c07-b44c-19870eb427bf", "79fc779d-647d-45b6-a16e-f0fdb01a4559", "81befdb5-3040-40eb-b78e-1b4ecc3d3f4a", "977935b8-6805-4e47-b60a-f029a6a4a39f", "a39f5746-b64a-4899-9be8-2eef67a06bc5", "bd03420f-826e-437b-b8fd-7868508079a1", "c47068d3-985d-40b1-aadd-736cd43f76e8", "d1b63545-6a27-4167-b2f6-e1c7c3e5d41f", "d45e89f6-6d2a-45da-b1da-2f447a6457f2", "e0154311-0095-40a0-ad5c-d8f325328d96", "e1c1bb4c-4b22-4165-b924-5e50d308eccd", "e317c386-9d3c-40c0-abcc-4ed7661dda7e", "f915a9ad-5cbc-4619-86d0-b7188fef05e5", "fc0c6c38-b5c4-425c-b733-267725c1b705"], "title": "A Qualitative Investigation of Risk Perceptions in the Case of Check-in Services.", "venue": "", "year": 2014, "id": "3b4a9a1d-fdea-443b-8eb1-d4814afce805"}
{"abstract": "Justification of investments in information technologies is an important research topic in the information systems area. Several approaches have been proposed. One of these highlights the deficiencies of traditional economic justification based on net present value, and proposes the use of techniques based on financial option pricing theory. This paper examines the relationship between project risk and option values of investments in new information technologies and illustrates how this relationship is significantly different from well-known results in the case of financial option pricing. Conditions for determining the desirability of risky projects are derived.", "authors": ["Ram L. Kumar"], "n_citation": 145, "references": ["82f4027b-760e-404b-960e-8a9ab902eb0d"], "title": "A note on project risk and option values of investments in information technologies", "venue": "Journal of Management Information Systems", "year": 1996, "id": "3b6310e9-19e7-4528-9fcd-4f82c926e5fa"}
{"abstract": "As consistent time scale is essential to facilitate group operations and improve network performance, time synchronization is regard as a critical piece of infrastructure for distributed network measurement and control systems, especially for wireless sensor networks (WSNs). However, existing time synchronization algorithms for WSNs either do not provide enough scalability to achieve compatibility with other sync protocols, or do not fully take into account the characteristics of WSNs. This paper proposes a time synchronization method (TSM) to achieve precise time synchronization and reach the frequency drift compensation in WSNs at the same time. Evaluations show that TSM synchronizes wireless sensor nodes precisely with a magnitude of microsecond. Moreover, it has a good performance of stability and energy efficient.", "authors": ["Chao Zou", "Yueming Lu"], "n_citation": 50, "references": ["03c26ee2-267c-4eb2-91d0-e0ebed81eed3", "0e4c2b0f-d620-450d-b7cb-38add0f8213d", "1d3d26db-4531-4a05-b504-3d86c7d8696c", "43359993-098a-43d6-a83b-6a73fdfc2666", "89b4a19b-13d8-4d60-8928-437f9c48044a", "b5af423b-91cd-4f98-818c-02f2ec373bc2", "f3267c01-b670-4b7a-a3a5-79088c0d90ab"], "title": "A time synchronization method for wireless sensor networks", "venue": "", "year": 2012, "id": "3b69588c-a7a2-4ff2-9565-c5ff4df81406"}
{"authors": ["Minos N. Garofalakis"], "n_citation": 0, "title": "Constraint-Based Model Mining: Algorithms and Applications.", "venue": "", "year": 2003, "id": "3b7c0e6e-f7f5-4aff-a3c9-dec7f364e24a"}
{"authors": ["Hanno Eichelberger", "J\u00fcrgen Ruf", "Thomas Kropf", "Thomas Greiner", "Wolfgang Rosenstiel"], "n_citation": 2, "references": ["1415de98-97c4-41bf-8771-ae1c9e083ed6", "2ed548cc-a319-474e-b235-3991ae1a06a9", "42247817-e86f-4dfe-a741-d412db6ef49b", "5511b151-927c-4a7b-aaa3-9eff626512d3", "5d37fe35-001c-49e8-8fca-5032dde20579", "5ed9089f-d3be-4370-bf0c-bb96ff41fe25", "78994fd5-2ca3-4b3d-91a9-7cdafc8bffe8", "9f026071-8a55-4efb-bc70-1c90482ebb1b", "c7f444a7-b319-4587-ae81-6a77354c288d", "fd9a043d-9c56-40f5-82d7-a3c8f4ce9a94"], "title": "Debugger-Based Record Replay and Dynamic Analysis for In-Vehicle Infotainment", "venue": "international conference on computational science and its applications", "year": 2014, "id": "3b91e228-179c-46ea-bb89-ae3d0a2047b6"}
{"authors": ["Dacheng Tao", "Jianzhuang Liu", "Xiaoou Tang"], "n_citation": 3, "title": "Learning User's Perception Using Region-based SVM for Content-based Image Retrieval.", "venue": "", "year": 2004, "id": "3b9fe31e-5f20-45bd-8ccd-92f395d3539d"}
{"authors": ["Mauro Migliardi", "Roberto Podest\u00e1"], "n_citation": 0, "title": "Evaluation of Java Web Services Toolkit for Grid Computing.", "venue": "parallel and distributed processing techniques and applications", "year": 2004, "id": "3bc0b1a2-978a-4d90-9bab-f7bb57436698"}
{"authors": ["Martin G. Roberts", "Timothy F. Cootes", "Judith E. Adams"], "n_citation": 27, "references": ["09565087-4628-42b3-8a02-970ac713e1eb", "2d474dad-b126-475c-b78a-83ff16aaaf8d", "6ff7722a-0daf-4cbc-a8ac-7213355abe9e", "967d9f48-1401-4a55-adad-96ac352690aa", "b9a35054-c916-48cb-bdcb-d385bd33d900", "bf03f268-de9d-4a80-aee1-200990056503", "c2697d9d-0f9f-417b-97b1-3a483ca6cc35", "e649a9fd-f6d9-4aac-b428-29b82c20a484", "f6bd8b64-684d-429a-aab5-8ff3a2c23cd6"], "title": "Automatic location of vertebrae on DXA images using random forest regression.", "venue": "medical image computing and computer-assisted intervention", "year": 2012, "id": "3bd74407-f147-49aa-a11f-5824e425735c"}
{"authors": ["S. Ray", "Reena Shakya", "Campbell Wilson", "Bala Srinivasan"], "n_citation": 0, "title": "On Image Thresholding by Entropic and Probabilistic Distance Criteria.", "venue": "", "year": 1999, "id": "3bdb1239-cac7-4ba2-ad35-cd48dc9dfc55"}
{"authors": ["Jakob Wasza", "Sebastian Bauer", "Sven Haase", "Joachim Hornegger"], "n_citation": 50, "references": ["9e339286-c9f2-4030-acd7-39dfe11b3f51", "de2e2213-8d5a-4a9a-bd80-d1adcb17fee9"], "title": "Sparse Principal Axes Statistical Surface Deformation Models for Respiration Analysis and Classification.", "venue": "", "year": 2012, "id": "3be261a9-5b95-4c87-9a56-ffe5118e273e"}
{"authors": ["Prashant Chopra", "Joerg Meyer"], "n_citation": 2, "references": ["33e4f444-6959-43f5-b42d-23851e057136", "58f8e509-ee0d-4494-90f6-ec75c7b90a82", "591e5e06-b8da-4199-bca7-752529262855", "7a15e77c-ad64-420c-ab95-3698dcad7076", "7b9d1ba6-e98b-4511-8098-7ebb8e8a40c7", "7d738632-dc5d-4ec9-a4cd-1d1a74d33166", "87d30e57-7b54-4b29-a259-0cdf01e85637", "b54351af-995c-4f53-8f2f-ec8659543e12", "c10e81bd-6d1b-4e99-a3ec-9f98aedade63", "cbff7edf-d857-4510-bd08-1a7e63b23bed", "d096a8db-bda9-49db-ac67-eb2f021d3094", "dfdcec9e-446d-4506-80f7-22d7e7299107", "eecffedc-7225-427e-a046-7bf170d87827"], "title": "Modeling an Infinite Emotion Space for Expressionistic Cartoon Face Animation.", "venue": "", "year": 2003, "id": "3c08bd67-94d6-424e-8098-43ec7ad923c1"}
{"authors": ["Luis Quintales", "Maria J. Martin"], "n_citation": 0, "title": "Dise\u00f1o de un Prototipo de Base de Datos Distribuida para Docencia e Investigaci\u00f3n.", "venue": "", "year": 1997, "id": "3c30c923-0f83-40e4-b453-33b84d78f555"}
{"abstract": "A key challenge in multi-robot teaming research is determining how to properly enable robots to make decisions on actions they should take to contribute to the overall system objective. This article discusses how many forms of decision making in multi-robot teams can be formulated as optimization problems. In particular, we examine the common multi-robot capabilities of task allocation, path planning, formation generation, and target tracking/observation, showing how each can be represented as optimization problems. Of course, globally optimal solutions to such formulations are not possible, as it is well-known that such problems are intractable. However, many researchers have successfully built solutions that are approximations to the global problems, which work well in practice. While we do not argue that all decision making in multi-robot systems should be based on optimization formulations, it is instructive to study when this technique is appropriate. Future development of new approximation algorithms to well-known global optimization problems can therefore have an important positive impact for many applications in multi-robot systems.", "authors": ["Lynne E. Parker"], "n_citation": 50, "references": ["090a55a8-73b0-4f07-9467-fadeac63cc44", "0f6dc9fd-8a1d-4626-a6a1-7a006a4374a2", "2553d44c-c384-4ef2-a797-bb77a58a3c54", "27c6e1da-4741-4918-b373-fe12edf60a60", "29268e3b-4319-43ed-9025-ead2972361b2", "38c35932-7d88-4848-b7b9-f526b8bce7c2", "45c2d4f1-35d3-47bc-9cd0-16fee1f2392c", "471477c4-aecc-4e6f-ae1b-c371847e283c", "5392c61c-b2b0-4213-a022-08609d996a7f", "60c20138-582e-4a5b-939f-9af098afb9f3", "634e278b-75f6-4ad0-929e-6abc6cca7870", "6d60ec53-385a-484d-9a45-5904a190c209", "78ae8aea-aa13-4788-82ee-84a36fab68d4", "89020492-b559-43f5-9f4b-f43cde4dee8a", "8c9574e3-6bde-491e-ba01-e7bc190f9c64", "93d459c5-25b3-47d0-a580-06b696bb3970", "93e0871b-347c-4b4d-8f8b-cbc5bd1ef95c", "9d771c0f-7344-4473-b6a7-90bf5d8b77d0", "a4541d58-b65d-4342-b1aa-1e422093421a", "ab35dc68-62bd-4c54-81d3-9a8406827489", "ad53c019-f895-4108-8dec-61718eb2f441", "baf427ba-2476-4e38-b9b6-c336ed8d7883", "bd952e7a-bbfe-41e3-abf0-428012495fc4", "be3d9256-7c9e-4cd7-bef6-f7357e755c40", "c7d01273-632a-4c99-aacd-ba3b98abb712", "cc905096-7394-48f6-a0d8-5af0eac0a5d4", "cd1f4a53-5ab5-408b-bb60-55b67e81d8d7", "ce4f3afa-e77e-4227-8d1d-3164572d058e", "ce913870-1c74-4428-a946-e258f07242f1", "ec835496-802c-4c1b-9f94-12af1dc092b3", "f1a73fc7-7682-4223-bd3d-f3c9f2079284", "f2143013-8d1c-4f93-9bf5-b9e2908c6ea8", "fe6515d5-788a-4f37-9f20-35347298e7dc"], "title": "Decision making as optimization in multi-robot teams", "venue": "international conference on distributed computing and internet technology", "year": 2012, "id": "3c3556c6-a67d-496c-b366-ed80cc7bf587"}
{"authors": ["Zhixi Fang", "Lionel M. Ni"], "n_citation": 41, "title": "Parallel Algorithms for 2-D Convolution.", "venue": "international conference on parallel processing", "year": 1986, "id": "3c412408-8b31-436c-a704-cc15b0b0540f"}
{"abstract": "Particle Swarm Optimization (PSO) is gaining momentum as a simple and effective optimization technique. However, its performance on complex problem with multiple minima falls short of that of the Ant Clony Optimization (ACO) algorithm. The new algorithm, which we call Hybrid Particle Swarm Optimization, combines the ideas of particle swarm optimizati-on with clonal selection strategy and simplified quadratic interpolation (SQI), which is used to improve its local search ability, and to escape from the local optima. Simulation results on 14 benchmark test functions show that the hybrid algorithm is able to avoid the premature convergence and find much better solutions with high speed.", "authors": ["Jing Wang", "Xiaohua Zhang", "Licheng Jiao"], "n_citation": 50, "references": ["2436be30-b20d-4916-9923-d64a056fd14a", "353557c6-60bd-44f8-9119-d45c8fb310a4", "8a077d60-f03a-4dad-8a02-2ad606c9ad16"], "title": "Integrated the simplified interpolation and clonal selection into the particle swarm optimization for optimization problems", "venue": "simulated evolution and learning", "year": 2006, "id": "3c46b3d1-1b89-4aaa-8210-c9e5e19f602e"}
{"authors": ["Yasuhiko Mutoh"], "n_citation": 1, "title": "SIMPLE DESIGN OF THE STATE OBSERVER FOR LINEAR TIME-VARYING SYSTEMS", "venue": "international conference on informatics in control, automation and robotics", "year": 2009, "id": "3c92eea3-2c0d-4e98-9cd8-6e76665560eb"}
{"authors": ["Rob van Ouwerkerk", "T. F. Meijman", "L. J. M. Mulder"], "n_citation": 0, "title": "BioPsy: An intranet application for biophysical experiments.", "venue": "", "year": 1999, "id": "3c9a57ff-6c29-4a91-88c6-bdb88a02dc35"}
{"abstract": "We are interested in the following general question: is it possible to abstract knowledge that is generated while learning the solution of a problem, so that this abstraction can accelerate the learning process? Moreover, is it possible to transfer and reuse the acquired abstract knowledge to accelerate the learning process for future similar tasks? We propose a framework for conducting simultaneously two levels of reinforcement learning, where an abstract policy is learned while learning of a concrete policy for the problem, such that both policies are refined through exploration and interaction of the agent with the environment. We explore abstraction both to accelerate the learning process for an optimal concrete policy for the current problem, and to allow the application of the generated abstract policy in learning solutions for new problems. We report experiments in a robot navigation environment that show our framework to be effective in speeding up policy construction for practical problems and in generating abstractions that can be used to accelerate learning in new similar problems.", "authors": ["Marcelo Li Koga", "Valdinei Freire da Silva", "Fabio Gagliardi Cozman", "Anna Helena Reali Costa"], "n_citation": 50, "references": ["10562a3b-4600-4e3c-a123-c399606a282c", "14d153f3-6176-4f3b-9011-655a129605ba", "2960c73c-f6be-4be0-b5a7-245e621b4b3d", "29956b99-ab54-42e4-a7e5-809ee936e4e7", "2b3446b7-f984-4e77-806d-88195b544235", "3bd7e5ba-94fa-4c35-b630-7d847b70497d", "41de0c82-c218-4c6c-a326-df6ca6173f8b", "4abe9362-c07d-415f-ba60-311481ffc2f9", "80d7f99c-e374-47a4-9c13-41f9480e85ce", "843da64a-484e-47d2-b167-5a219f18a890", "94ac13bc-b9da-4d36-a1fc-02ead34dff1f", "b46c8398-7943-4951-b219-03adde2a6fce", "c6f48732-851c-42a3-a175-c97161b28203", "cac1d48f-df84-49fe-bb2d-25ccee389e3c", "e0734956-0750-4112-916d-19a071a9cfeb", "f11c51c5-54c1-42f1-8377-c8ef4b471ae3", "fe630479-8a7e-45dd-8d11-4905abca39e1"], "title": "Speeding-up reinforcement learning through abstraction and transfer learning", "venue": "adaptive agents and multi agents systems", "year": 2013, "id": "3cbbf880-7d73-4825-87c5-85fe61047387"}
{"authors": ["Rong Tan", "Junzhong Gu", "Peng Chen", "Zhou Zhong"], "n_citation": 0, "references": ["045f39bb-3c9c-44a2-96ff-32c3699e8518", "1757fcde-9327-4592-a053-2e176c8ebe4f", "24a7c2ff-9a68-44b2-826b-b8d4b1db406c", "2a8a8a69-f76a-4590-afdc-aa4d6035ef18", "334653df-2fdd-4f99-8061-39525f42d0ba", "6877dfea-cd63-4a08-bdbf-c6d36a2ad79e", "74e8e5a4-c30f-4596-8756-fd76c9865361", "7b9ce05d-7fc6-4e74-b994-ecde4760779f", "930d8649-4456-41fd-aa24-ced32be655ce", "d3b0635e-5447-435d-9975-a2582d19fc37", "f3edca78-98d5-413a-9411-f06d3b2b09ec"], "title": "Region of Interest Discovery in Location-Based Social Networking Services with Protected Locations", "venue": "pacific asia workshop on intelligence and security informatics", "year": 2013, "id": "3cbe8772-680a-4a2f-8190-90688b475fc7"}
{"abstract": "The correct interpretation of Web content by users is a major condition for an effective and accessible Web. However, many people with hearing loss have difficulties interpreting long and complex texts. In this work, we investigated barriers in the usage of Web systems by users with hearing loss. A participatory study with 21 users with hearing loss was conducted in the city of Macapa in Brazil. All the participants use internet frequently, but have different profiles, and reading and writing skill levels. Artifacts and methods from Organizational Semiotics were employed in the elicitation and analysis of problems, barriers, as well as solutions with the participants. The results provide alternatives that range from simple design directives to solutions that demand further research.", "authors": ["Marta Ang\u00e9lica Montiel Ferreira", "Rodrigo Bonacin"], "n_citation": 50, "references": ["1b6fd456-4ae1-4e79-ab8e-b01eefbdb71f", "545a70ad-6aec-4cc5-85c8-b8a0bd2a2e44", "9b1afae3-e5dd-42f8-bd50-2a61d7b1e22f", "c3a31ec8-c748-4d58-b9dc-7a964ff66140", "c3ea3253-033d-44a7-ba91-9887e7dc6710", "dbd9eb06-6554-4642-80ba-a67ddb8fafe4"], "title": "Analyzing barriers for people with hearing loss on the web: a semiotic study", "venue": "", "year": 2013, "id": "3cc0d169-0cc0-447d-9d7e-bd6addc4c226"}
{"abstract": "This paper provides an initial implementation of the novel module to transform OWL-S ontology into executable robot control code. We explore the idea of formalizing robot behavior descriptions using Semantic Web knowledge representation. The paper describes the methodology and implementation details of the robot control code generator to translate ontology file descriptions to a compilable Java code, as well as the robot control framework to execute the code at run-time.#R##N##R##N#We validate our approach with the experiment, conducted on Sctios G5 robot. The task \"follow the red object\" is translated into a working Java code from OWL-S ontology file. The generated Java code is compiled and executed at run-time. As a result, the robot is following the person with a red folder in his hands.", "authors": ["Yuri Gavshin", "Jevgeni Shumik"], "n_citation": 50, "references": ["3aa4ba74-d8de-4575-b135-2646ca4dc873", "4c982920-87db-41f5-bd37-76faff32426f", "56fd960c-896b-4418-8655-6a11e9c05084", "639c828e-2899-4b42-993c-a0af3791d204", "adefd798-d3a6-4b45-84e2-012f82682e47", "d31345df-3d72-4ba5-9908-a24e33e9931a", "d7a0e8a5-b2f9-4105-b5a8-da00f488f315", "dc1267b7-8808-45f8-8fb2-820dce1bbbba"], "title": "Runtime generation of robot control code from ontology file", "venue": "international conference on adaptive and intelligent systems", "year": 2011, "id": "3ccbe648-7542-441a-946a-2e06b6f6a58e"}
{"authors": ["Brian Thomas"], "n_citation": 0, "title": "Digital Toolbox: E-Mail Attachments: Finding the Right Fit.", "venue": "IEEE Internet Computing", "year": 1997, "id": "3cd5b107-930e-4623-ac91-ad9e3813da06"}
{"authors": ["Richard Lee Storch", "Matt Williamson"], "n_citation": 0, "title": "Technology Value Analysis of the Ship Design Value Stream.", "venue": "", "year": 2002, "id": "3ce31e2a-a5af-4346-ae9c-b9f8733425df"}
{"authors": ["Nancy Ann Neudauer", "Andrew Meyers", "Brett Stevens"], "n_citation": 1, "title": "Enumeration of the bases of the bicircular matroid on a complete bipartite graph.", "venue": "Ars Combinatoria", "year": 2003, "id": "3cef27a5-5b42-44a7-980d-3ed61eef1236"}
{"abstract": "Constrained function optimization using particle swarm optimization (PSO) with polynomial mutation is proposed in this work. In this method non-stationary penalty function approach is adopted and polynomial mutation is performed on global best solution in PSO. The proposed method is applied on 6 benchmark problems and obtained results are compared with the results obtained from basic PSO. The experimental results show the efficiency and effectiveness of the method.", "authors": ["Tapas Si", "Nanda Dulal Jana", "Jaya Sil"], "n_citation": 6, "references": ["2f326d6c-062c-4adc-b787-2ae9a596d17e", "bc291e79-6353-4569-8032-5e0a00de6025", "bef143e0-ed33-4b70-a526-9bb4845fa472", "d113cb39-ef0c-48be-a616-07ba62f9c1dc", "d5c30581-83de-402f-8b8f-a297b97ea987"], "title": "Constrained function optimization using PSO with polynomial mutation", "venue": "swarm evolutionary and memetic computing", "year": 2011, "id": "3d03a1d1-3fe5-4ae5-b55f-06c145c44ee5"}
{"authors": ["Lu Wei", "Jagath C. Rajapakse"], "n_citation": 7, "title": "A neural network for undercomplete independent component analysis.", "venue": "the european symposium on artificial neural networks", "year": 2000, "id": "3d445097-7f4c-4a43-9336-1e3131201dc8"}
{"authors": ["Dmitry N. Zotkin", "Ramani Duraiswami"], "n_citation": 1, "references": ["0912f60f-e3e4-4414-bae2-ddb22fecec9f", "130e0273-cb63-424b-ba44-22e334813d4c", "17f46eb9-46ce-4a72-96ac-28644aac0626", "4051a98c-2c20-4a86-9571-5e58dc805345", "463b0a9f-e6de-4a73-8e44-333fc893698c", "6f768aef-a0db-414f-a5a8-79a65de0e047", "712bfec2-1194-4667-a47a-6bf8df07b362", "8ad1e5c6-09b5-41fa-a9b5-9c4984693d1a", "9354e1ed-808e-41dc-b41f-2447eab214d0", "aa34038e-f37b-4ca7-8dd4-77d380b5b629", "af856c25-c1a1-4de0-b471-b2027a57b64f", "c29d0023-c23f-44d4-a733-a3d26dd3342c", "c9105324-5c36-429d-8d04-f22d1c5413b8", "d8b1b5c0-3311-4848-9b71-44901949626e", "d8cd5f4c-6b20-40bd-bc3c-0545d77964b5", "e444ac6a-725f-455b-b08c-0cd9510e2812", "f2da6118-520f-4753-bb91-9f31143933e2"], "title": "Signal Processing for Audio HCI", "venue": "signal processing systems", "year": 2010, "id": "3d4a001b-bff6-4576-85db-8328f07e6718"}
{"authors": ["Klara Nelson", "Natasha F. Veltri"], "n_citation": 0, "title": "The Dynamics of Women in IT: A Unifying Framework", "venue": "", "year": 2010, "id": "3d4e5794-db5d-44c8-823e-904370aa21e3"}
{"authors": ["Stefan B\u00f6ttcher", "Rita Steinmetz"], "n_citation": 0, "title": "A Subset Test for XPath Expressions under DTDs.", "venue": "british national conference on databases", "year": 2003, "id": "3d74d2d1-c50b-4b86-8c16-fe0848da8c92"}
{"authors": ["David Carrell", "James D. Ralston"], "n_citation": 7, "title": "Variation in Adoption Rates of a Patient Web Portal with a Shared Medical Record by Age, Gender, and Morbidity Level", "venue": "", "year": 2006, "id": "3d7878f7-be4f-4d95-85f0-526639002613"}
{"authors": ["Qutaibah M. Malluhi", "Gwang S. Jung"], "n_citation": 0, "title": "Enabling High-Performance Data Service in the Web Environment.", "venue": "International Journal of Computers and Their Applications", "year": 2003, "id": "3dc07c74-35af-4592-9055-7fa39d5f94dc"}
{"abstract": "Human identification becomes huge demand in particular for the security related areas, in particular for the network security. EEG signals are confidential and hard to imitate, since EEG signals are a reflection of individual-dependent inner mental tasks. Generally speaking, it has several advantages, such as (i) it is confidential as it corresponds to a mental task, (ii) it is very difficult to mimic and (iii) it is almost impossible to steal as the brain activity is sensitive to the stress and the mood of the person, an aggressor cannot force the person to reproduce his/her mental pass-phrase. In this paper we first proposed a novel algorithm to create a spatial pattern of EEG signals obtained from the open public database. In our EEG signal processing, we have analyzed 64-electrode EEG samples for two databases, one is for 45 people and calculate the equivalent root mean square (rms) values for each electrode signal over 1 second period, by which created a 64-value input for each subject. With this neural network (NN) model, our analysis clearly showed that our designed classifier is able to identify all the 45 people correctly (successful rate of 100%) with a mean square error of 2.0334\u00d710 -7 and the same algorithm applying to the", "authors": ["Xu Huang", "Salahiddin Altahat", "Dat Tran", "Li Shutao"], "n_citation": 1, "references": ["2c0640d9-680c-4e5e-942e-257187e52d03", "65d0cf5e-a36a-432e-b730-e1ef8d0b16e1", "821c62e6-d90f-452b-8782-0665e870f902", "a636f20b-5efe-4496-9b4b-8eb763bc3274", "d9c3061f-da12-44d5-b17f-a681f59217d4", "f3267c01-b670-4b7a-a3a5-79088c0d90ab"], "title": "Human Identification with Electroencephalogram (EEG) for the Future Network Security", "venue": "network and system security", "year": 2013, "id": "3dd90abb-44a5-4977-abb4-fbcfe6a7d1f0"}
{"abstract": "View of film system for medical diagnosis was presented. the system which took the cold cathode fluorescent lamps (CCFL) as the background light source, excluded ambient light impact on the concept of film by a light shell , and realized the digital X-ray film through the CCD camera the image information transferred to the computer. The details of hidden areas on some obscure digital X-ray images were enhanced by multi-scale Retinex (MSR) algorithm. With this method, the image contrast enhancement, sharpening and dynamic range compression was achieved at the same time. The information of hidden areas of X-ray image was obviously enhanced. The enhancement technique was compared with other techniques such as histogram equalization, homomorphism filter. The result of experiment shows that the MSR algorithm can overcome the lack of enhancement of traditional digital X-ray method and satisfy the clinic demand.", "authors": ["Zhishe Wang", "Jilin Wei"], "n_citation": 0, "references": ["57cc976f-ea69-4fec-927d-5d749b7c743b", "a8872790-6eb6-4990-a9db-91edd9bd2c73"], "title": "Image enhancement of X-ray film base on mutil-scale retinex", "venue": "artificial intelligence and computational intelligence", "year": 2011, "id": "3e1274ec-51ff-4306-8a6c-05b6bbe2a7f2"}
{"authors": ["Moreno Andreatta", "Carlos Agon", "Emmanuel Amiot"], "n_citation": 7, "references": [], "title": "Tiling problems in music composition: Theory and Implementation", "venue": "", "year": 2002, "id": "3e227697-d2bf-4fbb-9fe3-3c709a918ab0"}
{"authors": ["Steven Alter"], "n_citation": 0, "title": "Total Quality and the IS Function.", "venue": "international conference on information systems", "year": 1993, "id": "3e303503-dbf4-416c-aa73-192fa9369f39"}
{"authors": ["\u00d3scar Ferr\u00e1ndez", "Michael Ellsworth", "Rafael Mu\u00f1oz", "Collin F. Baker"], "n_citation": 21, "references": ["1a02ab7c-7923-4d90-bf75-7e11b19095ca", "4a26baed-777c-4d49-8e8d-8b815294bcc2", "50bc5f03-9ee8-421c-9890-723b17df2a3d", "7e66c74b-7a49-415f-9134-9a1fc9b0cf2e", "b7f76414-0d1a-481d-881f-4855a9b6dcee", "c0f39f96-77f5-4d5a-a059-303e24ef5c5f"], "title": "Aligning FrameNet and WordNet based on Semantic Neighborhoods.", "venue": "language resources and evaluation", "year": 2010, "id": "3e4c9040-d772-45c1-ac2a-e0f7f38b6137"}
{"authors": ["Ebrahim Bagheri", "Ali A. Ghorbani"], "n_citation": 5, "references": ["0bff98d7-a6a8-43c4-8e59-ee4534b52d69", "0ea745c7-58b2-48e8-9115-42e9b0d20f2a", "12b62bcf-2d6c-4753-bede-52e8a2f11ff8", "34f610f0-c76b-4f26-bf6f-739af71fd68f", "362ab22c-27a6-4939-8213-c6c61d0b48dc", "41350086-4320-45bb-a93c-be68975bfff5", "5f44a17e-0068-4c1d-99e2-62e6ec886cba", "812c314c-9742-46fa-b1e8-5c7d640f1322", "b45beab7-c3aa-4637-99a7-b9520f0b26ce", "c69ef004-087e-486c-97c9-9b4587d0b10a", "cfc11b67-a462-4006-9fdf-3c7994f5f075", "d38e51f2-d4fd-455e-86ed-82e0fc28fc8d", "f8249db1-6028-4cf6-882e-054e5114f7b0"], "title": "Exploiting Trust and Suspicion for Real-time Attack Recognition in Recommender Applications", "venue": "", "year": 2007, "id": "3e5842f2-9b3e-46c1-b1a6-10b93d8faf07"}
{"abstract": "We consider subshifts of the full shift of all binary bi-infinite sequences. On the one hand, the topological entropy of any subshift with computably co-enumerable language is a right-computable real number between 0 and 1. We show that, on the other hand, any right-computable real number between 0 and 1, whether computable or not, is the entropy of some subshift with even polynomial time decidable language. In addition, we show that computability of the entropy of a subshift does not imply any kind of computability of the language of the subshift", "authors": ["Peter Hertling", "Christoph Spandl"], "n_citation": 7, "references": ["44772c8e-cb65-47e9-8462-b4bc3b39811a", "4533f84c-c3e8-4f6c-bbb7-400b4145c2c6", "bfad35b2-6496-4f86-8f17-f1bff2e6ddd8", "fbe4b745-a1c4-4cb7-9ebc-da5d49f808ab"], "title": "Shifts with Decidable Language and Non-Computable Entropy", "venue": "Discrete Mathematics & Theoretical Computer Science", "year": 2008, "id": "3e5985ea-b08d-4b7f-934c-9533f3012467"}
{"authors": ["El-Bahlul Fgee", "Shyamala C. Sivakumar", "William J. Phillips", "William Robertson", "J. Kenny"], "n_citation": 0, "title": "Implementing a Dynamic Pricing Scheme for QoS Enabled IPv6 Networks.", "venue": "international conference on enterprise information systems", "year": 2005, "id": "3e5c0ece-3c7c-4fa4-ae07-62e99196dedd"}
{"authors": ["Dieison Antonello Depr\u00e1", "Sergio Bampi"], "n_citation": 0, "references": ["2f452bb5-b2b9-40a2-8efa-3cded881a73d", "303b8e99-9e78-4c4a-8fff-fcaff653ebd1", "7210fb5d-2d76-4639-9365-e3fe830307b4", "76c6a129-cd30-48d7-8013-9dbc7fb15625", "94e25efe-d596-4767-99f0-d87f8c950f0c", "ad410a28-7aed-4784-8a52-52566cd282b8", "f6bb73fd-714a-40f3-86a2-8fc4bd1a5c2c"], "title": "Techniques for Architecture Design for Binary Arithmetic Decoder Engines Based on Bitstream Flow Analysis", "venue": "", "year": 2009, "id": "3e61946d-98b8-456b-a06e-7e294a70eb79"}
{"abstract": "The classical setting of community detection consists of networks exhibiting a clustered structure. To more accurately model real systems we consider a class of networks (i) whose edges may carry labels and (ii) which may lack a clustered structure. Specifically we assume that nodes possess latent attributes drawn from a general compact space and edges between two nodes are randomly generated and labeled according to some unknown distribution as a function of their latent attributes. Our goal is then to infer the edge label distributions from a partially observed network. We propose a computationally efficient spectral algorithm and show it allows for asymptotically correct inference when the average node degree could be as low as logarithmic in the total number of nodes. Conversely, if the average node degree is below a specific constant threshold, we show that no algorithm can achieve better inference than guessing without using the observations. As a byproduct of our analysis, we show that our model provides a general procedure to construct random graph models with a spectrum asymptotic to a pre-specified eigenvalue distribution such as a power-law distribution.", "authors": ["Jiaming Xu", "Laurent Massouli\u00e9", "Marc Lelarge"], "n_citation": 28, "references": ["25ae3db6-aa98-401a-aea7-839ba1c1f740", "261f4414-be4d-46c5-b420-187c15a6b8e1", "266fe2bc-554f-4292-a300-76d23df5376e", "4f8a4890-9178-4781-a5d4-0e665b6d91d0", "528c9f9d-b50b-4bc3-9aa1-2706b4a61b2c", "5ccdf1db-7eee-435b-99c2-890b854823f3", "68faab18-b537-4f62-85cf-ddc9ef352362", "6fbc185a-1319-46e0-9f4f-662fce6108f2", "74001657-3647-4740-9147-e47caeedb567", "8ebe0f82-69b0-439b-ae45-64c7b32b1099", "98da593f-2756-4d08-b67b-f8c610f41354", "c8e9672d-bfcf-4568-8d8d-d390510a7257", "ee3f88de-8b7e-4dcc-b1db-94c9e5e6af25", "ee64ae0c-317a-45ba-99da-d9e46d182a1a", "f99a6b3a-0980-4a9e-bbce-f9397c45106f", "fda3ad4e-5c89-4cbb-ac3c-f3ad85c9a245"], "title": "Edge Label Inference in Generalized Stochastic Block Models: from Spectral Theory to Impossibility Results", "venue": "computational learning theory", "year": 2014, "id": "3e701daa-75ad-44d4-a29c-78122b537197"}
{"authors": ["Hagai Attias"], "n_citation": 7, "references": ["18c7cefb-09b1-4bba-8029-33676798e910", "bd1cbb4a-a469-4abf-9f53-793ace044608", "db3ed3e3-d2cc-42fb-a118-1f8e9f77d9e0", "f4afc482-8038-4d5a-841a-d0a6202728ed", "ff480a90-3458-486f-9f8b-6a250a4a4024"], "title": "Learning in high dimensions: modular mixture models.", "venue": "", "year": 2001, "id": "3e937632-b70e-4538-b739-d89f0745aeb5"}
{"authors": ["Alauddin Alomary", "Mohammad Shahid Jamil"], "n_citation": 0, "title": "The Evaluation and Comparative Study with a New Clustered Based Machine Learning Algorithm.", "venue": "The International Arab Journal of Information Technology", "year": 2006, "id": "3eac9446-34db-46ff-9241-b22400746659"}
{"authors": ["Charu C. Aggarwal", "Philip S. Yu"], "n_citation": 131, "references": ["09a7e859-1226-4494-94dc-1b0e902d5d10", "0bf22c24-7622-4495-ae0e-2c7e9eec9e55", "23db9aec-d47d-48c8-b428-c8c32d8f137a", "303815d7-222e-4da0-85da-a82bf916b41e", "64c99ab6-e4ad-476f-a92d-13686a6e1aec", "6f9dc5d6-80e1-4c79-b8ff-e797c480e6f4", "7070053c-489f-402a-93ac-f87c152902cd", "8bfd7499-28f0-4155-9610-d28725aba9f1", "a22d71b6-61c4-4ae4-9843-931feb08e710", "ae3ea321-d857-4f6d-a6f2-cf27993c3b47", "b14c5db2-03af-406a-a513-3cb58b523dbe", "bd363c40-6a73-40ba-a748-76d0f621697f", "df3ea837-9b41-44e4-a049-0ad9d5b65853", "e4fdce29-a285-48c5-a1bb-589194276c70", "fb739bf0-40a7-48c9-a30d-c3ac421819de", "fe40e126-2ac9-4975-b64b-b0e19d9d1ec7"], "title": "Outlier Detection with Uncertain Data.", "venue": "siam international conference on data mining", "year": 2008, "id": "3ed462ed-4847-4b19-b7d9-5229da828abd"}
{"authors": ["Hamid Harroud", "Mohamed Ahmed", "Ahmed Karmouch"], "n_citation": 3, "title": "Agent-Based Personalized Services for Mobile Users over a VPN.", "venue": "international conference on enterprise information systems", "year": 2001, "id": "3ef9fbca-27fe-4006-9dfa-12744c068a83"}
{"authors": ["Carsten Felden", "Peter Chamoni"], "n_citation": 0, "title": "EVALUATION OF TEXT CLASSIFICATION ALGORITHMS - for a Web-based Market Data Warehouse", "venue": "international conference on web information systems and technologies", "year": 2005, "id": "3efb34a4-b9a0-4185-a61f-8c7e3b480b72"}
{"abstract": "This economic analysis of farmers' voluntary adoption of water quality management alternatives integrates three biophysical simulators to predict crop yields and soil erosion/water quality impacts under uncertain weather and market conditions. Farmers' willingness to cost\u2010share was used to estimate expectations of net returns and associated water and soil pollution based upon government cost\u2010share scenarios. Simulations integrated into mathematical programming results indicate that irrigation and nitrogen fertilizer applications do not alter water quality in the Gum Creek Watershed as much as generally anticipated. Under limited government payments, pollution abatement through reduction of irrigation and/or nitrogen fertilizer applications significantly reduces farmers' net revenues and hence, without threats of other regulatory means, more farmers opt out of a voluntary program. Abatement of nitrogen runoff and leaching should consider other management alternatives and include non\u2010agricultural sources of pollution. Copyright Kluwer Academic Publishers 2000", "authors": ["Henglun Sun", "Jack E. Houston", "D. L. Thomas"], "n_citation": 0, "references": [], "title": "Modeling voluntary participation in a cost\u2010sharing agricultural water quality management program", "venue": "Annals of Operations Research", "year": 2000, "id": "3f097a66-ae9e-4bfc-a6ce-be0c13eeef80"}
{"abstract": "Published version of an article from the book: Nordic Contributions in IS Research. Also available on SpringerLink:http://dx.doi.org/10.1007/978-3-642-32270-9_2", "authors": ["Bendik Bygstad", "Peter Nielsen"], "n_citation": 0, "references": ["0e3021d1-e61b-4692-9b7a-8f18e5d794d0", "1d2f5c2a-19fa-458e-affb-6e7961ae9b8d", "28112c3d-edb4-48fe-92ae-89c165d2e490", "47f3271e-a9f1-4482-bee5-c2e997b698f2", "519ba202-c574-4bef-a63e-7d35bfde7671", "884e8257-d448-4377-8420-e02630f1f357", "8d2d7baf-b156-4e61-b13f-8a07d4180a65", "ac79486c-47ec-4492-81aa-930c5d6762fc", "e0c3ae5b-aad6-4549-aa91-be6980c39e65", "f4dc499b-cd41-4a82-841e-efe6d6fd4d92", "f682070b-0705-4341-9b3f-0e3767db887f"], "title": "Understanding and managing process interaction in IS development projects", "venue": "scandinavian conference on information systems", "year": 2012, "id": "3f387a79-65cf-48b5-8a63-90c175575c86"}
{"abstract": "This book examines technological and social events during 2011 and 2012, a period that saw the rise of the hacktivist, the move to mobile platforms, and the ubiquity of social networks. It covers key technological issues such as hacking, cyber-crime, cyber-security and cyber-warfare, the internet, smart phones, electronic security, and information privacy. This book traces the rise into prominence of these issues while also exploring the resulting cultural reaction. The authors' analysis forms the basis of a discussion on future technological directions and their potential impact on society. The book includes forewords by Professor Margaret Gardner AO, Vice-Chancellor and President of RMIT University, and by Professor Robyn Owens, Deputy Vice-Chancellor (Research) at the University of Western Australia. Security and the Networked Society provides a reference for professionals and industry analysts studying digital technologies. Advanced-level students in computer science and electrical engineering will also find this book useful as a thought-provoking resource.", "authors": ["Mark A. Gregory", "David Glance"], "n_citation": 7, "title": "Security and the networked society", "venue": "", "year": 2013, "id": "3f5c5f6b-bf6d-45dc-bfa6-f2ca3e3f86ed"}
{"authors": ["Thomas Kleine-Besten", "Ulrich Kersken", "Werner P\u00f6chm\u00fcller", "Heiner Schepers", "Torsten Mlasko", "Ralph Behrens", "Andreas Engelsberg"], "n_citation": 0, "references": [], "title": "Navigation und Verkehrstelematik", "venue": "", "year": 2015, "id": "3f68f557-c9e3-4f3c-b673-98e488033661"}
{"abstract": "In this paper we consider the design of semi-static inter-cell interference coordination schemes for LTE networks. In this approach, base stations coordinate the power settings per resource block o ...", "authors": ["Donald Parruca", "Marius Grysla", "Han Zhou", "Farshad Naghibi", "Marina Petrova", "Petri Mahonen", "James Gross"], "n_citation": 6, "references": ["014a9b2b-bc17-4c1d-957a-ecc49fd8b565", "0321a96d-d334-4e59-b5cf-3fc36d1887fa", "2be62b17-56b2-48f6-a60e-293cf6accdd2", "4e80a404-561d-44ad-88bc-462a4d6ad2d2", "6a6b9aa6-683f-4c7c-b06e-9c3018d10fd3", "a9e58675-d575-4b87-a3a6-dae18d323f86", "b1d44866-904a-45a0-970e-a2698293f9a7", "c7500934-4c3e-4447-800b-ff941f54de0a"], "title": "On Semi-Static Interference Coordination under Proportional Fair Scheduling in LTE Systems", "venue": "", "year": 2013, "id": "3f7535c2-b685-4717-a8d9-6edb9fa8fc2c"}
{"abstract": "Users interested in biological and biomedical information sets on the semantic web are frequently not computer scientists. These researchers often find it difficult to use declarative query and view definition languages to manipulate these RDF data sets. We define a language IML consisting of a small number of graph transformations that can be composed in a dataflow style to transform RDF ontologies. The language's operations closely map to the high-level manipulations users undertake when transforming ontologies using a visual editor. To reduce the potentially high cost of evaluating queries over these transformations on demand, we describe a query rewriting engine for evaluating queries on IML views. The rewriter leverages IML's dataflow style and optimizations to eliminate unnecessary transformations in answering a query over an IML view. We evaluate our rewriter's performance on queries over use case view definitions on one or more biomedical ontologies.", "authors": ["Marianne Shaw", "Landon T. Detwiler", "James F. Brinkley", "Dan Suciu"], "n_citation": 5, "references": ["04b22932-6d5e-41ae-8140-1edccf6d2110", "0970e890-36dd-44b6-aa70-f8551cfb4782", "35dad028-2ec4-45a6-a05b-8c58b8635ac4", "67dfd4fd-0999-4bdb-bae4-0c46dcb48467", "6e73c2b5-e4e6-4e0d-b2e8-dee64fc05c3a", "6e8231f5-5972-4a0b-99ab-5a5588217f3a", "7b8da9f9-e47a-4b5e-b151-7223eff9e2b4", "7e9f6fae-8bd3-4ffe-8e9d-c4d0fb9ea2c0", "b45890a8-4357-450b-ab67-066733ecc50c", "de42f0b2-dae7-486d-b149-6a549fb80c84", "e32fbc9a-5d39-4275-860f-6c97eca593ab", "e46d92df-b94c-43b6-b212-1a99a157e86f", "f0ef7ddc-3778-4820-b227-b1d2e39132fa", "f26f1cdc-be80-426a-a05d-d4fdb7ff8ff2", "f39f9682-62e3-42a3-a14e-76c565cff355", "f3a4525a-6b31-4527-85e3-3d937947afd0", "f3b6589b-65cb-4b37-a7a0-d5e5719e6b29", "f55530d8-7cb0-4d44-94ee-3e40fe91c392"], "title": "A dataflow graph transformation language and query rewriting system for RDF ontologies", "venue": "statistical and scientific database management", "year": 2012, "id": "3f80a400-73ac-4445-906a-a581e2a1ebee"}
{"authors": ["Brian W. Thomson", "E. Stewart Lee", "Peter I. P. Boulton", "Michael Stumm", "David M. Lewis"], "n_citation": 0, "title": "Using Deducibility in Secure Network Modelling.", "venue": "european symposium on research in computer security", "year": 1990, "id": "3f832487-f21f-43fe-99ea-1f3e2b985370"}
{"abstract": "Health interventions vary widely. Pharmaceuticals, medical devices and wellness promotion are defined as \u2018outcome-centric.\u2019 They are implemented by clinicians for the use and benefit of consumers, and intervention effectiveness is measured by a change in health outcome. Electronic health records, computerized physician order entry systems and telehealth technologies are defined as \u2018delivery-centric.\u2019 They are implemented by organizations for use by clinicians to manage and facilitate consumer health, and the impact of these interventions on clinician workflow has become increasingly important. The methodological framework introduced in this paper uses a two-phase sequential mixed methods design that qualitatively explores clinician workflow before and after implementation of a delivery-centric intervention, and uses this information to quantitatively measure changes to workflow activities. The mixed methods protocol provides a standardized approach for understanding and determining the impact of delivery-centric interventions on clinician workflow.", "authors": ["Rhonda G. Cady", "Stanley M. Finkelstein"], "n_citation": 0, "title": "A Mixed Methods Approach for Measuring the Impact of Delivery-Centric Interventions on Clinician Workflow", "venue": "", "year": 2012, "id": "3f8d6e87-7fca-45f0-8aac-d512664fc97a"}
{"abstract": "One approach to manage collections is to create data about the things in it. This descriptive data is called metadata, and this term is in this thesis used as a collective noun, i.e no plural form exists. A library is a typical example of an organization that uses metadata, to manage a collection of books. The metadata about a book describes certain attributes of it, for example who the author is. Metadata also provides possibilities for a person to judge if a book is interesting without having to deal with the book itself. The metadata of the things in a collection is a representation of the collection that is easier to deal with than the collection itself. Nowadays metadata is often managed in computer-based systems that enable search possibilities and sorting of search results according to different principles. Metadata can be created both by computers and humans. This thesis will deal with certain aspects of the human activity of creating metadata and includes an explorative study of this activity. The increased amount of public information that is produced is also required to be easily accessible and therefore the situation when metadata is a part of the Semantic Web has been considered an important part of this thesis. This situation is also referred to as the Web of Data or Linked Data.With the Web of Data, metadata records living in isolation from each other can now be linked together over the web. This will probably change what kind of metadata that is being created, but also how it is being created. This thesis describes the construction and use of a framework called Annotation Profiles, a set of artifacts developed to enable an adaptable metadata creation environment with respect to what metadata that can be created. The main artifact is the Annotation Profile Model (APM), a model that holds enough information for a software application to generate a customized metadata editor from it. An instance of this model is called an annotation profile, that can be seen as a configuration for metadata editors. Changes to what metadata can be edited in a metadata editor can be done without modifying the code of the application. Two code libraries that implement the APM have been developed and have been evaluated both internally within the research group where they were developed, but also externally via interviews with software developers that have used one of the code-libraries. Another artifact presented is a protocol for how RDF metadata can be remotely updated when metadata is edited through a metadata editor. It is also described how the APM opens up possibilities for end user development and this is one of the avenues of pursuit in future research related to the APM.", "authors": ["Fredrik Enoksson"], "n_citation": 0, "title": "Adaptable metadata creation for the Web of Data", "venue": "", "year": 2014, "id": "3fc0d859-b99d-457a-a1ba-519560b3e0dc"}
{"authors": ["Esther M. Arkin", "Ferran Hurtado", "Joseph S. B. Mitchell", "Carlos Seara", "Steven Skiena"], "n_citation": 16, "title": "Some Separability Problems in the Plane.", "venue": "european workshop on computational geometry", "year": 2000, "id": "3fce03b9-3d2b-40c4-8091-604ce2f09990"}
{"authors": ["F. Wilhelm Bruns", "Bernd Robben", "Ingrid R\u00fcgge"], "n_citation": 0, "title": "Gestaltung von virtuellen und beGreifbaren Mesch-Computer-Schnittstellen", "venue": "", "year": 1999, "id": "40049b1b-0d7f-4ebd-85ec-77f150bd9072"}
{"authors": ["Mourad Oussalah", "Abdelkrim Amirat", "Tahar Khammaci"], "n_citation": 4, "title": "Software architecture based connection manager.", "venue": "software engineering and data engineering", "year": 2007, "id": "403e2289-69f8-47f7-9eb4-955679112efd"}
{"authors": ["Jaydeep Balakrishnan", "Chun Hung Cheng", "Anita Lee"], "n_citation": 0, "title": "A Neural Network Approach for Software Development Cost Estimation.", "venue": "next generation information technologies and systems", "year": 1997, "id": "405e70c9-04fd-47c1-b494-6ba85a9aef68"}
{"authors": ["Ronald E. Prather"], "n_citation": 0, "title": "Software Metrics: A Rigorous Approach, by Norman Fenton, Chapman and Hall, 1991 (Book Review).", "venue": "Software Testing, Verification & Reliability", "year": 1991, "id": "40624ea1-52e6-41da-b2a8-611e3ee22053"}
{"authors": ["Jorge M. Santos", "Steffen Staab"], "n_citation": 9, "references": ["50a03110-6d3a-4c6c-b9a6-909b90b8f6e7", "5538ff5c-0f37-4ab4-88c1-f348e8cb1440", "57c1f1e0-5eaf-4fb5-b5df-e0eec8949570", "57ffaea2-7fcc-4245-b9a9-59cfc77ee358", "60885145-b83f-4478-8e12-29e10da9ac53", "67a6c092-2038-44d4-81a8-e026bb696c60", "913b7eb7-eb6e-4809-93cc-7a920f9fbd96", "913fa329-3d90-4849-8108-7f306802ca7f", "9328c443-f08b-48cc-be07-c5bbe802a1b3", "c182df50-7817-4e9f-ac0d-a048151dd89e", "cc9fabf0-4571-42f6-acd4-ceff568daaad", "dbe5ae2e-bbc0-4508-8df5-3ec95c784fa8", "ef3b30a6-5e79-4e5f-9e00-c62bf80e0dee"], "title": "Engineering a complex ontology with time", "venue": "international joint conference on artificial intelligence", "year": 2003, "id": "40662456-b111-4851-85de-1f4ac9cf986c"}
{"abstract": "Media Independent Handover (MIH) is an emerging standard which supports the communication of network-critical events to upper layer mobility protocols. One of the key features of MIH is the event service, which supports predictive network degradation events that are triggered based on link layer metrics. For set route vehicles, the constrained nature of movement enables a degree of network performance prediction. We propose to capture this performance predictability through a Traffic Route Adapted Weighted Learning (TRAWL) algorithm. TRAWL is a feed forward neural network whose output layer is configurable for both homogeneous and heterogeneous networks. TRAWL uses an unsupervised back propagation learning mechanism, which captures predictable network behavior while also considering dynamic performance characteristics. We evaluate the performance of TRAWL using a commercial metropolitan heterogeneous network. We show that TRAWL has significant performance improvements over existing MIH link triggering mechanisms.", "authors": ["Enda Fallon", "Liam Murphy", "John Murphy", "Chi Ma"], "n_citation": 50, "references": ["369e1ef1-2e5c-4620-9e44-a05cf6b927e5", "3f913d8b-a155-4597-a948-e17e95453ac3", "46f98cd1-f49a-452d-9b95-37d6425e066b", "61b9cfce-4cf1-40ce-9b84-d30d6fed97fc", "8ec34d7b-617f-4c25-8a21-c03b585f0e3f", "a029b52a-02fb-4ae5-b8c6-6778f8ed3510", "c44b73c1-9bcc-47cc-a26f-091f37311ca3", "fc2a1c46-3b58-4d8f-9614-450ba4bfe703", "fdd391ab-17c7-424f-9080-f0e0384a8ca4"], "title": "TRAWL: a traffic route adapted weighted learning algorithm", "venue": "wired wireless internet communications", "year": 2011, "id": "4072e7ff-650c-44ab-9fe6-f764bf5547ec"}
{"authors": ["Yasuhiko Morimoto", "Maomi Ueno", "Setsuo Yokoyama", "Youzou Miyadera"], "n_citation": 5, "title": "A Formal Method of Describing E-Learning Systems.", "venue": "", "year": 2005, "id": "4078be80-6ece-451c-8917-b69f22f065ad"}
{"authors": ["Bernard L. Menezes", "Roy M. Jenevein"], "n_citation": 13, "title": "KYKLOS : A Linear Growth Fault-Tolerant Interconnection Network.", "venue": "international conference on parallel processing", "year": 1985, "id": "40891e7e-dd5c-4abb-9abb-289223f4af14"}
{"authors": ["Stylianos Bounanos", "Martin Fleury"], "n_citation": 50, "references": ["0f4647fc-dd76-40f5-a358-a7da2685f242", "158d79c5-21a9-4da2-8102-31cfe7e01ea3", "15b82ca6-368e-4ad5-9b37-c7d4c302069d", "51d3a55b-133f-4d99-a493-59efa892598f", "5a286502-3870-48c4-b55e-5d0d16a75586", "c67c9508-e4b3-41ea-9e3c-8b9c0a5bd211"], "title": "Gb Ethernet Protocols for Clusters: An OpenMPI, TIPC, GAMMA Case Study.", "venue": "parallel computing", "year": 2007, "id": "40904f51-566d-415e-a3fd-894c0748ec10"}
{"authors": ["Bernhard Wally", "Alois Ferscha", "Markus Lenger"], "n_citation": 50, "references": ["17fb843a-827b-4578-859a-664f136dd586", "4c41cce0-6d46-47a4-8e64-d79fe41c7b2c", "8386ec18-5677-48c5-84ed-8c3bae022be2", "b5e72744-0105-48bf-95ea-753f52280f48"], "title": "Presence Sensing Billboards.", "venue": "", "year": 2009, "id": "409c34f0-1544-4d46-81fa-28b147f46a97"}
{"authors": ["Xin Zhou", "Ivan Eggel", "Henning M\u00fcller"], "n_citation": 0, "references": ["208d98af-777f-4f73-898e-4dbe7b515514", "41836093-b73c-4f75-b682-48f7c131d56f", "49c5541d-beec-4a2f-ba06-d41fc6fcb912", "9b3fff0a-c267-4514-8d4c-37a8c1a16026", "deaf0b7a-940b-42fe-be59-f7209f68a05b", "f2e835a0-f96a-47fc-a59d-e9d33c466b31"], "title": "The Participation of MedGIFT Group at ImageCLEFmed 2010.", "venue": "cross-language evaluation forum", "year": 2010, "id": "40a43399-f113-4d4c-b7ca-c3c59c2505fd"}
{"abstract": "Recently, tagging systems are widely used on the Internet. On desktops, tags are also supported by some semantic file systems and desktop search tools. In this paper, we focus on personal tag organization to enhance personal file retrieval. Our approach is based on the notion of context. A context is a set of tags assigned to a file by a user. Based on tag popularity and relationships between tags, our proposed algorithm creates a hierarchy of contexts on which a user can navigate to retrieve files in an effective manner. MOTS-CLES : etiquette, systeme d'etiquetage, recherche de fichiers personnels, systeme de gestion de fichiers personnels, contexte, recherche d'information.", "authors": ["Ba-Hung Ngo", "Fr\u00e9d\u00e9rique Silber-Chaussumier", "Christian Bac"], "n_citation": 0, "references": [], "title": "Un mod\u00e8le de recherche de fichiers personnels par contexte dans les syst\u00e8mes d'\u00e9tiquetage.", "venue": "", "year": 2008, "id": "40d93bfd-279e-46db-8d39-0b920a90b37e"}
{"authors": ["M. P. Reddy", "Richard Y. Wang"], "n_citation": 17, "title": "Estimating data accuracy in a federated database environment", "venue": "", "year": 1995, "id": "40fdd65d-65b7-4b65-8e48-0bda6159cc05"}
{"abstract": "We study the multiterminal cut problem, which, given an n-vertex graph whose edges are integer-weighted and a set of terminals, asks for a partition of the vertex set such that each terminal is in a distinct part, and the total weight of crossing edges is at most k. Our weapons shall be two classical results known for decades. One is max volume min (s,t)-cuts by [Ford and Fulkerson, Flows in Networks. Princeton University Press, 1962], and the other is isolating cuts by [Dahlhaus et al., The complexity of multiterminal cuts. SIAM J. Comp. 23(4), 1994]. We sharpen these old weapons with the help of submodular functions, and apply them to this problem, which enable us to design a more elaborated branching scheme on deciding whether a non-terminal vertex is with a terminal or not. This bounded search tree algorithm can be shown to run in $1.84^k\\cdot n^{{\\cal O}(1)}$, thereby breaking the $2^k\\cdot n^{{\\cal O}(1)}$ barrier. As a by-product, it gives a $1.36^k\\cdot n^{{\\cal O}(1)}$ algorithm for 3-terminal cut. The preprocessing applied on non-terminal vertices might be of use for study of this problem from other aspects.", "authors": ["Yixin Cao", "Jianer Chen", "Jia-Hao Fan"], "n_citation": 50, "references": ["25f18189-3bde-4cd3-b2cf-1308fff4846f", "36732ecf-c979-4e27-90de-1ee6f727cd56", "4d67907a-03d7-4e3b-9ef7-2a96e5fe7b66", "510c3fc1-abce-4a49-8ecf-7a18837403c2", "56efc65a-4ff1-418d-997a-d26ecadf52f7", "5a252fd2-7a31-45dd-8fd4-384843b3da00", "65b07237-b424-4d42-863d-36b6e9113a25", "66e7dd7d-c254-46e9-abcd-d2981e6b2f50", "7c327a24-c6e6-4a61-9cba-8ddf009a7232", "9722bd82-db4a-43f9-95e7-da801707e817", "bf8c1500-1710-4e9b-983e-1aec00aa623d", "ef3afba3-4103-4bf3-9081-71104e902f37", "f06e7023-87a0-49f4-a553-ff07d206b343", "f79fd200-f5c7-4ce0-9ceb-e12946fc502a"], "title": "An o *(1.84 k) parameterized algorithm for the multiterminal cut problem", "venue": "fundamentals of computation theory", "year": 2013, "id": "412f59a6-411b-4911-918d-011dcb8cc1da"}
{"authors": ["Wei Chu", "Abeer Alwan"], "n_citation": 7, "references": [], "title": "A correlation-maximization denoising filter used as an enhancement frontend for noise robust bird call classification.", "venue": "conference of the international speech communication association", "year": 2009, "id": "4135944e-1484-44f0-bbb2-932a1b0c2b2e"}
{"authors": ["Henrique M. G. Martins", "Matthew R. Jones"], "n_citation": 50, "references": ["18e9e1e8-c086-4ab1-a0f3-f82797a20577", "833464f1-c2f3-46bd-ad8e-e3afe5020436", "86da23f2-5640-4160-9103-2204dc88a5f3", "aa17f934-cf78-416d-affa-2892e73df706", "c52737dc-1ea8-4ff5-a2e3-02eee12b4867", "e08cc80a-1197-408a-8ee8-f390a5868236", "e556c691-53d3-4cde-b1d4-0538915d6d46"], "title": "Mobility in the Round: Use of Wireless Laptop PCs in Clinical Ward Rounds", "venue": "", "year": 2005, "id": "417cde6d-31bd-4b83-aa7b-f12d5c9f7f87"}
{"abstract": "In this paper a new cellular automata model suitable for granular systems simulation is presented. The proposed model is shown to be equivalent to a particularization of the well known BCRE model of granular systems and a correspondence between the parameters of the presented model and the BCRE model is also set, allowing to fit these parameters for a given system. The model has the advantage over other cellular automata models of being more realistic in the behavior of the surface of heaps and slopes. The dynamics of the CA is analyzed in order to confirm that it also has one of the most important features of these systems, 1/f noise.", "authors": ["Marta Pla-Castells", "I\u00f1aki Garc\u00eda", "Rafael J. Mart\u00ednez"], "n_citation": 3, "references": [], "title": "Approximation of Continuous Media Models for Granular Systems Using Cellular Automata", "venue": "cellular automata for research and industry", "year": 2004, "id": "418c63f2-e10b-4c2f-a4ee-4eef6ba32a7b"}
{"authors": ["Sheshayya A. Choudum", "N. Priya"], "n_citation": 0, "title": "Tough-Maximum Graphs.", "venue": "Ars Combinatoria", "year": 2001, "id": "41acbd84-4299-4232-ad93-51286552b7d7"}
{"abstract": "Several previous studies have investigated collaborative approaches for processing complex environments. Beyond the improvement of performance and working efficiency, these studies highlighted two important constraints, which limit the efficiency of these approaches. First, social loafing which is linked to the redundancy of roles in the same group. Second, coordination conflicts which are linked to the limits of communication in standard collaborative environments. This paper addresses these issues by providing an efficient group structure to overcome the social loafing, which is then coupled with haptic metaphors to improve communication between partners. The experimental study, conducted in the context of molecular docking, shows an improvement for group efficiency as well as communication between partners.", "authors": ["Jean Simard", "Mehdi Ammi"], "n_citation": 6, "references": ["0be89a5b-399c-4be4-878a-9daf3514ba6c", "0cd2da4c-0363-48d4-adc4-4ac716d73ede", "0e1ccc0a-2a3a-4cdd-aa6e-4ab94b34e1ec", "1720bfc9-a7d8-4ca3-b509-37c6b7303613", "1c4c7544-ad1c-4383-a456-7308b7365a9f", "66cef6b7-e77b-48b9-9367-23db29a03d3b", "77845a4c-e5c0-4f4a-a3cb-24b727bba112", "809ae925-0726-4465-bd94-aad59b46b6de", "aee7cf19-bd71-45c3-887e-7765434dec9a"], "title": "Haptic communication tools for collaborative deformation of molecules", "venue": "", "year": 2012, "id": "41c980e3-52b3-4ff7-affb-ca62675d4f6d"}
{"abstract": "Recently, the number of foreign residents and foreign visitors in Japan has been increasing every year. Consequently, the opportunities for communication amongst people whose native languages differ are increasing. In healthcare facilities, a paper-based multilingual interview sheet is used to facilitate communication between medical workers and foreign patients. However, this interview sheet has been found to be inadequate for such purposes. Moreover, Japanese medical workers find it difficult to understand the different languages written on a paper-based interview sheet. To resolve this problem, we have developed a multilingual interview-sheet composition system that uses parallel texts and machine translation. This system can convey essential patient information to a medical worker during consultation. The contributions of this study are as follows: (1) We have proposed a multilingual interview-sheet composition system that can be used for communication between medical workers and foreign patients. We have developed this system using both parallel texts and machine translation. (2) We showed that a patient is able to create a multilingual interview sheet using a parallel corpus and machine translation. (3) Because it may be difficult to indicate an affected area of the body using words alone, we suggest that affected areas be indicated by the user using a human-body image for more accurate communication.", "authors": ["Taku Fukushima", "Takashi Yoshino", "Aguri Shigeno"], "n_citation": 2, "references": ["4508bc06-2812-49bb-aa93-21023e2c000d", "fd2fe50c-4482-4114-ba5b-4a5e5c0aeddc"], "title": "Development of multilingual interview-sheet composition system to support multilingual communication in medical field", "venue": "", "year": 2011, "id": "41faea96-85a4-4623-ba48-88f52ba79ca8"}
{"authors": ["C. Arvind", "Ashoka Vanjare", "Sn Omkar", "J. Senthilnath", "V. Mani", "P. G. Diwakar"], "n_citation": 50, "references": ["01df6660-e54b-4cab-a20e-179393feb854"], "title": "Multi-temporal Satellite Image Analysis Using Unsupervised Techniques", "venue": "", "year": 2013, "id": "4202dd5e-b1cc-477c-b3ef-8fe229b798a7"}
{"abstract": "Ronald J. Brachman, Hector J. Levesque, Knowledge Representation and Reasoning, Morgan Kaufmann,ISBN 1558609326, 2004, 381 pages.Raymond Reiter, Knowledge in Action: Logical Foundations for Specifying and Implementing DynamicalSystems, MIT Press, ISBN 0262182181, 2001, 448 pages.Erik T. Mueller, Commonsense Reasoning, Morgan Kaufmann, ISBN 0123693888, 2006, 432 pages.Chitta Baral, Knowledge Representation, Reasoning and Declarative Problem Solving, Cambridge UniversityPress, ISBN 0521818028, 2003, 544 pages.", "authors": ["Leora Morgenstern"], "n_citation": 1, "references": ["199560bb-cd8d-4297-89b1-9f975643b7c3", "29179883-d988-4f99-af6b-e856cac5b7a2", "4e55a692-eca4-4faf-a939-03686764e204", "5c90a064-9383-426e-a8cf-26fd7bf5c8e0", "5df11362-8fde-4963-a411-909b80dab93f", "73f86c9a-a92b-4aa8-8a4f-ecfee1963cbc", "82fc56b4-354a-49bd-ae40-fd985a7d4497", "8e444c82-db67-4693-93ec-13610cdcdc0c", "a5d13bdf-393f-4b32-a58c-7eee745728fa", "abeb98a7-cb2a-4476-ac0b-1ba291e0e1bd", "b9b699b4-4f76-4f52-b38a-74ba71ac9105", "c6bba749-1b6f-4d6b-bd21-7ff1da7b5d1e", "dc18ba22-33ca-40a1-804f-5a80e696bbc4", "df7bfdcf-b724-47f1-8c2e-4b07860a5039", "e1b13e30-59e9-4734-820e-5c1b688e478a"], "title": "Book reviews: Knowledge representation and commonsense reasoning: Reviews of four books", "venue": "Artificial Intelligence", "year": 2006, "id": "4209e745-62e1-4e7b-b344-657f9f42acb3"}
{"abstract": "The paper characterizes the family of homomorphisms, under which the deterministic context-free languages, the LL context-free languages and the unambiguous context-free languages are closed. The family of deterministic context-free languages is closed under a homomorphism h if and only if h is either a code of bounded deciphering delay, or the images of all symbols under h are powers of the same string. The same characterization holds for LL context-free languages. The unambiguous context-free languages are closed under h if and only if either h is a code, or the images of all symbols under h are powers of the same string.", "authors": ["Tommi Lehtinen", "Alexander Okhotin"], "n_citation": 50, "references": ["170452ee-8fbe-48a5-a361-b2a574e3b0c3", "1b928b52-088e-430a-a193-52eeb3f53f96", "28494b0a-77fc-4388-b4a6-a30fe1d64405", "6e9e6859-10c5-4285-b269-c4f2183141c8", "8491e77a-8629-4f0d-85f9-0261a9837907", "b33da25d-4f22-4da3-8f66-0c0e6a32af48", "d894eeb2-923c-44a5-82a3-587fba693caa"], "title": "Homomorphisms preserving deterministic context-free languages", "venue": "developments in language theory", "year": 2012, "id": "4216067c-4019-4d0a-9595-d30679acb324"}
{"authors": ["Prasad Pingali", "Jagadeesh J", "Vasudeva Varma", "Bipin Indurkhya"], "n_citation": 0, "references": ["094a1193-abe7-44c2-8034-fa84fa06bcdd", "5aee5887-6d22-4e20-8319-18cfc1e13f9c", "a0e6a80e-8a9d-47a2-a9f4-1f3f39399014"], "title": "Exploring Creative Concepts in the Nearest Neighborhood using Lexical Ontologies.", "venue": "indian international conference on artificial intelligence", "year": 2005, "id": "42229146-2146-4689-80c8-d85fbc7b4aa2"}
{"abstract": "We present an evolutionary algorithm(EA) based system identification technique from measurement data. The nonlinear optimization task of estimating the premise parameters of a Takagi-Sugeno-Kang fuzzy system is achieved by a EA, the consequent parameters are estimated by least squares. This reduces the search space dimension leading to greatly reduced load on the EA. The significant contribution of this work is in formulating the fitness function that judiciously applies selection pressure by 1) penalizing low firing strengths of rules, and, 2) by penalizing low rank design matrix at the rule consequents. The proposed method is tested on the identification of non-linear systems.", "authors": ["Awhan Patnaik", "Samrat Dutta", "Laxmidhar Behera"], "n_citation": 2, "references": ["122da3c1-92a0-44a0-b4c3-888a58689239", "2ad629f2-dbc9-4001-8395-b75c4ff7e341"], "title": "Data driven system identification using evolutionary algorithms", "venue": "international conference on neural information processing", "year": 2012, "id": "422353fc-50af-41e7-ad56-478c10411950"}
{"authors": ["Josep R. Casas", "Joachim Neumann"], "n_citation": 1, "references": ["a55038ae-3599-4461-a91d-0272f1d54216", "d1b2628e-a61a-4da2-92bd-280024b49bb3"], "title": "Context Awareness Triggered by Multiple Perceptual Analyzers", "venue": "", "year": 2007, "id": "4237e17a-2a7a-4156-8b6c-e40fb3a20900"}
{"abstract": "Growing needs for French closed-captioning of live TV broadcasts in Canada cannot be met only with stenography-based technology because of a chronic shortage of skilled stenographers. Using speech recognition for live closed-captioning, however, requires several specific problems to be solved, such as the need for low-latency real-time recognition, remote operation, automated model updates, and collaborative work. In this paper we describe our solutions to these problems and the implementation of a live captioning system based on the CRIM speech recognizer. We report results from field deployment in several projects. The oldest in operation has been broadcasting real-time closed-captions for more than 2 years. Index Terms: speech recognition, closed-captioning, model adaptation.", "authors": ["Gilles Boulianne", "Jean-Fran\u00e7ois Beaumont", "Maryse Boisvert", "Julie Brousseau", "Patrick Cardinal", "Claude Chapdelaine", "Michel Comeau", "Pierre Ouellet", "Fr\u00e9d\u00e9ric Osterrath"], "n_citation": 50, "references": ["11f3a6b6-a992-42db-b42f-981c945cd38b", "7d9bde59-6042-4a37-ba29-e9d1a0edfebd", "ab250751-8ca5-41b8-a579-1d57a700e206", "ed069cf8-d0ba-452d-b8dc-bc9ab11e5a4f"], "title": "Computer-assisted closed-captioning of live TV broadcasts in French", "venue": "conference of the international speech communication association", "year": 2006, "id": "42396c48-9aa9-4dbc-91b7-1854e0900279"}
{"abstract": "Components can be used to implement coarse-grained parallelism on large parallel systems. A parallel component is a piece of parallel code that can be executed in parallel on a set of processors or cores and has a predefined interface to be coupled with other components. Depending on the internal programming and memory model, a component may consist of computation and communication phases or, alternatively, of shared memory code. The interfaces are used for data exchange. More complex parallel programs are built up using parallel components and a flexible component interaction structure.#R##N##R##N#In this article, the programming with parallel components for designing efficient programs for parallel execution platforms with a distributed address space is discussed and a mechanism for the specification of parallel components with communication interfaces is presented. The execution of these components can be adapted to the architectural characteristics of multicore clusters with their specific communication structure. The approach is applied to application programs for the solution of large systems of ordinary differential equations.", "authors": ["J\u00f6rg D\u00fcmmler", "Thomas Rauber", "Gudula R\u00fcnger"], "n_citation": 0, "references": ["1c222762-be82-4afd-ad2e-377287b75e1a", "393b4866-0053-4aea-bd21-c65f3fac9875", "4a5613b9-6e07-48a7-a24c-0c2b6118eab5", "5d4f63a2-e93c-4e3f-8df3-7e47a18d1e67", "65948fe4-bb61-4288-b388-2edef5ccb94f", "72523c99-8ae1-4801-b1cd-4131a405472d", "788f91fd-2310-4443-9e7b-2c43e0713ef3", "f13679ec-3c38-4ba0-abb3-97004ae0a488"], "title": "Component-based programming techniques for coarse-grained parallelism", "venue": "ieee international conference on high performance computing data and analytics", "year": 2011, "id": "4243d47d-d41e-41c4-8632-512f7e1f2fae"}
{"authors": ["Biliana Kaneva", "Joseph O'Rourke"], "n_citation": 69, "title": "An Implementation of Chen & Han's Shortest Paths Algorithm.", "venue": "canadian conference on computational geometry", "year": 2000, "id": "42443973-71bc-4715-a407-352cbbaf769c"}
{"authors": ["Vincent G. Duffy"], "n_citation": 1, "title": "Issues for Integrating Virtual Teaming into the Organization.", "venue": "Advances in Human Factors\\/ergonomics", "year": 1997, "id": "4275b21c-2ea2-45a8-b81a-fd98e4dce50d"}
{"abstract": "For a graph G = (V, E) and a color set C, let f : E \u2192 C be an edge-coloring of G which is not necessarily proper. Then, the graph G edge-colored by f is rainbow connected if every two vertices of G has a path in which all edges are assigned distinct colors. Chakraborty et al. defined the problem of determining whether the graph colored by a given edge-coloring is rainbow connected. Chen et al. introduced the vertex-coloring version of the problem as a variant, and we introduce the total-coloring version in this paper. We settle the precise computational complexities of all the three problems from two viewpoints, namely, graph diameters and certain graph classes. We also give FPT algorithms for the three problems on general graphs when parameterized by the number of colors in C; these results imply that all the three problems can be solved in polynomial time for any graph with n vertices if |C| = O(log n).", "authors": ["Kei Uchizawa", "Takanori Aoki", "Takehiro Ito", "Akira Suzuki", "Xiao Zhou"], "n_citation": 3, "references": ["0bdfb73c-76bb-43cf-bb4e-fd9fd68a8f69", "132554c4-cf87-4261-bb0f-bfaefe19ba77", "6f695e89-8d75-4629-9c14-a813044c247d", "b70c14fe-728c-47e4-b2ea-89d6dfb61265", "d5dfe354-6058-405d-9cec-3cb7b441072b", "d9144d3b-b6f6-4541-8167-37f8564d6c08", "f704519a-9f4e-4876-bf78-506e2fa9f4f6"], "title": "On the rainbow connectivity of graphs: complexity and FPT algorithms", "venue": "computing and combinatorics conference", "year": 2011, "id": "427eb74a-1566-41fe-ba29-b9e46c5d2654"}
{"authors": ["Tri Nguyen", "Robert Chun"], "n_citation": 0, "references": ["22b5eec2-4f2d-4e4d-85c4-c986353f9608"], "title": "Per-Thread Batch Queues For Multithreaded Programs.", "venue": "parallel and distributed processing techniques and applications", "year": 2006, "id": "4285265c-5412-4e5f-80f6-d6dc03dc25f0"}
{"authors": ["Rohit Parikh"], "n_citation": 10, "references": ["4cf0f332-ce09-47fb-8aee-b021fe192db8", "b3a6f742-8207-4274-b7d6-cdbefa3e8938"], "title": "Propositions, Propositional Attitudes and Belief Revision.", "venue": "advances in modal logic", "year": 1998, "id": "42945e77-744b-406a-99a9-d70d139ad97d"}
{"abstract": "In Indexing with Gaps one seeks to index a text to allow pattern queries that allow gaps within the pattern query. Formally a gappedpattern over alphabet \u03a3 is a pattern of the form p = p1g1p2g2 ... glpl+1, where \u2200i, pi \u2208 \u03a3* and each gi is a gap length \u2208 N. Often one considers these patterns with some bound constraints, for example, all gaps are bounded by a gap-bound G.#R##N##R##N#Near-optimal solutions have, lately, been proposed for the case of one gap only with a predetermined size. More specifically, an indexing solution for patterns of the form p1 \u010b g \u010b p2, where g is known apriori. In this case the solutions mentioned are preprocessed in O(n log\u2208 n) time and O(n) space, where the pattern queries are answered in O(|p1| + |p2|), for constant sized alphabets. For the more general case when there is a bound G these results can be easily adapted with a multiplicative factor of O(G) for the preprocessing, i.e. O(n log\u2208 nG) preprocessing time and O(nG) preprocessing space. Alas, these solutions do not lend to more than one gap.#R##N##R##N#In this paper we propose a solution for k gaps one with preprocessing time O(nG2k logk n log log n) and space of O(nG2k logk n) and query time O(m + 2k log log n), where m = \u03a3i=1 |pi|.", "authors": ["Moshe Lewenstein"], "n_citation": 50, "references": ["2bcbda49-9315-499c-9cd8-adac1ecfd7fe", "30afcdc1-6f5e-4474-8c07-26cc617bfeae", "35a64e7a-a8ab-4e3c-a70b-d167bb65feb6", "3f39cb14-ebfe-4c2d-a5c0-6a1d9a43f16f", "55a3a0e0-c8b2-4d61-b9b8-9f203aa7f199", "5e02c3f9-4b76-4c02-9f6b-d9b59abdfa68", "758c57f5-3d9e-416b-8143-4a1c96ba22b0", "794862f0-9d72-4b56-961f-280064018e93", "7d641ad5-603b-47b5-84dc-852e22bbd39b", "817fa0ba-375f-40e7-bc25-058fdeca3905", "97e82659-df38-4426-bf29-0c2030e5abc2", "9b33fd14-3f28-4aae-b8ea-d26bef82742e", "ab1ed9b1-75f8-42dc-b065-a019ef549f59", "addb911e-0e13-4779-985e-2abe37e81532", "b9edd795-a346-491a-a3d0-c4103a66892c", "c15205e5-49c3-418f-94a5-40aabbe63613", "ebe75bfb-a201-47b5-9cef-289e83a8bc26"], "title": "Indexing with gaps", "venue": "string processing and information retrieval", "year": 2011, "id": "42c2fdb0-0bb7-454d-ba87-20b3a857c485"}
{"authors": ["Paul M. Maxim", "Suranga Hettiarachchi", "William M. Spears", "Diana F. Spears", "Jerry C. Hamann", "Thomas Kunkel", "Caleb Speiser"], "n_citation": 27, "references": ["1935202c-db38-4bec-bb27-ae92aee5df07", "27892a02-64e0-4209-bb59-7f3e2c3cc8ca", "bcbce8f5-490b-49e6-8dbc-830305c02084", "c3a52c17-1de7-452f-b1e8-c380ceb5d4c4"], "title": "Trilateration Localization for Multi-robot Teams.", "venue": "international conference on informatics in control, automation and robotics", "year": 2008, "id": "42f20977-0757-44b8-a2af-8fd39bba6880"}
{"authors": ["Salvatore Ingrassia", "Simona C. Minotti", "Incarbone Gp"], "n_citation": 0, "references": ["8d719eec-fae0-4d1a-823f-026712627ad3"], "title": "An EM Algorithm for the Student-t Cluster-Weighted Modeling", "venue": "", "year": 2012, "id": "4314e990-6c86-47c1-bf6e-a91e9e47b9e6"}
{"authors": ["Leonard Hagger", "Ian D. Sanders"], "n_citation": 0, "title": "Partitioning a deformed urban grid.", "venue": "canadian conference on computational geometry", "year": 2002, "id": "432fe9e4-6bdd-4b7e-91f5-ca74bfcb9777"}
{"abstract": "Design of time-frequency distributions (Tfds) that are robust to the impulse noise influence is considered. The robustTfds based on the robust short-time Fourier transform (Stft) are proposed. An efficient procedure to evaluate the robustStft is given. RobustTfds based on the robustStft have better energy concentration around the signal instantaneous frequency (If) than the robustStft itself. Also, theseTfds are more resistant to higher impulse noise than the robustTfds obtained using the local autocorrelation function (Laf) based minimization problem.", "authors": ["Igor Djurovic", "LJubisa Stankovic", "Braham Barkat"], "n_citation": 12, "references": ["2c9fdf19-0f6e-448e-acd9-3adfdf094deb", "3f15030c-4fff-4b9a-88ff-1005f74c22e0", "65abf76e-e66d-4669-8c45-1dbfcffaa8f0", "715343dd-9c2b-4d72-8261-2ab33d5272f0", "8067aa17-33fe-4776-9920-18f20a78a1cf", "8161a553-211f-4959-b855-57f31ccee7b8", "9a3aebf5-4a11-41a7-abbe-5efd1db63681", "9bbcc41f-f874-4529-8331-868aedab8ad7", "c37622c0-7772-4fdc-8bec-8cc27fc0436c", "cb10d88a-b9a2-41d6-ad81-55f600ea06a2", "cd93e8aa-f291-4f53-8099-02827e0deac3", "dd18a980-8d48-4f6b-9c58-5a1d56119903", "e61f33a1-1c0f-413f-9bda-91b0a3eda8a8"], "title": "Robust time-frequency distributions based on the robust short time fourier transform", "venue": "Annales Des T\u00e9l\u00e9communications", "year": 2005, "id": "43311963-f72d-428d-8b21-331b08ee8b17"}
{"authors": ["Karl Reiner Lang", "Roumen Vragov"], "n_citation": 0, "references": ["19f0bd91-042a-4fdc-80da-cf3784a5b934", "38571264-d691-4de6-afce-b22a5ae85158", "cffb2fb5-2def-4211-b008-f555c2b91942", "ecf8cedb-9773-4397-888a-87a90aacfbaf"], "title": "Experimental Evaluation of Different Pricing Mechanisms for Content Distribution over Peer to Peer Networks", "venue": "", "year": 2005, "id": "43374aaa-7ff1-44cc-8aa7-cd9ec84d76e2"}
{"authors": ["Kendra Cooper", "Lirong Dai", "W. Eric Wong"], "n_citation": 1, "title": "Modeling Reusable Security Aspects for Software Architectures: a Pattern Driven Approach.", "venue": "software engineering and knowledge engineering", "year": 2005, "id": "4360b7e0-eac7-4138-a9b3-241eb65eba02"}
{"abstract": "In this paper, we present non-confluent solutions to some NP-complete problems using recognizer Evolution-Communication P systems with Energy (ECPe systems). We then evaluate the communication resources used in these systems using dynamical communication measures proposed for computations in ECPe systems. Specifically, we evaluate based on number of communication steps, communication rules and energy required for all communication.", "authors": ["Nestine Hope S. Hernandez", "Richelle Ann B. Juayong", "Henry N. Adorna"], "n_citation": 1, "references": ["184b9f35-2d00-435f-871a-0ac31c2d7d4f", "2c146c35-5714-4902-8bcb-79e8678e72d6", "5565633f-e7c0-4be9-95b7-dc3d9876237e", "7a3f4d42-bf5f-4af2-8520-5a57e6a1e26d", "89619e37-add5-4523-98d6-2ee01154b21e", "e337e552-a7fa-49f4-9535-88dd23d91914", "e635e688-c25e-4270-bab7-bd64e34fb84a", "ff1bffe2-a015-40bb-91bb-d394f1818987"], "title": "On Communication Complexity of Some Hard Problems in ECPe Systems", "venue": "", "year": 2013, "id": "4368cc09-0757-42da-94db-b7641fd521e4"}
{"authors": ["Zachary Palmer", "Pottayil Harisanker Menon", "Alexander Rozenshteyn", "Scott F. Smith"], "n_citation": 3, "references": ["00ec2a93-ebec-4fe1-b564-0b004e56ffc1", "16b2ec5d-a0ee-40da-9b37-4bfa873868bd", "1fb3b0c4-e8a7-448f-9272-961f27509380", "2c347b0e-d36a-4b02-81ad-06e9f061aaf7", "3b7b850d-5b51-4779-a546-49f46f45c94d", "53ba1442-100f-4f57-9b37-a689dea4c7bb", "56402ac9-8383-47be-b60b-4c94f275f7dd", "576c786f-a878-4f16-944d-c64538c1d35d", "5de56286-91f3-49cb-ab3a-6e98b4abf0d8", "5ed9f52a-03e1-4500-8da5-345f6901beda", "65db7854-da94-4061-a2b5-b451a7ae1eeb", "723f64e8-a7b3-4bbb-b75f-6a3ad5ac5ace", "854f5c9f-db4c-4634-95c1-4ba2397da0ea", "892b3f85-443b-4f3d-84d8-5d44f9b67301", "8ae3d7fb-7cf7-4df8-abc8-a1d278f63481", "8b0b3938-8ab1-4a18-aa09-ab7569570eb5", "a15476e3-9083-4772-9d34-67a1d51cfb4d", "a27035ec-4143-47e2-80b2-ccfdad4edd0e", "ade9bb88-3425-422c-85ce-8f7e22c3b968", "b6871878-aa8e-45a3-b020-a2f38e042d9e", "ba12a87b-61dd-4ac5-9645-f0fae6aa39f6", "c5cd4073-cf1f-4ef2-85b1-940944eba96c", "ed1e7d46-c9f1-41ac-8429-384ad46982d9", "eed82e2a-6922-4dfb-9dde-18a54c79466f", "ef345f8b-686c-494c-917e-cbbf6daeea9f", "f5fa2887-0e1f-4c42-b32e-f9f4abc6d0b0", "f9484505-1603-429f-97aa-22d4a3d2cc02", "f9e13626-80cf-4709-b03c-d69ae57ae283", "faff7846-f75d-4a33-a6bd-8c7c31ef2331"], "title": "Types for Flexible Objects", "venue": "asian symposium on programming languages and systems", "year": 2014, "id": "4375af04-8b88-4c8e-bf83-01c068d038fe"}
{"authors": ["Hae Sang Song", "Tag Gon Kim"], "n_citation": 0, "references": ["05704cf8-7a4a-4db9-a966-5bfcf1da0bcd", "0c2895d4-a4e8-4293-9504-108e021e28ee", "52fb170a-e703-4ca5-a42d-d425cb4139b8"], "title": "Safety Analysis of Computer-Controlled Real-Time Systems with Message Loss Using Communicating DEVS Models", "venue": "asian simulation conference", "year": 2012, "id": "439a1d7e-3114-4f52-9171-9594679c293e"}
{"abstract": "Interval temporal logics provide a natural framework for temporal reasoning about interval structures over linearly ordered domains, where intervals are taken as the primitive ontological entities. The most influential propositional interval-based logic is probably Halpern and Shoham's Modal Logic of Time Intervals, a.k.a. HS. While most studies focused on the computational properties of the syntactic fragments that arise by considering only a subset of the set of modalities, the fragments that are obtained by weakening the propositional side have received very scarce attention. Here, we approach this problem by considering various sub-propositional fragments of HS, such as the so-called Horn, Krom, and core fragment. We prove that the Horn fragment of HS is undecidable on every interesting class of linearly ordered sets, and we briefly discuss the difficulties that arise when considering the other fragments.", "authors": ["Davide Bresolin", "Emilio Mu\u00f1oz-Velasco", "Guido Sciavicco"], "n_citation": 13, "references": ["0d2be3b4-ac31-416e-8ec2-5e9b23865ed5", "1d684925-0998-4d4d-92e1-2d8f349fff27", "20558c05-642c-48aa-948c-de331887cbf3", "30922b3c-27e1-4823-9a70-34fadb5b88cb", "3e3045bd-e5e9-480f-a562-205dc0c292a6", "4d023b6d-a6fe-4a0e-b148-4cfe2c352270", "4f8d026d-0cc4-471d-b9b6-0cadcac8ec32", "5624f645-293f-4cbb-b566-9c0fc0cdf8a1", "571a04b3-0674-4025-86b6-ba035f93523d", "57992104-c3b7-4121-a6eb-2d6b2653d955", "66ddcdcd-6769-4430-bb51-ef8018b5f2b4", "a29b92f1-1b44-43da-924f-e87ec70bab43", "b3913950-282d-44cf-9a25-4f94f2c11629", "b6960e1a-9d07-41f0-988c-ae54ca31273b", "b8bae814-7a40-4db8-a8cf-a95d75115820", "c8e03267-ad50-45e8-9eae-2cf44ba12414", "cf0833cc-5c47-47ec-8b04-f38f68f1545c", "dbe5ae2e-bbc0-4508-8df5-3ec95c784fa8", "dc7db399-a0f7-4ed5-a0ba-7586457c16bc", "ecf364b0-3dda-4aaa-ac93-f511ba64a00d", "fc95847c-9302-4040-b065-c8f9d1104a6c"], "title": "Sub-propositional Fragments of the Interval Temporal Logic of Allen's Relations", "venue": "", "year": 2014, "id": "43b29c76-3899-4980-bc59-115efc1aed9f"}
{"authors": ["Jae-Dong Lee", "Kenneth E. Batcher"], "n_citation": 1, "title": "Simplifying Multistage Hardware Interconnection in the Bitonic Sorting Network.", "venue": "parallel and distributed computing systems (isca)", "year": 1995, "id": "43bae883-5092-40ea-811c-666e969e41a1"}
{"authors": ["Nezamoddin Nezamoddini-Kachouie", "Javad Alirezaie"], "n_citation": 0, "title": "Segmentation of IKONOS Images by Genetically Derived Hard and Fuzzy C-Means Clustering Algorithm.", "venue": "", "year": 2003, "id": "43cd3b50-c030-4cdf-94c5-fc79fca53087"}
{"authors": ["Zailani Abdullah", "Tutut Herawan", "Mustafa Mat Deris"], "n_citation": 50, "references": ["06a97132-116e-457b-ba96-4c3b3b9fbc6f", "1012cd0d-9eaf-423b-875e-f82f94628434", "2207f355-ea6e-4c33-a247-42b0c988c8f1", "28f13fc9-96ae-40a4-94c1-c980a6546fed", "29a152f7-de1a-4aaa-85ad-33f6e16c8264", "46f6963a-2459-4e2c-8667-a8d0fcde43e9", "5713cb1e-589f-42b5-a525-279d118c26b2", "769b66ce-04f1-4007-9463-49278aa97a60", "7b5bc572-ee66-47e4-b436-734c660b3cb1", "98e89fb2-4a95-4739-b6c7-d16549f8d96b", "9c381dd9-95ae-4689-a1b3-77450d887eda", "a383fa08-7d8e-4744-8ed7-d7b85a5f4255", "b1428098-23fc-477e-8344-b42310d4524a", "b84f14ac-2d35-4ff5-92e4-f5465a99c2ec", "c0ac77b3-0e25-4556-9f2d-29c6c2c4d7d2", "c4710c73-497d-44f0-ae10-64613eca18d4", "c62352d2-a13f-4c8e-9af5-1b4fcd57ec65", "cb01fac8-806d-47e8-b26f-3af954e0b2b0", "fb766f22-309b-479b-b6e0-83a19d6cb004"], "title": "Detecting Definite Least Association Rule in Medical Database", "venue": "", "year": 2014, "id": "43d07e2f-1204-430d-893c-ec92055a2fd2"}
{"authors": ["Alberto Dennunzio", "Enrico Formenti", "Luca Manzoni", "Giancarlo Mauri"], "n_citation": 50, "references": ["3ea753c8-8ef2-4dbb-ba6a-da06c495beeb", "546efb43-bcbe-4292-93a2-20d6c576225a", "6d5dfebc-4152-4eee-8f95-f9f23dbac2f6", "98ad5df6-1ff6-4d35-82fe-9cf369f9f83c", "e66418ee-a0c9-47e8-b3f2-2d02f16b2f04", "ff14569e-3277-4f94-bb4c-28bd23f19dc9"], "title": "m-Asynchronous Cellular Automata", "venue": "cellular automata for research and industry", "year": 2012, "id": "43dac174-18fa-454c-ae9f-5ecf4b9a9bb1"}
{"abstract": "Barrier is a collective operation used by many scientific applications and parallel libraries for synchronization. Typically, a Barrier operation is implemented by exchanging a short data message that requires demultiplexing, thereby adding undesired latency to the operation. In this work, we reduce the latency of Barrier operations for Cray XE/XK systems by leveraging the atomic operations provided by the Gemini interconnect, tailoring algorithms to utilize these capabilities, and utilizing a hierarchical design to arrive at an efficient implementation. Our micro-benchmark evaluation shows that for a 4,096 process Barrier operation, the atomic-operations-based Barrier outperforms the data exchange Barrier by 52% and the native Barrier by 111%.", "authors": ["Manjunath Gorentla Venkata", "Richard L. Graham", "Joshua S Ladd", "Pavel Shamis", "Nathan T. Hjelm", "Samuel Keith Gutierrez"], "n_citation": 0, "references": ["158d79c5-21a9-4da2-8102-31cfe7e01ea3", "22141988-edf3-42ff-b8bd-857d3cc1fdb1", "284b3ddc-634a-4120-a317-65ff969dcb3a", "286cf404-59a9-41fd-9098-f70597e17d2a", "a69cad4c-9b1b-4a42-aa66-8823c9b027a5", "e772125c-4ce6-48d3-97ad-715c19a2d6f0", "ea9f1c4e-de73-4cb5-8507-e982acdf558c"], "title": "Exploiting atomic operations for barrier on cray XE/XK systems", "venue": "", "year": 2012, "id": "43de2d82-72d3-42cc-85b8-217941d7af70"}
{"authors": ["Werner Mellis"], "n_citation": 50, "references": ["c6ff8fa0-642f-42e9-a930-5f976d31e74c", "cd7880dc-6d9d-4322-8d8a-00aa404b462c"], "title": "A Systematic Analysis of the Effect of Task Clarity on Software Development Design", "venue": "european conference on information systems", "year": 2000, "id": "43de4041-02b2-46de-8626-2997b11e6220"}
{"authors": ["Dongbum Pyo", "Semin Ryu", "Seung-Chan Kim", "Dong-Soo Kwon"], "n_citation": 8, "references": ["015e8bce-1c4f-45e2-912c-3eaab543f9a9", "3553dd3d-e09f-4b5c-ade4-bd0beb5074ac", "3a198015-05d0-4452-845f-7c67282661d8", "43ffac4d-1835-4a08-94a1-46c649cc1446", "6a71c63c-f084-433a-96db-944e7873dde1", "7a265d6c-b386-4412-b8dc-41b0ccbb4615", "953c0062-2c7a-44bc-878c-ed13d30dee04", "a1b715b0-091e-4550-a9ab-22e88a6df4ce", "bade8ea8-7a4e-442f-adba-2889564cc479", "cde6e530-673c-4ff3-ae2a-34fe30f0d568", "e15bd42c-0b94-433d-aa39-253d1d994c98", "efdf1b7f-40db-4383-88f2-23f500b555db"], "title": "A New Surface Display for 3D Haptic Rendering", "venue": "", "year": 2014, "id": "43e0d076-f036-479b-bd3e-725d9640a826"}
{"authors": ["Giovanni Aloisio", "Dario Conte", "Cosimo Elefante", "Italo Epicoco", "Gian Paolo Marra", "Giangiuseppe Mastrantonio", "Gianvito Quarta"], "n_citation": 50, "references": ["379bf81f-a7f9-40da-9664-f30243187950", "740d054f-67e6-4e6e-a54d-f09e4ab41bb7", "9cdc54f0-f1a0-4422-ac16-d9164d9371ee", "c2f67467-3138-4d37-a743-10340dc3ea44", "d6fc2815-760e-4656-8014-d49648efc751"], "title": "SensorML for Grid Sensor Networks.", "venue": "", "year": 2006, "id": "43f07d83-c1d6-4902-bfbc-d6a5465c2b46"}
{"authors": ["Ben Shneiderrnan"], "n_citation": 19, "references": ["12f99766-7716-4f10-a36c-b606aef6ec25", "2084d6b4-3b26-452f-9d86-be8f5703a57d", "70f638ad-b56d-42bb-a310-79d359db6bd0", "82e9cd38-68c9-497a-8df2-4ca32875c34b", "b05c779c-83bd-47fa-8b30-9baa6f2bbf0a", "b2f04497-4a12-46b0-b227-1274869f5080", "e930195e-baa4-4d42-9d5f-e042fcaf5a9e"], "title": "A Model for Optimizing Indexed File Structures", "venue": "International Journal of Parallel Programming", "year": 1974, "id": "43f5a240-0c22-4da9-9361-68229cd17cdd"}
{"authors": ["Thomas Peisl", "Juergen Schmied"], "n_citation": 50, "references": ["f8963506-8288-4bef-ac39-7082dc3c7b1a"], "title": "Innovating Innovation: A Conceptual Framework", "venue": "", "year": 2012, "id": "43f60016-2388-4732-8de3-d1c8b57334cf"}
{"authors": ["Rihard Karba", "F. Kozjek", "Ales Mrhar", "F. Bremsak", "Drago Matko"], "n_citation": 1, "references": [], "title": "Evaluation of Incomplete Absorption Using Analog-Hybrid Simulation", "venue": "", "year": 1984, "id": "43f7bb54-4029-41a1-a7c1-31a3d75cf28f"}
{"authors": ["Axel Hoppe", "Bernhard Preim"], "n_citation": 10, "references": ["ed842e06-5cfa-45b8-be30-052e065d12df"], "title": "Enrichment and Reuse of Geometric Models.", "venue": "", "year": 1997, "id": "43faca52-91b0-4981-9dae-c7de7db5f595"}
{"abstract": "The Internet is moving towards dynamic and ad-hoc service composition. The resulting so-called Web 2.0 sites maintain a unified user-experience while interacting and exchanging personal data with multiple other sites. Since the interaction is dynamic and ad-hoc, existing privacy policy mechanisms are not designed for this scenario.#R##N##R##N#In this article we describe a new lightweight approach towards privacy management. The core idea is to provide a \"privacy panel\" - a unified and simple entry point at each site that enables consumers to review stored data and manage their privacy. Key aspects were ease-of-use and handling of recursive disclosures of personal data.", "authors": ["Matthias Schunter", "Michael Waidner"], "n_citation": 13, "references": ["05cb884c-4335-44dd-9d96-85a1bda7b8f2", "111edcc3-54bd-443a-aa7b-512eb0bfaf00", "130f5724-2dfc-4aa7-bdf3-2e41fd208e1e", "2a4bdf98-cbff-4e1f-8144-377f380b0ab6", "5f485fe6-a73c-4adf-b32e-10747d7c696e", "65de7b67-5931-43d2-a3ed-8faa3365f435", "8585f9e5-0fab-4a81-93ba-7362972a54a0", "897ba275-5353-447a-afc8-46a7c83c8d94", "8a3252e6-e915-460b-b7d4-43db6dd47221", "98f543e3-d61c-4099-ae96-237816472592", "a64594fa-8c15-4d2c-aba2-d42878495f64", "e4d8274b-786e-4a79-ae91-449bde1340bb", "eb7ead6f-2464-4d64-9632-e8c42facbda2", "f0eccc1a-c829-425d-a661-765c3fa2088a"], "title": "Simplified privacy controls for aggregated services: suspend and resume of personal data", "venue": "privacy enhancing technologies", "year": 2007, "id": "440c7e50-3ff1-4d6c-9b9d-ecdc4eaaa05f"}
{"authors": ["Luciano Gamberini", "Anna Spagnolli"], "n_citation": 6, "references": ["4879043d-e7e3-436b-a7f9-e9ced8717bf0", "f170f599-daaa-43ba-bd59-ded3c82698dd", "ff61f378-12a5-4c38-94cc-2e51b2b6b094"], "title": "Display Techniques and Methods for Cross-medial Data Analysis.", "venue": "Psychnology Journal", "year": 2003, "id": "444dd162-58d7-4522-9f5b-82b622c63523"}
{"authors": ["J. Wolfgang Kaltz", "J\u00fcrgen Ziegler"], "n_citation": 50, "references": ["0434718f-61c1-461e-94f0-e78d5762ad59", "346a3562-ee82-47c2-858e-e7e5d722f6e9", "494254c7-d4b6-41fd-8e63-910a4e3fbd96", "5c33ef87-0a36-49c8-a5b2-8c3cb06a7f3d", "7a5ccb96-6c93-4b2a-aa6e-dec1056d1c97", "89800fb9-9a1a-4d42-9b9f-7fb10ed9843d", "9a17fdf4-2669-4aa7-801d-a85780bde06c", "9cd02145-3d72-4fd6-9c87-b856c2aff151", "b5e6a24e-37f0-4299-a8d4-f719384602e7", "c5370987-d4ad-4b96-ba22-563bded8a4e5", "d515c91e-c058-4269-99bb-cfdfd227dab3", "e2593748-76d0-41b2-ac6b-1f72abea0652", "fb83f6e5-e2fe-49bc-8578-5b9570c8849c"], "title": "Supporting Systematic Usage of Context in Web Applications.", "venue": "the florida ai research society", "year": 2006, "id": "44512827-080f-4777-9e1d-b9c95f84274e"}
{"abstract": "It is well known that, in nature, populations are dynamic in space and time. This means that the size of populations oscillate across their habitats over time. This work uses the concepts of habitats, ecological relationships, ecological successions and population dynamics to build a cooperative search algorithm, named ECO. This work aims to explore the population sizing not as a parameter but as a dynamic process. The Artificial Bee Colony (ABC) was used in the experiments where benchmark mathematical functions were optimized. Results were compared with ABC running alone, with and without the use of population dynamics. The ECO algorithm with population dynamics performed better than the other approaches, possibly thanks to the ecological interactions (intra and inter-habitats) that enabled the co-evolution of populations and to a more natural survival selection mechanism by the use of population dynamics.", "authors": ["Rafael Stubs Parpinelli", "Heitor S. Lopes"], "n_citation": 2, "references": ["6553a4bb-79fd-44b1-94bb-53828eed49cc", "6bb5eb69-cda3-4fc0-8a1b-1d9c18495775", "c8b075a6-1509-475f-8cf6-d2d4351a4084", "f53162f2-504f-4527-b681-17dbe1a1c5a5"], "title": "Population resizing using nonlinear dynamics in an ecology-based approach", "venue": "intelligent data engineering and automated learning", "year": 2012, "id": "445e121e-f6d6-49e1-ab72-1123f5c9c697"}
{"authors": ["Sorin Dusan", "Li Deng"], "n_citation": 32, "title": "Recovering vocal tract shapes from MFCC parameters.", "venue": "", "year": 1998, "id": "44677615-83f1-4cef-93df-4e43e8f9ef82"}
{"abstract": "Data races are an important class of concurrency errors where two threads erroneously access a shared memory location without appropriate synchronization. This paper presents DataCollider, a lightweight and effective technique for dynamically detecting data races in kernel modules. Unlike existing data-race detection techniques, DataCollider is oblivious to the synchronization protocols (such as locking disciplines) the program uses to protect shared memory accesses. This is particularly important for low-level kernel code that uses a myriad of complex architecture/device specific synchronization mechanisms. To reduce the runtime overhead, DataCollider randomly samples a small percentage of memory accesses as candidates for data-race detection. The key novelty of DataCollider is that it uses breakpoint facilities already supported by many hardware architectures to achieve negligible runtime overheads. We have implemented DataCollider for the Windows 7 kernel and have found 25 confirmed erroneous data races of which 12 have already been fixed.", "authors": ["John Erickson", "Madanlal Musuvathi", "Sebastian Burckhardt", "Kirk Olynyk"], "n_citation": 150, "references": ["119162d6-0403-4980-8096-f6fa5d9fc228", "136c4780-2f25-4068-90a5-aed6afaf2890", "20b606d4-3c15-4578-9cd2-bd68c2bf7f44", "2fad3463-c71d-4fdc-bb31-781e27b57f54", "4cfc4b61-048f-435f-be1e-e2af9af49b7a", "6c20a4a2-0e3f-4446-b2e9-5f454d91b1c9", "7f0f937c-f854-47ff-b5fb-aca9314414b9", "84d6b71c-7e30-41c0-9d8c-fcd5e44b2550", "9acef219-b063-49cb-97e9-ca3f0b96e02f", "a4f95e3a-17b0-46ed-a588-341d2bc53a33", "b5894e8e-1774-45b2-9b34-23d2330878d0", "b79880dd-cea5-4109-bbb3-f86515c822a9", "bd702458-a06c-43bc-86aa-dec9f89e608e", "bf35b50a-762b-40f9-90e6-fe19daad008c", "cb07a6bc-7acc-4eb5-964f-c8ece4a6ed65", "de4c497b-5468-4ca6-bb18-d0c979688c10", "eb98ae5b-2b8a-4309-9fcb-a1ccb96b60f8"], "title": "Effective data-race detection for the kernel", "venue": "operating systems design and implementation", "year": 2010, "id": "447c98df-6b56-453c-a1f4-e442323f8945"}
{"abstract": "While the layered OSI model for networks provides a very clean conceptual framework for network design, certain applications are not completely indifferent to what happens at the lower layers. This is particularly true for multimedia and other real-time applications, which usually have stringent constraints on network performance in order to deliver an acceptable Quality of Experience (QoE) to the user.#R##N##R##N#Several cross-layer approaches for optimizing application quality have been proposed in the literature. In this paper we show how by combining network QoS measurements and application-level knowledge, significant improvements can be made to current management solutions.", "authors": ["Martin Varela", "Jukka-Pekka Laulajainen"], "n_citation": 0, "references": ["081cf508-0abd-41f8-824c-829f50d5a4f8", "609d7772-d364-4847-971a-4ce7cc0a9be3", "72499ce5-b80b-4f33-b1b9-b13daa2eba76", "98778314-3efe-4a4e-a76c-0fe36b249bf7", "a203158d-e990-48e6-ad6a-72ff2af03ecd", "b3f83e89-8891-4186-8757-1cd8ecd2c424", "b67deb61-676f-4987-8a58-b8499e27813e", "b7a207d0-0c8e-4115-8da4-3634534527d6", "ba826f68-f41d-406a-9c71-d93919f04e0c", "bdf0befa-d0d7-48a6-8e93-eba3f6366d05", "f1e7a314-38cc-49a0-a103-39f5c7899e0c"], "title": "Terminal-side QoE estimations for cross-layer network control: towards a user-centric approach to network management", "venue": "wired wireless internet communications", "year": 2011, "id": "44805b6a-083d-4f7a-a656-2b5521381504"}
{"abstract": "Enterprise architecture management is considered a valuable means to guide the consistent design and evolution of increasingly complex information systems. Despite existing research on EAM methods and models, organizations often face serious difficulties making EAM effective. The paper proposes to take organizational culture as a highly aggregated construct describing the context of EAM initiatives for building situational-or for that matter culture sensitive EAM methods-into account. We find that organizational culture significantly moderates the impact of EAM's design on EAM's success. In group culture, hierarchical culture and developmental culture it is essential to develop EAM from a passive into an actively designing approach to make it effective. Particularly in group culture it is rewarding to strive for an EAM approach that impacts stakeholders outside the IT department.", "authors": ["Stephan Aier"], "n_citation": 9, "references": ["0a5567c5-7a18-4e16-9f53-a79c9f21e32d", "24f5b018-48a4-4d42-b0b7-798fe60ee80a", "38966a0d-b8a3-4a29-8135-bf582b30172b", "446b7762-de42-4418-8006-d55c1cf57817", "47d43382-43df-45f3-8dd6-e143aa927d23", "86b9ebcf-ae18-42f3-8e99-87088406cad8", "c8408e93-7646-4cb2-8162-ff4cc5f09e2b", "df5927ad-967a-4140-9f38-2601bc926f90", "ef452a52-679d-4b4c-a2a0-6a84ab2dbece"], "title": "Understanding the Role of Organizational Culture for Design and Success of Enterprise Architecture Management", "venue": "Wirtschaftsinformatik \\/ Angewandte Informatik", "year": 2013, "id": "44e64b67-445c-4922-8190-fcac00f45de4"}
{"authors": ["Haim Kilov"], "n_citation": 1, "title": "Review of Object-Oriented Papers 2.", "venue": "Sigmod Record", "year": 1989, "id": "44f20794-76e7-475e-aab8-744cfee98b8e"}
{"abstract": "OpenStack has been rapidly established as the most popu- lar open-source platform for cloud Infrastrusture-as-a-Service in this fast moving industry. In response to increasing access control requirements from its users, the OpenStack identity service Keystone has introduced several entities, such as domains and projects in addition to roles, re- sulting in a rather complex and somewhat obscure authorization model. In this paper, we present a formalized description of the core OpenStack access control (OSAC). We further propose a domain trust extension for OSAC to facilitate secure cross-domain authorization. We have im- plemented a proof-of-concept prototype of this trust extension based on Keystone. The authorization delay introduced by the domain trusts is 0.7 percent on average in our experiments.", "authors": ["Bo Tang", "Ravi S. Sandhu"], "n_citation": 27, "references": ["1b490bed-d475-45d4-a949-801cf7d33063", "2de3c774-02ea-4e5d-b825-61750eb3897c", "3da548a1-d728-4aa3-8509-7b765ee72014", "45d104f7-3f6f-4689-b989-3edafd3d6a38", "571517c4-788f-4c63-ab48-f9d9dc43eb81", "5d11f3e7-7af2-4ee9-ba02-121fe3b4b2b8", "65adeeba-752a-466f-b10f-3db553e2d562", "6c26119d-7c5f-44ff-a613-e013d4d18f0b", "7c41a241-ef40-4f35-b9c6-b20a29c495a7", "7e0c7fb3-c21a-4ed0-bb70-8d39bc458420", "b6ca01bf-a2b6-45bc-86a8-3b38f6a2cba2", "bfd47446-9728-4647-990c-d4ff9ad14791", "c57b52c3-8d6b-477e-92b4-3659e14ea546", "cc8e7ab5-a06d-42a2-8753-e1fe018ec959", "cf3d1ad9-e2f2-4648-8815-0781841b61e0", "e0793508-c382-4a06-b53a-bb9eb47c5827", "e69e221c-1b8c-4e45-8a0c-b5baffd81b8d"], "title": "Extending OpenStack Access Control with Domain Trust", "venue": "network and system security", "year": 2014, "id": "44f40ac1-db47-457f-9679-a5a365a4b099"}
{"authors": ["Denis Derencourt", "Alain Terlutte"], "n_citation": 0, "title": "Compositions of Codings.", "venue": "developments in language theory", "year": 1993, "id": "45171ba3-3234-4edd-9c00-496ae805df1c"}
{"abstract": "Location-based context-aware services for mobile users need to collaborate in disparate networks. Services come and go as the user moves and no central repository is available. The user's personal information and service usage statistics need to be protected. To support service collaboration we propose a service infrastructure that relies on an event-based service-oriented architecture. We implemented a basic version of the architecture and used it for a tourism information system. An advanced version has been modelled using formal methods to evaluate privacy aspects. This paper reports about both architectures and our experiences of their application to tourism-related services.", "authors": ["Annika Hinze", "Yann Michel", "Lisa Eschner"], "n_citation": 6, "references": ["0b27a792-995a-436c-80e5-9e7a996059f6", "1011b5ea-800d-45bd-bf69-042fe2a18aef", "10d44d7d-364d-4724-af9b-a8a15b0c4b17", "1c115771-2d9b-482b-a020-704dd2dd3c1e", "59999b4d-c274-4b05-a80e-bf899913f912", "65d52a65-e3e0-4ab4-8cbd-7de9ea7e6c2b", "8b3747e0-1633-4cf9-9adc-cbb01933c7aa", "98e1a7f4-5c15-4269-a727-c6ac4513a371", "acfc5c98-d096-4071-ab64-dd15baf6130d", "b4ca9e3f-d878-430d-a354-aa1731291b73", "d674f4a7-84c6-4f7f-9269-efad39b6c160", "e99db70a-7ee8-4e14-9b42-9cbe1b3fa9e1", "f51f7b17-4831-45cb-b11b-b18e428991c5", "fafc3751-a363-4c4d-9008-b6fcf15d6de4"], "title": "Event-based communication for location-based service collaboration", "venue": "australasian database conference", "year": 2009, "id": "455a6680-a294-4d29-8a29-a9b37400ad99"}
{"authors": ["Abhishek Kolazi", "Sudhish N. George", "P. P. Deepthi"], "n_citation": 0, "references": ["2d67d714-eadb-4c96-ab28-86c680001267", "7f1214b2-e070-4ff2-a5d3-647e7c16c2d7", "c3f0fabd-810c-45d2-9b74-4f1b56e1078b", "c8e8a749-8b74-4390-a91a-02904c94bf90", "ce19c64f-046a-4dc9-ba7f-85f69763b00a", "cf8d89e9-329d-435c-a2f4-f0be88623913", "d5140311-2afb-40dd-b160-e8610d07d880", "ec2dc722-3036-4dda-b87a-c72f0173d7df"], "title": "PWLCM Based Secure Measurement Matrix Generation for Secure Video Compressive Sensing", "venue": "", "year": 2014, "id": "45654922-0d64-42f9-8d17-5c80e7221cc8"}
{"authors": ["Luisa Marucci", "Fabio Patern\u00f2"], "n_citation": 0, "references": ["2158ecc8-90ad-4782-887d-24a651e4a918", "39de0c61-aa19-4c36-adad-86eb148f7714", "5abb2a57-8f39-40ab-9f2e-562050ce0dbf", "a544a48f-f85a-4ee0-ba9d-ce25c744685c"], "title": "Designing an Agent to Support Interactive Access to Museum Information.", "venue": "", "year": 2000, "id": "45807a25-9dd8-4548-b44d-fa6c827eb183"}
{"authors": ["Luca Bergamaschi", "Giorgio Pini", "Flavio Sartoretto"], "n_citation": 0, "title": "Parallel Preconditioning of Sparse Symmetric Eigenproblems.", "venue": "", "year": 1999, "id": "45811687-eec3-44ee-8687-a4788c612844"}
{"authors": ["Sean M. Falconer", "Natalya Fridman Noy", "Margaret-Anne D. Storey"], "n_citation": 51, "references": ["09fdb767-96b3-418a-94fa-9403d10becb5", "0d4ffc2e-4ac4-4405-98df-079a97a3dbe4", "3a1cedc1-ded2-430a-8576-213ac3e4cf9b", "5aef98fe-4069-41ad-8f6d-19a696f116de", "5c88cf2d-bde9-4a19-b27e-e5971db9f5aa", "5e73565e-1921-4974-b81f-3a8f2ea865b8", "67a6c092-2038-44d4-81a8-e026bb696c60", "6ac127be-6e21-40c0-9670-d4154bea5e40", "70acd70f-a04b-4775-bd87-74f953b56571", "96d1f007-7e4b-4a46-82ac-25723c91e9ed", "9918782e-182b-47a4-a989-a364cd3576d1", "9ddba898-7462-43b1-9dc1-c99ef0732f24", "b675d062-5939-44af-bf60-8ab49d32b1dd", "cc77df23-cda3-40b4-8656-577245de8e01", "cdb33a2e-c755-48d9-b20a-d2eca0ea2508", "e5adf4fd-14a2-4a43-8361-41e478ec77f1", "ef3b30a6-5e79-4e5f-9e00-c62bf80e0dee"], "title": "Towards Understanding the Needs of Cognitive Support for Ontology Mapping.", "venue": "", "year": 2006, "id": "45ed5a72-2906-41e5-8d8d-34915b2557eb"}
{"abstract": "In this work we argue that two main gaps currently hinder the development of new applications requiring sophisticated data discovery capabilities over rich (semi-structured) entity-relationship data. The first gap exists at the conceptual level, and the second at the logical level. Aiming at fulfilling the identified gaps, we propose a novel methodology for developing data discovery applications. We first describe a data discovery extension to the classic ER conceptual model termed Entity Relationship Data Discovery (ERD2). We further present a novel logical model termed the Document Category Sets (DCS) model, used to represent entities and their relationships within an enhanced document model, and describe how data discovery requirements captured by the ERD2 conceptual model can be translated into the DCS logical model. Finally, we propose an efficient data discovery system implementation, and share details of two different data discovery applications that were developed in IBM using the proposed methodology.", "authors": ["Sivan Yogev", "Haggai Roitman"], "n_citation": 1, "references": ["01e32a10-2214-49b7-981b-cddc6cafa18a", "065ee079-d93a-41ac-84b0-4f4d84f9fc4e", "07f48988-142d-4674-8a64-f8bfdd507ad0", "095731f3-a157-43a6-b281-de419b011e99", "11e151ec-2466-4a3e-a0ff-e088fa44c754", "2c6b324c-4176-4124-a40f-59964c41948c", "3da8a458-09c3-4526-8784-76113fa0c262", "6819329e-9d7b-454c-aecb-c6c4714d83e6", "71b62008-1731-4491-b34c-9f223bae846f", "8007c978-178b-48c9-a50a-3e2285e4f5f4", "853118d2-b770-4751-b93d-be67c06c0c74", "8cfedfb6-3f90-4571-8a97-d5d50409fbab", "a24017e6-7f79-4f87-81b0-7808dc2fb5b9", "a6139ee6-b91b-4e60-9170-2c32e0090abf", "a83497a1-58da-47de-9366-81570b336a5c", "b01af3ad-7001-4916-bf28-b3a64979292c", "b890f214-4bad-4f01-bc22-bfbe0d2b2652", "e6384e27-ffc1-4aad-874f-8b7eb01835c0"], "title": "Bridging the gaps towards advanced data discovery over semi-structured data", "venue": "international conference on conceptual modeling", "year": 2012, "id": "45fe76f3-66b1-4bfa-8d44-c7ab0081da9a"}
{"authors": ["Ulrich B\u00fcker", "Siegbert Dr\u00fce", "Nicolai G\u00f6tze", "Georg Hartmann", "Ralf Stemmer", "Ralf Trapp"], "n_citation": 3, "title": "Aktive Objekterkennung und -vermessung zur Steuerung eines Demontageroboters.", "venue": "", "year": 1999, "id": "460f3698-25fe-43e6-a829-8f0ff783d787"}
{"abstract": "We investigate the problem of incremental maintenance of materialized XML views. We are considering the case where the underlying database is a relational database and the view exposed to querying is a materialized XML view. Then, updates to the underlying database should be reflected to the stored XML view, to keep it consistent with the source data, without recreating the entire view from the database after each source update. Unlike related work that uses algebraic methods, we use source-to-source compositional transformations, guided by the database and view schemata. We first translate SQL updates to pure (update-free) XQuery expressions that reconstruct the entire database state, reflecting the updated values in the new state. Then, we synthesize the right-inverse of the XQuery view function, guided by the view schema. This inverse function is applied to the old view to derive the old database state, which in turn is mapped to the new database state through the update function, and then is mapped to the new view through the view function. The resulting view-to-view function is normalized and translated to XQuery updates that destructively modify the materialized view efficiently to reflect the new view values.", "authors": ["Leonidas Fegaras"], "n_citation": 50, "references": ["12d84dd3-23da-47fa-af68-e71d1d37576f", "2edfa6a9-e625-4541-821f-c0a67a1f1e5f", "2f29a1b5-53ec-4494-b20e-3e1a8cd45d92", "6e82382f-3cfd-4e1f-877d-67716d201f77", "71fb983f-1ac1-413c-901a-bf6abd8039af", "87497027-f67e-450d-bbd6-91b43a3d21ef", "8ac6af0c-89c7-4358-ae21-4fa80296a89c", "b22d5ed4-7ad0-4537-8181-d89da54e6631", "d92c89a5-d11a-4454-9650-3e95bc0d10f6", "f0ef7ddc-3778-4820-b227-b1d2e39132fa", "f3a4525a-6b31-4527-85e3-3d937947afd0"], "title": "Incremental maintenance of materialized XML views", "venue": "database and expert systems applications", "year": 2011, "id": "460ff872-7bb5-40f0-9215-4257e51ae7ab"}
{"authors": ["Dorian Gaertner", "Keith L. Clark"], "n_citation": 85, "references": ["4af52a40-5d92-40c5-a7b7-546b8f2f7ff6", "58af844c-bbc4-4b85-a73a-09f82872a8ff", "5fff9a52-b624-48fe-bf88-ac96ed74e44b", "68eb2902-42f5-4703-8ce6-96afab054407", "6efabe64-f66d-49ad-8c5d-c7af42f7f067", "8ebb1b75-1111-4987-8583-8671fc22ddbb", "95d33a82-8050-4ca0-a34e-1053b7d28672", "c2bfce6c-b09b-470a-bab1-61da26b2c230", "c6082f75-3e21-463c-8368-988c9012e54c", "cf1d3d07-1a4d-4c49-9f9a-77c615b23ed2", "e61d37b6-42b6-4c4f-9de9-91293d6ea676", "fdde4537-b0b0-44bb-874b-812217b37a46"], "title": "On Optimal Parameters for Ant Colony Optimization Algorithms.", "venue": "", "year": 2005, "id": "46104a1c-2def-4016-b248-4697ad0ed1a7"}
{"abstract": "The Hierarchical Task Network (HTN) planning method is conceived of as a useful method for web service composition as well as being for task planning. However, no complete success of service composition by HTN is achieved as yet. The reason is the Web service composition process involves interactive dataflow between variables in precondition and input/output parameters of services. While such dataflow requires to evaluate variables in order to compose services, the performance of services is undesirable, because world-altering Web services cause to alter the world in composition processes. In this paper, instead of the HTN task planning method, we address more radical approach of HTN method for web service composition and decomposition on the premise of the openness and uncertainty of WWW. We capture composite services, which contain abstract concepts with respect to the variables of Web services, as abstract programs to be tailored to individual users and to be instantiated to executable programs in which every variable can ground in execution. In this view, the web service composition process can be conceived of as a sort of automated programming process, and HTN is deemed as a structural workflow or a prototype of actual programs. We formalize web service composition/decomposition by HTN method using the idea of satisfiability of situation calculus, and address the algorithm for Web service (de)composition that does not require to perform services.", "authors": ["Seiji Koide", "Hideaki Takeda"], "n_citation": 50, "references": ["00b04479-dab4-4127-a7ea-15d22a16de99", "29c6e9df-8fc8-4b68-a369-c8855efb366c", "387395e6-6712-4dda-9cb7-cf0fd7de42c7", "acc364d8-c6b9-47aa-bbd1-d70197c0703e", "bf6360a1-5e63-429f-b083-16f814ed5d1a", "c2ea584a-4f7b-465f-8ae9-f37a000e8e78"], "title": "Formulation of hierarchical task network service (de)composition", "venue": "", "year": 2007, "id": "465f678b-74ea-44d2-835b-729546795f1e"}
{"abstract": "In this paper we investigate the enhancement of speech by applying MMSE short-time spectral magnitude estimation in the modulation domain. For this purpose, the traditional analysismodification-synthesis framework is extended to include modulation domain processing. We compensate the noisy modulation spectrum for additive noise distortion by applying the MMSE short-time spectral magnitude estimation algorithm in the modulation domain. Subjective experiments were conducted to compare the quality of stimuli processed by the MMSE modulation magnitude estimator to those processed using the MMSE acoustic magnitude estimator and the modulation spectral subtraction method. The proposed method is shown to have better noise suppression than MMSE acoustic magnitude estimation, and improved speech quality compared to modulation domain spectral subtraction. Index Terms: speech enhancement, MMSE short-time spectral magnitude estimator (AME), modulation spectrum, MMSE shorttime modulation magnitude estimator (MME), modulation domain, analysis-modification-synthesis (AMS)", "authors": ["Kuldip Kumar Paliwal", "Belinda Marie Schwerin", "Kamil Wojcicki"], "n_citation": 6, "references": ["217b07dd-b26d-448b-b1bb-9faef8eb14f7", "54499553-c48d-49dc-8607-21422ce0978c", "6fe6be0c-cddf-4ce1-9a45-227f5bc31a1c", "736ed5e7-39f4-4ef7-ae74-3fb6a63bf1e0", "9d313a50-af3a-4e0d-953a-a8b0695b1c6d", "ab00ed99-0796-4938-bd3a-aa87bc18986b", "c0e172bf-7f26-46e3-815c-7aab73f80c19", "c292e047-4deb-4575-ba0a-fe51c8799393"], "title": "Single channel speech enhancement using MMSE estimation of short-time modulation magnitude spectrum", "venue": "conference of the international speech communication association", "year": 2011, "id": "466cea86-440a-4b0d-8c9f-2f5bb02f26e9"}
{"authors": ["Valery Sklyarov", "Iouliia Skliarova"], "n_citation": 3, "title": "Reconfigurable Systems and their Influence on Mobile and Multimedia Applications.", "venue": "advances in mobile multimedia", "year": 2006, "id": "46755ba5-ebf0-4b4c-a3ac-70d90a7bcc33"}
{"abstract": "This paper describes how a nascent collective of individuals can coalesce into a complex social system. The systematic study of such scenarios requires a mathematical framework within which to model the behavior of the individual members of the collective. As individuals interact, they develop social relationships and exchange resources --- that is, they develop social capital that quantifies the value of social influence that individuals exert on each other. Social capital can be expressed via conditional preference orderings for each individual. Conditional preferences reflect the influence relationships of an interacting social collective. Conditional preference orderings can then be aggregated via conditional game theory to form a concordant utility that provides an emergent group-level ordering of the harmony of interests of the members of the collective. We can thus develop a complete social model that takes into consideration all social relationships as they propagate through the system. Solution concepts can then be defined that simultaneously account for both group-level and individual-level interests.", "authors": ["Wynn C. Stirling", "Christophe Giraud-Carrier", "Teppo Felin"], "n_citation": 0, "references": ["6a6b9aa6-683f-4c7c-b06e-9c3018d10fd3", "a4b97ffe-e638-4728-a7db-6b15a18a5092", "ac744614-9003-4ccb-93bf-2fe5b1ef4166", "d3e00e7e-1c64-4d7a-b2b2-1ad98ba4c706", "dde70246-acd6-4602-8173-3024eb515ad8"], "title": "A framework for the design and synthesis of coordinated social systems", "venue": "social informatics", "year": 2012, "id": "467976c4-0bfe-4dfc-ae52-9e4af5a561eb"}
{"authors": ["Francesco De Pretis", "Cecilia Vernia"], "n_citation": 0, "references": [], "title": "A Statistical Mechanics Approach to Immigrant Integration in Emilia Romagna (Italy)", "venue": "", "year": 2014, "id": "46b113a9-543c-4874-a385-850332dc41df"}
{"abstract": "For data classification, in fields like medicine, where vague concepts have to be considered, and where, at the same time, intelligible rules are required, research agrees on utility of fuzzy logic. In this ambit, if statistical information about the problem is known, or can be extracted from data, it can be used to define fuzzy sets and rules. Statistical knowledge can be acquired in terms of probability distributions or likelihood functions. Here, an approach is proposed for the transformation of likelihood functions into fuzzy sets, which considers possibility measure, and different methods arising from this approach are presented. By using real data, a comparison among different methods is performed, based on the analysis of transformation properties and resulting fuzzy sets characteristics. Finally, the best method to be used in the context of clinical decision support systems (DSSs) is chosen.", "authors": ["Marco Pota", "Massimo Esposito", "Giuseppe De Pietro"], "n_citation": 50, "references": ["02b5456c-418e-4a45-9db1-930786d87048", "574a874d-5be6-4fc3-8f1f-4a8d3e705838", "602cce77-9f6c-401f-9d1e-bd81e73ede8a"], "title": "From likelihood uncertainty to fuzziness: a possibility-based approach for building clinical DSSs", "venue": "hybrid artificial intelligence systems", "year": 2012, "id": "46bba203-ecdf-48f0-a8e3-e8d1dcd11a74"}
{"authors": ["Francisco Javier Hernandez Diaz", "\u00c1ngel S\u00e1nchez", "Ana Bel\u00e9n Moreno", "Jos\u00e9 F. V\u00e9lez"], "n_citation": 0, "references": ["218ed31c-da8e-43e8-863d-e4e9cd612a54"], "title": "Embedded Meteorological Airport Systems.", "venue": "european symposium on algorithms", "year": 2003, "id": "46bc65a5-8259-4cbf-a66c-390efa08b2cb"}
{"abstract": "This paper is concerned with the problem of disambiguating Web people search result. Finding the information about people is one of the most common activities on the Web. However, the result of searching person names suffers a lot from the problem of ambiguity. In this paper, we propose a classification framework to solve this problem using an additional feedback page. Compared with the traditional solution which clusters the search result, our framework has lower computational complexity and better effect. we also developed two new features under the framework, which utilized the information beyond tokens. Experiments show that the performance can be improved greatly using the two features. Different classification methods are also compared for their effectiveness for the task.", "authors": ["Ou Jin", "Shenghua Bao", "Zhong Su", "Yong Yu"], "n_citation": 0, "references": ["0e781aba-aed0-4fcd-9b5c-eba8ec63490d", "102db1ef-6d62-47b6-9e69-023c6fac2bfe", "3483a9a5-b65e-4b02-a615-130930c6d6a0", "466a6ca5-ccf1-4074-950f-161544a01cb7", "4ddd74c4-5807-4ebf-9d97-99cd116aeae1", "809f55b6-f7a4-4fa3-ada9-6ada621ca677", "86d87cb4-56d4-482c-9999-3d717fc7a205", "aedfd2bf-2a47-4874-910e-1430aa646767", "b4e4dca8-9aed-4ef1-9687-5c566ef237d0", "c2a1a9ff-85cb-4826-85ed-7e7fb3abe036", "cd91d375-b151-4f9e-a8b8-ab65713e8559", "d0408ca3-84cf-443b-9f2c-743f58818644"], "title": "A classification framework for disambiguating web people search result using feedback", "venue": "web age information management", "year": 2011, "id": "46cbd346-d6a2-47d8-a9c2-a8ba9838ee9f"}
{"authors": ["Eric Baumer", "Bill Tomlinson"], "n_citation": 5, "references": ["3d439b9f-0a05-45fb-82ca-7a5b72256c06", "3e528dd7-e7ea-48c3-a2f7-1ffa2e8388a6", "a9358139-51b9-4c50-9f65-265098ef8aa7", "f156c919-b5d8-4007-8d63-ae865594a77e"], "title": "Computational Metaphor Identification in Communities of Blogs.", "venue": "international conference on weblogs and social media", "year": 2008, "id": "46cfb8ad-88ed-40d2-ba7c-9e4d544b43a5"}
{"authors": ["Laxmi Gunupudi", "Rahul De"], "n_citation": 0, "references": ["51ca843c-b91b-487a-ad79-9b67ed073122", "5ea58cda-ef87-4b9f-9a2b-b8723b012b39", "a92ac789-d595-4cca-b686-2c33b8d67ca7", "c979159d-884a-4172-aef2-d471491441c1", "e7ae2f2a-78a5-4d27-8376-3dadf1a40444"], "title": "Market Separations Perspective of Agricultural Markets and Successful AMIS: Beyond Technical Rationality", "venue": "", "year": 2013, "id": "46d69a1d-54b8-47ca-bdb2-baa7db9d7116"}
{"authors": ["Fuqian Shi", "Shouqian Sun", "Jiang Xu", "Jianfeng Wu"], "n_citation": 0, "references": ["0622de00-35fd-434b-ad42-5053f2d7ae53", "09467dbc-74a0-4572-817a-23a8f4d79d64", "0bd45c2f-2121-45c5-9ff5-0fe952ef9ca2", "19317abf-aada-4eeb-bef0-e545c3a172e4", "3cb1a6fc-3101-4cf8-a03d-5497bfef9624", "824d03c4-6a26-4da4-8dc6-3e94ac50f38c", "b1cb25d9-1518-4096-bfbe-4cee69994181", "bbd618ac-8189-4a1e-8609-82eb23fb2a41"], "title": "Apply Multi-class Fuzzy Support Vector Machines to Product-Form-Image Prediction", "venue": "international conference of fuzzy information and engineering", "year": 2009, "id": "46f64957-2a01-4770-9613-77c0f00a9be0"}
{"authors": ["Jennifer Widom", "Stefano Ceri"], "n_citation": 3, "title": "Applications of Active Databases", "venue": "", "year": 1996, "id": "47284556-4e69-4079-89f2-7316bbc69d5c"}
{"abstract": "We aim to predict radiological observations using computationally-derived imaging features extracted from computed tomography (CT) images. We created a dataset of 79 CT images containing liver lesions identified and annotated by a radiologist using a controlled vocabulary of 76 semantic terms. Computationally-derived features were extracted describing intensity, texture, shape, and edge sharpness. Traditional logistic regression was compared to L1-regularized logistic regression (LASSO) in order to predict the radiological observations using computational features. The approach was evaluated by leave one out cross-validation. Informative radiological observations such as lesion enhancement, hypervascular attenuation, and homogeneous retention were predicted well by computational features. By exploiting relationships between computational and semantic features, this approach could lead to more accurate and efficient radiology reporting.", "authors": ["Francisco Gimenez", "Jiajing Xu", "Yi Liu", "Tiffany Ting Liu", "Christopher F. Beaulieu", "Daniel L. Rubin", "Sandy Napel"], "n_citation": 12, "references": ["4ca88053-0d54-483c-a4ca-5618e58ef3c1", "5d23a185-296b-4479-9881-b317fa0edfad", "7133bc5b-595a-45e2-933b-5dc93bc11ba2", "988776d9-46b9-4027-97cb-5955f437cc15", "9f6aed7f-4e5a-487a-b3dc-0626e343d027", "a03c8fda-2588-4d8d-977d-6469a5715676", "a62ba417-3fb4-4cfb-9494-31b0ccac6a72", "d3549920-2f28-4b70-a63c-7a342c709316", "dd851d15-bc13-4469-a05b-23f9efd56774"], "title": "Automatic Annotation of Radiological Observations in Liver CT Images", "venue": "", "year": 2012, "id": "4729985d-2f68-4b6b-87a9-08e600758f8b"}
{"authors": ["Teresa Gon\u00e7alves", "Paulo Quaresma"], "n_citation": 4, "title": "Is linguistic information relevant for the text legal classification problem", "venue": "international conference on artificial intelligence and law", "year": 2005, "id": "4744bb72-a195-4bef-839f-9bc0e2177946"}
{"authors": ["Hisao Kuwabara"], "n_citation": 0, "title": "Perception of voice-individuality for distortions of resonance/source characteristics and waveforms.", "venue": "conference of the international speech communication association", "year": 2003, "id": "476e301e-5a46-4fcd-a738-42a37f7c81b5"}
{"authors": ["M.S. Djoudi", "Dominique Fohr", "Jean Paul Haton"], "n_citation": 7, "title": "Phonetic study for automatic recognition of Arabic.", "venue": "", "year": 1989, "id": "479842fe-17ea-4d89-8e1d-6166fc48c9f3"}
{"authors": ["R.A. Brierton", "Barry M. G. Cheetham"], "n_citation": 0, "title": "An evaluation oof spectral transitivity functions for speech segmentation in variable frame-rate speech vocoding.", "venue": "conference of the international speech communication association", "year": 1991, "id": "47a51902-054e-4b40-bba4-6a793d28d67b"}
{"authors": ["Hongyan Xing", "Daowen Qiu"], "n_citation": 0, "references": ["1baeeaaf-052d-4fa9-873f-4f6528389e30", "3b004780-bd65-4a56-8f8a-82cd89c2f24b", "488451b9-147b-472b-859f-76a07540d81e", "4ce401a9-00a6-48b7-8ff6-f6540850ae1e", "762c5597-5767-4361-808a-aee06d284302", "ce1fd97c-db79-4360-999c-1ac658a01e06"], "title": "Applications on Information Flow and Biomedical Treatment of FDES Based on Fuzzy Sequential Machines Theory", "venue": "international conference on intelligent computing", "year": 2012, "id": "47a78620-492b-4874-967f-eee4395d9d3a"}
{"authors": ["Francesco Di Pierro", "Soon-Thiam Khu", "Dragan Savic"], "n_citation": 0, "title": "Many-Objective Evolutionary Optimisation.", "venue": "", "year": 2009, "id": "47bb3731-ba83-408a-a5e9-ddb3e85cb50f"}
{"authors": ["Amir Yahyavi", "H. Khalili", "Nasser Yazdani"], "n_citation": 0, "references": ["26501277-971f-4428-8fb7-d1e728a615e0", "31a861b8-86a3-416a-b33c-1529e4eacb82", "52da1a09-9acd-495d-b885-850b3508f87c", "678bb811-ccee-4948-9de8-57ab22107669", "6a7af891-2b4d-4ba9-8751-24194cff30e5", "6bfdf9a3-6cd9-43d8-9785-0073dbe96f1b", "782d5869-1948-445b-ad7a-75eaf3c590dc", "7b57a3f4-44a2-4fe3-9959-f25255669534", "85352dec-58be-43db-a428-f3f574ff96ec", "8acc4d51-0e0c-4cff-8bdd-5a73df2d49b5", "9783bd20-e411-41a3-95fa-daa054147276", "9efda63c-320d-46b0-8a7b-175012a2936f", "b1028a5f-edc3-4a4b-9b12-4b99a649cfd9", "b5b8132d-0a8c-4e6c-999f-839f0cef48b7", "c7578a99-f372-4ce5-9dcf-320bc31cf9fc", "d3a6b91d-9fad-4438-82e2-ac405428cae2", "e9e45e77-7dd0-4da0-9e74-b4d468626027", "f3267c01-b670-4b7a-a3a5-79088c0d90ab", "fef1388d-67b3-40bb-be3b-1fe9e3026b0c"], "title": "DELAY EFFICIENT MAC PROTOCOL FOR DIFFUSION BASED ROUTING IN WIRELESS SENSOR NETWORKS", "venue": "international conference on wireless information networks and systems", "year": 2008, "id": "47d15ac4-9041-4f61-b776-d1adb4737c05"}
{"abstract": "Current research on Internet of Things (IoT) mainly focuses on how to enable general objects to see, hear, and smell the physical world for themselves, and make them connected to share the observations. In this paper, we argue that only connected is not enough, beyond that, general objects should have the capability to learn, think, and understand both the physical world by themselves. On the other hand, the future IoT will be highly populated by large numbers of heterogeneous networked embedded devices, which are generating massive or big data in an explosive fashion. Although there is a consensus among almost everyone on the great importance of big data analytics in IoT, to date, limited results, especially the mathematical foundations, are obtained. These practical needs impels us to propose a systematic tutorial on the development of effective algorithms for big data analytics in future IoT, which are grouped into four classes: 1) heterogeneous data processing, 2) nonlinear data processing, 3) high-dimensional data processing, and 4) distributed and parallel data processing. We envision that the presented research is offered as a mere baby step in a potentially fruitful research direction. We hope that this article, with interdisciplinary perspectives, will stimulate more interests in research and development of practical and effective algorithms for specific IoT applications, to enable smart resource allocation, automatic network operation, and intelligent service provisioning.", "authors": ["Guoru Ding", "Long Wang", "Qihui Wu"], "n_citation": 50, "references": ["538f01b5-a0b6-4c1f-afb9-b03e81e2107f", "5e2ae027-62ab-4a7a-a843-ae8618bf0b14", "96aed60c-ab49-4fbc-bb60-71a6a87b695a", "a4d99f75-9fbc-490a-acc1-50a5863058d8", "a81d35e6-d5cd-4eef-9144-b0755ef268d1", "cc2eef9a-81df-45cd-bc14-d361875e1395", "d0ac9882-aa76-4ca5-af9d-3fefc5dc8614", "e537d143-155e-4ca0-8ae8-66b777a77fea"], "title": "Big Data Analytics in Future Internet of Things", "venue": "arXiv: Distributed, Parallel, and Cluster Computing", "year": 2013, "id": "4805e825-d59e-4d94-b109-872cdf207d98"}
{"authors": ["Tanja B\u00e4nziger", "Michel Morel", "Klaus R. Scherer"], "n_citation": 10, "title": "Is there an emotion signature in intonational patterns? and can it be used in synthesis?", "venue": "conference of the international speech communication association", "year": 2003, "id": "480fdf93-2218-462d-ada7-43b99cf5dd58"}
{"abstract": "Information technology (IT) is enabling better healthcare delivery and care. However, the role of IT in managing chronic diseases is still unclear. Chronic diseases are a challenge today, accounting for a huge cost burden in the United States. This article is focused on addressing the research question that how digital integration can play a role in enhancing patients\u2019 psychological empowerment to manage a chronic disease. Based on existing literature, we develop a conceptual research model that provides antecedents and consequences of psychological empowerment for chronic disease treatment, and suggest a mediating role of digital integration through three tenets of digitization, mobilization and personalization. We develop a set of propositions based on the research model, and suggest a set of measurable constructs to test the propositions. A research methodology is introduced with a plan for the empirical analysis. Contributions and implications of this study are discussed.", "authors": ["Xiadong Deng", "Jiban Khuntia", "Kaushik Ghosh"], "n_citation": 50, "references": ["14915cf1-b5d0-4a31-9b30-ec06b25d3d5e", "5ab4c439-2144-42c3-ba3d-bcd9d0fa70bc", "762296ad-e194-4403-bf5e-c3baf67891d6", "7dbf48f9-8e84-46b6-a728-0e2bc55f8112", "8b4584e1-0a82-437d-939e-67c3ecf5342c", "8b8513e7-77b9-46d7-a4d2-9c237ecad8a6", "8fb6ff4d-920c-42ef-aed2-e5597671a682", "974855ef-5fab-4d37-a1de-1e1d2de4cd37", "9bb21c83-6a73-4103-9225-e7c9b4de05cd", "e75a5968-bc9b-49ae-9a56-3e5869fdd87b", "efa9bd05-90d2-4232-bcfc-83f100a8e7c0", "fd254c93-ee3a-40d8-8948-dcefd3d3c415"], "title": "Psychological Empowerment of Patients with Chronic Diseases: The Role of Digital Integration", "venue": "international conference on information systems", "year": 2013, "id": "48109bcd-de56-413b-9526-7b4eea4906f5"}
{"authors": ["Tibor Csendes", "Zolt\u00e1n F\u00fcl\u00f6p 0001"], "n_citation": 0, "title": "Preface - Papers from the Conference for PhD Students in Computer Science.", "venue": "Acta Cybernetica", "year": 1999, "id": "481e2f90-e2b7-47dd-b118-4fa4e79ccb2d"}
{"authors": ["IlYoung Chung", "JongMin Lee", "Chong-Sun Hwang"], "n_citation": 0, "title": "Transaction Processing using Asynchronous Broadcasting in Mobile Client-Server Databases.", "venue": "parallel and distributed processing techniques and applications", "year": 1999, "id": "481f07f8-ab93-4aac-9fbb-816931d74896"}
{"abstract": "A new knowledge representation scheme called S-Net is presented. The S-Net is a descendent of both semantic networks and recently developed AI languages. We are willing to introduce procedures into our network notations as FRL and KRL do. However, these languages have a serious disadvantage that the programmer should specify, explicitly by using indicators such as WHEN-FILLED, TO-FILL etc., when the attached procedures are invoked. This results in the restriction of system's abilities of solving problems. To avoid this, the programmer should always pay attention to the overal control issues during the coding of his procedures. In our new formalism, the explicit specification is not necessary. The problem solver based on the S-Net dynamically determines which procedure is invoked when, according to the problem solving situations, not to the pre-specified indicators. We also discuss the problems of property inheritance through hierarchy. The inheritance mechanism provided so far is so restrictive that the programmer should do all things in his procedures. In the S-Net, the property inheritance is further augmented by the 'explicit path specification'. The detailed construction of the problem solver, which performs both forward and backward reasonings appropriately, is also given.", "authors": ["Makoto Nagao", "Jun'ichi Tsujii"], "n_citation": 4, "references": ["5a299e1c-1b42-4ba0-9d0b-fc8ef602feac"], "title": "S-NET: a foundation for knowledge representation languages", "venue": "international joint conference on artificial intelligence", "year": 1979, "id": "4821be99-ee80-4e28-89f2-6c8cc99f0ca2"}
{"abstract": "Healthcare web-application development teams involve non- computer experts working (clinicians) on the requirements specification that is later processed by software engineers/analysts (conceptual model) and coded by software programmers (software project). The management of this process, which involves different levels of abstraction and professionals with different backgrounds, is often complex. As such, mediators and facilitator's mecha- nisms for the requirements-gathering process and information transfer are need- ed. The main purpose of this work is to minimize the problems associated with this complex process, supporting the requirements engineering process of a healthcare web-application in a rapid prototyping model. The results proved that a rapid and functional prototyping model can improve the effectiveness of the requirement elicitation of any software development.", "authors": ["Leonor Teixeira", "Vasco Saavedra", "Carlos Ferreira", "Jo\u00e3o Pedro Sim\u00f5es", "Beatriz Sousa Santos"], "n_citation": 15, "references": ["0b14d4d6-0438-4cd7-b457-00440c14ba52", "26056b05-cd2d-4108-ac65-42b4680eeb08", "56dec375-91b2-4edd-9f61-9d7eae3c9718", "5c9292f8-a211-41f3-90b9-e1be4950949f", "ae7c6b26-3895-4a87-ae9e-0c19ed9b6731"], "title": "Requirements Engineering Using Mockups and Prototyping Tools: Developing a Healthcare Web-Application", "venue": "", "year": 2014, "id": "48275b1c-f47a-43d6-86d4-c44008811462"}
{"abstract": "In an improvised bodily expression, it is important to create the image inside the self. We developed a body expression generator called \"shadow media\" that generates an image by causing a gap between the body and its shadow. In this study, we focused on the dual residual shadow, a type of the shadow media, which generates a dual gap. Using this aspect of the shadow media, we develop new body expression media by introducing fluctuation and cellar automation to the boundary of the dual residual shadow. Experimental results indicate that these shadow media outputs can effectively support the generation of bodily expressions.", "authors": ["Naruhiro Hayashi", "Yoshiyuki Miwa", "Shiroh Itai", "Hiroko Nish"], "n_citation": 0, "references": ["7bade242-33f8-49ad-a6ae-dc1f1363ce18", "c42d46d5-3f5a-4a91-850d-7be1e6048d5d"], "title": "Bodily expression media by dual domain design of shadow", "venue": "", "year": 2013, "id": "482f4240-6d12-4769-8131-ef510c94f43b"}
{"authors": ["Yuka Kato", "Toru Sasaki", "Katsuya Hakozaki"], "n_citation": 0, "title": "User-oriented QoS Control Methods for Distributed Multimedia Systems.", "venue": "", "year": 2002, "id": "4835ba84-3295-4d8c-a34e-fdbfd37c28f9"}
{"authors": ["L. Miguel Encarna\u00e7\u00e3o", "Andr\u00e9 Stork"], "n_citation": 1, "title": "Adaptionsm\u00f6glichkeiten in modernen CAD-Systemen: Bewertung, Konzeption und Realisierung.", "venue": "Computer-aided Design", "year": 1996, "id": "48416ff1-e613-4698-9abe-5ccaba8f9321"}
{"abstract": "The Simple Network Management Protocol (SNMP) has been around for more than a decade and is supported by most network devices and end systems. Despite this success, there is still a lack of simple to use network management applications.This paper describes the design of an SNMP management tool called  scli  which provides an easy and efficient to use SNMP command line interface. The software architecture has been designed to make it easy for C programmers without any special SNMP programming skills to extend the functionality provided by  scli .", "authors": ["J\u00fcrgen Sch\u00f6nw\u00e4lder"], "n_citation": 50, "references": ["04c194cd-f0b8-48fa-b04f-2ae2343fb8c3", "35d64ff1-6a84-4838-a70b-d05baadea175", "86a44dc5-7d19-4534-8ca9-7aff15e1b523"], "title": "Specific Simple Network Management Tools", "venue": "usenix large installation systems administration conference", "year": 2001, "id": "484ece8a-e0cb-45db-a809-40b4f17025b3"}
{"abstract": "Most memory corruption attacks and Internet worms follow a familiar pattern known as the control-data attack. Hence, many defensive techniques are designed to protect program control flow integrity. Although earlier work did suggest the existence of attacks that do not alter control flow, such attacks are generally believed to be rare against real-world software. The key contribution of this paper is to show that non-control-data attacks are realistic. We demonstrate that many real-world applications, including FTP, SSH, Telnet, and HTTP servers, are vulnerable to such attacks. In each case, the generated attack results in a security compromise equivalent to that due to the control-data attack exploiting the same security bug. Non-control-data attacks corrupt a variety of application data including user identity data, configuration data, user input data, and decision-making data. The success of these attacks and the variety of applications and target data suggest that potential attack patterns are diverse. Attackers are currently focused on control-data attacks, but it is clear that when control flow protection techniques shut them down, they have incentives to study and employ non-control-data attacks. This paper emphasizes the importance of future research efforts to address this realistic threat.", "authors": ["Shuo Chen", "Jun Xu", "Emre Can Sezer", "Prachi Gauriar", "Ravishankar K. Iyer"], "n_citation": 418, "references": ["08141632-fd46-4076-afd7-3009fa1e197d", "10f1002b-1eda-498e-a695-44f9394c31a9", "169b29b8-2c90-42fc-ad37-9a21e2dbcd5d", "1bcd2dc5-bf3c-48f3-9ad3-c7ea1481e443", "24e8d1a1-eb14-422a-97b7-d36b011eadfa", "2c4a3c6a-af20-4e72-abb5-e64e4e2c1081", "2e82c690-0686-4a96-9299-d61c5cfcaed3", "5e6d87c2-6b68-4033-98cc-f7cf03a71f8b", "6ce2a644-1c2e-45cb-8453-2c702e9fb06e", "6ef9f87e-dac3-4c78-af15-92bdff44fe08", "77684a2f-cdfc-4da9-bb62-e00586c5d667", "83a5c947-6397-417b-9a03-aa3c8e5a4314", "83ff3981-c4c8-47db-a7fd-cee8fca7d88b", "8c197b7c-ff5c-4ced-8ddd-19346c001ba4", "9642e785-c807-4ef5-ab34-109d88997e3c", "a3ae983a-a5b1-4a66-85c4-f7eaba90def6", "a9351fd3-ac3f-46ab-b72e-62cb5113051d", "a9c237a4-5c5c-4756-9947-0be52197926c", "b183a338-50d9-4195-b2d1-78243b3de3e8", "b682b7a2-aa37-48a1-b644-15198ca308dc", "c6931fb7-aed9-42d3-bdac-25fa8a440b87", "c77c7a91-a4a1-4874-b80a-7c7e2c36b051", "c81d02fc-4002-4906-83b6-5bc6c8809e1d", "cb663e4b-cab3-4f94-b66b-e22f25139edd", "d8c4d585-efb2-4e21-994d-0c7bd6baa27e", "ef699268-1b6b-4c9d-a467-14932273be17", "fab61cd7-ad32-4678-9667-74d2b949bcd5"], "title": "Non-control-data attacks are realistic threats", "venue": "usenix security symposium", "year": 2005, "id": "48aaa1b8-6042-4567-ba4f-148facb696c7"}
{"authors": ["Kai Salomaa", "Sheng Yu"], "n_citation": 4, "title": "Nondeterminism Degrees for Context-Free Languages.", "venue": "developments in language theory", "year": 1995, "id": "48b8e7ef-a62a-4273-9a8c-0a4f7fb32f79"}
{"authors": ["Ivo Rosenberg"], "n_citation": 50, "title": "Algebren und Relationen.", "venue": "Journal of Automata, Languages and Combinatorics", "year": 1970, "id": "48bac01a-87e2-4bf9-a78d-10643da93a55"}