ppxscal/embedding_network huggingface dataset:
The consideration of cultural differences in the design of information systems
Authors: Jong-min Choe
Venue: Information and Management (2004)

This study empirically examined cultural differences in the amount of information provided by management accounting information systems (MAIS). To demonstrate these differences, data were collected from samples of Australian and Korean firms. The results of this study showed that much more flexibility performance information is provided by Korean firms, while Australian firms provided more quality performance and traditional cost control information (TCCI). We also investigated whether the interaction effects of advanced manufacturing technology (AMT) and information on the improvement of production performance were culturally different. According to the results, we suggest that with a high level of AMT, Korean firms require more types of information (i.e. quality performance information, flexibility performance information, financial performance information, advanced cost control information, and TCCI), while Australian firms generally demand flexibility performance, quality performance, and advanced cost control information.
Using a laboratory simulator in the teaching and study of chemical processes in estuarine systems
Authors: E. García-Luque, T. Ortega, J. M. Forja, A. Gómez-Parra
Venue: Computers Education (2004)

The teaching of Chemical Oceanography in the Faculty of Marine and Environmental Sciences of the University of Cáidiz (Spain) has been improved since 1994 by the employment of a device for the laboratory simulation of estuarine mixing processes and the characterisation of the chemical behaviour of many substances that pass through an estuary. The equipment comprising the simulator is controlled by a computer system running the program OLE (Oceanography and LEarning), which was developed originally as a research tool in Chemical Oceanography (under Windows® environment). Later, on the initiative of several teachers, the handling of the simulator was simplified to allow its use as a didactic resource for teaching the various processes that take place in littoral systems.Since its initial development, many different natural environmental conditions have been simulated, and the behaviour of many chemical pollutants has been studied. On the basis of this favourable experience, the simulator designed appears to be a versatile tool that can be usefully employed in both academic learning and research work.
ERC &#x2013; An object-oriented refinement calculus for Eiffel
Authors: Richard F. Paige, Jonathan S. Ostroff
Venue: Formal Aspects of Computing (2004)

