Design and Implementation of Business Logic Layer Object-Oriented Design versus Relational Design

Size: px
Start display at page:

Download "Design and Implementation of Business Logic Layer Object-Oriented Design versus Relational Design"

Transcription

1 Design and Ipleentation of Business Logic Layer Object-Oriented Design versus Relational Design Ali Alharthy Faculty of Engineering and IT University of Technology, Sydney Sydney, Australia Eail: Abstract Object-oriented prograing has becoe one of the ainstrea prograing paradigs in software engineering, whereas relational odels are predoinant in coercial data processing applications. There is strong copetition between these odels for doinance in the building of odern applications, especially after the eergence and spread of object-relational apping technology. This paper addresses the question of whether the object-oriented approach is better than the traditional approach in ters of flexibility with respect to changing requireents. Keywords-object-oriented design; relational design; requireent changes; aintenance I. INTRODUCTION Currently, ost business logic layers of odern applications are constructed using either an object-oriented odel or a relational odel. The object-oriented odel is based on software engineering principles such as coupling, inheritance, cohesion, and encapsulation, whereas the relational odel is based on predicate logic and set theory principles [1]. The object-oriented odel chains the building of applications within objects that have both data and behavior. The relational odel supports the storage of data in tables and the treatent of that data with data anipulation language within the database through stored procedures and externally through structured query language. The relational odel is currently used in any database systes [1]. Object-oriented technology is also coonly used in database application developent. The difference between the two technologies is called the object-relational ipedance isatch [2][3]. In particular, when objects need to be stored in a relational database, object-relational apping (ORM) appears to play an iportant role in overcoing the proble of ipedance isatch. ORM is a new technology that allows applications to access relational data in an object-oriented anner [4][5]. With the widespread use of ORM technology, doain objects are built as objects, and the application logic anipulates these objects in a pure object-oriented anner. The critical issue that arises is whether such an object-oriented odel for business logic layers is a good choice in general. Proponents of the object-oriented approach have tended to assue that an object-oriented business odel will ake the syste easier to aintain, easier to extend, and easier to reuse. The object-oriented approach has been advocated as a tool for iproving developer productivity and software quality [6][7]. Moreover, it has been suggested that developent using object-oriented prograing enhances productivity by siplifying understandability, progra design, and aintenance in coparison to traditional approaches [8].These studies have aintained that using the object-oriented approach would help reduce the aintenance cost of software. However, there are few coplete experiental results that support the clai that there is an advantage in the aintainability of progras developed with the object-oriented approach over those developed with traditional approaches [7][9]. The objective of this paper is to extend this body of knowledge by critically exaining this assuption and to carefully copare the applicability and flexibility of the object-oriented syste to those of the relational syste. The findings fro this project will be significant for practical applications in which the business logic layer is ipleented in an object-oriented fashion, which is a growing trend in enterprise coputing. The rest of the paper is organised as follows. Section II presents the otivation for the study. Section III outlines the investigation ethod. Sections IV, V, VI, and VII present the case studies, and Section VIII reports the experiental results. Section IX concludes the paper. II. MOTIVATION Today, changing requireents have becoe a fact of life for software developers. Many studies have shown that changes in software were one of the reasons why various projects failed. For exaple, a study by the Standish Group found that only 37% of inforation technology projects are considered successes and that 21% of projects are considered failures [10]. The reaining 42% are considered challenged defined as late, over budget, or having failed to eet expectations. Requireent changes are the ajor cause of this phenoenon. Such changes can occur during the developent and aintenance phase in order to accoodate user and business requireents. Therefore, there is a need to identify a flexible approach that can deal with requireent changes. However, ORM is very popular and widely used. According to Russell [3], in order to access data stored in relational databases, ost odern applications are built using ORM technology rather than the traditional approach. 74

2 It has also been argued that using ORM tools can help reduce project costs. Moreover, proponents of the object-oriented approach have tended to assue that an object-oriented business odel will ake the syste easier to aintain, easier to extend, and easier to reuse. On the other hand, proponents of the traditional approach have argued that not all the world ust be handled in objects. In addition, they have aintained that there is soe native incopatibility between ORM code and databases. They also aintain that although object-oriented developent proises to reduce aintenance effort, these proises are not based on reliable experientation [11]. Indeed, there is a significant lack of research on whether the object-oriented approach is better than the traditional approach in ters of flexibility in the face of requireent changes. III. INVESTIGATION MHOD The investigation is perfored using a nuber of case studies and by introducing a variety of requireent changes in order to evaluate how the two approaches cope with the. For the ipleentation, we used Java Database Connectivity (JDBC), a representative relational syste, and, a representative ORM fraework, as well as MYSQL, a relational database. All of these are popular open-source products. In order to easure the overall ipleentation effort associated with JDBC and due to new/changed requireents, we used the code size produced in the copletion of a task the code size was easured in lines of code and takes into account lines added, odified, and deleted as well as the tie required to coplete a task. To easure the code size, we used a free tool to copare the source code files after each ipleentation. The case studies ipleentation has been done by a developer who has six years experience in Web and Database applications developent. IV. FIRST CASE STUDY We chose a siple case study to ake an initial coparison of the effort involved in ipleenting the two technological approaches and changing the in response to requireent changes. A. Proble stateent A copany requires a Car Park application to aintain inforation about eployees and their parking perits. The car park has a nuber of parking spots, which are divided into three areas: A, B, and C. Eployees who want a perit have to pay a fee on a quarterly basis, which will be autoatically deducted fro their salary. The purpose of the Car Park application is to help the car park anager process the eployees' applications for parking perits. Each eployee has an ID, a nae, and a phone extension. Each perit has a perit nuber, the car's registration nuber, and the section where the car can be parked. An eployee can have at ost two perits. Eployees ay change their extension in the course of their eployent. When eployees get a new car and want to use it instead of the old one, they have to discontinue the current perit and apply for a new one. B. Coparison of the findings of the initial construction of the two approaches TABLE I. Progra Files SLOC CPSyste.java 141 Perit.java 47 Eployee.java Util.java 16 4 h 30 Eployee.hb.xl 17 in Perit.hb.xl cfg.xl 18 Total 300 JDBC CPSyste.java h Table I suarises the findings of the initial construction of the Car Park syste using the two approaches. The table shows that even though there are no significant differences between the two approaches with respect to the effort easured by size of source code, the approach took ore tie than the JDBC approach. In fact, with we had to deal with six files, whereas with JDBC we had to deal with only one file. Therefore, the approach took about 4.3 h, copared to 3 h for JDBC. C. Ipact of requireent changes on the two approaches Because requireents change frequently in practice, it is useful to see how different approaches cope with requireent changes. For the initial investigation regarding requireent changes, we ade the following change: in the Terinate Perit use case, instead of deleting the perit (as we did before), we labelled the perit as terinated. D. Coparison of findings after first requireent change Progr a TABLE II. FIRST REQUIREMENT CHANGE Files V1 V2 A M D S CPS.java Perit.java Ep.java Ep.hb.xl Per.hb.xl Hiber.cfg.xl HiberUtil.java Total JDBC CPSy.java in 10 in V1 = before the change; V2 = after the change; A = add; M = odify; D = delete; S = suation of A,M, and D; = estiated tie 75

