CONFRANCE SALANE ANJOMANE COMPUTER IRAN | Year:2004 | دوره:9 |Papers Count:32

THIS PAPER TREATS OF THE IMPORTANCE OF THE ANALYSIS THROUGH VIEWSPOINTS IN E-BUSINESS. THEN IT PRESENTS A METHOD BASED ON VALUE FOR VIEWPOINT IN E-BUSINESS. THE MAIN OBJECTIVE IS TO DEMONSTRATE THE TECHNICAL AND COMMERCIAL VIABILITY OF A NEW IDEA. IT IS PROPOSED A METHOD THAT MAKES AN EXTENSION OF USE CASE MAP FOR E-COMMERCE, IT USES THE E3-VALUE AND THE GOAL BASED REQUIREMENT ANALYSES METHOD (GBRAM) IN THE ELICITATION PROCESS IT IS WAITED THAT THE OBJECTIVE METHOD (OBJE3-VALUE) IT REDUCES THE TIME OF UNDERSTANDING AND BEGIN OF THE DEVELOPMENT OF THE IDEA. IT’S STILL PRESENTED A STUDY OF CASE.

DUE TO FAST INCREASE IN LINE SPEEDS AND NUMBER OF NETWORKS, BACKBONE ROUTERS NEED FAST AND SCALABLE IP LOOKUP SCHEMES. HARDWARE SOLUTIONS ARE FAST BUT, GENERALLY, LESS SCALABLE THAN SOFTWARE-BASED SOLUTIONS. IN THIS PAPER, WE PRESENT GENERIC HARDWARE UNITS TO ACCELERATE THE IP LOOKUP IN SOFTWARE. EXPERIMENTAL RESULTS SHOW THAT USING DMP-TREE DATA STRUCTURE FOR IP LOOKUP, MORE THAN 30% IMPROVEMENT CAN BE OBTAINED BY ADDING SIMPLE INSTRUCTIONS TO THE RUNNING PROCESSOR WITHOUT ANY SPECIAL CUSTOMIZATION. OUR HARDWARE UNITS EMBEDDED IN SOFTWARE-DRIVEN ENVIRONMENT (I.E A GENERIC PROCESSOR) CAN ACCELERATE OTHER PACKET PROCESSING OPERATIONS SUCH AS PARSING, QUALITY OF SERVICE (QOS), FILTERING AND CLASSIFICATION.

A REAL-TIME COLLISION WARNING SYSTEM BASED ON TLC1 COMPUTATION IS PROPOSED. MULTI-FRAME LANE DETECTION AND ANALYSIS ARE ADOPTED SO THAT THE TLC CALCULATION ALGORITHM IS MORE RELIABLE. LANE DEPARTURE IS ANALYZED AND VEHICLE COORDINATION IS ESTIMATED. THESE PARAMETERS CAN BE USED IN AN INTELLIGENT VEHICLE FOR WARNING OR LATERAL CONTROL. EXPERIMENTAL RESULTS SHOW THAT THE PROPOSED ALGORITHM, CALCULATES TLC ACCEPTABLY.

THIS PAPER PROPOSES A COMBINED METHOD FOR SEQUENTIAL CIRCUIT TEST GENERATION WHICH EMPLOYS STGBASED AND GA-BASED TEST GENERATION TECHNIQUES. ALMOST ALL PREVIOUS HYBRID TEST GENERATORS USE ALGORITHMIC DECOMPOSITION, BUT THE PROPOSED METHOD USES CIRCUIT DECOMPOSITION. SO THE STG-BASED TECHNIQUES ARE USED TO GENERATE TEST FOR CONTROL UNIT AND TEST GENERATION FOR DATAPATH UNIT IS PERFORMED BY RESORTING TO GA-BASED TECHNIQUES. THE COMBINATION OF THE TWO TECHNIQUES IS EXPECTED TO PROVIDE HIGH FAULT COVERAGES IN A REASONABLE TIME. EXPERIMENTAL RESULTS SHOW THE EFFECTIVENESS OF THE APPROACH.

THIS PAPER PRESENTS A NEW FAULT - TOLERANT ROUTING ALGORITHM IN HYPERCUBE MULTICOMPUTER BASED ON THE LOCAL-INFORMATION OF EACH NODE. IN THIS ALGORITHM, EACH NODE IS ONLY AWARE OF ITS NEIGHBOR’S STATUS AND MAKES ROUTING DECISION USING THIS INFORMATION AND THE DESTINATION ADDRESS OF A MESSAGE. THIS BOUNDED LOCAL - INFORMATION, WHOSE ARE NUMERABLE, CAUSES THE ALGORITHM TO BE MORE ADAPTIVE WITH RESPECT TO THE SIMILAR WORKS, E.G. PROBABILITY VECTOR. DUE TO THE LOW OVERHEAD OF COMMUNICATIONS NEEDED FOR CONSTRUCTING THE LOCAL-INFORMATION, DYNAMIC FAULTS ARE HIGHLY TOLERABLE AS WELL AS STATIC FAULTS. SIMULATION RESULTS REVEAL THAT, IN THE CASE OF STATIC FAULTS, THE LATENCY OF MESSAGES IS REDUCED UP TO20 PERCENT AND IN THE PRESENCE OF DYNAMIC FAULTS, THE THROUGHPUT OF MESSAGE DELIVERY WITH WORMHOLE SWITCHING IS CONSIDERABLY IMPROVED.

