ppxscal/embedding_network huggingface dataset:
Offset windowing for FIR fractional-sample delay
Authors: G. D. Cain, A. Yardim, P. Henry
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

Non-optimal FIR filters used for fractional-sample delay, despite their wideband nature, are shown to benefit significantly from application of windowing. Here simple raised-cosine windows prove to be very effective, particularly if they are cast as asymmetric modifications of their conventional forms. The offset von Hann window is surprisingly potent when the number of coefficients is large and window offset coincides with the fractional delay required of the overall filter.
A New Method for Developing Business Applications: The Cellular Data System
Authors: Toshio Kodama, Tosiyasu L. Kunii, Yoichi Seki
Venue: Proceedings of the 2006 International Conference on Cyberworlds (2006)

Currently, in the development of business applications, difficulties occasionally arise between the customer side and the supplier side, causing delays and higher development costs. To deal with this, we propose a new development method for business applications to validate them by invariant preservation based on equivalence relations. We have realized it by designing an algebraic expression called Formula Expression and applying the algebra to the design of each space in the cellular model. The system is called a Cellular Data System (CDS). It can become a common tool for both sides to make agreements efficiently in the future. Moreover, because you can manage data which has any form by using CDS, it is appropriate when dealing with data not only in business application development but in the Cyberworld where no data manager exists.
Rank 3 latin square designs
Authors: Alice Devillers, J. I. Hall
Venue: Journal of Combinatorial Theory Series A (2006)

A Latin square design whose automorphism group is transitive of rank at most 3 on points must come from the multiplication table of an elementary abelian p-group, for some prime p.
Computer spelling checkers: an example cognitive tool
Authors: Lorana A. Jinkerson
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

Mankind has readily developed tools [Salomon, 1993] to aid him/her in the pursuit of alleviating labor and providing for his/her life's needs and desires. From the invention of the wheel and before, the development and use of tools has separated humans from the other animal species. Physical tools (wheels, levers, inclined planes, etc.) and cognitive tools (symbols systems, books, slide rules, etc.) have both supported us in our labors to improve our lives.
On-line bandwidth control for quality of service mapping over satellite independent service access points
Authors: Mario Marchese, Maurizio Mongelli
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2006)

The Quality of Service (QoS) provision requires the cooperation of all network layers from bottom to top. More specifically, for Broadband Satellite Multimedia (BSM) communications, the physical layers (strictly satellite dependent) are isolated from the rest by a Satellite Independent Service Access Point (SI-SAP), which should offer specific QoS to IP and the upper layers. The structure of SI-SAP and the BSM protocol model "opens the door" to the problem of mapping the performance requests of Satellite Independent layers over Satellite Dependent technology. In such a context, a QoS mapping problem arises when different encapsulation formats are employed along the protocol stack of the SI-SAP interface, for instance, when IP packets are transferred over an ATM, DVB or MPLS core network. In this perspective, we investigate here a novel control algorithm to estimate the bandwidth shift required to keep the same performance guarantees, independent of the technology change. By exploiting Infinitesimal Perturbation Analysis to capture the network performance sensitivity, we obtain an adaptive control law suitable for on-line control on the basis of traffic samples acquired during the network evolution. Owing to the generality of the mathematical framework under investigation, our control mechanism can be generalized for other network scenarios and functional costs.
Controlling Home and Office Appliances with Smart Phones
Authors: Jeffrey Nichols, Brad A. Myers
Venue: IEEE Pervasive Computing (2006)

Most home and office appliances contain microprocessors. All these appliances have some user interface, but many users become frustrated with their appliances' difficult, complex functions. However, a new framework, the personal universal controller (PUC), lets users interact with appliances through a separate user interface device that they carry. Smart phones are good candidates for providing interfaces because they're common, their communication capabilities connect users to appliances, and they're already being used for a wide range of applications. The framework includes an abstract specification language for describing appliances, a two-way communication protocol, and automatic interface generation software that customizes user interfaces. This article overviews the PUC system and describes in detail the design and implementation of automatic interface generation for Microsoft's Smartphone platform.
Memory reference reduction and exploit parallelism for dsp and communication algorithms and systems implementations on digital signal processor
Authors: Yuke Wang
Venue:  (2005)