3 As Table II shows, there are significant differences between the two approaches with respect to the ipleentation effort easured by the size of the source code. The ipleentation of the new requireent changes with required a total of 25 lines of code, copared to only 3 lines of code using JDBC. In addition, the ipleentation of the new requireent changes with took about 40 in, whereas it took only 3 in with JDBC. Indeed, it is evident that JDBC offered ore flexibility with regard to both tie and effort. E. Further ipact of requireent changes on the two approaches For the second requireent change, suppose a copany needs to distinguish between full-tie and part-tie eployees. Part-tie eployees are paid an hourly rate, whereas full-tie eployees are assigned a salary. Pro gra JD BC TABLE III. SECOND REQUIREMENT CHANGE Files V1 V2 A M D S CPS.java Perit.java Ep.java PartTie.java FullTie.java Ep.hb.xl Per.hb.xl Hiber.cfg.xl HiberUtil.java Total CPSy.java h 20 in As Table III shows, the new requireents have had a greater ipact on the progra ipleented through, in ters of both the tie and the effort required to ipleent these changes. The ipleentation of the new requireent changes with required a total of 55 lines of code, in contrast to JDBC, which required only 16 lines. This difference represents a nearly 3:1 ratio in quantity of code. Although one of the key benefits of inheritance is iniising the aount of duplicate code in an application by sharing coon code aongst several subclasses, the ajority of new code is due to inheritance code. Moreover, the ipleentation with took about 1 h, copared to only 20 using JDBC. As a result, increasing the nuber of classes that need to be persisted autoatically can lead to increased levels of effort and tie. V. SECOND CASE STUDY We ade the second case study ore coplicated than the first in order to produce ore statistics with which to copare the two approaches. We also ade changes that reflect the change in business policy, that is, allowing ore than one kind of ite to be stored at a shelf location. This change in policy required a change in the structure of the classes. It will provide ore data with which to copare the two approaches. F. Proble stateent A database is needed to aintain inforation about the ites stored in various warehouses of a copany. Design a relational database, which can store the inforation contained the following: 1. Each warehouse has a phone (not shown) to contact the staff at the warehouse. 2. Shelf locations are of two types: single access and double access. 3. The present policies require that each shelf location, at any tie, can be used to store only one kind of ite. TABLE IV. Progra Files SLOC PartInWareHouse.java 141 Part.java 30 Warehouse.java 31 ShelfLocation.java 45 ShelfLocationPK.java 37 Util.java 16 Warehouse.hb.xl 12 Part.hb.xl 13 ShelfLocation.hb.xl 15.cfg.xl 18 Total JDBC PartInWareHouse.java h Table IV suarises the findings for ipleenting the Parts in Warehouses syste with the two approaches. required a total of 358 lines of code, in contrast to JDBC, which required 202 lines. In addition, required about 4 h, whereas JDBC required 2.3 h. clearly required ore effort and tie than JDBC. G. Ipact of requireent changes on the two approaches The storage rules change to allow ore than one kind of ite to be stored at a shelf location. This entails that the cardinality relationship between the two entities Shelf Location and Ites ust be changed to one-to-any. H. Coparison of the findings after first requireent change As shown in Table V, the new requireents have had a greater ipact on the progra ipleented through, in ters of both the tie and the effort required to ipleent these changes. The ipleentation of the new requireent changes with required a total of 139 lines of code, in contrast to JDBC, which required only 38. This difference represents a nearly 4:1 ratio in quantity of code. Indeed, the source of increase in code quantity was due to the addition of an ite class with its coposite key, which 58 4 h 76

4 is not necessary in JDBC. Moreover, the ipleentation with took about 1.30 h, copared to only 30 in with JDBC. Pro gra JDB C TABLE V. FIRST REQUIREMENT CHANGE Files V1 V2 A M D S WHouse.java Part.java Whouse.java SLoc.java SLocPK.java Ite.java ItePK.java HibUtil.java Who.hb.xl Part.hb.xl SLo.hb.xl Ite.hb.xl Hiber.cfg.xl Total WHouse.java h 40 in TABLE VI. Progra Files SLOC SOSyste.java 86 Custoer.java 22 Order.java 47 Product.java 41 Util.java 16 Custoer.hb.xl 10 Order.hb.xl 15 Product.hb.xl 12.cfg.xl 19 Total JDBC SOSyste.java h K. Ipact of requireent changes on the two approaches We changed the navigation rule between the objects fro unidirectional to bidirectional association. TABLE VII h VI. THIRD CASE STUDY: ISSUE OF RELATIONAL REPRESENTATION/NAVIGATION The representation of the relationship is a fundaental issue. In fact, the difference between hierarchy, network, relational, and object-oriented databases is the way in which the relationship is represented. Therefore, if we construct the application with JDBC, we will not experience the navigation proble, whereas the proble arises when the application is constructed with ORM. Thus, we have to decide how to represent the navigation objects. I. Proble stateent A distribution copany supplies various kinds of products to custoers on a daily basis according to the standing orders placed by the custoers. The copany wants to set up a syste to aintain inforation about the products that the copany can supply, its custoers, and the standing orders. J. Coparison of the findings of the initial construction of the two approaches Table VI suarises the findings for ipleenting the Standing Order syste with the two approaches. required a total of 268 lines of code, in contrast to JDBC, which required 141. In addition, required about 3 h, whereas JDBC required 2 h. Thus, required ore effort and tie than JDBC. Prog ra File Nae V1 V2 A M D S SOSys.java Cust.java Order.java Product.java Htil.java Cu.hb.xl in Or.hb.xl Pr.hb.xl Hib.cfg.xl Total JDBC SOSys.java As Table VII shows, the new requireents have had a greater ipact on the progra ipleented through, in ters of both the tie and the effort required to ipleent these changes. The ipleentation of the new requireent changes with required a total of 28 lines of code and 30 in, in contrast JDBC, which did not require any changes, because navigation is not an issue for it. VII. FOURTH CASE STUDY We ade this case study even ore coplicated and realistic in order to produce uch ore statistical data with which to copare the two approaches. The case study also highlights the issue of relationship representation and illustrates that the object-oriented approach is ore sensitive to the class odel than the relational odel. 77