IN THE PROBLEM OF TASK ALLOCATION IN MULTIAGENT SYSTEMS, IT IS VERY DESIRABLE TO BE ABLE TO GUARANTEE THE ERROR RATE OF A SOLUTION IN AN AGENT SOCIETY. IN THIS PAPER, A NOVEL APPROACH FOR THIS PROBLEM HAS BEEN INTRODUCED BY DEVISING A MATHEMATICAL MODEL WITH PROBABILISTIC APPROACHES. IT IS ALSO SHOWN THAT THE MULTIAGENT SYSTEM IS ABLE TO ACHIEVE ANY DESIRED AND PREDETERMINED THRESHOLD OF CORRECTNESS FOR THE FINAL SOLUTION, REGARDLESS OF THE PERFORMANCE OF SELFISH AGENTS IN THE SOCIETY OR ANY STIPULATION ABOUT THEIR HONESTY, WHICH IS EXTREMELY CRITICAL IN THE DESIGN OF OPEN AND REAL-WORLD MULTIAGENT SYSTEMS.

BECAUSE OF THE INCREASING COMPLEXITY OF SOFTWARE APPLICATIONS, IT IS BECOMING MORE AND MORE COMPLICATED TO DEVELOP THEM FROM SCRATCH.DEVELOPING SOFTWARE APPLICATIONS BY USING EXISTING SOFTWARE COMPONENTS IS A SOLUTION TO THIS PROBLEM.BUT, BEFORE EVERYTHING, WE WILL INTRODUCE SOFTWARE COMPONENTS AS A SOLUTION TO SOFTWARE CRISIS AND SOFTWARE ENGINEERING PROBLEMS. BY SOFTWARE CRISIS WE MEAN THE LACK OF PRODUCTIVITY AND PERFORMANCE IN THE SOFTWARE DEVELOPMENT PROJECTS. USING EXISTING SOFTWARE COMPONENTS IN THE DEVELOPMENT OF NEW SOFTWARE APPLICATIONS HAS SOME ADVANTAGES AND DISADVANTAGES. IN THIS PAPER, WE WILL TALK ABOUT SOME OF THESE ISSUES. ANOTHER PROBLEM RELATES TO THE DEFINITION OF SOFTWARE COMPONENTS ITSELF.UNFORTUNATELY, THERE IS NO STANDARD AND SPECIFIC DEFINITION OF SOFTWARE COMPONENTS. IN THIS PAPER, WE TRY TO DEFINE A COMPREHENSIVE SET OF ATTRIBUTES FOR CHARACTERIZING SOFTWARE COMPONENTS IN A REPOSITORY OF SOFTWARE COMPONENT PRODUCTS. THESE ATTRIBUTES ARE CLASSIFIED INTO SIX MAJOR CATEGORIES: SOURCE, SPECIFICATION, PACKAGING, MODIFICATION, REQUIREMENTS, AND QUALITY ATTRIBUTES.

THIS PAPER PRESENTS A NEW APPROACH FOR GENERATING SCIENTIFIC TECHNIQUES BASED ON A KIND OF COMPOSITIONAL ADAPTATION. IN THIS RESPECT, PROBLEM SITUATION AND SOLUTION ARE REPRESENTED IN TERMS OF APPROPRIATE FRAMES AND TREE STRUCTURES RESPECTIVELY, AND THE FINAL SOLUTION IS THEN OBTAINED THROUGH COMPOSING THE SOLUTIONS OF THE SIMILAR CASES USING A GLOBAL DISTANCE FUNCTION. THE WORKABILITY OF THIS APPROACH HAS BEEN EXAMINED FOR THE DOMAIN OF IMAGE PROCESSING. THE PROPOSED APPROACH CAN BE APPLIED TO ANY SCIENTIFIC DOMAIN WITHIN WHICH, GOALS CAN BE DEFINED IN TERMS OF APPROPRIATE ACTIONS.

BRANCH PREDICTION IS IMPORTANT IN HIGH-PERFORMANCE MICROPROCESSOR DESIGN. AMONG BRANCH PREDICTION MECHANISMS, DYNAMIC BRANCH PREDICTORS ARE THE BEST BECAUSE THEY CAN DELIVER ACCURATE BRANCH PREDICTION REGARDLESS OF INPUT CHANGES OR THE PROGRAM BEHAVIOR. HOWEVER IN ALL EXISTING DYNAMIC BRANCH PREDICTORS, THE INTERFERENCE EFFECTS DUE TO ALIASING IN THE PREDICTION TABLES ARE THE MOST IMPORTANT CAUSES OF BRANCH MISPREDICTIONS.IN THIS PAPER SOME POPULAR HASH FUNCTIONS USED IN DIFFERENT COMPUTER APPLICATIONS ARE PROPOSED AND THEIR EFFECTS ON DYNAMIC BRANCH PREDICTORS ARE ANALYZED. WE INVESTIGATE HASH INFLUENCE ON BRANCH PREDICTION ACCURACY IN BOTH ANALYTICAL AND EXPERIMENTAL WAYS. OUR EXPERIMENTAL RESULTS SUGGEST THAT HASH CAN BE INCREMENTALLY EFFECTIVE ON BRANCH PREDICTION ACCURACY AND THIS INCREASE IS DEPENDENT ON BRANCH BEHAVIOR.

