Engineering Commons^™

Simultaneous Treatment Of Organic (Phenol) And Heavy Metal (Cr6+ Or Pt4+) Wastes Over Tio2, Zno-Tio2 And Cds-Tio2 Photocatalysts, Slamet Slamet, R. Arbianti, Daryanto Daryanto

Makara Journal of Technology

Simultaneous Treatment of Organic (Phenol) and Heavy Metal (Cr6+ or Pt4+) Wastes over TiO2, ZnO-TiO2 and CdS-TiO2 Photocatalysts. Treatment of heavy metal (Cr6+ and Pt4+) and organic (phenol) wastes has been studied using the relatively new method, i.e. simultaneous photocatalytic process over TiO2 photocatalysts in the batch photoreactor. Following the photocatalytic reduction of the heavy metal wastes, recovery of Cr and Pt was carried out by precipitation and leaching method, respectively. The experimental results show that in the simultaneous photocatalytic system, there is a synergism effect between the photocatalytic reduction of heavy metal waste (Cr6+ or Pt4+) and the oxidation …

Design Of Generating Dual Frequency Operation For Triangular Microstrip Antenna Using Electromagnetic Coupling, Indra Surjati, Eko Tjipto Rahardjo, Djoko Hartanto

Makara Journal of Technology

Design of Generating Dual Frequency Operation for Triangular Microstrip Antenna Using Electromagnetic Coupling. A new design is proposed in this paper by applying a pair of slits using a microstrip feed line. Therefore the microstrip line feeding system is electromagnetically coupled to the patch. The antenna works at two different frequencies in the range from 2 GHz to 4 GHz (S band frequency). The results of the simulation shows that the dual frequency operation can be created when the slit width is 1 mm and the height of the slits ranges from 10 mm to 14 mm with inter slit …

Development Of Low Frequency Vibration Method Of Direct-Write Deposition Relevant To Layer Manufacturing Application, Susilo Adi Widyanto, Alva Edy Tontowi, Jamasri Jamasri, Heru Santosa Budi Rochardjo

Makara Journal of Technology

The research of deposition process is the first step in development process of multi materials selective laser sintering. The deposition process enables to settle multi materials powder in horizontal formation on one layer. In this research we use low frequency (70 - 200Hz) to vibrate a hopper nozzle in which powder is settled. The research method consists of two steps, the first step is to determine flow-ability parameters and the second is to join flow ability parameter with other parameters such that the line width can be controlled. The results show that the line width depends on uniformity of particle …

Combining Interval, Probabilistic, And Fuzzy Uncertainty: Foundations, Algorithms, Challenges -- An Overview, Vladik Kreinovich, David J. Berleant, Scott Ferson, Weldon A. Lodwick

Departmental Technical Reports (CS)

Since the 1960s, many algorithms have been designed to deal with interval uncertainty. In the last decade, there has been a lot of progress in extending these algorithms to the case when we have a combination of interval and probabilistic uncertainty. We provide an overview of related algorithms, results, and remaining open problems.

Population Variance Under Interval Uncertainty: A New Algorithm, Evgeny Dantsin, Vladik Kreinovich, Alexander Wolper, Gang Xiang

Departmental Technical Reports (CS)

In statistical analysis of measurement results, it is often beneficial to compute the range [V] of the population variance V when we only know the intervals [Xi-Di,Xi+Di] of possible values of xi. In general, this problem is NP-hard; a polynomial-time algorithm is known for the case when the measurements are sufficiently accurate, i.e., when |Xi-Xj| >= (D_i+D_j)/n for all i =/= j. In this paper, we show that we can efficiently compute [V} under a weaker (and more general) condition |Xi-Xj| >= |D_i-D_j|/n.

Specifying And Checking Method Call Sequences Of Java Programs, Yoonsik Cheon, Ashaveena Perumandla

Departmental Technical Reports (CS)

In a pre and postconditions-style specification, it is difficult to specify the allowed sequences of method calls, referred to as protocols. The protocols are essential properties of reusable object-oriented classes and application frameworks, and the approaches based on the pre and postconditions, such as design by contracts (DBC) and formal behavioral interface specification languages (BISL), are being accepted as a practical and effective tool for describing precise interfaces of (reusable) program modules. We propose a simple extension to the Java Modeling Language (JML), a BISL for Java, to specify protocol properties in an intuitive and concise manner. The key idea …