5 L. Proble stateent Eastern Suburb Gynastics (ESG) is a regional organisation that is responsible for running copetitions between the gynastics clubs in eastern suburbs of Melbourne. The copetitions are organised into seasons. ESG needs a syste to help organise and aintain the records of the copetitions that take place in a single season. The syste, in essence, needs to store inforation on the gynasts, their clubs, the organisation of the copetitions, and the copetition results. M. Coparison of the findings of the initial construction of the two approaches TABLE VIII. Progra File SLOC GScoringSyste 237 Club 44 Copetition 24 CopetitionPk 35 Division 60 EventPk 46 Event 37 EventType 58 Gynast 60 Judge 40 Meet 52 TeaPk 46 Tea 33 Score 22 Util 16 Club.hb.xl 13 Copetition.hb.xl 12 Division.hb.xl 15 Event.hb.xl 21 EventType.hb.xl 14 Gynast.hb.xl 15 Judge.hb.xl 17 Meet.hb.xl 14 Tea.hb.xl 14 Score.hb.xl 16.cfg.xl 26 Total JDBC GScoringSyste h Table VIII suarises the findings for ipleenting the Eastern Suburb Gynastics syste with the two approaches. required a total of 987 lines of code, in contrast to JDBC, which required 259. In addition, required about 6 h, whereas JDBC required 3 h. It is evident that required ore effort and tie than JDBC. This difference represents a nearly 4:1 ratio in quantity of code. Indeed, the source of the increase in the code quantity was due to a plain old Java objects (POJO) and its apping files. 6 h N. Ipact of requireent changes on the two approaches Here, we investigated how sensitive the two approaches are to the choice of doains odelled. TABLE IX. Prog ra File Nae V1 V2 A M D S GSSyste Club Copetition CopetitionPk Division EventPk Event EventType Gynast Judge Meet TeaPk Tea TeaMeber Score Util Club.hb.xl Cop.hb.xl Divis.hb.xl Event.hb.xl ype.hb.xl Gyt.hb.xl Judge.hb.xl Meet.hb.xl Tea.hb.xl TMeber..xl Score.hb.xl Hibern.cfg.xl Total JDBC GSSyste Table IX shows that the ipleentation of the new requireent changes with required a total of 106 lines of code, in contrast to JDBC, which required only 32. This difference represents a nearly 3:1 ratio in quantity of code. Moreover, the ipleentation with took about 1 h, copared to only 25 in for JDBC. VIII. RESULTS The results of our critical coparison of the two paradigs in ters of flexibility, which was based on ipleentation findings, indicate that in the initial construction of the application, using ORM is uch costlier than using JDBC. In other words, the level of effort and tie required to ipleent the application is uch higher with than with JDBC. For instance, the initial construction of the ESG syste with ORM required a total of 987 lines of code, in contrast to JDBC, which required 259. This difference represents a nearly 4:1 ratio in quantity E T 1 h 25 i n 78

6 of code. In addition, ORM required about 6 h, whereas JDBC required only 3 h. Indeed, increasing the nuber of classes that need to be persisted autoatically can lead to increased levels of effort and tie. Moreover, JDBC is ore flexible in the face of requireent changes than is ORM. For exaple, for an object to be persisted to a database, needs a apping file for all the objects that are to be persisted as well as POJO, which is not required when using the JDBC approach. This eans that if we would like to add an attribute to or delete an attribute fro a class, we ust odify the apping file of that class to ap or delete the attribute, and subsequently we ust odify the class itself to add/delete that an attribute with its getter and setter ethods. When using JDBC, in contrast, we do not need to undertake these steps. Furtherore, the object-oriented paradig has an issue related to navigation between objects through association links, whereas navigation is not an issue for JDBC. In addition, deterining the direction with UML is not an easy task, which can be considered one of the coon istakes in design decision. In addition, the objectoriented approach is ore sensitive to the class odel than the relational odel. It is worth entioning that the developer did not use auto-code generation during perforing the initial construction ipleentation, and this could explain the rearkable difference in tie between two approaches. Although the current study has yielded soe clear preliinary findings, its design is not without flaws. First, the case studies were sall scale as a result of soe restrictions, such as the tie and effort required for ipleentation. A further liitation is that the ipleentation of all the case studies was perfored by one developer, which ay affect the generalisability of the study s findings to different developers. results and to investigate flexibility of object-oriented approach to requireent changes. REFERENCES [1] E. F. Codd, A Relational Model of Data for Large Shared Data Banks, Counications of the ACM, vol. 13, 1970, pp [2] B. Unger, L. Prechelt, and M. Philippsen, The Ipact of Inheritance Depth on Maintenance Tasks: Detailed Description and Evaluation of Two Experient Replications. Fak. für Inforatik Univ., [3] C. Russell, Bridging the Object-relational Divide, Queue, vol. 6, 2008, pp [4] M. I. Aguirre-Urreta and G. M. Marakas, Coparing Conceptual Modeling Techniques: A Critical Review of the EER vs. OO Epirical Literature, ACM SIGMIS Database, vol. 39, 2008, pp [5] F. Lodhi and M. A. Ghazali, Design of a Siple and Effective Object-to-Relational Mapping Technique, in Proceedings of the 2007 ACM Syposiu on Applied Coputing, 2007, pp [6] S. Sircar, S. P. Nerur, and R. Mahapatra, Revolution or Evolution? A Coparison of Object-oriented and Structured Systes Developent Methods, MIS Quarterly, 2001, pp [7] G. A. Kiran, S. Haripriya, and P. Jalote, Effect of object orientation on aintainability of software, in Software Maintenance, Proc. International Conference on, 1997, pp [8] M. B. Rosson and S. R. Alpert, The Cognitive Consequences of Object-oriented Design, Huan-Coputer Interaction, vol. 5, 1991, pp [9] M. A. Eieran and M. T. Dishaw, The Process of Software Maintenance: A Coparison of Object-oriented and Third-generation Developent Languages, Journal of Software Maintenance and Evolution: Research and Practice, vol. 19, 2007, pp [10] S. Group. (2011). The Standish Group International Inc. [11] E. Arishol and D. I. Sjoberg, Evaluating the Effect of a Delegated Versus Centralized Control Style on the Maintainability of Objectoriented Software, IEEE Transactions on Software Engineering, vol. 30, 2004, pp IX. CONCLUSION This paper addressed the question of whether the objectoriented approach is better than the traditional approach or vice versa in ters of applicability and flexibility to requireent changes. The experiental results show that the object-oriented approach required ore tie and effort as a result of apping files. Moreover, the object-oriented approach has an issue of navigation between objects. However, our exaination is only the beginning. We believe there is still a need for further research with real projects to yield reliable results. Our future work will focus on conducting ore experients on real projects to validate our 79

M Software management

M Software management M Software anageent This docuent is part of the UCISA Inforation Security Toolkit providing guidance on the policies and processes needed to ipleent an organisational inforation security policy. To use

More information

Analysing Real-Time Communications: Controller Area Network (CAN) *

Analysing Real-Time Communications: Controller Area Network (CAN) * Analysing Real-Tie Counications: Controller Area Network (CAN) * Abstract The increasing use of counication networks in tie critical applications presents engineers with fundaental probles with the deterination

More information

A Measurement-Based Model for Parallel Real-Time Tasks

A Measurement-Based Model for Parallel Real-Time Tasks A Measureent-Based Model for Parallel Real-Tie Tasks Kunal Agrawal 1 Washington University in St. Louis St. Louis, MO, USA kunal@wustl.edu https://orcid.org/0000-0001-5882-6647 Sanjoy Baruah 2 Washington

More information

Defining and Surveying Wireless Link Virtualization and Wireless Network Virtualization

Defining and Surveying Wireless Link Virtualization and Wireless Network Virtualization 1 Defining and Surveying Wireless Link Virtualization and Wireless Network Virtualization Jonathan van de Belt, Haed Ahadi, and Linda E. Doyle The Centre for Future Networks and Counications - CONNECT,