THIS PAPER INTRODUCES A SYNTHESIS TOOL FOR TEMPLATE-BASED SYNTHESIS OF ASYNCHRONOUS CIRCUITS. THE TOOL, NAMED TEMPLATE SYNTHESIZER (TSYN) AND IT IS A PART OF A COMPLETE ASYNCHRONOUS DESIGN FLOW NAMED PERSIA. THIS TOOL TRANSFORMS A BEHAVIORAL DESCRIPTION OF A CIRCUIT TO A SIZED TRANSISTOR NET-LIST. THE INPUT BEHAVIORAL DESCRIPTION MUST FIT INTO SOME PREVIOUSLY KNOWN TEMPLATES. THESE TEMPLATES ARE GENERAL ENOUGH TO ALLOW IMPLEMENTATION OF ALMOST ALL CIRCUIT BLOCKS. FINALLY, AN ASYNCHRONOUS REED-SOLOMON DECODER IS SYNTHESIZED USING THIS TOOL.

IN THIS PAPER, WE FIRST GIVE A FORMAL DESCRIPTION FOR CELLULAR LEARNING AUTOMATA THEN STUDY ITS CONVERGENCE BEHAVIOR. IT IS SHOWN THAT FOR PERMUTABLE RULES, THE CELLULAR LEARNING AUTOMATA CONVERGE TO A STABLE AND COMPATIBLE CONFIGURATION. THE NUMERICAL RESULTS ALSO CONFIRM OUR THEORETICAL INVESTIGATIONS.

FRACTAL GEOMETRY IS A BRANCH OF MATHEMATICS THAT HAS FOUND APPLICATIONS IN DIFFERENT SCIENCES. NATURAL PHENOMENA THAT ARE NOT SPECIFIABLE WITH THOUSANDS OF MATHEMATICAL FORMULAE CAN BE MODELED EASILY WITH FRACTALS. VIRTUAL REALITY USES INTERACTIVE SIMULATION OF REAL WORLD TO SIMULATE A SENSE OF PRESENCE IN A REAL OR IMAGINABLE ENVIRONMENT. BECAUSE OF INCREASING DEMAND FOR VIRTUAL WORLDS, AND THE LACK OF A FAST WAY IN VISUALIZATION OF NATURAL PHENOMENA, WE HAVE STUDIED THE APPLICATIONS OF FRACTAL GEOMETRY IN VIRTUAL REALITY AND ITS 3D MODELING LANGUAGE (VRML). WE FOUND THAT LARGE NATURAL WORLDS MODELED IN VRML CAN TAKE A VERY LONG TIME TO DOWNLOAD AND RENDER.WEB3D CONSORTIUM HAS INTRODUCED X3D AS THE NEXT GENERATION OF VRML. THIS PAPER, PROPOSES A NEW PROFILE, NICKNAMED FRACTVRML, FOR EASILY MODELING NATURAL PHENOMENA WITH FRACTALS. THIS PROFILE ADDS MORE THAN 16 NEW NODES TO X3D USING EXTENSIBILITY MECHANISM OF X3D. IT ALSO ADDS SUPPORT FOR COMPLEX COORDINATES USING QUATERNIONS. IN ADDITION TO HIGH RESOLUTION, NATURAL SCENES DESIGNED WITH FRACTVRML HAVE LOWER VOLUME.FRACTVRML PROVIDES MORE NATURAL REPRESENTATION OF OBJECTS, AS WELL AS MAKING NOTICEABLE IMPROVEMENTS IN THE SPEED OF LOADING AND NAVIGATION OF SCENES IN THE WEB.

FUNCTIONALITY OF MASTER/CHECKER (M/C) MODE IS BASED ON THE REDUNDANCY OF THE PROCESSORS SUPPORTED BY MOST MODERN PROCESSORS. THIS PAPER PRESENTS AN EXPERIMENTAL EVALUATION OF THE M/C MODE IN A 32-BIT PENTIUM Ò PROCESSOR SYSTEM USING POWER-SUPPLY DISTURBANCE (PSD). THE RESULTS OF PSD SHOW THAT THE M/C MODE HAS ONLY 67.13% ERROR DETECTION COVERAGE. THE LOW COVERAGE IS CAUSED BY THE CRASHES IN THE MASTER PROCESSOR AS THE RESULT OF VOLTAGE FLUCTUATIONS. USE OF A WATCHDOG TIMER MAY RAISE THE COVERAGE UP TO 99.73%. MOREOVER, THE CORRECTNESS OF THE RESULTS PRODUCED BY THE MASTER PROCESSOR HAS BEEN CHECKED. IN MANY CASES, THE RESULTS WERE CORRECT WHILE THE CHECKER PROCESSOR ANNOUNCES AN ERROR.

