ppxscal/embedding_network huggingface dataset:
Visual communications on a memory-embedded array processor: the computational*ram
Authors: Sethuraman Panchanathan, R. Mason
Venue:  (2002)

In this thesis, image and video processing algorithms, especially the compression algorithms, are first studied in their natural formats to appreciate the needs for real-time operations and hence, parallel computing. The computational intense, memory-bound problems are next approached from two directions: algorithmic and architectural. Algorithmic approach tends to systematically analyze the flow independence and data independence of a program, while architectural approach tends to gain speed-up by resource multiplicity and time sharing. The majority of image and video processing algorithms are inherently data-parallel in nature. The vectorization of these algorithms requires consistent practices, and new challenge in parallel programming seems endless. The data-parallel nature of image/video processing algorithms map well onto the Single-Instruction stream, Multiple-Data stream (SIMD) of an increasingly popular Memory-Embedded Array Processor classified as the Intelligent RAMS, specifically, the Computational*RAM (C*RAM). C*RAM is a SIMD-memory hybrid where the processing elements are pitch-matched to memory columns of a conventional computer RAM at the sense-amplifiers to take advantage of the inherently high memory bandwidth, and the emulation of the massively parallel processors. Throughout the thesis, speed-ups from 1 to 3 orders of magnitude are obtained. Memory-bound algorithms such as Motion Estimation, and Mean-Absolute-Error for Nearest Neighbor Distortion Computation are among the most efficient implementations. At its best, this thesis will, definitely, put forward the promising research direction which involves fast and efficient in-memory parallel computing for visual communications.
Intra-Bus Crosstalk Estimation Using Word-Level Statistics
Authors: Suvodeep Gupta, Srinivas Katkoori
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

We propose two high-level techniques to estimate theprobability of crosstalk events on the signal lines of a systembus: (1) Given an input data stream, the first techniquesimply estimates the number of crosstalk events on each lineof the bus. The main drawback of this technique is that theexecution time is proportional to the stream length. This isovercome by the second technique. (2) Given the word-levelstatistical parameters, namely mean, standard deviation,and lag-one temporal correlation coefficient, we estimatethe bit-level crosstalk probability. Experimental results fordata streams from different data environments, comparedagainst detailed HSPICE simulations, are presented. Averageerrors of less than 9% and 7% are obtained for thefirst and second techniques respectively while the executiontimes are significantly reduced.
Vehicle route-sequence planning using temporal logic
Authors: Kiam Tian Seow, Michel Pasquier
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2002)

This paper proposes a new logical framework for vehicle route-sequence planning of passenger travel requests. Each request is a fetch-and-send service task associated with two request-locations, namely, a source and a destination. The proposed framework is developed using propositional linear time temporal logic of Manna and Pnueli. The novelty lies in the use of the formal language for both the specification and theorem-proving analysis of precedence constraints among the location visits that are inherent in route sequences. In the framework, legal route sequences&mdash;each of which visits every request location once and only once in the precedence order of fetch-and-send associated with every such request&mdash;is formalized and justified, forming a basis upon which the link between a basic precedence constraint and the corresponding canonical forbidden-state formula is formally established. Over a given base route plan, a simple procedure to generate a feasible subplan based on a specification of the forbidden-state canonical form is also given. An example demonstrates how temporal logic analysis and the proposed procedure can be applied to select a final (feasible) subplan based on additional precedence constraints.
A case study in the design of BTO/CTO shop floor control system
Authors: Ruey-Shun Chen, Kun-Yung Lu, Shien-Chiang Yu, Hong-Wei Tzeng, C. C. Chang
Venue: Information and Management (2003)

Although computerized information systems are conventionally used to control production, applying a manual approach and improper logistical assignments typically reduces operating efficiency and increases customer service response time. Satisfying the requirements of remaining competitiveness in the current marketplace, such as offering build-to-order (BTO) or configuration-to-order (CTO) services is difficult. This study presents an integrated information system for use in shop floor controlling systems (SFCS) for kitting parts, producing goods, packing finished goods and distributing them, to enhance the performance of the BTO/CTO production system. Several information technologies and devices, such as barcode system, the electronic pick-to-light picking system, electronic Kanban (eKanban), and others are adopted to support the relevant logistics. A personal computer (PC) manufacturer is used to demonstrate the proposed system. The findings of the study reveal that the proposed information system can respond to the status of the production line in real time. This responsiveness can help the production controller to make a suitable decision and quickly meet the requirements of the BTO/CTO production system.
ARMS: adaptive rich media secure streaming
Authors: Lisa Amini, Raymond Rose, Chitra Venkatramani, Olivier Verscheure, Peter Westerink, Pascal Frossard
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