More information

Development of an Integrated Cost Estimation and Cost Control System for Construction Projects

Development of an Integrated Cost Estimation and Cost Control System for Construction Projects ABSTRACT Developent of an Integrated Estiation and Control Syste for Construction s by Salan Azhar, Syed M. Ahed and Aaury A. Caballero Florida International University 0555 W. Flagler Street, Miai, Florida

More information

Energy-Efficient Disk Replacement and File Placement Techniques for Mobile Systems with Hard Disks

Energy-Efficient Disk Replacement and File Placement Techniques for Mobile Systems with Hard Disks Energy-Efficient Disk Replaceent and File Placeent Techniques for Mobile Systes with Hard Disks Young-Jin Ki School of Coputer Science & Engineering Seoul National University Seoul 151-742, KOREA youngjk@davinci.snu.ac.kr

More information

Verifying the structure and behavior in UML/OCL models using satisfiability solvers

Verifying the structure and behavior in UML/OCL models using satisfiability solvers IET Cyber-Physical Systes: Theory & Applications Review Article Verifying the structure and behavior in UML/OCL odels using satisfiability solvers ISSN 2398-3396 Received on 20th October 2016 Revised on

More information

An Efficient Approach for Content Delivery in Overlay Networks

An Efficient Approach for Content Delivery in Overlay Networks An Efficient Approach for Content Delivery in Overlay Networks Mohaad Malli, Chadi Barakat, Walid Dabbous Projet Planète, INRIA-Sophia Antipolis, France E-ail:{alli, cbarakat, dabbous}@sophia.inria.fr

More information

Carving Differential Unit Test Cases from System Test Cases

Carving Differential Unit Test Cases from System Test Cases Carving Differential Unit Test Cases fro Syste Test Cases Sebastian Elbau, Hui Nee Chin, Matthew B. Dwyer, Jonathan Dokulil Departent of Coputer Science and Engineering University of Nebraska - Lincoln

More information

Designing High Performance Web-Based Computing Services to Promote Telemedicine Database Management System

Designing High Performance Web-Based Computing Services to Promote Telemedicine Database Management System Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh 1, Issa Khalil 2, and Abdallah Khreishah 3 1: Coputer Engineering & Inforation Technology,

More information

PERFORMANCE MEASURES FOR INTERNET SERVER BY USING M/M/m QUEUEING MODEL

PERFORMANCE MEASURES FOR INTERNET SERVER BY USING M/M/m QUEUEING MODEL IJRET: International Journal of Research in Engineering and Technology ISSN: 239-63 PERFORMANCE MEASURES FOR INTERNET SERVER BY USING M/M/ QUEUEING MODEL Raghunath Y. T. N. V, A. S. Sravani 2 Assistant

More information

THE rapid growth and continuous change of the real

THE rapid growth and continuous change of the real IEEE TRANSACTIONS ON SERVICES COMPUTING, VOL. 8, NO. 1, JANUARY/FEBRUARY 2015 47 Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh, Issa

More information

Mapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues

Mapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues Mapping Data in Peer-to-Peer Systes: Seantics and Algorithic Issues Anastasios Keentsietsidis Marcelo Arenas Renée J. Miller Departent of Coputer Science University of Toronto {tasos,arenas,iller}@cs.toronto.edu

More information

1 Extended Boolean Model

1 Extended Boolean Model 1 EXTENDED BOOLEAN MODEL It has been well-known that the Boolean odel is too inflexible, requiring skilful use of Boolean operators to obtain good results. On the other hand, the vector space odel is flexible

More information

Computer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13

Computer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13 Coputer Aided Drafting, Design and Manufacturing Volue 26, uber 2, June 2016, Page 13 CADDM 3D reconstruction of coplex curved objects fro line drawings Sun Yanling, Dong Lijun Institute of Mechanical

More information

a) Figure 1 shows a small part of an Extended-Entity-Relationship model describing the personnel department of a research company.

a) Figure 1 shows a small part of an Extended-Entity-Relationship model describing the personnel department of a research company. a) Figure shows a sall part of an Extended-Entity-Relationship odel describing the personnel departent of a research copany. GivenNae FailyNae relationship telephone NInuber NextOfKin contact Eployee d

More information

Two hours UNIVERSITY OF MANCHESTER. January Answer any THREE questions. Answer each question in a separate book

Two hours UNIVERSITY OF MANCHESTER. January Answer any THREE questions. Answer each question in a separate book Two hours UNIVERSITY OF MANCHESTER Database Architecture Models and Design January 2004 Answer any THREE questions Answer each question in a separate book The use of electronic calculators is not peritted.

More information

Entity Search Engine: Towards Agile Best-Effort Information Integration over the Web

Entity Search Engine: Towards Agile Best-Effort Information Integration over the Web Entity Search Engine: Towards Agile Best-Effort Inforation Integration over the Web Tao Cheng, Kevin Chen-Chuan Chang University of Illinois at Urbana-Chapaign {tcheng3, kcchang}@cs.uiuc.edu. INTRODUCTION

More information

Structuring Business Metadata in Data Warehouse Systems for Effective Business Support

Structuring Business Metadata in Data Warehouse Systems for Effective Business Support Structuring Business Metadata in Data Warehouse Systes for Effective Business Support arxiv:cs/0110020v1 [cs.db] 8 Oct 2001 N.L. Sarda Departent of Coputer Science and Engineering Indian Institute of Technology

More information

Different criteria of dynamic routing

Different criteria of dynamic routing Procedia Coputer Science Volue 66, 2015, Pages 166 173 YSC 2015. 4th International Young Scientists Conference on Coputational Science Different criteria of dynaic routing Kurochkin 1*, Grinberg 1 1 Kharkevich

More information

Gromov-Hausdorff Distance Between Metric Graphs

Gromov-Hausdorff Distance Between Metric Graphs Groov-Hausdorff Distance Between Metric Graphs Jiwon Choi St Mark s School January, 019 Abstract In this paper we study the Groov-Hausdorff distance between two etric graphs We copute the precise value

More information

The Internal Conflict of a Belief Function

The Internal Conflict of a Belief Function The Internal Conflict of a Belief Function Johan Schubert Abstract In this paper we define and derive an internal conflict of a belief function We decopose the belief function in question into a set of

More information

Database Design on Mechanical Equipment Operation Management System Zheng Qiu1, Wu kaiyuan1, Wu Chengyan1, Liu Lei2

Database Design on Mechanical Equipment Operation Management System Zheng Qiu1, Wu kaiyuan1, Wu Chengyan1, Liu Lei2 2nd International Conference on Advances in Mechanical Engineering and Industrial Inforatics (AMEII 206) Database Design on Mechanical Equipent Manageent Syste Zheng Qiu, Wu kaiyuan, Wu Chengyan, Liu Lei2

More information

OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS

OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS Key words SOA, optial, coplex service, coposition, Quality of Service Piotr RYGIELSKI*, Paweł ŚWIĄTEK* OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS One of the ost iportant tasks in service oriented

More information

Design Optimization of Mixed Time/Event-Triggered Distributed Embedded Systems