GENETIC ALGORITHMS (GAS) EMULATE THE NATURAL EVOLUTION PROCESS AND MAINTAIN A POPULATION OF POTENTIAL SOLUTIONS TO A GIVEN PROBLEM. THROUGH THE POPULATION, GA IMPLICITLY MAINTAINS STATISTICS ABOUT THE SEARCH SPACE. THIS IMPLICIT STATISTICS CAN BE USED EXPLICITLY TO ENHANCE GA'S PERFORMANCE. INSPIRED BY THIS IDEA, A PATTERN-BASED ADAPTIVE UNIFORM CROSSOVER (PAUX) HAS BEEN PROPOSED. PAUX USES THE STATISTICAL INFORMATION OF THE ALLELES IN EACH LOCUS TO ADAPTIVELY CALCULATE THE SWAPPING PROBABILITY OF THAT LOCUS FOR CROSSOVER OPERATION. IN THIS PAPER PAUX IS INTRODUCED AND EXAMINED IN SOME BENCHMARK TESTS. EXPERIMENTAL RESULTS SHOW THAT USING PAUX IMPROVES THE PERFORMANCE OF TRADITIONAL GAS.

THE MAIN CONTRIBUTION OF THIS PAPER IS INTRODUCING AN APPROACH FOR EXPANDING THE CRAWLING METHODS OF CORA SPIDER, AS A RL-BASED SPIDER. WE HAVE INTRODUCED NOVEL METHODS FOR CALCULATING THE Q-VALUE IN REINFORCEMENT LEARNING MODULE OF THE SPIDER. THE PROPOSED CRAWLERS CAN FIND THE TARGET PAGES FASTER AND EARN MORE REWARDS OVER THE CRAWL THAN CORA’S CRAWLERS. WE HAVE USED SUPPORT VECTOR MACHINES (SVMS) CLASSIFIER FOR THE FIRST TIME AS A TEXT LEARNER IN WEB CRAWLERS AND COMPARED THE RESULTS WITH CRAWLERS WHICH USE NAÏVE BAYES (NB) CLASSIFIER FOR THIS PURPOSE. THE RESULTS SHOW THAT CRAWLERS USING SVMS OUTPERFORM CRAWLERS WHICH USE NB IN THE FIRST HALF OF CRAWLING A WEB SITE AND FIND THE TARGET PAGES MORE QUICKLY. THE TEST BED FOR THE EVALUATION OF OUR APPROACHES WAS WEB SITES OF FOUR COMPUTER SCIENCE DEPARTMENTS OF FOUR UNIVERSITIES, WHICH HAVE BEEN MADE AVAILABLE OFFLINE.

HERE WE INTRODUCE A NOVEL NEURO-FUZZY SYSTEM FOR APPROXIMATION AND PREDICTION OF COMPLEX PLANTS. THE PROPOSED SYSTEM USES PARAMETER ESTIMATION AND SCALING TECHNIQUES; SO CALLED PENTA WHICH STANDS FOR PARAMETER ESTIMATION NETWORK FOR TARGET APPROXIMATION. PENTA CONSISTS OF TWO MAJOR COMPONENTS: A SCALING COMPONENT AND A PARAMETER ESTIMATION UNIT. THE FIRST COMPONENT PROVIDES THE GAINS REQUIRED BY THE SECOND COMPONENT WHICH IS A SET OF PRIMITIVE FUNCTIONS USED FOR SCALING. SO THE OVERALL OUTPUT OF NETWORK IS A SYNTHETIC FUNCTION THAT IS LINEAR COMPOSITION OF THESE PARAMETERS AND PRIMITIVE FUNCTIONS. THESE TWO COMPONENTS HAVE BEEN EXPANDED THROUGH FIVE LAYERS OF A NEURO-FUZZY NETWORK. EXPERIMENTAL RESULTS SHOW THAT IN COMPARISON WITH CURRENT NEURO-FUZZY SYSTEMS LIKE ANFIS, THIS NOVEL SYSTEM CAN HAVE A BETTER ADAPTATION TO COMPLEX PLANTS. ALSO RESULTS SHOW THE UNIQUE CAPABILITY OF THIS SYSTEM, IN CONSECUTIVE PREDICTION OF CHAOTIC SYSTEMS.

DISTRIBUTED SEARCH IN INACCESSIBLE ENVIRONMENTS IS AN IMPORTANT PROBLEM IN ROBOTICS AND MULTI-AGENT SYSTEMS (MASS). VACUUM CLEANER AGENT IS A CLASSIC EXAMPLE, WHICH IS PARTICULARLY INTERESTING, SINCE IT ENCOMPASSES MANY ASPECTS OF SEARCH PROBLEMS IN MAS. IN THIS PAPER THREE DIFFERENT ARCHITECTURES THAT ARE COMPLIMENTARY TO ONE ANOTHER HAVE BEEN STUDIED TO DETERMINE THEIR SUITABILITY FOR DISTRIBUTED SEARCHES. VARIOUS INTERACTION PROTOCOLS FOR COORDINATING AN AGENT SOCIETY WERE SIMULATED AND INTERESTINGLY COMPETITION WITH BLACKBOARD PRODUCED THE BETTER RESULTS. THE EFFECT OF ENVIRONMENT ACCESSIBILITY ON PERFORMANCE WAS ALSO ANALYZED. IT WAS DEDUCED THAT IN COMPLEX ENVIRONMENTS OR PRESET SOCIETIES, WHERE IT IS IMPOSSIBLE TO CHANGE THE AGENT INTERACTION PROTOCOLS, THE SAME PERFORMANCE CAN BE GAINED BY INCREASING THE ENVIRONMENT ACCESSIBILITY FOR INDIVIDUAL AGENTS. THE EFFECTS OF UTILIZING MEMORY TO KEEP TRACK OF AGENT’S INTERNAL STATE AND INTRODUCING COMPLEXITY INTO THE ENVIRONMENT HAVE ALSO BEEN STUDIED.

