Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

2002

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 61 - 90 of 208

Full-Text Articles in Computer Engineering

Implementation Of Large Neural Networks Using Decomposition, Henry Selvaraj, H. Niewiadomski, P. Buciak, M. Pleban, Piotr Sapiecha, Tadeusz Luba, Venkatesan Muthukumar Jun 2002

Implementation Of Large Neural Networks Using Decomposition, Henry Selvaraj, H. Niewiadomski, P. Buciak, M. Pleban, Piotr Sapiecha, Tadeusz Luba, Venkatesan Muthukumar

Electrical & Computer Engineering Faculty Research

The article presents methods of dealing with huge data in the domain of neural networks. The decomposition of neural networks is introduced and its efficiency is proved by the authors’ experiments. The examinations of the effectiveness of argument reduction in the above filed, are presented. Authors indicate, that decomposition is capable of reducing the size and the complexity of the learned data, and thus it makes the learning process faster or, while dealing with large data, possible. According to the authors experiments, in some cases, argument reduction, makes the learning process harder.


Interval Mathematics For Analysis Of Multiresolutional Systems, Vladik Kreinovich, Richard Alo May 2002

Interval Mathematics For Analysis Of Multiresolutional Systems, Vladik Kreinovich, Richard Alo

Departmental Technical Reports (CS)

The more complex the problem, the more complex the system necessary for solving this problem. For very complex problems, it is no longer possible to design the corresponding system on a single resolution level, it becomes necessary to have multiresolutional systems. When analyzing such systems -- e.g., when estimating their performance and/or their intelligence -- it is reasonable to use the multiresolutional character of these systems: first, we analyze the system on the low-resolution level, and then we sharpen the results of the low-resolution analysis by considering higher-resolution representations of the analyzed system. The analysis of the low-resolution level provides …


Fuzzy Measures And Integrals As Aggregation Operators: Solving The Commensurability Problem, Francois Modave, Vladik Kreinovich May 2002

Fuzzy Measures And Integrals As Aggregation Operators: Solving The Commensurability Problem, Francois Modave, Vladik Kreinovich

Departmental Technical Reports (CS)

The aim of this paper is to shed some light on the use of fuzzy measures and integrals as aggregation operators in multicriteria decision making. These techniques have been widely used on an ad hoc basis, but with no axiomatization. It is possible to obtain preference representation theorems in multicriteria decision making problems, relying on a formal parallelism between decision under uncertainty and multicriteria decision making. Though, it raises some commensurability problems. In this paper, we show how to obtain an axiomatization of multicriteria decision making problems, in a very natural way, and we show how to solve the commensurability …


Selecting A Fuzzy Logic Operation From The Dnf-Cnf Interval: How Practical Are The Resulting Operations?, I. B. Turksen, A. Esper, K. Patel, Scott A. Starks, Vladik Kreinovich May 2002

Selecting A Fuzzy Logic Operation From The Dnf-Cnf Interval: How Practical Are The Resulting Operations?, I. B. Turksen, A. Esper, K. Patel, Scott A. Starks, Vladik Kreinovich

Departmental Technical Reports (CS)

In classical (two-valued) logic, CNF and DNF forms of each propositional formula are equivalent to each other. In fuzzy logic, CNF and DNF forms are not equivalent, they form an interval that contains the fuzzy values of all classically equivalent propositional formulas. If we want to select a single value from this interval, then it is natural to select a linear combination of the interval's endpoints. In particular, we can do that for CNF and DNF forms of "and" and "or", thus designing natural fuzzy analogues of classical "and" and "or" operations. The problem with thus selected "and" and "or" …


Why Is Selecting The Simplest Hypothesis (Consistent With Data) A Good Idea? A Simple Explanation, Vladik Kreinovich, Luc Longpre, Scott Ferson, Lev Ginzburg May 2002

Why Is Selecting The Simplest Hypothesis (Consistent With Data) A Good Idea? A Simple Explanation, Vladik Kreinovich, Luc Longpre, Scott Ferson, Lev Ginzburg

Departmental Technical Reports (CS)

No abstract provided.


Information Security System Rating And Ranking, Rayford B. Vaughn Jr., Ambareen Sira, David A. Dampier May 2002

Information Security System Rating And Ranking, Rayford B. Vaughn Jr., Ambareen Sira, David A. Dampier

Computer Sciences and Electrical Engineering Faculty Research