Design Optimization of Mixed Time/Event-Triggered Distributed Embedded Systems Design Optiization of Mixed Tie/Event-Triggered Distributed Ebedded Systes Traian Pop, Petru Eles, Zebo Peng Dept. of Coputer and Inforation Science, Linköping University {trapo, petel, zebpe}@ida.liu.se

More information

Shortest Path Determination in a Wireless Packet Switch Network System in University of Calabar Using a Modified Dijkstra s Algorithm

Shortest Path Determination in a Wireless Packet Switch Network System in University of Calabar Using a Modified Dijkstra s Algorithm International Journal of Engineering and Technical Research (IJETR) ISSN: 31-869 (O) 454-4698 (P), Volue-5, Issue-1, May 16 Shortest Path Deterination in a Wireless Packet Switch Network Syste in University

More information

A Novel Fast Constructive Algorithm for Neural Classifier

A Novel Fast Constructive Algorithm for Neural Classifier A Novel Fast Constructive Algorith for Neural Classifier Xudong Jiang Centre for Signal Processing, School of Electrical and Electronic Engineering Nanyang Technological University Nanyang Avenue, Singapore

More information

An Architecture for a Distributed Deductive Database System

An Architecture for a Distributed Deductive Database System IEEE TENCON '93 / B eih An Architecture for a Distributed Deductive Database Syste M. K. Mohania N. L. Sarda bept. of Coputer Science and Engineering, Indian Institute of Technology, Bobay 400 076, INDIA

More information

6.1 Topological relations between two simple geometric objects

6.1 Topological relations between two simple geometric objects Chapter 5 proposed a spatial odel to represent the spatial extent of objects in urban areas. The purpose of the odel, as was clarified in Chapter 3, is ultifunctional, i.e. it has to be capable of supplying

More information

International Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN

International Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN International Journal of Scientific & Engineering Research, Volue 4, Issue 0, October-203 483 Design an Encoding Technique Using Forbidden Transition free Algorith to Reduce Cross-Talk for On-Chip VLSI

More information

Collaborative Web Caching Based on Proxy Affinities

Collaborative Web Caching Based on Proxy Affinities Collaborative Web Caching Based on Proxy Affinities Jiong Yang T J Watson Research Center IBM jiyang@usibco Wei Wang T J Watson Research Center IBM ww1@usibco Richard Muntz Coputer Science Departent UCLA

More information

Data Caching for Enhancing Anonymity

Data Caching for Enhancing Anonymity Data Caching for Enhancing Anonyity Rajiv Bagai and Bin Tang Departent of Electrical Engineering and Coputer Science Wichita State University Wichita, Kansas 67260 0083, USA Eail: {rajiv.bagai, bin.tang}@wichita.edu

More information

Feature Based Registration for Panoramic Image Generation

Feature Based Registration for Panoramic Image Generation IJCSI International Journal of Coputer Science Issues, Vol. 10, Issue 6, No, Noveber 013 www.ijcsi.org 13 Feature Based Registration for Panoraic Iage Generation Kawther Abbas Sallal 1, Abdul-Mone Saleh

More information

IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE. Rafael García, Xevi Cufí and Lluís Pacheco

IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE. Rafael García, Xevi Cufí and Lluís Pacheco IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE Rafael García, Xevi Cufí and Lluís Pacheco Coputer Vision and Robotics Group Institute of Inforatics and Applications, University of

More information

Joint Measurement- and Traffic Descriptor-based Admission Control at Real-Time Traffic Aggregation Points

Joint Measurement- and Traffic Descriptor-based Admission Control at Real-Time Traffic Aggregation Points Joint Measureent- and Traffic Descriptor-based Adission Control at Real-Tie Traffic Aggregation Points Stylianos Georgoulas, Panos Triintzios and George Pavlou Centre for Counication Systes Research, University

More information

Rule Extraction using Artificial Neural Networks

Rule Extraction using Artificial Neural Networks Rule Extraction using Artificial Neural Networks S. M. Karuzzaan 1 Ahed Ryadh Hasan 2 Abstract Artificial neural networks have been successfully applied to a variety of business application probles involving

More information

Investigation of The Time-Offset-Based QoS Support with Optical Burst Switching in WDM Networks

Investigation of The Time-Offset-Based QoS Support with Optical Burst Switching in WDM Networks Investigation of The Tie-Offset-Based QoS Support with Optical Burst Switching in WDM Networks Pingyi Fan, Chongxi Feng,Yichao Wang, Ning Ge State Key Laboratory on Microwave and Digital Counications,

More information

Image Filter Using with Gaussian Curvature and Total Variation Model

Image Filter Using with Gaussian Curvature and Total Variation Model IJECT Vo l. 7, Is s u e 3, Ju l y - Se p t 016 ISSN : 30-7109 (Online) ISSN : 30-9543 (Print) Iage Using with Gaussian Curvature and Total Variation Model 1 Deepak Kuar Gour, Sanjay Kuar Shara 1, Dept.

More information

Generalised Mixin-based Inheritance to Support Multiple Inheritance

Generalised Mixin-based Inheritance to Support Multiple Inheritance Vrije Universiteit russel Faculteit Wetenschappen VRIJE UNIVERSITEIT RUSSEL SCI EN T I V INCERE T ENE R S Generalised Mixin-based Inheritance to Support Multiple Inheritance Niels oyen, Carine Lucas, Patrick

More information

Node +key : int +left : Node +right : Node. root where m is either 0..1, 0..*, or * Node +key : int +left : Node +right : Node 0..

Node +key : int +left : Node +right : Node. root where m is either 0..1, 0..*, or * Node +key : int +left : Node +right : Node 0.. Question 1: è12 pointsè CISC323 Midter Exa Saple Solution March 19, 2003 J. Dingel Consider the following code fragent for ipleenting binary search trees. class BinSearchTree í public Node root;... í class

More information

Derivation of an Analytical Model for Evaluating the Performance of a Multi- Queue Nodes Network Router

Derivation of an Analytical Model for Evaluating the Performance of a Multi- Queue Nodes Network Router Derivation of an Analytical Model for Evaluating the Perforance of a Multi- Queue Nodes Network Router 1 Hussein Al-Bahadili, 1 Jafar Ababneh, and 2 Fadi Thabtah 1 Coputer Inforation Systes Faculty of

More information

Scheduling Parallel Real-Time Recurrent Tasks on Multicore Platforms

Scheduling Parallel Real-Time Recurrent Tasks on Multicore Platforms IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL., NO., NOV 27 Scheduling Parallel Real-Tie Recurrent Tasks on Multicore Platfors Risat Pathan, Petros Voudouris, and Per Stenströ Abstract We

More information

Adaptive Holistic Scheduling for In-Network Sensor Query Processing

Adaptive Holistic Scheduling for In-Network Sensor Query Processing Adaptive Holistic Scheduling for In-Network Sensor Query Processing Hejun Wu and Qiong Luo Departent of Coputer Science and Engineering Hong Kong University of Science & Technology Clear Water Bay, Kowloon,

More information

Oblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands

Oblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands Oblivious Routing for Fat-Tree Based Syste Area Networks with Uncertain Traffic Deands Xin Yuan Wickus Nienaber Zhenhai Duan Departent of Coputer Science Florida State University Tallahassee, FL 3306 {xyuan,nienaber,duan}@cs.fsu.edu

More information

Modeling Parallel Applications Performance on Heterogeneous Systems

Modeling Parallel Applications Performance on Heterogeneous Systems Modeling Parallel Applications Perforance on Heterogeneous Systes Jaeela Al-Jaroodi, Nader Mohaed, Hong Jiang and David Swanson Departent of Coputer Science and Engineering University of Nebraska Lincoln

More information

News Events Clustering Method Based on Staging Incremental Single-Pass Technique

News Events Clustering Method Based on Staging Incremental Single-Pass Technique News Events Clustering Method Based on Staging Increental Single-Pass Technique LI Yongyi 1,a *, Gao Yin 2 1 School of Electronics and Inforation Engineering QinZhou University 535099 Guangxi, China 2

More information

Feature Selection to Relate Words and Images

Feature Selection to Relate Words and Images The Open Inforation Systes Journal, 2009, 3, 9-13 9 Feature Selection to Relate Words and Iages Wei-Chao Lin 1 and Chih-Fong Tsai*,2 Open Access 1 Departent of Coputing, Engineering and Technology, University

More information

A New Generic Model for Vision Based Tracking in Robotics Systems

A New Generic Model for Vision Based Tracking in Robotics Systems A New Generic Model for Vision Based Tracking in Robotics Systes Yanfei Liu, Ada Hoover, Ian Walker, Ben Judy, Mathew Joseph and Charly Heranson lectrical and Coputer ngineering Departent Cleson University

More information

ACNS: Adaptive Complementary Neighbor Selection in BitTorrent-like Applications

ACNS: Adaptive Complementary Neighbor Selection in BitTorrent-like Applications ACNS: Adaptive Copleentary Neighbor Selection in BitTorrent-like Applications Zhenbao Zhou 1, 2, Zhenyu Li 1, 2, Gaogang Xie 1 1 Institute of Coputing Technology, Chinese Acadey of Sciences, Beijing 100190,

More information

Detection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm

Detection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm Detection of Outliers and Reduction of their Undesirable Effects for Iproving the Accuracy of K-eans Clustering Algorith Bahan Askari Departent of Coputer Science and Research Branch, Islaic Azad University,

More information

Author. Published. Journal Title DOI. Copyright Statement. Downloaded from. Griffith Research Online. Kandjani, Hadi, Wen, Larry, Bernus, Peter

Author. Published. Journal Title DOI. Copyright Statement. Downloaded from. Griffith Research Online. Kandjani, Hadi, Wen, Larry, Bernus, Peter Enterprise Architecture Cybernetics for Global Mining Projects: Reducing the Structural Coplexity of Global Mining Supply Networks via Virtual Brokerage Author Kandjani, Hadi, Wen, Larry, Bernus, Peter

More information

The optimization design of microphone array layout for wideband noise sources

The optimization design of microphone array layout for wideband noise sources PROCEEDINGS of the 22 nd International Congress on Acoustics Acoustic Array Systes: Paper ICA2016-903 The optiization design of icrophone array layout for wideband noise sources Pengxiao Teng (a), Jun

More information

Flucs: Artificial Lighting & Daylighting. IES Virtual Environment

Flucs: Artificial Lighting & Daylighting. IES Virtual Environment Flucs: Artificial Lighting & Daylighting IES Virtual Environent Contents 1. General Description of the FLUCS Interface... 6 1.1. Coon Controls... 6 1.2. Main Application Window... 6 1.3. Other Windows...

More information

Knowledge Discovery Applied to Agriculture Economy Planning

Knowledge Discovery Applied to Agriculture Economy Planning Knowledge Discovery Applied to Agriculture Econoy Planning Bing-ru Yang and Shao-un Huang Inforation Engineering School University of Science and Technology, Beiing, China, 100083 Eail: bingru.yang@b.col.co.cn

More information

TensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3

TensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3 2017 2nd International Conference on Coputational Modeling, Siulation and Applied Matheatics (CMSAM 2017) ISBN: 978-1-60595-499-8 TensorFlow and Keras-based Convolutional Neural Network in CAT Iage Recognition

More information

MAPPING THE DATA FLOW MODEL OF COMPUTATION INTO AN ENHANCED VON NEUMANN PROCESSOR * Peter M. Maurer

MAPPING THE DATA FLOW MODEL OF COMPUTATION INTO AN ENHANCED VON NEUMANN PROCESSOR * Peter M. Maurer MAPPING THE DATA FLOW MODEL OF COMPUTATION INTO AN ENHANCED VON NEUMANN PROCESSOR * Peter M. Maurer Departent of Coputer Science and Engineering University of South Florida Tapa, FL 33620 Abstract -- The

More information

Efficient Estimation of Inclusion Coefficient using HyperLogLog Sketches

Efficient Estimation of Inclusion Coefficient using HyperLogLog Sketches Efficient Estiation of Inclusion Coefficient using HyperLogLog Sketches Azade Nazi, Bolin Ding, Vivek Narasayya, Surajit Chaudhuri Microsoft Research {aznazi, bolind, viveknar, surajitc}@icrosoft.co ABSTRACT

More information

EE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011

EE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011 EE 364B Convex Optiization An ADMM Solution to the Sparse Coding Proble Sonia Bhaskar, Will Zou Final Project Spring 20 I. INTRODUCTION For our project, we apply the ethod of the alternating direction

More information

Entity-Relationship Models of Information Artefacts

Entity-Relationship Models of Information Artefacts Entity-Relationship Models of Inforation Artefacts T. R. G. Green MRC Applied Psychology Unit 5 Chaucer Rd, Cabridge CB2 2EF thoas.green@rc-apu.ca.ac.uk http: //www.rc-apu.ca.ac.uk/personal/thoas.green/

More information

A High-Speed VLSI Fuzzy Inference Processor for Trapezoid-Shaped Membership Functions *

A High-Speed VLSI Fuzzy Inference Processor for Trapezoid-Shaped Membership Functions * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 21, 607-626 (2005) A High-Speed VLSI Fuzzy Inference Processor for Trapezoid-Shaped Mebership Functions * SHIH-HSU HUANG AND JIAN-YUAN LAI + Departent of

More information

A Network-based Seamless Handover Scheme for Multi-homed Devices

A Network-based Seamless Handover Scheme for Multi-homed Devices A Network-based Sealess Handover Schee for Multi-hoed Devices Md. Shohrab Hossain and Mohaed Atiquzzaan School of Coputer Science, University of Oklahoa, Noran, OK 7319 Eail: {shohrab, atiq}@ou.edu Abstract

More information

Enhancing Real-Time CAN Communications by the Prioritization of Urgent Messages at the Outgoing Queue

Enhancing Real-Time CAN Communications by the Prioritization of Urgent Messages at the Outgoing Queue Enhancing Real-Tie CAN Counications by the Prioritization of Urgent Messages at the Outgoing Queue ANTÓNIO J. PIRES (1), JOÃO P. SOUSA (), FRANCISCO VASQUES (3) 1,,3 Faculdade de Engenharia da Universidade