Optimal Choice Of Granularity In Commonsense Estimation: Why Half-Orders Of Magnitude, Jerry R. Hobbs, Vladik Kreinovich

Departmental Technical Reports (CS)

It has been observed that when people make crude estimates, they feel comfortable choosing between alternatives which differ by a half-order of magnitude (e.g., were there 100, 300, or 1,000 people in the crowd), and less comfortable making a choice on a more detailed scale, with finer granules, or on a coarser scale (like 100 or 1,000). In this paper, we describe two models of choosing granularity in commonsense estimates, and we show that for both models, in the optimal granularity, the next estimate is 3-4 times larger than the previous one. Thus, these two optimization results explain the commonsense …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 3, November 2005, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

End-To-End Scheduling Strategies For Aperiodic Tasks In Middleware, Yuanfang Zhang, Chenyang Lu, Christopher Gill, Patrick Lardieri, Gautum Thaker

All Computer Science and Engineering Research

Many mission-critical distributed real-time applicationsmust handle aperiodic tasks with hard end-to-end dead-lines. Existing middleware such as RT-CORBA lacksschedulability analysis and run-time scheduling mecha-nisms that can provide real-time guarantees to aperiodictasks. This paper makes the following contributions to thestate of the art for end-to-end aperiodic scheduling in mid-dleware. First, we compare two approaches to aperiodicscheduling, the deferrable server and the aperiodic utiliza-tion bound, using representative workloads. Numerical re-sults show that the deferrable server analysis is less pes-simistic than the aperiodic utilization bounds when appliedoffline. Second, we propose a practical approach to tuningdeferrable servers for end-to-end tasks. Third, we describedeferrable server mechanisms …

Minimum Power Configuration For Wireless Communication In Sensor Networks, Guoliang Xing, Chenyang Lu, Ying Zhang, Qingfeng Huang, Robert Pless

All Computer Science and Engineering Research

This paper proposes the Minimum Power Configuration (MPC) approach to power management in wireless sensor networks. In contrast to earlier research that treats different radio states (transmission/reception/idle) in isolation, MPC integrates them in a joint optimization problem that depends on both the set of active nodes and the transmission power. We propose four approximation algorithms with provable performance bounds and two practical routing protocols. Simulations based on realistic radio models show that the MPC approach can conserve more energy than existing minimum power routing and topology control protocols. Furthermore, it can flexibly adapt to network workload and radio platforms.

Context Aware Service Oriented Computing In Mobile Ad Hoc Networks, Radu Handorean, Gruia-Catalin Roman, Christopher Gill

All Computer Science and Engineering Research

These days we witness a major shift towards small, mobile devices, capable of wireless communication. Their communication capabilities enable them to form mobile ad hoc networks and share resources and capabilities. Service Oriented Computing (SOC) is a new emerging paradigm for distributed computing that has evolved from object-oriented and component-oriented computing to enable applications distributed within and across organizational boundaries. Services are autonomous computational elements that can be described, published, discovered, and orchestrated for the purpose of developing applications. The application of the SOC model to mobile devices provides a loosely coupled model for distributed processing in a resource-poor and …

Large–Scale Field–Programmable Analog Arrays For Analog Signal Processing, Tyson S. Hall, Christopher M. Twigg, Jordan D. Gray, Paul Hasler, David V. Anderson

Faculty Works

Field-programmable analog arrays (FPAAs) providea method for rapidly prototyping analog systems. Currently available commercial and academic FPAAs are typically based on operational amplifiers (or other similar analog primitives) with only a few computational elements per chip. While their specific architectures vary, their small sizes and often restrictive interconnect designs leave current FPAAs limited in functionality and flexibility. For FPAAs to enter the realm of large-scale reconfigurable devices such as modern field-programmable gate arrays (FPGAs),new technologies must be explored to provide area-efficient accurately programmable analog circuitry that can be easily integrated into a larger digital/mixed-signal system. Recent advances in the area …

H-Infinity Estimation For Fuzzy Membership Function Optimization, Daniel J. Simon

Electrical and Computer Engineering Faculty Publications