The term assurance has been used for decades in trusted system development to express the notion of confidence in the strength of a specific system or system of systems. The unsolved problem that security engineers must struggle with is the adoption of measures or metrics that can reliably depict the assurance associated with a specific hardware and software architecture. This article reports on a recent attempt to focus needs in this area and suggests various categories of information assurance metrics that may be helpful to an organization that is deciding which set is useful for a specific application.


Main Ideas Behind Owa Lead To A Universal And Optimal Approximation Scheme, Ronald R. Yager, Vladik Kreinovich May 2002

Main Ideas Behind Owa Lead To A Universal And Optimal Approximation Scheme, Ronald R. Yager, Vladik Kreinovich

Departmental Technical Reports (CS)

Ordered Weighted Averaging (OWA) operators have been successfully applied in many practical problems. We explain this empirical success by showing that these operators are indeed guaranteed to work (i.e., are universal), and that these operators are the best to use (in some reasonable sense).


From Computation With Guaranteed Intervals To Computation With Confidence Intervals: A New Application Of Fuzzy Techniques, Vladik Kreinovich, Hung T. Nguyen, Scott Ferson, Lev Ginzburg May 2002

From Computation With Guaranteed Intervals To Computation With Confidence Intervals: A New Application Of Fuzzy Techniques, Vladik Kreinovich, Hung T. Nguyen, Scott Ferson, Lev Ginzburg

Departmental Technical Reports (CS)

Traditional interval computations provide an estimate for the result y=f(x1,...,xn) of data processing when we know intervals X1,...,Xn that are guaranteed to contain the (unknown) actual values of the quantities x1,...,xn. Often, in addition to these guaranteed intervals, we have confidence intervals for these quantities, i.e., intervals Xi that contain the corresponding values xi with a certain probability. It is desirable, based on the confidence intervals for xi, to produce the resulting confidence interval for y. It turns out that the formulas for computing such resulting confidence interval are closely related with the formulas for processing fuzzy numbers by using …


Provisioning On-Line Games: A Traffic Analysis Of A Busy Counter-Strike Server, Wu-Chang Feng, Francis Chang, Wu-Chi Feng, Jonathan Walpole May 2002

Provisioning On-Line Games: A Traffic Analysis Of A Busy Counter-Strike Server, Wu-Chang Feng, Francis Chang, Wu-Chi Feng, Jonathan Walpole

Computer Science Faculty Publications and Presentations

This paper describes the results of a 500 million packet trace of a popular on-line, multi-player, game server. The results show that the traffic behavior of this heavily loaded game server is highly predictable and can be attributed to the fact that current game designs target the saturation of the narrowest, last-mile link. Specifically, in order to maximize the interactivity of the game itself and to provide relatively uniform experiences between players playing over different network speeds, on-line games typically fix their usage requirements in such a way as to saturate the network link of their lowest speed players. While …


Supporting Low-Latency Tcp-Based Media Streams, Ashvin Goel, Charles Krasic, Kang Li, Jonathan Walpole May 2002

Supporting Low-Latency Tcp-Based Media Streams, Ashvin Goel, Charles Krasic, Kang Li, Jonathan Walpole

Computer Science Faculty Publications and Presentations

The dominance of the TCP protocol on the Internet and its success in maintaining Internet stability has led to several TCP-based stored media-streaming approaches. The success of these approaches raises the question whether TCP can be used for low-latency streaming. Low latency streaming allows responsive control operations for media streaming and can make interactive applications feasible. We examined adapting the TCP send buffer size based on TCP's congestion window to reduce application perceived network latency. Our results show that this simple idea significantly improves the number of packets that can be delivered within 200 ms and 500 ms thresholds.


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 18, Number 8, May 2002, College Of Engineering And Computer Science, Wright State University May 2002

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 18, Number 8, May 2002, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


Poster: Provisioning On-Line Games: A Traffic Analysis Of A Busy Counter-Strike Server, Francis Chang, Wu-Chang Feng, Wu-Chi Feng, Jonathan Walpole May 2002

Poster: Provisioning On-Line Games: A Traffic Analysis Of A Busy Counter-Strike Server, Francis Chang, Wu-Chang Feng, Wu-Chi Feng, Jonathan Walpole

Computer Science Faculty Publications and Presentations

A poster that illustrates the client/server model employed by an multiplayer online game, focusing on bandwidth usage.


Proteome Database Of Hepatocellular Carcinoma., Cynthia Liang, Jason Neo, Siaw Ling Lo, Gek San Tan, Teck Keong Seow, Maxey Chung May 2002