In this demonstration we present the ARMS system which enables secure and adaptive rich media streaming to a large-scale, heterogeneous client population. The ARMS system dynamically adapts streams to available bandwidth, client capabilities, packet loss, and administratively imposed policies - all while maintaining full content security. The ARMS system is completely standards compliant and to our knowledge is the first such end-to-end MPEG-4-based system.
The Big Bang Theory of IDEs
Authors: Caspar Boekhoudt
Venue: Queue (2003)

Remember the halcyon days when development required only a text editor, a compiler, and some sort of debugger (in cases where the odd printf() or two alone didn’t serve)? During the early days of computing, these were independent tools used iteratively in development’s golden circle. Somewhere along the way we realized that a closer integration of these tools could expedite the development process. Thus was born the integrated development environment (IDE), a framework and user environment for software development that’s actually a toolkit of instruments essential to software creation. At first, IDEs simply connected the big three (editor, compiler, and debugger), but nowadays most go well beyond those minimum requirements. In fact, in recent years, we have witnessed an explosion in the constituent functionality of IDEs.
Pointwise Error Estimates for Differences in Piecewise Linear Finite Element Approximations
Authors: Alfred H. Schatz, Lars B. Wahlbin
Venue: SIAM Journal on Numerical Analysis (2003)

We consider piecewise linear finite element approximations uh to u the solution of an elliptic boundary value problem. New estimates for the differences |e(x1)-e(x2)| (where e(x) = u(x)-u_h(x) is the error and x1 and x2 are any two points in the domain) are obtained in terms of weighted $L_\infty$ norms. As a consequence, so-called asymptotic expansion inequalities are derived that have been applied to obtain asymptotically exact a posteriori estimators for the gradient on each element.
Effective text extraction and recognition for WWW images
Authors: Jun Sun, Zhulong Wang, Hao Yu, Fumihito Nishino, Yukata Katsuyama, Satoshi Naoi
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

Images play a very important role in web content delivery. Many WWW images contain text information that can be used for web indexing and searching. A new text extraction and recognition algorithm is proposed in this paper. The character strokes in the image are first extracted by color clustering and connected component analysis. A novel stroke verification algorithm is used to effectively remove non-character strokes. The verified strokes are then used to build the binary text line image, which is segmented and recognized by dynamic programming. Since text in WWW image usually has close relationship with webpage content, approximate string matching is used to revise the recognition result by matching the content in the webpage with the content in the image. This effective post-processing not only improves the recognition performance, but also can be used in other applications such like image - webpage paragraph corresponding.
Fast heuristic algorithms for finite state machine minimization
Authors: L. N. Kannan, D. Sarma
Venue: Proceedings of the conference on European design automation (1991)

In this paper, a technique for the minimization of completely and incompletely specified sequential machines is described. By employing fast heuristic algorithms, it has been shown that it is possible to effectively reduce large (121 states) finite state machines in reasonable computing time when compared to other methods. It has been shown that it is possible to achieve area/literal reductions in the range of 30--100% over unreduced machines using this technique.
Recurring Patterns of Facilitation Interventions in GSS Sessions
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

Now that GSS have been commercialized and are present in an increasing number of organizational settings, sustained use of GSS within organizations is an important subject ofresearch. One of the aspects of GSS use that clearly poses challenges for organizations concerns GSS session design. ThinkLets are chunked facilitation techniques that can be used as building blocks for GSS sessions. In order to develop a library of useful thinkLets for organizations to use, this study researched patterns of thinkLets use in a large number of GSS sessions. We identified which thinkLets were used most and which patterns of thinkLets in terms of a fixed sequence emerged as best practices'. By identifying such sequences, called modules, we can offer organizations powerful capsules of knowledge to wield GSS effectively. The results of our study represent a first version of a lexicon for the discipline of collaboration engineering with thinkLets and opens various avenues for research on making organizational collaboration more productive.
Proof-directed debugging
Authors: Robert Harper
Venue: Journal of Functional Programming (1999)