Embedded system can be defined as information processing systems embedded in larger systems. Digital signal processing and communication algorithms and systems are used in digital communication systems to process information in the digital form. Digital signal processors (DSP) are optimized to implement digital signal processing and communication algorithms and systems in software. In this dissertation, we study methods to reduce memory reference and exploit parallelism in implementing the digital signal processing and communication algorithms and systems on DSP to lower power consumption and decrease execution time, respectively. FFT is a digital signal processing algorithm widely used in all kinds of digital communication systems to perform signal transformation between time and frequency domains. We propose the memory reference reduction methods to remove duplicated memory references due to identical twiddle factors in the FFT diagram. As a result, we achieve average of 76.2% reduction in the number of memory references and 53.1% saving of memory spaces consumed by twiddle factors, and average of 28.7% reduction in the number of clock cycles to compute radix-2 FFT on DSP comparing to conventional implementation. We further extend and apply the memory reference reduction method to the vector-radix two-dimensional FFT, which is an important algorithm used in digital signal processing systems for image and speech processing. Another important building block of the digital communication systems is the channel coding to provide reliable communication through noisy channel. The most widely used communication algorithms for channel coding include the Viterbi and TURBO algorithms. For the Viterbi algorithm, we propose the register-exchange based Viterbi decoder implementation to achieve 28% faster comparing to conventional implementation based on trace-back method. For the TURBO algorithm, we optimize the implementation of the TURBO codec to achieve better instruction level parallelism. Besides individual digital signal processing and communication algorithms, we also develop the optimized software implementation for full-rate IEEE 802.11 a compliant digital baseband transmitter system on DSP. The transmitter system includes functional blocks from scrambler to guard interval insertion defined IEEE 802.11 a PHY standard. We explore parallelism existing within and between individual functional blocks and achieve twice faster processing speed comparing to the existing software implementation of the transmitter on a chip with 22 processing cores.
XML Metadata Services
Authors: Mehmet S. Aktas, Sangyoon Oh, Geoffrey C. Fox, Marlon E. Pierce
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

As the Service Oriented Architecture (SOA) principles have gained importance, an emerging need has appeared for methodologies to locate desired services that provide access to their capability descriptions. These services must typically be assembled into short-term service collections that, together with code execution services, are combined into a meta-application to perform a particular task. To address metadata requirements of these problems, we introduce XML Metadata Services to manage both stateless and stateful (transient) metadata. We leverage the two widely used web service standards: Universal Description, Discovery, and Integration (UDDI) and Web Services Context (WS-Context) in our design. We describe our approach and experiences when designing "semantics" for XML Metadata Services. We report results from a prototype of the system that is applied to mobile environment for optimizing Web Service communications.
Using tutoring patterns to generate more cohesive text in an intelligent tutoring system
Authors: Reva Freedman
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

If we want students to read, pay attention to and understand the text generated by an ITS, the text needs to (a) be organized into cohesive turns, (b) flow in natural conversation patterns, and (c) have sufficient variety that neither syntactic structures nor pedagogical goals are repeated overly often. Circsim-Tutor v. 3 is a natural-language based ITS for cardiac physiology currently under development. Text planning for v. 3 will be accomplished by TIPS, a text planning engine based on current research in text generation. We describe how TIPS will achieve the goals mentioned above. We use transcripts of sessions conducted by expert human tutors to derive tutoring patterns for TIPS. Through the use of the TIPS planner, we expect Circsim-Tutor v. 3 to generate longer, more complex and more natural text than previous work.
Design Patterns for Wrapping Similar Legacy Systems with Common Service Interfaces
Authors: David E. Millard, Yvonne Howard, Swapna Chennupati, Hugh C. Davis, Ehtesham-Rasheed Jam, Lester Gilbert, Gary B. Wills
Venue: Proceedings of the European Conference on Web Services (2006)

Web Services are increasingly being used to create a wide range of distributed systems, many of which involve legacy software. Developing service interfaces for these legacy systems can be difficult, as for interoperability reasons it is advantageous to use a common service interface that is independent of the particular legacy system behind it. This enables other services to interoperate with like legacy systems regardless of their implementation. Unfortunately, similar legacy systems can offer subtly different functionality from each other, making agreeing on a common interface difficult. This paper introduces three design patterns for managing this problem: Lowest Common Denominator, Most Popular and Negotiated Interfaces. It formally presents these patterns and reflects on how they have been used within the domain of e-learning to wrap legacy systems that function as databases of objective questions.
A framework for designing the balanced supply chain scorecard
Authors: Jong Han Park, Jae Kyu Lee, Jung Soo Yoo
Venue: European Journal of Information Systems (2005)