Proteome Database Of Hepatocellular Carcinoma., Cynthia Liang, Jason Neo, Siaw Ling Lo, Gek San Tan, Teck Keong Seow, Maxey Chung

Research Collection School Of Computing and Information Systems

Hepatocellular carcinoma (HCC or hepatoma) is the most common primary cancer of the liver. Persistent viral infection by the hepatic B or C virus is probably the most important cause of HCC worldwide. It is responsible for approximately one million deaths each year, predominantly in the underdeveloped and developing countries, but its incidence is also on the rise in the developed countries. For most patients suffering from HCC, long-term survival is rare, as they are presented late and are often unsuitable for curative treatment. Thus there is great interest to identify novel HCC diagnostic markers for early detection of the …


On Efficient Representation Of Expert Knowledge By Fuzzy Logic: Towards An Optimal Combination Of Granularity And Higher-Order Approaches, Hung T. Nguyen, Vladik Kreinovich Apr 2002

On Efficient Representation Of Expert Knowledge By Fuzzy Logic: Towards An Optimal Combination Of Granularity And Higher-Order Approaches, Hung T. Nguyen, Vladik Kreinovich

Departmental Technical Reports (CS)

A natural approach to designing an intelligent system is to incorporate expert knowledge into this system. One of the main approaches to translating this knowledge into computer-understandable terms is the approach of fuzzy logic. It has led to many successful applications, but in several aspects, the resulting computer representation is somewhat different from the original expert meaning. Two related approaches have been used to make fuzzy logic more adequate in representing expert reasoning: granularity and higher-order approaches. Each approach is successful in some applications where the other approach did not succeed so well; it is therefore desirable to combine these …


Establishing A Lan Network For Designing And Analyzing Of Manufacturing Products, Yuqiu You Apr 2002

Establishing A Lan Network For Designing And Analyzing Of Manufacturing Products, Yuqiu You

Morehead State Theses and Dissertations

A thesis presented to the faculty of the College of Science & Technology at Morehead State University in partial fulfillment of the requirements for the Degree of Master of Science by Yuqiu You in Spring of 2002.


Range Estimation Is Np-Hard For Epsilon-Square Accuracy And Feasible For Epsilon To The Power Of 2-Delta, Vladik Kreinovich Apr 2002

Range Estimation Is Np-Hard For Epsilon-Square Accuracy And Feasible For Epsilon To The Power Of 2-Delta, Vladik Kreinovich

Departmental Technical Reports (CS)

The basic problem of interval computations is: given a function f(x1,...,xn) and n intervals [xi-,xi+], find the (interval) range Y of the given function on the given intervals. It is known that even for quadratic polynomials f(x1,...,xn), this problem is NP-hard. In this paper, following the advice of A. Neumaier, we analyze the complexity of asymptotic range estimation, when the bound "epsilon" on the width of the input intervals tends to 0. We show that for small c>0, if we want to compute the range with an accuracy c times epsilon squared, then the problem is still NP-hard; on …


Computing Variance For Interval Data Is Np-Hard, Scott Ferson, Lev Ginzburg, Vladik Kreinovich, Luc Longpre, Monica Aviles Apr 2002

Computing Variance For Interval Data Is Np-Hard, Scott Ferson, Lev Ginzburg, Vladik Kreinovich, Luc Longpre, Monica Aviles

Departmental Technical Reports (CS)

When we have only interval ranges [xi-,xi+] of sample values x1,...,xn, what is the interval [V-,V+] of possible values for the variance V of these values? We prove that the problem of computing the upper bound V+ is NP-hard. We provide a feasible (quadratic time) algorithm for computing the lower bound V- on the variance of interval data. We also provide a feasible algorithm that computes V+ under reasonable easily verifiable conditions.


Infopipes: An Abstraction For Multimedia Streaming, Andrew P. Black, Huang Jie, Rainer Koster, Jonathan Walpole, Calton Pu Apr 2002

Infopipes: An Abstraction For Multimedia Streaming, Andrew P. Black, Huang Jie, Rainer Koster, Jonathan Walpole, Calton Pu

Computer Science Faculty Publications and Presentations

To simplify the task of building distributed streaming applications, we propose a new abstraction for information flow – Infopipes. Infopipes make information flow primary, not an auxiliary mechanism that is hidden away. Systems are built by connecting predefined component Infopipes such as sources, sinks, buffers, filters, broadcasting pipes, and multiplexing pipes. The goal of Infopipes is not to hide communication, like an RPC system, but to reify it: to represent communication explicitly as objects that the program can interrogate and manipulate. Moreover, these objects represent communication in application-level terms, not in terms of network or process implementation.


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 18, Number 7, April 2002, College Of Engineering And Computer Science, Wright State University Apr 2002

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 18, Number 7, April 2002, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