Given a fuzzy logic system, how can we determine the membership functions that will result in the best performance? If we constrain the membership functions to a specific shape (e.g., triangles or trapezoids) then each membership function can be parameterized by a few variables and the membership optimization problem can be reduced to a parameter optimization problem. The parameter optimization problem can then be formulated as a nonlinear filtering problem. In this paper we solve the nonlinear filtering problem using H_∞ state estimation theory. However, the membership functions that result from this approach are not (in general) sum normal. …

Mobiquery: A Spatiotemporal Query Service For Mobile Users In Sensor Networks, Guoliang Xing, Sangeeta Bhattacharya, Chenyang Lu, Octav Chipara, Chien-Liang Fok, Gruia-Catalin Roman

All Computer Science and Engineering Research

This paper presents MobiQuery, a spatiotemporal query service that allows mobile users to periodically collect sensor data from the physical environment through wireless sensor networks. A salient feature of \MQ is that it can meet stringent spatiotemporal performance constraints, including query latency, data freshness, and changing areas of interest due to user mobility. We present three just-in-time prefetching protocols that enable MobiQuery to achieve desired spatiotemporal performance despite low node duty cycles, while significantly reducing communication overhead. We validate our approach through both theoretical analysis and extensive simulations under realistic settings including varying user movement patterns and location errors.

Analysis Of Gaits For A Rotating Tripedal Robot, Damian M. Lyons, Kiran Pamnany

Faculty Publications

A goal of robotics has been to develop mechanisms that have the efficiency and speed of wheeled robots with the terrain flexibility of legged robots. In previous work, we have proposed a unique three-legged mechanism, the rotopod, designed to integrate these two useful approaches to locomotion. In this paper, we present an analysis of the variety of gaits that can be exhibited by the rotopod. We present examples of many of these gaits and discuss their potential use. A trajectory generation algorithm is presented that can be used to generate point to point trajectories using one of three different styles …

Computing Mean And Variance Under Dempster-Shafer Uncertainty: Towards Faster Algorithms, Vladik Kreinovich, Gang Xiang, Scott Ferson

Departmental Technical Reports (CS)

In many real-life situations, we only have partial information about the actual probability distribution. For example, under Dempster-Shafer uncertainty, we only know the masses m1,...,mn assigned to different sets S1,...,Sn, but we do not know the distribution within each set Si. Because of this uncertainty, there are many possible probability distributions consistent with our knowledge; different distributions have, in general, different values of standard statistical characteristics such as mean and variance. It is therefore desirable, given a Dempster-Shafer knowledge base, to compute the ranges of possible values of mean E and of variance V.

In their recent paper, A. T. …

Interval-Based Robust Statistical Techniques For Non-Negative Convex Functions, With Application To Timing Analysis Of Computer Chips, Michael Orshansky, Wei-Shen Wang, Martine Ceberio, Gang Xiang

Departmental Technical Reports (CS)

In chip design, one of the main objectives is to decrease its clock cycle. On the design stage, this time is usually estimated by using worst-case (interval) techniques, in which we only use the bounds on the parameters that lead to delays. This analysis does not take into account that the probability of the worst-case values is usually very small; thus, the resulting estimates are over-conservative, leading to unnecessary over-design and under-performance of circuits. If we knew the exact probability distributions of the corresponding parameters, then we could use Monte-Carlo simulations (or the corresponding analytical techniques) to get the desired …

Ontologies In Web Personalization, Magdalini Eirinaki, Michalis Vazirgiannis

Faculty Publications

No abstract provided.

A Fitness Function For Modular Evolutionary Testing Of Object-Oriented Programs, Yoonsik Cheon, Kim Myoung

Departmental Technical Reports (CS)

We show that encapsulation of states in object-oriented programs hinders the search for test data using evolutionary testing. In a well-designed object-oriented program the encapsulated or hidden state is accessible only through exported or public methods. As client code is oblivious to the internal state of a server object, no guidance is available to test the client code using evolutionary testing. In particular, it is difficult to determine the fitness or goodness of test data, as it may depend on the hidden internal state. However, evolutionary testing is a promising new approach whose effectiveness has been shown by several researchers. …

