th This publication comprises the proceedings of the 29 International Conference on Conceptual Modeling (ER 2010), which was held this year in Vancouver, British Columbia, Canada. Conceptual modeling can be considered...
详细信息
ISBN:
(数字)9783642163739
ISBN:
(纸本)9783642163722
th This publication comprises the proceedings of the 29 International Conference on Conceptual Modeling (ER 2010), which was held this year in Vancouver, British Columbia, Canada. Conceptual modeling can be considered as lying at the confluence of the three main aspects of information technology applications –– the world of the stakeholders and users, the world of the developers, and the technologies available to them. C- ceptual models provide abstractions of various aspects related to the development of systems, such as the application domain, user needs, database design, and software specifications. These models are used to analyze and define user needs and system requirements, to support communications between stakeholders and developers, to provide the basis for systems design, and to document the requirements for and the design rationale of developed systems. Because of their role at the junction of usage, development, and technology, c- ceptual models can be very important to the successful development and deployment of IT applications. Therefore, the research and development of methods, techniques, tools and languages that can be used in the process of creating, maintaining, and using conceptual models is of great practical and theoretical importance. Such work is c- ducted in academia, research institutions, and industry. Conceptual modeling is now applied in virtually all areas of IT applications, and spans varied domains such as organizational information systems, systems that include specialized data for spatial, temporal, and multimedia applications, and biomedical applications.
The problem of k-nearest neighbor (k-NN) search is a fundamental problem to find the exact k nearest neighbor points for a user-given query point q in a d-dimensional large dataset D with n points, and the approximate...
详细信息
The problem of k-nearest neighbor (k-NN) search is a fundamental problem to find the exact k nearest neighbor points for a user-given query point q in a d-dimensional large dataset D with n points, and the approximate k-NN (k-ANN) search problem is to find the approximate k-NN. Both are extensively studied to support real applications. Among all approaches, the graph-based approaches have been seen as the best to support k-NN/ANN in recent studies. The state-of-the-art graph-based approach, τ-MG, finds 1-NN, \(\bar{p}_1\), over a graph index Gτ constructed for D based on a predetermined parameter τ where the distance between \(\bar{p}_1\) and q is less than τ, and finds k-ANN based on the approach taken for 1-NN. There are some main issues in τ-MG and other graph-based approaches. One is that it is difficult to predetermine τ which can ensure to find 1-NN and can do it efficiently. This is because the accuracy/efficiency is related to the size of the graph index Gτ constructed. To achieve high accuracy is at the expense of efficiency. In addition, like all the other existing graph-based approaches, it does not have a theoretical guarantee to ensure k-NN for the same reason to use the same graph index, Gτ, for both 1-NN and k-NN (k > 1).In this paper, we propose a new graph-based approach for k-NN with a theoretical guarantee. We construct a labeled graph, \(\mathcal {G}\), and we do not need to predetermine τ. Instead, we find 1-NN over a subgraph, \(\mathcal {G}_{\dot{\tau }}\), of \(\mathcal {G}\), virtually constructed in a dynamic manner. Here, \(\dot{\tau }\) we use is query-dependent and can be smaller than τ, and the subgraph \(\mathcal {G}_{\dot{\tau }}\) is smaller than Gτ when \(\dot{\tau } = \tau\). We find k-NN in two phases. In the navigation phase, we find 1-NN, \(\bar{p}_1\), of q over \(\mathcal {G}_{\dot{\tau }}\). In the second refinement phase, for k > 1, we explore the neighbors within the vicinity region of \(\bar{p}_1\) in \(\mathcal {G}\). Bas
This volume contains all papers presented at SSPR 2002 and SPR 2002 hosted by the University of Windsor, Windsor, Ontario, Canada, August 6-9, 2002. This was the third time these two workshops were held back-to-back. ...
详细信息
ISBN:
(数字)9783540706595
ISBN:
(纸本)9783540440116
This volume contains all papers presented at SSPR 2002 and SPR 2002 hosted by the University of Windsor, Windsor, Ontario, Canada, August 6-9, 2002. This was the third time these two workshops were held back-to-back. SSPR was the ninth International Workshop on Structural and Syntactic Pattern Recognition and the SPR was the fourth International Workshop on Statis- cal Techniques in Pattern Recognition. These workshops have traditionally been held in conjunction with ICPR (International Conference on Pattern Recog- tion), and are the major events for technical committees TC2 and TC1, resp- tively, of the International Association of Pattern Recognition (IAPR). The workshops were held in parallel and closely coordinated. This was an attempt to resolve the dilemma of how to deal, in the light of the progressive specialization of pattern recognition, with the need for narrow-focus workshops without further fragmenting the ?eld and introducing yet another conference that would compete forthe time and resources of potential participants. A total of 116 papers were received from many countries with the submission and reviewingprocesses beingcarried out separately for each workshop. A total of 45 papers were accepted for oral presentation and 35 for posters. In addition four invited speakers presented informative talks and overviews of their research. They were: Tom Dietterich, Oregon State University, USA Sven Dickinson, the University of Toronto, Canada Edwin Hancock, University of York, UK Anil Jain, Michigan State University, USA SSPR 2002 and SPR 2002 were sponsored by the IAPR and the University of Windsor.
As Moore’s law continues to unfold, two important trends have recently emerged. First, the growth of chip capacity is translated into a corresponding increase of number of cores. Second, the parallelization of the co...
详细信息
ISBN:
(数字)9781441967787
ISBN:
(纸本)9781441967770;9781489993151
As Moore’s law continues to unfold, two important trends have recently emerged. First, the growth of chip capacity is translated into a corresponding increase of number of cores. Second, the parallelization of the computation and 3D integration technologies lead to distributed memory architectures.
This book describes recent research that addresses urgent challenges in many-core architectures and application mapping. It addresses the architectural design of many core chips, memory and data management, power management, design and programming methodologies. It also describes how new techniques have been applied in various industrial case studies.
For over three decades now, silicon capacity has steadily been doubling every year and a half with equally staggering improvements continuously being observed in operating speeds. This increase in capacity has allowed...
详细信息
ISBN:
(数字)9780387354989
ISBN:
(纸本)9780792377313;9781475710144
For over three decades now, silicon capacity has steadily been doubling every year and a half with equally staggering improvements continuously being observed in operating speeds. This increase in capacity has allowed for more complex systems to be built on a single silicon chip. Coupled with this functionality increase, speed improvements have fueled tremendous advancements in computing and have enabled new multi-media applications. Such trends, aimed at integrating higher levels of circuit functionality are tightly related to an emphasis on compactness in consumer electronic products and a widespread growth and interest in wireless communications and products. These trends are expected to persist for some time as technology and design methodologies continue to evolve and the era of systems on a Chip has definitely come of age. While technology improvements and spiraling silicon capacity allow designers to pack more functions onto a single piece of silicon, they also highlight a pressing challenge for system designers to keep up with such amazing complexity. To handle higher operating speeds and the constraints of portability and connectivity, new circuit techniques have appeared. Intensive research and progress in EDA tools, design methodologies and techniques is required to empower designers with the ability to make efficient use of the potential offered by this increasing silicon capacity and complexity and to enable them to design, test, verify and build such systems.
After two decades, data processing has finally, and probably forever, found its niche among civil engineering and construction (CEC) professionnals, through word processors, digitizing tables, management software, and...
详细信息
ISBN:
(数字)9781468474046
ISBN:
(纸本)9781850912538
After two decades, data processing has finally, and probably forever, found its niche among civil engineering and construction (CEC) professionnals, through word processors, digitizing tables, management software, and increasingly via drawing software and computer-aided design (CAD), recently, robots have even started invading work sites. What are the main trends of CAD and robotics in the field of architecture and civil enginee ring? What type of R&D effort do university and industrial laboratories undertake to devise the professional software that will be on the market in the next three to five years? These are the issues which will be addressed during this symposium. To this effect, we have planned concurrently an equipment and software show, as well as a twofold conference. Robotic is just starting in the field of civil engineering and construction. A pioneer, the Civil Engineering Departement of Carnegie-Mellon University, in the United States, organized the first two international symposia, in 1984 and 1985 in Pittsburgh. This is the third meeting on the subject (this year, however, we have also included CAD). It constitutes the first large international symposium where CAD experts, specialists in architecture and CEC robotics will meet. From this standpoint, it should be an ideal forum for exchanging views and expe riences on a wide range of topics, and we hope it will give rise to novel applications and new syntheses. This symposium is intented for scientists, teachers, students and also for manufacturers and all CEC professionals.
VLSI 2010 Annual Symposium will present extended versions of the best papers presented in ISVLSI 2010 conference. The areas covered by the papers will include among others: Emerging Trends in VLSI, Nanoelectronics, M...
详细信息
ISBN:
(数字)9789400714885
ISBN:
(纸本)9789400714878;9789400737624
VLSI 2010 Annual Symposium will present extended versions of the best papers presented in ISVLSI 2010 conference. The areas covered by the papers will include among others: Emerging Trends in VLSI, Nanoelectronics, Molecular, Biological and Quantum Computing. MEMS, VLSI Circuits and systems, Field-programmable and Reconfigurable systems, System Level Design, System-on-a-Chip Design, Application-Specific Low Power, VLSI System Design, System Issues in Complexity, Low Power, Heat Dissipation, Power Awareness in VLSI Design, Test and Verification, Mixed-Signal Design and Analysis, Electrical/Packaging Co-Design, Physical Design, Intellectual property creating and sharing.
This volume contains the proceedings of EuroGP 2000, the European Conf- ence on Genetic Programming, held in Edinburgh on the 15th and 16th April 2000. This event was the third in a series which started with the two E...
详细信息
ISBN:
(数字)9783540462392
ISBN:
(纸本)9783540673392
This volume contains the proceedings of EuroGP 2000, the European Conf- ence on Genetic Programming, held in Edinburgh on the 15th and 16th April 2000. This event was the third in a series which started with the two European workshops: EuroGP’98, held in Paris in April 1998, and EuroGP’99, held in Gothenburg in May 1999. EuroGP 2000 was held in conjunction with EvoWo- shops 2000 (17th April) and ICES 2000 (17th-19th April). Genetic Programming (GP) is a growing branch of Evolutionary Compu- tion in which the structures in the population being evolved are computer p- grams. GP has been applied successfully to a large number of di?cult problems like automatic design, pattern recognition, robotic control, synthesis of neural networks, symbolic regression, music and picture generation, biomedical app- cations, etc. In recent years,even human-competitive results have been achieved by a number of groups. EuroGP 2000, the ?rst evolutionary computation conference of the new m- lennium, was the biggest event devoted to genetic programming to be held in Europe in 2000. It was a high quality conference where state-of-the-art work on the theory of GP and applications of GP to real world problems was presented.
暂无评论