SPEECH IS THE MOST NATURAL AND WIDESPREAD FROM OF HUMAN COMMUNICATION. THAT’S WHY SPEECH SYNTHESIS HAS INTERESTED RESEARCHERS FOR DECADES. IN THIS PAPER, A PERSIAN TEXT TO SPEECH SYSTEM IS PRESENTED. THE SYSTEM USES SPEECH WAVEFORM CONCATENATION METHOD THAT IS COMPARATIVELY MATURE IN TEXT - TO - SPEECH SYNTHESIS. THIS PAPER DISCUSSES THE EXPERIMENTAL STUDY ON THE USE OF NEURAL NETWORK IN TEXT - TO - SPEECH SYSTEMS FOR PERSIAN LANGUAGE. IN THE CONTEXT OF TEXT TO PHONEME CONVERSION, THE NEURAL NETWORK DEMONSTRATE GOOD PERFORMANCE. IT IS SHOWN THAT A NETWORK CAN CAPTURE SIGNIFICANT PORTION OF REGULARITIES IN THE PERSIAN PRONUNCIATION AS WELL AS ABSORB MANY OF THE IRREGULARITIES.

PHYSICAL DESIGN TASKS ARE VERY COMPLEX AND THEREFORE, ARE USUALLY DECOMPOSED INTO SEVERAL SIMPLE SUBTASKS. HOWEVER, THE INTERDEPENDENCE BETWEEN THESE SUBTASKS AND ITS EFFECT ON THE QUALITY OF THE DESIGN IS INCREASINGLY BECOMING MORE OBVIOUS. ON THE OTHER HAND, THE INCREASING COMPLEXITY OF SYSTEMS PREVENTS THE INTEGRATION OF THE PHYSICAL DESIGN SUBTASKS.THIS PAPER PRESENTS AN INTEGRATED APPROACH TO THE FLOORPLANNING, PLACEMENT AND ROUTING OF VERY LARGE MACROCELL-BASED DESIGNS. THE FRAMEWORK IS GIVEN A HIERARCHICAL SPECIFICATION AND PERFORMS THE PHYSICAL DESIGN SUBTASKS WHILE PRESERVING THE SPECIFICATION HIERARCHY.THERE ARE SOME CHALLENGING PROBLEMS IN THIS APPROACH MAINLY DUE TO THE HIGH DEGREE OF INTERDEPENDENCE BETWEEN LEVELS IN THE SPECIFICATION HIERARCHY WHICH MAKES PURE 'DIVIDE AND CONQUER' STRATEGIES USELESS. A HIERARCHICAL GLOBAL ROUTING ALGORITHM IS ALSO INTRODUCED IN THIS PAPER.

GENETIC ALGORITHMS (GA) EMULATE THE NATURAL EVOLUTION PROCESS AND MAINTAIN POPULATION OF POTENTIAL SOLUTIONS TO A GIVEN PROBLEM. BUT GA USES STATIC CONFIGURATION PARAMETERS SUCH AS CROSSOVER TYPE, CROSSOVER PROBABILITY AND SELECTION OPERATOR, AMONG THOSE, TO EMULATE THIS INHERENTLY DYNAMIC PROCESS. BECAUSE OF DYNAMIC BEHAVIOR OF GA AND CHANGES IN POPULATION PARAMETERS IN EACH GENERATION, USING ADAPTIVE CONFIGURATION PARAMETERS SOUNDS A GOOD IDEA. THIS IDEA IS CONSIDERED IN SOME RESEARCHES ABOUT GA [1, 2, 3, AND 4] BY VARIOUS AUTHORS. IN THIS RESEARCH A NEW MODIFIED STRUCTURE FOR GA IS INTRODUCED WHICH CALLED ADAPTIVE GA BASED ON LEARNING CLASSIFIER SYSTEMS (AGAL). AGAL USES A LEARNING COMPONENT TO ADAPT ITS STRUCTURE AS POPULATION CHANGES. THIS LEARNING COMPONENT USES DOMAIN KNOWLEDGE WHICH IS EXTRACTED FROM THE ENVIRONMENT TO ADAPT GA PARAMETER SETTINGS.

ALTHOUGH ASYNCHRONOUS CIRCUITS ARE ACCEPTED AS LOW-POWER, LOW-EMI AND HIGH-PERFORMANCE CIRCUITS, THE ROADBLOCK TO WIDE ACCEPTANCE OF ASYNCHRONOUS DESIGN METHODOLOGY IS POOR CAD SUPPORT, ESPECIALLY PHYSICAL DESIGN TOOL. THERE ARE FEW ACADEMIC DESIGN TOOLS FOR ASYNCHRONOUS CIRCUIT DESIGN AND SYNTHESIS, BUT THERE IS NEITHER A PUBLISHED TOOL NOR A PUBLISHED DOCUMENT ON PHYSICAL DESIGN OF THESE CIRCUITS. SINCE THERE ARE NONCOMPLEMENTARY CMOS CIRCUITS IN THE NETLIST SYNTHESIZED USING CALTECH SYNTHESIS METHOD, THE COMMERCIAL CELL-BASED PLACEMENT TOOLS CAN’T BE USED. IN THIS PAPER WE HAVE PRESENTED A DESIGN FLOW FOR PLACEMENT OF ASYNCHRONOUS CIRCUITS AT TRANSISTOR-LEVEL CONSIDERING THEIR TIMING CONSTRAINTS.