The close relationship between writing programs and proving theorems has frequently been cited as an advantage of functional programming languages. We illustrate the interplay between programming and proving in the development of a program for regular expression matching. The presentation is inspired by Lakatos's method of proofs and refutations in which the attempt to prove a plausible conjecture leads to a revision not only of the proof, but of the theorem itself. We give a plausible implementation of a regular expression matcher that contains a flaw that is uncovered in an attempt to prove its correctness. The failure of the proof suggests a revision of the specification, rather than a change to the code. We then show that a program meeting the revised specification is nevertheless sufficient to solve the original problem.
Automated Analysis for Digital Forensic Science: Semantic Integrity Checking
Authors: Tye Stallard, Karl Levitt
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

When computer security violations are detected, computerforensic analysts attempting to determine the relevantcauses and effects are forced to perform the tedious tasks offinding and preserving useful clues in large networks of operationalmachines. To augment a computer crime investigator'sefforts, the approach presented in this paper is anexpert system with a decision tree that uses predeterminedinvariant relationships between redundant digital objectsto detect semantic incongruities. By analyzing data from ahost or network and searching for violations of known datarelationships, particularly when an attacker is attemptingto hide his presence, an attacker's unauthorized changesmay be automatically identified. Examples of such invariantdata relationships are provided, as are techniques toidentify new, useful ones. By automatically identifying relevantevidence, experts can focus on the relevant files, users,times and other facts first.
The art of flow
Authors: Joshua Davis
Venue: ACM SIGGRAPH 2003 Web Graphics (2003)

I mostly focus on issues of finding forms in math and nature -systems and boundaries and using this math structure to write vector based programs or what I call "machines", to build randomly constructed algorithms and behaviors. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Counterexample to Kleitman's Conjecture Concerning an Edge-Isoperimetric Problem
Authors: Rudolf Ahlswede, Ning Cai
Venue: Combinatorics, Probability and Computing (1999)

Kleitman's conjecture concerning the &lsquo;Kleitman&ndash;West problem&rsquo; is false for 3-element subsets.
Recognizing the relations between Web pages using artificial neural network
Authors: Xing Zhu, Shen Huang, Yong Yu
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Semantic Web shows us the potential infrastructure of the next generation Web. Web information will be understandable to machines in this infrastructure. Our research work has the aim of embedding machine-understandable semantic information in ordinary HTML files automatically given the domain ontology. We focus on automatically acquiring the instances of concepts and relations defined in domain ontology from Web pages. This paper describes how to recognize the relation between Web pages (a kind of relation instance) by using Artificial Neural Network (ANN). The input vector of ANN is determined by the type of Web pages, the number and type of hyperlinks between the Web pages, and the similarity in Web pages' contents. We also show the initial results got by our prototype system.
The evaluation of electronic marking of examinations
Authors: Pete Thomas
Venue: ACM SIGCSE Bulletin (2003)

This paper discusses an approach to the electronic (automatic) marking of examination papers, in particular, the extent to which it is possible to mark a candidate's answers automatically and return, within a very short period of time, a result that would be comparable with a manually produced score. The investigation showed that there are good reasons for manual intervention in a predominantly automatic process. The paper discusses the results of tests of the automatic marking process that in two experiments yielded grades for examination scripts that are comparable with human markers (although the automatic grade tends to be the lower of the two). An analysis of the correlations between the human and automatic markers shows highly significant relationships between the human markers (between 0.91 and 0.95) and a significant relationship between the average human marker score and the electronic score (0.86).
Design and implementation of MP3-music on demand system using streaming technology
Authors: Ching-Lung Chang, Kuo-Sheng Hsu
Venue: Journal of Network and Computer Applications (2003)

