共查询到20条相似文献,搜索用时 31 毫秒
1.
Jarosław Wypychowski Jarosław Pytliński Łukasz Skorwider Mirosław Nazaruk Krzysztof Benedyczak Michał Wroński Piotr Bała 《New Generation Computing》2004,22(2):147-156
In this paper we describe deployment of most important life sciences applications on the grid. The build grid is heterogenous
and consist of systems of different architecture as well as operating systems and various middleware. We have used UNICORE
infrastructure as framework for development dedicated user interface to the number of existing computational chemistry codes
and molecular biology databases. Developed solution allows for access to the resources provided with UNICORE as well as Globus
with exactly the same interface which gives access to the general grid functionality such as single login, job submission
and control mechanism.
Jarosław Wypychowski: He is a student at the Faculty of Mathematics and Computer Science, Warsaw University, Poland. He is involved in the development
of grid tools. He has been working as programmer in the private company.
Jarosław Pytliński, M.Sc.: He received his M.Sc. in 2002 from Department of Mathematic and Computer Science of Nicolaus Copernicus University in Torun.
His thesis on “Quantum Chemistry Computations in Grid Environment” was distincted in XIX Polish Contest for the best M.Sc.
Thesis of Computer Science. He also worked in Laboratory of High Performance Systems at UCI, Torun. His interests are Artificial
Intelligence and GRID technology.
Łukasz Skorwider, M.Sc.: He is programmer in the private pharmaceutical company. He obtained M.Sc. degree from the Faculty of Mathematics and Computer
Science N. Copernicus University. As graduate student he was involved in the development of grid tools for drug design. His
private and professional interest is Internet technology.
Mirosław Nazaruk, M.Sc.: He is a senior computer and network administrator at ICM Warsaw University. He provides professional support for the users
of the high performance facilities located at the ICM. He obtained M.Sc. in Computer Science from Warsaw University in 1991.
Before joining ICM, he was a member of technical staff at Institute of Applied Mathematics, Warsaw University.
Krzysztof Benedyczak: He is a student at the Faculty of Mathematics and Computer Science, N. Copernicus University, Torun, Poland. He is involved
in the development of grid tools.
Michał Wroński: He is a student at the Faculty of Mathematics and Computer Science, N. Copernicus University, Torun, Poland. He is involved
in the development of grid tools.
Piotr Bała, Ph.D.: He is an adiunkt at Faculty of Mathematics and Computer Science N. Copernicus University, Torun, Poland, and tightly cooperates
with ICM, Warsaw University. He obtained Ph.D. in Physics in 1993 in Institute of Physics, N. Copernicus University and in
2000 habilitation in physics. From 2001 he was appointed director of Laboratory of Parallel and Distributed Processing at
Faculty of Mathematics, N. Copernicus University. His main research interest is development and application of Quantum-Classical
Molecular Dynamics and Approximated Valence Bond method to study of enzymatic reactions in biological systems. In the last
few years, he has been involved in development of parallel and grid tools for large scale scientific applications. 相似文献
2.
Manolis Gergatsoulis Panos Rondogiannis Themis Panayiotopoulos 《New Generation Computing》2001,19(1):87-100
In this paper we introduce the logic programming languageDisjunctive Chronolog which combines the programming paradigms of temporal and disjunctive logic programming. Disjunctive Chronolog is capable
of expressing dynamic behaviour as well as uncertainty, two notions that are very common in a variety of real systems. We
present the minimal temporal model semantics and the fixpoint semantics for the new programming language and demonstrate their
equivalence. We also show how proof procedures developed for disjunctive logic programs can be easily extended to apply to
Disjunctive Chronolog programs.
Manolis Gergatsoulis, Ph.D.: He received his B.Sc. in Physics in 1983, the M.Sc. and the Ph.D. degrees in Computer Science in 1986 and 1995 respectively
all from the University of Athens, Greece. Since 1996 he is a Research Associate in the Institute of Informatics and Telecommunications,
NCSR ‘Demokritos’, Athens. His research interests include logic and temporal programming, program transformations and synthesis,
as well as theory of programming languages.
Panagiotis Rondogiannis, Ph.D.: He received his B.Sc. from the Department of Computer Engineering and Informatics, University of Patras, Greece, in 1989,
and his M.Sc. and Ph.D. from the Department of Computer Science, University of Victoria, Canada, in 1991 and 1994 respectively.
From 1995 to 1996 he served in the Greek army. From 1996 to 1997 he was a visiting professor in the Department of Computer
Science, University of Ioannina, Greece, and since 1997 he is a Lecturer in the same Department. In January 2000 he was elected
Assistant Professor in the Department of Informatics at the University of Athens. His research interests include functional,
logic and temporal programming, as well as theory of programming languages.
Themis Panayiotopoulos, Ph.D.: He received his Diploma on Electrical Engineering from the Department of Electrical Engineering, National Technical Univesity
of Athens, in 1984, and his Ph.D. on Artificial Intelligence from the above mentioned department in 1989. From 1991 to 1994
he was a visiting professor at the Department of Mathematics, University of the Aegean, Samos, Greece and a Research Associate
at the Institute of Informatics and Telecommunications of “Democritos” National Research Center. Since 1995 he is an Assistant
Prof. at the Department of Computer Science, University of Piraeus. His research interests include temporal programming, logic
programming, expert systems and intelligent agent architectures. 相似文献
3.
We introduce in this paper four classes of P transducers: arbitrary, initial, isolated arbitrary, isolated and initial. The
first two classes are universal, they can compute the same word functions as Turing machines, the latter two are incomparable
with finite state sequential transducers, generalized or not. We study the effect of the composition, and show that iteration
increases the power of these latter classes, also leading to a new characterization of recursively enumerable languages. The
“Sevilla carpet” of a computation is defined for P transducers, giving a representation of the control part for these P transducers.
Gabriel Ciobanu, Ph.D.: He has graduated from the Faculty of Mathematics, “A.I.Cuza” University of Iasi, and received his Ph.D. from the same university.
He is a senior researcher at the Institute of Computer Science of the Romanian Academy. He has wide-ranging interests in computing
including distributed systems and concurrency, computational methods in biology, membrane computing, and theory of programming
(semantics, formal methods, logics, verification). He has published around 90 papers in computer science and mathematics,
a book on programming semantics and a book on network programming. He is a co-editor of three volumes. He has visited various
universities in Europe, Asia, and North America, giving lectures and invited talks. His webpage is http://www.info.uaic.ro/gabriel
Gheorghe Păun, Ph.D.: He has graduated from the Faculty of Mathematics, University of Bucharest, in 1974 and received his Ph.D. from the same university
in 1977. Curently he works as senior researcher in the Institute of Mathematics of the Romanian Academy, as well as a Ramon
y Cajal researcher in Sevilla University, Spain. He has repeatedly visited numerous universities in Europe, Asia, and North
America. His main research areas are formal language theory and its applications, computational linguistics, DNA computing,
and membrane computing (a research area initiated by him). He has published over 400 research papers (collaborating with many
researchers worldwide), has lectured at over 100 universities, and gave numerous invited talks at recognized international
conferences. He has published 11 books in mathematics and computer science, has edited about 30 collective volumes, and also
published many popular science books and books on recreational mathematics (games). He is on the editorial boards of fourteen
international journals in mathematics, computer science, and linguistics, and was/is involved in the program/steering/organizing
commitees for many recognized conferences and workshops. In 1997 he was elected a member of the Romanian Academy.
Gheorghe Ştefănescu, Ph.D.: He received his B.Sc./M.Sc./Ph.D. degrees in Computer Science from the University of Bucharest. Currently, he is a Professor
of Computer Science at the University of Bucharest and a Senior Fellow at the National University of Singapore. Previously,
he was a researcher at the Institute of Mathematics of the Romanian Academy and has held visiting positions in The Netherlands,
Germany, and Japan. His current research focuses on formal methods in computer science, particularly on process and network
algebras, formal methods for interactive, real-time, and object-oriented systems. Some of his results may be found in his
book on “Network Algebra,” Springer, 2000. 相似文献
4.
Khayri A. M. Ali 《New Generation Computing》1998,16(2):201-221
This paper presents and empirically evaluates a generational real-time garbage collection scheme, which is based on combining
Baker’s real-time scheme with a simple generational scheme by Andrew W. Appel.
Real World Computing Partnership.
Khayri A. M. Ali, Ph.D.: He currently works as Dean of the Faculty of Computer Science at October University for Modern Sciences and Arts, Egypt.
He received his B. Sc. (1970) in Electronics, his M. Sc. (1977) in Automatic Control, both from Egypt. He received his Ph.D.
in Computer Systems from the Royal Institute of Technology, Stockholm, in 1984. His research interests are in developing parallel
and distributed logic, functional, object-oriented, and constraints programming systems. 相似文献
5.
Privacy-preserving SVM classification 总被引:2,自引:2,他引:0
Traditional Data Mining and Knowledge Discovery algorithms assume free access to data, either at a centralized location or
in federated form. Increasingly, privacy and security concerns restrict this access, thus derailing data mining projects.
What is required is distributed knowledge discovery that is sensitive to this problem. The key is to obtain valid results,
while providing guarantees on the nondisclosure of data. Support vector machine classification is one of the most widely used
classification methodologies in data mining and machine learning. It is based on solid theoretical foundations and has wide
practical application. This paper proposes a privacy-preserving solution for support vector machine (SVM) classification,
PP-SVM for short. Our solution constructs the global SVM classification model from data distributed at multiple parties, without
disclosing the data of each party to others. Solutions are sketched out for data that is vertically, horizontally, or even
arbitrarily partitioned. We quantify the security and efficiency of the proposed method, and highlight future challenges.
Jaideep Vaidya received the Bachelor’s degree in Computer Engineering from the University of Mumbai. He received the Master’s and the Ph.D.
degrees in Computer Science from Purdue University. He is an Assistant Professor in the Management Science and Information
Systems Department at Rutgers University. His research interests include data mining and analysis, information security, and
privacy. He has received best paper awards for papers in ICDE and SIDKDD. He is a Member of the IEEE Computer Society and
the ACM.
Hwanjo Yu received the Ph.D. degree in Computer Science in 2004 from the University of Illinois at Urbana-Champaign. He is an Assistant
Professor in the Department of Computer Science at the University of Iowa. His research interests include data mining, machine
learning, database, and information systems. He is an Associate Editor of Neurocomputing and served on the NSF Panel in 2006.
He has served on the program committees of 2005 ACM SAC on Data Mining track, 2005 and 2006 IEEE ICDM, 2006 ACM CIKM, and
2006 SIAM Data Mining.
Xiaoqian Jiang received the B.S. degree in Computer Science from Shanghai Maritime University, Shanghai, 2003. He received the M.C.S. degree
in Computer Science from the University of Iowa, Iowa City, 2005. Currently, he is pursuing a Ph.D. degree from the School
of Computer Science, Carnegie Mellon University. His research interests are computer vision, machine learning, data mining,
and privacy protection technologies. 相似文献
6.
A serial multi-stage classification system for facing the problem of intrusion detection in computer networks is proposed.
The whole decision process is organized into successive stages, each one using a set of features tailored for recognizing
a specific attack category. All the stages employ suitable criteria for estimating the reliability of the performed classification,
so that, in case of uncertainty, information related to a possible attack are only logged for further processing, without
raising an alert for the system manager. This permits to reduce the number of false alarms. On the other hand, in order to
keep low the number of missed detections, the proposed system declares a connection as normal traffic only if all the stages
do not detect an attack. The proposed multi-stage intrusion detection system has been tested on three different services (http, telnet and ftp) of a standard database used for benchmarking intrusion detection systems and also on real network traffic data. The experimental
analysis highlights the effectiveness of the approach: the proposed system behaves significantly better than other multiple
classifier systems performing classification in a single stage.
Luigi Pietro Cordella is a Professor of Computer Science at the Faculty of Engineering of the University of Naples “Federico II” (Italy). He has been Chairman of the Department of Computer Science and Systems and, since 1994, Chairman of the Ph.D. course program in Information Engineering of the University of Naples. His present research interests include Syntactic and Structural Pattern Recognition, Shape Analysis, Document Recognition, OCR, Neural Networks, and Evolutionary Computation. He has published over 150 papers and is editor or co-editor of six books. He is a Fellow of IAPR and a member of IEEE and Computer Society. He has been President of GIRPR (2000–2004), the Italian Association for Pattern Recognition, and member of the Governing Board of the IAPR. Carlo Sansone is Associate Professor of Computer Science at the Faculty of Engineering of the University of Naples “Federico II” (Italy). His research principally focuses on classification techniques, exact and inexact graph matching and multiple-classifier systems theory and applications. He coordinated several projects in the areas of car plate recognition, biomedical images interpretation and network intrusion detection. Prof. Sansone has authored about 90 research papers in international journals and conference proceedings. He serves as referee for many relevant journals in the field of Pattern Recognition and is Associate editor of the Electronic Letters on Computer Vision and Image Analysis journal. He is currently co-editor of a special issue on “Information Fusion in Computer Security” for the Information Fusion journal. 相似文献
Carlo Sansone (Corresponding author)Email: |
Luigi Pietro Cordella is a Professor of Computer Science at the Faculty of Engineering of the University of Naples “Federico II” (Italy). He has been Chairman of the Department of Computer Science and Systems and, since 1994, Chairman of the Ph.D. course program in Information Engineering of the University of Naples. His present research interests include Syntactic and Structural Pattern Recognition, Shape Analysis, Document Recognition, OCR, Neural Networks, and Evolutionary Computation. He has published over 150 papers and is editor or co-editor of six books. He is a Fellow of IAPR and a member of IEEE and Computer Society. He has been President of GIRPR (2000–2004), the Italian Association for Pattern Recognition, and member of the Governing Board of the IAPR. Carlo Sansone is Associate Professor of Computer Science at the Faculty of Engineering of the University of Naples “Federico II” (Italy). His research principally focuses on classification techniques, exact and inexact graph matching and multiple-classifier systems theory and applications. He coordinated several projects in the areas of car plate recognition, biomedical images interpretation and network intrusion detection. Prof. Sansone has authored about 90 research papers in international journals and conference proceedings. He serves as referee for many relevant journals in the field of Pattern Recognition and is Associate editor of the Electronic Letters on Computer Vision and Image Analysis journal. He is currently co-editor of a special issue on “Information Fusion in Computer Security” for the Information Fusion journal. 相似文献
7.
Summary Algorithms for mutual exclusion that adapt to the current degree of contention are developed. Afilter and a leader election algorithm form the basic building blocks. The algorithms achieve system response times that are independent of the total number of processes and governed instead by the current degree of contention. The final algorithm achieves a constant amortized system response time.
Manhoi Choy was born in 1967 in Hong Kong. He received his B.Sc. in Electrical and Electronic Engineerings from the University of Hong Kong in 1989, and his M.Sc. in Computer Science from the University of California at Santa Barbara in 1991. Currently, he is working on his Ph.D. in Computer Science at the University of California at Santa Barbara. His research interests are in the areas of parallel and distributed systems, and distributed algorithms.
Ambuj K. Singh is an Assistant Professor in the Department of Computer Science at the University of California, Santa Barbara. He received a Ph.D. in Computer Science from the University of Texas at Austin in 1989, an M.S. in Computer Science from Iowa State University in 1984, and a B.Tech. from the Indian Institute of Technology at Kharagpur in 1982. His research interests are in the areas of adaptive resource allocation, concurrent program development, and distributed shared memory.A preliminary version of the paper appeared in the 12th Annual ACM Symposium on Principles of Distributed ComputingWork supported in part by NSF grants CCR-9008628 and CCR-9223094 相似文献
8.
Atif M. Memon 《Software Quality Journal》2006,14(4):359-377
Advancement in reusable component technology has had a significant impact on the development of complex graphical user interfaces
(GUIs), which are front-ends to most of today’s software. Software developers can, with very little effort, integrate components
into their software’s GUI. Problems, however, arise when new versions of GUI components replace their predecessors in an implementation.
Often, the inclusion of a new version of a component breaks some part of the software, i.e., tasks that end-users were able
to perform before modifications were made can no longer be performed. Software developers (who also happen to be component
users) are unable to perform adequate regression testing in this context because of several factors, including lack of source
code, environmental side-effects on GUI rendering, event-driven nature of GUIs, and large number of possible permutations
of events. This paper presents a new technique that end-users’ quality assurance (QA) teams can employ to test the new version
of a component in its application context by using the existing version as a baseline. The technique combines lightweight
event-level dynamic profiling to collect user profiles in a transparent manner, GUI reverse engineering to extract the structure
of the component’s GUI, test case execution to replay the collected profiles on the new version, and GUI oracles that collect
properties from the existing version. Empirical studies demonstrate the practicality, usefulness, and limitations of the technique.
Atif M. Memon is an Assistant Professor at the Department of Computer Science, University of Maryland. He received his BS, MS, and Ph.D.
in Computer Science in 1991, 1995, and 2001 respectively. He was awarded a Gold Medal in BS. He was awarded Fellowships from
the Andrew Mellon Foundation for his Ph.D. research. He received the NSF CAREER award in 2005. His research interests include
program testing, software engineering, artificial intelligence, plan generation, reverse engineering, and program structures.
He is a member of the ACM and the IEEE Computer Society. 相似文献
9.
This paper proposes arun-time bytecode specialization (BCS) technique that analyzes programs and generates specialized programs at run-time in an intermediate language. By using
an intermediate language for code generation, a back-end system canoptimize the specialized programs after specialization. The system uses Java virtual machine language (JVML) as the intermediate language, which allows the system to easily achieve
practicalportability and to use existing sophisticated just-in-time (JIT) compilers as its back-end. The binding-time analysis algorithm is based
on a type system, and covers a non-object-oriented subset of JVML. The specializer generates programs on a per-instruction
basis, and can performmethod inlining at run-time. Our performance measurements show that a non-trivial application program specialized at run-time by BCS runs approximately
3–4 times faster than the unspecialized one. Despite the large overhead of JIT compilation of specialized code, we observed
that the overall performance of the application can be improved.
This paper is an extended version of “A Portable Approach to Generating Optimized Specialized Code”, inProceedings of Second Symposium on Programs as Data Objects (PADO-II), Lecture Notes in Computer Science, vol. 2053, pp. 138–154, Aarhus, Denmark, May 2001.23)
Hidehiko Masuhara, D.Sc.: He is an Assistant Professor at Department of Graphics and Computer Science, Graduate School of Arts and Sciences, University
of Tokyo. He received his B.S., M.S. and D.Sc. degrees from Department of Information Science, University of Tokyo in 1992,
1994, and 1999, respectively. His research interests are in programming languages, especially in mechanisms to support flexible
and efficient computation such as dynamic optimization and reflection. He received the best-paper award from Information Processing
Society of Japan in 1996.
Akinori Yonezawa, Ph.D.: He is a Professor of computer science at Department of Computer Science, University of Tokyo. He received Ph.D. in Computer
Science from the Massachusetts Institute of Technology in 1977. His current major research interests are in the areas of concurrent/parallel
computation models, programming languages, object-oriented computing, and distributed computing. He is the designer of an
object-oriented concurrent language ABCL/1 and the editor of several books and served as an associate editor of ACM Transaction
of Programming Languages and Systems (TOPLAS). Since 1998, he has been an ACM Fellow. 相似文献
10.
Jose-Jesus Fernandez Jose-Roman Bilbao-Castro Roberto Marabini Jose-Maria Carazo Inmaculada Garcia 《New Generation Computing》2005,23(1):101-112
The present contribution describes a potential application of Grid Computing in Bioinformatics. High resolution structure
determination of biological specimens is critical in BioSciences to understanding the biological function. The problem is
computational intensive. Distributed and Grid Computing are thus becoming essential. This contribution analyzes the use of
Grid Computing and its potential benefits in the field of electron microscope tomography of biological specimens.
Jose-Jesus Fernandez, Ph.D.: He received his M.Sc. and Ph.D. degrees in Computer Science from the University of Granada, Spain, in 1992 and 1997, respectively.
He was a Ph.D. student at the Bio-Computing unit of the National Center for BioTechnology (CNB) from the Spanish National
Council of Scientific Research (CSIC), Madrid, Spain. He became an Assistant Professor in 1997 and, subsequently, Associate
Professor in 2000 in Computer Architecture at the University of Almeria, Spain. He is a member of the supercomputing-algorithms
research group. His research interests include high performance computing (HPC), image processing and tomography.
Jose-Roman Bilbao-Castro: He received his M.Sc. degree in Computer Science from the University of Almeria in 2001. He is currently a Ph.D. student
at the BioComputing unit of the CNB (CSIC) through a Ph.D. CSIC-grant in conjuction with Dept. Computer Architecture at the
University of Malaga (Spain). His current research interestsinclude tomography, HPC and distributed and grid computing.
Roberto Marabini, Ph.D.: He received the M.Sc. (1989) and Ph.D. (1995) degrees in Physics from the University Autonoma de Madrid (UAM) and University
of Santiago de Compostela, respectively. He was a Ph.D. student at the BioComputing Unit at the CNB (CSIC). He worked at the
University of Pennsylvania and the City University of New York from 1998 to 2002. At present he is an Associate Professor
at the UAM. His current research interests include inverse problems, image processing and HPC.
Jose-Maria Carazo, Ph.D.: He received the M.Sc. degree from the Granada University, Spain, in 1981, and got his Ph.D. in Molecular Biology at the
UAM in 1984. He left for Albany, NY, in 1986, coming back to Madrid in 1989 to set up the BioComputing Unit of the CNB (CSIC).
He was involved in the Spanish Ministry of Science and Technology as Deputy General Director for Research Planning. Currently,
he keeps engaged in his activities at the CNB, the Scientific Park of Madrid and Integromics S.L.
Immaculada Garcia, Ph.D.: She received her B.Sc. (1977) and Ph.D. (1986) degrees in Physics from the Complutense University of Madrid and University
of Santiago de Compostela, respectively. From 1977 to 1987 she was an Assistant professor at the University of Granada, from
1987 to 1996 Associate professor at the University of Almeria and since 1997 she is a Full Professor and head of Dept. Computer
Architecture. She is head of the supercomputing-algorithms research group. Her research interest lies in HPC for irregular
problems related to image processing, global optimization and matrix computation. 相似文献
11.
The rapid growth and penetration of the Internet are now leading us to a world where networks are ubiquitous and everything
is connected. Breaking the distance barrier by the ubiquitous connection, however, is a two-edged sword. Our network infrastructure
today is still fragile and thus “everything is connected” may simply mean “everything can be attacked from whatever place
on the earth.”
In this paper, we first point out the importance and inherent problems of software systems that underlay open and extensible
networks, especially the Internet. We put emphasis on software since software vulnerabilities account for most attacks, incidents,
or even disasters on the Internet today. Next we present general ideas of promising techniques in defense of software systems,
including theoretical, language-based, and runtime solutions. Finally, we show our experience in developing a secure mail
system.
Etsuya Shibayama, D.Sc.: He is a professor of the Graduate School of Information Science and Engineering at Tokyo Institute of Technology. He received
B.Sc. and M.Sc. in mathematical sciences from Kyoto University in 1981 and 1983, respectively, and D.Sc. in information science
from the University of Tokyo in 1991. He is interested in various topics in software including design and implementation of
textual and visual programming languages, system software, and user interface software. Recently, he has been doing research
on language-based software security and methodologies for building secure software.
Akinori Yonezawa, Ph.D.: He is a Professor of computer science at Department of Computer Science, the University of Tokyo. He received his Ph.D. in
Computer Science form the Massachusetts Institute of Technology in 1977. His current major research interests are in the areas
of concurrent/parallel computation models, programming languages, object-oriented computing and distributed computing. He
is the designer of and object-oriented concurrent language ABCL/1 and the editor of several books and served as an associate
editor of ACM Transaction of Programming Language and Systems (TOPLAS). Since 1998, he has been an ACM Fellow. 相似文献
12.
Alvaro A. A. Fernandes M. Howard Williams Norman W. Paton 《New Generation Computing》1997,15(2):205-244
A logic-based approach to the specification of active database functionality is presented which not only endows active databases
with a well-defined and well-understood formal semantics, but also tightly integrates them with deductive databases. The problem
of endowing deductive databases with rule-based active behaviour has been addressed in different ways. Typical approaches
include accounting for active behaviour by extending the operational semantics of deductive databases, or, conversely, accounting
for deductive capabilities by constraining the operational semantics of active databases. The main contribution of the paper
is an alternative approach in which a class of active databases is defined whose operational semantics is naturally integrated
with the operational semantics of deductive databases without either of them strictly subsuming the other. The approach is
demonstrated via the formalization of the syntax and semantics of an active-rule language that can be smoothly incorporated
into existing deductive databases, due to the fact that the standard formalization of deductive databases is reused, rather
than altered or extended. One distinctive feature of the paper is its use of ahistory, as defined in the Kowalski-Sergot event-calculus, to define event occurrences, database states and actions on these. This
has proved to be a suitable foundation for a comprehensive logical account of the concept set underpinning active databases.
The paper thus contributes a logical perspective to the ongoing task of developing a formal theory of active databases.
Alvaro Adolfo Antunes Fernandes, Ph.D.: He received a B.Sc. in Economics (Rio de Janeiro, 1984), an M.Sc. in Knowledge-Based Systems (Edinburgh, 1990) and a Ph.D.
in Computer Science (Heriot-Watt, 1995). He worked as a Research Associate at Heriot-Watt University from December 1990 until
December 1995. In January 1996 he joined the Department of Mathematical and Computing Sciences at Goldsmiths College, University
of London, as a Lecturer. His current research interests include advanced data- and knowledge-base technology, logic programming,
and software engineering.
M. Howard Williams, Ph.D., D.Sc.: He obtained his Ph.D. in ionospheric physics and recently a D.Sc. in Computer Science. He was appointed as the first lecturer
in Computer Science at Rhodes University in 1970. During the following decade he rose to Professor of Computer Science and
in 1980 was appointed as Professor of Computer Science at Heriot-Watt University. From 1980 to 1988 he served as Head of Department
and then as director of research until 1992. He is now head of the Database Research Group at Heriot-Watt University. His
current research interests include active databases, deductive objectoriented databases, spatial databases, parallel databases
and telemedicine.
Norman W. Paton, Ph.D.: He received a B.Sc. in Computing Science from the University of Aberdeen in 1986. From 1986 to 1989 he worked as a Research
Assistant at the University of Aberdeen, receiving a Ph. D. in 1989. From 1989 to 1995 he was a Lecturer in Computer Science
at Heriot-Watt University. Since July 1995, he has been a Senior Lecturer in Department of Computer Science at the University
of Manchester. His current research interests include active databases, deductive object-oriented databases, spatial databases
and database interfaces. 相似文献
13.
R. S. Choraś 《Pattern Recognition and Image Analysis》2007,17(2):259-267
Current technology allows the acquisition, transmission, storing, and manipulation of large collections of images. Content-based
information retrieval is now a widely investigated issue that aims at allowing users of multimedia information systems to
retrieve images coherent with a sample image. A way to achieve this goal is the automatic computation of features such as
color, texture, and shape and the use of these features as query terms.
Feature extraction is a crucial part of any such system. Current methods for feature extraction suffer from two main problems:
firstly, many methods do not retain any spatial information, and secondly, the problem of invariance with respect to standard
transformation is still unsolved.
In this paper, we describe some results of a study on similarity evaluation in image retrieval using shape, texture, and color
as content features. Images are retrieved based on similarity of features, where features of the query specification are compared
with features of the image database to determine which images match similarly with given features.
In this paper, we propose an effective method for image representation which utilizes fuzzy features.
The text was submitted by the author in English.
Ryszard S. Choraś is Professor of Computer Science in the Department of Telecommunications and EE of University of Technology and Agriculture,
Bydgoszcz, Poland. He also holds a courtesy appointment with the Faculty of Mathematics, Technology, and Natural Sciences
of Kazimierz Wielki University, Bydgoszcz and the College of Computer Science, Lódz, Poland. His research interests include
image signal compression and coding, computer vision, and multimedia data transmission. He received his M.S. degree in Electrical
Engineering from Electronics from the Technical University of Wroclaw, Poland in 1973, and his Ph.D. degree in Electronics
from Technical University of Wroclaw, Poland, in 1980, and D.Sc. (Habilitation degree) in Computer Science from Warsaw Technical
University, Poland, in 1993. Until 1973–1976 he was a member of the research staff at the Institute of Mathematical Machines
Silesian Division, Gliwice, working on graphics hardware and human visual perception. In 1976, he joined University of Technology
and Agriculture, Bydgoszcz, Poland, first as an Assistant, then as a Professor of Computer Science at the Department of Telecommunications
and EE. From 1994 to 1996, he was also Professor of Computer Sciences of the Zielona Góra University, Poland. He has served
as the Chairman of the Communication Switching Division and as Chief of the Image Processing and Recognition Group. Until
1996–2002 he was the Vice Rector of University of Technology and Agriculture, Bydgoszcz. Prof. Choraś has an expertise in
EU Programs and National Programs, e.g., he was coordinator of EU Program CME-02060, EU Program on Continuous Education and
Technology Transfer, and coordinator of national programs in IST and multimedia in e-learning. Prof. Choraś has authored two
monographs, and over 130 book chapters, journal articles, and conference papers in the area of image processing. Professor
Choraś is a member of the editorial boards of “Machine Vision and Graphics.” He is the editor-in-chief of “Image Processing
and Communications Journal.” He has served on numerous conference committees, e.g., Visualization, Imaging, and Image Processing
(VIIP), IASTED International Conference on Signal Processing, Pattern Recognition and Applications, International Conference
on Computer Vision and Graphics, ICINCO International Conference on Informatics in Control, Automation and Robotics, ICETE
International Conference on E-business and Telecommunication Networks, and CORES International Conference on Computer Recognition
Systems, and many others. Prof Choraś is a member of the IASTED, WSEAS, various Committees of the Polish Academy of Sciences,
TPO. When not working on academic ventures, Professor Choraś likes to relax with activities such as walking, tennis, and swimming. 相似文献
14.
TEG—a hybrid approach to information extraction 总被引:1,自引:1,他引:1
This paper describes a hybrid statistical and knowledge-based information extraction model, able to extract entities and relations
at the sentence level. The model attempts to retain and improve the high accuracy levels of knowledge-based systems while
drastically reducing the amount of manual labour by relying on statistics drawn from a training corpus. The implementation
of the model, called TEG (trainable extraction grammar), can be adapted to any IE domain by writing a suitable set of rules
in a SCFG (stochastic context-free grammar)-based extraction language and training them using an annotated corpus. The system
does not contain any purely linguistic components, such as PoS tagger or shallow parser, but allows to using external linguistic
components if necessary. We demonstrate the performance of the system on several named entity extraction and relation extraction
tasks. The experiments show that our hybrid approach outperforms both purely statistical and purely knowledge-based systems,
while requiring orders of magnitude less manual rule writing and smaller amounts of training data. We also demonstrate the
robustness of our system under conditions of poor training-data quality.
Ronen Feldman is a senior lecturer at the Mathematics and Computer Science Department of Bar-Ilan University in Israel, and the Director
of the Data Mining Laboratory. He received his B.Sc. in Math, Physics and Computer Science from the Hebrew University, M.Sc.
in Computer Science from Bar-Ilan University, and his Ph.D. in Computer Science from Cornell University in NY. He was an Adjunct
Professor at NYU Stern Business School. He is the founder of ClearForest Corporation, a Boston based company specializing
in development of text mining tools and applications. He has given more than 30 tutorials on next mining and information extraction
and authored numerous papers on these topics. He is currently finishing his book “The Text Mining Handbook” to the published
by Cambridge University Press.
Benjamin Rosenfeld is a research scientist at ClearForest Corporation. He received his B.Sc. in Mathematics and Computer Science from Bar-Ilan
University. He is the co-inventor of the DIAL information extraction language.
Moshe Fresko is finalizing his Ph.D. in Computer Science Department at Bar-Ilan University in Israel. He received his B.Sc. in Computer
Engineering from Bogazici University, Istanbul/Turkey on 1991, and M.Sc. on 1994. He is also an adjunct lecturer at the Computer
Science Department of Bar-Ilan University and functions as the Information-Extraction Group Leader in the Data Mining Laboratory. 相似文献
15.
An experimental investigation of personality types impact on pair effectiveness in pair programming 总被引:1,自引:1,他引:0
Panagiotis Sfetsos Ioannis Stamelos Lefteris Angelis Ignatios Deligiannis 《Empirical Software Engineering》2009,14(2):187-226
In this paper, pair programming is empirically investigated from the perspective of developer personalities and temperaments
and how they affect pair effectiveness. A controlled experiment was conducted to investigate the impact of developer personalities
and temperaments on communication, pair performance and pair viability-collaboration. The experiment involved 70 undergraduate
students and the objective was to compare pairs of heterogeneous developer personalities and temperaments with pairs of homogeneous
personalities and temperaments, in terms of pair effectiveness. Pair effectiveness is expressed in terms of pair performance, measured by communication, velocity, design correctness and passed acceptance tests, and pair collaboration-viability measured by developers’ satisfaction, knowledge acquisition and participation. The results have shown that there is important
difference between the two groups, indicating better communication, pair performance and pair collaboration-viability for
the pairs with heterogeneous personalities and temperaments. In order to provide an objective assessment of the differences
between the two groups of pairs, a number of statistical tests and stepwise Discriminant Analysis were used.
Panagiotis Sfetsos is an Assistant Professor at the Department of Informatics at the Alexander Technological Educational Institute of Thessaloniki, Greece. He received his B.Sc. in Computer Science and Statistics from the University of Uppsala, Sweden (1981), and the Ph.D. degree in Computer Science from the Aristotle University of Thessaloniki (2007). His Ph.D. Thesis was on “Experimentation in Object Oriented Technology and Agile Methods”. His research interests include empirical software evaluation, measurement, testing, quality, agile methods and especially extreme programming. Ioannis G. Stamelos is an Associate Professor of Computer Science at the Aristotle University of Thessaloniki, Dept. of Informatics. He received a degree in Electrical Engineering from the Polytechnic School of Thessaloniki (1983) and the Ph. D. degree in Computer Science from the Aristotle University of Thessaloniki (1988). He teaches object-oriented programming, software engineering, software project management and enterprise information systems at the graduate and postgraduate level. His research interests include empirical software evaluation and management, software education and open source software engineering. He is author of 90 scientific papers and member of the IEEE Computer Society. Lefteris Angelis received his B.Sc. and Ph.D. degree in Mathematics from Aristotle University of Thessaloniki (A.U.Th.). He works currently as an Assistant Professor at the Department of Informatics of A.U.Th. His research interests involve statistical methods with applications in software engineering and information systems, computational methods in mathematics and statistics, planning of experiments and simulation techniques. Ignatios Deligiannis is an Associate Professor at Alexander Technological Education Institute of Thessaloniki, Greece. His main interests are Object-Oriented software methods, and in particular design assessment and measurement. He received his B.Sc. in Computer Science from Lund University, Sweden, in 1979, and then worked for several years in software development at Siemens Telecommunications industry. He was member of ESERG (Empirical Software Engineering Research Group at Bournemouth University, UK). Currently, he is a research partner of Software Engineering Group::Plase laboratory, Aristotle University of Thessaloniki, Greece. 相似文献
Ignatios DeligiannisEmail: |
Panagiotis Sfetsos is an Assistant Professor at the Department of Informatics at the Alexander Technological Educational Institute of Thessaloniki, Greece. He received his B.Sc. in Computer Science and Statistics from the University of Uppsala, Sweden (1981), and the Ph.D. degree in Computer Science from the Aristotle University of Thessaloniki (2007). His Ph.D. Thesis was on “Experimentation in Object Oriented Technology and Agile Methods”. His research interests include empirical software evaluation, measurement, testing, quality, agile methods and especially extreme programming. Ioannis G. Stamelos is an Associate Professor of Computer Science at the Aristotle University of Thessaloniki, Dept. of Informatics. He received a degree in Electrical Engineering from the Polytechnic School of Thessaloniki (1983) and the Ph. D. degree in Computer Science from the Aristotle University of Thessaloniki (1988). He teaches object-oriented programming, software engineering, software project management and enterprise information systems at the graduate and postgraduate level. His research interests include empirical software evaluation and management, software education and open source software engineering. He is author of 90 scientific papers and member of the IEEE Computer Society. Lefteris Angelis received his B.Sc. and Ph.D. degree in Mathematics from Aristotle University of Thessaloniki (A.U.Th.). He works currently as an Assistant Professor at the Department of Informatics of A.U.Th. His research interests involve statistical methods with applications in software engineering and information systems, computational methods in mathematics and statistics, planning of experiments and simulation techniques. Ignatios Deligiannis is an Associate Professor at Alexander Technological Education Institute of Thessaloniki, Greece. His main interests are Object-Oriented software methods, and in particular design assessment and measurement. He received his B.Sc. in Computer Science from Lund University, Sweden, in 1979, and then worked for several years in software development at Siemens Telecommunications industry. He was member of ESERG (Empirical Software Engineering Research Group at Bournemouth University, UK). Currently, he is a research partner of Software Engineering Group::Plase laboratory, Aristotle University of Thessaloniki, Greece. 相似文献
16.
17.
We propose a new encryption algorithm relying on reversible cellular automata (CA). The behavior complexity of CA and their
parallel nature makes them interesting candidates for cryptography. The proposed algorithm belongs to the class of symmetric
key systems.
Marcin Seredynski: He is a Ph.D. student at University of Luxembourg and Polish Academy of Sciences. He received his M.S. in 2004 from Faculty
of Electronics and Information Technology in Warsaw University of Technology. His research interests include cryptography,
cellular automata, nature inspired algorithms and network security. Currently he is working on intrusion detection algorithms
for ad-hoc networks.
Pascal Bouvry, Ph.D.: He earned his undergraduate degree in Economical & Social Sciences and his Master degree in Computer Science with distinction
(’91) from the University of Namur, Belgium. He went on to obtain his Ph.D. degree (’94) in Computer Science with great distinction
at the University of Grenoble (INPG), France. His research at the IMAG laboratory focussed on Mapping and scheduling task
graphs onto Distributed Memory Parallel Computers. Next, he performed post-doctoral researches on coordination languages and
multi-agent evolutionary computing at CWI in Amsterdam. He gained industrial experience as manager of the technology consultant
team for FICS in the banking sector (Brussels, Belgium). Next, he worked as CEO and CTO of SDC (Ho Chi Minh city, Vietnam)
in the telecom, semi-conductor and space industry. After that, He moved to Montreal Canada as VP Production of Lat45 and Development
Director for MetaSolv Software in the telecom industry. He is currently serving as Professor in the group of Computer Science
and Communications (CSC) of the Faculty of Sciences, Technology and Communications of Luxembourg University and he is heading
the Intelligent & Adaptive Systems lab. His current research interests include: ad-hoc networks & grid-computing, evolutionary
algorithms and multi-agent systems. 相似文献
18.
Wilfred Ng Wai-Yeung Lam Peter T. Wood Mark Levene 《Knowledge and Information Systems》2006,10(4):421-452
XML has already become the de facto standard for specifying and exchanging data on the Web. However, XML is by nature verbose and thus XML documents are usually large in size, a factor that hinders its practical usage, since it substantially increases the costs of storing, processing, and exchanging data. In order to tackle this problem, many XML-specific compression systems, such as XMill, XGrind, XMLPPM, and Millau, have recently been proposed. However, these systems usually suffer from the following two inadequacies: They either sacrifice performance in terms of compression ratio and execution time in order to support a limited range of queries, or perform full decompression prior to processing queries over compressed documents.In this paper, we address the above problems by exploiting the information provided by a Document Type Definition (DTD) associated with an XML document. We show that a DTD is able to facilitate better compression as well as generate more usable compressed data to support querying. We present the architecture of the XCQ, which is a compression and querying tool for handling XML data. XCQ is based on a novel technique we have developed called DTD Tree and SAX Event Stream Parsing (DSP). The documents compressed by XCQ are stored in Partitioned Path-Based Grouping (PPG) data streams, which are equipped with a Block Statistics Signature (BSS) indexing scheme. The indexed PPG data streams support the processing of XML queries that involve selection and aggregation, without the need for full decompression. In order to study the compression performance of XCQ, we carry out comprehensive experiments over a set of XML benchmark datasets.
Wilfred Ng obtained his M.Sc.(Distinction) and Ph.D. degrees from the University of London. His research interests are in the areas of databases and information Systems, which include XML data, database query languages, web data management, and data mining. He is now an assistant professor in the Department of Computer Science, the Hong Kong University of Science and Technology (HKUST). Further Information can be found at the following URL: .
Wai-Yeung Lam obtained his M.Phil. degree from the Hong Kong University of Science and Technology (HKUST) in 2003. His research thesis was based on the project “XCQ: A Framework for Querying Compressed XML Data.” He is currently working in industry.
Peter Wood received his Ph.D. in Computer Science from the University of Toronto in 1989. He has previously studied at the University of Cape Town, South Africa, obtaining a B.Sc. degree in 1977 and an M.Sc. degree in Computer Science in 1982. Currently he is a senior lecturer at Birkbeck and a member of the Information Management and Web Technologies research group. His research interests include database and XML query languages, query optimisation, active and deductive rule languages, and graph algorithms.
Mark Levene received his Ph.D. in Computer Science in 1990 from Birkbeck College, University of London, having previously been awarded a B.Sc. in Computer Science from Auckland University, New Zealand in 1982. He is currently professor of Computer Science at Birkbeck College, where he is a member of the Information Management and Web Technologies research group. His main research interests are Web search and navigation, Web data mining and stochastic models for the evolution of the Web. He has published extensively in the areas of database theory and web technologies, and has recently published a book called ‘An Introduction to Search Engines and Web Navigation’. 相似文献
19.
A range query finds the aggregated values over all selected cells of an online analytical processing (OLAP) data cube where
the selection is specified by the ranges of contiguous values for each dimension. An important issue in reality is how to
preserve the confidential information in individual data cells while still providing an accurate estimation of the original
aggregated values for range queries. In this paper, we propose an effective solution, called the zero-sum method, to this
problem. We derive theoretical formulas to analyse the performance of our method. Empirical experiments are also carried out
by using analytical processing benchmark (APB) dataset from the OLAP Council. Various parameters, such as the privacy factor
and the accuracy factor, have been considered and tested in the experiments. Finally, our experimental results show that there
is a trade-off between privacy preservation and range query accuracy, and the zero-sum method has fulfilled three design goals:
security, accuracy, and accessibility.
Sam Y. Sung is an Associate Professor in the Department of Computer Science, School of Computing, National University of Singapore. He
received a B.Sc. from the National Taiwan University in 1973, the M.Sc. and Ph.D. in computer science from the University
of Minnesota in 1977 and 1983, respectively. He was with the University of Oklahoma and University of Memphis in the United
States before joining the National University of Singapore. His research interests include information retrieval, data mining,
pictorial databases and mobile computing. He has published more than 80 papers in various conferences and journals, including
IEEE Transaction on Software Engineering, IEEE Transaction on Knowledge & Data Engineering, etc.
Yao Liu received the B.E. degree in computer science and technology from Peking University in 1996 and the MS. degree from the Software
Institute of the Chinese Science Academy in 1999. Currently, she is a Ph.D. candidate in the Department of Computer Science
at the National University of Singapore. Her research interests include data warehousing, database security, data mining and
high-speed networking.
Hui Xiong received the B.E. degree in Automation from the University of Science and Technology of China, Hefei, China, in 1995, the
M.S. degree in Computer Science from the National University of Singapore, Singapore, in 2000, and the Ph.D. degree in Computer
Science from the University of Minnesota, Minneapolis, MN, USA, in 2005. He is currently an Assistant Professor of Computer
Information Systems in the Management Science & Information Systems Department at Rutgers University, NJ, USA. His research
interests include data mining, databases, and statistical computing with applications in bioinformatics, database security,
and self-managing systems. He is a member of the IEEE Computer Society and the ACM.
Peter A. Ng is currently the Chairperson and Professor of Computer Science at the University of Texas—Pan American. He received his Ph.D.
from the University of Texas–Austin in 1974. Previously, he had served as the Vice President at the Fudan International Institute
for Information Science and Technology, Shanghai, China, from 1999 to 2002, and the Executive Director for the Global e-Learning
Project at the University of Nebraska at Omaha, 2000–2003. He was appointed as an Advisory Professor of Computer Science at
Fudan University, Shanghai, China in 1999. His recent research focuses on document and information-based processing, retrieval
and management. He has published many journal and conference articles in this area. He had served as the Editor-in-Chief for
the Journal on Systems Integration (1991–2001) and as Advisory Editor for the Data and Knowledge Engineering Journal since
1989. 相似文献
20.
The aim of this paper is to extend theConstructive Negation technique to the case ofCLP(SεT), a Constraint Logic Programming (CLP) language based on hereditarily (and hybrid) finite sets. The challenging aspects of the problem originate from the fact
that the structure on whichCLP(SεT) is based is notadmissible closed, and this does not allow to reuse the results presented in the literature concerning the relationships betweenCLP and constructive negation.
We propose a new constraint satisfaction algorithm, capable of correctly handling constructive negation for large classes
ofCLP(SεT) programs; we also provide a syntactic characterization of such classes of programs. The resulting algorithm provides a novel
constraint simplification procedure to handle constructive negation, suitable to theories where unification admits multiple
most general unifiers. We also show, using a general result, that it is impossible to construct an interpreter forCLP(SεT) with constructive negation which is guaranteed to work for any arbitrary program; we identify classes of programs for which
the implementation of the constructive negation technique is feasible.
Agostino Dovier, Ph.D.: He is a researcher in the Department of Science and Technology at the University of Verona, Italy. He obtained his master
degree in Computer Science from the University of Udine, Italy, in 1991 and his Ph.D. in Computer Science from the University
of Pisa, Italy, in 1996. His research interests are in Programming Languages and Constraints over complex domains, such as
Sets and Multisets. He has published over 20 research papers in International Journals and Conferences. He is teaching a course
entitled “Special Languages and Techniques for Programming” at the University of Verona.
Enrico Pontelli, Ph.D.: He is an Assistant Professor in the Department of Computer Science at the New Mexico State University. He obtained his Laurea
degree from the University of Udine (Italy) in 1991, his Master degree from the University of Houston in 1992, and his Ph.D.
degree from New Mexico State University in 1997. His research interests are in Programming Languages, Parallel Processing,
and Constraint Programming. He has published over 50 papers and served on the program committees of different conferences.
He is presently the Associate Director of the Laboratory for Logic, Databases, and Advanced Programming.
Gianfranco Rossi, Ph.D.: He received his degree in Computer Science from the University of Pisa in 1979. From 1981 to 1983 he was employed at Intecs
Co. System House in Pisa. From November 1983 to February 1989 he was a researcher at the Dipartimento di Informatica of the
University of Turin. Since March 1989 he is an Associate Professor of Computer Science, currently with the University of Parma.
He is the author of several papers dealing mainly with programming languages, in particular logic programming languages and
Prolog, and extended unification algorithms. His current research interests are (logic) programming languages with sets and
set unification algorithms. 相似文献