Reusability Analysis for Shipbuilding Components Modeled in XML and Java
|
|
- Archibald Page
- 5 years ago
- Views:
Transcription
1 Reusability Analysis for Shipbuilding Coponents Modeled in XML and Java Prof. Steven A. Deurjian, Sr., Jeffrey R. Ellis, Rodrigo Caballero, Hai Lin, and Xiaopei Wang Coputer Science & Engineering Departent The University of Connecticut Prof. Donald M. Needha Coputer Science Departent U.S. Naval Acadey (860) June2001.OOReuse-1 Overview Reusability Model, Layers, and Fraework (SD) q Can we Constrain Reusable Coponents? q Can we Define a Reuse Model with Layers? Reusability and XML (DN) q Ipact of XML Abstractions on Reuse q Linking Resources in XML Prototyping Progress in DRE and TCC (JE & SD) q Status of CSE367 Project q Work by JE on Parser and Other Capabilities q Planned Work for Upcoing Months Reusability and Genetic Algoriths (RC & SD) June2001.OOReuse-2 1
2 Reusability Model, Layers, and Fraework (SD) Application is Designed with Abstractions (Class, Interface, Package, Coponent) Apply the Reuse Fraework to the Classes, Interfaces, Packages, and Coponents q Assign Generality Levels q Deterine Related Classes, Coponents q Iterate Until Obtain Marking that is Consistent with the Goals/Objectives of Application Proble: Is it Possible to Organize or Copartentalize the Application s Classes, Interfaces, Packages, and Coponents Fro Different Perspectives Based on Requireents? q Copartents - Previously Called Layers q Represent Chunks of Functionality June2001.OOReuse-3 Reuse Model Issues fro Last Meeting Clarify/Redefine Related Characterization q Transitivity of Related q W R to A, B, and C vs. W R to A, B, or C Coon Definitions for Package/Coponent q How is Marking of Package/Coponent Deterined? Least General Class Sets Package/Coponent Generality q Packages/Coponents Must Obey All Generality Rules of the Model/Fraework Inclusion of Interfaces into Model/Fraework Design Patterns and Ipact on Reuse Layering and the Reuse Model (Our Focus) June2001.OOReuse-4 2
3 Proble Doain Layering Discussion fro October 2000 Meeting Notion of General/Specific Ipacted by Layering? Layer Coponent Coon Person Manufacturing Part Shipbuilding Not OK Piping-Part Part OK Copany-Specific Sub-Piping Piping-PartPart June2001.OOReuse-5 Recall the Different Abstractions Classes and Hierarchies q Building Blocks of Application q Independent Classes of All Types q Generalization and Specialization Interfaces q Specification of Behavior q Never Instantiated Note: We Must Reconcile Our and EB Abstraction Definitions Packages q Organize Classes and/or Hierarchies into Naed Conceptual Units Coponents q Application-Oriented q Logical and Physical Associations of Interfaces, Classes, Packages q Purpose: Represent a Meaningful Chunk of Functionality q This is a Design Tie Coponent (e.g., a Non-Instantiated Bean)! June2001.OOReuse-6 3
4 Relating the Different Abstractions Interface Class Coponent Package Contains - Type Level Uses - Instance Level June2001.OOReuse-7 Abstractions and Application INT_1 CL2 CL1 CL3 INT_2 INT_3 CL6 Package A CL9 CL4 CL5 Coponent X Package B INT_4 Coponent Y CL7 Package C INT_6 INT_5 CL8 June2001.OOReuse-8 4
5 Abstractions and Copartents Soe Saple Copartents? INT_1 CL2 CL1 CL3 INT_2 INT_3 CL6 Package A CL9 CL4 CL5 Coponent X Package B INT_4 Coponent Y CL7 Package C INT_6 INT_5 CL8 June2001.OOReuse-9 Proposed Proble Solution Define Reusability Node to Represent the Different Copartents of Application s Classes, Interfaces, Packages, and Coponents Specify the Rules for: q Coposition of a Reusability Node q Dependencies Aong Reusability Nodes With these Rules, Result is a Reusability Graph of Reusability Nodes with Reusability Dependencies Reusability Graph can be Layered Objectives: q Forally Define Reusability Node, Dependency, Graph, and Layer q Can we Autoate the Process When Given Source Code for Application? June2001.OOReuse-10 5
6 Definition 1: Reusability Node A Reusability Node (RN) is a Set of Classes (Cl( Cl), Packages (P), Interfaces (I), and Coponents (Co) Marked With Varying Levels of Generality Entities in RN Must Satisfy Current Reuse Analysis w.r.t. General/Specific/Related, Coupling Counts, etc. CL1 RN x as Shown on Right INT_1 Classes, Packages, CL2 CL3 INT_2 INT_3 Interfaces, Coponents CL4 are Labeled as follows: CL5 Coponent X Package B q G xi for i = 1 n x are n x Generality levels June2001.OOReuse-11 Assuptions: Reusability Node Is the Makeup and Content of a RN Constrained? What are Possible Constraints on RN x? Levels of Generality q At Most 3 Different Generality Levels Replication q Classes in Exactly One RN q Can Packages/Coponents CL1 INT_1 be in Multiple RNs? q Interfaces Can be in One CL2 CL3 INT_2 or More Different RNs CL4 q Do Coponents/Packages CL5 Package B have Generality Level? INT_3 Coponent X June2001.OOReuse-12 6
7 Objective: Reusability Node Given Source Code (Classes, Interfaces, Packages, and Coponents) for Application, is it Possible to Dynaically/Autoatically Deterine all RNs? What is Needed for this to Occur? q Each Class, Interface, Package, Coponent CL1 INT_1 Must be Marked with Generality Level CL2 CL3 INT_2 INT_3 q Related Dependencies CL4 for Reuse are Defined CL5 Coponent X Package B q Parser that Synthesizes All of the Source Code Dependencies Is this Proble NP Hard? Coplete? June2001.OOReuse-13 Aside: Marking Coponents/Packages A Coponent/Package can Contain Coponents, Classes, and Interfaces q Reeber, Class CL1 can be Defined in Package B and Used in Coponent X q Or, Coponent X can be Used in Package B Coponents/Packages Must Run Through Reuse Metrics/Analysis to Eliinate Bad Dependencies Package not Marked Since Utilize Portions of the Package and Not Package Itself Coponents not Marked or Assued Most General Package B Coponent X June2001.OOReuse-14 7
8 Definition 2: Reusability Dependency A Reusability Dependency (RD) is a directed arrow between two Reusability Nodes, RN x and RN y, which satisfies the following: G xi G y j q for i = 1 n x < for j = 1 n y q RN x is Most General, RN y is Least General q Arrow fro RN y to Rn x Issues: q Should it be <= Rather than <? < is Preferable, Since it Allows for a Cleaner Ordering Aong Different RNs Eliinates Abiguity in Ordering June2001.OOReuse-15 Definition 2: Reusability Dependency Issues: q Should Interfaces be Excluded fro Ordering? If Interfaces Replicated, Sae Generality Level? If Interfaces Non-Replicated, Include in Ordering? Must Support Replicated Interfaces since Different Classes can Ipleent Sae Interface Differently q Proposal regarding Interfaces Interfaces are Not Marked When Class Ipleents Interface, the Marking of the Interface is the Sae as the Marking of Class Hence, Interface Can have Different Markings in Different Classes June2001.OOReuse-16 8
9 Definition 2: Reusability Dependency Issues: q Should the Dependencies Between Gx i and be Liited Such That G x1 Can Only be Dependent on G yn j? Yes, this Constrains the Constructive Requireents of the Reusability Graph (See Defn. 3) This Constraint with Assuptions of RN (Slide 5) May Assist in Autoated Deterination of RDs If Both RNs and RDs can be Autoated, fro Source Code, Create Reusability Graph (Defn. 3) q That is, Highest Level of Generality in RN y Can only Dependent on Lowest Level in RN x G y j June2001.OOReuse-17 Quantifying a Reusability Dependency Suppose RN x has Generality Levels of: G 0 G 1 G 2 Suppose RN y has Generality Levels of : G 3 G 4 Should Dependencies (Class, Method, Attr,, etc.) be Liited to fro G 3 in RN y to G 2 in RN x? Or, are Liits Unnecessary? CL1 INT_1 CL6 INT_1 CL2 CL3 INT_2 INT_3 CL4 Package B CL5 Coponent X CL7 CL8 Package B Package C INT_4 Coponent Y June2001.OOReuse-18 9
10 Definition 3: Reusability Graph A Reusability Graph (RG) is a Directed Graph with Reusability Nodes (Defn( Defn.. 1) as Vertices which are Connected by Reusability Dependencies (Defn.. 2) Issue: Are Cycles Allowed? June2001.OOReuse-19 Issues: Reusability Graph Cycles: q A Cycle Indicates Co-Dependency Aong Multiple Reusability Nodes - D, E, and H q Does this Iply All Must be Reused Together? Autoation q Assue that Reusability Nodes can be Autoatically (Algorithically) Deterined When Given Application s Source Code q Can Reusability Graph be Autoatically Derived? Is this NP Hard? Coplete? q Can we Use Genetic Algoriths for Proble? June2001.OOReuse-20 10
11 Definition 4: Reusability Layer A Reusability Layer (RL) is a Subset of the RG that Represents a Grouping of RNs to Satisfy a Particular Doain or Organization Requireent # $ % " &! ( ' June2001.OOReuse-21 Issue: What is Scope of a Layer? Since RN A Depends on RN D which Depends on RN E which Depends on RN H which Depends on RN B, Should all For the Layer? ) *+ ) * / ) * 0 ) * 1 ) *. ) *, ) * 2 ) * - ) * 4 ) * 3 June2001.OOReuse-22 11
12 Issues: Reusability Layer Cycles: q Recall a Cycle Means Co-Dependency Aong Multiple Reusability Nodes - D, E, and H q If All Must be Reused Together then Will this Ipact Layering - Must Layer Always Contain all Nodes in Cycle? Can Layer Contain only Part of Cycle? Autoation q Intuitively, Autoating Layers Doesn t Make Sense q Layer is Doain Specific and Dictated by Designer June2001.OOReuse-23 Future Work Issues for Layering and Reusability What are Liitations Across Layers? None??? How are Dependencies Tracked? q Defn. of RN and RD Can There be Different Layered Perspectives for Sae Design? Can All Layerings Coexist Together? Are Layerings Application Specific? q Yes to all Three - As shown on Previous Slide? What are Issues to Develop a Reuse Model for Levels and Layers? q Foral Model and Analysis q Inter-Layer vs. Intra-Layer Reuse q Inter-Level vs. Intra-Level Reuse Is there an EB Exaple to Deonstrate Ideas? June2001.OOReuse-24 12
13 Reusability and XML (DN) June 2001 IEEE Coputer(p.66): XML Leaves Unresolved How to Best Specify Intersyste Mappings q Analysts need Tools to record Intersyste Relationships and Mappings to Counity Standard DTDs or Scheas and to ake the Available for Reuse XML Abstractions Ipacting Reuse q SOAP, Extending XML Datatypes q Linking Resources in XML as applied to Reuse Extended Links Traversal Rules June2001.OOReuse-25 XML, OO, and Reuse Our Approach to Analyzing Reuse Exaines Counication Between OO Classes Siple Object Access Protocol (SOAP)( Messages use XML Docuents to Allow Internet Counication Between Applications q q Can SOAP Messages For the Basis of our Reuse-Focused Counication Analysis, or Does Another Aspect of XML Meet our Counication Analysis Interests? June2001.OOReuse-26 13
14 The Nature of XML Data Types Currently, An XML Coplex Type May be Extended Only Through Appending Will Eerging XSDL Support Seantic Inheritance? q Negative Overriding/Partial Inheritance Allows Designer to Inherit soe Properties, and Suppress Other Properties q Is Seantic Inheritance Critical to our Reuse Interests? June2001.OOReuse-27 Linking Resources in XML Creation/Description of Links Between Resources q Associate Metadata With a Link q Express Links that Reside in a Location Separate fro the Linked Resources q Runtie Traversal via Link Base Doc1 Virtual Relationship? (Ipact on Reuse?) Link Base DocA DocC DocB June2001.OOReuse-28 14
15 What is an XML Link? An XML Link is an Explicit Relationship Between Resources or Portions of Resources Made Explicit by an XLink Linking Eleent Asserting the Existence of a Link When a Link Associates a Set of Resources, Those Resources Are Said to Participate in the Link q Such Links are Able to Associate All Kinds of Resources, Not Just XML-Encoded Ones June2001.OOReuse-29 Extended Links Offer 3rd-Party Arcs and Links With Arbitrary Nu of Participating Resources. Can Include Eleents for: q Pointing to Reote Resources, q Containing Local Resources, q Specifying Arc Traversal Rules XLink Provides Seantics for Finding Linkbases q Docuents Containing Collections of Inbound and Third-party Links Are Called Link Databases, or Linkbases. June2001.OOReuse-30 15
16 Extended Links: Associate Resources and Provide Traversal Rules Local to Reote ResourceA Local to Reote ResourceB Extended Link Associates 3 Resources Provides 2 Traversal Rules Local to Reote ResourceC June2001.OOReuse-31 XLink Eleent Type The Type Attribute Indicates the Eleent Type: q q Dictates the XLink-Iposed Constraints That Such an Eleent Must Follow, and The Behavior of the XLink Application upon Encountering the Eleent Does such Behavior play a Role siilar to Method Invocation in ters of Evaluating Reuse? June2001.OOReuse-32 16
17 Future Work XML Reuse Considerations Do Arcs,Type, Seantic or Behavior Attributes provide Static Typing Info Usable in Aiding Reuse Evaluation of XML Designs? q q Spice (Extended Java-Script) has been used to Specify XML Docuent Behavior. Does Spice Play a Role in our Reuse Focus? How Does Dynaic Behavior of XML Linkbases Ipact XML Reuse? What Other XML Abstractions/Dependencies Exist that Ipact Reuse? June2001.OOReuse-33 Prototyping Progress in DRE and TCC (SD & JE) Suary of Prototyping Milestones Results and Status of CSE367 Project q Work by H. Lin on DRE q Work by X. Wang on TCC DRE Status q GUI Finalized q Siulator Copleted q Parser Integrated q Help Subsyste Copleted Togethersoft Control Center Status q Developed Extensive Set of Plug-ins q UML Design Level Reusability Definition June2001.OOReuse-34 17
18 Schedule (Spring 2001) Data Structures q JE & Tea q Septeber-October 2000 q January-February 2001 Java Parser q Tea q October-Noveber 2000 q February-May 2001 Metrics Schee & Calculator q JE q Noveber-Deceber 2000 q March 2001 GUI q Tea q October-Deceber 2000 q February-May 2001 June2001.OOReuse-35 Schedule (Spring 2001) Help Syste q Tea & JE q Deceber 2000 q March-April 2001 Siulation Tool q JE q February-May 2001 Together Control Center Application q Tea & JE q Septeber-Deceber 2000 q February-May 2001 Characterization File q JE q January 2001 q March 2001 June2001.OOReuse-36 18
19 Main Application Window June2001.OOReuse-37 Main Window Setting Generality June2001.OOReuse-38 19
20 Main Window Setting Relations June2001.OOReuse-39 Main Window Choosing Siulation Options June2001.OOReuse-40 20
21 Help Subsyste HTML-based Docuents Describe Tool & Theory June2001.OOReuse-41 Reuse in Togethersoft Control Center Integrates Visual Modeling via IDE q Ipleents UML/Supports Java and C++ q Source Code Editing q Model/Code Synchronization q Open API and Plugin Support (Written in Java) Single Integrated Design/Developent Environent with Reusability Assessent Leverage TCC to Support Reusability at Design Level q Incorporate G/S and Related at UML Level q Users can Execute Plug Ins for Each q Actual Properties for UML Classes Modified June2001.OOReuse-42 21
22 Reusability in Together CC June2001.OOReuse-43 Reusability in Together CC June2001.OOReuse-44 22
23 Reusability in Together CC June2001.OOReuse-45 Reusability in Together CC June2001.OOReuse-46 23
24 Future Work Prototyping, Together CC, and XML Version Releases q v2.00 Deceber 2000 (Unreleased) q v2.01 April 9, 2001 q v2.02 June 12, 2001 Future Work q Continue TCC Research q Ipleent Recoendations Usability Requests Feedback q q C++? DRE Research Displaying Coupling Counts Masters Thesis XML and Reuse? June2001.OOReuse-47 Reusability and Genetic Algoriths Objectives (RC & SD) Design and Ipleent a New DRE Parser Using Java Copiler Copiler Parser Generator Tool q Use of the Java Graar Specification Allows Easier Maintenance of DRE Parser q Iproveent of Current Parser: Isolation of Parser and Data Structures Use a Genetic Algorith to Find a Near Optial Class Generality Marking q Can Genetic Algorith be Utilized to Autoate Deterining Marking? q Class Marking That Miniizes a Function of the Coupling Counts q User Presented Actual Generality Level of Classes Based on Cross-References in Code June2001.OOReuse-48 24
25 Parser Generation Java Copiler Copiler Javacc is a Parser Generator Tool q Copiles a Graar Specification into Java q Augent Graar Specification with Seantic Actions - Java Code q Resulting Progra Recognizes Java Source Code and Generates Java Code That Creates DRE Data_Structures Objects Java Graar.jj JavaCC DRE Parser.java DRE Tool Runtie Java File.java DRE Parser DRE.data_structures Objects June2001.OOReuse-49 Genetic Algorith Stochastic Search Method Inspired in Natural Evolution Population-based Rando Variation/Selection Applied to Data Structures with Goal/Initialization Characteristics: q Genetic Operators (Selection, Crossover, Mutation) q Population of Chroosoes (Bit Strings) Encode Candidate Solutions in Search Space q Selection Based on the Fitness of Each Chroosoe Proble: Current GA with Liited Assuptions Tends to Yield all General Classes! June2001.OOReuse-50 25
26 Near Optial Class Generality Marking Coupling Counts Class Marking G CC1 G G CC3 S CC5 CC7 S S June2001.OOReuse-51 Genetic Algorith and Reuse Towards Guided Software Reusability Assessent Multi-Step Iterative Process: q Deterine Set of Assuptions Regarding Generality Levels of Generality that are Required Related Iplied by Dependencies or Set by User q Key Issue is to Define Constraints that Will Underlie the GA Fitness Function q Run the Genetic Algorith on Code for Fixed Population and Nuber of Generations q Evaluation of Results - Potential to Rerun with Changed Assuptions, Population, Generations q Converge Towards Reasonable Marking June2001.OOReuse-52 26
27 Future Work Genetic Algorith and RNs, RDs,, RG Current Independent Study - Rodrigo Caballero Investigating GA Work and Ph.D. Research q Exaining Related Research in Refactoring, Reuse Metrics, etc. q Conducting Experients using GA Algorith regarding Assuptions, Fitness Functions,etc. q Considering Role of RNs and RDs in Arriving at Realistic and Meaningful Marking q Towards Guided Reusability Assessent Allow SWE Input re. Assuptions, Generality, Related, etc. Apply GA Algoriths Based on SWE Input Provide Integrated Environent to Guide SWE June2001.OOReuse-53 Future Work - Reusability - Suary Short Ter (By 9/2001) q Prototype (DRE /TCC) - JE and XW q GA Work - RC q Initial Foral Reuse Model -SD q XML/Reuse - DN/JE q Journal Paper (All) Long Ter (By 5/2002) q Copleted Prototypes q Progress on GA Work q Foral Reuse Model q MS Thesis on XML and Reuse q Conference and 2nd Journal Articles Research - Through 2004 q Focus on Coprehensive Reuse Fraework q Guided Reusability Assessent/GA Analysis q Coponent Repository with Seantic Search Capabilities q Leverage Doain/Organization Specificity q UML, XML, and Java Coponents June2001.OOReuse-54 27
Reusability Analysis for Shipbuilding Components Modeled in XML and Java
Reusability Analysis for Shipbuilding Coponents Modeled in XML and Java Prof. Steven A. Deurjian, Sr., Jeffrey R. Ellis, Rodrigo Caballero, Felix Eickhoff, Shaikit Das, and Xiaopei Wang Coputer Science
More informationMapping 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 informationDifferent 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 informationSurvivability Function A Measure of Disaster-Based Routing Performance
Survivability Function A Measure of Disaster-Based Routing Perforance Journal Club Presentation on W. Molisz. Survivability function-a easure of disaster-based routing perforance. IEEE Journal on Selected
More informationDesigning 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 informationResearch on a Kind of QoS-Sensitive Semantic Web Services Composition Method Based on Genetic Algorithm
roceedings of the 7th International Conference on Innovation & Manageent 893 Research on a Kind of QoS-Sensitive Seantic Web Services Coposition Method Based on Genetic Algorith Cao Hongjiang, Nie Guihua,
More informationAn 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 informationDesign 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 informationIdentifying 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 informationTHE 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 informationDefining 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 informationThe 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 informationRECONFIGURABLE 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 informationImage 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 informationCarving 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 informationStructural 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 informationA 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 informationInternational 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 informationUtility-Based Resource Allocation for Mixed Traffic in Wireless Networks
IEEE IFOCO 2 International Workshop on Future edia etworks and IP-based TV Utility-Based Resource Allocation for ixed Traffic in Wireless etworks Li Chen, Bin Wang, Xiaohang Chen, Xin Zhang, and Dacheng
More informationAdaptive 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 informationAnnexure- (Modified) 07
RFP for Selection of Service Provider for Panchdeep O&M (Annexure-07) Annexure- (Modified) 07 Profile of Software Manpower required for nology proveent, Additional Software Functionalities Developent Change
More informationA Fast Multi-Objective Genetic Algorithm for Hardware-Software Partitioning In Embedded System Design
A Fast Multi-Obective Genetic Algorith for Hardware-Software Partitioning In Ebedded Syste Design 1 M.Jagadeeswari, 2 M.C.Bhuvaneswari 1 Research Scholar, P.S.G College of Technology, Coibatore, India
More informationGenerating Mechanisms for Evolving Software Mirror Graph
Journal of Modern Physics, 2012, 3, 1050-1059 http://dx.doi.org/10.4236/jp.2012.39139 Published Online Septeber 2012 (http://www.scirp.org/journal/jp) Generating Mechaniss for Evolving Software Mirror
More informationClosing 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 informationResource Optimization for Web Service Composition
Resource Optiization for Web Coposition Xia Gao, Ravi Jain, Zulfikar Razan, Ulas Kozat Abstract coposition recently eerged as a costeffective way to quickly create new services within a network. Soe research
More informationDerivation 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 informationOPTIMAL 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 informationCollaborative 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 informationPredicting x86 Program Runtime for Intel Processor
Predicting x86 Progra Runtie for Intel Processor Behra Mistree, Haidreza Haki Javadi, Oid Mashayekhi Stanford University bistree,hrhaki,oid@stanford.edu 1 Introduction Progras can be equivalent: given
More informationA Novel 2D Texture Classifier For Gray Level Images
2012, TextRoad Publication ISSN 2090-4304 Journal of Basic and Applied Scientific Research www.textroad.co A Novel 2D Texture Classifier For Gray Level Iages B.S. Mousavi 1 Young Researchers Club, Zahedan
More informationScalable search-based image annotation
Multiedia Systes DOI 17/s53-8-128-y REGULAR PAPER Scalable search-based iage annotation Changhu Wang Feng Jing Lei Zhang Hong-Jiang Zhang Received: 18 October 27 / Accepted: 15 May 28 Springer-Verlag 28
More informationVerifying 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 informationOblivious 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 informationGeo-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 informationPOSITION-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 informationInvestigation 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 informationTensorFlow 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 informationA Low-cost Memory Architecture with NAND XIP for Mobile Embedded Systems
A Low-cost Meory Architecture with XIP for Mobile Ebedded Systes Chanik Park, Jaeyu Seo, Sunghwan Bae, Hyojun Ki, Shinhan Ki and Busoo Ki Software Center, SAMSUNG Electronics, Co., Ltd. Seoul 135-893,
More informationAscending order sort Descending order sort
Scalable Binary Sorting Architecture Based on Rank Ordering With Linear Area-Tie Coplexity. Hatrnaz and Y. Leblebici Departent of Electrical and Coputer Engineering Worcester Polytechnic Institute Abstract
More informationScheduling 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 informationShortest 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 informationExperiences 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 informationComputer 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 informationA Broadband Spectrum Sensing Algorithm in TDCS Based on ICoSaMP Reconstruction
MATEC Web of Conferences 73, 03073(08) https://doi.org/0.05/atecconf/087303073 SMIMA 08 A roadband Spectru Sensing Algorith in TDCS ased on I Reconstruction Liu Yang, Ren Qinghua, Xu ingzheng and Li Xiazhao
More informationClustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering
Clustering Cluster Analysis of Microarray Data 4/3/009 Copyright 009 Dan Nettleton Group obects that are siilar to one another together in a cluster. Separate obects that are dissiilar fro each other into
More informationAn 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 informationAN APPROACH ON BIMODAL BIOMETRIC SYSTEMS
AN APPROACH ON BIODAL BIOETRIC SYSTES Eugen LUPU, Siina EERICH Technical University of Cluj-Napoca, 26-28 Baritiu str. Cluj-Napoca phone: +40-264-40-266; fax: +40-264-592-055; e-ail: Eugen.Lupu @co.utcluj.ro
More informationEnergy Efficient Design Strategies of Translucent and Transparent IP Over WDM Networks
Energy Efficient Design Strategies of Translucent and Transparent IP Over WDM Networs F. Mousavi Madani Departent of coputer engineering Alzahra University Tehran, Iran, osavif@alzahra.ac.ir Received:
More informationCS 361 Meeting 8 9/24/18
CS 36 Meeting 8 9/4/8 Announceents. Hoework 3 due Friday. Review. The closure properties of regular languages provide a way to describe regular languages by building the out of sipler regular languages
More informationStructuring 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 informationCompiling an Honest but Curious Protocol
6.876/18.46: Advanced Cryptography May 7, 003 Lecture 1: Copiling an Honest but Curious Protocol Scribed by: Jonathan Derryberry 1 Review In previous lectures, the notion of secure ultiparty coputing was
More informationCollection 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 informationA Low-Cost Multi-Failure Resilient Replication Scheme for High Data Availability in Cloud Storage
216 IEEE 23rd International Conference on High Perforance Coputing A Low-Cost Multi-Failure Resilient Replication Schee for High Data Availability in Cloud Storage Jinwei Liu* and Haiying Shen *Departent
More informationTrees. Linear vs. Branching CSE 143. Branching Structures in CS. What s in a Node? A Tree. [Chapter 10]
CSE 143 Trees [Chapter 10] Linear vs. Branching Our data structures so far are linear Have a beginning and an end Everything falls in order between the ends Arrays, lined lists, queues, stacs, priority
More informationBoosted Detection of Objects and Attributes
L M M Boosted Detection of Objects and Attributes Abstract We present a new fraework for detection of object and attributes in iages based on boosted cobination of priitive classifiers. The fraework directly
More informationAn Ad Hoc Adaptive Hashing Technique for Non-Uniformly Distributed IP Address Lookup in Computer Networks
An Ad Hoc Adaptive Hashing Technique for Non-Uniforly Distributed IP Address Lookup in Coputer Networks Christopher Martinez Departent of Electrical and Coputer Engineering The University of Texas at San
More informationEnhancing 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 informationRule 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 informationA Practical Introduction to ATLAS
A Practical Introduction to ATLAS Christophe Laprun, Jonathan G. Fiscus, John Garofolo, Sylvain Pajot National Institute of Standards and Technology 100 Bureau Drive Mail Stop 8940 Gaithersburg, MD 20899-8940
More informationM 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 informationDevelopment 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 informationA 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 information1 P a g e. F x,x...,x,.,.' written as F D, is the same.
11. The security syste at an IT office is coposed of 10 coputers of which exactly four are working. To check whether the syste is functional, the officials inspect four of the coputers picked at rando
More informationJoint 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 informationEntity 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 informationA Formal Approach to Fault Tree Synthesis for the Analysis of Distributed Fault Tolerant Systems
A Foral Approach to Fault Tree Synthesis for the Analysis of Distributed Fault Tolerant Systes Mark L. McKelvin, Jr., Gabriel Eirea, Claudio Pinello, Sri Kanajan, and Alberto L. Sangiovanni-Vincentelli
More informationProblem Solving of graph correspondence using Genetics Algorithm and ACO Algorithm
Proble Solving of graph correspondence using Genetics Algorith and ACO Algorith Alireza Rezaee, 1, Azizeh Ajalli 2 Assistant professor,departent of Mechatronics Engineering, Faculty of New Sciences and
More informationOptimal Route Queries with Arbitrary Order Constraints
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL.?, NO.?,? 20?? 1 Optial Route Queries with Arbitrary Order Constraints Jing Li, Yin Yang, Nikos Maoulis Abstract Given a set of spatial points DS,
More informationELEN : Project Progress Report. Second Order Delay Computation for RC networks with Non-Tree Topology
ELEN 689-603: Project Progress eport Second Order Delay Coputation for C networks wi Non-Tree Topology ajeshwary Tayade 000 07 573 //003 PDF created wi pdffactory trial version www.pdffactory.co : Introduction
More information6.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 informationModeling 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 informationFeature 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 informationNON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH
NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH V. Atienza; J.M. Valiente and G. Andreu Departaento de Ingeniería de Sisteas, Coputadores y Autoática Universidad Politécnica de Valencia.
More informationEffects of Interleaving on RTP Header Compression
Effects of Interleaving on RTP Header Copression Colin Perkins Jon Crowcroft Departent of Coputer Science University College London Gower Street London WCE 6BT Abstract We discuss the use of interleaving
More informationDesign and Implementation of Business Logic Layer Object-Oriented Design versus Relational Design
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: Ali.a.alharthy@student.uts.edu.au
More informationThe 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 informationADAPTIVE EVOLUTIONARY ALGORITHMS ON UNITATION, ROYAL ROAD AND LONGPATH FUNCTIONS
ADAPTIVE EVOLUTIONARY ALGORITHMS ON UNITATION, ROYAL ROAD AND LONGPATH FUNCTIONS J. Neal Richter, John Paxton Coputer Science Departent, Montana State University, 357 EPS, Bozean, Montana 5974 http://www.cs.ontana.edu
More informationPlanet Scale Software Updates
Planet Scale Software Updates Christos Gkantsidis 1, Thoas Karagiannis 2, Pablo Rodriguez 1, and Milan Vojnović 1 1 Microsoft Research 2 UC Riverside Cabridge, UK Riverside, CA, USA {chrisgk,pablo,ilanv}@icrosoft.co
More informationMinimax Sensor Location to Monitor a Piecewise Linear Curve
NSF GRANT #040040 NSF PROGRAM NAME: Operations Research Miniax Sensor Location to Monitor a Piecewise Linear Curve To M. Cavalier The Pennsylvania State University University Par, PA 680 Whitney A. Conner
More informationNews 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 informationLeveraging 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 informationUsing 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 informationA verifiable architecture for multi-task, multi-rate synchronous software
A verifiable architecture for ulti-task, ulti-rate synchronous software A. Jean-Louis Caus,Pierre Vincent, Olivier Graff 2, Sebastien Poussard 2 : Esterel Technologies, 9 rue Michel Labrousse 300 Toulouse
More informationA Model Free Automatic Tuning Method for a Restricted Structured Controller. by using Simultaneous Perturbation Stochastic Approximation
28 Aerican Control Conference Westin Seattle Hotel, Seattle, Washington, USA June -3, 28 WeC9.5 A Model Free Autoatic Tuning Method for a Restricted Structured Controller by Using Siultaneous Perturbation
More informationDatabase 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 informationA Non-greedy Decision Tree Algorithm. Kristin P. Bennett. Rensselaer Polytechnic Institute. Troy, NY 12180
Global Tree Optiization: A Non-greedy Decision Tree Algith Kristin P. Bennett Eail benne@rpi.edu Departent of Matheatical Sciences Rensselaer Polytechnic Institute Troy, NY 28 Abstract A non-greedy approach
More informationQUERY 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 informationPrivacy-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 informationAuthor. 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 informationImprove Peer Cooperation using Social Networks
Iprove Peer Cooperation using Social Networks Victor Ponce, Jie Wu, and Xiuqi Li Departent of Coputer Science and Engineering Florida Atlantic University Boca Raton, FL 33431 Noveber 5, 2007 Corresponding
More informationFeature 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 informationSummary. Reconstruction of data from non-uniformly spaced samples
Is there always extra bandwidth in non-unifor spatial sapling? Ralf Ferber* and Massiiliano Vassallo, WesternGeco London Technology Center; Jon-Fredrik Hopperstad and Ali Özbek, Schluberger Cabridge Research
More informationComparing 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 informationHomework 1. An Introduction to Neural Networks
Hoework An Introduction to Neural Networks -785: Introduction to Deep Learning Spring 09 OUT: January 4, 09 DUE: February 6, 09, :59 PM Start Here Collaboration policy: You are expected to coply with the
More informationEfficient 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 informationA 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 informationStoring and Accessing Live Mashup Content in the Cloud
Storing and Accessing Live ashup Content in the Cloud Krzysztof Ostrowski Cornell University Ithaca, NY 14853, USA krzys@cs.cornell.edu Ken Biran Cornell University Ithaca, NY 14853, USA ken@cs.cornell.edu
More informationDetection 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 informationAGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM
International Journal of Software Engineering & Applications (IJSEA), Vol.6, No.5, Septeber 205 AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM Xie Yang and Cheng Wushan College of Mechanical Engineering,
More informationMAC schemes - Fixed-assignment schemes
MAC schees - Fixed-assignent schees M. Veeraraghavan, April 6, 04 Mediu Access Control (MAC) schees are echaniss for sharing a single link. MAC schees are essentially ultiplexing schees. For exaple, on
More information