We present a refinement calculus for transforming object-oriented (OO) specifications (or &#x2018;contracts&#x2019;) of classes into executable Eiffel programs. The calculus includes the usual collection of algorithmic refinement rules for assignments, if-statements, and loops. However, the calculus also deals with some of the specific challenges of OO, namely rules for introducing feature calls and reference types (involving aliasing). The refinement process is compositional in the sense that a class specification is refined to code based only on the specifications (not the implementations) of the classes that the specification depends upon. We discuss how automated support for such a process can be developed based on existing tools. This work is done in the context of a larger project involving methods for the seamless design of OO software in the graphical design notation BON (akin to UML). The goal is to maintain model and source code integrity, i.e., the software developer can work on either the model or the code, where (ideally) changes in one view are reflected instantaneously and automatically in all views.
Decompositions and Connectivity of Matching and Chessboard Complexes
Authors: Christos A. Athanasiadis
Venue: Discrete Computational Geometry (2004)

New lower bounds for the connectivity degree of the r-hypergraph matching and chessboard complexes are established by showing that certain skeleta of such complexes are vertex decomposable, in the sense of Provan and Billera, and hence shellable. The bounds given by Bj&#x00f6;rner et al. are improved for r \ge 3. Results on shellability of the chessboard complex due to Ziegler are reproven in the case r=2 and an affirmative answer to a question raised recently by Wachs for the matching complex follows. The new bounds are conjectured to be sharp.
Operator-scheduling using a constraint satisfaction technique in port container terminals
Authors: Kap Hwan Kim, Kyeong Woo Kim, Hark Hwang, Chang Seong Ko
Venue: Computers and Industrial Engineering (2004)

In port container terminals, the efficient scheduling of operators of handling equipment such as container cranes, yard cranes, and yard trucks is important. Because of many complicated constraints, finding a feasible solution, as opposed to the optimal solution, within a reasonable amount of computing time can be considered satisfactory from a practical point of view. The major constraints include the following: restrictions on the minimum workforce assignment to each time slot, the maximum total operating time per operator per shift, the minimum and maximum consecutive operating times for an operator, types of equipment that can be assigned to each operator, and the available time slots for each operator or piece of equipment. The operator-scheduling problem is defined as a constraint-satisfaction problem, and its solution is obtained by utilizing a commercial software. An actual problem, collected from a container terminal in Pusan, Korea, is solved through the solution procedure proposed in this study.
FP-tax: tree structure based generalized association rule mining
Authors: Iko Pramudiono, Masaru Kitsuregawa
Venue: Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery (2004)

Data mining has been widely recognized as a powerful tool to explore added value from large-scale databases. One of data mining techniques, generalized association rule mining with taxonomy, is potential to discover more useful knowledge than ordinary flat association rule mining by taking application specific information into account. We propose pattern growth mining paradigm based FP-tax algorithm, which employs a tree structure to compress the database. Two methods to traverse the tree structure are examined: Bottom-Up and Top-Down. Experimental results show that both methods significantly outperform classic Cumulate algorithm, in particular Top-Down FP-tax can achieve two order of magnitudes better performance than Cumulate.
Spatial Join for High-Resolution Objects
Authors: Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

Modern database applications including computer-aided design (CAD), medical imaging, molecular biology, or Multimedia Information Systems impose new requirementson efficient spatial query processing. One of themost common query types in Spatial Database ManagementSystems is the spatial join. In this paper, we investigate spatialjoin processing for two sets of very complex spatial objects.We present an approach that is based on a fast filterstep performing the spatial join on simple primitives whichconservatively approximate the objects. Our main attentionis focused on the problem how to generate approximationsadequate for high-resolution objects. In this paper, we introducegray approximations as a general concept whichhelps to range between replicating and non-replicating objectapproximations. The key idea of our approach is tobuild these replications based on statistical informationtaking the data distribution of the respective join-partnerrelation into account. Furthermore, our approach usescompression techniques for the effective storage and retrievalof the decomposed spatial objects. We demonstratethe benefits of our new method for the spatial intersectionjoin on high resolution data. The experimental evaluationon real-world test data points out that our new concept acceleratesthe spatial intersection join considerably.
The Consistency between the Attribute Relationships and Time-Serial Count Operators
Authors: Shao Hua, Chang Guiran, Zhao Hong
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

The attribute construction with count operator can improve the accuracy of the predictiongiven by a data-mining model, but unrestricted use of this method can cause inconsistencyproblem of attribute relationships. After proposing three rules for the relationships betweenattributes and the inconsistency problem of attribute relationships, time-serial count operator, anew algorithm for time-serial correlative model, is proposed, which can avert the inconsistencyproblem of attribute relationships. Time-serial increment count operator can remarkably reducethe computing cost of time-serial count operator by a small precision cost when someassumptions are satisfied. The result of trials proves the above conclusion.
HOURS: Achieving DoS Resilience in an Open Service Hierarchy
Authors: Hao Yang, Haiyun Luo, Yi Yang, Songwu Lu, Lixia Zhang
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Hierarchical systems have been widely used to providescalable distributed services in the Internet. Unfortunately,such a service hierarchy is vulnerable to DoS attacks. Thispaper presents HOURS that achieves DoS resilience in anopen service hierarchy. HOURS ensures high degree of serviceaccessibility for each surviving node by: 1) augmentingthe service hierarchy with hierarchical overlay networkswith rich connectivity; 2) making the connectivity of eachoverlay highly unpredictable; and 3) recovering the overlaywhen its normal operations are disrupted. We analyze anHOURS-protected open service hierarchy, and demonstrateits high degree of resilience to even large-scale, topology-awareDoS attacks.
Director's commentary for "Eternal Gaze"
Authors: Sam Chen
Venue: ACM SIGGRAPH 2003 video review on Electronic theater program on Electronic theater program - Volume 144 (2003)

Copyright held by creator. 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
Observations of the Current Change on Acupuncture Spots at the Meal Time
Authors: Soon-Yong Chun, Un-Ho Ji, H. Troy Nagle
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

One of major issues on oriental medicine is to clarify effects and substances of a vital energycalled as 'Qi(Ki)'. 'Qi(Ki)' is a flow of the vital energy which is channeled via Kyung-rak in thestructure of the human body. The oriental medicine says that when the flow of the vital energy is blocked, a health is lost. The oriental medicine recovers the health by controlling the flow of the vital energy with acupuncture.Spots responded to a disease is the Kyung-hyul on the Kyung-rak. The Kyung-rak is ameridian of a medical treatment by acupuncture. This study is intended to measure changes of the flow of the vital energy in connection with changes of current capacity through measuring the current change of the Kyung-hyul by impressing DC voltage. The change of the vital energy flow was indirectly expressed by measuring the changes of the body current on the physical change of the body before and after the meal among physical environmental changes. For it, an experiment was conducted for the above physical changes. As the result of the study, healthy persons showed a regular change of the body current pattern before and after the meal. On the other hand, the pattern of unhealthy person's current changes was very different from the pattern of health person's current changes.
Exploiting Multiple Paths to Express Scientific Queries
Authors: Zoe Lacroix, Tiffany Morris, Kaushal Parekh, Louiqa Raschid, Maria-Esther Vidal
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