The success of the Internet and the use of broadband in homes have caused a gradual shift in traffic on the Internet from data to multimedia communication. Multimedia applications typically include a large quantity of video/audio information. Streaming technology is normally adopted to handle the transmission of multimedia traffic and thus reduce the buffer requirement on the client side and the service request/response time. This work focuses on the transmission of MP3 music which has a constant bit rate characteristic. The design of both the server side and the client side of the MP3-music on demand (MoD) system with streaming technology, is considered to meet the quality of service (QoS) requirements of MP3 music. A stream buffering technique is used and an adaptive rate control mechanism is applied in combination with a client feedback packet to prevent stream buffer overflow or underflow on the client side, and thereby accommodate the network delay, jitter, and timing deviation between the server machine and the client host. A server self-timing revision scheme is used to reduce the network overhead of the feedback mechanism. The adaptive rate control mechanism is developed and verified using a computer simulation. Finally, for completeness a MoD system is constructed with a low-cost embedded network system to which an Altera FPGA is applied to provide cut-through data movement and an adaptive rate control mechanism is realized to evaluate QoS.
About the Use of Semaphores to Handle Contradictory Knowledge Sources
Authors: Eric Grégoire
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Many approaches to handle inconsistent knowledge require some information to be dropped in order to ensure logical consistency. In this paper, a syntax-based technique that simply weakens the conflicting information by means of semaphores is proposed and analyzed in the context of the fusion of several possibly mutually conflicting knowledge sources. The proposed approach basically adopts a neutral position w.r.t. two knowledge sources in the sense that it does not conduct one source to predominate the other one. However marking apreference for one source and retracting this preference is easy. When the fusion process is iterated, it is shown that semaphores can conduct sources to become actually rejected. Conditions preventing such a drawback are investigated. It is also shown how this problem can be solved when all sources are available simultaneously and how a preference for less-contradicted sources can be realized as well.
QoS Management in Replicated Real Time Databases
Authors: Yuan Wei, Sang H. Son, John A. Stankovic, K. D. Kang
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

Providing quality-of-service guarantees for data servicesin a distributed environment is a challenging task.The presence of multiple sites in distributed environmentsraises issues that are not present in centralizedsystems.The transaction workloads in distributed real-timedatabases may not be balanced and the transactionaccess patterns may be time-varying and skewed.Datareplication is an effective method to help database systemsmeet the stringent temporal requirements of real-time applications.We have designed an algorithm that providesquality-of-service guarantees for data services in distributedreal-time databases with full replication of temporaldata.The algorithm consists of heuristic feedback-basedlocal controllers and global load balancers (GLB)working at each site.The local controller controls theadmission process of incoming transactions.The globalload balancers collect the performance data from othernodes and balance the system-wide workload.The simulationresults show that the new algorithm successfullybalances the workloads in distributed real-time databasesand provides tight transaction miss ratio guarantees undervarious transaction workloads.
Investigation of iridium as a gate electrode for deep sub-micron CMOS technology
Authors: M. A. Pawlak, T. Schram, K. Maex, A. Vantomme
Venue: Microelectronic Engineering (2003)

The physical and electrical properties of an Ir/SiO2/Si stack were evaluated for advanced gate electrode application. The thermal stability of the stack was studied on MOS capacitors annealed at temperatures between 500 and 1000 °C in N2 ambient for 30 s followed by forming gas anneal (FGA) at 420 °C for 20 min. The work function of iridium, found to be 4.9 eV, is stable up to 900 °C, making it a good candidate as PMOS electrode. In addition, no evidence was found for any chemical reaction at the interface between Ir and SiO2.
Agent Survivability: An Application for Strong andWeak Chain Constrained Scheduling
Authors: Axel W. Krings
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

In a recent two-layer approach to survivability of networked computing systems migratory autonomous agents have been used as a reactionary mechanism-augmenting a low-level attack recognition scheme. This paper investigates the theoretical implications of determiningthe agent traversal route as specified by such survivability architecture. It introduces a five-step model that transforms survivability applications into a parameterized graph model that, together with model abstraction and representations, can be the basis for solutions derived from scheduling algorithms. The derivation of agent traversal paths will be transformed intothe problem of scheduling jobs with linear precedence order in machine scheduling utilizing weak and strong modes of scheduling.
Synthesis for Manufacturability: A Sanity Check
Authors: Alessandra Nardi, Alberto L. Sangiovanni-Vincentelli
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

As we move towards nanometer technology, manufacturing problems become overwhelmingly difficult to solve. Presently, optimization for manufacturability is performed at a post-synthesis stage and has been shown capable of reducing manufacturing cost up to 10%. As in other cases, raising the abstraction layer where optimization is applied is expected to yield substantial gains. This paper focuses on a new approach to design for manufacturability: logic synthesis for manufacturability. This methodology consists of replacing the traditional area-driven technology mapping with a new manufacturability-driven one. We leverage existing logic synthesis tools to test our method. The results obtained by using STMicroelectronics 0.13µm library confirm that this approach is a promising solution for designing circuits with lower manufacturing cost, while retaining performance. Finally, we show that our synthesis for manufacturability can achieve even larger cost reduction when yield-optimized cells are added to the library, thus enabling a wider area-yield tradeoff exploration.