INCREASING USE OF COMMERCIAL OFF-THE-SHELF (COTS) SUPERSCALAR PROCESSORS IN INDUSTRIAL, EMBEDDED, AND REAL-TIME SYSTEMS NECESSITATES THE DEVELOPMENT OF ERROR DETECTION MECHANISMS FOR SUCH SYSTEMS. THIS PAPER PRESENTS AN ERROR DETECTION SCHEME CALLED COMMITTED INSTRUCTIONS COUNTING (CIC) TO INCREASE ERROR DETECTION IN COTS SUPERSCALAR PROCESSORS. THE SCHEME IS ANALYTICALLY EVALUATED BASED ON PROBABILISTIC MODELS OF CONTROL FLOW ERRORS (CFES). THE RESULTS SHOW THAT THE MINIMUM ERROR DETECTION COVERAGE VARIES BETWEEN TO 92.16% AND 96.29%, FOR DIFFERENT WORKLOADS.

MOST EXISTING VERIFICATION TOOLS SUFFER FROM HAVING A STANDARD LANGUAGE FOR DESIGN SPECIFICATION. ALTHOUGH MOST OF THESE TOOLS SUPPORT STANDARD HARDWARE DESCRIPTION LANGUAGES, BUT THE SUBSET OF THE HDL THEY SUPPORT IS VERY LIMITED. IN THIS PAPER WE INTRODUCE A VERIFICATION TOOL, WHICH DOES NOT HAVE THESE LIMITATIONS. WE USE SYMBOLIC MODEL CHECKING TO VERIFY A VHDL DESIGN. A DATA FLOW GRAPH (DFG) IS EXTRACTED FROM THE VHDL CODE, WHICH HAS BEEN FULLY IMPLEMENTED IN OBJECT ORIENTED FORMAT IN C++ AND COVERS ABOUT 90% OF THE SYNTHESIZABLE SUBSET OF VHDL. WE USE REDUCED ORDERED BINARY DECISION DIAGRAMS TO REPRESENT FSM DESCRIPTION OF A SYSTEM IN TERMS OF TRANSITION RELATIONS. THE CONVERSION OF DFG TO BDDS IS DONE INSIDE THE DFG CLASSES. FOR THE PROPERTY LANGUAGE, WE HAVE USED CTL WITH EXTENSIONS TO INCLUDE EVENT SEQUENCE STRUCTURES AND WORD-LEVEL PROPERTIES. FOR THESE EXTENSIONS, WE HAVE IMPLEMENTED A MULTI-VALUED DECISION DIAGRAM (MDD) PACKAGE OVER AN EXISTING BDD PACKAGE. THE COMPLETE PACKAGE IS PUT INTO A USER-FRIENDLY ENVIRONMENT FOR AUTOMATIC VERIFICATION OF FSMS. WE HAVE COMPARED OUR RESULTS WITH VIS AND SMV TOOLS.

IN THIS ARTICLE WE PROVIDE AN ALGORITHM TO VERIFY FORMULAS OF THE FRAGMENT OF RST ORDER LOGIC, CONSISTING OF QUANTI ER FREE LOGIC WITH ZERO, SUCCESSOR AND EQUALITY. WE RST DEVELOP A REWRITE SYSTEM TO EXTRACT AN EQUIVALENT ORDERED (0,S,=)-BDD FROM ANY GIVEN (0,S,=)-BDD. THEN WE SHOW COMPLETENESS OF THE REWRITE SYSTEM. FINALLY WE MAKE AN ALGORITHM WITH THE SAME RESULT AS THE REWRITE SYSTEM. GIVEN AN ORDERED (0,S,=)-BDDS WE ARE ABLE TO SEE IN CONSTANT TIME WHETHER THE FORMULA IS A TAUTOLOGY, A CONTRADICTION, OR ONLY SATIS ABLE.

WE DISCUSS THE FOLLOWING IMPORTANT PROBLEM WHICH ARISES IN COMPUTER VISION AND COMPUTER ANIMATION: GIVEN ARE N POSITIONS OR KEY FRAMES S(TI) OF A MOVING BODY SÌR3 AT TIME INSTANCES TI. COMPUTE A SMOOTH MOTION S(T) WHICH INTERPOLATES OR APPROXIMATES THE GIVEN POSITIONS S(TI), SUCH THAT CHOSEN FEATURE POINTS OF THE MOVING SYSTEM RUN ON SMOOTH PATHS. WE PRESENT AN ALGORITHM THAT CAN BE CONSIDERED AS A TRANSFER PRINCIPLE FROM CURVE DESIGN ALGORITHMS TO MOTION DESIGN. THE ALGORITHM RELIES ON KNOWN CURVE DESIGN ALGORITHMS, AND ON REGISTRATION TECHNIQUES FROM COMPUTER VISION. WE PROVE THAT THE MOTION GENERATED IN THIS WAY IS OF THE SAME SMOOTHNESS AS THE CURVE DESIGN ALGORITHM EMPLOYED. THE POTENTIAL APPLICATIONS INCLUDE KEY FRAME INTERPOLATION IN COMPUTER GRAPHICS, MOTION PLANNING IN ROBOTICS AND SMOOTH CAMERA MOTION IN VISION SYSTEMS.