Effective measurements of Supply Chain Management (SCM) in the context of the Balanced Scorecard (BSC) have become more important. In the existing SCM performance studies, there are three limitations. First, the SCM measures are not reconciled with the BSC. Second, SCM measures have not comprehensively considered the goals that can be achieved by SCM strategies and solutions. Third, the measures have not identified the characteristics of industry, product, and production strategy. In this paper, we propose a framework for the Balanced Supply Chain Scorecard that considers the literature on the BSC and SCM, SCM solutions, and product characteristics. We analyze the causal relationships between the SCM solutions and product characteristics against measures. The identified relationship between the measures and SCM solutions can be used to evaluate the impact of SCM solutions. Using a case study, we find that the importance of measures significantly depends on the product characteristics. This study can be used to expand the BSC into the area of Strategic Enterprise Management systems, thus to relate performance measures to business activities.
Statistical analysis of simulation output data: the practical state of the art
Authors: Averill M. Law
Venue: Proceedings of the 36th conference on Winter simulation (2004)

One of the most important but neglected aspects of a simulation study is the proper design and analysis of simulation experiments. In this tutorial we give a state-of-the-art presentation of what the practitioner really needs to know to be successful. We will discuss how to choose the simulation run length, the warmup-period duration (if any), and the required number of model replications (each using different random numbers). The talk concludes with a discussion of three critical pitfalls in simulation output-data analysis.
The limits and possibilities of combining Description Logics and Datalog
Authors: Riccardo Rosati
Venue: Proceedings of the Second International Conference on Rules and Rule Markup Languages for the Semantic Web (2006)

Description Logics are currently the most used formalisms for building ontologies, and have been proposed as standard languages for the specification of ontologies in the Semantic Web. The problem of adding rules to Description Logics is currently a hot research topic, due to the interest of Semantic Web applications towards the integration of rule-based systems with ontologies. Most of the approaches in this field concern the study of description logic knowledge bases augmented with rules expressed in Datalog and its nonmonotonic extensions. In this talk we present a set of computational results which identify, from the viewpoint of the expressive abilities of the two formalisms, minimal combinations of Description Logics and (nonmonotonic) Datalog in which reasoning is undecidable. Then, based on the above results, we briefly survey some recent proposals for overcoming such expressive limitations.
Ensuring termination by typability
Authors: Yuxin Deng, Davide Sangiorgi
Venue: Information and Computation (2006)

A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtained by successive refinements of the types of the simply typed π-calculus. For all (but one of) the type systems we also present upper bounds to the number of steps well-typed processes take to terminate. The termination proofs use techniques from term rewriting systems. We show the usefulness of the type systems on some non-trivial examples: the encodings of primitive recursive functions, the protocol for encoding separate choice in terms of parallel composition, a symbol table implemented as a dynamic chain of cells.
Node selection for a fault-tolerant streaming service on a peer-to-peer network
Authors: Hyunjoo Kim, Sooyong Kang, H. Y. Yeom
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Peer-to-peer (P2P) networks are attracting considerable research interest because of their scalability and high performance relative to cost. One of the important services on a P2P network is the streaming service. However, because each node in the P2P network is autonomous, it is difficult to provide a stable streaming service on the network. Therefore, for a stable streaming service on the P2P network, a fault-tolerant scheme must be provided. In this paper, we propose two new node selection schemes, playback node first (PNF) and playback node first with prefetching (PNF-P), that can be used for a service migration-based fault-tolerant streaming service. The proposed schemes exploit the fact that the failure probability of a node currently being served is lower than that of a node not being served. Simulation results show that the proposed schemes outperform traditional node selection schemes.
A Web-based Educational Application for Teaching of Programming: Student Modeling via Stereotypes
Authors: Maria Virvou, Konstantina Chrysafiadi
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

In this paper we describe a web-based educational application for individualised instruction on the domain of programming and algorithms. The application adapts to each user dynamically. This is achieved via the system's user model, which relies on stereotypes. The determination of the stereotypes is based on the knowledge level of the learner. The transition of a learner from one stereotype to another one reveals her/ his learning state. In particular, learners are modelled for all possible cognitive states with respect to their progress or non-progress, while they interact with the educational application.
A decision tool for assembly line breakdown action
Authors: Frank Shin, Bala Ram, Aman Gupta, Xuefeng Yu, Roland Menassa
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Assembly lines with closed loop parallel lanes have the potential to continue to be productive when individual stations breakdown. A requirement in such parallel lane systems is that the products must exit the parallel lanes in the same sequence as they entered. Such lines offer the opportunity to run the line partially either by shutting down an affected lane or by bypassing the failed station to continue to run on all lanes. Bypassing a station, however, requires a backup station that can pick up the incomplete work at a later stage in the process. However, when a station breakdown occurs, it is not readily obvious as to whether to bypass the affected lane or just the affected station. This decision will vary depending on which station failed and the length of the repair. This paper presents a discrete-event modeling approach to provide a decision-making tool during breakdowns.
The Effects of Frontal Lobe Lesions on Goal Achievement in the Water Jug Task
Authors: Mary Kathryn Colvin, Kevin Dunbar, Jordan Grafman
Venue: Journal of Cognitive Neuroscience (2001)