More information

Solving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification

Solving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification Solving the Daage Localization Proble in Structural Health Monitoring Using Techniques in Pattern Classification CS 9 Final Project Due Dec. 4, 007 Hae Young Noh, Allen Cheung, Daxia Ge Introduction Structural

More information

Using Imperialist Competitive Algorithm in Optimization of Nonlinear Multiple Responses

Using Imperialist Competitive Algorithm in Optimization of Nonlinear Multiple Responses International Journal of Industrial Engineering & Production Research Septeber 03, Volue 4, Nuber 3 pp. 9-35 ISSN: 008-4889 http://ijiepr.iust.ac.ir/ Using Iperialist Copetitive Algorith in Optiization

More information

POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION. Junjun Jiang, Ruimin Hu, Zhen Han, Tao Lu, and Kebin Huang

POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION. Junjun Jiang, Ruimin Hu, Zhen Han, Tao Lu, and Kebin Huang IEEE International Conference on ultiedia and Expo POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION Junjun Jiang, Ruiin Hu, Zhen Han, Tao Lu, and Kebin Huang National Engineering

More information

Collection Selection Based on Historical Performance for Efficient Processing

Collection Selection Based on Historical Performance for Efficient Processing Collection Selection Based on Historical Perforance for Efficient Processing Christopher T. Fallen and Gregory B. Newby Arctic Region Supercoputing Center University of Alaska Fairbanks Fairbanks, Alaska

More information

QUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS

QUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS QUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS Guofei Jiang and George Cybenko Institute for Security Technology Studies and Thayer School of Engineering Dartouth College, Hanover NH 03755

More information

Privacy-preserving String-Matching With PRAM Algorithms

Privacy-preserving String-Matching With PRAM Algorithms Privacy-preserving String-Matching With PRAM Algoriths Report in MTAT.07.022 Research Seinar in Cryptography, Fall 2014 Author: Sander Sii Supervisor: Peeter Laud Deceber 14, 2014 Abstract In this report,

More information

COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL

COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL 1 Te-Wei Chiang ( 蔣德威 ), 2 Tienwei Tsai ( 蔡殿偉 ), 3 Jeng-Ping Lin ( 林正平 ) 1 Dept. of Accounting Inforation Systes, Chilee Institute

More information

INSERTION SORT is O(n log n)

INSERTION SORT is O(n log n) INSERTION SORT is On log n) Michael A. Bender Martín Farach-Colton Miguel A. Mosteiro Abstract Traditional INSERTION SORT runs in On 2 ) tie because each insertion takes On) tie. When people run INSERTION

More information

Identifying Converging Pairs of Nodes on a Budget

Identifying Converging Pairs of Nodes on a Budget Identifying Converging Pairs of Nodes on a Budget Konstantina Lazaridou Departent of Inforatics Aristotle University, Thessaloniki, Greece konlaznik@csd.auth.gr Evaggelia Pitoura Coputer Science and Engineering

More information

Heterogeneous Radial Basis Function Networks

Heterogeneous Radial Basis Function Networks Proceedings of the International Conference on Neural Networks (ICNN ), vol. 2, pp. 23-2, June. Heterogeneous Radial Basis Function Networks D. Randall Wilson, Tony R. Martinez e-ail: randy@axon.cs.byu.edu,

More information

Scope-aware Data Cache Analysis for WCET Estimation

Scope-aware Data Cache Analysis for WCET Estimation Scope-aware Data Cache Analysis for WCET Estiation Bach Khoa Huynh National University of Singapore huynhbac@cop.nus.edu.sg Lei Ju Shandong University julei@sdu.edu.cn (Corresponding author) Abhik Roychoudhury

More information

Architectural Issues of JMS Compliant Group Communication

Architectural Issues of JMS Compliant Group Communication Architectural Issues of JMS opliant Group ounication Arnas Kupšys Richard Ekwall École Polytechnique Fédérale de Lausanne (EPFL) H-1015 Lausanne, Switzerland {arnas.kupsys, nilsrichard.ekwall}@epfl.ch

More information

A Trajectory Splitting Model for Efficient Spatio-Temporal Indexing

A Trajectory Splitting Model for Efficient Spatio-Temporal Indexing A Trajectory Splitting Model for Efficient Spatio-Teporal Indexing Slobodan Rasetic Jörg Sander Jaes Elding Mario A. Nasciento Departent of Coputing Science University of Alberta Edonton, Alberta, Canada

More information

Structural Balance in Networks. An Optimizational Approach. Andrej Mrvar. Faculty of Social Sciences. University of Ljubljana. Kardeljeva pl.

Structural Balance in Networks. An Optimizational Approach. Andrej Mrvar. Faculty of Social Sciences. University of Ljubljana. Kardeljeva pl. Structural Balance in Networks An Optiizational Approach Andrej Mrvar Faculty of Social Sciences University of Ljubljana Kardeljeva pl. 5 61109 Ljubljana March 23 1994 Contents 1 Balanced and clusterable

More information

Leveraging Relevance Cues for Improved Spoken Document Retrieval

Leveraging Relevance Cues for Improved Spoken Document Retrieval Leveraging Relevance Cues for Iproved Spoken Docuent Retrieval Pei-Ning Chen 1, Kuan-Yu Chen 2 and Berlin Chen 1 National Taiwan Noral University, Taiwan 1 Institute of Inforation Science, Acadeia Sinica,

More information

The Boundary Between Privacy and Utility in Data Publishing

The Boundary Between Privacy and Utility in Data Publishing The Boundary Between Privacy and Utility in Data Publishing Vibhor Rastogi Dan Suciu Sungho Hong ABSTRACT We consider the privacy proble in data publishing: given a database instance containing sensitive

More information

QoS and Sensible Routing Decisions

QoS and Sensible Routing Decisions QoS and Sensible Routing Decisions Erol Gelenbe Dept. of Electrical & Electronic Engineering Iperial College London SW7 2BT e.gelenbe@iperial.ac.uk Abstract Network Quality of Service (QoS) criteria of

More information

A Comparative Study of Two-phase Heuristic Approaches to General Job Shop Scheduling Problem

A Comparative Study of Two-phase Heuristic Approaches to General Job Shop Scheduling Problem IE Vol. 7, No. 2, pp. 84-92, Septeber 2008. A Coparative Study of Two-phase Heuristic Approaches to General Job Shop Scheduling Proble Ji Ung Sun School of Industrial and Managent Engineering Hankuk University

More information

NEW APPROACHES FOR REAL TIME TRAFFIC DATA ACQUISITION WITH AIRBORNE SYSTEMS

NEW APPROACHES FOR REAL TIME TRAFFIC DATA ACQUISITION WITH AIRBORNE SYSTEMS NEW APPROACHES FOR REAL TIME TRAFFIC DATA ACQUISITION WITH AIRBORNE SYSTEMS I. Ernst a *, M. Hetscher a, K. Thiessenhusen a, M. Ruhé a, A. Börner b, S. Zuev a a DLR, Institute of Transportation Research,