Integrating Passenger And Modulo As Learning Tools For Collaborative Engineering Education, Kalamullah Ramli, Frank Schwarz, Stefan Werner, A Halim Shamsuddin, Axel Hunger Apr 2002

Integrating Passenger And Modulo As Learning Tools For Collaborative Engineering Education, Kalamullah Ramli, Frank Schwarz, Stefan Werner, A Halim Shamsuddin, Axel Hunger

Makara Journal of Technology

The University of Indonesia (UI), Gerhard Mercator University (GMU), the Universiti Kebangsaan Malaysia (UKM) have agreed to cooperate as partners to develop a joint bachelor (3+1) and masters (1+1) degree, and collaborate in the research fi elds of multimedia- and internet-based learning and application level active networks. This paper describes the introduction of the Offshore Project and the extending of information technology applications to the partner institutions in this international cooperation which would very much enhance the operations of the new initiative in engineering education, which could provide students in far distance with more fl exible learning environment.


Study Effect Of Salt Washing Process On Content And Iodium Stability Of Salt, Nelson Saksono Apr 2002

Study Effect Of Salt Washing Process On Content And Iodium Stability Of Salt, Nelson Saksono

Makara Journal of Technology

Effect of Salt Washing Process on Content and Iodium Stability of Salt. Salt washing process should increase the salt quality. It should clean the salt from sludge or clay and also reduce the impurity compound such as Mg, Ca and the reductor content. The objective of these reseach is to assess the effect of washing process on the content og hygroscopic impurities compound (Ca and Mg), and reductor content of salt. The research also investigate the water absorbing, pH, KIO3 content as function of time to obtain effect of washing process on KIO3 stability in salt. The experiment result shows …


Object Classfification In Computer Vision With Discriminant Analysis, Amir Hamzahan Apr 2002

Object Classfification In Computer Vision With Discriminant Analysis, Amir Hamzahan

Makara Journal of Technology

A robotic sensor system is always supported by a computer system called ‘computer vision’. The important concept of computer vision is object classfifi cation. In this study two algorithms for object classifi cation in this system will be compared. Firstly, A simple method that do not need complex computation and that considered as an informal method is called binary tree decision structure. This method is based on modest caracteristic decriptors of an object such as vertical line, horizontal line or ellipse line. Unfortunately this method has weakness in recognize an image that contaminated by a noise. Secondly, a more formal …


Making Alloys (Ti1 - Xalx) N Using Plasma Cvd Technique From Alcl3 Powder, H2 And N2 Gas ,With Solvent Ticl4, Keba Moto Apr 2002

Making Alloys (Ti1 - Xalx) N Using Plasma Cvd Technique From Alcl3 Powder, H2 And N2 Gas ,With Solvent Ticl4, Keba Moto

Makara Journal of Technology

The substitution of Ti atoms by Al atoms in TiN lattice sites to form (Ti1-xAlx)N is clearly demonstrated by the coatings which were deposited on steel substrate and using plasma CVD technique. The presence of Al atoms in TiN lattice site is shown by means of XRD and EDX techniques: lattice parameters decreasing of TiN as the fraction of Al increases (XRD) and precipitation of hexagonal AlN phase (XRD) as the fraction of Al exceeding 0.8 (EDX). The hardness of these coating are just around 30 GPa, which is beyond the values reported in literatures.


Effects Of 0.25 % Mo (Molybdenum) Which Is Contained In The Ductile Cast Iron On Mechanical Properties Of Austempered Ductile Iron (Adi)., Nukman Nukman, Bustanul Arifin, Bambang Sugiarto Apr 2002

Effects Of 0.25 % Mo (Molybdenum) Which Is Contained In The Ductile Cast Iron On Mechanical Properties Of Austempered Ductile Iron (Adi)., Nukman Nukman, Bustanul Arifin, Bambang Sugiarto

Makara Journal of Technology

The aim of this research is to investigate the effects of 0.25 % Mo (Molybdenum) which is contained in the ductile cast iron on mechanical properties of Austempered Ductile Iron (ADI). The various temperatures and the holding times are used in the heat treatment processes. Using a given 0.25 % Mo in the ductile iron, ADI's alloyed developes a higher ultimate tensile stress value and decreases the elongation if we compare with the as cast (non alloy ductile iron). The higher impact energy value obtained at 9000 C austenization and 375o C austempering temperatures during 60 minutes holding times. The …