Patients with prefrontal cortex lesions are impaired on a variety of planning and problem-solving tasks. We examined the problem-solving performance of 27 patients with focal frontal lobe damage on the Water Jug task. The Water Jug task has never been used to assess problem-solving ability in neurologically impaired patients nor in functional neuro-imaging studies, despite sharing structural similarities with other tasks sensitive to prefrontal cortex function, including the Tower of Hanoi, Tower of London, and Wisconsin Card Sorting Task (WCST). Our results demonstrate that the Water Jug task invokes a unique combination of problem-solving and planning strategies, allowing a more precise identification of frontal lobe lesion patients' cognitive deficits. All participants (patients and matched controls) appear to be utilizing a hill-climbing strategy that does not require sophisticated planning; however, frontal lobe lesion patients (FLLs) struggled to make required "counterintuitive moves" not predicted by this strategy and found within both solution paths. Left and bilateral FLLs were more impaired than right FLLs. Analysis of the left hemisphere brain regions encompassed by the lesions of these patients found that poor performance was linked to left dorsolateral prefrontal cortex damage. We propose that patients with left dorsolateral prefrontal cortex lesions have difficulty making a decision requiring the conceptual comparison of nonverbal stimuli, manipulation of select representations of potential solutions, and are unable to appropriately inhibit a response in keeping with the final goal.
Jcluster: an efficient Java parallel environment on a large-scale heterogeneous cluster: Research Articles
Authors: Bao-Yin Zhang, Guang-Wen Yang, Wei-Min Zheng
Venue: Concurrency and Computation: Practice Experience (2006)

In this paper, we present Jcluster, an efficient Java parallel environment that provides some critical services, in particular automatic load balancing and high-performance communication, for developing parallel applications in Java on a large-scale heterogeneous cluster. In the Jcluster environment, we implement a task scheduler based on a transitive random stealing (TRS) algorithm. Performance evaluations show that the scheduler based on TRS can make any idle node obtain a task from another node with much fewer stealing times than random stealing (RS), which is a well-known dynamic load-balancing algorithm, on a large-scale cluster. In the performance aspects of communication, with the method of asynchronously multithreaded transmission, we implement a high-performance PVM-like and MPI-like message-passing interface in pure Java. The evaluation of the communication performance is conducted among the Jcluster environment, LAM-MPI and mpiJava on LAM-MPI based on the Java Grande Forum's pingpong benchmark. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Transactional events
Authors: Kevin Donnelly, Matthew Fluet
Venue: ACM SIGPLAN Notices (2006)

Concurrent programs require high-level abstractions in order to manage complexity and enable compositional reasoning. In this paper, we introduce a novel concurrency abstraction, dubbed transactional events, which combines first-class synchronous messagepassing events with all-or-nothing transactions. This combination enables simple solutions to interesting problems in concurrent programming. For example, guarded synchronous receive can be implemented as an abstract transactional event, whereas in other languages it requires a non-abstract, non-modular protocol. Likewise, three-way rendezvous can also be implemented as an abstract transactional event, which is impossible using first-class events alone. Both solutions are easy to code and easy to reason about.The expressive power of transactional events arises from a sequencing combinator whose semantics enforces an all-or-nothing transactional property - either both of the constituent events synchronize in sequence or neither of them synchronizes. This sequencing combinator, along with a non-deterministic choice combinator, gives transactional events the compositional structure of a monad-with-plus. We provide a formal semantics for and a preliminary implementation of transactional events.
Tracking With Sobolev Active Contours
Authors: Ganesh Sundaramoorthi, Jeremy D. Jackson, Anthony Yezzi, Andrea C. Mennucci
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Recently proposed Sobolev active contours introduced a new paradigm for minimizing energies defined on curves by changing the traditional cost of perturbing a curve and thereby redefining their gradients. Sobolev active contours evolve more globally and are less attracted to certain intermediate local minima than traditional active contours. In this paper we analyze Sobolev active contours in the Fourier domain in order to understand their evolution across different scales. This analysis shows an important and useful behavior of Sobolev contours, namely, that they move successively from coarse to increasingly finer scale motions in a continuous manner. Along with other properties, the previous observation reveals that Sobolev active contours are ideally suited for tracking problems that use active contours. Our purpose in this work is to show how a variety of active contour based tracking methods can be significantly improved merely by evolving the active contours according to the Sobolev method.