The purpose of this demonstration is to present themain features of the BioNavigation system. Scientificdata collection needed in various stages of scientificdiscovery is typically performed manually. For eachscientific object of interest (e.g., a gene, a sequence),scientists query a succession of Web resourcesfollowing links between retrieved entries. Each of thesteps provides part of the intended characterization ofthe scientific object. This process is sometimespartially supported by hard-coded scripts or complexqueries that will be evaluated by a mediation-baseddata integration system or against a data warehouse.These approaches fail in guiding the scientists duringthe collection process. In contrast, the BioNavigationapproach presented in the paper provides the scientistswith information on the available alternativeresources, their provenance, and the costs of datacollection. The BioNavigation system enhances amediation-based integration system and providesscientists with support for the following:¿ To ask queries at a high conceptual level;¿ To visualize the multiple alternative resources thatmay be exploited to execute their data collection queries;¿ To choose the final execution path to evaluatetheir queries.
On a Representation of the Limit Occupational Measures Set of a Control System with Applications to Singularly Perturbed Control Systems
Authors: Vladimir Gaitsgory
Venue: SIAM Journal on Control and Optimization (2004)

A representation of the limit occupational measures set of a control system in terms of the vector function defining the system's dynamics is established. Applications in averaging of singularly perturbed control systems are demonstrated.
A Hybrid Approach to Nonlinear Macromodel Generation for Time-Varying Analog Circuits
Authors: Peng Li, Xin Li, Yang Xu, Lawrence T. Pileggi
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Modeling frequency-dependent nonlinear characteristics of complexanalog blocks and subsystems is critical for enabling efficientverification of mixed-signal system designs. Recent progress hasbeen made for constructing such macromodels, however, their accuracyand/or efficiency can break down for certain problems, particularlythose with high-Q filtering. In this paper we explore a novelhybrid approach for generating accurate analog macromodels fortime-varying weakly nonlinear circuits. The combined benefits ofnonlinear Padé approximations and pruning by exploitation of thesystem's internal structure allows us to construct nonlinear circuitmodels that are accurate for wide input frequency ranges, and therebycapable of modeling systems with sharp frequency selectivity.Such components are widely encountered in analog signal processingand RF applications. The efficacy of the proposed approach isdemonstrated by the modeling of large time-varying nonlinear circuitsthat are commonly found in these application areas.
An Exhaustive Genome Assembly Algorithm Using K-Mers to Indirectly Perform N-Squared Comparisons in O(N)
Authors: Maulik K. Shah, HoJoon Lee, Stephanie A. Rogers, Jeffrey W. Touchman
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

We present an algorithm that indirectly makes N² sequence comparisons in O(N) with respect to the size of the genome. This algorithm is very applicable in assembling whole genomes from the thousands of DNA sequence fragments that are generated in shotgun sequencing. First, we assume that fragments that share k-mers should overlap in the final assembly. We then catalog all k-mers that exist in the shotgun library and infer links between fragments that share k-mers. These links are then used to represent edges in a graph. This graph is generated in O(N) yet represents the result of comparing every fragment to every other fragment.
A Universal Well-Calibrated Algorithm for On-line Classification
Authors: Vladimir Vovk
Venue: The Journal of Machine Learning Research (2004)

We study the problem of on-line classification in which the prediction algorithm, for each "significance level" &delta;, is required to output as its prediction a range of labels (intuitively, those labels deemed compatible with the available data at the level &delta;) rather than just one label; as usual, the examples are assumed to be generated independently from the same probability distribution P. The prediction algorithm is said to be "well-calibrated" for P and &delta; if the long-run relative frequency of errors does not exceed &delta; almost surely w.r. to P. For well-calibrated algorithms we take the number of "uncertain" predictions (i.e., those containing more than one label) as the principal measure of predictive performance. The main result of this paper is the construction of a prediction algorithm which, for any (unknown) P and any &delta;: (a) makes errors independently and with probability &delta; at every trial (in particular, is well-calibrated for P and &delta;); (b) makes in the long run no more uncertain predictions than any other prediction algorithm that is well-calibrated for P and &delta;; (c) processes example n in time O(log n).
On the Importance of Small Coordinate Projections
Authors: Shahar Mendelson, Petra Philips
Venue: The Journal of Machine Learning Research (2004)