The Manufacturing Properties Of Galvanised Steel Sheet With Hexagonal And Tetragonal Network Of Circle Holes, Rahmat Saptono Apr 2002

The Manufacturing Properties Of Galvanised Steel Sheet With Hexagonal And Tetragonal Network Of Circle Holes, Rahmat Saptono

Makara Journal of Technology

Galvanized steel sheet of 0.8 mm in thickness was drilled with circle holes of 2.5 mm diameter and spacing arranged in tetragonal and hexagonal pattern. The manufacturing properties of specimen were studied through drawing and stretching simulative test. It was concluded from the results that, at high ratio of punch to hole diameter (40/2.5), the drawing properties (LDR) of both square and hexagonal perforated sheet were slightly lower than that of solid sheet, while hexagonal perforated showing LDR somewhat higher than the square one. The stretching properties (LDH) of sheet, however, were much lower than that of solid sheet while …


Develops The Software Of Dsp Processor For The Cdma Circuitry, Arman Djohan D. Apr 2002

Develops The Software Of Dsp Processor For The Cdma Circuitry, Arman Djohan D.

Makara Journal of Technology

This research develops the software of DSP Processor type TMS320C54X for the CDMA circuitry. This research apply two algorithms namely Mathematic Algorithm and table lookup Algorithm. From both algorithms, the research examine what algorithm have the fasted processing time and the smallest memory occupation. From the examination results the Mathematic Algorithm have 20.62 milliseconds processing time and the Table lookup algorithm have 14.08 milliseconds processing time. The Table lookup algorithm have the fastest processing time because the Matematic algorithm need the rounding process of the fi gure. Eventhough such processing time is not exceed from the 125 millisecond of delay …


Robust Face Representation And Recognition Under Low Resolution And Difficult Lighting Conditions, Mohammad Moinul Islam Apr 2002

Robust Face Representation And Recognition Under Low Resolution And Difficult Lighting Conditions, Mohammad Moinul Islam

Electrical & Computer Engineering Theses & Dissertations

This dissertation focuses on different aspects of face image analysis for accurate face recognition under low resolution and poor lighting conditions. A novel resolution enhancement technique is proposed for enhancing a low resolution face image into a high resolution image for better visualization and improved feature extraction, especially in a video surveillance environment. This method performs kernel regression and component feature learning in local neighborhood of the face images. It uses directional Fourier phase feature component to adaptively lean the regression kernel based on local covariance to estimate the high resolution image. For each patch in the neighborhood, four directional …


Embedded Software Programming To Develop A Command Line User Interface For Monitoring And Debugging A Manually Driven Gas Regulator Control System, Syed N. Hyder Apr 2002

Embedded Software Programming To Develop A Command Line User Interface For Monitoring And Debugging A Manually Driven Gas Regulator Control System, Syed N. Hyder

Electrical & Computer Engineering Theses & Dissertations

This thesis presents a complete embedded programming model and software codes for a command-line user interface for CONCOA's gas regulator control system. Control Corporation of America (CONCOA) manufactures high-pressure gas regulators, which mechanically control the pressure at their outlets. Since the control system is based on mechanical regulators, adding or stopping gas flow from the system can cause manifold fluctuation that could further cause the pressure to rise or fall with time. The main motivation for developing a command line user interface is to provide a centralized computer control to monitor and debug the gas regulator control system electronically by …


Traffic Simulation Using Arena, Shanti Yelamanchi Apr 2002

Traffic Simulation Using Arena, Shanti Yelamanchi

Electrical & Computer Engineering Theses & Dissertations

Many traffic simulation tools exist for developing traffic simulations; these tools can be divided broadly into two categories — macro simulation tools and micro simulation tools. These two categories of simulation tools are directed at modeling the extremes of traffic systems: very large systems and very small systems. There is a class of intermediate-sized transportation networks for which neither category of simulation tools might perform adequately. Additionally these specialized traffic simulation tools have a high learning curve. For developing medium sized traffic simulations in a short period of time, one might choose to use a familiar general-purpose discrete event simulation …


2002 (Spring) Ensi Informer Magazine, Morehead State University. Engineering Sciences Department Apr 2002

2002 (Spring) Ensi Informer Magazine, Morehead State University. Engineering Sciences Department

ENSI Informer Magazine Archive

The ENSI Informer Magazine published in the spring of 2002.