IN MANY VISION APPLICATIONS, COLOR IS AN IMPORTANT CUE THAT MUST BE APPLIED VERY FAST. IN THIS PAPER, AFTER GIVING A BRIEF REVIEW ON 12 DIFFERENT STANDARD COLOR SPACES, THE PROPOSED PARAMETRIC LINEAR ADAPTIVE COLOR (PLAC) SPACE IS DEFINED. A COLOR-BASED SEGMENTATION PROCESS IS PERFORMED ON THESE COLOR SPACES. EXPERIMENTAL RESULTS SHOW THAT THE PLAC CAN BE APPLIED AT LEAST THREE TIMES FASTER THAN THE STANDARD COLOR SPACES. IN ADDITION, WITH 10% HIGHER DISTINGUISHING POWER, THE PLAC SHOWS THE FAIL RATE OF HALF AS MUCH OF THE STANDARD SPACES. THE BEST ADVANTAGE OF THE PLAC IS ITS ABILITY TO REMOVE THE ENTIRE BACKGROUND IN 75% OF THE OBJECTS; COMPARED TO THE LOW 1.69% OF THE STANDARD SPACES. AS THE PLAC NEEDS THE SEMIAUTOMATIC TUNING STAGE, THE PROPOSED PCA−PLAC METHOD IS INTRODUCED ENCAPSULATING THE ADVANTAGES OF THE PLAC WITH LESS REQUIRED USER SUPERVISION EVEN THAN THE STANDARD COLOR SPACES. THE RESULTS SHOW THE SUPERIORITY OF THE PROPOSED COLOR SPACES, WHILE THE PCA−PLAC EVEN OUTPERFORMS THE PLAC.

IN THIS PAPER, WE REPORT ON OUR DESIGN OF A CHOOSEN PLAINTEXT ATTACK WITH WORK FACTOR 2252 TO RECOVER OF THE FIRST AND THE LAST SUBKEYS OF A 7-ROUND RIJNDAEL, WHILE DIFFERENTIAL CRYPTANALYSIS AGAINST RIJNDAEL HAVE BEEN DONE FOR UP TO 6 ROUNDS AND REPORTED IN PUBLISHED PAPERS. WE FOUND A 5-ROUND BOOMERANG CHARACTERISTIC FOR RIJNDAEL, AND DESIGNED A CHOOSEN PLAINTEXT ATTACK BASED ON THIS CHARACTERISTIC, WITH WORK FACTOR 2249 TO RECOVER THE 32 BITS OF THE 1ST ROUND SUBKEY AND THE 32 BITS OF THE 7TH ROUND SUBKEY. WE ALSO DESIGNED SOME SIMMILAR ATTACKS TO RECOVER OTHER BITS OF SUBKEYS OF THE FIRST ROUND AND THE LAST ROUND. THEREFORE THE WORK FACTOR OF THIS CHOOSEN PLAINTEXT ATTACK TO RECOVER ALL BITS OF THE FIRST AND THE LAST SUBKEYS OF A 7-ROUND RIJNDAEL WILL BE 2252, THAT IS LESS THAN EXHAUSTIVE SEARCH. IT MEANES THAT A 7-ROUND RIJNDAEL WILL BE COMPROMISED WITH DIFFERENTIAL BOOMERANG CRYPTANALYSIS.

TODAY, INFORMATION RETRIEVAL IS A COMMON FOR INTERNET USERS. THE HUGE SIZE AND HETEROGENEOUS STRUCTURE OF THE WEB HAS CAUSED NEW PROBLEMS FOR ITS USERS. IN THIS IMMENSE RESOURCE OF INFORMATION, IT IS EXCEEDINGLY DIFFICULT FOR TO LOCATE RESOURCES THAT ARE BOTH HIGH IN QUALITY AND RELEVANT TO THEIR INFORMATION NEEDS. ONE OF THE MAIN TASKS OF EACH SEARCH IS PROVIDING USERS WITH THESE HIGH QUALITY AND RELEVANT RESOURCES. SEARCH ENGINES USE RANKING ALGORITHM IN ORDER TO SORT THE DOCUMENTS RELATED TO THE USER NEED.FOR RANKING WEB RESOURCE, SEVERAL RANKING METHODS HAVE BEEN INTRODUCED. IN THIS PAPER, WE PRESENT THE MOST FAMOUS WEB RANKING ALGORITHM FOR RANKING WEB PAGE, WHICH EXPLOITS HYPERLINK STRUCTURE AS WELL AS DOCUMENT CONTENTS FOR RANKING RESOURCES, WITH THE INTENT OF OVERCOMING THE DRAW BACKS OF CURRENT RANKING ALGORITHMS.