More information

The Henryk Niewodniczański INSTITUTE OF NUCLEAR PHYSICS Polish Academy of Sciences ul. Radzikowskiego 152, Kraków

The Henryk Niewodniczański INSTITUTE OF NUCLEAR PHYSICS Polish Academy of Sciences ul. Radzikowskiego 152, Kraków The Henryk Niewodniczański INSTITUT OF NUCLAR PHYSICS Polish Acadey of Sciences ul. Radzikowskiego 152, 31-342 Kraków www.ifj.edu.pl/reports/2005.htl Kraków, October 2005 Report No. 1968/D The theroluinescence

More information

Database Design on Customer Relationship Management System Yanmei Wang

Database Design on Customer Relationship Management System Yanmei Wang 2nd International Conference on Econoics, Social Science, Arts, Education and Manageent Engineering (ESSAEME 2016) Database Design on Custoer Relationship Manageent Syste Yanei Wang College of Inforation

More information

Comparing Techniques by Means of Encapsulation and onnascence

Comparing Techniques by Means of Encapsulation and onnascence rusuur lt suaries and Meilir Page-Jones Coparing Techniques by Means of Encapsulation and onnascence oday the object-oriented approach to software developent is at the height of fashion. As such, it threatens

More information

The Hopcount to an Anycast Group

The Hopcount to an Anycast Group The Hopcount to an Anycast Group Piet Van Mieghe Delft University of Technology Abstract The probability density function of the nuber of hops to the ost nearby eber of the anycast group consisting of

More information

Experiences with complex user profiles for approximate P2P community matching

Experiences with complex user profiles for approximate P2P community matching Experiences with coplex user profiles for approxiate PP counity atching Patrizio Dazzi ISTI-CNR Pisa, Italy p.dazzi@isti.cnr.it Matteo Mordacchini IIT-CNR Pisa, Italy.ordacchini@iit.cnr.it Fabio Baglini

More information

Relief shape inheritance and graphical editor for the landscape design

Relief shape inheritance and graphical editor for the landscape design Relief shape inheritance and graphical editor for the landscape design Egor A. Yusov Vadi E. Turlapov Nizhny Novgorod State University after N. I. Lobachevsky Nizhny Novgorod Russia yusov_egor@ail.ru vadi.turlapov@cs.vk.unn.ru

More information

A Periodic Dynamic Load Balancing Method

A Periodic Dynamic Load Balancing Method 2016 3 rd International Conference on Engineering Technology and Application (ICETA 2016) ISBN: 978-1-60595-383-0 A Periodic Dynaic Load Balancing Method Taotao Fan* State Key Laboratory of Inforation

More information

RECONFIGURABLE AND MODULAR BASED SYNTHESIS OF CYCLIC DSP DATA FLOW GRAPHS

RECONFIGURABLE AND MODULAR BASED SYNTHESIS OF CYCLIC DSP DATA FLOW GRAPHS RECONFIGURABLE AND MODULAR BASED SYNTHESIS OF CYCLIC DSP DATA FLOW GRAPHS AWNI ITRADAT Assistant Professor, Departent of Coputer Engineering, Faculty of Engineering, Hasheite University, P.O. Box 15459,

More information

Performance Analysis of RAID in Different Workload

Performance Analysis of RAID in Different Workload Send Orders for Reprints to reprints@benthascience.ae 324 The Open Cybernetics & Systeics Journal, 2015, 9, 324-328 Perforance Analysis of RAID in Different Workload Open Access Zhang Dule *, Ji Xiaoyun,

More information

THE rounding operation is performed in almost all arithmetic

THE rounding operation is performed in almost all arithmetic This is the author's version of an article that has been published in this journal. Changes were ade to this version by the publisher prior to publication. The final version of record is available at http://dx.doi.org/.9/tvlsi.5.538

More information

Geo-activity Recommendations by using Improved Feature Combination

Geo-activity Recommendations by using Improved Feature Combination Geo-activity Recoendations by using Iproved Feature Cobination Masoud Sattari Middle East Technical University Ankara, Turkey e76326@ceng.etu.edu.tr Murat Manguoglu Middle East Technical University Ankara,

More information

Massive amounts of high-dimensional data are pervasive in multiple domains,

Massive amounts of high-dimensional data are pervasive in multiple domains, Challenges of Feature Selection for Big Data Analytics Jundong Li and Huan Liu, Arizona State University Massive aounts of high-diensional data are pervasive in ultiple doains, ranging fro social edia,

More information

A Learning Framework for Nearest Neighbor Search

A Learning Framework for Nearest Neighbor Search A Learning Fraework for Nearest Neighbor Search Lawrence Cayton Departent of Coputer Science University of California, San Diego lcayton@cs.ucsd.edu Sanjoy Dasgupta Departent of Coputer Science University

More information

An Automatic Method for Summary Evaluation Using Multiple Evaluation Results by a Manual Method

An Automatic Method for Summary Evaluation Using Multiple Evaluation Results by a Manual Method An Autoatic Method for Suary Evaluation Using Multiple Evaluation Results by a Manual Method Hidetsugu Nanba Faculty of Inforation Sciences, Hiroshia City University 3-4-1 Ozuka, Hiroshia, 731-3194 Japan

More information

I ve Seen Enough : Incrementally Improving Visualizations to Support Rapid Decision Making

I ve Seen Enough : Incrementally Improving Visualizations to Support Rapid Decision Making I ve Seen Enough : Increentally Iproving Visualizations to Support Rapid Decision Making Sajjadur Rahan Marya Aliakbarpour 2 Ha Kyung Kong Eric Blais 3 Karrie Karahalios,4 Aditya Paraeswaran Ronitt Rubinfield

More information

A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network

A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network A Bea Search Method to Solve the Proble of Assignent Cells to Switches in a Cellular Mobile Networ Cassilda Maria Ribeiro Faculdade de Engenharia de Guaratinguetá - DMA UNESP - São Paulo State University

More information

A Research of MapReduce with GPU Acceleration

A Research of MapReduce with GPU Acceleration A Research of MapReduce with GPU Acceleration Miao Xin 1, Hao Li 2, Joan Lu 2 1 School of Inforation Science and Engineering, Yunnan University, Kuning, Yunnan, China 2 School of Software, Yunnan University,

More information

Burst Scheduling Networks. Simon S. Lam and Georey G. Xie. The University of Texas at Austin. Austin, Texas August 31, 1996.

Burst Scheduling Networks. Simon S. Lam and Georey G. Xie. The University of Texas at Austin. Austin, Texas August 31, 1996. Burst Scheduling Networks Sion S. La and Georey G. Xie Departent of Coputer Sciences The University of Texas at Austin Austin, Texas 78712-1188 August 31, 1996 Abstract Most application-level data units

More information

Closing The Performance Gap between Causal Consistency and Eventual Consistency

Closing The Performance Gap between Causal Consistency and Eventual Consistency Closing The Perforance Gap between Causal Consistency and Eventual Consistency Jiaqing Du Călin Iorgulescu Aitabha Roy Willy Zwaenepoel EPFL ABSTRACT It is well known that causal consistency is ore expensive

More information