It has been recently shown that sharp generalization bounds can be obtained when the function class from which the algorithm chooses its hypotheses is "small" in the sense that the Rademacher averages of this function class are small. We show that a new more general principle guarantees good generalization bounds. The new principle requires that random coordinate projections of the function class evaluated on random samples are "small" with high probability and that the random class of functions allows symmetrization. As an example, we prove that this geometric property of the function class is exactly the reason why the two lately proposed frameworks, the <it>luckiness</it> (Shawe-Taylor et al., 1998) and the <it>algorithmic luckiness</it> (Herbrich and Williamson, 2002), can be used to establish generalization bounds.
The Interface between P and NP in Signed CNF Formulas
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

We first define a new class of signed CNF formulas and prove that its satisfiability problem is NP-complete. We then study in detail the interface between P and NP in two many-valued satisfiability problems: Mono+pPartiallySigned-2SAT and Regular+pSigned-2SAT. We show that such problems smoothly interpolate between P and NP by mixing together a polynomial and a NP-complete problem, and identify phase transition behavior in each of these problems.
Compiler-Based Register Name Adjustment for Low-Power Embedded Processors
Authors: Peter Petrov, Alex Orailoglu
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

We present an algorithm for compiler-driven register name adjustmentwith the main goal of power minimization on instruction fetchand register file access. In most instruction set architecture (ISA) designs,the register fields reside in fixed positions within the instructionencoding, hence forming streams of indices on the instruction bus andto the register file address decoder. The number of bit transitions inthese streams greatly determines the power consumption on the addressbus and the register file decoder. While general-purpose registersare semantically indistinguishable and hence interchangeable,the particular register indices do have a direct impact on power consumption.The algorithms presented in this paper address this powerminimization problem by reassigning/encoding the registers so thatthe bit transitions within the register index streams are minimized.
A Weighted Modified Due Date Rule for Sequencing to Minimize Weighted Tardiness
Authors: John J. Kanet, Xiaoming Li
Venue: Journal of Scheduling (2004)

Priority dispatching for minimizing job tardiness has been the subject of research investigation for several decades. Minimizing weighted tardiness however has considerably more practical relevance, but for this objective only a few dispatching rules have been advanced and scientifically compared. We introduce here a new rule, which we call &ldquo;Weighted Modified Due Date&rdquo; (WMDD) and test its effectiveness against other competing rules that have been developed for weighted tardiness. The test is accomplished via a simulation study of a simple queueing system and by static problem analysis. The WMDD rule is found to compare favorably to all the rules tested.
Executing Aperiodic Jobs in a Multiprocessor Constant-Bandwidth Server Implementation
Authors: Sanjoy Baruah, Giuseppe Lipari
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

The Constant Bandwidth Server (CBS) framework can be implemented on a preemptive uniprocessor platform to make full use of the computing capacity of the platforms; when implemented upon a preemptive multiprocessor platform, however, it is known that the schedulable utilization is strictly less than the capacity of the platform. The issue of using the excess processing capacity is addressed here, and an algorithm is presented, and proven correct, that uses this excess capacity to provide guaranteed real-time service to aperiodic jobs.
A Semantic Classification Model for E-Catalogs
Authors: Dongkyu Kim, Sang-goo Lee, Jonghoon Chun, Juhnyoung Lee
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

Electronic catalogs (or e-catalogs) hold information about the goods and services offered or requested by the participants, and consequently, form the basis of an e-commerce transaction. Catalog management is complicated by a number of factors and product classification is at the core of these issues. Classification hierarchy is used for spend analysis, customs regulation, and product identification. Classification is the foundation on which product databases are designed, and plays a central role in almost all aspects of management and use of product information. However, product classification has received little formal treatment in terms of underlying model, operations, and semantics. We believe that the lack of a logical model for classification introduces a number of problems not only for the classification itself but also for the product database in general. In this paper, we try to understand what it means to classify products and present how best to represent classification schemes so as to capture the semantics behind the classifications and facilitate mappings between them. We believe the model proposed in this paper satisfies the requirements and challenges that have been raised by previous works