Quantum Versions Of K-Csp Algorithms: A First Step Towards Quantum Algorithms For Interval-Related Constraint Satisfaction Problems, Evgeny Dantsin, Alexander Wolpert, Vladik Kreinovich

Departmental Technical Reports (CS)

In many industrial engineering problems, we must select a design, select parameters of a process, or, in general, make a decision. Informally, this decision must be optimal, the best for the users. In traditional operations research, we assume that we know the objective function f(x) whose values describe the consequence of a decision x for the user. Optimization of well-defined functions is what started calculus in the first place: once we know the objective function f(x), we can use differentiation to find its maximum, e.g., as the point x at which the derivative of f with respect to x is …

Decision Making Beyond Arrow's "Impossibility Theorem", With The Analysis Of Effects Of Collusion And Mutual Attraction, Hung T. Nguyen, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In 1951, K. J. Arrow proved that, under certain assumptions, it is impossible to have group decision making rules which satisfy reasonable conditions like symmetry. This Impossibility Theorem is often cited as a proof that reasonable group decision making is impossible.

We start our paper by remarking that Arrow's result only covers the situations when the only information we have about individual preferences is their binary preferences between the alternatives. If we follow the main ideas of modern decision making and game theory and also collect information about the preferences between lotteries (i.e., collect the utility values of different alternatives), …

Partition-Based Interpolation For Color Filter Array Demosaicking And Super-Resolution Reconstruction, Min Shao, Kenneth E. Barner, Russell C. Hardie

Electrical and Computer Engineering Faculty Publications

A class of partition-based interpolators that addresses a variety of image interpolation applications are proposed. The proposed interpolators first partition an image into a finite set of partitions that capture local image structures. Missing high resolution pixels are then obtained through linear operations on neighboring pixels that exploit the captured image structure. By exploiting the local image structure, the proposed algorithm produces excellent performance on both edge and uniform regions. The presented results demonstrate that partition-based interpolation yields results superior to traditional and advanced algorithms in the applications of color filter array (CFA) demosaicking and super-resolution reconstruction.

Can Infopipes Facilitate Reuse In A Traffic Application?, Emerson Murphy-Hill, Chuan-Kai Lin, Andrew P. Black, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Infopipes are presented as reusable building blocks for streaming applications. To evaluate this claim, we have built a significant traffic application in Smalltalk using Infopipes. This poster presents a traffic problem and solution, a short introduction to Infopipes, and the types of reuse Infopipes facilitate in our implementation.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 2, October 2005, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Cs 340: Programming Language Workshop In Java, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is designed as a self-study in Java. You are expected to work independently to learn the Java language and solve a set of programming problems assigned to you using latest Java SDK available at http://java.sun.com or other software as approved by the instructor. There are no exams.

Ceg 210: Pc Networking I, Karen Meyer

Computer Science & Engineering Syllabi

Introduction to PC networking hardware, concepts, and technologies. Focus is on LAN Administration.

Cs 206: Advanced Concepts/Techniques And Software Productivity Tools, John P. Herzog

Computer Science & Engineering Syllabi

By the end of this course, the students will have a greater depth of understanding in the areas of spreadsheets, databases, and presentation software using Microsoft Excel Access and PowerPoint.

Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp

Computer Science & Engineering Syllabi

This course is an introduction to one of the fundamental topics in the theory of computer science: computability theory. Computability theory is concerned with determining whether there is an algorithmic solution to a problem. The study of computability uses the Turing machine as the basic computational model. A Turing machine is a random access, read-write, finite state automaton. The Church-Turing thesis asserts that any problem that can be solved in any algorithmic manner can be solved by a Turing machine.

Cs 242: Introduction To Computer Science Iii, Praveen Kakumanu

Computer Science & Engineering Syllabi

This is the final course in the three course sequence "Introduction to Computer Science" offered by the Computer Science department, WSU. It focuses on building a number of abstract data types such as stacks, queues, trees and tables. We continue to study the C++ object-oriented concepts such as Inheritance, polymorphism and template handling. We also start learning to analyze the complexity of algorithms in this course.

Ceg 260: Digital Computer Hardware Switching Circuits, Eric Matson

Computer Science & Engineering Syllabi

We will discuss and cover basic digital, combinational and sequential logic systems. Labs will be used to gain valuable practical experience in implementing elementary circuits and logic designs.