ITEM RESPONSE THEORY (IRT) IS A MODEL FOR EXPRESSING THE ASSOCIATION BETWEEN AN INDIVIDUAL'S RESPONSE TO AN ITEM AND THE UNDERLYING LATENT VARIABLE (ABILITY) BEING MEASURED BY THE INSTRUMENT. ITEM CHARACTERISTIC CURVES (ICCS) ARE ONE OF THE BASIC BLOCKS OF AN ITEM RESPONSE THEORY, ND THEIR PARAMETERS (DIFFICULTY, DISCRIMINATION AND GUESSING) MUST BE ESTIMATED ACCURATELY. THE ESTIMATED PARAMETERS WILL SUBSEQUENTLY BE USED TO FORM ICCS OF AN EXAM UPON WHICH OTHER LATTER JUDGMENTS ABOUT EXAMINEES’ ABILITIES WILL BE MADE. REGARDING THE IMPORTANCE OF ASSESSMENT IN LEARNING PROCESS AND REACHING ACCURATE ESTIMATIONS ABOUT LEARNERS' ABILITIES, THIS PAPER IS FOCUSED ON A COMPARATIVE APPROACH FOR FINDING THE BEST TECHNIQUE OF ESTIMATING THESE PARAMETERS. THE CRITERION FOR SUCH AN OPTIMIZATION IS THE CHI-SQUARE GOODNESS OF FIT. RESULTS SHOW THAT GENETIC ALGORITHMS OBTAIN THE BEST ESTIMATIONS AMONG TWO OTHER APPLIED TECHNIQUES.

THIS PAPER IS CONCERNED WITH THE DEVELOPMENT OF AN ONLINE REINFORCEMENT LEARNING (RL) TECHNIQUE THAT SIGNIFICANTLY IMPROVES THE CONTROL SYSTEMS BEHAVIOR. THE REINFORCEMENT LEARNER IS BASED ON Q-LEARNING AND THE FINAL CONTROLLER IS AN ARTIFICIAL NEURAL NETWORK WHOSE WEIGHTS ARE TUNED BY ON LINE LEARNING. IN ORDER TO SPEED UP THE LEARNING PROCESSES AND PREVENT THE PLANT FROM THE INSTABILITY, INITIALLY A PID IS UTILIZED AS AN AUGMENTED CONTROLLER UNTIL THE REINFORCEMENT LEARNING BECOMES CAPABLE OF KEEP THE SYSTEM STABLE AND PREVENT THE SYSTEM FROM UNDESIRABLE BEHAVIOR. EXAMPLE OF USE IS PRESENTED AND THE EFFECTIVENESS OF THE PROPOSED APPROACH IS SHOWN.

IN THIS PAPER A SECURE AGENT SERVER NAMED JSAS IS INTRODUCED. J-SAS HAS AN AGENT VIRTUAL MACHINE WITH THE SIMILAR FUNCTIONS AS A TRADITIONAL HOST MACHINE.BY ASSIGNING PASSPORT TO AGENTS, AUTHENTICATION, VERIFICATION OF PASSPORTS, AND TRANSLATION OF CODE TO SAFE VERSION, J-SAS PROVIDES A SECURE ENVIRONMENT FOR EXECUTING THE AGENTS. USING RESOURCE ALLOCATION ALGORITHMS, ACL AND AUTHENTICATION, J-SAS SHOWS A GOOD DEFENSIVE MOOD AGAINST UNAUTHORIZED READ/ WRITE, DENIAL OF SERVICE, AND MASQUERADING ATTACKS.

IN THIS PAPER WE PROPOSE A REAL TIME IMAGE PROCESSING TECHNIQUE FOR COUNTING THE NUMBER OF VEHICLES PASSING ALONG A STREET LANE. IN THIS METHOD, REAL TIME SPEED IS ACHIEVED BY PROCESSING, AT EACH FRAME, ONLY THE PIXELS INSIDE A DEFINED SMALL WINDOW ACROSS A LANE. FOR DETECTING VEHICLES, SEVERAL PROCESSES ARE DONE INCLUDING, ENHANCEMENT, BACKGROUND DIFFERENCING AND MASK BASED EDGE DETECTION. AFTER THESE PROCESSES A BINARY IMAGE SHOWING THE VEHICLE EDGES IS CREATED INSIDE THE SMALL WINDOW. EXTRACTING THE NUMBER OF VEHICLES IS ACHIEVED BY ANALYZING THE NUMBER OF EDGE PIXELS DETECTED INSIDE THE SMALL WINDOW FOR A SPECIFIC TIME INTERVAL. IN ADDITION, WE HAVE USED A REAL TIME IMAGE ENHANCEMENT METHOD TO OVERCOME THE PROBLEM OF VARIATION IN AMBIENT LIGHT LEVELS DURING DIFFERENT HOURS OF DAY. OUR METHOD WAS TESTED IN DIFFERENT TRAFFIC SITUATIONS AND AMBIENT LIGHT LEVELS. THE RESULTS OF VEHICLE COUNTING WERE COMPARED WITH THAT DONE BY A HUMAN EXPERT. SATISFACTORY RESULTS WITH ACCURACIES OVER %94.8 WERE OBTAINED.